%%% -*-BibTeX-*-
%%% /u/sy/beebe/tex/bib/master.bib, Thu Nov 11 09:16:24 1993
%%% Edit by Nelson H. F. Beebe <beebe at plot79.math.utah.edu>
%%% ====================================================================
%%% BibTeX-file{
%%%     author          = "Nelson H. F. Beebe",
%%%     version         = "4.93",
%%%     date            = "18 February 2026",
%%%     time            = "06:22:03 MDT",
%%%     filename        = "master.bib",
%%%     address         = "University of Utah
%%%                        Department of Mathematics, 110 LCB
%%%                        155 S 1400 E RM 233
%%%                        Salt Lake City, UT 84112-0090
%%%                        USA",
%%%     telephone       = "+1 801 581 5254",
%%%     URL             = "https://www.math.utah.edu/~beebe",
%%%     checksum        = "19211 123580 641064 5918327",
%%%     email           = "beebe at math.utah.edu, beebe at acm.org,
%%%                        beebe at computer.org (Internet)",
%%%     codetable       = "ISO/ASCII",
%%%     keywords        = "bibliography; BibTeX",
%%%     license         = "public domain",
%%%     supported       = "yes",
%%%     docstring       = "BibTeX bibliography for NHFB's personal
%%%                        collection of books and miscellaneous
%%%                        references.
%%%
%%%                        At version 4.93, the year coverage looked
%%%                        like this:
%%%
%%%                             1837 (   1)    1900 (   0)    1963 (   9)
%%%                             1838 (   0)    1901 (   0)    1964 (  16)
%%%                             1839 (   0)    1902 (   0)    1965 (  13)
%%%                             1840 (   0)    1903 (   0)    1966 (  12)
%%%                             1841 (   0)    1904 (   0)    1967 (   3)
%%%                             1842 (   0)    1905 (   0)    1968 (   9)
%%%                             1843 (   0)    1906 (   0)    1969 (   9)
%%%                             1844 (   0)    1907 (   0)    1970 (   5)
%%%                             1845 (   0)    1908 (   0)    1971 (  10)
%%%                             1846 (   0)    1909 (   1)    1972 (   9)
%%%                             1847 (   0)    1910 (   1)    1973 (  10)
%%%                             1848 (   0)    1911 (   0)    1974 (  19)
%%%                             1849 (   0)    1912 (   0)    1975 (   9)
%%%                             1850 (   0)    1913 (   0)    1976 (  23)
%%%                             1851 (   0)    1914 (   0)    1977 (  19)
%%%                             1852 (   0)    1915 (   1)    1978 (  24)
%%%                             1853 (   0)    1916 (   0)    1979 (  25)
%%%                             1854 (   1)    1917 (   0)    1980 (  17)
%%%                             1855 (   0)    1918 (   0)    1981 (  29)
%%%                             1856 (   0)    1919 (   0)    1982 (  30)
%%%                             1857 (   0)    1920 (   0)    1983 (  37)
%%%                             1858 (   0)    1921 (   0)    1984 (  39)
%%%                             1859 (   0)    1922 (   0)    1985 (  44)
%%%                             1860 (   0)    1923 (   1)    1986 (  55)
%%%                             1861 (   0)    1924 (   0)    1987 (  67)
%%%                             1862 (   0)    1925 (   2)    1988 (  75)
%%%                             1863 (   0)    1926 (   0)    1989 (  60)
%%%                             1864 (   0)    1927 (   0)    1990 (  88)
%%%                             1865 (   0)    1928 (   0)    1991 (  63)
%%%                             1866 (   0)    1929 (   0)    1992 (  69)
%%%                             1867 (   0)    1930 (   0)    1993 (  57)
%%%                             1868 (   0)    1931 (   0)    1994 (  51)
%%%                             1869 (   0)    1932 (   0)    1995 (  37)
%%%                             1870 (   0)    1933 (   3)    1996 (  49)
%%%                             1871 (   0)    1934 (   0)    1997 (  56)
%%%                             1872 (   0)    1935 (   2)    1998 (  50)
%%%                             1873 (   0)    1936 (   2)    1999 (  64)
%%%                             1874 (   0)    1937 (   1)    2000 (  47)
%%%                             1875 (   0)    1938 (   2)    2001 (  36)
%%%                             1876 (   0)    1939 (   1)    2002 (  30)
%%%                             1877 (   0)    1940 (   4)    2003 (  54)
%%%                             1878 (   0)    1941 (   0)    2004 (  44)
%%%                             1879 (   0)    1942 (   3)    2005 (  53)
%%%                             1880 (   0)    1943 (   0)    2006 (  42)
%%%                             1881 (   0)    1944 (   0)    2007 (  46)
%%%                             1882 (   0)    1945 (   3)    2008 (  45)
%%%                             1883 (   0)    1946 (   6)    2009 (  32)
%%%                             1884 (   0)    1947 (   2)    2010 (  36)
%%%                             1885 (   0)    1948 (   4)    2011 (  38)
%%%                             1886 (   0)    1949 (   3)    2012 (  22)
%%%                             1887 (   0)    1950 (   3)    2013 (  17)
%%%                             1888 (   0)    1951 (   1)    2014 (  29)
%%%                             1889 (   0)    1952 (   7)    2015 (  23)
%%%                             1890 (   0)    1953 (   1)    2016 (  20)
%%%                             1891 (   0)    1954 (   1)    2017 (  18)
%%%                             1892 (   0)    1955 (   2)    2018 (  30)
%%%                             1893 (   0)    1956 (   2)    2019 (  29)
%%%                             1894 (   0)    1957 (   1)    2020 (  13)
%%%                             1895 (   0)    1958 (   5)    2021 (   9)
%%%                             1896 (   0)    1959 (   2)    2022 (   5)
%%%                             1897 (   0)    1960 (   7)    2023 (   6)
%%%                             1898 (   0)    1961 (   7)    2024 (   5)
%%%                             1899 (   0)    1962 (  10)    2025 (   5)
%%%                             19xx (   1)
%%%
%%%                             Article:        108
%%%                             Book:          1849
%%%                             InCollection:    11
%%%                             InProceedings:   10
%%%                             Manual:          29
%%%                             Misc:            19
%%%                             Periodical:       1
%%%                             PhdThesis:        4
%%%                             Proceedings:     20
%%%                             TechReport:      47
%%%                             Unpublished:      1
%%%
%%%                             Total entries: 2099
%%%
%%%                        In the original label scheme, citation tags
%%%                        were chosen as "FirstAuthor:key-phrase", with
%%%                        the FirstAuthor capitalized (all caps if an
%%%                        acronym), and the key-phrase a (possibly
%%%                        hyphenated) phrase in lower case taken from
%%%                        the title.  Normally, the key-phrase should
%%%                        be constructed from the initial letters of
%%%                        the first three capitalized names in the
%%%                        title, ignoring articles and prepositions,
%%%                        followed by the last two digits of the year
%%%                        of publication. That system was later
%%%                        replaced by one in which the year is given as
%%%                        a four-digit value between colons separating
%%%                        the author and key-phrase, as in
%%%                        Abrahams:1997:UIC.
%%%
%%%                        At version 4.00 [13-Feb-2019], citation
%%%                        labels of all but about 50 entries (mostly
%%%                        corporate authored) were converted to the new
%%%                        scheme.  In preparation for version 4.00,
%%%                        tableofcontents, and sometimes,
%%%                        shorttableofcontents, values have been added
%%%                        to most book-like entries: about 80 percent
%%%                        of them now have such data.  In many cases,
%%%                        where such data were found in library
%%%                        catalogs, chapter and page numbers, and
%%%                        sectional titles, are absent.  In numerous
%%%                        cases, the availability of contents
%%%                        information has identified publications that
%%%                        have subsequently been recorded in other
%%%                        author- and subject-specific bibliographies.
%%%
%%%                        Internet addresses and filenames should be
%%%                        entered with the \path macro, for example,
%%%                        \path|rms at prep.ai.mit.edu|.
%%%
%%%                        Oren Patashnik recommends against using
%%%                        ties (~) ANYWHERE in the bibliography;
%%%                        BibTeX puts them in where needed.
%%%
%%%                        Journals should always be named using a
%%%                        string definition of the form j-XYZ.
%%%
%%%                        Publishers should similarly be named with a
%%%                        string definition of the form pub-XYZ, and
%%%                        their addresses in the form pub-XYZ:adr.
%%%
%%%                        Built-in BibTeX journal names should be
%%%                        avoided.
%%%
%%%                        The checksum field above contains a CRC-16
%%%                        checksum as the first value, followed by the
%%%                        equivalent of the standard UNIX wc (word
%%%                        count) utility output of lines, words, and
%%%                        characters.  This is produced by Robert
%%%                        Solovay's checksum utility."
%%%     }
%%% ====================================================================

%%% The handy \path macro provided by path.sty allows |prep.ai.mit.edu|
%%% to (1) be set in typewriter text, and (2) get automatically
%%% inserted \penalty0 to make linebreaks at punctuation.  It can be
%%% used for e-mail addresses and UNIX filenames, and otherwise, works
%%% just like the LaTeX \verb macro.
%%%
%%% TeX normally will not hyphenate words connected by a dash, and will
%%% normally allow a line break only after such a dash, not before.
%%% However, style guides show examples of the em dash starting a line,
%%% so a break before is probably okay.

@Preamble{"\input bibnames.sty "
 # "\input path.sty "
 # "\hyphenation{
                Kath-ryn
                Ker-n-i-ghan
                Krom-mes
                Lar-ra-bee
                Mi-cro-com-puters
                Mi-cro-pro-ces-sors
                Mo-tif
                Pat-rick
                Port-able
                Post-Script
                Pren-tice
                Prin-ci-ples
                Pro-gram-ming
                Rich-ard
                Richt-er
                Ro-bert
                Semi-nu-mer-i-cal
                Sha-mos
                Spring-er
                The-o-dore
                Uz-ga-lis
                }" #
    "\ifx \undefined \bioname   \def \bioname#1{{{\em #1\/}}} \fi" #
    "\ifx \undefined \booktitle \def \booktitle#1{{{\em #1}}} \fi" #
    "\ifx \undefined \eth       \def \eth{d} \fi"
}

%%% ====================================================================
%%% Acknowledgement abbreviations:

@String{ack-bkph = "Berthold K. P. Horn,
                    e-mail: \path|bkph@ai.mit.edu|"}

@String{ack-bnb = "Barbara N. Beeton,
                   e-mail: \path|bnb@tug.org|"}

@String{ack-fm  =   "Frank Mittelbach,
                    e-mail: \path|mittelbach@mzdmza.zdv.uni-mainz.de|"}

@String{ack-jpl =   "Jeff Lankford,
                    e-mail: \path|jpl@nrtc.northrop.com|"}

@String{ack-mz = "Mona Zeftel,
                  Addison-Wesley Publishing Company,
                  Reading, MA, USA,
                  e-mail: \path|crw@wjh12.harvard.edu|"}

@String{ack-nhfb = "Nelson H. F. Beebe,
                    University of Utah,
                    Department of Mathematics, 110 LCB,
                    155 S 1400 E RM 233,
                    Salt Lake City, UT 84112-0090, USA,
                    Tel: +1 801 581 5254,
                    e-mail: \path|beebe@math.utah.edu|,
                            \path|beebe@acm.org|,
                            \path|beebe@computer.org| (Internet),
                    URL: \path|https://www.math.utah.edu/~beebe/|"}

@String{ack-nj =  "Norbert Juffa,
                  2445 Mission College Blvd.
                  Santa Clara, CA 95054
                  USA
                  email: \path=norbert@iit.com="}

@String{ack-njh =   "Nick Higham,
                    e-mail: \path|higham@vtx.ma.man.ac.uk|"}

%%% ====================================================================
%%% Institution abbreviations:

@String{inst-INST-ADV-STUDY     = "Institute for Advanced Study"}
@String{inst-INST-ADV-STUDY:adr = "Princeton, NJ, USA"}

@String{inst-STAN-CS            = "Stanford University, Department of
                                  Computer Science"}
@String{inst-STAN-CS:adr        = "Stanford, CA, USA"}

%%% ====================================================================
%%% Journal abbreviations:

@String{j-ANN-MATH              = "Annals of Mathematics"}

@String{j-BELL-LABS-RECORD      = "Bell Laboratories Record"}

@String{j-BELL-SYST-TECH-J      = "The Bell System Technical Journal"}

@String{j-CACM                  = "Communications of the Association
                                  for Computing Machinery"}

@String{j-CBM                   = "Computers in Biology and Medicine"}

@String{j-CGIP                  = "Computer Graphics and Image Processing"}

@String{j-CJ                    = "The Computer Journal"}

@String{j-COMP-LANG-MAG         = "Computer Language Magazine"}

@String{j-COMP-SURV             = "ACM Computing Surveys"}

@String{j-COMPCON-SPRING89      = "Digest of Papers of {COMPCON} Spring '89"}

@String{j-COMPUTER              = "Computer"}

@String{j-CS                    = "Computing Surveys"}

@String{j-DDJ                   = "Dr. Dobb's Journal"}

@String{j-GUTENBERG             = "Cahiers GUTenberg"}

@String{j-IBM-JRD               = "IBM J. Res. Develop."}

@String{j-IEEE-MICRO            = "IEEE Micro"}

@String{j-IEEE-SPECTRUM         = "IEEE Spectrum"}

@String{j-IJSAHPC               = "International Journal of
                                  Supercomputer Applications and High
                                  Performance Computing"}

@String{j-J-INST-ACTUARIES      = "Journal of the Institute of Actuaries"}

@String{j-J-MATH-PHYS-MIT       = "Journal of mathematics and physics /
                                  Massachusetts Institute of Technology"}

@String{j-MATH-COMPUT           = "Mathematics of Computation"}

@String{j-MATH-INTEL            = "The Mathematical Intelligencer"}

@String{j-MATH-TABLES-OTHER-AIDS-COMPUT = "Mathematical Tables and Other Aids
                                  to Computation"}

@String{j-MICROPROC-REP         = "Microprocessor report"}

@String{j-MONTHLY-NOT-ROY-ASTRON-SOC = "Monthly Notices of the Royal
                                  Astronomical Society"}

@String{j-NAMS                  = "Notices of the American Mathematical
                                  Society"}

@String{j-NATURE                = "Nature"}

@String{j-NEW-SCIENTIST         = "New Scientist"}

@String{j-PROC-NATL-ACAD-SCI-USA = "Proceedings of the National Academy of
                                  Sciences of the United States of America"}

@String{j-PROC-SID              = "Proceedings of the Society for
                                  Information Display"}

@String{j-REV-GEN-SCI-PURES-APPL = "Revue G{\'e}n{\'e}rale des Sciences Pures
                                  et Appliqu{\'e}es"}

@String{j-SA                    = "Scientific American"}

@String{j-SCI-MONTHLY           = "The Scientific Monthly"}

@String{j-SCI-PROC-ROY-DUBLIN-SOC = "Scientific proceedings of the Royal Dublin
                                  Society"}

@String{j-SIAM-J-COMPUT         = "SIAM Journal on Computing"}

@String{j-SIGGRAPH              = "ACM SIG{\-}GRAPH\emdash
                                  Com{\-}puter Graphics"}

@String{j-SIGPLAN               = "ACM SIG{\-}PLAN Notices"}

@String{j-SPE                   = "Soft{\-}ware\emdash Prac{\-}tice
                                  and Experience"}

@String{j-SR                    = "Supercomputing Review"}

@String{j-SUNEXPERT             = "SunExpert"}

@String{j-TEXHAX                = "{\TeX{}{\-}hax}"}

@String{j-TEXNIQUES             = "{\TeX}niques"}

@String{j-TOG                   = "ACM Transactions on Graphics"}

@String{j-USENIX-SCP            = "{USENIX} Summer Conference Proceedings"}

%%% ====================================================================
%%% Publishers and their addresses:

@String{pub-A-K-PETERS          = "A. K. Peters, Ltd."}
@String{pub-A-K-PETERS:adr      = "Wellesley, MA, USA"}

@String{pub-ACADEMIC            = "Academic Press"}
@String{pub-ACADEMIC:adr        = "New York, NY, USA"}

@String{pub-ACM                 = "ACM Press"}
@String{pub-ACM:adr             = "New York, NY 10036, USA"}

@String{pub-ACS                 = "American Chemical Society"}
@String{pub-ACS:adr             = "Washington, DC, USA"}

@String{pub-ADAM-HILGER         = "Adam Hilger Ltd."}
@String{pub-ADAM-HILGER:adr     = "Bristol, UK"}

@String{pub-ADOBE               = "{Adobe Systems Incorporated}"}

@String{pub-ADOBE-PRESS         = "Adobe Press"}
@String{pub-ADOBE-PRESS:adr     = "Mountain View, CA, USA"}
@String{pub-ADOBE:adr           = "1585 Charleston Road, P.~O. Box
                                  7900, Mountain View, CA 94039-7900,
                                  USA, Tel: (415) 961-4400"}

@String{pub-AFIPS               = "AFIPS Press"}
@String{pub-AFIPS:adr           = "Montvale, NJ, USA"}

@String{pub-AIP                 = "American Institute of Physics"}
@String{pub-AIP:adr             = "Woodbury, NY, USA"}

@String{pub-ALLYN-BACON         = "Allyn and Bacon"}
@String{pub-ALLYN-BACON:adr     = "Boston, MA, USA"}

@String{pub-AMS                 = "American Mathematical Society"}
@String{pub-AMS:adr             = "Providence, RI, USA"}

@String{pub-ANCHOR-BOOKS        = "Anchor Books"}
@String{pub-ANCHOR-BOOKS:adr    = "New York, NY, USA"}

@String{pub-ANL                 = "Argonne National Laboratory"}
@String{pub-ANL:adr             = "Argonne, IL, USA"}

@String{pub-ANSI                = "American National Standards Institute"}
@String{pub-ANSI:adr            = "1430 Broadway, New York, NY 10018, USA"}

@String{pub-AP-PROFESSIONAL     = "AP Professional"}
@String{pub-AP-PROFESSIONAL:adr = "Boston, MA, USA"}

@String{pub-APRESS              = "Apress"}
@String{pub-APRESS:adr          = "Berkeley, CA, USA"}

@String{pub-ATT-BELL            = "AT\&T Bell Laboratories"}
@String{pub-ATT-BELL:adr        = "Murray Hill, NJ 07974, USA"}

@String{pub-AW                  = "Ad{\-d}i{\-s}on-Wes{\-l}ey"}
@String{pub-AW:adr              = "Reading, MA, USA"}

@String{pub-AW-LONGMAN          = "Ad{\-d}i{\-s}on-Wes{\-l}ey Longman"}
@String{pub-AW-LONGMAN:adr      = "Harlow, Essex CM20 2JE, England"}

@String{pub-AWE                 = "Ad{\-}di{\-}son-Wes{\-}ley Europe"}
@String{pub-AWE:adr             = "Amsterdam, The Netherlands"}

@String{pub-AWV                 = "Ad{\-}di{\-}son-Wes{\-}ley Verlag"}
@String{pub-AWV:adr             = "Bonn, Germany"}

@String{pub-BANTAM              = "Bantam Books"}
@String{pub-BANTAM:adr          = "New York, NY, USA"}

@String{pub-BARNES-NOBLE        = "Barnes and Noble"}
@String{pub-BARNES-NOBLE:adr    = "New York, NY, USA"}

@String{pub-BASIC-BOOKS         = "Basic Books"}
@String{pub-BASIC-BOOKS:adr     = "New York, NY, USA"}

@String{pub-BELKNAP             = "Belknap Press of Harvard University Press"}
@String{pub-BELKNAP:adr         = "Cambridge, MA and London, UK"}

@String{pub-BENCUM              = "Benjamin/Cummings Pub. Co."}
@String{pub-BENCUM:adr          = "Redwood City, CA, USA"}

@String{pub-BENJAMIN            = "W. A. {Benjamin, Inc.}"}
@String{pub-BENJAMIN:adr        = "New York, NY, USA"}

@String{pub-BERKLEY-BOOKS       = "Berkley Books"}
@String{pub-BERKLEY-BOOKS:adr   = "New York, NY, USA"}

@String{pub-BIRKHAUSER          = "Birkh{\"{a}}user"}
@String{pub-BIRKHAUSER:adr      = "Cambridge, MA, USA; Berlin, Germany; Basel,
                                  Switzerland"}

@String{pub-BIRKHAUSER-BOSTON   = "Birkh{\"a}user Boston Inc."}
@String{pub-BIRKHAUSER-BOSTON:adr = "Cambridge, MA, USA"}

@String{pub-BOWKER              = "R. R. Bowker Company"}
@String{pub-BOWKER:adr          = "1180 Avenue of the Americas, New
                                  York, NY 10036, USA"}

@String{pub-BRADY               = "Robert J. Brady Co."}
@String{pub-BRADY:adr           = "Bowie, MD 20715, USA"}

@String{pub-BROOKS-COLE         = "Brooks\slash Cole"}
@String{pub-BROOKS-COLE:adr     = "Pacific Grove, CA, USA"}

@String{pub-CAMBRIDGE           = "Cambridge University Press"}
@String{pub-CAMBRIDGE:adr       = "Cambridge, UK"}

@String{pub-CBI                 = "Contemporary Books, Inc."}
@String{pub-CBI:adr             = "180 North Michigan Avenue, Chicago,
                                  IL 60601, USA"}

@String{pub-CBM                 = "CBM Books"}
@String{pub-CBM:adr             = "A Division of Cardinal Business
                                  Media Inc., 101 Witmer Road,
                                  Horsham, PA 19044, USA"}

@String{pub-CHAPMAN-HALL        = "Chapman and Hall, Ltd."}
@String{pub-CHAPMAN-HALL:adr    = "London, UK"}

@String{pub-CHARTWELL           = "Chartwell Books, Inc."}
@String{pub-CHARTWELL:adr       = "110 Enterprise Avenue, Secaucus, NJ
                                  07094, USA"}

@String{pub-CIAOCO              = "{\'E}ditions Ciaoco"}
@String{pub-CIAOCO:adr          = "Artel, Bruxelles, Belgium"}

@String{pub-CIPS                = "Canadian Information Processing Society"}
@String{pub-CIPS:adr            = "243 College St, 5th Floor, Toronto,
                                  Ontario M5T~2Y1, Canada"}

@String{pub-CLARENDON           = "Clarendon Press"}
@String{pub-CLARENDON:adr       = "Oxford, UK"}

@String{pub-CLSC                = "College of Science Computer"}
@String{pub-CLSC:adr            = "Department of Physics, University
                                  of Utah, Salt Lake City, UT 84112,
                                  USA"}

@String{pub-COLLIER             = "Collier Books, Macmillan Publishing
                                  Company"}
@String{pub-COLLIER:adr         = "New York, NY, USA"}

@String{pub-COLLIER-MACMILLAN   = "Collier Macmillan Canada"}
@String{pub-COLLIER-MACMILLAN:adr = "Toronto, Ontario, Canada"}

@String{pub-COLUMBIA            = "Columbia University Press"}
@String{pub-COLUMBIA:adr        = "New York, NY, USA"}

@String{pub-COPERNICUS          = "Copernicus (a division of Springer-Verlag
                                  New York, Inc.)"}
@String{pub-COPERNICUS:adr      = "175 Fifth Avenue, New York, NY 10010, USA"}

@String{pub-CORIOLIS            = "Coriolis Group Books"}
@String{pub-CORIOLIS:adr        = "Scottsdale, AZ, USA"}

@String{pub-CRC                 = "CRC Press"}
@String{pub-CRC:adr             = "2000 N.W. Corporate Blvd., Boca Raton,
                                  FL 33431-9868, USA"}

@String{pub-CROWN               = "Crown Publishers"}
@String{pub-CROWN:adr           = "New York, NY, USA"}

@String{pub-CSLI                = "CSLI Publications"}
@String{pub-CSLI:adr            = "Stanford, CA, USA"}

@String{pub-CSP                 = "Computer Science Press"}
@String{pub-CSP:adr             = "11 Taft Court, Rockville, MD 20850, USA"}

@String{pub-CWI                 = "Centrum voor Wiskunde en Informatica"}
@String{pub-CWI:adr             = "P. O. Box 4079, 1009 AB Amsterdam,
                                  The Netherlands"}

@String{pub-DOUBLEDAY           = "Doubleday"}
@String{pub-DOUBLEDAY:adr       = "New York, NY, USA"}

@String{pub-DOVER               = "Dover"}
@String{pub-DOVER:adr           = "New York, NY, USA"}

@String{pub-DP                  = "Digital Press"}
@String{pub-DP:adr              = "12 Crosby Drive, Bedford, MA 01730, USA"}

@String{pub-DPUNKT-VERLAG       = "dpunkt-Verlag"}
@String{pub-DPUNKT-VERLAG:adr   = "Heidelberg, Germany"}

@String{pub-DUNOD               = "Dunod"}
@String{pub-DUNOD:adr           = "Paris, France"}

@String{pub-ELLIS-HORWOOD       = "Ellis Horwood"}
@String{pub-ELLIS-HORWOOD:adr   = "New York, NY, USA"}

@String{pub-ELSEVIER            = "Elsevier"}
@String{pub-ELSEVIER:adr        = "Amsterdam, The Netherlands"}

@String{pub-ELSEVIER-ACADEMIC   = "Elsevier Academic Press"}
@String{pub-ELSEVIER-ACADEMIC:adr = "Amsterdam, The Netherlands"}

@String{pub-ELSEVIER-MORGAN-KAUFMANN = "Elsevier\slash Morgan Kaufmann"}
@String{pub-ELSEVIER-MORGAN-KAUFMANN:adr = "San Francisco, CA, USA"}

@String{pub-FABER-FABER         = "Faber and Faber"}
@String{pub-FABER-FABER:adr     = "London, UK"}

@String{pub-FARRAR              = "Farrar, Strauss, and Giroux"}
@String{pub-FARRAR:adr          = "New York, NY, USA"}

@String{pub-FAWCETT             = "Fawcett Columbine"}
@String{pub-FAWCETT:adr         = "New York, NY, USA"}

@String{pub-FSF                 = "{Free Software Foundation, Inc.}"}
@String{pub-FSF:adr             = "51 Franklin Street, Fifth Floor, Boston,
                                  MA 02110-1301, USA, Tel: (617) 876-3296"}

@String{pub-GODINE              = "David R. Godine, Publisher"}
@String{pub-GODINE:adr          = "Boston, MA, USA"}

@String{pub-GRAPHICS-PRESS      = "Graphics Press"}
@String{pub-GRAPHICS-PRESS:adr  = "Box 430, Cheshire, CT 06410, USA"}

@String{pub-GRAPHICCOMM         = "Graphic Communications Association"}
@String{pub-GRAPHICCOMM:adr     = "100 Daingerfield Road, Alexandria,
                                  VA 22314-2804, USA"}

@String{pub-HALSTED             = "Halsted Press"}
@String{pub-HALSTED:adr         = "New York, USA"}

@String{pub-HARPERCOLLINS       = "HarperCollins College Publishers"}
@String{pub-HARPERCOLLINS:adr   = "New York, NY, USA"}

@String{pub-HARPER-ROW          = "Harper \& Row"}
@String{pub-HARPER-ROW:adr      = "New York, NY, USA"}

@String{pub-HARTLEY-MARKS       = "Hartley \& Marks Publishers"}
@String{pub-HARTLEY-MARKS:adr   = "Point Roberts, WA, USA and Vancouver, BC,
                                  Canada"}

@String{pub-HARVARD             = "Harvard University Press"}
@String{pub-HARVARD:adr         = "Cambridge, MA, USA"}

@String{pub-HAYDEN              = "Hayden Books"}
@String{pub-HAYDEN:adr          = "4300 West 62nd Street,
                                  Indianapolis, IN 46268, USA"}

@String{pub-HAYDEN-BOOK         = "Hayden Book Co."}
@String{pub-HAYDEN-BOOK:adr     = "Rochelle Park, NJ, USA"}

@String{pub-HBJ                 = "Harcourt Brace Jovanovich"}
@String{pub-HBJ:adr             = "Boston, MA, USA"}

@String{pub-HEINZ-HEISE         = "Verlag Heinz Heise"}
@String{pub-HEINZ-HEISE:adr     = "Helsdorfer Stra{\ss}e 7, D-30625, Hannover,
                                  Germany"}

@String{pub-HENRY-HOLT         = "Henry Holt and Company"}
@String{pub-HENRY-HOLT:adr     = "New York, NY, USA"}

@String{pub-HOUGHTON-MIFFLIN   = "Houghton-Mifflin"}
@String{pub-HOUGHTON-MIFFLIN:adr = "Boston, MA, USA"}

@String{pub-HRW                 = "Holt, Rinehart, and Winston"}
@String{pub-HRW:adr             = "New York, NY, USA"}

@String{pub-HWS                 = "Howard W. Sams"}
@String{pub-HWS:adr             = "Indianapolis, IN 46268, USA"}

@String{pub-IBM                 = "IBM Corporation"}
@String{pub-IBM:adr             = "San Jose, CA, USA"}

@String{pub-IBM-REDBOOKS        = "IBM Redbooks"}
@String{pub-IBM-REDBOOKS:adr    = "11400 Burnet Road, Austin, TX 78758-3493,
                                   USA"}

@String{pub-IE                  = "InterEditions"}
@String{pub-IE:adr              = "Paris, France"}

@String{pub-IEEE                = "IEEE Computer Society Press"}
@String{pub-IEEE:adr            = "1109 Spring Street, Suite 300,
                                  Silver Spring, MD 20910, USA"}

@String{pub-INTEL               = "Intel Corporation"}
@String{pub-INTEL:adr           = "Santa Clara, CA, USA"}

@String{pub-INTERSCIENCE        = "Interscience Publishers"}
@String{pub-INTERSCIENCE:adr    = "New York, NY, USA"}

@String{pub-IOP                 = "Institute of Physics Publishing"}
@String{pub-IOP:adr             = "Bristol, UK and Philadelphia, PA, USA"}

@String{pub-IOS                 = "IOS Press"}
@String{pub-IOS:adr             = "Postal Drawer 10558, Burke, VA
                                  2209-0558, USA"}

@String{pub-ISO                 = "International Organization for
                                  Standardization"}
@String{pub-ISO:adr             = "Geneva, Switzerland"}

@String{pub-ITCP                = "International Thomson Computer Press"}
@String{pub-ITCP:adr            = "20 Park Plaza Suite 1001, Boston,
                                  MA 02116 USA"}

@String{pub-JOHNS-HOPKINS       = "The Johns Hopkins University Press"}
@String{pub-JOHNS-HOPKINS:adr   = "Baltimore, MD, USA"}

@String{pub-JOSEPH-HENRY        = "Joseph Henry Press"}
@String{pub-JOSEPH-HENRY:adr    = "Washington, DC, USA"}

@String{pub-JPL                 = "Jet Propulsion Laboratory"}
@String{pub-JPL:adr             = "Pasadena, CA, USA"}

@String{pub-JSA                 = "Japanese Standards Association"}
@String{pub-JSA:adr             = "1-24, Akasaka 4 Chome, Minato-ku,
                                  Tokyo, 107 Japan"}

@String{pub-KAPP                = "Kluwer Academic\slash Plenum Publishers"}
@String{pub-KAPP:adr            = "New York, Boston, Dordrecht, London, Moscow"}

@String{pub-KLUWER              = "Kluwer Academic Publishers Group"}
@String{pub-KLUWER:adr          = "Norwell, MA, USA, and Dordrecht,
                                  The Netherlands"}

@String{pub-KNOPF               = "Alfred A. Knopf"}
@String{pub-KNOPF:adr           = "New York, NY, USA"}

@String{pub-LITTLE-BROWN        = "Little, Brown and Company"}
@String{pub-LITTLE-BROWN:adr    = "Boston, Toronto, London"}

@String{pub-LOS-ALAMOS-HISTORICAL-SOCIETY = "Los Alamos Historical Society"}
@String{pub-LOS-ALAMOS-HISTORICAL-SOCIETY:adr = "Los Alamos, NM, USA"}

@String{pub-MAA                 = "Mathematical Association of America"}
@String{pub-MAA:adr             = "Washington, DC, USA"}

@String{pub-MACMILLAN           = "Macmillan Publishing Company"}
@String{pub-MACMILLAN:adr       = "New York, NY, USA"}

@String{pub-MACMILLAN-EDUCATION = "Macmillan Education Ltd."}
@String{pub-MACMILLAN-EDUCATION:adr = "Houndmills, Basingstoke, Hampshire
                                  RG21 2XS, UK"}

@String{pub-MANNING             = "Manning Publications"}
@String{pub-MANNING:adr         = "Greenwich, CT, USA"}

@String{pub-MAPLESOFT           = "Maplesoft"}
@String{pub-MAPLESOFT:adr       = "Waterloo, ON, Canada N2L 6C2"}

@String{pub-MASARYKOVA          = "Masarykova Universita"}
@String{pub-MASARYKOVA:adr      = "Brno, Czechoslovakia"}

@String{pub-MCGRAW-HILL         = "Mc{\-}Graw-Hill"}
@String{pub-MCGRAW-HILL:adr     = "New York, NY, USA"}

@String{pub-MEGATEK             = "Megatek Corporation"}
@String{pub-MEGATEK:adr         = "9645 Scranton Rd, San Diego, CA 92121, USA"}

@String{pub-MICROSOFT           = "Microsoft Press"}
@String{pub-MICROSOFT:adr       = "Bellevue, WA, USA"}

@String{pub-MIS                 = "MIS Press"}
@String{pub-MIS:adr             = "P. O. Box 5277, Portland, OR
                                  97208-5277, USA, Tel: (503)
                                  282-5215"}

@String{pub-MIT                 = "MIT Press"}
@String{pub-MIT:adr             = "Cambridge, MA, USA"}

@String{pub-MORGAN-KAUFMANN     = "Morgan Kaufmann Publishers"}
@String{pub-MORGAN-KAUFMANN:adr = "Los Altos, CA 94022, USA"}
@String{pub-MORGAN-KAUFMANN:adrnew = "2929 Campus Drive, Suite 260, San
                                  Mateo, CA 94403, USA"}
@String{pub-MORGAN-KAUFMANN:adrsf = "San Francisco, CA, USA"}
@String{pub-MORGAN-KAUFMANN:adrbo = "Boston, MA, USA"}

@String{pub-MORGAN-KAUFMANN-ELSEVIER = "Morgan Kaufmann\slash Elsevier"}
@String{pub-MORGAN-KAUFMANN-ELSEVIER:adr = "Waltham, MA, USA"}

@String{pub-MLAA                = "Modern Language Association of America"}
@String{pub-MLAA:adr            = "New York, NY, USA"}

@String{pub-MORROW              = "William Morrow and Company, Inc."}
@String{pub-MORROW:adr          = "New York, NY, USA"}

@String{pub-MOTOROLA            = "Motorola Corporation"}
@String{pub-MOTOROLA:adr        = "Phoenix, AZ, USA"}

@String{pub-MT                  = "M\&T Books"}
@String{pub-MT:adr              = "M\&T Publishing, Inc., 501
                                  Galveston Drive, Redwood City, CA
                                  94063, USA"}

@String{pub-NO-STARCH           = "No Starch Press"}
@String{pub-NO-STARCH:adr       = "San Francisco, CA, USA"}

@String{pub-NORTH-HOLLAND       = "North-Hol{\-}land"}
@String{pub-NORTH-HOLLAND:adr   = "Amsterdam, The Netherlands"}

@String{pub-NORTH-OXFORD        = "North Oxford Academic"}
@String{pub-NORTH-OXFORD:adr    = "Oxford, England"}

@String{pub-NORTON              = "W. W. Norton \& Co."}
@String{pub-NORTON:adr          = "New York, NY, USA"}

@String{pub-NRP                 = "New Riders Publishing"}
@String{pub-NRP:adr             = "Carmel, IN, USA"}

@String{pub-OHMSHA              = "Ohmsha, Ltd."}
@String{pub-OHMSHA:adr          = "3-1 Kanda Nishiki-cho, Chiyoda-ku,
                                  Tokyo 101, Japan"}

@String{pub-OLDENBOURG          = "R. Oldenbourg"}
@String{pub-OLDENBOURG:adr      = "M{\"{u}}nchen, Germany"}

@String{pub-OSBORNE-MCGRAW-HILL = "Osborne\slash Mc{\-}Graw-Hill"}
@String{pub-OSBORNE-MCGRAW-HILL:adr = "Berkeley, CA, USA"}

@String{pub-ORA                 = "O'Reilly \& {Associates, Inc.}"}
@String{pub-ORA:adr             = "981 Chestnut Street, Newton, MA 02164, USA"}

@String{pub-ORA-FRANCE          = "O'Reilly"}
@String{pub-ORA-FRANCE:adr      = "Paris, France"}

@String{pub-ORA-MEDIA           = "O'Reilly Media, Inc."}
@String{pub-ORA-MEDIA:adr       = "1005 Gravenstein Highway North,
                                   Sebastopol, CA 95472, USA"}

@String{pub-ORCP                = "O'Reilly Community Press"}
@String{pub-ORCP:adr            = "Sebastopol, CA, USA"}

@String{pub-OXFORD              = "Oxford University Press"}
@String{pub-OXFORD:adr          = "Walton Street, Oxford OX2 6DP, UK"}

@String{pub-PACKT               = "Packt Publishing"}
@String{pub-PACKT:adr           = "Birmingham, UK"}

@String{pub-PANTHEON            = "Pantheon Books"}
@String{pub-PANTHEON:adr        = "New York, NY, USA"}

@String{pub-PEACHPIT            = "Peachpit Press, Inc."}
@String{pub-PEACHPIT:adr        = "1085 Keith Avenue, Berkeley, CA 94708, USA"}

@String{pub-PEARSON-PH          = "Pearson Pren{\-}tice Hall"}
@String{pub-PEARSON-PH:adr      = "Upper Saddle River, NJ 07458, USA"}

@String{pub-PENGUIN             = "Penguin"}
@String{pub-PENGUIN:adr         = "London, UK and New York, NY, USA"}

@String{pub-PERGAMON            = "Pergamon Press"}
@String{pub-PERGAMON:adr        = "New York, NY, USA"}

@String{pub-PERSEUS             = "Perseus Publishers"}
@String{pub-PERSEUS:adr         = "Cambridge, MA, USA"}

@String{pub-PH                  = "Pren{\-}tice-Hall"}
@String{pub-PH:adr              = "Upper Saddle River, NJ 07458, USA"}

@String{pub-PHI                 = "Pren{\-}tice-Hall International"}
@String{pub-PHI:adr             = "Upper Saddle River, NJ 07458, USA"}

@String{pub-PHPTR               = "Pren{\-}tice-Hall PTR"}
@String{pub-PHPTR:adr           = "Upper Saddle River, NJ 07458, USA"}

@String{pub-PITMAN              = "Pitman Publishing Ltd."}
@String{pub-PITMAN:adr          = "London, UK"}

@String{pub-PLENUM              = "Plenum Press"}
@String{pub-PLENUM:adr          = "New York, NY, USA; London, UK"}

@String{pub-PLUMHALL            = "Plum Hall"}
@String{pub-PLUMHALL:adr        = "1 Spruce Ave, Cardiff, NJ 08232, USA"}

@String{pub-PPB                 = "Professional Press Books"}
@String{pub-PPB:adr             = "101 Witmer Road, Horsham, PA 19044, USA"}

@String{pub-PRIMA               = "Prima Publishing"}
@String{pub-PRIMA:adr           = "Rocklin, CA, USA"}

@String{pub-PRIME-TIME-FREEWARE = "Prime Time Freeware"}
@String{pub-PRIME-TIME-FREEWARE:adr = "370 Altair Way, Suite 150,
                                  Sunnyvale, CA, USA"}

@String{pub-PRINCETON           = "Princeton University Press"}
@String{pub-PRINCETON:adr       = "Princeton, NJ, USA"}

@String{pub-PROMETHEUS-BOOKS    = "Prometheus Books"}
@String{pub-PROMETHEUS-BOOKS:adr = "Amherst, NY, USA"}

@String{pub-PLUME-WAITE         = "Plume\slash Waite"}
@String{pub-PLUME-WAITE:adr     = "New York, NY, USA"}

@String{pub-PTI                 = "Personal {\TeX} Inc."}
@String{pub-PTI:adr             = "12 Madrona Street, Mill Valley, CA
                                  94941, USA"}

@String{pub-PUTNAM              = "Putnam"}
@String{pub-PUTNAM:adr          = "New York, NY, USA"}

@String{pub-QUE                 = "Que Corporation"}
@String{pub-QUE:adr             = "Indianapolis, IN, USA"}

@String{pub-R-E-KRIEGER         = "Robert E. Krieger Publishing Company"}
@String{pub-R-E-KRIEGER:adr     = "Huntington, NY, USA"}

@String{pub-REIDEL              = "D. Reidel"}
@String{pub-REIDEL:adr          = "Dordrecht, The Netherlands; Boston, MA, USA;
                                  Lancaster, UK; Tokyo, Japan"}

@String{pub-RESTON              = "Reston Publishing Co. Inc."}
@String{pub-RESTON:adr          = "Reston, VA, USA"}

@String{pub-RANDOM-HOUSE        = "Random House"}
@String{pub-RANDOM-HOUSE:adr    = "New York, NY, USA"}

@String{pub-SAMS                = "SAMS Publishing"}
@String{pub-SAMS:adr            = "Indianapolis, IN, USA"}

@String{pub-SERIF               = "Serif Publishing"}
@String{pub-SERIF:adr           = "A subsidiary of Xerox Corporation,
                                  701 South Aviation Boulevard, El
                                  Segundo, CA 90245, USA"}

@String{pub-SCOTT-FORESMAN      = "Scott, Foresman and Company"}
@String{pub-SCOTT-FORESMAN:adr  = "Glenview, IL, USA"}

@String{pub-SIAM                = "Society for Industrial and Applied
                                  Mathematics"}
@String{pub-SIAM:adr            = "Philadelphia, PA, USA"}

@String{pub-SILICON             = "Silicon Press"}
@String{pub-SILICON:adr         = "25 Beverly Road, Summit, NJ 07901, USA"}

@String{pub-SIMON-SCHUSTER      = "Simon and Schuster"}
@String{pub-SIMON-SCHUSTER:adr  = "New York, NY, USA"}

@String{pub-SSC                 = "Specialized Systems Consultants"}
@String{pub-SSC:adr             = "P.O. Box 55549, Seattle, WA 98155"}

@String{pub-ST-MARTINS          = "St. Martin's Press"}
@String{pub-ST-MARTINS:adr      = "New York, NY, USA"}

@String{pub-STAN-CS             = "Stanford University, Department of
                                  Computer Science"}
@String{pub-STAN-CS:adr         = "Stanford, CA, USA"}

@String{pub-STAN-CSL            = "Computer System Laboratories, Stanford
                                  University"}
@String{pub-STAN-CSL:adr        = "Stanford, CA, USA"}

@String{pub-STANFORD            = "Stanford University Press"}
@String{pub-STANFORD:adr        = "Stanford, CA, USA"}

@String{pub-SUCSLI              = "Stanford University Center for the
                                  Study of Language and Information"}
@String{pub-SUCSLI:adr          = "Stanford, CA, USA"}

@String{pub-SUN                 = "Sun Microsystems"}
@String{pub-SUN:adr             = "2550 Garcia Avenue, Mountain View,
                                  CA 94043, USA"}

@String{pub-SUN-MICROSYSTEMS-PRESS = "Sun Microsystems Press"}
@String{pub-SUN-MICROSYSTEMS-PRESS:adr = "Palo Alto, CA, USA"}

@String{pub-SYNGRESS            = "Syngress Publishing, Inc."}
@String{pub-SYNGRESS:adr        = "Rockland, MA, USA"}

@String{pub-SV                  = "Spring{\-}er-Ver{\-}lag"}
@String{pub-SV:adr              = "Berlin, Germany~/ Heidelberg,
                                  Germany~/ London, UK~/ etc."}

@String{pub-SV-CHAM             = "Spring{\-}er-Ver{\-}lag"}
@String{pub-SV-CHAM:adr         = "Cham, Switzerland"}

@String{pub-SYBEX               = "Sybex"}
@String{pub-SYBEX:adr           = "2021 Challenger Driver, Suite 100,
                                  Alameda, CA 94501, USA"}

@String{pub-TAYLOR-FRANCIS      = "Taylor and Francis"}
@String{pub-TAYLOR-FRANCIS:adr  = "London, UK and Boca Raton, FL, USA"}

@String{pub-TELOS               = "TELOS division of Springer-Verlag"}
@String{pub-TELOS:adr           = "Santa Clara, CA, USA and New York, NY, USA"}

@String{pub-TEXPLORATORS        = "The {\TeX}plorators Corporation"}
@String{pub-TEXPLORATORS:adr    = "3701 W. Alabama, Suite 450-273,
                                  Houston, TX 77027, USA"}

@String{pub-TICKNOR-FIELDS      = "Ticknor and Fields"}
@String{pub-TICKNOR-FIELDS:adr  = "New York, NY, USA"}

@String{pub-THREE-RIVERS        = "Three Rivers Press"}
@String{pub-THREE-RIVERS:adr    = "New York, NY, USA"}

@String{pub-TRANSACTION         = "Transaction Publishers, Rutgers University"}
@String{pub-TRANSACTION:adr     = "New Brunswick, NJ 08903, USA"}

@String{pub-TRILITHON           = "Trilithon Press"}
@String{pub-TRILITHON:adr       = "Los Altos, CA, USA"}

@String{pub-U-CALIFORNIA-PRESS  = "University of California Press"}
@String{pub-U-CALIFORNIA-PRESS:adr = "Berkeley, CA, USA"}

@String{pub-U-CHICAGO           = "University of Chicago Press"}
@String{pub-U-CHICAGO:adr       = "Chicago, IL, USA and London, UK"}

@String{pub-U-MICHIGAN          = "University of Michigan Press"}
@String{pub-U-MICHIGAN:adr      = "Ann Arbor, MI, USA"}

@String{pub-U-TEXAS-PRESS       = "University of Texas Press"}
@String{pub-U-TEXAS-PRESS:adr   = "Austin, TX, USA"}

@String{pub-UNIC                = "UNI{$\bullet$}C"}
@String{pub-UNIC:adr            = "Danmarks EDB-Center for Forskning
                                  og Uddannelse, Copenhagen, Denmark"}

@String{pub-URW                 = "URW-Verlag"}
@String{pub-URW:adr             = "Hamburg, Germany"}

@String{pub-USENIX              = "USENIX"}
@String{pub-USENIX:adr          = "San Francisco, CA, USA"}

@String{pub-USGPO               = "United States Government Printing Office"}
@String{pub-USGPO:adr           = "Washington, DC, USA"}

@String{pub-USNPS               = "U. S. Naval Postgraduate School"}
@String{pub-USNPS:adr           = "Monterey, CA 93940, USA"}

@String{pub-USNWL               = "U. S. Naval Weapons Laboratory"}
@String{pub-USNWL:adr           = "Dahlgren, VA 22448, USA"}

@String{pub-VIKING              = "Viking"}
@String{pub-VIKING:adr          = "New York, NY, USA"}

@String{pub-VINTAGE             = "Vintage Books"}
@String{pub-VINTAGE:adr         = "New York, NY, USA"}

@String{pub-VAN-NOSTRAND-REINHOLD = "Van Nostrand Reinhold"}
@String{pub-VAN-NOSTRAND-REINHOLD:adr = "New York, NY, USA"}

@String{pub-W-H-FREEMAN         = "W. H. {Freeman and Company}"}
@String{pub-W-H-FREEMAN:adr     = "New York, NY, USA"}

@String{pub-W-R-CHAMBERS        = "W. and R. Chambers Ltd."}
@String{pub-W-R-CHAMBERS:adr    = "London, UK"}

@String{pub-WADSWORTH           = "Wadsworth"}
@String{pub-WADSWORTH:adr       = "Pacific Grove, CA, USA"}

@String{pub-WALKER              = "Walker and Company"}
@String{pub-WALKER:adr          = "435 Hudson Street, New York, NY 10014, USA"}

@String{pub-WATSON-GUPTILL      = "Wat{\-}son-Gup{\-}till Publications"}
@String{pub-WATSON-GUPTILL:adr  = "1515 Broadway, New York, NY 10036, USA"}

@String{pub-WEITEK              = "Weitek Corporation"}
@String{pub-WEITEK:adr          = "1060 E. Arques Ave., Sunnyvale, CA
                                  94086-BRM-9759, USA"}

@String{pub-WILEY               = "Wiley"}
@String{pub-WILEY:adr           = "New York, NY, USA"}

@String{pub-WILEY-INTERSCIENCE  = "Wiley-In{\-}ter{\-}sci{\-}ence"}
@String{pub-WILEY-INTERSCIENCE:adr = "New York, NY, USA"}

@String{pub-WINDCREST           = "Windcrest\slash McGraw-Hill"}
@String{pub-WINDCREST:adr       = "Blue Ridge Summit, PA, USA"}

@String{pub-WORLD-SCI           = "World Scientific Publishing
                                  Co. Pte. Ltd."}
@String{pub-WORLD-SCI:adr       = "P. O. Box 128, Farrer Road,
                                  Singapore 9128"}

@String{pub-X-OPEN              = "X/Open Company, Ltd."}
@String{pub-X-OPEN:adr          = "Reading, UK"}

@String{pub-YALE                = "Yale University Press"}
@String{pub-YALE:adr            = "New Haven, CT, USA"}

@String{pub-YOURDON             = "Yourdon Press"}
@String{pub-YOURDON:adr         = "Englewood Cliffs, NJ 07632, USA"}

%%% ====================================================================
%%% Series abbreviations:

@String{ser-LNCS                = "Lecture Notes in Computer Science"}

@String{ser-LNM                 = "Lecture Notes in Mathematics"}

%%% ====================================================================
%%% Bibliography entries, sorted by citation label:

@Book{Aaserud:2013:LLQ,
  author =       "Finn Aaserud and J. L. Heilbron",
  title =        "Love, Literature, and the Quantum Atom: {Niels Bohr}'s
                 1913 Trilogy Revisited",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  pages =        "viii + 284",
  year =         "2013",
  ISBN =         "0-19-968028-0 (hardcover)",
  ISBN-13 =      "978-0-19-968028-3 (hardcover)",
  LCCN =         "QC774.B64 A19 2013",
  bibdate =      "Fri Oct 31 06:04:25 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/bohr-niels.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/r/rutherford-ernest.bib;
                 https://www.math.utah.edu/pub/tex/bib/isis2010.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "This title presents unpublished excerpts from
                 extensive correspondence between Niels Bohr and his
                 immediate family, and uses it to describe and analyze
                 the psychological and cultural background to his
                 invention of the quantum theory of the atom.",
  acknowledgement = ack-nhfb,
  subject =      "Bohr, Niels; Correspondence; Family; Nuclear
                 physicists; Denmark",
  subject-dates = "Niels Bohr (1885--1962)",
  tableofcontents = "Part 1 Niels Bohr's Private Sphere \\
                 Revealed through unpublished family correspondence /
                 Finn Aaserud \\
                 1.1. Introduction \\
                 1.2. Finding each other in Copenhagen \\
                 1.3. Niels in Cambridge \\
                 1.4. Niels in Manchester \\
                 1.5. Beginning married life in Copenhagen \\
                 1.6. Conclusion \\
                 Part 2 Nascent Science \\
                 The scientific and psychological background to Bohr's
                 Trilogy / J. L. Heilbron \\
                 2.1. Necessary preliminaries \\
                 2.2. Some physics around 1900 \\
                 2.3.``Stupid electrons'' \\
                 2.4. Indictment of ``classical physics'' \\
                 2.5. Odin the law giver \\
                 2.6. The Trilogy \\
                 2.7. Bolts from the blue \\
                 Works cited \\
                 Part 3 The Trilogy \\
                 On the Constitution of Atoms and Molecules / Niels Bohr
                 \\
                 3.1. Binding of Electrons by Positive Nuclei \\
                 3.2. Systems Containing only a Single Nucleus \\
                 3.3. Systems Containing Several Nuclei",
}

@Article{Abe:index,
  author =       "Kris K. Abe and Daniel M. Berry",
  title =        "{\tt indx} and {\tt findphrases}, {A} System for
                 Generating Indexes for Ditroff Documents",
  journal =      j-SPE,
  volume =       "19",
  number =       "1",
  pages =        "1--34",
  month =        jan,
  year =         "1989",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Abrahams:1990:TI,
  author =       "Paul W. Abrahams and Karl Berry and Kathryn A.
                 Hargreaves",
  key =          "ABH90",
  title =        "{\TeX} for the Impatient",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xvii + 357",
  year =         "1990",
  ISBN =         "0-201-51375-7",
  ISBN-13 =      "978-0-201-51375-2",
  LCCN =         "Z253.4.T47 A27 1990",
  bibdate =      "Tue Dec 14 22:55:21 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  abstract =     "\TeX{}, a software system created by Donald E. Knuth,
                 sets the standard for typesetting in mathematics,
                 science, and engineering. Features: complete
                 description of \TeX{} commands, arranged for lookup
                 either by function or alphabetically; clear definitions
                 of essential \TeX{} concepts, collected in separate
                 chapter so that the command descriptions remain brief
                 and accessible; explanations of common error messages
                 and advice on solving problems that frequently arise; a
                 collection of useful macros (also available in
                 electronic form).",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "1 Using this book / 1 \\
                 2 Using \TeX{} / 7 \\
                 3 Examples / 21 \\
                 4 Concepts / 43 \\
                 5 Commands for composing paragraphs / 97 \\
                 6 Commands for composing Pages / 133 \\
                 7 Commands for horizontal and vertical modes / 153 \\
                 8 Commands for composing math formulas / 187 \\
                 9 Commands for general operations / 221 \\
                 10 Tips and techniques / 265 \\
                 11 Making sense of error messages / 283 \\
                 12 A compendium of useful macros / 291 \\
                 13 Capsule summary of commands / 313 \\
                 Index / 341",
  tableofcontents = "1: Using this book / 1 \\
                 Syntactic conventions / 2 \\
                 Descriptions of the commands / 3 \\
                 2: Using \TeX{} / 7 \\
                 Turning input into ink / 7 \\
                 Programs and files you need / 7 \\
                 Running \TeX{} / 9 \\
                 Preparing an input file / 10 \\
                 Commands and control sequences / 10 \\
                 Arguments / 11 \\
                 Parameters / 12 \\
                 Spaces / 12 \\
                 Comments / 13 \\
                 Punctuation / 13 \\
                 Special characters / 15 \\
                 Groups / 15 \\
                 Math formulas / 16 \\
                 How \TeX{} works / 16 \\
                 New \TeX{} versus old \TeX{} / 18 \\
                 Resources / 18 \\
                 3: Examples / 21 \\
                 Entering simple text / 22 \\
                 Indentation / 24 \\
                 Fonts and special characters / 26 \\
                 Interline spacing / 28 \\
                 Spacing, rules, and boxes / 30 \\
                 Odds and ends / o32 \\
                 Using fonts from other sources / 34 \\
                 A ruled table / 36 \\
                 Typesetting mathematics / 38 \\
                 More mathematics / 40 \\
                 4: Concepts / 43 \\
                 5: Commands for composing paragraphs / 97 \\
                 Characters and accents / 97 \\
                 Letters and ligatures for European alphabets / 97 \\
                 Special symbols / 98 \\
                 Arbitrary characters / 99 \\
                 Accents / 100 \\
                 Defeating boundary ligatures / 101 \\
                 Selecting fonts / 1o2 \\
                 Particular fonts / 102 \\
                 Type styles / 103 \\
                 Uppercase and lowercase / 103 \\
                 Interword spacing / 104 \\
                 Centering and justifying lines / 108 \\
                 Shaping paragraphs / 110 \\
                 Starting, ending, and indenting paragraphs / 110 \\
                 Shaping entire paragraphs / 114 \\
                 Line breaks / 120 \\
                 Encouraging or discouraging line breaks / 120 \\
                 Line breaking parameters / 123 \\
                 Hyphenation / 126 \\
                 Section headings, lists, and theorems / 129 \\
                 6: Commands for composing pages / 133 \\
                 Interline and interparagraph spaces r / 133 \\
                 Pagebreaks / 136 \\
                 Encouraging or discouraging page breaks / 136 \\
                 Page breaking parameters / 138 \\
                 Page layout / 140 \\
                 Page description parameters / 140 \\
                 Page numbers / 142 \\
                 Header and footer lines / 143 \\
                 Marks / 144 \\
                 Insertions / 145 \\
                 Footnotes / 145 \\
                 General insertions / 146 \\
                 Modifying the output routine / 148 \\
                 Splitting vertical lists / 149 \\
                 7: Commands for horizontal and vertical modes / 153 \\
                 Producing space / 153 \\
                 Fixed-width horizontal space / 153 \\
                 Fixed-length vertical space / 154 \\
                 Variable-size space / 155 \\
                 Manipulating boxes / 160 \\
                 Constructing hboxes and vboxes / 160 \\
                 Setting and retrieving the contents of boxes / 164 \\
                 Shifting boxes / 166 \\
                 Dimensions of box registers / 167 \\
                 Struts, phantoms, and empty boxes / 167 \\
                 Parameters pertaining to malformed boxes / 170 \\
                 Retrieving the last item from a list / 171 \\
                 Rules and leaders / 172 \\
                 Alignments / 176 \\
                 Tabbing alignments / 176 \\
                 General alignments / 178 \\
                 8: Commands for composing math formulas / 187 \\
                 Simple parts of formulas / 187 \\
                 Creek letters / 187 \\
                 Miscellaneous ordinary math symbols / 188 \\
                 Binary operations / 189 \\
                 Relations / 190 \\
                 Left and right delimiters / 191 \\
                 Arrows / 192 \\
                 Named mathematical functions / 193 \\
                 Large operators / 194 \\
                 Punctuation / 196 \\
                 Superscripts and subscripts / 197 \\
                 Selecting and using styles / 198 \\
                 Compound symbols / 199 \\
                 Math accents / 199 \\
                 Fractions and other stacking operations / 200 \\
                 Dots / 203 \\
                 Delimiters / 204 \\
                 Matrices / 205 \\
                 Roots and radicals / 206 \\
                 Equation numbers / 207 \\
                 Multiline displays / 208 \\
                 Fonts in math formula / 209 \\
                 Constructing math symbols / 211 \\
                 Making delimiters bigger / 211 \\
                 Parts of large symbols / 211 \\
                 Aligning parts of a formula / 212 \\
                 Aligning accents / 212 \\
                 Aligning material vertically / 213 \\
                 Producing spaces / 214 \\
                 Fixed-width math spaces / 214 \\
                 Variable-width math spaces / 215 \\
                 Spacing parameters for displays / 216 \\
                 Other spacing parameters for math / 217 \\
                 Categorizing math constructs / 218 \\
                 Special actions for math formulas / 218 \\
                 9: Commands for general operations / 221 \\
                 Naming and modifying fonts / 221 \\
                 Converting information to tokens / 224 \\
                 Numbers / 224 \\
                 Environmental information / 224 \\
                 Values of variables / 226 \\
                 Grouping / 227 \\
                 Macros / 230 \\
                 Defining macros / 230 \\
                 Other definitions / 232 \\
                 Controlling expansion / 233 \\
                 Conditional tests / 235 \\
                 Repeated actions / 240 \\
                 Doing nothing / 241 \\
                 Registers / 242 \\
                 Using registers / 242 \\
                 Naming and reserving registers, etc. / 244 \\
                 Doing arithmetic in registers / 245 \\
                 Ending the job / 246 \\
                 Input and output / 247 \\
                 Operations on input files / 247 \\
                 Operations on output files / 249 \\
                 Interpreting input characters / 251 \\
                 Controlling interaction with \TeX{} / 252 \\
                 Diagnostic aids / 253 \\
                 Displaying internal data / 253 \\
                 Specifying what is traced / 256 \\
                 Sending messages / 261 \\
                 Initializing \TeX{} / 263 \\
                 10: Tips and techniques / 265 \\
                 Correcting bad page breaks / 265 \\
                 Preserving the end of a page / 267 \\
                 Leaving space at the top of a page / 267 \\
                 Correcting bad line breaks / 268 \\
                 Correcting overfull or underfull boxes / 268 \\
                 Recovering lost interword spaces / 270 \\
                 Avoiding unwanted interword spaces / 270 \\
                 Avoiding excess space around a display / 271 \\
                 Avoiding excess space after a paragraph / 271 \\
                 Changing the paragraph shape / 272 \\
                 Putting paragraphs into a box / 272 \\
                 Drawing lines / 273 \\
                 Creating multiline headers or footers / 274 \\
                 Finding mismatched braces / 275 \\
                 Setting dimensions / 276 \\
                 Creating composite fonts / 276 \\
                 Reproducing text verbatim / 277 \\
                 Using outer macros / 279 \\
                 Changing category codes / 280 \\
                 Making macro files more readable / 281 \\
                 11: Making sense of error messages / 283 \\
                 12: A compendium of useful macros / 291 \\
                 Preliminaries / 291 \\
                 Displays / 295 \\
                 Time of day / 297 \\
                 Lists / 298 \\
                 Verbatim listing / 300 \\
                 Tables of contents / 301 \\
                 Cross-references / 302 \\
                 Environments / 304 \\
                 Justification / 306 \\
                 Tables / 307 \\
                 Footnotes / 309 \\
                 Double columns / 309 \\
                 Finishing up / 311 \\
                 13: Capsule summary of commands / 313 \\
                 Index / 341",
}

@Book{Abrahams:1992:UI,
  author =       "Paul W. Abrahams and Bruce R. Larson",
  title =        "{UNIX} for the Impatient",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xxvii + 559",
  year =         "1992",
  ISBN =         "0-201-55703-7",
  ISBN-13 =      "978-0-201-55703-9",
  LCCN =         "QA76.76.O63 A27 1992",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  note =         "Excellent, and thorough, coverage of {UNIX}, with
                 chapters on the file system, utilities, shells,
                 editors, Emacs, data manipulation, mail, network
                 communications and resources, the X Window System, and
                 a comparison of {MS-DOS} and {UNIX}.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Introduction \\
                 UNIX Background \\
                 The POSIX 2 Standard \\
                 How to Use This Book \\
                 Typographical Conventions \\
                 Syntactic Conventions \\
                 Getting Started \\
                 Concepts \\
                 The UNIX Manual \\
                 System Administration and the Superuser \\
                 Users and Groups \\
                 What the Shell Does \\
                 The UNIX Kernel \\
                 Processes \\
                 The UNIX File System \\
                 File Permissions \\
                 Conventions for Using Files \\
                 Standard Files and Redirection \\
                 Other Facilities for Interprocess Communication \\
                 UNIX Commands \\
                 Local Variables \\
                 Initialization Files \\
                 Terminal Descriptions \\
                 Locales, Code Sets, and Internationalization \\
                 Regular Expressions \\
                 Devices \\
                 Operations on Files \\
                 Operations on Directories \\
                 Listing Files with ls \\
                 Displaying and Concatenating Files with cat \\
                 Linking, Moving, and Copying Files with ln, mv, and cp
                 \\
                 Removing Files \\
                 Examining Files or Output with a Pager \\
                 Printing Files \\
                 Finding Files with find \\
                 Locating, Classifying, and Checking Files \\
                 Comparing Files \\
                 Controlling File Access and Ownership \\
                 Miscellaneous File Utilities \\
                 Data Compression and Encoding \\
                 Archiving Sets of Files \\
                 Examining Files with od \\
                 Copying and Converting Data with dd \\
                 Updating Files with patch \\
                 Creating Special Files \\
                 Data Manipulation Using Filters \\
                 Sorting Files with sort \\
                 Finding Patterns with grep \\
                 Simple Data Transformations \\
                 Extracting Parts of Files \\
                 Combining Files \\
                 Using sed to Edit from a Script \\
                 The awk Programming Language \\
                 Other Data Manipulation Languages \\
                 Utility Programs \\
                 Information Services \\
                 Reporting on the Status of Processes \\
                 Managing Processes \\
                 Commands Related to Logging In \\
                 Controlling Your Terminal \\
                 On-Line Communication with Other Users \\
                 Disk Usage Statistics \\
                 Writing and Reading Strings \\
                 Evaluating Expressions \\
                 Special Invocation of Commands \\
                 Querying Your UNIX Environment \\
                 Miscellaneous Services \\
                 Producing Locale Information and Defining a Locale \\
                 Document Processing \\
                 Version Control \\
                 The Korn and POSIX Shells \\
                 Overview of the Korn Shell \\
                 Interacting with the Shell \\
                 Editing an Input Line \\
                 Calling the Shell Directly \\
                 Shell Scripts \\
                 Syntax of Shell Input \\
                 Patterns \\
                 Simple Commands \\
                 Linking Commands with Operators \\
                 Redirection \\
                 Here-Documents \\
                 The test, true, and false Commands \\
                 Compound Commands \\
                 How Commands Are Executed \\
                 Parameters \\
                 Parameter Expansions \\
                 Quotation \\
                 Substitutions \\
                 Aliases \\
                 Commands for Job Control \\
                 The Command History and the fc Command \\
                 Intrinsic Commands and Predefined Aliases \\
                 Predefined Variables Used by the Shell \\
                 Execution Options \\
                 Initialization Files for the Shell \\
                 Parsing Command Lines with getopts \\
                 A Sample Shell Script \\
                 Other Shells \\
                 The C Shell csh \\
                 Bash, the ``Bourne-again Shell'' \\
                 Standard Editors",
}

@Book{Abrahams:1997:UIC,
  author =       "Paul W. Abrahams and Bruce R. Larson",
  title =        "{UNIX} for the Impatient: {CD-ROM} Version",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Second",
  pages =        "xxxvi + 824 + CD-31",
  year =         "1997",
  ISBN =         "0-201-41979-3",
  ISBN-13 =      "978-0-201-41979-5",
  LCCN =         "QA76.76.O63 A27 1992",
  bibdate =      "Fri Dec 19 10:57:11 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$49.00",
  acknowledgement = ack-nhfb,
}

@Book{Abramowitz:1964:HMF,
  editor =       "Milton Abramowitz and Irene A. Stegun",
  key =          "NBS",
  title =        "Handbook of Mathematical Functions with Formulas,
                 Graphs, and Mathematical Tables",
  volume =       "55",
  publisher =    "U. S. Department of Commerce",
  address =      "Washington, DC, USA",
  pages =        "xiv + 1046",
  year =         "1964",
  LCCN =         "QA47.A161 1972; QA 55 A16h 1972",
  bibdate =      "Thu Jan 27 07:58:12 2000",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
                 https://www.math.utah.edu/pub/bibnet/subjects/han-wri-mat-sci-2ed.bib;
                 https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Tenth printing, with corrections (December 1972). This
                 book is also available online at
                 \path=http://www.convertit.com/Go/ConvertIt/Reference/AMS55.ASP=
                 in bitmap image format.",
  series =       "Applied mathematics series",
  abstract =     "This book is a compendium of mathematical formulas,
                 tables, and graphs. It contains a table of analytical
                 integrals, differential equations, and numerical
                 series; and includes tables of trigonometric and
                 hyperbolic functions, tables for numerical integration,
                 rules for differentiation and integration, and
                 techniques for point interpolation and function
                 approximation. Additionally, it devotes a entire
                 section to mathematical and physical constants as
                 fractions and powers of Pi, e, and prime numbers; and
                 discusses statistics by presenting combinatorial
                 analysis and probability functions.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Mathematical constants / David S. Liepman \\
                 Physical constants and conversion factors / A. G.
                 McNish \\
                 Elementary analytical methods / Milton Abramowitz \\
                 Elementary transcendental functions: logarithmic,
                 exponential, circular and hyperbolic functions / Ruth
                 Zucker \\
                 Exponential integral and related functions / Walter
                 Gautschi and William F. Cahill \\
                 Gamma function and related functions / Philip J. Davis
                 \\
                 Error function and Fresnel integrals / Walter Gautschi
                 \\
                 Legendre functions / Irene A. Stegun \\
                 Bessel functions of integer order / F. W. J. Olver \\
                 Bessell functions of fractional order / H. A.
                 Antosiewicz \\
                 Integrals of Bessel functions / Yudell L. Luke \\
                 Struve functions and related functions / Milton
                 Abramowitz \\
                 Confluent hypergeometric functions / Lucy Joan Slater
                 \\
                 Coulomb wave functions / Milton Abramowitz \\
                 Hypergeometric functions / Fritz Oberhettinger \\
                 Jacobian elliptic functions and theta functions;
                 Elliptic integrals / L. M. Milne-Thomson \\
                 Weierstrass elliptic and related functions / Thomas H.
                 Southard \\
                 Parabolic cylinder functions / J. C. P. Miller\ldots{}
                 Mathieu functions / Gertrude Blanch \\
                 Spheroidal wave functions / Arnold N. Lowan \\
                 Orthogonal polynomials / Urs W. Hochstrasser \\
                 Bernoulli and Euler polynomials, Riemann zeta function
                 / Emilie V. Haynesworth and Karl Goldberg \\
                 Combinatorial analysis / K. Goldberg, M. Newman and E.
                 Haynesworth \\
                 Numerical interpolation, differentiation and
                 integration / Philip J. Davis and Ivan Polonsky \\
                 Probability functions / Marvin Zelen and Norman C.
                 Severo \\
                 Miscellaneous functions / Irene A. Stegun \\
                 Scales of notation / S. Peavy and A. Schopf \\
                 Laplace transforms",
}

@Book{Abrams:2004:NFS,
  author =       "Brad Abrams and Anders Hejlsberg and Brian Grunkemeyer
                 and Joel Marcey and Kit George and Krzysztof Cwalina
                 and Jeffrey Richter",
  title =        "{.NET} {Framework Standard Library} Annotated
                 Reference. Volume 1: Base Class Library and Extended
                 Numerics Library",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xxvi + 528",
  year =         "2004",
  ISBN =         "0-321-15489-4 (hardcover)",
  ISBN-13 =      "978-0-321-15489-7 (hardcover)",
  LCCN =         "QA76.76.M52 A27 2004",
  bibdate =      "Wed Mar 15 08:56:55 MST 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  note =         "Foreword by Joel Marcey.",
  series =       "Microsoft .NET development series",
  URL =          "http://www.aw-bc.com/catalog/academic/product/0,1144,0321154894,00.html;
                 http://www.loc.gov/catdir/toc/ecip0411/2003024327.html",
  acknowledgement = ack-nhfb,
  subject =      "Microsoft .NET Framework",
  tableofcontents = "Contents\\
                 Foreword\\
                 Preface\\
                 I. Namespaces\\
                 1. System Overview \\
                 2. System.IO Overview\\
                 3. System.Collections Overview\\
                 4. System.Text Overview\\
                 5. System.Threading Overview\\
                 6. System.Security Overview\\
                 7. System.Globalization Overview\\
                 II. Type Descriptions\\
                 1. ApplicationException (System)\\
                 2. ArgumentException (System)\\
                 3. ArgumentNullException (System)\\
                 4. ArgumentOutOfRangeException (System)\\
                 5. ArithmeticException (System)\\
                 6. Array (System)\\
                 7. ArrayTypeMismatchException (System)\\
                 8. AsyncCallback (System)\\
                 9. Attribute (System)\\
                 10. AttributeTargets (System)\\
                 11. AttributeUsageAttribute (System)\\
                 12. Boolean (System)\\
                 13. Byte (System)\\
                 14. Char (System)\\
                 15. CharEnumerator (System)\\
                 16. CLSCompliantAttribute (System)\\
                 17. ArrayList (System.Collections)\\
                 18. Comparer (System.Collections)\\
                 19. DictionaryEntry (System.Collections)\\
                 20. Hashtable (System.Collections)\\
                 21. ICollection (System.Collections)\\
                 22. IComparer (System.Collections)\\
                 23. IDictionary (System.Collections)\\
                 24. IDictionaryEnumerator (System.Collections)\\
                 25. IEnumerable (System.Collections)\\
                 26. IEnumerator (System.Collections)\\
                 27. IHashCodeProvider (System.Collections)\\
                 28. IList (System.Collections)\\
                 29. Console (System)\\
                 30. Convert (System)\\
                 31. DateTime (System)\\
                 32. Decimal (System)\\
                 33. Delegate (System)\\
                 34. ConditionalAttribute (System.Diagnostics)\\
                 35. DivideByZeroException (System)\\
                 36. Double (System)\\
                 37. DuplicateWaitObjectException (System)\\
                 38. Enum (System)\\
                 39. Environment (System)\\
                 40. EventArgs (System)\\
                 41. EventHandler (System)\\
                 42. Exception (System)\\
                 43. ExecutionEngineException (System)\\
                 44. FlagsAttribute (System)\\
                 45. FormatException (System)\\
                 46. GC (System)\\
                 47. DateTimeFormatInfo (System.Globalization)\\
                 48. DateTimeStyles (System.Globalization)\\
                 49. NumberFormatInfo (System.Globalization)\\
                 50. NumberStyles (System.Globalization)\\
                 51. UnicodeCategory (System.Globalization)\\
                 52. IAsyncResult (System)\\
                 53. ICloneable (System)\\
                 54. IComparable (System)\\
                 55. IDisposable (System)\\
                 56. IFormatProvider (System)\\
                 57. IFormattable (System)\\
                 58. IndexOutOfRangeException (System)\\
                 59. Int16 (System)\\
                 60. Int32 (System)\\
                 61. Int64 (System)\\
                 62. InvalidCastException (System)\\
                 63. InvalidOperationException (System)\\
                 64. InvalidProgramException (System)\\
                 65. Directory (System.IO)\\
                 66. DirectoryNotFoundException (System.IO)\\
                 67. EndOfStreamException (System.IO)\\
                 68. File (System.IO)\\
                 69. FileAccess (System.IO)\\
                 70. FileLoadException (System.IO)\\
                 71. FileMode (System.IO)\\
                 72. FileNotFoundException (System.IO)\\
                 73. FileShare (System.IO)\\
                 74. FileStream (System.IO)\\
                 75. IOException (System.IO)\\
                 76. MemoryStream (System.IO)\\
                 77. Path (System.IO)\\
                 78. PathTooLongException (System.IO)\\
                 79. SeekOrigin (System.IO)\\
                 80. Stream (System.IO)\\
                 81. StreamReader (System.IO)\\
                 82. StreamWriter (System.IO)\\
                 83. StringReader (System.IO)\\
                 84. StringWriter (System.IO)\\
                 85. TextReader (System.IO)\\
                 86. TextWriter (System.IO)\\
                 87. MarshalByRefObject (System)\\
                 88. Math (System)\\
                 89. NotFiniteNumberException (System)\\
                 90. NotSupportedException (System)\\
                 91. NullReferenceException (System)\\
                 92. Object (System)\\
                 93. ObjectDisposedException (System)\\
                 94. ObsoleteAttribute (System)\\
                 95. OutOfMemoryException (System)\\
                 96. OverflowException (System)\\
                 97. Random (System)\\
                 98. RankException (System)\\
                 99. SByte (System)\\
                 100. CodeAccessPermission (System.Security)\\
                 101. IPermission (System.Security)\\
                 102. CodeAccessSecurityAttribute
                 (System.Security.Permissions)\\
                 103. EnvironmentPermission
                 (System.Security.Permissions)\\
                 104. EnvironmentPermissionAccess
                 (System.Security.Permissions)\\
                 105. EnvironmentPermissionAttribute
                 (System.Security.Permissions)\\
                 106. FileIOPermission (System.Security.Permissions)\\
                 107. FileIOPermissionAccess
                 (System.Security.Permissions)\\
                 108. FileIOPermissionAttribute
                 (System.Security.Permissions)\\
                 109. PermissionState (System.Security.Permissions)\\
                 110. SecurityAction (System.Security.Permissions)\\
                 111. SecurityAttribute (System.Security.Permissions)\\
                 112. SecurityPermission
                 (System.Security.Permissions)\\
                 113. SecurityPermissionAttribute
                 (System.Security.Permissions)\\
                 114. SecurityPermissionFlag
                 (System.Security.Permissions)\\
                 115. PermissionSet (System.Security)\\
                 116. SecurityElement (System.Security)\\
                 117. SecurityException (System.Security)\\
                 118. VerificationException (System.Security)\\
                 119. Single (System)\\
                 120. StackOverflowException (System)\\
                 121. String (System)\\
                 122. SystemException (System)\\
                 123. ASCIIEncoding (System.Text)\\
                 124. Decoder (System.Text)\\
                 125. Encoder (System.Text)\\
                 126. Encoding (System.Text)\\
                 127. StringBuilder (System.Text)\\
                 128. UnicodeEncoding (System.Text)\\
                 129. UTF8Encoding (System.Text)\\
                 130. Interlocked (System.Threading)\\
                 131. Monitor (System.Threading)\\
                 132. SynchronizationLockException (System.Threading)\\
                 133. Thread (System.Threading)\\
                 134. ThreadAbortException (System.Threading)\\
                 135. ThreadPriority (System.Threading)\\
                 136. ThreadStart (System.Threading)\\
                 137. ThreadState (System.Threading)\\
                 138. ThreadStateException (System.Threading)\\
                 139. Timeout (System.Threading)\\
                 140. Timer (System.Threading)\\
                 141. TimerCallback (System.Threading)\\
                 142. WaitHandle (System.Threading)\\
                 143. TimeSpan (System)\\
                 144. Type (System)\\
                 145. TypeInitializationException (System)\\
                 146. UInt16 (System)\\
                 147. UInt32 (System)\\
                 148. UInt64 (System)\\
                 149. UnauthorizedAccessException (System)\\
                 150. ValueType (System)\\
                 151. Version (System)\\
                 Index",
}

@Misc{Abraxas:pcyacc,
  author =       "{Abraxas Software, Inc.}",
  title =        "{PCYACC} 2.0",
  year =         "1987",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "7033 SW Macadam Ave., Portland, OR 97219.",
  acknowledgement = ack-nhfb,
}

@Misc{ACW:software,
  author =       "The Austin Code Works",
  title =        "Purveyors of software",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "11100 Leafwood Lane, Austin, TX 78750-3409.",
  acknowledgement = ack-nhfb,
}

@Book{Aczel:1999:GEE,
  author =       "Amir D. Aczel",
  title =        "{God}'s Equation: {Einstein}, Relativity, and the
                 Expanding Universe",
  publisher =    "Four Walls Eight Windows",
  address =      "New York, NY, USA",
  pages =        "xvii + 236",
  year =         "1999",
  ISBN =         "1-56858-139-4",
  ISBN-13 =      "978-1-56858-139-2",
  LCCN =         "QB981 .A35 1999",
  bibdate =      "Wed Jul 01 10:18:15 2009",
  bibsource =    "aubrey.tamu.edu:7090/voyager;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Preface \\
                 1. Exploding Stars / 1 \\
                 2. Early Einstein / 13 \\
                 3. Prague, 1911 / 27 \\
                 4. Euclid's Riddle / 43 \\
                 5. Grossmann's Notebooks / 61 \\
                 6. The Crimean Expedition / 71 \\
                 7. Riemann's Metric / 91 \\
                 8. Berlin / 105 \\
                 9. Principe Island / 121 \\
                 10. The Joint Meeting / 139 \\
                 11. Cosmological Considerations / 149 \\
                 12. The Expansion of Space / 167 \\
                 13. The Nature of Matter / 181 \\
                 14. The Geometry of the Universe / 189 \\
                 15. Batavia, Illinois, May 4, 1998 / 197 \\
                 16. God's Equation / 207 \\
                 References / 221 \\
                 Index / 225",
}

@Book{Aczel:2009:UWS,
  author =       "Amir D. Aczel",
  title =        "Uranium wars: the scientific rivalry that created the
                 nuclear age",
  publisher =    "Palgrave Macmillan",
  address =      "New York, NY, USA",
  pages =        "248 + 8",
  year =         "2009",
  ISBN =         "0-230-61374-8",
  ISBN-13 =      "978-0-230-61374-4",
  LCCN =         "QC773.A1 A28 2009",
  bibdate =      "Sat Oct 3 09:57:51 MDT 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "nuclear weapons; research; history; 20th Century;
                 nuclear physics; nuclear energy; science and state;
                 uranium as fuel",
  tableofcontents = "Physics and Uranium \\
                 On the trail of the nucleus \\
                 The draw of radioactivity \\
                 The Meitner--Hahn discovery \\
                 Enrico Fermi \\
                 The Rome experiments \\
                 The events of 1938 \\
                 That Christmas \\
                 The Heisenberg menace \\
                 Chain reaction \\
                 Copenhagen \\
                 Truth \\
                 Building the bomb \\
                 Decision to use the bomb \\
                 The spying operation \\
                 The Cold War \\
                 Uranium's future",
}

@Book{Aczel:2010:PCS,
  author =       "Amir D. Aczel",
  title =        "Present at the Creation: the Story of {CERN} and the
                 {Large Hadron Collider}",
  publisher =    "Harmony Books",
  address =      "New York, NY, USA",
  pages =        "xvi + 271 + 8",
  year =         "2010",
  ISBN =         "0-307-59167-0",
  ISBN-13 =      "978-0-307-59167-8",
  LCCN =         "QC787.P73 A29 2010",
  bibdate =      "Mon Oct 18 15:38:58 MDT 2010",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/f/feynman-richard-p.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Large Hadron Collider (France and Switzerland);
                 colliders (nuclear physics)",
  tableofcontents = "The exploding protons \\
                 The LHC and our age-old quest to understand the
                 structure of the universe \\
                 A place called CERN \\
                 Building the greatest machine in history \\
                 LHCb and the mystery of the missing antimatter \\
                 Richard Feynman and a prelude to the standard model \\
                 ``Who ordered that?'': the discoveries of leaping
                 leptons \\
                 Symmetries of nature, Yang--Mills theory, and quarks
                 \\
                 Hunting the Higgs \\
                 How the Higgs sprang alive inside a red Camaro (and
                 gave birth to three bosons) \\
                 Dark matter, dark energy, and the fate of the universe
                 \\
                 Looking for strings and hidden dimensions \\
                 Will CERN create a black hole? \\
                 The LHC and the future of physics \\
                 Afterword \\
                 Appendix A: How does an LHC detector work? \\
                 Appendix B: Particles, forces, and the standard model
                 \\
                 Appendix C: The key physics principles used in this
                 book",
}

@Book{Aczel:2011:SWL,
  author =       "Amir D. Aczel",
  title =        "A Strange Wilderness: the Lives of the Great
                 Mathematicians",
  publisher =    "Sterling",
  address =      "New York, NY, USA",
  pages =        "xix + 284",
  year =         "2011",
  ISBN =         "1-4027-8584-4 (hardback), 1-4027-9085-6 (e-book)",
  ISBN-13 =      "978-1-4027-8584-9 (hardback), 978-1-4027-9085-0
                 (e-book)",
  LCCN =         "QA21 .A29 2011",
  bibdate =      "Thu Jun 7 16:36:39 MDT 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
                 https://www.math.utah.edu/pub/tex/bib/fibquart.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "Bestselling popular science author Amir Aczel selects
                 the most fascinating individuals and stories in the
                 history of mathematics, presenting a colorful narrative
                 that explores the quirky personalities behind some of
                 the most profound, enduring theorems. Through such
                 mathematical geniuses as Archimedes, Leonardo of Pisa
                 (a.k.a. Fibonacci), Tartaglia (`the stutterer'),
                 Descartes, Gottfried Leibniz, Carl Gauss, Joseph
                 Fourier (Napoleon's mathematician), Evariste Galois,
                 Georg Cantor, Ramanujan, and `Nicholas Bourbaki,' we
                 gather little known details about the alliances and
                 rivalries that profoundly impacted the development of
                 what the scheming doctor-turned-mathematician Geronimo
                 Girolamo called `The Great Art'. This story of
                 mathematics is not your dry `college textbook' account;
                 tales of duels, battlefield heroism, flamboyant
                 arrogance, pranks, secret societies, imprisonment,
                 feuds, theft, and even some fatal errors of judgment
                 fill these pages (clearly, genius doesn't guarantee
                 street smarts). Ultimately, readers will come away from
                 this book entertained, with a newfound appreciation of
                 the tenacity, complexity, eccentricity, and brilliance
                 of the mathematical genius",
  acknowledgement = ack-nhfb,
  subject =      "Mathematics; History; Mathematicians",
  tableofcontents = "Hellenic foundations \\
                 God is number \\
                 Plato's Academy \\
                 Alexandria \\
                 The East \\
                 The House of Wisdom \\
                 Medieval China \\
                 Renaissance mathematics \\
                 Italian shenanigans \\
                 Heresy \\
                 To calculus and beyond \\
                 The gentleman soldier \\
                 The greatest rivalry \\
                 Geniuses of the Enlightenment \\
                 Upheaval in France \\
                 Napoleon's mathematicians \\
                 Duel at dawn \\
                 Toward a new mathematics \\
                 Infinity and mental illness \\
                 Unlikely heroes \\
                 The strangest wilderness",
}

@Article{Ada79:rationale,
  author =       "Anonymous",
  key =          "Ada",
  title =        "Rationale for the Design of the {Ada} Programming
                 Language",
  journal =      j-SIGPLAN,
  volume =       "14",
  number =       "6B",
  month =        jun,
  year =         "1979",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "The final standard is \cite{ANSI:ada}.",
  acknowledgement = ack-nhfb,
}

@Article{Ada79:refman,
  author =       "Anonymous",
  key =          "Ada",
  title =        "Preliminary {Ada} Reference Manual",
  journal =      j-SIGPLAN,
  volume =       "14",
  number =       "6A",
  month =        jun,
  year =         "1979",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "The final standard is \cite{ANSI:ada}.",
  acknowledgement = ack-nhfb,
}

@Manual{ADA:1992:TRF,
  author =       "{Adobe Developers Association}",
  title =        "{TIFF} Revision 6.0: Final",
  howpublished = "World-Wide Web document",
  organization = "Adobe Systems Incorporated",
  address =      "1585 Charleston Road P.O. Box 7900 Mountain View, CA
                 94039-7900",
  day =          "3",
  month =        jun,
  year =         "1992",
  bibdate =      "Thu Nov 06 14:44:07 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Includes TIFF Specification Supplement 1 (enhancements
                 for Adobe PageMaker 6.0) [14-Sep-1995] and TIFF
                 Specification Supplement 2 (enhancements for Adobe
                 Photoshop) [22-Mar-2002]. Hypertext linked for Web
                 access.",
  URL =          "http://home.earthlink.net/~ritter/tiff/ (The
                 Unofficial TIFF Home Page);
                 http://partners.adobe.com/asn/tech/tiff/specification.jsp",
  acknowledgement = ack-nhfb,
  keywords =     "TIFF (Tagged Image File Format) specification",
}

@Book{Adams:1992:FHC,
  author =       "Jeanne C. Adams and Walter S. Brainerd and Jerrold L.
                 Wagener",
  title =        "{Fortran 90} Handbook: Complete {ANSI\slash ISO}
                 Reference",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "xi + 740",
  year =         "1992",
  ISBN =         "0-07-000406-4",
  ISBN-13 =      "978-0-07-000406-1",
  LCCN =         "QA76.73.F28 F67 1992",
  bibdate =      "Sat Jun 17 12:29:56 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fortran3.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See \cite{ANSI:ftn92}.",
  price =        "US\$79.50",
  acknowledgement = ack-nhfb,
  keywords =     "Computer Programming; Fortran; Fortran 90 (computer
                 program language); Programming Languages",
  libnote =      "Not yet in my library.",
  tableofcontents = "0. Sneak Preview \\
                 1. Introduction \\
                 1.1. History \\
                 1.2. Why a New Standard? \\
                 1.3. Why Not Use Another Language? \\
                 1.4. Development of Fortran 90 \\
                 1.5. Fortran 77 Compatibility \\
                 1.6. Extensibility \\
                 1.7. Intrinsic and Standard Modules \\
                 1.8. The Fortran 90 Language Standard \\
                 1.9. References \\
                 2. Fortran Concepts and Terms \\
                 2.1. Scope and Association \\
                 2.2. Program Organization \\
                 2.3. Data Environment \\
                 2.4. Program Execution \\
                 2.5. Terms \\
                 2.6. Summary of Forms \\
                 2.7. Ordering Requirements \\
                 2.8. Example Fortran 90 Program \\
                 2.9. Summary \\
                 3. Language Elements and Source Form \\
                 3.1. The Processor Character Set \\
                 3.2. Lexical Tokens \\
                 3.3. Source Form \\
                 3.4. Rules for Fixed/Free Source Form \\
                 3.5. The INCLUDE Line \\
                 3.6. Low-Level Syntax \\
                 3.7. Summary \\
                 4. Data Types \\
                 4.1. Building the Data Environment for a Problem
                 Solution \\
                 4.2. What Is Meant by ``Type'' in Fortran? \\
                 4.3. Intrinsic Data Types \\
                 4.4. Derived Types \\
                 4.5. Structure Constructors \\
                 4.6. Array Constructors \\
                 4.7. Summary \\
                 5. Declarations \\
                 5.1. Type Declaration Statements \\
                 5.2. Implicit Typing \\
                 5.3. Array Properties \\
                 5.4. Pointer Properties \\
                 5.6. Object Accessibility and Use \\
                 5.7. Procedure Properties \\
                 5.8. Automatic Data Objects \\
                 5.9. NAMELIST Statement \\
                 5.10. Storage Association \\
                 5.11. Summary \\
                 6. Using Data \\
                 6.1. Constants and Variables \\
                 6.2. Substrings \\
                 6.3. Structure Components \\
                 6.4. Arrays \\
                 6.5. Pointers and Allocatable Arrays \\
                 6.6. Summary \\
                 7. Expressions and Assignment \\
                 7.1. Introduction to Fortran 90 Expressions \\
                 7.2. Formation of Expressions \\
                 7.3. Interpretation of Expressions \\
                 7.4. Evaluation of Expressions \\
                 7.5. Assignment \\
                 7.6. Summary \\
                 8. Controlling Execution \\
                 8.1. The Execution Sequence \\
                 8.2. Blocks and Executable Constructs \\
                 8.3. IF Construct and IF Statement \\
                 8.4. The CASE Construct \\
                 8.5. The DO Construct \\
                 8.6. Branching \\
                 8.7. Obsolescent Control Statements \\
                 8.8. Summary \\
                 9. Input and Output Processing \\
                 9.1. Records, Files, Access Methods, and Units \\
                 9.2. Data Transfer Statements \\
                 9.3. Execution Model for Data Transfer Statements \\
                 9.4. Error and Other Conditions in Input/Output
                 Statements \\
                 9.5. The OPEN Statement \\
                 9.6. The CLOSE Statement \\
                 9.7. Inquiring about Files \\
                 9.8. File Positioning Statements \\
                 9.9. Restrictions on Input/Output Specifiers, List
                 Items, and Statements \\
                 9.10. Summary \\
                 10. Input and Output Editing \\
                 10.1. Explicit Formatting \\
                 10.2. Format Specifications \\
                 10.3. Character String Edit Descriptor Form \\
                 10.4. Formatted Data Transfer \\
                 10.5. File Positioning by Format Control \\
                 10.6. Numeric Editing \\
                 10.7. Logical Editing \\
                 10.8. Character Editing \\
                 10.9. Control Edit Descriptors \\
                 10.10. List-Directed Formatting \\
                 10.11. Namelist Formatting \\
                 10.12. Summary \\
                 11. Program Units \\
                 11.1. Overview \\
                 11.2. Main Program \\
                 11.3. Internal Procedures \\
                 11.4. Host Association \\
                 11.5. External Subprograms \\
                 11.6. Modules \\
                 11.7. Block Data Program Units \\
                 11.8. Summary \\
                 12. Using Procedures \\
                 12.1. Procedure Terms and Concepts \\
                 12.2. Subroutines \\
                 12.3. Functions \\
                 12.4. Procedure-Related Statements \\
                 12.5. Argument Association \\
                 12.6. Procedure Interfaces \\
                 12.7. Summary \\
                 13. Intrinsic Procedures \\
                 13.1. Intrinsic Procedure Terms and Concepts \\
                 13.2. Representation Models \\
                 13.3. Inquiry and Numeric Manipulation Functions \\
                 13.4. Transfer and Conversion Functions \\
                 13.5. Computation Functions \\
                 13.6. Array Functions \\
                 13.7. Intrinsic Subroutines \\
                 13.8. Alphabetical List of All Intrinsic Procedures.
                 13.9. Specific Names for Generic Intrinsic Procedures.
                 13.10. Summary \\
                 14. Scope, Association, and Definition \\
                 14.1. The Use of Names \\
                 14.2. Scope \\
                 14.3. Association \\
                 14.4. Definition Status \\
                 Appendix A: Intrinsic Procedures \\
                 Appendix B: Fortran 90 Syntax \\
                 B.1. The Form of the Syntax \\
                 B.2. Syntax Rules and Constraints \\
                 B.3. Cross References \\
                 Appendix C: Decremental Features \\
                 C.1. Deleted Features \\
                 C.2. Obsolescent Features",
  xxauthor =     "Jeanne C. Adams and Walter S. Brainerd and Jeanne T.
                 Martin",
}

@Book{Adams:1997:FHC,
  editor =       "Jeanne C. Adams and Walter S. Brainerd and Jeanne T.
                 Martin and Brian T. Smith and Jerrold L. Wagener",
  title =        "{Fortran 95} Handbook: Complete {ISO\slash ANSI}
                 Reference",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "xii + 711",
  month =        nov,
  year =         "1997",
  ISBN =         "0-262-51096-0",
  ISBN-13 =      "978-0-262-51096-7",
  LCCN =         "QA76.73.F25 F6 1997",
  bibdate =      "Fri Dec 19 10:45:21 1997",
  bibsource =    "http://www.amazon.com/exec/obidos/ISBN=0262510960/wholesaleproductA/;
                 http://www.cbooks.com/;
                 https://www.math.utah.edu/pub/tex/bib/fortran3.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Scientific and Engineering Computation",
  URL =          "http://www.cbooks.com/sqlnut/SP/search/gtsumt?source=&isbn=0262510960;
                 http://www.mitpress.com/book-home.tcl?isbn=0262510960",
  abstract =     "The \booktitle{Fortran 95 Handbook}, a comprehensive
                 reference work for the Fortran Programmer and
                 Implementor, contains a complete description of the
                 Fortran 95 programming language. The chapters follow
                 the same sequence of topics as the Fortran 95 standard,
                 but contain a more thorough and informal explanation of
                 the language's features and many more examples.
                 Appendices describe all the intrinsic features, the
                 deprecated features, and the complete syntax of the
                 language. In addition to an unusually thorough topical
                 index, there is an index of examples. Major new
                 features added in Fortran 95 are the FORALL statement
                 and construct, pure and elemental procedures, and
                 structure and pointer default initialization.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: What is Fortran 95? \\
                 2: Getting started \\
                 3: Types of data \\
                 4: Introducing arrays \\
                 5: Intrinsic procedures \\
                 6: Execution control \\
                 7: Introducing external procedures \\
                 8: More about data; the type declaration statement \\
                 9: Arrays and data manipulation \\
                 10: Modules \\
                 11: More about procedures \\
                 12: Advanced array features and derived types \\
                 13: Pointers \\
                 14: Overview \\
                 15: High Performance Fortran \\
                 Appendix A: Input and output \\
                 Appendix B: Bits \\
                 Appendix C: ISO\_VARYING\_STRINGS \\
                 Appendix D: Fortran 95's new features: summary \\
                 Appendix E: Fortran 95 statements \\
                 Appendix F: Fortran 95 intrinsic procedures \\
                 Appendix G: Answers to selected exercises",
}

@Book{Adkins:2020:BSR,
  author =       "Heather Adkins and Betsy Beyer and Paul Blankinship
                 and Piotr Lewandowski and Ana Oprea and Adam
                 Stubblefield",
  title =        "Building Secure and Reliable Systems: Best Practices
                 for Designing, Implementing, and Maintaining Systems",
  publisher =    pub-ORA-MEDIA,
  address =      pub-ORA-MEDIA:adr,
  pages =        "xxxiv + 519",
  year =         "2020",
  ISBN =         "1-4920-8309-7 (e-book), 1-4920-8312-7 (paperback)",
  ISBN-13 =      "978-1-4920-8309-2 (e-book), 978-1-4920-8312-2
                 (paperback)",
  LCCN =         "TK5105.59 .A375 2020",
  bibdate =      "Tue May 6 09:33:34 MDT 2025",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Can a system be considered truly reliable if it isn't
                 fundamentally secure? Or can it be considered secure if
                 it's unreliable? Security is crucial to the design and
                 operation of scalable systems in production, as it
                 plays an important part in product quality,
                 performance, and availability. In this book, experts
                 from Google share best practices to help your
                 organization design scalable and reliable systems that
                 are fundamentally secure. Two previous O'Reilly books
                 from Google-- Site Reliability Engineering and The Site
                 Reliability Workbook --demonstrated how and why a
                 commitment to the entire service lifecycle enables
                 organizations to successfully build, deploy, monitor,
                 and maintain software systems. In this latest guide,
                 the authors offer insights into system design,
                 implementation, and maintenance from practitioners who
                 specialize in security and reliability. They also
                 discuss how building and adopting their recommended
                 best practices requires a culture that's supportive of
                 such change. You'll learn about secure and reliable
                 systems through: Design strategies Recommendations for
                 coding, testing, and debugging practices Strategies to
                 prepare for, respond to, and recover from incidents
                 Cultural best practices that help teams across your
                 organization collaborate effectively.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Computer networks; Security measures; Computer
                 science; Information storage and retrieval systems;
                 Software engineering; Information technology; Data
                 protection; Electronic Data Processing; Information
                 Systems; R{\'e}seaux d'ordinateurs; S{\'e}curit{\'e};
                 Mesures; Informatique; Syst{\`e}mes d'information;
                 G{\'e}nie logiciel; Technologie de l'information;
                 Protection de l'information (Informatique)",
  tableofcontents = "Part 1. Introductory material. The intersection of
                 security and reliability \\
                 Understanding adversaries \\
                 Part 2. Designing systems. Case study: safe proxies \\
                 Design tradeoffs \\
                 Design for least privilege \\
                 Design for understandability \\
                 Design for a changing landscape \\
                 Design for resilience \\
                 Design for recovery \\
                 Mitigating denial-of-service attacks \\
                 Part 3. Implementing systems. Case study: designing,
                 implementing, and maintaining a publicly trusted CA \\
                 Writing code \\
                 Testing code \\
                 Deploying code \\
                 Investing systems \\
                 Part 4. Maintaining systems. Disaster planning \\
                 Crisis management \\
                 Recovery and aftermath \\
                 Part 5. Organization and culture. Case study: Chrome
                 security team \\
                 Understanding roles and responsibilities \\
                 Building a culture of security and reliability",
}

@Book{Adobe:1985:PLR,
  author =       "{Adobe Systems Incorporated}",
  title =        "{PostScript} Language Reference Manual",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "ix + 321",
  year =         "{\noopsort{1985a}}1985",
  ISBN =         "0-201-10174-2",
  ISBN-13 =      "978-0-201-10174-4",
  LCCN =         "QA76.73.P67 A33 1985",
  bibdate =      "Sat Oct 28 08:25:13 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Adobe:1985:PLT,
  author =       "{Adobe Systems Incorporated}",
  title =        "{PostScript} Language Tutorial and Cookbook",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "x + 243",
  year =         "{\noopsort{1985b}}1985",
  ISBN =         "0-201-10179-3",
  ISBN-13 =      "978-0-201-10179-9",
  LCCN =         "QA76.73.P67 A34 1985",
  bibdate =      "Sat Oct 28 08:25:05 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Stack and arithmetic \\
                 Beginning graphics \\
                 Procedures and variables \\
                 printing text \\
                 More graphics \\
                 Loops and conditional \\
                 Arrays \\
                 More fonts \\
                 Clipping and line details \\
                 Images \\
                 Postscript printers",
}

@Manual{Adobe:1988:DPS,
  author =       "Adobe Systems Incorporated",
  title =        "The Display {PostScript} System Reference",
  organization = pub-ADOBE,
  month =        oct # " 10",
  year =         "1988",
  bibdate =      "Sat Oct 28 08:25:11 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Manual{Adobe:1990:ATF,
  author =       "Adobe Systems Incorporated",
  title =        "{Adobe} Type 1 Font Format",
  organization = pub-ADOBE,
  address =      pub-ADOBE:adr,
  month =        mar,
  year =         "1990",
  bibdate =      "Sat Oct 28 08:25:07 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  partnumber =   "LPS0064",
}

@Book{Adobe:1990:PLR,
  author =       "{Adobe Systems Incorporated}",
  title =        "{PostScript} Language Reference Manual",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Second",
  pages =        "viii + 764",
  year =         "1990",
  ISBN =         "0-201-18127-4",
  ISBN-13 =      "978-0-201-18127-2",
  LCCN =         "QA76.73.P67 P67 1990",
  bibdate =      "Sat Oct 28 08:25:15 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/postscri.bib",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "Basic ideas \\
                 Language \\
                 Graphics \\
                 Fonts \\
                 Rendering \\
                 Display postscript \\
                 Operator \\
                 Appendices \\
                 Bibliography \\
                 Index",
  tableofcontents = "Preface \\
                 Introduction \\
                 About This Manual \\
                 Evolution of the PostScript Language \\
                 LanguageLevel 3 Overview \\
                 Related Publications \\
                 Copyrights and Trademarks \\
                 Basic Ideas \\
                 Raster Output Devices \\
                 Scan Conversion \\
                 Page Description Languages \\
                 Using the PostScript Language \\
                 Language \\
                 Interpreter \\
                 Syntax \\
                 Data Types and Objects \\
                 Stacks \\
                 Execution \\
                 Overview of Basic Operators \\
                 Memory Management \\
                 File Input and Output \\
                 Named Resources \\
                 Functions \\
                 Errors \\
                 Early Name Binding \\
                 Filtered Files Details \\
                 Binary Encoding Details \\
                 Graphics \\
                 Imaging Model \\
                 Graphics State \\
                 Coordinate Systems and Transformations \\
                 Path Construction \\
                 Painting \\
                 User Paths \\
                 Forms \\
                 Color Spaces \\
                 Patterns \\
                 Images \\
                 Fonts \\
                 Organization and Use of Fonts \\
                 Font Dictionaries \\
                 Character Encoding \\
                 Glyph Metric Information \\
                 Font Cache \\
                 Unique ID Generation \\
                 Type 3 Fonts \\
                 Additional Base Font Types \\
                 Font Derivation and Modification \\
                 Composite Fonts \\
                 CID-Keyed Fonts \\
                 Device Control \\
                 Using Page Devices \\
                 Page Device Parameters \\
                 In-RIP Trapping \\
                 Output Device Dictionary \\
                 Rendering \\
                 CIE-Based Color to Device Color \\
                 Conversions among Device Color Spaces \\
                 Transfer Functions \\
                 Halftones \\
                 Scan Conversion Details \\
                 Operators \\
                 Operator Summary \\
                 Operator Details \\
                 LanguageLevel Feature Summary \\
                 LanguageLevel 3 Features \\
                 LanguageLevel 2 Features \\
                 Incompatibilities \\
                 Implementation Limits \\
                 Typical Limits \\
                 Virtual Memory Use \\
                 Interpreter Parameters \\
                 Properties of User and System Parameters \\
                 Defined User and System Parameters \\
                 Details of User and System Parameters \\
                 Device Parameters \\
                 Compatibility Strategies \\
                 The LanguageLevel Approach \\
                 When to Provide Compatibility \\
                 Compatibility Techniques \\
                 Installing Emulations \\
                 Character Sets and Encoding Vectors \\
                 Times Family \\
                 Helvetica Family \\
                 Courier Family \\
                 Symbol \\
                 Standard Latin Character Set \\
                 StandardEncoding Encoding Vector \\
                 ISOLatin1Encoding Encoding Vector \\
                 CE Encoding Vector \\
                 Expert Character Set \\
                 Expert Encoding Vector \\
                 ExpertSubset Encoding Vector \\
                 Symbol Character Set 786 \\
                 Symbol Encoding Vector \\
                 System Name Encodings \\
                 Operator Usage Guidelines \\
                 Bibliography \\
                 Index",
  xxauthor =     "Ed Taft and Jeff Walden and Paul Engstrom",
}

@Book{Adobe:1993:PDP,
  author =       "{Adobe Systems Incorporated}",
  title =        "Programming the {Display PostScript System} with {X}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  year =         "1993",
  ISBN =         "0-201-62203-3",
  ISBN-13 =      "978-0-201-62203-4",
  LCCN =         "QA76.73.P67 D57 1993",
  bibdate =      "Sat Aug 27 10:53:05 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$29.95",
  acknowledgement = ack-nhfb,
}

@Book{Adobe:1997:AFA,
  author =       "{Adobe Press}",
  title =        "{Adobe FAQ}: {Adobe}'s most frequently asked questions
                 answered",
  publisher =    pub-ADOBE-PRESS,
  address =      pub-ADOBE-PRESS:adr,
  pages =        "xvi + 774",
  year =         "1997",
  ISBN =         "1-56830-372-6",
  ISBN-13 =      "978-1-56830-372-7",
  LCCN =         "QA76.754 .A36 1997",
  bibdate =      "Fri Aug 21 12:48:20 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Includes CD-ROM.",
  acknowledgement = ack-nhfb,
  annote =       "Covers Adobe Acrobat 3.0 (Capture, Distiller,
                 Exchange, Reader), After Effects 3.1, FontFolio 7.09,
                 Framemaker 5 Illustrator 7.0, PageMaker 6.5, PageMill
                 2.0, Persuasion 4.0 PhotoShop 4.0, Premiere 4.2
                 SiteMill 1.0, and Type Manager Deluxe.",
}

@Book{Adobe:1999:PLR,
  author =       "{Adobe Systems Incorporated}",
  title =        "{PostScript} Language Reference",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Third",
  pages =        "xii + 897",
  year =         "1999",
  ISBN =         "0-201-37922-8",
  ISBN-13 =      "978-0-201-37922-8",
  LCCN =         "QA76.73.P67 P67 1999",
  bibdate =      "Tue Dec 05 18:14:16 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "This new edition defines PostScript Language Level 3.
                 An electronic version of the book is available at the
                 Adobe Web site, and is also included in a CD-ROM
                 attached to the book.",
  price =        "US\$49.95, CDN\$74.95",
  URL =          "http://partners.adobe.com/asn/developer/PDFS/TN/PLRM.pdf;
                 http://partners.adobe.com/supportservice/devrelations/PDFS/TN/PLRM.pdf",
  acknowledgement = ack-nhfb,
  tableofcontents = "Preface \\
                 Introduction \\
                 About This Manual \\
                 Evolution of the PostScript Language \\
                 LanguageLevel 3 Overview \\
                 Related Publications \\
                 Copyrights and Trademarks \\
                 Basic Ideas \\
                 Raster Output Devices \\
                 Scan Conversion \\
                 Page Description Languages \\
                 Using the PostScript Language \\
                 Language \\
                 Interpreter \\
                 Syntax \\
                 Data Types and Objects \\
                 Stacks \\
                 Execution \\
                 Overview of Basic Operators \\
                 Memory Management \\
                 File Input and Output \\
                 Named Resources \\
                 Functions \\
                 Errors \\
                 Early Name Binding \\
                 Filtered Files Details \\
                 Binary Encoding Details \\
                 Graphics \\
                 Imaging Model \\
                 Graphics State \\
                 Coordinate Systems and Transformations \\
                 Path Construction \\
                 Painting \\
                 User Paths \\
                 Forms \\
                 Color Spaces \\
                 Patterns \\
                 Images \\
                 Fonts \\
                 Organization and Use of Fonts \\
                 Font Dictionaries \\
                 Character Encoding \\
                 Glyph Metric Information \\
                 Font Cache \\
                 Unique ID Generation \\
                 Type 3 Fonts \\
                 Additional Base Font Types \\
                 Font Derivation and Modification \\
                 Composite Fonts \\
                 CID-Keyed Fonts \\
                 Device Control \\
                 Using Page Devices \\
                 Page Device Parameters \\
                 In-RIP Trapping \\
                 Output Device Dictionary \\
                 Rendering \\
                 CIE-Based Color to Device Color \\
                 Conversions among Device Color Spaces \\
                 Transfer Functions \\
                 Halftones \\
                 Scan Conversion Details \\
                 Operators \\
                 Operator Summary \\
                 Operator Details \\
                 LanguageLevel Feature Summary \\
                 LanguageLevel 3 Features \\
                 LanguageLevel 2 Features \\
                 Incompatibilities \\
                 Implementation Limits \\
                 Typical Limits \\
                 Virtual Memory Use \\
                 Interpreter Parameters \\
                 Properties of User and System Parameters \\
                 Defined User and System Parameters \\
                 Details of User and System Parameters \\
                 Device Parameters \\
                 Compatibility Strategies \\
                 The LanguageLevel Approach \\
                 When to Provide Compatibility \\
                 Compatibility Techniques \\
                 Installing Emulations \\
                 Character Sets and Encoding Vectors \\
                 Times Family \\
                 Helvetica Family \\
                 Courier Family \\
                 Symbol \\
                 Standard Latin Character Set \\
                 StandardEncoding Encoding Vector \\
                 ISOLatin1Encoding Encoding Vector \\
                 CE Encoding Vector \\
                 Expert Character Set \\
                 Expert Encoding Vector \\
                 ExpertSubset Encoding Vector \\
                 Symbol Character Set 786 \\
                 Symbol Encoding Vector \\
                 System Name Encodings \\
                 Operator Usage Guidelines \\
                 Bibliography \\
                 Index",
}

@Book{Adobe:2000:PRA,
  author =       "{Adobe Systems Incorporated}",
  title =        "{PDF} Reference: {Adobe} Portable Document Format,
                 Version 1.3",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Second",
  pages =        "xvi + 679",
  year =         "2000",
  ISBN =         "0-201-61588-6 (paperback)",
  ISBN-13 =      "978-0-201-61588-3 (paperback)",
  LCCN =         "QA76.76.T49 P38 2000",
  bibdate =      "Wed Sep 20 11:06:40 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/postscri.bib",
  price =        "US\$49.95",
  URL =          "http://partners.adobe.com/asn/developer/acrosdk/DOCS/PDFRef.pdf",
  acknowledgement = ack-nhfb,
}

@Book{Adobe:AT1.190,
  author =       "Adobe Systems Incorporated",
  title =        "{Adobe} Type 1 Font Format---Version 1.1",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "iii + 103",
  month =        aug,
  year =         "1990",
  ISBN =         "0-201-57044-0",
  ISBN-13 =      "978-0-201-57044-1",
  LCCN =         "QA76.73.P67 A36 1990",
  bibdate =      "Sat Oct 28 08:24:48 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$14.95",
  URL =          "http://partners.adobe.com/asn/developer/pdfs/tn/T1_SPEC.PDF",
  acknowledgement = ack-nhfb,
}

@Misc{Adobe:colophon,
  author =       "Adobe Systems Incorporated",
  title =        "{Colophon}: {Adobe Systems News} {Publication}",
  bibdate =      "Sat Oct 28 08:25:09 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@TechReport{Adobe:docstruct-spec,
  author =       "{PostScript Developer Support Group}",
  title =        "{Document Structuring Conventions} Specification,
                 Version 2.1",
  number =       "PN LPS5001",
  institution =  pub-ADOBE,
  address =      pub-ADOBE:adr,
  month =        jan # " 16",
  year =         "1989",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Available electronically from
                 \path|ps-file-server@adobe.com| in response to an
                 e-mail request {\tt send Documents
                 \path|struct.ps.Zba|}. The request {\tt send Index}
                 will return a complete index for the server.",
  acknowledgement = ack-nhfb,
}

@TechReport{Adobe:epsf-spec,
  author =       "{Adobe PostScript Developer Support Group}",
  title =        "{Encapsulated PostScript Files} Specification Version
                 2.0",
  number =       "PN LPS5002",
  institution =  pub-ADOBE,
  address =      pub-ADOBE:adr,
  month =        jun # " 5",
  year =         "1989",
  bibdate =      "Sat Aug 27 10:55:59 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Available electronically from
                 \path|ps-file-server@adobe.com| in response to an
                 e-mail request {\tt send Documents EPSF.ps.Zba}. The
                 request {\tt send Index} will return a complete index
                 for the server. The version 3.0 specification is
                 published in \cite[Appendix~H]{Adobe:1990:PLR}.",
  acknowledgement = ack-nhfb,
}

@Book{Aho:1972:TPT,
  author =       "Alfred V. Aho and Jeffrey D. Ullman",
  title =        "The Theory of Parsing, Translation, and Compiling.
                 {I}: Parsing",
  volume =       "I",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xviii + 542",
  year =         "1972",
  ISBN =         "0-13-914556-7",
  ISBN-13 =      "978-0-13-914556-8",
  LCCN =         "QA76.6 .A286 1972-73",
  bibdate =      "Wed Dec 15 15:01:28 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "0: Mathematical preliminaries \\
                 1: An introduction to compiling \\
                 2: Elements of language theory \\
                 3: Theory of translation \\
                 4: General parsing methods \\
                 5: One-pass no backtrack parsing \\
                 6: Limited backtrack parsing algorithms",
}

@Book{Aho:1973:TPT,
  author =       "Alfred V. Aho and Jeffrey D. Ullman",
  title =        "The Theory of Parsing, Translation, and Compiling.
                 {II}. {Compiling}",
  volume =       "II",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xiii + 460",
  year =         "1973",
  ISBN =         "0-13-914564-8",
  ISBN-13 =      "978-0-13-914564-3",
  LCCN =         "QA76.6 .A286 1972-73",
  bibdate =      "Wed Dec 15 15:01:25 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "7: Techniques for parser optimization \\
                 8: Theory of deterministic parsing \\
                 9: Translation and code generation \\
                 10: Bookkeeping \\
                 11: Code optimization",
}

@Book{Aho:1974:DAC,
  author =       "Alfred V. Aho and John E. Hopcroft and Jeffrey D.
                 Ullman",
  title =        "The Design and Analysis of Computer Algorithms",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "x + 470",
  year =         "1974",
  ISBN =         "0-201-00029-6",
  ISBN-13 =      "978-0-201-00029-0",
  LCCN =         "QA76.6 .A284 1974",
  bibdate =      "Tue Dec 14 22:34:07 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "1. Models of computation \\
                 2. Design of efficient algorithms \\
                 3. Sorting and order statistics \\
                 4. Data structures for set manipulation problems \\
                 5. Algorithms on graphs \\
                 6. Matrix multiplication and related operations \\
                 7. The Fast Fourier Transform and its applications \\
                 8. Integer and polynomial arithmetic \\
                 9. Pattern-matching algorithms \\
                 10. NP-complete problems \\
                 11. Some provably intractable problems \\
                 12. Lower bounds on numbers of arithmetic operations",
}

@Book{Aho:1977:PCD,
  author =       "Alfred V. Aho and Jeffrey D. Ullman",
  title =        "Principles of Compiler Design",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "x + 604",
  year =         "1977",
  ISBN =         "0-201-00022-9 (hardcover), 0-201-10073-8",
  ISBN-13 =      "978-0-201-00022-1 (hardcover), 978-0-201-10073-0",
  LCCN =         "QA76.6 .A285 1977",
  bibdate =      "Tue Dec 14 22:34:24 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fortran1.bib;
                 https://www.math.utah.edu/pub/tex/bib/fortran2.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  note =         "See also the much expanded subsequent book
                 \cite{Aho:1986:CPC}.",
  acknowledgement = ack-nhfb,
  remark =       "This is commonly called the ``green dragon'' book,
                 after its colorful cover design.",
  tableofcontents = "1: Introduction to Compilers \\
                 1.1 Compilers and translators / 1 \\
                 1.2 Why do we need translators? / 3 \\
                 1.3 The structure of a compiler / 5 \\
                 1.4 Lexical analysis / 10 \\
                 1.5 Syntax analysis / 12 \\
                 1.6 Intermediate code generation / 13 \\
                 1.7 Optimization / 17 \\
                 1.8 Code generation / 19 \\
                 1.9 Bookkeeping / 20 \\
                 1.10 Error handling / 21 \\
                 1.11 Compiler-writing tools / 21 \\
                 1.12 Getting started / 23 \\
                 2: Programming Languages \\
                 2.1 High-level programming languages / 26 \\
                 2.2 Definitions of programming languages / 28 \\
                 2.3 The lexical and syntactic structure of a language /
                 32 \\
                 2.4 Data elements / 34 \\
                 2.5 Data structures / 38 \\
                 2.6 Operators / 45 \\
                 2.7 Assignment / 50 \\
                 2.8 Statements / 53 \\
                 2.9 Program units / 55 \\
                 2.10 Data environments / 57 \\
                 2.11 Parameter transmission / 59 \\
                 2.12 Storage management / 63 \\
                 3: Finite Automata and Lexical Analysis \\
                 3.1 The role of the lexical analyzer 7 / 4 \\
                 3.2 A simple approach to the design of lexical
                 analyzers / 76 \\
                 3.3 Regular expressions / 82 \\
                 3.4 Finite automata / 88 \\
                 3.5 From regular expressions to finite automata / 95
                 \\
                 3.6 Minimizing the number of slates of a DFA / 99 \\
                 3.7 A language for specifying lexical analyzers / 103
                 \\
                 3.8 Implementation of a lexical analyzer / 109 \\
                 3.9 The scanner generator as Swiss army knife / 118 \\
                 4: The Syntactic Specification of Programming Languages
                 \\
                 4.1 Context-free grammars / 126 \\
                 4.2 Derivations and parse trees / 129 \\
                 4.3 Capabilities of context-free grammars / 136 \\
                 5: Basic Parsing Techniques \\
                 5.1 Parsers / 146 \\
                 5.2 Shift--reduce parsing / 150 \\
                 5.3 Operator-precedence parsing / 158 \\
                 5.4 Top-down parsing / 174 \\
                 5.5 Predictive parsers / 184 \\
                 6: Automatic Construction of Efficient Parsers \\
                 6.1 LR parsers / 198 \\
                 6.2 The canonical collection of LR(0) items / 204 \\
                 6.3 Constructing SLR parsing tables / 211 \\
                 6.4 Constructing canonical LR parsing tables / 214 \\
                 6.5 Constructing LALR parsing tables / 219 \\
                 6.6 Using ambiguous grammars / 225 \\
                 6.7 An automatic parser generator / 229 \\
                 6.8 Implementation of LR parsing tables / 233 \\
                 6.9 Constructing LALR sets of items / 236 \\
                 7: Syntax-Directed Translation \\
                 7.1 Syntax-directed translation schemes / 246 \\
                 7.2 Implementation of syntax-directed translators / 249
                 \\
                 7.3 Intermediate code / 254 \\
                 7.4 Postfix notation / 254 \\
                 7.5 Parse trees and syntax trees / 258 \\
                 7.6 Three-address code, quadruples, and triples / 259
                 \\
                 7.7 Translation of assignment statements / 265 \\
                 7.8 Boolean expressions / 271 \\
                 7.9 Statements that alter the flow of control / 281 \\
                 7.10 Postfix translations / 286 \\
                 7.11 Translation with a top-down parser / 290 \\
                 8: More About Translation \\
                 8.1 Array references in arithmetic expressions / 296
                 \\
                 8.2 Procedure calls / 303 \\
                 8.3 Declarations / 307 \\
                 8.4 Case statements / 308 \\
                 8.5 Record structures / 312 \\
                 8.6 PL/I-style structures / 317 \\
                 9: Symbol Tables \\
                 9.1 The contents of a symbol table / 328 \\
                 9.2 Data structures for symbol tables / 336 \\
                 9.3 Representing scope information / 341 \\
                 10: Run-time Storage Administration \\
                 10.1 Implementation of a simple stack allocation scheme
                 / 351 \\
                 10.2 Implementation of block-structured languages / 356
                 \\
                 10.3 Storage allocation in FORTRAN / 364 \\
                 10.4 Storage allocation in block-structured languages /
                 377 \\
                 11: Error Detection and Recovery \\
                 11.1 Errors / 382 \\
                 11.2 Lexical-phase errors / 388 \\
                 11.3 Syntactic-phase errors / 391 \\
                 11.4 Semantic errors / 402 \\
                 12: Introduction to Code Optimization \\
                 12.1 The principal sources of optimization / 408 \\
                 12.2 Loop optimization / 410 \\
                 12.3 The DAG representation of basic blocks / 418 \\
                 12.4 Value numbers and algebraic laws / 427 \\
                 12.5 Global data-flow analysis / 429 \\
                 13: More About Loop Optimization \\
                 13.1 Dominators / 442 \\
                 13.2 Reducible flow graphs / 447 \\
                 13.3 Depth-first search / 449 \\
                 13.4 Loop-invariant computations / 454 \\
                 13.5 Induction variable elimination / 466 \\
                 13.6 Some other loop optimizations / 471 \\
                 14: More About Data-Flow Analysis \\
                 14.1 Reaching definitions again / 478 \\
                 14.2 Available expressions / 482 \\
                 14.3 Copy propagation / 487 \\
                 14.4 Backward flow problems / 489 \\
                 14.5 Very busy expressions and code hoisting / 491 \\
                 14.6 The four kinds of data-flow analysis problems /
                 497 \\
                 14.7 Handling pointers / 499 \\
                 14.8 Interprocedural data-flow analysis / 504 \\
                 14.9 Putting it all together / 511 \\
                 15: Code Generation \\
                 15.1 Object programs / 518 \\
                 15.2 Problems in code generation / 521 \\
                 15.3 A machine model / 523 \\
                 15.4 A simple code generator / 525 \\
                 15.5 Register allocation and assignment / 533 \\
                 15.6 Code generation from DAG's / 537 \\
                 15.7 Peephole optimization / 548 \\
                 Appendix A: A Look at Some Compilers \\
                 A.1 The C compilers / 557 \\
                 A.2 The FORTRAN H compiler / 559 \\
                 A.3 The BLISS/11 compiler / 561 \\
                 Appendix B: A Compiler Project \\
                 B.1 Introduction / 563 \\
                 B.2 A PASCAL Subset / 563 \\
                 B.3 Program structure / 566 \\
                 B.4 Lexical conventions / 566 \\
                 B.5 Suggested exercises / 567 \\
                 B.6 Some extensions / 569 \\
                 Bibliography / 570 \\
                 Index / 592",
}

@Book{Aho:1986:CPC,
  author =       "Alfred V. Aho and Ravi Sethi and Jeffrey D. Ullman",
  title =        "Compilers: Principles, Techniques, and Tools",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "x + 796",
  year =         "1986",
  ISBN =         "0-201-10088-6 (hardcover), 0-201-10194-7 (paperback)",
  ISBN-13 =      "978-0-201-10088-4 (hardcover), 978-0-201-10194-2
                 (paperback)",
  LCCN =         "QA76.76.C65 A371 1986",
  bibdate =      "Tue Dec 14 22:33:59 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fortran2.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  note =         "See \cite{Aho:1977:PCD}.",
  acknowledgement = ack-nhfb,
  remark =       "This is commonly called the ``red dragon'' book, after
                 its colorful cover design.",
  shorttableofcontents = "1: Introduction to Compiling / 1 \\
                 2: A Simple One-Pass Compiler / 25 \\
                 3: Lexical Analysis / 83 \\
                 4: Syntax Analysis / 159 \\
                 5: Syntax-Directed Translation / 279 \\
                 6: Type Checking / 343 \\
                 7: Run-Time Environments / 389 \\
                 8: Intermediate Code Generation / 463 \\
                 9: Code Generation / 513 \\
                 10: Code Optimization / 585 \\
                 11: Want to Write a Compiler? / 723 \\
                 12: A Look at Some Compilers / 733 \\
                 Appendix A: Compiler Project / 745 \\
                 Bibliography / 752 \\
                 Index / 780",
  tableofcontents = "1: Introduction to Compiling / 1 \\
                 1.1 Compilers / 1 \\
                 1.2 Analysis of the source program / 4 \\
                 1.3 The phases of a compiler / 10 \\
                 1.4 Cousins of the compiler / 16 \\
                 1.5 The grouping of phases / 20 \\
                 1.6 Compiler-construction tools / 22 \\
                 Bibliographic notes / 23 \\
                 2: A Simple One-Pass Compiler / 25 \\
                 2.1 Overview / 25 \\
                 2.2 Syntax definition / 26 \\
                 2.3 Syntax-directed translation / 33 \\
                 2.4 Parsing / 40 \\
                 2.5 A translator for simple expressions / 48 \\
                 2.6 Lexical analysis / 54 \\
                 2.7 Incorporating a symbol table / 60 \\
                 2.8 Abstract stack machines / 62 \\
                 2.9 Putting the techniques together / 69 \\
                 Exercises / 78 \\
                 Bibliographic notes / 81 \\
                 3: Lexical Analysis / 83 \\
                 3.1 The role of the lexical analyzer / 84 \\
                 3.2 Input buffering / 88 \\
                 3.3 Specification of tokens / 92 \\
                 3.4 Recognition of tokens / 98 \\
                 3.5 A language for specifying lexical analyzers / 105
                 \\
                 3.6 Finite automata / 113 \\
                 3.7 From a regular expression to an NFA / 121 \\
                 3.8 Design of a lexical analyzer generator / 128 \\
                 3.9 Optimization of DFA-based pattern matchers / 134
                 \\
                 Exercises / 146 \\
                 Bibliographic notes / 157 \\
                 4: Syntax Analysis / 159 \\
                 4.1 The role of the par ser / 160 \\
                 4.2 Context-free grammars / 165 \\
                 4.3 Writing a grammar / 172 \\
                 4.4 Top-down parsing / 181 \\
                 4.5 Bottom-up par sing / 195 \\
                 4.6 Operator-precedence parsing / 203 \\
                 4.7 LR parsers / 215 \\
                 4.8 Using ambiguous grammars / 247 \\
                 4.9 Parser generators / 257 \\
                 Exercises / 267 \\
                 Bibliographic notes / 277 \\
                 5: Syntax-Directed Translation / 279 \\
                 5.1 Syntax-directed definitions / 280 \\
                 5.2 Construction of syntax trees / 287 \\
                 5.3 Bottom-up evaluation of S-attributed definitions /
                 293 \\
                 5.4 L-attributed definitions / 296 \\
                 5.5 Top-down translation / 302 \\
                 5.6 Bottom-up evaluation of inherited attributes / 308
                 \\
                 5.7 Recursive evaluators / 316 \\
                 5.8 Space for attribute values at compile time / 320
                 \\
                 5.9 Assigning space at compiler-construction time / 323
                 \\
                 5.10 Analysis of syntax-directed definitions / 329 \\
                 Exercises / 336 \\
                 Bibliographic notes / 340 \\
                 6: Type Checking / 343 \\
                 6.1 Type systems / 344 \\
                 6.2 Specification of a simple type checker / 348 \\
                 6.3 Equivalence of type expressions / 352 \\
                 6.4 Type conversions / 359 \\
                 6.5 Overloading of functions and operators / 361 \\
                 6.6 Polymorphic functions / 364 \\
                 6.7 An algorithm for unification / 376 \\
                 Exercises / 381 \\
                 Bibliographic notes / 386 \\
                 7: Run-Time Environments / 389 \\
                 7.1 Source language issues / 389 \\
                 7.2 Storage organization / 396 \\
                 7.3 Storage-allocation strategies / 401 \\
                 7.4 Access to nonlocal names / 411 \\
                 7.5 Parameter passing / 424 \\
                 7.6 Symbol tables / 429 \\
                 7.7 Language facilities for dynamic storage allocation
                 / 440 \\
                 7.8 Dynamic storage allocation techniques / 442 \\
                 7.9 Storage allocation in Fortran / 446 \\
                 Exercises / 455 \\
                 Bibliographic notes / 461 \\
                 8: Intermediate Code Generation / 463 \\
                 8.1 Intermediate languages / 464 \\
                 8.2 Declarations / 473 \\
                 8.3 Assignment statements / 478 \\
                 8.4 Boolean expressions / 488 \\
                 8.5 Case statements / 497 \\
                 8.6 Back patching / 500 \\
                 8.7 Procedure calls / 506 \\
                 Exercises / 508 \\
                 Bibliographic notes / 511 \\
                 9: Code Generation / 513 \\
                 9.1 Issues in the design of a code generator / 514 \\
                 9.2 The target machine / 519 \\
                 9.3 Run-time storage management / 522 \\
                 9.4 Basic blocks and flow graphs / 528 \\
                 9.5 Next-use information / 534 \\
                 9.6 A simple code generator / 535 \\
                 9.7 Register allocation and assignment / 541 \\
                 9.8 The dag representation of basic blocks / 546 \\
                 9.9 Peephole optimization / 554 \\
                 9.10 Generating code from dags / 557 \\
                 9.11 Dynamic programming code-generation algorithm /
                 567 \\
                 9.12 Code-generator generators / 572 \\
                 Exercises / 580 \\
                 Bibliographic notes / 583 \\
                 10: Code Optimization / 585 \\
                 1O.1 Introduction / 586 \\
                 10.2 The principal sources of optimization / 592 \\
                 10.3 Optimization of basic blocks / 598 \\
                 10.4 Loops in flow graphs / 602 \\
                 10.5 Introduction to global data-flow analysis / 608
                 \\
                 10.6 Iterative solution of data-flow equations / 624
                 \\
                 10.7 Code-improving transformations / 633 \\
                 10.8 Dealing with aliases / 648 \\
                 10.9 Data-flow analysis of structured flow graphs / 660
                 \\
                 10.10 Efficient data-flow algorithms / 671 \\
                 10.11 A tool for data-flow analysis / 680 \\
                 10.12 Estimation of types / 694 \\
                 10.13 Symbolic debugging of optimized code / 703 \\
                 Exercises / 711 \\
                 Bibliographic notes / 718 \\
                 11: Want to Write a Compiler? / 723 \\
                 11.1 Planning a compiler / 723 \\
                 11.2 Approaches to compiler development / 725 \\
                 11.3 The compiler-development environment / 729 \\
                 11.4 Testing and maintenance / 731 \\
                 12: A Look at Some Compilers / 733 \\
                 12.1 EQN, a preprocessor for typesetting mathematics /
                 733 \\
                 12.2 Compilers for Pascal / 734 \\
                 12.3 The C compilers / 735 \\
                 12.4 The Fortran H compilers / 737 \\
                 12.5 The Bliss/11 compiler / 740 \\
                 12.6 Modula-2 optimizing compiler / 742 \\
                 Appendix A: Compiler Project / 745 \\
                 A.1 Introduction / 745 \\
                 A.2 A Pascal subset / 745 \\
                 A.3 Program structure / 745 \\
                 A.4 Lexical conventions / 748 \\
                 A.5 Suggested exercises / 749 \\
                 A.6 Evolution of the interpreter / 750 \\
                 A.7 Extensions / 751 \\
                 Bibliography / 752 \\
                 Index / 780",
}

@Book{Aho:1988:APL,
  author =       "Alfred V. Aho and Brian W. Kernighan and Peter J.
                 Weinberger",
  key =          "AWK87",
  title =        "The {AWK} Programming Language",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "x + 210",
  year =         "1988",
  ISBN =         "0-201-07981-X",
  ISBN-13 =      "978-0-201-07981-4",
  LCCN =         "QA76.73.A95 A35 1988",
  MRclass =      "68N15, 68-01, 68N20, 68N25",
  bibdate =      "Sun May 02 07:44:41 1999",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
                 https://www.math.utah.edu/pub/bibnet/subjects/han-wri-mat-sci-2ed.bib;
                 https://www.math.utah.edu/pub/tex/bib/css.bib;
                 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",
  note =         "See also \cite{FSF:gawk,MKS:awk,Polytron:polyawk}.",
  ZMnumber =     "0751.68009",
  acknowledgement = ack-nhfb,
  nb =           "the author order is AKW, but the key looks better as
                 AWK",
  shorttableofcontents = "1: An AWK Tutorial / \\
                 2: The AWK Language / \\
                 3: Data Processing / \\
                 4: Reports and Databases / \\
                 5: Processing Words / \\
                 6: Little Languages / \\
                 7: Experiments with Algorithms / \\
                 Make: A File Updating Program / \\
                 8: Epilog / \\
                 Appendix A: AWK Summary / \\
                 Appendix B: Answers to Selected Exercises / \\
                 Index",
  tableofcontents = "Preface / \\
                 1: An AWK Tutorial / \\
                 Getting Started / \\
                 Simple Output / \\
                 Fancier Output / \\
                 Selection / \\
                 Computing with AWK / \\
                 Control-Flow Statements / \\
                 Arrays / \\
                 A Handful of Useful ``One-liners'' / \\
                 What Next? / \\
                 2: The AWK Language / \\
                 Patterns / \\
                 Actions / \\
                 User-Defined Functions / \\
                 Output / \\
                 Input / \\
                 Interaction with Other Programs / \\
                 Summary / \\
                 3: Data Processing / \\
                 Data Transformation and Reduction / \\
                 Data Validation / \\
                 Bundle and Unbundle / \\
                 Multiline Records / \\
                 Summary / \\
                 4: Reports and Databases / \\
                 Generating Reports / \\
                 Packaged Queries / \\
                 A Relational Database System / \\
                 Summary / \\
                 5: Processing Words / \\
                 Random Text Generation / \\
                 Interactive Text-Manipulation / \\
                 Text Processing / \\
                 Summary / \\
                 6: Little Languages / \\
                 An Assembler and Interpreter / \\
                 A Language for Drawing Graphs / \\
                 A Sort Generator / \\
                 A Reverse-Polish Calculator / \\
                 An Infix Calculator / \\
                 Recursive-Descent Parsing / \\
                 Summary / \\
                 7: Experiments with Algorithms / \\
                 Sorting / \\
                 Profiling / \\
                 Topological Sorting / \\
                 Make: A File Updating Program / \\
                 Summary / \\
                 8: Epilog / \\
                 AWK as a Language / \\
                 Performance / \\
                 Conclusion / \\
                 Appendix A: AWK Summary / \\
                 Appendix B: Answers to Selected Exercises / \\
                 Index",
}

@Book{Aho:2007:CPT,
  editor =       "Alfred V. Aho and Monica S. Lam and Ravi Sethi and
                 Jeffrey D. Ullman",
  title =        "Compilers: Principles, Techniques, and Tools",
  publisher =    "Pearson/Addison Wesley",
  address =      "Boston, MA, USA",
  edition =      "Second",
  pages =        "xxiv + 1009",
  year =         "2007",
  ISBN =         "0-321-48681-1 (hardcover), 0-321-49169-6 (paperback)",
  ISBN-13 =      "978-0-321-48681-3 (hardcover), 978-0-321-49169-5
                 (paperback)",
  LCCN =         "QA76.76.C65 A37 2007",
  bibdate =      "Tue Jan 30 16:21:16 MST 2007",
  bibsource =    "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/ecip0618/2006024333.html",
  abstract =     "This new edition of the classic `Dragon' book has been
                 completely revised to include the most recent
                 developments to compiling. The book provides a thorough
                 introduction to compiler design and continues to
                 emphasize the applicability of compiler technology to a
                 broad range of problems in software design and
                 development. The first half of the book is designed for
                 use in an undergraduate compilers course while the
                 second half can be used in a graduate course stressing
                 code optimization.",
  acknowledgement = ack-nhfb,
  remark =       "Revised edition of \cite{Aho:1986:CPC}. This is
                 commonly called the ``purple dragon'' book, after its
                 colorful cover design.",
  shorttableofcontents = "1: Introduction / 1 \\
                 2: A Simple Syntax-Directed Translator / 39 \\
                 3: Lexical Analysis / 109 \\
                 4: Syntax Analysis / 191 \\
                 5: Syntax-Directed Translation / 303 \\
                 6: Intermediate-Code Generation / 357 \\
                 7: Run-Time Environments / 427 \\
                 8: Code Generation / 505 \\
                 9: Machine-Independent Optimizations / 583 \\
                 10: Instruction-Level Parallelism / 707 \\
                 11: Optimizing for Parallelism and Locality / 769 \\
                 12: Interprocedural Analysis / 903 \\
                 A: A Complete Front End / 965 \\
                 B: Finding Linearly Independent Solutions / 989 \\
                 Index / 993",
  subject =      "Compilers (Computer programs)",
  tableofcontents = "1: Introduction / 1 \\
                 1.1 Language Processors / 1 \\
                 1.1.1 Exercises for Section 1.1 / 3 \\
                 1.2 The Structure of a Compiler / 4 \\
                 1.2.1 Lexical Analysis / 5 \\
                 1.2.2 Syntax Analysis / 8 \\
                 1.2.3 Semantic Analysis / 8 \\
                 1.2.4 Intermediate Code Generation / 9 \\
                 1.2.5 Code Optimization / 10 \\
                 1.2.6 Code Generation / 10 \\
                 1.2.7 Symbol-Table Management / 11 \\
                 1.2.8 The Grouping of Phases into Passes / 11 \\
                 1.2.9 Compiler-Construction Tools / 12 \\
                 1.3 The Evolution of Programming Languages / 12 \\
                 1.3.1 The Move to Higher-level Languages / 13 \\
                 1.3.2 Impacts on Compilers / 14 \\
                 1.3.3 Exercises for Section 1.3 / 14 \\
                 1.4 The Science of Building a Compiler / 15 \\
                 1.4.1 Modeling in Compiler Design and Implementation /
                 15 \\
                 1.4.2 The Science of Code Optimization / 15 \\
                 1.5 Applications of Compiler Technology / 17 \\
                 1.5.1 Implementation of High-Level Programming
                 Languages / 17 \\
                 1.5.2 Optimizations for Computer Architectures / 19 \\
                 1.5.3 Design of New Computer Architectures / 21 \\
                 1.5.4 Program Translations / 22 \\
                 1.5.5 Software Productivity Tools / 23 \\
                 1.6 Programming Language Basics / 25 \\
                 1.6.1 The Static/Dynamic Distinction / 25 \\
                 1.6.2 Environments and States / 26 \\
                 1.6.3 Static Scope and Block Structure / 28 \\
                 1.6.4 Explicit Access Control / 31 \\
                 1.6.5 Dynamic Scope / 31 \\
                 1.6.6 Parameter Passing Mechanisms / 33 \\
                 1.6.7 Aliasing / 35 \\
                 1.6.8 Exercises for Section 1.6 / 35 \\
                 1.7 Summary of Chapter 1 / 36 \\
                 1.8 References for Chapter 1 / 38 \\
                 2: A Simple Syntax-Directed Translator / 39 \\
                 2.1 Introduction / 40 \\
                 2.2 Syntax Definition / 42 \\
                 2.2.1 Definition of Grammars / 42 \\
                 2.2.2 Derivations / 44 \\
                 2.2.3 Parse Trees / 45 \\
                 2.2.4 Ambiguity / 47 \\
                 2.2.5 Associativity of Operators / 48 \\
                 2.2.6 Precedence of Operators / 48 \\
                 2.2.7 Exercises for Section 2.2 / 51 \\
                 2.3 Syntax-Directed Translation / 52 \\
                 2.3.1 Postfix Notation / 53 \\
                 2.3.2 Synthesized Attributes / 54 \\
                 2.3.3 Simple Syntax-Directed Definitions / 56 \\
                 2.3.4 Tree Traversals / 56 \\
                 2.3.5 Translation Schemes / 57 \\
                 2.3.6 Exercises for Section 2.3 / 60 \\
                 2.4 Parsing / 60 \\
                 2.4.1 Top-Down Parsing / 61 \\
                 2.4.2 Predictive Parsing / 64 \\
                 2.4.3 When to Use $\epsilon$-Productions / 65 \\
                 2.4.4 Designing a Predictive Parser / 66 \\
                 2.4.5 Left Recursion / 67 \\
                 2.4.6 Exercises for Section 2.4 / 68 \\
                 2.5 A Translator for Simple Expressions / 68 \\
                 2.5.1 Abstract and Concrete Syntax / 69 \\
                 2.5.2 Adapting the Translation Scheme / 70 \\
                 2.5.3 Procedures for the Nonterminals / 72 \\
                 2.5.4 Simplifying the Translator / 73 \\
                 2.5.5 The Complete Program / 74 \\
                 2.6 Lexical Analysis / 76 \\
                 2.6.1 Removal of White Space and Comments / 77 \\
                 2.6.2 Reading Ahead / 78 \\
                 2.6.3 Constants / 78 \\
                 2.6.4 Recognizing Keywords and Identifiers / 79 \\
                 2.6.5 A Lexical Analyzer / 81 \\
                 2.6.6 Exercises for Section 2.6 / 84 \\
                 2.7 Symbol Tables / 85 \\
                 2.7.1 Symbol Table Per Scope / 86 \\
                 2.7.2 The Use of Symbol Tables / 89 \\
                 2.8 Intermediate Code Generation / 91 \\
                 2.8.1 Two Kinds of Intermediate Representations / 91
                 \\
                 2.8.2 Construction of Syntax Trees / 92 \\
                 2.8.3 Static Checking / 97 \\
                 2.8.4 Three-Address Code / 99 \\
                 2.8.5 Exercises for Section 2.8 / 105 \\
                 2.9 Summary of Chapter 2 / 105 \\
                 3: Lexical Analysis / 109 \\
                 3.1 The Role of the Lexical Analyzer / 109 \\
                 3.1.1 Lexical Analysis Versus Parsing / 110 \\
                 3.1.2 Tokens, Patterns, and Lexemes / 111 \\
                 3.1.3 Attributes for Tokens / 112 \\
                 3.1.4 Lexical Errors / 113 \\
                 3.1.5 Exercises for Section 3.1 / 114 \\
                 3.2 Input Buffering / 115 \\
                 3.2.1 Buffer Pairs / 115 \\
                 3.2.2 Sentinels / 116 \\
                 3.3 Specification of Tokens / 116 \\
                 3.3.1 Strings and Languages / 117 \\
                 3.3.2 Operations on Languages / 119 \\
                 3.3.3 Regular Expressions / 120 \\
                 3.3.4 Regular Definitions / 123 \\
                 3.3.5 Extensions of Regular Expressions / 124 \\
                 3.3.6 Exercises for Section 3.3 / 125 \\
                 3.4 Recognition of Tokens / 128 \\
                 3.4.1 Transition Diagrams / 130 \\
                 3.4.2 Recognition of Reserved Words and Identifiers /
                 132 \\
                 3.4.3 Completion of the Running Example / 133 \\
                 3.4.4 Architecture of a Transition-Diagram-Based
                 Lexical Analyzer / 134 \\
                 3.4.5 Exercises for Section 3.4 / 136 \\
                 3.5 The Lexical-Analyzer Generator Lex / 140 \\
                 3.5.1 Use of Lex / 140 \\
                 3.5.2 Structure of Lex Programs / 141 \\
                 3.5.3 Conflict Resolution in Lex / 144 \\
                 3.5.4 The Lookahead Operator / 144 \\
                 3.5.5 Exercises for Section 3.5 / 146 \\
                 3.6 Finite Automata / 147 \\
                 3.6.1 Nondeterministic Finite Automata / 147 \\
                 3.6.2 Transition Tables / 148 \\
                 3.6.3 Acceptance of Input Strings by Automata / 149 \\
                 3.6.4 Deterministic Finite Automata / 149 \\
                 3.6.5 Exercises for Section 3.6 / 151 \\
                 3.7 From Regular Expressions to Automata / 152 \\
                 3.7.1 Conversion of an NFA to a DFA / 152 \\
                 3.7.2 Simulation of an NFA / 156 \\
                 3.7.3 Efficiency of NFA Simulation / 157 \\
                 3.7.4 Construction of an NFA from a Regular Expression
                 / 159 \\
                 3.7.5 Efficiency of String-Processing Algorithms / 163
                 \\
                 3.7.6 Exercises for Section 3.7 / 166 \\
                 3.8 Design of a Lexical-Analyzer Generator / 166 \\
                 3.8.1 The Structure of the Generated Analyzer / 167 \\
                 3.8.2 Pattern Matching Based on NFA's / 168 \\
                 3.8.3 DFA's for Lexical Analyzers / 170 \\
                 3.8.4 Implementing the Lookahead Operator / 171 \\
                 3.8.5 Exercises for Section 3.8 / 172 \\
                 3.9 Optimization of DFA-Based Pattern Matchers / 173
                 \\
                 3.9.1 Important States of an NFA / 173 \\
                 3.9.2 Functions Computed From the Syntax Tree / 175 \\
                 3.9.3 Computing {\em nullable}, {\em firstpos}, and
                 {\em lastpos} / 176 \\
                 3.9.4 Computing {\em followpos} / 177 \\
                 3.9.5 Converting a Regular Expression Directly to a DFA
                 / 179 \\
                 3.9.6 Minimizing the Number of States of a DFA / 180
                 \\
                 3.9.7 State Minimization in Lexical Analyzers / 184 \\
                 3.9.8 Trading Time for Space in DFA Simulation / 185
                 \\
                 3.9.9 Exercises for Section 3.9 / 186 \\
                 3.10 Summary of Chapter 3 / 187 \\
                 3.11 References for Chapter 3 / 189 \\
                 4: Syntax Analysis / 191 \\
                 4.1 Introduction / 192 \\
                 4.1.1 The Role of the Parser / 192 \\
                 4.1.2 Representative Grammars / 193 \\
                 4.1.3 Syntax Error Handling / 194 \\
                 4.1.4 Error-Recovery Strategies / 195 \\
                 4.2 Context-Free Grammars / 197 \\
                 4.2.1 The Formal Definition of a Context-Free Grammar.
                 / 197 \\
                 4.2.2 Notational Conventions / 198 \\
                 4.2.3 Derivations / 199 \\
                 4.2.4 Parse Trees and Derivations / 201 \\
                 4.2.5 Ambiguity / 203 \\
                 4.2.6 Verifying the Language Generated by a Grammar /
                 204 \\
                 4.2.7 Context-Free Grammars Versus Regular Expressions
                 / 205 \\
                 4.2.8 Exercise for Section 4.2 / 206 \\
                 4.3 Writing a Grammar / 209 \\
                 4.3.1 Lexical Versus Syntactic Analysis / 209 \\
                 4.3.2 Eliminating Ambiguity / 210 \\
                 4.3.3 Elimination of Left Recursion / 212 \\
                 4.3.4 Left Factoring / 214 \\
                 4.3.5 Non-Context-Free Language Constructs / 215 \\
                 4.3.6 Exercises for Section 4.3 / 216 \\
                 4.4 Top-Down Parsing / 217 \\
                 4.4.1 Recursive-Descent Parsing / 219 \\
                 4.4.2 FIRST and FOLLOW / 220 \\
                 4.4.3 LL(l) Grammars / 222 \\
                 4.4.4 Nonrecursive Predictive Parsing / 226 \\
                 4.4.5 Error Recovery in Predictive Parsing / 228 \\
                 4.4.6 Exercises for Section 4.4 / 231 \\
                 4.5 Bottom-Up Parsing / 233 \\
                 4.5.1 Reductions / 234 \\
                 4.5.2 Handle Pruning / 235 \\
                 4.5.3 Shift-Reduce Parsing / 236 \\
                 4.5.4 Conflicts During Shift-Reduce Parsing / 238 \\
                 4.5.5 Exercises for Section 4.5 / 240 \\
                 4.6 Introduction to LR Parsing: Simple LR / 241 \\
                 4.6.1 Why LR Parsers? / 241 \\
                 4.6.2 Items and the LR(0) Automaton / 242 \\
                 4.6.3 The LR-Parsing Algorithm / 248 \\
                 4.6.4 Constructing SLR-Parsing Tables / 252 \\
                 4.6.5 Viable Prefixes / 256 \\
                 4.6.6 Exercises for Section 4.6 / 257 \\
                 4.7 More Powerful LR Parsers / 259 \\
                 4.7.1 Canonical LR(1) Items / 260 \\
                 4.7.2 Constructing LR(1) Sets of Items / 261 \\
                 4.7.3 Canonical LR(1) Parsing Tables / 265 \\
                 4.7.4 Constructing LALR Parsing Tables / 266 \\
                 4.7.5 Efficient Construction of LALR Parsing Tables /
                 270 \\
                 4.7.6 Compaction of LR Parsing Tables / 275 \\
                 4.7.7 Exercises for Section 4.7 / 277 \\
                 4.8 Using Ambiguous Grammars / 278 \\
                 4.8.1 Precedence and Associativity to Resolve Conflicts
                 / 279 \\
                 4.8.2 The ``Dangling-Else'' Ambiguity / 281 \\
                 4.8.3 Error Recovery in LR Parsing / 283 \\
                 4.8.4 Exercises for Section 4.8 / 285 \\
                 4.9 Parser Generators / 287 \\
                 4.9.1 The Parser Generator Yacc / 287 \\
                 4.9.2 Using Yacc with Ambiguous Grammars / 291 \\
                 4.9.3 Creating Yacc Lexical Analyzers with Lex / 294
                 \\
                 4.9.4 Error Recovery in Yacc / 295 \\
                 4.9.5 Exercises for Section 4.9 / 297 \\
                 4.10 Summary of Chapter 4 / 297 \\
                 4.11 References for Chapter 4 / 300 \\
                 5: Syntax-Directed Translation / 303 \\
                 5.1 Syntax-Directed Definitions / 304 \\
                 5.1.1 Inherited and Synthesized Attributes / 304 \\
                 5.1.2 Evaluating an SDD at the Nodes of a Parse Tree /
                 306 \\
                 5.1.3 Exercises for Section 5.1 / 309 \\
                 5.2 Evaluation Orders for SDD's / 310 \\
                 5.2.1 Dependency Graphs / 310 \\
                 5.2.2 Ordering the Evaluation of Attributes / 312 \\
                 5.2.3 S-Attributed Definitions / 312 \\
                 5.2.4 L-Attributed Definitions / 313 \\
                 5.2.5 Semantic Rules with Controlled Side Effects / 314
                 \\
                 5.2.6 Exercises for Section 5.2 / 317 \\
                 5.3 Applications of Syntax-Directed Translation / 318
                 \\
                 5.3.1 Construction of Syntax Trees / 318 \\
                 5.3.2 The Structure of a Type / 321 \\
                 5.3.3 Exercises for Section 5.3 / 323 \\
                 5.4 Syntax-Directed Translation Schemes / 324 \\
                 5.4.1 Postfix Translation Schemes / 324 \\
                 5.4.2 Parser-Stack Implementation of Postfix SDT's /
                 325 \\
                 5.4.3 SDT's With Actions Inside Productions / 327 \\
                 5.4.4 Eliminating Left Recursion From SDT 's / 328 \\
                 5.4.5 SDT's for L-Attributed Definitions / 331 \\
                 5.4.6 Exercises for Section 5.4 / 336 \\
                 5.5 Implementing L-Attributed SDD's / 337 \\
                 5.5.1 Translation During Recursive-Descent Parsing /
                 338 \\
                 5.5.2 On-The-Fly Code Generation / 340 \\
                 5.5.3 L-Attributed SDD's and LL Parsing / 343 \\
                 5.5.4 Bottom-Up Parsing of L-Attributed SDD's / 348 \\
                 5.5.5 Exercises for Section 5.5 / 352 \\
                 5.6 Summary of Chapter 5 / 353 \\
                 5.7 References for Chapter 5 / 354 \\
                 6: Intermediate-Code Generation / 357 \\
                 6.1 Variants of Syntax Trees / 358 \\
                 6.1.1 Directed Acyclic Graphs for Expressions / 359 \\
                 6.1.2 The Value-Number Method for Constructing DAG's /
                 360 \\
                 6.1.3 Exercises for Section 6.1 / 362 \\
                 6.2 Three-Address Code / 363 \\
                 6.2.1 Addresses and Instructions / 364 \\
                 6.2.2 Quadruples / 366 \\
                 6.2.3 Triples / 367 \\
                 6.2.4 Static Single-Assignment Form / 369 \\
                 6.2.5 Exercises for Section 6.2 / 370 \\
                 6.3 Types and Declarations / 370 \\
                 6.3.1 Type Expressions / 371 \\
                 6.3.2 Type Equivalence / 372 \\
                 6.3.3 Declarations / 373 \\
                 6.3.4 Storage Layout for Local Names / 373 \\
                 6.3.5 Sequences of Declarations / 376 \\
                 6.3.6 Fields in Records and Classes / 376 \\
                 6.3.7 Exercises for Section 6.3 / 378 \\
                 6.4 Translation of Expressions / 378 \\
                 6.4.1 Operations Within Expressions / 378 \\
                 6.4.2 Incremental Translation / 380 \\
                 6.4.3 Addressing Array Elements / 381 \\
                 6.4.4 Translation of Array References / 383 \\
                 6.4.5 Exercises for Section 6.4 / 384 \\
                 6.5 Type Checking / 386 \\
                 6.5.1 Rules for Type Checking / 387 \\
                 6.5.2 Type Conversions / 388 \\
                 6.5.3 Overloading of Functions and Operators / 390 \\
                 6.5.4 Type Inference and Polymorphic Functions / 391
                 \\
                 6.5.5 An Algorithm for Unification / 395 \\
                 6.5.6 Exercises for Section 6.5 / 398 \\
                 6.6 Control Flow / 399 \\
                 6.6.1 Boolean Expressions / 399 \\
                 6.6.2 Short-Circuit Code / 400 \\
                 6.6.3 Flow-of-Control Statements / 401 \\
                 6.6.4 Control-Flow Translation of Boolean Expressions /
                 403 \\
                 6.6.5 A voiding Redundant Gotos / 405 \\
                 6.6.6 Boolean Values and Jumping Code / 408 \\
                 6.6.7 Exercises for Section 6.6 / 408 \\
                 6.7 Backpatching / 410 \\
                 6.7.1 One-Pass Code Generation Using Backpatching / 410
                 \\
                 6.7.2 Backpatching for Boolean Expressions / 411 \\
                 6.7.3 Flow-of-Control Statements / 413 \\
                 6.7.4 Break-, Continue-, and Goto-Statements / 416 \\
                 6.7.5 Exercises for Section 6.7 / 417 \\
                 6.8 Switch-Statements / 418 \\
                 6.8.1 Translation of Switch-Statements / 419 \\
                 6.8.2 Syntax-Directed Translation of Switch-Statements
                 / 420 \\
                 6.8.3 Exercises for Section 6.8 / 421 \\
                 6.9 Intermediate Code for Procedures / 422 \\
                 6.10 Summary of Chapter 6 / 424 \\
                 6.11 References for Chapter 6 / 425 \\
                 7: Run-Time Environments / 427 \\
                 7.1 Storage Organization / 427 \\
                 7.1.1 Static Versus Dynamic Storage Allocation / 429
                 \\
                 7.2 Stack Allocation of Space / 430 \\
                 7.2.1 Activation Trees / 430 \\
                 7.2.2 Activation Records / 433 \\
                 7.2.3 Calling Sequences / 436 \\
                 7.2.4 Variable-Length Data on the Stack / 438 \\
                 7.2.5 Exercises for Section 7.2 / 440 \\
                 7.3 Access to Nonlocal Data on the Stack / 441 \\
                 7.3.1 Data Access Without Nested Procedures / 442 \\
                 7.3.2 Issues With Nested Procedures / 442 \\
                 7.3.3 A Language With Nested Procedure Declarations /
                 443 \\
                 7.3.4 Nesting Depth / 443 \\
                 7.3.5 Access Links / 445 \\
                 7.3.6 Manipulating Access Links / 447 \\
                 7.3.7 Access Links for Procedure Parameters / 448 \\
                 7.3.8 Displays / 449 \\
                 7.3.9 Exercises for Section 7.3 / 451 \\
                 7.4 Heap Management / 452 \\
                 7.4.1 The Memory Manager / 453 \\
                 7.4.2 The Memory Hierarchy of a Computer / 454 \\
                 7.4.3 Locality in Programs / 455 \\
                 7.4.4 Reducing Fragmentation / 457 \\
                 7.4.5 Manual Deallocation Requests / 460 \\
                 7.4.6 Exercises for Section 7.4 / 463 \\
                 7.5 Introduction to Garbage Collection / 463 \\
                 7.5.1 Design Goals for Garbage Collectors / 464 \\
                 7.5.2 Reachability / 466 \\
                 7.5.3 Reference Counting Garbage Collectors / 468 \\
                 7.5.4 Exercises for Section 7.5 / 470 \\
                 7.6 Introduction to Trace-Based Collection / 470 \\
                 7.6.1 A Basic Mark-and-Sweep Collector / 471 \\
                 7.6.2 Basic Abstraction / 473 \\
                 7.6.3 Optimizing Mark-and-Sweep / 475 \\
                 7.6.4 Mark-and-Compact Garbage Collectors / 476 \\
                 7.6.5 Copying collectors / 478 \\
                 7.6.6 Comparing Costs / 482 \\
                 7.6.7 Exercises for Section 7.6 / 482 \\
                 7.7 Short-Pause Garbage Collection / 483 \\
                 7.7.1 Incremental Garbage Collection / 483 \\
                 7.7.2 Incremental Reachability Analysis / 485 \\
                 7.7.3 Partial-Collection Basics / 487 \\
                 7.7.4 Generational Garbage Collection / 488 \\
                 7.7.5 The Train Algorithm / 490 \\
                 7.7.6 Exercises for Section 7.7 / 493 \\
                 7.8 Advanced Topics in Garbage Collection / 494 \\
                 7.8.1 Parallel and Concurrent Garbage Collection / 495
                 \\
                 7.8.2 Partial Object Relocation / 497 \\
                 7.8.3 Conservative Collection for Unsafe Languages /
                 498 \\
                 7.8.4 Weak References / 498 \\
                 7.8.5 Exercises for Section 7.8 / 499 \\
                 7.9 Summary of Chapter 7 / 500 \\
                 7.10 References for Chapter 7 / 502 \\
                 8: Code Generation / 505 \\
                 8.1 Issues in the Design of a Code Generator / 506 \\
                 8.1.1 Input to the Code Generator / 507 \\
                 8.1.2 The Target Program / 507 \\
                 8.1.3 Instruction Selection / 508 \\
                 8.1.4 Register Allocation / 510 \\
                 8.1.5 Evaluation Order / 511 \\
                 8.2 The Target Language / 512 \\
                 8.2.1 A Simple Target Machine Model / 512 \\
                 8.2.2 Program and Instruction Costs / 515 \\
                 8.2.3 Exercises for Section 8.2 / 516 \\
                 8.3 Addresses in the Target Code / 518 \\
                 8.3.1 Static Allocation / 518 \\
                 8.3.2 Stack Allocation / 520 \\
                 8.3.3 Run-Time Addresses for Names / 522 \\
                 8.3.4 Exercises for Section 8.3 / 524 \\
                 8.4 Basic Blocks and Flow Graphs / 525 \\
                 8.4.1 Basic Blocks / 526 \\
                 8.4.2 Next-Use Information / 528 \\
                 8.4.3 Flow Graphs / 529 \\
                 8.4.4 Representation of Flow Graphs / 530 \\
                 8.4.5 Loops / 531 \\
                 8.4.6 Exercises for Section 8.4 / 531 \\
                 8.5 Optimization of Basic Blocks / 533 \\
                 8.5.1 The DAG Representation of Basic Blocks / 533 \\
                 8.5.2 Finding Local Common Subexpressions / 534 \\
                 8.5.3 Dead Code Elimination / 535 \\
                 8.5.4 The Use of Algebraic Identities / 536 \\
                 8.5.5 Representation of Array References / 537 \\
                 8.5.6 Pointer Assignments and Procedure Calls / 539 \\
                 8.5.7 Reassembling Basic Blocks From DAG's / 539 \\
                 8.5.8 Exercises for Section 8.5 / 541 \\
                 8.6 A Simple Code Generator / 542 \\
                 8.6.1 Register and Address Descriptors / 543 \\
                 8.6.2 The Code-Generation Algorithm / 544 \\
                 8.6.3 Design of the Function {\em getReg} / 547 \\
                 8.6.4 Exercises for Section 8.6 / 548 \\
                 8.7 Peephole Optimization / 549 \\
                 8.7.1 Eliminating Redundant Loads and Stores / 550 \\
                 8.7.2 Eliminating Unreachable Code / 550 \\
                 8.7.3 Flow-of-Control Optimizations / 551 \\
                 8.7.4 Algebraic Simplification and Reduction in
                 Strength / 552 \\
                 8.7.5 Use of Machine Idioms / 552 \\
                 8.7.6 Exercises for Section 8.7 / 553 \\
                 8.8 Register Allocation and Assignment / 553 \\
                 8.8.1 Global Register Allocation / 553 \\
                 8.8.2 Usage Counts / 554 \\
                 8.8.3 Register Assignment for Out er Loops / 556 \\
                 8.8.4 Register Allocation by Graph Coloring / 556 \\
                 8.8.5 Exercises for Section 8.8 / 557 \\
                 8.9 Instruction Selection by Tree Rewriting / 558 \\
                 8.9.1 Tree-Translation Schemes / 558 \\
                 8.9.2 Code Generation by Tiling an Input Tree / 560 \\
                 8.9.3 Pattern Matching by Parsing / 563 \\
                 8.9.4 Routines for Semantic Checking / 565 \\
                 8.9.5 General Tree Matching / 565 \\
                 8.9.6 Exercises for Section 8.9 / 567 \\
                 8.10 Optimal Code Generation for Expressions / 567 \\
                 8.10.1 Ershov Numbers / 567 \\
                 8.10.2 Generating Code From Labeled Expression Trees /
                 568 \\
                 8.10.3 Evaluating Expressions with an Insufficient
                 Supply of Registers / 570 \\
                 8.10.4 Exercises for Section 8.10 / 572 \\
                 8.11 Dynamic Programming Code-Generation / 573 \\
                 8.11.1 Contiguous Evaluation / 574 \\
                 8.11.2 The Dynamic Programming Algorithm / 575 \\
                 8.11.3 Exercises for Section 8.11 / 577 \\
                 8.12 Summary of Chapter 8 / 578 \\
                 8.13 References for Chapter 8 / 579 \\
                 9: Machine-Independent Optimizations / 583 \\
                 9.1 The Principal Sources of Optimization / 584 \\
                 9.1.1 Causes of Redundancy / 584 \\
                 9.1.2 A Running Example: Quicksort / 585 \\
                 9.1.3 Semantics-Preserving Transformations / 586 \\
                 9.1.4 Global Common Subexpressions / 588 \\
                 9.1.5 Copy Propagation / 590 \\
                 9.1.6 Dead-Code Elimination / 591 \\
                 9.1.7 Code Motion / 592 \\
                 9.1.8 Induction Variables and Reduction in Strength /
                 592 \\
                 9.1.9 Exercises for Section 9.1 / 596 \\
                 9.2 Introduction to Data-Flow Analysis / 597 \\
                 9.2.1 The Data-Flow Abstraction / 597 \\
                 9.2.2 The Data-Flow Analysis Schema / 599 \\
                 9.2.3 Data-Flow Schemas on Basic Blocks / 600 \\
                 9.2.4 Reaching Definitions / 601 \\
                 9.2.5 Live-Variable Analysis / 608 \\
                 9.2.6 Available Expressions / 610 \\
                 9.2.7 Summary / 614 \\
                 9.2.8 Exercises for Section 9.2 / 615 \\
                 9.3 Foundations of Data-Flow Analysis / 618 \\
                 9.3.1 Semilattices / 618 \\
                 9.3.2 Transfer Functions / 623 \\
                 9.3.3 The Iterative Algorithm for General Frameworks /
                 626 \\
                 9.3.4 Meaning of a Data-Flow Solution / 628 \\
                 9.3.5 Exercises for Section 9.3 / 631 \\
                 9.4 Constant Propagation / 632 \\
                 9.4.1 Data-Flow Values for the Constant-Propagation
                 Framework / 633 \\
                 9.4.2 The Meet for the Constant-Propagation Framework /
                 633 \\
                 9.4.3 Transfer Functions for the Constant-Propagation
                 Framework / 634 \\
                 9.4.4 Monotonicity of the Constant-Propagation
                 Framework / 635 \\
                 9.4.5 Nondistributivity of the Constant-Propagation
                 Framework / 635 \\
                 9.4.6 Interpretation of the Results / 637 \\
                 9.4.7 Exercises for Section 9.4 / 637 \\
                 9.5 Partial-Redundancy Elimination / 639 \\
                 9.5.1 The Sources of Redundancy / 639 \\
                 9.5.2 Can All Redundancy Be Eliminated? / 642 \\
                 9.5.3 The Lazy-Code-Motion Problem / 644 \\
                 9.5.4 Anticipation of Expressions / 645 \\
                 9.5.5 The Lazy-Code-Motion Algorithm / 646 \\
                 9.5.6 Exercises for Section 9.5 / 655 \\
                 9.6 Loops in Flow Graphs / 655 \\
                 9.6.1 Dominators / 656 \\
                 9.6.2 Depth-First Ordering / 660 \\
                 9.6.3 Edges in a Depth-First Spanning Tree / 661 \\
                 9.6.4 Back Edges and Reducibility / 662 \\
                 9.6.5 Depth of a Flow Graph / 665 \\
                 9.6.6 Natural Loops / 665 \\
                 9.6.7 Speed of Convergence of Iterative Data-Flow
                 Algorithms / 667 \\
                 9.6.8 Exercises for Section 9.6 / 669 \\
                 9.7 Region-Based Analysis / 672 \\
                 9.7.1 Regions / 672 \\
                 9.7.2 Region Hierarchies for Reducible Flow Graphs /
                 673 \\
                 9.7.3 Overview of a Region-Based Analysis / 676 \\
                 9.7.4 Necessary Assumptions About Transfer Functions /
                 678 \\
                 9.7.5 An Algorithm for Region-Based Analysis / 680 \\
                 9.7.6 Handling Nonreducible Flow Graphs / 684 \\
                 9.7.7 Exercises for Section 9.7 / 686 \\
                 9.8 Symbolic Analysis / 686 \\
                 9.8.1 Affine Expressions of Reference Variables / 687
                 \\
                 9.8.2 Data-Flow Problem Formulation / 689 \\
                 9.8.3 Region-Based Symbolic Analysis / 694 \\
                 9.8.4 Exercises for Section 9.8 / 699 \\
                 9.9 Summary of Chapter 9 / 700 \\
                 9.10 References for Chapter 9 / 703 \\
                 10: Instruction-Level Parallelism / 707 \\
                 10.1 Processor Architectures / 708 \\
                 10.1.1 Instruction Pipelines and Branch Delays / 708
                 \\
                 10.1.2 Pipelined Execution / 709 \\
                 10.1.3 Multiple Instruction Issue / 710 \\
                 10.2 Code-Scheduling Constraints / 710 \\
                 10.2.1 Data Dependence / 711 \\
                 10.2.2 Finding Dependences Among Memory Accesses / 712
                 \\
                 10.2.3 Tradeoff Between Register Usage and Parallelism.
                 / 713 \\
                 10.2.4 Phase Ordering Between Register Allocation and
                 Code Scheduling / 716 \\
                 10.2.5 Control Dependence / 716 \\
                 10.2.6 Speculative Execution Support / 717 \\
                 10.2.7 A Basic Machine Model / 719 \\
                 10.2.8 Exercises for Section 10.2 / 720 \\
                 10.3 Basic-Block Scheduling / 721 \\
                 10.3.1 Data-Dependence Graphs / 722 \\
                 10.3.2 List Scheduling of Basic Blocks / 723 \\
                 10.3.3 Prioritized Topological Orders / 725 \\
                 10.3.4 Exercises for Section 10.3 / 726 \\
                 10.4 Global Code Scheduling / 727 \\
                 10.4.1 Primitive Code Motion / 728 \\
                 10.4.2 Upward Code Motion / 730 \\
                 10.4.3 Downward Code Motion / 731 \\
                 10.4.4 Updating Data Dependences / 732 \\
                 10.4.5 Global Scheduling Algorithms / 732 \\
                 10.4.6 Advanced Code Motion Techniques / 736 \\
                 10.4.7 Interaction with Dynamic Schedulers / 737 \\
                 10.4.8 Exercises for Section 10.4 / 737 \\
                 10.5 Software Pipelining / 738 \\
                 10.5.1 Introduction / 738 \\
                 10.5.2 Software Pipelining of Loops / 740 \\
                 10.5.3 Register Allocation and Code Generation / 743
                 \\
                 10.5.4 Do-Across Loops / 743 \\
                 10.5.5 Goals and Constraints of Software Pipelining /
                 745 \\
                 10.5.6 A Software-Pipelining Algorithm / 749 \\
                 10.5.7 Scheduling Acyclic Data-Dependence Graphs / 749
                 \\
                 10.5.8 Scheduling Cyclic Dependence Graphs / 751 \\
                 10.5.9 Improvements to the Pipelining Algorithms / 758
                 \\
                 10.5.10 Modular Variable Expansion / 758 \\
                 10.5.11 Conditional Statements / 761 \\
                 10.5.12 Hardware Support for Software Pipelining / 762
                 \\
                 10.5.13 Exercises for Section 10.5 / 763 \\
                 10.6 Summary of Chapter 10 / 765 \\
                 10.7 References for Chapter 10 / 766 \\
                 11: Optimizing for Parallelism and Locality / 769 \\
                 11.1 Basic Concepts / 771 \\
                 11.1.1 Multiprocessors / 772 \\
                 11.1.2 Parallelism in Applications / 773 \\
                 11.1.3 Loop-Level Parallelism / 775 \\
                 11.1.4 Data Locality / 777 \\
                 11.1.5 Introduction to Affine Transform Theory / 778
                 \\
                 11.2 Matrix Multiply: An In-Depth Example / 782 \\
                 11.2.1 The Matrix-Multiplication Algorithm / 782 \\
                 11.2.2 Optimizations / 785 \\
                 11.2.3 Cache Interference / 788 \\
                 11.2.4 Exercises for Section 11.2 / 788 \\
                 11.3 Iteration Spaces / 788 \\
                 11.3.1 Constructing Iteration Spaces from Loop Nests /
                 788 \\
                 11.3.2 Execution Order for Loop Nests / 791 \\
                 11.3.3 Matrix Formulation of Inequalities / 791 \\
                 11.3.4 Incorporating Symbolic Constants / 793 \\
                 11.3.5 Controlling the Order of Execution / 793 \\
                 11.3.6 Changing Axes / 798 \\
                 11.3.7 Exercises for Section 11.3 / 799 \\
                 11.4 Affine Array Indexes / 801 \\
                 11.4.1 Affine Accesses / 802 \\
                 11.4.2 Affine and Nonaffine Accesses in Practice / 803
                 \\
                 11.4.3 Exercises for Section 11.4 / 804 \\
                 11.5 Data Reuse / 804 \\
                 11.5.1 Types of Reuse / 805 \\
                 11.5.2 Self Reuse / 806 \\
                 11.5.3 Self-Spatial Reuse / 809 \\
                 11.5.4 Group Reuse / 811 \\
                 11.5.5 Exercises for Section 11.5 / 814 \\
                 11.6 Array Data-Dependence Analysis / 815 \\
                 11.6.1 Definition of Data Dependence of Array Accesses
                 / 816 \\
                 11.6.2 Integer Linear Programming / 817 \\
                 11.6.3 The GCD Test / 818 \\
                 11.6.4 Heuristics for Solving Integer Linear Programs /
                 820 \\
                 11.6.5 Solving General Integer Linear Programs / 823
                 \\
                 11.6.6 Summary / 825 \\
                 11.6.7 Exercises for Section 11.6 / 826 \\
                 11.7 Finding Synchronization-Free Parallelism / 828 \\
                 11.7.1 An Introductory Example / 828 \\
                 11.7.2 Affine Space Partitions / 830 \\
                 11.7.3 Space-Partition Constraints / 831 \\
                 11.7.4 Solving Space-Partition Constraints / 835 \\
                 11.7.5 A Simple Code-Generation Algorithm / 838 \\
                 11.7.6 Eliminating Empty Iterations / 841 \\
                 11.7.7 Eliminating Tests from Innermost Loops / 844 \\
                 11.7.8 Source-Code Transforms / 846 \\
                 11.7.9 Exercises for Section 11.7 / 851 \\
                 11.8 Synchronization Between Parallel Loops / 853 \\
                 11.8.1 A Constant Number of Synchronizations / 853 \\
                 11.8.2 Program-Dependence Graphs / 854 \\
                 11.8.3 Hierarchical Time / 857 \\
                 11.8.4 The Parallelization Algorithm / 859 \\
                 11.8.5 Exercises for Section 11.8 / 860 \\
                 11.9 Pipelining / 861 \\
                 11.9.1 What is Pipelining? / 861 \\
                 11.9.2 Successive Over-Relaxation (SOR): An Example /
                 863 \\
                 11.9.3 Fully Permutable Loops / 864 \\
                 11.9.4 Pipelining Fully Permutable Loops / 864 \\
                 11.9.5 General Theory / 867 \\
                 11.9.6 Time-Partition Constraints / 868 \\
                 11.9.7 Solving Time-Partition Constraints by Farkas'
                 Lemma / 872 \\
                 11.9.8 Code Transformations / 875 \\
                 11.9.9 Parallelism With Minimum Synchronization / 880
                 \\
                 11.9.10 Exercises for Section 11.9 / 882 \\
                 11.10 Locality Optimizations / 884 \\
                 11.10.1 Temporal Locality of Computed Data / 885 \\
                 11.10.2 Array Contraction / 885 \\
                 11.10.3 Partition Interleaving / 887 \\
                 11.10.4 Putting it All Together / 890 \\
                 11.10.5 Exercises for Section 11.10 / 892 \\
                 11.11 Other Uses of Affine Transforms / 893 \\
                 11.11.1 Distributed memory machines / 894 \\
                 11.11.2 Multi-Instruction-Issue Processors / 895 \\
                 11.11.3 Vector and SIMD Instructions / 895 \\
                 11.11.4 Prefetching / 896 \\
                 11.12 Summary of Chapter 11 / 897 \\
                 11.13 References for Chapter 11 / 899 \\
                 12: Interprocedural Analysis / 903 \\
                 12.1 Basic Concepts / 904 \\
                 12.1.1 Call Graphs / 904 \\
                 12.1.2 Context Sensitivity / 906 \\
                 12.1.3 Call Strings / 908 \\
                 12.1.4 Cloning-Based Context-Sensitive Analysis / 910
                 \\
                 12.1.5 Summary-Based Context-Sensitive Analysis / 911
                 \\
                 12.1.6 Exercises for Section 12.1 / 914 \\
                 12.2 Why Interprocedural Analysis? / 916 \\
                 12.2.1 Virtual Method Invocation / 916 \\
                 12.2.2 Pointer Alias Analysis / 917 \\
                 12.2.3 Parallelization / 917 \\
                 12.2.4 Detection of Software Errors and Vulnerabilities
                 / 917 \\
                 12.2.5 SQL Injection / 918 \\
                 12.2.6 Buffer Overflow / 920 \\
                 12.3 A Logical Representation of Data Flow / 921 \\
                 12.3.1 Introduction to Datalog / 921 \\
                 12.3.2 Datalog Rules / 922 \\
                 12.3.3 Intensional and Extensional Predicates / 924 \\
                 12.3.4 Execution of Datalog Programs / 927 \\
                 12.3.5 Incremental Evaluation of Datalog Programs / 928
                 \\
                 12.3.6 Problematic Datalog Rules / 930 \\
                 12.3.7 Exercises for Section 12.3 / 932 \\
                 12.4 A Simple Pointer-Analysis Algorithm / 933 \\
                 12.4.1 Why is Pointer Analysis Difficult / 934 \\
                 12.4.2 A Model for Pointers and References / 935 \\
                 12.4.3 Flow Insensitivity / 936 \\
                 12.4.4 The Formulation in Datalog / 937 \\
                 12.4.5 Using Type Information / 938 \\
                 12.4.6 Exercises for Section 12.4 / 939 \\
                 12.5 Context-Insensitive Interprocedural Analysis / 941
                 \\
                 12.5.1 Effects of a Method Invocation / 941 \\
                 12.5.2 Call Graph Discovery in Datalog / 943 \\
                 12.5.3 Dynamic Loading and Reflection / 944 \\
                 12.5.4 Exercises for Section 12.5 / 945 \\
                 12.6 Context-Sensitive Pointer Analysis / 945 \\
                 12.6.1 Contexts and Call Strings / 946 \\
                 12.6.2 Adding Context to Datalog Rules / 949 \\
                 12.6.3 Additional Observations About Sensitivity / 949
                 \\
                 12.6.4 Exercises for Section 12.6 / 950 \\
                 12.7 Datalog Implementation by BDD's / 951 \\
                 12.7.1 Binary Decision Diagrams / 951 \\
                 12.7.2 Transformations on BDD's / 953 \\
                 12.7.3 Representing Relations by BDD's / 954 \\
                 12.7.4 Relational Operations as BDD Operations / 954
                 \\
                 12.7.5 Using BDD's for Points-to Analysis / 957 \\
                 12.7.6 Exercises for Section 12.7 / 958 \\
                 12.8 Summary of Chapter 12 / 958 \\
                 12.9 References for Chapter 12 / 961 \\
                 A: A Complete Front End / 965 \\
                 A.1 The Source Language / 965 \\
                 A.2 Main / 966 \\
                 A.3 Lexical Analyzer / 967 \\
                 A.4 Symbol Tables and Types / 970 \\
                 A.5 Intermediate Code for Expressions / 971 \\
                 A.6 Jumping Code for Boolean Expressions / 974 \\
                 A.7 Intermediate Code for Statements / 978 \\
                 A.8 Parser / 981 \\
                 A.9 Creating the Front End / 986 \\
                 B: Finding Linearly Independent Solutions / 989 \\
                 Index / 993",
}

@Book{Aho:2023:APL,
  author =       "Alfred V. Aho and Brian W. Kernighan and Peter J.
                 Weinberger",
  title =        "The {AWK} programming language",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Second",
  pages =        "xiii + 214",
  year =         "2023",
  ISBN =         "0-13-826972-6",
  ISBN-13 =      "978-0-13-826972-2",
  LCCN =         "QA76.73.A95",
  bibdate =      "Thu Oct 5 06:41:53 MDT 2023",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  series =       "Addison-Wesley professional computing series",
  abstract =     "Awk was developed in 1977 at Bell Labs, and it's still
                 a remarkably useful tool for solving a wide variety of
                 problems quickly and efficiently. In this update of the
                 classic Awk book, the creators of the language show you
                 what Awk can do and teach you how to use it
                 effectively.",
  acknowledgement = ack-nhfb,
  subject =      "AWK (Computer program language); AWK (Langage de
                 programmation)",
  tableofcontents = "Preface / ix \\
                 1. An Awk Tutorial / 1 \\
                 1.1 Getting Started / 1 \\
                 1.2 Simple Output / 4 \\
                 1.3 Formatted Output / 7 \\
                 1.4 Selection / 8 \\
                 1.5 Computing with Awk / 10 \\
                 1.6 Control-Flow Statements / 13 \\
                 1.7 Arrays / 16 \\
                 1.8 Useful One-liners / 17 \\
                 1.9 What Next? / 19 \\
                 2. Awk in Action / 21 \\
                 2.1 Personal Computation / 21 \\
                 2.2 Selection / 23 \\
                 2.3 Transformation / 25 \\
                 2.4 Summarization / 27 \\
                 2.5 Personal Databases / 28 \\
                 2.6 A Personal Library / 31 \\
                 2.7 Summary / 34 \\
                 3. Exploratory Data Analysis / 35 \\
                 3.1 The Sinking of the Titanic / 36 \\
                 3.2 Beer Ratings / 41 \\
                 3.3 Grouping Data / 43 \\
                 3.4 Unicode Data / 45 \\
                 3.5 Basic Graphs and Charts / 47 \\
                 3.6 Summary / 49 \\
                 4. Data Processing / 51 \\
                 4.1 Data Transformation and Reduction / 51 \\
                 4.2 Data Validation / 57 \\
                 4.3 Bundle and Unbundle / 59 \\
                 4.4 Multiline Records / 60 \\
                 4.5 Summary / 66 \\
                 5. Reports and Databases / 67 \\
                 5.1 Generating Reports / 67 \\
                 5.2 Packaged Queries and Reports / 73 \\
                 5.3 A Relational Database System / 75 \\
                 5.4 Summary / 83 \\
                 6. Processing Words / 85 \\
                 6.1 Random Text Generation / 85 \\
                 6.2 Interactive Text-Manipulation / 90 \\
                 6.3 Text Processing / 92 \\
                 6.4 Making an Index / 99 \\
                 6.5 Summary / 105 \\
                 7. Little Languages / 107 \\
                 7.1 An Assembler and Interpreter / 108 \\
                 7.2 A Language for Drawing Graphs / 111 \\
                 7.3 A Sort Generator / 113 \\
                 7.4 A Reverse-Polish Calculator / 115 \\
                 7.5 A Different Approach / 117 \\
                 7.6 A Recursive-Descent Parser for Arithmetic
                 Expressions / 119 \\
                 7.7 A Recursive-Descent Parser for a Subset of Awk /
                 122 \\
                 7.8 Summary / 126 \\
                 8. Experiments with Algorithms / 129 \\
                 8.1 Sorting / 129 \\
                 8.2 Profiling / 142 \\
                 8.3 Topological Sorting / 144 \\
                 8.4 Make: A File Updating Program / 148 \\
                 8.5 Summary / 153 \\
                 9. Epilogue / 155 \\
                 9.1 Awk as a Language / 155 \\
                 9.2 Performance / 157 \\
                 9.3 Conclusion / 160 \\
                 Appendix A: Awk Reference Manual / 163 \\
                 A.1 Patterns / 165 \\
                 A.2 Actions / 176 \\
                 A.3 User-Defined Functions / 196 \\
                 A.4 Output / 197 \\
                 A.5 Input / 202 \\
                 A.6 Interaction with Other Programs / 207 \\
                 A.7 Summary / 208 \\
                 Index / 209",
}

@Article{Aiken:1946:ASC,
  author =       "H. H. Aiken and G. M. Hopper",
  title =        "The {Automatic Sequence Controlled Calculator}",
  journal =      "Electrical Engineering",
  volume =       "65",
  number =       "??",
  pages =        "384--391, 449--454, 522--528",
  year =         "1946",
  bibdate =      "Wed Oct 13 11:26:29 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Reprinted in \cite[\S 5.2]{Randell:1982:ODC}.",
  acknowledgement = ack-nhfb,
}

@Article{Aiken:1964:PAC,
  author =       "H. H. Aiken and A. G. Oettinger and T. C. Bartee",
  title =        "Proposed automatic calculating machine",
  journal =      j-IEEE-SPECTRUM,
  volume =       "1",
  number =       "8",
  pages =        "62--69",
  month =        aug,
  year =         "1964",
  CODEN =        "IEESAM",
  DOI =          "https://doi.org/10.1109/MSPEC.1964.6500770",
  ISSN =         "0018-9235 (print), 1939-9340 (electronic)",
  ISSN-L =       "0018-9235",
  bibdate =      "Tue Jan 14 11:14:17 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeespectrum1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Previously unpublished memorandum. Reprinted in
                 \cite[\S 5.1]{Randell:1982:ODC}.",
  abstract =     "Here presented is the memorandum that 20 years ago
                 initiated a series of events whose revolutionary
                 implications are only beginning to manifest themselves
                 --- a description of the first large-scale
                 general-purpose automatic digital computer Twenty years
                 ago, on August 7, 1944, Mark I, the first large-scale
                 general-purpose automatic digital computer ever to be
                 put in operation was dedicated at Harvard University by
                 James B. Conant, then president of Harvard, and the
                 late Thomas J. Watson, founder of IBM.",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Spectrum",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
}

@Book{Akl:1985:PSA,
  author =       "Selim G. Akl",
  title =        "Parallel Sorting Algorithms",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "xiii + 229",
  year =         "1985",
  ISBN =         "0-12-047680-0",
  ISBN-13 =      "978-0-12-047680-0",
  LCCN =         "QA76.5 .A363 1985",
  bibdate =      "Tue Dec 14 22:36:06 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Al-Khalili:2011:HWH,
  author =       "Jim Al-Khalili",
  title =        "The house of wisdom: how {Arabic} science saved
                 ancient knowledge and gave us the {Renaissance}",
  publisher =    pub-PENGUIN,
  address =      pub-PENGUIN:adr,
  pages =        "xxix + 302 + 8",
  year =         "2011",
  ISBN =         "1-59420-279-6 (hardcover)",
  ISBN-13 =      "978-1-59420-279-7 (hardcover)",
  LCCN =         "Q127.A5 A4 2011",
  bibdate =      "Fri Jul 22 15:57:04 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "science; Arab countries; history; philosophy; science,
                 medieval; methodology; intellectual life; science,
                 Renaissance",
  tableofcontents = "A dream of Aristotle \\
                 The rise of Islam \\
                 Translation \\
                 The lonely alchemist \\
                 The house of wisdom \\
                 Big science \\
                 Numbers \\
                 Algebra \\
                 The philosopher \\
                 The medic \\
                 The physicist \\
                 The prince and the pauper \\
                 Andalusia \\
                 The Mar{\aa}agha Revolution \\
                 Decline and Renaissance \\
                 Science and Islam today \\
                 Timeline: then Islamic world from antiquity to the
                 beginning of the modern period",
}

@Book{Albers:1990:MMP,
  editor =       "Donald J. Albers and Gerald L. Alexanderson and
                 Constance Reid",
  title =        "More Mathematical People: Contemporary Conversations",
  publisher =    pub-HBJ,
  address =      pub-HBJ:adr,
  pages =        "xviii + 375",
  year =         "1990",
  ISBN =         "0-15-158175-4",
  ISBN-13 =      "978-0-15-158175-7",
  LCCN =         "QA28 .M67 1990",
  bibdate =      "Mon Aug 10 17:01:29 MDT 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  price =        "US\$29.95",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "mathematicians; interviews; biography",
  tableofcontents = "Becoming a mathematician \\
                 Lipman Bers \\
                 Ralph P. Boas, Jr. \\
                 Paul J. Cohen \\
                 George B. Dantzig \\
                 Andrew M. Gleason \\
                 Bill Gosper \\
                 Irving Kaplansky \\
                 Peter D. Lax \\
                 Lucien Le Cam \\
                 Hans Lewy \\
                 Saunders Mac Lane \\
                 Cathleen S. Morawetz \\
                 Fredereck Mosteller \\
                 Julia Robinson \\
                 Mary Ellen Rudin \\
                 Steve Smale \\
                 William P. Thurston \\
                 Robin Wilson",
}

@Book{Albers:1994:MMP,
  editor =       "Donald J. Albers and Gerald L. Alexanderson and
                 Constance Reid",
  title =        "More Mathematical People: Contemporary Conversations",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "xviii + 375",
  year =         "1994",
  ISBN =         "0-12-048251-7",
  ISBN-13 =      "978-0-12-048251-1",
  LCCN =         "QA28 .M67 1994",
  bibdate =      "Mon Aug 10 17:01:29 MDT 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  remark =       "Reprint of \cite{Albers:1990:MMP}.",
  subject =      "mathematicians; biography",
  tableofcontents = "Becoming a mathematician \\
                 Lipman Bers \\
                 Ralph P. Boas, Jr. \\
                 Paul J. Cohen \\
                 George B. Dantzig \\
                 Andrew M. Gleason \\
                 Bill Gosper \\
                 Irving Kaplansky \\
                 Peter D. Lax \\
                 Lucien Le Cam \\
                 Hans Lewy \\
                 Saunders Mac Lane \\
                 Cathleen S. Morawetz \\
                 Fredereck Mosteller \\
                 Julia Robinson \\
                 Mary Ellen Rudin \\
                 Steve Smale \\
                 William P. Thurston \\
                 Robin Wilson",
}

@Book{Albers:2008:MPP,
  editor =       "Donald J. Albers and Gerald L. Alexanderson",
  title =        "Mathematical people: profiles and interviews",
  publisher =    pub-A-K-PETERS,
  address =      pub-A-K-PETERS:adr,
  edition =      "Second",
  pages =        "xxvi + 386",
  year =         "2008",
  ISBN =         "1-56881-340-6",
  ISBN-13 =      "978-1-56881-340-0",
  LCCN =         "QA28 .M37 2008",
  bibdate =      "Mon Aug 10 17:01:29 MDT 2009",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/u/ulam-stanislaw-m.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/mathgaz2010.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "mathematicians; biography",
  tableofcontents = "Garrett Birkhoff / interviewed by G. L.
                 Alexanderson and Carroll Wilde \\
                 David Blackwell / interviewed by Donald J. Albers \\
                 Shiing-Shen Chern / by William Chinn and John Lewis \\
                 John H. Conway / by Richard K. Guy \\
                 H. S. M. Coxeter / interviewed by Dave Logothetti \\
                 Persi Diaconis / interviewed by Donald J. Albers \\
                 Paul Erd{\H{o}}s / interviewed by G. L. Alexanderson
                 \\
                 Martin Gardner: defending the honor of the human mind /
                 by Peter Renz \\
                 Martin Gardner: master of recreational mathematics and
                 much more / interviewed by Donald J. Albers \\
                 Ronald L. Graham / by Donald J. Albers \\
                 Paul Halmos / interviewed by Donald J. Albers \\
                 Peter J. Hilton / interviewed by Lynn A. Steen and G.
                 L. Alexanderson \\
                 John Kemeny / interviewed by Lynn A. Steen \\
                 Morris Kline / interviewed by G. L. Alexanderson \\
                 Donald Knuth / interviewed by Donald J. Albers and Lynn
                 A. Steen \\
                 Solomon Lefschetz: a reminiscence / by Albert W. Tucker
                 \\
                 Beno{\^\i}t Mandelbrot / interviewed by Anthony
                 Barcellos \\
                 Henry Pollak / interviewed by Donald J. Albers and
                 Michael J. Thibodeaux \\
                 George P{\'o}lya / interviewed by G. L. Alexanderson
                 \\
                 Mina Rees / interviewed by Rosamond Dana and Peter J.
                 Hilton \\
                 Constance Reid / interviewed by G. L. Alexanderson \\
                 Herbert Robbins / interviewed by Warren Page \\
                 Raymond Smullyan: autobiographical essay \\
                 Olga Taussky-Todd: autobiographical essay \\
                 Albert Tucker / interviewed by Stephen B. Maurer \\
                 Stanis{\l}aw M. Ulam / interviewed by Anthony
                 Barcellos",
}

@Book{Albers:2016:GHH,
  editor =       "Donald J. Albers and Gerald L. Alexanderson and
                 William Dunham",
  title =        "The {G. H. Hardy} reader",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xv + 1 + 395",
  year =         "2016",
  ISBN =         "1-107-13555-9 (hardcover), 1-107-59464-2 (paperback)",
  ISBN-13 =      "978-1-107-13555-0 (hardcover), 978-1-107-59464-7
                 (paperback)",
  LCCN =         "QA29.H23 G44 2015",
  bibdate =      "Thu Sep 15 07:39:02 MDT 2016",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Spectrum",
  abstract =     "This book is a feast of G. H. Hardy's writing. There
                 are selections of his mathematical papers, his book
                 reviews, his tributes to departed colleagues. Some
                 articles are serious, and others display his wry sense
                 of humor. To these are added recollections by those who
                 knew Hardy, along with biographical and mathematical
                 pieces written explicitly for this collection.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "Hardy, G. H; (Godfrey Harold); (Godfrey Harold),;
                 Mathematics; History; 19th century; 20th century;
                 Mathematics.",
  subject-dates = "1877--1947",
  tableofcontents = "I: Biography \\
                 1: Hardy's life \\
                 2: The letter from Ramanujan to Hardy, 16 January 1913
                 \\
                 3: A letter from Bertrand Russell to Lady Ottoline
                 Morrell, 2 February 1913 \\
                 4: The Indian mathematician Ramanujan \\
                 5: ``Epilogue'' from The man who knew infinity by
                 Robert Kanigel \\
                 6: Posters of ``Hardy's years at Oxford'' by R. J.
                 Wilson \\
                 7: A glimpse of J. E. Littlewood \\
                 8: A letter from Freeman Dyson to C. P. Snow, 22 May
                 1967, and two letters from Hardy to Dyson \\
                 9: Miss Gertrude Hardy \\
                 II: Writings by and about G. H. Hardy \\
                 10: Hardy on writing books \\
                 11: Selections from Hardy's writings \\
                 12: Selections from what others have said about Hardy
                 \\
                 III: Mathematics \\
                 13: An introduction to the theory of numbers \\
                 14: Prime numbers \\
                 15: The theory of numbers \\
                 16: The Riemann zeta-function and lattice point
                 problems by E. C. Titchmarsh \\
                 17: Four Hardy gems \\
                 a: A function \\
                 b: An integral \\
                 c: An inequality \\
                 d: An application \\
                 18: What is geometry? \\
                 19: The case against the mathematical tripos \\
                 20: The mathematician on cricket by C. P. Snow \\
                 21: Cricket for the rest of us by John Stillwell \\
                 22: A mathematical theorem about golf \\
                 23: Mathematics in war-time \\
                 24: Mathematics \\
                 25: Asymptotic formul{\ae} in combinatory analysis
                 (excerpts) with S. Ramanujan \\
                 26: A new solution of Waring's problem (excerpts) with
                 J. E. Littlewood \\
                 27: Some notes on certain theorems in higher
                 trigonometry \\
                 28: The integral $\int_0^\infty \frac{\sin(x)}{x} \,
                 dx$ and further remarks on the integral $\int_0^\infty
                 \frac{\sin(x)}{x} \, dx$ \\
                 IV: Tributes \\
                 29: Dr. Glaisher and the ``messenger of mathematics''
                 \\
                 30: David Hilbert \\
                 31: Edmund Landau (with H. Heilbronn) \\
                 32: G{\"o}sta Mittag-Leffler \\
                 V: Book Reviews \\
                 33: Osgood's Calculus and Johnson's Calculus \\
                 34: Hadamard: The psychology of invention in the
                 mathematical field \\
                 35: Hulburt: Differential and integral calculus \\
                 36: B{\^o}cher: An introduction to the study of
                 integral equations \\
                 37: Davison: Higher Algebra \\
                 38: Zoretti: Le{\c{c}}ons de math{\'e}matiques
                 g{\'e}n{\'e}rales \\
                 A Last Word \\
                 Sources \\
                 Acknowledgments \\
                 Index \\
                 About the Editors",
}

@Book{Alder:2002:MAT,
  author =       "Ken Alder",
  title =        "The Measure of All Things: The Seven-Year Odyssey and
                 Hidden Error That Transformed the World",
  publisher =    "Free Press",
  address =      "New York, NY, USA",
  pages =        "x + 422",
  year =         "2002",
  ISBN =         "0-7432-1675-X",
  ISBN-13 =      "978-0-7432-1675-3",
  LCCN =         "QB291 .A43 2002",
  bibdate =      "Fri Oct 24 15:16:47 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "In June 1792, the erudite and cosmopolitan
                 Jean-Baptiste-Joseph Delambre and the cautious and
                 scrupulous Pierre-Fran{\c{c}}ois-Andre Mechain set out
                 from Paris --- one north to Dunkirk, the other south to
                 Barcelona to calculate the length of the meter. In the
                 face of death threats from village revolutionary
                 councils, superstitious peasants, and civil war, they
                 had only their wits and their letters to each other for
                 support. Their findings would be used to create what we
                 now know as the metric system. Despite their
                 painstaking and Herculean efforts, Mechain made a
                 mistake in his calculations that he covered up. The
                 guilty knowledge of his error drove him to the brink of
                 madness, and in the end, he died in an attempt to
                 correct himself. Only then was his mistake discovered.
                 Delambre decided to seal all evidence of the error in a
                 vault at the Paris Observatory. Two hundred year later,
                 historian Ken Alder discovered the truth. With
                 scintillating prose and wry wit, Alder uses these
                 previously overlooked letters, diaries, and journals to
                 bring to life a remarkable time when everything was
                 open to question and the light of reason made every
                 dream seem possible.",
  price =        "US\$27.00",
  acknowledgement = ack-nhfb,
  keywords =     "Arc measures --- History; Delambre, J. B. J. (Jean
                 Baptiste Joseph), 1749--1822; Meter (Unit) --- History;
                 M{\'e}chain, Pierre, 1744--1804",
  tableofcontents = "North-going astronomer \\
                 South-going astronomer \\
                 Metric of revolution \\
                 Castle of Mont-Jouy \\
                 Calculating people \\
                 Fear of France \\
                 Convergence \\
                 Triangulation \\
                 Empire of science \\
                 Broken arc \\
                 Mechain's mistake, Delambre's peace \\
                 Metered globe \\
                 Epilogue: Shape of our world",
}

@TechReport{Aldus:tiff,
  author =       "Aldus Corporation and Microsoft Corporation",
  title =        "Tag Image File Format ({TIFF}) Specification Revision
                 5.0",
  institution =  "Aldus Corporation, 411 First Avenue South, Suite 200,
                 Seattle, WA 98104, Tel: (206) 622-5500, and Microsoft
                 Corporation, 16011 NE 36th Way, Box 97017, Redmond, WA
                 98073-9717, Tel: (206) 882-8080",
  month =        aug # " 8",
  year =         "1988",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Alexander:2010:DDH,
  author =       "Amir Alexander",
  title =        "Duel at Dawn: Heroes, Martyrs, and the Rise of Modern
                 Mathematics",
  publisher =    pub-HARVARD,
  address =      pub-HARVARD:adr,
  pages =        "307",
  year =         "2010",
  ISBN =         "0-674-04661-7",
  ISBN-13 =      "978-0-674-04661-0",
  LCCN =         "QA10.7 .A44 2010",
  bibdate =      "Thu Mar 14 12:05:39 MDT 2013",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/i/infeld-leopold.bib;
                 https://www.math.utah.edu/pub/tex/bib/annscience.bib;
                 https://www.math.utah.edu/pub/tex/bib/bjhs2010.bib;
                 https://www.math.utah.edu/pub/tex/bib/histmath.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/mathgaz2010.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "From Paris to St. Petersburg, Norway to Transylvania,
                 Amir Alexander introduces us to national heroes and
                 outcasts, innocents, swindlers, and martyrs --- all
                 uncommonly gifted creators of modern mathematics.",
  acknowledgement = ack-nhfb,
  remark =       "The book contains three index entries about Leopold
                 Infeld in reference to his book on Galois
                 \cite{Infeld:1948:WGL}.",
  subject =      "Mathematics; Social aspects; History",
  tableofcontents = "Introduction: A Showdown in Paris / 1 \\
                 I: Natural men \\
                 1: The eternal child / 19 \\
                 2: Natural mathematics / 49 \\
                 II: Heroes and martyrs \\
                 3: A habit of insult: The short and impertinent life of
                 {\'E}variste Galois / 77 \\
                 4: The exquisite dance of the blue nymphs / 301 \\
                 5: A martyr to contempt / 127 \\
                 III: Romantic mathematics \\
                 6: The poetry of mathematics / 159 \\
                 7: Purity and rigor: the birth of modern mathematics /
                 184 \\
                 IV: A new and different world \\
                 8: The gifted swordsman / 215 \\
                 Conclusion: Portrait of a mathematician / 253 \\
                 Notes / 275 \\
                 Acknowledgements / 299 \\
                 Index / 301",
}

@Book{Alexandrescu:2010:DPL,
  author =       "Andrei Alexandrescu",
  title =        "The {D} programming language",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xxvii + 463",
  year =         "2010",
  ISBN =         "0-321-65953-8 (hardcover), 0-321-63536-1 (paperback)",
  ISBN-13 =      "978-0-321-65953-8 (hardcover), 978-0-321-63536-5
                 (paperback)",
  LCCN =         "QA76.73.D138 A44 2010; QA76.73.D138",
  bibdate =      "Sat Aug 21 13:36:45 MDT 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 library.mit.edu:9909/mit01",
  acknowledgement = ack-nhfb,
  subject =      "D (Computer program language)",
  tableofcontents = "Foreword by Walter Bright \\
                 Foreword by Scott Meyers \\
                 Preface \\
                 Intended Audience \\
                 Organization of the Book \\
                 A Brief History \\
                 Acknowledgments \\
                 1 ``D''iving In \\
                 1.1 Numbers and Expressions \\
                 1.2 Statements \\
                 1.3 Function Basics \\
                 1.4 Arrays and Associative Arrays \\
                 1.4.1 Building a Vocabulary \\
                 1.4.2 Array Slicing. Type-Generic Functions. Unit Tests
                 \\
                 1.4.3 Counting Frequencies. Lambda Functions \\
                 1.5 Basic Data Structures \\
                 1.6 Interfaces and Classes \\
                 1.6.1 More Statistics. Inheritance \\
                 1.7 Values versus References \\
                 1.8 Summary \\
                 2 Basic Types. Expressions \\
                 2.1 Symbols \\
                 2.1.1 Special Symbols \\
                 2.2 Literals \\
                 2.2.1 Boolean Literals \\
                 2.2.2 Integral Literals \\
                 2.2.3 Floating-Point Literals \\
                 2.2.4 Character Literals \\
                 2.2.5 String Literals \\
                 2.2.6 Array and Associative Array Literals \\
                 2.2.7 Function Literals \\
                 2.3 Operators \\
                 2.3.1 Lvalues and Rvalues \\
                 2.3.2 Implicit Numeric Conversions \\
                 2.3.3 Typing of Numeric Operators \\
                 2.3.4 Primary Expressions \\
                 2.3.5 Postfix Expressions \\
                 2.3.6 Unary Expressions \\
                 2.3.7 The Power Expression \\
                 2.3.8 Multiplicative Expressions \\
                 2.3.9 Additive Expressions \\
                 2.3.10 Shift Expressions \\
                 2.3.11 in Expressions \\
                 2.3.12 Comparison Operators \\
                 2.3.13 Bitwise OR, XOR, AND \\
                 2.3.14 Logical AND \\
                 2.3.15 Logical OR \\
                 2.3.16 The Conditional Operator \\
                 2.3.17 Assignment Operators \\
                 2.3.18 The Comma Operator \\
                 2.4 Summary and Quick Reference \\
                 3 Statements \\
                 3.1 The Expression Statement \\
                 3.2 The Compound Statement \\
                 3.3 The if Statement \\
                 3.4 The static if Statement \\
                 3.5 The switch Statement \\
                 3.6 The final switch Statement \\
                 3.7 Looping Statements \\
                 3.7.1 The while Statement \\
                 3.7.2 The do-while Statement \\
                 3.7.3 The for Statement \\
                 3.7.4 The foreach Statement \\
                 3.7.5 Foreach on Arrays \\
                 3.7.6 The continue and break Statements \\
                 3.8 The goto Statement \\
                 3.9 The with Statement \\
                 3.10 The return Statement \\
                 3.11 The throw and try Statements \\
                 3.12 The mixin Statement \\
                 3.13 The scope Statement \\
                 3.14 The synchronized Statement \\
                 3.15 The asm Statement \\
                 3.16 Summary and Quick Reference \\
                 4 Arrays, Associative Arrays, and Strings \\
                 4.1 Dynamic Arrays \\
                 4.1.1 Length \\
                 4.1.2 Bounds Checking \\
                 4.1.3 Slicing \\
                 4.1.4 Copying \\
                 4.1.5 Comparing for Equality \\
                 4.1.6 Concatenating \\
                 4.1.7 Array-wise Expressions \\
                 4.1.8 Shrinking \\
                 4.1.9 Expanding \\
                 4.1.10 Assigning to length \\
                 4.2 Fixed-Size Arrays \\
                 4.2.1 Length \\
                 4.2.2 Bounds Checking \\
                 4.2.3 Slicing \\
                 4.2.4 Copying and Implicit Conversion \\
                 4.2.5 Comparing for Equality \\
                 4.2.6 Concatenating \\
                 4.2.7 Array-wise Operations \\
                 4.3 Multidimensional Arrays \\
                 4.4 Associative Arrays \\
                 4.4.1 Length \\
                 4.4.2 Reading and Writing Slots \\
                 4.4.3 Copying \\
                 4.4.4 Comparing for Equality \\
                 4.4.5 Removing Elements \\
                 4.4.6 Iterating \\
                 4.4.7 User-Defined Types as Keys \\
                 4.5 Strings \\
                 4.5.1 Code Points \\
                 4.5.2 Encodings \\
                 4.5.3 Character Types \\
                 4.5.4 Arrays of Characters + Benefits = Strings \\
                 4.6 Arrays' Maverick Cousin: The Pointer \\
                 4.7 Summary and Quick Reference \\
                 [Chapter 5--13, Bibliography, and Index: no data
                 available]",
}

@Book{Allen:1978:AL,
  author =       "John R. Allen",
  title =        "Anatomy of {LISP}",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "xviii + 446",
  year =         "1978",
  ISBN =         "0-07-001115-X",
  ISBN-13 =      "978-0-07-001115-1",
  LCCN =         "QA76.73 .L23 A43 1978",
  bibdate =      "Tue Dec 14 22:36:12 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Allen:2001:OCM,
  author =       "Randy Allen and Ken Kennedy",
  title =        "Optimizing Compilers for Modern Architectures: a
                 Dependence-based Approach",
  publisher =    pub-MORGAN-KAUFMANN,
  address =      pub-MORGAN-KAUFMANN:adr,
  pages =        "xxv + 790",
  year =         "2001",
  ISBN =         "1-55860-286-0, 0-585-45699-2 (e-book)",
  ISBN-13 =      "978-1-55860-286-1, 978-0-585-45699-7 (e-book)",
  LCCN =         "QA76.76.C65 A45 2001",
  bibdate =      "Thu Jan 31 05:26:44 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://www.loc.gov/catdir/description/els031/2001092381.html;
                 http://www.loc.gov/catdir/toc/els031/2001092381.html",
  abstract =     "Modern computer architectures designed with
                 high-performance microprocessors offer tremendous
                 potential gains in performance over previous designs.
                 Yet their very complexity makes it increasingly
                 difficult to produce efficient code and to realize
                 their full potential. This landmark text from two
                 leaders in the field focuses on the pivotal role that
                 compilers can play in addressing this critical issue.
                 The basis for all the methods presented in this book is
                 data dependence, a fundamental compiler analysis tool
                 for optimizing programs on high-performance
                 microprocessors and parallel architectures. It enables
                 compiler designers to write compilers that
                 automatically transform simple, sequential programs
                 into forms that can exploit special features of these
                 modern architectures. The text provides a broad
                 introduction to data dependence, to the many
                 transformation strategies it supports, and to its
                 applications to important optimization problems such as
                 parallelization, compiler memory hierarchy management,
                 and instruction scheduling. The authors demonstrate the
                 importance and wide applicability of dependence-based
                 compiler optimizations and give the compiler writer the
                 basics needed to understand and implement them. They
                 also offer cookbook explanations for transforming
                 applications by hand to computational scientists and
                 engineers who are driven to obtain the best possible
                 performance of their complex applications. The
                 approaches presented are based on research conducted
                 over the past two decades, emphasizing the strategies
                 implemented in research prototypes at Rice University
                 and in several associated commercial systems. Randy
                 Allen and Ken Kennedy have provided an indispensable
                 resource for researchers, practicing professionals, and
                 graduate students engaged in designing and optimizing
                 compilers for modern computer architectures. This text:
                 offers a guide to the simple, practical algorithms and
                 approaches that are most effective in real-world,
                 high-performance microprocessor and parallel systems;
                 demonstrates each transformation in worked examples;
                 examines how two case study compilers implement the
                 theories and practices described in each chapter;
                 presents the most complete treatment of memory
                 hierarchy issues of any compiler text; illustrates
                 ordering relationships with dependence graphs
                 throughout the book; applies the techniques to a
                 variety of languages, including Fortran 77, C, hardware
                 definition languages, Fortran 90, and High Performance
                 Fortran; and provides extensive references to the most
                 sophisticated algorithms known in research.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "Optimizing compilers; Computer architecture",
  tableofcontents = "Preface \\
                 1: Compiler challenges for high-performance
                 architectures \\
                 2: Dependence \\
                 3: Dependence testing \\
                 4: Preliminary transformations \\
                 5: Enhancing fine-grained parallelism \\
                 6: Creating coarse-grained parallelism \\
                 7: Handling control flow \\
                 8: Improving register usage \\
                 9: Managing cache \\
                 10: Scheduling \\
                 11: Interprocedural analysis and optimization \\
                 12: Dependence in C and hardware design \\
                 13: Compiling array assignments \\
                 14: Compiling High Performance Fortran \\
                 Appendix: Fundamentals of Fortran 90 \\
                 References \\
                 Index",
}

@TechReport{Almgren:2000:HWC,
  author =       "Fredrik Almgren and Gunnar Andersson and Torbj{\"o}rn
                 Granlund and Lars Ivansson and Staffan Ulfberg",
  title =        "How We Cracked the {Code Book} Ciphers",
  type =         "Technical report",
  institution =  "????",
  address =      "????",
  pages =        "40",
  day =          "11",
  month =        oct,
  year =         "2000",
  bibdate =      "Thu Jan 17 10:51:00 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/adabooks.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See \cite{Singh:1999:CBE}.",
  URL =          "http://frode.home.cern.ch/frode/crypto/codebook_solution.pdf;
                 http://www.simonsingh.com/cipher.htm",
  acknowledgement = ack-nhfb,
}

@Book{Alred:2006:HTW,
  author =       "Gerald J. Alred and Charles T. Brusaw and Walter E.
                 Oliu",
  title =        "Handbook of Technical Writing",
  publisher =    "Bedford\slash St. Martins",
  address =      "Boston, MA, USA",
  edition =      "Eighth",
  pages =        "xxiv + 636",
  year =         "2006",
  ISBN =         "0-312-43613-0 (paperback), 0-312-35267-0 (hardcover)",
  ISBN-13 =      "978-0-312-43613-1 (paperback), 978-0-312-35267-7
                 (hardcover)",
  LCCN =         "T11 .B78 2006",
  bibdate =      "Mon Apr 14 18:09:54 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0708/2005921350-b.html;
                 http://www.loc.gov/catdir/enhancements/fy0708/2005921350-d.html",
  acknowledgement = ack-nhfb,
  subject =      "Technical writing; Handbooks, manuals, etc",
  tableofcontents = "Model documents and figures by topic \\
                 Five steps to successful writing \\
                 Checklist of the writing process \\
                 Handbook of technical writing: alphabetical entries /
                 1--585 \\
                 Commonly misused words and phrases \\
                 Contents by topic",
}

@Article{Alt:1948:BTLa,
  author =       "Franz L. Alt",
  title =        "A {Bell Telephone Laboratories}' Computing
                 Machine---{I}",
  journal =      j-MATH-TABLES-OTHER-AIDS-COMPUT,
  volume =       "3",
  number =       "21",
  pages =        "1--13",
  month =        jan,
  year =         "1948",
  CODEN =        "MTTCAS",
  ISSN =         "0891-6837",
  bibdate =      "Tue Oct 13 08:44:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib; JSTOR
                 database",
  note =         "Reprinted in \cite[\S 6.4]{Randell:1982:ODC}.",
  acknowledgement = ack-nhfb,
}

@Book{Altland:2019:MPI,
  author =       "Alexander Altland and Jan von Delft",
  title =        "Mathematics for Physicists: Introductory Concepts and
                 Methods",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xxi + 700",
  year =         "2019",
  ISBN =         "1-108-47122-6 (hardcover)",
  ISBN-13 =      "978-1-108-47122-0 (hardcover)",
  LCCN =         "QC20 .A4345 2019",
  bibdate =      "Thu Mar 7 16:33:21 MST 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Mathematical physics; Physics; Mathematische Physik",
  tableofcontents = "Preface \\
                 Part I. Linear Algebra: \\
                 1. Mathematics before numbers \\
                 2. Vector spaces \\
                 3. Euclidean geometry \\
                 4. Vector product \\
                 5. Linear maps \\
                 6. Determinants \\
                 7. Matrix diagonalization \\
                 8. Unitarity and hermiticity \\
                 9. Linear algebra in function spaces \\
                 10. Multilinear algebra \\
                 Problems: linear algebra \\
                 Part II. Calculus: \\
                 1. Differentiation of one-dimensional functions \\
                 2. Integration of one-dimensional functions \\
                 3. Partial differentiation \\
                 4. Multi-dimensional integration \\
                 5. Taylor series \\
                 6. Fourier calculus \\
                 7. Differential equations \\
                 8. Functional calculus \\
                 9. Calculus of complex functions \\
                 Problems: calculus \\
                 Part III. Vector Calculus: \\
                 1. Curves \\
                 2. Curvilinear coordinates \\
                 3. Fields \\
                 4. Introductory concepts of differential geometry \\
                 5. Alternating differential forms \\
                 6. Riemannian differential geometry \\
                 7. Case study: differential forms and electrodynamics
                 \\
                 Problems: vector calculus \\
                 Solutions: linear algebra \\
                 Solutions: calculus \\
                 Solutions: vector calculus \\
                 Index",
}

@Book{Alvarez:1997:RCD,
  author =       "Walter Alvarez",
  title =        "{T. rex} and the crater of doom",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "xxii + 185",
  year =         "1997",
  ISBN =         "0-691-13103-1",
  ISBN-13 =      "978-0-691-13103-0",
  LCCN =         "QE721.2.E97 ALV 1997",
  bibdate =      "Thu Apr 15 06:40:35 MDT 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 library.ox.ac.uk:210/ADVANCE",
  URL =          "http://www.jstor.org/stable/j.ctt28553d",
  acknowledgement = ack-nhfb,
  remark =       "Third printing and first paperback printing (2008).",
  subject =      "Tyrannosaurus rex; catastrophes (geology); extinction
                 (biology); cryptoexplosion structures; Mexico;
                 Campeche, Bay of, region; Chicxulub Crater",
  tableofcontents = "Foreword / ix \\
                 Preface / xix \\
                 1: Armageddon / 3 \\
                 2: Ex Libro Lapidum Historia Mundi / 19 \\
                 3: Gradualist versus Catastrophist / 43 \\
                 4: Iridium / 59 \\
                 5: The Search for the Impact Site / 82 \\
                 6: The Crater of Doom / 106 \\
                 7: The World after Chicxulub / 130 \\
                 Notes / 147 \\
                 Index / 171",
}

@Book{Ament:2001:INB,
  author =       "Kurt Ament",
  title =        "Indexing: a Nuts-and-bolts Guide for Technical
                 Writers",
  publisher =    "William Andrew Publishing",
  address =      "Norwich, NY, USA",
  pages =        "x + 97",
  year =         "2001",
  ISBN =         "0-8155-1481-6",
  ISBN-13 =      "978-0-8155-1481-7",
  LCCN =         "T10.8 .A44 2001",
  bibdate =      "Fri Jun 17 06:26:43 MDT 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "ftp://uiarchive.cso.uiuc.edu/pub/etext/gutenberg/;
                 http://www.loc.gov/catdir/description/wap041/2001033646.html;
                 http://www.loc.gov/catdir/toc/wap041/2001033646.html;
                 http://www.williamandrew.com/books.asp?id=1481",
  abstract =     "\booktitle{Indexing: A Practical Guide for Technical
                 Writers} is a nuts-and-bolts guide to indexing. It
                 explains in plain language and by example exactly how
                 to index any type of print or online publication
                 quickly, easily, and effectively. The sequential
                 indexing method presented in the book has been
                 battle-tested in high pressure publishing organizations
                 in a variety of high-tech industries over the space of
                 a decade. Because it is based on real-world success,
                 this indexing method is bulletproof. Users of this
                 guide will succeed as an indexer. Unlike other books on
                 the subject, this book is focused on readers, not the
                 subject itself. The book speaks directly to highly
                 practical and often anti-academic technical writers who
                 demand usability, reusability, and reliability. It is
                 geared to people with ``Keep It Simple, Stupid'' signs
                 on their cubicle walls. Proven end-user documentation
                 techniques are employed to present proven indexing
                 methods to readers who themselves develop end-user
                 documentation for a living. They have zero tolerance
                 for academic white papers on indexing. So, the book
                 delivers the hard facts.",
  acknowledgement = ack-nhfb,
  idnumber =     "502",
  keywords =     "Technology --- Abstracting and indexing, Science ---
                 Abstracting and indexing",
  remark =       "",
  subject =      "Technology; Abstracting and indexing; Science;
                 Abstracting and indexing",
  tableofcontents = "1: About indexing \\
                 Anyone can index \\
                 Sequential indexing \\
                 Usable indexes increase profits \\
                 2: Start indexing. Step 1 \\
                 Index chapters. Step 2 \\
                 Index procedures. Step 3 \\
                 Index topics. Step 4 \\
                 Index product names. Step 5 \\
                 Index product components. Step 6 \\
                 Index front and back matter. Step 7 \\
                 Edit your index. Step 8 \\
                 Create ``see'' references. Step 9 \\
                 Create ``see also'' references. Step 10 \\
                 Test your index \\
                 3: Indexing guidelines \\
                 Abbreviations \\
                 Acronyms \\
                 Articles \\
                 Back matter \\
                 Capitalization \\
                 Cross-references \\
                 Front matter \\
                 Interface components \\
                 Keyboard shortcuts \\
                 Master indexing \\
                 Nesting \\
                 Page ranges \\
                 Prepositions \\
                 Procedures \\
                 Product names \\
                 Scheduling \\
                 ``See'' references \\
                 ``See also'' references \\
                 Sorting \\
                 System messages",
}

@Book{Ames:1993:BPO,
  author =       "Patrick Ames",
  title =        "Beyond Paper: The Official Guide to {Adobe Acrobat}",
  publisher =    pub-ADOBE-PRESS,
  address =      pub-ADOBE-PRESS:adr,
  pages =        "127",
  year =         "1993",
  ISBN =         "1-56830-050-6",
  ISBN-13 =      "978-1-56830-050-4",
  LCCN =         "TK5105.9 .A48 1993",
  bibdate =      "Thu Jul 7 07:43:49 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$16.95",
  acknowledgement = ack-nhfb,
}

@Book{Anderson:1992:LUG,
  author =       "E. Anderson and Z. Bai and C. Bischof and J. Demmel
                 and J. Dongarra and J. {Du Croz} and A. Greenbaum and
                 S. Hammarling and A. McKenney and S. Ostrouchov and D.
                 Sorensen",
  title =        "{LAPACK} Users' Guide",
  publisher =    pub-SIAM,
  address =      pub-SIAM:adr,
  pages =        "xv + 235",
  year =         "1992",
  ISBN =         "0-89871-294-7",
  ISBN-13 =      "978-0-89871-294-0",
  LCCN =         "QA76.73.F25 L36 1992",
  bibdate =      "Tue Dec 14 22:36:17 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/d/dongarra-jack-j.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook2.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Part 1: Guide / 1 \\
                 1: Essentials / 3 \\
                 2: Contents of LAPACK / 7 \\
                 3: Performance of LAPACK / 34 \\
                 4: Accuracy and Stability / 44 \\
                 5: Documentation and Software Conventions / 61 \\
                 6: Installing LAPACK Routines / 71 \\
                 7: Troubleshooting / 75 \\
                 A: Index of Driver and Computational Routines / 79 \\
                 B: Index of Auxiliary Routines / 89 \\
                 C: Quick Reference Guide to the BLAS / 96 \\
                 D: Converting from LINPACK or EISPACK / 101 \\
                 E: LAPACK Working Notes / 109 \\
                 Bibliography / 112 \\
                 Index / 116 \\
                 Part 2: Specifications of Routines / 119",
}

@Book{Anderson:1995:LUG,
  author =       "E. Anderson and Z. Bai and C. Bischof and J. Demmel
                 and J. Dongarra and J. {Du Croz} and A. Greenbaum and
                 S. Hammarling and A. McKenney and S. Ostrouchov and D.
                 Sorensen",
  title =        "{LAPACK} Users' Guide",
  publisher =    pub-SIAM,
  address =      pub-SIAM:adr,
  edition =      "Second",
  pages =        "xix + 325",
  year =         "1995",
  ISBN =         "0-89871-345-5 (paperback)",
  ISBN-13 =      "978-0-89871-345-9 (paperback)",
  LCCN =         "QA76.73.F25 L36 1995",
  bibdate =      "Sat Dec 06 17:25:09 2003",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/d/dongarra-jack-j.bib;
                 https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
                 https://www.math.utah.edu/pub/tex/bib/fortran3.bib;
                 https://www.math.utah.edu/pub/tex/bib/gnu.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  keywords =     "algebras, linear -- data processing; Fortran (computer
                 program language); LAPACK; subroutines (computer
                 programs)",
}

@Book{Anderson:1999:LUG,
  author =       "E. Anderson and Z. Bai and C. Bischof and S. Blackford
                 and J. Demmel and J. Dongarra and J. Du Croz and A.
                 Greenbaum and S. Hammarling and A. McKenney and D.
                 Sorensen",
  title =        "{LAPACK} Users' Guide",
  publisher =    pub-SIAM,
  address =      pub-SIAM:adr,
  edition =      "Third",
  pages =        "xxi + 407",
  year =         "1999",
  ISBN =         "0-89871-447-8",
  ISBN-13 =      "978-0-89871-447-0",
  LCCN =         "QA76.73.F25 L36 1999",
  bibdate =      "Thu Sep 19 07:23:11 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Anderson:2020:SE,
  author =       "Ross Anderson",
  title =        "Security Engineering",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  edition =      "Third",
  pages =        "1232",
  year =         "2020",
  ISBN =         "1-119-64278-7 (hardcover), 0-471-38922-6 (paperback),
                 1-119-64281-7 (e-book)",
  ISBN-13 =      "978-1-119-64278-7 (hardcover), 978-0-471-38922-4
                 (paperback), 978-1-119-64281-7 (e-book)",
  LCCN =         "QA76.9.A25 A54 2020",
  bibdate =      "Tue May 6 09:26:27 MDT 2025",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Now that there's software in everything, how can you
                 make anything secure? Understand how to engineer
                 dependable systems with this newly updated classic In
                 Security Engineering: A Guide to Building Dependable
                 Distributed Systems, Third Edition Cambridge University
                 professor Ross Anderson updates his classic textbook
                 and teaches readers how to design, implement, and test
                 systems to withstand both error and attack. This book
                 became a best-seller in 2001 and helped establish the
                 discipline of security engineering. By the second
                 edition in 2008, underground dark markets had let the
                 bad guys specialize and scale up; attacks were
                 increasingly on users rather than on technology. The
                 book repeated its success by showing how security
                 engineers can focus on usability. Now the third edition
                 brings it up to date for 2020. As people now go online
                 from phones more than laptops, most servers are in the
                 cloud, online advertising drives the Internet and
                 social networks have taken over much human interaction,
                 many patterns of crime and abuse are the same, but the
                 methods have evolved. Ross Anderson explores what
                 security engineering means in 2020, including: How the
                 basic elements of cryptography, protocols, and access
                 control translate to the new world of phones, cloud
                 services, social media and the Internet of Things Who
                 the attackers are --- from nation states and business
                 competitors through criminal gangs to stalkers and
                 playground bullies What they do --- from phishing and
                 carding through SIM swapping and software exploits to
                 DDoS and fake news Security psychology, from privacy
                 through ease-of-use to deception The economics of
                 security and dependability --- why companies build
                 vulnerable systems and governments look the other way
                 How dozens of industries went online --- well or
                 badly.",
  libnote =      "Not in my library.",
  tableofcontents = "What is security engineering? \\
                 Protocols \\
                 Passwords \\
                 Access control \\
                 Cryptography \\
                 Distributed systems \\
                 Multilevel security \\
                 Multilateral security \\
                 Banking and bookkeeping \\
                 Monitoring systems \\
                 Nuclear command and control \\
                 Security printing and seals \\
                 Biometrics \\
                 Physical tamper resistance \\
                 Emission security \\
                 Electronic and information warfare \\
                 Telecom system security \\
                 Network attack and defense \\
                 Protecting E-commerce systems \\
                 Copyright and privacy protection \\
                 E-policy \\
                 Management issues \\
                 System evaluation and assurance",
}

@Book{Andrews:1963:ESM,
  author =       "Frank C. Andrews",
  title =        "Equilibrium Statistical Mechanics",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xi + 206",
  year =         "1963",
  LCCN =         "QC174.8.Z534",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Andrews:1999:SF,
  author =       "George E. Andrews and Richard Askey and Ranjan Roy",
  title =        "Special Functions",
  volume =       "71",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xvi + 664",
  year =         "1999",
  ISBN =         "0-521-62321-9 (hardcover), 0-521-78988-5 (paperback)",
  ISBN-13 =      "978-0-521-62321-6 (hardcover), 978-0-521-78988-2
                 (paperback)",
  LCCN =         "QA351 .A74 1999",
  bibdate =      "Mon Sep 17 18:52:30 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$90.00 (hardcover), US\$34.95 (paperback)",
  series =       "Encyclopedia of mathematics and its applications",
  abstract =     "This treatise presents an overview of special
                 functions, focusing primarily on hypergeometric
                 functions and the associated hypergeometric series,
                 including Bessel functions and classical orthogonal
                 polynomials. The basic building block of the functions
                 studied in this book is the gamma function. In addition
                 to relatively new work on gamma and beta functions,
                 such as Selberg's multidimensional integrals, a number
                 of important but relatively unknown nineteenth century
                 results are included. The authors provide organizing
                 ideas, motivation, and historical background for the
                 study and application of some important special
                 functions. This work can serve as a learning tool and
                 lasting reference for students and researchers in
                 special functions, mathematical physics, differential
                 equations, mathematical computing, number theory, and
                 combinatorics.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "1: The Gamma and Beta Functions \\
                 2: The Hypergeometric Functions \\
                 3: Hypergeometric Transformations and Identities \\
                 4: Bessel Functions and Confluent Hypergeometric
                 Functions \\
                 5: Orthogonal Polynomials \\
                 6: Special Orthogonal Polynomials \\
                 7: Topics in Orthogonal Polynomials \\
                 8: The Selberg Integral and Its Applications \\
                 9: Spherical Harmonics \\
                 10: Introduction to $q$-series \\
                 11: Partitions \\
                 12: Bailey Chains \\
                 A: Infinite Products \\
                 B: Summability and Fractional Integration \\
                 C: Asymptotic Expansions \\
                 D: Euler--Maclaurin Summation Formula \\
                 E: Lagrange Inversion Formula \\
                 F: Series Solutions of Differential Equations",
}

@Book{Angell:1981:PIC,
  author =       "Ian O. Angell",
  title =        "A Practical Introduction to Computer Graphics",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "viii + 146",
  year =         "1981",
  ISBN =         "0-470-27251-1",
  ISBN-13 =      "978-0-470-27251-0",
  LCCN =         "T385 .A53 1981",
  bibdate =      "Tue Dec 14 22:39:01 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Anklam:1982:ECV,
  author =       "Patricia Anklam and David Cutler and Roger {Heinen,
                 Jr.} and M. Donald MacLaren",
  title =        "Engineering a Compiler: {VAX-11} Code Generation and
                 Optimization",
  publisher =    pub-DP,
  address =      pub-DP:adr,
  pages =        "xv + 269",
  year =         "1982",
  ISBN =         "0-932376-19-3",
  ISBN-13 =      "978-0-932376-19-0",
  LCCN =         "QA76.8.V37 E53 1982",
  bibdate =      "Sun Jul 10 01:07:03 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Where We Began, and Why / 1 \\
                 Background / 1 \\
                 Building the PL/1 Team / 2 \\
                 The Original Compiler / 2 \\
                 Armed for the Dragon / 3 \\
                 Getting Started: Design Decisions / 5 \\
                 A Code Generation Method / 5 \\
                 Bootstrapping / 6 \\
                 A Project Plan / 10 \\
                 Tools We Needed / 11 \\
                 How We Changed the Compiler / 12 \\
                 Introducing The VAX-11 Compiler and Common Code
                 Generator / 12 \\
                 The TBL (Table-Building Language) / 18 \\
                 How TBL Programs Are Constructed / 18 \\
                 The ``Language'' / 20 \\
                 Sample TBL Program and Its Interpreter / 24 \\
                 What the Front End Must Do / 35 \\
                 Parsing and Semantic Analysis / 36 \\
                 The Symbol Table / 37 \\
                 Trees / 45 \\
                 Block Activations and Stack Management / 47 \\
                 The Intermediate Language / 52 \\
                 Design Considerations / 52 \\
                 Summary of Operators / 54 \\
                 Data Types of Operators / 57 \\
                 References to Data / 59 \\
                 Computation of Offsets and Extents / 64 \\
                 Procedure Calls / 66 \\
                 Writing and Reducing Trees / 70 \\
                 The Evolution of Write Tree / 70 \\
                 Overview of Functions / 72 \\
                 Reduction of Integer Expressions / 76 \\
                 When a Tree Is Not a Tree / 80 \\
                 Global Optimization / 86 \\
                 Background: Engineering an Optimizer / 86 \\
                 Underlying Concepts and Assumptions / 88 \\
                 Structure and Control Flow in the Optimizer / 96 \\
                 Selecting Variables for Assignment to Registers / 99
                 \\
                 Optimizing Boolean Branch Expressions / 100 \\
                 Constructing the Flow Graph / 105 \\
                 Live Variable Analysis / 111 \\
                 Value Propagation and Register Assignment / 113 \\
                 Loop Invariant Removal / 125 \\
                 Common Subexpression Elimination / 134 \\
                 Result Incorporation / 145 \\
                 Conclusions / 146 \\
                 Operator Transformation and Code Generation / 152 \\
                 Background / 152 \\
                 Overview / 153 \\
                 Temporaries / 156 \\
                 Building Code Blocks / 159 \\
                 The Register Allocator / 169 \\
                 Background / 169 \\
                 Overview / 172 \\
                 Register Assignment / 175 \\
                 Updating Operand Specifiers in Code Blocks / 187 \\
                 Effects of Register Allocation on a Sample Program /
                 191 \\
                 Conclusions / 194 \\
                 Peephole Optimization / 196 \\
                 Objectives / 196 \\
                 Design / 197 \\
                 Scanning the Intermediate Code List / 198 \\
                 Some Peepholes / 199 \\
                 Conclusions / 202 \\
                 Beauty and the Beast / 204 \\
                 Background / 204 \\
                 The Beast / 205 \\
                 The Beauty / 213 \\
                 What Is the Moral? / 217 \\
                 Concluding Remarks / 219 \\
                 Appendix: Optimized Code Examples / 223 \\
                 Glossary / 239 \\
                 Index / 253",
}

@Book{Anlauff:2002:MBP,
  author =       "Heidi Anlauff and Axel B{\"o}ttcher and Martin
                 Ruckert",
  title =        "{Das MMIX-Buch: ein praxisnaher Zugang zur
                 Informatik}. ({German}) [{The MMIX Book}: a practical
                 introduction to computer science]",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xiv + 327",
  year =         "2002",
  DOI =          "https://doi.org/10.1007/978-3-642-56233-4",
  ISBN =         "3-540-42408-3 (paperback), 3-642-56233-7",
  ISBN-13 =      "978-3-540-42408-6 (paperback), 978-3-642-56233-4",
  LCCN =         "QA76.8.M6 A55 2002",
  bibdate =      "Thu Apr 26 06:59:30 MDT 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.gbv.de:20011/gvk",
  price =        "EUR 24.95",
  series =       "Springer-Lehrbuch",
  URL =          "http://www.informatik.fh-muenchen.de/~mmix/MMIXBuch/",
  abstract =     "Das vorliegende Buch gibt eine praxisnahe
                 Einf{\"u}hrung in die Informatik. Zun{\"a}chst werden
                 die Grundlagen der Kodierung und der
                 Informationsdarstellung abgehandelt und fundamentale
                 Kontroll- und Datenstrukturen vorgestellt.
                 Anschlie{\ss}end werden Architekturmerkmale von
                 Prozessoren (RISC und CISC) sowie Mechanismen der
                 Systemsteuerung wie Pipelining und Interrupts
                 erl{\"a}utert. Zum Abschlu{\ss} erfolgt eine kompakte
                 Beschreibung der wichtigsten Funktionen eines
                 Betriebssystems wie die Organisation von Prozessen und
                 die Speicherverwaltung. Die Darstellung all dieser
                 Konzepte wird dabei anhand des Modellprozessors MMIX
                 gezeigt, der von Donald E. Knuth (Stanford University)
                 in seinem weltweit anerkannten Standardwerk ``The Art
                 of Computer Programming'' entwickelt wurde. Die
                 Funktionsweise dieses Prozessors wird in einem eigenen
                 Kapitel ausf{\"u}hrlich beschrieben. Weiterhin werden
                 die Programmierumgebung des MMIX und seine
                 Assemblersprache MMIXAL in erg{\"a}nzenden Anh{\"a}ngen
                 des Grundtextes zusammengestellt. Dieses Lehrbuch
                 eignet sich hervorragend zum Selbststudium. Neben der
                 Vermittlung von Grundlagenwissen steht insbesondere die
                 Wechselwirkung von Programmierung und Rechneraufbau im
                 Vordergrund.",
  acknowledgement = ack-nhfb,
  language =     "German",
  libnote =      "Not yet in my library.",
  subject =      "MMIX; Programmierung; Befehl <Informatik>",
  tableofcontents = "1. Einf{\"u}hrung \\
                 1.1 Computer \\
                 1.2 Die Hardware-Software-Schnittstelle \\
                 1.3 Das klassische Computermodell \\
                 1.4 Warum MMIX? \\
                 2. Darstellung von Information \\
                 Codierung und Zahlensysteme \\
                 2.1 Information, Daten und Nachricht \\
                 2.2 Codierung \\
                 2.3 Zahlensysteme \\
                 2.4 Negative Zahlen \\
                 2.5 Byte als Ma{\ss} f{\"u}r die Speicherkapazit{\"a}t
                 \\
                 3. Einf{\"u}hrung in MMIX \\
                 3.1 Der MMIX-Prozessor \\
                 3.2 Speicherzugriff \\
                 3.3 Arithmetik mit MMIX \\
                 3.4 Einfache Ein- und Ausgabe \\
                 3.5 Symbole zur Erh{\"o}hung der Lesbarkeit eines
                 Programms \\
                 4. Sprungbefehle und Kontrollstrukturen \\
                 4.1 Unbedingte Spr{\"u}nge \\
                 4.2 Bedingte Verzweigungen \\
                 4.3 Kontrollstrukturen \\
                 4.4 Bedingte Zuweisungen \\
                 5. Unterprogramme \\
                 5.1 Einf{\"u}hrung \\
                 5.2 Unterprogrammaufrufe mit GO \\
                 5.3 Der Stack \\
                 5.4 Exkurs: Pr{\"a}fix und lokale Symbole \\
                 5.5 Der Registerstack \\
                 6. Datenstrukturen \\
                 6.1 Bit \\
                 6.2 Adressen und Zeiger \\
                 6.3 Gleitkommazahlen \\
                 6.4 Zusammengesetzte Datentypen \\
                 6.5 Abstrakte Datentypen \\
                 6.6 Anwendung: Bitmap-Grafiken erzeugen und bearbeiten
                 \\
                 7. Ablaufsteuerung \\
                 7.1 Steuerwerk und Befehlszyklus \\
                 7.2 Adressierungsarten \\
                 7.3 RISC und CISC \\
                 7.4 Pipelining \\
                 7.5 Interrupts \\
                 8. Betriebssystem \\
                 8.1 Speicherverwaltung \\
                 8.2 Betriebssystemaufrufe \\
                 8.3 Prozesse \\
                 A. Liste der Befehle \\
                 B. Liste der Programme \\
                 c. Programmieren mit MMIX \\
                 C.1 Die Programmierumgebung zum Laufen bringen \\
                 C.1.1 Die ausf{\"u}hrbaren Dateien herunterladen \\
                 C.1.2 Die Programmierumgebung selbst {\"u}bersetzen \\
                 C.2 Versuche \\
                 D. Meldungen von mmixal und mmix \\
                 D.1 Warnungen von mmixal \\
                 D.2 Fehlermeldungen von mmixal \\
                 D.3 Meldungen von mmix \\
                 E. Zusammenfassung der Assemblersprache MMIXAL \\
                 E.1 Einfache Elemente \\
                 E.2 Ausdr{\"u}cke \\
                 E.3 Instruktionen \\
                 F. L{\"o}sung ausgew{\"a}hlter {\"U}bungsaufgaben",
}

@Book{Anonymous:1976:RAB,
  author =       "Anonymous",
  title =        "Road atlas {Britain}",
  publisher =    "John Bartholomew \& Son",
  address =      "Edinburgh, Scotland",
  pages =        "120",
  year =         "1976",
  ISBN =         "0-85152-505-9",
  ISBN-13 =      "978-0-85152-505-1",
  LCCN =         "G1811.P2 B350 1975",
  bibdate =      "Sat Dec 24 15:53:15 MST 2005",
  bibsource =    "BIBSYS [NO];
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  bookformat =   "Hardcover",
  dateentered =  "2005-12-23",
  idnumber =     "546",
}

@Book{Anonymous:1990:ASM,
  author =       "Anonymous",
  title =        "{AIP} style manual",
  publisher =    pub-AIP,
  address =      pub-AIP:adr,
  edition =      "Fourth",
  pages =        "64",
  year =         "1990",
  ISBN =         "0-88318-642-X (paperback)",
  ISBN-13 =      "978-0-88318-642-8 (paperback)",
  LCCN =         "QC5.45 .A45; QC28 .A5 1990; T11 .A45 1990",
  bibdate =      "Tue Nov 21 07:37:46 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/typeset.bib",
  abstract =     "Covers summary information for journal contributors,
                 preparing a scientific paper for publication, general
                 style, mathematical expressions, and figures.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "Information for journal contributors \\
                 Preparing a scientific paper for publication \\
                 General style \\
                 Mathematical expressions \\
                 Figures \\
                 Appendix A: Statements of editorial policy for AIP and
                 member society journals \\
                 Appendix B: Correct or preferred spellings of
                 frequently occurring words \\
                 Appendix C: Units of measure \\
                 Appendix D: Standard abbreviations \\
                 Appendix E: Alphabets available for typesetting \\
                 Appendix F: Special symbols available for typesetting
                 \\
                 Appendix G: Journal title abbreviations \\
                 Appendix H: Symbols used in correcting proof \\
                 Appendix I: Physics and astronomy classification scheme
                 \\
                 Appendix J: Physics auxiliary publication scheme \\
                 Appendix K: AIP transfer of copyright agreement",
}

@Book{Anonymous:1993:CMS,
  author =       "Anonymous",
  key =          "Chicago Manual of Style",
  title =        "The {Chicago} Manual of Style",
  publisher =    pub-U-CHICAGO,
  address =      pub-U-CHICAGO:adr,
  edition =      "Fourteenth",
  pages =        "ix + 921",
  year =         "1993",
  ISBN =         "0-226-10389-7",
  ISBN-13 =      "978-0-226-10389-1",
  LCCN =         "Z253 .U69 1993",
  bibdate =      "Mon Sep 23 08:57:34 1996",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/subjects/han-wri-mat-sci-2ed.bib;
                 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",
  price =        "US\$40.00",
  abstract =     "Provides information on manuscript preparation,
                 punctuation, spelling, quotations, captions, tables,
                 abbreviations, references, bibliographies, notes, and
                 indexes, with sections on journals and electronic
                 media.",
  acknowledgement = ack-njh # " and " # ack-nhfb,
  annote =       "The standard American work on typesetting style etc.
                 (CHe)",
  bibliography = "yes",
  glossary =     "yes",
  history =      "First edition 1906, 12th edition 1969, 13th edition
                 1982, 14th edition 1993",
  idnumber =     "517",
  index =        "yes",
  inprint =      "yes",
  keywords =     "authorship handbooks; authorship manuals; practical
                 style manuals; printing",
  printermarks = "yes",
  subtitle =     "The Essential Guide for Writers, Editors and
                 Publishers",
  tableofcontents = "The publishing process \\
                 Books and journals \\
                 Overview \\
                 The parts of a book \\
                 The parts of a journal \\
                 Considerations for web-based publications \\
                 Manuscript preparation, manuscript editing, and
                 proofreading \\
                 Overview and process outline \\
                 Manuscript preparation guidelines for authors \\
                 Manuscript editing \\
                 Proofreading \\
                 Illustrations and tables \\
                 Overview \\
                 Illustrations \\
                 Tables \\
                 Rights, permissions, and copyright administration /
                 William S. Strong \\
                 Overview \\
                 Copyright law and the licensing of rights \\
                 The publishing agreement \\
                 Subsidiary rights and permissions \\
                 The author's responsibilities \\
                 Style and usage \\
                 Grammar and usage / Bryan A. Garner \\
                 Grammar \\
                 Word usage \\
                 Punctuation \\
                 Overview \\
                 Punctuation in relation to surrounding text \\
                 Periods \\
                 Commas \\
                 Semicolons \\
                 Colons \\
                 Question marks \\
                 Exclamation points \\
                 Hyphens and dashes \\
                 Parentheses \\
                 Brackets and braces \\
                 Slashes \\
                 Quotation marks \\
                 Apostrophes \\
                 Multiple punctuation marks \\
                 Lists and outline style \\
                 Spelling, distinctive treatment of words, and compounds
                 \\
                 Overview \\
                 Plurals \\
                 Possessives \\
                 Contractions and interjections \\
                 Word division \\
                 A and an, o and oh \\
                 Ligatures \\
                 Italics, capitals, and quotation marks \\
                 Compounds and hyphenation \\
                 Names and terms \\
                 Overview \\
                 Personal names \\
                 Titles and offices \\
                 Epithets, kinship names, and personifications \\
                 Ethnic, socioeconomic, and other groups \\
                 Names of places \\
                 Words derived from proper names \\
                 Names of organizations \\
                 Historical and cultural terms \\
                 Calendar and time designations \\
                 Religious names and terms \\
                 Military terms \\
                 Names of ships and other vehicles \\
                 Scientific terminology \\
                 Brand names and trademarks \\
                 Titles of works \\
                 Signs and mottoes \\
                 Numbers \\
                 Overview \\
                 Numerals versus words \\
                 Plurals and punctuation of numbers \\
                 Inclusive numbers \\
                 Roman numerals \\
                 Abbreviations \\
                 Overview \\
                 Names and titles \\
                 Geographical terms \\
                 Designations of time \\
                 Scholarly abbreviations \\
                 Biblical abbreviations \\
                 Technology and science \\
                 Business and commerce \\
                 Foreign languages \\
                 Overview \\
                 Titles and other proper names \\
                 Languages using the Latin alphabet \\
                 Languages usually transliterated (or romanized) \\
                 Classical Greek \\
                 Old English and middle English \\
                 American sign language \\
                 Mathematics in type \\
                 Overview \\
                 Style of mathematical expressions \\
                 Preparation and editing of paper manuscripts \\
                 Quotations and dialogue \\
                 Overview \\
                 Permissible changes to quotations \\
                 Quotations in relation to text \\
                 Quotation marks \\
                 Ellipses \\
                 Interpolations and clarifications \\
                 Citing sources in text \\
                 Foreign-language quotations \\
                 Documentation \\
                 Documentation I: notes and bibliography \\
                 Source citations: an overview \\
                 Notes and bibliography: basic format, with examples and
                 variations \\
                 Notes \\
                 Bibliographies \\
                 Books \\
                 Periodicals \\
                 Interviews and personal communications \\
                 Unpublished and informally published material \\
                 Special types of references \\
                 Audiovisual materials \\
                 Legal and public documents \\
                 Documentation II: author-date references \\
                 Overview \\
                 Author-date references: basic format, with examples and
                 variations \\
                 Reference lists and text citations \\
                 Author-date references: special cases \\
                 Indexes \\
                 Overview \\
                 Components of an index \\
                 General principles of indexing \\
                 Indexing proper names and variants \\
                 Indexing titles of publications and other works \\
                 Alphabetizing \\
                 Punctuating indexes: a summary \\
                 The mechanics of indexing \\
                 Editing an index compiled by someone else \\
                 Typographical considerations for indexes \\
                 Examples of indexes \\
                 Appendix A: production and digital technology \\
                 Overview \\
                 Markup \\
                 Design \\
                 The electronic workflow \\
                 Options for presenting content \\
                 Print technologies \\
                 Appendix B: glossary",
}

@Book{Anonymous:1996:UIP,
  editor =       "Anonymous",
  title =        "{Ulrich}'s International Periodical Directory",
  publisher =    pub-BOWKER,
  address =      pub-BOWKER:adr,
  edition =      "34th",
  pages =        "various",
  year =         "1996",
  ISBN =         "0-8352-3681-1 (vol. 4), 0-8352-3676-5 (set)",
  ISBN-13 =      "978-0-8352-3681-2 (vol. 4), 978-0-8352-3676-8 (set)",
  ISSN =         "0000-0175",
  LCCN =         "AP1.21 .P4",
  bibdate =      "Tue Apr 30 16:53:30 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Five volumes. Volume 4 contains a numerical ISSN
                 index.",
  acknowledgement = ack-nhfb,
}

@Book{Anonymous:1999:RAB,
  author =       "Anonymous",
  title =        "Road atlas 2000 {Britain}",
  publisher =    "Ordnance Survey and Bounty",
  address =      "Southampton, UK",
  pages =        "iv + 124",
  year =         "1999",
  ISBN =         "0-7537-0138-3",
  ISBN-13 =      "978-0-7537-0138-6",
  bibdate =      "Sat Dec 24 15:53:15 MST 2005",
  bibsource =    "British Library [UK];
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  bookformat =   "Hardcover",
  category =     "Great Britain; Roads; atlases",
  idnumber =     "549",
}

@Book{Anonymous:2003:CMS,
  author =       "Anonymous",
  title =        "The {Chicago} Manual of Style",
  publisher =    pub-U-CHICAGO,
  address =      pub-U-CHICAGO:adr,
  edition =      "15th",
  pages =        "xvii + 956",
  year =         "2003",
  ISBN =         "0-226-10403-6",
  ISBN-13 =      "978-0-226-10403-4",
  LCCN =         "Z253 .U69 2003",
  bibdate =      "Wed Sep 10 17:32:05 2003",
  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",
  price =        "US\$55.00",
  acknowledgement = ack-nhfb,
  history =      "First edition 1906, 12th edition 1969, 13th edition
                 1982, 14th edition 1993, 15th edition 2003",
  idnumber =     "518",
  keywords =     "authorship handbooks; authorship manuals; practical
                 style manuals; printing",
  printermarks = "yes",
  remark =       "The standard American work on typesetting style etc.",
  subtitle =     "The Essential Guide for Writers, Editors and
                 Publishers",
  tableofcontents = "1: The parts of a published work \\
                 2: Manuscript preparation and manuscript editing \\
                 3: Proofs \\
                 4: Rights and permissions \\
                 5: Grammar and usage \\
                 6: Punctuation \\
                 7: Spelling, distinctive treatment of words, and
                 compounds \\
                 8: Names and terms \\
                 9: Numbers \\
                 10: Foreign languages \\
                 11: Quotations and dialogue \\
                 12: Illustrations and captions \\
                 13: Tables \\
                 14: Mathematics in type \\
                 15: Abbreviations \\
                 16: Documentation I: Basic patterns \\
                 17: Documentation II: Specific content \\
                 18: Indexes \\
                 Appendix A: Design and production- basic procedures and
                 key terms \\
                 Appendix B: The publishing process for books and
                 journals",
}

@Misc{Anonymous:2005:BFI,
  author =       "Anonymous",
  title =        "Basic {Feynman}: An Interview with {Michelle
                 Feynman}",
  howpublished = "Web site",
  year =         "2005",
  bibdate =      "Fri Nov 23 14:15:19 2018",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/f/feynman-richard-p.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",
  note =         "Comments about the preparation of
                 \cite{Feynman:2005:PRD}",
  acknowledgement = ack-nhfb,
}

@Book{Anonymous:2010:CMS,
  author =       "Anonymous",
  title =        "The {Chicago} Manual of Style",
  publisher =    pub-U-CHICAGO,
  address =      pub-U-CHICAGO:adr,
  edition =      "16th",
  pages =        "xvi + 1026",
  year =         "2010",
  ISBN =         "0-226-10420-6 (hardcover)",
  ISBN-13 =      "978-0-226-10420-1 (hardcover)",
  LCCN =         "Z253 .U69 2010",
  bibdate =      "Tue Jan 5 16:03:16 MST 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "printing; style manuals; authorship",
  tableofcontents = "The publishing process \\
                 Books and journals \\
                 Overview \\
                 The parts of a book \\
                 The parts of a journal \\
                 Considerations for web-based publications \\
                 Manuscript preparation, manuscript editing, and
                 proofreading \\
                 Overview and process outline \\
                 Manuscript preparation guidelines for authors \\
                 Manuscript editing \\
                 Proofreading \\
                 Illustrations and tables \\
                 Overview \\
                 Illustrations \\
                 Tables \\
                 Rights, permissions, and copyright administration / by
                 William S. Strong \\
                 Overview \\
                 Copyright law and the licensing of rights \\
                 The publishing agreement \\
                 Subsidiary rights and permissions \\
                 The author's responsibilities \\
                 Style and usage \\
                 Grammar and usage / by Bryan A. Garner \\
                 Grammar \\
                 Word usage \\
                 Punctuation \\
                 Overview \\
                 Punctuation in relation to surrounding text \\
                 Periods \\
                 Commas \\
                 Semicolons \\
                 Colons \\
                 Question marks \\
                 Exclamation points \\
                 Hyphens and dashes \\
                 Parentheses \\
                 Brackets and braces \\
                 Slashes \\
                 Quotation marks \\
                 Apostrophes \\
                 Multiple punctuation marks \\
                 Lists and outline style \\
                 Spelling, distinctive treatment of words, and compounds
                 \\
                 Overview \\
                 Plurals \\
                 Possessives \\
                 Contractions and interjections \\
                 Word division \\
                 A and an, o and oh \\
                 Ligatures \\
                 Italics, capitals, and quotation marks \\
                 Compounds and hyphenation \\
                 Names and terms \\
                 Overview \\
                 Personal names \\
                 Titles and offices \\
                 Epithets, kinship names, and personifications \\
                 Ethnic, socioeconomic, and other groups \\
                 Names of places \\
                 Words derived from proper names \\
                 Names of organizations \\
                 Historical and cultural terms \\
                 Calendar and time designations \\
                 Religious names and terms \\
                 Military terms \\
                 Names of ships and other vehicles \\
                 Scientific terminology \\
                 Brand names and trademarks \\
                 Titles of works \\
                 Signs and mottoes \\
                 Numbers \\
                 Overview \\
                 Numerals versus words \\
                 Plurals and punctuation of numbers \\
                 Inclusive numbers \\
                 Roman numerals \\
                 Abbreviations \\
                 Overview \\
                 Names and titles \\
                 Geographical terms \\
                 Designations of time \\
                 Scholarly abbreviations \\
                 Biblical abbreviations \\
                 Technology and science \\
                 Business and commerce \\
                 Foreign languages \\
                 Overview \\
                 Titles and other proper names \\
                 Languages using the Latin alphabet \\
                 Languages usually transliterated (or romanized) \\
                 Classical Greek \\
                 Old English and middle English \\
                 American sign language \\
                 Mathematics in type \\
                 Overview \\
                 Style of mathematical expressions \\
                 Preparation and editing of paper manuscripts \\
                 Quotations and dialogue \\
                 Overview \\
                 Permissible changes to quotations \\
                 Quotations in relation to text \\
                 Quotation marks \\
                 Ellipses \\
                 Interpolations and clarifications \\
                 Citing sources in text \\
                 Foreign-language quotations \\
                 Documentation \\
                 Documentation I: notes and bibliography \\
                 Source citations: an overview \\
                 Notes and bibliography: basic format, with examples and
                 variations \\
                 Notes \\
                 Bibliographies \\
                 Books \\
                 Periodicals \\
                 Interviews and personal communications \\
                 Unpublished and informally published material \\
                 Special types of references \\
                 Audiovisual materials \\
                 Legal and public documents \\
                 Documentation II: author-date references \\
                 Overview \\
                 Author-date references: basic format, with examples and
                 variations \\
                 Reference lists and text citations \\
                 Author-date references: special cases \\
                 Indexes \\
                 Overview \\
                 Components of an index \\
                 General principles of indexing \\
                 Indexing proper names and variants \\
                 Indexing titles of publications and other works \\
                 Alphabetizing \\
                 Punctuating indexes: a summary \\
                 The mechanics of indexing \\
                 Editing an index compiled by someone else \\
                 Typographical considerations for indexes \\
                 Examples of indexes \\
                 Appendix A: production and digital technology \\
                 Overview \\
                 Markup \\
                 Design \\
                 The electronic workflow \\
                 Options for presenting content \\
                 Print technologies \\
                 Appendix B: glossary",
}

@Book{Anonymous:2017:CMS,
  author =       "Anonymous",
  title =        "The {Chicago} Manual of Style",
  publisher =    pub-U-CHICAGO,
  address =      pub-U-CHICAGO:adr,
  edition =      "17th",
  pages =        "xvi + 1144",
  year =         "2017",
  ISBN =         "0-226-28705-X (hardcover)",
  ISBN-13 =      "978-0-226-28705-8 (hardcover)",
  LCCN =         "Z253 .U69 2017",
  bibdate =      "Thu Apr 06 12:16:30 2017",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "In the seven years since the previous edition debuted,
                 we have seen an extraordinary evolution in the way we
                 create and share knowledge. This seventeenth edition of
                 The Chicago Manual of Style has been prepared with an
                 eye toward how we find, create, and cite information
                 that readers are as likely to access from their pockets
                 as from a bookshelf. It offers updated guidelines on
                 electronic workflows and publication formats, tools for
                 PDF annotation and citation management, web
                 accessibility standards, and effective use of metadata,
                 abstracts, and keywords. It recognizes the needs of
                 those who are self-publishing or following open access
                 or Creative Commons publishing models. The citation
                 chapters reflect the ever-expanding universe of
                 electronic sources--including social media posts and
                 comments, private messages, and app content--and also
                 offer updated guidelines on such issues as DOIs, time
                 stamps, and e-book locators.",
  acknowledgement = ack-nhfb,
  subject =      "printing; style manuals; authorship",
  tableofcontents = "Part 1: The publishing process Books and journals
                 \\
                 Manuscript preparation, manuscript editing, and
                 proofreading \\
                 Illustrations and tables \\
                 Rights, permissions, and copyright administration / by
                 William S. Strong \\
                 Part 2: Style and usage \\
                 Grammar and usage / by Bryan A. Garner \\
                 Punctuation \\
                 Spelling, distinctive treatment of words, and compounds
                 \\
                 Names, terms, and titles of terms \\
                 Numbers \\
                 Abbreviations \\
                 Languages other than English \\
                 Mathematics in type \\
                 Quotations and dialogue \\
                 Part 3: Source citations and indexes \\
                 Notes and bibliography \\
                 Author--date references \\
                 Indexes",
}

@Manual{ANSI:ada,
  title =        "Military Standard {Ada} Programming Language",
  organization = pub-ANSI,
  address =      pub-ANSI:adr,
  month =        feb # " 17",
  year =         "1983",
  bibdate =      "Sun May 2 07:42:36 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Also MIL-STD-1815A. See also
                 \cite{Ada79:rationale,Ada79:refman}.",
  acknowledgement = ack-nhfb,
}

@Manual{ANSI:c86,
  title =        "Draft Proposed American National Standard Programming
                 Language {C}",
  organization = pub-ANSI,
  address =      pub-ANSI:adr,
  month =        oct # " 1",
  year =         "1986",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Manual{ANSI:c88a,
  title =        "Draft Proposed American National Standard Programming
                 Language {C}",
  organization = pub-ANSI,
  address =      pub-ANSI:adr,
  month =        jan # " 11",
  year =         "1988",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Manual{ANSI:c88b,
  title =        "Draft Proposed American National Standard Programming
                 Language {C}",
  organization = pub-ANSI,
  address =      pub-ANSI:adr,
  month =        oct # " 31",
  year =         "1988",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Manual{ANSI:c89,
  title =        "{American National Standard Programming Language C,
                 ANSI X3.159-1989}",
  organization = pub-ANSI,
  address =      pub-ANSI:adr,
  month =        dec # " 14",
  year =         "1989",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Manual{ANSI:ftn66,
  title =        "{ANSI Fortran X3.9-1966}",
  organization = pub-ANSI,
  address =      pub-ANSI:adr,
  year =         "1966",
  bibdate =      "Sun May 2 07:43:16 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Approved March 7, 1966 (also known as Fortran 66). See
                 also subsequent clarifications \cite{ANSI:ftn69} and
                 \cite{ANSI:ftn71}, and history \cite{Heising:ftn}.",
  acknowledgement = ack-nhfb,
}

@Article{ANSI:ftn69,
  author =       "{ANSI Subcommittee X3J3}",
  title =        "Clarification of {Fortran} Standards: Initial
                 Progress",
  journal =      j-CACM,
  volume =       "12",
  pages =        "289--294",
  year =         "1969",
  bibdate =      "Sat Oct 28 08:25:35 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See also \cite{ANSI:ftn66}.",
  acknowledgement = ack-nhfb,
}

@Article{ANSI:ftn71,
  author =       "{ANSI Subcommittee X3J3}",
  title =        "Clarification of {Fortran} Standards: Second Report",
  journal =      j-CACM,
  volume =       "14",
  pages =        "628--642",
  year =         "1971",
  bibdate =      "Sat Oct 28 08:25:37 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See also \cite{ANSI:ftn66}.",
  acknowledgement = ack-nhfb,
}

@Article{ANSI:ftn76,
  author =       "{ANSI Subcommittee X3J3}",
  title =        "Draft Proposed {ANS Fortran}",
  journal =      j-SIGPLAN,
  volume =       "11",
  number =       "3",
  year =         "1976",
  bibdate =      "Sat Oct 28 08:25:39 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See also final standard \cite{ANSI:ftn77}.",
  acknowledgement = ack-nhfb,
}

@Manual{ANSI:ftn77,
  title =        "{ANSI Fortran X3}.9--1978",
  organization = pub-ANSI,
  address =      pub-ANSI:adr,
  year =         "1978",
  bibdate =      "Sun May 2 07:43:43 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Approved April 3, 1978 (also known as Fortran 77). See
                 also draft \cite{ANSI:ftn76}.",
  acknowledgement = ack-nhfb,
}

@Manual{ANSI:ftn8x,
  title =        "Draft Proposed {ANSI Fortran X3}.9--198x",
  organization = pub-ANSI,
  address =      pub-ANSI:adr,
  month =        sep # " 18",
  year =         "1987",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See also \cite{Metcalf:F8E87}.",
  acknowledgement = ack-nhfb,
}

@Manual{ANSI:ftn92,
  title =        "{American National Standard Programming Language
                 Fortran Extended X3.198--1992}",
  organization = pub-ANSI,
  address =      pub-ANSI:adr,
  year =         "1992",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "This US Standard is identical to the international
                 standard, ISO 1539:1991. See also
                 \cite{Adams:1992:FHC,Brainerd:1990:PGF,Counihan:1991:F,Metcalf:1990:FE}.",
  acknowledgement = ack-nhfb,
}

@Manual{ANSI:ftn9x,
  title =        "Draft Proposed {American National Standard}
                 Programming Language {Fortran} Extended
                 {X3}.198--199x",
  organization = pub-ANSI,
  address =      pub-ANSI:adr,
  month =        sep # " 24",
  year =         "1990",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See also \cite{Metcalf:F8E87}.",
  acknowledgement = ack-nhfb,
}

@Manual{ANSI:gks,
  title =        "Information Systems: Computer Graphics: Graphical
                 Kernel System ({GKS}). {ANSI X3.124-1985}",
  organization = pub-ANSI,
  address =      pub-ANSI:adr,
  year =         "1985",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Includes Fortran bindings to GKS.",
  acknowledgement = ack-nhfb,
}

@Manual{ANSI:metafile,
  title =        "Information Systems: Computer Graphics: Metafile for
                 the Storage and Transfer of Picture Description
                 Information. {ANSI X3.122-1986}",
  organization = pub-ANSI,
  address =      pub-ANSI:adr,
  year =         "1986",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Manual{ANSI:pascal,
  title =        "The Pascal Programming Language. {ANSI\slash IEEE}
                 {770X3}.97-1983",
  organization = pub-ANSI,
  address =      pub-ANSI:adr,
  year =         "1983",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See also \cite{Jensen:1974:PUM,Jensen:1985:PUM}.",
  acknowledgement = ack-nhfb,
}

@Manual{ANSI:phigs,
  title =        "Information Systems: Computer Graphics: Programmer's
                 Hierarchical Interactive Graphical System. Draft
                 proposal {X3}.144.1988",
  organization = pub-ANSI,
  address =      pub-ANSI:adr,
  year =         "1988",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Manual{ANSI:phigs+,
  title =        "{PHIGS}+ Functional Description, Revision 2.0",
  organization = pub-ANSI,
  address =      pub-ANSI:adr,
  month =        jul # " 20",
  year =         "1987",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{APA:1994:PMA,
  author =       "{American Psychological Association}",
  title =        "Publication Manual of the {American Psychological
                 Association}",
  publisher =    "American Psychological Association",
  address =      "Washington, DC, USA",
  edition =      "Fourth",
  pages =        "xxxii + 368",
  year =         "1994",
  ISBN =         "1-55798-243-0 (hardcover), 1-55798-241-4 (paperback)",
  ISBN-13 =      "978-1-55798-243-8 (hardcover), 978-1-55798-241-4
                 (paperback)",
  LCCN =         "BF76.7.P82 1994",
  bibdate =      "Fri Aug 07 17:19:51 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$23.00 (paperback)",
  abstract =     "Rules for manuscript preparation for articles in the
                 field of psychology and other areas, but especially in
                 the 24 American Psychological Association journals. The
                 rules are arranged under 7 sections covering such
                 topics as expression of ideas, editorial style,
                 preparation, and submitting the manuscript. Appendix
                 gives instructions for handling other than journal
                 articles.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Content and organization of a manuscript \\
                 Expressing ideas and reducing bias in language \\
                 APA editorial style \\
                 Reference list \\
                 Manuscript preparation and sample papers to be
                 submitted for publication \\
                 Material other than journal articles \\
                 Manuscript acceptance and production \\
                 Journals program of the American Psychological
                 Association \\
                 Appendix A: Checklist for manuscript submission \\
                 Appendix B: Checklist for transmitting accepted
                 manuscripts for electronic production \\
                 Appendix C: Ethical standards for the reporting and
                 publishing of scientific information \\
                 Appendix D: References to legal materials \\
                 Appendix E: Sample cover letter",
}

@Book{APA:2001:PMA,
  author =       "{American Psychological Association}",
  title =        "Publication Manual of the {American Psychological
                 Association}",
  publisher =    "American Psychological Association",
  address =      "Washington, DC, USA",
  edition =      "Fifth",
  pages =        "xxviii + 439",
  year =         "2001",
  ISBN =         "1-55798-790-4 (hardcover), 1-55798-810-2 (coil bound),
                 1-55798-791-2 (paperback)",
  ISBN-13 =      "978-1-55798-790-7 (hardcover), 978-1-55798-810-2 (coil
                 bound), 978-1-55798-791-4 (paperback)",
  LCCN =         "BF76.7.P83 2001; PE1475 .P976 2001; WZ345 P83 2001",
  bibdate =      "Thu May 16 14:21:17 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "The \booktitle{Publication Manual of the American
                 Psychological Association} is the style manual of
                 choice for writers, editors, students, educators, and
                 professionals in psychology, sociology, business,
                 economics, nursing, social work, and justice
                 administration, and other disciplines in which
                 effective communication with words and data is
                 fundamental. In addition to providing clear guidance on
                 grammar, the mechanics of writing, and APA Style, the
                 \booktitle{Publication Manual} offers an authoritative
                 and easy-to-use reference and citation system and
                 comprehensive coverage of the treatment of numbers,
                 metrication, statistical and mathematical data, tables,
                 and figures for use in writing, reports, or
                 presentations. The fifth edition has been revised and
                 updated to include: (a) the latest guidelines and
                 examples for referencing electronic and online sources;
                 (b) new and revised guidelines for submitting papers
                 electronically; (c) Improved guidelines for avoiding
                 plagiarism; (d) Simplified formatting guidelines for
                 writers using up-to-date word-processing software; (e)
                 all new guidelines for presenting case studies; (f)
                 improved guidelines for the construction of tables; (g)
                 updates on copyright and permissions issues for
                 writers; (h) new reference examples for audiovisual
                 media and patents; and (i) an expanded and improved
                 index for quick and easy access.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  tableofcontents = "1: Content and organization of a manuscript \\
                 2: Expressing ideas and reducing bias in language \\
                 3: APA editorial style \\
                 4: Reference list \\
                 5: Manuscript preparation and sample papers to be
                 submitted for publication \\
                 6: Material other than journal articles \\
                 7: Manuscript acceptance and production \\
                 8: Journals program of the American Psychological
                 Association \\
                 9: Bibliography \\
                 Appendix A: Checklist for manuscript submission \\
                 Appendix B: Checklist for transmitting accepted
                 manuscripts for electronic production \\
                 Appendix C: Ethical standards for the reporting and
                 publishing of scientific information \\
                 Appendix D: References to legal materials \\
                 Appendix E: Sample cover letter",
}

@Book{APA:2010:PMA,
  author =       "{American Psychological Association}",
  title =        "Publication manual of the {American Psychological
                 Association}",
  publisher =    "American Psychological Association",
  address =      "Washington, DC, USA",
  edition =      "Sixth",
  pages =        "xviii + 272",
  year =         "2010",
  ISBN =         "1-4338-0559-6 (hardcover), 1-4338-0561-8 (softcover),
                 1-4338-0562-6 (spiral bound)",
  ISBN-13 =      "978-1-4338-0559-2 (hardcover), 978-1-4338-0561-5
                 (softcover), 978-1-4338-0562-2 (spiral bound)",
  LCCN =         "BF76.7 .P83 2010",
  bibdate =      "Tue Jan 5 15:57:45 MST 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "psychology; authorship; style manuals; social
                 sciences; psychological literature; publishing;
                 handbooks, manuals, etc; social science literature",
  tableofcontents = "1. Writing for the behavioral and social sciences:
                 Types of articles \\
                 Ethical and legal standards in publishing \\
                 Ensuring the accuracy of scientific knowledge \\
                 Protecting the rights and welfare of research
                 participants \\
                 Protecting intellectual property rights \\
                 2. Manuscript structure and content: Journal article
                 reporting standards \\
                 Manuscript elements \\
                 Sample papers \\
                 3. Writing clearly and concisely: Organization \\
                 Writing style \\
                 Reducing bias in language \\
                 General guidelines for reducing bias \\
                 Reducing bias by topic \\
                 Grammar and usage \\
                 4. Mechanics of style: Punctuation \\
                 Spelling \\
                 Capitalization \\
                 Italics \\
                 Abbreviations \\
                 Numbers \\
                 Metrication \\
                 Statistical and mathematical copy \\
                 Equations \\
                 5. Displaying results: General guidance on table and
                 figures \\
                 Tables \\
                 Figures \\
                 Presenting electrophysiological, radiological, and
                 other biological data \\
                 6. Crediting sources: When to cite \\
                 Quoting and paraphrasing \\
                 Citing references in text \\
                 Reference list \\
                 Reference components \\
                 7. Reference examples: Types and variations \\
                 Examples by type \\
                 Appendix 7-1: References to legal materials \\
                 8. Publication process: Editorial process \\
                 Author responsibilities \\
                 Appendix: Journal article reporting standards (JARS),
                 Meta-analysis reporting standards (MARS), and flow of
                 participants through each stage of an experiment or
                 quasi-experiment",
}

@Book{Appelt:1988:TFP,
  author =       "Wolfgang Appelt",
  title =        "{{\TeX{} f{\"u}r Fortgeschrittene:
                 Programmiertechniken und Makropakete}}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "x + 179",
  year =         "1988",
  ISBN =         "3-89319-115-1",
  ISBN-13 =      "978-3-89319-115-4",
  LCCN =         "????",
  bibdate =      "Wed Dec 15 08:47:26 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  acknowledgement = ack-nhfb,
}

@Book{Apple:1987:TIM,
  author =       "{Apple Computer, Inc.}",
  title =        "Technical Introduction to the {Macintosh} Family",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xix + 289",
  year =         "1987",
  ISBN =         "0-201-17765-X",
  ISBN-13 =      "978-0-201-17765-7",
  LCCN =         "QA76.8.M3 T43 1987",
  bibdate =      "Tue Dec 14 22:39:39 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$19.95",
  acknowledgement = ack-nhfb,
}

@Book{Apple:1995:PMC,
  author =       "{Apple Computer, Inc.} and {IBM Corporation} and
                 {Motorola, Inc.}",
  title =        "{PowerPC} Microprocessor Common Hardware Reference
                 Platform: a System Architecture",
  publisher =    pub-MORGAN-KAUFMANN,
  address =      pub-MORGAN-KAUFMANN:adr,
  pages =        "xxiv + 309",
  year =         "1995",
  ISBN =         "1-55860-394-8",
  ISBN-13 =      "978-1-55860-394-3",
  LCCN =         "QA76.89.P67P74 1995",
  bibdate =      "Fri Jan 19 08:14:50 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/microchip.bib",
  price =        "US\$39.95",
  abstract =     "This book is the primary source of information for
                 anyone developing a hardware platform, an operating
                 system, or hardware component to be part of these
                 standard systems. It describes the hardware to
                 operating system interface that is essential to anyone
                 building hardware platforms and provides the minimum
                 system configurations platform designers must meet when
                 building a standard platform. Component manufacturers
                 require this information to produce compatible chips
                 and adaptors to use on these platforms, and software
                 developers require the information on mandatory
                 functions and documented interfaces. The architecture
                 is intended to support a range of PowerPC
                 microprocessor-based system implementations, including
                 portable, desktop, and server class systems, and allows
                 multiple operating system implementations across a wide
                 range of environments and function. This enables new
                 hardware and software enhancements, which are necessary
                 for the development of improved user interfaces, higher
                 performance, and broader operating environments.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Foreword \\
                 Figures \\
                 Tables \\
                 About this Document \\
                 1. Introduction \\
                 1.1 Platform Topology \\
                 2. System Requirements \\
                 2.1 System Operation \\
                 2.2 Firmware \\
                 2.3 Bi-Endian Support \\
                 2.4 64-Bit Addressing Support \\
                 2.5 Minimum System Requirements \\
                 2.6 Options and Extensions \\
                 3. System Address Map \\
                 3.1 Address Areas \\
                 3.2 Address Decoding and Translation \\
                 3.3 PC Emulation Option \\
                 4. Processor and Memory \\
                 4.1 Processor Architecture \\
                 4.2 Memory Architecture \\
                 5. I/O Bridges \\
                 5.1 PCI Host Bridge (PHB) Architecture \\
                 5.2 I/O Bus to I/O Bus Bridges \\
                 6. Interrupt Controller \\
                 6.1 Interrupt Controller Architecture \\
                 6.2 Distributed Implementation \\
                 A Proposal \\
                 7. Run-Time Abstraction Services \\
                 7.1 RTAS Introduction \\
                 7.2 RTAS Environment \\
                 7.3 RTAS Call Function Definition \\
                 8. Non-Volatile Memory \\
                 8.1 System Requirements \\
                 8.2 Structure \\
                 8.3 Signatures \\
                 8.4 Architected Partitions \\
                 8.5 NVRAM Space Management \\
                 9. I/O Devices \\
                 9.1 PCI Devices \\
                 9.2 ISA Devices \\
                 10. Error and Event Notification10.1 Introduction \\
                 10.2 RTAS Error and Event Classes \\
                 10.3 RTAS Error and Event Information Reporting \\
                 11. Power Management \\
                 11.1 Power Management Concepts \\
                 11.2 Power-Managed Platform Requirements \\
                 11.3 Operating System Requirements \\
                 12. The Symmetric Multiprocessor Option \\
                 12.1 SMP System Organization \\
                 12.2 An SMP Boot Process \\
                 Appendix A Operating System Information \\
                 Appendix B Requirements Summary \\
                 Appendix C Bi-Endian Designs \\
                 C.1 Little-Endian Address and Data Translation \\
                 C.2 Conforming Bi-Endian Designs \\
                 C.3 Software Support for Bi-Endian Operation \\
                 C.4 Bi-Modal Devices \\
                 C.5 Future Directions in Bi-Endian Architecture \\
                 Appendix D Architecture Migration Notes \\
                 Glossary \\
                 Trademark Information \\
                 Bibliography \\
                 Index",
}

@Book{Arabatzis:2006:REB,
  author =       "Theodore Arabatzis",
  title =        "Representing Electrons: a Biographical Approach to
                 Theoretical Entities",
  publisher =    pub-U-CHICAGO,
  address =      pub-U-CHICAGO:adr,
  pages =        "xiv + 295",
  year =         "2006",
  ISBN =         "0-226-02420-2 (hardcover), 0-226-02421-0 (paperback),
                 0-226-02422-9 (e-book)",
  ISBN-13 =      "978-0-226-02420-2 (hardcover), 978-0-226-02421-9
                 (paperback), 978-0-226-02422-6 (e-book)",
  LCCN =         "QC793.5.E62 A73 2011",
  bibdate =      "Fri Oct 31 07:44:34 MDT 2014",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://public.eblib.com/choice/publicfullrecord.aspx?p=709999",
  abstract =     "Using the electron --- or rather its representation
                 --- as a historical actor, Theodore Arabatzis
                 illustrates the emergence and gradual consolidation of
                 its representation in physics, its career throughout
                 old quantum theory, and its appropriation and
                 reinterpretation by chemists. As Arabatzis develops
                 this novel biographical approach, he portrays
                 scientific representations as partly autonomous agents
                 with lives of their own. Furthermore, he argues that
                 the considerable variance in the representation of the
                 electron does not undermine its stable identity or
                 existence. Raising philosophical issues of contentious
                 debate in the history and philosophy of science ---
                 namely, scientific realism and meaning change ---
                 Arabatzis addresses the history of the electron across
                 disciplines, integrating historical narrative with
                 philosophical analysis in a book that will be a
                 touchstone for historians and philosophers of science
                 and scientists alike.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Electrons; History; Realism; Science; Philosophy;
                 Physics",
  tableofcontents = "Acknowledgements \\
                 Introduction \\
                 1: Methodological Preliminaries \\
                 2: Why Write Biographies of Theoretical Entities? \\
                 3: Rethinking ``the Discovery of the Electron'' \\
                 4: The Birth and Infancy of the Representation of the
                 Electron \\
                 5: The Genesis of the Quantum Electron \\
                 6: Between Relativity and Correspondence \\
                 7: ``How the Electrons Spend Their Leisure Time'': The
                 Chemists' Perspective \\
                 8: Forced to Spin by Uhlenbeck and Goudsmit \\
                 9: Identifying the Electron: Meaning Variance and the
                 Historicity of Scientific Realism",
}

@InProceedings{Arasu:2002:PCS,
  author =       "Arvind Arasu and Jasmine Novak and Andrew Tomkins and
                 John Tomlin",
  booktitle =    "Proceedings of the Eleventh International World Wide
                 Web Conference, Honolulu, Hawaii, USA, 7--11 May 2002",
  title =        "{PageRank} Computation and the Structure of the {Web}:
                 Experiments and Algorithms",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  bookpages =    "748",
  year =         "2002",
  ISBN =         "1-880672-20-0",
  ISBN-13 =      "978-1-880672-20-4",
  LCCN =         "TK5105.888 Wic 11 2002",
  bibdate =      "Thu Oct 24 15:18:39 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 http://www2002.org/CDROM/",
  URL =          "http://www2002.org/CDROM/poster/173.pdf",
  acknowledgement = ack-nhfb,
  annote =       "PageRank is the Google search algorithm.",
  pagecount =    "5",
}

@Book{Arbib:1981:BTC,
  author =       "Michael A. Arbib and A. J. Kfoury and Robert N. Moll",
  title =        "A Basis for Theoretical Computer Science",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "viii + 220",
  year =         "1981",
  ISBN =         "0-387-90573-1",
  ISBN-13 =      "978-0-387-90573-0",
  LCCN =         "QA267 .A715",
  bibdate =      "Tue Dec 14 22:39:53 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Arfken:2005:MMP,
  author =       "George B. Arfken and Hans-J{\"u}rgen Weber",
  title =        "Mathematical Methods for Physicists",
  publisher =    pub-ELSEVIER,
  address =      pub-ELSEVIER:adr,
  edition =      "Sixth",
  pages =        "xii + 1182",
  year =         "2005",
  ISBN =         "0-12-059876-0, 0-12-088584-0 (paperback)",
  ISBN-13 =      "978-0-12-059876-2, 978-0-12-088584-8 (paperback)",
  LCCN =         "QA37.3 .A74 2005",
  bibdate =      "Tue Feb 17 18:23:45 MST 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Mathematics; Mathematical physics",
  tableofcontents = "1. Vector Analysis \\
                 2. Vector Analysis in Curved Coordinates and Tensors
                 \\
                 3. Determinants and Matrices \\
                 4. Group Theory \\
                 5. Infinite Series \\
                 6. Functions of a Complex Variable I: Analytic
                 Properties, Mapping \\
                 7. Functions of a Complex Variable II \\
                 8. The Gamma Function (Factorial Function) \\
                 9. Differential Equations \\
                 10. Sturm--Liouville Theory-Orthogonal Functions \\
                 11. Bessel Functions \\
                 12. Legendre Functions \\
                 13. More Special Functions \\
                 14. Fourier Series \\
                 15. Integral Transforms \\
                 16. Integral Equations \\
                 17. Calculus of Variations \\
                 18. Nonlinear Methods and Chaos \\
                 19. Probability",
  xxauthor =     "George B. (George Brown) Arfken and Hans-J{\"u}rgen
                 Weber",
  xxURL =        "http://www.loc.gov/catdir/enhancements/fy0625/2005049844-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0625/2005049844-t.html",
}

@Book{Arianrhod:2003:EHI,
  author =       "Robyn Arianrhod",
  title =        "{Einstein}'s heroes: imagining the world through the
                 language of mathematics",
  publisher =    "University of Queensland Press",
  address =      "St Lucia, Queensland, Australia",
  pages =        "viii + 323",
  year =         "2003",
  ISBN =         "0-7022-3408-7",
  ISBN-13 =      "978-0-7022-3408-8",
  LCCN =         "QC19.6 .A75 2003",
  bibdate =      "Mon Apr 23 09:09:08 MDT 2007",
  bibsource =    "catalogue.nla.gov.au:7090/Voyager;
                 https://www.math.utah.edu/pub/bibnet/authors/c/clerk-maxwell-james.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",
  price =        "US\$24.00",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Maxwell, James Clerk; Einstein, Albert; Physics;
                 History; Mathematics; Science; Popular works;
                 Scientists; Biography",
  subject-dates = "1831--1879 (Maxwell); 1879--1955 (Einstein)",
  tableofcontents = "A seamless intertwining \\
                 A reluctant revolutionary \\
                 Beetles, strings and sealing wax \\
                 The nature of physics \\
                 The language of physics \\
                 Why Newton held the world in thrall \\
                 Rites of passage \\
                 A fledgling physicist \\
                 Electromagnetic controversy \\
                 Mathematics as language \\
                 The magical synthesis of algebra an geometry \\
                 Maxwell's mathematical language \\
                 Maxwell's rainbow \\
                 Imagining the world with the language of mathematics: a
                 revolution in physics",
}

@Book{Arianrhod:2005:EHI,
  author =       "Robyn Arianrhod",
  title =        "{Einstein}'s heroes: imagining the world through the
                 language of mathematics",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  pages =        "xiii + 323",
  year =         "2005",
  ISBN =         "0-19-518370-3 (hardcover), 0-19-530890-5 (paperback)",
  ISBN-13 =      "978-0-19-518370-2 (hardcover), 978-0-19-530890-7
                 (paperback)",
  LCCN =         "QC19.6 .A75 2005",
  bibdate =      "Fri Nov 17 12:24:46 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/physperspect.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "ftp://uiarchive.cso.uiuc.edu/pub/etext/gutenberg/;
                 http://www.loc.gov/catdir/toc/ecip053/2004026055.html",
  abstract =     "Blending science, history, and biography, this book
                 reveals the mysteries of mathematics, focusing on the
                 life and work of three of Albert Einstein's heroes:
                 Isaac Newton, Michael Faraday, and especially James
                 Clerk Maxwell, whose portrait hung on Einstein's
                 laboratory wall and whose work directly inspired the
                 theory of relativity. In this book, Robyn Arianrhod
                 bridges the gap between science and literature,
                 portraying mathematics as a language and arguing that a
                 physical theory is a work of imagination involving the
                 elegant and clever use of this language. Her narrative
                 centers on the work of Maxwell, the first scientist to
                 embrace the ambiguous relationship between language and
                 reality - the first to accept that, in a very real
                 sense, language is reality.",
  acknowledgement = ack-nhfb,
  remark =       "Originally published in \cite{Arianrhod:2003:EHI}.",
  subject =      "Maxwell, James Clerk; Einstein, Albert; Mathematical
                 physics; History; Physicists; Biography; Science;
                 Popular works",
  subject-dates = "1831--1879 (Maxwell); 1879--1955 (Einstein)",
  tableofcontents = "A seamless intertwining \\
                 A reluctant revolutionary \\
                 Beetles, strings and sealing wax \\
                 The nature of physics \\
                 The language of physics \\
                 Why Newton held the world in thrall \\
                 Rites of passage \\
                 A fledgling physicist \\
                 Electromagnetic controversy \\
                 Mathematics as language \\
                 The magical synthesis of algebra an geometry \\
                 Maxwell's mathematical language \\
                 Maxwell's rainbow \\
                 Imagining the world with the language of mathematics: a
                 revolution in physics",
}

@Book{Arndt:2001:PU,
  author =       "J{\"o}rg Arndt and Christoph Haenel",
  title =        "Pi --- Unleashed",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xii + 270",
  year =         "2001",
  ISBN =         "3-540-66572-2 (paperback), 3-642-56735-5 (e-book)",
  ISBN-13 =      "978-3-540-66572-4 (paperback), 978-3-642-56735-3
                 (e-book)",
  LCCN =         "QA484.A7513 2001",
  bibdate =      "Sat Apr 20 11:01:28 2002",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/borwein-jonathan-m.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/pi.bib",
  note =         "Includes CD-ROM. Translated from the German by
                 Catriona and David Lischka.",
  price =        "US\$",
  abstract =     "Never in the 4000-year history of research into pi
                 have results been so prolific as at present. In their
                 book Joerg Arndt and Christoph Haenel describe in
                 easy-to-understand language the latest and most
                 fascinating findings of mathematicians and computer
                 scientists in the field of pi. Attention is focused on
                 new methods of computation whose speed outstrips that
                 of predecessor methods by orders of magnitude. The book
                 comes with a CD-ROM containing not only the source code
                 of all programs described, but also related texts and
                 even complete libraries.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: The state of Pi art / 1 \\
                 2: How random is $\pi$? / 21 \\
                 3: Shortcuts to $\pi$ / 35 \\
                 4: Aproximations for $\pi$ and continued fractions / 51
                 \\
                 5: Arcus tangens / 69 \\
                 6: Spigot algorithms / 77 \\
                 7: Gauss and $\pi$ / 87 \\
                 8: Ramanujan and $\pi$ / 103 \\
                 9: The Borweins and $\pi$ / 113 \\
                 10: The BBP algorithm / 117 \\
                 11: Arithmetic / 131 \\
                 12: Miscellaneous / 153 \\
                 13: The history of $\pi$ / 165 \\
                 14: Historical notes / 209 \\
                 15: The future: $\pi$ calculations on the Internet /
                 215 \\
                 16: $\pi$ formula collection / 223 \\
                 17: Tables / 239 \\
                 A: Documentation for the {\tt hfloat} Library / 247 \\
                 Bibliography / 257 \\
                 Index / 265",
}

@Book{Arnold:2000:JPL,
  author =       "Ken Arnold and James Gosling and David Holmes",
  title =        "The {Java} Programming Language",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Third",
  pages =        "xxiv + 595",
  year =         "2000",
  ISBN =         "0-201-70433-1 (paperback)",
  ISBN-13 =      "978-0-201-70433-4 (paperback)",
  LCCN =         "QA76.73.J38 A76 2000",
  bibdate =      "Sat Nov 24 17:48:00 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/java2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$37.95",
  abstract =     "This Third Edition of \booktitle{The Java Programming
                 Language} is a valuable resource for both novice and
                 advanced programmers. More than 100,000 developers who
                 programmed with C, C++, Smalltalk, or other high-level
                 languages have used this book to get a concise,
                 intelligent, and deep understanding of the Java
                 programming language. This book is what you need to
                 understand the basic design goals of the language and
                 the application of the language in real-world
                 development. It provides unique insights into why and
                 how the language was designed and intended to be used.
                 The authors describe the latest version of the
                 language, as defined in the Java Language
                 Specification, Second Edition and implemented in
                 version 1.3 of the Java 2 SDK, Standard Edition. This
                 third edition has been structured to give more in-depth
                 treatment of the newer language features, as well as
                 informative examples on using some of the new APIs. New
                 and/or revised in this edition: more details on
                 language features, including an expanded section on
                 nested classes; more comprehensive treatment of garbage
                 collection and related programming issues; and coverage
                 of new APIs, such as collections and
                 internationalization. Thoroughly revised from start to
                 finish, this edition fully covers the features of the
                 current release of the Java programming language and
                 class libraries. The book serves as a tutorial
                 introduction to the language and essential libraries as
                 well as a reference. Experienced programmers will find
                 this new edition to be a valuable reference, and will
                 gain new insights into the subtleties of the language.
                 Novice and intermediate programmers will benefit from
                 the valuable examples and clear explanations of
                 language and library features. Make sure you understand
                 the contents of this book before you begin any serious
                 development for the Java platform.",
  acknowledgement = ack-nhfb,
  tableofcontents = "A Quick Tour / 1 \\
                 Getting Started / 1 \\
                 Variables / 3 \\
                 1.2: Variables / 3 \\
                 1.3: Comments in Code / 6 \\
                 1.4: Named Constants / 6 \\
                 1.5: Unicode Characters / 8 \\
                 1.6: Flow of Control / 9 \\
                 1.7: Classes and Objects / 11 \\
                 1.7.1: Creating Objects / 12 \\
                 1.7.2: Static or Class Fields / 13 \\
                 1.7.3: Garbage Collector / 14 \\
                 1.8: Methods and Parameters / 14 \\
                 1.8.1: Invoking a Method / 15 \\
                 1.8.2: This Reference / 16 \\
                 1.8.3: Static or Class Methods / 17 \\
                 1.9: Arrays / 17 \\
                 1.10: String Objects / 20 \\
                 1.11: Extending a Class / 22 \\
                 1.11.1: Invoking Methods from the Superclass / 23 \\
                 1.11.2: Object Class / 24 \\
                 1.11.3: Type Casting / 25 \\
                 1.12: Interfaces / 25 \\
                 1.13: Exceptions / 27 \\
                 1.14: Packages / 30 \\
                 1.15: Java Platform / 32 \\
                 1.16: Other Topics Briefly Noted / 33 \\
                 2: Classes and Objects / 35 \\
                 2.1: A Simple Class / 36 \\
                 2.1.1: Class Members / 36 \\
                 2.1.2: Class Modifiers / 37 \\
                 2.2: Fields / 38 \\
                 2.2.1: Field Initialization / 38 \\
                 2.2.2: Static Fields / 39 \\
                 2.2.3: final Fields / 40 \\
                 2.3: Access Control / 41 \\
                 2.4: Creating Objects / 42 \\
                 2.5: Construction and Initialization / 43 \\
                 2.5.1: Constructors / 44 \\
                 2.5.2: Initialization Blocks / 48 \\
                 2.5.3: Static Initialization / 49 \\
                 2.6: Methods / 50 \\
                 2.6.1: Static Methods / 51 \\
                 2.6.2: Method Invocations / 51 \\
                 2.6.3: Method Execution and Return / 53 \\
                 2.6.4: Parameter Values / 54 \\
                 2.6.5: Using Methods to Control Access / 57 \\
                 2.7: this / 59 \\
                 2.8: Overloading Methods / 61 \\
                 2.9: Main Method / 62 \\
                 2.10: Native Methods / 63 \\
                 3: Extending Classes / 65 \\
                 3.1: An Extended Class / 66 \\
                 3.2: Constructors in Extended Classes / 69 \\
                 3.2.1: Constructor Order Dependencies / 71 \\
                 3.3: Inheriting and Redefining Members / 73 \\
                 3.3.1: Overriding / 73 \\
                 3.3.2: Hiding Fields / 74 \\
                 3.3.3: Accessing Inherited Members / 75 \\
                 3.3.4: Accessibility and Overriding / 77 \\
                 3.3.5: Hiding Static Members / 77 \\
                 3.3.6: Super Keyword / 78 \\
                 3.4: Type Compatibility and Conversion / 79 \\
                 3.4.1: Compatibility / 79 \\
                 3.4.2: Explicit Type Casting / 80 \\
                 3.4.3: Testing for Type / 80 \\
                 3.5: What protected Really Means / 81 \\
                 3.6: Marking Methods and Classes final / 84 \\
                 3.7: Abstract Classes and Methods / 85 \\
                 3.8: Object Class / 87 \\
                 3.9: Cloning Objects / 89 \\
                 3.9.1: Strategies for Cloning / 89 \\
                 3.9.2: Correct Cloning / 91 \\
                 3.9.3: Shallow versus Deep Cloning / 94 \\
                 3.10: Extending Classes: How and When / 95 \\
                 3.11: Designing a Class to Be Extended / 96 \\
                 3.11.1: Designing an Extensible Framework / 97 \\
                 3.12: Single Inheritance versus Multiple Inheritance /
                 102 \\
                 4: Interfaces / 105 \\
                 4.1: A Simple Interface Example / 106 \\
                 4.2: Interface Declarations / 108 \\
                 4.2.1: Interface Constants / 109 \\
                 4.2.2: Interface Methods / 109 \\
                 4.2.3: Interface Modifiers / 110 \\
                 4.3: Extending Interfaces / 110 \\
                 4.3.1: Inheriting and Hiding Constants / 111 \\
                 4.3.2: Inheriting, Overriding, and Overloading Methods
                 / 112 \\
                 4.4: Working with Interfaces / 113 \\
                 4.4.1: Implementing Interfaces / 114 \\
                 4.4.2: Using an Implementation / 116 \\
                 4.5: Marker Interfaces / 117 \\
                 4.6: When to Use Interfaces / 118 \\
                 5: Nested Classes and Interfaces / 121 \\
                 5.1: Static Nested Types / 121 \\
                 5.1.1: Static Nested Classes / 122 \\
                 5.1.2: Nested Interfaces / 123 \\
                 5.2: Inner Classes / 123 \\
                 5.2.1: Accessing Enclosing Objects / 125 \\
                 5.2.2: Extending Inner Classes / 126 \\
                 5.2.3: Inheritance, Scoping, and Hiding / 127 \\
                 5.3: Local Inner Classes / 129 \\
                 5.4: Anonymous Inner Classes / 131 \\
                 5.5: Inheriting Nested Types / 132 \\
                 5.6: Nesting in Interfaces / 134 \\
                 5.6.1: Modifiable Variables in Interfaces / 135 \\
                 5.7: Implementation of Nested Types / 136 \\
                 6: Tokens, Operators, and Expressions / 137 \\
                 6.1: Lexical Elements / 137 \\
                 6.1.1: Character Set / 138 \\
                 6.1.3: Tokens / 139 \\
                 6.1.4: Identifiers / 140 \\
                 6.1.5: Keywords / 141 \\
                 6.2: Types and Literals / 141 \\
                 6.2.1: Reference Literals / 142 \\
                 6.2.2: Boolean Literals / 142 \\
                 6.2.3: Character Literals / 142 \\
                 6.2.4: Integer Literals 143 \\
                 6.2.5: Floating-Point Literals / 143 \\
                 6.2.6: String Literals / 144 \\
                 6.2.7: Class Literals / 144 \\
                 6.3: Variables / 144 \\
                 6.3.1: Field and Local Variable Declarations / 145 \\
                 6.3.2: Parameter Variables / 146 \\
                 6.3.3: final Variables / 146 \\
                 6.4: Array Variables / 148 \\
                 6.4.1: Array Modifiers / 149 \\
                 6.4.2: Arrays of Arrays / 149 \\
                 6.4.3: Array Initialization / 150 \\
                 6.4.4: Arrays and Types / 151 \\
                 6.5: Meanings of Names / 152 \\
                 6.6: Arithmetic Operations / 156 \\
                 6.6.1: Integer Arithmetic / 156 \\
                 6.6.2: Floating-Point Arithmetic / 156 \\
                 6.6.3: Strict and non-Strict Floating-Point Arithmetic
                 / 158 \\
                 6.7: General Operators / 159 \\
                 6.7.1: Increment and Decrement Operators / 159 \\
                 6.7.2: Relational and Equality Operators / 160 \\
                 6.7.3: Logical Operators / 161 \\
                 6.7.4: instanceof / 162 \\
                 6.7.5: Bit Manipulation Operators / 163 \\
                 6.7.6: Conditional Operator?: / 164 \\
                 6.7.7: Assignment Operators / 165 \\
                 6.7.8: String Concatenation Operator / 167 \\
                 6.7.9: new / 167 \\
                 6.8: Expressions / 168 \\
                 6.8.1: Order of Evaluation / 168 \\
                 6.8.2: Expression Type / 169 \\
                 6.8.3: Implicit Type Conversions / 169 \\
                 6.8.4: Explicit Type Casts / 171 \\
                 6.8.5: String Conversions / 172 \\
                 6.9: Member Access / 173 \\
                 6.9.1: Finding the Right Method / 173 \\
                 6.10: Operator Precedence and Associativity / 176 \\
                 7: Control Flow / 179 \\
                 7.1: Statements and Blocks / 179 \\
                 7.2: if-else / 180 \\
                 7.3: switch / 182 \\
                 7.4: while and do-while / 185 \\
                 7.5: for / 186 \\
                 7.6: Labels / 189 \\
                 7.7: break / 189 \\
                 7.8: continue / 192 \\
                 7.9: return / 193 \\
                 7.10: What, No goto? / 193 \\
                 8: Exceptions / 195 \\
                 8.1: Creating Exception Types / 196 \\
                 8.2: throw / 197 \\
                 8.2.1: Transfer of Control / 198 \\
                 8.2.2: Asynchronous Exceptions / 198 \\
                 8.3: Throws Clause / 199 \\
                 8.3.1: throws Clauses and Method Overriding / 200 \\
                 8.3.2: throws Clauses and Native Methods / 201 \\
                 8.4: try, catch, and finally / 202 \\
                 8.4.1: finally / 204 \\
                 8.5: When to Use Exceptions / 206 \\
                 9: Strings / 209 \\
                 9.1: Basic String Operations / 209 \\
                 9.2: String Comparisons / 211 \\
                 9.2.1: String Literal Equivalence / 214 \\
                 9.3: Utility Methods / 215 \\
                 9.4: Making Related Strings / 215 \\
                 9.5: String Conversions / 217 \\
                 9.6: Strings and char Arrays / 218 \\
                 9.7: Strings and byte Arrays / 220 \\
                 9.7.1: Character Encodings / 221 \\
                 9.8: StringBuffer Class / 222 \\
                 9.8.1: Modifying the Buffer / 223 \\
                 9.8.2: Getting Data Out / 225 \\
                 9.8.3: Capacity Management / 226 \\
                 10: Threads / 227 \\
                 10.1: Creating Threads / 229 \\
                 10.2: Using Runnable / 231 \\
                 10.3: Synchronization / 235 \\
                 10.3.1: synchronized Methods / 235 \\
                 10.3.2: Static Synchronized Methods / 238 \\
                 10.3.3: synchronized Statements / 238 \\
                 10.3.4: Synchronization Designs / 242 \\
                 10.4: wait, notifyAll, and notify / 244 \\
                 10.5: Details of Waiting and Notification / 246 \\
                 10.6: Thread Scheduling / 248 \\
                 10.6.1: Voluntary Rescheduling / 249 \\
                 10.7: Deadlocks / 252 \\
                 10.8: Ending Thread Execution / 254 \\
                 10.8.1: Cancelling a Thread / 255 \\
                 10.8.2: Waiting for a Thread to Complete / 257 \\
                 10.9: Ending Application Execution / 259 \\
                 10.10: volatile / 260 \\
                 10.11: Thread Management, Security and ThreadGroup /
                 261 \\
                 10.12: Threads and Exceptions / 266 \\
                 10.12.1: Don't stop / 266 \\
                 10.13: ThreadLocal Variables / 267 \\
                 10.14: Debugging Threads / 269 \\
                 11: Programming with Types / 271 \\
                 11.1: Wrapper Classes / 272 \\
                 11.1.1: Void / 274 \\
                 11.1.2: Boolean / 274 \\
                 11.1.3: Character / 275 \\
                 11.1.4: Number / 279 \\
                 11.1.5: Integer Wrappers / 279 \\
                 11.1.6: Floating-Point Wrapper Classes / 281 \\
                 11.2: Reflection / 282 \\
                 11.2.1: Class class / 283 \\
                 11.2.2: Naming Classes / 287 \\
                 11.2.3: Examining Class Members / 288 \\
                 11.2.4: Modifier Class / 292 \\
                 11.2.5: Field Class / 292 \\
                 11.2.6: Method Class / 294 \\
                 11.2.7: Creating New Objects and the Constructor Class
                 / 296 \\
                 11.2.8: Access Checking and AccessibleObject / 299 \\
                 11.2.9: Arrays / 299 \\
                 11.2.10: Packages / 301 \\
                 11.2.11: Proxy Classl / 301 \\
                 11.3: Loading Classes / 304 \\
                 11.3.1: ClassLoader Class / 307 \\
                 11.3.2: Preparing a Class for use / 309 \\
                 11.3.3: Loading Related Resources / 310 \\
                 12: Garbage Collection and Memory / 313 \\
                 12.1: Garbage Collection / 313 \\
                 12.2: A Simple Model / 314 \\
                 12.3: Finalization / 316 \\
                 12.3.1: Resurrecting Objects during finalize / 318 \\
                 12.4: Interacting with the Garbage Collector / 318 \\
                 12.5: Reachability States and Reference Objects / 320
                 \\
                 12.5.1: Reference Class / 321 \\
                 12.5.2: Strengths of Reference and Reachability / 321
                 \\
                 12.5.3: Reference Queues / 325 \\
                 13: Packages / 329 \\
                 13.1: Package Naming / 330 \\
                 13.2: Type Imports / 331 \\
                 13.3: Package Access / 332 \\
                 13.3.1: Accessibility and Overriding Methods / 333 \\
                 13.4: Package Contents / 336 \\
                 13.5: Package Objects and Specifications / 337 \\
                 14: Documentation Comments / 341 \\
                 14.1: Anatomy of a Doc Comment / 342 \\
                 14.2: Tags / 343 \\
                 14.2.1: <at>see / 343 \\
                 14.2.2: <at>link / 344 \\
                 14.2.3: <at>param / 345 \\
                 14.2.4: <at>return / 345 \\
                 14.2.5: <at>throws and <at>exception / 345 \\
                 14.2.6: <at>deprecated / 345 \\
                 14.2.7: <at>author / 346 \\
                 14.2.8: <at>version / 346 \\
                 14.2.9: <at>since / 346 \\
                 14.2.10: <at>docRoot / 347 \\
                 14.3: An Example / 347 \\
                 14.4: External Conventions / 352 \\
                 14.4.1: Overview and Package Documentation / 352 \\
                 14.4.2: Doc-files Directory / 353 \\
                 14.5: Notes on Usage / 353 \\
                 15: I/O Package / 355 \\
                 15.1: Byte Streams / 357 \\
                 15.1.1: InputStream / 357 \\
                 15.1.2: OutputStream / 360 \\
                 15.2: Character Streams / 362 \\
                 15.2.1: Reader / 363 \\
                 15.2.2: Writer / 366 \\
                 15.2.3: Character Streams and the Standard Streams /
                 367 \\
                 15.3: InputStreamReader and OutputStreamWriter / 367
                 \\
                 15.4: A Quick Tour of The Stream Classes / 369 \\
                 15.4.1: Synchronization and Concurrency / 370 \\
                 15.4.2: Filter Streams / 371 \\
                 15.4.3: Buffered Streams / 374 \\
                 15.4.4: Piped Streams / 375 \\
                 \ldots{} [section numbers unavailable] \\
                 Piped Streams / 375 \\
                 ByteArray Byte Streams / 377 \\
                 CharArray Character Streams / 378 \\
                 String Character Streams / 379 \\
                 Print Streams / 380 \\
                 LineNumberReader / 381 \\
                 SequenceInputStream / 383 \\
                 Pushback Streams / 384 \\
                 StreamTokenizer / 386 \\
                 The Data Byte Streams / 391 \\
                 DataInput and DataOutput / 392 \\
                 The Data Stream Classes / 393 \\
                 Working with Files / 395 \\
                 File Streams and FileDescriptor / 395 \\
                 RandomAccessFile / 396 \\
                 The File Class / 398 \\
                 FilenameFilter and FileFilter / 404 \\
                 Object Serialization / 405 \\
                 The Object Byte Streams / 405 \\
                 Making Your Classes Serializable / 406 \\
                 Serialization and Deserialization Order / 408 \\
                 Customized Serialization / 409 \\
                 Object Versioning / 413 \\
                 Serialized Fields / 414 \\
                 The Externalizable Interface / 416 \\
                 Documentation Comment Tags / 417 \\
                 The IOException Classes / 418 \\
                 Collections / 421 \\
                 Collections / 421 \\
                 Exception Conventions / 424 \\
                 Iteration / 425 \\
                 Ordering using Comparable and Comparator / 427 \\
                 The Collection Interface / 428 \\
                 Set and SortedSet / 430 \\
                 HashSet / 432 \\
                 TreeSet / 432 \\
                 List / 433 \\
                 ArrayList / 435 \\
                 LinkedList / 436 \\
                 Map and SortedMap / 437 \\
                 HashMap / 440 \\
                 TreeMap / 441 \\
                 WeakHashMap / 442 \\
                 Wrapped Collections and the Collections Class / 442 \\
                 The Synchronization Wrappers / 443 \\
                 The Unmodifiable Wrappers / 444 \\
                 The Collections Utilities / 445 \\
                 The Arrays Utility Class / 448 \\
                 Writing Iterator Implementations / 448 \\
                 Writing Collection Implementations / 451 \\
                 The Legacy Collection Types / 456 \\
                 Enumeration / 457 \\
                 Vector / 457 \\
                 Stack / 459 \\
                 Dictionary / 459 \\
                 Hashtable / 460 \\
                 Properties / 460 \\
                 Miscellaneous Utilities / 463 \\
                 BitSet / 464 \\
                 Observer/Observable / 466 \\
                 Random / 470 \\
                 StringTokenizer / 472 \\
                 Timer and TimerTask / 473 \\
                 Math and StrictMath / 477 \\
                 System Programming / 479 \\
                 The System Class / 480 \\
                 Standard I/O Streams / 480 \\
                 System Properties / 481 \\
                 Utility Methods / 483 \\
                 Creating Processes / 484 \\
                 The Process Class / 485 \\
                 Process Environments / 487 \\
                 Portability / 488 \\
                 Shutdown / 488 \\
                 Shutdown Hooks / 489 \\
                 The Shutdown Sequence / 490 \\
                 Shutdown Strategies / 491 \\
                 The Rest of the Runtime / 492 \\
                 Loading Native Code / 492 \\
                 Debugging / 493 \\
                 Security / 493 \\
                 The SecurityManager Class / 494 \\
                 Permissions / 496 \\
                 Security Policies / 497 \\
                 Access Controllers and Privileged Execution / 497 \\
                 Internationalization and Localization / 501 \\
                 Locale / 502 \\
                 Resource Bundles / 504 \\
                 ListResourceBundle / 507 \\
                 PropertyResourceBundle / 508 \\
                 Subclassing ResourceBundle / 509 \\
                 Time, Dates, and Calendars / 509 \\
                 Calendars / 510 \\
                 Time Zones / 514 \\
                 GregorianCalendar and SimpleTimeZone / 515 \\
                 Formatting and Parsing Dates and Times / 517 \\
                 Internationalization and Localization for Text / 520
                 \\
                 Collation / 520 \\
                 Formatting and Parsing / 522 \\
                 Text Boundaries / 524 \\
                 Standard Packages / 527 \\
                 java.awt --- The Abstract Window Toolkit / 529 \\
                 java.applet --- Applets / 532 \\
                 java.beans --- Components / 533 \\
                 java.math --- Mathematics / 534 \\
                 java.net --- The Network / 535 \\
                 java.rmi --- Remote Method Invocation / 538 \\
                 java.security --- Security Tools / 543 \\
                 java.sql --- Relational Database Access / 544 \\
                 Utility Subpackages / 544 \\
                 Archive Files --- java.util.jar / 544 \\
                 ZIP Files --- java.util.zip / 545 \\
                 javax.* --- Standard Extensions / 546 \\
                 javax.accessibility --- Accessibility for GUIs / 546
                 \\
                 javax.naming --- Directory and Naming Services / 547
                 \\
                 javax.sound --- Sound Manipulation / 548 \\
                 javax.swing --- Swing GUI Components / 549 \\
                 org.omg.CORBA --- CORBA APIs / 549 \\
                 Runtime Exceptions / 551 \\
                 RuntimeException Classes / 552 \\
                 Error Classes / 554 \\
                 Useful Tables / 557 \\
                 Keywords / 557 \\
                 Operator Precedence / 558 \\
                 Unicode Digits / 558 \\
                 Unicode Letters and Digits / 559 \\
                 Special Characters Using / 560 \\
                 Documentation Comment Tags / 560 \\
                 Unicode Character Blocks / 561 \\
                 Further Reading / 563 \\
                 Index / 569",
}

@Book{Artwick:1984:ACM,
  author =       "Bruce A. Artwick",
  title =        "Applied Concepts in Microcomputer Graphics",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "ix + 374",
  year =         "1984",
  ISBN =         "0-13-039322-3",
  ISBN-13 =      "978-0-13-039322-7",
  LCCN =         "T385 .A77 1984",
  bibdate =      "Wed Dec 15 08:17:32 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Artwick:1985:ACM,
  author =       "Bruce A. Artwick",
  title =        "Applied Concepts in Microcomputer Graphics",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  edition =      "Second",
  pages =        "ix + 374",
  year =         "1985",
  ISBN =         "0-13-580226-1 (paperback), 0-13-039322-3 (hardcover)",
  ISBN-13 =      "978-0-13-580226-7 (paperback), 978-0-13-039322-7
                 (hardcover)",
  LCCN =         "T385 .A77 1985",
  bibdate =      "Wed Dec 15 08:17:32 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Applications of microcomputer graphics \\
                 Display generation basics \\
                 Working with display generation hardware \\
                 An introduction to peripheral graphics devices \\
                 Interactive design elements and intelligence \\
                 Design and simulation system interaction \\
                 Mathematics and transforms for advanced graphics \\
                 High-performance graphics and animation \\
                 Business graphics \\
                 Foreign and domestic television data \\
                 Graphics on the Apple II microcomputer \\
                 Graphics on the IBM personal computer",
}

@Book{Arvo:1991:GGI,
  author =       "James Arvo",
  title =        "Graphics gems {II}",
  volume =       "2",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "xxxii + 643",
  year =         "1991",
  ISBN =         "0-12-064480-0",
  ISBN-13 =      "978-0-12-064480-3",
  LCCN =         "T385 .G6972 1991",
  bibdate =      "Mon Aug 24 17:12:23 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Graphics Gems",
  URL =          "http://www.sciencedirect.com/science/book/9780080507545",
  ZMnumber =     "0774.68010",
  abstract =     "\booktitle{Graphics Gems II} is a collection of
                 articles shared by a diverse group of people that
                 reflect ideas and approaches in graphics programming
                 which can benefit other computer graphics programmers.
                 This volume presents techniques for doing well-known
                 graphics operations faster or easier. The book contains
                 chapters devoted to topics on two-dimensional and
                 three-dimensional geometry and algorithms, image
                 processing, frame buffer techniques, and ray tracing
                 techniques. The radiosity approach, matrix techniques,
                 and numerical and programming techniques are likewise
                 discussed.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "Foreword / Andrew Glassner \\
                 The Area of a Simple Polygon / Jon Rokne \\
                 Intersection of Line Segments / Mukesh Prasad \\
                 Distance from a Point to a Line / Jack C. Morrison \\
                 An Easy Bounding Circle / Jon Rokne \\
                 The Smallest Circle Containing the Intersection of Two
                 Circles / Jon Rokne \\
                 Appolonius's 10th Problem / Jon Rokne \\
                 A Peano Curve Generation Algorithm / Ken Musgrave \\
                 Space-Filling Curves and a Measure of Coherence /
                 Douglas Voorhies \\
                 Scanline Coherent Shape Algebra / Jonathan E. Steinhart
                 \\
                 Image Smoothing and Sharpening by Discrete Convolution
                 / Dale A. Schumacher \\
                 A Comparison of Digital Halftoning Techniques / Dale A.
                 Schumacher \\
                 Color Dithering / Spencer W. Thomas and Rod G. Bogart
                 \\
                 Fast Anamorphic Image Scaling / Dale A. Schumacher \\
                 Real Pixels / Greg Ward \\
                 A Fast 90-Degree Bitmap Rotator / Sue-Ken Yap \\
                 Rotation of Run-Length Encoded Image Data / Jeff Holt
                 \\
                 Adaptive Run-Length Encoding / Andrew S. Glassner \\
                 Image File Compression Made Easy / Alan W. Paeth \\
                 An Optimal Filter for Image Reconstruction / Nelson Max
                 \\
                 Noise Thresholding in Edge Images / John Schlag \\
                 Computing the Area, the Circumference, and the Genus of
                 a Binary Digital Image / Hanspeter Bieri and Andreas
                 Kohler \\
                 Efficient Inverse Color Map Computation / Spencer W.
                 Thomas \\
                 Efficient Statistical Computations for Optimal Color
                 Quantization / Xiaolin Wu \\
                 A Random Color Map Animation Algorithm / Ken Musgrave
                 \\
                 A Fast Approach to PHIGS PLUS Pseudo Color Mapping /
                 James Hall and Terence Lindgren \\
                 Mapping RGB Triples onto 16 Distinct Values / Alan W.
                 Paeth \\
                 Television Color Encoding and ``Hot'' Broadcast Colors
                 / David Martindale and Alan W. Paeth \\
                 An Inexpensive Method of Setting the Monitor White
                 Point / Gary W. Meyer \\
                 Some Tips for Making Color Hardcopy / Ken Musgrave \\
                 Area of Planar Polygons and Volume of Polyhedra /
                 Ronald N. Goldman \\
                 Getting Around on a Sphere / Clifford A. Shaffer \\
                 Exact Dihedral Metrics for Common Polyhedra / Alan W.
                 Paeth \\
                 A Simple Viewing Geometry / Andrew S. Glassner \\
                 View Correlation / Rod G. Bogart \\
                 Maintaining Winged-Edge Models / Andrew S. Glassner \\
                 Quadtree\slash Octree-to-Boundary Conversion / Claudio
                 Montani and Roberto Scopigno \\
                 Three-Dimensional Homogeneous Clipping of Triangle
                 Strips / Patrick-Gilles Maillot \\
                 InterPhong Shading / Nadia Magnenat Thalmann, Daniel
                 Thalmann and Hong Tong Minh \\
                 Fast Ray-Convex Polyhedron Intersection / Eric Haines
                 \\
                 Intersecting a Ray with an Elliptical Torus / Joseph M.
                 Cychosz \\
                 Ray-Triangle Intersection Using Binary Recursive
                 Subdivision / Douglas Voorhies and David Kirk \\
                 Improved Ray Tagging for Voxel-Based Ray Tracing /
                 David Kirk and James Arvo \\
                 Efficiency Improvements for Hierarchy Traversal in Ray
                 Tracing / Eric Haines \\
                 A Recursive Shadow Voxel Cache for Ray Tracing / Andrew
                 Pearce \\
                 Avoiding Incorrect Shadow Intersections for Ray Tracing
                 / Andrew Pearce \\
                 A Body Color Model: Absorption of Light through
                 Translucent Media / Mark E. Lee and Samuel P. Uselton
                 \\
                 More Shadow Attenuation for Ray Tracing Transparent or
                 Translucent Objects / Mark E. Lee and Samuel P. Uselton
                 \\
                 Implementing Progressive Radiosity with User-Provided
                 Polygon Display Routines / Shenchang Eric Chen \\
                 A Cubic Tetrahedral Adaptation of the Hemi-Cube
                 Algorithm / Jeffrey C. Beran-Koehn and Mark J. Pavicic
                 \\
                 Fast Vertex Radiosity Update / Filippo Tampieri \\
                 Radiosity via Ray Tracing / Peter Shirley \\
                 Detection of Shadow Boundaries for Adaptive Meshing in
                 Radiosity / Fran{\c{c}}ois Sillion \\
                 Decomposing a Matrix into Simple Transformations /
                 Spencer W. Thomas \\
                 Recovering the Data from the Transformation Matrix /
                 Ronald N. Goldman \\
                 Transformations as Exponentials / Ronald N. Goldman \\
                 More Matrices and Transformations: Shear and
                 Pseudo-Perspective / Ronald N. Goldman \\
                 Fast Matrix Inversion / Kevin Wu \\
                 Quaternions and $4 \times 4$ Matrices / Ken Shoemake
                 \\
                 Random Rotation Matrices / James Arvo \\
                 Classifying Small Sparse Matrices / James Arvo \\
                 Bit Picking / Ken Shoemake \\
                 Faster Fourier Transform / Ken Shoemake \\
                 Of Integers, Fields, and Bit Counting / Alan W. Paeth
                 and David Schilling \\
                 Using Geometric Constructions to Interpolate
                 Orientation with Quaternions / John Schlag \\
                 A Half-Angle Identity for Digital Computation: The Joys
                 of the Halved Tangent / Alan W. Paeth \\
                 An Integer Square Root Algorithm / Christopher J.
                 Musial \\
                 Fast Approximation to the Arctangent / Ron Capelli \\
                 Fast Sign of Cross Product Calculation / Jack Ritter
                 \\
                 Interval Sampling / Ken Shoemake \\
                 A Recursive Implementation of the Perlin Noise Function
                 / Greg Ward \\
                 Least-Squares Approximations to B{\'e}zier Curves and
                 Surfaces / Doug Moore and Joe Warren \\
                 Beyond B{\'e}zier Curves / Ken Shoemake \\
                 A Simple Formulation for Curve Interpolation with
                 Variable Control Point Approximation / John Schlag \\
                 Symmetric Evaluation of Polynomials / Terence Lindgren
                 \\
                 Menelaus's Theorem / Hans-Peter Seidel \\
                 Geometrically Continuous Cubic B{\'e}zier Curves /
                 Hans-Peter Siedel \\
                 A Good Straight-Line Approximation of a Circular Arc /
                 Christopher J. Musial \\
                 Great Circle Plotting / Alan W. Paeth \\
                 Fast Anti-Aliased Circle Generation / Xiaolin Wu \\
                 Graphics Gems C Header File \\
                 2D and 3D Vector C Library \\
                 Corrected and Indexed \\
                 Useful C Macros for Vector Operations / Steve
                 Hollasch",
  xxtableofcontents = "Foreword \\
                 Preface \\
                 Mathematical Notation \\
                 Pseudo-Code \\
                 Contributors \\
                 I: 2D Geometry and Algorithms \\
                 Introduction \\
                 1: The Area of a Simple Polygon \\
                 2: Intersection of Line Segments \\
                 3: Distance from a Point to a Line \\
                 4: An Easy Bounding Circle \\
                 5: The Smallest Circle Containing the Intersection of
                 Two Circles \\
                 6: Appolonius's 10th Problem \\
                 7: A Peano Curve Generation Algorithm \\
                 8: Space-Filling Curves and a Measure of Coherence \\
                 9: Scanline Coherent Shape Algebra \\
                 II: Image Processing \\
                 Introduction \\
                 1: Image Smoothing and Sharpening by Discrete
                 Convolution \\
                 2: A Comparison of Digital Halftoning Techniques \\
                 3: Color Dithering \\
                 4: Fast Anamorphic Image Scaling \\
                 5: Real Pixels \\
                 6: A Fast 90-Degree Bitmap Rotator \\
                 7: Rotation of Run-Length Encoded Image Data \\
                 8: Adaptive Run-Length Encoding \\
                 9: Image File Compression Made Easy \\
                 10: An Optimal Filter for Image Reconstruction \\
                 11: Noise Thresholding in Edge Images \\
                 12: Computing the Area, the Circumference, and the
                 Genus of a Binary Digital Image \\
                 III: Frame Buffer Techniques \\
                 Introduction \\
                 1: Efficient Inverse Color Map Computation \\
                 2. Efficient Statistical Computations for Optimal Color
                 Quantization \\
                 3: A Random Color Map Animation Algorithm \\
                 4: A Fast Approach to PHIGS PLUS Pseudo Color Mapping
                 \\
                 5: Mapping RGB Triples onto 16 Distinct Values \\
                 6: Television Color Encoding and ``Hot'' Broadcast
                 Colors \\
                 7: An Inexpensive Method of Setting the Monitor White
                 Point \\
                 8: Some Tips for Making Color Hardcopy \\
                 IV: 3D Geometry and Algorithms \\
                 Introduction \\
                 1: Area of Planar Polygons and Volume of Polyhedra \\
                 2: Getting Around on a Sphere \\
                 3: Exact Dihedral Metrics for Common Polyhedra \\
                 4: A Simple Viewing Geometry \\
                 5: View Correlation \\
                 6: Maintaining Winged-Edge Models \\
                 7: Quadtree\slash Octree-to-Boundary Conversion \\
                 8: Three-Dimensional Homogeneous Clipping of Triangle
                 Strips \\
                 9: InterPhong Shading \\
                 V: Ray Tracing \\
                 Introduction \\
                 1: Fast Ray-Convex Polyhedron Intersection \\
                 2: Intersecting a Ray with an Elliptical Torus \\
                 3: Ray-Triangle Intersection Using Binary Recursive
                 Subdivision \\
                 4: Improved Ray Tagging for Voxel-Based Ray Tracing \\
                 5: Efficiency Improvements for Hierarchy Traversal in
                 Ray Tracing \\
                 6: A Recursive Shadow Voxel Cache for Ray Tracing \\
                 7: Avoiding Incorrect Shadow Intersections for Ray
                 Tracing \\
                 8: A Body Color Model: Absorption of Light through
                 Translucent Media \\
                 9: More Shadow Attenuation for Ray Tracing Transparent
                 or Translucent Objects \\
                 VI: Radiosity \\
                 Introduction \\
                 1: Implementing Progressive Radiosity with
                 User-Provided Polygon Display Routines \\
                 2: A Cubic Tetrahedral Adaptation of the Hemi-Cube
                 Algorithm \\
                 3: Fast Vertex Radiosity Update \\
                 4: Radiosity via Ray Tracing \\
                 5: Detection of Shadow Boundaries for Adaptive Meshing
                 in Radiosity \\
                 [data unavailable] \ldots{}",
}

@Book{Asente:1990:XWS,
  author =       "Paul J. Asente and Ralph R. Swick",
  title =        "{X Window System Toolkit}: The Complete Programmer's
                 Guide and Specification",
  publisher =    pub-DP,
  address =      pub-DP:adr,
  pages =        "xxxv + 967",
  year =         "1990",
  ISBN =         "0-13-972191-6 (Prentice Hall), 0-13-973173-3,
                 0-13-975491-6 (Prentice Hall), 1-55558-051-3 (DP
                 paperback)",
  ISBN-13 =      "978-0-13-972191-5 (Prentice Hall), 978-0-13-973173-0,
                 978-0-13-975491-3 (Prentice Hall), 978-1-55558-051-3
                 (DP paperback)",
  LCCN =         "QA76.76.W56 A74 1990",
  MRclass =      "68-00, 68N25",
  bibdate =      "Tue Dec 14 22:40:01 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  ZMnumber =     "0771.68002",
  acknowledgement = ack-nhfb,
}

@Article{Asher:virtual-fonts,
  author =       "Graham Asher",
  title =        "Re: Virtual fonts: More fun for Grand Wizards",
  journal =      j-TEXHAX,
  volume =       "90",
  number =       "17",
  month =        jan,
  year =         "1990",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Aste:2000:PPP,
  author =       "Tomaso Aste and Denis Weaire",
  title =        "The Pursuit of Perfect Packing",
  publisher =    pub-IOP,
  address =      pub-IOP:adr,
  pages =        "xi + 136",
  year =         "2000",
  DOI =          "https://doi.org/10.1887/0750306483",
  ISBN =         "0-7503-0647-5 (hardcover), 0-7503-0648-3 (paperback)",
  ISBN-13 =      "978-0-7503-0647-8 (hardcover), 978-0-7503-0648-5
                 (paperback)",
  LCCN =         "QA166.7 .A78 2000",
  MRclass =      "52-01 (52A40 52C15 52C17 52C23)",
  MRnumber =     "1786410 (2001g:52001)",
  MRreviewer =   "Johann Linhart",
  bibdate =      "Tue Mar 13 11:03:37 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/kepler.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "\booktitle{The Pursuit of Perfect Packing} explores
                 the densest possible arrangement of identical spheres
                 and many others problems that have to do with packing
                 things together. The examples from mathematics,
                 physics, biology, and engineering include the
                 arrangement of soap bubbles in foam, atoms in a
                 crystal, the architecture of the bee's honeycomb, and
                 the structure of the Giant's Causeway. The book also
                 contains brief accounts of the lives of many of the
                 scientists who devoted themselves to problems of
                 packing over many centuries, together with wry comments
                 on their efforts. It is an entertaining introduction to
                 the field for both specialists and the more general
                 public.",
  acknowledgement = ack-nhfb,
  keywords =     "Hilbert's 18th Problem (How can one arrange most
                 densely in space an infinite number of equal solids of
                 given form, so that the ratio of the filled to the
                 unfilled space may be as great as possible?); Kepler
                 sphere-packing conjecture; Malfatti problem; Mallet's
                 model; Thomas Hales' packing-proof programme; Thomson
                 problem; Tammes problem; Vorono{\"\i} construction",
  libnote =      "Not in my library.",
  remark =       "This is an interesting little monograph on packing
                 problems, a surprising number of which continue to
                 elude proofs and solutions. Packing problems are
                 considered in two-, three-, and higher dimensions, for
                 bubbles, casks of Guinness, concrete, spheres, foam,
                 soap film, \ldots{}.",
  tableofcontents = "1: How many sweets in the jar? \\
                 2: Loose change and tight packing \\
                 3: Hard Problems with hard spheres \\
                 4: Proof positive? \\
                 5: Peas and Pips \\
                 6: Enthusiastic admiration: the honeycomb \\
                 7: Toils and troubles with bubbles \\
                 8: The architecture of the world of atoms \\
                 9: Apollonius and concrete \\
                 10: The Giants Causeway \\
                 11: Soccer balls, golf balls, and Bucky balls \\
                 12: Packings and kisses in high dimensions \\
                 13: Odds and ends \\
                 14: Conclusion",
}

@Manual{ASTM:1970:CPT,
  title =        "{CODEN} for Periodical Titles (Including
                 Non-Periodical Titles and Deleted {CODEN}): An aid to
                 the storage and retrieval of information and to
                 communication involving journal references",
  organization = "American Society for Testing and Materials",
  address =      "1916 Race St., Philadelphia, PA 19103, USA",
  edition =      "Third",
  year =         "1970",
  bibdate =      "Thu Apr 25 07:55:21 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "ASTM Data Series DS 23 B. Two volumes. Includes CODEN
                 values for 102,146 periodical titles and 7,361
                 non-periodical publications.",
  price =        "US\$215.00",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
}

@TechReport{Atanasoff:1940:CMS,
  author =       "J. V. Atanasoff",
  title =        "Computing machine for the solution of large systems of
                 linear algebraic equations",
  type =         "Unpublished memorandum",
  institution =  "Iowa State College",
  address =      "Ames, IA, USA",
  month =        aug,
  year =         "1940",
  bibdate =      "Wed Oct 13 11:36:11 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Reprinted in \cite[\S 7.2]{Randell:1982:ODC}.",
  acknowledgement = ack-nhfb,
}

@Book{Atkins:1970:TGT,
  author =       "P. W. (Peter William) Atkins and M. S. Child and C. S.
                 G. (Courtenay Stanley Goss) Phillips",
  title =        "Tables for Group Theory",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  pages =        "32",
  year =         "1970",
  ISBN =         "0-19-855131-2",
  ISBN-13 =      "978-0-19-855131-7",
  LCCN =         "QA171 .A851",
  bibdate =      "Mon Jul 27 07:06:06 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{ATT:AUS86-1,
  author =       "AT{\&T}",
  key =          "ATT",
  title =        "{AT}{{\&T UNIX}} System Readings and Applications",
  volume =       "I",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xiv + 397",
  year =         "1986",
  ISBN =         "0-13-938532-0",
  ISBN-13 =      "978-0-13-938532-2",
  LCCN =         "QA76.76.O63 U553 1986",
  bibdate =      "Sat Oct 28 08:25:56 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxnote =       "NB: special form AT{\&T} required to get correct
                 alpha-style labels.",
}

@Book{ATT:AUS86-2,
  author =       "AT{\&T}",
  key =          "ATT",
  title =        "{AT}{{\&T UNIX}} System Readings and Applications",
  volume =       "II",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xii + 324",
  year =         "1986",
  ISBN =         "0-13-939845-7",
  ISBN-13 =      "978-0-13-939845-2",
  LCCN =         "QA76.76.O63 U553 1986",
  bibdate =      "Sat Oct 28 08:25:58 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxnote =       "NB: special form AT{\&T} required to get correct
                 alpha-style labels.",
}

@Book{ATT:UPM83-1,
  author =       "AT{\&T}",
  key =          "ATT",
  title =        "{UNIX} Programmer's Manual",
  volume =       "1",
  publisher =    pub-HRW,
  address =      pub-HRW:adr,
  pages =        "xiv + 425",
  year =         "1983",
  ISBN =         "0-03-061742-1",
  ISBN-13 =      "978-0-03-061742-3",
  LCCN =         "QA76.8.U65 B44 1983",
  bibdate =      "Sat Oct 28 08:26:00 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxnote =       "NB: special form AT{\&T} required to get correct
                 alpha-style labels.",
}

@Book{ATT:UPM83-2,
  author =       "AT{\&T}",
  key =          "ATT",
  title =        "{UNIX} Programmer's Manual",
  volume =       "2",
  publisher =    pub-HRW,
  address =      pub-HRW:adr,
  pages =        "vii + 616",
  year =         "1983",
  ISBN =         "0-03-061743-X",
  ISBN-13 =      "978-0-03-061743-0",
  LCCN =         "QA76.8.U65 B44 1983",
  bibdate =      "Sat Oct 28 08:26:02 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxnote =       "NB: special form AT{\&T} required to get correct
                 alpha-style labels.",
}

@Book{ATT:UPM86-1,
  author =       "AT{\&T}",
  key =          "ATT",
  title =        "{UNIX Programmer}'s {Manual}: {Commands} and
                 {Utilities}",
  volume =       "1",
  publisher =    pub-HRW,
  address =      pub-HRW:adr,
  pages =        "xxix + 524",
  year =         "1986",
  ISBN =         "0-03-009317-1",
  ISBN-13 =      "978-0-03-009317-3",
  LCCN =         "QA76.76.O63 U548 1986",
  bibdate =      "Sat Oct 28 08:26:04 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxnote =       "NB: special form AT{\&T} required to get correct
                 alpha-style labels.",
}

@Book{ATT:UPM86-2,
  author =       "AT{\&T}",
  key =          "ATT",
  title =        "{UNIX Programmer}'s {Manual}: {System Calls} and
                 {Library Routines}",
  volume =       "2",
  publisher =    pub-HRW,
  address =      pub-HRW:adr,
  pages =        "xxxv + 465",
  year =         "1986",
  ISBN =         "0-03-009314-7",
  ISBN-13 =      "978-0-03-009314-2",
  LCCN =         "QA76.76.O63 U548 1986",
  bibdate =      "Sat Oct 28 08:26:05 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{ATT:UPM86-3,
  author =       "AT{\&T}",
  key =          "ATT",
  title =        "{UNIX Programmer}'s {Manual}: {System} {Administration
                 Facilities}",
  volume =       "3",
  publisher =    pub-HRW,
  address =      pub-HRW:adr,
  pages =        "xiv + 142",
  year =         "1986",
  ISBN =         "0-03-009313-9",
  ISBN-13 =      "978-0-03-009313-5",
  LCCN =         "QA76.76.O63 U548 1986",
  bibdate =      "Sat Oct 28 08:26:07 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxnote =       "NB: special form AT{\&T} required to get correct
                 alpha-style labels.",
}

@Book{ATT:UPM86-4,
  author =       "AT{\&T}",
  key =          "ATT",
  title =        "{UNIX Programmer}'s {Manual}: {Document}
                 {Preparation}",
  volume =       "4",
  publisher =    pub-HRW,
  address =      pub-HRW:adr,
  pages =        "xiii + 355",
  year =         "1986",
  ISBN =         "0-03-011207-9",
  ISBN-13 =      "978-0-03-011207-2",
  LCCN =         "QA76.76.O63 U548 1986",
  bibdate =      "Sat Oct 28 08:26:08 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxnote =       "NB: special form AT{\&T} required to get correct
                 alpha-style labels.",
}

@Book{ATT:UPM86-5,
  author =       "AT{\&T}",
  key =          "ATT",
  title =        "{UNIX Programmer}'s {Manual}: {Languages} and {Support
                 Tools}",
  volume =       "5",
  publisher =    pub-HRW,
  address =      pub-HRW:adr,
  pages =        "xviii + 618",
  year =         "1986",
  ISBN =         "0-03-011204-4",
  ISBN-13 =      "978-0-03-011204-1",
  LCCN =         "QA76.76.O63 U548 1986",
  bibdate =      "Sat Oct 28 08:26:09 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxnote =       "NB: special form AT{\&T} required to get correct
                 alpha-style labels.",
}

@Book{ATT:USV86,
  author =       "AT{\&T}",
  key =          "ATT",
  title =        "{UNIX System V Programmer}'s {Guide}",
  publisher =    pub-HRW,
  address =      pub-HRW:adr,
  pages =        "xiv + 832",
  year =         "1986",
  ISBN =         "0-13-940438-4",
  ISBN-13 =      "978-0-13-940438-2",
  LCCN =         "QA76.76.O63 U556 1987",
  bibdate =      "Sat Oct 28 08:26:11 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxnote =       "NB: special form AT{\&T} required to get correct
                 alpha-style labels.",
}

@Book{Augarten:1984:BBI,
  author =       "Stan Augarten",
  title =        "{BIT} by {BIT}: An Illustrated History of Computers",
  publisher =    pub-TICKNOR-FIELDS,
  address =      pub-TICKNOR-FIELDS:adr,
  pages =        "ix + 324",
  year =         "1984",
  ISBN =         "0-89919-268-8, 0-89919-302-1 (paperback)",
  ISBN-13 =      "978-0-89919-268-0, 978-0-89919-302-1 (paperback)",
  LCCN =         "QA76.17.A94 1984",
  bibdate =      "Thu Sep 15 07:53:57 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Tells the story of the development of computers, plus
                 the men and women who shaped its history.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "The first mechanical calculators \\
                 The engines of Charles Babbage \\
                 The bridge between two centuries \\
                 The invention of ENIAC \\
                 The stored-program computer \\
                 The rise of IBM \\
                 The Whirlwind Project \\
                 The integrated circuit \\
                 The personal computer \\
                 Epilogue: the lesson of history \\
                 Appendix: the FBI dossier of John William Mauchly \\
                 Chronology of the history of computers",
}

@Book{Austern:1999:GPS,
  author =       "Matthew H. Austern",
  title =        "Generic Programming and the {STL}: Using and Extending
                 the {C++ Standard Template} Library",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xx + 548",
  year =         "1999",
  ISBN =         "0-201-30956-4",
  ISBN-13 =      "978-0-201-30956-0",
  LCCN =         "QA76.73.C153A97 1999",
  bibdate =      "Tue May 11 07:00:39 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$49.95",
  series =       "Addison-Wesley professional computing series",
  abstract =     "This guide explains the C++ Standard Template Library
                 (STL) in terms of generic programming--a way of
                 designing and writing programs so that they can easily
                 be reused. The fundamental premise is that the STL
                 should be regarded as a library of concepts, rather
                 than as a library of functions and classes.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  tableofcontents = "Part I: Introduction to Generic Programming \\
                 1: A Tour of the STL \\
                 2: Algorithms and Ranges \\
                 3: More about Iterators \\
                 4: Function Objects \\
                 5: Containers \\
                 Part II: Reference Manual: STL Concepts \\
                 6: Basic Concepts \\
                 7: Iterators \\
                 8: Function Objects \\
                 9: Containers \\
                 Part III: Reference Manual: Algorithms and Classes \\
                 10: Basic Components \\
                 11: Nonmutating Algorithms \\
                 12: Basic Mutating Algorithms \\
                 13: Sorting and Searching \\
                 14: Iterator Classes \\
                 15: Function Object Classes \\
                 16: Container Classes \\
                 Appendix A: Portability and Standardization",
}

@Article{Avenarius:fortran-web,
  author =       "Adrian Avenarius and Siegfried Oppermann",
  title =        "{\FWEB}: a Literate Programming System for {Fortran
                 8X}",
  journal =      j-SIGPLAN,
  volume =       "25",
  number =       "1",
  pages =        "52--58",
  month =        jan,
  year =         "1990",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Avery:1976:CAO,
  author =       "John Avery",
  title =        "Creation and Annihilation Operators",
  publisher =    "McGraw-Hill International Book Company",
  address =      "New York, NY, USA",
  pages =        "xii + 221",
  year =         "1976",
  ISBN =         "0-07-002504-5",
  ISBN-13 =      "978-0-07-002504-2",
  LCCN =         "QC174.52.06A9",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/d/dirac-p-a-m.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/d/dyson-freeman-j.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/f/feynman-richard-p.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/s/slater-john-clarke.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "1: Boson operators \\
                 2: Fermion operators \\
                 3: A second-quantized formulation of Russell--Saunders
                 coupling and crystal field theory \\
                 4: Group theoretical properties of electron creation
                 and annihilation operators \\
                 5: An introduction to quantum electrodynamics \\
                 6: Many-body perturbation theory \\
                 Appendix A: The Bogoliubov--Tyablikov transformation
                 for diagonalizing a quadratic boson Hamiltonian / 139
                 \\
                 Appendix B: The Dirac equation / 145 \\
                 Appendix C: Solutions to the problems / 169 \\
                 Bibliography and References / 213 \\
                 Index / 217",
  tableofcontents = "1: Boson operators \\
                 1.1 A simple harmonic oscillator treated by means of
                 commutation relations / 1 \\
                 1.2 Phonon creation and annihilation operators / 3 \\
                 1.3 A collection of harmonic oscillators / 5 \\
                 1.4 Small vibrations of a classical system about its
                 equilibrium position; Transformation to normal
                 coordinates / 6 \\
                 1.5 Vibrational normal modes of a crystal lattice / 8
                 \\
                 1.6 A one-dimensional example; Optical and acoustic
                 vibrational modes / 11 \\
                 1.7 The Lagrangian density of a continuous system / 15
                 \\
                 1.8 Motion of a vibrating string / 17 \\
                 1.9 A vibrating string treated as a chain of
                 elastically joined point masses; The cut-off frequency
                 / 22 \\
                 2: Fermion operators \\
                 2.1 Antisymmetric many-electron wave functions; Slater
                 determinants / 27 \\
                 2.2 Electron creation and annihilation operators / 30
                 \\
                 2.3 One-electron and two-electron operators; Derivation
                 of the Slater--Condon rules / 32 \\
                 2.4 Commutation rules for one- and two -electron
                 operators / 37 \\
                 2.5 Koopmans' theorem / 38 \\
                 2.6 The Hartree--Fock equations / 38 \\
                 2.7 Excitations from the Hartree--Fock ground state;
                 The random phase approximation / 41 \\
                 2.8 Calculation of transition dipole moments in the
                 random phase approximation / 45 \\
                 2.9 Calculation of the ground state correlation
                 coefficients in the random phase approximation / 47 \\
                 3: A second-quantized formulation of Russell--Saunders
                 coupling and crystal field theory \\
                 3.1 Commutation rules for spin / 51 \\
                 3.2 Commutation rules for orbital angular momentum / 53
                 \\
                 3.3 Commutation rules for the spin-orbit coupling
                 operator / 56 \\
                 3.4 The effect of a crystal field / 57 \\
                 3.5 An example of crystal field splitting: the $^4F$
                 and $^4P$ $d^3$ multiplets in tetrahedral and
                 octahedral fields / 60 \\
                 3.6 External magnetic fields / 68 \\
                 4: Group theoretical properties of electron creation
                 and annihilation operators \\
                 4.1 Transformation properties of electron creation and
                 annihilation operators under elements of a symmetry
                 group / 71 \\
                 4.2 Group theoretical projection operators / 72 \\
                 4.3 Time reversal / 74 \\
                 4.4 Kramers' theorem; Time-reversal degeneracy / 76 \\
                 4.5 Kramers pairs / 76 \\
                 4.6 The Kramers pair creation operator / 78 \\
                 4.7 Invariance of $B\dagger$ under the symmetry group
                 of the Hamiltonian / 79 \\
                 4.8 The seniority quantum number / 82 \\
                 4.9 Energy of Russell--Saunders terms in atoms;
                 Slater--Condon and Racah parameters / 86 \\
                 4.10 Configuration interaction; Calculation of
                 correlation energy using Kramers pair creation and
                 annihilation operators / 88 \\
                 4.11 Cooper pairs in superconductivity theory / 91 \\
                 4.12 Commutation relations for Kramers pair creation
                 and annihilation operators / 92 \\
                 4.13 Normalization of daughter states / 93 \\
                 5: An introduction to quantum electrodynamics \\
                 5.1 Quantization of the electromagnetic potentials / 97
                 \\
                 5.2 Separation of the longitudinal and transverse
                 potentials; The approximate Hamiltonian of the
                 electron-photon system / 103 \\
                 5.3 Linear polarization and circular polarization of
                 photons / 106 \\
                 5.4 Spontaneous photon emission / 108 \\
                 5.5 Photon absorption / 110 \\
                 5.6 Angular correlations in the photoelectric effect /
                 112 \\
                 5.7 Photon scattering and dispersion; Feynman diagrams
                 / 115 \\
                 5.8 Optical activity / 120 \\
                 6: Many-body perturbation theory \\
                 6.1 The Feynman--Dyson form of perturbation theory; The
                 interaction representation; Chronological products /
                 123 \\
                 6.2 Time-dependent anticommutation relations; Hole
                 creation and annihilation operators / 126 \\
                 6.3 Normal products; Contractions; Wick's theorem / 129
                 \\
                 6.4 The adiabatic hypothesis; Level shifts / 132 \\
                 6.5 Feynman diagrams representing perturbations of the
                 ground state; The linked cluster theorem / 133 \\
                 Appendix A: The Bogoliubov--Tyablikov transformation
                 for diagonalizing a quadratic boson Hamiltonian / 139
                 \\
                 Appendix B: The Dirac equation / 145 \\
                 Appendix C: Solutions to the problems / 169 \\
                 Bibliography and References / 213 \\
                 Index / 217",
}

@Unpublished{Babbage:1837:MPC,
  author =       "Charles Babbage",
  title =        "On the mathematical powers of the calculating engine",
  month =        dec,
  year =         "1837",
  bibdate =      "Wed Oct 13 11:09:59 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Manuscript held by Museum of the History of Science,
                 Oxford, UK. Reprinted in \cite[\S
                 2.1]{Randell:1982:ODC}.",
  acknowledgement = ack-nhfb,
}

@Article{Babbage:1910:BBA,
  author =       "H. P. Babbage",
  title =        "{Babbage}: {Babbage}'s analytical engine",
  journal =      j-MONTHLY-NOT-ROY-ASTRON-SOC,
  volume =       "70",
  number =       "??",
  pages =        "517--526, 645",
  year =         "1910",
  CODEN =        "MNRAA4",
  ISSN =         "0035-8711",
  bibdate =      "Wed Oct 13 11:12:08 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Reprinted in \cite[\S 2.3]{Randell:1982:ODC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Monthly Notices of the Royal Astronomical Society",
}

@Book{Bach:1986:DUO,
  author =       "Maurice J. Bach",
  title =        "The Design of the {UNIX} Operating System",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xiv + 471",
  year =         "1986",
  ISBN =         "0-13-201799-7",
  ISBN-13 =      "978-0-13-201799-2",
  LCCN =         "QA76.76.O63 B33 1986",
  bibdate =      "Tue Dec 14 22:40:07 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  note =         "See also \cite{Goodheart:1994:MGE}.",
  URL =          "https://archive.org/details/DesignUNIXOperatingSystem/mode/2up",
  acknowledgement = ack-nhfb,
  tableofcontents = "General Overview of the System \\
                 History \\
                 System Structure \\
                 User Perspective \\
                 Operating System Services \\
                 Assumptions About Hardware \\
                 Introduction to the Kernel \\
                 Architecture of the UNIX Operating System \\
                 Introduction to System Concepts \\
                 Kernel Data Structures \\
                 System Administration \\
                 Summary and Preview \\
                 The Buffer Cache \\
                 Buffer Headers \\
                 Structure of the Buffer Pool \\
                 Scenarios for Retrieval of a Buffer \\
                 Reading and Writing Disk Blocks \\
                 Advantages and Disadvantages of the Buffer Cache \\
                 Internal Representation of Files \\
                 Inodes \\
                 Structure of a Regular File \\
                 Directories \\
                 Conversion of a Path Name to an Inode \\
                 Super Block \\
                 Inode Assignment to a New File \\
                 Allocation of Disk Blocks \\
                 Other File Types \\
                 System Calls for the File System \\
                 Open \\
                 Read \\
                 Write \\
                 File and Record Locking \\
                 Adjusting the Position of File I/O \\
                 LSEEK \\
                 Close \\
                 File Creation \\
                 Creation of Special Files \\
                 Change Directory and Change Root \\
                 Change Owner and Change Mode \\
                 STAT and FSTAT \\
                 Pipes \\
                 Dup \\
                 Mounting and Unmounting File Systems \\
                 Link \\
                 Unlink \\
                 File System Abstractions \\
                 File System Maintenance \\
                 The Structure of Processes \\
                 Process States and Transitions \\
                 Layout of System Memory \\
                 The Context of a Process \\
                 Saving the Context of a Process \\
                 Manipulation of the Process Address Space \\
                 Sleep \\
                 Process Control \\
                 Process Creation \\
                 Signals \\
                 Process Termination \\
                 Awaiting Process Termination \\
                 Invoking Other Programs \\
                 The User ID of a Process \\
                 Changing the Size of a Process \\
                 The Shell \\
                 System Boot and the INIT Process \\
                 Process Scheduling and Time \\
                 Process Scheduling \\
                 System Calls For Time \\
                 Clock \\
                 Memory Management Policies \\
                 Swapping \\
                 Demand Paging \\
                 A Hybrid System With Swapping and Demand Paging \\
                 The I/O Subsystem \\
                 Driver Interfaces \\
                 Disk Drivers \\
                 Terminal Drivers \\
                 Streams \\
                 Interprocess Communication \\
                 Process Tracing \\
                 System V IPC \\
                 Network Communications \\
                 Sockets \\
                 Multiprocessor Systems \\
                 Problem of Multiprocessor Systems \\
                 Solution With Master and Slave Processors \\
                 Solution With Semaphores \\
                 The Tunis System \\
                 Performance Limitations \\
                 Distributed Unix Systems \\
                 Satellite Processors \\
                 The Newcastle Connection \\
                 Transparent Distributed File Systems \\
                 A Transparent Distributed Model Without Stub Processes
                 \\
                 System Calls",
}

@Book{Backhouse:1979:SPL,
  author =       "Roland C. Backhouse",
  title =        "Syntax of Programming Language",
  publisher =    pub-PHI,
  address =      pub-PHI:adr,
  pages =        "xv + 301",
  year =         "1979",
  ISBN =         "0-13-879999-7",
  ISBN-13 =      "978-0-13-879999-1",
  LCCN =         "QA76.7 .B3",
  bibdate =      "Tue Dec 14 22:40:09 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$18.95",
  series =       "Series in Computer Science, Editor: C. A. R. Hoare",
  acknowledgement = ack-nhfb,
}

@Article{Backus:fortran-history,
  author =       "John Backus",
  title =        "The History of {FORTRAN I}, {II}, and {III}",
  journal =      j-SIGPLAN,
  volume =       "13",
  number =       "8",
  pages =        "165--180",
  month =        aug,
  year =         "1978",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Baer:1980:CSA,
  author =       "Jean-Loup Baer",
  title =        "Computer Systems Architecture",
  publisher =    pub-CSP,
  address =      pub-CSP:adr,
  pages =        "xiii + 626",
  year =         "1980",
  ISBN =         "0-914894-15-3",
  ISBN-13 =      "978-0-914894-15-5",
  LCCN =         "QA76.9.A73 B33",
  bibdate =      "Tue Dec 14 22:40:11 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "An overview of the computer space \\
                 Historical survey of computer systems architecture \\
                 Description of computer systems \\
                 The building blocks and their interactions \\
                 Arithmetic algorithms \\
                 Powerful central processors \\
                 The memory hierarchy \\
                 Management of the memory hierarchy \\
                 The control unit and microprogramming \\
                 Input-output \\
                 Complete systems: from micros to supercomputers \\
                 From microprocessors to superminicomputers \\
                 Supercomputers \\
                 Future trends in computer systems architecture",
}

@Book{Baer:2010:MAS,
  author =       "Jean-Loup Baer",
  title =        "Microprocessor architecture: from simple pipelines to
                 chip multiprocessors",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xiv + 367",
  year =         "2010",
  ISBN =         "0-521-76992-2 (hardcover)",
  ISBN-13 =      "978-0-521-76992-1 (hardcover)",
  LCCN =         "QA76.5 .B227 2010",
  bibdate =      "Thu Sep 9 14:42:55 MDT 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Microprocessors; Computer architecture",
  tableofcontents = "Introduction \\
                 The basics \\
                 Superscalar processors \\
                 Front-end: branch predictio, instruction fetching, and
                 register renaming \\
                 Back-end: instruction scheduling, memory access
                 instructions, and clusters \\
                 The cache hierarchy \\
                 Multiprocessors \\
                 Multithreading and (chip) multiprocessing \\
                 Current limitations and future challenges",
}

@Article{Baeza-Yates:j-CACM-35-10-74,
  author =       "Ricardo Baeza-Yates and Gaston H. Gonnet",
  title =        "A New Approach to Text Searching",
  journal =      j-CACM,
  volume =       "35",
  number =       "10",
  pages =        "74--82",
  month =        oct,
  year =         "1992",
  bibdate =      "Sat Nov 7 11:35:45 1992",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "This paper describes a new linear-time string search
                 algorithm that can handle limited regular-expression
                 pattern matching {\em without\/} backtracking. See also
                 \cite{Knuth:string-search}, \cite{Boyer:string-search},
                 \cite{Karp:TR-31-81}, \cite{Sunday:string-search}, and
                 \cite{Wu:j-CACM-35-10-83}.",
  acknowledgement = ack-nhfb,
}

@Book{Baggott:1992:MQT,
  author =       "J. E. Baggott",
  booktitle =    "The Meaning of Quantum Theory: a Guide for Students of
                 Chemistry and Physics",
  title =        "The Meaning of Quantum Theory: a Guide for Students of
                 Chemistry and Physics",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  pages =        "xi + 230",
  year =         "1992",
  ISBN =         "0-19-855575-X, 0-19-855576-8 (hardcover)",
  ISBN-13 =      "978-0-19-855575-9, 978-0-19-855576-6 (hardcover)",
  LCCN =         "QC174.12 .B34 1992",
  bibdate =      "Mon Oct 24 17:45:40 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/p/planck-max.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Oxford science publications",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0640/91034937-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0640/91034937-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Quantum theory; Quantum chemistry",
  tableofcontents = "1: How quantum theory was discovered / 1 \\
                 1.1: An act of desperation / 1 \\
                 1.2: Gathering the evidence / 10 \\
                 1.3: Wave--particle duality / 15 \\
                 1.4: Wave mechanics / 19 \\
                 1.5: Matrix mechanics and the uncertainty principle /
                 29 \\
                 1.6: Relativity and spin / 34 \\
                 2: Putting it into practice / 38 \\
                 2.1: Operators in quantum mechanics / 38 \\
                 2.2: The postulates of quantum mechanics / 42 \\
                 2.3: State vectors in Hilbert principle / 48 \\
                 2.4: The Pauli principle / 55 \\
                 2.5: The polarization properties of photons / 60 \\
                 2.6: Quantum measurement / 67 \\
                 3: What does it mean? / 75 \\
                 3.1: Positivism / 75 \\
                 3.2: The Copenhagen interpretation / 81 \\
                 3.3: The Bohr--Einstein debate / 88 \\
                 3.4: Is quantum mechanics complete? / 97 \\
                 3.5: Hidden variables / 106 \\
                 4: Putting it to the test / 117 \\
                 4.1: Bohm's version of the EPR experiment / 117 \\
                 4.2: Quantum theory and local reality / 125 \\
                 4.3: Bell's theorem / 131 \\
                 4.4: The Aspect experiments / 139 \\
                 4.5: Delayed-choice experiments / 150 \\
                 4.6: Retrospective / 156 \\
                 5: What are the alternatives? / 159 \\
                 5.1: Pilot waves, potentials and propensities / 159 \\
                 5.2: An irreversible act / 171 \\
                 5.3: The conscious act / 185 \\
                 5.4: The `many-world' interpretation / 194 \\
                 5.5: The hand of God? / 201 \\
                 Closing remarks / 210 \\
                 Appendix A: Planck's derivation of the quantum law /
                 212 \\
                 Appendix B: Bell's inequality for non-ideal cases / 214
                 \\
                 Bibliography / 218 \\
                 Name index / 223 \\
                 Subject index / 225",
}

@Book{Baggott:2010:FWP,
  author =       "Jim Baggott",
  title =        "The {First War of Physics}: The Secret History of the
                 Atomic Bomb, 1939--1949",
  publisher =    "Pegasus Books",
  address =      "New York, NY, USA",
  pages =        "xiv + 576",
  year =         "2010",
  ISBN =         "1-60598-084-6",
  ISBN-13 =      "978-1-60598-084-3",
  LCCN =         "QC773 .B24 2010",
  bibdate =      "Thu Apr 15 08:14:32 2010",
  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://pegasusbooks.us/pdf/Spg10_Catalog.pdf",
  acknowledgement = ack-nhfb,
  remark =       "Icon Press (UK) 2009 title: ``ATOMIC: The First War of
                 Physics and the Secret History of the Atom Bomb,
                 1939-1949''. Not yet in library catalogs
                 (15-Apr-2010).",
  tableofcontents = "List of illustrations / ix \\
                 Preface / xi \\
                 Prologue: Letter from Berlin / 1 \\
                 Part I: Mobilisation / 21 \\
                 1: The Uranverein / 23 \\
                 2: Element 94 / 41 \\
                 3: Critical Mass / 57 \\
                 4: A Visit to Copenhagen / 75 \\
                 5: Tube Alloys / 93 \\
                 Part II: Weapon / 115 \\
                 6: A Modest Request / 117 \\
                 7: The Italian Navigator / 137 \\
                 8: Los Alamos Ranch School / 159 \\
                 9: Enormoz [Cyrillic: Enormous] / 179 \\
                 10: Escape from Copenhagen / 199 \\
                 Part III: War / 221 \\
                 11: Uncle Nick / 223 \\
                 12: Mortal Crimes / 239 \\
                 13: Alsos and AZUSA / 259 \\
                 14: The Final Push / 279 \\
                 15: Trinity / 299 \\
                 16: Hypocentre / 319 \\
                 17: Operation Epsilon / 339 \\
                 Part IV: Proliferation / 357 \\
                 18: Dognat' i peregnat'! [Cyrillic: Catch up and
                 overtake] / 359 \\
                 19: Iron Curtain / 377 \\
                 20: Crossroads / 397 \\
                 21: Arzamas-16 / 417 \\
                 22: Joe-1 / 439 \\
                 Epilogue: Mutual Assured Destruction / 461 \\
                 Timeline / 493 \\
                 List of Key Characters / 515 \\
                 Notes and Sources / 535 \\
                 Bibliography / 553 \\
                 Index / 559",
}

@Book{Baggott:2011:QSH,
  author =       "Jim Baggott",
  title =        "The quantum story: a history in 40 moments",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  pages =        "xix + 469 + 16",
  year =         "2011",
  ISBN =         "0-19-956684-4 (hardcover), 0-19-965597-9 (paperback)",
  ISBN-13 =      "978-0-19-956684-6 (hardcover), 978-0-19-965597-7
                 (paperback)",
  LCCN =         "QC173.98 .B34 2011",
  bibdate =      "Sat Sep 17 16:37:46 2011",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/bohr-niels.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/mathgaz2010.bib;
                 library.ox.ac.uk:210/ADVANCE;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Quantum theory; History",
  tableofcontents = "Prologue: Stormclouds: London, April 1900 \\
                 Quantum of action: The most strenuous work of my life:
                 Berlin, December 1900 \\
                 Annus Mirabilis: Bern, March 1905 \\
                 A little bit of reality: Manchester, April 1913 \\
                 la Com\'edie Fran{\c{c}}aise: Paris, September 1923 \\
                 A strangely beautiful interior: Helgoland, June 1925
                 \\
                 The self-rotating electron: Leiden, November 1925 \\
                 A late erotic outburst: Swiss Alps, Christmas 1925 \\
                 Quantum interpretation: Ghost field: Oxford, August
                 1926 \\
                 All this damned quantum jumping: Copenhagen, October
                 1926 \\
                 The uncertainty principle: Copenhagen, February 1927
                 \\
                 The `Kopenhagener geist': Copenhagen, June 1927 \\
                 There is no quantum world: Lake Como, September 1927
                 \\
                 Quantum debate: The debate commences: Brussels, October
                 1927 \\
                 An absolute wonder: Cambridge, Christmas 1927 \\
                 The photon box: Brussels, October 1930 \\
                 A bolt from the blue: Princeton, May 1935 \\
                 The paradox of Schr{\"o}dinger's cat: Oxford, August
                 1935 \\
                 Interlude: The first war of physics: Christmas
                 1938-August 1945 \\
                 Quantum fields: Shelter Island: Long Island, June 1947
                 \\
                 Pictorial semi-vision thing: New York, January 1949 \\
                 A beautiful idea: Princeton, February 1954 \\
                 Some strangeness in the proportion: Rochester, August
                 1960 \\
                 Three quarks for Muster Mark!: New York, March 1963 \\
                 The `God particle': Cambridge, Massachusetts, Autumn
                 1967 \\
                 Quantum particles: Deep inelastic scattering: Stanford,
                 August 1968 \\
                 Of charm and weak neutral currents: Harvard, February
                 1970 \\
                 The magic of colour: Princeton/Harvard, April 1973 \\
                 The November revolution: Long Island/Stanford, November
                 1974 \\
                 Intermediate vector bosons: Geneva, January/June 1983
                 \\
                 The standard model: Geneva, September 2003 \\
                 Quantum reality: Hidden variable: Princeton, Spring
                 1951 \\
                 Bertlmann's socks: Boston, September 1964 \\
                 The Aspect experiments: Paris, September 1982 \\
                 The quantum eraser: Baltimore, January 1999 \\
                 Lab cats: Stony Brook/Delft, July 2000 \\
                 The persistent illusion: Vienna, December 2006 \\
                 Quantum cosmology: The wavefunction of the universe:
                 Princeton, July 1966 \\
                 Hawking radiation: Oxford, February 1974 \\
                 The first superstring revolution: Aspen, August 1984
                 \\
                 Quanta of space and time: Santa Barbara, February 1986
                 \\
                 Crisis? What crisis?: Durham, Summer 1994 \\
                 A quantum of solace?: Geneva, March 2010",
}

@Book{Baggott:2024:QDB,
  author =       "Jim Baggott and John L. Heilbron",
  title =        "Quantum Drama from the {Bohr--Einstein} Debate to the
                 Riddle of Entanglement",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  pages =        "352",
  year =         "2024",
  ISBN =         "0-19-284610-8 (hardcover), 0-19-193849-1,
                 0-19-266125-6 (e-book), 0-19-266125-6 (e-pub),",
  ISBN-13 =      "978-0-19-284610-5 (hardcover), 978-0-19-193849-8,
                 978-0-19-266125-8 (e-book), 978-0-19-266125-8
                 (e-pub),",
  LCCN =         "QC173.98 .B35 2024",
  bibdate =      "Mon Apr 29 11:37:22 MDT 2024",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 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",
  URL =          "https://global.oup.com/academic/product/quantum-drama-9780192846105?",
  acknowledgement = ack-nhfb,
  tableofcontents = "Prologue \\
                 Act I: Correspondence to Complementarity \\
                 1. Mutual Admiration \\
                 2. An Honourable Funeral \\
                 3. New Ways to Calculate \\
                 4. New Ways to Think \\
                 Act II: Uncertainty to Orthodoxy \\
                 5. Incompatible Conceptions \\
                 6. Measurement and Impossibility \\
                 7. EPR, Faust, and the Cat \\
                 8. Missionaries of the Copenhagen Spirit \\
                 Act III: Orthodoxy to Uncertainty \\
                 9. Postwar Hostilities \\
                 10. Skirmishes in Princeton \\
                 11. Juvenile Deviationism \\
                 12. Passing the Torch \\
                 Act IV: Productive Inequalities \\
                 13. The Theorem of John S. Bell \\
                 14. Bell Tests and Protests \\
                 15. While the Photons are Dancing \\
                 16. Adventures in Quantum Information \\
                 17. Where to Cut? Which Way to Go? \\
                 Epilogue \\
                 Acknowledgements \\
                 Figure and Photo Captions/Credits \\
                 Endnotes \\
                 Sources",
}

@InProceedings{Bailey:1992:MPS,
  author =       "David H. Bailey",
  booktitle =    "Proceedings Supercomputing '92",
  title =        "Misleading Performance in the Supercomputing Field",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "155--158",
  year =         "1992",
  ISBN =         "0-8186-2630-5, 0-89791-537-2",
  ISBN-13 =      "978-0-8186-2630-2, 978-0-89791-537-3",
  LCCN =         "QA76.5 S87a 1992",
  bibdate =      "Sat Feb 12 11:55:01 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Bailey:2007:EMA,
  author =       "David H. Bailey and Jonathan M. Borwein and Neil J.
                 Calkin and Roland Girgensohn and D. Russell Luke and
                 Victor Moll",
  title =        "Experimental Mathematics in Action",
  publisher =    pub-A-K-PETERS,
  address =      pub-A-K-PETERS:adr,
  pages =        "xii + 322",
  year =         "2007",
  ISBN =         "1-56881-271-X",
  ISBN-13 =      "978-1-56881-271-7",
  LCCN =         "QA8.7 .E97 2007",
  bibdate =      "Thu Oct 25 18:45:59 MDT 2007",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/borwein-jonathan-m.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://docserver.carma.newcastle.edu.au/1733/",
  acknowledgement = ack-nhfb,
  subject =      "Experimental mathematics",
  tableofcontents = "Preface / xi \\
                 1 A Philosophical Introduction / 1 \\
                 1.1 Introduction / 1 \\
                 1.2 Mathematical Knowledge as We View It / 1 \\
                 1.3 Mathematical Reasoning / 2 \\
                 1.4 Philosophy of Experimental Mathematics / 3 \\
                 1.5 Our Experimental Mathodology / 11 \\
                 1.6 Finding Things versus Proving Things / 15 \\
                 1.7 Conclusions / 24 \\
                 2 Algorithms for Experimental Mathematics I / 29 \\
                 2.1 The Poetry of Computation / 29 \\
                 2.2 High-Precision Arithmetic / 30 \\
                 2.3 Integer Relation Detection / 31 \\
                 2.4 Illustrations and Examples / 33 \\
                 2.5 Definite Integrals and Infinite Series Summations /
                 43 \\
                 2.6 Computation of Multivariate Zeta Values / 44 \\
                 2.7 Ramanujan-Type Elliptic Series / 45 \\
                 3 Algorithms for Experimental Mathematics II / 53 \\
                 3.1 True Scientific Value / 53 \\
                 3.2 Prime Number Computations / 55 \\
                 3.3 Roots of Polynomials / 58 \\
                 3.4 Numerical Quadrature / 61 \\
                 3.5 Infinite Series Summation / 67 \\
                 3.6 Ap{\'e}ry-Like Summations / 70 \\
                 4 Exploration and Discovery in Inverse Scattering / 79
                 \\
                 4.1 Metaphysics and Mechanics / 79 \\
                 4.2 The Physical Experiment / 80 \\
                 4.3 The Model / 83 \\
                 4.4 The Mathematical Experiment: Qualitative Inverse
                 Scattering / 90 \\
                 4.5 Current Research / 107 \\
                 5 Exploring Strange Functions on the Computer / 113 \\
                 5.1 What Is ``Strange''? / 113 \\
                 5.2 Nowhere Differentiable Functions / 114 \\
                 5.3 Bernoulli Convolutions / 126 \\
                 6 Random Vectors and Factoring Integers: A Case Study /
                 139 \\
                 6.1 Learning from Experience / 139 \\
                 6.2 Integer Factorization / 140 \\
                 6.3 Random Models / 143 \\
                 6.4 The Main Questions / 144 \\
                 6.5 Bounds / 145 \\
                 6.6 Which Model Is Best? / 149 \\
                 6.7 Experimental Evidence / 155 \\
                 6.8 Conclusions / 158 \\
                 7 A Selection of Integrals from a Popular Table / 161
                 \\
                 7.1 The Allure of the Integral / 161 \\
                 7.2 The Project and Its Experimental Nature / 163 \\
                 7.3 Families and Individuals / 164 \\
                 7.4 An Experimental Derivation of Wallis' Formula / 167
                 \\
                 7.5 A Hyperbolic Example / 170 \\
                 7.6 A Formula Hidden in the List / 174 \\
                 7.7 Some Experiments on Valuations / 177 \\
                 7.8 An Error in the Latest Edition / 184 \\
                 7.9 Some Examples Involving the Hurwitz Zeta Function /
                 185 \\
                 8 Experimental Mathematics: A Computational Conclusion
                 / 189 \\
                 8.1 Mathematicians Are a Kind of Frenchmen / 189 \\
                 8.2 Putting Lessons in Action / 190 \\
                 8.3 Visual Computing / 191 \\
                 8.4 A Preliminary Example: Visualizing DNA Strands /
                 194 \\
                 8.5 What Is a Chaos Game? / 195 \\
                 8.6 Hilbert's Inequality and Witten's Zeta Function /
                 202 \\
                 8.7 Computational Challenge Problems / 214 \\
                 8.8 Last Words / 222 \\
                 9 Exercises / 225 \\
                 Exercises for Chapter 1 / 225 \\
                 Exercises for Chapter 2 / 231 \\
                 Exercises for Chapter 3 / 249 \\
                 Exercises for Chapter 4 / 256 \\
                 Exercises for Chapter 5 / 260 \\
                 Exercises for Chapter 6 / 262 \\
                 Exercises for Chapter 7 / 265 \\
                 Exercises for Chapter 8 / 273 \\
                 Additional Exercises / 280 \\
                 Bibliography / 301 \\
                 Index / 317",
}

@Article{Bailey:IJSA-5-3-63,
  author =       "D. H. Bailey and E. Barszcz and J. T. Barton and D. S.
                 Browning and R. L. Carter and L. Dagum and R. A.
                 Fatoohi and P. O. Frederickson and T. A. Lasinski and
                 R. S. Schreiber and H. D. Simon and V. Venkatakrishnan
                 and S. K. Weeratunga",
  title =        "The {NAS} Parallel Benchmarks",
  journal =      j-IJSAHPC,
  volume =       "5",
  number =       "3",
  pages =        "63--73",
  month =        "Fall",
  year =         "1991",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Bain:1999:EEB,
  author =       "David Haward Bain",
  title =        "Empire Express: Building the First Transcontinental
                 Railroad",
  publisher =    pub-PENGUIN,
  address =      pub-PENGUIN:adr,
  pages =        "xiii + 797 + 32",
  year =         "1999",
  ISBN =         "0-670-80889-X, 0-14-008499-1",
  ISBN-13 =      "978-0-670-80889-2, 978-0-14-008499-3",
  LCCN =         "HE2751 .B24 1999",
  bibdate =      "Thu May 17 07:24:45 MDT 2018",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://books.google.com/books?isbn=067080889X;
                 http://lcweb.loc.gov/catdir/toc/99033375.html;
                 http://www.booknotes.org/Watch/155004-1/David+Haward+Bain.aspx",
  abstract =     "Chronicles the events that took place in the thirty
                 years it took to complete the first transcontinental
                 railroad, profiling the key players in its development,
                 the major setbacks the workers faced, and the public
                 objections to the railroad's completion.",
  acknowledgement = ack-nhfb,
  subject =      "Railroads; United States; History; Railroads;
                 Spoorwegen; History; Transcontinental railroad (United
                 States); West (U.S.); United States, West",
  tableofcontents = "Part I. 1845--57 \\
                 A procession of dreamers \\
                 ``For all the human family'' \\
                 ``Who can oppose such a work?'' \\
                 ``I must walk toward Oregon'' \\
                 ``The great object for which we were created'' \\
                 ``An uninhabited and dreary waste'' \\
                 Part II. 1860--61 \\
                 Union, disunion, incorporation \\
                 ``Raise the money and I will build your road'' \\
                 ``There comes crazy Judah'' \\
                 ``The marks left by the Donner Party'' \\
                 ``The most difficult country ever conceived'' \\
                 ``We have drawn the elephant'' \\
                 Part III. 1863 \\
                 Last of the dreamers \\
                 ``Speculation is as fatal to it as secession'' \\
                 ``I have had a big row and fight'' \\
                 Part IV. 1864 \\
                 Struggle for momentum \\
                 ``First dictator of the railroad world'' \\
                 ``Dancing with a whirlwind'' \\
                 ``Trustees of the bounty of Congress'' \\
                 Part V. 1865 \\
                 The losses mount \\
                 ``The great cloud darkening the land'' \\
                 ``If we can save our scalps'' \\
                 ``I hardly expect to live to see it completed'' \\
                 Part VI. 1866 \\
                 Eyeing the main chance \\
                 ``Vexation, trouble, and continual hindrance'' \\
                 ``The Napoleon of railways'' \\
                 ``We swarmed the mountains with men'' \\
                 ``Until they are severely punished'' \\
                 Part VII. 1867 \\
                 Hell on wheels \\
                 ``Nitroglycerine tells'' \\
                 ``Our future power and influence'' \\
                 ``They all died in their boots'' \\
                 ``There are only five of us'' \\
                 Part VIII. 1868 \\
                 Going for broke \\
                 ``More hungry men in Congress'' \\
                 ``Bring on your eight thousand men'' \\
                 ``We are in a terrible sweat'' \\
                 ``A man for breakfast every morning'' \\
                 Part IX. 1869 \\
                 Battleground and meeting ground \\
                 ``A resistless power'' \\
                 ``We have got done praying'' \\
                 Part X. 1872--73 \\
                 Scandals, scapegoats, and dodgers \\
                 Epilogue: ``Trial of the innocents.'' \\
                 Notes \\
                 Bibliography \\
                 Index",
}

@Book{Bak:1962:EIM,
  author =       "B{\o}rge Bak",
  title =        "Elementary Introduction to Molecular Spectra",
  publisher =    pub-NORTH-HOLLAND,
  address =      pub-NORTH-HOLLAND:adr,
  edition =      "Second",
  pages =        "xi + 144",
  year =         "1962",
  LCCN =         "QC451 .B2 1962",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Bak:1966:VTG,
  author =       "Thor A. Bak and Jonas Lichtenberg",
  title =        "Vectors, Tensors, and Groups",
  volume =       "1",
  publisher =    pub-BENJAMIN,
  address =      pub-BENJAMIN:adr,
  year =         "1966",
  LCCN =         "QA37 .B35 1967",
  bibdate =      "Wed Dec 15 15:32:13 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Mathematics for Scientists",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Baker:1992:CMF,
  author =       "Louis Baker",
  title =        "{C} Mathematical Function Handbook",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "xviii + 757",
  year =         "1992",
  ISBN =         "0-07-911158-0",
  ISBN-13 =      "978-0-07-911158-6",
  LCCN =         "QA351.B17 1991; QA351 .B17 1992",
  bibdate =      "Fri Aug 31 18:54:02 MDT 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                https://www.math.utah.edu/pub/tex/bib/master.bib;
                 melvyl.cdlib.org:210/CDL90",
  series =       "McGraw-Hill programming tools for scientists and
                 engineers",
  acknowledgement = ack-nhfb,
  remark =       "System requirements for computer disk: PC; C or C++
                 compiler.",
  subject =      "Functions, Special; Computer programs; C (Computer
                 program language)",
  tableofcontents = "Preface / xv \\
                 1. Special Functions and Numerical Analysis / 1 \\
                 \\
                 Correspondence with Abramowitz and Stegun / 1 \\
                 Numerical Analysis / 1 \\
                 The IEEE-754 Standard / 1 \\
                 Practical Considerations / 3 \\
                 Reference / 6 \\
                 \\
                 2. Special Functions in C and C++ / 8 \\
                 C and C++ / 8 \\
                 Portability, ANSI C, and C++ / 8 \\
                 Infinite Loops / 9 \\
                 Header Files COMPLEX.H, CMLIB.H, PROTOM.H / 10 \\
                 Error Handling / 10 \\
                 Pitfalls with Special Functions / 11 \\
                 Normalization Conventions / 12 \\
                 Tips and Pitfalls in C / 12 \\
                 Calling C from C++ / 14 \\
                 References / 15 \\
                 Cmlib.h / 16 \\
                 COMPLEX.H Header File / 17 \\
                 Prototypes for \booktitle{C Mathematical Function
                 Handbook} / 19 \\
                 \\
                 3. Elementary Analytical Methods / 33 \\
                 Powers and Roots / 33 \\
                 Complex Numbers / 34 \\
                 Roots of Polynomials / 35 \\
                 Quadratics / 35 \\
                 Cubics / 35 \\
                 Quartics (biquadratics) / 36 \\
                 Implementation Considerations / 37 \\
                 Ouintics / 38 \\
                 References / 38 \\
                 Complex Variable Auxiliary Routines / 39 \\
                 Powers and Roots / 45 \\
                 Polynomial Root Finders / 48 \\
                 Test Driver for Programs of Chapters 3-4 / 60 \\
                 \\
                 4. Elementary Transcendental Functions / 72 \\
                 Elementary Functions / 72 \\
                 Complex Elementary Functions / 73 \\
                 Gudermannian / 74 \\
                 References / 74 \\
                 \\
                 5. Exponential Integral and Relatives / 75 \\
                 Exponential and Related Integrals / 75 \\
                 Methods / 76 \\
                 References / 76 \\
                 Shi(x) and Chi(x) / 76 \\
                 Exponential Integral / 78 \\
                 Test Driver Results: Exponential Integral and Relatives
                 / 95 \\
                 \\
                 6. Gamma Function and Related Integrals / 100 \\
                 Gamma Function and Relatives / 100 \\
                 The Pochhammer Symbol / 100 \\
                 Methods / 101 \\
                 Asymptotic Series / 101 \\
                 Reference / 101 \\
                 Gamma Function and Relatives / 102 \\
                 Digamma and First 2 Polygamma Functions / 111 \\
                 \\
                 7. Error Function and Relatives / 115 \\
                 Error Function and Relatives / 115 \\
                 Methods / 117 \\
                 Recurrence Relations / 117 \\
                 C Code / 118 \\
                 References / 118 \\
                 Figure: Dawson's Integral / 118 \\
                 Plasma Dispersion Function / 120 \\
                 Iterated Error Function / 127 \\
                 Boehmer (generalized Fresnel) Integral / 129 \\
                 Complementary Error Function for Complex Arguments /
                 133 \\
                 Test Driver Chapter 7 / 134 \\
                 \\
                 8. Legendre Functions / 142 \\
                 Legendre Functions / 142 \\
                 Derivatives / 143 \\
                 Applications / 143 \\
                 Methods / 144 \\
                 References / 144 \\
                 Legendre and Associated Legendre Functions / 146 \\
                 Legendre Functions for $|x| > 1$ / 155 \\
                 Toroidal $P|x| > 1$ / 163 \\
                 Mehler (Conical Legendre) Functions / 164 \\
                 Test Driver for Legendre Functions of Chapter 8 / 166
                 \\
                 \\
                 9. Bessel Functions / 177 \\
                 Struve Functions / 178 \\
                 Anger and Weber Functions / 179 \\
                 Relationship to Confluent Hypergeometric Function / 179
                 \\
                 Derivatives / 179 \\
                 Other Related Functions / 179 \\
                 Zeros of Bessel Functions / 180 \\
                 Applications / 180 \\
                 Methods / 180 \\
                 References / 181 \\
                 Bessel Functions for Complex Arguments / 182 \\
                 Bessel Functions: Rational Approximations / 194 \\
                 Bessel Function Tables as a Function of (Integral) n /
                 201 \\
                 Zeros of Bessel Functions / 205 \\
                 Test Driver for Bessel Functions / 211 \\
                 Test Driver Bessel Zero / 220 \\
                 Output of Bessel Function Test Driver / 221 \\
                 Output of Test Driver for Zerobess() / 237 \\
                 \\
                 10. Bessel Functions of Fractional Order / 239 \\
                 Introduction / 239 \\
                 Spherical Bessel Functions / 239 \\
                 Airy Functions / 239 \\
                 Applications / 240 \\
                 Asymptotics / 240 \\
                 Caustics / 240 \\
                 Schroedinger's Equation, Turning Points and the WKB
                 Method / 242 \\
                 Methods / 243 \\
                 The $|A|$ Function / 243 \\
                 References / 244 \\
                 Spherical Bessel Functions and Allied Routines / 245
                 \\
                 Airy, Bessel Functions and Integrals Thereof / 250 \\
                 \\
                 11. Integrals of Bessel Functions / 265 \\
                 Introduction / 265 \\
                 Applications / 265 \\
                 Methods / 265 \\
                 Bickley Functions / 265 \\
                 Adaptive Quadrature / 266 \\
                 Repeated Integrals of Jn / 266 \\
                 Other Integrals / 266 \\
                 References / 266 \\
                 Figures of Integrals of Bessel Functions / 267 \\
                 Integrals of Bessel Functions / 277 \\
                 Adaptive Integration Routine / 242 \\
                 \\
                 12. Struve and Anger--Weber Functions / 284 \\
                 Introduction / 284 \\
                 Struve Functions / 284 \\
                 Anger--Weber Functions / 284 \\
                 Methods / 285 \\
                 References / 285 \\
                 Figures / 286 \\
                 Struve Functions General Order / 289 \\
                 Struve Functions Lowest Order / 291 \\
                 Integrals of Struve HO, HO/t, LO / 295 \\
                 Integral of Anger--Weber Function / 297 \\
                 \\
                 13. Confluent Hypergeometric Functions and Relatives /
                 301 \\
                 Introduction / 301 \\
                 Airy Functions / 303 \\
                 Applications / 303 \\
                 Methods / 304 \\
                 References / 304 \\
                 Confluent Hypergeometric Function Complex Arguments /
                 305 \\
                 Test Drive Confluent Hypergeometric Function / 318 \\
                 Confluent Hypergeometric Function U / 322 \\
                 Test Driver U.c / 331 \\
                 Test Output: Confluent-Hypergeometric Function / 332
                 \\
                 Test Output: U / 334 \\
                 \\
                 14. Coulomb Wave Functions / 335 \\
                 Introduction / 335 \\
                 Methods / 336 \\
                 References / 337 \\
                 Coulomb Wave Functions / 339 \\
                 Test Driver Coulomb Wave Functions / 343 \\
                 Test Output: Coulomb wave Functions / 344 \\
                 \\
                 15. The Hypergeometric Function / 345 \\
                 Introduction / 345 \\
                 Applications / 346 \\
                 Methods / 346 \\
                 References / 346 \\
                 Hypergeometric Function Complex Arguments / 347 \\
                 Legendre Function $P$ for Complex Parameters / 364 \\
                 Legendre $Q$ for Complex Arguments / 366 \\
                 Test Driver $_2F_1$ / 369 \\
                 Output: Gauss Hypergeometric Functions / 370 \\
                 Real Hypergeometric Function and Relatives / 371 \\
                 \\
                 16. The Elliptic Functions / 373 \\
                 Introduction / 373 \\
                 Applications / 376 \\
                 Methods / 376 \\
                 References / 377 \\
                 Figure / 378 \\
                 Basic Elliptic Functions Real Arguments / 380 \\
                 Elliptic Integral of Third Kind / 391 \\
                 Jacobian Elliptic Function Complex Argument / 397 \\
                 Complex Elliptic Theta Functions / 406 \\
                 Output: Test Driver for Elliptic Functions / 411 \\
                 \\
                 17. The Elliptic Integrals / 416 \\
                 Introduction / 415 \\
                 Caveat / 416 \\
                 References / 417 \\
                 Figures / 417 \\
                 \\
                 18. The Weierstrass Elliptic Function and Relatives /
                 425 \\
                 Introduction / 425 \\
                 Methods / 427 \\
                 References / 427 \\
                 Inverse of Weierstrass Elliptic P . / 428 \\
                 Brent Root Finder / 430 \\
                 \\
                 19. The Parabolic Cylinder Functions / 432 \\
                 Introduction / 432 \\
                 Methods / 432 \\
                 Figures / 432 \\
                 Parabolic Cylinder Functions / 435 \\
                 Test Driver Parabolic Cylinder Function / 442 \\
                 \\
                 20. The Mathieu Functions / 444 \\
                 Introduction / 444 \\
                 Method / 443 \\
                 References / 445 \\
                 Figures / 445 \\
                 Mathieu Functions / 449 \\
                 Mathieu Functions Test Driver / 465 \\
                 Test Output: Mathieu Functions / 467 \\
                 \\
                 21. The Spheroidal Wave Functions / 475 \\
                 Introduction / 475 \\
                 Spheroidal Wave Functions / 475 \\
                 Generalized Spheroidal Wave Functions / 477 \\
                 Caveat / 477 \\
                 Method / 477 \\
                 References / 478 \\
                 Figures / 478 \\
                 Spheroidal Wave Functions / 486 \\
                 Legptable Pn,m for n = m to ntop / 500 \\
                 Test Driver Spheroidal Wave Functions / 501 \\
                 Test Output: Spheroidal Wave Functions / 504 \\
                 \\
                 22. Orthogonal Polynomials / 509 \\
                 Introduction / 509 \\
                 Contents / 509 \\
                 Applications / 509 \\
                 Method / 509 \\
                 Orthogonal Polynomials / 510 \\
                 Test Driver Orthogonal Polynomials / 513 \\
                 \\
                 23. Bernoulli and Euler Numbers and Polynomials,
                 Riemann Zeta Function / 516 \\
                 Introduction / 516 \\
                 Riemann Zeta Function / 516 \\
                 Bernoulli Polynomials and Numbers / 517 \\
                 Euler Polynomials and Numbers / 517 \\
                 Methods / 517 \\
                 References / 517 \\
                 Riemann Zeta (real arguments) / 519 \\
                 Test Driver Riemann Zeta (Real) / 527 \\
                 Test Output: Riemann Zeta, Bernoulli, Euler Numbers /
                 324 \\
                 \\
                 24. Combinatorics. Stirling Numbers / 529 \\
                 Introduction / 529 \\
                 Methods / 529 \\
                 References / 529 \\
                 Stirling Numbers First and Second Kind / 530 \\
                 Fibonacci Numbers / 531 \\
                 Binomial Coefficients / 532 \\
                 Test Driver for Stirling Numbers / 533 \\
                 Test Output: Stirling, Fibonacci, Binomial Coefficients
                 / 534 \\
                 \\
                 25. Numerical Analysis / 535 \\
                 Discussion / 535 \\
                 Reference / 536 \\
                 \\
                 26. Statistical Functions, Probability Distributions,
                 and Random Variables / 537 \\
                 Introduction / 537 \\
                 Methods / 537 \\
                 References / 537 \\
                 Random Numbers / 538 \\
                 Random Distributions / 544 \\
                 Test Driver for Random Number / 551 \\
                 Test Output: Random Numbers and Distributions / 560 \\
                 Calculator Version of Stat.c Routines / 565 \\
                 \\
                 27. Miscellaneous Functions / 592 \\
                 Introduction / 592 \\
                 Debye Functions / 592 \\
                 Method / 593 \\
                 Sievert / 593 \\
                 Method / 593 \\
                 Abramowitz and Kruse--Ramsey / 593 \\
                 Method / 593 \\
                 Ritchie / 593 \\
                 Method / 593 \\
                 Dilogarithm and Polylogarithms / 593 \\
                 Method / 594 \\
                 Claussen / 594 \\
                 Method / 594 \\
                 Lobachevsky / 594 \\
                 Method / 594 \\
                 Clebsch--Gordon and Relatives / 594 \\
                 Method / 595 \\
                 v and Relatives / 595 \\
                 Method / 596 \\
                 References / 596 \\
                 Figures / 595 \\
                 Sievert Integral Chapter 27 / 605 \\
                 Dilogarithm / 606 \\
                 Polylogarithm Function / 607 \\
                 ``Abramowitz'' Functions f1, f2, f3 from Chapter 27 /
                 608 \\
                 Nu and Mu Integrals of Erdelyi Vol III p. 217 / 612 \\
                 Lobachevsky Function / 614 \\
                 Test Driver Miscellaneous Functions / 616 \\
                 Test Driver Ritchie's Integral / 619 \\
                 Test Output: Miscellaneous Functions / 620 \\
                 Test Output: Ritchie's Integral / 624 \\
                 Clebsch--Gordon, Wigner, Related Coefficients / 625 \\
                 Test Driver Wigner / 631 \\
                 Wigner Sample Output / 635 \\
                 \\
                 28. Scales of Notation / 636 \\
                 \\
                 29. C++ Programs / 637 \\
                 Hurwitz Zeta and Lerch Phi Transcendent / 638 \\
                 Methods / 638 \\
                 Meijer $G$ and Generalized Hypergeometric Functions /
                 638 \\
                 Methods / 639 \\
                 Elliptic Functions / 639 \\
                 Applications / 639 \\
                 Methods / 639 \\
                 Fock Functions / 640 \\
                 Methods / 541 \\
                 References / 641 \\
                 // Complex.hpp / 643 \\
                 Elliptic Functions / 646 \\
                 Arithmetic--Geometric Mean (AGM) Supplemental / 656 \\
                 Test Driver for: Elliptic Functions / 662 \\
                 // Cvector.hpp / 665 \\
                 // cmatrix.hpp / 666 \\
                 Test Output: Elliptic Functions / 667 \\
                 Complex C++ Utilities / 669 \\
                 Fock Functions / 674 \\
                 Test Output: Fock Functions / 682 \\
                 ``Abramowitz'' Functions f1, f2, f3 from Chapter 27 /
                 697 \\
                 Test Output: Abramowitz Functions, Complex Arguments /
                 701 \\
                 Riemann and Hurwitz / 712 \\
                 Riemann and Hurwitz: Pad{\'e} / 716 \\
                 Lerch Phi Transcendent / 720 \\
                 Generalized Hypergeometric Function and Meijer $G$ /
                 723 \\
                 Test Output: Meijer $G$ / 730 \\
                 Generalized Hypergeometric Function and Meijer $G$ /
                 731 \\
                 Test Output: Meijer $G$ with Pad{\'e} / 738 \\
                 MacRobert E Function / 739 \\
                 \\
                 30. Xref / 740 \\
                 Other Listings / 741 \\
                 Adaptive Quadrature (from C loops) / 741 \\
                 Test Driver Chaps. 16--18 / 743 \\
                 Index to C Functions / 747 \\
                 Index / 753",
}

@Book{Balbaert:2015:RE,
  author =       "Ivo Balbaert",
  title =        "{Rust} Essentials",
  publisher =    pub-PACKT,
  address =      pub-PACKT:adr,
  pages =        "x + 161",
  year =         "2015",
  ISBN =         "1-78528-213-1",
  ISBN-13 =      "978-1-78528-213-3, 978-1-78528-576-9",
  LCCN =         "QA76.73.R87 B35 2015",
  bibdate =      "Tue Dec 10 05:44:53 MST 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://proquest.safaribooksonline.com/9781785285769",
  abstract =     "Discover how to use Rust to write fast, secure, and
                 concurrent systems and applications In Detail Starting
                 by comparing Rust with other programming languages,
                 this book will show you where and how to use Rust. It
                 will discuss primitive types along with variables and
                 their scope, binding and casting, simple functions, and
                 ways to control execution flow in a program. Next, the
                 book covers flexible arrays, vectors, tuples, enums,
                 and structs. You will then generalize the code with
                 higher-order functions and generics applying it to
                 closures, iterators, consumers, and so on. Memory
                 safety is ensured by the compiler by using references,
                 pointers, boxes, reference counting, and atomic
                 reference counting. You will learn how to build macros
                 and crates and discover concurrency for multicore
                 execution. By the end of this book, you will have
                 successfully migrated to using Rust and will be able to
                 use it as your main programming language. What You Will
                 Learn Set up your Rust environment for maximum
                 productivity Bridge the performance gap between safe
                 and unsafe languages with Rust Use pattern matching to
                 create flexible code Apply generics and traits to
                 develop widely applicable code Organize your code in
                 modules and crates Build macros to extend Rust's
                 capabilities and reach Apply threads to tackle problems
                 concurrently and in distributed environments Interface
                 with C and isolate unsafe code Downloading the example
                 code for this book. You can download the example code
                 files for all Packt books you have purchased from your
                 account at http://www.PacktPub.com. If you purchased
                 this book elsewhere, you can visit
                 http://www.PacktPub.com/support and register to have
                 the files e-mailed directly to you.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "C (Computer program language); Software engineering; C
                 (Computer program language); Software engineering",
  tableofcontents = "Preface \\
                 1: Starting with Rust \\
                 The advantages of Rust \\
                 The trifecta of Rust \\
                 safety, speed, and concurrency \\
                 Comparison with other languages \\
                 Using Rust \\
                 Servo \\
                 Installing Rust \\
                 The Rust compiler \\
                 rustc \\
                 Our first program \\
                 Working with Cargo \\
                 Developer tools \\
                 Using Sublime Text \\
                 Other tools \\
                 Summary \\
                 2: Using Variables and Types \\
                 Comments \\
                 Global constants \\
                 Printing with string interpolation \\
                 Values and primitive types \\
                 Consulting Rust documentation \\
                 Binding variables to values \\
                 Mutable and immutable variables \\
                 Scope of a variable and shadowing \\
                 Type checking and conversions \\
                 Aliasing \\
                 Expressions \\
                 The stack and the heap \\
                 Summary \\
                 3: Using Functions and Control Structures \\
                 Branching on a condition \\
                 Looping \\
                 Functions \\
                 Documenting a function \\
                 Attributes \\
                 Conditional compilation \\
                 Testing \\
                 Testing with cargo \\
                 Summary \\
                 4: Structuring Data and Matching Patterns \\
                 Strings \\
                 Arrays, vectors, and slices \\
                 Vectors \\
                 Slices \\
                 Strings and arrays \\
                 Tuples \\
                 Structs \\
                 Enums \\
                 Result and Option \\
                 Getting input from the console \\
                 Matching patterns 7: Organizing Code and Macros \\
                 Modules and crates \\
                 Building crates \\
                 Defining a module \\
                 Visibility of items \\
                 Importing modules and file hierarchy \\
                 Importing external crates \\
                 Exporting a public interface \\
                 Adding external crates to a project \\
                 The test module \\
                 Macros \\
                 Why do we use macros? \\
                 Developing macros \\
                 Repetition \\
                 Creating a new function \\
                 Using macros from crates \\
                 Summary \\
                 8: Concurrency and Parallelism \\
                 Concurrency and threads \\
                 Creating threads \\
                 Starting a number of threads \\
                 Panicking threads \\
                 Thread-safety \\
                 Shared mutable state \\
                 The Sync trait \\
                 Communication through channels \\
                 Sending and receiving data \\
                 Synchronous and asynchronous communication \\
                 Summary \\
                 9: Programming at the Boundaries \\
                 Program arguments \\
                 Unsafe \\
                 Raw pointers \\
                 Interfacing with C \\
                 Using a C library \\
                 Inlining assembly code \\
                 Calling Rust from other languages \\
                 Summary \\
                 Appendix: Exploring Further \\
                 Stability of Rust and the standard library \\
                 The ecosystem of crates \\
                 Other resources for learning Rust \\
                 Files and databases \\
                 Graphics and games \\
                 Web development \\
                 Index",
}

@Book{Baldwin:2015:MNH,
  author =       "Melinda Baldwin",
  title =        "Making {{\booktitle{Nature}}}: the History of a
                 Scientific Journal",
  publisher =    pub-U-CHICAGO,
  address =      pub-U-CHICAGO:adr,
  pages =        "309",
  year =         "2015",
  ISBN =         "0-226-26145-X (hardcover), 0-226-26159-X (e-book)",
  ISBN-13 =      "978-0-226-26145-4 (hardcover), 978-0-226-26159-1
                 (e-book)",
  LCCN =         "Q1.N23 B35 2015",
  bibdate =      "Thu Oct 31 12:19:53 MDT 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/r/rutherford-ernest.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "\booktitle{Making `Nature'} is the first book to
                 chronicle the foundation and development of
                 \booktitle{Nature}, one of the world's most influential
                 scientific institutions. Now nearing its hundred and
                 fiftieth year of publication, \booktitle{Nature} is the
                 international benchmark for scientific publication. Its
                 contributors include Charles Darwin, Ernest Rutherford,
                 and Stephen Hawking, and it has published many of the
                 most important discoveries in the history of science,
                 including articles on the structure of DNA, the
                 discovery of the neutron, the first cloning of a
                 mammal, and the human genome. But how did
                 \booktitle{Nature} become such an essential
                 institution? In \booktitle{Making Nature}, Melinda
                 Baldwin charts the rich history of this extraordinary
                 publication from its foundation in 1869 to current
                 debates about online publishing and open access. This
                 pioneering study not only tells \booktitle{Nature}'s
                 story but also sheds light on much larger questions
                 about the history of science publishing, changes in
                 scientific communication, and shifting notions of
                 'scientific community.' \booktitle{Nature}, as Baldwin
                 demonstrates, helped define what science is and what it
                 means to be a scientist.",
  acknowledgement = ack-nhfb,
  remark =       "It was Ernest Rutherford's use of letters to the
                 journal \booktitle{Nature} that led to its growth as a
                 premier venue for announcement of new scientific
                 results. See \cite[pages 30--33]{Baldwin:2021:ERA}",
  subject =      "Nature (London, England); Nature (London, England);
                 Science; Periodicals; History; Science publishing;
                 Periodicals; Science publishing; Entwicklung;
                 Naturwissenschaften; Wissenschaftliche Zeitschrift",
  tableofcontents = "Citations and Abbreviations / vii \\
                 Introduction: Who is a ``Scientist''? / 4 \\
                 1: \booktitle{Nature}'s shifting audience: 1869--1875 /
                 21 \\
                 2: \booktitle{Nature}'s contributors and the changing
                 of Britain's scientific guard: 1872--1895 / 48 \\
                 3: Defining the ``man of science'' in
                 \booktitle{Nature} / 74 \\
                 4: Scientific internationalism and scientific
                 nationalism / 100 \\
                 5: \booktitle{Nature}, interwar politics, and
                 intellectual freedom / 123 \\
                 6: ``It almost came out on its own'':
                 \booktitle{Nature} under L. J. F. Brimble and A. J. V.
                 Gale / 145 \\
                 7: \booktitle{Nature}, the Cold War, and the rise of
                 the United States / 170 \\
                 8: ``Disorderly publication'': \booktitle{Nature} and
                 scientific self-policing in the 1980s / 200 \\
                 Conclusion / 228 \\
                 Acknowledgments / 243 \\
                 Notes / 247 \\
                 Bibliography / 285 \\
                 Index / 301",
}

@Book{Ball:1997:MMN,
  author =       "Philip Ball",
  title =        "Made to Measure: New Materials for the {21st
                 Century}",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "vii + 458",
  year =         "1997",
  ISBN =         "0-691-02733-1",
  ISBN-13 =      "978-0-691-02733-3",
  LCCN =         "TA403.B2247 1997",
  bibdate =      "Wed Nov 26 05:45:47 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "This text describes how scientists are inventing
                 thousands of materials, ranging from synthetic skin,
                 blood and bone, to substances that repair themselves
                 and adapt to their environment, that swell and flex
                 like muscles, that repel any ink and paint, and that
                 capture and store the energy from the Sun. It shows
                 that this is being accomplished because materials are
                 being designed for particular applications, rather than
                 being discovered in nature or by haphazard
                 experimentation. Linking insights from chemistry,
                 biology and physics, with those from engineering, the
                 book outlines the various areas in which newly-invented
                 materials will transform our lives in the 21st century.
                 The chapters provide vignettes from a broad range of
                 selected areas of materials science and can be read as
                 separate essays. The subjects include: photonic
                 materials; materials for information storage; smart
                 materials; biomaterials; biomedical materials;
                 materials for clean energy; porous materials; diamond
                 and hard materials; polymers; and surfaces and
                 interfaces. This text describes how scientists are
                 inventing thousands of materials, ranging from
                 synthetic skin, blood and bone, to substances that
                 repair themselves and adapt to their environment. It
                 outlines how newly-invented materials will transform
                 our lives in the 21st century.",
  acknowledgement = ack-nhfb,
  tableofcontents = "The art of making \\
                 Light talk: photonic materials \\
                 Total recall: materials for information storage \\
                 Clever stuff: smart materials \\
                 Only natural: biomaterials \\
                 Spare parts: biomedical materials \\
                 Full power: materials for clean energy \\
                 Tunnel vision: porous materials \\
                 Hard work: diamond and hard materials \\
                 Chain reactions: the new polymers \\
                 Face value: surfaces and interfaces",
}

@Book{Ball:2014:SRS,
  author =       "Philip Ball",
  title =        "Serving the {Reich}: the struggle for the soul of
                 physics under {Hitler}",
  publisher =    pub-U-CHICAGO,
  address =      pub-U-CHICAGO:adr,
  pages =        "ix + 303",
  year =         "2014",
  ISBN =         "0-226-20457-X (hardcover), 0-226-20460-X (e-book)",
  ISBN-13 =      "978-0-226-20457-4 (hardcover), 978-0-226-20460-4
                 (e-book)",
  LCCN =         "QC773.3.G3 B35 2014",
  bibdate =      "Thu Jan 8 08:07:26 MST 2015",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/h/heisenberg-werner.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  author-dates = "1962--",
  subject =      "National socialism and science; Nuclear physics;
                 Germany; History; 20th century; World War, 1939--1945;
                 Science; Moral and ethical aspects; 1933--1945; Planck,
                 Max; Debye, Peter J. W (Peter Josef William);
                 Heisenberg, Werner",
  subject-dates = "1858--1947; 1884--1966; 1901--1976",
  tableofcontents = "Introduction: Nobel Prize-winner with dirty hands
                 \\
                 As conservatively as possible \\
                 Physics must be rebuilt \\
                 The beginning of something new \\
                 Intellectual freedom is a thing of the past \\
                 Service to science must be service to the nation \\
                 There is very likely a Nordic science \\
                 You obviously cannot swim against the tide \\
                 ``I have seen my death!'' \\
                 As a scientist or as a man \\
                 Hitherto unknown destructive power \\
                 Heisenberg was mostly silent \\
                 We are what we pretend to be \\
                 Epilogue: We did not speak the same language",
}

@Book{Ball:2018:WIG,
  author =       "Thorsten Ball",
  title =        "Writing an Interpreter in {Go}: version 1.6",
  publisher =    "Thorsten Ball",
  address =      "????",
  pages =        "263",
  year =         "2018",
  ISBN =         "3-9820161-1-8 (paperback)",
  ISBN-13 =      "978-3-9820161-1-5 (paperback)",
  LCCN =         "QA76.76.C65 .B35 2018",
  bibdate =      "Mon Sep 20 07:33:32 MDT 2021",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/go.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "In this book we will create a programming language
                 together. We'll start with 0 lines of code and end up
                 with a fully working interpreter for the Monkey
                 programming language. Step by step. From tokens to
                 output. All code shown and included. Fully tested.",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "Introduction \\
                 Lexing \\
                 Parsing \\
                 Evaluation \\
                 Extending the interpreter \\
                 Going further",
  subject =      "Interpreters (Computer programs); Study and teaching;
                 Programming languages (Electronic computers); Computer
                 programs; Computer software; Computer programs;
                 Computer software; Study and teaching",
  tableofcontents = "Acknowledgments / 5 \\
                 Introduction / 6 \\
                 The Monkey Programming Language \& Interpreter / 8 \\
                 Why Go? / 10 \\
                 How to Use this Book / 11 \\
                 1 Lexing / 13 \\
                 1.1 Lexical Analysis / 13 \\
                 1.2 Defining Our Tokens / 15 \\
                 1.3 The Lexer / 17 \\
                 1.4 Extending our Token Set and Lexer / 27 \\
                 1.5 Start of a REPL / 33 \\
                 2 Parsing / 36 \\
                 2.1 Parsers / 36 \\
                 2.2 Why not a parser generator? / 39 \\
                 2.3 Writing a Parser for the Monkey Programming
                 Language / 41 \\
                 2.4 Parser's first steps: parsing let statements / 41
                 \\
                 2.5 Parsing Return Statements / 56 \\
                 2.6 Parsing Expressions / 59 \\
                 Expressions in Monkey / 60 \\
                 Top Down Operator Precedence (or Pratt Parsing) / 61
                 \\
                 Terminology / 62 \\
                 Preparing the AST / 63 \\
                 Implementing the Pratt Parser / 67 \\
                 Identifiers / 68 \\
                 Integer Literals / 72 \\
                 Prefix Operators / 75 \\
                 Infix Operators / 81 \\
                 2.7 How Pratt Parsing Works / 88 \\
                 2.8 Extending the Parser / 99 \\
                 Boolean Literals / 101 \\
                 Grouped Expressions / 105 \\
                 If Expressions / 107 \\
                 Function Literals / 113 \\
                 Call Expressions / 119 \\
                 Removing TODOs / 124 \\
                 2.9 Read-Parse-Print-Loop / 126 \\
                 3 Evaluation / 130 \\
                 3.1 Giving Meaning to Symbols / 130 \\
                 3.2 Strategies of Evaluation / 131 \\
                 3.3 A Tree-Walking Interpreter / 133 \\
                 3.4 Representing Objects / 135 \\
                 Foundation of our Object System / 136 \\
                 Integers / 137 \\
                 Booleans / 138 \\
                 Null / 138 \\
                 3.5 Evaluating Expressions / 139 \\
                 Integer Literals / 140 \\
                 15 Completing the REPL / 143 \\
                 Boolean Literals / 145 \\
                 Null / 147 \\
                 Prefix Expressions / 147 \\
                 Infix Expressions / 151 \\
                 3.6 Conditionals / 157 \\
                 3.7 Return Statements / 161 \\
                 3.8 Abort! Abort! There's been a mistake!, or: Error
                 Handling / 165 \\
                 3.9 Bindings \& The Environment / 172 \\
                 3.10 Functions \& Function Calls / 177 \\
                 3.11 Who's taking the trash out? / 189 \\
                 4 Extending the Interpreter / 192 \\
                 4.1 Data Types \& Functions / 192 \\
                 4.2 Strings / 193 \\
                 Supporting Strings in our Lexer / 193 \\
                 Parsing Strings / 196 \\
                 Evaluating Strings / 197 \\
                 String Concatenation / 199 \\
                 4.3 Built-in Functions / 201 \\
                 len / 202 \\
                 4.4 Array / 207 \\
                 Supporting Arrays in our Lexer / 208 \\
                 Parsing Array Literals / 210 \\
                 Parsing Index Operator Expressions / 213 \\
                 Evaluating Array Literals / 217 \\
                 Evaluating Index Operator Expressions / 219 \\
                 Adding Built-in Functions for Arrays / 223 \\
                 Test-Driving Arrays / 227 \\
                 4.5 Hashes / 228 \\
                 Lexing Hash Literals / 229 \\
                 Parsing Hash Literals / 231 \\
                 Hashing Objects / 236 \\
                 Evaluating Hash Literals / 242 \\
                 Evaluating Index Expressions With Hashes / 245 \\
                 4.6 The Grand Finale / 249 \\
                 Going Further / 252 \\
                 The Lost Chapter / 252 \\
                 Writing A Compiler In Go / 253 \\
                 Resources / 254 \\
                 Feedback / 257 \\
                 Changelog / 285",
}

@Book{Ball:2019:WCG,
  author =       "Thorsten Ball",
  title =        "Writing a compiler in {Go}",
  publisher =    "Thorsten Ball",
  address =      "Aschaffenburg, Germany",
  edition =      "Version 1.1.",
  pages =        "351",
  year =         "2019",
  ISBN =         "3-9820161-0-X",
  ISBN-13 =      "978-3-9820161-0-8",
  LCCN =         "QA76.73.G63 B348 2019",
  bibdate =      "Mon Sep 20 07:28:07 MDT 2021",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/go.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "This is the sequel to \booktitle{Writing An
                 Interpreter In Go}. We're picking up right where we
                 left off and write a compiler and a virtual machine for
                 Monkey. Runnable and tested code front and center,
                 built from the ground up, step by step --- just like
                 before. But this time, we're going to define bytecode,
                 compile Monkey and execute it in our very own virtual
                 machine. It's the next step in Monkey's evolution.",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "Compilers and virtual machines \\
                 Hello bytecode! \\
                 Compiling expressions \\
                 Conditionals \\
                 Keeping track of names \\
                 String, array and hash \\
                 Functions \\
                 Built-in functions \\
                 Closures \\
                 Taking time",
  subject =      "Go (Computer program language); Compilers (Computer
                 programs); Computer programming; Compilers (Computer
                 programs); Computer programming; Go (Computer program
                 language)",
  tableofcontents = "Acknowledgments / 5 \\
                 Introduction / 6 \\
                 Evolving Monkey / 7 \\
                 The Past and Present / 7 \\
                 The Future / 11 \\
                 Use This Book / 11 \\
                 1 Compilers \& Virtual Machines / 13 \\
                 Compilers / 14 \\
                 Virtual and Real Machines / 18 \\
                 Real Machines / 19 \\
                 What Is a Virtual Machine? / 25 \\
                 Why Build One? / 28 \\
                 Bytecode / 30 \\
                 What We're Going to Do, or: the Duality of VM and
                 Compiler / 33 \\
                 2 Hello Bytecode! / 34 \\
                 First Instructions / 35 \\
                 Starting With Bytes / 36 \\
                 The Smallest Compiler / 42 \\
                 Bytecode, Disassemble! / 48 \\
                 Back to the Task at Hand / 53 \\
                 Powering On the Machine / 56 \\
                 Adding on the Stack / 64 \\
                 Hooking up the REPL / 70 \\
                 3 Compiling Expressions / 73 \\
                 Cleaning Up the Stack / 73 \\
                 Infix Expressions / 78 \\
                 Booleans / 83 \\
                 Comparison Operators / 88 \\
                 Prefix Expressions / 96 \\
                 4 Conditionals / 103 \\
                 Jumps / 106 \\
                 Compiling Conditionals / 109 \\
                 Executing Jumps / 125 \\
                 Welcome Back, Null! / 129 \\
                 5 Keeping Track of Names / 138 \\
                 The Plan / 139 \\
                 Compiling Bindings / 141 \\
                 Introducing: the Symbol Table / 144 \\
                 Using Symbols in the Compiler / 147 \\
                 Adding Globals to the VM / 150 \\
                 6 String, Array and Hash / 156 \\
                 String / 157 \\
                 Array / 162 \\
                 Hash / 168 \\
                 Adding the index operator / 175 \\
                 7 Functions / 182 \\
                 Dipping Our Toes: a Simple Function / 182 \\
                 Representing Functions / 183 \\
                 Opcodes to Execute Functions / 184 \\
                 Compiling Function Literals / 188 \\
                 Compiling Function Calls / 204 \\
                 Functions in the VM / 207 \\
                 A Little Bonus / 219 \\
                 Local Bindings / 220 \\
                 Opcodes for Local Bindings / 221 \\
                 Compiling Locals / 225 \\
                 Implementing Local Bindings in the VM / 239 \\
                 Arguments / 249 \\
                 Compiling Calls With Arguments / 250 \\
                 Resolving References to Arguments / 256 \\
                 Arguments in the VM / 259 \\
                 8 Built-in Functions / 269 \\
                 Making the Change Easy / 270 \\
                 Making the Change: the Plan / 277 \\
                 A New Scope for Built-in Functions / 277 \\
                 Executing built-in functions / 283 \\
                 9 Closures / 290 \\
                 The Problem / 291 \\
                 The Plan / 292 \\
                 Everything's a closure / 294 \\
                 Compiling and resolving free variables / 307 \\
                 Creating real closures at run time / 320 \\
                 Recursive Closures / 325 \\
                 10 Taking Time / 341 \\
                 Resources / 345 \\
                 Feedback / 348 \\
                 Changelog /349",
}

@Book{Ballard:1982:CV,
  author =       "Dana H. Ballard and Christopher M. Brown",
  title =        "Computer Vision",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xx + 523",
  year =         "1982",
  ISBN =         "0-13-165316-4",
  ISBN-13 =      "978-0-13-165316-0",
  LCCN =         "TA1632 .B34 1982",
  bibdate =      "Tue Dec 14 22:40:13 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Ballhausen:1962:ILF,
  author =       "Carl J. Ballhausen",
  title =        "Introduction to Ligand Field Theory",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "ix + 298",
  year =         "1962",
  LCCN =         "QD475 .B3",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Banks:1999:SPR,
  author =       "Robert B. Banks",
  title =        "Slicing Pizzas, Racing Turtles, and Further Adventures
                 in Applied Mathematics",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "xi + 286",
  year =         "1999",
  ISBN =         "0-691-05947-0",
  ISBN-13 =      "978-0-691-05947-1",
  LCCN =         "QA93 .B358 1999",
  bibdate =      "Mon Dec 06 15:45:23 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$24.95",
  abstract =     "The author discloses the mathematics behind a host of
                 problems, including gauging the length of the seam on a
                 baseball, predicting the results of melting polar ice
                 caps, and digging a hole to China.",
  acknowledgement = ack-nhfb,
  tableofcontents = "ch. 1: Broad stripes and bright stars \\
                 2: More stars, honeycombs, and snowflakes \\
                 3: Slicing things like pizzas and watermelons \\
                 4: Raindrops keep falling on my head and other goodies
                 \\
                 5: Raindrops and other goodies revisited \\
                 6: Which major rivers flow uphill \\
                 7: A brief look at $\pi$, $e$, and some other famous
                 numbers \\
                 8: Another look at some famous numbers \\
                 9: Great number sequences: prime, Fibonacci, and
                 hailstone \\
                 10: A fast way to escape \\
                 11: How to get anywhere in about forty-two minutes \\
                 12: How fast should you run in the rain \\
                 13: Great turtle races: pursuit curves \\
                 14: More great turtle races: logarithmic spirals \\
                 15: How many people have ever lived \\
                 16: The great explosion of 2023 \\
                 17: How to make fairly nice valentines \\
                 18: Somewhere over the rainbow \\
                 19: Making mathematical mountains \\
                 20: How to make mountains out of molehills \\
                 21: Moving continents from here to there \\
                 22: Cartography: how to flatten spheres \\
                 23: Growth and spreading and mathematical analogies \\
                 24: How long is the seam on a baseball \\
                 25: Baseball seams, pipe connections, and world travels
                 \\
                 26: Lengths, areas, and volumes of all kinds of
                 shapes",
}

@Book{Bardi:2006:CWN,
  author =       "Jason Socrates Bardi",
  title =        "The Calculus Wars: {Newton}, {Leibniz}, and the
                 Greatest Mathematical Clash of All Time",
  publisher =    "Thunder's Mouth Press",
  address =      "New York, NY, USA",
  pages =        "viii + 277",
  year =         "2006",
  ISBN =         "1-56025-992-2, 1-56025-706-7",
  ISBN-13 =      "978-1-56025-992-3, 978-1-56025-706-6",
  LCCN =         "QA303 .B2896 2006",
  bibdate =      "Mon Aug 20 14:41:36 MDT 2007",
  bibsource =    "carmin.sudoc.abes.fr:210/ABES-Z39-PUBLIC;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Now regarded as the bane of many college students'
                 existence, calculus was one of the most important
                 mathematical innovations of the seventeenth century.
                 But a dispute over its discovery sowed the seeds of
                 discontent between two of the greatest scientific
                 giants of all time --- Sir Isaac Newton and Gottfried
                 Wilhelm Leibniz. Today Newton and Leibniz are generally
                 considered the twin independent inventors of calculus.
                 They are both credited with giving mathematics its
                 greatest push forward since the time of the Greeks. Had
                 they known each other under different circumstances,
                 they might have been friends. But in their own
                 lifetimes, the joint glory of calculus was not enough
                 for either and each declared war against the other,
                 openly and in secret. This long and bitter dispute has
                 been swept under the carpet by historians perhaps
                 because it reveals Newton and Leibniz in their worst
                 light --- but \booktitle{The Calculus Wars} tells the
                 full story in narrative form for the first time. This
                 history ultimately exposes how these twin mathematical
                 giants were brilliant, proud, at times mad, and in the
                 end completely human.",
  acknowledgement = ack-nhfb,
  tableofcontents = "For once it's safe to dream in color, 1704 \\
                 The children of the wars, 1642--1664 \\
                 The trouble with Hooke, 1664--1672 \\
                 The affair of the eyebrow, 1666--1673 \\
                 Farewell and think kindly of me, 1673--1677 \\
                 The beginning of the sublime geometry, 1678--1687 \\
                 The beautiful and the damned, 1687--1691 \\
                 The shortest possible descent, 1690--1696 \\
                 Newton's apes, 1696--1708 \\
                 The burden of proof, 1708--1712 \\
                 The flaws of motion, 1713--1716 \\
                 Purged of ambiguity, 1716--1728",
}

@Book{Barnsley:1988:FE,
  author =       "Michael Barnsley",
  title =        "Fractals Everywhere",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "xii + 394",
  year =         "1988",
  ISBN =         "0-12-079062-9",
  ISBN-13 =      "978-0-12-079062-3",
  LCCN =         "QA614.86 .B37 1988",
  MRclass =      "*58-01, 00A06, 11K55, 37B99, 37C70, 37D45, 37G15,
                 28A80, 54H20",
  bibdate =      "Tue Dec 14 22:40:15 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib;
                 https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  ZMnumber =     "0691.58001",
  abstract =     "This book is based on a course called `Fractal
                 Geometry' which has been taught in the School of
                 Mathematics at Georgia Institute of Technology for two
                 years. \booktitle{Fractals Everywhere} teaches the
                 tools, methods, and theory of deterministic geometry.
                 It is useful for describing specific objects and
                 structures. Models are represented by succinct
                 formulas.' Once the formula is known, the model can be
                 reproduced. we do not consider statistical geometry.
                 The latter aims at discovering general statistical laws
                 which govern families of similar-looking structures,
                 such as all cumulus clouds, all maple leaves, or all
                 mountains. In deterministic geometry, structures are
                 defined, communicated, and analysed, with the aid of
                 elementary transformations such as affine
                 transformations, scalings, rotations, and congruences.
                 A fractal set generally contains infinitely many points
                 whose organization is so complicated that it is not
                 possible to describe the set by specifying directly
                 where each point in it lies. Instead, the set may be
                 define by `the relations between the pieces.' It is
                 rather like describing the solar system by quoting the
                 law of gravitation and stating the initial conditions.
                 Everything follows from that. It appears always to be
                 better to describe in terms of relationships.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Introduction: Applications for Fractal Functions /
                 205 \\
                 Fractal Interpolation Functions / 208 \\
                 The Fractal Dimension of Fractal Interpolation
                 Functions / 223 \\
                 Hidden Variable Fractal Interpolation / 229 \\
                 Space-Filling Curves / 238 \\
                 Julia Sets / 246 \\
                 The Escape Time Algorithm for Computing Pictures of IFS
                 Attractors and Julia Sets / 246 \\
                 Iterated Function Systems Whose Attractors Are Julia
                 Sets / 266 \\
                 The Application of Julia Set Theory to Newton's Method
                 / 276 \\
                 A Rich Source for Fractals: Invariant Sets of
                 Continuous Open Mappings / 287 \\
                 Parameter Spaces and Mandelbrot Sets / 294 \\
                 The Idea of a Parameter Space: A Map of Fractals / 294
                 \\
                 Mandelbrot Sets for Pairs of Transformations / 299 \\
                 The Mandelbrot Set for Julia Sets / 309 \\
                 How to Make Maps of Families of Fractals Using Escape
                 Times / 317 \\
                 Measures on Fractals / 330 \\
                 Introduction to Invariant Measures on Fractals / 330
                 \\
                 Fields and Sigma-Fields / 337 \\
                 Measures / 341 \\
                 Integration / 344 \\
                 The Compact Metric Space (P (X), d) / 349 \\
                 A Contraction Mapping on (P (X)) / 350 \\
                 Elton's Theorem / 364 \\
                 Application to Computer Graphics / 370 \\
                 Recurrent Iterated Function Systems / 379 \\
                 Fractal Systems / 379 \\
                 Recurrent Iterated Function Systems / 383 \\
                 Collage Theorem for Recurrent Iterated Function Systems
                 / 392 \\
                 Fractal Systems with Vectors of Measures as Their
                 Attractors / 403 \\
                 References / 409 \\
                 References / 412 \\
                 Selected Answers / 416 \\
                 Index / 523 \\
                 Credits for Figures and Color Plates / 533",
  xxtableofcontents = "Metric Spaces \\
                 Equivalent Spaces \\
                 Classification of Subsets \\
                 and the Space of Fractals \\
                 Spaces \\
                 Metric Spaces \\
                 Cauchy Sequences, Limit Points, Closed Sets, Perfect
                 Sets, and Complete Metric Spaces \\
                 Compact Sets, Bounded Sets, Open Sets, Interiors, and
                 Boundaries \\
                 Connected Sets, Disconnected Sets, and
                 Pathwise-Connected Sets \\
                 The Metric Space (H (X), h): The Place Where Fractals
                 Live \\
                 The Completeness of the Space of Fractals \\
                 Additional Theorems about Metric Spaces \\
                 Transformations on Metric Spaces \\
                 Contraction Mappings and the Construction of Fractals
                 \\
                 Transformations on the Real Line \\
                 Affine Transformations in the Euclidean Plane \\
                 Mobius Transformations on the Riemann Sphere \\
                 Analytic Transformations \\
                 How to Change Coordinates \\
                 The Contraction Mapping Theorem \\
                 Contraction Mappings on the Space of Fractals \\
                 Two Algorithms for Computing Fractals from Iterated
                 Function Systems \\
                 Condensation Sets \\
                 How to Make Fractal Models with the Help of the Collage
                 Theorem \\
                 Blowing in the Wind: The Continuous Dependence of
                 Fractals on Parameters \\
                 Chaotic Dynamics on Fractals \\
                 The Addresses of Points on Fractals \\
                 Continuous Transformations from Code Space to Fractals
                 \\
                 Introduction to Dynamical Systems \\
                 Dynamics on Fractals: Or How to Compute Orbits by
                 Looking at Pictures \\
                 Equivalent Dynamical Systems \\
                 The Shadow of Deterministic Dynamics \\
                 The Meaningfulness of Inaccurately Computed Orbits is
                 Established by Means of a Shadowing Theorem \\
                 Chaotic Dynamics on Fractals \\
                 Fractal Dimension",
}

@Book{Barroso:2009:DCI,
  author =       "Luiz Andr{\'e} Barroso and Urs H{\"o}lzle",
  title =        "The datacenter as a computer: an introduction to the
                 design of warehouse-scale machines",
  volume =       "6",
  publisher =    "Morgan and Claypool",
  address =      "San Rafael, CA, USA",
  pages =        "xi + 107",
  year =         "2009",
  DOI =          "https://doi.org/10.2200/S00193ED1V01Y200905CAC006",
  ISBN =         "1-59829-556-X (paperback), 1-59829-557-8 (e-book)",
  ISBN-13 =      "978-1-59829-556-6 (paperback), 978-1-59829-557-3
                 (e-book)",
  ISSN =         "1932-3243 (??invalid checksum??)",
  LCCN =         "TK5105.5 .B273 2009",
  bibdate =      "Wed Apr 21 17:03:46 MDT 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 melvyl.cdlib.org:210/CDL90",
  series =       "Synthesis lectures on computer architecture",
  acknowledgement = ack-nhfb,
  subject =      "Web servers; design; multiprocessors; computer
                 organization; high performance computing",
  tableofcontents = "Introduction \\
                 Warehouse-scale computers \\
                 Emphasis on cost efficiency \\
                 Not just a collection of servers \\
                 One datacenter vs. several datacenters \\
                 Why WSCs might matter to you \\
                 Architectural overview of WSCs \\
                 Storage \\
                 Networking fabric \\
                 Storage hierarchy \\
                 Quantifying latency, bandwidth, and capacity \\
                 Power usage \\
                 Handling failures \\
                 Workloads and software infrastructure \\
                 Datacenter vs. desktop \\
                 Performance and availability toolbox \\
                 Cluster-level infrastructure software \\
                 Resource management \\
                 Hardware abstraction and other basic services \\
                 Deployment and maintenance \\
                 Programming frameworks \\
                 Application-level software \\
                 Workload examples \\
                 Online: web search \\
                 Offline: scholar article similarity \\
                 A monitoring infrastructure \\
                 Service-level dashboards \\
                 Performance debugging tools \\
                 Platform-level monitoring \\
                 Buy vs. build \\
                 Further reading \\
                 Hardware building blocks \\
                 Cost-efficient hardware \\
                 How about parallel application performance \\
                 How low-end can you go \\
                 Balanced designs \\
                 Datacenter basics \\
                 Datacenter tier classifications \\
                 Datacenter power systems \\
                 UPS systems \\
                 Power distribution units \\
                 Datacenter cooling systems \\
                 CRAC units \\
                 Free cooling \\
                 Air flow considerations \\
                 In-rack cooling \\
                 Container-based datacenters \\
                 Energy and power efficiency \\
                 Datacenter energy efficiency \\
                 Sources of efficiency losses in datacenters \\
                 Improving the energy efficiency of datacenters \\
                 Measuring the efficiency of computing \\
                 Some useful benchmarks \\
                 Load vs. efficiency \\
                 Energy-proportional computing \\
                 Dynamic power range of energy-proportional machines \\
                 Causes of poor energy proportionality \\
                 How to improve energy proportionality \\
                 Relative effectiveness of low-power modes \\
                 The role of software in energy proportionality \\
                 Datacenter power provisioning \\
                 Deployment and power management strategies \\
                 Advantages of oversubscribing facility power \\
                 Trends in server energy usage \\
                 Conclusions \\
                 Further reading \\
                 Modeling costs \\
                 Capital costs \\
                 Operational costs \\
                 Case studies \\
                 Real-world datacenter costs \\
                 Modeling a partially filled datacenter \\
                 Dealing with failures and repairs \\
                 Implications of software-based fault tolerance \\
                 Categorizing faults \\
                 Fault severity \\
                 Causes of service-level faults \\
                 Machine-level failures \\
                 What causes machine crashes \\
                 Predicting faults \\
                 Repairs \\
                 Tolerating faults, not hiding them \\
                 Closing remarks \\
                 Hardware \\
                 Software \\
                 Economics \\
                 Key challenges \\
                 Rapidly changing workloads \\
                 Building balanced systems from imbalanced components
                 \\
                 Curbing energy usage \\
                 Amdahl's cruel law \\
                 Conclusions \\
                 References.",
}

@Book{Barrow:1979:PC,
  author =       "Gordon M. Barrow",
  title =        "Physical Chemistry",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  edition =      "Fourth",
  pages =        "xvi + 832",
  year =         "1979",
  ISBN =         "0-07-003825-2 (hardcover), 0-07-066170-7 (paperback)",
  ISBN-13 =      "978-0-07-003825-7 (hardcover), 978-0-07-066170-7
                 (paperback)",
  LCCN =         "QD453.2.B37 1979",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Preface \\
                 The Physical Properties of Gases / 1 \\
                 The Molecular Theory of Gases / 48 \\
                 Energy of Chemical Systems: The First Law of
                 Thermodynamics / 100 \\
                 Entropy and the Second and Third Laws of Thermodynamics
                 / 160 \\
                 Free Energy and Chemical Equilibria / 213 \\
                 Solutions / 274 \\
                 Phase Equilibria / 313 \\
                 Electrolytes in Solution / 360 \\
                 Elements of Quantum Mechanics / 427 \\
                 Electronic Structures of Atoms and Diatomic Molecules /
                 476 \\
                 Symmetry and the Electronic States of Molecules / 530
                 \\
                 Spectroscopy / 567 \\
                 Diffraction / 647 \\
                 Electrical and Magnetic Properties / 700 \\
                 Rates and Mechanisms / 726 \\
                 Elementary Reactions / 775 \\
                 Macromolecules / 826 \\
                 Appendix A Mathematics / 863 \\
                 Appendix B Tables of Properties / 873 \\
                 Appendix C Character Tables for a Selection of Point
                 Tables / 891 \\
                 Appendix D SI Units / 895 \\
                 Index / 897",
}

@Book{Barrow:1992:PSC,
  author =       "John D. Barrow",
  title =        "Pi in the Sky: Counting, Thinking, and Being",
  publisher =    pub-CLARENDON,
  address =      pub-CLARENDON:adr,
  pages =        "ix + 317",
  year =         "1992",
  ISBN =         "0-19-853956-8",
  ISBN-13 =      "978-0-19-853956-8",
  LCCN =         "QA36 .B37 1992",
  bibdate =      "Sat Dec 17 14:44:47 MST 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/pi.bib;
                 z3950.loc.gov:7090/Voyager",
  price =        "US\$30.00 (Oxford Univ. Press)",
  abstract =     "John D. Barrow's \booktitle{Pi in the Sky} is a
                 profound --- and profoundly different --- exploration
                 of the world of mathematics: where it comes from, what
                 it is, and where it's going to take us if we follow it
                 to the limit in our search for the ultimate meaning of
                 the universe. Barrow begins by investigating whether
                 math is a purely human invention inspired by our
                 practical needs. Or is it something inherent in nature
                 waiting to be discovered? In answering these questions,
                 Barrow provides a bridge between the usually
                 irreconcilable worlds of mathematics and theology.
                 Along the way, he treats us to a history of counting
                 all over the world, from Egyptian hieroglyphics to
                 logical friction, from number mysticism to Marxist
                 mathematics. And he introduces us to a host of peculiar
                 individuals who have thought some of the deepest and
                 strangest thoughts that human minds have ever thought,
                 from Lao-Tse to Robert Pirsig, Charles Darwin, and
                 Umberto Eco. Barrow thus provides the historical
                 framework and the intellectual tools necessary to an
                 understanding of some of today's weightiest
                 mathematical concepts.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Mathematics",
  tableofcontents = "1: From mystery to history \\
                 A mystery within an enigma \\
                 Illusions of certainty \\
                 The secret society \\
                 Non-Euclideanism \\
                 Logics \\
                 To Be or Not To Be \\
                 The Rashomon effect \\
                 The analogy that never breaks down? \\
                 Tinkling symbols \\
                 Thinking about thinking \\
                 2: The Counter Culture \\
                 By the pricking of my thumbs \\
                 The bare bones of history \\
                 Creation or evolution \\
                 The ordinals versus the cardinals \\
                 Counting without counting \\
                 Fingers and toes \\
                 Baser methods \\
                 Counting with base 2 \\
                 The neo-2 system of counting \\
                 Counting in fives \\
                 What's so special about sixty? \\
                 The spread of the decimal system \\
                 The dance of the seven veils \\
                 Ritual geometry \\
                 The place-value system and the invention of zero \\
                 A final accounting \\
                 3: With form but void \\
                 Numerology \\
                 The very opposite \\
                 Hilbert's scheme \\
                 Kurt G{\"o}del \\
                 More surprises \\
                 Thinking by numbers \\
                 Bourbachique math{\'e}matique \\
                 Arithmetic in chaos \\
                 Science friction \\
                 Mathematicians off form \\
                 4: The mothers of inventionism \\
                 Mind from matter \\
                 Shadowlands \\
                 Trap-door functions \\
                 Mathematical creation \\
                 Marxist mathematics \\
                 Complexity and simplicity \\
                 Maths as psychology \\
                 Pre-established mental harmony? \\
                 Self-discovery \\
                 5: Intuitionism: the immaculate construction \\
                 Mathematicians from outer space \\
                 Ramanujan \\
                 Intuitionism and three-valued logic \\
                 A very peculiar practice \\
                 A closer look at Brouwer \\
                 What is `intuition'? The tragedy of Cantor and
                 Kronecker \\
                 Cantor and infinity \\
                 The comedy of Hilbert and Brouwer \\
                 The Four-Colour Conjecture \\
                 Transhuman mathematics \\
                 New-age mathematics \\
                 Paradigms \\
                 Computability, compressibility, and utility \\
                 6: Platonic heavens above and within \\
                 The growth of abstraction \\
                 Footsteps through Plato's footnotes \\
                 The platonic world of mathematics \\
                 Far away and long ago \\
                 The presence of the past \\
                 The unreasonable effectiveness of mathematics \\
                 Difficulties with platonic relationships \\
                 Seance or science? \\
                 Revel without a cause \\
                 A computer ontological argument \\
                 A speculative anthropic interpretation of mathematics.
                 \\
                 Maths and mysticism \\
                 Supernatural numbers?",
}

@Book{Barrow:1996:PSC,
  author =       "John D. Barrow",
  title =        "Pi in the Sky: Counting, Thinking, and Being",
  publisher =    pub-LITTLE-BROWN,
  address =      pub-LITTLE-BROWN:adr,
  pages =        "ix + 317",
  year =         "1996",
  ISBN =         "0-316-08259-7",
  ISBN-13 =      "978-0-316-08259-4",
  LCCN =         "QA36 .B37 1994",
  bibdate =      "Sat Dec 17 14:44:47 MST 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/pi.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "John D. Barrow's \booktitle{Pi in the Sky} is a
                 profound -- and profoundly different exploration of the
                 world of mathematics: where it comes from, what it is,
                 and where it's going to take us if we follow it to the
                 limit in our search for the ultimate meaning of the
                 universe. Barrow begins by investigating whether math
                 is a purely human invention inspired by our practical
                 needs. Or is it something inherent in nature waiting to
                 be discovered? In answering these questions, Barrow
                 provides a bridge between the usually irreconcilable
                 worlds of mathematics and theology. Along the way, he
                 treats us to a history of counting all over the world,
                 from Egyptian hieroglyphics to logical friction, from
                 number mysticism to Marxist mathematics. And he
                 introduces us to a host of peculiar individuals who
                 have thought some of the deepest and strangest thoughts
                 that human minds have ever thought, from Lao-Tse to
                 Robert Pirsig, Charles Darwin, and Umberto Eco. Barrow
                 thus provides the historical framework and the
                 intellectual tools necessary to an understanding of
                 some of today's weightiest mathematical concepts.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  remark =       "Originally published: Cambridge: Oxford University,
                 1992.",
  subject =      "Mathematics",
  tableofcontents = "1: From mystery to history / 1 \\
                 A mystery within an enigma / 1 \\
                 Illusions of certainty / 2 \\
                 The secret society / 6 \\
                 Non-Euclideanism / 8 \\
                 Logics --- To Be or Not To Be / 15 \\
                 The Rashomon effect / 19 \\
                 The analogy that never breaks down? / 21 \\
                 Tinkling symbols / 23 \\
                 Thinking about thinking / 24 \\
                 2: The counter culture / 26 \\
                 By the pricking of my thumbs / 26 \\
                 The bare bones of history / 28 \\
                 Creation or evolution / 33 \\
                 The ordinals versus the cardinals / 36 \\
                 Counting without counting / 41 \\
                 Fingers and toes / 45 \\
                 Baser methods / 49 \\
                 Counting with base 2 / 51 \\
                 The neo-2 system of counting / 56 \\
                 Counting In fives / 60 \\
                 What's so special about sixty? / 64 \\
                 The spread of the decimal system / 68 \\
                 The dance of the seven veils / 72 \\
                 Ritual geometry / 73 \\
                 The system and the Invention of zero / 81 \\
                 A final accounting / 101 \\
                 3: With form but void / 106 \\
                 Numerology / 106 \\
                 The very opposite / 108 \\
                 Hubert's scheme / 112 \\
                 Kurt G{\"o}del / 117 \\
                 More surprises / 124 \\
                 Thinking by numbers / 127 \\
                 Bourbachique math{\'e}matique / 129 \\
                 Arithmetic in chaos 1 / 34 \\
                 Science friction / 137 \\
                 Mathematics off form / 140 \\
                 4: The mothers of inventionism / 147 \\
                 Mind from matter / 147 \\
                 Shadowlands / 149 \\
                 Trap-door functions / 150 \\
                 Mathematical creation / 154 \\
                 Marxist mathematics / 156 \\
                 Complexity and simplicity / 159 \\
                 Maths as psychology / 165 \\
                 Pre-established mental harmony? / 171 \\
                 Sell-discovery / 176 \\
                 5: Intuitionism: the immaculate construction / 178 \\
                 Mathematicians from outer space / 178 \\
                 Ramanujan / 181 \\
                 Intuitionism and three-valued logic / 185 \\
                 A very peculiar practice / 188 \\
                 A closer look at Brouwer / 192 \\
                 What Is `Intuition'? / 196 \\
                 The tragedy of Cantor and Kronecker / 198 \\
                 Cantor and infinity / 205 \\
                 The comedy of Hubert and Brouwer / 216 \\
                 The Four-Colour Conjecture / 227 \\
                 Transhuman mathematics / 234 \\
                 New-age mathematics / 236 \\
                 Paradigms / 243 \\
                 Computability, compressibility, and utility / 245 \\
                 6: Platonic heavens above and within / 249 \\
                 The growth of abstraction / 249 \\
                 Footsteps through Plato's footnotes / 251 \\
                 The platonic world of mathematics / 258 \\
                 Far away and long ago / 265 \\
                 The presence of the past / 268 \\
                 The unreasonable effectiveness of mathematics / 270 \\
                 Difficulties with platonic relationships / 272 \\
                 Seance or science? / 273 \\
                 Revel without a cause / 276 \\
                 A computer ontological argument / 280 \\
                 A speculative anthropic interpretation of mathematics /
                 284 \\
                 Moths and mysticism / 292 \\
                 Supernatural numbers? / 294 \\
                 further reading / 298 \\
                 Index / 311",
}

@Book{Barrow:1998:ILS,
  author =       "John D. Barrow",
  title =        "Impossibility: the limits of science and the science
                 of limits",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  pages =        "xiii + 279",
  year =         "1998",
  ISBN =         "0-19-851890-0",
  ISBN-13 =      "978-0-19-851890-7",
  LCCN =         "Q175 .B2245 1998",
  bibdate =      "Sat Dec 17 14:44:47 MST 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Science; Philosophy; Limit (Logic); G{\"o}del's
                 theorem",
}

@Book{Barstow:1984:IPE,
  author =       "David R. Barstow and Howard E. Shrobe and Erik
                 Sandewall",
  title =        "Interactive Programming Environments",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "xii + 609",
  year =         "1984",
  ISBN =         "0-07-003885-6",
  ISBN-13 =      "978-0-07-003885-1",
  LCCN =         "QA76.6 .I5251 1984",
  bibdate =      "Tue Dec 14 22:40:18 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$34.95",
  acknowledgement = ack-nhfb,
}

@Book{Bartels:1987:ISU,
  author =       "Richard H. Bartels and John C. Beatty and Brian A.
                 Barsky",
  title =        "An Introduction to Splines for Use in Computer
                 Graphics and Geometric Modeling",
  publisher =    pub-MORGAN-KAUFMANN,
  address =      pub-MORGAN-KAUFMANN:adr,
  pages =        "xiv + 476",
  year =         "1987",
  ISBN =         "0-934613-27-3",
  ISBN-13 =      "978-0-934613-27-9",
  LCCN =         "T385 .B3651 1987",
  bibdate =      "Tue Dec 14 22:40:21 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$38.95",
  acknowledgement = ack-nhfb,
}

@Book{Bartlett:1980:FQC,
  author =       "John Bartlett",
  title =        "Familiar Quotations: a collection of passages,
                 phrases, and proverbs traced to their sources in
                 ancient and modern literature",
  publisher =    pub-LITTLE-BROWN,
  address =      pub-LITTLE-BROWN:adr,
  edition =      "Fifteenth",
  pages =        "lviii + 1540",
  year =         "1980",
  ISBN =         "0-316-08275-9",
  ISBN-13 =      "978-0-316-08275-4",
  LCCN =         "PN6081 .B3 1980",
  bibdate =      "Tue Dec 14 22:40:24 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Chronologically arranged entries supply quotations
                 from 2,250 authors and major collective or anonymous
                 works, with an alphabetical index of authors and an
                 index to the text.",
  acknowledgement = ack-nhfb,
  DEWEY =        "808.88/2",
  idnumber =     "525",
  keywords =     "Quotations, English",
  tableofcontents = "Preface to the Fifteenth edition \\
                 Historical note \\
                 Guide to the use of Familiar Quotations \\
                 Index of authors \\
                 Familiar Quotations, from ancient Egypt and the Bible
                 to the present \\
                 Index",
}

@Book{Bartosh:2005:EMX,
  author =       "Michael Bartosh and Ryan Faas",
  title =        "Essential {Mac OS X Panther} Server Administration",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xxii + 822",
  year =         "2005",
  ISBN =         "0-596-00635-7 (paperback)",
  ISBN-13 =      "978-0-596-00635-8 (paperback)",
  LCCN =         "QA76.76.O63 B38 2005",
  bibdate =      "Thu Oct 6 07:22:51 MDT 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 melvyl.cdlib.org:210/CDL90",
  acknowledgement = ack-nhfb,
  remark =       "Integrating Mac OS X server into heterogeneous
                 networks---Cover.",
  subject =      "Mac OS; Operating systems (Computers); Macintosh
                 (Computer); Web servers",
  tableofcontents = "Part I: Server installation and management \\
                 1: Designing your server environment \\
                 2: Installing and configuring Mac OS X server \\
                 3: Server management tools \\
                 4: System administration \\
                 5: Troubleshooting \\
                 Part II: Directory service \\
                 6: Open directory server \\
                 7: Identification and authorization in open directory
                 server \\
                 8: Authentication in open directory server \\
                 9: Replication in open directory server \\
                 Part III: IP services \\
                 10: Xinetd \\
                 11: DNS \\
                 12: DHCP \\
                 13: NAT \\
                 Part IV: File services \\
                 14: File services overview \\
                 15: Apple filing protocol \\
                 16: Windows file services \\
                 17: FTP \\
                 18: Network file system \\
                 19: Print services \\
                 Part V: Security services \\
                 20: Mac OS X server firewall \\
                 21: Virtual private networks \\
                 Part VI: Internet services \\
                 22: Mail services \\
                 23: Web services \\
                 24: Application servers \\
                 Part VII: Client management \\
                 25: Managing preferences for Mac OS X clients \\
                 26: Managing classic Mac OS workstations using Mac
                 manager \\
                 27: Managing windows clients using Mac OS X server \\
                 28: Workstation deployment and maintenance \\
                 29: Apple remote desktop",
}

@Book{Bartusiak:2006:AUD,
  editor =       "Marcia Bartusiak",
  title =        "Archives of the universe: 100 discoveries that
                 transformed our understanding of the cosmos",
  publisher =    pub-VINTAGE,
  address =      pub-VINTAGE:adr,
  pages =        "xvii + 695",
  year =         "2006",
  ISBN =         "0-375-71368-9",
  ISBN-13 =      "978-0-375-71368-2",
  LCCN =         "QB15 .A75 2006",
  bibdate =      "Tue Sep 1 16:31:05 MDT 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 www.iris.rutgers.edu:2200/Unicorn",
  price =        "US\$18.95",
  acknowledgement = ack-nhfb,
  subject =      "Astronomy; History",
  tableofcontents = "Preface \\
                 \\
                 I. The Ancient Sky \\
                 1 Mayan Venus Tables \\
                 2 Proof That the Earth Is a Sphere \\
                 3 Celestial Surveying \\
                 4 Measuring the Earth's Circumference \\
                 5 Precession of the Equinoxes \\
                 6 Ptolemy's Almagest \\
                 \\
                 II. Revolutions \\
                 7 Copernicus and the Sun-Centered Universe \\
                 8 Tycho Brahe and the Changing Heavens \\
                 9 Johannes Kepler and Planetary Motion \\
                 10 Galileo Initiates the Telescopic Era \\
                 11 Newton's Universal Law of Gravity \\
                 12 Halley's Comet \\
                 13 Binary Stars \\
                 \\
                 III. Taking Measure \\
                 14 The Speed of Light \\
                 15 The Solar System's Origin \\
                 16 Discovery of Uranus \\
                 17 Stars Moving and Changing \\
                 18 The First Asteroid \\
                 19 Distance to a Star \\
                 20 Discovery of Neptune \\
                 21 The Shape of the Milky Way \\
                 22 Spiraling Nebulae \\
                 \\
                 IV. Touching the Heavens \\
                 23 Spectral Lines \\
                 24 Deciphering the Solar Spectrum \\
                 25 Gaseous Nebulae \\
                 26 Doppler Shifts and Spectroscopic Binaries \\
                 27 Classification of the Stars \\
                 28 Giant Stars and Dwarf Stars \\
                 29 Hydrogen: The Prime Element \\
                 30 Stellar Mass, Luminosity, and Stability \\
                 31 Sunspot Cycle, Sun/Earth Connection, and Helium \\
                 32 Origin of Meteors and Shooting Stars \\
                 33 Cosmic Rays \\
                 34 Discovery of Pluto \\
                 \\
                 V. Einsteinian Cosmos \\
                 35 Special Relativity and $E = m c^2$ \\
                 36 General Relativity and the Solar Eclipse Test \\
                 37 Relativistic Models of the Universe \\
                 38 Big Bang Versus Steady State \\
                 39 White Dwarf Stars \\
                 40 Beyond the White Dwarf \\
                 41 Supernovae and Neutron Stars \\
                 42 Black Holes \\
                 43 Source of Stellar Power \\
                 44 Creating Elements in the Big Bang \\
                 45 Cosmic Microwave Background Predicted \\
                 46 Creating Elements in the Stars \\
                 47 A Star's Life Cycle \\
                 \\
                 VI. The Milky Way and Beyond \\
                 48 Cepheids: The Cosmic Standard Candles \\
                 49 Sun's Place in the Milky Way \\
                 50 Dark Nebulae and Interstellar Matter \\
                 51 Discovery of Other Galaxies \\
                 52 Expansion of the Universe \\
                 53 Stellar Populations and Resizing the Universe \\
                 54 Mapping the Milky Way's Spiral Arms \\
                 55 Source and Composition of Comets \\
                 \\
                 VII. New Eyes, New Universe \\
                 56 Radio Astronomy \\
                 57 Interstellar Hydrogen \\
                 58 Molecules in Space \\
                 59 Van Allen Radiation Belts \\
                 60 Geology of Mars \\
                 61 Extrasolar X-Ray Sources \\
                 62 Quasars \\
                 63 Evidence for the Big Bang \\
                 64 Pulsars \\
                 65 The Infrared Sky and the Galactic Center \\
                 66 Neutrino Astronomy \\
                 67 Gamma-Ray Bursts \\
                 68 Binary Pulsar and Gravity Waves \\
                 \\
                 VIII. Accelerating Outward \\
                 69 Dark Matter \\
                 70 Gravitational Lensing \\
                 71 Inflation \\
                 72 The Bubbly Universe \\
                 73 Galaxy Evolution and the Hubble Deep Field \\
                 74 Extrasolar Planets \\
                 75 The Accelerating Universe \\
                 \\
                 Notes \\
                 Bibliography \\
                 Acknowledgments \\
                 Index",
}

@Book{Bartusiak:2009:DWF,
  author =       "Marcia Bartusiak",
  title =        "The Day We Found the Universe",
  publisher =    pub-PANTHEON,
  address =      pub-PANTHEON:adr,
  pages =        "xviii + 337",
  year =         "2009",
  ISBN =         "0-375-42429-6",
  ISBN-13 =      "978-0-375-42429-8",
  LCCN =         "QB15 .B37 2009",
  bibdate =      "Sat Jun 13 07:47:22 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 =     "From one of the most acclaimed science writers comes a
                 dramatic narrative of the discovery of the true nature
                 and startling size of the universe, delving into the
                 decades of work --- by a select group of scientists ---
                 that made it possible. On January 1, 1925,
                 thirty-five-year-old Edwin Hubble announced the
                 observation that ultimately established that our
                 universe was a thousand trillion times larger than
                 previously believed, filled with myriad galaxies like
                 our own. This discovery dramatically reshaped how
                 humans understood their place in the cosmos, and once
                 and for all laid to rest the idea that the Milky Way
                 galaxy was alone in the universe. Six years later,
                 continuing research by Hubble and others forced Albert
                 Einstein to renounce his own cosmic model and finally
                 accept the astonishing fact that the universe was not
                 immobile but instead expanding. The fascinating story
                 of these interwoven discoveries includes battles of
                 will, clever insights, and wrong turns made by the
                 early investigators in this great twentieth-century
                 pursuit. It is a story of science in the making that
                 shows how these discoveries were not the work of a lone
                 genius but the combined efforts of many talented
                 scientists and researchers toiling away behind the
                 scenes. The intriguing characters include Henrietta
                 Leavitt, who discovered the means to measure the vast
                 dimensions of the cosmos; Vesto Slipher, the first and
                 unheralded discoverer of the universe's expansion;
                 Georges Lema{\^\i}tre, the Jesuit priest who correctly
                 interpreted Einstein's theories in relation to the
                 universe; Milton Humason, who, with only an
                 eighth-grade education, became a world-renowned expert
                 on galaxy motions; and Harlow Shapley, Hubble's
                 nemesis, whose flawed vision of the universe delayed
                 the discovery of its true nature and startling size for
                 more than a decade. Here is a watershed moment in the
                 history of astronomy, brought about by the exceptional
                 combination of human curiosity, intelligence, and
                 enterprise, and vividly told by acclaimed science
                 writer Marcia Bartusiak.",
  acknowledgement = ack-nhfb,
  keywords =     "Albert Einstein; Edwin Hubble; Georges Lema{\^\i}tre;
                 Harlow Shapley; Henrietta Leavitt; James Lick
                 (1796--1896); Milton Humason; Vesto Slipher",
  subject =      "astronomy; history",
  tableofcontents = "Preface / January 1, 1925 \\
                 Setting out \\
                 1: The little republic of science \\
                 2: A rather remarkable number of nebulae \\
                 3: Grander than the truth \\
                 4: Such is the progress of astronomy in the wild and
                 wooly West \\
                 5: My regards to the squashes \\
                 6: It is worthy of notice \\
                 Exploration \\
                 7: Empire builder \\
                 8: The solar system is off center and consequently man
                 is too \\
                 9: He surely looks like the fourth dimension! \\
                 10: Go at each other ``hammer and tongs'' \\
                 11: Adonis \\
                 12: On the brink of a big discovery --- or maybe a big
                 paradox \\
                 Discovery \\
                 13: Countless whole worlds --- strewn all over the sky
                 \\
                 14: Using the 100-inch telescope the way it should be
                 used \\
                 15: Your calculations are correct, but your physical
                 insight is abominable \\
                 16: Started off with a bang \\
                 Whatever happened to \ldots{} \\
                 Notes \\
                 Acknowledgments \\
                 Bibliography \\
                 Index",
}

@Book{Batten:1988:RUC,
  author =       "Alan H. (Alan Henry) Batten",
  title =        "Resolute and Undertaking Characters: The Lives of
                 {Wilhelm and Otto Struve}",
  volume =       "139",
  publisher =    pub-REIDEL,
  address =      pub-REIDEL:adr,
  pages =        "xxv + 259",
  year =         "1988",
  DOI =          "https://doi.org/10.1007/978-94-009-2883-1",
  ISBN =         "90-277-2652-3",
  ISBN-13 =      "978-90-277-2652-0",
  LCCN =         "QB36.S75 B38 1988",
  bibdate =      "Tue Mar 28 08:28:15 MDT 2017",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Astrophysics and space science library",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0902/87030386-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0902/87030386-t.html",
  acknowledgement = ack-nhfb,
  author-dates = "1933--",
  libnote =      "Not in my library.",
  subject =      "Struve, F. G. W. (Friedrich Georg Wilhelm); Struve,
                 Otto; Astronomy; Russia; History; 19th century; Soviet
                 Union; 20th century; Astronomers; Biography; Germany",
  subject-dates = "Friedrich Georg Wilhelm Struve (1793--1864); Otto
                 Struve (1819--1905)",
  tableofcontents = "Preface / xi \\
                 General Note / xv \\
                 Bibliographical Note / xix \\
                 Acknowledgements / xxi \\
                 Chronological Summary of the lives of Wilhelm and Otto
                 Struve / xxiii \\
                 1: Family Origins and Wilhelm's Childhood / 1 \\
                 2: Student Days at Dorpat University / 12 \\
                 3: Astronomy at the Beginning of the Nineteenth Century
                 / 22 \\
                 4: Measuring the Earth / 30 \\
                 5: The Great Refractor / 44 \\
                 6: The Founding of Pulkovo / 66 \\
                 7: The Astronomical Capital of the World / 88 \\
                 8: Measuring the Sky / 113 \\
                 9: The Early Pulkovo Years / 130 \\
                 10: `{\'E}tudes d'astronomie stellaire' / 144 \\
                 11: Wilhelm's Illness and Last Years / 156 \\
                 12: The Transition / 168 \\
                 13: The Companion of Procyon and the Transits of Venus
                 / 181 \\
                 14: The 30-inch Refractor / 196 \\
                 15: Mapping the Sky / 209 \\
                 16: Otto's Retirement and Last Years / 219 \\
                 Epilogue: The Family Tradition / 235 \\
                 Name Index / 245 \\
                 Subject Index / 258",
}

@Book{Bauldry:1991:CLM,
  author =       "William C. Bauldry and Joseph R. Fiedler",
  title =        "Calculus Laboratories with {Maple}: a Tool, Not an
                 Oracle",
  publisher =    pub-BROOKS-COLE,
  address =      pub-BROOKS-COLE:adr,
  pages =        "xii + 144",
  year =         "1991",
  ISBN =         "0-534-13788-1",
  ISBN-13 =      "978-0-534-13788-5",
  LCCN =         "MLCM 90/01887 (Q)",
  bibdate =      "Wed Dec 15 08:46:50 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

@Book{Be:1997:DGO,
  author =       "{The Be Development Team}",
  title =        "The {Be} Developer's Guide: The Official Documentation
                 for the {BeOS}",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xi + 934",
  year =         "1997",
  ISBN =         "1-56592-287-5",
  ISBN-13 =      "978-1-56592-287-7",
  LCCN =         "QA76.76.O63 B43 1997",
  bibdate =      "Wed May 05 15:55:16 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$49.95",
  URL =          "http://www.ora.com/catalog/be/;
                 http://www.oreilly.com/catalog/bedev",
  acknowledgement = ack-nhfb,
}

@Book{Be:1998:AT,
  author =       "{The Be Development Team}",
  title =        "{Be} Advanced Topics: Official documentation for the
                 {BeOS}",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xi + 365",
  month =        jul,
  year =         "1998",
  ISBN =         "1-56592-396-0",
  ISBN-13 =      "978-1-56592-396-6",
  LCCN =         "QA76.76.O63 B4 1998",
  bibdate =      "Thu Feb 18 07:07:41 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Includes BeSpecific 5 CD-ROM.",
  price =        "US\$39.95",
  URL =          "http://www.oreilly.com/catalog/beadv",
  acknowledgement = ack-nhfb,
}

@Manual{Becker:1981:LSD,
  author =       "Richard A. Becker and John M. Chambers",
  title =        "{S}: a Language and System for Data Analysis",
  organization = "AT\&T Bell Laboratories",
  address =      "Murray Hill, NJ, USA",
  year =         "1981",
  LCCN =         "QA76.7 .B43 1981",
  bibdate =      "Wed Aug 10 10:41:43 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

@Book{Becker:1984:IED,
  author =       "Richard A. Becker and John M. Chambers",
  title =        "{S}: An Interactive Environment for Data Analysis and
                 Graphics",
  publisher =    pub-WADSWORTH,
  address =      pub-WADSWORTH:adr,
  pages =        "xii + 550",
  year =         "1984",
  ISBN =         "0-534-03313-X",
  ISBN-13 =      "978-0-534-03313-2",
  LCCN =         "QA76.73.S15 B44 1984",
  bibdate =      "Wed Aug 10 18:17:59 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

@Book{Becker:1985:ES,
  author =       "Richard A. Becker and John M. Chambers",
  title =        "Extending the {S} System",
  publisher =    pub-WADSWORTH,
  address =      pub-WADSWORTH:adr,
  pages =        "viii + 166",
  year =         "1985",
  ISBN =         "0-534-05016-6",
  ISBN-13 =      "978-0-534-05016-0",
  LCCN =         "QA276.4 .B4241 1985",
  bibdate =      "Wed Aug 10 10:38:24 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

@Book{Becker:1988:NPL,
  author =       "Richard A. Becker and John M. Chambers and Allan R.
                 Wilks",
  title =        "The New {S} Programming Language",
  publisher =    pub-WADSWORTH # " and " # pub-BROOKS-COLE,
  address =      pub-WADSWORTH:adr # " and " # pub-BROOKS-COLE:adr,
  pages =        "xvii + 702",
  year =         "1988",
  ISBN =         "0-534-09192-X, 0-534-09193-8",
  ISBN-13 =      "978-0-534-09192-7, 978-0-534-09193-4",
  LCCN =         "QA76.73.S15 B43 1988",
  MRclass =      "68-01, 62-04, 62-07, 68P05, 68U99",
  bibdate =      "Wed Aug 10 17:37:02 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/s-plus.bib",
  ZMnumber =     "0642.68003",
  acknowledgement = ack-nhfb,
}

@Book{Beckmann:1993:HP,
  author =       "Petr Beckmann",
  title =        "A history of $ \pi $",
  publisher =    pub-BARNES-NOBLE,
  address =      pub-BARNES-NOBLE:adr,
  pages =        "200",
  year =         "1993",
  ISBN =         "0-88029-418-3",
  ISBN-13 =      "978-0-88029-418-8",
  LCCN =         "QA484 .B4 1971",
  bibdate =      "Mon Mar 06 08:52:46 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/pi.bib",
  note =         "Reprint of the third edition of 1971.",
  price =        "US\$6.98",
  abstract =     "Documents the calculation, numerical value, and use of
                 the ratio from 2000 B.C. to the modern computer age,
                 detailing social conditions in eras when progress was
                 made.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Dawn \\
                 The Belt \\
                 The Early Greeks \\
                 Euclid \\
                 The Roman pest \\
                 Archimedes of Syracuse \\
                 Dusk \\
                 Night \\
                 Awakening \\
                 The Digit hunters \\
                 The Last Archimedians \\
                 Prelude to breakthrough \\
                 Newton \\
                 Euler \\
                 The Monte Carlo method \\
                 The Transcendence of [pi] \\
                 The Modern circle squares \\
                 The Computer age \\
                 Chronological table",
  xxnote =       "Fourth edition, 1977, Golem Press, Boulder, CO, ISBN
                 0-911762-18-3, LCCN QA484 .B4 1977, also available.",
}

@Book{Beebe:2017:MFC,
  author =       "Nelson H. F. Beebe",
  title =        "The Mathematical-Function Computation Handbook:
                 Programming Using the {MathCW} Portable Software
                 Library",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xxxvi + 1114",
  year =         "2017",
  DOI =          "https://doi.org/10.1007/978-3-319-64110-2",
  ISBN =         "3-319-64109-3 (hardcover), 3-319-64110-7 (e-book)",
  ISBN-13 =      "978-3-319-64109-6 (hardcover), 978-3-319-64110-2
                 (e-book)",
  LCCN =         "QA75.5-76.95",
  bibdate =      "Sat Jul 15 19:34:43 MDT 2017",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/b/beebe-nelson-h-f.bib;
                 https://www.math.utah.edu/pub/tex/bib/axiom.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
                 https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/maple-extract.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/mathematica.bib;
                 https://www.math.utah.edu/pub/tex/bib/matlab.bib;
                 https://www.math.utah.edu/pub/tex/bib/mupad.bib;
                 https://www.math.utah.edu/pub/tex/bib/numana2010.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/redbooks.bib;
                 https://www.math.utah.edu/pub/tex/bib/utah-math-dept-books.bib",
  URL =          "http://www.springer.com/us/book/9783319641096",
  acknowledgement = ack-nhfb,
  ORCID-numbers = "Beebe, Nelson H. F./0000-0001-7281-4263",
  tableofcontents = "List of figures / xxv \\
                 List of tables / xxxi \\
                 Quick start / xxxv \\
                 1: Introduction / 1 \\
                 1.1: Programming conventions / 2 \\
                 1.2: Naming conventions / 4 \\
                 1.3: Library contributions and coverage / 5 \\
                 1.4: Summary / 6 \\
                 2: Iterative solutions and other tools / 7 \\
                 2.1: Polynomials and Taylor series / 7 \\
                 2.2: First-order Taylor series approximation / 8 \\
                 2.3: Second-order Taylor series approximation / 9 \\
                 2.4: Another second-order Taylor series approximation /
                 9 \\
                 2.5: Convergence of second-order methods / 10 \\
                 2.6: Taylor series for elementary functions / 10 \\
                 2.7: Continued fractions / 12 \\
                 2.8: Summation of continued fractions / 17 \\
                 2.9: Asymptotic expansions / 19 \\
                 2.10: Series inversion / 20 \\
                 2.11: Summary / 22 \\
                 3: Polynomial approximations / 23 \\
                 3.1: Computation of odd series / 23 \\
                 3.2: Computation of even series / 25 \\
                 3.3: Computation of general series / 25 \\
                 3.4: Limitations of Cody\slash Waite polynomials / 28
                 \\
                 3.5: Polynomial fits with Maple / 32 \\
                 3.6: Polynomial fits with Mathematica / 33 \\
                 3.7: Exact polynomial coefficients / 42 \\
                 3.8: Cody\slash Waite rational polynomials / 43 \\
                 3.9: Chebyshev polynomial economization / 43 \\
                 3.10: Evaluating Chebyshev polynomials / 48 \\
                 3.11: Error compensation in Chebyshev fits / 50 \\
                 3.12: Improving Chebyshev fits / 51 \\
                 3.13: Chebyshev fits in rational form / 52 \\
                 3.14: Chebyshev fits with Mathematica / 56 \\
                 3.15: Chebyshev fits for function representation / 57
                 \\
                 3.16: Extending the library / 57 \\
                 3.17: Summary and further reading / 58 \\
                 4: Implementation issues / 61 \\
                 4.1: Error magnification / 61 \\
                 4.2: Machine representation and machine epsilon / 62
                 \\
                 4.3: IEEE 754 arithmetic / 63 \\
                 4.4: Evaluation order in C / 64 \\
                 4.5: The {\tt volatile} type qualifier / 65 \\
                 4.6: Rounding in floating-point arithmetic / 66 \\
                 4.7: Signed zero / 69 \\
                 4.8: Floating-point zero divide / 70 \\
                 4.9: Floating-point overflow / 71 \\
                 4.10: Integer overflow / 72 \\
                 4.11: Floating-point underflow / 77 \\
                 4.12: Subnormal numbers / 78 \\
                 4.13: Floating-point inexact operation / 79 \\
                 4.14: Floating-point invalid operation / 79 \\
                 4.15: Remarks on NaN tests / 80 \\
                 4.16: Ulps --- units in the last place / 81 \\
                 4.17: Fused multiply-add / 85 \\
                 4.18: Fused multiply-add and polynomials / 88 \\
                 4.19: Significance loss / 89 \\
                 4.20: Error handling and reporting / 89 \\
                 4.21: Interpreting error codes / 93 \\
                 4.22: C99 changes to error reporting / 94 \\
                 4.23: Error reporting with threads / 95 \\
                 4.24: Comments on error reporting / 95 \\
                 4.25: Testing function implementations / 96 \\
                 4.26: Extended data types on Hewlett--Packard HP-UX
                 IA-64 / 100 \\
                 4.27: Extensions for decimal arithmetic / 101 \\
                 4.28: Further reading / 103 \\
                 4.29: Summary / 104 \\
                 5: The floating-point environment / 105 \\
                 5.1: IEEE 754 and programming languages / 105 \\
                 5.2: IEEE 754 and the mathcw library / 106 \\
                 5.3: Exceptions and traps / 106 \\
                 5.4: Access to exception flags and rounding control /
                 107 \\
                 5.5: The environment access pragma / 110 \\
                 5.6: Implementation of exception-flag and
                 rounding-control access / 110 \\
                 5.7: Using exception flags: simple cases / 112 \\
                 5.8: Using rounding control / 115 \\
                 5.9: Additional exception flag access / 116 \\
                 5.10: Using exception flags: complex case / 120 \\
                 5.11: Access to precision control / 123 \\
                 5.12: Using precision control / 126 \\
                 5.13: Summary / 127 \\
                 6: Converting floating-point values to integers / 129
                 \\
                 6.1: Integer conversion in programming languages / 129
                 \\
                 6.2: Programming issues for conversions to integers /
                 130 \\
                 6.3: Hardware out-of-range conversions / 131 \\
                 6.4: Rounding modes and integer conversions / 132 \\
                 6.5: Extracting integral and fractional parts / 132 \\
                 6.6: Truncation functions / 135 \\
                 6.7: Ceiling and floor functions / 136 \\
                 6.8: Floating-point rounding functions with fixed
                 rounding / 137 \\
                 6.9: Floating-point rounding functions: current
                 rounding / 138 \\
                 6.10: Floating-point rounding functions without {\em
                 inexact\/} exception / 139 \\
                 6.11: Integer rounding functions with fixed rounding /
                 140 \\
                 6.12: Integer rounding functions with current rounding
                 / 142 \\
                 6.13: Remainder / 143 \\
                 6.14: Why the remainder functions are hard / 144 \\
                 6.15: Computing {\tt fmod} / 146 \\
                 6.16: Computing {\tt remainder} / 148 \\
                 6.17: Computing {\tt remquo} / 150 \\
                 6.18: Computing one remainder from the other / 152 \\
                 6.19: Computing the remainder in nonbinary bases / 155
                 \\
                 6.20: Summary / 156 \\
                 7: Random numbers / 157 \\
                 7.1: Guidelines for random-number software / 157 \\
                 7.2: Creating generator seeds / 158 \\
                 7.3: Random floating-point values / 160 \\
                 7.4: Random integers from floating-point generator /
                 165 \\
                 7.5: Random integers from an integer generator / 166
                 \\
                 7.6: Random integers in ascending order / 168 \\
                 7.7: How random numbers are generated / 169 \\
                 7.8: Removing generator bias / 178 \\
                 7.9: Improving a poor random number generator / 178 \\
                 7.10: Why long periods matter / 179 \\
                 7.11: Inversive congruential generators / 180 \\
                 7.12: Inversive congruential generators, revisited /
                 189 \\
                 7.13: Distributions of random numbers / 189 \\
                 7.14: Other distributions / 195 \\
                 7.15: Testing random-number generators / 196 \\
                 7.16: Applications of random numbers / 202 \\
                 7.17: The \textsf {mathcw} random number routines / 208
                 \\
                 7.18: Summary, advice, and further reading / 214 \\
                 8: Roots / 215 \\
                 8.1: Square root / 215 \\
                 8.2: Hypotenuse and vector norms / 222 \\
                 8.3: Hypotenuse by iteration / 227 \\
                 8.4: Reciprocal square root / 233 \\
                 8.5: Cube root / 237 \\
                 8.6: Roots in hardware / 240 \\
                 8.7: Summary / 242 \\
                 9: Argument reduction / 243 \\
                 9.1: Simple argument reduction / 243 \\
                 9.2: Exact argument reduction / 250 \\
                 9.3: Implementing exact argument reduction / 253 \\
                 9.4: Testing argument reduction / 265 \\
                 9.5: Retrospective on argument reduction / 265 \\
                 10: Exponential and logarithm / 267 \\
                 10.1: Exponential functions / 267 \\
                 10.2: Exponential near zero / 273 \\
                 10.3: Logarithm functions / 282 \\
                 10.4: Logarithm near one / 290 \\
                 10.5: Exponential and logarithm in hardware / 292 \\
                 10.6: Compound interest and annuities / 294 \\
                 10.7: Summary / 298 \\
                 11: Trigonometric functions / 299 \\
                 11.1: Sine and cosine properties / 299 \\
                 11.2: Tangent properties / 302 \\
                 11.3: Argument conventions and units / 304 \\
                 11.4: Computing the cosine and sine / 306 \\
                 11.5: Computing the tangent / 310 \\
                 11.6: Trigonometric functions in degrees / 313 \\
                 11.7: Trigonometric functions in units of $ \pi $ / 315
                 \\
                 11.8: Computing the cosine and sine together / 320 \\
                 11.9: Inverse sine and cosine / 323 \\
                 11.10: Inverse tangent / 331 \\
                 11.11: Inverse tangent, take two / 336 \\
                 11.12: Trigonometric functions in hardware / 338 \\
                 11.13: Testing trigonometric functions / 339 \\
                 11.14: Retrospective on trigonometric functions / 340
                 \\
                 12: Hyperbolic functions / 341 \\
                 12.1: Hyperbolic functions / 341 \\
                 12.2: Improving the hyperbolic functions / 345 \\
                 12.3: Computing the hyperbolic functions together / 348
                 \\
                 12.4: Inverse hyperbolic functions / 348 \\
                 12.5: Hyperbolic functions in hardware / 350 \\
                 12.6: Summary / 352 \\
                 13: Pair-precision arithmetic / 353 \\
                 13.1: Limitations of pair-precision arithmetic / 354
                 \\
                 13.2: Design of the pair-precision software interface /
                 355 \\
                 13.3: Pair-precision initialization / 356 \\
                 13.4: Pair-precision evaluation / 357 \\
                 13.5: Pair-precision high part / 357 \\
                 13.6: Pair-precision low part / 357 \\
                 13.7: Pair-precision copy / 357 \\
                 13.8: Pair-precision negation / 358 \\
                 13.9: Pair-precision absolute value / 358 \\
                 13.10: Pair-precision sum / 358 \\
                 13.11: Splitting numbers into pair sums / 359 \\
                 13.12: Premature overflow in splitting / 362 \\
                 13.13: Pair-precision addition / 365 \\
                 13.14: Pair-precision subtraction / 367 \\
                 13.15: Pair-precision comparison / 368 \\
                 13.16: Pair-precision multiplication / 368 \\
                 13.17: Pair-precision division / 371 \\
                 13.18: Pair-precision square root / 373 \\
                 13.19: Pair-precision cube root / 377 \\
                 13.20: Accuracy of pair-precision arithmetic / 379 \\
                 13.21: Pair-precision vector sum / 384 \\
                 13.22: Exact vector sums / 385 \\
                 13.23: Pair-precision dot product / 385 \\
                 13.24: Pair-precision product sum / 386 \\
                 13.25: Pair-precision decimal arithmetic / 387 \\
                 13.26: Fused multiply-add with pair precision / 388 \\
                 13.27: Higher intermediate precision and the FMA / 393
                 \\
                 13.28: Fused multiply-add without pair precision / 395
                 \\
                 13.29: Fused multiply-add with multiple precision / 401
                 \\
                 13.30: Fused multiply-add, Boldo/\penalty
                 \exhyphenpenalty Melquiond style / 403 \\
                 13.31: Error correction in fused multiply-add / 406 \\
                 13.32: Retrospective on pair-precision arithmetic / 407
                 \\
                 14: Power function / 411 \\
                 14.1: Why the power function is hard to compute / 411
                 \\
                 14.2: Special cases for the power function / 412 \\
                 14.3: Integer powers / 414 \\
                 14.4: Integer powers, revisited / 420 \\
                 14.5: Outline of the power-function algorithm / 421 \\
                 14.6: Finding $a$ and $p$ / 423 \\
                 14.7: Table searching / 424 \\
                 14.8: Computing $\log_n(g/a)$ / 426 \\
                 14.9: Accuracy required for $\log_n(g/a)$ / 429 \\
                 14.10: Exact products / 430 \\
                 14.11: Computing $w$, $w_1$ and $w_2$ / 433 \\
                 14.12: Computing $n^{w_2}$ / 437 \\
                 14.13: The choice of $q$ / 438 \\
                 14.14: Testing the power function / 438 \\
                 14.15: Retrospective on the power function / 440 \\
                 15: Complex arithmetic primitives / 441 \\
                 15.1: Support macros and type definitions / 442 \\
                 15.2: Complex absolute value / 443 \\
                 15.3: Complex addition / 445 \\
                 15.4: Complex argument / 445 \\
                 15.5: Complex conjugate / 446 \\
                 15.6: Complex conjugation symmetry / 446 \\
                 15.7: Complex conversion / 448 \\
                 15.8: Complex copy / 448 \\
                 15.9: Complex division: C99 style / 449 \\
                 15.10: Complex division: Smith style / 451 \\
                 15.11: Complex division: Stewart style / 452 \\
                 15.12: Complex division: Priest style / 453 \\
                 15.13: Complex division: avoiding subtraction loss /
                 455 \\
                 15.14: Complex imaginary part / 456 \\
                 15.15: Complex multiplication / 456 \\
                 15.16: Complex multiplication: error analysis / 458 \\
                 15.17: Complex negation / 459 \\
                 15.18: Complex projection / 460 \\
                 15.19: Complex real part / 460 \\
                 15.20: Complex subtraction / 461 \\
                 15.21: Complex infinity test / 462 \\
                 15.22: Complex NaN test / 462 \\
                 15.23: Summary / 463 \\
                 16: Quadratic equations / 465 \\
                 16.1: Solving quadratic equations / 465 \\
                 16.2: Root sensitivity / 471 \\
                 16.3: Testing a quadratic-equation solver / 472 \\
                 16.4: Summary / 474 \\
                 17: Elementary functions in complex arithmetic / 475
                 \\
                 17.1: Research on complex elementary functions / 475
                 \\
                 17.2: Principal values / 476 \\
                 17.3: Branch cuts / 476 \\
                 17.4: Software problems with negative zeros / 478 \\
                 17.5: Complex elementary function tree / 479 \\
                 17.6: Series for complex functions / 479 \\
                 17.7: Complex square root / 480 \\
                 17.8: Complex cube root / 485 \\
                 17.9: Complex exponential / 487 \\
                 17.10: Complex exponential near zero / 492 \\
                 17.11: Complex logarithm / 495 \\
                 17.12: Complex logarithm near one / 497 \\
                 17.13: Complex power / 500 \\
                 17.14: Complex trigonometric functions / 502 \\
                 17.15: Complex inverse trigonometric functions / 504
                 \\
                 17.16: Complex hyperbolic functions / 509 \\
                 17.17: Complex inverse hyperbolic functions / 514 \\
                 17.18: Summary / 520 \\
                 18: The Greek functions: gamma, psi, and zeta / 521 \\
                 18.1: Gamma and log-gamma functions / 521 \\
                 18.2: The {\tt psi} and {\tt psiln} functions / 536 \\
                 18.3: Polygamma functions / 547 \\
                 18.4: Incomplete gamma functions / 560 \\
                 18.5: A Swiss diversion: Bernoulli and Euler / 568 \\
                 18.6: An Italian excursion: Fibonacci numbers / 575 \\
                 18.7: A German gem: the Riemann zeta function / 579 \\
                 18.8: Further reading / 590 \\
                 18.9: Summary / 591 \\
                 19: Error and probability functions / 593 \\
                 19.1: Error functions / 593 \\
                 19.2: Scaled complementary error function / 598 \\
                 19.3: Inverse error functions / 600 \\
                 19.4: Normal distribution functions and inverses / 610
                 \\
                 19.5: Summary / 617 \\
                 20: Elliptic integral functions / 619 \\
                 20.1: The arithmetic-geometric mean / 619 \\
                 20.2: Elliptic integral functions of the first kind /
                 624 \\
                 20.3: Elliptic integral functions of the second kind /
                 627 \\
                 20.4: Elliptic integral functions of the third kind /
                 630 \\
                 20.5: Computing $K(m)$ and $K'(m)$ / 631 \\
                 20.6: Computing $E(m)$ and $E'(m)$ / 637 \\
                 20.7: Historical algorithms for elliptic integrals /
                 643 \\
                 20.8: Auxiliary functions for elliptic integrals / 645
                 \\
                 20.9: Computing the elliptic auxiliary functions / 648
                 \\
                 20.10: Historical elliptic functions / 650 \\
                 20.11: Elliptic functions in software / 652 \\
                 20.12: Applications of elliptic auxiliary functions /
                 653 \\
                 20.13: Elementary functions from elliptic auxiliary
                 functions / 654 \\
                 20.14: Computing elementary functions via $R_C(x,y)$ /
                 655 \\
                 20.15: Jacobian elliptic functions / 657 \\
                 20.16: Inverses of Jacobian elliptic functions / 664
                 \\
                 20.17: The modulus and the nome / 668 \\
                 20.18: Jacobian theta functions / 673 \\
                 20.19: Logarithmic derivatives of the Jacobian theta
                 functions / 675 \\
                 20.20: Neville theta functions / 678 \\
                 20.21: Jacobian Eta, Theta, and Zeta functions / 679
                 \\
                 20.22: Weierstrass elliptic functions / 682 \\
                 20.23: Weierstrass functions by duplication / 689 \\
                 20.24: Complete elliptic functions, revisited / 690 \\
                 20.25: Summary / 691 \\
                 21: Bessel functions / 693 \\
                 21.1: Cylindrical Bessel functions / 694 \\
                 21.2: Behavior of $J_n(x)$ and $Y_n(x)$ / 695 \\
                 21.3: Properties of $J_n(z)$ and $Y_n(z)$ / 697 \\
                 21.4: Experiments with recurrences for $J_0(x)$ / 705
                 \\
                 21.5: Computing $J_0(x)$ and $J_1(x)$ / 707 \\
                 21.6: Computing $J_n(x)$ / 710 \\
                 21.7: Computing $Y_0(x)$ and $Y_1(x)$ / 713 \\
                 21.8: Computing $Y_n(x)$ / 715 \\
                 21.9: Improving Bessel code near zeros / 716 \\
                 21.10: Properties of $I_n(z)$ and $K_n(z)$ / 718 \\
                 21.11: Computing $I_0(x)$ and $I_1(x)$ / 724 \\
                 21.12: Computing $K_0(x)$ and $K_1(x)$ / 726 \\
                 21.13: Computing $I_n(x)$ and $K_n(x)$ / 728 \\
                 21.14: Properties of spherical Bessel functions / 731
                 \\
                 21.15: Computing $j_n(x)$ and $y_n(x)$ / 735 \\
                 21.16: Improving $j_1(x)$ and $y_1(x)$ / 740 \\
                 21.17: Modified spherical Bessel functions / 743 \\
                 21.18: Software for Bessel-function sequences / 755 \\
                 21.19: Retrospective on Bessel functions / 761 \\
                 22: Testing the library / 763 \\
                 22.1: Testing {\tt tgamma} and {\tt lgamma} / 765 \\
                 22.2: Testing {\tt psi} and {\tt psiln} / 768 \\
                 22.3: Testing {\tt erf} and {\tt erfc} / 768 \\
                 22.4: Testing cylindrical Bessel functions / 769 \\
                 22.5: Testing exponent/\penalty \exhyphenpenalty
                 significand manipulation / 769 \\
                 22.6: Testing inline assembly code / 769 \\
                 22.7: Testing with Maple / 770 \\
                 22.8: Testing floating-point arithmetic / 773 \\
                 22.9: The Berkeley Elementary Functions Test Suite /
                 774 \\
                 22.10: The AT\&T floating-point test package / 775 \\
                 22.11: The Antwerp test suite / 776 \\
                 22.12: Summary / 776 \\
                 23: Pair-precision elementary functions / 777 \\
                 23.1: Pair-precision integer power / 777 \\
                 23.2: Pair-precision machine epsilon / 779 \\
                 23.3: Pair-precision exponential / 780 \\
                 23.4: Pair-precision logarithm / 787 \\
                 23.5: Pair-precision logarithm near one / 793 \\
                 23.6: Pair-precision exponential near zero / 793 \\
                 23.7: Pair-precision base-$n$ exponentials / 795 \\
                 23.8: Pair-precision trigonometric functions / 796 \\
                 23.9: Pair-precision inverse trigonometric functions /
                 801 \\
                 23.10: Pair-precision hyperbolic functions / 804 \\
                 23.11: Pair-precision inverse hyperbolic functions /
                 808 \\
                 23.12: Summary / 808 \\
                 24: Accuracy of the Cody\slash Waite algorithms / 811
                 \\
                 25: Improving upon the Cody\slash Waite algorithms /
                 823 \\
                 25.1: The Bell Labs libraries / 823 \\
                 25.2: The {Cephes} library / 823 \\
                 25.3: The {Sun} libraries / 824 \\
                 25.4: Mathematical functions on EPIC / 824 \\
                 25.5: The GNU libraries / 825 \\
                 25.6: The French libraries / 825 \\
                 25.7: The NIST effort / 826 \\
                 25.8: Commercial mathematical libraries / 826 \\
                 25.9: Mathematical libraries for decimal arithmetic /
                 826 \\
                 25.10: Mathematical library research publications / 826
                 \\
                 25.11: Books on computing mathematical functions / 827
                 \\
                 25.12: Summary / 828 \\
                 26: Floating-point output / 829 \\
                 26.1: Output character string design issues / 830 \\
                 26.2: Exact output conversion / 831 \\
                 26.3: Hexadecimal floating-point output / 832 \\
                 26.4: Octal floating-point output / 850 \\
                 26.5: Binary floating-point output / 851 \\
                 26.6: Decimal floating-point output / 851 \\
                 26.7: Accuracy of output conversion / 865 \\
                 26.8: Output conversion to a general base / 865 \\
                 26.9: Output conversion of Infinity / 866 \\
                 26.10: Output conversion of NaN / 866 \\
                 26.11: Number-to-string conversion / 867 \\
                 26.12: The {\tt printf} family / 867 \\
                 26.13: Summary / 878 \\
                 27: Floating-point input / 879 \\
                 27.1: Binary floating-point input / 879 \\
                 27.2: Octal floating-point input / 894 \\
                 27.3: Hexadecimal floating-point input / 895 \\
                 27.4: Decimal floating-point input / 895 \\
                 27.5: Based-number input / 899 \\
                 27.6: General floating-point input / 900 \\
                 27.7: The {\tt scanf} family / 901 \\
                 27.8: Summary / 910 \\
                 A: Ada interface / 911 \\
                 A.1: Building the Ada interface / 911 \\
                 A.2: Programming the Ada interface / 912 \\
                 A.3: Using the Ada interface / 915 \\
                 B: C\# interface / 917 \\
                 B.1: C\# on the CLI virtual machine / 917 \\
                 B.2: Building the C\# interface / 918 \\
                 B.3: Programming the C\# interface / 920 \\
                 B.4: Using the C\# interface / 922 \\
                 C: C++ interface / 923 \\
                 C.1: Building the C++ interface / 923 \\
                 C.2: Programming the C++ interface / 924 \\
                 C.3: Using the C++ interface / 925 \\
                 D: Decimal arithmetic / 927 \\
                 D.1: Why we need decimal floating-point arithmetic /
                 927 \\
                 D.2: Decimal floating-point arithmetic design issues /
                 928 \\
                 D.3: How decimal and binary arithmetic differ / 931 \\
                 D.4: Initialization of decimal floating-point storage /
                 935 \\
                 D.5: The {\tt <decfloat.h>} header file / 936 \\
                 D.6: Rounding in decimal arithmetic / 936 \\
                 D.7: Exact scaling in decimal arithmetic / 937 \\
                 E: Errata in the Cody\slash Waite book / 939 \\
                 F: Fortran interface / 941 \\
                 F.1: Building the Fortran interface / 943 \\
                 F.2: Programming the Fortran interface / 944 \\
                 F.3: Using the Fortran interface / 945 \\
                 H: Historical floating-point architectures / 947 \\
                 H.1: CDC family / 949 \\
                 H.2: Cray family / 952 \\
                 H.3: DEC PDP-10 / 953 \\
                 H.4: DEC PDP-11 and VAX / 956 \\
                 H.5: General Electric 600 series / 958 \\
                 H.6: IBM family / 959 \\
                 H.7: Lawrence Livermore S-1 Mark IIA / 965 \\
                 H.8: Unusual floating-point systems / 966 \\
                 H.9: Historical retrospective / 967 \\
                 I: Integer arithmetic / 969 \\
                 I.1: Memory addressing and integers / 971 \\
                 I.2: Representations of signed integers / 971 \\
                 I.3: Parity testing / 975 \\
                 I.4: Sign testing / 975 \\
                 I.5: Arithmetic exceptions / 975 \\
                 I.6: Notations for binary numbers / 977 \\
                 I.7: Summary / 978 \\
                 J: Java interface / 979 \\
                 J.1: Building the Java interface / 979 \\
                 J.2: Programming the Java MathCW class / 980 \\
                 J.3: Programming the Java C interface / 982 \\
                 J.4: Using the Java interface / 985 \\
                 L: Letter notation / 987 \\
                 P: Pascal interface / 989 \\
                 P.1: Building the Pascal interface / 989 \\
                 P.2: Programming the Pascal MathCW module / 990 \\
                 P.3: Using the Pascal module interface / 993 \\
                 P.4: Pascal and numeric programming / 994 \\
                 Bibliography / 995 \\
                 Author/editor index / 1039 \\
                 Function and macro index / 1049 \\
                 Subject index / 1065 \\
                 Colophon / 1115",
}

@Article{Beebe:dvi-drivers,
  author =       "Nelson H. F. Beebe",
  title =        "A {{\TeX DVI}} Driver Family",
  journal =      j-TEXNIQUES,
  volume =       "5",
  pages =        "71--114",
  month =        aug,
  year =         "1987",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Proceedings of the Eighth Annual Meeting of the \TeX{}
                 Users Group",
  acknowledgement = ack-nhfb,
  ORCID-numbers = "Beebe, Nelson H. F./0000-0001-7281-4263",
}

@TechReport{Beebe:plot79,
  author =       "Nelson H. F. Beebe",
  title =        "A User's Guide to {\PLOT}",
  institution =  "University of Utah",
  year =         "1980",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  ORCID-numbers = "Beebe, Nelson H. F./0000-0001-7281-4263",
}

@Article{Beebe:plot79-biomed,
  author =       "Nelson H. F. Beebe and R. P. C. Rodgers",
  title =        "{\PLOT}: a comprehensive portable {Fortran} scientific
                 line graphics system, as applied to biomedical
                 research",
  journal =      j-CBM,
  volume =       "19",
  number =       "6",
  pages =        "385--402",
  year =         "1989",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  ORCID-numbers = "Beebe, Nelson H. F./0000-0001-7281-4263",
}

@Manual{Beebe:sf3-installation,
  author =       "Nelson H. F. Beebe",
  title =        "{SFTRAN} 3 Installation Guide",
  organization = pub-CLSC,
  address =      pub-CLSC:adr,
  month =        jul,
  year =         "1979",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  ORCID-numbers = "Beebe, Nelson H. F./0000-0001-7281-4263",
}

@Article{Beebe:tex-graphics,
  author =       "Nelson H. F. Beebe",
  title =        "{\TeX{}} and Graphics: The State of the Problem",
  journal =      j-GUTENBERG,
  volume =       "2",
  pages =        "13--53",
  year =         "1989",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Presented to: Congr{\`e}s GUTenberg, Paris, France,
                 16--17 May 1989",
  acknowledgement = ack-nhfb,
  ORCID-numbers = "Beebe, Nelson H. F./0000-0001-7281-4263",
}

@Book{Beekman:2025:OLHc,
  author =       "Madeleine Beekman",
  title =        "The Origin of Language: How We Learned to Speak and
                 Why",
  publisher =    pub-SIMON-SCHUSTER,
  address =      pub-SIMON-SCHUSTER:adr,
  pages =        "224",
  year =         "2025",
  ISBN =         "1-66806-605-X, 1-66806-607-6 (e-book)",
  ISBN-13 =      "978-1-66806-605-8, 978-1-66806-607-2 (e-book)",
  LCCN =         "P116",
  bibdate =      "Sat Dec 13 15:21:36 MST 2025",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "In a radical new story about the birth of our species,
                 \booktitle{The Origin of Language} argues that it was
                 not hunting, fighting, or tool-making that forced early
                 humans to speak, but the inescapable need to care for
                 our children. Journeying to the dawn of Homo sapiens,
                 evolutionary biologist Madeleine Beekman reveals the
                 happy accidents`` hidden in our molecular biology--DNA,
                 chromosomes, and proteins--that led to one of the most
                 fateful events in the history of life on Earth: our
                 giving birth to babies earlier in their development
                 than our hominid cousins the Neanderthals and
                 Denisovans. Faced with highly dependent infants
                 requiring years of nurturing and protection, early
                 human communities needed to cooperate and coordinate,
                 and it was this unprecedented need for communication
                 that triggered the creation of human language--and
                 changed everything. Infused with cutting-edge science,
                 sharp humor, and insights into the history of biology
                 and its luminaries, Beekman weaves a narrative that's
                 both enlightening and entertaining. Challenging the
                 traditional theories of male luminaries like Chomsky,
                 Pinker, and Harari, she invites us into the intricate
                 world of molecular biology and its ancient secrets.
                 \booktitle{The Origin of Language} is a tour de force
                 by a brilliant biologist on how a culture of
                 cooperation and care have shaped our existence.",
  acknowledgement = ack-nhfb,
  subject =      "Language and languages; Origin; Historical
                 linguistics; Human evolution; Langage et langues;
                 Origines; Linguistique historique; {\^E}tres humains;
                 {\'E}volution; historical linguistics.",
  tableofcontents = "Introduction: See how it begins / 1 \\
                 Part one: Mistakes were made \\
                 1: The 1 percent / 13 \\
                 2: Our original childcare problem / 45 \\
                 3: Beat of a different drum / 71 \\
                 4: Mind blown / 101 \\
                 Part two: \ldots{} And then we started talking \\
                 5: Loud moms / 131 \\
                 6: Who needs half a grammar? / 161 \\
                 7: Other minds / 195 \\
                 8: Brave new world / 225 \\
                 Epilogue: Modern family / 257 \\
                 Acknowledgments / 263 \\
                 Approximate timing of key changes that led us to become
                 what we are today / 268 \\
                 Notes / 271 \\
                 Index / 297",
}

@Book{Belcher:1960:QIA,
  author =       "Ronald Belcher and A. J. Nutten",
  title =        "Quantitative Inorganic Analysis",
  publisher =    "Butterworths Scientific Publications",
  address =      "London, England",
  edition =      "Second",
  pages =        "x + 390",
  year =         "1960",
  LCCN =         "QD45 .B45 1960",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Bell:1937:MML,
  author =       "Eric Temple Bell",
  title =        "Men of mathematics: The Lives and Achievements of the
                 Great Mathematicians from {Zeno} to {Poincar{\'e}}",
  publisher =    pub-SIMON-SCHUSTER,
  address =      pub-SIMON-SCHUSTER:adr,
  pages =        "xxi + 592",
  year =         "1937",
  ISBN =         "0-671-62818-6",
  ISBN-13 =      "978-0-671-62818-5",
  LCCN =         "QA28 .B4",
  bibdate =      "Mon Mar 06 08:47:02 2000",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/i/infeld-leopold.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$17.00",
  acknowledgement = ack-nhfb,
  tableofcontents = "1. Introduction / 3 \\
                 For the reader's comfort. The beginning of modern
                 mathematics. Are mathematicians human? Witless
                 parodies. Illimitable scope of mathematical evolution.
                 Pioneers and scouts. A clue through the maze.
                 Continuity and discreteness. Remarkable rarity of
                 common sense. Vivid mathematics or vague mysticism?
                 Four great ages of mathematics. Our own the Golden Age.
                 \\
                 \\
                 2. Modern Minds in Ancient Bodies / 19 \\
                 Zeno (fifth century B.C.), Eudoxus (408--355 B.C.),
                 Archimedes (287?--212 B.C.) \\
                 Modern ancients and ancient moderns. Pythagoras, great
                 mystic, greater mathematician. Proof or intuition? The
                 taproot of modern analysis. A bumpkin upsets the
                 philosophers. Zeno's unresolved riddles. Plato's needy
                 young friend. Inexhaustible exhaustion. The useful
                 conics. Archimedes, aristocrat, greatest scientist of
                 antiquity. Legends of his life and personality. His
                 discoveries and claim to modernity. A sturdy Roman.
                 Defeat of Archimedes and triumph of Rome. \\
                 \\
                 3. Gentleman, Soldier, and Mathematician / 35 \\
                 Descartes (1596--1650) \\
                 The good old days. A child philosopher but no prig.
                 Inestimable advantages of lying in bed. Invigorating
                 doubts. Peace in war. Converted by a nightmare.
                 Revelation of analytic geometry. More butchering.
                 Circuses, professional jealousy, swashbuckling,
                 accommodating lady friends. Distaste for hell-fire and
                 respect for the Church. Saved by a brace of cardinals.
                 A Pope brains himself. Twenty years a recluse. The
                 Method. Betrayed by fame. Doting Elisabeth. What
                 Descartes really thought of her. Conceited Christine.
                 What she did to Descartes. Creative simplicity of Ms
                 geometry. \\
                 \\
                 4. The Prince of Amateurs / 56 \\
                 Fermat (1601--1665) \\
                 Greatest mathematician of the seventeenth century.
                 Fermat's busy, practical life. Mathematics his hobby.
                 His flick to the calculus. His profound physical
                 principle. Analytic geometry again. Arithmetica and
                 logistica. Fermat's supremacy in arithmetic. An
                 unsolved problem on primes. Why are some theorems
                 ``important''? An intelligence test. ``Infinite
                 descent.'' Fermat's unanswered challenge to posterity.
                 \\
                 \\
                 5. ``Greatness and Misery of Man'' / 73 \\
                 Pascal (1625--1662) \\
                 An infant prodigy buries his talent. At seventeen a
                 great geometer. Pascal's wonderful theorem. Vile health
                 and religious inebriety. The first calculating
                 Frankenstein. Pascal's brilliance in physics. Holy
                 sister Jacqueline, soul-saver. Wine and women? ``Get
                 thee to a nunnery.!'' Converted on a spree. Literature
                 prostituted to bigotry. The Helen of Geometry. A
                 celestial toothache. What the post-mortem revealed. A
                 gambler makes mathematical history. Scope of the theory
                 of probability. Pascal creates the theory with Fermat.
                 Folly of betting against God or the Devil. \\
                 \\
                 6. On the Seashore / 90 \\
                 Newton (1642--1727) \\
                 Newton's estimate of himself. An uncertified youthful
                 genius. Chaos of his times. On the shoulders of giants.
                 His one attachment. Cambridge days. Young Newton
                 masters futility of suffering fools gladly. The Great
                 Plague a greater blessing. Immortal at twenty four (or
                 less). The calculus. Newton unsurpassed in pure
                 mathematics, supreme in natural philosophy. Gnats,
                 hornets, and exasperation. The Principia. Samuel Pepys
                 and other fussers. The flattest anticlimax in history.
                 Controversy, theology, chronology, alchemy, public
                 office, death. \\
                 \\
                 7. Master of All Trades / 117 \\
                 Leibniz (1646--1716) \\
                 Two superb contributions. A politician's offspring.
                 Genius at fifteen. Seduced by the law. The ``universal
                 characteristic.'' Symbolic reasoning. Sold out to
                 ambition. A master diplomat. Diplomacy being what it
                 is, the diplomatic exploits of the master are left to
                 the historians. Fox into historian, statesman into
                 mathematician. Applied ethics. Existence of God.
                 Optimism. Forty years of futility. Discarded like a
                 dirty rag. \\
                 \\
                 8. Nature or Nurture? / 131 \\
                 The Bernoullis (seventeenth-and eighteenth centuries)
                 \\
                 Eight mathematicians in three generations. Clinical
                 evidence for heredity. The calculus of variations. \\
                 \\
                 9. Analysis Incarnate / 139 \\
                 Euler (1707--1783) \\
                 The most prolific mathematician in history. Snatched
                 from theology. Rulers foot the bills. Practicality of
                 the unpractical. Celestial mechanics and naval warfare.
                 A mathematician by chance and foreordination. Trapped
                 in St. Petersburg. The virtues of silence. Half blind
                 in his morning. Flight to liberal Prussia. Generosity
                 and boorishness of Frederick the Great. Return to
                 hospitable Russia. Generosity and graciousness of
                 Catherine the Great. Total blindness at noon. Master
                 and inspirer of masters for a century. \\
                 \\
                 10. A Lofty Pyramid / 153 \\
                 Lagrange (1736--1813) \\
                 Greatest and most modest mathematician of the
                 eighteenth century. Financial ruin his opportunity.
                 Conceives his masterpiece at nineteen. Magnanimity of
                 Euler. Turin, to Paris, to Berlin: a grateful bastard
                 aids a genius. Conquests in celestial mechanics.
                 Frederick the Great condescends. Absent-minded
                 marriage. Work as a vice. A classic in arithmetic. The
                 M{\'e}canique analytique a living masterpiece. A
                 landmark in the theory of equations. Welcomed in Paris
                 by Marie Antoinette. Nervous exhaustion, melancholia,
                 and universal disgust in middle life. Reawakened by the
                 French Revolution and a young girl. What Lagrange
                 thought of the Revolution. The metric system. What the
                 revolutionists thought of Lagrange. How a philosopher
                 dies. \\
                 \\
                 11. From Peasant to Snob / 172 \\
                 Laplace (1749--1827) \\
                 Humble as Lincoln, proud as Lucifer. A chilly reception
                 and a warm welcome. Laplace grandiosely attacks the
                 solar system. The M{\'e}canique c{\'e}leste. His
                 estimate of himself. What others have thought of him.
                 The ``potential'' fundamental in physics. Laplace in
                 the French Revolution. Intimacy with Napoleon.
                 Laplace's political realism superior to Napoleon's. \\
                 \\
                 12. Friends of an Emperor / 183 \\
                 Monge (1746--1818), Fourier (1768--1830) \\
                 A knife grinder's son and a tailor's boy help Napoleon
                 to upset the aristocrats' applecart. Comic opera in
                 Egypt. Monge's descriptive geometry and the Machine
                 Age. Fourier's analysis and modern physics. Imbecility
                 of trusting in princes or proletarians. Boring to death
                 and bored to death. \\
                 \\
                 13. The Day of Glory / 206 \\
                 Poncelet (1788--1867) \\
                 Resurrected from a Napoleonic shambles. The path of
                 glory leads to jail. Wintering in Russia in 1812. What
                 genius does in prison. Two years of geometry in hell.
                 The rewards of genius: stupidities of routine.
                 Poncelet's projective geometry. Principles of
                 continuity and duality. \\
                 \\
                 14. The Prince of Mathematicians / 218 \\
                 Gauss (1777--1855) \\
                 Gauss the mathematical peer of Archimedes and Newton.
                 Humble origin. Paternal brutality. Unequalled
                 intellectual precocity. His chance, at ten. By twelve
                 he dreams revolutionary discoveries, by eighteen
                 achieves them. The Disquisitiones Arithmeticae. Other
                 epochal works summarized. The Ceres disaster. Napoleon,
                 indirectly robbing Gauss, takes second best.
                 Fundamental advances in all branches of mathematics due
                 to Gauss too numerous for citation: see the account
                 given. A sage of sages. Unwelcome death. \\
                 \\
                 15. Mathematics and Windmills / 270 \\
                 Cauchy (1789--1857) \\
                 Change in nature of mathematics with nineteenth
                 century. Childhood in the French Revolution. Cauchy's
                 early miseducation. Lagrange's prophecy. The young
                 Christian engineer. Prophetic acuteness of Malus. The
                 theory of groups. In the front rank at twenty seven.
                 One of Fermat's enigmas solved. The pious hippopotamus.
                 Butted by Charles the Goat. Memoirs on astronomy and
                 mathematical physics. Sweetness and obstinacy
                 invincible. The French Government makes a fool of
                 itself. Cauchy's place in mathematics. Drawbacks of an
                 irreproachable character. \\
                 \\
                 16. The Copernicus of Geometry / 294 \\
                 Lobatchewsky (1793--1856) \\
                 The widow's mite. Kazan. Appointed professor and spy.
                 Universal ability. Lobatchewsky as an administrator.
                 Reason and incense combat the cholera. Russian
                 gratitude. Humiliated in his prime. Blind as Milton,
                 Lobatchewsky dictates his masterpiece. His advance
                 beyond Euclid. Non--Euclidean geometry. A Copernicus of
                 the intellect. \\
                 \\
                 17. Genius and Poverty / 307 \\
                 Abel ( 1802--1829) \\
                 Norway in 1802. Smothered by clerical fecundity. Abel's
                 awakening. Generosity of a teacher. A pupil of the
                 masters. His lucky blunder. Abel and the quintic. The
                 Government to the rescue. Abel's grand tour of
                 mathematical Europe not so grand. French civility and
                 German cordiality. Crelle and his Journal. Cauchy's
                 unpardonable sin. ``Abel's Theorem.'' Something to keep
                 mathematicians 500 years. Crowning a corpse. \\
                 \\
                 18. The Great Algorist / 327 \\
                 Jacobi (1804--1851) \\
                 Galvanoplastics versus mathematics. Born rich. Jacobi's
                 philological ability. Dedicates himself to mathematics.
                 Early work. Cleaned out. A goose among foxes. Hard
                 times. Elliptic functions. Their place in the general
                 development. Inversion. Work in arithmetic, dynamics,
                 algebra, and Abelian functions. Fourier's
                 pontification. Jacobi's retort. \\
                 \\
                 19. An Irish Tragedy / 340 \\
                 Hamilton (1805--1865) \\
                 Ireland's greatest. Elaborate miseducation. Discoveries
                 at seventeen. A unique university career. Disappointed
                 in love. Hamilton and the poets. Appointed at Dunsink.
                 Systems of rays. The Principia of optics. Prediction of
                 conical refraction. Marriage and alcohol. Fields.
                 Complex numbers. The commutative law repealed.
                 Quaternions. Mountains of paper. \\
                 \\
                 20. Genius and Stupidity / 3662 \\
                 Galois (1811--1832) \\
                 An all-time world record in stupidity. Galois'
                 childhood. The pedagogues surpass themselves, At
                 sixteen Galois repeats Abel's mistake. Politics and
                 education. Examinations as arbiters of genius. Hounded
                 to death by a priest. More academic ineptitude.
                 Absent-minded Cauchy again. Driven to rebellion. A
                 master mathematician at nineteen. ``A carcase to stir
                 up the people.'' The foulest sewer in Paris. Patriots
                 rush to the field of honor. Galois' last night. The
                 riddle of equations solved. Buried like a dog. \\
                 \\
                 21. Invariant Twins / 378 \\
                 Sylvester (1814--1807); Cayley (1821--1895) \\
                 Cayley's contributions. Early life. Cambridge.
                 Recreations. Called to the Bar. Fourteen years in the
                 law. Cayley meets his collaborator. Sylvester's
                 stormier life. Hamstrung by religion. Cayley and
                 Sylvester contrasted. Sylvester's mission to the
                 Virginians. Further false steps. The theory of
                 invariants. Called to Johns Hopkins University.
                 Inextinguishable vitality. ``Rosalind.'' Cayley's
                 unification of geometry. Space of $n$ dimensions.
                 Matrices. Oxford endorses Sylvester. Respectable at
                 last. \\
                 \\
                 22. Master and Pupil / 406 \\
                 Weierstrass (1815--1897); Sonja Kowalewski (1850--1891)
                 \\
                 The father of modern analysis. Relations of Weierstrass
                 to his contemporaries. The penalties of brilliance.
                 Forced into law, forces himself out. Beer and
                 broadswords. A fresh start. Debt to Gudermann. Fifteen
                 years in the mud. Miraculous extrication. Weierstrass'
                 life problem. Too much success. Sonja storms the
                 master. His favorite pupil. Their friendship. A woman's
                 gratitude. Repenting, Sonja wins Paris prize.
                 Weierstrass universally honored. Power series.
                 Arithmetization of analysis. Doubts. \\
                 \\
                 23. Complete Independence / 433 \\
                 Boole (1815--1864) \\
                 British mathematics. Damned at birth by snobbery.
                 Boole's struggle for education. False diagnoses.
                 Providence intervenes. Discovery of invariants. What is
                 algebra? A philosopher attacks a mathematician.
                 Frightful carnage. Boole's chance. ``The Laws of
                 Thought.'' Symbolic logic. Its mathematical
                 significance. Boolean algebra. Dead in his prime. \\
                 \\
                 24. The Man, Not the Method / 448 \\
                 Hermite (1822--1901) \\
                 Old problems and new methods. Hermite's masterful
                 mother. His detestation of examinations. Instructs
                 himself. Higher mathematics sometimes easier than
                 elementary. Educational disasters. Letters to Jacobi. A
                 master at twenty one. Revenge on his examiners. Abelian
                 functions. Pestered by Cauchy. Hermite's mysticism.
                 Solution of the general quintic. Transcendental
                 numbers. A hint to circle-squarers. Hermite's
                 internationalism. \\
                 \\
                 25. The Doubter / 466 \\
                 Kronecker (1823--1891) \\
                 Legend of an American saint. Lucky Kronecker. School
                 triumphs. Great gifts. Algebraic numbers. Battles with
                 Weierstrass. Kronecker's business career. Returns rich
                 to mathematics. The Galois theory. Kronecker's
                 lectures. His skepticism his most original
                 contribution. \\
                 \\
                 26. Anima Candida / 484 \\
                 Riemann (1826--1866) \\
                 Poor but happy. Riemann's chronic shyness. Destined for
                 the church. Saved. A famous hypothesis. Career at
                 G{\"o}ttingen. ``A new mathematic.'' Physical
                 researches. Application of topology to analysis.
                 Epoch-making essay on foundations of geometry. Gauss
                 enthusiastic. The. blessings of poverty. A root of
                 tensor analysis. Quest for health. Under a fig tree.
                 Riemann's landmark in geometry. Curvature of space.
                 Pathbreaking for relativity. \\
                 \\
                 27. Arithmetic the Second / 510 \\
                 Kummer (1810--1893), Dedekind (1831--1916) \\
                 Aged in the wood. Napoleonic warp to Kummer's
                 geniality. Equally gifted in the abstract and the
                 concrete. What Fermat's Last Theorem started. Theory of
                 ideal numbers. Kummer's invention comparable to
                 Lobatchewsky's. Wave surface in four dimensions. Big of
                 body, mind, and heart. Dedekind, last pupil of Gauss.
                 First expositor of Galois. Early interest in science.
                 Turns to mathematics. Dedekind's work on continuity.
                 His creation of the theory of ideals. \\
                 \\
                 28. The Last Universalist / 526 \\
                 Poincar{\'e} (1854--1912) \\
                 Poincar{\'e}'s universality and methods. Childhood
                 setbacks. Seized by mathematics. Keeps his sanity in
                 Franco--Prussian war. Starts as mining engineer. First
                 great work. Automorphic functions. ``The keys of the
                 algebraic cosmos.'' The problem of n bodies. Is Finland
                 civilized? Poincar{\'e}'s new methods in celestial
                 mechanics. Cosmogony. How mathematical discoveries are
                 made. Poincar{\'e}'s account. Forebodings and premature
                 death. \\
                 \\
                 29. Paradise Lost? / 555 \\
                 Cantor (1845--1918) \\
                 Old foes with new faces. Rotting creeds. Cantor's
                 artistic inheritance and father-fixation. Escape, but
                 too late. His revolutionary work gets him nowhere.
                 Academic pettiness. Disastrous consequences of ``safety
                 first.'' An epochal result. Paradox or truth? Infinite
                 existence of transcendentals. Aggressiveness advances,
                 timidity retires. Further spectacular claims. Two types
                 of mathematicians. Insane? counter-revolution. The
                 battle grows fiercer. Cursing the enemy. Universal loss
                 of temper. Where stands mathematics today? And where
                 will it stand tomorrow? Invictus. \\
                 \\
                 Index / 581",
}

@Book{Bell:1963:MAI,
  author =       "C. F. (Colin Frank) Bell and K. A. K. (Kenneth Alan
                 Keeler) Lott",
  title =        "Modern Approach to Inorganic Chemistry: a textbook for
                 higher national certificate and general degree
                 students",
  publisher =    "Butterworths",
  address =      "London, England",
  pages =        "xi + 295",
  year =         "1963",
  LCCN =         "QD33 .B38 1963",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Bell:1971:CSR,
  editor =       "C. Gordon Bell and Allen Newell",
  booktitle =    "Computer Structures: Readings and Examples",
  title =        "Computer Structures: Readings and Examples",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "xix + 668",
  year =         "1971",
  ISBN =         "0-07-004357-4",
  ISBN-13 =      "978-0-07-004357-2",
  LCCN =         "TK7888.3 .B4",
  bibdate =      "Tue Aug 15 18:20:34 MDT 1995",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/w/wilkes-maurice-v.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/w/wilkinson-james-hardy.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "Part 1 The Structure of Computers \\
                 Chapter 1 Introduction \\
                 Chapter 2 The PMS and ISP Descriptive Systems \\
                 Chapter 3 The Computer Space \\
                 Part 2 The Instruction-set Processor: Main-line
                 computers \\
                 Section 1 Processors with One Address per Instruction
                 \\
                 Chapter 4 Preliminary Discussion of the Logical Design
                 of an Electronic Computing Instrument \\
                 Chapter 5 The DEC PDP-8 \\
                 Chapter 6 The Whirlwind I Computer \\
                 Chapter 7 Some Aspects of the Logical Design of a
                 Control Computer: A Case Study \\
                 Chapter 8 The UNIVAC System \\
                 Section 2 Processors with a General-Register State \\
                 Chapter 9 The Design Philosophy of Pegasus, A
                 Quantity-production Computer \\
                 Chapter 10 An 8-bit-character Computer \\
                 Part 3 The Instruction-Set Processor Level: Variations
                 in the Processor \\
                 Section 1 Processors with Greater than One Address per
                 Instruction \\
                 Chapter 11 The Pilot ACE \\
                 Chapter 12 ZEBRA, A Simple Binary Computer \\
                 Chapter 13 UNIVAC Scientific (1103A) Instruction Logic
                 \\
                 Chapter 14 Instruction Logic of the MIDAC \\
                 Chapter 15 Instruction Logic of the Soviet Strela
                 (Arrow) \\
                 Section 2 Processors Constrained by a Cyclic, Primary
                 Memory \\
                 Chapter 16 The LGP-30 and LGP-21 \\
                 Chapter 17 IBM 650 Instruction Logic \\
                 Section 3 Processors for Variable-length-string Data
                 \\
                 Chapter 18 The IBM 1401 \\
                 Section 4 Desk Calculator Computers: Keyboard
                 Programmable Processors with Small Memories \\
                 Chapter 19 The OLIVETTI Programma 101 Desk Calculator
                 \\
                 Chapter 20 The HP Model 9100A Computing Calculator \\
                 Section 5 Processors with Stack Memories (Zero
                 Addresses per Instruction) \\
                 Chapter 21 Design of an Arithmetic Unit Incorporating a
                 Nesting Store \\
                 Chapter 22 Design of the B 5000 System \\
                 Section 6 Processors with Multiprogramming Ability \\
                 Chapter 23 One-level Storage System \\
                 Chapter 24 A User Machine in a Time-sharing System \\
                 Part 4 The Instruction-set Processor Level:
                 Special-function Processors \\
                 Section 1 Processors to Control Terminals and Secondary
                 Memories (Input-output Processors) \\
                 Chapter 25 The DEC 338 Display Processor \\
                 Section 2 Processors for Array Data \\
                 Chapter 26 NOVA: A List-oriented Computer \\
                 Chapter 27 The ILLIAC IV Computer \\
                 Section 3 Processors Defined by a Microprogram \\
                 Chapter 28 Microprogramming and the Design of the
                 Control Circuits in an Electronic Computer \\
                 Chapter 29 The Design of a General-Purpose
                 Microprogram-controlled Computer with Elementary
                 Structure \\
                 Section 4 Processors Based on a Programming Language
                 \\
                 Chapter 30 A Command Structure for Complex Information
                 Processing \\
                 Chapter 31 System Design of a FORTRAN Machine \\
                 Chapter 32 A Microprogrammed Implementation of EULER on
                 IBM System/360 Model 30 \\
                 Part 5 The PMS Level \\
                 Section 1 Computers with One Central Processor \\
                 Section 2 Computers with One Central Processor and
                 Multiple Input/Output Processors \\
                 Chapter 33 The IBM 1800 \\
                 Chapter 34 The Engineering Design of the Stretch
                 Computer \\
                 Chapter 35 PILOT, The NBS Multicomputer System \\
                 Section 3 Computers for Multiprocessing and Parallel
                 Processing \\
                 Chapter 36 D825 --- A Multiple-computer System for
                 Command and Control \\
                 Chapter 37 A Survey of Problems and Preliminary Results
                 Concerning Parallel Processing and Parallel Processors
                 \\
                 Section 4 Network Computers and Computer Networks \\
                 Chapter 38 The RW-400: A New Polymorphic Data System
                 \\
                 Chapter 39 Parallel Operation in the Control Data 6600
                 \\
                 Chapter 40 Computer Network Examples / 504 \\
                 Part 6 Computer Families \\
                 Section 1 The IBM 701--7094 II Sequence, a Family by
                 Evolution \\
                 Chapter 41 The IBM 7094 I, 11 / 517 \\
                 Section 2 The SDS 910--9300 Series, a Planned Family\\
                 Chapter 42 The SDS 910-9300 Series \\
                 Section 3 The IBM System/360 --- A Series of Planned
                 Machines Which Span a Wide Performance Range \\
                 Chapter 43 The Structure of System/360, Part I ---
                 Outline of the Logical Structure System Implementations
                 \\
                 Chapter 44 The Structure of System/360, Part II ---
                 System Implementations \\
                 Appendix PMS and ISP Notations",
  subject-dates = "John von Neumann (28 December 1903--8 February 1957);
                 James H. Wilkinson (27 September 1919--5 October 1986);
                 Sir Maurice Vincent Wilkes (26 June 1913--29 November
                 2010)",
  tableofcontents = "[NB: Bracketed chapter entries are subject cross
                 references] \\
                 Preface / v \\
                 Contributors / xiii \\
                 Acknowledgments / x \\
                 \\
                 Part 1 The Structure of Computers \\
                 \\
                 Chapter 1 Introduction / 3 \\
                 Chapter 2 The PMS and ISP Descriptive Systems / 15 \\
                 Chapter 3 The Computer Space / 37 \\
                 \\
                 Part 2 The Instruction-set Processor: Main-line
                 computers \\
                 \\
                 Section 1 Processors with One Address per Instruction /
                 89 \\
                 \\
                 Chapter 4 Preliminary Discussion of the Logical Design
                 of an Electronic Computing Instrument --- Arthur W.
                 Burks, Herman H. Goldstine, and John von Neumann / 92
                 \\
                 Chapter 5 The DEC PDP-8 / 120 \\
                 Chapter 6 The Whirlwind I Computer --- R. R. Everett /
                 137 \\
                 [Chapter 33 The IBM 1800] \\
                 Chapter 7 Some Aspects of the Logical Design of a
                 Control Computer: A Case Study --- R. L. Alonso, H.
                 Blair-Smith, and A. L. Hopkins / 146 \\
                 [Chapter 42 The SDS 910-9300 Series] \\
                 [Chapter 16 The LGP-30 and LGP-21] \\
                 [Chapter 17 IBM 650 Instruction Logic ---John W. Carr
                 III] \\
                 [Chapter 41 The IBM 7094 I, II] \\
                 Chapter 8 The UNIVAC System --- J. Presper Eckert, Jr,
                 James B. Weiner, H. Frazer Welsh, and Herbert F.
                 Mitchell / 157 \\
                 [Chapter 23 One-level Storage System --- T. Kilburn, D.
                 B. G. Edwards, M. J. Lanigan, and F. H. Summer] \\
                 [Chapter 34 The Engineering Design of the Stretch
                 Computer --- Erich Bloch] \\
                 \\
                 Section 2 Processors with a General-Register State \\
                 \\
                 Chapter 9 The Design Philosophy of Pegasus, A
                 Quantity-production Computer --- W. S. Elliott, C. E.
                 Owen, C. H. Devonald, and B. G. Maudsley / 171 \\
                 [Chapter 43 The Structure of System/360, Part I ---
                 Outline of the Logical Structure --- G. A. Blaauw and
                 F. P. Brooks, Jr.] \\
                 Chapter 10 An 8-bit-character Computer / 184 \\
                 [Chapter 39 Parallel Operation in the Control Data 6600
                 --- James E. Thornton] \\
                 \\
                 Part 3 The Instruction-Set Processor Level: Variations
                 in the Processor \\
                 \\
                 Section 1 Processors with Greater than One Address per
                 Instruction / 191 \\
                 \\
                 Chapter 11 The Pilot ACE --- J. H. Wilkinson / 193 \\
                 Chapter 12 ZEBRA, A Simple Binary Computer --- W. L.
                 van der Poel / 200 \\
                 Chapter 13 UNIVAC Scientific (1103A) Instruction Logic
                 --- John W. Carr III / 205 \\
                 [Chapter 38 The RW-400: A New Polymorphic Data System
                 --- R. E. Porter] \\
                 Chapter 14 Instruction Logic of the MIDAC --- John W.
                 Carr III / 209 \\
                 Chapter 15 Instruction Logic of the Soviet Strela
                 (Arrow) ---John W. Carr III / 213 \\
                 \\
                 Section 2 Processors Constrained by a Cyclic, Primary
                 Memory / 216 \\
                 \\
                 [Chapter 19 The OLIVETTI Programma 101 Desk Calculator]
                 \\
                 [Chapter 12 ZEBRA, A Simple Binary Computer --- W. L.
                 van der Poel] \\
                 Chapter 16 The LGP-30 and LGP-21 / 217 \\
                 [Chapter 11 The Pilot ACE --- J. H. Wilkinson] \\
                 [Chapter 8 The UNIVAC System --- J. Presper Eckert,
                 Jr., James R. Weiner, H. Frazer Welsh, and Herbert F.
                 Mitchell] \\
                 [Chapter 9 The Design Philosophy of Pegasus, A
                 Quantity-production Computer --- W. S. Elliott, C. E.
                 Owen, C. H. Devonald, and B. G. Maudsley] \\
                 Chapter 17 IBM 650 Instruction Logic --- John W. Carr
                 III / 220 \\
                 [Chapter 26 NOVA: A List-oriented Computer --- Joseph
                 E. Wirsching] \\
                 \\
                 Section 3 Processors for Variable-length-string Data /
                 224 \\
                 \\
                 Chapter 18 The IBM 1401 / 228 \\
                 [Chapter 10 An 8-bit-character Computer] \\
                 \\
                 Section 4 Desk Calculator Computers: Keyboard
                 Programmable Processors with Small Memories / 235 \\
                 \\
                 Chapter 19 The OLIVETTI Programma 101 Desk Calculator /
                 237 \\
                 Chapter 20 The HP Model 9100A Computing Calculator ---
                 Richard E. Monnier, Thomas E. Osborne, and David S.
                 Cochran / 243 \\
                 \\
                 Section 5 Processors with Stack Memories (Zero
                 Addresses per Instruction) / 257 \\
                 \\
                 Chapter 21 Design of an Arithmetic Unit Incorporating a
                 Nesting Store --- R. H. Allmark and J. R. Lucking / 262
                 \\
                 Chapter 22 Design of the B 5000 System --- William
                 Lonergan and Paul King / 267 \\
                 [Chapter 36 D825 --- A Multiple-computer System for
                 Command and Control --- James P. Anderson, Samuel A.
                 Hoffman, Joseph Shifman, and Robert J. Williams] \\
                 [Chapter 30 A Command Structure for Complex Information
                 Processing --- J. C. Shaw, A. Newell, H. A. Simon, T.
                 O. Ellis] \\
                 [Chapter 32 Microprogrammed Implementation of EULER on
                 IBM System/360 Model 30 --- Helmut Weber] \\
                 \\
                 Section 6 Processors with Multiprogramming Ability /
                 274 \\
                 \\
                 Chapter 23 One-level Storage System --- T. Kilburn, D.
                 B. G. Edwards, M. J. Lanigan, and F. H. Sumner / 276
                 \\
                 [Chapter 21 Design of the B 5000 System --- William
                 Lonergan and Paul King] \\
                 Chapter 24 A User Machine in a Time-sharing System ---
                 B. W. Lampson, W. W. Lichtenberger, and M. W. Pirtle /
                 291 \\
                 \\
                 Part 4 The Instruction-set Processor Level:
                 Special-function Processors \\
                 \\
                 Section 1 Processors to Control Terminals and Secondary
                 Memories (Input-output Processors) / 303 \\
                 \\
                 [Chapter 41 The IBM 7094 I, II] \\
                 [Chapter 43 The Structure of System/360, Part I ---
                 Outline of the Logical Structure ---- G. A. Blaauw and
                 F. P. Brooks, Jr.] \\
                 [Chapter 33 The IBM 1800] \\
                 Chapter 25 The DEC 338 Display Processor / 305 \\
                 \\
                 Section 2 Processors for Array Data / 315 \\
                 \\
                 Chapter 26 NOVA: A List-oriented Computer --- Joseph E.
                 Wirsching / 316 \\
                 Chapter 27 The ILLIAC IV Computer --- George H. Barnes,
                 Richard M. Brown, Maso Kato, David J. Kuck, Daniel L.
                 Slotnick, and Richard E. Stokes / 320 \\
                 \\
                 Section 3 Processors Defined by a Microprogram / 334
                 \\
                 \\
                 Chapter 28 Microprogramming and the Design of the
                 Control Circuits in an Electronic Computer --- M. V.
                 Wilkes and J. B. Stringer / 335 \\
                 Chapter 29 The Design of a General-Purpose
                 Microprogram-controlled Computer with Elementary
                 Structure --- Thomas W. Kampe / 341 \\
                 [Chapter 20 The HP Model 9100A Computing Calculator
                 ---Richard E. Monnier, Thomas E. Osborne, and David S.
                 Cochran] \\
                 [Chapter 32 A Microprogrammed Implementation of EULER
                 on IBM System/360 Model 30 --- Helmut Weber] \\
                 \\
                 Section 4 Processors Based on a Programming Language /
                 348 \\
                 \\
                 Chapter 30 A Command Structure for Complex Information
                 Processing --- J. C. Shaw, A.Newell, H. A. Simon, and
                 T. O. Ellis / 349 \\
                 \\
                 Chapter 31 System Design of a FORTRAN Machine ---
                 Theodore R. Bashkow, Azra Sasson, and Arnold Kronfeld /
                 363 \\
                 Chapter 32 A Microprogrammed Implementation of EULER on
                 IBM System/360 Model 30 --- Helmut Weber / 382 \\
                 \\
                 Part 5 The PMS Level \\
                 \\
                 Section 1 Computers with One Central Processor / 395
                 \\
                 \\
                 [Chapter 6 The Whirlwind I Computer --- R. R. Everett]
                 \\
                 [Chapter 42 The SDS 910-9300 Series] \\
                 \\
                 Section 2 Computers with One Central Processor and
                 Multiple Input/Output Processors / 396 \\
                 \\
                 [Chapter 5 The DEC PDP-8] \\
                 Chapter 33 The IBM 1800 / 399 \\
                 [Chapter 41 The IBM 7094 I, II] \\
                 [Chapter 43 The Structure of System/360, Part I ---
                 Outline of the Logical Structure -- G. A. Blaauw and F.
                 P. Brooks, Jr.] \\
                 Chapter 34 The Engineering Design of the Stretch
                 Computer -- Erich Bloch / 421 \\
                 Chapter 35 PILOT, The NBS Multicomputer System --- A.
                 L. Leiner, W. A. Notz, J. L. Smith, and A. Weinberger /
                 440 \\
                 \\
                 Section 3 Computers for Multiprocessing and Parallel
                 Processing / 446 \\
                 \\
                 Chapter 36 D825 --- A Multiple-computer System for
                 Command and Control --- James P. Anderson, Samuel A.
                 Hoffman, Joseph Shifman, and Robert J. Williams / 447
                 \\
                 [Chapter 22 Design of the B 5000 System ---- William
                 Lonergan and Paul King] \\
                 Chapter 37 A Survey of Problems and Preliminary Results
                 Concerning Parallel Processing and Parallel Processors
                 --- M. Lehman / 456 \\
                 \\
                 Section 4 Network Computers and Computer Networks / 470
                 \\
                 \\
                 Chapter 38 The RW-400: A New Polymorphic Data System
                 --- R. E. Porter / 477 \\
                 Chapter 39 Parallel Operation in the Control Data 6600
                 --- James E. Thornton / 489 \\
                 Chapter 40 Computer Network Examples / 504 \\
                 \\
                 Part 6 Computer Families \\
                 \\
                 Section 1 The IBM 701--7094 II Sequence, a Family by
                 Evolution / 515 \\
                 \\
                 Chapter 41 The IBM 7094 I, 11 / 517 \\
                 \\
                 Section 2 The SDS 910--9300 Series, a Planned Family /
                 542 \\
                 \\
                 Chapter 42 The SDS 910-9300 Series / 543 \\
                 \\
                 Section 3 The IBM System/360 --- A Series of Planned
                 Machines Which Span a Wide Performance Range / 561 \\
                 \\
                 Chapter 43 The Structure of System/360, Part I ---
                 Outline of the Logical Structure --- G. A. Blaauw and
                 F. P. Brooks, Jr. / 588 \\
                 Chapter 44 The Structure of System/360, Part II ---
                 System Implementations --- W. Y. Stevens / 602 \\
                 \\
                 Appendix PMS and ISP Notations / 607 \\
                 \\
                 General Conventions / 607 \\
                 \\
                 1 Basic Semantics / 608 \\
                 2 Metanotation / 608 \\
                 3 Basic Syntax / 609 \\
                 4 Commands: Assignments, Abbreviation, Variables, Forms
                 / 609 \\
                 5 Indefinite Expressions / 610 \\
                 6 Lists and Sets / 611 \\
                 7 Definite Expressions / 611 \\
                 8 Attributes / 612 \\
                 9 Null Symbol and Optional Expression / 613 \\
                 10 Names / 613 \\
                 11 Numbers / 614 \\
                 12 Quantities, Dimensions, and Units / 615 \\
                 13 Boolean and Relations / 615 \\
                 \\
                 PMS Conventions / 615 \\
                 \\
                 1 Dimensions / 616 \\
                 2 General Units / 616 \\
                 3 Information Units / 616 \\
                 4 Component / 617 \\
                 5 Link (L) / 619 \\
                 6 Memory (M) / 620 \\
                 7 Switch (S) / 623 \\
                 8 Control (K) / 624 \\
                 9 Transducer (T) / 625 \\
                 10 Data-operations (D) / 626 \\
                 11 Processor (P) / 626 \\
                 12 Computer (C) / 628 \\
                 \\
                 ISP Conventions / 628 \\
                 \\
                 1 Data-types / 629 \\
                 2 Instruction / 631 \\
                 3 Operations / 632 \\
                 4 Processors / 635 \\
                 \\
                 Bibliography / 638 \\
                 Name Index / 653 \\
                 Machine and Organization Index / 656 \\
                 Subject Index / 661",
}

@Book{Bell:1978:CED,
  editor =       "C. Gordon Bell and J. Craig Mudge and John E.
                 McNamara",
  booktitle =    "Computer Engineering: a {DEC} View of Hardware System
                 Design",
  title =        "Computer Engineering: a {DEC} View of Hardware System
                 Design",
  publisher =    pub-DP,
  address =      pub-DP:adr,
  pages =        "xxii + 585",
  year =         "1978",
  DOI =          "https://doi.org/10.1016/C2013-0-07693-1",
  ISBN =         "0-932376-00-2",
  ISBN-13 =      "978-0-932376-00-8",
  LCCN =         "TK7885B36 1978",
  bibdate =      "Wed Mar 13 11:36:34 MDT 2024",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/fortran1.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  keywords =     "DEC (Digital Equipment Corporation)",
  tableofcontents = "Forword / Kenneth H. Olsen / v--v \\
                 Preface / / vii--xii \\
                 Acknowledgements / / xv--xviii \\
                 1; Seven Views of Computer Systems / / 1--26 \\
                 2; Technology Progress in Logic and Memories / / 27--62
                 \\
                 3; Packaging and Manufacturing / / 63--91 \\
                 Part I: In the Beginning / 93--95 \\
                 4: Transistor Circuitry in the Lincoln TX-2 / Kenneth
                 H. Olsen / 97--102 \\
                 5: Digital Modules, The Basis for Computers / Richard
                 L. Best, Russell C. Doane, John E. McNamara / 103--118
                 \\
                 Part II: Introduction to Beginning of the Minicomputer
                 / / 119--121 \\
                 6: The PDP-1 and Other 18-Bit Computers / C. Gordon
                 Bell, Gerald Butler, Robert Gray, John E. McNamara,
                 Donald Vonada, Ronald Wilson / 123--174 \\
                 7: The PDP-8 and Other 12-Bit Computers / C. Gordon
                 Bell, John E. McNamara / 175--208 \\
                 8: Structural Levels of the PDP-8 / C. Gordon Bell,
                 Allen Newell, Daniel P. Siewiorek / 209--228 \\
                 Part III: Introduction to the PDP-11 Family / C. Gordon
                 Bell, J. Craig Mudge, John E. McNamara / 231--239 \\
                 9: A New Architecture for Minicomputers --- The DEC
                 PDP-11 / C. Gordon Bell, Roger Cady, Harold McFarland,
                 Bruce A. Delagi, James F. O'Loughlin, Ronald Noonan,
                 William A. Wulf / 241--262 \\
                 10: Cache Memories for PDP-11 Family Computers /
                 William D. Strecker / 263--267 \\
                 11: Buses, The Skeleton of Computer Structures / John
                 V. Levy / 269--299 \\
                 12: A Minicomputer-Compatible Microcomputer System: The
                 DEC LSI-11 / Mark J. Sebern / 301--313 \\
                 13: Design Decisions for the PDP-11/60 Mid-Range
                 Minicomputer / J. Craig Mudge / 315--326 \\
                 14: Impact of Implementation Design Tradeoffs on
                 Performance: The PDP-11, A Case Study / Edward A. Snow,
                 Daniel P. Siewiorek / 327--364 \\
                 15: Turning Cousins into Sisters: An Example of
                 Software Smoothing of Hardware Differences / Ronald F.
                 Brender / 365--378 \\
                 16: The Evolution of the PDP-11 / C. Gordon Bell, J.
                 Craig Mudge / 379--408 \\
                 17: VAX-11/780: A Virtual Address Extension to the DEC
                 PDP-11 Family / William D. Strecker / 409--428 \\
                 Part IV: Introduction to Evolution of Computer Building
                 Blocks / C. Gordon Bell, J. Craig Mudge, John E.
                 McNamara / 431--440 \\
                 18: The Description and Use of Register Transfer
                 Modules (RTMs) / C. Gordon Bell, John Eggert, John
                 Grason, Peter Williams / 441--448 \\
                 19: Using LSI Processor Bit-Slices to Build a PDP-11
                 --- A Case Study in Microcomputer Design / Thomas A.
                 McWilliams, Samuel H. Fuller, William H. Sherwood /
                 449--462 \\
                 20: Multi-Microprocessors: An Overview and Working
                 Example / Samuel H. Fuller, John K. Ousterhout, Levy
                 Raskin, Paul I. Rubinfeld, Pradeep S. Sindhu, Richard
                 J. Swan / 463--484 \\
                 Part V: Introduction to the PDP-10 Family / C. Gordon
                 Bell, J. Craig Mudge, John E. McNamara / 485, 487--488
                 \\
                 21: The Evolution of the DECsystem-10 / C. Gordon Bell,
                 Alan Kotok, Thomas N. Hastings, Richard Hill / 489--518
                 \\
                 Appendix 1: An ISPS Primer for the Instruction Set
                 Processor Notation / Mario Barbacci / 519--535 \\
                 Appendix 2: The PMS Notation / J. Craig Mudge /
                 537--539 \\
                 Appendix 3: Performance / C. Gordon Bell, J. Craig
                 Mudge, John E. McNamara / 541--552 \\
                 Bibliography / / 553--561 \\
                 Index / / 563--585",
}

@Book{Bell:1982:CSP,
  author =       "C. Gordon Bell and Daniel P. Siewiorek and Allen
                 Newell",
  booktitle =    "Computer Structures: Principles and Examples",
  title =        "Computer Structures: Principles and Examples",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  edition =      "Second.",
  pages =        "xvi + 926",
  year =         "1982",
  ISBN =         "0-07-057302-6",
  ISBN-13 =      "978-0-07-057302-4",
  LCCN =         "QA76.9.A73 C65; TK7888.3 .B37 1982",
  bibdate =      "Wed Mar 13 12:20:27 MDT 2024",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/w/wilkes-maurice-v.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "McGraw-Hill computer science series",
  abstract =     "Since the first version of this survey of information
                 on the development of the computer was published in
                 1971, a great deal has changed and much progress has
                 been made. All the machines discussed in this book have
                 actually been constructed and evaluated. The papers,
                 wherever possible, are written by the specific machine
                 architects or people closely associated with the
                 architectures. Several are presented in elaborate
                 detail, enabling the reader to appreciate the design
                 complexities encountered and design methodologies
                 employed by the architects. This volume favors depth
                 over breadth, so it is not possible to discuss all
                 important architectures (nor even all major
                 manufacturers). However, the architectures that are
                 included were carefully selected to uniformly cover the
                 major design principles of computer structures. It is
                 hoped that this book will serve as an educational
                 resource for computer engineers designing physical
                 systems, computer scientists concerned with programming
                 and abstract views of information processing, and
                 electrical engineers who sees computer systems as a
                 part of a larger technology.",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "Fundamentals \\
                 Regions of computer space \\
                 Microprogram-based processors \\
                 Memory hierarchies and multiple processes \\
                 Concurrency: single-processor systems \\
                 Multiple-processor systems \\
                 Networks \\
                 Fault-tolerant systems \\
                 Language-based computers \\
                 Personal computing systems \\
                 Computer classes \\
                 Monolithic microcomputers \\
                 Microcomputers \\
                 Minicomputers \\
                 Maxicomputers \\
                 Family range, compatibility, and evolution \\
                 Microcomputer families \\
                 Minicomuter families \\
                 Evolution of HP calculations \\
                 Evolution of Burroughs computers \\
                 The System/360 and System/370 \\
                 Evolution of CDC/CRAY computers",
  subject =      "Computer architecture; Ordinateurs; Architecture;
                 Computer architecture.",
  tableofcontents = "Part 1: Fundamentals; Section 1: Abstraction and
                 notation \\
                 Computer classes and evolution \\
                 Levels and abstractions \\
                 PMS notation \\
                 An introduction to ISPS / Mario R. Barbacci \\
                 Section 2: The computer space \\
                 Function and performance \\
                 Structure \\
                 Section 3: Computers of historical significance \\
                 The Manchester Mark 1 / S. H. Lavington \\
                 Structural levels of PDS-8 / C. Gordon Bell, Allen
                 Newell, and Daniel P. Siewiorek \\
                 Design of the B 5000 system / William Lonergan and Paul
                 King \\
                 One-level storage system / T. Kilburn, D. B. G.
                 Edwards, M. J. Lanigan, and F. H. Sumner \\
                 Part 2: Regions of computer space ; Section 1:
                 Microprogram-based processors \\
                 Microprogramming and the design of the control circuits
                 in an electronic digital computer / M. V. Wilkes and J.
                 B. Stringer \\
                 Microprogramming the IBM System/360 Model 30 / Helmut
                 Weber \\
                 Bit-sliced microprocessor of the Am2900 family: the
                 Am2901/2909 / Advanced Micro Devices, Inc. \\
                 The Am2903/2910 / Advanced Micro Devices, Inc. \\
                 A PDP-8 implemented from AMD bit-sliced microprocessors
                 / Michael Tsao \\
                 Section 2: Memory hierarchies and multiple processes
                 \\
                 Burroughs' B6500/B7500 stack mechanism / E. A. Hauck
                 and B. A. Dent \\
                 An outline of the ICL 2900 series system architecture /
                 J. L. Keedy --Part 2: Regions of computer space
                 (continued) ; Section 3: Concurrency: single-processor
                 systems \\
                 The IBM System/360 Model 91: machine philosophy and
                 instruction handling / D. W. Anderson, F. J. Sparacio,
                 and R. M. Tomasulo \\
                 An efficient algorithm for exploiting multiple
                 arithmetic units / R. M. Tomasulo \\
                 The Illiac IV system / W. J. Bouknight, Stewart A.
                 Denenberg, David E. McIntyre, J. M. Randall, Amed H.
                 Sameh, and Daniel L. Slotnick \\
                 A productive implementation of an associative array
                 processor: STARAN / Jack A. Rudolph and Kenneth E.
                 Batcher \\
                 Section 4: Multiple-processor systems \\
                 The C.mmp/Hydra project: an architectural overview /
                 Henry H. Mashburn \\
                 Pluribus: an operational fault-tolerant multiprocessor
                 / David Katsuki, Eric S. Elsam, William F. Mann, Eric
                 S. Roberts, John G. Robinson, F. Stanley Skowronski,
                 and Eric W. Wolf \\
                 Section 5: Networks \\
                 The interface message processor for the ARPA computer
                 network / F. E. Heart, R. E. Kahn, S. M. Ornstein, W.
                 R. Crowther, and D. C. Walden \\
                 ALOHA packet broadcasting: a retrospect / R. Binder, N.
                 Abramson, F. Kuo, A. Okinaka, and D. Wax \\
                 Ethernet: distributed packet switching for local
                 computer networks / Robert M. Metcalfe and David R.
                 Boggs --Part 2: Regions of computer space (continued) ;
                 Section 6: Fault-tolerant systems \\
                 The STAR (Self-Testing And Repairing) computer: an
                 investigation of the theory and practice of
                 fault-tolerant computer design / Algirdas Avizienis,
                 George C. Gilley, Francis P. Mathur, David A. Rennels,
                 John A. Bohr, and David K. Rubin \\
                 Fault-tolerant design of local ESS processors / W. N.
                 Toy \\
                 The Tandem 16: a fault-tolerant computing system /
                 James A. Katzman \\
                 Section 7: Language-based computers \\
                 The SYMBOL computer \\
                 SYMBOL, a large experimental system exploring major
                 hardware replacement of software / William R. Smith,
                 Rex Rice, Gilman D. Chesley, Theodore A. Laliotis,
                 Stephen F. Lundstrom, Myron A. Calhoun, Lawrence D.
                 Gerould, and Thomas G. Cook \\
                 SYMBOL: a major departure from classic software
                 dominated von Neumann computing systems / R. Rice and
                 W. R. Smith \\
                 A dual-processor desk-top computer: the HP 9845A /
                 William D. Eads, Jack M. Walden, and Edward L. Miller
                 \\
                 The IBM/system38 \\
                 A high-level machine / S. H. Dalby, G. G. Henry, D. N.
                 Reynolds, and P. T. Taylor \\
                 Object-oriented architecture / K. W. Pinnow, J. G.
                 Ranweiler, and J. F. Miller \\
                 Addressing and authorization / V. Berstis, C. D.
                 Truxal, and J. G. Ranweiler \\
                 Hardware organization of the system/38 / R. L. Hoffman
                 and F. G. Soltis \\
                 Section 8: Personal computing systems \\
                 Alto: a personal computer / C. P. Thacker, E. M.
                 McCreight, B. W. Lampson, R. F. Sproull, and D. R.
                 Boggs --Part 3: Computer classes ; Section 1:
                 Monolithic microcomputers \\
                 TMS1000/1200: chip architecture and operation / Texas
                 Instruments, Inc. \\
                 PIC1650: chip architecture and operation / Frank M.
                 Gruppuso \\
                 Section 2: Microcomputers \\
                 Trends in microcomputers / F. Faggin \\
                 Intel microprocessors: 8008 to 8086 / Stephen P. Morse,
                 Bruce W. Ravenel, Stanley Mazor, and William B. Pohlman
                 \\
                 Section 3: Minicomputers \\
                 A new architecture for mini-computers: the DEC PDP-11 /
                 G. Bell, R. Cady, H. McFarland, B. Delagi, J.
                 O'Laughlin, R. Noonan, and W. Wulf \\
                 Implementation and performance evaluation of the PDP-11
                 family / Edward A. Snow and Daniel P. Siewiorek \\
                 Section 4: Maxicomputers \\
                 The structure of [IBM] System/360, part I: outline of
                 the logical structure / G. A. Blaauw and F. P. Brooks,
                 Jr. \\
                 The structure of [IBM] System/360, part II: system
                 implementation / W. Y. Stevens \\
                 VAX-11/780: a virtual address extension to the DEC
                 PDP-11 family / W. D. Strecker \\
                 Parallel operation in the Control Data 6600 / James E.
                 Thornton \\
                 The CRAY-1 computer system / Richard M. Russell \\
                 The TI ASC: a highly modular and flexible super
                 computer architecture / W. J. Watson and L. C. Dean
                 --Part 4: Family range, compatibility and evolution ;
                 Section 1: Microcomputer families \\
                 Section 2: Minicomputer families \\
                 The PDP-8 family / C. G. Bell and J. E. McNamara \\
                 The evolution of the PDP-11 / C. G. Bell and J. C.
                 Mudge \\
                 Section 3: Evolution of HP calculators \\
                 The HP model 9100A computing calculator / Richard E.
                 Monnier, Thomas E. Osborne, and David S. Cochran \\
                 The HP 9810/20/30 series \\
                 A new series of programmable calculators / Richard M.
                 Spangler \\
                 Model 10 maintains compatibility, expands capability /
                 Curtis D. Brown and Jack M. Walden \\
                 Interactive model 20 speaks algebraic language / Rex L.
                 James and Francis J. Yockey \\
                 BASIC-language model 30 can be calculator, computer, or
                 terminal / Richard M. Spangler \\
                 9800 processor incorporates 8-MHz microprocessor /
                 Henry J. Kohoutek \\
                 Versatile input/output structure welcomes peripheral
                 variety / Gary L. Egan \\
                 Hewlett Packard calculator architectures / Thomas E.
                 Osborne \\
                 Section 4: Evolution of Burroughs computers \\
                 Section 5: The [IBM] System/360 and System/370 family
                 \\
                 Architecture of the IBM system/370 / Richard P. Case
                 and Andris Padegs \\
                 The IBM System/360, System/370, 3030, and 4300: a
                 series of planned machines that span a wide performance
                 range / C. G. Bell, A. Newell, M. Reich, and D.
                 Siewiorek \\
                 Section 6: Evolution of CDC/CRAY computers",
}

@TechReport{Bell:rs6000-tuning,
  author =       "Ron Bell",
  title =        "{IBM RISC System\slash 6000} Performance Tuning for
                 Numerically Intensive {Fortran} and {C} Programs",
  number =       "GG24-3611-00",
  institution =  pub-IBM,
  month =        aug,
  year =         "1990",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Bellamy:1974:ICO,
  author =       "Anthony J. Bellamy",
  title =        "An Introduction to Conservation of Orbital Symmetry",
  publisher =    "Longman Group Limited",
  address =      "London, England",
  pages =        "77",
  year =         "1974",
  ISBN =         "0-582-44089-0",
  ISBN-13 =      "978-0-582-44089-0",
  LCCN =         "QD476.B363",
  bibdate =      "Mon Jul 27 06:58:31 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Preface / v \\
                 Introduction / ix \\
                 1: Atomic and Molecular Orbitals / 1 \\
                 2: Electrocyclic Reactions: \\
                 Frontier Orbital Approach / 11 \\
                 Orbital Correlation Diagrams / 18 \\
                 3: Cyclo-addition Reactions / 37 \\
                 4: Sigmatropic Migration Reactions / 55 \\
                 5: State Correlation Diagrams / 69 \\
                 Further Reading / 75 \\
                 Index / 77",
}

@Book{Bellovin:2015:TSS,
  author =       "Steven M. Bellovin",
  title =        "Thinking Security: Stopping Next Year's Hackers",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xv + 381",
  year =         "2016",
  ISBN =         "0-13-427754-6 (hardcover), 0-13-427822-4,
                 0-13-427823-2 (e-book)",
  ISBN-13 =      "978-0-13-427754-7 (hardcover)",
  LCCN =         "TK5105.59 .B45154 2016",
  bibdate =      "Tue May 6 09:20:20 MDT 2025",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Addison-Wesley Professional Computing Series",
  abstract =     "If you're a security or network professional, you
                 already know the ``do's and don'ts'': run AV software
                 and firewalls, lock down your systems, use encryption,
                 watch network traffic, follow best practices, hire
                 expensive consultants, but it isn't working. You're at
                 greater risk than ever, and even the world's most
                 security-focused organizations are being victimized by
                 massive attacks. In Thinking Security, author Steven M.
                 Bellovin provides a new way to think about security. As
                 one of the world's most respected security experts,
                 Bellovin helps you gain new clarity about what you're
                 doing and why you're doing it. He helps you understand
                 security as a systems problem, including the role of
                 the all-important human element, and shows you how to
                 match your countermeasures to actual threats. You'll
                 learn how to move beyond last year's checklists at a
                 time when technology is changing so rapidly. You'll
                 also understand how to design security architectures
                 that don't just prevent attacks wherever possible, but
                 also deal with the consequences of failures. And,
                 within the context of your coherent architecture,
                 you'll learn how to decide when to invest in a new
                 security product and when not to. Bellovin, co-author
                 of the best-selling Firewalls and Internet Security,
                 caught his first hackers in 1971. Drawing on his deep
                 experience, he shares actionable, up-to-date guidance
                 on issues ranging from SSO and federated authentication
                 to BYOD, virtualization, and cloud security. Perfect
                 security is impossible. Nevertheless, it's possible to
                 build and operate security systems far more
                 effectively. Thinking Security will help you do just
                 that.",
  acknowledgement = ack-nhfb,
  subject =      "computer networks; security measures; computer
                 security; hacking; prevention",
  tableofcontents = "Defining the problem. Introduction \\
                 Thinking about security \\
                 Threat models \\
                 Technologies. Antivirus software \\
                 Firewalls and intrusion detection systems \\
                 Cryptography and VPNs \\
                 Passwords and authentication \\
                 PKI: Public Key Infrastructures \\
                 Wireless access \\
                 Clouds and virtualization \\
                 Secure operations. Building secure systems \\
                 Selecting software \\
                 Keeping software up to date \\
                 People \\
                 System administration \\
                 Security process \\
                 The future. Case studies --- Doing security properly",
}

@Book{Ben-Naim:2008:EDS,
  author =       "Arieh Ben-Naim",
  title =        "Entropy Demystified: The {Second Law} Reduced to Plain
                 Common Sense",
  publisher =    pub-WORLD-SCI,
  address =      pub-WORLD-SCI:adr,
  edition =      "Revised",
  pages =        "xxxi + 225",
  year =         "2008",
  ISBN =         "981-283-225-4",
  ISBN-13 =      "978-981-283-225-2",
  LCCN =         "QC318.E57 B46 2007",
  bibdate =      "Mon Jan 23 18:59:08 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "Preface: Programs for simulating some of the games
                 in the book \\
                 Introduction, and a short history of the Second Law of
                 Thermodynamics \\
                 A brief introduction to probability theory, information
                 theory, and all the rest \\
                 First let us play with real dice \\
                 Let's play with simplified dice and have a preliminary
                 grasp of the Second Law \\
                 Experience the Second Law with all your five senses \\
                 Finally, grasp it with your common sense \\
                 Translating from the dice-world to the real world \\
                 Reflections on the status of the Second Law of
                 Thermodynamics as a law of physics",
}

@Book{Bennett:1933:CFC,
  editor =       "H. Bennett",
  title =        "The Chemical Formulary: a Condensed Collection of
                 Valuable, Timely, Practical Formulae for Making
                 Thousands of Products in All Fields of Industry",
  volume =       "1",
  publisher =    "Chemical Publishing Co., Inc.",
  address =      "New York, NY, USA",
  pages =        "x + 604",
  year =         "1933",
  LCCN =         "TP151 .B439",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Bennett:1935:CFC,
  editor =       "H. Bennett",
  title =        "The Chemical Formulary: a Condensed Collection of
                 Valuable, Timely, Practical Formulae for Making
                 Thousands of Products in All Fields of Industry",
  volume =       "2",
  publisher =    "Chemical Publishing Co., Inc.",
  address =      "New York, NY, USA",
  pages =        "ix + 570",
  year =         "1935",
  LCCN =         "TP151 .B439",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Bennett:2021:LKW,
  author =       "Michael Bennett",
  title =        "Lunch with the {Kaiser}: Why {Europe} Went to War in
                 1914",
  publisher =    "????",
  address =      "Las Vegas, NV, USA",
  pages =        "197",
  year =         "2021",
  ISBN =         "1-67100-082-X",
  ISBN-13 =      "978-1-67100-082-7",
  LCCN =         "????",
  bibdate =      "Fri Nov 12 20:20:08 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  remark =       "Possibly self-published. Publisher name and year
                 omitted, but back page has 31 October 2021.",
  tableofcontents = "Chronology \\
                 Dramatis personae \\
                 1: A thousand words \\
                 2: Huis Doorn \\
                 3: Bismarck's legacy \\
                 4: A rift in the family \\
                 5: Missed opportunity \\
                 6: Entente Cordiale \\
                 7: Year of scandal \\
                 8: Sea power \\
                 9: Turning Point \\
                 10: War in the east \\
                 11: War in the west \\
                 12: On the Boat \\
                 13: Berlin \\
                 Epilogue \\
                 Appendix: Extracts from the Cabinet diary of J. A.
                 Pease, 26th July--4th August, 1914",
}

@Book{Bentley:1982:WEP,
  author =       "Jon Louis Bentley",
  title =        "Writing Efficient Programs",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xvi + 170",
  year =         "1982",
  ISBN =         "0-13-970251-2 (hardcover), 0-13-970244-X (paperback)",
  ISBN-13 =      "978-0-13-970251-8 (hardcover), 978-0-13-970244-0
                 (paperback)",
  LCCN =         "QA76.6 .B455 1982",
  bibdate =      "Tue Dec 14 22:40:54 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$22.95 (hardcover), US\$14.95 (paperback)",
  acknowledgement = ack-nhfb,
}

@Book{Bentley:1986:PP,
  author =       "Jon Louis Bentley",
  title =        "Programming Pearls",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "viii + 195",
  year =         "1986",
  ISBN =         "0-201-10331-1 (paperback)",
  ISBN-13 =      "978-0-201-10331-1 (paperback)",
  LCCN =         "QA76.6.B453 1986",
  bibdate =      "Wed Dec 15 08:16:02 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
                 https://www.math.utah.edu/pub/bibnet/subjects/han-wri-mat-sci-2ed.bib;
                 https://www.math.utah.edu/pub/tex/bib/css.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/spell.bib;
                 https://www.math.utah.edu/pub/tex/bib/string-matching.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  note =         "Reprinted with corrections.",
  acknowledgement = ack-nhfb,
  remark =       "Chapter 13, A Spelling Checker, discusses the design
                 and implementation of Unix spell, and notes that
                 ``Steve Johnson wrote the first version of {\tt spell}
                 in an afternoon in 1975.''.",
  shorttableofcontents = "1: Cracking the oyster \\
                 2: Aha! algorithms \\
                 3: Data structures programs \\
                 4: Writing correct programs \\
                 5: Perspective on performance \\
                 6: Back of the envelope \\
                 7: Algorithm design techniques \\
                 8: Code tuning \\
                 9: Squeezing space \\
                 10: Sorting \\
                 11: Searching \\
                 12: Heaps \\
                 13: Spelling checker",
  tableofcontents = "Part I: Preliminaries / 1 \\
                 Column 1: Cracking the Oyster / 3 \\
                 A Friendly Conversation \\
                 Precise Problem Statement \\
                 Program Design \\
                 Implementation Sketch \\
                 Principles \\
                 Problems \\
                 Further Reading \\
                 Column 2: Aha! Algorithms / 11 \\
                 Three Problems \\
                 Ubiquitous Binary Search \\
                 The Power of Primitives \\
                 Getting It Together: Sorting \\
                 Principles \\
                 Problems \\
                 Further Reading \\
                 Implementing an Anagram Program \\
                 Column 3: Data Structures Programs / 23 \\
                 A Survey Program \\
                 Form Letters \\
                 An Array of Examples \\
                 A Big Program \\
                 Principles \\
                 Problems \\
                 Further Reading \\
                 Column 4: Writing Correct Programs / 35 \\
                 The Challenge of Binary Search \\
                 Writing the Program \\
                 Understanding the Program \\
                 Implementing the Program \\
                 Principles \\
                 The Roles of Program Verification \\
                 Problems \\
                 Further Reading \\
                 Industrial-Strength Program Verification \\
                 Part II: Performance / 49 \\
                 Column 5: Perspective on Performance / 51 \\
                 A Case Study \\
                 Design Levels \\
                 Principles \\
                 Problems \\
                 Further Reading \\
                 Column 6: The Back of the Envelope / 59 \\
                 Basic Skills \\
                 Quick Calculations in Computing \\
                 Safety Factors \\
                 A Case Study \\
                 Principles \\
                 Problems \\
                 Further Reading \\
                 Quick Calculations in Everyday Life \\
                 Column 7: Algorithm Design Techniques / 69 \\
                 The Problem and a Simple Algorithm \\
                 Two Quadratic Algorithms \\
                 A Divide-and-Conquer Algorithm \\
                 A Scanning Algorithm \\
                 What Does It Matter? \\
                 Principles \\
                 Problems \\
                 Further Reading \\
                 The Impact of Algorithms \\
                 Column 8: Code Tuning / 81 \\
                 A Typical Story \\
                 A First Aid Quiz \\
                 Major Surgery --- Binary Search \\
                 Principles \\
                 Problems \\
                 Further Reading \\
                 Tuning the Federal Government's COBOL Code \\
                 Column 9: Squeezing Space / 93 \\
                 The Key --- Simplicity \\
                 Data Space \\
                 Code Space \\
                 Principles \\
                 Problems \\
                 Further Reading \\
                 Two Big Squeezes \\
                 Part III: The Product / 105 \\
                 Column 10: Sorting / 107 \\
                 Insertion Sort --- An $O(N^2)$ Algorithm \\
                 Quicksort --- An $O(N \log N)$ Algorithm \\
                 Principles \\
                 Problems \\
                 Further Reading \\
                 Column 11: Searching / 117 \\
                 The Problem \\
                 One Solution \\
                 The Design Space \\
                 Principles \\
                 Problems \\
                 Further Reading \\
                 Column 12: Heaps / 125 \\
                 The Data Structure \\
                 Two Critical Routines \\
                 Priority Queues \\
                 A Sorting Algorithm \\
                 Principles \\
                 Problems \\
                 Further Reading \\
                 Column 13: A Spelling Checker / 139 \\
                 A Simple Program \\
                 The Design Space \\
                 A Subtle Program \\
                 Principles \\
                 Problems \\
                 Further Reading \\
                 Why Spelling is Hard \\
                 Epilog / 151 \\
                 Appendix: Catalog of Algorithms / 155 \\
                 Hints for Selected Problems / 159 \\
                 Solutions to Selected Problems / 163 \\
                 Index / 189",
}

@Book{Bentley:1988:MPP,
  author =       "Jon Louis Bentley",
  title =        "More Programming Pearls: Confessions of a Coder",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "viii + 207",
  year =         "1988",
  ISBN =         "0-201-11889-0",
  ISBN-13 =      "978-0-201-11889-6",
  LCCN =         "QA76.6 .B452 1988",
  bibdate =      "Sun Dec 04 12:36:49 1994",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
                 https://www.math.utah.edu/pub/bibnet/subjects/han-wri-mat-sci-2ed.bib;
                 https://www.math.utah.edu/pub/tex/bib/css.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  price =        "US\$18.75",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "Part I: Programming Techniques / 1 \\
                 Column 1: Profilers / 3 \\
                 Column 2: Associative Arrays / 15 \\
                 Column 3: Confessions of a Coder / 27 \\
                 Column 4: Self-Describing Data / 37 \\
                 Part II: Tricks of the Trade / 45 \\
                 Column 5: Cutting the Gordian Knot / 47 \\
                 Column 6: Bumper-Sticker Computer Science / 57 \\
                 Column 7: The Envelope is Back / 69 \\
                 Column 8: The Furbelow Memorandum / 77 \\
                 Part III: I/O Fit for Humans / 81 \\
                 Column 9: Little Languages / 83 \\
                 Column 10: Document Design / 101 \\
                 Column 11: Graphic Output / 115 \\
                 Column 12: A Survey of Surveys / 127 \\
                 Part IV: Algorithms \\
                 Column 13: A Sample of Brilliance / 139 \\
                 Column 14: Birth of a Cruncher / 147 \\
                 Column 15: Selection / 159 \\
                 Appendix 1: The C and Awk Languages / 171 \\
                 Appendix 2: A Subroutine Library / 175 \\
                 Solutions to Selected Problems / 183 \\
                 Index / 203",
  tableofcontents = "Part I: Programming Techniques / 1 \\
                 Column 1: Profilers / 3 \\
                 Computing Primes \\
                 Using Profilers \\
                 A Specialized Profiler \\
                 Building Profilers \\
                 Principles \\
                 Problems \\
                 Further Reading \\
                 Column 2: Associative Arrays / 15 \\
                 Associative Arrays in Awk \\
                 A Finite State Machine Simulator \\
                 Topological Sorting \\
                 Principles \\
                 Problems \\
                 Further Reading \\
                 Column 3: Confessions of a Coder / 27 \\
                 Binary Search \\
                 Selection \\
                 A Subroutine Library \\
                 Principles \\
                 Problems \\
                 Column 4: Self-Describing Data / 37 \\
                 Name-Value Pairs \\
                 Provenances in Programming \\
                 A Sorting Lab \\
                 Principles \\
                 Problems \\
                 Part II: Tricks of the Trade / 45 \\
                 Column 5: Cutting the Gordian Knot / 47 \\
                 A Quiz \\
                 Some Solutions \\
                 Hints \\
                 Principles \\
                 Problems \\
                 Further Reading \\
                 Debugging \\
                 Column 6: Bumper-Sticker Computer Science / 57 \\
                 Coding \\
                 User Interfaces \\
                 Debugging \\
                 Performance \\
                 Documentation \\
                 Managing Software \\
                 Miscellaneous Rules \\
                 Principles \\
                 Problems \\
                 Further Reading \\
                 Column 7: The Envelope is Back / 69 \\
                 A Warm-Up for Cool Brains \\
                 Performance Rules of Thumb \\
                 Little's Law \\
                 Principles \\
                 Problems \\
                 Further Reading \\
                 Quick Calculations in Everyday Life \\
                 Column 8: The Furbelow Memorandum / 77 \\
                 The Memo \\
                 Principles \\
                 Further Reading \\
                 Part III: I/O Fit for Humans / 81 \\
                 Column 9: Little Languages / 83 \\
                 The Pic Language \\
                 Perspective \\
                 Pic Preprocessors \\
                 Little Languages for Implementing Pic \\
                 Principles \\
                 Problems \\
                 Further Reading \\
                 Column 10: Document Design / 101 \\
                 Tables \\
                 Three Design Principles \\
                 Figures \\
                 Text \\
                 The Right Medium \\
                 Principles \\
                 Problems \\
                 Further Reading \\
                 A Catalog of Pet Peeves \\
                 Column 11: Graphic Output / 115 \\
                 A Case Study \\
                 A Sampler of Displays \\
                 Principles \\
                 Problems \\
                 Further Reading \\
                 Napoleon's March to Moscow \\
                 Column 12: A Survey of Surveys / 127 \\
                 The Problems of Polling \\
                 The Languages \\
                 The Pictures \\
                 Principles \\
                 Problems \\
                 Part IV: Algorithms \\
                 Column 13: A Sample of Brilliance / 139 \\
                 A Sampling of Sampling Algorithms \\
                 Floyd's Algorithm \\
                 Random Permutations \\
                 Principles \\
                 Problems \\
                 Further Reading \\
                 Column 14: Birth of a Cruncher / 147 \\
                 The Problem \\
                 Newton Iteration \\
                 A Great Place to Start \\
                 The Code \\
                 Principles \\
                 Problems \\
                 Further Reading \\
                 A Big Success Story \\
                 Column 15: Selection / 159 \\
                 The Problem \\
                 The Program \\
                 Analysis of Run Time \\
                 Principles \\
                 Problems \\
                 Further Reading \\
                 Appendix 1: The C and Awk Languages / 171 \\
                 Appendix 2: A Subroutine Library / 175 \\
                 Solutions to Selected Problems / 183 \\
                 Index / 203",
}

@Book{Bentley:2000:PP,
  author =       "Jon Louis Bentley",
  title =        "Programming Pearls",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Second",
  pages =        "xi + 239",
  year =         "2000",
  ISBN =         "0-201-65788-0 (paperback), 0-13-449802-X (e-book),
                 0-13-449805-4",
  ISBN-13 =      "978-0-201-65788-3 (paperback), 978-0-13-449802-7
                 (e-book), 978-0-13-449805-8",
  LCCN =         "QA76.6 .B454 2000",
  bibdate =      "Fri Jul 12 17:17:23 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/css.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/string-matching.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  price =        "US\$24.95",
  abstract =     "Just as natural pearls grow from grains of sand that
                 irritate oysters, programming pearls have grown from
                 real problems that have irritated real programmers.
                 With origins beyond solid engineering, in the realm of
                 insight and creativity, Bentley's pearls offer unique
                 and clever solutions to those nagging problems.
                 Illustrated by programs designed as much for fun as for
                 instruction, the book is filled with lucid and witty
                 descriptions of practical programming techniques and
                 fundamental design principles. It is not at all
                 surprising that \booktitle{Programming Pearls} has been
                 so highly valued by programmers at every level of
                 experience.",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "Part I: Preliminaries / 1 \\
                 Column 1: Cracking the Oyster / 3 \\
                 Column 2: Aha! Algorithms / 11 \\
                 Column 3: Data Structures Programs / 21 \\
                 Column 4: Writing Correct Programs / 33 \\
                 Column 5: A Small Matter of Programming / 45 \\
                 Part II: Performance / 59 \\
                 Column 6: Perspective on Performance / 61 \\
                 Column 7: The Back of the Envelope / 67 \\
                 Column 8: Algorithm Design Techniques / 77 \\
                 Column 9: Code Tuning / 87 \\
                 Column 10: Squeezing Space / 99 \\
                 Part III: The Product / 113 \\
                 Column 11: Sorting / 115 \\
                 Column 12: A Sample Problem / 125 \\
                 Column 13: Searching / 133 \\
                 Column 14: Heaps / 147 \\
                 Column 15: Strings of Pearls / 161 \\
                 Epilog to the First Edition / 175 \\
                 Epilog to the Second Edition / 177 \\
                 Appendix 1: A Catalog of Algorithms / 179 \\
                 Appendix 2: An Estimation Quiz / 183 \\
                 Appendix 3: Cost Models for Time and Space / 185 \\
                 Appendix 4: Rules for Code Tuning / 191 \\
                 Appendix 5: C++ Classes for Searching / 197 \\
                 Hints for Selected Problems / 201 \\
                 Solutions to Selected Problems / 205 \\
                 Index / 233",
  tableofcontents = "Part I: Preliminaries / 1 \\
                 Column 1: Cracking the Oyster / 3 \\
                 A Friendly Conversation \\
                 Precise Problem Statement \\
                 Program Design \\
                 Implementation Sketch \\
                 Principles \\
                 Problems \\
                 Further Reading \\
                 Column 2: Aha! Algorithms / 11 \\
                 Three Problems \\
                 Ubiquitous Binary Search \\
                 The Power of Primitives \\
                 Getting It Together: Sorting \\
                 Principles \\
                 Problems \\
                 Further Reading \\
                 Implementing an Anagram Program \\
                 Column 3: Data Structures Programs / 21 \\
                 A Survey Program \\
                 Form-Letter Programming \\
                 An Array of Examples \\
                 Structuring Data \\
                 Powerful Tools for Specialized Data \\
                 Principles \\
                 Problems \\
                 Further Reading \\
                 Column 4: Writing Correct Programs / 33 \\
                 The Challenge of Binary Search \\
                 Writing the Program \\
                 Understanding the Program \\
                 Principles \\
                 The Roles of Program Verification \\
                 Problems \\
                 Further Reading \\
                 Column 5: A Small Matter of Programming / 45 \\
                 From Pseudocode to C \\
                 A Test Harness \\
                 The Art of Assertion \\
                 Automated Testing \\
                 Timing \\
                 The Complete Program \\
                 Principles \\
                 Problems \\
                 Further Reading \\
                 Debugging \\
                 Part II: Performance / 59 \\
                 Column 6: Perspective on Performance / 61 \\
                 A Case Study \\
                 Design Levels \\
                 Principles \\
                 Problems \\
                 Further Reading \\
                 Column 7: The Back of the Envelope / 67 \\
                 Basic Skills \\
                 Performance Estimates Safety Factors \\
                 Little's Law \\
                 Principles \\
                 Problems \\
                 Further Reading \\
                 Quick Calculations in Everyday Life \\
                 Column 8: Algorithm Design Techniques / 77 \\
                 The Problem and a Simple Algorithm \\
                 Two Quadratic Algorithms \\
                 A Divide-and-Conquer Algorithm \\
                 A Scanning Algorithm \\
                 What Does It Matter? \\
                 Principles \\
                 Problems \\
                 Further Reading \\
                 Column 9: Code Tuning / 87 \\
                 A Typical Story \\
                 A First Aid Sampler \\
                 Major Surgery --- Binary Search \\
                 Principles \\
                 Problems \\
                 Further Reading \\
                 Column 10: Squeezing Space / 99 \\
                 The Key --- Simplicity \\
                 An Illustrative Problem \\
                 Techniques for Data Space \\
                 Techniques for Code Space \\
                 Principles \\
                 Problems \\
                 Further Reading \\
                 A Big Squeeze \\
                 Part III: The Product / 113 \\
                 Column 11: Sorting / 115 \\
                 Insertion Sort \\
                 A Simple Quicksort \\
                 Better Quicksorts \\
                 Principles \\
                 Problems \\
                 Further Reading \\
                 Column 12: A Sample Problem / 125 \\
                 The Problem \\
                 One Solution \\
                 The Design Space \\
                 Principles \\
                 Problems \\
                 Further Reading \\
                 Column 13: Searching / 133 \\
                 The Interface \\
                 Linear Structures \\
                 Binary Search Trees \\
                 Structures for Integers \\
                 Principles \\
                 Problems Further Reading \\
                 A Real Searching Problem \\
                 Column 14: Heaps / 147 \\
                 The Data Structure \\
                 Two Critical Functions \\
                 Priority Queues \\
                 A Sorting Algorithm \\
                 Principles \\
                 Problems \\
                 Further Reading \\
                 Column 15: Strings of Pearls / 161 \\
                 Words \\
                 Phrases \\
                 Generating Text \\
                 Principles \\
                 Problems \\
                 Further Reading \\
                 Epilog to the First Edition / 175 \\
                 Epilog to the Second Edition / 177 \\
                 Appendix 1: A Catalog of Algorithms / 179 \\
                 Appendix 2: An Estimation Quiz / 183 \\
                 Appendix 3: Cost; Models for Time and Space / 185 \\
                 Appendix 4: Rules for Code Tuning / 191 \\
                 Appendix 5: C++ Classes for Searching / 197 \\
                 Hints for Selected Problems / 201 \\
                 Solutions to Selected Problems / 205 \\
                 Index / 233",
}

@Article{Bentley:grap,
  author =       "Jon Louis Bentley and Brian W. Kernighan",
  title =        "{GRAP}: {A} Language for typesetting graphs",
  journal =      j-CACM,
  volume =       "29",
  number =       "8",
  pages =        "782--792",
  month =        aug,
  year =         "1986",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Article{Bentley:mini-macro-processor,
  author =       "Jon Bentley",
  title =        "m1: a Mini Macro Processor",
  journal =      j-COMP-LANG-MAG,
  volume =       "7",
  number =       "6",
  pages =        "47--61",
  month =        jun,
  year =         "1990",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Article{Bentley:pic,
  author =       "Jon Louis Bentley",
  title =        "Programming Pearls: Little Languages",
  journal =      j-CACM,
  volume =       "29",
  number =       "8",
  pages =        "711--721",
  month =        aug,
  year =         "1986",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Description of the {\em pic\/} language.",
  acknowledgement = ack-nhfb,
}

@Book{Berger:2015:IBL,
  author =       "Arno Berger and Theodore P. Hill",
  title =        "An introduction to {Benford's Law}",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "viii + 248",
  year =         "2015",
  DOI =          "https://doi.org/10.1515/9781400866588",
  ISBN =         "0-691-16306-5, 1-4008-6658-8 (e-book)",
  ISBN-13 =      "978-0-691-16306-2, 978-1-4008-6658-8 (e-book)",
  LCCN =         "QA273.6 .B474 2015",
  bibdate =      "Fri Jan 22 12:19:25 MST 2016",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://site.ebrary.com/id/11040167;
                 http://www.degruyter.com/viewbooktoc/product/465875",
  acknowledgement = ack-nhfb,
  subject =      "Distribution; Probability measures",
  tableofcontents = "Preface / vii 1 Introduction / 1 \\
                 1.1 History / 3 \\
                 1.2 Empirical evidence / 4 \\
                 1.3 Early explanations / 6 \\
                 1.4 Mathematical framework / 7 \\
                 2 Significant Digits and the Significand / 11 \\
                 2.1 Significant digits / 11 \\
                 2.2 The significand / 12 \\
                 2.3 The significand s-algebra / 14 \\
                 3 The Benford Property / 22 \\
                 3.1 Benford sequences / 23 \\
                 3.2 Benford functions / 28 \\
                 3.3 Benford distributions and random variables / 29 \\
                 4 The Uniform Distribution and Benford's Law / 43 \\
                 4.1 Uniform distribution characterization of Benford's
                 law / 43 \\
                 4.2 Uniform distribution of sequences and functions /
                 46 \\
                 4.3 Uniform distribution of random variables / 54 \\
                 5 Scale-, Base-, and Sum-Invariance / 63 \\
                 5.1 The scale-invariance property / 63 \\
                 5.2 The base-invariance property / 74 \\
                 5.3 The sum-invariance property / 80 \\
                 6 Real-valued Deterministic Processes / 90 \\
                 6.1 Iteration of functions / 90 \\
                 6.2 Sequences with polynomial growth / 93 \\
                 6.3 Sequences with exponential growth / 97 \\
                 6.4 Sequences with super-exponential growth / 101 \\
                 6.5 An application to Newton's method / 111 \\
                 6.6 Time-varying systems / 116 \\
                 6.7 Chaotic systems: Two examples / 124 \\
                 6.8 Differential equations / 127 \\
                 7 Multi-dimensional Linear Processes / 135 \\
                 7.1 Linear processes, observables, and difference
                 equations / 135 \\
                 7.2 Nonnegative matrices / 139 \\
                 7.3 General matrices / 145 \\
                 7.4 An application to Markov chains / 162 \\
                 7.5 Linear difference equations / 165 \\
                 7.6 Linear differential equations / 170 \\
                 8 Real-valued Random Processes / 180 \\
                 8.1 Convergence of random variables to Benford's law /
                 180 \\
                 8.2 Powers, products, and sums of random variables /
                 182 \\
                 8.3 Mixtures of distributions / 202 \\
                 8.4 Random maps / 213 \\
                 9 Finitely Additive Probability and Benford's Law / 216
                 \\
                 9.1 Finitely additive probabilities / 217 \\
                 9.2 Finitely additive Benford probabilities / 219 \\
                 10 Applications of Benford's Law / 223 \\
                 10.1 Fraud detection / 224 \\
                 10.2 Detection of natural phenomena / 225 \\
                 10.3 Diagnostics and design / 226 \\
                 10.4 Computations and Computer Science / 228 \\
                 10.5 Pedagogical tool / 230 \\
                 List of Symbols / 231 \\
                 Bibliography / 234 \\
                 Index / 245",
}

@Book{Berger:2017:AHA,
  author =       "Lee R. Berger and John (John David) Hawks",
  title =        "Almost Human: the Astonishing Tale of \bioname{Homo
                 Naledi} and the Discovery That Changed Our Human
                 Story",
  publisher =    "National Geographic",
  address =      "Washington, DC, USA",
  pages =        "239",
  year =         "2017",
  ISBN =         "1-4262-1811-7 (hardcover)",
  ISBN-13 =      "978-1-4262-1811-8 (hardcover)",
  LCCN =         "GN284.5 .B47 2017",
  bibdate =      "Sat Dec 23 08:54:30 MST 2017",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/gnu.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "This first-person narrative about an archaeological
                 discovery is rewriting the story of human evolution. A
                 story of defiance and determination by a controversial
                 scientist, this is Lee Berger's own take on finding
                 \bioname{Homo naledi}, an all-new species on the human
                 family tree and one of the greatest discoveries of the
                 21st century. In 2013, Berger, a National Geographic
                 Explorer-in-Residence, caught wind of a cache of bones
                 in a hard-to-reach underground cave in South Africa. He
                 put out a call around the world for petite
                 collaborators--men and women small and adventurous
                 enough to be able to squeeze through 8-inch tunnels to
                 reach a sunless cave 40 feet underground. With this
                 team of ``underground astronauts,'' Berger made the
                 discovery of a lifetime: hundreds of prehistoric bones,
                 including entire skeletons of at least 15 individuals,
                 all perhaps two million years old. Their features
                 combined those of known prehominids like Lucy, the
                 famous Australopithecus, with those more human than
                 anything ever before seen in prehistoric remains.
                 Berger's team had discovered an all new species, and
                 they called it \bioname{Homo naledi}. The cave quickly
                 proved to be the richest primitive hominid site ever
                 discovered, full of implications that shake the very
                 foundation of how we define what makes us human. Did
                 this species come before, during, or after the
                 emergence of \bioname{Homo sapiens} on our evolutionary
                 tree? How did the cave come to contain nothing but the
                 remains of these individuals? Did they bury their dead?
                 If so, they must have had a level of self-knowledge,
                 including an awareness of death. And yet those are the
                 very characteristics used to define what makes us
                 human. Did an equally advanced species inhabit Earth
                 with us, or before us? Berger does not hesitate to
                 address all these questions. Berger is a charming and
                 controversial figure, and some colleagues question his
                 interpretation of this and other finds. But in these
                 pages, this charismatic and visionary paleontologist
                 counters their arguments and tells his personal story:
                 a rich and readable narrative about science,
                 exploration, and what it means to be human. A story of
                 defiance and determination by a controversial
                 scientist, this is Lee Berger's own take on finding
                 \bioname{Homo naledi}, an all-new species on the human
                 family tree and one of the greatest discoveries of the
                 21st century.",
  acknowledgement = ack-nhfb,
  remark =       "Although this book says nothing about open-source
                 software, it says a good bit in favor of open-source
                 research findings, including the free sharing of
                 sub-millimeter accurate 3-D models of fossils.",
  subject =      "Homo naledi; Human beings; Origin; Evolution; Human
                 remains (Archaeology); South Africa; Witwatersrand
                 Region; SOCIAL SCIENCE / Anthropology / Physical;
                 HISTORY / Expeditions and Discoveries; SCIENCE /
                 Paleontology",
  tableofcontents = "Prologue \\
                 Going to South Africa \\
                 Finding Sediba \\
                 Finding Naledi \\
                 Understanding Naledi \\
                 Epilogue \\
                 Project participants, 2008--2015",
}

@Book{Berggren:2000:PSB,
  editor =       "Lennart Berggren and Jonathan Borwein and Peter
                 Borwein",
  booktitle =    "Pi: a source book",
  title =        "Pi: a source book",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Second",
  pages =        "xx + 736",
  year =         "2000",
  DOI =          "https://doi.org/10.1007/978-1-4757-3240-5",
  ISBN =         "0-387-98946-3 (hardcover)",
  ISBN-13 =      "978-0-387-98946-4 (hardcover)",
  LCCN =         "QA484 .P5 2000",
  MRclass =      "11-00 (01A05 01A75 11-03)",
  MRnumber =     "1746004",
  bibdate =      "Wed Aug 10 11:09:47 2016",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/borwein-jonathan-m.bib;
                 https://www.math.utah.edu/pub/tex/bib/agm.bib;
                 https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/mathcw.bib;
                 https://www.math.utah.edu/pub/tex/bib/pi.bib",
  acknowledgement = ack-nhfb,
  author-dates = "Jonathan Michael Borwein (20 May 1951--2 August
                 2016)",
  libnote =      "Not yet in my library.",
  ORCID-numbers = "Borwein, Jonathan/0000-0002-1263-0646",
  subject =      "Pi (mathematical constant)",
  tableofcontents = "Preface / v \\
                 \\
                 Preface to the Second Edition / viii \\
                 Acknowledgments / ix \\
                 \\
                 Introduction / xvii \\
                 \\
                 1. The Rhind Mathematical Papyrus-Problem 50 ($\approx$
                 1650 B.C.) / A problem dealing with the area of a round
                 field of given diameter / 1 \\
                 \\
                 2. Engels. Quadrature of the Circle in Ancient Egypt
                 (1977) / A conjectural explanation of how the
                 mathematicians of ancient Egypt approximated the area
                 of a circle / 3 \\
                 \\
                 3. Archimedes. Measurement of a Circle ($\approx$ 250
                 BC) / The seminal work in which Archimedes presents the
                 first true algorithm for $\pi$ / 7 \\
                 \\
                 4. Phillips. Archimedes the Numerical Analyst (1981) /
                 A summary of Archimedes' work on the computation of
                 $\pi$ using modern notation / 15 \\
                 \\
                 5. Lam and Ang. Circle Measurements in Ancient China
                 (1986) / This paper discusses and contains a
                 translation of Liu Hui's (3rd century) method for
                 evaluating $\pi$ and also examines values for $\pi$
                 given by Zu Chongzhi (429--500) / 20 \\
                 \\
                 6. The Ban{\=u} M{\=u}s{\=a}: The Measurement of Plane
                 and Solid Figures ($\approx$ 850) / This extract gives
                 an explicit statement and proof that the ratio of the
                 circumference to the diameter is constant / 36 \\
                 \\
                 7. M{\=a}dhava. The Power Series for Arctan and Pi
                 ($\approx$ 1400) / These theorems by a fifteenth
                 century Indian mathematician give Gregory's series for
                 arctan with remainder terms and Leibniz's series for
                 $\pi$ / 45 \\
                 \\
                 8. Hope-Jones. Ludolph (or Ludolff or Lucius) van
                 Ceulen (1938) / Correspondence about van Ceulen's
                 tombstone in reference to it containing some digits of
                 $\pi$ / 51 \\
                 \\
                 9. Vi{\'e}te. Variorum de Rebus Mathematicis Reponsorum
                 Liber VII (1593) / Two excerpts. One containing the
                 first infinite expression of $\pi$, obtained by
                 relating the area of a regular $2n$-gon to that of a
                 regular $n$-gon / 53 \\
                 \\
                 10. Wallis. Computation of $\pi$ by Successive
                 Interpolations (1655) / How Wallis derived the infinite
                 product for $\pi$ that bears his name / 68 \\
                 \\
                 11. Wallis. Arithmetica Infinitorum (1655) / An excerpt
                 including Prop. 189, 191 and an alternate form of the
                 result that gives Wm. Brounker's continued fraction
                 expression for $4/\pi$ / 78 \\
                 \\
                 12. Huygens. De Circuli Magnitudine Inventa (1724) /
                 Huygens's proof of W. Snell's discovery of improvements
                 in Archimedes' method of estimating the lengths of
                 circular arcs / 81 \\
                 \\
                 13. Gregory. Correspondence with John Collins (1671) /
                 A letter to Collins in which he gives his series for
                 arctangent, carried to the ninth power. / 87 \\
                 \\
                 14. Roy. The Discovery of the Series Formula for $\pi$
                 by Leibniz, Gregory, and Nilakantha (1990) / A
                 discussion of the discovery of the series $\pi/4 = 1 -
                 1/3 + 1/5, \cdots{}$ / 92 \\
                 \\
                 15. Jones. The First Use of $\pi$ for the Circle Ratio
                 (1706) / An excerpt from Jones' book, the Synopsis
                 Palmariorum Matheseos: or, a New Introduction to the
                 Mathematics, London, 1706 / 108 \\
                 \\
                 16. Newton. Of the Method of Fluxions and Infinite
                 Series (1737) / An excerpt giving Newton's calculation
                 of $\pi$ to 16 decimal places / 110 \\
                 \\
                 17. Euler. Chapter 10 of Introduction to Analysis of
                 the Infinite (On the Use of the Discovered Fractions to
                 Sum Infinite Series) (1748) / This includes many of
                 Euler's infinite series for $\pi$ and powers of $\pi$ /
                 112 \\
                 \\
                 18. Lambert. M{\'e}moire Sur Quelques
                 Propri{\'e}t{\'e}s Remarquables Des Quantit{\'e}s
                 Transcendentes Circulaires et Logarithmiques (1761) /
                 An excerpt from Lambert's original proof of the
                 irrationality of $\pi$ / 129 \\
                 \\
                 19. Lambert. Irrationality of $\pi$ (1969) / A
                 translation and Struik's discussion of Lambert's proof
                 of the irrationality of $\pi$ / 141 \\
                 \\
                 20. Shanks. Contributions to Mathematics Comprising
                 Chiefly of the Rectification of the Circle to 607
                 Places of Decimals (1853) / Pages from Shank's report
                 of his monumental hand calculation of $\pi$ / 147 \\
                 \\
                 21. Hermite. Sur La Fonction Exponentielle (1873) / The
                 first proof of the transcendence of $e$ / 162 \\
                 \\
                 22. Lindemann. Ueber die Zahl $\pi$ (1882) / The first
                 proof of the transcendence of $\pi$ / 194 \\
                 \\
                 23. Weierstrass. Zu Lindemann's Abhandlung ``Uber die
                 Ludolphsche Zahl'' (1885) / Weierstrass' proof of the
                 transcendence of $\pi$ / 207 \\
                 \\
                 24. Hilbert. Ueber die Trancendenz der Zahlen $e$ und
                 $\pi$ (1893) / Hilbert's short and elegant
                 simplification of the transcendence proofs for $e$ and
                 $\pi$ / 226 \\
                 \\
                 25. Goodwin. Quadrature of the Circle (1894) / The
                 dubious origin of the attempted legislation of the
                 value of $\pi$ in Indiana / 230 \\
                 \\
                 26. Edington. House Bill No. 246, Indiana State
                 Legislature, 1897 (1935) / A summary of the action
                 taken by the Indiana State Legislature to fix the value
                 of $\pi$ (including a copy of the actual bill that was
                 proposed) / 231 \\
                 \\
                 27. Singmaster. The Legal Values of Pi (1985) / A
                 history of the attempt by Indiana to legislate the
                 value of $\pi$ / 236 \\
                 \\
                 28. Ramanujan. Squaring the Circle (1913) / A geometric
                 approximation to $\pi$ / 240 \\
                 \\
                 29. Ramanujan. Modular Equations and Approximations to
                 $\pi$ (1914) / Ramanujan's seminal paper on $\pi$ that
                 includes a number of striking series and algebraic
                 approximations / 241 \\
                 \\
                 30. Watson. The Marquis and the Land Agent: A Tale of
                 the Eighteenth Century (1933) / A Presidential address
                 to the Mathematical Association in which the author
                 gives an account of ``some of the elementary work on
                 arcs and ellipses and other curves which led up to the
                 idea of inverting an elliptic integral, and so laying
                 the foundations of elliptic functions and doubly
                 periodic functions generally.'' / 258 \\
                 \\
                 31. Ballantine. The Best (?) Formula for Computing
                 $\pi$ to a Thousand Places (1939) / An early attempt to
                 orchestrate the calculation of $\pi$ more cleverly /
                 271 \\
                 \\
                 32. Birch. An Algorithm for Construction of Arctangent
                 Relations (1946) / The object of this note is to
                 express $\pi / 4 $ as a sum of arctan relations in
                 powers of 10 / 274 \\
                 \\
                 33. Niven. A Simple Proof that $\pi$ Is Irrational
                 (1947) / A very concise proof of the irrationality of
                 $\pi$ / 276 \\
                 \\
                 34. Reitwiesner. An ENIAC Determination of $\pi$ and
                 $e$ to 2000 Decimal Places (1950) / One of the first
                 computer-based computations / 277 \\
                 \\
                 35. Schepler. The Chronology of Pi (1950) / A fairly
                 reliable outline of the history of $\pi$ from 3000 BC
                 to 1949 / 282 \\
                 \\
                 36. Mahler. On the Approximation of $\pi$ (1953) /
                 ``The aim of this paper is to determine an explicit
                 lower bound free of unknown constants for the distance
                 of $\pi$ from a given rational or algebraic number'' /
                 306 \\
                 \\
                 37. Wrench, Jr. The Evolution of Extended Decimal
                 Approximations to $\pi$ (1960) / A history of the
                 calculation of the digits of $\pi$ to 1960 \\
                 \\
                 38. Shanks and Wrench, Jr. Calculation of $\pi$ to
                 100,000 Decimals (1962) / A landmark computation of
                 $\pi$ to more than 100,000 places / 326 \\
                 \\
                 39. Sweeny. On the Computation of Euler's Constant
                 (1963) / The computation of Euler's constant to 3566
                 decimal places / 350 \\
                 \\
                 40. Baker. Approximations to the Logarithms of Certain
                 Rational Numbers (1964) / The main purpose of this deep
                 and fundamental paper is to ``deduce results concerning
                 the accuracy with which the natural logarithms of
                 certain rational numbers may be approximated by
                 rational numbers, or, more generally, by algebraic
                 numbers of bounded degree.'' / 359 \\
                 \\
                 41. Adams. Asymptotic Diophantine Approximations to $E$
                 (1966) / An asymptotic estimate for the rational
                 approximation to $e$ which disproves the conjecture
                 that $e$ behaves like almost all numbers in this
                 respect / 368 \\
                 \\
                 42. Mahler. Applications of Some Formulae by Hermite to
                 the Approximations of Exponentials of Logarithms (1967)
                 / An important extension of Hilbert's approach to the
                 study of transcendence / 372 \\
                 \\
                 43. Eves. In Mathematical Circles; A Selection of
                 Mathematical Stories and Anecdotes (excerpt) (1969) / A
                 collection of mathematical stories and anecdotes about
                 $\pi$ / 400 \\
                 \\
                 44. Eves. Mathematical Circles Revisited; A Second
                 Collection of Mathematical Stories and Anecdotes
                 (excerpt) (1971) / A further collection of mathematical
                 stories and anecdotes about $\pi$ / 402 \\
                 \\
                 45. Todd. The Lemniscate Constants (1975) / A unifying
                 account of some of the methods used for computing the
                 lemniscate constants / 412 \\
                 \\
                 46. Salamin. Computation of r Using
                 Arithmetic-Geometric Mean (1976) / The first
                 quadratically converging algorithm for $\pi$ based on
                 Gauss's AGM and on Legendre's relation for elliptic
                 integrals / 418 \\
                 \\
                 47. Brent. Fast Multiple-Precision Evaluation of
                 Elementary Functions (1976) / ``This paper contains the
                 `Gauss-Legendre' method and some different algorithms
                 for log and exp (using Landen transformations).'' / 424
                 \\
                 \\
                 48. Beukers. A Note on the Irrationality of $\zeta(2)$
                 and $\zetq(3)$ (1979) / A short and elegant recasting
                 of Ap{\'e}ry's proof of the irrationality of $\zeta(3)$
                 (and $\zeta(2)$) / 434 \\
                 \\
                 49. van der Poorten. A Proof that Euler Missed \ldots{}
                 Ap{\'e}ry's Proof of the Irrationality of $\zeta(3)$
                 (1979) / An illuminating account of Ap{\'e}ry's
                 astonishing proof of the irrationality of $\zeta(3)$ /
                 439 \\
                 \\
                 50. Brent and McMillan. Some New Algorithms for
                 High-Precision Computation of Euler's Constant (1980) /
                 Several new algorithms for high precision calculation
                 of Euler's constant, including one which was used to
                 compute 30,100 decimal places / 448 \\
                 \\
                 51. Apostol. A Proof that Euler Missed: Evaluating
                 $\zeta(2)$ the Easy Way (1983) / This note shows that
                 one of the double integrals considered by Beukers ([48]
                 in the table of contents) can be used to establish
                 directly that $\zeta(2) = \pi / 6$ / 456 \\
                 \\
                 52. O'Shaughnessy. Putting God Back in Math (1983) / An
                 article about the Institute of Pi Research, an
                 organization that ``pokes fun at creationists by
                 pointing out that even the Bible makes mistakes.'' /
                 458 \\
                 \\
                 53. Stern. A Remarkable Approximation to $\pi$ (1985) /
                 Justification of the value of $\pi$ in the Bible
                 through numerological interpretations / 460 \\
                 \\
                 54. Newman and Shanks. On a Sequence Arising in Series
                 for $\pi$ (1984) / More connections between $\pi$ and
                 modular equations / 462 \\
                 \\
                 55. Cox. The Arithmetic-Geometric Mean of Gauss (1984)
                 / An extensive study of the complex analytic properties
                 of the AGM / 481 \\
                 \\
                 56. Borwein and Borwein. The Arithmetic-Geometric Mean
                 and Fast Computation of Elementary Functions (1984) /
                 The relationship between the AGM iteration and fast
                 computation of elementary functions (one of the
                 by-products is an algorithm for $\pi$) / 537 \\
                 \\
                 57. Newman. A Simplified Version of the Fast Algorithms
                 of Brent and Salamin (1984) / Elementary algorithms for
                 evaluating $e^x$ and $\pi$ using the Gauss AGM without
                 explicit elliptic function theory / 553 \\
                 \\
                 58. Wagon. Is Pi Normal? (1985) / A discussion of the
                 conjecture that $\pi$ has randomly distributed digits /
                 557 \\
                 \\
                 59. Keith. Circle Digits: A Self-Referential Story
                 (1986) / A mnemonic for the first 402 decimal places of
                 $\pi$ / 560 \\
                 \\
                 60. Bailey. The Computation of $\pi$ to 29,360,000
                 Decimal Digits Using Borweins' Quartically Convergent
                 Algorithm (1988) / The algorithms used, both for $\pi$
                 and for performing the required multiple-precision
                 arithmetic / 562 \\
                 \\
                 61. Kanada. Vectorization of Multiple-Precision
                 Arithmetic Program and 201,326,000 Decimal Digits of 1
                 Calculation (1988) / Details of the computation and
                 statistical tests of the first 200 million digits of
                 $\pi$ / 576 \\
                 \\
                 62. Borwein and Borwein. Ramanujan and Pi (1988) / This
                 article documents Ramanujan's life, his ingenious
                 approach to calculating $\pi$, and how his approach is
                 now incorporated into modern computer algorithms / 588
                 \\
                 \\
                 63. Chudnovsky and Chudnovsky. Approximations and
                 Complex Multiplication According to Ramanujan (1988) /
                 This excerpt describes ``Ramanujan's original quadratic
                 period--quasiperiod relations for elliptic curves with
                 complex multiplication and their applications to
                 representations of fractions of $\pi$ and other
                 logarithms in terms of rapidly convergent nearly
                 integral (hypergeometric) series.'' / 596 \\
                 \\
                 64. Borwein, Borwein and Bailey. Ramanujan, Modular
                 Equations, and Approximations to Pi or How to Compute
                 One Billion Digits of Pi (1989) / An exposition of the
                 computation of $\pi$ using mathematics rooted in
                 Ramanujan's work / 623 \\
                 \\
                 65. Borwein, Borwein and Dilcher. Pi, Euler Numbers,
                 and Asymptotic Expansions (1989) / An explanation as to
                 why the slowly convergent Gregory series for $\pi$,
                 truncated at 500,000 terms, gives $\pi$ to 40 places
                 with only the 6th, 17th, 18th, and 29th places being
                 incorrect / 642 \\
                 \\
                 66. Beukers, B{\'e}zivin, and Robba. An Alternative
                 Proof of the Lindemann--Weierstrass Theorem (1990) /
                 The Lindemann--Weierstrass theorem as a by-product of a
                 criterion for rationality of solutions of differential
                 equations / 649 \\
                 \\
                 67. Webster. The Tail of Pi (1991) / Various anecdotes
                 about $\pi$ from the 14th annual IMO Lecture to the
                 Royal Society / 654 \\
                 \\
                 68. Eco. An excerpt from Foucault's Pendulum (1993) /
                 ``The unnumbered perfection of the circle itself.'' /
                 658 \\
                 \\
                 69. Keith. Pi Mnemonics and the Art of Constrained
                 Writing (1996) / A mnemonic for $\pi$ based on Edgar
                 Allen Poe's poem ``The Raven.'' / 659 \\
                 \\
                 70. Bailey, Borwein, and Plouffe. On the Rapid
                 Computation of Various Polylogarithmic Constants (1996)
                 / A fast method for computing individual digits of
                 $\pi$ in base 2 / 663 \\
                 Appendix I --- On the Early History of Pi / 677 \\
                 \\
                 Appendix II --- A Computational Chronology of Pi / 683
                 \\
                 \\
                 Appendix III --- Selected Formulae for Pi / 686 \\
                 \\
                 Appendix IV --- Translations of Vi{\`e}te and Huygens /
                 690 \\
                 Bibliography / 711 \\
                 \\
                 Credits / 717 \\
                 \\
                 Index / 721",
}

@Misc{Bergman:2006:BRE,
  author =       "Aaron Bergman",
  title =        "Book Review: {{\em Not Even Wrong: The Failure of
                 String Theory and the Continuing Challenge to Unify the
                 Laws of Physics}, Peter Woit, Jonathan Cape, London
                 2006}",
  howpublished = "World Wide Web document",
  pages =        "11",
  day =          "18",
  month =        aug,
  year =         "2006",
  bibdate =      "Mon Oct 09 11:38:47 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://zippy.ph.utexas.edu/~abergman/Review.pdf",
  acknowledgement = ack-nhfb,
  remark =       "Critical review and rebuttal of Woit's book.",
}

@Book{Bergmann:1968:RG,
  author =       "Peter Gabriel Bergmann",
  title =        "The riddle of gravitation",
  publisher =    "Scribner",
  address =      "New York, NY, USA",
  pages =        "xvi + 270",
  year =         "1968",
  LCCN =         "QC6 .B454",
  bibdate =      "Fri Aug 8 06:59:44 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Relativity (Physics); Gravitation",
  tableofcontents = "Introduction: The Scope of Gravitation / 3 \\
                 I / Newtonian Physics and Special Relativity 1 Early
                 History / 9 \\
                 2 Relativity of Motion / 19 \\
                 3 The Universal Speed of Light / 25 \\
                 4 The Special Theory of Relativity / 30 \\
                 5 Minkowski's Four-dimensional World / 39 \\
                 / 6 Mass, Energy, Momentum / 54 \\
                 7 Flat Space Curved Space / 65 \\
                 II / General Relativity 8Relativity and Gravitation /
                 77 \\
                 9 The Relativity of Free Fall / 84 \\
                 10 The Principle of General Covariance / 93 \\
                 11 Curved Space-Time / 98 \\
                 12 Gravitation in the Space-Time Continuum / 104 \\
                 13 Schwarzschild's Solution / 114 \\
                 14 Inside the Schwarzschild Radius / 126 \\
                 15 Event Horizons / 132 \\
                 III / Recent Developments 16 Gravitational Collapse /
                 157 \\
                 17 Gravitational Radiation / 162 \\
                 18 The Search for Gravitational Waves / 168 \\
                 19 Cosmology / 172 \\
                 20 Current Observational Programs / 184 \\
                 21 Particle Motion / 192 \\
                 22 Quantum Theory of Gravitation / 197 \\
                 23 What Is an Observable? / 201 \\
                 24 Space-Time Today and Tomorrow / 206 \\
                 Appendixes I The Equal-Areas Law of Kepler / 213 \\
                 II Derivation of the Inverse-Square Law of Force / 216
                 \\
                 III The Lorentz Transformation / 219 \\
                 IV The Schwarzschild Radius / 226 \\
                 V Gravitational Radiation / 229 \\
                 VI Powers of 10 and Units of Measurement / 233 \\
                 Glossary / 235 \\
                 Suggestions for Further Reading / 261 \\
                 Index / 265",
}

@Article{Bergstrom:2004:CBL,
  author =       "Carl T. Bergstrom and Theodore C. Bergstrom",
  title =        "The costs and benefits of library site licenses to
                 academic journals",
  journal =      j-PROC-NATL-ACAD-SCI-USA,
  volume =       "101",
  number =       "3",
  pages =        "897--902",
  day =          "20",
  month =        jan,
  year =         "2004",
  CODEN =        "PNASA6",
  DOI =          "https://doi.org/10.1073/pnas.0305628101",
  ISSN =         "0027-8424 (print), 1091-6490 (electronic)",
  bibdate =      "Wed Nov 16 05:35:58 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://www.pnas.org/cgi/content/abstract/0305628101v1",
  acknowledgement = ack-nhfb,
}

@Book{Berlin:2005:MBM,
  author =       "Leslie Berlin",
  title =        "The Man Behind the Microchip: {Robert Noyce} and the
                 Invention of {Silicon Valley}",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  pages =        "xi + 402",
  year =         "2005",
  ISBN =         "0-19-516343-5",
  ISBN-13 =      "978-0-19-516343-8",
  LCCN =         "TK7807.N69 B47 2005",
  bibdate =      "Tue Oct 11 05:00:44 MDT 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  keywords =     "Fairchild Semiconductor Corporation; integrated
                 circuit (co-invented with Jack Kilby (1923--2005) of
                 Texas Instruments; Intel Corporation; Nobel Prize in
                 Physics 2000); Shockley Semiconductor Laboratories",
  subject =      "Noyce, Robert N.; Electronics engineers; United
                 States; Biography; Santa Clara Valley (Santa Clara
                 County, Calif.); History",
  subject-dates = "1927--1990",
  tableofcontents = "Adrenaline and Gasoline \\
                 Rapid Robert \\
                 Apprenticeship \\
                 Breakaway \\
                 Invention \\
                 A Strange Little Upstart \\
                 Startup \\
                 Takeoff \\
                 The Edge of What's Barely Possible \\
                 Renewal \\
                 Political Entrepreneurship \\
                 Public Startup \\
                 Author's Interviews and Correspondence \\
                 Robert Noyce's Patents",
}

@Book{Berman:2011:SHO,
  author =       "Bob Berman",
  title =        "The {Sun}'s heartbeat: and other stories from the life
                 of the star that powers our planet",
  publisher =    "Little, Brown and Company",
  address =      "New York, NY, USA",
  pages =        "viii + 290",
  year =         "2011",
  ISBN =         "0-316-09101-4",
  ISBN-13 =      "978-0-316-09101-5",
  LCCN =         "QB521.4 .B47 2011",
  bibdate =      "Fri Jul 22 15:57:25 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Sun; Popular works",
  tableofcontents = "Yon flaming orb \\
                 Genesis \\
                 A strange history of seeing spots \\
                 The heartbeat stops and other peculiar events \\
                 The unit \\
                 Magnetic attraction \\
                 Wild science of the bearded men \\
                 Cautionary tales \\
                 Why Jack loved carbon \\
                 Tales of the invisible \\
                 The sun brings death \\
                 The sun will save your life \\
                 I'm an aquarius. Trust me \\
                 Rhythms of color \\
                 Particle man \\
                 Totality: the impossible coincidence \\
                 That's entertainment \\
                 Cold winds \\
                 Weather outside is frightful \\
                 Tomorrow's sun",
}

@Book{Berners-Lee:2019:TNP,
  author =       "Mike Berners-Lee",
  title =        "There is no {Plan(et) B}: a handbook for the make or
                 break years",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xii + 288",
  year =         "2019",
  ISBN =         "1-108-42424-4 (hardcover), 1-108-43958-6 (paperback)",
  ISBN-13 =      "978-1-108-42424-0 (hardcover), 978-1-108-43958-9
                 (paperback)",
  LCCN =         "TJ163.2 .B4745 2019",
  bibdate =      "Mon Mar 4 08:12:41 MST 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.cambridge.org/us/academic/subjects/earth-and-environmental-science/environmental-science/there-no-planet-b-handbook-make-or-break-years",
  abstract =     "Almost every year since records began, our species has
                 had more energy at its disposal than it had the year
                 before. For the last 50 years, the growth rate has
                 averaged 2.4\% per year, more than tripling in total
                 over that time. For the century before that it was more
                 like 1\% per year, and as we go back through history,
                 the growth rate looks lower still but nevertheless
                 positive, give or take the odd blip. We have been
                 getting continually more powerful, not just by growing
                 our energy supply, but by using it with ever more
                 efficiency and inventiveness. In doing so, we have been
                 increasingly affecting our world, through a mixture of
                 accident and design. The restorative powers of our
                 planet, meanwhile, have remained broadly the same, so
                 the balance of power has been shifting --- and it has
                 now tipped. Throughout history, the dominant cultures
                 have treated the planet as a big and robust place,
                 compared to everything we could throw at it --- and
                 that approach has not, generally speaking, come back to
                 bite us.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Power resources; Environmental aspects; Energy
                 consumption; Climatic changes; Pollution; Environmental
                 protection; Climatic changes; Energy consumption;
                 Environmental aspects; Environmental protection;
                 Pollution; Power resources",
  tableofcontents = "Acknowledgments \\
                 Notes on units \\
                 1. Introduction \\
                 2. Food \\
                 3. More on climate and environment \\
                 4. Energy \\
                 5. Travel and transport \\
                 6. Growth, money and metrics \\
                 7. People and work \\
                 8. Business and technology \\
                 9. Values, truth and trust \\
                 10. Conclusion: thinking skills for today's world \\
                 11. Big picture summary \\
                 12. What can I do? Summary \\
                 Appendix: climate change basics \\
                 Alphabetical quick tour \\
                 Endnotes \\
                 Index.",
}

@Book{Bernstein:1981:PEH,
  author =       "Jeremy Bernstein",
  title =        "Prophet of energy, {Hans Bethe}",
  publisher =    "Dutton",
  address =      "New York, NY, USA",
  pages =        "xii + 212",
  year =         "1981",
  ISBN =         "0-525-47677-6 (paperback)",
  ISBN-13 =      "978-0-525-47677-1 (paperback)",
  LCCN =         "QC16.B4 B47",
  bibdate =      "Wed Mar 13 06:31:01 MDT 2013",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/b/bethe-hans.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$7.25",
  acknowledgement = ack-nhfb,
  remark-1 =     "Originally published under title: Hans Bethe, prophet
                 of energy. Based on articles written for the New
                 Yorker.",
  remark-2 =     "From page 107, about the Antiballistic Missile (ABM)
                 system: ``The amount of money that was wasted on this
                 exercise is staggering.''",
  subject =      "Bethe, Hans A; (Hans Albrecht); Physicists; Biography;
                 Nuclear energy; History",
  subject-dates = "1906--2005",
}

@Book{Bernstein:1996:HUC,
  author =       "Jeremy Bernstein",
  title =        "{Hitler}'s uranium club: the secret recordings at
                 {Farm Hall}",
  publisher =    pub-AIP,
  address =      pub-AIP:adr,
  pages =        "xxx + 427 + 4",
  year =         "1996",
  ISBN =         "1-56396-258-6",
  ISBN-13 =      "978-1-56396-258-5",
  LCCN =         "QC773.3.G3 B47 1995",
  bibdate =      "Mon Mar 06 08:37:25 2000",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/bethe-hans.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/b/bohr-niels.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/f/fermi-enrico.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/h/heisenberg-werner.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Introduction by David Cassidy.",
  price =        "US\$34.95",
  acknowledgement = ack-nhfb,
  remark =       "This book is primarily about the German quantum
                 physicists involved in the atomic bomb project in
                 Germany during World War II, but Einstein's famous
                 letter of 2-Aug-1939 to US President Franklin D.
                 Roosevelt alerting him to their work is reproduced on
                 pp.~13--14. On 1-Sep-1939, Germany invaded Poland. Two
                 days later, France and England declared war on Germany,
                 and the world was in darkness for six years.",
  tableofcontents = "Preface / vii \\
                 Introduction / xiii \\
                 Brief Chronology / xxvii \\
                 Prologue / 1 \\
                 Cast of Characters / 55 \\
                 Part I: Settling In / 57 \\
                 Preamble (1 May--30 June 1945) / 59 \\
                 Report 1 (3--18 July 1945) / 74 \\
                 Report 2 (18--31 July 1945) / 89 \\
                 Report 3 (1--6 August 1945) Ill Part II: The Bomb Drops
                 / 117 \\
                 Report 4 (6--7 August 1945) / 119 \\
                 Appendix to Report 4 / 161 \\
                 Part III: Putting the Pieces Together / 165 \\
                 Report 5 (8--22 August 1945) / 167 \\
                 Appendix to Report 5 / 217 \\
                 Part IV: Looking to the Future / 233 \\
                 Report 6 (23 August--6 September 1945) / 235 \\
                 Report 7 (7--13 September 1945) / 241 \\
                 Report 8 (14--15 September 1945) / 263 \\
                 Part V: Looking Toward Home / 275 \\
                 Report 9 (16--23 September 1945) / 277 \\
                 Appendix to Report 9 / 280 \\
                 Report 10 (24--30 September 1945) / 284 \\
                 Appendix to Report 10 / 288 \\
                 Report 11 (1--7 October 1945) / 294 \\
                 Report 12 (8--14 October 1945) / 301 \\
                 Report 14 (14--21 October 1945) / 302 \\
                 Report 16 (22--28 October 1945) / 304 \\
                 Report 16-A (29 October--4 November 1945) / 306 \\
                 Report 17 (5--11 November 1945) / 311 \\
                 Part VI: A Nobel for Otto Hahn / 317 \\
                 Report 18 (12--18 November 1945) / 319 \\
                 Appendix to Report 18 / 322 \\
                 Report 19 (19--25 November 1945) / 338 \\
                 Report 20 (26 November--2 December 1945) / 344 \\
                 Report 21 (3--9 December 1945) / 347 \\
                 Report 22 (10--16 December 1945) / 349 \\
                 Report 23/24 (17--30 December 1945) / 350 \\
                 Epilogue / 353 \\
                 Appendix 1: Heisenberg's Lecture, 26 February / 1942
                 \\
                 ``The Theoretical Foundations for Obtaining Energy from
                 Fission of Uranium'' Translation by William Sweet / 373
                 \\
                 Appendix 2: Von Laue's Letters to Paul Rosbaud, 1959 /
                 385 \\
                 Appendix 3: BBC Report, 6 August 1945 / 393 \\
                 Appendix 4: Biographical Sketches of the Ten Detainees
                 / 399 \\
                 Selected Bibliography / 403 \\
                 Index / 409",
}

@Book{Bernstein:2007:PHW,
  author =       "Jeremy Bernstein",
  title =        "Plutonium: a history of the world's most dangerous
                 element",
  publisher =    pub-JOSEPH-HENRY,
  address =      pub-JOSEPH-HENRY:adr,
  pages =        "x + 194 + 8",
  year =         "2007",
  ISBN =         "0-309-10296-0 (hardcover), 1-280-84457-4,
                 0-309-10773-3 (e-book)",
  ISBN-13 =      "978-0-309-10296-4 (hardcover), 978-1-280-84457-7,
                 978-0-309-10773-0 (e-book)",
  LCCN =         "QD181.P9 B47 2007",
  bibdate =      "Tue Dec 9 09:09:51 MST 2008",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/r/rutherford-ernest.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/toc/ecip075/2006038466.html",
  abstract =     "When plutonium was first manufactured at Berkeley in
                 the spring of 1941, there was so little of it that it
                 was not visible to the naked eye. It took a year to
                 accumulate enough so that one could actually see it.
                 Now there is so much that we don't know what to do to
                 get rid of it. We have created a monster. The history
                 of plutonium is as strange as the element itself. When
                 scientists began looking for it, they did so simply in
                 the spirit of inquiry, not certain whether there were
                 still spots to fill on the periodic table. But the
                 discovery of fission made it clear that this
                 still-hypothetical element would be more than just a
                 scientific curiosity --- it could be a powerful nuclear
                 weapon. As it turned out, it is good for almost nothing
                 else. Plutonium's nuclear potential put it at the heart
                 of the World War II arms race --- the Russians found
                 out about it through espionage, the Germans through
                 independent research, and everybody wanted some. Now,
                 nearly everyone has some --- the United States alone
                 has about 47 metric tons --- but it has almost no uses
                 besides warmongering. How did the product of scientific
                 curiosity become such a dangerous burden? In his new
                 history of this complex and dangerous element, noted
                 physicist Jeremy Bernstein describes the steps that
                 were taken to transform plutonium from a laboratory
                 novelty into the nuclear weapon that destroyed
                 Nagasaki. This is the first book to weave together the
                 many strands of plutonium's story, explaining not only
                 the science but the people involved.",
  acknowledgement = ack-nhfb,
  subject =      "Plutonium; History",
  tableofcontents = "Preamble \\
                 The history of uranium \\
                 The periodic table \\
                 Frau R{\"o}ntgen's hand \\
                 Close calls \\
                 Fissions \\
                 Transuranics \\
                 Plutonium goes to war \\
                 Los Alamos \\
                 Electrons \\
                 Now what?",
}

@Book{Best:2004:MDL,
  author =       "Joel Best",
  title =        "More damned lies and statistics: how numbers confuse
                 public issues",
  publisher =    pub-U-CALIFORNIA-PRESS,
  address =      pub-U-CALIFORNIA-PRESS:adr,
  pages =        "xvii + 200",
  year =         "2004",
  ISBN =         "0-520-23830-3 (cloth)",
  ISBN-13 =      "978-0-520-23830-5 (cloth)",
  LCCN =         "HM535 .B474 2004",
  bibdate =      "Wed Nov 30 07:12:07 MST 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "ftp://uiarchive.cso.uiuc.edu/pub/etext/gutenberg/;
                 http://www.loc.gov/catdir/bios/ucal052/2003028076.html;
                 http://www.loc.gov/catdir/description/ucal051/2003028076.html;
                 http://www.loc.gov/catdir/toc/ecip0412/2003028076.html",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Sociology; Statistical methods; Social problems;
                 Statistical methods; Social indicators",
  tableofcontents = "Missing numbers \\
                 Confusing numbers \\
                 Scary numbers \\
                 Authoritative numbers \\
                 Magical numbers \\
                 Contentious numbers \\
                 Toward statistical literacy?",
}

@Book{Beyer:1978:CHM,
  editor =       "William H. Beyer",
  title =        "{CRC} Handbook of Mathematical Sciences",
  publisher =    pub-CRC,
  address =      pub-CRC:adr,
  edition =      "Fifth",
  pages =        "xii + 982",
  year =         "1978",
  ISBN =         "0-8493-0655-8",
  ISBN-13 =      "978-0-8493-0655-6",
  LCCN =         "QA47.H324 1978",
  bibdate =      "Wed May 10 18:26:58 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  DEWEY =        "510/.21/2",
  idnumber =     "527",
}

@Book{Bhandarkar:1996:AIA,
  author =       "Dileep P. Bhandarkar",
  title =        "{Alpha} Implementations and Architecture: Complete
                 Reference and Guide",
  publisher =    pub-DP,
  address =      pub-DP:adr,
  pages =        "xviii + 328",
  year =         "1996",
  ISBN =         "1-55558-130-7 (paperback)",
  ISBN-13 =      "978-1-55558-130-5 (paperback)",
  LCCN =         "QA76.8.A176B47 1996",
  bibdate =      "Thu Aug 07 13:42:54 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$41.95",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Historical Perspective \\
                 2: RISC Design Issues \\
                 3: Alpha Architecture \\
                 4: Comparing RISC Architectures \\
                 5: First Generation Alpha Processor Chips \\
                 6: 21064-based System Implementations \\
                 7: Second Generation Microprocessor and Systems \\
                 8: Performance Characterization \\
                 9: Comparing RISC Implementations \\
                 10: Operating Systems and Compilers \\
                 Appendix A: Alpha Instruction Encodings",
}

@Book{Bhattacharya:2022:MFV,
  author =       "Ananyo Bhattacharya",
  title =        "Man from the Future: the Visionary Life of {John von
                 Neumann}",
  publisher =    pub-NORTON,
  address =      pub-NORTON:adr,
  pages =        "xiv + 353",
  year =         "2022",
  ISBN =         "1-324-00399-5",
  ISBN-13 =      "978-1-324-00399-1",
  LCCN =         "QA29.V66 B43 2022",
  bibdate =      "Tue Oct 19 06:09:03 MDT 2021",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "The smartphones in our pockets and computers like
                 brains. The vagaries of game theory and evolutionary
                 biology. Nuclear weapons and self-replicating
                 spacecrafts. All bear the fingerprints of one
                 remarkable, yet largely overlooked, man: John von
                 Neumann. Born in Budapest at the turn of the century,
                 von Neumann is one of the most influential scientists
                 to have ever lived. A child prodigy, he mastered
                 calculus by the age of eight, and in high school made
                 lasting contributions to mathematics. In Germany, where
                 he helped lay the foundations of quantum mechanics, and
                 later at Princeton, von Neumann's colleagues believed
                 he had the fastest brain on the planet-bar none. He was
                 instrumental in the Manhattan Project and the design of
                 the atom bomb; he helped formulate the bedrock of Cold
                 War geopolitics and modern economic theory; he created
                 the first ever programmable digital computer; he
                 prophesized the potential of nanotechnology; and, from
                 his deathbed, he expounded on the limits of brains and
                 computers-and how they might be overcome. Taking us on
                 an astonishing journey, Ananyo Bhattacharya explores
                 how a combination of genius and unique historical
                 circumstance allowed a single man to sweep through a
                 stunningly diverse array of fields, sparking
                 revolutions wherever he went. The Man from the Future
                 is an insightful and thrilling intellectual biography
                 of the visionary thinker who shaped our century.",
  acknowledgement = ack-nhfb,
  subject-dates = "John von Neumann (1903--1957)",
  tableofcontents = "Introduction: Who was John von Neumann? / xi \\
                 1: Made in Budapest / 1 \\
                 2: To infinity and beyond / 11 \\
                 3: The quantum evangelist / 29 \\
                 4: Project Y and the super / 65 \\
                 5: The convoluted birth of the modern computer / 102
                 \\
                 6: A theory of games / 141 \\
                 7: The think tank by the sea / 183 \\
                 8: The rise of the replicators / 225 \\
                 Epilogue: The man from which future? / 281 \\
                 Select Bibliography / 285 \\
                 Notes / 289 \\
                 Image Credits / 328 \\
                 Acknowledgements / 329 \\
                 Index / 331",
}

@Book{Bickerton:2009:ATH,
  author =       "Derek Bickerton",
  title =        "{Adam}'s tongue: how humans made language, how
                 language made humans",
  publisher =    "Hill and Wang",
  address =      "New York, NY, USA",
  pages =        "286",
  year =         "2009",
  ISBN =         "0-8090-2281-8",
  ISBN-13 =      "978-0-8090-2281-6",
  LCCN =         "P106 .B4667 2009",
  bibdate =      "Tue Sep 1 16:11:46 MDT 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "How language evolved has been called ``the hardest
                 problem in science.'' Linguist Derek Bickerton shows
                 how and why previous attempts to solve that problem
                 have fallen short. This book is the first that
                 thoroughly integrates the story of how language evolved
                 with the story of how humans evolved. Taking cues from
                 topics as diverse as the foraging strategies of ants,
                 the distribution of large prehistoric herbivores, and
                 the construction of ecological niches, Bickerton
                 produces a dazzling new alternative to the conventional
                 wisdom. Language is unique to humans, but it isn't the
                 only thing that sets us apart from other species ---
                 our cognitive powers are qualitatively different. So
                 could there be two separate discontinuities between
                 humans and the rest of nature? No, says Bickerton; he
                 shows how the mere possession of symbolic units ---
                 words --- automatically opened a new and different
                 cognitive universe.",
  acknowledgement = ack-nhfb,
  subject =      "Language and languages; Human evolution;
                 Psycholinguistics",
  tableofcontents = "The size of the problem \\
                 Thinking like engineers \\
                 Singing apes? \\
                 Chatting apes? \\
                 Niches aren't everything (they're the only thing) \\
                 Our ancestors in their niches \\
                 Go to the ant, thou sluggard \\
                 The big bang \\
                 The challenge from Chomsky \\
                 Making up our minds \\
                 An acorn grows to a sapling \\
                 The sapling becomes an oak",
}

@Article{Bickley:1948:DAO,
  author =       "W. G. Bickley",
  title =        "Difference and Associated Operators, With Some
                 Applications",
  journal =      j-J-MATH-PHYS-MIT,
  volume =       "27",
  number =       "3",
  pages =        "183--192",
  month =        oct,
  year =         "1948",
  bibdate =      "Thu Nov 17 10:12:26 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  keywords =     "Adams--Bashforth integration of ODEs; averaging
                 operator; backward difference operator; backward
                 summation operator; central difference operator;
                 central summation operator; Euler--Maclaurin summation
                 formula; forward difference operator; forward summation
                 operator; Gregory quadrature; integral operator;
                 Milne's rule; numerical differentiation; numerical
                 integration; Simpson's rule; step operator; trapezoidal
                 rule",
  remark =       "This is a recommended source of clear and compact
                 descriptions of the difference and summation operators,
                 and their applications to numerical differentiation and
                 integration, and the derivation of quadrature rules.",
}

@Book{Biddle:2009:DSM,
  author =       "Wayne Biddle",
  title =        "Dark side of the moon: {Wernher von Braun}, the {Third
                 Reich}, and the space race",
  publisher =    pub-NORTON,
  address =      pub-NORTON:adr,
  pages =        "xiv + 220 + 8",
  year =         "2009",
  ISBN =         "0-393-05910-3 (hardcover)",
  ISBN-13 =      "978-0-393-05910-6 (hardcover)",
  LCCN =         "TL781.85.V6 B53 2009",
  bibdate =      "Fri Aug 8 06:43:57 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "A stunning investigation of the roots of the first
                 moon landing forty years ago, this illuminating story
                 of the dawn of the space age reaches back to the
                 reactionary modernism of the Third Reich, using the
                 life of ``rocket scientist'' Wernher von Braun as its
                 narrative path through the crumbling of Weimar Germany
                 and the rise of the Nazi regime. Von Braun, a blinkered
                 opportunist who could apply only tunnel vision to his
                 meteoric career, stands as an archetype of myriad
                 twentieth century technologists who thrived under
                 regimes of military secrecy and unlimited money. His
                 seamless transformation from developer of the deadly V2
                 ballistic missile for Hitler to an American celebrity
                 as the supposed genius behind the golden years of the
                 U.S. space program in the 1950s and 1960s raises
                 haunting questions about the culture of the Cold War,
                 the shared values of technology in totalitarian and
                 democratic societies, and the imperatives of material
                 progress.",
  acknowledgement = ack-nhfb,
  language =     "German",
  subject =      "Von Braun, Wernher; Rocketry; Germany; Biography;
                 United States; World War, 1939-1945; Science; Space
                 race; History; 20th century; Astronautics; Moral and
                 ethical aspects; Cold War; Politics and government;
                 1933-1945",
  subject-dates = "1912--1977",
  tableofcontents = "1. A Junker's life \\
                 2. Memories of defeat \\
                 3. ``Highly technological romanticism'' \\
                 4. An heir of credibility \\
                 5. Childhood's end \\
                 6. ``Fingers in the pie'' \\
                 7. Supreme zeal \\
                 8. Grand and horribly wrong \\
                 9. Depravity \\
                 10. ``A psychologicsal block'' \\
                 Epilog \\
                 Notes \\
                 Selected bibliography \\
                 Photograph credits \\
                 Index",
}

@Book{Bienz:1993:PDF,
  author =       "Tim Bienz and Richard Cohn",
  title =        "Portable Document Format Reference Manual",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xii + 214",
  year =         "1993",
  ISBN =         "0-201-62628-4",
  ISBN-13 =      "978-0-201-62628-5",
  LCCN =         "QA76.9.F5P67 1993",
  bibdate =      "Wed Feb 23 14:42:18 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/postscri.bib",
  price =        "US\$24.95",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Introduction \\
                 Section: I. Portable Document Format \\
                 2: Overview \\
                 3: Coordinate Systems \\
                 4: Objects \\
                 5: File Structure \\
                 6: Document Structure \\
                 7; Page Descriptions \\
                 Section II: Optimizing PDF Files \\
                 8: General Techniques for Optimizing PDF Files \\
                 9: Optimizing Text \\
                 10: Optimizing Graphics \\
                 11: Optimizing Images",
}

@Article{Bigelow:digital-typography,
  author =       "Charles Bigelow and Donald Day",
  title =        "Digital Typography",
  journal =      j-SA,
  volume =       "249",
  number =       "2",
  pages =        "106--119",
  month =        aug,
  year =         "1983",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@TechReport{Billawala:metamarks,
  author =       "Neenie Billawala",
  title =        "Metamarks: Preliminary studies for a {Pandora's Box}
                 of Shapes",
  number =       "{STAN-CS-89-1256}",
  institution =  pub-STAN-CS,
  address =      pub-STAN-CS:adr,
  month =        may,
  year =         "1989",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Manual{BIOSIS:1994:SSB,
  title =        "Serial Sources for the {BIOSIS Previews} Database",
  organization = "BIOSIS",
  address =      "210 Arch Street, Philadelphia, PA 19103-1399, USA",
  pages =        "vii + 450",
  month =        dec,
  year =         "1994",
  CODEN =        "SSBDE4",
  ISSN =         "1044-4297",
  LCCN =         "Z5321 .B68a",
  bibdate =      "Wed Apr 24 17:25:50 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Contains journal full names and abbreviations used in
                 the BIOSIS and Biological Abstracts databases, plus
                 ISSN and CODEN values, for 6,395 active and 10,935
                 inactive serials in 41 languages from 94 countries.
                 Also available on CD ROM.",
  price =        "US\$65.00",
  URL =          "http://www.biosis.org/htmls/press/960126.html",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
}

@Book{Bird:2005:APT,
  author =       "Kai Bird and Martin J. Sherwin",
  title =        "{American Prometheus}: the triumph and tragedy of {J.
                 Robert Oppenheimer}",
  publisher =    pub-KNOPF,
  address =      pub-KNOPF:adr,
  pages =        "xiii + 721 + 32",
  year =         "2005",
  ISBN =         "0-375-72626-8, 0-375-41202-6",
  ISBN-13 =      "978-0-375-72626-2, 978-0-375-41202-8",
  LCCN =         "QC16.O62 B57 2005",
  bibdate =      "Mon Dec 12 15:27:36 MST 2005",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/o/oppenheimer-j-robert.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;
                 melvyl.cdlib.org:210/CDL90",
  URL =          "ftp://uiarchive.cso.uiuc.edu/pub/etext/gutenberg/;
                 http://site.ebrary.com/lib/ucsc/Doc?id=10078784",
  abstract-1 =   "[This is the] biography of J. Robert Oppenheimer,
                 ``father of the atomic bomb,'' the brilliant,
                 charismatic physicist who led the effort to capture the
                 awesome fire of the sun for his country in time of war.
                 Immediately after Hiroshima, he became the most famous
                 scientist of his generation - one of the iconic figures
                 of the twentieth century, the embodiment of modern man
                 confronting the consequences of scientific progress. He
                 was the author of a radical proposal to place
                 international controls over atomic materials - an idea
                 that is still relevant today. He opposed the
                 development of the hydrogen bomb and criticized the Air
                 Force's plans to fight an infinitely dangerous nuclear
                 war. In the now almost-forgotten hysteria of the early
                 1950s, his ideas were anathema to powerful advocates of
                 a massive nuclear buildup, and, in response, Atomic
                 Energy Commission chairman Lewis Strauss, Superbomb
                 advocate Edward Teller and FBI director J. Edgar Hoover
                 worked behind the scenes to have a hearing board find
                 that Oppenheimer could not be trusted with America's
                 nuclear secrets.",
  abstract-2 =   "The first full-scale biography of the ``father of the
                 atomic bomb,'' the brilliant, charismatic physicist who
                 led the effort to capture the fire of the sun for his
                 country in time of war. After Hiroshima, he became the
                 most famous scientist of his generation--an icon of
                 modern man confronting the consequences of scientific
                 progress. He created a radical proposal to place
                 international controls over atomic materials, opposed
                 the development of the hydrogen bomb and criticized the
                 Air Force's plans to fight a nuclear war. In the
                 hysteria of the early 1950s, his ideas were anathema to
                 powerful advocates of a massive nuclear buildup, and
                 people such as Edward Teller and FBI director J. Edgar
                 Hoover worked behind the scenes to obtain a finding
                 that he could not be trusted with America's nuclear
                 secrets. This book is both biography and history,
                 significant to our understanding of our recent
                 past--and of our choices for the future.",
  acknowledgement = ack-nhfb,
  remark =       "This book received a Pulitzer Prize.",
  subject =      "Oppenheimer, J. Robert; Physicists; United States;
                 Biography; Atomic bomb; United States; History;
                 Science; Political aspects; United States; History;
                 20th century; United States; History; 20th century",
  subject-dates = "1904--1967",
  tableofcontents = "I. ``He received every new idea as perfectly
                 beautiful'' \\
                 ``His separate prison'' \\
                 ``I am having a pretty bad time'' \\
                 ``I find the work hard, thank God, and almost
                 pleasant'' \\
                 ``I am Oppenheimer'' \\
                 ``Oppie'' \\
                 ``The Nim Nim boys'' \\
                 II. ``In 1936 my interests began to change'' \\
                 ``[Frank] clipped it out and sent it in'' \\
                 ``More and more surely'' \\
                 ``I'm going to marry a friend of yours, Steve'' \\
                 ``We were pulling the New Deal to the left'' \\
                 ``The coordinator of rapid rupture'' \\
                 ``The Chevalier affair'' \\
                 III. ``He'd become very patriotic'' \\
                 ``Too much secrecy'' \\
                 ``Oppenheimer is telling the truth \ldots{}'' \\
                 ``Suicide, motive unknown'' \\
                 ``Would you like to adopt her?'' \\
                 ``Bohr was God, and Oppie was his prophet'' \\
                 ``The impact of the gadget on civilization'' \\
                 ``Now we're all sons-of-bitches'' \\
                 IV. ``Those poor little people'' \\
                 ``I feel I have blood on my hands'' \\
                 ``People could destroy New York'' \\
                 ``Oppie had a rash and is now immune'' \\
                 ``An intellectual hotel'' \\
                 ``He couldn't understand why he did it'' \\
                 ``I am sure that is why she threw things at him'' \\
                 ``He never let on what his opinion was'' \\
                 ``Dark words about Oppie'' \\
                 ``Scientist X'' \\
                 ``The beast in the jungle'' \\
                 V. ``It looks pretty bad, doesn't it?'' \\
                 ``I fear that this whole thing is a piece of idiocy''
                 \\
                 ``A manifestation of hysteria'' \\
                 ``A black mark on the escutcheon of our country'' \\
                 ``I can still feel the warm blood on my hands'' \\
                 ``It was really like a never-never land'' \\
                 ``It should have been done the day after trinity'' \\
                 ``There's only one Robert.''",
}

@Book{Bishop:2003:CSA,
  author =       "Matt Bishop",
  title =        "Computer Security: Art and Science",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xli + 1084",
  year =         "2003",
  ISBN =         "0-201-44099-7 (hardcover)",
  ISBN-13 =      "978-0-201-44099-7 (hardcover)",
  LCCN =         "QA76.9.A25 B56 2002",
  bibdate =      "Wed Dec 31 13:50:12 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$79.99, CAN\$120.99",
  abstract =     "This book has three goals. The first is to show the
                 importance of theory to practice and of practice to
                 theory. The second goal is to emphasize that computer
                 security and cryptography are different. Although
                 cryptography is an essential component of computer
                 security, it is by no means the only component. The
                 third goal is to demonstrate that computer security is
                 not just a science but also an art. It is an art
                 because no system can be considered secure without an
                 examination of how it is to be used. Computer security
                 is also a science. Its theory is based on mathematical
                 constructions, analyses, and proofs. Its systems are
                 built in accordance with the accepted practices of
                 engineering. The material in this book is at the
                 advanced undergraduate level. Throughout, [the authors]
                 assume that the reader is familiar with the basics of
                 compilers and computer architecture (such as the use of
                 the program stack) and operating systems. The reader
                 should also be comfortable with modular arithmetic (for
                 the material on cryptography).",
  acknowledgement = ack-nhfb,
  tableofcontents = "Part 1: Introduction \\
                 1: An overview of computer security \\
                 Part 2: Foundations \\
                 2: Access control matrix \\
                 3: Foundational results \\
                 Part 3: Policy \\
                 4: Security policies \\
                 5: Confidentiality policies \\
                 6: Integrity policies \\
                 7: Hybrid policies \\
                 8: Noninterference and policy composition \\
                 Part 4: Implementation I: cryptography \\
                 9: Basic cryptography \\
                 10: Key management \\
                 11: Cipher techniques \\
                 12: Authentication \\
                 Part 5: Implementation II: systems \\
                 13: Design principles \\
                 14: Representing identity \\
                 15: Access control mechanisms \\
                 16: Information flow \\
                 17: Confinement problem \\
                 Part 6: Assurance / by Elisabeth Sullivan \\
                 18: Introduction to assurance \\
                 19: Building systems with assurance \\
                 20: Formal methods \\
                 21: Evaluating systems \\
                 Part 7: Special topics \\
                 22: Malicious logic \\
                 23: Vulnerability analysis \\
                 24: Auditing \\
                 25: Intrusion detection \\
                 Part 8: Practicum \\
                 26: Network security \\
                 27: System security \\
                 28: User security \\
                 29: Program security \\
                 Part 9: End matter \\
                 30: Lattices \\
                 31: The extended Euclidean algorithm \\
                 32: Entropy and uncertainty \\
                 33: Virtual machines \\
                 34: Symbolic logic \\
                 35: Example academic security policy",
}

@Article{Bjorstad:SR-4-11-57,
  author =       "Petter E. Bjorstad and Erik Boman",
  title =        "{SLALOM}: a Better Algorithm",
  journal =      j-SR,
  volume =       "4",
  number =       "11",
  pages =        "57--62",
  month =        nov,
  year =         "1991",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Blaauw:1997:CAC,
  author =       "Gerrit A. Blaauw and Frederick P. {Brooks, Jr.}",
  title =        "Computer Architecture: Concepts and Evolution",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xlviii + 1213",
  year =         "1997",
  ISBN =         "0-201-10557-8",
  ISBN-13 =      "978-0-201-10557-5",
  LCCN =         "QA76.9.A73 B57 1997",
  bibdate =      "Wed Jul 09 17:22:33 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$59.95",
  abstract =     "Blaauw and Brooks first develop a conceptual framework
                 for understanding computer architecture. They then
                 describe not only what present architectural practice
                 is, but how it came to be so. A major theme is the
                 early divergence and the later reconvergence of
                 computer architectures. They examine both innovations
                 that survived and became part of the standard computer,
                 and the many ideas that were explored in real machines
                 but did not survive. In describing the discards, they
                 also address why these ideas did not make it. The
                 authors' goals are to analyze and systematize familiar
                 design alternatives, and to introduce you to unfamiliar
                 ones. They illuminate their discussion with detailed
                 executable descriptions of both early and more recent
                 computers. The designer's most important study, they
                 argue, is other people's designs. This book's computer
                 zoo will give you a unique resource for precise
                 information about 30 important machines. Armed with the
                 factors pro and con on the various known solutions to
                 design problems, you will be better able to determine
                 the most fruitful architectural course for your own
                 design.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Part 1. Design decisions, chapters 1--8 \\
                 Part 2. A computer zoo, chapters 9--16",
}

@Book{Black:2002:IHS,
  author =       "Edwin Black",
  title =        "{IBM} and the {Holocaust}: the strategic alliance
                 between {Nazi Germany} and {America}'s most powerful
                 corporation",
  publisher =    "Three Rivers Press",
  address =      "New York, NY, USA",
  pages =        "551",
  year =         "2002",
  ISBN =         "0-609-80899-0 (paperback)",
  ISBN-13 =      "978-0-609-80899-3 (paperback)",
  LCCN =         "HD9696.2.U64 I253 2002",
  bibdate =      "Fri Jan 13 17:24:54 MST 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 melvyl.cdlib.org:210/CDL90",
  acknowledgement = ack-nhfb,
  remark =       "Originally published: New York: Crown Publishers,
                 c2001. With a new afterword.",
  subject =      "Germany; Statistical services; History; 20th century;
                 Holocaust, Jewish (1939--1945); Data processing; Jews;
                 1933--1945",
  tableofcontents = "Numbered people\\
                 The IBM-Hitler intersection\\
                 Identifying the Jews\\
                 The IBM-Nazi alliance\\
                 A Nazi medal for Watson\\
                 War cards\\
                 Deadly count\\
                 With blitzkrieg efficiency\\
                 The Dehomag revolt\\
                 The struggle to stay in the Axis\\
                 France and Holland\\
                 IBM and the war\\
                 Extermination\\
                 The spoils of genocide\\
                 Afterword: the next chapter\\
                 Revelation and responsibility",
}

@Book{Blair:1998:SIU,
  author =       "John D. Blair and {The Samba Team}",
  title =        "{Samba}: Integrating {UNIX} and {Windows}",
  publisher =    pub-SSC,
  address =      pub-SSC:adr,
  pages =        "xviii + 298",
  month =        jun,
  year =         "1998",
  ISBN =         "1-57831-006-7",
  ISBN-13 =      "978-1-57831-006-7",
  LCCN =         "QA76.76.O63 B55 1998",
  bibdate =      "Wed Jun 17 06:25:11 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "From the publisher: ``Includes CD-ROM containing
                 version 1.9.18 of the Samba server, a library of useful
                 tools and scripts, the Samba mailing list archives, and
                 all examples discussed in the book.''",
  price =        "US\$29.95",
  URL =          "http://www.clbooks.com/sqlnut/SP/search/gtsumt?source=&isbn=1578310067;
                 http://www.ssc.com/ssc/samba/",
  acknowledgement = ack-nhfb,
}

@Book{Blandy:2015:RPL,
  author =       "Jim Blandy",
  title =        "The {Rust} Programming Language: Fast, Safe, and
                 Beautiful",
  publisher =    pub-ORA-MEDIA,
  address =      pub-ORA-MEDIA:adr,
  pages =        "????",
  year =         "2015",
  ISBN =         "1-4919-2544-2",
  ISBN-13 =      "978-1-4919-2544-7",
  LCCN =         "????",
  bibdate =      "Thu Oct 31 18:43:15 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/ora.bib",
  note =         "Video file (1h10m).",
  abstract =     "Rust is a new programming language offering the
                 performance and control over memory of C and C++,
                 combined with a type system that catches memory leaks,
                 null pointer fetches, dangling pointers, and even the
                 nastier thread interactions. The price? You have to
                 think a bit more before you write. This webcast will
                 cover; How Rust ensures memory safety; lifetimes,
                 ownership, and borrowing; Polymorphism in Rust; traits,
                 generics, and how they work together; Modules, crates,
                 and Cargo; Concurrency, and how Rust forbids data
                 races.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
}

@Book{Blandy:2017:PR,
  author =       "Jim Blandy and Jason Orendorff",
  title =        "Programming {Rust}",
  publisher =    pub-ORA-MEDIA,
  address =      pub-ORA-MEDIA:adr,
  pages =        "xx + 598",
  year =         "2017",
  ISBN =         "1-4919-2728-3 (paperback), 1-4919-2727-5,
                 1-4919-2723-2 (e-book), 1-4919-2725-9 (e-book)",
  ISBN-13 =      "978-1-4919-2728-1 (paperback), 978-1-4919-2727-4,
                 978-1-4919-2723-6 (e-book), 978-1-4919-2725-0
                 (e-book)",
  LCCN =         "QA76.73.R88 B53 2017",
  bibdate =      "Mon Dec 9 15:37:10 MST 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/multithreading.bib;
                 https://www.math.utah.edu/pub/tex/bib/ora.bib",
  URL =          "http://proquest.safaribooksonline.com/9781491927274",
  abstract =     "Rust is a new systems programming language that
                 combines the performance and low-level control of C and
                 C++ with memory safety and thread safety. Rust's
                 modern, flexible types ensure your program is free of
                 null pointer dereferences, double frees, dangling
                 pointers, and similar bugs, all at compile time,
                 without runtime overhead. In multithreaded code, Rust
                 catches data races at compile time, making concurrency
                 much easier to use. Written by two experienced systems
                 programmers, this book explains how Rust manages to
                 bridge the gap between performance and safety, and how
                 you can take advantage of it. Topics include: How Rust
                 represents values in memory (with diagrams) Complete
                 explanations of ownership, moves, borrows, and
                 lifetimes Cargo, rustdoc, unit tests, and how to
                 publish your code on crates.io, Rust's public package
                 repository High-level features like generic code,
                 closures, collections, and iterators that make Rust
                 productive and flexible Concurrency in Rust: threads,
                 mutexes, channels, and atomics, all much safer to use
                 than in C or C++ Unsafe code, and how to preserve the
                 integrity of ordinary code that uses it. Extended
                 examples illustrating how pieces of the language fit
                 together.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "UNIX (Computer file); UNIX (Computer file); C
                 (Computer program language); Text editors (Computer
                 programs); Software engineering; C (Computer program
                 language); Software engineering.; Text editors
                 (Computer programs)",
  tableofcontents = "Preface \\
                 Who Should Read This Book \\
                 Why We Wrote This Book \\
                 Navigating This Book \\
                 Conventions Used in This Book \\
                 Using Code Examples \\
                 O Reilly Safari \\
                 How to Contact Us \\
                 Acknowledgments \\
                 1. Why Rust? \\
                 Type Safety \\
                 2. A Tour of Rust \\
                 Downloading and Installing Rust \\
                 A Simple Function \\
                 Writing and Running Unit Tests \\
                 Handling Command-Line Arguments \\
                 A Simple Web Server \\
                 Concurrency \\
                 What the Mandelbrot Set Actually Is \\
                 Parsing Pair Command-Line Arguments \\
                 Mapping from Pixels to Complex Numbers \\
                 Plotting the Set \\
                 Writing Image Files \\
                 A Concurrent Mandelbrot Program \\
                 Running the Mandelbrot Plotter \\
                 Safety Is Invisible \\
                 3. Basic Types \\
                 Machine Types \\
                 Integer Types \\
                 Floating-Point Types \\
                 The bool Type \\
                 Characters \\
                 Tuples \\
                 Pointer Types \\
                 References \\
                 Boxes \\
                 Raw Pointers \\
                 Arrays, Vectors, and Slices \\
                 Arrays \\
                 Vectors \\
                 Slices \\
                 String Types \\
                 String Literals \\
                 Byte Strings \\
                 Strings in Memory \\
                 String \\
                 Using Strings \\
                 Other String-Like Types \\
                 Beyond the Basics \\
                 4. Ownership \\
                 Ownership \\
                 Moves \\
                 More Operations That Move \\
                 Moves and Control Flow \\
                 Moves and Indexed Content \\
                 Copy Types: The Exception to Moves \\
                 Rc and Arc: Shared Ownership \\
                 5. References \\
                 References as Values \\
                 Rust References Versus C++ References \\
                 Assigning References \\
                 References to References \\
                 Comparing References \\
                 References Are Never Null \\
                 Borrowing References to Arbitrary Expressions \\
                 References to Slices and Trait Objects \\
                 Reference Safety \\
                 Borrowing a Local Variable \\
                 Receiving References as Parameters \\
                 Passing References as Arguments \\
                 Returning References \\
                 Structs Containing References \\
                 Distinct Lifetime Parameters \\
                 Omitting Lifetime Parameters \\
                 Sharing Versus Mutation \\
                 Taking Arms Against a Sea of Objects \\
                 6. Expressions \\
                 An Expression Language \\
                 Blocks and Semicolons \\
                 Declarations \\
                 if and match \\
                 if let \\
                 Loops \\
                 return Expressions \\
                 Why Rust Has loop \\
                 Function and Method Calls \\
                 Fields and Elements \\
                 Reference Operators \\
                 Arithmetic, Bitwise, Comparison, and Logical Operators
                 \\
                 Assignment \\
                 Type Casts \\
                 Closures \\
                 Precedence and Associativity \\
                 Onward \\
                 7. Error Handling \\
                 Panic \\
                 Unwinding \\
                 Aborting \\
                 Result \\
                 Catching Errors \\
                 Result Type Aliases \\
                 Printing Errors \\
                 Propagating Errors \\
                 Working with Multiple Error Types \\
                 Dealing with Errors That Can t Happen \\
                 Ignoring Errors \\
                 Handling Errors in main() \\
                 Declaring a Custom Error Type \\
                 Why Results? \\
                 8. Crates and Modules \\
                 Crates \\
                 Build Profiles \\
                 Modules \\
                 Modules in Separate Files \\
                 Paths and Imports \\
                 The Standard Prelude \\
                 Items, the Building Blocks of Rust \\
                 Turning a Program into a Library \\
                 The src/bin Directory \\
                 Attributes \\
                 Tests and Documentation \\
                 Integration Tests \\
                 Documentation \\
                 Doc-Tests \\
                 Specifying Dependencies \\
                 Versions \\
                 Cargo.lock \\
                 Publishing Crates to crates.io \\
                 Workspaces \\
                 More Nice Things \\
                 9. Structs \\
                 Named-Field Structs \\
                 Tuple-Like Structs \\
                 Unit-Like Structs \\
                 Struct Layout \\
                 Defining Methods with impl \\
                 Generic Structs \\
                 Structs with Lifetime Parameters \\
                 Deriving Common Traits for Struct Types \\
                 Interior Mutability \\
                 10. Enums and Patterns \\
                 Enums \\
                 Enums with Data \\
                 Enums in Memory \\
                 Rich Data Structures Using Enums \\
                 Generic Enums \\
                 Patterns \\
                 Literals, Variables, and Wildcards in Patterns \\
                 Tuple and Struct Patterns \\
                 Reference Patterns \\
                 Matching Multiple Possibilities \\
                 Pattern Guards \\
                 @ patterns \\
                 Where Patterns Are Allowed \\
                 Populating a Binary Tree \\
                 The Big Picture \\
                 11. Traits and Generics \\
                 Using Traits \\
                 Trait Objects \\
                 Trait Object Layout \\
                 Generic Functions \\
                 Which to Use \\
                 Defining and Implementing Traits \\
                 Default Methods \\
                 Traits and Other Peoples Types \\
                 Self in Traits \\
                 Subtraits \\
                 Static Methods \\
                 Fully Qualified Method Calls \\
                 Traits That Define Relationships Between Types \\
                 Associated Types (or How Iterators Work) \\
                 Generic Traits (or How Operator Overloading Works) \\
                 Buddy Traits (or How rand::random() Works) \\
                 Reverse-Engineering Bounds \\
                 Conclusion \\
                 12. Operator Overloading \\
                 Arithmetic and Bitwise Operators \\
                 Unary Operators \\
                 Binary Operators \\
                 Compound Assignment Operators \\
                 Equality Tests \\
                 Ordered Comparisons \\
                 Index and IndexMut \\
                 Other Operators \\
                 13. Utility Traits \\
                 Drop \\
                 Sized \\
                 Clone \\
                 Copy \\
                 Deref and DerefMut \\
                 Default \\
                 AsRef and AsMut \\
                 Borrow and BorrowMut \\
                 From and Into \\
                 ToOwned \\
                 Borrow and ToOwned at Work: The Humble Cow \\
                 14. Closures \\
                 Capturing Variables \\
                 Closures That Borrow \\
                 Closures That Steal \\
                 Function and Closure Types \\
                 Closure Performance \\
                 Closures and Safety \\
                 Closures That Kill \\
                 FnOnce \\
                 FnMut \\
                 Callbacks \\
                 Using Closures Effectively \\
                 15. Iterators \\
                 The Iterator and IntoIterator Traits \\
                 Creating Iterators \\
                 iter and iter\_mut Methods \\
                 IntoIterator Implementations \\
                 drain Methods \\
                 Other Iterator Sources \\
                 Iterator Adapters \\
                 map and filter \\
                 filter_map and flat_map \\
                 scan \\
                 take and take_while \\
                 skip and skip_while \\
                 peekable \\
                 fuse \\
                 Reversible Iterators and rev \\
                 inspect \\
                 chain \\
                 enumerate \\
                 zip \\
                 by_ref \\
                 cloned \\
                 cycle \\
                 Consuming Iterators \\
                 Simple Accumulation: count, sum, product \\
                 max, min \\
                 max_by, min_by \\
                 max_by_key, min_by_key \\
                 Comparing Item Sequences \\
                 any and all \\
                 position, rposition, and ExactSizeIterator \\
                 fold \\
                 nth \\
                 last \\
                 find \\
                 Building Collections: collect and FromIterator \\
                 The Extend Trait \\
                 partition \\
                 Implementing Your Own Iterators \\
                 16. Collections \\
                 Overview \\
                 Vec<T> \\
                 Accessing Elements \\
                 Iteration \\
                 Growing and Shrinking Vectors \\
                 Joining \\
                 Splitting \\
                 Swapping \\
                 Sorting and Searching \\
                 Comparing Slices \\
                 Random Elements \\
                 Rust Rules Out Invalidation Errors \\
                 VecDeque<T> \\
                 LinkedList<T> \\
                 BinaryHeap<T> \\
                 HashMap<K, V> and BTreeMap<K, V> \\
                 Entries \\
                 Map Iteration \\
                 HashSet<T> and BTreeSet<T> \\
                 Set Iteration \\
                 When Equal Values Are Different \\
                 Whole-Set Operations \\
                 Hashing \\
                 Using a Custom Hashing Algorithm \\
                 Beyond the Standard Collections \\
                 17. Strings and Text \\
                 Some Unicode Background \\
                 ASCII, Latin-1, and Unicode \\
                 UTF-8 \\
                 Text Directionality \\
                 Characters (char) \\
                 Classifying Characters \\
                 Handling Digits \\
                 Case Conversion for Characters \\
                 Conversions to and from Integers \\
                 String and str \\
                 Creating String Values \\
                 Simple Inspection \\
                 Appending and Inserting Text \\
                 Removing Text \\
                 Conventions for Searching and Iterating \\
                 Patterns for Searching Text \\
                 Searching and Replacing \\
                 Iterating over Text \\
                 Trimming \\
                 Case Conversion for Strings \\
                 Parsing Other Types from Strings \\
                 Converting Other Types to Strings \\
                 Borrowing as Other Text-Like Types \\
                 Accessing Text as UTF-8 \\
                 Producing Text from UTF-8 Data \\
                 Putting Off Allocation \\
                 Strings as Generic Collections \\
                 Formatting Values \\
                 Formatting Text Values \\
                 Formatting Numbers \\
                 Formatting Other Types \\
                 Formatting Values for Debugging \\
                 Formatting Pointers for Debugging \\
                 Referring to Arguments by Index or Name \\
                 Dynamic Widths and Precisions \\
                 Formatting Your Own Types \\
                 Using the Formatting Language in Your Own Code \\
                 Regular Expressions \\
                 Basic Regex Use \\
                 Building Regex Values Lazily \\
                 Normalization \\
                 Normalization Forms \\
                 The unicode-normalization Crate \\
                 18. Input and Output \\
                 Readers and Writers \\
                 Readers \\
                 Buffered Readers \\
                 Reading Lines \\
                 Collecting Lines \\
                 Writers \\
                 Files \\
                 Seeking \\
                 Other Reader and Writer Types \\
                 Binary Data, Compression, and Serialization \\
                 Files and Directories \\
                 OsStr and Path \\
                 Path and PathBuf Methods \\
                 Filesystem Access Functions \\
                 Reading Directories \\
                 Platform-Specific Features \\
                 Networking \\
                 19. Concurrency \\
                 Fork-Join Parallelism \\
                 spawn and join \\
                 Error Handling Across Threads \\
                 Sharing Immutable Data Across Threads \\
                 Rayon \\
                 Revisiting the Mandelbrot Set \\
                 Channels \\
                 Sending Values \\
                 Receiving Values \\
                 Running the Pipeline \\
                 Channel Features and Performance \\
                 Thread Safety: Send and Sync \\
                 Piping Almost Any Iterator to a Channel \\
                 Beyond Pipelines \\
                 Shared Mutable State \\
                 What Is a Mutex? \\
                 Mutex<T> \\
                 mut and Mutex \\
                 Why Mutexes Are Not Always a Good Idea \\
                 Deadlock \\
                 Poisoned Mutexes \\
                 Multi-Consumer Channels Using Mutexes \\
                 Read/Write Locks (RwLock<T>) \\
                 Condition Variables (Condvar) \\
                 Atomics \\
                 Global Variables \\
                 What Hacking Concurrent Code in Rust Is Like \\
                 20. Macros \\
                 Macro Basics \\
                 Basics of Macro Expansion \\
                 Unintended Consequences \\
                 Repetition \\
                 Built-In Macros \\
                 Debugging Macros \\
                 The json! Macro \\
                 Fragment Types \\
                 Recursion in Macros \\
                 Using Traits with Macros \\
                 Scoping and Hygiene \\
                 Importing and Exporting Macros \\
                 Avoiding Syntax Errors During Matching \\
                 Beyond macro_rules! \\
                 21. Unsafe Code \\
                 Unsafe from What? \\
                 Unsafe Blocks \\
                 Example: An Efficient ASCII String Type \\
                 Unsafe Functions \\
                 Unsafe Block or Unsafe Function? \\
                 Undefined Behavior \\
                 Unsafe Traits \\
                 Raw Pointers \\
                 Dereferencing Raw Pointers Safely \\
                 Example: RefWithFlag \\
                 Nullable Pointers \\
                 Type Sizes and Alignments \\
                 Pointer Arithmetic \\
                 Moving into and out of Memory \\
                 Example: GapBuffer \\
                 Panic Safety in Unsafe Code \\
                 Foreign Functions: Calling C and C++ from Rust \\
                 Finding Common Data Representations \\
                 Declaring Foreign Functions and Variables \\
                 Using Functions from Libraries \\
                 A Raw Interface to libgit2 \\
                 A Safe Interface to libgit2 \\
                 Conclusion \\
                 Index",
}

@Book{Blatner:1993:RWS,
  author =       "David Blatner and Steve Roth",
  title =        "Real World Scanning and Halftones",
  publisher =    pub-PEACHPIT,
  address =      pub-PEACHPIT:adr,
  pages =        "xx + 275",
  year =         "1993",
  ISBN =         "1-56609-093-8",
  ISBN-13 =      "978-1-56609-093-3",
  LCCN =         "T384 .B52 1993",
  bibdate =      "Tue Aug 22 14:46:09 1995",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$24.95",
  acknowledgement = ack-nhfb,
}

@Book{Blatner:1997:JP,
  author =       "David Blatner",
  title =        "The Joy of $ \pi $",
  publisher =    "Walker and Co.",
  address =      "New York, NY, USA",
  pages =        "xiii + 129",
  year =         "1997",
  ISBN =         "0-8027-1332-7 (hardcover), 0-8027-7562-4 (paperback)",
  ISBN-13 =      "978-0-8027-1332-2 (hardcover), 978-0-8027-7562-7
                 (paperback)",
  LCCN =         "QA484 .B55 1997",
  bibdate =      "Fri Jun 17 06:26:55 MDT 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/pi.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.walkerbooks.com/books/catalog.php?key=4",
  abstract =     "No number has captured the attention and imagination
                 of people throughout the ages as much as the ratio of a
                 circle's circumference to its diameter. Pi or $ \pi $
                 as it is symbolically known, is infinite and, in this
                 book it proves to be infinitely intriguing. The author
                 explores the many facets of pi and humankind's
                 fascination with it, from the ancient Egyptians and
                 Archimedes to Leonardo da Vinci and the modern-day
                 Chudnovsky brothers, who have calculated pi to eight
                 billion digits with a homemade supercomputer. He
                 recounts the history of pi and the quirky stories of
                 those obsessed with it. Sidebars document fascinating
                 pi trivia (including a segment from the O. J. Simpson
                 trial). Dozens of snippets and factoids reveal pi's
                 remarkable impact over the centuries. Mnemonic devices
                 teach how to memorize pi to many hundreds of digits (or
                 more, if you're so inclined). Pi inspired cartoons,
                 poems, limericks, and jokes offer delightfully
                 ``square'' pi humor. And, to satisfy even the most
                 exacting of number jocks, the first one million digits
                 of pi appear throughout the book.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Pi (mathematical constant)",
  tableofcontents = "1: Introduction: Why pi \\
                 2: History of pi \\
                 3: Chudnovsky brothers \\
                 4: Symbol \\
                 5: Personality of pi \\
                 6: Circle squarers \\
                 7: Memorizing pi",
}

@Book{Bliss:2006:AHM,
  author =       "Anna Campbell Bliss and Skylar Nielsen",
  title =        "Art for a House of Mathematics",
  publisher =    pub-AMS,
  address =      pub-AMS:adr,
  pages =        "53",
  year =         "2006",
  ISBN =         "0-9754915-1-2",
  ISBN-13 =      "978-0-9754915-1-5",
  LCCN =         "N72.M3 B55 2006",
  bibdate =      "Thu Jun 22 16:14:57 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 fsz3950.oclc.org:210/WorldCat",
  acknowledgement = ack-nhfb,
  subject =      "Mathematics in art; Math{\'e}matiques dans l'art;
                 Buildings; Mathematics in art",
}

@Book{Bloch:2001:EJP,
  author =       "Joshua Bloch",
  title =        "Effective {Java}: Programming Language Guide",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xvi + 252",
  year =         "2001",
  ISBN =         "0-201-31005-8, 3-642-56735-5 (e-book)",
  ISBN-13 =      "978-0-201-31005-4, 978-3-642-56735-3 (e-book)",
  LCCN =         "QA76.73.J38 B57 2001",
  bibdate =      "Sat Apr 20 11:10:41 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/java2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "\booktitle{Effective Java} is an explicit (and
                 acknowledged) homage to Scott Meyer's
                 \booktitle{Effective C++}. Josh Bloch shares the
                 programming practices of the most expert Java
                 programmers with the rest of the programming community.
                 Distilling the habits of experienced programmers into
                 50 short stand-alone essays, Bloch has laid out the
                 most essential and effective Java rules, providing
                 comprehensive descriptions of techniques. The essays
                 address practical problems that all Java programmers
                 encounter, presents specific ways to improve programs
                 and designs, and also shows how to avoid traps in Java
                 programming. An enormously useful book, each essay
                 contains top notch code examples and insightful ``war
                 stories'' that help capture the students' attention.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Introduction \\
                 2: Creating and destroying objects \\
                 3: Methods common to all objects \\
                 4: Classes and interfaces \\
                 5: Substitutes for C constructs \\
                 6: Methods \\
                 7: General programming \\
                 8: Exceptions \\
                 9: Threads \\
                 10: Serialization \\
                 References \\
                 Index of Patterns and Idioms",
}

@Book{Bloomfield:2008:HEW,
  author =       "Louis Bloomfield",
  title =        "How everything works: making physics out of the
                 ordinary",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xv + 720",
  year =         "2008",
  ISBN =         "0-471-74817-X (hardcover)",
  ISBN-13 =      "978-0-471-74817-5 (hardcover)",
  LCCN =         "QC24.5 .B56 2007",
  bibdate =      "Tue Feb 12 15:26:36 MST 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.gbv.de:20011/gvk",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0649/2006296744-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0708/2006296744-b.html;
                 http://www.loc.gov/catdir/enhancements/fy0728/2006296744-t.html",
  acknowledgement = ack-nhfb,
  tableofcontents = "Chapter 1. Things That Move \\
                 Chapter 2. More Things That Move \\
                 Chapter 3. Mechanical Things \\
                 Chapter 4. More Mechanical Things \\
                 Chapter 5. Things Involving Fluids \\
                 Chapter 6. Things that Move with Fluids \\
                 Chapter 7. Thermal Things \\
                 Chapter 8. Things that Work with Heat \\
                 Chapter 9. Things with Resonances and Mechanical Waves
                 \\
                 Chapter 10. Electric Things \\
                 Chapter 11. Magnetic and Electromagnetic Things \\
                 Chapter 12. Electronic Things \\
                 Chapter 13. Things that Use Electromagnetic Waves \\
                 Chapter 14. Things that Involve Light \\
                 Chapter 15. Optical Things \\
                 Chapter 16. Things that Use Recent Physics \\
                 Chapter 17. Things that Involve Materials \\
                 Chapter 18. Things that Involve Chemical Physics \\
                 Appendix A. Relevant Mathematics \\
                 Appendix B. Units, Conversion of Units \\
                 Glossary \\
                 Photo Credits \\
                 Index",
}

@Book{Blum:2020:FDS,
  author =       "Avrim Blum and John Hopcroft and Ravi Kannan",
  title =        "Foundations of Data Science",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "viii + 424",
  year =         "2020",
  ISBN =         "1-108-48506-5 (hardcover), 1-108-75552-6 (e-book)",
  ISBN-13 =      "978-1-108-48506-7 (hardcover), 978-1-108-75552-8
                 (e-book)",
  LCCN =         "QA76 .B5675 2020",
  bibdate =      "Tue Mar 17 08:01:49 MDT 2020",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "This book provides an introduction to the mathematical
                 and algorithmic foundations of data science, including
                 machine learning, high-dimensional geometry, and
                 analysis of large networks. Topics include the
                 counterintuitive nature of data in high dimensions,
                 important linear algebraic techniques such as singular
                 value decomposition, the theory of random walks and
                 Markov chains, the fundamentals of and important
                 algorithms for machine learning, algorithms and
                 analysis for clustering, probabilistic models for large
                 networks, representation learning including topic
                 modelling and non-negative matrix factorization,
                 wavelets and compressed sensing. Important
                 probabilistic techniques are developed including the
                 law of large numbers, tail inequalities, analysis of
                 random projections, generalization guarantees in
                 machine learning, and moment methods for analysis of
                 phase transitions in large random graphs. Additionally,
                 important structural and complexity measures are
                 discussed such as matrix norms and VC-dimension. This
                 book is suitable for both undergraduate and graduate
                 courses in the design and analysis of algorithms for
                 data.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
}

@Book{Blunden:2002:VMD,
  author =       "Bill Blunden",
  title =        "Virtual Machine Design and Implementation in {C/C++}",
  publisher =    "Wordware Publishing",
  address =      "Plano, TX, USA",
  pages =        "xvii + 668",
  year =         "2002",
  ISBN =         "1-55622-903-8 (paperback), 0-585-40313-9 (e-book)",
  ISBN-13 =      "978-1-55622-903-9 (paperback), 978-0-585-40313-7
                 (e-book)",
  LCCN =         "QA76.9.V5 B59 2002",
  bibdate =      "Thu Jul 14 12:01:14 MDT 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Virtual computer systems; C++ (Computer program
                 language)",
}

@Book{Boas:2006:MMP,
  author =       "Mary L. Boas",
  title =        "Mathematical Methods in the Physical Sciences",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  edition =      "Third",
  pages =        "xviii + 839",
  year =         "2006",
  ISBN =         "0-471-19826-9, 0-471-36580-7",
  ISBN-13 =      "978-0-471-19826-0, 978-0-471-36580-8",
  LCCN =         "QA37.3 .B63 2006",
  bibdate =      "Thu May 3 07:58:44 MDT 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0626/2005279918-b.html;
                 http://www.loc.gov/catdir/enhancements/fy0626/2005279918-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0626/2005279918-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Mathematics; Textbooks",
  tableofcontents = "1. Infinite series, power series \\
                 2. Complex numbers \\
                 3. Linear algebra \\
                 4. Partial differentiation \\
                 5. Multiple integrals \\
                 6. Vector analysis \\
                 7. Fourier series and transforms \\
                 8. Ordinary differential equations \\
                 9. Calculus of variations \\
                 10. Tensor analysis \\
                 11. Special functions \\
                 12. Series solutions of differential equations;
                 Legendre, Bessel, Hermite, and Laguerre functions \\
                 13. Partial differential equations \\
                 14. Functions of a complex variable \\
                 15. Probability and statistics",
}

@Book{Bodanis:2000:BWM,
  author =       "David Bodanis",
  title =        "{$ E = m c^2 $}: a biography of the world's most
                 famous equation",
  publisher =    pub-WALKER,
  address =      pub-WALKER:adr,
  pages =        "ix + 337",
  year =         "2000",
  ISBN =         "0-8027-1352-1 (hardcover)",
  ISBN-13 =      "978-0-8027-1352-0 (hardcover)",
  LCCN =         "QC73.8.C6 B63 2000",
  bibdate =      "Tue Oct 11 06:29:04 MDT 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  remark =       "Basis of Nova series ``Einstein's Big Idea'',
                 broadcast October, 2005.",
  subject =      "Force and energy; Mass (Physics); Mathematical
                 physics; Einstein, Albert",
  subject-dates = "1879--1955",
  tableofcontents = "Part 1 --- Birth \\
                 Bern patent office, 1905 \\
                 Part 2 --- Ancestors of $ E = m c^2 $ \\
                 E is for energy \\
                 = \\
                 m is for mass \\
                 c is for celeritas \\
                 2 \\
                 Part 3 --- The early years \\
                 Einstein and the equation \\
                 Into the atom \\
                 Quiet in the midday snow \\
                 Part 4 --- Adulthood \\
                 Germany's turn \\
                 Norway \\
                 America's turn \\
                 8:16 a.m. --- over Japan \\
                 Part 5 --- Till the end of time \\
                 The fires of the sun \\
                 Creating the earth \\
                 A Brahmin lifts his eyes unto the sky \\
                 Epilogue: What else Einstein did \\
                 Appendix: Follow-up of other key participants",
}

@Article{Boehm:1966:FDT,
  author =       "C. Boehm and G. Jacopini",
  title =        "Flow Diagrams, {Turing} Machines, and Languages With
                 Only Two Formation Rules",
  journal =      j-CACM,
  volume =       "9",
  number =       "5",
  pages =        "366--371",
  month =        may,
  year =         "1966",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  bibdate =      "Tue May 28 07:29:13 1996",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Misc/beebe.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "In the first part of the paper, flow diagrams are
                 introduced to represent internal mappings of a set into
                 itself. Although not every diagram is decomposable into
                 a finite number of given base diagrams, this becomes
                 true at a semantical level due to a suitable extension
                 of the given set and of the basic mappings defined in
                 it. Two normalization methods of flow diagrams are
                 given. The first has three base diagrams; the second,
                 only two. In the second part of the paper, the second
                 method is applied to the theory of Turing machines.
                 With every Turing machine provided with a two-way
                 half-tape, there is associated a similar machine, doing
                 essentially the same job, but working on a tape
                 obtained from the first one by interspersing alternate
                 blank squares. The new machine belongs to the family,
                 elsewhere introduced, generated by composition and
                 iteration from the two machines $L$ and $R$. That
                 family is a proper subfamily of the whole family of
                 Turing machines.",
  acknowledgement = ack-nhfb,
}

@Book{Bohren:1987:CGB,
  author =       "Craig F. Bohren",
  title =        "Clouds in a Glass of Beer --- Simple Experiments in
                 Atmospheric Physics",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xv + 195",
  year =         "1987",
  ISBN =         "0-471-62482-9",
  ISBN-13 =      "978-0-471-62482-0",
  LCCN =         "QC861.2.B64 1987",
  bibdate =      "Fri Apr 1 18:21:29 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Clouds in a Glass of Beer / 1 \\
                 Genies in Jars, Clouds in Bottles, and a Bucket with a
                 Hole in It / 8 \\
                 Happy Ducks, Like Happy People, Perform Best with Cool
                 Heads / 15 \\
                 Sugar and Spice: The Dirty Wet-Bulb Temperature / 20
                 \\
                 Mixing Clouds / 29 \\
                 Conceptions and Misconceptions of Pressure / 38 \\
                 Dew Drops on a Bathroom Mirror / 44 \\
                 A Murder in Ceylon / 53 \\
                 The Freezing of Lakes / 61 \\
                 The Greenhouse Effect / 67 \\
                 Black Clouds / 86 \\
                 Once in a Blue Moon / 91 \\
                 The Green Flash / 98 \\
                 Multiple Scattering at the Breakfast Table / 104 \\
                 Multiple Scattering at the Beach / 113 \\
                 On a Clear Day You Can't See Forever / 120 \\
                 A Serendipitous Iridescent Cloud / 128 \\
                 Physics on a Manure Heap: More about Black Clouds / 136
                 \\
                 Polarization of Skylight / 144 \\
                 Colors of the Sea / 155 \\
                 Indoor Rainbows / 171 \\
                 Why Rainbows Are Not Impossible in Winter / 180 \\
                 Selected Bibliography and Suggestions for Further
                 Reading / 187 \\
                 Index / 191",
}

@Book{Boole:1854:ILT,
  author =       "George Boole",
  title =        "An Investigation of the Laws of Thought",
  publisher =    pub-DOVER,
  address =      pub-DOVER:adr,
  pages =        "424",
  year =         "1854",
  LCCN =         "BC135 .B7 1951",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Boorstin:1958:ACE,
  author =       "Daniel J. Boorstin",
  title =        "The {Americans}: The Colonial Experience",
  publisher =    pub-VINTAGE,
  address =      pub-VINTAGE:adr,
  pages =        "434",
  year =         "1958",
  ISBN =         "0-394-70513-0",
  ISBN-13 =      "978-0-394-70513-2",
  LCCN =         "E162.B68 1964",
  bibdate =      "Tue Dec 26 08:12:38 1995",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$12.00",
  acknowledgement = ack-nhfb,
  author-dates = "1914--2004",
  remark =       "The first volume of the author's trilogy; the second
                 of which is \booktitle{The Americans, the National
                 Experience}; and the third of which is \booktitle{The
                 Americans, the democratic experience}.",
  tableofcontents = "An Unknown Coast / vii \\
                 Book One: The Vision and the Reality / 2 \\
                 Part One: A City Upon a Hill: The Puritans of
                 Massachusetts Bay / 3 \\
                 1. How Orthodoxy Made the Puritans Practical / 5 \\
                 2. The Sermon as an American Institution / 10 \\
                 3. Search for a New England Way / 15 \\
                 4. Puritan Conservatism / 20 \\
                 5. How Puritans Resisted the Temptation of Utopia / 29
                 \\
                 Part Two: The Inward Plantation: The Quakers of
                 Pennsylvania / 33 \\
                 6. The Quest for Martyrdom / 35 \\
                 7. Trials of Governing: The Oath / 40 \\
                 8. Trials of Governing: Pacifism / 48 \\
                 9. How Quakers Misjudged the Indians / 54 \\
                 10. The Withdrawal / 58 \\
                 11. The Curse of Perfectionism / 63 \\
                 Part Three: Victims of Philanthropy: The Settlers of
                 Georgia / 71 \\
                 12. The Altruism of an Unheroic Age / 73 \\
                 13. London Blueprint for Georgia Utopia / 80 \\
                 14. A Charity Colony / 84 \\
                 15. Death of a Welfare Project / 88 \\
                 16. The Perils of Altruism / 95 \\
                 Part Four: Transplanters: The Virginians / 97 \\
                 17. English Gentlemen, American Style / 99 \\
                 18. From Country Squire to Planter Capitalist / 105 \\
                 19. Government by Gentry / 110 \\
                 20. A Republic of Neighbors / 116 \\
                 21. ``Practical Godliness'': An Episcopal Church
                 Without Bishops / 123 \\
                 22. ``Practical Godliness'': Toleration Without a
                 Theory / 132 \\
                 23. Citizens of Virginia / 139 \\
                 Book Two: Viewpoints and Institutions / 145 \\
                 Part Five: An American Frame of Mind / 147 \\
                 24. Wanted: A Philosophy of the Unexpected / 149 \\
                 25. The Appeal to Self-Evidence / 152 \\
                 26. Knowledge Comes Naturally / 159 \\
                 27. The Natural-History Emphasis / 164 \\
                 Part Six: Educating the Community / 169 \\
                 28. The Community Enters the University / 171 \\
                 29. Higher Education in Place of Higher Learning / 178
                 \\
                 30. The Ideal of the Undifferentiated Man / 185 \\
                 Part Seven: The Learned Lose Their Monopolies / 189 \\
                 31. The Fluidity of Professions / 191 \\
                 32. The Unspecialized Lawyer / 195 \\
                 33. The Fusion of Law and Politics / 202 \\
                 Part Eight: New World Medicine / 207 \\
                 34. Nature-Healing and Simple Remedies / 209 \\
                 35. Focus on the Community / 219 \\
                 36. The General Practitioner / 227 \\
                 37. Learning from Experience / 233 \\
                 Part Nine: The Limits of American Science / 241 \\
                 38. Popular Science: Astronomy for Everybody / 243 \\
                 39. Na{\"\i}ve Insights and Ingenious Devices:
                 Electricity / 251 \\
                 40. Backwoods Farming / 259 \\
                 Book Three: Language and the Printed Word / 267 \\
                 Part Ten: The New Uniformity / 269 \\
                 41. An American Accent / 271 \\
                 42. Quest for a Standard / 277 \\
                 43. Culture by the Book: The Spelling Fetish / 284 \\
                 Part Eleven: Culture Without a Capital / 291 \\
                 44. ``Rays Diverging from a Focus'' / 293 \\
                 45. Boston's ``Devout and Useful Books'' / 296 \\
                 46. Manuals for Plantation Living / 301 \\
                 47. The Way of the Marketplace: Philadelphia / 306 \\
                 48. Poetry Without Poets / 313 \\
                 Part Twelve: A Conservative Press / 317 \\
                 49. The Decline of the Book / 319 \\
                 50. The Rise of the Newspaper / 324 \\
                 51. Why Colonial Printed Matter Was Conservative / 329
                 \\
                 52. ``The Publick Printer'' / 335 \\
                 Book Four: Warfare and Diplomacy / 341 \\
                 Part Thirteen: A Nation of Minute Men / 343 \\
                 53. Defensive War and Na{\"\i}ve Diplomacy / 345 \\
                 54. Colonial Militia and the Myth of Preparedness / 352
                 \\
                 55. Home Rule and Colonial ``Isolationism'' / 357 \\
                 56. The Unprofessional Soldier / 363 \\
                 Acknowledgments / 373 \\
                 Bibliographical Notes / 375 \\
                 Index / 423",
}

@Book{Boorstin:1983:D,
  author =       "Daniel J. Boorstin",
  title =        "The Discoverers",
  publisher =    pub-VINTAGE,
  address =      pub-VINTAGE:adr,
  pages =        "xvi + 745",
  year =         "1983",
  ISBN =         "0-394-72625-1",
  ISBN-13 =      "978-0-394-72625-0",
  LCCN =         "CB69 .B66 1985",
  bibdate =      "Tue Dec 14 22:41:00 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Tells the ongoing story of the progressive discovery
                 by man of the nature of the observable world and
                 universe.",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "Book one: Time \\
                 The heavenly empire \\
                 From sun time to clock time \\
                 The missionary clock Book two: The earth and the seas
                 \\
                 The geography of the imagination \\
                 Paths to the East \\
                 Doubling the world \\
                 The American surprise \\
                 Sea paths to everywhere \\
                 Book three: Nature \\
                 Seeing the invisible \\
                 Inside ourselves \\
                 Science goes public \\
                 Cataloguing the whole creation \\
                 Book four: Society \\
                 Widening the communities of knowledge \\
                 Opening the past \\
                 Surveying the present",
  subject =      "Civilization; Discoveries in geography; Science;
                 History; Civilisation; Histoire; D{\'e}couvertes
                 g{\'e}ographiques; Sciences; Civilization; Discoveries
                 in geography; Science; Geestesgeschiedenis;
                 Ontdekkingen; Ontdekkingsreizen; Wetenschap;
                 Entdeckung; Geschichte; Naturwissenschaften; Histoire;
                 D{\'e}couvertes g{\'e}ographiques; D{\'e}couvertes
                 scientifiques; Discoveries (in geography); History;
                 Exploration; Discoveries (in geography.); Entdeckung;
                 Geschichte; Naturwissenschaften",
  tableofcontents = "A Personal Note to the Reader / xv \\
                 Time \\
                 The Heavenly Empire \\
                 The Temptations of the Moon / 4 \\
                 The Week: Gateway to Science / 12 \\
                 God and the Astrologers / 19 \\
                 From Sun Time to Clock Time \\
                 Measuring the Dark Hours / 26 \\
                 The Rise of the Equal Hour / 36 \\
                 Making Time Portable / 46 \\
                 The Missionary Clock \\
                 Open Sesame to China / 56 \\
                 Mother of Machines / 64 \\
                 Why It Happened in the West / 72 \\
                 The Earth and the Seas \\
                 The Geography of the Imagination \\
                 The Awe of Mountains / 82 \\
                 Charting Heaven and Hell / 86 \\
                 The Appeal of Symmetry / 92 \\
                 The Prison of Christian Dogma / 100 \\
                 A Flat Earth Returns / 107 \\
                 Paths to the East \\
                 Pilgrims and Crusaders / 116 \\
                 How the Mongols Opened the Way / 124 \\
                 Missionary Diplomats / 128 \\
                 The Discovery of Asia / 134 \\
                 The Land Curtain Comes Down / 139 \\
                 Doubling the World \\
                 Ptolemy Revived and Revised / 146 \\
                 Portuguese Sea Pioneers / 156 \\
                 Beyond the Threatening Cape / 165 \\
                 To India and Back / 172 \\
                 Why Not the Arabs? / 178 \\
                 The Chinese Reach Out / 186 \\
                 An Empire without Wants / 195 \\
                 The American Surprise \\
                 The Wandering Vikings / 204 \\
                 Dead End in Vinland / 209 \\
                 The Power of the Winds / 217 \\
                 ``The Enterprise of the Indies'' / 224 \\
                 Fair Winds, Soft Words, and Luck / 231 \\
                 Paradise Found and Lost / 235 \\
                 Naming the Unknown / 244 \\
                 Sea Paths to Everywhere \\
                 A World of Oceans / 256 \\
                 The Reign of Secrecy / 267 \\
                 Knowledge Becomes Merchandise / 271 \\
                 The Ardors of Negative Discovery / 278 \\
                 Nature \\
                 Seeing the Invisible \\
                 Into ``the Mists of Paradox'' / 294 \\
                 The Witness of the Naked Eye / 305 \\
                 A Vision Troubled and Surprised / 312 \\
                 Caught in the Cross Fire / 322 \\
                 New Worlds Within / 327 \\
                 Galileo in China / 332 \\
                 Inside Ourselves \\
                 A Mad Prophet Points the Way / 338 \\
                 The Tyranny of Galen / 344 \\
                 From Animals to Man / 351 \\
                 Unseen Currents Within / 361 \\
                 From Qualities to Quantities / 368 \\
                 ``The Microscope of Nature'' / 376 \\
                 Science Goes Public \\
                 A Parliament of Scientists / 386 \\
                 From Experience to Experiment / 394 \\
                 ``God Said, Let Newton Be!'' / 401 \\
                 Priority Becomes the Prize / 408 \\
                 Cataloguing the Whole Creation \\
                 Learning to Look / 420 \\
                 The Invention of Species / 429 \\
                 Specimen Hunting / 436 \\
                 Stretching the Past / 446 \\
                 In Search of the Missing Link / 457 \\
                 Paths to Evolution / 464 \\
                 Society \\
                 Widening the Communities of Knowledge \\
                 The Lost Arts of Memory / 480 \\
                 Empire of the Learned / 489 \\
                 The Duplicating Impulse / 498 \\
                 ``The Art of Artificial Writing'' / 510 \\
                 Communities of the Vernacular / 517 \\
                 Transforming the Book / 524 \\
                 Books Go Public / 533 \\
                 The Island of Islam / 539 \\
                 Toward a World Literature / 547 \\
                 Opening the Past \\
                 The Birth of History / 558 \\
                 Christianity Gives Direction / 566 \\
                 Revising the Record / 574 \\
                 Explorers among the Ruins / 581 \\
                 ``To Wake the Dead'' / 588 \\
                 Latitudes of Time / 596 \\
                 The Discovery of Prehistory / 603 \\
                 Hidden Dimensions: History as Therapy / 613 \\
                 Surveying the Present \\
                 ``All Mankind Is One'' / 626 \\
                 The Shock of the Primitive / 636 \\
                 A Science of Culture / 646 \\
                 An Expanding Universe of Wealth / 652 \\
                 Learning from Numbers / 667 \\
                 The Infinite and the Infinitesimal / 675 \\
                 Some Reference Notes / 685 \\
                 Acknowledgments / 715 \\
                 Index / 719",
}

@Book{Boorstin:1992:C,
  author =       "Daniel J. Boorstin",
  title =        "The Creators",
  publisher =    pub-VINTAGE,
  address =      pub-VINTAGE:adr,
  pages =        "xiv + 811",
  year =         "1992",
  ISBN =         "0-394-54395-5 (hardcover), 0-679-74375-8 (paperback)",
  ISBN-13 =      "978-0-394-54395-6 (hardcover), 978-0-679-74375-0
                 (paperback)",
  LCCN =         "CB69.B65 1993",
  bibdate =      "Wed Apr 6 23:40:26 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "A narrative of the great figures who have created our
                 cultural heritage, from the pyramid builders to
                 Picasso, enriching our world with architecture,
                 painting, sculpture, music, drama, dance, and
                 literature.",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "The riddle of creation: a prologue \\
                 Part 1: Worlds without beginning \\
                 Part 2: A creator-God \\
                 Book 1: Creator man \\
                 Part 3: The power of stone \\
                 Part 4: The magic of images \\
                 Part 5: The immortal world \\
                 Book 2: Recreating the world \\
                 Part 6: Otherworldly elements \\
                 Part 7: The human comedy: a composite work \\
                 Part 8: From craftsman to artist \\
                 Part 9: Composing for the community \\
                 Part 10: Conjuring with time and space \\
                 Book 3: Creating the self \\
                 Part 11: The vanguard world \\
                 Part 12: The wilderness within",
  tableofcontents = "The riddle of creation: a prologue \\
                 Part 1: Worlds without beginning \\
                 1: The dazzled vision of the Hindus \\
                 2: The indifference of Confucius \\
                 3: The silence of the Buddha \\
                 4: The Homeric scripture of the Greeks \\
                 Part 2: A creator-God \\
                 5: The intimate God of Moses \\
                 6: The birth of theology \\
                 7: The innovative God of Saint Augustine \\
                 8: The uncreated Koran \\
                 Book 1: Creator man \\
                 Part 3: The power of stone \\
                 9: The mystery of megaliths \\
                 10: Castles of eternity \\
                 11: Temples of community \\
                 12: Orders for survival \\
                 13: Artificial stone: a Roman revolution \\
                 14: Dome of the world \\
                 15: The great church \\
                 16: A road not taken: the Japanese triumph of wood \\
                 Part 4: The magic of images \\
                 17: The awe of images \\
                 18: Human hieroglyphs \\
                 19: The athletic ideal \\
                 20: For family, empire \\
                 and history \\
                 21: The healing image \\
                 22: ``Satan's handiwork'' \\
                 Part 5: The immortal word \\
                 23: Dionysus the twice-born \\
                 24: The birth of the spectator: from ritual to drama
                 \\
                 25: The mirror of comedy \\
                 26: The arts of prose and persuasion \\
                 Book 2: Re-creating the world \\
                 Part 6: Otherworldly elements \\
                 27: The consoling past \\
                 28: The music of the word \\
                 29: An architecture of light \\
                 30: Adventures in death \\
                 Part 7: The human comedy: a composite work \\
                 31: Escaping the plague \\
                 32: Joys of pilgrimage \\
                 33: ``In the land of booze and bibbers'' \\
                 34: Adventures in madness \\
                 35: The spectator reborn \\
                 36: The freedom to choose \\
                 37: Sagas of ancient empire \\
                 38: New-world epics \\
                 39: A mosaic of novels \\
                 40: In love with the public \\
                 Part 8: From craftsman to artist \\
                 41: Archetypes brought to life \\
                 42: Roman afterlives \\
                 43: The mysteries of light: from a walk to a window \\
                 44: Sovereign of the visible world \\
                 45: ``Divine Michelangelo'' \\
                 46: The painted word: the inward path of Tao \\
                 Part 9. Composing for the community \\
                 47: A protestant music \\
                 48: The music of instruments: from court to concert \\
                 49: New worlds for the orchestra \\
                 50: The music of risorgimento \\
                 51: A Germanic union of the arts \\
                 52: The ephemeral art of the dance \\
                 53: The music of innovation \\
                 Part 10: Conjuring with time and space \\
                 54: The painted moment \\
                 55: The power of light: ``The pencil of nature'' \\
                 56: The rise of the skyscraper \\
                 Book 3: Creating the self \\
                 Part 11: The vanguard word \\
                 57: Inventing the essay \\
                 58: The art of being truthful: confessions \\
                 59: The arts of seeming truthful: autobiography \\
                 60: Intimate biography \\
                 61: The heroic self \\
                 62: Songs of the self \\
                 63: In a dry season \\
                 Part 12: The wilderness within \\
                 64: An American at sea \\
                 65: Sagas of the Russian soul \\
                 66: Journey to the interior \\
                 67: The garden of involuntary memory \\
                 68: The filigreed self \\
                 69: ``I too am here!'' \\
                 70: Vistas from a restless self \\
                 Epilogue: Mysteries of a public art",
}

@Book{Booth:2008:CR,
  author =       "Wayne C. Booth and Gregory G. Colomb and Joseph M.
                 Williams",
  title =        "The craft of research",
  publisher =    pub-U-CHICAGO,
  address =      pub-U-CHICAGO:adr,
  edition =      "Third",
  pages =        "xvii + 317",
  year =         "2008",
  ISBN =         "0-226-06565-0 (cloth), 0-226-06566-9 (paperback)",
  ISBN-13 =      "978-0-226-06565-6 (cloth), 978-0-226-06566-3
                 (paperback)",
  LCCN =         "Q180.55.M4 B66 2008",
  bibdate =      "Sun Jun 26 10:03:49 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Chicago guides to writing, editing, and publishing",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0828/2007042761-b.htm;
                 http://www.loc.gov/catdir/enhancements/fy0828/2007042761-d.htm;
                 http://www.loc.gov/catdir/toc/ecip082/2007042761.htm",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "research; methodology; technical writing",
  tableofcontents = "Research, researchers, and readers \\
                 Prologue: Becoming a researcher \\
                 Thinking in print: Uses of research, public and private
                 \\
                 Connecting with your reader: (Re-)creating yourself and
                 your audience \\
                 Asking questions, finding answers \\
                 Prologue: Planning your project --- an overview \\
                 From topics to questions \\
                 From questions to a problem \\
                 From problems to sources \\
                 Engaging sources \\
                 Making a claim and supporting it \\
                 Prologue: Assembling a research argument \\
                 Making good arguments: Overview \\
                 Making claims \\
                 Assembling reasons and evidence \\
                 Acknowledgments and responses \\
                 Warrants \\
                 Planning, drafting, and revising \\
                 Prologue: Planning again \\
                 Planning \\
                 Drafting your report \\
                 Revising your organization and argument \\
                 Communicating evidence visually \\
                 Introductions and conclusions-- Revising style: Telling
                 your story clearly \\
                 Some last considerations",
}

@Book{Borceux:1990:LPT,
  author =       "Francis Borceux",
  title =        "{\LaTeX}: la perfection dans le traitement du texte",
  publisher =    pub-CIAOCO,
  address =      pub-CIAOCO:adr,
  year =         "1990",
  ISBN =         "2-87085-194-4",
  ISBN-13 =      "978-2-87085-194-4",
  LCCN =         "????",
  bibdate =      "Wed Dec 15 08:46:36 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  acknowledgement = ack-nhfb,
}

@Book{Borde:1992:TE,
  author =       "Arvind Borde",
  title =        "{\TeX} by Example",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "xiv + 169",
  year =         "1992",
  ISBN =         "0-12-117650-9",
  ISBN-13 =      "978-0-12-117650-1",
  LCCN =         "Z253.4.T47 B67 1992",
  bibdate =      "Tue Dec 14 22:41:14 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  ZMnumber =     "0757.68004",
  acknowledgement = ack-nhfb,
}

@Book{Borde:1993:MTE,
  author =       "Arvind Borde",
  title =        "Mathematical {\TeX} by Example",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "xii + 352",
  year =         "1993",
  ISBN =         "0-12-117645-2, 0-12-155940-8",
  ISBN-13 =      "978-0-12-117645-7, 978-0-12-155940-3",
  LCCN =         "Z253.4.T47 B67 1993",
  bibdate =      "Mon Jul 19 15:22:37 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  ZMnumber =     "0799.68001",
  acknowledgement = ack-nhfb,
  tableofcontents = "Introduction \\
                 Examples \\
                 A Summary of AmSTeX \\
                 Other Packages \\
                 Typefaces \\
                 Code \\
                 Bibliography \\
                 Glossary/Index \\
                 Table of Contents",
}

@Book{Borenstein:1994:PIP,
  author =       "Nathaniel S. Borenstein",
  title =        "Programming as if People Mattered: Friendly Programs,
                 Software Engineering, and Other Noble Delusions",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "xiv + 186",
  year =         "1994",
  DOI =          "https://doi.org/10.1515/9781400862535",
  ISBN =         "0-691-03763-9 (paperback), 0-691-08752-0 (hardcover),
                 0-691-60788-5, 0-691-63640-0 (hardcover), 1-4008-6253-1
                 (e-book), 1-68015-900-3 (e-book)",
  ISBN-13 =      "978-0-691-03763-9 (paperback), 978-0-691-08752-8
                 (hardcover), 978-0-691-60788-7, 978-0-691-63640-5
                 (hardcover), 978-1-4008-6253-5 (e-book)",
  LCCN =         "QA76.758",
  bibdate =      "Wed Jan 27 13:07:03 MST 2021",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Through a set of lively anecdotes and essays,
                 Nathaniel Borenstein traces the divergence between the
                 fields of software engineering and user-centered
                 software design, and attempts to reconcile the needs of
                 people in both camps. Originally published in 1994. The
                 Princeton Legacy Library uses the latest
                 print-on-demand technology to again make available
                 previously out-of-print books from the distinguished
                 backlist of Princeton University Press. These paperback
                 editions preserve the original texts of these important
                 books while presenting them in durable paperback
                 editions. The goal of the Princeton Legacy Library is
                 to vastly increase access to the rich scholarly
                 heritage found in the thousands of books published by
                 Princeton University Press since its founding in
                 1905.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Software engineering; User interfaces (Computer
                 systems); Mathematics, other; Mathematics; Informatik;
                 Arithmetic.; Software engineering; User interfaces
                 (Computer systems)",
  tableofcontents = "Frontmatter \\
                 Contents \\
                 Preface \\
                 Acknowledgments \\
                 Introduction \\
                 1: The Hostile Beast \\
                 Introduction \\
                 2: Who Are AU These People? \\
                 3: Stopwatches, Videotapes, and Human Nature \\
                 4: That Reminds Me of the Time \ldots{} \\
                 5: The Quest for the Perfect Line Editor \\
                 6: The Men in Suits \\
                 7: Information Wants to Be Free \\
                 Introduction \\
                 8: Never Underestimate Your Users \\
                 9: Pretend That Small Is Beautiful, but Don't Believe
                 It \\
                 10: Tune Defaults to the Novice \\
                 11: Don't Neglect the Experts \\
                 12: Your Program Stinks, and So Do You \\
                 13: Listen to Your Users, but Ignore What They Say \\
                 14: Lie to Your Managers \\
                 15: Cut Corners Proudly \\
                 16: Remember Your Ignorance \\
                 17: Dabble in Mysticism \\
                 18: Break All the Rules \\
                 Introduction \\
                 19: The Tools of the Trade \\
                 20: The Ivory Tower \\
                 21: People Are Perverse: Designing for the Fickle User
                 \\
                 Epilogue: Programming, Humility, and the Eclipse of the
                 Self \\
                 Further Reading \\
                 References",
}

@Book{Born:1969:AP,
  author =       "Max Born and R. J. (Roger John) Blin-Stoyle and J. M.
                 Radcliffe",
  title =        "Atomic Physics",
  publisher =    pub-DOVER,
  address =      pub-DOVER:adr,
  edition =      "Eighth",
  pages =        "xiv + 495 + 11",
  year =         "1969",
  ISBN =         "0-486-65984-4",
  ISBN-13 =      "978-0-486-65984-8",
  LCCN =         "QC776 .B5713 1989",
  bibdate =      "Wed Apr 9 10:19:44 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/bohr-niels.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/b/born-max.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/d/debroglie-louis.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/h/heisenberg-werner.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/p/pauli-wolfgang.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/r/rutherford-ernest.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/s/schroedinger-erwin.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  price =        "US\$11.95",
  series =       "Dover books on physics and chemistry",
  URL =          "http://www.loc.gov/catdir/description/dover031/89012033.html",
  acknowledgement = ack-nhfb,
  author-dates = "Max Born (1882--1970)",
  KSnumber =     "14",
  remark =       "Translation of \booktitle{Moderne Physik}. Reprint.
                 Originally published: 8th edition, London: Blackie,
                 1969.",
  subject =      "atomic physics; nuclear physics",
  tableofcontents = "I: Kinetic Theory of Gases \\
                 1. Atomic Theory in Chemistry \\
                 2. Fundamental Assumptions of the Kinetic Theory of
                 Gases \\
                 3. Calculation of the Pressure of a Gas \\
                 4. Temperature of a Gas \\
                 5. Specific Heat \\
                 6. Law of Distribution of Energy and Velocity \\
                 7. Free Path \\
                 8. Determination of Avogadro's Number \\
                 II: Elementary Particles \\
                 1. Conduction of Electricity in Rarefied Gases \\
                 2. Canal Rays and Anode Rays (Positive Rays) \\
                 3. X-rays \\
                 4. Radiations from Radioactive Substances \\
                 5. ``Prout's Hypothesis, Isotopy, the Proton'' \\
                 6. The Neutron \\
                 7. Cosmic Rays. Positrons \\
                 8. Mesons and Nuclear Forces \\
                 III: The Nuclear Atom \\
                 1. Lorentz's Electron Theory \\
                 2. The Theorem of the Inertia of Energy \\
                 3. Investigation of Atomic Structure by Scattering
                 Experiments \\
                 4. Mass Defect and Nuclear Binding Energy. The Neutrino
                 \\
                 5. Heavy Hydrogen and Heavy Water \\
                 6. Nuclear Reactions and Radioactive Decay \\
                 IV: Wave-Corpuscles \\
                 1. Wave Theory of Light. Interference and Diffraction
                 \\
                 2. Light Quanta \\
                 3. Quantum Theory of the Atom \\
                 4. Compton Effect \\
                 5. Wave Nature of Matter. De Broglie's Theory \\
                 6. Experimental Demonstration of Matter Waves \\
                 7. ``The Contradiction between the Wave Theory and the
                 Corpuscular Theory, and its Removal'' \\
                 V: Atomic Structure and Spectral Lines \\
                 1. The Bohr Atom; Stationary Orbits for Simply Periodic
                 Motions \\
                 2. Quantum Conditions for Simply and Multiply Periodic
                 Motions \\
                 3. Matrix Mechanics \\
                 4. Wave Mechanics \\
                 5. Angular Momentum in Wave Mechanics \\
                 6. Parity \\
                 7. The Statistical Interpretation of Wave Mechanics \\
                 8. Emission and Absorption of Radiation \\
                 VI: Spin of the Electron and Pauli's Principle \\
                 1. Alkali Doublets and the Spinning Electron \\
                 2. The Anomalous Zeeman Effect \\
                 3. The Hydrogen Atom and X-ray Terms \\
                 4. The Helium Atom \\
                 5. Pauli's Exclusion Principle \\
                 6. The Periodic System. Closed Shells \\
                 7. Magnetism \\
                 8. Wave Theory of the Spin Electron \\
                 9. Density of the Electronic Cloud \\
                 VII: Quantum Statistics \\
                 1. Heat Radiation and Planck's Law \\
                 2. Specific Heat of Solids and of Polyatomic Gases \\
                 3. Quantisation of Black Body Radiation \\
                 4. Bose-Einstein Statistics of Light Quanta \\
                 5. Einstein's Theory of Gas Degeneration \\
                 6. Fermi-Dirac Statistics \\
                 7. Electron Theory of Metals. Energy Distribution \\
                 8. Thermionic and Photoelectric Effect in Metals \\
                 9. Magnetism of the Electron Gas \\
                 10. Electrical and Thermal Conductivity.
                 Thermoelectricity \\
                 VIII: Molecular Structure \\
                 1. Molecular Properties as an Expression of the
                 Distribution of Charge in the Electronic Cloud \\
                 2. Experimental Determination of the Molecular
                 Constants \\
                 3. Band Spectra and the Raman Effect \\
                 4. Chemical Binding. Classification of Types of Binding
                 \\
                 5. Theory of Heteropolar Ionic Binding \\
                 6. Theory of Co-valency Binding \\
                 7. Theory of van der Waals Forces and other Types of
                 Binding \\
                 IX: Quantum Theory of Solids \\
                 1. Introduction \\
                 2. Modes of Lattice Vibration \\
                 3. Quantisation of the Lattice Vibrations \\
                 4. Inelastic Scattering of Neutrons \\
                 5. The M{\"o}ssbauer Effect \\
                 6. Electrons in a Periodic Lattice Band \\
                 7. Metals and Insulators \\
                 8. Metals \\
                 9. Superconductivity \\
                 10. Ferromagnetism \\
                 11. Insulators and Semiconductors \\
                 X: Nuclear Physics \\
                 1. The Size of the Nucleus and a-Decay \\
                 2. Angular Momentum and Magnetic Moment \\
                 3. The Deuteron and Nuclear Forces \\
                 4. Nuclear Structure and Nuclear Saturation \\
                 5. The Nuclear Shell Model \\
                 6. The Nuclear Collective Model \\
                 7. $\beta$-Decay and K-Capture \\
                 8. Nuclear Electromagnetic Interactions \\
                 9. ``The Drop Model, Nuclear Reactions and Fission ``
                 \\
                 10. Conclusion by M. Born \\
                 Appendices \\
                 I. Evaluation of Some Integrals Connected with the
                 Kinetic Theory of Gases \\
                 II. ``Heat Conduction, Viscosity, and Diffusion'' \\
                 III. Van der Waals' Equation of State \\
                 IV. The Mean Square Deviation \\
                 V. Theory of Relativity \\
                 VI. Electron Theory \\
                 VII. The Theorem of the Inertia of Energy \\
                 VIII. Calculation of the Coefficient of Scattering for
                 Radiation by a Free Particle \\
                 IX. Rutherford's Scattering Formula for a-rays \\
                 X. The Compton Effect \\
                 XI. Phase Velocity and Group Velocity \\
                 XII. Elementary Derivation of Heisenberg's Uncertainty
                 Relation \\
                 XIII. Hamiltonian Theory and Action Variables \\
                 XIV. Quantisation of the Elliptic Orbits in Bohr's
                 Theory \\
                 XV. The Oscillator according to Matrix Mechanics \\
                 XVI. The Oscillator according to Wave Mechanics \\
                 XVII. The Vibrations of a Circular Membrane \\
                 XVIII. Solution of Schr{\"o}dinger's Equation for the
                 Kepler (Central Force) Problem \\
                 XIX. The Orbital Angular Momentum \\
                 XX. Deduction of Rutherford's Scattering Formula by
                 Wave Mechanics \\
                 XXI. Deduction of the Selection Rules for Electric
                 Dipole Radiation \\
                 XXII. Anomalous Zeeman Effect of the D Lines of Sodium
                 \\
                 XXIII. Enumeration of the Terms in the Case of Two
                 p-Electrons \\
                 XXIV. Atomic Form Factor \\
                 XXV. The Formalism of Quantum Mechanics \\
                 XXVI. General Proof of the Uncertainty Relation \\
                 XXVII. Transition Probabilities \\
                 XXVIII. Quantum Theory of Emission of Radiation \\
                 XXIX. The Electrostatic Energy of Nuclei \\
                 XXX. Theory of a-Disintegration \\
                 XXXI. The Ground State of the Deuteron \\
                 XXXII. Meson Theory \\
                 XXXIII. The Stefan--Boltzmann Law and Wien's
                 Displacement Law \\
                 XXXIV. Absorption by an Oscillator \\
                 XXXV. Temperature and Entropy in Quantum Statistics \\
                 XXXVI. Thermionic Emission of Electrons \\
                 XXXVII. Temperature Variation of Paramagnetism \\
                 XXXVIII. Theory of Co-valency Binding \\
                 XXXIX. Time-independent Perturbation Theory for
                 Non-degenerate States \\
                 XL. Theory of the van der Waals Forces \\
                 XLI. The Modes of Vibration of a Linear Monatomic Chain
                 \\
                 Bibliography \\
                 Index",
}

@Book{Born:1995:FFH,
  author =       "G{\"u}nter Born",
  title =        "The File Formats Handbook",
  publisher =    pub-ITCP,
  address =      pub-ITCP:adr,
  pages =        "xvii + 1274",
  year =         "1995",
  ISBN =         "1-85032-117-5, 1-85032-128-0",
  ISBN-13 =      "978-1-85032-117-0, 978-1-85032-128-6",
  LCCN =         "QA76.9.F5 B67 1995",
  bibdate =      "Mon May 11 11:43:52 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/sgml.bib",
  price =        "US\$59.95",
  acknowledgement = ack-nhfb,
  annote =       "{\em From the publisher\/}: Formats covered include:
                 Database and index files for DBASE and Foxpro;
                 Spreadsheet file formats for Lotus 1-2-3, Excel, DIF,
                 SIF, SYLK; Word processing file formats for WORD for
                 DOS, Wordperfect, Wordstar, AMI Pro, SGML, and the Rich
                 Text Format (RTF).",
  tableofcontents = "Preface \\
                 ATM: An Introduction \\
                 Demands on Today's Data Communications Technologies \\
                 The Evolution of Data Transmission Technologies \\
                 Contemporary Bandwidth Requirements \\
                 Communication Technologies for High-Speed Networks \\
                 Broadband Communication Systems and High-Speed Networks
                 \\
                 Leased Lines \\
                 ISDN: The Integrated Services Digital Network \\
                 Frame Relay \\
                 xDSL: Digital Subscriber Lines \\
                 SONET/SDH: The Synchronous Digital Hierarchy \\
                 DQDB-Based MANs (Metropolitan Area Networks): CBDS/SMDS
                 \\
                 Fiber Channel \\
                 High-Speed LANs \\
                 B-ISDN and ATM \\
                 ATM: Technology for Converged, QoS-Based Networks \\
                 In Search of New Technologies \\
                 The Limitations of Ethernet Networks \\
                 The Limitations of Token Ring and FDDI Networks \\
                 ATM: Technology for Converged, QoS-Based Networks \\
                 The Limitations of ISDN \\
                 The Limitations of Packet over SONET/SDH \\
                 ATM: Foundation for Large-Scale Converged Networks \\
                 ATM in Local and Wide Area Networks \\
                 ATM: Technology and Standards \\
                 Asynchronous Transfer Mode \\
                 Communication Basics \\
                 Asynchronous Transfer Mode (ATM) \\
                 The Structure of ATM \\
                 The B-ISDN Reference Model \\
                 B-ISDN Networks: Configuration and Reference Points \\
                 ATM: The Physical Layer \\
                 Transmission Convergence \\
                 ATM Data Rates \\
                 ATM in PDH Networks \\
                 ATM in SDH and SONET Networks \\
                 ATM Transport Over SDH/SONET Networks \\
                 Cell-Based Physical Layer \\
                 Physical Layer Monitoring in ATM Networks: OAM Flows
                 F1-F3 \\
                 The ATM Protocol: The ATM Layer \\
                 The ATM Cell \\
                 The ATM Layer: User Plane Functions \\
                 The ATM Layer: Management Plane Functions \\
                 Metasignaling \\
                 The ATM Protocol: The ATM Adaptation Layer \\
                 ATM Adaptation Layer Type 1 (AAL-1) \\
                 ATM Adaptation Layer Type 2 (AAL-2) \\
                 ATM Adaptation Layer Type 3/4 (AAL-3/4) \\
                 ATM Adaptation Layer Type 5 (AAL-5) \\
                 The Signaling ATM Adaptation Layer \\
                 Frame-Based ATM \\
                 ATM over DXI Interfaces \\
                 Frame-Based User-to-Network Interface (FUN) \\
                 Frame-Based ATM over SONET/SDH Transport (FAST) \\
                 Frame-Based ATM Transport over Ethernet (FATE) \\
                 The ATM Protocol: UNI Signaling \\
                 The UNI Signaling Message Format \\
                 The Basic Signaling Processes \\
                 UNI Connection Setup: The Calling Station \\
                 Connection Setup at the Station Called \\
                 Connection Clear-Down \\
                 Connection Restart \\
                 Error Handling \\
                 Comparing ITU-T and ATM Forum UNI Signaling \\
                 The ATM Protocol: NNI Signaling (B-ISUP, PNNI, AINI)
                 \\
                 B-ISUP Signaling. The PNNI Protocol \\
                 ATM Interworking \\
                 ATM-LAN Interworking \\
                 ATM-Frame Relay Interworking \\
                 ATM-MAN Interworking \\
                 Loop Emulation Service \\
                 ATM Network Management \\
                 The ATM MIB Groups \\
                 ILMI and SNMP \\
                 The Link Management MIB Module \\
                 The Address Registration MIB Module \\
                 ATM Networks: Design and Planning \\
                 Designing and Planning ATM Networks \\
                 ATM End Systems \\
                 Planning ATM Workgroups \\
                 Design and Planning of ATM Backbones \\
                 Testing and Choosing Network Components \\
                 Application-Related Performance Parameters for ATM
                 Components \\
                 Security in ATM Networks \\
                 Risk Factor",
}

@Book{Bornemann:2004:SDC,
  author =       "Folkma Bornemann and Dirk Laurie and Stan Wagon and
                 J{\"o}rg Waldvogel",
  title =        "The {SIAM} 100-digit challenge: a study in
                 high-accuracy numerical computing",
  publisher =    pub-SIAM,
  address =      pub-SIAM:adr,
  pages =        "xii + 306",
  year =         "2004",
  ISBN =         "0-89871-561-X",
  ISBN-13 =      "978-0-89871-561-3",
  LCCN =         "QA297 .S4782 2004",
  MRclass =      "65-02",
  MRnumber =     "MR2076374 (2005c:65002)",
  bibdate =      "Mon Feb 07 15:54:44 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://www.ams.org/msnmain?fmt=doc&fn=105&id=2076374&l=20&pg3=IID&r=1&s3=254928&v3=Bornemann%2C%20Folkmar",
  abstract =     "\booktitle{The SIAM 100-Digit Challenge: A Study in
                 High-Accuracy Numerical Computing} gives concrete
                 examples of how to justify the validity of every single
                 digit of a numerical answer. Methods range from
                 carefully designed computer experiments to a posteriori
                 error estimates and computer-assisted proofs based on
                 interval arithmetic. This book will aid readers in
                 developing problem-solving skills for making judicious
                 method selections. Full code for all the methods,
                 examples, tables, and figures is given on the
                 accompanying web page.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  remark =       "The book is a collection of solutions to ten problems
                 posed by Lloyd N. Trefethen that require very high
                 precision computation to solve correctly. The
                 MathSciNet review at the indicated URL gives a good
                 overview.",
  tableofcontents = "Foreword \\
                 Preface \\
                 The Story \\
                 1: A Twisted Tail \\
                 2: Reliability amid Chaos \\
                 3: How Far Away Is Infinity? \\
                 4: Think Globally, Act Locally \\
                 5: A Complex Optimization \\
                 6: Biasing for a Fair Return \\
                 7: Too Large to Be Easy, Too Small to Be Hard \\
                 8: In the Moment of Heat \\
                 9: Gradus ad Parnassum \\
                 10: Hitting the Ends \\
                 Appendix A: Convergence Acceleration \\
                 Appendix B: Extreme Digit-Hunting \\
                 Appendix C: Code \\
                 Appendix D: More Problems \\
                 References \\
                 Index",
}

@Book{Borwein:2004:EMCa,
  author =       "Jonathan M. Borwein and David H. Bailey and Roland
                 Girgensohn",
  title =        "Experimentation in mathematics: computational paths to
                 discovery",
  publisher =    pub-A-K-PETERS,
  address =      pub-A-K-PETERS:adr,
  pages =        "x + 357",
  year =         "2004",
  ISBN =         "1-56881-136-5",
  ISBN-13 =      "978-1-56881-136-9",
  LCCN =         "QA12 .B67 2004",
  MRclass =      "11-01 (11Yxx 40-01 42A16 42A38 68W30)",
  MRnumber =     "2051473",
  MRreviewer =   "F. Beukers",
  bibdate =      "Wed Aug 10 11:09:47 2016",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/borwein-jonathan-m.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "Sequences, series, products and integrals / 1
                 \\
                 Fourier series and integrals / 69 \\
                 Zeta functions and multizeta functions / 131 \\
                 Partitions and powers / 183 \\
                 Primes and polynomials / 225 \\
                 The power of constructive proofs II / 263 \\
                 Numerical techniques II / 299",
  tableofcontents = "",
  xxyear =       "2003",
}

@Book{Borwein:2004:MEP,
  author =       "Jonathan M. Borwein and David H. Bailey",
  title =        "Mathematics by Experiment: Plausible Reasoning in the
                 {21st Century}",
  publisher =    pub-A-K-PETERS,
  address =      pub-A-K-PETERS:adr,
  pages =        "x + 288",
  year =         "2004",
  ISBN =         "1-56881-211-6",
  ISBN-13 =      "978-1-56881-211-3",
  LCCN =         "QA76.95 .B67 2003",
  MRclass =      "00A35",
  MRnumber =     "2033012",
  MRreviewer =   "John H. Mason",
  bibdate =      "Fri Oct 17 10:38:25 2003",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/borwein-jonathan-m.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$45.00",
  URL =          "http://docserver.carma.newcastle.edu.au/272/",
  abstract =     "Using examples that truly represent the experimental
                 methodology, this book provides the historical context
                 of, and rationale behind, experimental mathematics. It
                 shows how today, the use of advanced computing
                 technology provides, mathematicians with an amazing,
                 previously unimaginable ``laboratory,'' in which
                 examples can be analyzed, new ideas tested, and
                 patterns discovered. This is a perfect introduction to
                 the history and current state of research and
                 technology in the growing field of experimental
                 mathematics.",
  acknowledgement = ack-nhfb,
  remark =       "Due to an unfortunate error, some of the citations in
                 the book point to the wrong item in the Bibliography.
                 Here is how to find the correct citation number:
                 [1]--[85]: Citation number is correct; [86, page 100]:
                 [86]; [86, page 2]: [87]; [87]--[156]: Add one to
                 citation number; [157]: [159]; [158, page 139]: [158];
                 [158, page 97]: [160]; [159]--[196]: Add two to
                 citation number",
  tableofcontents = "What is Experimental Mathematics? \\
                 Experimental Mathematics in Action \\
                 Pi and Its Friends \\
                 Normality of Numbers \\
                 The Power of Constructive Proofs I \\
                 Numerical Techniques I \\
                 Making Sense of Experimental Math",
}

@Book{Borwein:2009:CCI,
  author =       "Jonathan M. Borwein and Keith J. Devlin",
  title =        "The computer as crucible: an introduction to
                 experimental mathematics",
  publisher =    pub-A-K-PETERS,
  address =      pub-A-K-PETERS:adr,
  pages =        "xi + 158",
  year =         "2009",
  ISBN =         "1-56881-343-0",
  ISBN-13 =      "978-1-56881-343-1",
  LCCN =         "QA8.7 .B67 2009",
  MRclass =      "00A35 (11-04 11Y16 11Y60)",
  MRnumber =     "2464847",
  MRreviewer =   "Samuel S. Wagstaff, Jr.",
  bibdate =      "Tue Nov 10 17:48:24 MST 2009",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/borwein-jonathan-m.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://docserver.carma.newcastle.edu.au/1730/;
                 http://www.loc.gov/catdir/toc/fy0904/2008022180.html",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Experimental mathematics",
  tableofcontents = "What is experimental mathematics? \\
                 What is the quadrillionth decimal place of $pi$? \\
                 What is that number? \\
                 The most important function in mathematics \\
                 Evaluate the following integral \\
                 Serendipity \\
                 Calculating [pi] \\
                 The computer knows more math than you do \\
                 Take it to the limit \\
                 Danger! Always exercise caution when using the computer
                 \\
                 Stuff we left out (until now)",
}

@Book{Borwein:2014:NFI,
  author =       "Jonathan M. Borwein and Alfred Jacobus van der Poorten
                 and Jeffrey Outlaw Shallit and Wadim Zudilin",
  title =        "Neverending Fractions: an Introduction to Continued
                 Fractions",
  volume =       "23",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "x + 212",
  year =         "2014",
  DOI =          "https://doi.org/10.1017/CBO9780511902659",
  ISBN =         "0-521-18649-8",
  ISBN-13 =      "978-0-521-18649-0",
  LCCN =         "QA295 .B667 2014",
  MRclass =      "11A55 (11J70 40-01 40A15)",
  MRnumber =     "3468515",
  bibdate =      "Thu Jun 12 08:53:05 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/borwein-jonathan-m.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Australian Mathematical Society lecture series",
  URL =          "http://docserver.carma.newcastle.edu.au/1722/;
                 http://ebooks.cambridge.org/ebook.jsf?bid=CBO9780511902659",
  acknowledgement = ack-nhfb,
  subject =      "Continued fractions; Processes, Infinite; Fractions",
  tableofcontents = "Preface \\
                 1. Some preliminaries from number theory \\
                 2. Continued fractions, as they are \\
                 3. Metric theory of continued fractions \\
                 4. Quadratic irrationals through a magnifier \\
                 5. Hyperelliptic curves and Somos sequences \\
                 6. From folding to Fibonacci \\
                 7. The integer part of $q \alpha + \beta$ \\
                 8. The Erd{\H{o}}s--Moser equation \\
                 9. Irregular continued fractions \\
                 Appendix. Selected continued fractions \\
                 Bibliography \\
                 Index",
}

@Book{Boslaugh:1999:WCW,
  author =       "David L. Boslaugh",
  title =        "When Computers Went to Sea: The Digitization of the
                 {United States Navy}",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "xxiv + 467",
  year =         "1999",
  ISBN =         "0-7695-0024-2",
  ISBN-13 =      "978-0-7695-0024-9",
  LCCN =         "Q175.N438 1997; VB212 .B67 1999",
  bibdate =      "Wed Jan 27 06:33:19 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "IEEE catalog number BP000024.",
  price =        "US\$35.00",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0706/99024731-d.html;
                 http://www.loc.gov/catdir/toc/wiley031/99024731.html",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  tableofcontents = "Radar --- New Eyes for the Fleet \\
                 Beginnings of Radar \\
                 May Day--24 October 1944 \\
                 Creation of Radar in the U.S. Navy \\
                 Start of the Naval Research Laboratory Radio Location
                 Project \\
                 Tracking Projectiles in Flight --- The Battleship New
                 York Tests \\
                 The Plan Position Indicator \\
                 The Baby Gets a Name \\
                 Mass Production \\
                 London --- An Easy Target \\
                 Chain Home \\
                 Learning to Use Radar at Sea \\
                 The Most Valuable Cargo \\
                 Radar at War in the Pacific \\
                 McNally's Day of Infamy \\
                 Aboard Lexington \\
                 Aboard the Flying Boats \\
                 The Fighter Director Officers \\
                 CXAM in Action \\
                 Rest in Peace CXAM \\
                 The CXAM Lives On \\
                 Turning Point for McNally \\
                 Evolution of the Combat Information Center \\
                 The Kamikazes \\
                 Divine Wind \\
                 Floating Chrysanthemum \\
                 A Lingering Problem \\
                 Legacy of the Kamikazes \\
                 Legacy of Radar \\
                 Problems \\
                 Quest for Solutions \\
                 The Three Ts \\
                 The Guided Missile Frigates \\
                 Too Much Data and Not Enough Information \\
                 Three Digital Attempts \\
                 The Canadian Navy's Digial Automated Tracking and
                 Resolving System \\
                 Early Digital Experiments at the Navy Electronics
                 Laboratory \\
                 The Semi-Automatic Air Intercept Control System \\
                 Trouble with Analogs \\
                 The Royal Navy Comprehensive Display System \\
                 NRL's Electronic Data System \\
                 The Intercept Tracking and Control Console \\
                 Project COSMOS \\
                 Project CORNFIELD \\
                 The Codebreaking Computers --- A Digital Solution \\
                 The Navy Codebreakers \\
                 A Place Named Seesaw \\
                 From Steam to Electrons \\
                 A Machine Named Ice Cream \\
                 The Naval Computing Machine Laboratory",
}

@Book{Bottou:2007:LSK,
  editor =       "L{\'e}on Bottou and Olivier Chapelle and Dennis DeCost
                 and Jason Weston",
  title =        "Large-scale Kernel Machines",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "xii + 396",
  year =         "2007",
  ISBN =         "0-262-02625-2 (hardcover), 0-262-25579-0 (e-book)",
  ISBN-13 =      "978-0-262-02625-3 (hardcover), 978-0-262-25579-0
                 (e-book)",
  LCCN =         "QA76.9.D35 L38 2007",
  bibdate =      "Tue Aug 19 15:27:40 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 melvyl.cdlib.org:210/CDL90",
  series =       "Neural information processing series",
  URL =          "http://www.loc.gov/catdir/toc/ecip078/2007000980.html",
  abstract =     "This volume offers researchers and engineers practical
                 solutions for learning from large-scale datasets, with
                 detailed descriptions of algorithms and experiments
                 carried out on realistically large datasets. At the
                 same time it offers researchers information that can
                 address the relative lack of theoretical grounding for
                 many useful algorithms.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Data structures (Computer science); Machine learning",
  tableofcontents = "Support vector machine solvers / L{\'e}on Bottou
                 and Chih-Jen Lin \\
                 Training a support vector machine in the primal /
                 Olivier Chapelle \\
                 Fast kernel learning with sparse inverted index /
                 Patrick Haffner and Stephan Kanthak \\
                 Large-scale learning with string kernels / Soren
                 Sonnenburg, Gunnar Ratsch, and Konrad Rieck \\
                 Large-scale parallel SVM implementation / Igor
                 Durdanovic, Eric Cosatto, and Hans-Peter Graf \\
                 A distributed sequential solver for large-scale SVMs /
                 Elad Yom-Tov \\
                 Newton methods for fast semisupervised linear SVMs /
                 Vikas Sindhwani and S. Sathiya Keerthi \\
                 The improved Fast Gauss Transform with applications to
                 machine learning / Vikas Chandrakant Raykar and Ramani
                 Duraiswami \\
                 Approximation methods for Gaussian process regression /
                 Joaquin Qui{\"a}nonero-Candela, Carl Edward Rasmussen,
                 and Christopher K. I. Williams \\
                 Brisk kernel independent component analysis / Stefanie
                 Jegelka and Arthur Gretton \\
                 Building SVMs with reduced classifier complexity / S.
                 Sathiya Keerthi, Olivier Chapelle, and Dennis DeCost
                 \\
                 Trading convexity for scalability / Ronan Collobert
                 [and others] \\
                 Training invariant SVMs using selective sampling /
                 Gaelle Loosli, L{\'e}on Bottou, and St{\'e}phane Canu
                 \\
                 Scaling learning algorithms toward AI / Yoshua Bengio
                 and Yann LeCun",
}

@Book{Bourne:1990:UVU,
  author =       "Philip E. Bourne",
  title =        "{UNIX} for {VMS} Users",
  publisher =    pub-DP,
  address =      pub-DP:adr,
  pages =        "xvi + 368",
  year =         "1990",
  ISBN =         "1-55558-034-3",
  ISBN-13 =      "978-1-55558-034-6",
  LCCN =         "QA76.76.O63 B67 1989",
  bibdate =      "Tue Dec 14 22:41:28 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Bowles:1977:MPS,
  author =       "Kenneth L. Bowles",
  title =        "Microcomputer Problem Solving Using {Pascal}",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "563",
  year =         "1977",
  DOI =          "https://doi.org/10.1007/978-1-4615-9998-2",
  ISBN =         "3-540-90286-4, 1-4615-9998-9 (e-book), 3-662-38578-3
                 (e-book)",
  ISBN-13 =      "978-3-540-90286-7, 978-1-4615-9998-2 (e-book),
                 978-3-662-38578-4 (e-book)",
  LCCN =         "QA76.73.P2 .B68",
  bibdate =      "Wed Dec 15 07:57:08 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://link.springer.com/10.1007/978-3-662-38578-4",
  abstract =     "This book is designed both for introductory courses in
                 computer problem solving, at the freshman and sophomore
                 college level, and for individual self study. An
                 earlier version of the book has been used seven times
                 for teaching large introductory classes at University
                 of California San Diego (UCSD). This preface is
                 intended for the instructor, or for anyone
                 sophisticated enough in contemporary computing practice
                 to be able to advise the prospective student. The
                 amount of material presented has been completed by
                 about 55 percent of all students taking the course,
                 where UCSD schedules 10 weeks of classes in a quarter.
                 We have taught the course using Keller's Personalized
                 System of Instruction (PSI), though the organization of
                 the book does not require that plan to be used. PSI
                 methods allow slightly more material to be absorbed by
                 the students than is the case with the traditional
                 lecture/recitation presentation. PSI allows grading
                 according to the number of chapter units completed.
                 Virtually all students who pass the course at UCSD do
                 complete the first ten essential chapters and the
                 Exercises associated with them. For a conventional
                 presentation under the semester system, the 15 chapters
                 should present an appropriate amount of material. For a
                 conventional course under the quarter system, one might
                 not expect to complete more than the first 12 chapters
                 except on an extra credit basis.",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "0. Introduction \\
                 1. Getting Started \\
                 2. Procedures and Variables \\
                 3. Controlling Program Flow, Repetition \\
                 4. More on Procedures \\
                 5. Working with Numbers \\
                 6. Handling Complex Program Structure \\
                 7. Data Input \\
                 8. Basic Data Structures \\
                 I. Arrays \\
                 9. Basic Data Structures \\
                 II. Sets \\
                 10. Basic Data Structures \\
                 III. Records \\
                 11. The GOTO Statement \\
                 12. Formatted Output \\
                 13. Searching \\
                 14. Sorting \\
                 I. Simple Algorithms \\
                 15. Sorting \\
                 II. Quicksort \\
                 Appendix A \\
                 Differences between UCSD's Pascal and Standard Pascal
                 \\
                 Appendix B \\
                 Glossary of Computer Jargon \\
                 Appendix C \\
                 Built-in Procedures and Functions \\
                 Appendix D \\
                 Index \\
                 Appendix E \\
                 Syntax Diagrams",
}

@Book{Bowman:1996:PSH,
  author =       "Judith S. Bowman and Sandra L. Emerson and Marcy
                 Darnovsky",
  title =        "The Practical {SQL} Handbook: Using {Structured Query
                 Language}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Third",
  pages =        "xxvi + 454",
  year =         "1996",
  ISBN =         "0-201-44787-8",
  ISBN-13 =      "978-0-201-44787-3",
  LCCN =         "QA76.73.S67 B69 1996",
  bibdate =      "Wed Mar 03 08:05:35 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/sqlbooks.bib",
  note =         "Includes CD-ROM.",
  price =        "US\$39.95",
  acknowledgement = ack-nhfb,
  keywords =     "relational databases; SQL (computer program
                 language)",
  tableofcontents = "SQL and relational database management \\
                 Designing databases \\
                 Creating and filling a database \\
                 Selecting data from the database \\
                 Sorting data and other selection techniques \\
                 Grouping data and reporting from it \\
                 Joining tables for comprehensive data \\
                 Structuring queries with subqueries \\
                 Creating and using views \\
                 Security, transactions, performance, and integrity \\
                 Solving business problems \\
                 Mistakes and how to avoid them",
}

@Book{Bowman:2001:PSS,
  author =       "Judith S. Bowman",
  title =        "Practical {SQL}: the Sequel",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xv + 329",
  year =         "2001",
  ISBN =         "0-201-61638-6 (paperback)",
  ISBN-13 =      "978-0-201-61638-5 (paperback)",
  LCCN =         "QA76.73.S67 B695 2001",
  bibdate =      "Wed Feb 28 09:38:10 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/sqlbooks.bib",
  note =         "Includes CD-ROM.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  tableofcontents = "List of Tables / xi \\
                 List of Figures / xiii \\
                 Acknowledgments / xv \\
                 1: Introduction \\
                 In This Chapter / 1 \\
                 Why This Book? / 1 \\
                 Use, not Feature / 2 \\
                 Lots of Examples / 2 \\
                 Multiple Systems / 2 \\
                 Legacy / 3 \\
                 Tuning / 3 \\
                 Who This Book Is For / 4 \\
                 Contents / 4 \\
                 Chapters / 4 \\
                 Appendices / 6 \\
                 Speaking Multiple SQLs / 6 \\
                 SQL Engines / 7 \\
                 SQL Dialects / 8 \\
                 Following Conventions / 8 \\
                 Text / 8 \\
                 Code / 9 \\
                 Understanding the msdpn Database / 11 \\
                 Table Details / 13 \\
                 Using the Examples / 17 \\
                 Summary / 17 \\
                 2: Handling Dirty Data / 19 \\
                 Case / 20 \\
                 Sort Order / 20 \\
                 UPPER and LOWER in Searches / 23 \\
                 UPPER and LOWER in UPDATE / 25 \\
                 UPPER and LOWER with Dates / 26 \\
                 INITCAP / 27 \\
                 Space / 28 \\
                 Removing Spaces / 31 \\
                 Additional Features / 32 \\
                 Size / 34 \\
                 Actual Size / 34 \\
                 Defined Size / 36 \\
                 Matching Patterns / 37 \\
                 Quoting Wildcards with ESCAPE / 38 \\
                 LIKE Variants / 38 \\
                 Datatypes and LIKE / 40 \\
                 Locating Patterns / 41 \\
                 How LOCATE Works / 42 \\
                 Using LOCATE Functions / 43 \\
                 Sounds Like / 46 \\
                 BETWEEN / 49 \\
                 Dealing with Dates / 50 \\
                 Converting Dates (and Other Datatypes) / 50 \\
                 Doing Math on Dates / 51 \\
                 Finding Dates / 54 \\
                 3: Translating Values / 63 \\
                 Why Translate? / 63 \\
                 Case/Decode / 64 \\
                 Case/Decode Variations / 69 \\
                 Handling NULL / 71 \\
                 Coalesce/Isnull/Nvl / 71 \\
                 Finding the First Non-NULL: COALESCE / 73 \\
                 Nullif / 74 \\
                 Point Functions / 77 \\
                 Getting CASE Effects from Functions and Column Values /
                 77 \\
                 Getting CASE Effects from Multiple Functions / 78 \\
                 Union / 84 \\
                 How UNION Works / 84 \\
                 UNION and NULL / 86 \\
                 UNION Problems? / 87 \\
                 Joins and Outer Joins / 88 \\
                 Joins and NULL Values / 90 \\
                 Outer Joins / 91 \\
                 Subqueries / 96 \\
                 Subqueries and Displays / 96 \\
                 Embedded Correlated Subqueries / 96 \\
                 Correlated and Noncorrelated Subqueries / 98 \\
                 TRANSLATE: Another Conditional Expression / 99 \\
                 4: Managing Multiples / 105 \\
                 What's the Issue with Multiples? / 105 \\
                 Capturing Duplicates / 106 \\
                 Duplicates and a Holding Table / 106 \\
                 Using ROWID to Remove Duplicates / 112 \\
                 Finding Near-Duplicates / 114 \\
                 Self-Join / 115 \\
                 Unequal Joins / 117 \\
                 Similar / 124 \\
                 Locating Disconnected Rows / 125 \\
                 Using Outer Joins / 126 \\
                 Using NOT IN Subqueries / 132 \\
                 Using MINUS / 134 \\
                 Counting Items Based on Characteristics / 137 \\
                 Grouping By a Subset / 137 \\
                 Locating the Critical Element / 140 \\
                 Groups and Outer Joins / 145 \\
                 Figuring Distribution / 146 \\
                 Checking Detail Against Master / 146 \\
                 Two Products Together? / 150 \\
                 Restore ordermaster / 152 \\
                 Having / 153 \\
                 5: Navigating Numbers / 157 \\
                 What's in a Number? / 157 \\
                 Comparing Autonumbering Systems / 158 \\
                 ASA: Default / 158 \\
                 Transact-SQL: Column Property / 159 \\
                 Oracle: CREATE SEQUENCE / 161 \\
                 Informix: SERIAL Datatype / 162 \\
                 Associated Issues / 162 \\
                 Locating the High Value / 163 \\
                 Group by, Count, Having Max(Count) / 163 \\
                 FROM Subquery / 165 \\
                 Row Counts of Various Sorts / 167 \\
                 Creating Row Numbers / 169 \\
                 System Numbers / 169 \\
                 Your Numbers / 174 \\
                 Finding the Top N: Six Approaches / 178 \\
                 Row Limits and ORDER BY / 179 \\
                 Row Numbers and HAVING / 179 \\
                 Subquery / 183 \\
                 Nested Subqueries / 184 \\
                 Aggregates and Many Copies / 186 \\
                 Cursors / 187 \\
                 Picking Every Nth / 189 \\
                 What Modulo Is / 190 \\
                 Modulo in WHERE and HAVING / 192 \\
                 Back to Nth Row / 194 \\
                 Correlated Subquery / 195 \\
                 Generating a Running Total / 196 \\
                 6: Tuning Queries / 203 \\
                 Understanding the Optimizer and Associated Tools / 206
                 \\
                 Getting Information on Indexes / 206 \\
                 Checking the Optimizer / 210 \\
                 SQL Conventions / 213 \\
                 Managing the WHERE Clause / 214 \\
                 Why a Table Scan? / 214 \\
                 Data Distribution Statistics / 214 \\
                 Disabling an Index with a Bad Where / 215 \\
                 Comparing Columns in the Same Table / 215 \\
                 Using Nonselective Indexes / 216 \\
                 Doing Math on a Column / 217 \\
                 Using Functions / 218 \\
                 Finding Ranges with BETWEEN / 219 \\
                 Matching with LIKE / 220 \\
                 Comparing to NULL / 221 \\
                 Negating with NOT / 222 \\
                 Converting Values / 223 \\
                 Using OR / 223 \\
                 Finding Sets of Values with IN / 224 \\
                 Using Multicolumn Indexes / 225 \\
                 Creating Covering Indexes / 225 \\
                 Joining Columns / 228 \\
                 Sorting with DISTINCT and UNION / 230 \\
                 Distinct / 230 \\
                 Union / 231 \\
                 Where / 233 \\
                 Choosing Between HAVING and WHERE / 234 \\
                 Looking at7 Views / 235 \\
                 Forcing Indexes / 238 \\
                 Asking Performance Questions / 239 \\
                 7: Using SQL to Write SQL / 241 \\
                 Systematically Speaking / 241 \\
                 Getting Meta-Data from System Catalogs / 242 \\
                 Listing System Catalogs / 242 \\
                 Writing Queries Using System Catalogs / 250 \\
                 Using System Functions / 251 \\
                 Getting Administrative Information / 252 \\
                 Finding Today's Date / 255 \\
                 Inserting Today's Date / 257 \\
                 Writing SQL with SQL / 259 \\
                 GRANTing Permissions / 259 \\
                 Removing Junk Objects / 261 \\
                 Creating Test Data with SQL / 263 \\
                 Appendix A: Understanding the Sample DB: msdpn / 267
                 \\
                 MegaSysDataProNet Co / 267 \\
                 Collecting the CREATE Scripts / 268 \\
                 Adaptive Server Anywhere / 269 \\
                 Sybase Adaptive Server Enterprise / 272 \\
                 Microsoft SQL Server / 274 \\
                 Oracle / 274 \\
                 Informix / 276 \\
                 Explaining the INSERT Scripts / 278 \\
                 INSERT INTO customer / 278 \\
                 INSERT INTO supplier / 280 \\
                 INSERT INTO product / 281 \\
                 INSERT INTO employee / 284 \\
                 INSERT INTO ordermaster / 284 \\
                 INSERT INTO orderdetail / 286 \\
                 Experimenting and Transaction Management / 288 \\
                 Removing Data and Objects: DROP and DELETE Commands /
                 292 \\
                 Remove Database / 292 \\
                 DROP Commands / 292 \\
                 DELETE FROM Command / 293 \\
                 Appendix B: Comparing Datatypes and Functions / 295 \\
                 Comparatively Speaking / 295 \\
                 Datatype Comparison / 295 \\
                 Function Comparison / 297 \\
                 Character (String) Functions / 297 \\
                 Number Functions / 299 \\
                 Date Functions / 300 \\
                 Conditional Functions / 301 \\
                 Sequential Number Methods / 302 \\
                 Row Number and Row ID Methods / 302 \\
                 Tuning Functions / 302 \\
                 System Functions / 303 \\
                 Join Syntax Comparison / 304 \\
                 Notes on Environment and Display / 305 \\
                 Setting Number Formats / 305 \\
                 Defining Display Precision / 309 \\
                 Defining Default Date Format / 310 \\
                 General / 313 \\
                 Informix / 314 \\
                 Microsoft SQL Server / 314 \\
                 mSQL/MySQL / 314 \\
                 Oracle / 314 \\
                 Sybase / 315 \\
                 Transact-SQL / 315 \\
                 Other Offerings / 316 \\
                 Newsgroups / 316 \\
                 Index / 317",
}

@Book{Box:2003:ENC,
  author =       "Don Box and Chris Sells",
  title =        "Essential {.NET}: Volume 1: {The Common Language
                 Runtime}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xxiii + 405",
  year =         "2003",
  ISBN =         "0-201-73411-7 (paperback)",
  ISBN-13 =      "978-0-201-73411-9 (paperback)",
  LCCN =         "QA76.76.M52 B69 2003",
  bibdate =      "Wed Mar 15 08:57:34 MST 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  note =         "Foreword by James S. Miller",
  series =       "Microsoft .NET development series",
  abstract =     "Book Review: {Essential .NET} will enable developers
                 to take advantage of the full power available to them
                 in Microsoft .NET. This book explains the ``why''
                 behind C\#, .NET, and the CLR. As with all of Don's
                 books, it is packed with practical detail and expert
                 advice.",
  acknowledgement = ack-nhfb,
  subject =      "Microsoft .NET; Component software; Programming
                 languages (Electronic computers)",
  tableofcontents = "1: The CLR as a Better COM \\
                 2: Components \\
                 3: Type Basics \\
                 4: Programming with Type \\
                 5: Instances \\
                 6: Methods \\
                 7: Advanced Methods \\
                 8: Domains \\
                 9: Security \\
                 10: CLR Externals",
}

@Book{Boyce:1996:IW,
  author =       "Jim Boyce and Paul J. Sanna and Rob Tidrow and William
                 Steen and Jonathan J. Chau and Scott Fuller and Kevin
                 Pagan and Russell Jacobs and R. James Ruehlin",
  title =        "Inside Windows 95: Deluxe Edition",
  publisher =    pub-NRP,
  address =      pub-NRP:adr,
  pages =        "xxx + 1228",
  year =         "1996",
  ISBN =         "1-56205-695-6",
  ISBN-13 =      "978-1-56205-695-7",
  LCCN =         "QA76.76.O63 B685 1996",
  bibdate =      "Fri Aug 21 12:58:39 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Includes CD-ROM.",
  price =        "US\$59.99, CAN\$84.95",
  acknowledgement = ack-nhfb,
}

@Article{Boyer:string-search,
  author =       "R. S. Boyer and J. S. Moore",
  title =        "A fast string searching algorithm",
  journal =      j-CACM,
  volume =       "20",
  number =       "10",
  pages =        "762--772",
  month =        oct,
  year =         "1977",
  bibdate =      "Sun May 2 07:45:54 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See also
                 \cite{Knuth:string-search,Sunday:string-search,Baeza-Yates:j-CACM-35-10-74}.",
  acknowledgement = ack-nhfb,
}

@Book{Boyles:2016:EEE,
  author =       "Denis Boyles",
  title =        "Everything Explained that is Explainable: On the
                 Creation of the {{\booktitle{Encyclop{\ae}dia
                 Britannica}}}'s Celebrated Eleventh Edition,
                 1910--1911",
  publisher =    pub-KNOPF,
  address =      pub-KNOPF:adr,
  pages =        "xviii + 442",
  year =         "2016",
  ISBN =         "0-307-26917-5 (hardcover), 0-307-38978-2 (paperback),
                 1-101-94777-2 (e-book)",
  ISBN-13 =      "978-0-307-26917-1 (hardcover), 978-0-307-38978-7
                 (trade paperback), 978-1-101-94777-7 (e-book)",
  LCCN =         "AE5.E3633 B69 2016",
  bibdate =      "Tue May 12 08:40:06 MDT 2020",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "The audacious, improbable tale of 20th century
                 American hucksterism, outlandish daring, and vision
                 that resurrected a dying Encyclopedia Britannica in
                 collaboration with a floundering London Times, its
                 astonishing success that changed publishing and that
                 produced the Britannica's eleventh edition (published
                 between 1910 and 1911), the most revered edition of
                 English-language encyclopedias (all 44 million words),
                 considered by many to be ``the last great work of the
                 age of reason'' (Hans Koening, the New Yorker).",
  acknowledgement = ack-nhfb,
  subject =      "Encyclopaedia Britannica; History; Encyclopedias and
                 dictionaries; History and criticism; World; Reference;
                 Encyclopedias; Study and Teaching",
  tableofcontents = "Plymouth 1896 \\
                 The adman \\
                 Printing house square \\
                 The Cairo correspondent \\
                 The assistant manager \\
                 The American scheme \\
                 Ten \\
                 A dinner for Mr. Chisholm \\
                 The supplemental volumes \\
                 Half a million goats \\
                 Anglosphere \\
                 Plan B: a book war \\
                 Chaos \\
                 High Holborn \\
                 The single organism \\
                 War and peace \\
                 The dreadnaught launch \\
                 Offenses \\
                 Postscript",
}

@Book{Bradley:1984:ALP,
  author =       "David J. Bradley",
  title =        "Assembly Language Programming for the {IBM} Personal
                 Computer",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xii + 340",
  year =         "1984",
  ISBN =         "0-13-049189-6",
  ISBN-13 =      "978-0-13-049189-3",
  LCCN =         "QA76.8.I2594 B7 1984",
  bibdate =      "Sun May 02 07:46:15 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "The author is one of the designers of the IBM PC. The
                 book covers the 8088 and 8087 instruction sets, DOS and
                 MASM, the IBM PC hardware, and the ROM BIOS. Somewhat
                 more technical than \cite{Lafore:1984:ALP}. See also
                 \cite{Scanlon:1984:ALP}.",
  acknowledgement = ack-nhfb,
}

@Book{Brainerd:1990:PGF,
  author =       "Walter S. Brainerd and Charles H. Goldberg and Jeanne
                 C. Adams",
  title =        "Programmer's Guide to {Fortran 90}",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "vii + 410",
  year =         "1990",
  ISBN =         "0-07-000248-7",
  ISBN-13 =      "978-0-07-000248-7",
  LCCN =         "QA76.73.F25 B735 1990",
  bibdate =      "Sun May 02 07:46:24 1999",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
                 https://www.math.utah.edu/pub/tex/bib/fortran3.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See \cite{ANSI:ftn92}.",
  price =        "US\$37.95",
  acknowledgement = ack-nhfb,
  keywords =     "Fortran 90 (computer program language); Programming
                 languages; {Fortran 90} (Computer program language)",
  libnote =      "Not yet in my library.",
}

@Book{Brand:1960:MSP,
  author =       "J. C. D. (John Charles Drury) Brand and J. C. (James
                 Clare) Speakman",
  title =        "Molecular Structure: The Physical Approach",
  publisher =    "Edward Arnold (Publishers) Ltd.",
  address =      "London, England",
  pages =        "viii + 312",
  year =         "1960",
  LCCN =         "QD501.B786 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",
}

@Book{Braswell:1989:IP,
  author =       "Frank Merritt Braswell",
  title =        "Inside {PostScript}",
  publisher =    pub-PEACHPIT,
  address =      pub-PEACHPIT:adr,
  year =         "1989",
  ISBN =         "0-938151-10-X",
  ISBN-13 =      "978-0-938151-10-4",
  LCCN =         "QA76.73.P67 B73 1989",
  bibdate =      "Sat Aug 27 10:56:22 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$37.50",
  acknowledgement = ack-nhfb,
}

@Book{Brent:2011:MCA,
  author =       "Richard P. Brent and Paul Zimmermann",
  title =        "Modern Computer Arithmetic",
  volume =       "18",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xvi + 221",
  year =         "2011",
  DOI =          "https://doi.org/10.1017/CBO9780511921698",
  ISBN =         "0-521-19469-5 (hardcover)",
  ISBN-13 =      "978-0-521-19469-3 (hardcover)",
  LCCN =         "QA76.9.C62 BRE 2011",
  bibdate =      "Sat Jan 15 12:25:22 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 library.ox.ac.uk:210/ADVANCE",
  series =       "Cambridge monographs on applied and computational
                 mathematics",
  URL =          "http://www.loria.fr/~zimmerma/mca/pub226.html",
  acknowledgement = ack-nhfb,
  subject =      "Computer arithmetic",
  tableofcontents = "Preface / ix \\
                 Acknowledgements / xi \\
                 Notation / xiii \\
                 Integer arithmetic / 1 \\
                 1.1 Representation and notations / 1 \\
                 1.2 Addition and subtraction / 2 \\
                 1.3 Multiplication / J \\
                 i.3.1 Naive multiplication / 4 \\
                 1.3.2 Karatsuba's algorithm / 5 \\
                 1.3.3 Toom--Cook multiplication / 6 \\
                 1.3.4 Use of the fast Fourier transform (FFT) / 8 \\
                 1.3.5 Unbalanced multiplication / 8 \\
                 1.3.6 Squaring / 11 \\
                 1.3.7 Multiplication by a constant / 13 \\
                 1.4 Division / 14 \\
                 1.4.1 Naive division / 14 \\
                 1.4.2 Divisor preconditioning / 16 \\
                 1.4.3 Divide and conquer division / 18 \\
                 1.4.4 Newton's method / 21 \\
                 1.4.5 Exact division / 21 \\
                 1.4.6 Only quotient or remainder wanted / 22 \\
                 1.4.7 Division by a single word / 23 \\
                 1.4.8 Hensel's division / 24 \\
                 1.5 Roots / 25 \\
                 1.5.1 Square root / 25 \\
                 1.5.2 $k$th root / 27 \\
                 1.5.3 Exact root / 28 \\
                 1.6 Greatest common divisor / 29 \\
                 1.6.1 Naive GCD / 29 \\
                 1.6.2 Extended GCD / 32 \\
                 1.6.3 Half binary GCD, divide and conquer GCD / 33 \\
                 1.7 Base conversion / 37 \\
                 1.7.1 Quadratic algorithms / 37 \\
                 1.7.2 Subquadratic algorithms / 38 \\
                 1.8 Exercises / 39 \\
                 1.9 Notes and references / 44 \\
                 Modular arithmetic and the FFT / 47 \\
                 2.1 Representation / 47 \\
                 2.1.1 Classical representation / 47 \\
                 2.1.2 Montgomery's form / 48 \\
                 2.1.3 Residue number systems / 48 \\
                 2.1.4 MSB vs LSB algorithms / 49 \\
                 2.1.5 Link with Polynomials / 49 \\
                 2.2 Modular addition and subtraction / 50 \\
                 2.3 The Fourier transform / 50 \\
                 2.3.1 Theoretical setting / 50 \\
                 2.3.2 The fast Fourier transform / 51 \\
                 2.3.3 The Sch{\"o}nhage--Strassen algorithm / 55 \\
                 2.4 Modular multiplication / 58 \\
                 2.4.1 Barrett's algorithm / 58 \\
                 2.4.2 Montgomery's multiplication / 60 \\
                 2.4.3 McLaughlin's algorithm / 63 \\
                 2.4.4 Special moduli / 65 \\
                 2.5 Modular division and inversion / 65 \\
                 2.5.1 Several inversions at once / 61 \\
                 2.6 Modular exponentiation / 68 \\
                 2.6.1 Binary exponentiation / 70 \\
                 2.6.2 Exponentiation with a larger base / 70 \\
                 2.6.3 Sliding window and redundant representation / 72
                 \\
                 2.7 Chinese remainder theorem / 75 \\
                 2.8 Exercises / 75 \\
                 2.9 Notes and references / 77 \\
                 Floating-point arithmetic / 79 \\
                 3.1 Representation / 79 \\
                 3.1.1 Radix choice / 80 \\
                 3.1.2 Exponent range / 81 \\
                 3.1.3 Special values / 82 \\
                 3.1.4 Subnormal numbers / 82 \\
                 3.1.5 Encoding / 83 \\
                 3.1.6 Precision: local, global, operation, operand / 84
                 \\
                 3.1.7 Link to integers / 86 \\
                 3.1.8 Ziv's algorithm and error analysis / 86 \\
                 3.1.9 Rounding / 87 \\
                 3.1.10 Strategies / 90 \\
                 3.2 Addition, subtraction, comparison / 91 \\
                 3.2.1 Floating-point addition / 92 \\
                 3.2.2 Floating-point subtraction / 93 \\
                 3.3 Multiplication / 95 \\
                 3.3.1 Integer multiplication via complex FFT / 98 \\
                 3.3.2 The middle product / 99 \\
                 3.4 Reciprocal and division / 101 \\
                 3.4.1 Reciprocal / 102 \\
                 3.4.2 Division / 106 \\
                 3.5 Square root / 111 \\
                 3.5.1 Reciprocal square root / 112 \\
                 3.6 Conversion / 114 \\
                 3.6.1 Floating-point output / 115 \\
                 3.6.2 Floating-point input / 117 \\
                 3.7 Exercises / 118 \\
                 3.8 Notes and references / 120 \\
                 Elementary and special function evaluation / 125 \\
                 4.1 Introduction / 125 \\
                 4.2 Newton's method / 126 \\
                 4.2.1 Newton's method for inverse roots / 127 \\
                 4.2.2 Newton's method for reciprocals / 128 \\
                 4.2.3 Newton's method for (reciprocal) square roots /
                 129 \\
                 4.2.4 Newton's method for formal power series / 129 \\
                 4.2.5 Newton's method for functional inverses / 130 \\
                 4.2.6 Higher-order Newton-like methods / 131 \\
                 4.3 Argument reduction / 132 \\
                 4.3.1 Repeated use of a doubling formula / 134 \\
                 4.3.2 Loss of precision / 134 \\
                 4.3.3 Guard digits / 135 \\
                 4.3.4 Doubling versus tripling / 136 \\
                 4.4 Power series / 136 \\
                 4.4.1 Direct power series evaluation / 140 \\
                 4.4.2 Power series with argument reduction / 140 \\
                 4.4.3 Rectangular series splitting / 141 \\
                 4.5 Asymptotic expansions / 144 \\
                 4.6 Continued fractions / 150 \\
                 4.7 Recurrence relations / 152 \\
                 4.7.1 Evaluation of Bessel functions / 153 \\
                 4.7.2 Evaluation of Bernoulli and tangent numbers / 154
                 \\
                 4.8 Arithmetic--geometric mean / 158 \\
                 4.8.1 Elliptic integrals / 158 \\
                 4.8.2 First AGM algorithm for the logarithm / 159 \\
                 4.8.3 Theta functions / 160 \\
                 4.8.4 Second AGM algorithm for the logarithm / 162 \\
                 4.8.5 The complex AGM / 163 \\
                 4.9 Binary splitting / 163 \\
                 4.9.1 A binary splitting algorithm for sin, cos / 166
                 \\
                 4.9.2 The bit-burst algorithm / 161 \\
                 4.10 Contour integration / 169 \\
                 4.11 Exercises / 171 \\
                 4.12 Notes and references / 179 \\
                 Implementations and pointers / 185 \\
                 5.1 Software tools / 185 \\
                 5.1.1 CLN / 185 \\
                 5.1.2 GNUMP (GMP) / 185 \\
                 5.1.3 MPFQ / 186 \\
                 5.1.4 GNU MPFR / 187 \\
                 5.1.5 Other multiple-precision packages / 187 \\
                 5.1.6 Computational algebra packages / 188 \\
                 5.2 Mailing lists / 189 \\
                 5.2.1 The GMP lists / 189 \\
                 5.2.2 The MPFR list / 190 \\
                 5.3 Online documents / 190 \\
                 References / 191 \\
                 Index / 207",
}

@Book{Breshears:2009:AC,
  author =       "Clay Breshears",
  title =        "The Art of Concurrency",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xiii + 285",
  year =         "2009",
  ISBN =         "0-596-80242-0",
  ISBN-13 =      "978-0-596-80242-4",
  LCCN =         "QA76.642 .B74 2009; Internet",
  bibdate =      "Mon Apr 5 18:12:38 MDT 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 melvyl.cdlib.org:210/CDL90",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "parallel programming (computer science); computer
                 programming",
}

@Book{Brewster:2010:MLW,
  author =       "David Brewster",
  title =        "Memoirs of the life, writings, and discoveries of {Sir
                 Isaac Newton}",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xxi + 430 (vol. 1), xi + 434 (vol. 2)",
  year =         "2010",
  DOI =          "https://doi.org/10.1017/CBO9780511792670",
  ISBN =         "1-108-02556-0 (vol. 1), 1-108-02557-9 (vol. 2),
                 1-108-02558-7 (set)",
  ISBN-13 =      "978-1-108-02556-0 (vol. 1), 978-1-108-02557-7 (vol.
                 2), 978-1-108-02558-4 (set)",
  LCCN =         "QC16.N7 B8 1855",
  bibdate =      "Wed Sep 2 08:25:26 MDT 2015",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Cambridge library collection",
  acknowledgement = ack-nhfb,
  author-dates = "1781--1868",
  libnote =      "Not in my library.",
  remark =       "This edition first published 1855. This digitally
                 printed version 2010.",
  subject =      "Newton, Isaac; Newton, Isaac",
  subject-dates = "1642--1727",
}

@Book{BrinchHansen:1985:BHP,
  author =       "Per {Brinch Hansen}",
  title =        "Brinch Hansen on Pascal Compilers",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "x + 310",
  year =         "1985",
  ISBN =         "0-13-083098-4",
  ISBN-13 =      "978-0-13-083098-2",
  LCCN =         "QA76.73.P2 B75 1985",
  bibdate =      "Tue Dec 14 22:42:51 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$25.00",
  acknowledgement = ack-nhfb,
}

@Book{Brockman:2006:MEE,
  editor =       "John Brockman",
  title =        "My {Einstein}: essays by twenty-four of the world's
                 leading thinkers on the man, his work, and his legacy",
  publisher =    pub-PANTHEON,
  address =      pub-PANTHEON:adr,
  pages =        "xvi + 261",
  year =         "2006",
  ISBN =         "0-375-42345-1",
  ISBN-13 =      "978-0-375-42345-1",
  LCCN =         "QC16.E5 M9 2006",
  bibdate =      "Thu Jan 25 18:34:18 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0643/2005048286-b.html;
                 http://www.loc.gov/catdir/enhancements/fy0643/2005048286-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0643/2005048286-s.html;
                 http://www.loc.gov/catdir/enhancements/fy0661/2005048286-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Einstein, Albert; Anniversaries, etc; Physicists;
                 Germany; Biography; United States; Jewish scientists",
  subject-dates = "1879--1955",
  tableofcontents = "Einstein when he's at home / Roger Highfield \\
                 The freest man / Gino C. Segr{\`e} \\
                 Mentor and sounding board / John Archibald Wheeler \\
                 My Einstein suspenders / George F. Smoot \\
                 Einstein, Moe, and Joe / Leon M. Lederman \\
                 The true and the absurd / Charles Seife \\
                 Albert Einstein: a scientific reactionary / Frank J.
                 Tipler \\
                 Helen Dukas: Einstein's compass / George Dyson \\
                 My three Einsteins / Corey S. Powell \\
                 In search of Einstein / Lee Smolin \\
                 Einstein and absolute reality / Anton Zeilinger \\
                 A walk down Mercer Street / Steven Strogatz \\
                 Things and thoughts / Peter Galison \\
                 Childe Bernstein to relativity came / Jeremy Bernstein
                 \\
                 The books in the basement / George Johnson \\
                 How he thought / Leonard Suskind \\
                 Toward a moving train / Janna Levin \\
                 Einstein's tie / Marcelo Gleiser \\
                 The greatest discovery Einstein didn't make / Rocky
                 Kolb \\
                 The gift of time / Richard A. Muller \\
                 Flying apart / Paul C. W. Davies \\
                 Einstein in the Twilight Zone / Lawrence M. Krauss \\
                 No beginning and no end / Paul J. Steinhardt \\
                 Where is Einstein? / Maria Spiropulu",
}

@Book{Bronshtein:2007:HM,
  editor =       "I. N. (Il{\i}a Nikolaevich) Bronshte{\u\i}n and A.
                 Semendyayev and Gerhard Musiol and Heiner M{\"u}hlig",
  title =        "Handbook of mathematics",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Fifth",
  pages =        "xliii + 1159",
  year =         "2007",
  ISBN =         "3-540-72121-5",
  ISBN-13 =      "978-3-540-72121-5",
  LCCN =         "QA40 HAN 2007; QA40 .S6813 2007",
  bibdate =      "Sat May 15 09:30:45 MDT 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 library.ox.ac.uk:210/ADVANCE",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  remark =       "Original Russian title: Spravochnik po matematike.
                 Based on the 6th German edition published by
                 Wissenschaftlicher Verlag Harri Deutsche GmbH,
                 Frankfurt am Main under title: Taschenbuch der
                 Mathematik.",
  subject =      "mathematics; handbooks, manuals, etc",
  tableofcontents = "1. Arithmetic \\
                 2. Functions \\
                 3. Geometry \\
                 4. Linear Algebra \\
                 5. Algebra and Discrete Mathematics \\
                 6. Differentiation \\
                 7. Infinite Series \\
                 8. Integral Calculus \\
                 9. Differential Equations \\
                 10. Calculus of Variations \\
                 11. Linear Integral Equations \\
                 12. Functional Analysis \\
                 13. Vector Analysis and Vector Fields \\
                 14. Function Theory \\
                 15. Integral Transformations \\
                 16. Probability Theory and Mathematical Statistics \\
                 17. Dynamical Systems and Chaos \\
                 18. Optimization \\
                 19. Numerical Analysis \\
                 20. Computer Algebra Systems \\
                 21. Tables",
}

@Book{Brooks:1982:MMM,
  author =       "Frederick P. {Brooks, Jr.}",
  title =        "The Mythical Man-Month: Essays on Software
                 Engineering",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xi + 195",
  year =         "1982",
  ISBN =         "0-201-00650-2",
  ISBN-13 =      "978-0-201-00650-6",
  LCCN =         "QA 76.6 B75 1982",
  bibdate =      "Wed Jan 12 14:30:25 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "In the essays, the author blends on software
                 engineering with his own personal opinions and the
                 opinions of others involved in building complex
                 computer systems. He not only gives the reader the
                 benefit of the lessons he has learned from the OS. 360
                 experience, but he writes about them in an extremely
                 readable and entertaining way.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: The Tar Pit \\
                 2: The Mythical Man-Month \\
                 3: The Surgical Team \\
                 4: Aristocracy, Democracy, and System Design \\
                 5: The Second-System Effect \\
                 6: Passing the Word \\
                 7: Why Did the Tower of Babel Fail? \\
                 8: Calling the Shot \\
                 9: Ten Pounds in a Five-Pound Sack \\
                 10: The Documentary Hypothesis \\
                 11: Plan to Throw One Away \\
                 12: Sharp Tools \\
                 13: The Whole and the Parts \\
                 14: Hatching a Catastrophe \\
                 15: The Other Face \\
                 16: No Silver Bullet: Essence and Accident \\
                 17: ``No Silver Bullet'' ReFired \\
                 18: Propositions of The Mythical Man-Month: True or
                 False? \\
                 19: The Mythical Man-Month After 20 Years \\
                 Epilogue",
}

@Book{Brooks:1985:PCL,
  author =       "Rodney A. Brooks",
  title =        "Programming in {Common Lisp}",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xv + 303",
  year =         "1985",
  ISBN =         "0-471-81888-7",
  ISBN-13 =      "978-0-471-81888-5",
  LCCN =         "QA76.73.L23 B76 1985",
  bibdate =      "Tue Dec 14 22:43:03 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$18.95",
  acknowledgement = ack-nhfb,
}

@Book{Brooks:1995:MMM,
  author =       "Frederick P. {Brooks, Jr.}",
  title =        "The Mythical Man-Month --- Essays on Software
                 Engineering",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Anniversary",
  pages =        "xiii + 322",
  year =         "1995",
  ISBN =         "0-201-83595-9",
  ISBN-13 =      "978-0-201-83595-3",
  LCCN =         "QA76.758 .B75 1995",
  bibdate =      "Tue Mar 04 11:46:00 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$26.76",
  abstract =     "Few book on software project management have bees as
                 influential and timeless as this. With a blend of
                 software engineering facts and thought-provoking
                 opinions, Fred Brooks offers insight for anyone
                 managing complex projects. These essays draw from his
                 experience as project manager for the IBM system/360
                 computer family and then for OS/360, its massive
                 software system. now, 20 years after the initial
                 publication of his book, Brooks has revisited his
                 original ideas and added new thoughts and advice, both
                 for readers already familiar with his work and for
                 readers discovering it for the first time.",
  acknowledgement = ack-nhfb,
  tableofcontents = "The tar pit \\
                 The mythical man-month \\
                 The surgical team \\
                 Aristocracy, democracy, and system design \\
                 The second-system effect \\
                 Passing the word \\
                 Why did the Tower of Babel fail? \\
                 Calling the shot \\
                 Ten pounds in a five-pound sack \\
                 The documentary hypothesis \\
                 Plan to throw one away \\
                 Sharp tools \\
                 The whole and the parts \\
                 Hatching a catastrophe \\
                 The other face \\
                 No silver bulled--essence and accident \\
                 ``No silver bullet'' refired \\
                 Propositions of The Mythical Man-Month: true or false?
                 \\
                 The Mythical Man-Month after 20 years",
}

@Book{Brown:1977:SPA,
  editor =       "P. J. Brown",
  title =        "Software Portability: An Advanced Course",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xiv + 328",
  year =         "1977",
  ISBN =         "0-521-21485-8",
  ISBN-13 =      "978-0-521-21485-8",
  LCCN =         "QA76.6 .S6351",
  bibdate =      "Tue Dec 14 22:43:05 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$14.00",
  acknowledgement = ack-nhfb,
}

@Book{Brown:1985:UP,
  author =       "Maxine Brown",
  title =        "Understanding {PHIGS}",
  publisher =    pub-MEGATEK,
  address =      pub-MEGATEK:adr,
  year =         "1985",
  LCCN =         "T385 .B761 1985",
  bibdate =      "Wed Dec 15 15:35:57 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Brown:1994:PTT,
  editor =       "Vicki Brown",
  title =        "Prime Time {\TeX}cetera",
  publisher =    pub-PRIME-TIME-FREEWARE,
  address =      pub-PRIME-TIME-FREEWARE:adr,
  pages =        "96",
  year =         "1994",
  ISBN =         "1-881957-10-1",
  ISBN-13 =      "978-1-881957-10-2",
  bibdate =      "Wed Aug 10 10:52:33 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Includes CD-ROM.",
  price =        "US\$60.00",
  acknowledgement = ack-nhfb,
}

@Book{Brown:2010:HKP,
  author =       "Mike Brown",
  title =        "How {I} killed {Pluto} and why it had it coming",
  publisher =    "Spiegel and Grau",
  address =      "New York, NY, USA",
  pages =        "xiii + 267",
  year =         "2010",
  ISBN =         "0-385-53108-7",
  ISBN-13 =      "978-0-385-53108-5",
  LCCN =         "QB701 .B77 2010",
  bibdate =      "Mon Jun 13 16:37:11 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "The astronomer who inadvertently triggered the
                 ``demotion'' of Pluto in his effort to officially
                 recognize the solar system's tenth planet describes the
                 ensuing debates and public outcry while revealing the
                 behind-the-scenes story of his discovery.",
  acknowledgement = ack-nhfb,
  subject =      "Pluto (Dwarf planet); Planets; Solar system;
                 Discoveries in science; Anecdotes; Eris (Dwarf
                 planet)",
  tableofcontents = "Prologue: Pluto dies \\
                 What is a planet? \\
                 A millennium of planets \\
                 The moon is my nemesis \\
                 The second-best thing \\
                 An icy nail \\
                 The end of the solar system \\
                 Raining = pouring \\
                 Lilah, an intermission \\
                 The tenth planet \\
                 Stealing the show \\
                 Planet or not \\
                 Mean very evil men \\
                 Discord and strife",
}

@Book{Brown:2019:SUS,
  author =       "J. Patrick Brown and Beryl Lipton and Michael Morisy",
  title =        "Scientists under Surveillance: the {FBI} Files",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "xviii + 413",
  year =         "2019",
  ISBN =         "0-262-53688-9 (paperback), 0-262-35302-4 (e-book)",
  ISBN-13 =      "978-0-262-53688-2 (paperback), 978-0-262-35302-1
                 (e-book)",
  LCCN =         "Q125 .S4366 2019",
  bibdate =      "Thu May 23 10:28:44 MDT 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/b/bethe-hans.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/f/feynman-richard-p.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Foreword by Steven Aftergood and introduction by
                 Walter V. Robinson.",
  URL =          "http://mitpress.mit.edu/9780262536882",
  abstract =     "Cold War-era FBI files on famous scientists, including
                 Neil Armstrong, Isaac Asimov, Albert Einstein, Richard
                 Feynman, Alfred Kinsey, and Timothy Leary. Armed with
                 ignorance, misinformation, and unfounded suspicions,
                 the FBI under J. Edgar Hoover cast a suspicious eye on
                 scientists in disciplines ranging from physics to sex
                 research. If the Bureau surveilled writers because of
                 what they believed (as documented in \booktitle{Writers
                 Under Surveillance}), it surveilled scientists because
                 of what they knew. Such scientific ideals as the free
                 exchange of information seemed dangerous when the
                 Soviet Union and the United States regarded each other
                 with mutual suspicion that seemed likely to lead to
                 mutual destruction. \booktitle{Scientists Under
                 Surveillance} gathers FBI files on some of the most
                 famous scientists in America, reproducing them in their
                 original typewritten, teletyped, hand-annotated form.
                 Readers learn that Isaac Asimov, at the time a
                 professor at Boston University's School of Medicine,
                 was a prime suspect in the hunt for a Soviet informant
                 codenamed ROBPROF (the rationale perhaps being that he
                 wrote about robots and was a professor). Richard
                 Feynman had a ``hefty'' FBI file, some of which was
                 based on documents agents found when going through the
                 Soviet ambassador's trash (an invitation to a physics
                 conference in Moscow); other documents in Feynman's
                 file cite an informant who called him a ``master of
                 deception'' (the informant may have been Feynman's
                 ex-wife). And the Bureau's relationship with Alfred
                 Kinsey, the author of The Kinsey Report, was mutually
                 beneficial, with each drawing on the other's data. The
                 files collected in \booktitle{Scientists Under
                 Surveillance} were obtained through Freedom of
                 Information Act requests by MuckRock, a nonprofit
                 engaged in the ongoing project of freeing American
                 history from the locked filing cabinets of government
                 agencies.",
  abstract-2 =   "This is the second volume of FBI files produced by the
                 MuckRock team. This one is focused on scientists and
                 consists of documents from the FBI files obtained by
                 over 4,000 Freedom of Information Act Requests made by
                 the MuckRock team. Some of these documents are
                 available elsewhere (by FOIA requests made by others,
                 and are ostensibly in the public domain). But much of
                 this material has been released for the first time as a
                 result of MuckRock's FOIA requests. As with the volume
                 on Writers Morisy's team at MuckRock have done a lot of
                 work in sifting through the files, compiling and
                 curating material from almost 2 million pages of
                 released documents. As they wrote in the editor's
                 introduction: whereas the previous volume focused on
                 people targeted for what they believed, this one looks
                 at scientists who were targeted for what they know. As
                 with the writer's volume the files collected here are
                 greatly informed by the Cold War and the Bureau's war
                 on communism. The stakes here are arguably higher, with
                 a number of high profile scientists legitimately spying
                 for the Soviet Union, such as Karl Fuchs and Ted
                 Hall.",
  acknowledgement = ack-nhfb,
  subject =      "Scientists; 20th century; Governmental investigations;
                 United States; History; Governmental investigations.;
                 Scientists.",
  tableofcontents = "Foreword by Steven Aftergood / vii \\
                 Introduction by Walter V. Robinson / xi \\
                 Notes on Selections for this Collection / xiii \\
                 Introduction from MuckRock / xv \\
                 Guide to Exemptions / xvii \\
                 Glossary / xix \\
                 Neil Armstrong / 1 \\
                 Isaac Asimov / 13 \\
                 Hans Bethe / 25 \\
                 John P. Craven / 61 \\
                 Albert Einstein / 71 \\
                 Paul Erd{\H{o}}s / 117 \\
                 Richard Feynman / 173 \\
                 Mikhail Kalashnikov / 237 \\
                 Alfred Kinsey / 241 \\
                 Timothy Leary / 269 \\
                 William Masters / 301 \\
                 Arthur Rosenfeld / 307 \\
                 Vera Rubin / 335 \\
                 Carl Sagan / 361 \\
                 Nikola Tesla / 371",
}

@Book{Browne:2015:SEC,
  author =       "John Browne",
  title =        "Seven Elements That Changed the World: An Adventure of
                 Ingenuity and Discovery",
  publisher =    "Pegasus Books",
  address =      "New York, NY, USA",
  pages =        "xix + 279",
  year =         "2015",
  ISBN =         "1-60598-691-7",
  ISBN-13 =      "978-1-60598-691-3",
  LCCN =         "????",
  bibdate =      "Wed Apr 1 17:09:06 MDT 2015",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Preface / ix \\
                 The Essence of Everything / xi \\
                 Iron / 1 \\
                 Carbon / 29 \\
                 Gold / 85 \\
                 Silver / 105 \\
                 Uranium / 124 \\
                 Titanium / 149 \\
                 Silicon / 161 \\
                 Power, Progress and Destruction / 194 \\
                 Acknowledgements / 201 \\
                 List of Maps / 203 \\
                 List of Illustrations / 204 \\
                 Notes / 210 \\
                 Bibliography / 255 \\
                 Index / 267",
}

@Book{Brunt:2024:MCR,
  author =       "Douglas Brunt",
  title =        "The mysterious case of {Rudolf Diesel}: genius, power,
                 and deception on the eve of {World War I}",
  publisher =    "Atria Books",
  address =      "New York, NY, USA",
  pages =        "x + 374 + 8",
  year =         "2024",
  ISBN =         "1-982169-91-5 (paperback)",
  ISBN-13 =      "978-1-982169-91-6 (paperback)",
  LCCN =         "TJ140.D5 B78 2024",
  bibdate =      "Sat Dec 13 15:12:50 MST 2025",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "The hidden history of one of the world's greatest
                 inventors, a man who disrupted the status quo and then
                 disappeared into thin air on the eve of World War I ---
                 this book answers the hundred-year-old mystery of what
                 really became of Rudolf Diesel. September 29, 1913: the
                 steamship Dresden is halfway between Belgium and
                 England. On board is one of the most famous men in the
                 world, Rudolf Diesel, whose new internal combustion
                 engine is on the verge of revolutionizing global
                 industry forever. But Diesel never arrives at his
                 destination. He vanishes during the night and headlines
                 around the world wonder if it was an accident, suicide,
                 or murder. After rising from an impoverished European
                 childhood, Diesel had become a multi-millionaire with
                 his powerful engine that does not require expensive
                 petroleum-based fuel. In doing so, he became not only
                 an international celebrity but also the enemy of two
                 extremely powerful men: Kaiser Wilhelm II of Germany
                 and John D. Rockefeller, the founder of Standard Oil
                 and the richest man in the world. The Kaiser wanted the
                 engine to power a fleet of submarines that would
                 finally allow him to challenge Great Britain's Royal
                 Navy. But Diesel had intended for his engine to be used
                 for the betterment of mankind and kept the technology
                 out of the hands of the British or any other nation.
                 For John D. Rockefeller, the engine was nothing less
                 than an existential threat to his vast and lucrative
                 oil empire. As electric lighting began to replace
                 kerosene lamps, Rockefeller's bottom line depended on
                 the world's growing thirst for gasoline to power its
                 automobiles and industries. At the outset of this new
                 age of electricity and oil, Europe stood on the
                 precipice of war. Rudolf Diesel grew increasingly
                 concerned about Germany's rising nationalism and
                 military spending. The inventor was on his way to
                 London to establish a new company that would help
                 Britain improve its failing submarine program when he
                 disappeared. Now, New York Times bestselling author
                 Douglas Brunt reopens the case and provides an
                 astonishing new conclusion about Diesel's fate,",
  acknowledgement = ack-nhfb,
  subject =      "Diesel, Rudolf; Missing persons; Investigation; Diesel
                 motor; History; Personnes disparues; Enqu{\^e}tes;
                 Moteurs diesel; Histoire",
  subject-dates = "1858--1913",
  tableofcontents = "Part I: War and oil engines, 1858--1897 \\
                 An international identity \\
                 A brief stay in London \\
                 A new empire in Europe \\
                 Is anyone truly self-made? \\
                 Petroleum upends the game \\
                 Pursuit of the ideal \\
                 Meant for more than a salary \\
                 Wilhelm II envies a navy \\
                 The birth of diesel power \\
                 Part II: Diesel proliferation, 1897--1910 \\
                 Lord Kelvin goes first \\
                 A hiccup before the grand prize \\
                 The trappings of success \\
                 A study of the sleeping giant \\
                 ``The old house'' fights for its life \\
                 The Kaiser adopts ``risk theory'' \\
                 A place among the armaments of nations \\
                 Dawn of the new era \\
                 Part III: Masterpiece, 1910--1913 \\
                 Rudolf Diesel breaks ranks \\
                 The admiralty boards the MS Selandina \\
                 Secrets of the first Lord \\
                 The great light to the west \\
                 Rising pressure \\
                 The final months \\
                 SS Dresden: September 29, 1913 \\
                 Part IV: Vanishing act \\
                 The world reacts \\
                 The available theories \\
                 Operation Rudolf Diesel \\
                 Fingerprints \\
                 Epilogue: At last",
}

@Book{Bryan:1988:SAG,
  author =       "Martin Bryan",
  title =        "{SGML}: An Author's Guide to the {Standard Generalized
                 Markup Language}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xvii + 364",
  year =         "1988",
  ISBN =         "0-201-17535-5",
  ISBN-13 =      "978-0-201-17535-6",
  LCCN =         "QA76.73.S44 B79 1988",
  bibdate =      "Thu Jun 23 16:34:54 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/sgml.bib;
                 https://www.math.utah.edu/pub/tex/bib/standard.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  price =        "UK\pounds16.95",
  acknowledgement = ack-nhfb,
  keywords =     "document representation; DTD; SGML (computer program
                 language)",
  remark =       "Complete description of SGML including example DTDs.",
  tableofcontents = "Background to SGML \\
                 SGML Documents \\
                 The Reference Concrete Syntax \\
                 Entity Declaration and Use \\
                 Declaring and Using SGML Elements \\
                 Attributes \\
                 Minimization \\
                 Other SGML Declarations \\
                 Multiple Document Structures \\
                 Altering the Concrete Syntax \\
                 The SGML Declaration \\
                 Document Parsing \\
                 Appendixes",
}

@Book{Budd:1998:DSC,
  author =       "Timothy Budd",
  title =        "Data Structures in {C++} Using the {Standard Template
                 Library}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xxiv + 544",
  year =         "1998",
  ISBN =         "0-201-30879-7",
  ISBN-13 =      "978-0-201-30879-2",
  LCCN =         "QA76.73.C15B8 1998",
  bibdate =      "Mon Jan 12 14:26:22 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Buerger:1990:LES,
  author =       "David J. Buerger",
  title =        "{\LaTeX} for Engineers and Scientists",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "xvi + 198",
  year =         "1990",
  ISBN =         "0-07-008845-4",
  ISBN-13 =      "978-0-07-008845-0",
  LCCN =         "Z253.4.L38 B84 1990",
  bibdate =      "Tue Dec 14 22:43:21 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@TechReport{Burks:1946:PDL,
  author =       "Arthur W. Burks and Herman H. Goldstine and John von
                 Neumann",
  title =        "Preliminary discussion of the logical design of an
                 electronic computing instrument",
  institution =  inst-INST-ADV-STUDY,
  address =      inst-INST-ADV-STUDY:adr,
  pages =        "42",
  day =          "28",
  month =        jun,
  year =         "1946",
  bibdate =      "Wed Oct 13 08:17:48 2004",
  bibsource =    "ftp://ftp.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Math/computer.arithmetic.bib;
                 ftp://ftp.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Math/fparith.bib;
                 ftp://ftp.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/arith.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Report to the U.S. Army Ordnance Department under
                 contract W-36-034-OKD-7481. Reprinted in
                 \cite[Paper~2]{Taub:1963:JNCa}, \cite{Bell:1971:CSR},
                 \cite[pp.~221--259]{Swartzlander:1976:CDD}, \cite[\S
                 8.3]{Randell:1982:ODC}, and
                 \cite[pp.~97--146]{Aspray:1987:PJN}. Second edition
                 dated 2 September 1947.",
  acknowledgement = ack-nhfb,
  remark =       "Discusses floating-point versus fixed-point
                 computation, and concludes that floating-point is
                 probably not justifiable. They wrote:\par

                 ``There appear to be two major purposes in a `floating'
                 decimal point system both of which arise from the fact
                 that the number of digits in a word is a constant fixed
                 by design considerations for each particular machine.
                 The first of these purposes is to retain in a sum or
                 product as many significant digits as possible and the
                 second of these is to free the human operator from the
                 burden of estimating and inserting into a problem
                 `scale factors' --- multiplicative constants which
                 serve to keep numbers within the limits of the
                 machine.\par

                 There is, of course, no denying the fact that human
                 time is consumed in arranging for the introduction of
                 suitable scale factors. We only argue that the time so
                 consumed is a very small percentage of the total time
                 we will spend in preparing an interesting problem for
                 our machine. The first advantage of the floating point
                 is, we feel, somewhat illusory. In order to have such a
                 floating point, one must waste memory capacity which
                 could otherwise be used for carrying more digits per
                 word. It would therefore seem to us not at all clear
                 whether the modest advantages of a floating binary
                 point offset the loss of memory capacity and the
                 increased complexity of the arithmetic and control
                 circuits.''",
}

@Book{Burrough:1998:DNC,
  author =       "Bryan Burrough",
  title =        "{Dragonfly}: {NASA} and the crisis aboard the {MIR}",
  publisher =    pub-HARPERCOLLINS,
  address =      pub-HARPERCOLLINS:adr,
  pages =        "528",
  year =         "1998",
  ISBN =         "0-88730-783-3",
  ISBN-13 =      "978-0-88730-783-6",
  LCCN =         "TL867 .B87 1998",
  bibdate =      "Wed May 01 08:04:51 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "In ``Dragonfly'', bestselling author Bryan Burrough
                 tells for the first time the incredible true story of
                 how a joint Russian--American crew narrowly survived
                 almost every trauma an astronaut could imagine: fire,
                 nail-biting spacewalks, and constant mechanical
                 breakdowns, all climaxing in a dramatic midspace
                 collision that left everyone on board scrambling for
                 their lives. Based on hundreds of hours of interviews
                 with the cosmonauts, astronauts, Russian and American
                 ground controllers, psychologists, and scientists
                 involved, ``Dragonfly'' is the saga of a mission as
                 fraught with political and bureaucratic intrigues as
                 any Washington potboiler. Using never-before-released
                 internal NASA memoranda, flight logs, and debriefings,
                 Burrough vividly portrays an American space program in
                 which many astronauts refuse to raise safety concerns
                 for fear they will be frozen out of future missions. It
                 offers an unprecedented look inside the rattletrap
                 Russian space program, where the desperate thirst for
                 hard currency leads to safety shortcuts and exhausted,
                 puppetlike cosmonauts endure truly inhuman pressures
                 from their unfeeling, all-powerful masters on the
                 ground. In ``Dragonfly'', for the first time, the
                 American astronauts who journeyed to Mir speak out
                 bluntly about the failings of the program, from the
                 rigors of training at Russia's Star City military base
                 to the slapdash experiments they were required to
                 perform in space. Yet through it all the men and women
                 of the Russian and American programs persevered,
                 forging friendships that will serve them well as the
                 two countries prepare for the first launches of the
                 International Space Station in late 1998. Theirs is a
                 classic story of a triumph over adversity, destined to
                 be one of the most enduring and widely celebrated
                 adventure stories of our time.",
  acknowledgement = ack-nhfb,
  annote =       "Discusses errors of design, including one where the
                 shuttle rendezvous failed because part of the
                 programming had been done in single-precision
                 arithmetic, and part in double-precision arithmetic.",
  libnote =      "Not yet in my library.",
  tableofcontents = "January 10 to May 18, 1997 \\
                 1992 to 1996 \\
                 May 18 to September 25, 1997 \\
                 Epilogue",
}

@Book{Burton:2007:HMI,
  author =       "David M. Burton",
  title =        "The History of Mathematics: an Introduction",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  edition =      "Sixth",
  pages =        "xii + 788",
  year =         "2007",
  ISBN =         "0-07-305189-6",
  ISBN-13 =      "978-0-07-305189-5",
  LCCN =         "QA21 .B96 2007",
  bibdate =      "Fri Sep 6 06:05:08 MDT 2013",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0625/2005051123-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0625/2005051123-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Mathematics; History",
  tableofcontents = "Preface \\
                 \\
                 1 Early Number Systems and Symbols \\
                 1.1 Primitive Counting \\
                 A Sense of Number \\
                 Notches as Tally Marks \\
                 The Peruvian Quipus: Knots as Numbers \\
                 1.2 Number Recording of the Egyptians and Greeks \\
                 The History of Herodotus \\
                 Hieroglyphic Representation of Numbers \\
                 Egyptian Hieratic Numeration \\
                 The Greek Alphabetic Numeral System \\
                 1.3 Number Recording of the Babylonians \\
                 Babylonian Cuneiform Script \\
                 Deciphering Cuneiform: Grotefend and Rawlinson \\
                 The Babylonian Positional Number System \\
                 Writing in Ancient China \\
                 \\
                 2 Mathematics in Early Civilizations \\
                 2.1 The Rhind Papyrus \\
                 Egyptian Mathematical Papyri \\
                 A Key To Deciphering: The Rosetta Stone \\
                 2.2 Egyptian Arithmetic \\
                 Early Egyptian Multiplication \\
                 The Unit Fraction Table \\
                 Representing Rational Numbers \\
                 2.3 Four Problems from the Rhind Papyrus \\
                 The Method of False Position \\
                 A Curious Problem \\
                 Egyptian Mathematics as Applied Arithmetic \\
                 2.4 Egyptian Geometry \\
                 Approximating the Area of a Circle \\
                 The Volume of a Truncated Pyramid \\
                 Speculations About the Great Pyramid \\
                 2.5 Babylonian Mathematics \\
                 A Tablet of Reciprocals \\
                 The Babylonian Treatment of Quadratic Equations \\
                 Two Characteristic Babylonian Problems \\
                 2.6 Plimpton \\
                 A Tablet Concerning Number Triples \\
                 Babylonian Use of the Pythagorean Theorem \\
                 The Cairo Mathematical Papyrus \\
                 \\
                 3 The Beginnings of Greek Mathematics \\
                 3.1 The Geometric Discoveries of Thales \\
                 Greece and the Aegean Area \\
                 The Dawn of Demonstrative Geometry: Thales of Miletos
                 \\
                 Measurements Using Geometry \\
                 3.2 Pythagorean Mathematics \\
                 Pythagoras and His Followers \\
                 Nichomachus' Introductio Arithmeticae \\
                 The Theory of Figurative Numbers \\
                 Zeno's Paradox \\
                 3.3 The Pythagorean Problem \\
                 Geometric Proofs of the Pythagorean Theorem \\
                 Early Solutions of the Pythagorean Equation \\
                 The Crisis of Incommensurable Quantities \\
                 Theon's Side and Diagonal Numbers \\
                 Eudoxus of Cnidos \\
                 3.4 Three Construction Problems of Antiquity \\
                 Hippocrates and the Quadrature of the Circle \\
                 The Duplication of the Cube \\
                 The Trisection of an Angle \\
                 3.5 The Quadratrix of Hippias \\
                 Rise of the Sophists \\
                 Hippias of Elis \\
                 The Grove of Academia: Plato's Academy \\
                 \\
                 4 The Alexandrian School: Euclid \\
                 4.1 Euclid and the Elements \\
                 A Center of Learning: The Museum \\
                 Euclid's Life and Writings \\
                 4.2 Euclidean Geometry \\
                 Euclid's Foundation for Geometry \\
                 Book I of the Elements \\
                 Euclid's Proof of the Pythagorean Theorem \\
                 Book II on Geometric Algebra \\
                 Construction of the Regular Pentagon \\
                 4.3 Euclid's Number Theory \\
                 Euclidean Divisibility Properties \\
                 The Algorithm of Euclid \\
                 The Fundamental Theorem of Arithmetic \\
                 An Infinity of Primes \\
                 4.4 Eratosthenes, the Wise Man of Alexandria \\
                 The Sieve of Eratosthenes \\
                 Measurement of the Earth \\
                 The Almagest of Claudius Ptolemy \\
                 Ptolemy's Geographical Dictionary \\
                 4.5 Archimedes \\
                 The Ancient World's Genius \\
                 Estimating the Value of `? \\
                 The Sand-Reckoner \\
                 Quadrature of a Parabolic Segment \\
                 Apollonius of Perga: the Conics \\
                 \\
                 5 The Twilight of Greek Mathematics: Diophantus \\
                 5.1 The Decline of Alexandrian Mathematics \\
                 The Waning of the Golden Age \\
                 The Spread of Christianity \\
                 Constantinople, A Refuge for Greek Learning \\
                 5.2 The Arithmetica \\
                 Diophantus's Number Theory \\
                 Problems from the Arithmetica \\
                 5.3 Diophantine Equations in Greece, India, and China
                 \\
                 The Cattle Problem of Archimedes \\
                 Early Mathematics in India \\
                 The Chinese Hundred Fowls Problem \\
                 5.4 The Later Commentators \\
                 The Mathematical Collection of Pappus \\
                 Hypatia, the First Woman Mathematician \\
                 Roman Mathematics: Boethius and Cassiodorus \\
                 5.5 Mathematics in the Near and Far East \\
                 The Algebra of al-Khow{\^a}rizm{\^\i} \\
                 Ab{\^u} Kamil and Th{\^a}bit ibn Qurra \\
                 Omar Khayyam \\
                 The Astronomers al-Tusi and al-Karashi \\
                 The Ancient Chinese Nine Chapters \\
                 Later Chinese Mathematical Works \\
                 \\
                 6 The First Awakening: Fibonacci \\
                 6.1 The Decline and Revival of Learning \\
                 The Carolingian Pre-Renaissance \\
                 Transmission of Arabic Learning to the West \\
                 The Pioneer Translators: Gerard and Adelard \\
                 6.2 The Liber Abaci and Liber Quadratorum \\
                 The Hindu-Arabic Numerals \\
                 Fibonacci's Liver Quadratorum \\
                 The Works of Jordanus de Nemore \\
                 6.3 The Fibonacci Sequence \\
                 The Liber Abaci's Rabbit Problem \\
                 Some Properties of Fibonacci Numbers \\
                 6.4 Fibonacci and the Pythagorean Problem \\
                 Pythagorean Number Triples \\
                 Fibonacci's Tournament Problem \\
                 \\
                 7 The Renaissance of Mathematics: Cardan and Tartaglia
                 \\
                 7.1 Europe in the Fourteenth and Fifteenth Centuries
                 \\
                 The Italian Renaissance \\
                 Artificial Writing: The Invention of Printing \\
                 Founding of the Great Universities \\
                 A Thirst for Classical Learning \\
                 7.2 The Battle of the Scholars \\
                 Restoring the Algebraic Tradition: Robert Recorde \\
                 The Italian Algebraists: Pacioli, del Ferro and
                 Tartaglia \\
                 Cardan, A Scoundrel Mathematician \\
                 7.3 Cardan's Ars Magna \\
                 Cardan's Solution of the Cubic Equation \\
                 Bombelli and Imaginary Roots of the Cubic \\
                 7.4 Ferrari's Solution of the Quartic Equation \\
                 The Resolvant Cubic \\
                 The Story of the Quintic Equation: Ruffini, Abel and
                 Galois \\
                 \\
                 8 The Mechanical World: Descartes and Newton \\
                 8.1 The Dawn of Modern Mathematics \\
                 The Seventeenth Century Spread of Knowledge \\
                 Galileo's Telescopic Observations \\
                 The Beginning of Modern Notation: Fran{\c{c}}ois
                 Vi{\`e}ta \\
                 The Decimal Fractions of Simon Steven \\
                 Napier's Invention of Logarithms \\
                 The Astronomical Discoveries of Brahe and Kepler \\
                 8.2 Descartes: The Discours de la M{\'e}thod \\
                 The Writings of Descartes \\
                 Inventing Cartesian Geometry \\
                 The Algebraic Aspect of La G{\'e}ometrie \\
                 Descartes' Principia Philosophia \\
                 Perspective Geometry: Desargues and Poncelet \\
                 8.3 Newton: The Principia Mathematica \\
                 The Textbooks of Oughtred and Harriot \\
                 Wallis' Arithmetica Infinitorum \\
                 The Lucasian Professorship: Barrow and Newton \\
                 Newton's Golden Years \\
                 The Laws of Motion \\
                 Later Years: Appointment to the Mint \\
                 8.4 Gottfried Leibniz: The Calculus Controversy \\
                 The Early Work of Leibniz \\
                 Leibniz's Creation of the Calculus \\
                 Newton's Fluxional Calculus \\
                 The Dispute over Priority \\
                 Maria Agnesi and Emilie du Ch{\^a}telet \\
                 \\
                 9 The Development of Probability Theory: Pascal,
                 Bernoulli, and Laplace \\
                 9.1 The Origins of Probability Theory \\
                 Graunt's Bills of Mortality \\
                 Games of Chance: Dice and Cards \\
                 The Precocity of the Young Pascal \\
                 Pascal and the Cycloid \\
                 De M{\`e}re;'s Problem of Points \\
                 9.2 Pascal's Arithmetic Triangle \\
                 The Trait{\'e} du Triangle Arithm{\'e}tique \\
                 Mathematical Induction \\
                 Francesco Maurolico's Use of Induction \\
                 9.3 The Bernoullis and Laplace \\
                 Christiaan Huygens's Pamphlet on Probability \\
                 The Bernoulli Brothers: John and James \\
                 De Moivre's Doctrine of Chances \\
                 The Mathematics of Celestial Phenomena: Laplace \\
                 Mary Fairfax Somerville \\
                 Laplace's Research on Probability Theory \\
                 Daniel Bernoulli, Poisson, and Chebyshev \\
                 \\
                 10 The Revival of Number Theory: Fermat, Euler, and
                 Gauss \\
                 10.1 Martin Mersenne and the Search for Perfect Numbers
                 \\
                 Scientific Societies \\
                 Marin Mersenne's Mathematical Gathering \\
                 Numbers, Perfect and Not So Perfect \\
                 10.2 From Fermat to Euler \\
                 Fermat's Arithmetica \\
                 The Famous Last Theorem of Fermat \\
                 The Eighteenth-Century Enlightenment \\
                 Maclaurin's Treatise on Fluxions \\
                 Euler's Life and Contributions \\
                 10.3 The Prince of Mathematicians: Carl Friedrich Gauss
                 \\
                 The Period of the French Revolution: Lagrange and Monge
                 \\
                 Gauss's Disquisitiones Arithmeticae \\
                 The Legacy of Gauss: Congruence Theory \\
                 Dirichlet and Jacobi \\
                 \\
                 11 Nineteenth-Century Contributions: Lobachevsky to
                 Hilbert \\
                 11.1 Attempts to Prove the Parallel Postulate \\
                 The Efforts of Proclus, Playfair, and Wallis \\
                 Saccheri Quadrilaterals \\
                 The Accomplishments of Legendre \\
                 Legendre's {\'E}l{\'e}ments de g{\'e}ometrie \\
                 11.2 The Founders of Non-Euclidean Geometry \\
                 Gauss's Attempt at a New Geometry \\
                 The Struggle of John Bolyai \\
                 Creation of Non-Euclidean Geometry: Lobachevsky \\
                 Models of the New Geometry: Riemann, Beltrami, and
                 Klein \\
                 Grace Chisholm Young \\
                 11.3 The Age of Rigor \\
                 D'Alembert and Cauchy on Limits \\
                 Fourier's Series \\
                 The Father of Modern Analysis, Weierstrass \\
                 Sonya Kovalevsky \\
                 The Axiomatic Movement: Pasch and Hilbert \\
                 11.4 Arithmetic Generalized \\
                 Babbage and the Analytical Engine \\
                 Peacock's Treatise on Algebra \\
                 The Representations of Complex Numbers \\
                 Hamilton's Discovery of Quaternions \\
                 Matrix Algebra: Cayley and Sylvester \\
                 Boole's Algebra of Logic \\
                 \\
                 12 Transition to the Twenthieth Century: Cantor and
                 Kronecker \\
                 12.1 The Emergence of American Mathematics \\
                 Ascendency of the German Universities \\
                 American Mathematics Takes Root: 1800--1900 \\
                 The Twentieth Century Consolidation \\
                 12.2 Counting the Infinite \\
                 The Last Universalist: Poincar{\'e} \\
                 Cantor's Theory of Infinite Sets \\
                 Kronecker's View of Set Theory \\
                 Countable and Uncountable Sets \\
                 Transcendental Numbers \\
                 The Continuum Hypothesis \\
                 12.3 The Paradoxes of Set Theory \\
                 The Early Paradoxes \\
                 Zermelo and the Axiom of Choice \\
                 The Logistic School: Frege, Peano and Russell \\
                 Hilbert's Formalistic Approach \\
                 Brouwer's Intuitionism \\
                 \\
                 13 Extensions and Generalizations: Hardy, Hausdorff,
                 and Noether \\
                 13.1 Hardy and Ramanujan \\
                 The Tripos Examination \\
                 The Rejuvenation of English Mathematics \\
                 A Unique Collaboration: Hardy and Littlewood \\
                 India's Prodigy, Ramanujan \\
                 13.2 The Beginnings of Point-Set Topology \\
                 Frechet's Metric Spaces \\
                 The Neighborhood Spaces of Hausdorff \\
                 Banach and Normed Linear Spaces \\
                 13.3 Some Twentieth-Century Developments \\
                 Emmy Noether's Theory of Rings \\
                 Von Neumann and the Computer \\
                 Women in Modern Mathematics \\
                 A Few Recent Advances \\
                 \\
                 General Bibliography \\
                 Additional Reading \\
                 The Greek Alphabet \\
                 Solutions to Selected Problems \\
                 Index",
}

@Book{Busch:1999:GGG,
  author =       "David D. Busch",
  title =        "Great graphics with {GIMP}",
  publisher =    pub-PRIMA,
  address =      pub-PRIMA:adr,
  pages =        "xxx + 370",
  year =         "1999",
  ISBN =         "0-7615-2407-X",
  ISBN-13 =      "978-0-7615-2407-6",
  LCCN =         "T385 .B8664 2000",
  bibdate =      "Mon Nov 15 15:56:11 2004",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Edited by Kevin Harreld and Kim Spilker.",
  price =        "US\$40.00",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Computer graphics; GIMP (Computer file)",
}

@Misc{Bush:1940:AM,
  author =       "V. Bush",
  title =        "Arithmetical Machine",
  howpublished = "Vannevar Bush Papers, Container 18, Folder: Caldwell,
                 Samuel, 1939--1940",
  year =         "1940",
  bibdate =      "Wed Oct 13 11:37:32 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Reprinted in \cite[\S 7.3]{Randell:1982:ODC}.
                 Copyright interest in the unpublished writings of
                 Vannevar Bush has been dedicated to the public.",
  acknowledgement = ack-nhfb,
}

@Book{Bush:1945:SEF,
  author =       "Vannevar Bush",
  title =        "Science, the endless frontier: a report to the
                 {President}: {Bush} report on scientific research in
                 the {United States}",
  publisher =    pub-USGPO,
  address =      pub-USGPO:adr,
  pages =        "xxvi + 220",
  year =         "1945",
  LCCN =         "Q127.U6 A53 1945",
  bibdate =      "Thu Sep 20 10:11:05 MDT 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "https://ia600207.us.archive.org/12/items/scienceendlessfr00unit/scienceendlessfr00unit.pdf",
  acknowledgement = ack-nhfb,
  remark =       "Report to the President on a program for postwar
                 scientific research. Appendices: Committees consulted.
                 Report of the Medical advisory committee. Report of the
                 Committee on science and the public welfare. Report of
                 the Committee on discovery and development of
                 scientific talent. Report of the Committee on
                 publication of scientific information. Commonly known
                 as the Bush report. [The PDF file in the URL link is
                 from the original book, including its cover, and is 252
                 pages long. The section ``The importance of basic
                 research'' is on pages 18--19.]",
  subject =      "Science and state; United States; Research; World war,
                 1939--1945; Science",
  xxpages =      "ix + 184",
}

@Book{Butler:1964:SPC,
  author =       "James Newton Butler",
  title =        "Solubility and {pH} Calculations: The Mathematics of
                 the Simplest Ionic Equilibria",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "viii + 104",
  year =         "1964",
  LCCN =         "QD42 .B87",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Byrd:1971:HEI,
  author =       "Paul F. Byrd and Morris D. Friedman",
  title =        "Handbook of Elliptic Integrals for Engineers and
                 Scientists",
  volume =       "67",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Second",
  pages =        "xvi + 358",
  year =         "1971",
  DOI =          "https://doi.org/10.1007/978-3-642-65138-0",
  ISBN =         "0-387-05318-2 (New York)",
  ISBN-13 =      "978-0-387-05318-9 (New York)",
  LCCN =         "QA343 .B95 1971",
  bibdate =      "Mon Oct 15 16:40:14 MDT 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/mathcw.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Die Grundlehren der mathematischen Wissenschaften in
                 Einzeldarstellungen",
  acknowledgement = ack-nhfb,
  subject =      "Elliptic functions",
  tableofcontents = "Introduction / 1--7 \\
                 Definitions and Fundamental Relations / 8--41 \\
                 Reduction of Algebraic Integrands to Jacobian Elliptic
                 Functions / 42--161 \\
                 Reduction of Trigonometric Integrands to Jacobian
                 Elliptic Functions / 162--181 \\
                 Reduction of Hyperbolic Integrands to Jacobian Elliptic
                 Functions / 182--190 \\
                 Table of Integrals of Jacobian Elliptic Functions /
                 191--222 \\
                 Elliptic Integrals of the Third Kind / 223--239 \\
                 Miscellaneous Elliptic Integrals Involving
                 Trigonometric and Hyperbolic Integrands / 240--248 \\
                 Elliptic Integrals Resulting from Laplace
                 Transformations / 249--251 \\
                 Hyperelliptic Integrals / 252--271 \\
                 Integrals of the Elliptic Integrals / 272--281 \\
                 Derivatives / 282--287 \\
                 Miscellaneous Integrals and Formulas / 288--297 \\
                 Expansions in Series / 298--307 \\
                 Appendix / 308 \\
                 Bibliography / 351 \\
                 Supplemental Bibliography / 353 \\
                 Index / 355",
}

@Book{Cahill:1995:HIS,
  author =       "Thomas Cahill",
  title =        "How the {Irish} Saved Civilization: the Untold Story
                 of {Ireland}'s Heroic Role from the Fall of {Rome} to
                 the Rise of Medieval {Europe}",
  publisher =    "Nan A. Talese, Doubleday",
  address =      "New York, NY, USA",
  pages =        "x + 246",
  year =         "1995",
  ISBN =         "0-385-41848-5",
  ISBN-13 =      "978-0-385-41848-5",
  LCCN =         "DA930.5 .C34 1995",
  bibdate =      "Thu Sep 18 21:40:22 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  price =        "US\$20.00",
  URL =          "http://www.loc.gov/catdir/bios/random057/94028130.html;
                 http://www.loc.gov/catdir/description/random043/94028130.html;
                 http://www.loc.gov/catdir/samples/random041/94028130.html",
  abstract =     "The perfect St. Patrick's Day gift, and a book in the
                 best tradition of popular history -- the untold story
                 of Ireland's role in maintaining Western culture while
                 the Dark Ages settled on Europe. Every year millions of
                 Americans celebrate St. Patrick's Day, but they may not
                 be aware of how great an influence St. Patrick was on
                 the subsequent history of civilization. Not only did he
                 bring Christianity to Ireland, he instilled a sense of
                 literacy and learning that would create the conditions
                 that allowed Ireland to become ``the isle of saints and
                 scholars''--And thus preserve Western culture while
                 Europe was being overrun by barbarians. In this
                 entertaining and compelling narrative, Thomas Cahill
                 tells the story of how Europe evolved from the
                 classical age of Rome to the medieval era. Without
                 Ireland, the transition could not have taken place. Not
                 only did Irish monks and scribes maintain the very
                 record of Western civilization -- copying manuscripts
                 of Greek and Latin writers, both pagan and Christian,
                 while libraries and learning on the continent were
                 forever lost -- they brought their uniquely Irish
                 world-view to the task. As Cahill delightfully
                 illustrates, so much of the liveliness we associate
                 with medieval culture has its roots in Ireland. When
                 the seeds of culture were replanted on the European
                 continent, it was from Ireland that they were
                 germinated. In the tradition of Barbara Tuchman's
                 \booktitle{A Distant Mirror}, \booktitle{How The Irish
                 Saved Civilization} reconstructs an era that few know
                 about but which is central to understanding our past
                 and our cultural heritage. But it conveys its knowledge
                 with a winking wit that aptly captures the sensibility
                 of the unsung Irish who relaunched civilization.",
  acknowledgement = ack-nhfb,
  subject =      "Ireland; Civilization; To 1172; Learning and
                 scholarship; History; Medieval, 500--1500;
                 Civilization, Classical; Study and teaching; Europe;
                 Irish influences; Books; 400-1400; Manuscripts;
                 Monastic libraries; Transmission of texts; Scriptoria",
  tableofcontents = "Introduction: How Real Is History? \\
                 I: The End of the World: How Rome Fell \\
                 And Why \\
                 II: What Was Lost: The Complexities of the Classical
                 Tradition \\
                 III: A Shifting World of Darkness: Unholy Ireland \\
                 IV: Good News from Far Off: The First Missionary \\
                 V: A Solid World of Light: Holy Ireland \\
                 VI: What Was Found: How the Irish Saved Civilization
                 \\
                 VII: The End of the World: Is There Any Hope?",
}

@Book{Calaprice:2004:EA,
  author =       "Alice Calaprice",
  title =        "The {Einstein} almanac",
  publisher =    pub-JOHNS-HOPKINS,
  address =      pub-JOHNS-HOPKINS:adr,
  pages =        "xvii + 176",
  year =         "2004",
  ISBN =         "0-8018-8021-1",
  ISBN-13 =      "978-0-8018-8021-6",
  LCCN =         "QC16.E5 C35 2004",
  bibdate =      "Fri Dec 17 10:27:22 MST 2004",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "ftp://uiarchive.cso.uiuc.edu/pub/etext/gutenberg/;
                 http://www.loc.gov/catdir/bios/jhu051/2004009048.html;
                 http://www.loc.gov/catdir/description/jhu051/2004009048.html;
                 http://www.loc.gov/catdir/toc/ecip0417/2004009048.html",
  abstract =     "Albert Einstein was an exceptional human being.
                 Perhaps nothing reflects the breadth and scope of his
                 brilliance, his interests, and his influence better
                 than his publications --- more than six hundred
                 scientific papers, books, essays, reviews, and opinion
                 pieces. His published work ranged widely over
                 relativity theory and quantum physics, nationalism,
                 Judaism, war, peace, and education. Indeed, Einstein's
                 literary output was so abundant that even many of his
                 most informed admirers are not familiar with all of it.
                 The Einstein Almanac takes a look at Einstein's
                 year-by-year output, explaining his three hundred most
                 important publications and setting them into the
                 context of his life, science, and world history.
                 Concentrating primarily on Einstein's scientific and
                 humanitarian writings, Alice Calaprice summarizes most
                 of the papers and describes meaningful events
                 surrounding their publication, including Einstein's
                 personal life, his travels, the work of other
                 scientists, social and cultural developments at he
                 time, and national and international events.",
  acknowledgement = ack-nhfb,
  remark =       "A brief Einstein timeline for the years 1879--1900 --
                 Selected published papers and commentary, 1901--1955",
  subject =      "Einstein, Albert; Physicists; Biography; Relativity
                 (Physics); History; Physics; History; 20th century;
                 Einstein, Albert, Bibliography",
  subject-dates = "Albert Einstein (1879--1955)",
  tableofcontents = "A brief Einstein timeline for the years 1879--1900
                 \\
                 Selected published papers and commentary, 1901--1955",
}

@Book{Cameron:1991:LGE,
  author =       "Debra Cameron and Bill Rosenblatt",
  title =        "Learning {GNU} Emacs",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xxvii + 411",
  year =         "1991",
  ISBN =         "0-937175-84-6",
  ISBN-13 =      "978-0-937175-84-2",
  LCCN =         "QA76.76.T49 C35 1991",
  bibdate =      "Tue Dec 14 22:43:25 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
                 https://www.math.utah.edu/pub/bibnet/subjects/han-wri-mat-sci-2ed.bib;
                 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/ora.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  URL =          "http://www.oreilly.com/catalog/9780937175842",
  abstract =     "GNU Emacs is the most popular and widespread of the
                 Emacs family of editors. It is also the most powerful
                 and flexible. (Unlike all other text editors, GNU Emacs
                 is a complete working environment --- you can stay
                 within Emacs all day without leaving.) This book tells
                 you how to get started with the GNU Emacs editor. It
                 will also ``grow'' with you: as you become more
                 proficient, this book will help you learn how to use
                 Emacs more effectively. It will take you from basic
                 Emacs usage (simple text editing) to moderately
                 complicated customization and programming. Topics
                 covered include: Using Emacs to read and write
                 electronic mail. Using Emacs as a ``shell
                 environment.'' How to take advantage of ``built-in''
                 formatting features. Customizing Emacs. Whys and hows
                 of writing macros to circumvent repetitious tasks.
                 Emacs as a programming environment. The basics of Emacs
                 LISP. The Emacs interface to the X Window System. How
                 to get Emacs. The book is aimed at new Emacs users,
                 whether or not they are programmers. Also useful for
                 readers switching from other Emacs implementations to
                 GNU Emacs. Covers Version 18.57 of the GNU Emacs
                 editor.",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "1: Emacs Basics / 1 \\
                 2: Editing Files / 22 \\
                 3: Search and Replace Operations / 49 \\
                 4: Using Buffers and Windows / 74 \\
                 5: Emacs as a Work Environment 9 / 5 \\
                 6: Simple Text Formatting and Specialized Editing / 136
                 \\
                 7: Using Emacs with UNIX Text Formatters / 175 \\
                 8: Writing Macros / 197 \\
                 9: Customizing Emacs / 214 \\
                 10: Emacs For Programmers / 230 \\
                 11: Emacs LISP Programming / 259 \\
                 12: Emacs for the X Window System / 302 \\
                 13: Online Help / 318 \\
                 Appendix A: How to Get Emacs / 330 \\
                 Appendix B: Making Emacs Work the Way You Think It
                 Should / 336 \\
                 Appendix C: Emacs Variables / 338 \\
                 Appendix D: Emacs LISP Packages / 347 \\
                 Appendix E: Bugs and Bug Fixes / 353 \\
                 Appendix F: Public Statements / 355 \\
                 The GNU General Public License / 355 \\
                 General Public License, Version 1 / 356 \\
                 General Public License, Version 2 / 362 \\
                 GNU Manifesto / 369 \\
                 The League for Programming Freedom / 369 \\
                 Appendix G: Give and It Shall Be Given / 372 \\
                 Appendix H: Quick Reference / 373 \\
                 Index / 383",
  tableofcontents = "Preface / xvi \\
                 Why Read This Book? / xvi \\
                 Which Emacs is Which? / xviii \\
                 GNU Emacs and the Free Software Foundation / xix \\
                 An Approach to Learning Emacs / xxi \\
                 What We Haven't Included / xxiii \\
                 Conventions Used in This Handbook / xxiv \\
                 Emacs Commands / xxiv \\
                 Examples / xxv \\
                 Font Usage / xxvi \\
                 Acknowledgments / xxvii \\
                 1: Emacs Basics / 1 \\
                 Introducing Emacs! / 1 \\
                 Understanding Files and Buffers / 3 \\
                 A Word about Modes / 4 \\
                 Starting Emacs / 6 \\
                 About the Emacs Screen / 7 \\
                 Emacs Commands / 8 \\
                 Reading a File / 9 \\
                 Letting Emacs Fill in the Blanks 1 / 1 \\
                 Inserting and Appending Files / 12 \\
                 How Emacs Chooses a Default Directory 1 / 3 \\
                 Saving Files: 1 / 3 \\
                 Leaving Emacs / 14 \\
                 Temporarily Suspending Emacs / 14 \\
                 Customizing Emacs and its Pitfalls 1 / 5 \\
                 Getting Help / 17 \\
                 Summary / 19 \\
                 Problem Checklist / 20 \\
                 2: Editing Files / 22 \\
                 Text Mode and Fill Mode / 23 \\
                 What Happens Without Fill Mode / 23 \\
                 Moving the Cursor / 24 \\
                 Repeating Commands / 25 \\
                 Other Ways to Move the Cursor / 27 \\
                 Moving a Screen (or More) at a Time / 29 \\
                 Redisplaying the Screen / 30 \\
                 Deleting Text 3 / 1 \\
                 Recovering What You've Deleted / 32 \\
                 Marking Text to Delete, Move, or Copy / 35 \\
                 Copying Text / 38 \\
                 More about the Kill Ring / 39 \\
                 Reformatting Paragraphs / 40 \\
                 Stopping and Undoing Commands / 41 \\
                 Stopping Commands / 42 \\
                 Undoing Changes / 42 \\
                 Backup Files / 43 \\
                 Editing Tricks and Shortcuts / 44 \\
                 Fixing Transpositions / 44 \\
                 Capitalization / 45 \\
                 Typing over Old Text with Overwrite Mode / 47 \\
                 Problem Checklist / 47 \\
                 3: Search and Replace Operations / 49 \\
                 Different Kinds of Searches 4 / 9 \\
                 Incremental Search 5 / 1 \\
                 Simple Searches / 54 \\
                 Word Search 5 / 5 \\
                 Search and Replace 5 / 5 \\
                 Simple Search and Replace Operations / 56 \\
                 Query-replace / 57 \\
                 Recursive Editing / 59 \\
                 Are Emacs Searches Case-sensitive? / 60 \\
                 Regular Expressions for Search and Replacement
                 Operations 6 / 1 \\
                 Checking Spelling 6 / 3 \\
                 Word Abbreviation Mode / 67 \\
                 Trying Word Abbreviations for One Session / 69 \\
                 Making Word Abbreviations Part of Your Startup / 70 \\
                 Deleting a Word Abbreviation / 70 \\
                 Disabling Word Abbreviations / 71 \\
                 Abbreviations and Capitalization / 72 \\
                 4: Using Buffers and Windows / 74 \\
                 Files, Buffers, and Windows / 74 \\
                 Working with Multiple Buffers / 76 \\
                 Saving Multiple Buffers / 78 \\
                 Deleting Buffers 7 / 8 \\
                 Renaming Buffers / 79 \\
                 Read-only Buffers 8 / 0 \\
                 Getting a List of Buffers 8 / 0 \\
                 Working with the Buffer List / 82 \\
                 Working with Windows 8 / 5 \\
                 Creating Horizontal Windows 8 / 6 \\
                 Creating Vertical or Side-by-side Windows / 87 \\
                 Moving Between Windows 8 / 8 \\
                 Getting Rid of Windows 9 / 0 \\
                 Growing Windows and Shrinking Them 9 / 0 \\
                 Shortcut Commands for Working with Other Windows / 92
                 \\
                 Comparing Files Between Windows / 92 \\
                 Displaying Buffers from the Buffer List 9 / 4 \\
                 5: Emacs as a Work Environment 9 / 5 \\
                 Working with Mail 9 / 6 \\
                 Sending Mail from within Emacs 9 / 6 \\
                 Executing UNIX Commands in Shell Windows / 118 \\
                 Using Shell Mode / 122 \\
                 Working with Directories / 128 \\
                 Getting into Dired / 128 \\
                 Deleting Files with Dired / 130 \\
                 Copying and Renaming Files with Dired / 131 \\
                 Printing from Emacs / 133 \\
                 Reading Man Pages from Emacs / 134 \\
                 Using Your Emacs Work Environment / 135 \\
                 6: Simple Text Formatting and Specialized Editing / 136
                 \\
                 Indenting Text / 137 \\
                 Using Tabs / 137 \\
                 Using Fill Prefixes / 142 \\
                 Indented Text Mode / 144 \\
                 Indenting Regions / 146 \\
                 Some Other Tricks / 146 \\
                 Centering Text / 148 \\
                 Inserting Page Breaks / 150 \\
                 Rectangle Editing / 150 \\
                 Making Simple Drawings / 157 \\
                 Drawing in Picture Mode / 158 \\
                 Editing in Picture Mode / 161 \\
                 Using Rectangle Commands in Picture Mode / 166 \\
                 Using Outline Mode / 168 \\
                 Entering Outline Mode / 169 \\
                 Hiding and Showing Text / 170 \\
                 Editing While Text is Hidden / 173 \\
                 Customizing Outline Mode / 174 \\
                 7: Using Emacs with UNIX Text Formatters / 175 \\
                 Comments / 176 \\
                 Finding Headings 17 / 7 \\
                 Marking Up Text for troff and nroff / 177 \\
                 Paragraph Formatting / 178 \\
                 Navigation / 179 \\
                 Macro Pairs / 180 \\
                 Making nroff Mode Part of Your Startup / 182 \\
                 Marking Up Text for TeX and LaTeX / 183 \\
                 Matching Braces / 183 \\
                 Quotation Marks and Paragraphing / 186 \\
                 Comments / 187 \\
                 Processing and Printing Text / 187 \\
                 Differences for LaTeX Mode / 188 \\
                 Marking Up Text for Scribe / 189 \\
                 Marking Environments / 190 \\
                 Marking Fonts / 193 \\
                 Tabs, Quotation Marks, and Parentheses / 194 \\
                 8: Writing Macros / 197 \\
                 What is a Macro? / 197 \\
                 Defining a Macro / 198 \\
                 Tips for Creating Good Macros / 201 \\
                 A More Complicated Macro Example / 203 \\
                 Adding to an Existing Macro / 204 \\
                 Naming and Saving Your Macros / 205 \\
                 Executing a Macro You've Named / 206 \\
                 Building More Complicated Macros / 207 \\
                 Pausing a Macro for Keyboard Input / 208 \\
                 Adding a Query to a Macro / 210 \\
                 Beyond Macros / 212 \\
                 9: Customizing Emacs / 214 \\
                 Keyboard Customization / 215 \\
                 Getting Around Flow-control Problems / 218 \\
                 Special Keys / 220 \\
                 Terminal Support / 223 \\
                 Emacs Variables / 226 \\
                 Emacs LISP Packages / 227 \\
                 Auto-mode Customization / 228 \\
                 10: Emacs For Programmers / 230 \\
                 Language Modes / 231 \\
                 Syntax / 232 \\
                 Formatting / 233 \\
                 C Mode / 237 \\
                 Etags / 242 \\
                 The LISP Modes / 244 \\
                 FORTRAN Mode / 252 \\
                 11: Emacs LISP Programming / 259 \\
                 Introduction to LISP / 260 \\
                 Basic LISP Entities / 261 \\
                 Defining Functions / 263 \\
                 Turning LISP Functions into Emacs Commands / 266 \\
                 LISP Primitive Functions / 269 \\
                 Statement Blocks / 270 \\
                 Control Structures / 271 \\
                 Useful Built-in Emacs Functions / 274 \\
                 Buffers, Text, and Regions / 274 \\
                 Regular Expressions / 276 \\
                 Functions that Use Regular Expressions / 284 \\
                 Finding Other Built-in Functions / 285 \\
                 Programming a Major Mode / 286 \\
                 Components of a Major Mode / 287 \\
                 More LISP Basics: Lists / 289 \\
                 The Calculator Mode / 290 \\
                 LISP Code for the Calculator Mode / 292 \\
                 Customizing Existing Modes / 295 \\
                 Building Your Own LISP Library / 299 \\
                 Byte-compiling LISP Files / 301 \\
                 12: Emacs for the X Window System / 302 \\
                 Invoking Emacs under X / 303 \\
                 Command Line and .X11Startup Options / 304 \\
                 .Xdefaults File / 306 \\
                 Mouse Commands / 307 \\
                 Creating Mouse Commands / 312 \\
                 Creating Popup Menus / 314 \\
                 13: Online Help / 318 \\
                 Completion / 319 \\
                 Customizing Completion / 321 \\
                 Help Commands / 322 \\
                 Detail Information / 323 \\
                 Apropos Commands / 325 \\
                 General Information / 327 \\
                 Help in Complex Emacs Commands / 328 \\
                 Appendix A: How to Get Emacs / 330 \\
                 FTP on Internet 33 / 1 \\
                 Uucp on UUNET / 332 \\
                 Magnetic Media / 334 \\
                 MS-DOS Versions of Emacs / 335 \\
                 Appendix B: Making Emacs Work the Way You Think It
                 Should / 336 \\
                 Appendix C: Emacs Variables / 338 \\
                 Appendix D: Emacs LISP Packages / 347 \\
                 Appendix E: Bugs and Bug Fixes / 353 \\
                 Appendix F: Public Statements / 355 \\
                 The GNU General Public License / 355 \\
                 General Public License, Version 1 / 356 \\
                 General Public License, Version 2 / 362 \\
                 GNU Manifesto / 369 \\
                 The League for Programming Freedom / 369 \\
                 Appendix G: Give and It Shall Be Given / 372 \\
                 Appendix H: Quick Reference / 373 \\
                 Index / 383",
}

@Book{Campbell-Kelly:2003:HMT,
  editor =       "Martin Campbell-Kelly and Mary Croarken and Raymond
                 Flood and Eleanor Robson",
  title =        "The History of Mathematical Tables: From {Sumer} to
                 Spreadsheets",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  pages =        "viii + 361",
  year =         "2003",
  ISBN =         "0-19-850841-7",
  ISBN-13 =      "978-0-19-850841-0",
  LCCN =         "QA47 .H57 2003",
  bibdate =      "Mon Dec 31 17:28:46 MST 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0620/2004298837-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0620/2004298837-t.html",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "mathematics; tables; history",
  tableofcontents = "Tables and tabular formatting in Sumer, Babylonia,
                 and Assyria, 2500 BCE--50 CE \\
                 The making of logarithm tables \\
                 History of actuarial tables \\
                 The computation factory: de Prony's project for making
                 tables in the 1790s \\
                 Difference engines: from M{\"u}ller to Comrie \\
                 The `unerring certainty of mechanical agency': machines
                 and table making in the nineteenth century \\
                 Table making in astronomy \\
                 The General Register Office and the tabulation of data,
                 1837--1939 \\
                 Table making by committee: British table makers,
                 1871--1965 \\
                 Table making for the relief of labour \\
                 The making of astronomical tables in HM Nautical
                 Almanac Office \\
                 The rise and rise of the spreadsheet",
}

@Book{Campbell:1987:CPG,
  author =       "Joe Campbell",
  title =        "{C} Programmer's Guide to Serial Communications",
  publisher =    pub-HWS,
  address =      pub-HWS:adr,
  pages =        "xii + 655",
  year =         "1987",
  ISBN =         "0-672-22584-0",
  ISBN-13 =      "978-0-672-22584-0",
  LCCN =         "QA76.73.C15 C36 1987",
  bibdate =      "Tue Dec 14 23:27:20 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$22.95",
  acknowledgement = ack-nhfb,
}

@Book{Campbell:2006:MSS,
  author =       "S. L. (Stephen La Vern) Campbell and Jean-Philippe
                 Chancelier and Ramine Nikoukhah",
  title =        "Modeling and Simulation in {Scilab\slash Scicos}",
  publisher =    "Springer Science+Business Media",
  address =      "New York, NY, USA",
  pages =        "xi + 313",
  year =         "2006",
  ISBN =         "0-387-27802-8 (hardcover)",
  ISBN-13 =      "978-0-387-27802-5 (hardcover)",
  LCCN =         "Q183.9 .C36 2006",
  bibdate =      "Sat Jun 13 10:59:00 MDT 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/maple-extract.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0663/2005930797-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0814/2005930797-b.html;
                 http://www.loc.gov/catdir/toc/fy0705/2005930797.html",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Scilab; Science; Data processing; Computer programs",
  tableofcontents = "Part I. Scilab \\
                 1. General information \\
                 2. Introduction to Scilab \\
                 3. Modeling and simulation in Scilab \\
                 4. Optimization \\
                 5. Examples \\
                 Part II. Scicos \\
                 6. Introduction \\
                 7. Getting started \\
                 8. Scicos formalism \\
                 9. Scicos blocks \\
                 10. Examples \\
                 11. Batch processing in Scilab \\
                 12. Code generation \\
                 13. Debugging \\
                 14. Implicit Scicos and modelica \\
                 A. Inside Scicos \\
                 B. Scicos blocks of type 5 \\
                 C. Animation program for the car example \\
                 D. Extraction program for the \LaTeX{} graphic example
                 \\
                 E. Maple code used for modeling the $N$-link pendulum",
}

@Book{Carroll:1994:BBU,
  author =       "Paul Carroll",
  title =        "{Big Blues}: the unmaking of {IBM}",
  publisher =    "Crown Trade Paperbacks",
  address =      "New York, NY, USA",
  pages =        "v + 377",
  year =         "1994",
  ISBN =         "0-517-88221-3",
  ISBN-13 =      "978-0-517-88221-4",
  LCCN =         "HD9696.C64 I48317 1994",
  bibdate =      "Fri Jan 24 07:02:52 MST 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/bios/random057/95145899.html",
  abstract =     "'It might be time to change IBM's nickname from Big
                 Blue to Black and Blue,' wrote the New York Times in
                 1993 as the company once revered worldwide as the
                 epitome of management excellence and technological
                 prowess reported losses of \$5.46 billion in just one
                 quarter's trading. Not surprisingly it was forced to
                 make savage cuts in its workforce worldwide, including
                 Britain. Once IBM employees were convinced they had a
                 job for life. Now as Paul Carroll, the Wall Street
                 Journal's IBM specialist, relates, other names in the
                 computer industry --- Apple and Microsoft in particular
                 lead the way. Big Blues is the inside story of why one
                 of the most successful enterprises in business history
                 no longer performs to expectations. Is the phrase ``IBM
                 compatible'' simply history? Or is there a future for
                 Big Blue?.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Computer industry; United States; History; IBM
                 (International Business Machines Corporation)",
}

@Book{Carter:2010:GNW,
  author =       "Miranda Carter",
  title =        "{George}, {Nicholas} and {Wilhelm}: three royal
                 cousins and the road to {World War I}",
  publisher =    "Alfred A. Knopf",
  address =      "New York, NY",
  pages =        "xxv + 498 + 32",
  year =         "2010",
  ISBN =         "1-4000-4363-8 (hardcover), 1-4000-7912-8 (paperback)",
  ISBN-13 =      "978-1-4000-4363-7 (hardcover), 978-1-4000-7912-4
                 (paperback)",
  LCCN =         "D517 .C34 2010",
  bibdate =      "Fri Nov 12 20:09:20 MST 2021",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "In the years before the First World War, the great
                 European powers were ruled by three first cousins: King
                 George V of Britain, Kaiser Wilhelm II of Germany and
                 Tsar Nicholas II of Russia. Together, they presided
                 over the last years of dynastic Europe and the outbreak
                 of the most destructive war the world had ever seen, a
                 war that set twentieth-century Europe on course to be
                 the most violent continent in the history of the world.
                 Miranda Carter uses the cousins' correspondence and a
                 host of historical sources to tell the tragicomic story
                 of a tiny, glittering, solipsistic world that was often
                 preposterously out of kilter with its times, struggling
                 to stay in command of politics and world events as
                 history overtook it. This book is a brilliant and
                 sometimes darkly hilarious portrait of these men:
                 damaged, egotistical Wilhelm; quiet, stubborn Nicholas;
                 and anxious, dutiful George, and their lives, foibles
                 and obsessions, from tantrums to uniforms to stamp
                 collecting. It is also alive with fresh, subtle
                 portraits of other familiar figures: Queen Victoria,
                 grandmother to two of them, grandmother-in-law to the
                 third, whose conservatism and bullying obsession with
                 family left a dangerous legacy; and Edward VII, the
                 playboy arch-vulgarian who turned out to have a
                 remarkable gift for international relations and the
                 theatrics of mass politics. At the same time, Carter
                 weaves through their stories a riveting account of the
                 events that led to World War I, showing how the
                 personal and the political interacted, sometimes to
                 devastating effect. For all three men the war would be
                 a disaster that destroyed forever the illusion of their
                 close family relationships, with any sense of peace and
                 harmony shattered in a final coda of murder, betrayal
                 and abdication.",
  acknowledgement = ack-nhfb,
  author-dates = "1965--",
  remark =       "Originally published as: ``The three emperors: three
                 cousins, three empires and the road to World War One.''
                 London: Fig Tree, 2009.",
  subject =      "William; II; German Emperor; George; V; King of Great
                 Britain; Nicholas; Emperor of Russia; King of Great
                 Britain,; Emperor of Russia,; German Emperor,; German
                 Emperor,; King of Great Britain,; Emperor of Russia,;
                 World War, 1914-1918; Causes; Politics and government;
                 War; Causes; Causes; Germany; History; William II,
                 1888-1918; Great Britain; George V, 1910-1936; Russia;
                 Nicholas II, 1894-1917; Europe; Politics and
                 government; 1871-1918",
  subject-dates = "1859--1941 (Kaiser Wilhelm II); 1865--1936 (King
                 George V); 1868--1918 (Tsar Nicholas II)",
  tableofcontents = "Family trees / ix \\
                 Maps / xiii \\
                 List of Illustrations / xv \\
                 Author's Note / xix \\
                 Introduction / xxi \\
                 Part I: Three childhoods, three countries \\
                 1: Wilhelm: an experiment in perfection, 1859 / 3 \\
                 2: George: coming second, 1865 / 28 \\
                 3: Nicholas: a diamond-studded ivory tower, 1868 / 50
                 \\
                 Part II: Family ties, imperial contests \\
                 4: Wilhelm emperor 1888--90 / 75 \\
                 5: Young men in love 1891--94 / 100 \\
                 6: Wilhelm anglophile 1891--95 / 125 \\
                 7: Perfidious Muscovy 1895--97 / 150 \\
                 8: Behind the wall 1893--1904 / 180 \\
                 9: Imperial imperatives 1898--1901 / 205 \\
                 Part III: A bright new century \\
                 10: The fourth emperor 1901--4 / 235 \\
                 11: Unintended consequences 1904--5 / 260 \\
                 12:Continental shifts 1906--8 / 280 \\
                 13:A Balkan crisis 1908--9 / 306 \\
                 14: Edward's mantle 1910--11 / 321 \\
                 15: Celebrations and warnings 1911--14 / 334 \\
                 16: July 1914 / 357 \\
                 Part IV: Armageddon \\
                 17: A war 1914--18 / 379 \\
                 Epilogue / 415 \\
                 Notes / 427 \\
                 Bibliography / 469 \\
                 Acknowledgements / 479 \\
                 Index / 481",
}

@Book{CAS:19xx:ICD,
  author =       "{Chemical Abstracts Service}",
  title =        "International {CODEN} Directory",
  publisher =    "Chemical Abstracts Service",
  address =      "2540 Olentangy River Road, Columbus, OH, USA",
  year =         "19xx",
  ISSN =         "0364-3670",
  bibdate =      "Fri Jul 30 08:06:48 2004",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "From the publisher's Web site: ``CODEN are unique,
                 six-character codes that identify serial and nonserial
                 publications produced worldwide. CODEN are assigned not
                 only to chemistry-related literature but to
                 publications in all subject areas.''",
  URL =          "http://www.cas.org/PRINTED/coden.html",
  acknowledgement = ack-nhfb,
  remark =       "It appears that this is available only on microfiche.
                 The ACS Style Guide claims that it contains 190,500
                 publication titles and their CODEN values.",
}

@Book{Casselman:2005:MIM,
  author =       "Bill Casselman",
  title =        "Mathematical Illustrations: a Manual of Geometry and
                 {PostScript}",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xviii + 318",
  year =         "2005",
  ISBN =         "0-521-83921-1 (hardcover), 0-521-54788-1 (paperback)",
  ISBN-13 =      "978-0-521-83921-1 (hardcover), 978-0-521-54788-8
                 (paperback)",
  LCCN =         "QA76.73.P67 C37 2004",
  bibdate =      "Sun Sep 18 10:20:38 MDT 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  price =        "US\$39.99 (paperback), US\$90.00 (hardcover)",
  URL =          "ftp://uiarchive.cso.uiuc.edu/pub/etext/gutenberg/;
                 http://www.loc.gov/catdir/description/cam041/2004045886.html;
                 http://www.loc.gov/catdir/samples/cam051/2004045886.html;
                 http://www.loc.gov/catdir/toc/cam041/2004045886.html",
  acknowledgement = ack-nhfb,
  subject =      "PostScript (Computer program language)",
  tableofcontents = "1. Getting started in PostScript \\
                 2. Elementary coordinate geometry \\
                 3. Variables and procedures \\
                 4. Coordinates and conditionals \\
                 5. Drawing polygons: loops and arrays \\
                 6. Curves \\
                 7. Drawing curves automatically: procedures as
                 arguments \\
                 8. Non-linear 2D transformations: deconstructing paths
                 \\
                 9. Recursion in PostScript \\
                 10. Perspective and homogeneous coordinates \\
                 11. Introduction to drawing in three dimensions \\
                 12. Transformations in 3D \\
                 13. PostScript in 3D \\
                 14. Drawing surfaces in 3D \\
                 Appendix 1. Summary of PostScript commands \\
                 Appendix 2. Setting up your PostScript environment \\
                 Appendix 3. Structured PostScript documents \\
                 Appendix 4. Simple text display \\
                 Appendix 5. Zooming \\
                 Appendix 6. Evaluating polynomials: getting along
                 without variables \\
                 Appendix 7. Importing PostScript files \\
                 Epilogue",
}

@Manual{CASSI:1994:CAS,
  title =        "Chemical Abstracts Service Source Index",
  organization = "Chemical Abstracts Service, American Chemical
                 Society",
  address =      "Columbus, OH, USA",
  year =         "1994",
  CODEN =        "CASSI6",
  ISSN =         "0001-0634",
  LCCN =         "QD6.A12A44 S62",
  bibdate =      "Thu Apr 25 07:45:39 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Contains journal full names and abbreviations used in
                 the Chemical Abstracts database, plus ISSN and CODEN
                 values, for 18,656 active serials, 12,230 changed-title
                 serials, 7,486 inactive serials, 16,373 conference
                 proceedings, and 14,239 monographs containing
                 collections of papers.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
}

@Book{Cassidy:2009:BUH,
  author =       "David C. Cassidy",
  title =        "Beyond uncertainty: {Heisenberg}, quantum physics, and
                 the bomb",
  publisher =    "Bellevue Literary Press",
  address =      "New York, NY, USA",
  pages =        "480",
  year =         "2009",
  ISBN =         "1-934137-13-8",
  ISBN-13 =      "978-1-934137-13-0",
  LCCN =         "QC16.W518 C37 2008",
  bibdate =      "Sat Jun 13 08:37:12 MDT 2009",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/bohr-niels.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/g/goudsmit-samuel-a.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/h/heisenberg-werner.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/p/planck-max.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/hsns.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  remark =       "Pages 367--368 describe the capture of Werner
                 Heisenberg on 3 May 1945 in his cabin in Urfeld am
                 Walchensee, about 50km south of Munich, by Colonel
                 Boris T. Pash. Hitler had committed suicide in Berlin
                 on 30 April 1945, and on 7 May 1945, Nazi Germany
                 surrendered, ending World War II in Europe.",
  subject =      "Heisenberg, Werner; physicists; Germany; biography;
                 atomic bomb; 20th Century History",
  tableofcontents = "The early years \\
                 The world at war \\
                 The gymnasium years \\
                 The battle of Munich \\
                 Finding his path \\
                 Sommerfeld's Institute \\
                 Confronting the quantum \\
                 Modeling atoms \\
                 Channeling rivers, challenging causality \\
                 Entering the matrix \\
                 Awash in matrices, rescued by waves \\
                 Determining uncertainty \\
                 Reaching the top \\
                 New frontiers \\
                 Into the abyss \\
                 Social atoms \\
                 Of particles and politics \\
                 Heir apparent \\
                 The lonely years \\
                 A Faustian bargain \\
                 One who could not leave \\
                 The war and its uses \\
                 Visiting Copenhagen \\
                 Ordering reality \\
                 Professor in Berlin \\
                 Return to the matrix \\
                 One last attempt \\
                 Explaining the project, Farm Hall \\
                 Explaining the project, the world \\
                 The later years",
}

@TechReport{Castaneda:1979:PTP,
  author =       "Fernando Castaneda and Frederick Chow and Peter Nye
                 and Dan Sleator and Gio Wiederhold",
  title =        "{PCFORT} --- a {For\-tran-to-Pcode} Translator",
  type =         "Technical Report",
  number =       "{STAN-CS-79-714}",
  institution =  inst-STAN-CS,
  address =      inst-STAN-CS:adr,
  pages =        "vi + 85",
  month =        jan,
  year =         "1979",
  bibdate =      "Sun Oct 12 09:17:11 1997",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/w/wirth-niklaus.bib;
                 https://www.math.utah.edu/pub/tex/bib/fortran1.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://i.stanford.edu/pub/cstr/reports/cs/tr/79/714/CS-TR-79-714.pdf",
  abstract =     "PCFORT is a compiler for the FORTRAN language designed
                 to fit as a building block into a PASCAL oriented
                 environment. It forms part of the programming systems
                 being developed for the S-1 multiprocessor. It is
                 written in PASCAL, and generates P-code, an
                 intermediate language used by transportable PASCAL
                 compilers to represent the program in a simple form.
                 P-code is either compiled or interpreted depending upon
                 the objectives of the programming system.

                 A PASCAL written FORTRAN compiler provides a bridge
                 between the FORTRAN and PASCAL communities. The
                 implementation allows PASCAL and FORTRAN generated code
                 to be combined into one program. The FORTRAN language
                 supported here is FORTRAN to the full 1966 standard,
                 extended with those features commonly expected by
                 available large scientific programs.",
  acknowledgement = ack-nhfb,
  keywords =     "compiler; FORTRAN; P-code; PASCAL; S-1; translator",
}

@Book{Castleman:1979:DIP,
  author =       "Kenneth R. Castleman",
  title =        "Digital Image Processing",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xvi + 429",
  year =         "1979",
  ISBN =         "0-13-212365-7",
  ISBN-13 =      "978-0-13-212365-5",
  LCCN =         "TA1632 .C3 1979",
  bibdate =      "Fri Jul 22 08:29:04 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Images and Digital Processing \\
                 Digitizing Images \\
                 Digital Image Display \\
                 Image-Processing Software \\
                 The Gray-Level Histogram \\
                 Point Operations \\
                 Algebraic Operations \\
                 Geometric Operations \\
                 Linear Systems Theory \\
                 The Fourier Transform \\
                 Filter Design \\
                 Processing Sampled Data \\
                 Discrete Image Transforms \\
                 Wavelet Transforms \\
                 Optics and System Analysis \\
                 Image Restoration \\
                 Image Compression \\
                 Pattern Recognition: Image Segmentation \\
                 Pattern Recognition: Object Measurement \\
                 Pattern Recognition: Classification and Estimation \\
                 Color and Multispectral Image Processing \\
                 Three-Dimensional Image Processing \\
                 Appendices \\
                 Glossary of Image Processing Terms \\
                 Bibliography \\
                 Mathematical Background \\
                 Index",
}

@Book{Cathcart:2004:FCH,
  author =       "Brian Cathcart",
  title =        "The fly in the cathedral: how a group of {Cambridge}
                 scientists won the international race to split the
                 atom",
  publisher =    pub-FARRAR,
  address =      pub-FARRAR:adr,
  pages =        "xii + 308 + 4",
  year =         "2004",
  ISBN =         "0-374-15716-2 (hardcover)",
  ISBN-13 =      "978-0-374-15716-6 (hardcover)",
  LCCN =         "Q141 .C2515 2004",
  bibdate =      "Sat Aug 31 14:20:41 MDT 2013",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/r/rutherford-ernest.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Re-creating the frustrations, excitement, and
                 obsessions of 1932, the ``miracle year'' of British
                 physics, Brian Cathcart reveals in rich detail the
                 astonishing story behind the splitting of the atom. The
                 most celebrated scientific experiment of its time, it
                 would help open the way toward one of mankind's most
                 devastating inventions --- the atomic bomb.",
  subject =      "Rutherford, Ernest; Walton, Ernest; Scientists;
                 England; Cambridge; Biography; Science; History;
                 Nuclear fission; Radioactivity",
  subject-dates = "1871--1937; 1903--1995",
  tableofcontents = "List of illustrations / vii \\
                 Foreword / xi \\
                 Prelude: Manchester, 1909 \\
                 Cavendish / 9 \\
                 `Mollycewels an' atoms' / 20 \\
                 Method / 36 \\
                 A way forward / 49 \\
                 A man in white trousers / 66 \\
                 A finite probability / 85 \\
                 Hardware / 101 \\
                 Lab life / 112 \\
                 Other ideas / 131 \\
                 Turning point / 152 \\
                 Off to the races / 176 \\
                 Timeliness and promise / 201 \\
                 Red letter day / 223 \\
                 Still safe / 244 \\
                 Nobel / 261 \\
                 Postscript / 272 \\
                 Notes / 275 \\
                 Acknowledgements / 290 \\
                 Bibliography / 293 \\
                 Index / 299",
}

@Book{Catmull:2014:CIO,
  author =       "Edwin E. Catmull and Amy Wallace",
  title =        "{Creativity, Inc.}: overcoming the unseen forces that
                 stand in the way of true inspiration",
  publisher =    pub-RANDOM-HOUSE,
  address =      pub-RANDOM-HOUSE:adr,
  pages =        "xvi + 340 + 8",
  year =         "2014",
  ISBN =         "0-8129-9301-2 (hardcover), 0-679-64450-4 (e-book)",
  ISBN-13 =      "978-0-8129-9301-1 (hardcover), 978-0-679-64450-7
                 (e-book)",
  LCCN =         "HD53 .C394 2014",
  bibdate =      "Fri Jun 6 06:53:14 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "In 1986, Ed Catmull co-founded Pixar, a modest
                 start-up with an immodest goal: to make the first-ever
                 computer animated movie. Nine years later, Pixar
                 released Toy Story, which went on to revolutionize the
                 industry, gross \$360 million, and establish Pixar as
                 one of the most successful, innovative, and emulated
                 companies on earth. This book details how Catmull built
                 an enduring creative culture --- one that doesn't just
                 pay lip service to the importance of things like
                 honesty, communication, and originality, but committed
                 to them, no matter how difficult that often proved to
                 be. As he discovered, pursuing excellence isn't a
                 one-off assignment. It's an ongoing, day-in, day-out,
                 full-time job. And one he was born to do.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "creative ability in business; corporate culture;
                 organizational effectiveness; business and economics /
                 leadership; biography and autobiography / business;
                 performing arts / film and video / direction and
                 production",
  tableofcontents = "Introduction: Lost and found \\
                 Getting started \\
                 Animated \\
                 Pixar is born \\
                 A defining goal \\
                 Establishing Pixar's identity \\
                 Protecting the new \\
                 Honesty and candor \\
                 Fear and failure \\
                 The hungry beast and the ugly baby \\
                 Change and randomness \\
                 The hidden \\
                 Building and sustaining \\
                 Broadening our view \\
                 The unmade future \\
                 Testing what we know \\
                 A new challenge \\
                 Notes day \\
                 Afterword: The Steve we knew \\
                 Starting points: Thoughts for managing a creative
                 culture",
}

@Book{Ceruzzi:1998:HMC,
  author =       "Paul E. Ceruzzi",
  title =        "A History of Modern Computing",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "x + 398",
  year =         "1998",
  ISBN =         "0-262-03255-4",
  ISBN-13 =      "978-0-262-03255-1",
  LCCN =         "QA76.17 .C47 1998",
  bibdate =      "Sat Apr 27 14:53:21 MDT 2024",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  series =       "History of computing",
  abstract =     "This engaging history covers modern computing from the
                 development of the first electronic digital computer
                 through the advent of the World Wide Web. The author
                 concentrates on four key moments of transition: the
                 transformation of the computer in the late 1940s from a
                 specialized scientific instrument to a commercial
                 product; the emergence of small systems in the late
                 1960s; the beginnings of personal computing in the
                 1970s; and the spread of networking after 1985.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "Computer; Datenverarbeitung",
  tableofcontents = "Introduction: Defining ``Computer'' \\
                 1: The Advent of Commercial Computing, 1945--1956 \\
                 2: Computing Comes of Age, 1956--1964 \\
                 3: The Early History of Software, 1952--1968 \\
                 4: From Mainframe to Minicomputer, 1959--1969 \\
                 5: The Go-Go Years and the System/360, 1961--1975 \\
                 6: The Chip and Its Impact, 1965--1975 \\
                 7: The Personal Computer, 1972--1977 \\
                 8: Augmenting Human Intellect, 1975--1985 \\
                 9: Workstations, UNIX, and the Net, 1981--1995 \\
                 Conclusion: The Digitization of the World Picture",
}

@Book{Ceruzzi:2003:HMC,
  author =       "Paul E. Ceruzzi",
  title =        "A History of Modern Computing",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  edition =      "Second",
  pages =        "xi + 445",
  year =         "2003",
  ISBN =         "0-262-53203-4 (paperback)",
  ISBN-13 =      "978-0-262-53203-7 (paperback)",
  LCCN =         "QA76.17.C47 2003",
  bibdate =      "Sat Apr 27 15:03:11 MDT 2024",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/linux.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  series =       "History of computing",
  abstract =     "This book covers modern computing from the development
                 of the first electronic digital computer through the
                 dot-com crash. The author concentrates on five key
                 moments of transition: the transformation of the
                 computer in the late 1940s from a specialized
                 scientific instrument to a commercial product; the
                 emergence of small systems in the late 1960s; the
                 beginning of personal computing in the 1970s; the
                 spread of networking after 1985; and, in a chapter
                 written for this edition, the period 1995-2001. The new
                 material focuses on the Microsoft antitrust suit, the
                 rise and fall of the dot-coms, and the advent of open
                 source software, particularly Linux. Within the
                 chronological narrative, the book traces several
                 overlapping threads: the evolution of the computer's
                 internal design; the effect of economic trends and the
                 Cold War; the long-term role of IBM as a player and as
                 a target for upstart entrepreneurs; the growth of
                 software from a hidden element to a major character in
                 the story of computing; and the recurring issue of the
                 place of information and computing in a democratic
                 society. The focus is on the United States (though
                 Europe and Japan enter the story at crucial points), on
                 computing per se rather than on applications such as
                 artificial intelligence, and on systems that were sold
                 commercially and installed in quantities.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "Introduction: Defining ``Computer'' \\
                 1: The Advent of Commercial Computing, 1945--1956 \\
                 2: Computing Comes of Age, 1956--1964 \\
                 3: The Early History of Software, 1952--1968 \\
                 4: From Mainframe to Minicomputer, 1959--1969 \\
                 5: The ``Go-Go'' Years and the System/360, 1961--1975
                 \\
                 6: The Chip and Its Impact, 1965--1975 \\
                 7: The Personal Computer, 1972--1977 \\
                 8: Augmenting Human Intellect, 1975--1985 \\
                 9: Workstations, UNIX, and the Net, 1981--1995 \\
                 10: ``Internet Time,'' 1995--2001 \\
                 Conclusion: The Digitization of the World Picture",
}

@Article{Cesareo:1946:RI,
  author =       "O. Cesareo",
  title =        "The Relay Interpolator",
  journal =      j-BELL-LABS-RECORD,
  volume =       "23",
  number =       "??",
  pages =        "457--460",
  year =         "1946",
  CODEN =        "BLRCAB",
  ISSN =         "0005-8564",
  bibdate =      "Wed Oct 13 11:31:47 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Reprinted in \cite[\S 6.2]{Randell:1982:ODC}.",
  acknowledgement = ack-nhfb,
}

@PhdThesis{Cetron:1991:CRA,
  author =       "Edward J. Cetron",
  title =        "Complexity Reduction for Analysis and Visualization of
                 Textured Electrostatic Fields",
  school =       "Department of Bioengineering, University of Utah",
  address =      "Salt Lake City, UT, USA",
  pages =        "xiii + 124",
  month =        jun,
  year =         "1991",
  bibdate =      "Sat Apr 27 07:56:07 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Chabert:1999:HAH,
  editor =       "Jean-Luc Chabert and {\'E}velyne Barbin and Jacques
                 Borowczyk and Michel Guillemot and Anne Michel-Pajus
                 and Ahmed Djebbar and Jean-Claude Martzloff",
  title =        "A history of algorithms: from the pebble to the
                 microchip",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "ix + 524",
  year =         "1999",
  ISBN =         "3-540-63369-3 (softcover)",
  ISBN-13 =      "978-3-540-63369-3 (softcover)",
  LCCN =         "QA58 .H5813 1998",
  bibdate =      "Mon Dec 31 17:29:07 MST 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.springer.com/west/home/math/cse?SGWID=4-10045-22-1455224-0",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  remark =       "Translated from the French original ``Histoire
                 d'algorithmes. Du caillou {\`a} la puce'' (1994) by
                 Chris Weeks.",
  subject =      "algorithms; history",
  tableofcontents = "Introduction 1 \\
                 1 Algorithms for Arithmetic Operations 7 \\
                 1.1 Sumerian Division 8 \\
                 1.2 A Babylonian Algorithm for Calculating Inverses 11
                 \\
                 1.3 Egyptian Algorithms for Arithmetic 15 \\
                 1.4 Tableau Multiplication 20 \\
                 1.5 Optimising Calculations 28 \\
                 1.6 Simple Division by Difference on a Counting Board
                 30 \\
                 1.7 Division on the Chinese Abacus 35 \\
                 1.8 Numbers Written as Decimals 37 \\
                 1.9 Binary Arithmetic 40 \\
                 1.10 Computer Arithmetic 43 \\
                 Bibliography 46 \\
                 2 Magic Squares 49 \\
                 2.1 Squares with Borders 53 \\
                 2.2 The Marking Cells Method 58 \\
                 2.3 Proceeding by 2 and by 3 64 \\
                 2.4 Arnauld's Borders Method 70 \\
                 Bibliography 81 \\
                 3 Methods of False Position 83 \\
                 3.1 Mesopotamia: a Geometric False Position 86 \\
                 3.2 Egypt: Problem 26 of the Rhind Papyrus 88 \\
                 3.3 China: Chapter VII of the Jiuzhang Suanshu 91 \\
                 3.4 India: Bhaskara and the Rule of Simple False
                 Position 96 \\
                 3.5 Qusta Ibn Luqa: A Geometric Justification 98 \\
                 3.6 Ibn al-Banna: The Method of the Scales 101 \\
                 3.7 Fibonacci: the Elchatayn rule 103 \\
                 3.8 Pellos: The Rule of Three and The Method of Simple
                 False Position 106 \\
                 3.9 Clavius: Solving a System of Equations 107 \\
                 Bibliography 111 \\
                 4 Euclid's Algorithm 113 \\
                 4.1 Euclid's Algorithm 113 \\
                 4.2 Comparing Ratios 118 \\
                 4.3 B{\'e}zout's Identity 122 \\
                 4.4 Continued Fractions 126 \\
                 4.5 The Number of Roots of an Equation 132 \\
                 Bibliography 136 \\
                 5 From Measuring the Circle to Calculating 139 \\
                 Geometric Approaches 140 \\
                 5.1 The Circumference of the Circle 140 \\
                 5.2 The Area of the Circle in the Jiuzhang Suanshu 146
                 \\
                 5.3 The Method of Isoperimeters 152 \\
                 Analytic Approaches 156 \\
                 5.4 Arithmetic Quadrature 156 \\
                 5.5 Using Series 161 \\
                 5.6 Epilogue 164 \\
                 Bibliography 166 \\
                 6 Newton's Methods 169 \\
                 The Tangent Method 170 \\
                 6.1 Straight Line Approximations 170 \\
                 6.2 Recurrence Formulas 175 \\
                 6.3 Initial Conditions 178 \\
                 6.4 Measure of Convergence 183 \\
                 6.5 Complex Roots 188 \\
                 Newton's Polygon 191 \\
                 6.6 The Ruler and Small Parallelograms 191 \\
                 Bibliography 196 \\
                 7 Solving Equations by Successive Approximations 199
                 \\
                 Extraction of Square Roots 200 \\
                 7.1 The Method of Heron of Alexandria 202 \\
                 7.2 The Method of Theon of Alexandria 203 \\
                 7.3 Mediaeval Binomial Algorithms 205 \\
                 Numerical Solutions of Equations 208 \\
                 7.4 Al-Tusi's Tables 208 \\
                 7.5 Vi{\`e}te's Method 213 \\
                 7.6 Kepler's Equation 219 \\
                 7.7 Bernoulli's Method of Recurrent Series 223 \\
                 7.8 Approximation by Continued Fractions 227 \\
                 Horner like Transformations of Polynomial Equations 230
                 \\
                 7.9 The Ruffini-Budan Schema 230 \\
                 Bibliography 236 \\
                 8 Algorithms in Arithmetic 239 \\
                 Factors and Multiples 240 \\
                 8.1 The Sieve of Eratosthenes 241 \\
                 8.2 Criteria For Divisibility 243 \\
                 8.3 Quadratic Residues 248 \\
                 Tests for Primality 251 \\
                 8.4 The Converse of Fermat's Theorem 252 \\
                 8.5 The Lucas Test 256 \\
                 8.6 P{\'e}pin's Test 260 \\
                 Factorisation Algorithms 263 \\
                 8.7 Factorisation by the Difference of Two Squares 264
                 \\
                 8.8 Factorisation by Quadratic Residues 267 \\
                 8.9 Factorisation by Continued Fractions 269 \\
                 The Pell-Fermat Equation 272 \\
                 8.10 The Arithmetica of Diophantus 273 \\
                 8.11 The Lagrange Result 275 \\
                 Bibliography 280 \\
                 9 Solving Systems of Linear Equations 283 \\
                 9.1 Cramer's Rule 284 \\
                 9.2 The Method of Least Squares 287 \\
                 9.3 The Gauss Pivot Method 291 \\
                 9.4 A Gauss Iterative Method 296 \\
                 9.5 Jacobi's Method 300 \\
                 9.6 Seidel's Method 302 \\
                 9.7 Nekrasov and the Rate of Convergence 306 \\
                 9.8 Cholesky's Method 310 \\
                 9.9 Epilogue 314 \\
                 Bibliography 315 \\
                 10 Tables and Interpolation 319 \\
                 10.1 Ptolemy's Chord Tables 321 \\
                 10.2 Briggs and Decimal Logarithms 328 \\
                 10.3 The Gregory-Newton Formula 332 \\
                 10.4 Newton's Interpolation Polynomial 336 \\
                 10.5 The Lagrange Interpolation Polynomial 340 \\
                 10.6 An Error Upper Bound 345 \\
                 10.7 Neville's Algorithm 347 \\
                 Bibliography 350 \\
                 11 Approximate Quadratures 353 \\
                 11.1 Gregory's Formula 354 \\
                 11.2 Newton's Three-Eighths Rule 356 \\
                 11.3 The Newton--Cotes Formulas 357 \\
                 11.4 Stirling's Correction Formulas 359 \\
                 11.5 Simpson's Rule 362 \\
                 11.6 The Gauss Quadrature Formulas 363 \\
                 11.7 Chebyshev's Choice 367 \\
                 11.8 Epilogue 369 \\
                 Bibliography 370 \\
                 12 Approximate Solutions of Differential Equations 373
                 \\
                 12.1 Euler's Method 374 \\
                 12.2 The Existence of a Solution 378 \\
                 12.3 Runge's Methods 381 \\
                 12.4 Heun's Methods 388 \\
                 12.5 Kutta's Methods 392 \\
                 12.6 John Adams and the Use of Finite Differences 396
                 \\
                 12.7 Epilogue 401 \\
                 Bibliography 402 \\
                 13 Approximation of Functions 405 \\
                 Uniform Approximation 407 \\
                 13.1 Taylor's Formula 407 \\
                 13.2 The Lagrange Remainder 409 \\
                 13.3 Chebyshev's Polynomial of Best Approximation 412
                 \\
                 13.4 Spline-Fitting 418 \\
                 Mean Quadratic Approximation 420 \\
                 13.5 Fourier Series 422 \\
                 13.6 The Fast Fourier Transform 424 \\
                 Bibliography 427 \\
                 14 Acceleration of Convergence 429 \\
                 14.1 Stirling's Method for Series 430 \\
                 14.2 The Euler--Maclaurin Summation Formula 434 \\
                 14.3 The Euler Constant 439 \\
                 14.4 Aitken's Method 443 \\
                 14.5 Richardson's Extrapolation Method 447 \\
                 14.6 Romberg's Integration Method 451 \\
                 Bibliography 453 \\
                 15 Towards the Concept of Algorithm 455 \\
                 Recursive Functions and Computable Functions 458 \\
                 15.1 The 1931 Definition 458 \\
                 15.2 General G{\"o}del Recursive Functions 460 \\
                 15.3 Alonzo Church and Effective Calculability 462 \\
                 15.4 Recursive Functions in the Kleene Sense 466 \\
                 Machines 468 \\
                 15.5 The Turing Machine 468 \\
                 15.6 Post's Machine 474 \\
                 15.7 Conclusion 479 \\
                 Bibliography 480 \\
                 Biographies 481 \\
                 General Index 517 \\
                 Index of Names 521",
}

@Book{Chambers:CSF58-1,
  editor =       "James Pryde",
  title =        "{Chambers}'s Seven-Figure Mathematical Tables",
  volume =       "1",
  publisher =    pub-W-R-CHAMBERS,
  address =      pub-W-R-CHAMBERS:adr,
  pages =        "392",
  year =         "1958",
  LCCN =         "QA47 .P7 1958",
  bibdate =      "Tue May 12 07:43:03 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Chambers:CSF58-2,
  editor =       "James Pryde",
  title =        "{Chambers}'s Seven-Figure Mathematical Tables",
  volume =       "2",
  publisher =    pub-W-R-CHAMBERS,
  address =      pub-W-R-CHAMBERS:adr,
  year =         "1958",
  LCCN =         "QA47 .P7 1958",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Chan:1998:JCLb,
  author =       "Patrick Chan and Rosanna Lee",
  title =        "The {Java} Class Libraries: {\tt java.applet}, {\tt
                 java.awt}, {\tt java.beans}",
  volume =       "2",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Second",
  pages =        "xxix + 1682",
  year =         "1998",
  ISBN =         "0-201-31003-1",
  ISBN-13 =      "978-0-201-31003-0",
  LCCN =         "QA76.73.J38C47 1998",
  bibdate =      "Mon Jun 10 13:33:36 2002",
  bibsource =    "http://www.aw.com/;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$54.95",
  URL =          "http://cseng.aw.com/bookdetail.qry?ISBN=0-201-31003-1;
                 http://www2.awl.com/cgi-bin/htsearch?restrict=&exclude=&config=htdig&method=boolean&format=builtin%2Dlong&words=Chan%20AND%20Lee&page=2",
  acknowledgement = ack-nhfb,
  annote =       "See \cite{Chan:1999:JCLb} for vol. 1.",
}

@Book{Chan:1999:JCLb,
  author =       "Patrick Chan and Rosanna Lee and Doug Kramer",
  title =        "The {Java} Class Libraries: {\tt java.io}, {\tt
                 java.lang}, {\tt java.math}, {\tt java.net}, {\tt
                 java.text}, {\tt java.util}",
  volume =       "1",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Second",
  pages =        "xxvi + 2050",
  year =         "1999",
  ISBN =         "0-201-31002-3",
  ISBN-13 =      "978-0-201-31002-3",
  LCCN =         "QA76.73.J38 C47 1998",
  bibdate =      "Mon Jun 10 13:32:26 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$59.99",
  abstract =     "This book is intended as a reference rather than a
                 tutorial. Its format is similar to a dictionary's in
                 that it is designed to optimize the time it takes for
                 you to look up information on a class or class
                 member.",
  acknowledgement = ack-nhfb,
  annote =       "See \cite{Chan:1998:JCLb} for vol. 2.",
}

@Book{Chan:1999:JCLc,
  author =       "Patrick Chan and Rosanna Lee and Douglas Kramer",
  title =        "The {Java} Class Libraries, Second Edition, Volume 1:
                 Supplement for {Java 2} Platform, Standard Edition,
                 v1.2",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xxix + 1157",
  year =         "1999",
  ISBN =         "0-201-48552-4",
  ISBN-13 =      "978-0-201-48552-3",
  LCCN =         "QA76.73.J38 C47 1998",
  bibdate =      "Sat May 11 09:29:34 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 http://www1.fatbrain.com/asp/bookinfo/bookinfo.asp?theisbn=0201485524",
  price =        "US\$34.95",
  acknowledgement = ack-nhfb,
}

@Book{Chanda:2018:NPR,
  author =       "Abhishek Chanda",
  title =        "Network Programming {Rust}: Build Fast and Resilient
                 Network Servers and Clients by Leveraging {Rust}'s
                 Memory-safety and Concurrency Features",
  publisher =    pub-PACKT,
  address =      pub-PACKT:adr,
  pages =        "iii + 265",
  year =         "2018",
  ISBN =         "1-78862-171-9 (e-book), 1-78862-489-0 (paperback)",
  ISBN-13 =      "978-1-78862-171-7 (e-book), 978-1-78862-489-3
                 (paperback)",
  LCCN =         "QA76.73.R88",
  bibdate =      "Tue Dec 10 06:07:22 MST 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://proquest.safaribooksonline.com/?fpi=9781788624893",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Rust (Computer program language); Programming
                 languages (Electronic computers); Computer programming;
                 Computer programming.; Programming languages
                 (Electronic computers); Rust (Computer program
                 language)",
  tableofcontents = "Preface \\
                 1: Introduction to Client/Server Networking \\
                 A brief history of networks \\
                 Layering in networks \\
                 Addressing in networks \\
                 How IP routing works \\
                 How DNS works \\
                 Common service models \\
                 Connection-oriented service \\
                 Connectionless service \\
                 The network programming interface in Linux \\
                 Summary \\
                 2: Introduction to Rust and its Ecosystem \\
                 The Rust ecosystem \\
                 Getting started with Rust \\
                 Introduction to the borrow checker \\
                 Generics and the trait system \\
                 Error handling \\
                 The macro system \\
                 Syntactic macros \\
                 Procedural macros \\
                 Functional features in Rust \\
                 Higher-order functions \\
                 Iterators \\
                 Concurrency primitives \\
                 Testing \\
                 Summary \\
                 3: TCP and UDP Using Rust \\
                 A Simple TCP server and client \\
                 A Simple UDP server and client \\
                 UDP multicasting \\
                 Miscellaneous utilities in std::net \\
                 Some related crates \\
                 Summary \\
                 4: Data Serialization, Deserialization, and Parsing \\
                 Serialization and deserialization using Serde \\
                 Custom serialization and deserialization \\
                 Parsing textual data \\
                 Parsing binary data \\
                 Summary \\
                 5: Application Layer Protocols \\
                 Introduction to RPC \\
                 Introduction to SMTP \\
                 Introduction to FTP and TFTP \\
                 Summary \\
                 6: Talking HTTP in the Internet \\
                 Introducing Hyper \\
                 Introducing Rocket \\
                 Introducing reqwest \\
                 Summary \\
                 7: Asynchronous Network Programming Using Tokio \\
                 Looking into the Future \\
                 Working with streams and sinks \\
                 Heading to tokio \\
                 Socket multiplexing in tokio \\
                 Writing streaming protocols \\
                 The larger tokio ecosystem \\
                 Conclusion \\
                 8: Security \\
                 Securing the web \\
                 Letsencrypt using Rust \\
                 OpenSSL using Rust \\
                 Securing tokio applications \\
                 Cryptography using ring \\
                 Summary \\
                 9: Appendix \\
                 Introduction to coroutines and generators \\
                 How May handles coroutines \\
                 Awaiting the future \\
                 Data parallelism \\
                 Parsing using Pest \\
                 Miscellaneous utilities \\
                 Summary \\
                 Other Books You May Enjoy \\
                 Index",
}

@Book{Char:1989:FLM,
  author =       "Bruce W. Char and others",
  title =        "First leaves for the Macintosh: a tutorial
                 introduction to Maple",
  publisher =    pub-BROOKS-COLE,
  address =      pub-BROOKS-COLE:adr,
  pages =        "xv + 140",
  year =         "1989",
  ISBN =         "0-534-10222-0",
  ISBN-13 =      "978-0-534-10222-7",
  LCCN =         "QA155.7.E4 F57 1989",
  bibdate =      "Wed Nov 01 08:21:24 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

@Book{Char:1991:MLVb,
  author =       "Bruce W. Char and Keith O. Geddes and Gaston H. Gonnet
                 and Benton Leong and Michael B. Monagan and Stephen M.
                 Watt",
  title =        "{Maple Library V} Reference Manual",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xxv + 698",
  year =         "1991",
  DOI =          "https://doi.org/10.1007/978-1-4757-2133-1",
  ISBN =         "0-387-97592-6, 3-540-97592-6",
  ISBN-13 =      "978-0-387-97592-4, 978-3-540-97592-2",
  LCCN =         "QA155.7.E4 M353 1991",
  bibdate =      "Fri Jul 08 19:01:01 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/maple-extract.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook2.bib",
  abstract =     "The design and implementation of the Maple system is
                 an on-going project of the Symbolic Computation Group
                 at the University of Waterloo in Ontario, Canada. This
                 manual corresponds with version V (roman numeral five)
                 of the Maple system. The on-line help subsystem can be
                 invoked from within a Maple session to view
                 documentation on specific topics. In particular, the
                 command ``?updates'' points the user to documentation
                 updates for each new version of Maple. The Maple
                 project was first conceived in the autumn of 1980,
                 growing out of discussions on the state of symbolic
                 computation at the University of Waterloo. The authors
                 wish to acknowledge many fruitful discussions with
                 colleagues at the University of Waterloo, particularly
                 Morven Gentleman, Michael Malcolm, and Frank Tompa. It
                 was recognized in these discussions that none of the
                 locally-available systems for symbolic computation
                 provided the facilities that should be expected for
                 symbolic computation in modern computing environments.
                 We concluded that since the basic design decisions for
                 the then-current symbolic systems such as ALTRAN,
                 CAMAL, REDUCE, and MACSYMA were based on 1960's
                 computing technology, it would be wise to design a new
                 system ``from scratch''. Thus we could take advantage
                 of the software engineering technology which had become
                 available in recent years, as well as drawing from the
                 lessons of experience. Maple's basic features
                 (elementary data structures, Input\slash output,
                 arithmetic with numbers, and elementary simplification)
                 are coded in a systems programming language for
                 efficiency.",
  acknowledgement = ack-nhfb,
  tableofcontents = "The Maple Library \\
                 Main routines \\
                 Packages \\
                 Packages for discrete mathematics \\
                 Packages for applied mathematics \\
                 Packages for geometry \\
                 Miscellaneous packages",
}

@Book{Char:1991:MVLa,
  author =       "Bruce W. Char and Keith O. Geddes and Gaston H. Gonnet
                 and Benton Leong and Michael B. Monagan and Stephen M.
                 Watt",
  title =        "{Maple V}: Language Reference Manual",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xv + 267",
  year =         "1991",
  DOI =          "https://doi.org/10.1007/978-1-4615-7386-9",
  ISBN =         "0-387-97622-1 (New York), 3-540-97622-1 (Berlin)",
  ISBN-13 =      "978-0-387-97622-8 (New York), 978-3-540-97622-6
                 (Berlin)",
  LCCN =         "QA155.7.E4 M36 1991",
  bibdate =      "Wed Dec 1 12:17:05 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/maple-extract.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook2.bib",
  price =        "US\$24.95, FF 193,00",
  abstract =     "This book describes the Maple Symbolic Computation
                 System and the Maple V language. It describes the
                 numeric and symbolic expressions that can be used in
                 Maple V. All the basic data types, such as names,
                 polynomials, and functions, as well as structured data
                 types, are covered. The book also gives a complete
                 description of the programming language statements that
                 are provided in the Maple V system and shows how a user
                 can extend the functionality of the Maple V system by
                 adding user-defined routines. The manual also provides
                 a complete description of the Maple V system, including
                 its 2D and 3D graphics. Maple V features a newly
                 designed user interface on many systems. Separate
                 appendices describe how to use Maple V on systems using
                 the X Window System, DOS, and the Macintosh.",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "Language elements \\
                 Statements and expressions \\
                 Data types \\
                 Type testing \\
                 Arrays and tables \\
                 Procedures \\
                 Operators \\
                 Internal representation and manipulation \\
                 Plotting \\
                 Miscellaneous facilities \\
                 Overview of the Maple Library \\
                 A. Maple under UNIX \\
                 B. Using Maple with X \\
                 C. Maple under DOS",
  tableofcontents = "1 Introduction \\
                 1.1 Some General Examples \\
                 1.2 Numbers \\
                 1.3 Examples from Calculus \\
                 1.4 Data Structures \\
                 1.5 Examples from Linear Algebra \\
                 1.6 Equation Solving \\
                 1.7 Output and Programming \\
                 2 Language Elements \\
                 2.1 Character Set \\
                 2.2 Tokens \\
                 2.3 Escape Characters \\
                 2.4 Blanks, Lines, Comments, and Continuation \\
                 2.5 Files \\
                 3 Statements and Expressions \\
                 3.1 Types of Statements \\
                 3.2 Expressions \\
                 3.3 Formal Syntax \\
                 4 Data Types \\
                 4.1 Basic Data Types \\
                 4.2 Map, Subs, and Subsop \\
                 5 Type Testing \\
                 5.1 Definition of a Type in Maple \\
                 5.2 Simple Types \\
                 5.3 Structured Types \\
                 5.4 Surface and Nested Types \\
                 5.5 Simplification of Types \\
                 5.6 Parameter Type Testing \\
                 5.7 Undesirable Simplifications and Evaluations of
                 Types \\
                 5.8 Type Testing Versus Pattern Matching \\
                 6 Arrays and Tables \\
                 6.1 Overview \\
                 6.2 Creating Tables \\
                 6.3 Evaluation Rules for Tables and Table Components
                 \\
                 6.4 Tables as Objects \\
                 6.5 Indexing Functions \\
                 7 Procedures \\
                 7.1 Procedure Definitions \\
                 7.2 Parameter Passing \\
                 7.3 Local Variables \\
                 7.4 Options \\
                 7.5 Remember Tables \\
                 7.6 Assigning Values to Parameters \\
                 7.7 Error Returns and Explicit Returns \\
                 7.8 Simplification and Returning Unevaluated \\
                 7.9 Boolean Procedures \\
                 7.10 Reading and Saving Procedures \\
                 8 Operators \\
                 8.1 Operator Definition \\
                 8.2 Syntactic Definition \\
                 8.3 Semantic Definition \\
                 8.3.1 Application Versus Composition \\
                 8.4 Partial Definition of Operators \\
                 8.5 Example: The Differentiation Operator D \\
                 9 Internal Representation and Manipulation \\
                 9.1 Internal Organization \\
                 9.2 Internal Representation of Data Types \\
                 9.3 The Use of Hashing in Maple \\
                 9.4 Portability of the Maple System \\
                 10 Plotting \\
                 10.1 Introduction \\
                 10.2 Plots in 2D \\
                 10.3 Plots in 3D \\
                 10.4 Saving Plots \\
                 10.5 Plots Package \\
                 10.6 Examples \\
                 11 Miscellaneous Facilities \\
                 11.1 Debugging Facilities: Detecting Syntax Errors \\
                 11.2 Debugging Facilities: Monitoring Run-Time
                 Execution \\
                 11.3 Alias and Macro \\
                 11.4 Monitoring Space and Time \\
                 11.5 Global Variables \\
                 11.6 User Interface Variables \\
                 11.7 Maple Command Line Options \\
                 11.8 Other Facilities \\
                 12 Overview of the Maple Library \\
                 12.1 Introduction \\
                 12.2 Description of the Maple Library \\
                 12.3 Format of Library Function Descriptions \\
                 12.4 Printing Maple Help Files \\
                 12.5 Library Index \\
                 A Maple under UNIX \\
                 A.1 Introduction \\
                 A.2 Maple Initialization Files \\
                 A.3 Quit and Interrupt Characters \\
                 A.4 Temporarily Escaping from Maple \\
                 A.5 Redirection of Input and Output \\
                 A.6 Maple Command Line Options for UNIX \\
                 A.6.1 Overview of Maple command line options \\
                 A.6.2 Library Specification Option: -b \\
                 A.6.3 Suppress Initialization Option: -s \\
                 A.6.4 Quiet Option: -q \\
                 A.7 Mint \\
                 A.8 Summary of Site- and UNIX- Dependent Aspects of
                 Maple \\
                 B Using Maple with X \\
                 B.1 Introduction \\
                 B.2 Getting Started \\
                 B.3 Entering Commands in Maple \\
                 B.4 Editing \\
                 B.5 Maple Input and Output Cells \\
                 B.6 Including and Saving Text \\
                 B.7 Searching \\
                 B.8 Resource Usage \\
                 B.9 Interrupt, Pause and Quit Buttons \\
                 B.10 Resizing Windows \\
                 B.11 Help Windows \\
                 B.12 2D Plot Windows \\
                 B.13 3D Plot Windows \\
                 B.14 Customizing Maple Under X \\
                 B.15 Tips \\
                 B.16 Troubleshooting \\
                 B.17 Information for Xperts \\
                 C Maple under DOS \\
                 C.1 Introduction \\
                 C.2 Using Maple V \\
                 C.2.1 Exiting Maple \\
                 C.2.2 The Status Line \\
                 C.2.3 The Command Line Editor \\
                 C.2.4 Expression Editing \\
                 C.2.5 File Editing \\
                 C.2.6 Accessing Maple Help \\
                 C.2.7 Session Review Mode \\
                 C.2.8 Using the Menu \\
                 C.2.9 Input/Output Capture Mode \\
                 C.3 Manipulating Graphical Output \\
                 C.3.1 Three Dimensional Graphics Display Driver \\
                 C.3.2 Two Dimensional Graphics Display Driver \\
                 C.3.3 Printing and Saving Graphic Output \\
                 C.3.4 Using Maple Plots in Other Programs",
}

@Book{Char:1992:FLT,
  author =       "Bruce W. Char and Keith O. Geddes and Gaston H. Gonnet
                 and Benton Leong and Michael B. Monagan and Stephen M.
                 Watt",
  title =        "First Leaves: a Tutorial Introduction to {Maple V}",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xvii + 253",
  year =         "1992",
  DOI =          "https://doi.org/10.1007/978-1-4615-6996-1",
  ISBN =         "0-387-97621-3, 3-540-97621-3",
  ISBN-13 =      "978-0-387-97621-1, 978-3-540-97621-9",
  LCCN =         "QA155.7.E4 F56 1992",
  bibdate =      "Tue Nov 2 12:30:08 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/maple-extract.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook2.bib",
  note =         "Also available in Japanese, ISBN 4-431-70651-8",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "One: Interactive Use of Maple \\
                 1.1: The user interface and the computational engine
                 \\
                 1.2: Getting started \\
                 1.3: Starting a Maple session: how Maple behaves
                 interactively \\
                 1.4: Simple arithmetic in Maple \\
                 1.5: Fixing mistakes \\
                 1.6: help yourself to more of Maple \\
                 1.7: Parentheses and the priority of arithmetic
                 operations \\
                 1.8: Ending a Maple session \\
                 1.9: Maple variables \\
                 1.10: Built-in commands for mathematical computation
                 \\
                 1.11: Introducing Maple's mathematical commands \\
                 1.12: Using Maple as a numerical calculator \\
                 1.13: Graphing and plotting functions on screen and on
                 paper \\
                 1.14: More about syntax errors \\
                 1.15: You ask too much! (Run-time errors) \\
                 1.16: Interrupting a Maple computation \\
                 1.17: Printing values: print and lprint \\
                 1.18: Defining simple functions in Maple \\
                 1.19: Automatic simplification \\
                 1.20: Simplifying expressions with simplify \\
                 1.21: Maple's commands for calculus \\
                 1.22: Computing sums \\
                 1.23: Solving recurrence relations with rsolve \\
                 1.24: Other commands for solving, and other
                 mathematical functions \\
                 Two: Less Simple Maple \\
                 2.1: A few words to experienced programmers \\
                 2.2: Programming variables and mathematical symbols \\
                 2.3: More on simplification: specialized simplification
                 commands \\
                 2.4: Full and delayed evaluation \\
                 2.5: Quotation and unevaluation \\
                 2.6: Using quoted variables as function arguments \\
                 2.7: Concatenation \\
                 forming new names from old \\
                 2.8: Looking at parts of expressions \\
                 op, nops, coeff \\
                 2.9: Expression sequences, sets, and lists \\
                 2.10: Tables and arrays \\
                 indexed collections of data \\
                 2.11: Converting from one structure to another \\
                 2.12: The map function: performing the same operation
                 on all elements of a data structure \\
                 2.13: Linear algebra in Maple \\
                 2.14: alias for changing the names of built-in
                 functions and mathematical symbols \\
                 2.15: Saving the state of your Maple session \\
                 2.16: Recording results in files in human-readable
                 format \\
                 2.17: Access to additional library procedures \\
                 2.18: Other formats for output: fortran, latex, and eqn
                 \\
                 Three: The Maple Programming Language \\
                 3.1: Repetition while you wait \\
                 3.2: Repetition for each one \\
                 3.3: Conditional execution with if-then-else-fi \\
                 3.4: break and next: control within for-while loops \\
                 3.5: Simple Maple procedures \\
                 3.6: Maple procedures \\
                 multiple statements, local variables, RETURN \\
                 3.7: Using error \\
                 exiting several procedures at once \\
                 3.8: Checking types: writing safer programs \\
                 3.9: Nested types and structured types \\
                 3.10: Remembering function values \\
                 3.11: Functional operators \\
                 3.12: Packages in Maple \\
                 3.13: Your Maple initialization file \\
                 3.14: Creating help for your procedures \\
                 3.15: Creating your own library \\
                 3.16: Creating and debugging Maple programs \\
                 3.17: Viewing Maple library source code \\
                 3.18: Calling Maple from programs written in other
                 languages \\
                 Four: Advanced Graphics \\
                 4.1: More on plot \\
                 4.2: Plotting in three dimensions: graphing surfaces
                 \\
                 4.3: Plotting functional expressions with plot and
                 plot3d \\
                 Five: Measuring and improving performance \\
                 5.1: Monitoring time and space consumed during a
                 computation \\
                 5.2: Garbage collection and gc \\
                 5.3: Querying the state of the system through status
                 \\
                 5.4: Profiling the performance of Maple programs \\
                 5.5: Using option remember to improve performance \\
                 5.6: Faster floating-point computation \\
                 Six: Advanced Examples \\
                 6.1: Introduction \\
                 6.2: Balancing chemical reactions \\
                 6.3: Maxwell's formula for the velocity of a gas sample
                 \\
                 6.4: Critical length of a rod \\
                 6.5: Zeros of Bessel functions \\
                 6.6: Stock market analysis through linear algebra \\
                 6.7: Primitive trinomials \\
                 6.8: Computations on the 3n +1 conjecture \\
                 6.9: A numerical approximation problem \\
                 6.10: Reading more about Maple problem-solving
                 techniques \\
                 Seven: Global access to Maple information \\
                 7.1: New users' problems \\
                 7.2: The community of Maple users \\
                 7.3: What to do when the answer seems wrong \\
                 7.4: Electronic access to user-contributed Maple
                 software \\
                 7.5: Maple publications \\
                 Conclusion \\
                 A: Bibliography \\
                 B: Books and articles for Maple users \\
                 B.1: Some books for Maple users \\
                 B.2: Some research articles on Maple and its usage",
}

@Book{Chasen:1978:GPP,
  author =       "Sylvan H. Chasen",
  title =        "Geometric Principles and Procedures for Computer
                 Graphics Applications",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xiv + 241",
  year =         "1978",
  ISBN =         "0-13-352559-7",
  ISBN-13 =      "978-0-13-352559-5",
  LCCN =         "T385 .C46",
  bibdate =      "Tue Dec 14 23:27:35 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Chassell:1999:TGD,
  author =       "Robert J. Chassell and Richard M. Stallman",
  title =        "{Texinfo}: The {GNU} Documentation Format (for
                 {Texinfo} version 4.0, {28 September 1999})",
  publisher =    pub-FSF,
  address =      pub-FSF:adr,
  pages =        "x + 244",
  year =         "1999",
  ISBN =         "1-882114-67-1",
  ISBN-13 =      "978-1-882114-67-2",
  LCCN =         "QA76.76.T49 C53 1999",
  bibdate =      "Wed Sep 20 10:17:03 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$25.00",
  acknowledgement = ack-nhfb,
}

@Book{Chen:2002:GGS,
  author =       "Jim X. Chen",
  title =        "Guide to Graphics Software Tools",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xxiv + 503",
  year =         "2002",
  ISBN =         "0-387-95049-4 (hardcover), 0-585-47254-8,
                 0-387-22430-0 (e-book)",
  ISBN-13 =      "978-0-387-95049-5 (hardcover), 978-0-585-47254-6,
                 978-0-387-22430-5 (e-book)",
  LCCN =         "T385 .C473 2003",
  bibdate =      "Sat Aug 02 09:19:58 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Includes CD-ROM.",
  price =        "US\$59.95",
  abstract =     "Today, graphics software tools open up new areas and
                 form into different combinations of multiple functions.
                 Learning graphics programming is time consuming, and
                 the many new graphics tools might seem overwhelming. If
                 we know how graphics work and what basic functions the
                 graphics tools provide, we can understand and employ
                 some of the tools without spending much precious time
                 to learn all the details that may not be applicable.
                 There are many books on graphics principles and
                 practice already. However, there is no book available
                 as a helpful entry point on widely used graphics
                 software tools for specialists and nonspecialists
                 alike. Today, many scientists in different disciplines
                 realize the power of graphics, but are also bewildered
                 by the numerous graphics tools. More often than not,
                 they choose the improper software tools and end up with
                 unsatisfactory results. This book introduces and
                 categorizes the most commonly used graphics tools and
                 their applications. The purpose is not to provide an
                 exhausting list of tools and their explicit functions,
                 but instead to provide scientific researchers different
                 means and application areas in computer graphics, and
                 help to efficiently use visualization, modeling,
                 simulation, and virtual reality to complement their
                 research needs. The guide will include coverage of the
                 most widely used commercial software, freeware and
                 open-source software.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "Preface \\
                 Table of Contents \\
                 1: Objects and Models \\
                 2: Transformation and Viewing \\
                 3: Color and Lighting \\
                 4: Blending and Texture Mapping \\
                 5: Advanced Topics \\
                 6: Low-Level Graphics Libraries \\
                 7: Visualization \\
                 8: Modeling and Rendering \\
                 9: Animation and Simulation \\
                 10: Virtual Reality \\
                 11: Web3D Tools and Networked Environment \\
                 12: 3D File Formats \\
                 Appendix: Graphics Software Tools",
}

@Article{Chen:SPE-19-9-897,
  author =       "Pehong Chen and Michael A. Harrison",
  title =        "Index Preparation and Processing",
  journal =      j-SPE,
  volume =       "19",
  number =       "9",
  pages =        "897--915",
  month =        sep,
  year =         "1988",
  bibdate =      "Sun May 2 07:46:42 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "The {\LaTeX} text of this paper is included in the
                 {\tt makeindex} software distribution. See
                 \cite{Chen:UCB-TR-87-347}.",
  acknowledgement = ack-nhfb,
}

@TechReport{Chen:UCB-TR-87-347,
  author =       "Pehong Chen and Michael A. Harrison",
  title =        "Automating Index Preparation",
  type =         "Technical Report",
  number =       "87/347",
  institution =  "Computer Science Division, University of California",
  address =      "Berkeley, CA, USA",
  month =        mar,
  year =         "1987",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "This is an expanded version of
                 \cite{Chen:SPE-19-9-897}.",
  acknowledgement = ack-nhfb,
}

@Book{Cheswick:1994:FIS,
  author =       "William R. Cheswick and Steven M. Bellovin",
  title =        "Firewalls and Internet Security: Repelling the Wily
                 Hacker",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xiv + 306",
  year =         "1994",
  ISBN =         "0-201-63357-4",
  ISBN-13 =      "978-0-201-63357-3",
  LCCN =         "TK5105.875.I57C44 1994",
  bibdate =      "Wed May 18 19:08:21 1994",
  bibsource =    "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/unix.bib",
  price =        "US\$24.95",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Introduction \\
                 2: An Overview of TCP/IP \\
                 3: Firewall Gateways \\
                 4: How to Build an Application-Level Gateway \\
                 5: Authentication \\
                 6: Gateway Tools \\
                 7: Traps, Lures, and Honey Pots \\
                 8: The Hacker's Workbench \\
                 9: Classes of Attacks \\
                 10: An Evening with Berferd \\
                 11: Where the Wild Things Are: A Look at the Logs \\
                 12: Legal Considerations \\
                 13: Secure Communications over Insecure Networks \\
                 14: Where Do We Go from Here? \\
                 A: Useful Free Stuff \\
                 B: TCP and UDP Ports \\
                 C: Recommendations to Vendors",
}

@Book{Cheswick:2003:FIS,
  author =       "William R. Cheswick and Steven M. Bellovin and Aviel
                 D. Rubin",
  title =        "Firewalls and {Internet} Security: Repelling the Wily
                 Hacker",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Second",
  pages =        "xiv + 433",
  year =         "2003",
  ISBN =         "0-201-63466-X",
  ISBN-13 =      "978-0-201-63466-2",
  LCCN =         "TK5105.875.I57C44 2003",
  bibdate =      "Mon Mar 10 05:40:10 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$49.99, CAN\$77.99",
  abstract =     "Focusing on Unix network security, this guide reviews
                 the TCP/IP protocol suite, identifies the techniques
                 used to attack hosts and networks, and evaluates
                 authentication tools, types of firewalls, and filtering
                 services. The second edition adds chapters on the
                 problems and practices of modern intranets, and the
                 variety of intrusion detection systems.",
  acknowledgement = ack-nhfb,
  tableofcontents = "I: Getting Started \\
                 1: Introduction \\
                 2: A Security Review of Protocols: Lower Layers \\
                 3: Security Review: The Upper Layers \\
                 4: The Web: Threat or Menace? \\
                 II: The Threats \\
                 5: Classes of Attacks \\
                 6: The Hacker's Workbench, and Other Munitions \\
                 III: Safer Tools and Services \\
                 7: Authentication \\
                 8: Using Some Tools and Services \\
                 IV: Firewalls and VPNs \\
                 9: Kinds of Firewalls \\
                 10: Filtering Services \\
                 11: Firewall Engineering \\
                 12: Tunneling and VPNs \\
                 V: Protecting an Organization \\
                 13: Network Layout \\
                 14: Safe Hosts in a Hostile Environment \\
                 15: Instruction Detection \\
                 VI: Lessons Learned \\
                 16: An Evening with Berferd \\
                 17: The Taking of Clark",
}

@Book{Chow:1989:MXR,
  editor =       "Paul Chow",
  title =        "The {MIPS-X RISC} Microprocessor",
  publisher =    pub-KLUWER,
  address =      pub-KLUWER:adr,
  pages =        "xxiv + 231",
  year =         "1989",
  ISBN =         "0-7923-9045-8",
  ISBN-13 =      "978-0-7923-9045-9",
  LCCN =         "QA76.8.M524 M57 1989",
  bibdate =      "Tue Dec 14 23:27:43 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/microchip.bib",
  series =       "The Kluwer international series in engineering and
                 computer science",
  ZMnumber =     "0706.68010",
  acknowledgement = ack-nhfb,
  keywords =     "MIPS-X (microprocessor); VLSI, computer architecture,
                 and digital signal processing SECS 81",
}

@Book{Chposky:1988:BMP,
  author =       "James Chposky and Ted Leonsis",
  title =        "Blue magic: the people, power, and politics behind the
                 {IBM} personal computer",
  publisher =    "Facts on File",
  address =      "New York, NY, USA",
  pages =        "xi + 228",
  year =         "1988",
  ISBN =         "0-8160-1391-8",
  ISBN-13 =      "978-0-8160-1391-3",
  LCCN =         "HD9696.C64 I4832 1988",
  bibdate =      "Fri Jan 24 07:03:11 MST 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "IBM microcomputers; History; IBM Personal Computer",
  tableofcontents = "The vixen and the rocket \\
                 Putting a toe in the water",
}

@Book{Christensen:1997:IDW,
  author =       "Clayton M. Christensen",
  title =        "The innovator's dilemma: when new technologies cause
                 great firms to fail",
  publisher =    "Harvard Business School",
  address =      "Boston, MA, USA",
  pages =        "xxiv + 225",
  year =         "1997",
  ISBN =         "0-87584-585-1",
  ISBN-13 =      "978-0-87584-585-2",
  LCCN =         "HD53 .C49 1997",
  bibdate =      "Thu Dec 28 07:47:15 MST 2017",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "The Management of Innovation and Change Series",
  abstract =     "This book takes the radical position that great
                 companies can fail precisely because they do everything
                 right. It demonstrates why outstanding companies that
                 had their competitive antennae up, listened astutely to
                 customers, and invested aggressively in new
                 technologies still lost their market leadership when
                 confronted with disruptive changes in technology and
                 market structure. And it tells how to avoid a similar
                 fate. Using the lessons of successes and failures of
                 leading companies, The \booktitle{Innovator's Dilemma}
                 presents a set of rules for capitalizing on the
                 phenomenon of disruptive innovation. These principles
                 will help managers determine when it is right not to
                 listen to customers, when to invest in developing
                 lower-performance products that promise lower margins,
                 and when to pursue small markets at the expense of
                 seemingly larger and more lucrative ones.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  tableofcontents = "How can great firms fail? Insights from the hard
                 disk drive industry \\
                 Value networks and the impetus to innovate \\
                 Disruptive technological change in the mechanical
                 excavator industry \\
                 What goes up, can't go down \\
                 Give responsibility for disruptive technologies to
                 organizations whose customers need them \\
                 Match the size of the organization to the size of the
                 market \\
                 Discovering new and emerging markets \\
                 Performance provided, market demand, and the product
                 life cycle \\
                 Managing disruptive technological change: a case study
                 \\
                 The dilemmas of innovation: a summary",
}

@Book{Christian:1983:UOS,
  author =       "Kaare Christian",
  title =        "The {UNIX} Operating System",
  publisher =    pub-WILEY-INTERSCIENCE,
  address =      pub-WILEY-INTERSCIENCE:adr,
  pages =        "xviii + 318",
  year =         "1983",
  ISBN =         "0-471-87542-2 (hardcover) and 0-471-89052-9
                 (paperback)",
  ISBN-13 =      "978-0-471-87542-0 (hardcover) and 978-0-471-89052-2
                 (paperback)",
  LCCN =         "QA76.8.U65 C45 1983",
  bibdate =      "Tue Dec 14 23:28:00 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Christian:1986:GM,
  author =       "Kaare Christian",
  title =        "A Guide to {Modula-2}",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xix + 436",
  year =         "1986",
  ISBN =         "0-387-96242-5",
  ISBN-13 =      "978-0-387-96242-9",
  LCCN =         "QA76.73.M63 C494 1986",
  bibdate =      "Tue Dec 14 23:27:52 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$28.00",
  acknowledgement = ack-nhfb,
}

@Book{Christian:1988:UOS,
  author =       "Kaare Christian",
  title =        "The {UNIX} Operating System",
  publisher =    pub-WILEY-INTERSCIENCE,
  address =      pub-WILEY-INTERSCIENCE:adr,
  edition =      "Second",
  pages =        "xxii + 455",
  year =         "1988",
  ISBN =         "0-471-84782-8 (hardcover), 0-471-84781-X (paperback)",
  ISBN-13 =      "978-0-471-84782-3 (hardcover), 978-0-471-84781-6
                 (paperback)",
  LCCN =         "QA76.8.U65 C45 1988",
  bibdate =      "Tue Dec 14 23:28:05 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "Contains over 50 percent new and expanded material and
                 guides readers through every aspect of UNIX--from basic
                 commands to shell programming to systems
                 administration. Provides readers with useful quick
                 summary sections that explain the important differences
                 between UNIX versions. Includes special chapters on
                 networking, security and Window systems.",
  acknowledgement = ack-nhfb,
  tableofcontents = "The History of the UNIX System \\
                 Fundamentals \\
                 UNIX System Basics \\
                 Entering Commands Using the Shell \\
                 The UNIX File System \\
                 Managing Your Files \\
                 What's Going on Utilities \\
                 Text File Utilities \\
                 Basic Text Editing with Vi \\
                 Advanced Text Editing with Vi \\
                 The Bourne Shell Programming Language \\
                 A Few Shell Programs \\
                 The AWK Programming Language \\
                 The Sed Text Editor \\
                 UNIX Platforms \\
                 Window Systems \\
                 Networking \\
                 LAN Networking Utilities \\
                 UUCP Networking Utilities \\
                 System Management \\
                 System Management Utilities \\
                 Security \\
                 The UNIX System Kernel \\
                 Appendices \\
                 Index",
  xxnote =       "See \cite{Sobell:1989:PGU}.",
}

@Book{Christiansen:1998:PC,
  author =       "Tohm Christiansen and Nathan Torkington",
  title =        "Perl Cookbook: Solutions and examples for {Perl}
                 programmers",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xxxiv + 757",
  year =         "1998",
  ISBN =         "1-56592-243-3",
  ISBN-13 =      "978-1-56592-243-3",
  LCCN =         "QA76.73.P22 C57 1998",
  bibdate =      "Thu Feb 18 06:53:00 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$39.95",
  URL =          "http://www.oreilly.com/catalog/cookbook/",
  acknowledgement = ack-nhfb,
}

@Book{Chroskova:1993:ACC,
  author =       "Blank Chroskov{\'a} and Bohumila Navr{\'a}tilov{\'a}
                 and Milo{\v{s}} Vantuch and Eva Hrabcov{\'a}",
  title =        "Anglicko--{\v{C}}esk{\'y} a {\v{C}}esko--Anglick{\'y}
                 Slovn{\'\i}k --- English--Czech and Czech--English
                 Dictionary",
  publisher =    "Vydavatelstv{\'\i} Montan{\v{e}}x",
  address =      "Ostrava, Czechoslovakia",
  pages =        "176",
  year =         "1993",
  ISBN =         "80-85300-57-5",
  ISBN-13 =      "978-80-85300-57-4",
  LCCN =         "PG4640 .A485 1993x",
  bibdate =      "Sat Dec 24 15:19:10 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  idnumber =     "519",
  remark =       "No publication year in book; WorldCat says 1993.",
  subject =      "Czech language; Dictionaries; English; English
                 language; Czech",
}

@Book{Churchill:1958:OM,
  author =       "Ruel V. Churchill",
  title =        "Operational Mathematics",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  edition =      "Second",
  pages =        "337",
  year =         "1958",
  LCCN =         "QA432 .C45 1958",
  bibdate =      "Wed Dec 15 15:37:25 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Churchill:1960:CVA,
  author =       "Ruel V. Churchill",
  title =        "Complex Variables and Applications",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  edition =      "Second",
  pages =        "297",
  year =         "1960",
  LCCN =         "QA331 .C45 1960",
  bibdate =      "Wed Dec 15 15:35:45 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Clark:1985:MPP,
  author =       "K. L. Clark and F. G. McCabe",
  title =        "micro-{PROLOG}: Programming in Logic",
  publisher =    pub-PHI,
  address =      pub-PHI:adr,
  pages =        "xi + 401",
  year =         "1985",
  ISBN =         "0-13-581264-X (paperback)",
  ISBN-13 =      "978-0-13-581264-8 (paperback)",
  LCCN =         "QA76.73.M5 C55 1984",
  bibdate =      "Tue Dec 14 23:28:16 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$17.95",
  series =       "Series in Computer Science, Editor: C. A. R. Hoare",
  acknowledgement = ack-nhfb,
  tableofcontents = "Basic concepts \\
                 Facts and queries \\
                 Rules \\
                 Lists \\
                 Logic programming using micro-Prolog \\
                 Complex conditions in queries and rules \\
                 List processing \\
                 Introduction to parsing \\
                 Some pragmatic considerations \\
                 Metalogical programming \\
                 Core micro-Prolog \\
                 The standard syntax of micro-Prolog \\
                 Applications of micro-Prolog \\
                 A critical path analysis program \\
                 Micro-Prolog for expert systems \\
                 The logic of two person games \\
                 Micro-Prolog for problem solving \\
                 Index",
}

@Book{Clark:1992:PTP,
  author =       "Malcolm Clark",
  title =        "A Plain {\TeX} Primer",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  pages =        "481",
  year =         "1992",
  ISBN =         "0-19-853784-0 (hardcover), 0-19-853724-7 (paperback)",
  ISBN-13 =      "978-0-19-853784-7 (hardcover), 978-0-19-853724-3
                 (paperback)",
  LCCN =         "Z253.4.T47 C46 1992",
  bibdate =      "Tue Dec 14 23:41:37 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "This outstanding introductory primer demystifies and
                 explains \TeX{}, an advanced and widely popular
                 typesetting and page make-up system that is especially
                 designed to facilitate scientific and technical
                 publishing. The \TeX{} system is highly versatile,
                 designed for use on over 50 different types of
                 personal, mini-, and mainframe computers. The book
                 immediately provides the reader with sufficient
                 information to begin the majority of tasks which he or
                 she most likely wishes to tackle. Accessibly written at
                 an introductory level, the book explains how
                 high-quality results can be obtained by someone with
                 only a little \TeX{} background. In a straightforward
                 manner, it details why \TeX{} approaches its subject in
                 the way it does, and provides the ``context'' into
                 which it fits. Special emphasis is placed on document
                 structure and practical work. In fact, not only is this
                 book a ``primer,'' but it is a ``plain'' \TeX{} primer.
                 Wherever \TeX{} is running, it comes with at least one
                 basic style definition, called ``plain''. Plain \TeX{}
                 is the common starting point for \TeX{} users and can
                 be extended or modified to suit individual needs. Thus,
                 with the aid of this book, scientists and researchers
                 preparing their own books and papers, or technical
                 typists used to the conventions and jargon of their
                 field, will find little difficulty in adopting \TeX{}'s
                 approach. Students and professionals involved in
                 document preparation or desk-top publishing will also
                 find this an extremely useful volume.",
  acknowledgement = ack-nhfb,
  subject =      "TeX (Computer file); TeX (Computer file); Computerized
                 typesetting; Mathematics printing; Computer programs;
                 Computerized typesetting; Computer programs; Linguagens
                 De Programa{\c{c}}ao (Codifica{\c{c}}ao); TeX
                 (logiciel)",
  tableofcontents = "1. Introduction \\
                 2. Getting started \\
                 3. Do it yourself \\
                 4. Beginning mathematics \\
                 5. Continuing mathematics \\
                 6. More words \\
                 7. Commands \\
                 8. More maths \\
                 9. Boxing \\
                 10. Commands\#1 \\
                 11. Matrix manipulations \\
                 12. Pages \\
                 13. Tables by tabs \\
                 14. Tables again \\
                 15. Rules \\
                 16. Further rules \\
                 17. Graphics \\
                 18. Fonts \\
                 19. More detailed fonts \\
                 20. Making pages \\
                 21. Breaking up \\
                 22. Delays and deferments \\
                 23. Collections \\
                 24. Last words \\
                 A. Fonts \\
                 B. Annotated bibliography and references",
}

@Book{Clark:2009:SKU,
  author =       "Stuart (Stuart G.) Clark",
  title =        "The {Sun Kings}: the unexpected tragedy of {Richard
                 Carrington} and the tale of how modern astronomy
                 began",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "xii + 211",
  year =         "2009",
  ISBN =         "0-691-14126-6 (paperback)",
  ISBN-13 =      "978-0-691-14126-8 (paperback)",
  LCCN =         "M09.E06300",
  bibdate =      "Thu Nov 12 16:40:25 MST 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/physperspect.bib;
                 library.ox.ac.uk:210/ADVANCE",
  URL =          "http://press.princeton.edu/titles/8370.html",
  abstract =     "Recounts the story behind English astronomer Richard
                 Carrington's observations of a mysterious explosion on
                 the surface of the sun and how his understanding that
                 the sun's magnetism directly influences the Earth
                 helped usher in the modern era of astronomy.",
  acknowledgement = ack-nhfb,
  remark =       "Originally published: 2007.",
  subject =      "Carrington, Richard Christopher; astronomy; England;
                 19th Century history; solar flares; observations; sun;
                 Carrington, Richard Christopher; Herschel, William,
                 Sir; Herschel, John F. W (John Frederick William), Sir;
                 Maunder, E. Walter (Edward Walter); Hale, George
                 Ellery; Carrington, Richard Christopher; Herschel,
                 William; Herschel, John Frederick William; Maunder,
                 Edward Walter; Hale, George Ellery; Astronomers; Great
                 Britain; Biography; Solar flares; Observations;
                 History; 19th century; Astronomes; Grande-Bretagne;
                 Biographies; {\'E}ruptions solaires; 19e si{\`e}cle;
                 Soleil; Sun; 19th century",
  subject-dates = "Richard Carrington (1826--1875); Sir William Herschel
                 (1738--1822); John F. W. Herschel (1792--1871); E.
                 Walter Maunder (1851--1928); George Ellery Hale
                 (1868--1938)",
  tableofcontents = "List of Illustrations / ix \\
                 Acknowledgments / xi \\
                 Prologue: The Dog Years / 1 \\
                 Chapter One: The First Swallow of Summer / 9 \\
                 Chapter Two: Herschel's Grand Absurdity / 25 \\
                 Chapter Three: The Magnetic Crusade / 47 \\
                 Chapter Four: The Solar Lockstep / 58 \\
                 Chapter Five: The Day and Night Observatory / 71 \\
                 Chapter Six: The Perfect Solar Storm / 80 \\
                 Chapter Seven: In the Grip of the Sun / 93 \\
                 Chapter Eight: The Greatest Prize of All / 98 \\
                 Chapter Nine: Death at the Devil's Jumps / 117 \\
                 Chapter Ten: The Sun's Librarian / 129 \\
                 Chapter Eleven: New Flare, New Storm, New Understanding
                 / 148 \\
                 Chapter Twelve: The Waiting Game / 168 \\
                 Chapter Thirteen: The Cloud Chamber / 179 \\
                 Epilogue: Magnetar Spring / 188 \\
                 Bibliography / 191 \\
                 Index / 207",
}

@Book{Clawson:1994:MTE,
  author =       "Calvin C. Clawson",
  title =        "The Mathematical Traveler: Exploring the Grand History
                 of Numbers",
  publisher =    pub-PLENUM,
  address =      pub-PLENUM:adr,
  pages =        "x + 307",
  year =         "1994",
  ISBN =         "0-306-44645-6",
  ISBN-13 =      "978-0-306-44645-0",
  LCCN =         "QA141 .C52 1994",
  bibdate =      "Wed Dec 31 11:51:02 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/pi.bib",
  price =        "US\$25.95",
  abstract =     "The story of numbers is a rich, sweeping history that
                 shows how our mathematical achievements contributed to
                 the greatest innovations of civilization. Calvin
                 Clawson, acclaimed author of \booktitle{Conquering Math
                 Phobia}, weaves a story of numbers that spans thousands
                 of years. As Clawson so clearly shows, numbers are not
                 only an intrinsic and essential thread in our modern
                 lives, but have always been an integral part of the
                 human psyche --- knit into the very fabric of our
                 identity as humans. Clawson travels back through time
                 to the roots of the history of numbers. In exploring
                 early human fascination with numbers, he unearths the
                 clay beads, knotted ropes, and tablets used by our
                 ancestors as counting tools. He then investigates how
                 numeric symbols and concepts developed uniquely and
                 independently in Meso-America, China, and Egypt. As he
                 persuasively argues, the mathematical concepts that
                 arose and flourished in the ancient world enabled the
                 creation of architectural masterpieces as well as the
                 establishment of vast trade networks. Continuing the
                 journey, Clawson brings us to the elegant logic of
                 numbers that soon came to distinguish itself as a
                 discipline and the language of science. From the
                 concepts of infinity contemplated by the Greeks to the
                 complex numbers that are indispensable to scientists on
                 the cutting edge of research today, Clawson breathes
                 life and meaning into the history of great mathematical
                 mysteries and problems. In this spirit of inquiry, he
                 explores, in their times and places, the discovery of
                 numbers that lie outside the province of counting,
                 including irrational numbers, transcendentals, complex
                 numbers, and the enormous transfinite numbers. The
                 personalities and the creative feats surrounding each
                 mathematical invention come alive vividly in Clawson's
                 lucid prose. In this work of breathtaking scope,
                 Clawson guides us through the wonders of numbers and
                 illustrates their monumental impact on civilization.",
  acknowledgement = ack-nhfb,
  subject =      "Numeration; Counting; Counting; Numeration;
                 Getaltheorie; Geschichte; Zahlentheorie",
  tableofcontents = "Acknowledgments / vii \\
                 Introduction / 1 \\
                 1: How Do We Count? / 5 \\
                 2: Early Counting / 19 \\
                 3: Counting in Other Species: How Smart Are They? / 37
                 \\
                 4: Ancient Numbers / 49 \\
                 5: Chinese and New World Numbers / 77 \\
                 6: Problems in Paradise / 95 \\
                 7: The Negative Numbers / 121 \\
                 8: Dealing with the Infinite / 135 \\
                 9: Dedekind's Cut: Irrational Numbers / 161 \\
                 10: Story of $\pi$: Transcendental Numbers / 181 \\
                 11: Expanding the Kingdom: Complex Numbers / 207 \\
                 12: Really Big: Transfinite Numbers / 223 \\
                 13: The Genius Calculators / 233 \\
                 14: What Does It All Mean? / 247 \\
                 15: Numbers: Past, Present, and Future / 263 \\
                 End Notes / 281 \\
                 Glossary / 289 \\
                 Bibliography / 299 \\
                 Index / 303",
}

@Book{Cleaveland:1977:GPL,
  author =       "J. Craig Cleaveland and Robert C. Uzgalis",
  title =        "Grammars for Programming Languages",
  volume =       "4",
  publisher =    pub-ELSEVIER,
  address =      pub-ELSEVIER:adr,
  pages =        "xiii + 154",
  year =         "1977",
  ISBN =         "0-444-00187-5 (hardcover), 0-444-00199-9 (paperback)",
  ISBN-13 =      "978-0-444-00187-0 (hardcover), 978-0-444-00199-3
                 (paperback)",
  LCCN =         "QA76.7.C571",
  bibdate =      "Tue Dec 14 23:28:27 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Programming Languages Series, Editor: Thomas E.
                 Cheatham",
  acknowledgement = ack-nhfb,
}

@Book{Clegg:2003:BHI,
  author =       "Brian Clegg",
  title =        "A Brief History of Infinity: The Quest to Think the
                 Unthinkable",
  publisher =    "Robinson",
  address =      "London, UK",
  pages =        "255",
  year =         "2003",
  ISBN =         "1-84119-650-9",
  ISBN-13 =      "978-1-84119-650-3",
  LCCN =         "BD411 .C57 2003",
  bibdate =      "Wed Nov 26 05:33:08 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "UK\pounds 8.99",
  abstract =     "Infinity is a concept that fascinates everyone from a
                 seven-year-old child to a maths professor. So
                 remarkable and strange is it that contemplating it has
                 driven at least two great mathematicians over the edge
                 into insanity. Where did the concept of infinity come
                 from? Who were the people who originally defined and
                 later refined this paradoxical quantity? Why is
                 infinity, a concept we can never experience or truly
                 grasp, at the heart of science? How can some infinities
                 be bigger than others? An exploration of the most
                 mind-boggling feature of maths and physics, this work
                 examines amazing paradoxes, for example Hilbert's
                 Hotel. This imaginary resort has an infinite number of
                 rooms, which all happen to be occupied. Unfortunately
                 an endless coach turns up carrying an infinite number
                 of new guests. It's not a problem though --- it's easy
                 to prove they can all be accommodated. The book also
                 looks at: the people who devised and refined the
                 concept, the many mind-bending paradoxes of infinity,
                 infinity's place at the heart of mathematics and
                 science in processes such as calculus, how dividing by
                 zero brings infinity into view and infinity and
                 cosmos.",
  acknowledgement = ack-nhfb,
}

@Book{Clegg:2009:BBB,
  author =       "Brian Clegg",
  title =        "Before the {Big Bang}: the prehistory of our
                 universe",
  publisher =    "St. Martin's Press",
  address =      "New York, NY, USA",
  pages =        "306",
  year =         "2009",
  ISBN =         "0-312-38547-1",
  ISBN-13 =      "978-0-312-38547-7",
  LCCN =         "QB981 .C627 2009",
  bibdate =      "Mon Jun 13 16:38:13 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0908/2008046035-b.html;
                 http://www.loc.gov/catdir/enhancements/fy0908/2008046035-d.html",
  abstract =     "Explores the history of the big bang theory while
                 considering the myriad beliefs about what may have
                 compelled it, providing coverage of such topics as
                 creation myths, the discovery of other galaxies, and
                 ongoing debates about black holes.",
  acknowledgement = ack-nhfb,
  subject =      "Cosmology; Big bang theory",
  tableofcontents = "Big bang primer \\
                 Enter the creator \\
                 What and how big? \\
                 How old? \\
                 A bang or a whimper? \\
                 Keeping things steady \\
                 Inflating the truth \\
                 Let there be time \\
                 Groundhog universe \\
                 Living in a bubble \\
                 Welcome to the matrix \\
                 Snapshot universe",
}

@Book{Clews:1988:LAW,
  author =       "John Clews",
  title =        "Language automation worldwide: the development of
                 character set standards",
  number =       "5962",
  publisher =    "SESAME Computer Projects",
  address =      "Harrogate, North Yorkshire, UK",
  pages =        "104",
  year =         "1988",
  ISBN =         "1-870095-01-4",
  ISBN-13 =      "978-1-870095-01-3",
  LCCN =         "QA76.5 .C54 1988",
  bibdate =      "Mon Jul 21 09:08:40 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unicode.bib",
  series =       "British Library R \& D reports",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  tableofcontents = "Abstract / iii \\
                 Acknowledgements / iii \\
                 Introduction / 1 \\
                 1. Coded Character Sets, Scripts and Standards in
                 Library Automation / 4 \\
                 1.1 Scripts / 8 \\
                 1.2 Standards / 12 \\
                 1.3 International Standards / 12 \\
                 1.3.1 The standardization process / 12 \\
                 1.3.2 The scope and origins of ISO / 13 \\
                 1.3.3 National members of ISO / 13 \\
                 1.3.4 The Technical Committee structure within ISO / 15
                 \\
                 1.3.5 Liaison members / 15 \\
                 1.3.6 ISO Technical Committee 97 / 16 \\
                 1.3.7 ISO Technical Committee 46 / 16 \\
                 1.4 National Standards / 19 \\
                 1.5 De facto Standards - / 19 \\
                 1.6 Industry Standards / 20 \\
                 2. Roman Script Character Sets: Accommodating
                 Additional Characters / 21 \\
                 2.1 Substitution / 21 \\
                 2.2 Control Functions Related to Code Extension
                 Techniques / 22 \\
                 2.3 Escape sequences: ISO 2022, ISO 2375 and the
                 International Register / 25 \\
                 2.4 Registration / 26 \\
                 2.5 Non-standard Uses of Escape Sequences in Library
                 Systems / 26 \\
                 2.5.1 Escape sequences in UNIMARC / 28 \\
                 2.5.2 Escape sequences in USMARC and related exchange
                 formats / 29 \\
                 3. Graphic Character Sets for Libraries / 31 \\
                 3.1 USMARC / 31 \\
                 3.2 National Variants of USMARC / 35 \\
                 3.3 EBCDIC / 36 \\
                 3.4 Bibliographic Uses of EBCDIC / 37 \\
                 3.5 Latin Alphabet Character Sets of IS0/TC46 / 39 \\
                 3.6 ISO 5426 / 42 \\
                 3.7 ISO 6438 - African Character Set / 44 \\
                 3.8 International Phonetic Alphabet Character Set / 46
                 \\
                 3.9 ISO 6862 (Mathematical Symbols) / 49 \\
                 4. 8 bit Graphic Character Sets Developed by
                 ISO/TC97/SC2 / 50 \\
                 4.1 ISO 4873 / 50 \\
                 4.2 ISO 6937 / 52 \\
                 4.3 ISO 8859 / 56 \\
                 4.4 Future Development of 8-bit Codes / 63 \\
                 5. Character Set Standards for Other European Scripts /
                 64 \\
                 5.1 ISO/TC97 Character Sets for Cyrillic Script / 65
                 \\
                 5.2 ISO/TC46 Character Sets for Cyrillic Script / 74
                 \\
                 5.3 Non-Slavonic Cyrillic Character Sets / 74 \\
                 5.4 Character Sets for American and Georgian / 74 \\
                 5.5 ISO/TC97 Character Sets for Greek Script / 88 \\
                 5.6 ISO/TC46 Character Sets for Greek Script / 88 \\
                 5.7 Duplication of Effort Within ISO / 88 \\
                 6. Character Sets for North African and Middle Eastern
                 Scripts / 93 \\
                 6.1 Hebrew Script / 93 \\
                 6.2 Arabic Script / 98 \\
                 6.3 Maldivian Script / 105 \\
                 6.4 Amharic Script / 107 \\
                 7. Character Sets for South Asian Scripts / 108 \\
                 7.1 ISCII / 112 \\
                 7.2 Sinhalese / 118 \\
                 7.3 Tibetan / 119 \\
                 7.4 Conjunct Letters / 121 \\
                 8. Character Sets for South East Asian Scripts / 122
                 \\
                 8.1 Burmese / 122 \\
                 8.2 Khmer / 122 \\
                 8.3 Tai Scripts / 124 \\
                 9. Character Sets for East Asian Scripts / 128 \\
                 9.1 Chinese Script / 129 \\
                 9.2 Other Scripts of China / 122 \\
                 9.3 Korean Script / 124 \\
                 9.4 Japanese Script / 126 \\
                 10. Multiple-byte Coded Character Sets for East Asian
                 Scripts / 138 \\
                 10.1 Japan and its Influence on Other National
                 Standards / 138 \\
                 10.2 Korea / 142 \\
                 10.3 China / 44 \\
                 10.4 Taiwan / 146 \\
                 10.5 Handling of Variant Forms in CCCII / 148 \\
                 11. International Standardization of Multiple-byte
                 Coded Character Sets / 150 \\
                 11.1 REACC / 150 \\
                 11.2 EACC / 150 \\
                 11.3 Layers in EACC / 125 \\
                 11.4 An ISO/TC46 Multiple-byte Character Set / 157 \\
                 11.5 The IS0/TC97 Multiple-byte Character Set / 157 \\
                 11.6 Non-locking shifts / 160 \\
                 11.7 Locking shifts / 162 \\
                 11.8 Multiple-byte code extension for bibliographic
                 needs / 162 \\
                 11.9 Registration issues / 164 \\
                 12. Convergence of Interests in Character Set
                 Standardization / 165",
}

@Book{Cline:1999:CF,
  author =       "Marshall Cline and Greg Lomow and Mike Girou",
  title =        "{C++ FAQs}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xxxiii + 587",
  year =         "1999",
  ISBN =         "0-201-30983-1",
  ISBN-13 =      "978-0-201-30983-6",
  LCCN =         "QA76.73.C153C55 1999",
  bibdate =      "Tue May 11 07:03:19 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$39.95",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
}

@Article{Clinger:floating-point-input,
  author =       "William D. Clinger",
  title =        "How to Read Floating Point Numbers Accurately",
  journal =      j-SIGPLAN,
  volume =       "25",
  number =       "6",
  pages =        "92--101",
  month =        jun,
  year =         "1990",
  bibdate =      "Sun May 2 07:47:01 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See also output algorithm in
                 \cite{Steele:floating-point-output} and
                 \cite{Knuth:1990:SPW}.",
  acknowledgement = ack-nhfb,
}

@Book{Close:2015:HLD,
  author =       "Frank E. Close",
  title =        "Half-life: the divided life of {Bruno Pontecorvo},
                 physicist or spy",
  publisher =    pub-BASIC-BOOKS,
  address =      pub-BASIC-BOOKS:adr,
  pages =        "xix + 378",
  year =         "2015",
  ISBN =         "0-465-06998-3 (hardcover), 0-465-04487-5 (e-book),
                 1-78074-582-6 (e-book)",
  ISBN-13 =      "978-0-465-06998-9 (hardcover), 978-0-465-04487-0
                 (e-book), 978-1-78074-582-4 (e-book)",
  LCCN =         "QC774.P66 C56 2014",
  bibdate =      "Thu Mar 5 05:45:53 MST 2015",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/f/fermi-enrico.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",
  price =        "US\$29.99",
  abstract =     "Bruno Pontecorvo dedicated his career to hunting for
                 the Higgs boson of his day --- the neutrino, a nearly
                 massless particle considered essential to the process
                 of nuclear fission. His work on the Manhattan Project
                 under Enrico Fermi confirmed his reputation as a
                 brilliant physicist and helped usher in the nuclear
                 age. He should have won a Nobel Prize, but late in the
                 summer of 1950 he vanished. At the height of the Cold
                 War, Pontecorvo had disappeared behind the Iron
                 Curtain. In \booktitle{Half-Life}, physicist and
                 historian Frank Close offers a heretofore untold
                 history of Pontecorvo's life, based on unprecedented
                 access to his friends, family, and colleagues. With all
                 the elements of a Cold War thriller --- classified
                 atomic research, an infamous double agent, a kidnapping
                 by Soviet operatives --- \booktitle{Half-Life} is a
                 history of particle physics at perhaps its most
                 powerful: when it created the bomb.",
  acknowledgement = ack-nhfb,
  subject =      "Pontekorvo, Bruno (1913--1993); nuclear physicists;
                 Soviet Union; biography; Italy; spies",
  subject-dates = "1913--1993",
  tableofcontents = "Preface / ix \\
                 Prologue: Midway on life's journey / xi \\
                 First half \\
                 1: From Pisa to Rome / 3 \\
                 2: Slow neutrons and fast reactions: 1934--1936 / 12
                 \\
                 3: Paris and politics: 1936--1940 / 28 \\
                 4: The first escape: 1940 / 53 \\
                 5: Neutrons for oil and war: 1940--1941 / 66 \\
                 6: East and West: 1941--1942 / 77 \\
                 7: The pile at Chalk River: 1943--1945 / 87 \\
                 8: Physics in the open: 1945--1948 / 105 \\
                 9: Maneuvers: 1945--1950 / 117 \\
                 Interlude \\
                 West to East / 127 \\
                 Half time\\
                 10: Chain reaction: 1949--1950 / 147 \\
                 11: From Abingdon --- to where?: 1950 / 160 \\
                 12: The dear departed: 1950 / 180 \\
                 13: The MI5 letters / 200 \\
                 Second half \\
                 14: In dark woods / 213 \\
                 15: Exile / 225 \\
                 16: Resurrection / 243 \\
                 17: Mr. Neutrino / 253 \\
                 18: Private Bruno / 275 \\
                 Afterlife \\
                 19: The right road lost / 299 \\
                 Afterword / 307 \\
                 Acknowledgments / 315 \\
                 Acronyms / 318 \\
                 Notes / 319 \\
                 Bibliography / 363 \\
                 Index / 367",
}

@Book{Cody:1980:SME,
  author =       "William J. {Cody, Jr.} and William Waite",
  title =        "Software Manual for the Elementary Functions",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "x + 269",
  year =         "1980",
  ISBN =         "0-13-822064-6",
  ISBN-13 =      "978-0-13-822064-8",
  LCCN =         "QA331 .C635 1980",
  bibdate =      "Tue Dec 14 23:28:38 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "Preface / ix \\
                 1. Introduction / 1 \\
                 2. Preliminaries / 3 \\
                 3. Performance Testing / 11 \\
                 4. SQRT / 17 \\
                 5. ALOG/ALOG10 / 35 \\
                 6. EXP / 60 \\
                 7. POWER (**) / 84 \\
                 8. SIN/COS / 125 \\
                 9. TAN/COT / 150 \\
                 10. ASIN/ACOS / 174 \\
                 11. ATAN/ATAN2 / 194 \\
                 12. SINH/COSH / 217",
  tableofcontents = "Preface / ix \\
                 1. Introduction / 1 \\
                 2. Preliminaries / 3 \\
                 3. Performance Testing / 11 \\
                 4. SQRT / 17 \\
                 a. General Discussion / 17 \\
                 b. Flow Chart for SQRT(X) / 18 \\
                 c. Implementation Notes, Non-Decimal Fixed-Point
                 Machines / 19 \\
                 d. Implementation Notes, Binary Floating-Point Machines
                 / 23 \\
                 e. Implementation Notes, Non-Binary Floating-Point
                 Machines / 25 \\
                 f. Testing / 28 \\
                 5. ALOG/ALOG10 / 35 \\
                 a. General Discussion / 35 \\
                 b. Flow Chart for ALOG(X)/ALOG10(X) / 37 \\
                 c. Implementation Notes, Non-Decimal Fixed-Point
                 Machines / 38 \\
                 d. Implementation Notes, Non-Decimal Floating-Point
                 Machines / 42 \\
                 e. Implementation Notes, Decimal Floating-Point
                 Machines / 46 \\
                 f. Testing / 49 \\
                 6. EXP / 60 \\
                 a. General Discussion / 60 \\
                 b. Flow Chart for EXP(X) / 62 \\
                 c. Implementation Notes, Non-Decimal Fixed-Point
                 Machines / 63 \\
                 d. Implementation Notes, Non-Decimal Floating-Point
                 Machines / 67 \\
                 e. Implementation Notes, Decimal Floating-Point
                 Machines / 71 \\
                 f. Testing / 75 \\
                 7. POWER (**) / 84 \\
                 a. General Discussion / 84 \\
                 b. Flow Chart for POWER(X,Y) / 88 \\
                 c. Implementation Notes, Non-Decimal Fixed-Point
                 Machines / 90 \\
                 d. Implementation Notes, Non-Decimal Floating-Point
                 Machines / 97 \\
                 e. Implementation Notes, Decimal Floating-Point
                 Machines / 106 \\
                 f. Testing / 113 \\
                 8. SIN/COS / 125 \\
                 a. General Discussion / 125 \\
                 b. Flow Chart for SIN(X)/COS(X) / 127 \\
                 c. Implementation Notes, Non-Decimal Fixed-Point
                 Machines / 129 \\
                 d. Implementation Notes, All Floating-Point Machines /
                 134 \\
                 e. Testing / 139 \\
                 9. TAN/COT / 150 \\
                 a. General Discussion / 150 \\
                 b. Flow Chart for TAN(X)/COTAN(X) / 152 \\
                 c. Implementation Notes, Non-Decimal Fixed-Point
                 Machines / 154 \\
                 d. Implementation Notes, All Floating-Point Machines /
                 159 \\
                 e. Testing / 164 \\
                 10. ASIN/ACOS / 174 \\
                 a. General Discuss i on / 174 \\
                 b. Flow Chart for AS IN(X)/ACOS(X) / 176 \\
                 c. Implementation Not es, Non-Decimal Fixed-Point
                 Machines / 177 \\
                 d. Implementation Notes, All Floating-Point Machines /
                 181 \\
                 e. Testing / 185 \\
                 11. ATAN/ATAN2 / 194 \\
                 a. General Discussion / 194 \\
                 b. Flow Chart for ATAN(X)/ATAN2(V,U) / 196 \\
                 c. Implementation Notes, Non-Decimal Fixed-Point
                 Machines / 198 \\
                 d. Implementation Notes, All Floating-Point Machines /
                 203 \\
                 e. Testing / 207 \\
                 12. SINH/COSH / 217 \\
                 a. General Discussion / 217 \\
                 b. Flow Chart for SINH(X)/COSH(X) / 220 \\
                 c. Implementation Notes, Non-Decimal Fixed-Point
                 Machines / 221 \\
                 d. Implementation Notes, All Floating-Point Machines /
                 225 \\
                 e. Testing / 229",
}

@Article{Cody:1984:PRW,
  author =       "William J. {Cody, Jr.} and Jerome T. Coonen and David
                 M. Gay and K. Hanson and David G. Hough and William
                 Kahan and Richard Karpinski and John F. Palmer and
                 Frederic N. Ris and David Stevenson",
  title =        "A Proposed Radix- and Word-length-independent Standard
                 for Floating-Point Arithmetic",
  journal =      j-IEEE-MICRO,
  volume =       "4",
  number =       "4",
  pages =        "86--100",
  month =        jul # "\slash " # aug,
  year =         "1984",
  CODEN =        "IEMIDZ",
  DOI =          "https://doi.org/10.1109/MM.1984.291224",
  ISSN =         "0272-1732 (print), 1937-4143 (electronic)",
  ISSN-L =       "0272-1732",
  bibdate =      "Thu Dec 14 06:08:58 MST 2000",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/bibnet/authors/c/cody-william-j.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/g/gay-david-m.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeemicro.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 Science Citation Index database (1980--2000)",
  acknowledgement = ack-nj # " and " # ack-nhfb,
  classcodes =   "C5230 (Digital arithmetic methods)",
  classification = "723; 902; 921",
  corpsource =   "Argonne Nat. Lab., IL, USA",
  fjournal =     "IEEE Micro",
  keywords =     "computer software; digital arithmetic; exceptions;
                 floating-point arithmetic; IEEE P854; independent
                 standard; infinity; mathematical techniques --- Digital
                 Arithmetic; NaNs; operations; precision; proposed
                 radix- and word-length-independent standard; radix
                 independent standard; rounding; standardization;
                 standards; traps; word-length-",
  subject =      "K.1 Computing Milieux, THE COMPUTER INDUSTRY,
                 Suppliers \\ G.1.0 Mathematics of Computing, NUMERICAL
                 ANALYSIS, General, Computer arithmetic",
  treatment =    "P Practical",
  xxtitle =      "A Proposed Radix-Independent and
                 Word-Length-Independent Standard for Floating-Point
                 Arithmetic",
}

@Article{Cody:fps-analysis,
  author =       "William J. {Cody, Jr.}",
  title =        "Analysis of Proposals for the Floating-Point
                 Standard",
  journal =      j-COMPUTER,
  volume =       "14",
  number =       "3",
  pages =        "63--69",
  month =        mar,
  year =         "1981",
  bibdate =      "Sun May 2 07:47:15 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See \cite{IEEE:p754}.",
  acknowledgement = ack-nhfb,
}

@Book{Cohen:2010:CSH,
  author =       "Richard Cohen",
  title =        "Chasing the {Sun}: a History of the Star That Gives Us
                 Life",
  publisher =    pub-RANDOM-HOUSE,
  address =      pub-RANDOM-HOUSE:adr,
  pages =        "xxxi + 574",
  year =         "2010",
  ISBN =         "1-4000-6875-4",
  ISBN-13 =      "978-1-4000-6875-3",
  LCCN =         "QB521 .C625 2010",
  bibdate =      "Fri Nov 12 14:45:03 MST 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Sun; history; astronomy; science and civilization",
  tableofcontents = "Sunrise: Mount Fuji \\
                 The sun before science \\
                 Telling stories \\
                 Celebrating the seasons \\
                 The three thousand witnesses \\
                 Terrors of the sky \\
                 Discovering the sun \\
                 The first astronomers \\
                 Enter the Greeks \\
                 Gifts of the Yellow Emperor \\
                 The sultan's turret \\
                 The Earth moves \\
                 Strange seas of thought \\
                 Eclipses and enlightenment \\
                 The sun dethroned \\
                 The sun on Earth \\
                 Sunspots \\
                 The qualities of light \\
                 Beneath the beating sun \\
                 Skin deep \\
                 The breath of life \\
                 The dark biosphere \\
                 Harnessing the sun \\
                 The heavenly guide \\
                 Of calendars and dials \\
                 How time goes by \\
                 The sun in our pocket \\
                 Inspired by a star \\
                 The vital symbol \\
                 Drawing on the sun \\
                 Negative capabilities \\
                 Talk of the day \\
                 Busie Old Foole \\
                 The rising star of politics \\
                 The sun and the future \\
                 Over the horizon \\
                 Under the weather \\
                 The impossible and beyond \\
                 The death of the sun \\
                 Sunset: the Ganges",
}

@Book{Cokinos:2009:FSI,
  author =       "Christopher Cokinos",
  title =        "The Fallen Sky: an Intimate History of Shooting
                 Stars",
  publisher =    "Jeremy P. Tarcher/Penguin",
  address =      "New York, NY, USA",
  pages =        "517",
  year =         "2009",
  ISBN =         "1-58542-720-9",
  ISBN-13 =      "978-1-58542-720-8",
  LCCN =         "QB755 .C65 2009",
  bibdate =      "Thu Nov 12 16:37:15 MST 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy1001/2009017493-b.html;
                 http://www.loc.gov/catdir/enhancements/fy1001/2009017493-d.html",
  abstract =     "Weaving natural history, memoir, and the stories of
                 maverick scientists, daring adventurers, and stargazing
                 dreamers, this book takes us from Antarctica to outer
                 space to tell the tale of how the study of meteorites
                 became a scientific passion.",
  acknowledgement = ack-nhfb,
  subject =      "meteorites; miscellanea",
  tableofcontents = "Prologue: Dust: a brief memoir of overlooked things
                 \\
                 Distances measured in various units \\
                 What breaks out entire: the Eliza Kimberly story \\
                 Higher latitudes: in search of Peary's meteorites \\
                 The weather of belief \\
                 Mr. Barringer's big idea \\
                 Harvey Nininger sees the light \\
                 A serious case of the I wants: passions of the dealers
                 \\
                 Church of the sky \\
                 Life works: the biology of meteorites \\
                 Old fire on blue ice: an Antarctic journey \\
                 Afterword",
}

@Book{Cole:1976:MP,
  author =       "A. J. Cole",
  title =        "Macro Processors",
  volume =       "4",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "viii + 230",
  year =         "1976",
  ISBN =         "0-521-29024-4",
  ISBN-13 =      "978-0-521-29024-1",
  LCCN =         "QA76.C358",
  bibdate =      "Tue Dec 14 23:28:51 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$7.95",
  series =       "Cambridge Computer Science Texts, Editors: E. S. Page
                 and C. M. Reeves and D. E. Conway",
  acknowledgement = ack-nhfb,
}

@Book{Coleman:1988:HMC,
  author =       "Thomas F. Coleman and Charles F. {Van Loan}",
  title =        "Handbook for Matrix Computations",
  volume =       "4",
  publisher =    pub-SIAM,
  address =      pub-SIAM:adr,
  pages =        "vii + 264",
  year =         "1988",
  DOI =          "https://doi.org/10.1137/1.9781611971040",
  ISBN =         "0-89871-227-0 (paperback), 1-61197-104-7 (e-book)",
  ISBN-13 =      "978-0-89871-227-8 (paperback), 978-1-61197-104-0
                 (e-book)",
  LCCN =         "QA188 .C651 1988",
  bibdate =      "Mon Oct 26 07:30:48 1998",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
                 https://www.math.utah.edu/pub/tex/bib/fortran2.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/matlab.bib",
  price =        "US\$34.00",
  series =       "Frontiers in applied mathematics",
  abstract =     "This handbook can be used as a reference by those
                 actively engaged in scientific computation. It can also
                 serve as a practical companion text in a numerical
                 methods course that involves a significant amount of
                 linear algebraic computation. The book has four
                 chapters, each being fairly independent of the others.
                 Our treatment of Fortran 77 in Chapter 1 involves a
                 much stronger emphasis on arrays than is accorded by
                 other authors. We also assume that the reader has
                 experience with some high-level programming language.
                 This might be in the form of a recent course in Pascal
                 or a course in Fortran taken many years ago and now
                 half-forgotten. The second chapter is about the Basic
                 Linear Algebra Subprograms (BLAS). The elementary
                 linear algebra that underpins the BLAS makes them a
                 good vehicle for acquainting the beginning student with
                 modular programming and the importance of ``thinking
                 vector'' when organizing a matrix computation. Chapter
                 3 is concerned with LINPACK, a highly acclaimed package
                 that is suitable for many linear equation and least
                 square calculations. The last chapter is about MATLAB,
                 an interactive system in which it is possible to couch
                 sophisticated matrix computations at a very high
                 level.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  shorttableofcontents = "1: A subset of Fortran 77 \\
                 2: The BLAS \\
                 3: LINPACK \\
                 4: MATLAB",
  subject =      "Matrices; Data processing",
  tableofcontents = "Preface / vii \\
                 1: A Subset of Fortran 77 / 1 \\
                 1.1: Basics / 3 \\
                 1.2: Logical Operations / 18 \\
                 1.3: Loops / 25 \\
                 1.4: Arrays / 32 \\
                 1.5: Subprograms / 42 \\
                 1.6: Arrays and Subprograms / 58 \\
                 1.7: Input and Output / 69 \\
                 1.8: Complex Arithmetic / 82 \\
                 1.9: Programming Tips / 87 \\
                 Appendix: Fortran 77 Built-in Functions / 101 \\
                 2: The BLAS / 105 \\
                 2.1: Bookkeeping Operations / 107 \\
                 2.2: Vector Operations / 112 \\
                 2.3: Norm Computations / 119 \\
                 2.4: Givens Rotations / 125 \\
                 2.5: Double Precision and Complex Versions / 132 \\
                 3: LINPACK / 139 \\
                 3.1: Triangular Systems / 141 \\
                 3.2: General Systems / 147 \\
                 3.3: Symmetric Systems / 152 \\
                 3.4: Banded Systems / 161 \\
                 3.5: The QR Factorization / 166 \\
                 3.6: The Singular Value Decomposition / 175 \\
                 3.7: Double Precision and Complex Versions / 180 \\
                 4: MATLAB / 187 \\
                 4.1: Basics / 189 \\
                 4.2: Loops and Conditionals / 203 \\
                 4.3: Working with Submatrices / 212 \\
                 4.4: Built-in Functions / 219 \\
                 4.5: Functions / 232 \\
                 4.6: Factorization / 243 \\
                 4.7: Miscellaneous / 256 \\
                 References / 261 \\
                 Index / 262",
}

@Article{Collinson:awk,
  author =       "Peter Collinson",
  title =        "Awk",
  journal =      j-SUNEXPERT,
  volume =       "2",
  number =       "1",
  pages =        "33--36",
  month =        jan,
  year =         "1991",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Colwell:2005:PCP,
  author =       "Robert P. Colwell",
  title =        "The {Pentium} Chronicles: The People, Passion, and
                 Politics Behind {Intel}'s Landmark Chips",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xix + 187",
  year =         "2005",
  ISBN =         "0-471-73617-1",
  ISBN-13 =      "978-0-471-73617-2",
  LCCN =         "HD9696.S44 I563 2006",
  bibdate =      "Fri Dec 09 06:57:21 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$24.95",
  abstract =     "A landmark chip like the P6 or Pentium 4 doesn't just
                 happen. It takes a confluence of brilliant minds,
                 dedication for beyond the ordinary, and management that
                 nurtures the vision while keeping a firm hand on the
                 project tiller.As chief architect of the P6, Robert
                 Colwell offers a unique perspective as he unfolds the
                 saga of a project that ballooned from a few architects
                 to hundreds of engineers, many just out of school. For
                 more than a treatise on project management, The Pentium
                 Chronicles gives the rationale, the personal triumphs,
                 and the humor that characterized the P6 project, an
                 undertaking that broke all technical boundaries by
                 being the first to try an out-of order, speculative
                 super-scalar architecture in a microprocessor.In
                 refreshingly down-to-earth language, organized around a
                 framework ``we wish we had known about then,''
                 Chronicles describes the architecture and key decisions
                 that shaped the P6, Intel's most successful chip to
                 date. Colwell's inimitable style will have readers
                 laughing out loud at the project team's creative
                 solutions to well-known problems. From architectural
                 planning in a storage room jimmied open with a credit
                 card, to a marketing presentation using shopping carts,
                 he takes readers through events from the projects
                 beginning through its production. As Colwell himself
                 recognizes, success is all about learning from others,
                 and Chronicles is filled with stories of ordinary and
                 exceptional people and frank assessments of ``oops''
                 moments, like the infamous FDIV bug.As its subtitle
                 implies, the book looks beyond RTL models and
                 transistors to the Intel culture, often poking fun at
                 corporate policies, like team-building exercises in
                 which engineers ruthlessly shoot down each other's
                 plans. Whatever your level of computing expertise,
                 Chronicles will delight and inform you, leaving you
                 with a better understanding of what it takes to create
                 and grow a winning product.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Foreword \\
                 Preface \\
                 1: Introduction \\
                 P6 project context \\
                 Betting on CISC \\
                 Proliferation thinking \\
                 The gauntlet \\
                 Developing big ideas \\
                 Defining success and failure \\
                 Senior wisdom \\
                 Four project phases \\
                 The business of excellence \\
                 2: The concept phase \\
                 Of immediate concern \\
                 Success factors \\
                 Clear goals \\
                 The right people \\
                 P6 senior leadership \\
                 Setting the leadership tone \\
                 Managing mechanics \\
                 Physical context matters \\
                 The storage room solution--: Beyond the whiteboard \\
                 ``Kooshing'' the talkers \\
                 A data-driven culture \\
                 The right tool \\
                 The ``what would happen if'' game \\
                 DFA frontiers \\
                 Performance \\
                 Benchmark selections \\
                 Avoiding myopic do-loops \\
                 Floating-point chickens and eggs \\
                 Legacy code performance \\
                 Intelligent projections \\
                 All design teams are not equal \\
                 Overpromise or overdeliver? \\
                 Customer visits \\
                 Loose lips \\
                 Memorable moments \\
                 Microsoft \\
                 Novell \\
                 Compaq \\
                 Insights from input \\
                 Not-so-secret instructions \\
                 Help from the software world \\
                 The truth about hardware and software \\
                 Establishing the design team \\
                 Roles and responsibilities \\
                 Presilicon validation \\
                 Wizard problem solving \\
                 Making microcode a special case \\
                 Cubicle floorplanning \\
                 Architects, engineers, and schedules \\
                 Coding, egos, subterfuge \\
                 3: The refinement phase \\
                 Of immediate concern \\
                 Success factors \\
                 Handling the nonquantifiable \\
                 Managing new perspectives \\
                 Planning for complexity \\
                 Behavioral models \\
                 Managing a changing POR \\
                 The wrong way to plan \\
                 Engineering change orders \\
                 The origin of change \\
                 When, where, who \\
                 Communicating change \\
                 Timely resolution, no pocket vetoes \\
                 The ECO czar \\
                 ECO control and the project POR \\
                 The bridge from architecture to design \\
                 Focus groups \\
                 Product quality--: Mismanaging design errors \\
                 Make and example of the offender \\
                 Hire only geniuses \\
                 Flog validation \\
                 Avoid/find/survive \\
                 Design to avoid bugs \\
                 When bugs get in anyway, find them before production
                 \\
                 Identifying bugs \\
                 Tracking bugs \\
                 Managing validation \\
                 Plan to survive bugs that make it to production \\
                 A six-step plan for high product quality \\
                 The design review \\
                 How not to do a review \\
                 When to do review \\
                 Another one rides the bus4: The realization phase \\
                 Of immediate concern \\
                 Success factors \\
                 Balanced decision making \\
                 Documentation and communication \\
                 Capturing unit decisions \\
                 Integrating architects and design engineers \\
                 Performance and feature trade-offs \\
                 (Over- ) optimizing performance \\
                 Perfect A; mediocre B, C, and D \\
                 The technical purity trap \\
                 The unbreakable computer \\
                 Performance-monitoring facilities \\
                 Counters and triggers \\
                 Protecting the family jewels \\
                 Testability hooks \\
                 Gratuitous innovation considered harmful \\
                 Validation and model health \\
                 A thankless job \\
                 Choosing a metric \\
                 Health and the tapeout target \\
                 Metric doldrums \\
                 Coordinating with other projects \\
                 Performance estimation \\
                 The overshooting scheme \\
                 Psychological stuff \\
                 Simulator wars \\
                 Project management \\
                 Awards, rewards, and recognition \\
                 The dark side of awards \\
                 Project management by grass cutting \\
                 Marginal return from incremental heads \\
                 Project tracking \\
                 The experiment \\
                 The mystery of the unchanging curve \\
                 Flexibility is required of all \\
                 The simplification effort5: The production phase \\
                 Of immediate concern \\
                 Functional correctness \\
                 Speed paths \\
                 Chip sets and platforms \\
                 Success factors \\
                 Prioritizing war room issues \\
                 Managing the microcode patch space \\
                 Product care and feeding \\
                 Test vectors \\
                 Performance surprises \\
                 Feature surprises \\
                 Executive pedagogy and shopping carts \\
                 Managing to the next processor \\
                 The Windows NT saga \\
                 Product rollout \\
                 On stage with Andy Grove \\
                 How not to give magazine interviews \\
                 Speech training \\
                 6: The people factor \\
                 Hiring and firing \\
                 Rational recruitment \\
                 Hiring and the promotion list \\
                 Firing \\
                 Policy wars \\
                 Corporate disincentives \\
                 The Led Zeppelin incident \\
                 Exiting the exit bag check \\
                 Sailboats and ditches \\
                 Orbiting the bathrooms \\
                 Management by objective \\
                 We are so rich, we must be good \\
                 Burnout \\
                 7: Inquiring minds like yours \\
                 What was Intel thinking with that chip ID tag, which
                 caused such a public uproar? \\
                 Was the P6 project affected by the Pentium's floating
                 point divider bug? \\
                 Why did Pentium have a flawed floating point divider,
                 when its predecessor, the i486, did not?How would you
                 respond to the claim that the P6 is built on ideas
                 stolen from Digital Equipment Corp.? \\
                 What did the P6 team think about Intel's Itanium
                 Processor Family? \\
                 Is Intel the sweatshop some people say it is? \\
                 How can I become the chief architect of a company such
                 as Intel? \\
                 Why did you leave Intel? \\
                 And in closing I'd just like to say \\
                 Bibliography \\
                 Appendix \\
                 Out-of-order, superscalar microarchitecture: a primer
                 \\
                 Plausibility checking \\
                 Glossary \\
                 Index",
}

@Book{Comer:1984:OSD,
  author =       "Douglas E. Comer",
  title =        "Operating Systems Design. The {XINU} Approach",
  volume =       "1",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  year =         "1984",
  ISBN =         "0-13-637539-1",
  ISBN-13 =      "978-0-13-637539-5",
  LCCN =         "QA76.6 .C6275 1984",
  bibdate =      "Tue Dec 14 23:29:35 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Introduction and overview \\
                 An overview of the machine and run-time environment \\
                 List and queue manipulation \\
                 Scheduling and context switching \\
                 More process management \\
                 Process coordination \\
                 Message passing \\
                 Memory management \\
                 Interrupt processing \\
                 Real-time clock management \\
                 Device independent input and output \\
                 An example device driver \\
                 System initialization \\
                 A data link communication driver \\
                 High-level memory management and message passing \\
                 Frame-level network communication \\
                 A disk driver \\
                 File systems \\
                 Exception handling and support routines \\
                 System configuration \\
                 Appendices \\
                 Bibliography \\
                 Index",
}

@Book{Comer:1987:OSD,
  author =       "Douglas E. Comer",
  title =        "Operating Systems Design. Internetworking with
                 {XINU}",
  volume =       "2",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  year =         "1987",
  ISBN =         "0-13-637414-X",
  ISBN-13 =      "978-0-13-637414-5",
  LCCN =         "QA76.6 .C6275 1984",
  bibdate =      "Tue Dec 14 23:30:03 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Comer:1988:ITI,
  author =       "Douglas E. Comer",
  title =        "Internetworking with {TCP\slash IP}. Principles,
                 Protocols, and Architecture",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  year =         "1988",
  ISBN =         "0-13-470154-2",
  ISBN-13 =      "978-0-13-470154-7",
  LCCN =         "TK5105.5 .C59 1988",
  bibdate =      "Tue Dec 14 23:41:49 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$27.00",
  acknowledgement = ack-nhfb,
}

@Book{Comer:1991:ITI,
  author =       "Douglas E. Comer and David L. Stevens",
  title =        "Internetworking with {TCP\slash IP}. {Design},
                 Implementation, and Internals",
  volume =       "2",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  year =         "1991",
  ISBN =         "0-13-465378-5, 0-13-472242-6",
  ISBN-13 =      "978-0-13-465378-5, 978-0-13-472242-9",
  LCCN =         "TK5105.5 .C59 1991-92",
  bibdate =      "Tue Dec 14 23:29:18 1993",
  bibsource =    "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/unix.bib",
  acknowledgement = ack-nhfb,
}

@Book{Comer:2000:IBE,
  author =       "Douglas Comer",
  title =        "The {Internet} book: everything you need to know about
                 computer networking and how the {Internet} works",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  edition =      "Third",
  pages =        "xxvi + 351",
  year =         "2000",
  ISBN =         "0-13-030852-8",
  ISBN-13 =      "978-0-13-030852-8",
  LCCN =         "TK5105.875.I57 C65 2000",
  bibdate =      "Mon Apr 29 11:50:37 MDT 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/internet2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  keywords =     "Internet",
  tableofcontents = "1: The Internet Has Arrived \\
                 2: Getting Started: Hands-On Experience \\
                 3: Telephones Everywhere \\
                 4: The World Was Once Analog \\
                 5: The Once And Future Digital Network \\
                 6: Basic Communication \\
                 7: The Local Area Network Arrives \\
                 8: Internet: The Early Years \\
                 9: Two Decades Of incredible Growth \\
                 10: The Global Internet \\
                 11: A Global Information Infrastructure \\
                 12: Packet Switching \\
                 13: Internet: A Network Of Networks \\
                 14: ISPs And Network Connections \\
                 15: IP: Software To Create A Virtual Network \\
                 16: TCP: Software For Reliable Communication \\
                 17: Clients + Servers = Distributed Computing \\
                 18: Names For Computers \\
                 19: Why The Internet Works Well \\
                 20: Electronic Mail \\
                 21: Bulletin Board Service (Network News) \\
                 22: Browsing The World Wide Web \\
                 23: World Wide Web Documents (HTML) \\
                 24: Advanced Web Technologies (Forms, Frames, Plugins,
                 CGI, Java, JavaScript) \\
                 25: Automated Web Search (Search Engines) \\
                 26: Audio And Video Communication \\
                 27: Faxes And Files (FTP) \\
                 28: Remote Login And Remote Desktops (TELNET) \\
                 29: Facilities For Secure Communication \\
                 30: Electronic Commerce And Business \\
                 31: The Global Digital Library \\
                 Appendix 1: Example Netnews Newsgroups \\
                 Appendix 2: Glossary Of Internet Terms",
}

@Book{Comer:2000:ITI,
  author =       "Douglas E. Comer",
  title =        "Internetworking with {TCP\slash IP}: Volume 1.
                 Principles, Protocols, and Architectures",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  edition =      "Fourth",
  pages =        "xxix + 750",
  year =         "2000",
  ISBN =         "0-13-018380-6 (hardcover)",
  ISBN-13 =      "978-0-13-018380-4 (hardcover)",
  LCCN =         "TK5105.585 .C66 2000 v.1, 3 (2000-c2001)",
  bibdate =      "Mon Apr 29 11:50:37 MDT 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/internet2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  keywords =     "client/server computing; Internetworking
                 (telecommunication); TCP/IP (computer network
                 protocol)",
  tableofcontents = "1: Introduction And Overview \\
                 2: Review Of Underlying Network Technologies \\
                 3: Internetworking Concept And Architectural Model. \\
                 4: Classful Internet Addresses \\
                 5: Mapping Internet Addresses To Physical Addresses
                 (ARP) \\
                 6: Determining An Internet Address At Startup (RARP).
                 \\
                 7: Internet Protocol: Connectionless Datagram Delivery.
                 \\
                 8: Internet Protocol: Routing IP Datagrams \\
                 9: Internet Protocol: Error And Control Messages (ICMP)
                 \\
                 10: Classless And Subnet Address Extensions (CIDR). \\
                 11: Protocol Layering \\
                 12: User Datagram Protocol (UDP) \\
                 13: Reliable Stream Transport Service (TCP) \\
                 14: Routing: Cores, Peers, And Algorithms \\
                 15: Routing: Exterior Gateway Protocols And Autonomous
                 Systems (BGP) \\
                 16: Routing: In An Autonomous System (RIP, OSPF, HELLO)
                 \\
                 17: Internet Multicasting \\
                 18: TCP/IP Over ATM Networks \\
                 19: Mobile IP \\
                 20: Private Network Interconnection (NAT, VPN) \\
                 21: Client-Server Model Of Interaction \\
                 22: The Socket Interface \\
                 23: Bootstrap And Autoconfiguration (BOOTP, DHCP). \\
                 24: The Domain Name System (DNS) \\
                 25: Applications: Remote Login (TELNET, Rlogin) \\
                 26: Applications: File Transfer And Access (FTP, TFTP,
                 NFS) \\
                 27: Applications: Electronic Mail (SMTP, POP, IMAP,
                 MIME) \\
                 28: Applications: World Wide Web (HTTP) \\
                 29: Applications: Voice And Video Over IP (RTP) \\
                 30: Applications: Internet Management (SNMP) \\
                 31: Summary Of Protocol Dependencies \\
                 32: Internet Security And Firewall Design (IPsec). \\
                 33: The Future Of TCP/IP (IPv6) \\
                 Appendix 1: A Guide To RFCs \\
                 Appendix 2: Glossary Of Internetworking Terms And
                 Abbreviations",
}

@Book{Comer:2013:IT,
  author =       "Douglas E. Comer",
  title =        "Internetworking with {TCP}",
  publisher =    "Pearson",
  address =      "New York, NY, USA",
  edition =      "Sixth",
  pages =        "xxviii + 689",
  year =         "2013",
  ISBN =         "0-13-608530-X (hardcover)",
  ISBN-13 =      "978-0-13-608530-0 (hardcover)",
  LCCN =         "TK5105.585 .C66 2014",
  bibdate =      "Mon Dec 9 08:04:33 MST 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "An internationally best-selling, conceptual
                 introduction to the TCP/IP protocols and
                 Internetworking, this book interweaves a clear
                 discussion of fundamentals and scientific principles
                 with details and examples drawn from the latest
                 technologies. Leading author Douglas Comer covers
                 layering and packet formats for all the Internet
                 protocols, including TCP, IPv4, IPv6, DHCP, and DNS. In
                 addition, the text explains new trends in Internet
                 systems, including packet classification, Software
                 Defined Networking (SDN), and mesh protocols used in
                 The Internet of Things. The text is appropriate for
                 individuals interested in learning more about TCP/IP
                 protocols, Internet architecture, and current
                 networking technologies, as well as engineers who build
                 network systems. It is suitable for junior to
                 graduate-level courses in Computer Networks, Data
                 Networks, Network Protocols, and Internetworking.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  shorttableofcontents = "vol. 1. Principles, protocols, and
                 architecture \\
                 vol. 2. Design, implementation, and internals \\
                 vol. 3. Client-server programming and applications",
  subject =      "TCP/IP (Computer network protocol); Client/server
                 computing; Internetworking (Telecommunication); TCP/IP;
                 Klient-server-teknik; Datan{\"a}t; Client/server
                 computing; Internetworking (Telecommunication); TCP/IP
                 (Computer network protocol)",
  tableofcontents = "Overview of underlying network technologies \\
                 Internetworking concept and architectural model \\
                 Protocol layering \\
                 Internet addressing \\
                 Mapping internet addresses to physical addresses (ARP)
                 \\
                 Internet protocol: connectionless datagram delivery
                 (IPv4, IPv6) \\
                 Internet protocol: forwarding IP datagrams \\
                 Internet protocol: error and control messages (ICMP)
                 \\
                 User datagram protocol (UDP) \\
                 Reliable stream transport service (TCP) \\
                 Routing architecture: cores, peers and algorithms \\
                 Routing among autonomous systems (BGP) \\
                 Routing within an autonomous system (RIP, RIPng, OSPF,
                 IS-IS) \\
                 Internet multicasting \\
                 Label switching, flows and MPLS \\
                 Packet classification \\
                 Mobility and mobile IP \\
                 Network virtualization: VPNs, NATs and overlays \\
                 Client-server model of interaction \\
                 The socket API \\
                 Bootstrap and autoconfiguration (DHCP, NDP, IPv6-ND)
                 \\
                 The domain name system (DNS) \\
                 Electronic mail (SMTP, POP, IMAP, MIME) \\
                 World wide web (HTTP) \\
                 Voice and voice over IP (RTP, RSVP \\
                 QoS) \\
                 Network management (SNMP) \\
                 Software defined networking (SDN, OperFlow) \\
                 Internet security and firewall design (IPsec, SSL)",
}

@Book{Companion:1964:CB,
  author =       "Audrey L. Companion",
  title =        "Chemical Bonding",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "vi + 155",
  year =         "1964",
  LCCN =         "QD461 .C63",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Comrie:1964:KFF,
  author =       "L. J. Comrie",
  title =        "{Knott}'s Four-Figure Mathematical Tables",
  publisher =    pub-W-R-CHAMBERS,
  address =      pub-W-R-CHAMBERS:adr,
  year =         "1964",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Comrie:1987:WML,
  editor =       "Bernard Comrie",
  title =        "The World's Major Languages",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  pages =        "xiii + 1025",
  year =         "1987",
  ISBN =         "0-19-520521-9 (hardcover), 0-19-506511-5 (paperback)",
  ISBN-13 =      "978-0-19-520521-3 (hardcover), 978-0-19-506511-4
                 (paperback)",
  LCCN =         "P371.W6 1987",
  bibdate =      "Sat Sep 28 17:27:01 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Reprinted in paperback in 1990.",
  price =        "US\$35.00",
  acknowledgement = ack-nhfb,
}

@Book{Conant:2005:EPR,
  author =       "Jennet Conant",
  title =        "{109 East Palace}: {Robert Oppenheimer} and the secret
                 city of {Los Alamos}",
  publisher =    pub-SIMON-SCHUSTER,
  address =      pub-SIMON-SCHUSTER:adr,
  pages =        "xviii + 425 + 16",
  year =         "2005",
  ISBN =         "0-7432-5007-9",
  ISBN-13 =      "978-0-7432-5007-8",
  LCCN =         "QC773.A1 C66 2005",
  bibdate =      "Mon Dec 12 15:27:36 MST 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 melvyl.cdlib.org:210/CDL90",
  abstract =     "This book captures the drama of 27 perilous months at
                 Los Alamos, a secret city cut off from the rest of
                 society, ringed by barbed wire, where Oppenheimer and
                 his young recruits lived as virtual prisoners of the
                 U.S. government---freshly minted secretaries and
                 worldly scientists contending with living conditions
                 straight out of pioneer days, racing to build the first
                 atomic bomb before Germany could. Oppenheimer was as
                 arrogant as he was inexperienced, and few believed the
                 38-year-old theoretical physicist would succeed. Yet
                 despite the obstacles, he forged a vibrant community
                 through the sheer force of his personality.",
  acknowledgement = ack-nhfb,
  remark =       "Maps on lining papers.",
  subject =      "Atomic bomb; United States; History; McKibbin, Dorothy
                 Scarritt; Oppenheimer, J. Robert",
  subject-dates = "1897--1985; 1904--1967",
  tableofcontents = "Charmed \\
                 A most improbable choice \\
                 The bluest eyes I've ever seen \\
                 Cowboy boots and all \\
                 The gatekeeper \\
                 The professor and the general \\
                 Summer camp \\
                 Lost almost \\
                 Welcome distractions \\
                 Nothing dangerous \\
                 The big shot \\
                 Baby boom \\
                 Summer lightning \\
                 A bad case of the jitters \\
                 Playing with fire \\
                 A dirty trick \\
                 Everything was different \\
                 A rain of ruin \\
                 By our works we are committed \\
                 Elysian dreamer \\
                 Scorpions in a bottle \\
                 Fallout",
}

@Book{Conant:2009:IRD,
  author =       "Jennet Conant",
  title =        "The Irregulars: {Roald Dahl} and the {British} Spy
                 Ring in Wartime {Washington}",
  publisher =    pub-SIMON-SCHUSTER,
  address =      pub-SIMON-SCHUSTER:adr,
  pages =        "xxii + 391",
  year =         "2009",
  ISBN =         "0-7432-9458-0 (hardcover), 0-7432-9459-9 (paperback)",
  ISBN-13 =      "978-0-7432-9458-4 (hardcover), 978-0-7432-9459-1
                 (paperback)",
  LCCN =         "M10.F03629",
  bibdate =      "Mon Oct 25 10:46:47 MDT 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 library.ox.ac.uk:210/ADVANCE",
  acknowledgement = ack-nhfb,
  remark =       "Originally published in 2008.",
  subject =      "Dahl, Roald; career in espionage; World War,
                 1939--1945; Secret Service; Great Britain; United
                 States; propaganda; propaganda, British",
  tableofcontents = "1: The usual drill \\
                 2: Piece of cake \\
                 3: Enthusiastic amateurs \\
                 4: Special relationships \\
                 5: Buffers \\
                 6: One long loaf \\
                 7: The war in Washington \\
                 8: Dirty work \\
                 9: Good value \\
                 10: Enemy maneuvers \\
                 11: The glamour set \\
                 12: Full lives",
}

@Book{Conant:2020:GSC,
  author =       "Jennet Conant",
  title =        "The Great Secret: the Classified {World War II}
                 Disaster That Launched the War on Cancer",
  publisher =    "W. W. Norton and Company, Inc.",
  address =      "New York, NY",
  pages =        "xviii + 380 + 8",
  year =         "2020",
  ISBN =         "0-393-86843-5 (paperback), 1-324-00250-6 (hardcover),
                 1-324-00251-4 (e-book)",
  ISBN-13 =      "978-0-393-86843-2 (paperback), 978-1-324-00250-5
                 (hardcover), 978-1-324-00251-2 (e-book)",
  LCCN =         "RM260 .C63 2020; RM261 .C66 2020",
  bibdate =      "Tue Dec 21 10:49:39 MST 2021",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "On the night of December 2, 1943, the Luftwaffe bombed
                 a critical Allied port in Bari, Italy, sinking
                 seventeen ships and killing over a thousand servicemen
                 and hundreds of civilians. Caught in the surprise air
                 raid was the John Harvey, an American Liberty ship
                 carrying a top-secret cargo of 2,000 mustard bombs to
                 be used in retaliation if the Germans resorted to gas
                 warfare. After young sailors began suddenly dying with
                 mysterious symptoms, Lieutenant Colonel Stewart
                 Alexander, a doctor and chemical weapons expert, was
                 dispatched to investigate. He quickly diagnosed mustard
                 gas exposure, which both Churchill and Eisenhower
                 denied. But Alexander's breakthrough observations about
                 the toxic effects of mustard on white blood cells, as
                 well as the heroic perseverance of Colonel Cornelius P.
                 Rhoads --- a researcher and doctor as brilliant as he
                 was arrogant and self-destructive --- were instrumental
                 in ushering in a new era of cancer research led by the
                 Sloan Kettering Institute.",
  acknowledgement = ack-nhfb,
  subject =      "Chemotherapy; History; Cancer; Treatment; Research;
                 Mustard gas; Toxicology; World War, 1939-1945; Health
                 aspects; Drug Therapy; Neoplasms; therapy; HISTORY /
                 Military / World War II.; MEDICAL / Chemotherapy.;
                 MEDICAL / History.; Toxicology.; Chemotherapy.;
                 Treatment.; Research.; Chemotherapy.; Treatment.;
                 Research.",
  tableofcontents = "Prologue: ``Little Pearl Harbor'' / ix \\
                 1: ``A Regiment Of Wizards'' / 1 \\
                 2: ``The Die Is Cast'' / 36 \\
                 3: ``Angels In Long Underwear'' / 60 \\
                 4: ``Journey Into The Nightmare'' / 74 \\
                 5: ``A Special Affinity'' / 99 \\
                 6: ``Recommendation To Secrecy'' / 125 \\
                 7: ``Magnum Opus'' / 149 \\
                 8: ``Forgotten Front'' / 174 \\
                 9: ``A Riddle Wrapped In A Mystery'' / 194 \\
                 10: ``Frontal Attack'' / 213 \\
                 11: Trials And Tribulations / 236 \\
                 12: ``The Sword And The Ploughshare'' / 250 \\
                 Epilogue: Belated justice / 292",
}

@Book{Conrac:1985:RGH,
  author =       "{Conrac Division}",
  title =        "Raster Graphics Handbook",
  publisher =    pub-VAN-NOSTRAND-REINHOLD,
  address =      pub-VAN-NOSTRAND-REINHOLD:adr,
  pages =        "v + 345",
  year =         "1985",
  ISBN =         "0-442-21608-4",
  ISBN-13 =      "978-0-442-21608-5",
  LCCN =         "T385 .C64 1985",
  bibdate =      "Tue Dec 14 22:44:38 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Conway:1996:BN,
  author =       "John H. Conway and Richard K. Guy",
  title =        "The Book of Numbers",
  publisher =    pub-COPERNICUS,
  address =      pub-COPERNICUS:adr,
  pages =        "ix + 310",
  year =         "1996",
  ISBN =         "0-387-97993-X",
  ISBN-13 =      "978-0-387-97993-9",
  LCCN =         "QA241 .C6897 1996",
  MRclass =      "00A08, 00A05",
  bibdate =      "Mon Dec 06 15:47:43 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$35.00",
  abstract =     "Journey through the world of numbers with the foremost
                 authorities and writers in the field. John Horton
                 Conway and Richard K. Guy are two of the most
                 accomplished, creative, and engaging number theorists
                 any mathematically minded reader could hope to
                 encounter. In this book, Conway and Guy lead the reader
                 on an imaginative, often astonishing tour of the
                 landscape of numbers. The Book of Numbers is just that
                 --- an engagingly written, heavily illustrated
                 introduction to the fascinating, sometimes surprising
                 properties of numbers and number patterns. The book
                 opens up a world of topics, theories, and applications,
                 exploring intriguing aspects of real numbers, systems,
                 arrays and sequences, and much more. Readers will be
                 able to use figures to figure out figures, rub elbows
                 with famous families of numbers, prove the primacy of
                 primes, fathom the fruitfulness of fractions, imagine
                 imaginary numbers, investigate the infinite and
                 infinitesimal and more.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1 The Romance of Numbers \\
                 2 Figures from Figures: Doing Arithmetic and Algebra by
                 Geometry \\
                 3 What Comes Next? \\
                 4 Famous Families of Numbers \\
                 5 The Primacy of Primes \\
                 6 Further Fruitfulness of Fractions \\
                 7 Geometric Problems and Algebraic Numbers \\
                 8 Imagining Imaginary Numbers \\
                 9 Some Transcendental Numbers \\
                 10 Infinite and Infinitesimal Numbers",
}

@Article{Coonen:fps-guide,
  author =       "Jerome T. Coonen",
  title =        "An Implementation Guide to a Proposed Standard for
                 Floating Point Arithmetic",
  journal =      j-COMPUTER,
  volume =       "13",
  number =       "1",
  pages =        "68--79",
  month =        jan,
  year =         "1980",
  bibdate =      "Sun May 2 07:47:54 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See errata in \cite{Coonen:fps-guide-errata}. See
                 \cite{IEEE:p754}.",
  acknowledgement = ack-nhfb,
}

@Article{Coonen:fps-guide-errata,
  author =       "Jerome T. Coonen",
  title =        "Errata: An Implementation Guide to a Proposed Standard
                 for Floating Point Arithmetic",
  journal =      j-COMPUTER,
  volume =       "14",
  number =       "3",
  pages =        "62",
  month =        mar,
  year =         "1981",
  bibdate =      "Sun May 2 07:47:35 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See also \cite{Coonen:fps-guide,IEEE:p754}.",
  acknowledgement = ack-nhfb,
}

@Article{Coonen:ufl-denorm,
  author =       "Jerome T. Coonan",
  title =        "Underflow and the Denormalized Numbers",
  journal =      j-COMPUTER,
  volume =       "14",
  number =       "3",
  pages =        "75--87",
  month =        mar,
  year =         "1981",
  bibdate =      "Sun May 2 07:48:05 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See \cite{IEEE:p754}.",
  acknowledgement = ack-nhfb,
}

@Book{Cooper:2004:EC,
  author =       "Keith D. (Keith Daniel) Cooper and Linda Torczon",
  title =        "Engineering a Compiler",
  publisher =    pub-MORGAN-KAUFMANN,
  address =      pub-MORGAN-KAUFMANN:adr,
  pages =        "xxx + 801",
  year =         "2004",
  ISBN =         "1-55860-698-X (paperback)",
  ISBN-13 =      "978-1-55860-698-2 (paperback)",
  LCCN =         "QA76.76.C65 C675 2005",
  bibdate =      "Sat Nov 5 12:24:42 MST 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "ftp://uiarchive.cso.uiuc.edu/pub/etext/gutenberg/;
                 http://www.loc.gov/catdir/description/els051/2004268209.html;
                 http://www.mkp.com/engineeringacompiler/",
  abstract =     "The proliferation of processors, environments, and
                 constraints on systems has cast compiler technology
                 into a wider variety of settings, changing the compiler
                 and compiler writer's role. No longer is execution
                 speed the sole criterion for judging compiled code.
                 Today, code might be judged on how small it is, how
                 much power it consumes, how well it compresses, or how
                 many page faults it generates. In this evolving
                 environment, the task of building a successful compiler
                 relies upon the compiler writer's ability to balance
                 and blend algorithms, engineering insights, and careful
                 planning. Today's compiler writer must choose a path
                 through a design space that is filled with diverse
                 alternatives, each with distinct costs, advantages, and
                 complexities. Engineering a Compiler explores this
                 design space by presenting some of the ways these
                 problems have been solved, and the constraints that
                 made each of those solutions attractive. By presenting
                 the parameters of the problem and their impact on
                 compiler design, the authors convey both the depth of
                 the problems and the breadth of possible solutions.
                 Their goal is to show readers that real tradeoffs
                 exist, and that the impact of those choices can be both
                 subtle and far-reaching.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "Compilers (Computer programs)",
  tableofcontents = "1: Overview of Compilation \\
                 2: Scanning \\
                 3: Parsing \\
                 4: Context-Sensitive Analysis \\
                 5: Intermediate Representations \\
                 6: The Procedure Abstraction \\
                 7: Code Shape \\
                 8: Introduction to Code Optimization \\
                 9: Data-Flow Analysis \\
                 10: Scalar Optimizations \\
                 11: Instruction Selection \\
                 12: Instruction Scheduling \\
                 13: Register Allocation \\
                 Appendix A: ILOC",
}

@Book{Cooper:2011:EC,
  author =       "Keith D. (Keith Daniel) Cooper and Linda Torczon",
  title =        "Engineering a compiler",
  publisher =    pub-MORGAN-KAUFMANN,
  address =      pub-MORGAN-KAUFMANN:adr,
  edition =      "Second",
  pages =        "xxiii + 800",
  year =         "2011",
  ISBN =         "0-12-088478-X",
  ISBN-13 =      "978-0-12-088478-0",
  LCCN =         "QA76.76.C65 C675 2011",
  bibdate =      "Sat Nov 5 12:24:42 MST 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://mkp.com/news/engineering-a-compiler-2nd-edition",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "Compilers (Computer programs)",
  tableofcontents = "CHAPTER 1 Overview of Compilation \\
                 1.1 Introduction \\
                 1.2 Compiler Structure \\
                 1.3 Overview of Translation \\
                 1.4 Summary and Perspective \\
                 \\
                 CHAPTER 2 Scanners \\
                 2.1 Introduction \\
                 2.2 Recognizing Words \\
                 2.3 Regular Expressions \\
                 2.4 From Regular Expression to Scanner \\
                 2.5 Implementing Scanners \\
                 2.6 Advanced Topics \\
                 2.7 Chapter Summary and Perspective \\
                 \\
                 CHAPTER 3 Parsers \\
                 3.1 Introduction \\
                 3.2 Expressing Syntax \\
                 3.3 Top-Down Parsing \\
                 3.4 Bottom-Up Parsing \\
                 3.5 Practical Issues \\
                 3.6 Advanced Topics 1 \\
                 3.7 Summary and Perspective \\
                 \\
                 CHAPTER 4 Context-Sensitive Analysis \\
                 4.1 Introduction \\
                 4.2 An Introduction to Type Systems \\
                 4.3 The Attribute-Grammar Framework \\
                 4.4 Ad Hoc Syntax-Directed Translation \\
                 4.5 Advanced Topics \\
                 4.6 Summary and Perspective \\
                 \\
                 CHAPTER 5 Intermediate Representations \\
                 5.1 Introduction \\
                 5.2 Graphical IRs \\
                 5.3 Linear IRs \\
                 5.4 Mapping Values to Names \\
                 5.5 Symbol Tables \\
                 5.6 Summary and Perspective \\
                 \\
                 CHAPTER 6 The Procedure Abstraction \\
                 6.1 Introduction \\
                 6.2 Procedure Calls \\
                 6.3 Name Spaces 2 \\
                 6.4 Communicating Values Between Procedures \\
                 6.5 Standardized Linkages \\
                 6.6 Advanced Topics \\
                 6.7 Summary and Perspective \\
                 \\
                 CHAPTER 7 Code Shape \\
                 7.1 Introduction \\
                 7.2 Assigning Storage Locations \\
                 7.3 Arithmetic Operators \\
                 7.4 Boolean and Relational Operators \\
                 7.5 Storing and Accessing Arrays \\
                 7.6 Character Strings \\
                 7.7 Structure References \\
                 7.8 Control-Flow Constructs \\
                 7.9 Procedure Calls",
}

@Book{Copeland:2012:ATE,
  editor =       "B. Jack Copeland",
  booktitle =    "{Alan Turing}'s Electronic Brain: the Struggle to
                 Build the {ACE}, the World's Fastest Computer",
  title =        "{Alan Turing}'s Electronic Brain: the Struggle to
                 Build the {ACE}, the World's Fastest Computer",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  pages =        "xxi + 553",
  year =         "2012",
  ISBN =         "0-19-960915-2 (paperback)",
  ISBN-13 =      "978-0-19-960915-4 (paperback)",
  LCCN =         "????",
  bibdate =      "Tue Jun 19 14:37:17 MDT 2012",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/w/wilkinson-james-hardy.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 library.ox.ac.uk:210/ADVANCE",
  price =        "UK \pounds 14.99",
  abstract =     "The mathematical genius Alan Turing, now well known
                 for his crucial wartime role in breaking the ENIGMA
                 code, was the first to conceive of the fundamental
                 principle of the modern computer-the idea of
                 controlling a computing machine's operations by means
                 of a program of coded instructions, stored in the
                 machine's `memory'. In 1945 Turing drew up his
                 revolutionary design for an electronic computing
                 machine-his Automatic Computing Engine ('ACE'). A pilot
                 model of the ACE ran its first program in 1950 and the
                 production version, the `DEUCE', went on to become a
                 cornerstone of the fledgling British computer industry.
                 The first `personal' computer was based on Turing's
                 ACE. Alan Turing's Automatic Computing Engine describes
                 Turing's struggle to build the modern computer. The
                 first detailed history of Turing's contributions to
                 computer science, this text is essential reading for
                 anyone interested in the history of the computer and
                 the history of mathematics. It contains first hand
                 accounts by Turing and by the pioneers of computing who
                 worked with him. As well as relating the story of the
                 invention of the computer, the book clearly describes
                 the hardware and software of the ACE-including the very
                 first computer programs. The book is intended to be
                 accessible to everyone with an interest in computing,
                 and contains numerous diagrams and illustrations as
                 well as original photographs. The book contains
                 chapters describing Turing's path-breaking research in
                 the fields of Artificial Intelligence (AI) and
                 Artificial Life (A-Life). The book has an extensive
                 system of hyperlinks to The Turing Archive for the
                 History of Computing, an on-line library of digital
                 facsimiles of typewritten documents by Turing and the
                 other scientists who pioneered the electronic
                 computer.",
  acknowledgement = ack-nhfb,
  subject =      "Turing, Alan Mathison; Computers; Great Britain;
                 History; Computer engineering",
  subject-dates = "1912--1954",
  tableofcontents = "List of Photographs / xvi \\
                 Contributors / xvii \\
                 Introduction / B. Jack Copeland / 1 \\
                 Part I: The National Physical Laboratory and the ACE
                 Project \\
                 1: The National Physical Laboratory / Eileen Magnello /
                 15 \\
                 2: The creation of the NPL Mathematics Division / Mary
                 Croarken / 23 \\
                 3: The origins and development of the ACE project / B.
                 Jack Copeland / 37 \\
                 4: The Pilot ACE at the National Physical Laboratory /
                 James H. Wilkinson / 93 \\
                 Part II: Turing and the History of Computing \\
                 5: Turing and the computer / B. Jack Copeland and Diane
                 Proudfoot / 107 \\
                 6: The ACE and the shaping of British computing /
                 Martin Campbell Kelly / 149 \\
                 7: From Turing machine to 'electronic brain' / Teresa
                 Numerico / 173 \\
                 8: Computer architecture and the ACE computers / Robert
                 Doran / 193 \\
                 Part III: The ACE Computers \\
                 9: The Pilot ACE instruction format / Henry John Norton
                 / 209 \\
                 10: Programming the Pilot ACE / J. G. Hayes / 215 \\
                 11: The Pilot ACE: from concept to reality / Robin A.
                 Vowels / 223 \\
                 72: Applications of the Pilot ACE and the DEUCE / Tom
                 Vickers / 265 \\
                 13: The ACE Test Assembly, the Pilot ACE, the Big ACE,
                 and the Bendix G15 / Harry D. Huskey / 281 \\
                 14: The DEUCE --- a user's view / Robin A. Vowels / 297
                 \\
                 15: The ACE Simulator and the Cybernetic Model /
                 Michael Woodger / 331 \\
                 16: The Pilot Model and the Big ACE on the web /
                 Benjamin Wells / 335 \\
                 Part IV: Electronics \\
                 How valves work / David O. Clayden / 341 \\
                 18: Recollections of early vacuum tube circuits /
                 Maurice Wilkes / 345 \\
                 19: Circuit design of the Pilot ACE and the Big ACE /
                 David O. Clayden / 349 \\
                 Part V: Technical Reports and Lectures on the ACE
                 1945--47 \\
                 20: Proposed electronic calculator (1945) / Alan M.
                 Turing / 369 \\
                 27: Notes on memory (1945) / Alan M. Turing / 455 \\
                 22: The Turing--Wilkinson lecture series (1946--7)
                 (edited with an introduction by B. Jack Copeland) /
                 Alan M. Turing and James H. Wilkinson / 459 \\
                 23: The state of the art in electronic digital
                 computing in Britain and the United States (1947) /
                 Harry D. Huskey / 529 \\
                 Index / / 541",
}

@Book{Cormen:1990:IA,
  author =       "Thomas H. Cormen and Charles E. (Eric) Leiserson and
                 Ronald L. Rivest",
  title =        "Introduction to Algorithms",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "xvii + 1028",
  year =         "1990",
  ISBN =         "0-262-03141-8, 0-07-013143-0 (McGraw-Hill)",
  ISBN-13 =      "978-0-262-03141-7, 978-0-07-013143-9 (McGraw-Hill)",
  LCCN =         "QA76.6 .C662 1990",
  bibdate =      "Tue Oct 11 06:42:43 2005",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "Computer programming; Computer algorithms",
  tableofcontents = "Growth of functions \\
                 Summations \\
                 Recurrences \\
                 Sets, etc. \\
                 Counting and probability \\
                 Heapsort \\
                 Quicksort \\
                 Sorting in linear time \\
                 Medians and order statistics \\
                 Elementary data structures \\
                 Hash tables \\
                 Binary search trees \\
                 Red-black trees \\
                 Augmenting data structures \\
                 Dynamic programming \\
                 Greedy algorithms \\
                 Amortized analysis \\
                 B-trees \\
                 Binomial heaps \\
                 Fibonacci heaps \\
                 Data structures for disjoint sets \\
                 Elementary graph algorithms \\
                 Minimum spanning trees \\
                 Single-source shortest paths \\
                 All-pairs shortest paths \\
                 Maximum flow \\
                 Sorting networks \\
                 Arithmetic circuits \\
                 Algorithms for parallel computers \\
                 Matrix operations \\
                 Polynomials and the FFT \\
                 Number-theoretic algorithms \\
                 String matching \\
                 Computational geometry \\
                 NP-completeness \\
                 Approximation algorithms",
}

@Book{Cormen:2001:IA,
  author =       "Thomas H. Cormen and Charles E. (Eric) Leiserson and
                 Ronald L. Rivest",
  title =        "Introduction to Algorithms",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  edition =      "Second",
  pages =        "xxi + 1180",
  year =         "2001",
  ISBN =         "0-262-53196-8 (paperback), 0-262-03293-7 (hardcover),
                 0-07-013151-1 (McGraw-Hill), 0-07-297054-5 (McGraw-Hill
                 with CD-ROM)",
  ISBN-13 =      "978-0-262-53196-2 (paperback), 978-0-262-03293-3
                 (hardcover), 978-0-07-013151-4 (McGraw-Hill),
                 978-0-07-297054-8 (McGraw-Hill with CD-ROM)",
  LCCN =         "QA76.6 .I5858 2001",
  bibdate =      "Sat Jan 26 12:46:16 MST 2013",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "This title covers a broad range of algorithms in
                 depth, yet makes their design and analysis accessible
                 to all levels of readers. Each chapter is relatively
                 self-contained and can be used as a unit of study. The
                 algorithms are described in English and in a pseudocode
                 designed to be readable by anyone who has done a little
                 programming. The explanations have been kept elementary
                 without sacrificing depth of coverage or mathematical
                 rigor. This second edition features new chapters on the
                 role of algorithms, probabilistic analysis and
                 randomized algorithms, and linear programming, as well
                 as extensive revisions to virtually every section of
                 the book. In a subtle but important change, loop
                 invariants are introduced early and used throughout the
                 text to prove algorithm correctness. Without changing
                 the mathematical and analytic focus, the authors have
                 moved much of the mathematical foundations material
                 from Part I to an appendix and have included additional
                 motivational material at the beginning.",
  acknowledgement = ack-ds # " and " # ack-nhfb,
  libnote =      "Not yet in my library.",
  rawdata =      "Cormen, Thomas H., Charles E. Leiserson, Ronald L.
                 Rivest and Clifford Stein (2001) {\it Introduction to
                 Algorithms}, 2nd Edition, MIT Press and McGraw-Hill.",
  remark =       "MIT Press 2001, McGraw-Hill 2002 (third printing),
                 McGraw-Hill 2003 (fourth printing)",
  shorttableofcontents = "1: The Role of Algorithms in Computing \\
                 2: Getting Started \\
                 3: Growth of Functions \\
                 4: Recurrences \\
                 5: Probabilistic Analysis and Randomized Algorithms \\
                 6: Heapsort \\
                 7: Quicksort \\
                 8: Sorting in Linear Time \\
                 9: Medians and Order Statistics \\
                 10: Elementary Data Structures \\
                 11: Hash Tables \\
                 12: Binary Search Trees \\
                 13: Red-Black Trees \\
                 14: Augmenting Data Structures \\
                 15: Dynamic Programming \\
                 16: Greedy Algorithms \\
                 17: Amortized Analysis \\
                 18: B-Trees \\
                 19: Binomial Heaps \\
                 20: Fibonacci Heaps \\
                 21: Data Structures for Disjoint Sets \\
                 22: Elementary Graph Algorithms \\
                 23: Minimum Spanning Trees \\
                 24: Single-Source Shortest Paths \\
                 25: All-Pairs Shortest Paths \\
                 26: Maximum Flow \\
                 27: Sorting Networks \\
                 28: Matrix Operations \\
                 29: Linear Programming \\
                 30: Polynomials and the FFT \\
                 31: Number-Theoretic Algorithms \\
                 32: String Matching \\
                 33: Computational Geometry \\
                 34: NP-Completeness \\
                 35: Approximation Algorithms \\
                 A: Summations \\
                 B: Sets, etc. \\
                 C: Counting and probability",
  subject =      "Computer programming; Computer algorithms",
  tableofcontents = "Preface / xiii \\
                 I Foundations \\
                 Introduction / 3 \\
                 1 The Role of Algorithms in Computing / 5 \\
                 1.1 Algorithms / 5 \\
                 1.2 Algorithms as a technology / 10 \\
                 2 Getting Started / 75 \\
                 2.1 Insertion sort / 15 \\
                 2.2 Analyzing algorithms / 21 \\
                 2.3 Designing algorithms / 27 \\
                 3 Growth of Functions / 41 \\
                 3.1 Asymptotic notation / 41 \\
                 3.2 Standard notations and common functions / 51 \\
                 4 Recurrences / 62 \\
                 4.1 The substitution method / 63 \\
                 4.2 The recursion-tree method / 67 \\
                 4.3 The master method / 73 \\
                 4.4 Proof of the master theorem / 76 \\
                 5 Probabilistic Analysis and Randomized Algorithms / 91
                 \\
                 5.1 The hiring problem / 91 \\
                 5.2 Indicator random variables / 94 \\
                 5.3 Randomized algorithms / 99 \\
                 5.4 Probabilistic analysis and further uses of
                 indicator random variables / 106 \\
                 II Sorting and Order Statistics \\
                 Introduction / 123 \\
                 6 Heapsort / 127 \\
                 6.1 Heaps / 127 \\
                 6.2 Maintaining the heap property / 130 \\
                 6.3 Building a heap / 132 \\
                 6.4 The heapsort algorithm / 135 \\
                 6.5 Priority queues / 138 \\
                 7 Quicksort / 145 \\
                 7.1 Description of quicksort / 145 \\
                 7.2 Performance of quicksort / 149 \\
                 7.3 A randomized version of quicksort / 153 \\
                 7.4 Analysis of quicksort / 755 \\
                 8 Sorting in Linear Time / 165 \\
                 8.1 Lower bounds for sorting / 765 \\
                 8.2 Counting sort / 168 \\
                 8.3 Radix sort / 770 \\
                 8.4 Bucket sort / 174 \\
                 9 Medians and Order Statistics / 183 \\
                 9.1 Minimum and maximum / 184 \\
                 9.2 Selection in expected linear time / 785 \\
                 9.3 Selection in worst-case linear time / 189 \\
                 III Data Structures \\
                 Introduction / 197 \\
                 10 Elementary Data Structures / 200 \\
                 10.1 Stacks and queues / 200 \\
                 10.2 Linked lists / 204 \\
                 10.3 Implementing pointers and objects / 209 \\
                 10.4 Representing rooted trees / 214 \\
                 11 Hash Tables / 221 \\
                 11.1 Direct-address tables / 222 \\
                 11.2 Hash tables / 224 \\
                 11.3 Hash functions / 229 \\
                 11.4 Open addressing / 237 \\
                 11.5 Perfect hashing / 245 \\
                 12 Binary Search Trees / 253 \\
                 12.1 What is a binary search tree? / 253 \\
                 12.2 Querying a binary search tree / 256 \\
                 12.3 Insertion and deletion / 261 \\
                 12.4 Randomly built binary search trees / 265 \\
                 13 Red--Black Trees / 273 \\
                 13.1 Properties of red-black trees / 273 \\
                 13.2 Rotations / 277 \\
                 13.3 Insertion / 280 \\
                 13.4 Deletion / 288 \\
                 14 Augmenting Data Structures / 302 \\
                 14.1 Dynamic order statistics / 302 \\
                 14.2 How to augment a data structure / 308 \\
                 14.3 Interval trees / 311 \\
                 IV Advanced Design and Analysis Techniques \\
                 Introduction / 321 \\
                 15 Dynamic Programming / 323 \\
                 15.1 Assembly-line scheduling / 324 \\
                 15.2 Matrix-chain multiplication / 331 \\
                 15.3 Elements of dynamic programming / 339 \\
                 15.4 Longest common subsequence / 350 \\
                 15.5 Optimal binary search trees / 356 \\
                 16 Greedy Algorithms / 370 \\
                 16.1 An activity-selection problem / 377 \\
                 16.2 Elements of the greedy strategy / 379 \\
                 16.3 Huffman codes / 385 \\
                 * 16.4 Theoretical foundations for greedy methods / 393
                 \\
                 * 16.5 A task-scheduling problem / 399 \\
                 17 Amortized Analysis / 405 \\
                 17.1 Aggregate analysis / 406 \\
                 17.2 The accounting method / 470 \\
                 17.3 The potential method / 412 \\
                 17.4 Dynamic tables / 476 \\
                 V Advanced Data Structures \\
                 Introduction / 431 \\
                 18 B-Trees / 434 \\
                 18.1 Definition of B-trees / 438 \\
                 18.2 Basic operations on B-trees / 441 \\
                 18.3 Deleting a key from -tree / 449 \\
                 19 Binomial Heaps / 455 \\
                 19.1 Binomial trees and binomial heaps / 457 \\
                 19.2 Operations on binomial heaps / 461 \\
                 20 Fibonacci Heaps / 476 \\
                 20.1 Structure of Fibonacci heaps / 477 \\
                 20.2 Mergeable-heap operations / 479 \\
                 20.3 Decreasing a key and deleting a node / 489 \\
                 20.4 Bounding the maximum degree / 493 \\
                 21 Data Structures for Disjoint Sets / 498 \\
                 21.1 Disjoint-set operations / 498 \\
                 21.2 Linked-list representation of disjoint sets / 501
                 \\
                 21.3 Disjoint-set forests / 505 \\
                 * 21.4 Analysis of union by rank with path compression
                 / 509 \\
                 VI Graph Algorithms \\
                 Introduction / 525 \\
                 22 Elementary Graph Algorithms / 527 \\
                 22.1 Representations of graphs / 527 \\
                 22.2 Breadth-first search / 531 \\
                 22.3 Depth-first search / 540 \\
                 22.4 Topological sort / 549 \\
                 22.5 Strongly connected components / 552 \\
                 23 Minimum Spanning Trees / 561 \\
                 23.1 Growing a minimum spanning tree / 562 \\
                 23.2 The algorithms of Kruskal and Prim / 567 \\
                 24 Single-Source Shortest Paths / 580 \\
                 24.1 The Bellman--Ford algorithm / 588 \\
                 24.2 Single-source shortest paths in directed acyclic
                 graphs / 592 \\
                 24.3 Dijkstra's algorithm / 595 \\
                 24.4 Difference constraints and shortest paths / 607
                 \\
                 24.5 Proofs of shortest-paths properties / 607 \\
                 25 All-Pairs Shortest Paths / 620 \\
                 25.1 Shortest paths and matrix multiplication / 622 \\
                 25.2 The Floyd--Warshall algorithm / 629 \\
                 25.3 Johnson's algorithm for sparse graphs / 636 \\
                 26 Maximum Flow / 643 \\
                 26.1 Flow networks / 644 \\
                 26.2 The Ford--Fulkerson method / 657 \\
                 26.3 Maximum bipartite matching / 664 \\
                 * 26.4 Push-relabel algorithms / 669 \\
                 26.5 The relabel-to-front algorithm / 681 \\
                 VII Selected Topics \\
                 Introduction / 701 \\
                 27 Sorting Networks / 704 \\
                 21 Comparison networks / 704 \\
                 27.2 The zero-one principle / 709 \\
                 21.3 A bitonic sorting network / 712 \\
                 21.4 A merging network / 716 \\
                 27.5 A sorting network / 719 \\
                 28 Matrix Operations / 725 \\
                 28.1 Properties of matrices / 725 \\
                 28.2 Strassen's algorithm for matrix multiplication /
                 735 \\
                 28.3 Solving systems of linear equations / 742 \\
                 28.4 Inverting matrices / 755 \\
                 28.5 Symmetric positive-definite matrices and
                 least-squares approximation / 760 \\
                 29 Linear Programming / 770 \\
                 29.1 Standard and slack forms / 777 \\
                 29.2 Formulating problems as linear programs / 785 \\
                 29.3 The simplex algorithm / 790 \\
                 29.4 Duality / 804 \\
                 29.5 The initial basic feasible solution Si / 7 \\
                 30 Polynomials and the FFT / 822 \\
                 30.1 Representation of polynomials / 824 \\
                 30.2 The DFT and FFT / 830 \\
                 30.3 Efficient FFT implementations / 839 \\
                 31 Number-Theoretic Algorithms / 849 \\
                 31.1 Elementary number-theoretic notions / 850 \\
                 31.2 Greatest common divisor / 856 \\
                 31.3 Modular arithmetic / 862 \\
                 31.4 Solving modular linear equations / 869 \\
                 31.5 The Chinese remainder theorem / 873 \\
                 31.6 Powers of an element / 876 \\
                 31.7 The RSA public-key cryptosystem / 881 \\
                 31.8 Primality testing / 887 \\
                 31.9 Integer factorization / 896 \\
                 32 String Matching / 906 \\
                 32.1 The naive string-matching algorithm / 909 \\
                 32.2 The Rabin--Karp algorithm / 911 \\
                 32.3 String matching with finite automata / 976 \\
                 32.4 The Knuth--Morris--Pratt algorithm / 923 \\
                 33 Computational Geometry / 933 \\
                 33.1 Line-segment properties / 934 \\
                 33.2 Determining whether any pair of segments
                 intersects / 940 \\
                 33.3 Finding the convex hull / 947 \\
                 33.4 Finding the closest pair of points / 957 \\
                 34 NP-Completeness / 966 \\
                 34.1 Polynomial time / 971 \\
                 34.2 Polynomial-time verification / 979 \\
                 34.3 NP-completeness and reducibility / 984 \\
                 34.4 NP-completeness proofs / 995 \\
                 34.5 NP-complete problems / 1003 \\
                 35 Approximation Algorithms / 1022 \\
                 35.1 The vertex-cover problem / 1024 \\
                 35.2 The traveling-salesman problem / 7027 \\
                 35.3 The set-covering problem / 1033 \\
                 35.4 Randomization and linear programming / 7039 \\
                 35.5 The subset-sum problem / 1043 \\
                 VIII Appendix: Mathematical Background \\
                 Introduction / 1057 \\
                 A Summations / 1058 \\
                 A.1 Summation formulas and properties / 1058 \\
                 A.2 Bounding summations / 1062",
}

@Book{Cormen:2009:IA,
  editor =       "Thomas H. Cormen and Charles Eric Leiserson and Ronald
                 L. Rivest and Clifford Stein",
  title =        "Introduction to Algorithms",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  edition =      "Third",
  pages =        "xix + 1292",
  year =         "2009",
  ISBN =         "0-262-03384-4 (hardcover), 0-262-53305-7 (paperback)",
  ISBN-13 =      "978-0-262-03384-8 (hardcover), 978-0-262-53305-8
                 (paperback)",
  LCCN =         "QA76.6 .C662 2009",
  bibdate =      "Thu Sep 9 14:42:33 MDT 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "Some books on algorithms are rigorous but incomplete;
                 others cover masses of material but lack rigor.
                 Introduction to Algorithms uniquely combines rigor and
                 comprehensiveness. The book covers a broad range of
                 algorithms in depth, yet makes their design and
                 analysis accessible to all levels of readers. Each
                 chapter is relatively self-contained and can be used as
                 a unit of study. The algorithms are described in
                 English and in a pseudocode designed to be readable by
                 anyone who has done a little programming. The
                 explanations have been kept elementary without
                 sacrificing depth of coverage or mathematical rigor.
                 The first edition became a widely used text in
                 universities worldwide as well as the standard
                 reference for professionals. The second edition
                 featured new chapters on the role of algorithms,
                 probabilistic analysis and randomized algorithms, and
                 linear programming. The third edition has been revised
                 and updated throughout. It includes two completely new
                 chapters, on van Emde Boas trees and multithreaded
                 algorithms, and substantial additions to the chapter on
                 recurrences (now called ``Divide-and-Conquer''). It
                 features improved treatment of dynamic programming and
                 greedy algorithms and a new notion of edge-based flow
                 in the material on flow networks. Many new exercises
                 and problems have been added for this edition.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Computer programming; Computer algorithms",
  tableofcontents = "I. Foundations \\
                 The role of algorithms in computing \\
                 Getting started \\
                 Growth of functions \\
                 Divide-and-conquer \\
                 Probabilistic analysis and randomized algorithms \\
                 II. Sorting and order statistics \\
                 Heapsort \\
                 Quicksort \\
                 Sorting in linear time \\
                 Medians and order statistics \\
                 III. Data structures \\
                 Elementary data structures \\
                 Hash tables \\
                 Binary search trees \\
                 Red--black trees \\
                 Augmenting data structures \\
                 IV. Advanced design and analysis techniques \\
                 Dynamic programming \\
                 Greedy algorithms \\
                 Amortized analysis \\
                 V. Advanced data structures \\
                 B-trees \\
                 Fibonacci heaps \\
                 van Emde Boas trees \\
                 Data structures for disjoint sets \\
                 VI. Graph algorithms \\
                 Elementary graph algorithms \\
                 Minimum spanning trees \\
                 Single-source shortest paths \\
                 All-pairs shortest paths \\
                 Maximun flow \\
                 VII. Selected topics \\
                 Multithreaded algorithms \\
                 Matrix operations \\
                 Linear programming \\
                 Polynomials and the FFT \\
                 Number-theoretic algorithms \\
                 String matching \\
                 Computational geometry \\
                 NP-completeness \\
                 Approximation algorithms \\
                 VIII. Appendix: Mathematical background \\
                 Summations \\
                 Sets, etc. \\
                 Counting and probability \\
                 Matrices",
}

@Book{Cornea:2002:SCI,
  author =       "Marius Cornea and John Harrison and Ping Tak Peter
                 Tang",
  title =        "Scientific Computing on {Itanium}-based Systems",
  publisher =    pub-INTEL,
  address =      pub-INTEL:adr,
  pages =        "xvii + 406",
  year =         "2002",
  ISBN =         "0-9712887-7-1",
  ISBN-13 =      "978-0-9712887-7-5",
  LCCN =         "QA76.8.I83 C67 2002",
  bibdate =      "Sat Dec 06 15:02:26 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$69.95",
  URL =          "http://www.intel.com/intelpress/sum_scientific.htm",
  abstract =     "Written for professionals who need to write, port, or
                 maintain reliable, accurate, and efficient numerical
                 software for the Itanium architecture, Scientific
                 Computing on Itanium-based Systems shows you how to
                 construct key numerical infrastructure and application
                 programs.\par

                 This book describes the crucial techniques required for
                 stability and reliability in developing numerical
                 kernels and applications. Through numerous tested
                 examples, the authors explain how you can get the most
                 from the 64-bit architecture. This combination of
                 explanation with example helps you to make difficult
                 computations more easily and to increase the
                 performance of your numerical software.\par

                 This book provides examples to solve problems
                 encountered in scientific and engineering computations,
                 such as:\par

                 * Polynomial evaluation\\
                 * Complex arithmetic\\
                 * Quad-precision arithmetic\\
                 * Software pipelining, to include register rotation and
                 modulo-scheduled loop support\\
                 * SIMD instructions\\
                 * Interval arithmetic\\
                 * Fast-Fourier Transformation (FFT) algorithms\\
                 * Numerical linear algebra and basic linear algebra
                 subprograms(BLAS)\\
                 * Vector Math Library (VML)\\
                 * Cryptography",
  acknowledgement = ack-nhfb,
}

@Book{Cornwell:2003:HSS,
  author =       "John Cornwell",
  title =        "{Hitler}'s scientists: science, war, and the {Devil}'s
                 pact",
  publisher =    pub-VIKING,
  address =      pub-VIKING:adr,
  pages =        "xvi + 535",
  year =         "2003",
  ISBN =         "0-670-03075-9",
  ISBN-13 =      "978-0-670-03075-0",
  LCCN =         "Q127.G3 C67 2003",
  bibdate =      "Mon Jul 11 16:39:06 MDT 2005",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/h/heisenberg-werner.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "In \booktitle{Hitler's Scientists}, British historian
                 John Cornwell explores German scientific genius in the
                 first half of the twentieth century and shows how
                 Germany's early lead in the new physics led to the
                 discovery of atomic fission, which in turn led the way
                 to the atom bomb, and how the ideas of Darwinism were
                 hijacked to create the lethal doctrine of racial
                 cleansing.",
  acknowledgement = ack-nhfb,
  subject =      "Science and state; Germany; History; 20th century;
                 World War, 1939--1945; Science; Germany",
  tableofcontents = "Introduction: understanding the Germans \\
                 Part 1. Hitler's scientific inheritance \\
                 1. Hitler the scientist \\
                 2. Germany the science mecca \\
                 3. Fritz Haber \\
                 4. The poison gas scientists \\
                 5. The `science' of racial hygiene \\
                 6. Eugenics and psychiatry \\
                 Part 2. The new physics, 1918--1933 \\
                 7. Physics after the first war \\
                 8. German science survives \\
                 Part 3. Nazi enthusiasm, compliance and oppression,
                 1933--1939 \\
                 9. The dismissals \\
                 10. Engineers and rocketeers \\
                 11. Medicine under Hitler \\
                 12. The cancer campaign \\
                 13. Geopolitik and Lebensraum \\
                 14. Nazi physics \\
                 15. Himmler's pseudo-science \\
                 16. Deutsche Mathematik \\
                 Part 4. The science of destruction and defence,
                 1933--1943 \\
                 17. Fission mania \\
                 18. World War II \\
                 19. Machines of war \\
                 20. Radar \\
                 21. Codes \\
                 Part 5. The Nazi atomic bomb, 1941--1945 \\
                 22. Copenhagen \\
                 23. Speer and Heisenberg \\
                 24. Haigerloch and Los Alamos \\
                 Part 6. Science in hell, 1942--1945 \\
                 25. Slave labour at Dora \\
                 26. The `science' of extermination and human experiment
                 \\
                 27. The devil's chemists \\
                 28. Wonder weapons \\
                 Part 7. In Hitler's shadow \\
                 29. Farm Hall \\
                 30. Heroes, villains and fellow travellers \\
                 31. Scientific plunder \\
                 Part 8. Science from the Cold War to the war on
                 terrorism \\
                 32. Nuclear postures \\
                 33. Uniquely Nazi? \\
                 34. Science at war again",
}

@Book{Cortada:2019:IHM,
  author =       "James W. Cortada",
  title =        "{IBM}: How a Multinational Corporation Struggled for
                 Success and Shaped the Modern World",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "xxii + 723",
  year =         "2019",
  ISBN =         "0-262-03944-3 (hardcover), 0-262-35148-X (e-book)",
  ISBN-13 =      "978-0-262-03944-4 (hardcover), 978-0-262-35148-5
                 (e-book)",
  LCCN =         "HD9696.2.U6",
  bibdate =      "Sat Jun 1 14:22:20 MDT 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "History of computing",
  abstract =     "This is a history of IBM, a huge multinational firm,
                 from its origins in the 1880s to the present. It
                 demonstrates that this supplier of computers, software
                 and information technology services played a profound
                 role in shaping how other large organizations and
                 economies evolved in the twentieth century. It
                 describes its strategies, expansions, how various parts
                 of the company collaborated and competed within the
                 firm overcoming problems, a nearly fatal period in the
                 early 1990s, and its recurring revivals and successes.
                 The book is unique for several reasons. First, it is a
                 comprehensive volume covering technologies, managerial
                 actions, strategies, sales, the role of customers, and
                 government regulatory and legal issues. Second, it is
                 the only history that covers the post 1980 period down
                 to 2018. (The last major history of IBM was published
                 in the early 1990s.) Third, its emphasis on the role of
                 corporate and sales culture is unique among books
                 concerning IBM. Fourth, this book provides the greatest
                 amount of detail available today about IBM's role in
                 Western and Eastern Europe. The book is also unique
                 because the author brings to the project several
                 perspectives: that of an employee close to much of the
                 critical events of one-third of the company's history,
                 that of a trained historian, and that of an experienced
                 student of the history of computing in business. Thus,
                 he is able to integrate the entire history of the
                 company from its origins to the present, demonstrating,
                 for example, legacies of a prior era still evident in
                 today's company, an ability to connect IBM's behaviors
                 in each decade to those of other large multinational
                 corporations, and to the computing activities of its
                 many thousands of customers",
  acknowledgement = ack-nhfb,
  tableofcontents = "Preface / ix \\
                 I From Birth to Identity: IBM in Its Early Years,
                 1880s--1945 / 1 \\
                 1 Origins, 1880s--1914 / 3 \\
                 2 Thomas J. Watson Sr. and the Creation of IBM,
                 1914--1924 / 27 \\
                 3 The Emergence of IBM and the Culture of THINK / 61
                 \\
                 4 IBM and the Great Depression / 91 \\
                 5 IBM in World War II, 1939--1945 / 121 \\
                 II IBM the Computer Behemoth, 1945--1985 / 147 \\
                 6 IBM Gets into the Computer Business, 1945--1964 / 149
                 \\
                 7 How Customers, IBM, and a New Industry Evolved,
                 1945--1964 / 177 \\
                 8 System 360: One of the Greatest Products in History?
                 / 203 \\
                 9 ``The IBM Way'': How It Worked, 1964--1993 / 233 \\
                 10 ``The IBM Way'': What the World Saw, 1964--1993 /
                 257 \\
                 11 IBM on the Global Stage / 283 \\
                 12 Two Decades of Antitrust Suits, 1960s--1980s / 325
                 \\
                 13 Communist Computers / 353 \\
                 14 ``A Tool for Modern Times'': IBM and the Personal
                 Computer / 379 \\
                 III A Time of Crisis, 1985--1994 / 419 \\
                 15 Storms, Crisis, and Near Death, 1985--1993 / 421 \\
                 16 IBM's Initial Response, 1985--1993 / 439 \\
                 17 How IBM Was Rescued, 1993--1994 / 471 \\
                 IV IBM in the New Century / 501 \\
                 18 A New IBM, 1995--2012 / 503 \\
                 19 Hard Times, Again, and Another Transformation / 547
                 \\
                 20 THINK: IBM Today and Its Legacy / 579 \\
                 Author's Note: In the Spirit of Transparency / 619 \\
                 Notes / 623 \\
                 Bibliographic Essay / 677 \\
                 Index / 687",
}

@Book{Cotton:1963:CAG,
  author =       "F. Albert (Frank Albert) Cotton",
  title =        "Chemical Applications of Group Theory",
  publisher =    pub-INTERSCIENCE,
  address =      pub-INTERSCIENCE:adr,
  pages =        "ix + 295",
  year =         "1963",
  LCCN =         "QD461 .C65",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Cotton:1966:AIC,
  author =       "F. Albert (Frank Albert) Cotton and Geoffrey
                 Wilkinson",
  title =        "Advanced Inorganic Chemistry",
  publisher =    pub-INTERSCIENCE,
  address =      pub-INTERSCIENCE:adr,
  pages =        "xii + 1136",
  year =         "1966",
  LCCN =         "QD151 .C64 1966",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Couffignal:1933:MCL,
  author =       "L. Couffignal",
  title =        "Les machines {\`a} calculer, leurs principes, leur
                 {\'e}volution. ({French}) [{Calculating} machines,
                 their principles, their evolution]",
  publisher =    "Gauthier-Villars",
  address =      "Paris, France",
  year =         "1933",
  bibdate =      "Wed Oct 13 11:19:11 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Extracts reprinted in \cite[\S 3.2]{Randell:1982:ODC}.
                 Translated by Mr. R. Basu.",
  acknowledgement = ack-nhfb,
  language =     "French",
}

@PhdThesis{Couffignal:1938:AMA,
  author =       "L. Couffignal",
  title =        "Sur l'analyse m{\'e}canique. Application aux machines
                 {\`a} calculer et aux calculs de la m{\'e}canique
                 c{\'e}leste. ({French}) [{On} mechanical analysis.
                 Application to calculating machines and to calculation
                 in celestial mechanics]",
  publisher =    "Gauthier-Villars",
  school =       "Facult{\'e} des Sciences de Paris",
  address =      "Paris, France",
  year =         "1938",
  bibdate =      "Wed Oct 13 11:17:22 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Extracts reprinted in \cite[\S 2.7]{Randell:1982:ODC}.
                 Translated by Mr. R. Basu.",
  acknowledgement = ack-nhfb,
  language =     "French",
}

@Book{Counihan:1991:F,
  author =       "Martin Counihan",
  title =        "{Fortran 90}",
  publisher =    pub-PITMAN,
  address =      pub-PITMAN:adr,
  pages =        "309",
  year =         "1991",
  ISBN =         "0-273-03073-6",
  ISBN-13 =      "978-0-273-03073-7",
  LCCN =         "QA76.73.F25 C68 1991",
  bibdate =      "Sun May 02 07:48:16 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fortran3.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See \cite{ANSI:ftn92}.",
  acknowledgement = ack-nhfb,
  keywords =     "Fortran 90 (computer program language); Programming
                 languages; {Fortran 90} (Computer program language)",
  libnote =      "Not yet in my library.",
  tableofcontents = "1: Introduction \\
                 1.1: Fortran 90 / 1 \\
                 1.2: Programs and Programming / 2 \\
                 2: What is Fortran 90? \\
                 2.1: Program Structure / 5 \\
                 2.2: Intrinsic Procedures / 6 \\
                 2.3: Statement Types / 7 \\
                 2.4: What Fortran 90 Isn't / 7 \\
                 2.5: New Features in Fortran 90 / 8 \\
                 Notes / 10 \\
                 3: Getting Started \\
                 3.1: The Character Set / 11 \\
                 3.2: A Simple Program / 14 \\
                 3.3: Arithmetic Operators / 18 \\
                 Exercises 3A / 19 \\
                 3.4: Names and Other Lexical Tokens / 20 \\
                 3.5: Fortran Source Form / 21 \\
                 Exercises 3B / 24 \\
                 Notes / 25 \\
                 4: Intrinsic Data Types \\
                 4.1: Integers / 26 \\
                 4.2: Real Numbers / 29 \\
                 Exercises A / 31 \\
                 4.3: Simple Form of the Type Declaration Statement / 32
                 \\
                 4.4: Kinds Real Numbers / 32 \\
                 4.5: Complex Numbers / 33 \\
                 4.6: Logical Data; Logical and Relational Operators /
                 35 \\
                 4.7: Characters and Strings / 38 \\
                 Exercises 4B / 40 \\
                 Notes / 42 \\
                 5: Some Intrinsic Procedures \\
                 5.1: An Intrinsic Subroutine / 43 \\
                 5.2: Mathematical Functions / 44 \\
                 5.3: Numeric Functions / 46 \\
                 Exercises 5A / 50 \\
                 Notes / 52 \\
                 6: More About Characters \\
                 6.1: Declaring Character Data / 53 \\
                 6.2: Character Constants / 54 \\
                 6.3: Character Operators / 55 \\
                 6.4: Intrinsic Character Functions / 56 \\
                 6.5: Substrings / 59 \\
                 Exercises / 61 \\
                 Notes / 62 \\
                 7: Arrays \\
                 7.1: Declaring Arrays / 63 \\
                 7.2: Using Arrays / 65 \\
                 7.3: Array Constructors / 67 \\
                 7.4: Array Sections / 68 \\
                 7.5: Array Sections, Character Strings and Substrings /
                 70 \\
                 7.6: Where / 72 \\
                 7.7: Arrays and Intrinsic Functions / 73 \\
                 Exercises 7B / 74 \\
                 8: Execution Control \\
                 8.1: The ``CASE'' Construct / 76 \\
                 8.2: The ``IF'' Construct / 80 \\
                 Exercises / 81 \\
                 8.3: The ``DO'' Construct / 82 \\
                 8.4: Stop / 88 \\
                 Exercises 8B / 88 \\
                 Notes / 89 \\
                 9: Functions and Subroutines (1) \\
                 9.1: Functions / 90 \\
                 Exercises 9A / 93 \\
                 9.2: Subroutines / 93 \\
                 9.3: Procedures and Arrays / 96 \\
                 Exercises 9B / 99 \\
                 Notes / 100 \\
                 10: More Intrinsic Procedures; Statement Labels \\
                 10.1: Intrinsic Subroutines / 102 \\
                 10.2: Functions for Use with Arrays / 104 \\
                 Exercises 10A / 110 \\
                 10.3: Numeric Inquiry Functions and Floating-Point
                 Manipulation Functions / 110 \\
                 10.4: Statement Labels and ``GO TO'' / 111 \\
                 Notes / 114 \\
                 11: Modules \\
                 11.1: Data Modules / 116 \\
                 Module Procedures / 120 \\
                 11.3: More About ``USE'' Statements / 124 \\
                 Exercises / 126 \\
                 Notes / 127 \\
                 12: Functions and Subroutines (2) \\
                 12.1: Recursive Procedures / 128 \\
                 Exercises 12A / 130 \\
                 12.2: Interface Blocks / 131 \\
                 12.3: Argument Keywords / 132 \\
                 12.4: More About Arguments: ``PRESENT'' / 133 \\
                 12.5: Functions / 134 \\
                 12.6: Operators / 135 \\
                 12.7: Generic Names / 138 \\
                 12.8: Parallel Processing / 141 \\
                 Exercises 12B / 142 \\
                 Notes / 143 \\
                 13: The Type Declaration Statement \\
                 13.1: General Form of the TDS / 144 \\
                 13.2: Character Length Selectors / 147 \\
                 13.3: Attribute Specifications / 149 \\
                 13.4: Array Specifications / 152 \\
                 13.5: The Entity Declaration List / 157 \\
                 13.6: Summary / 158 \\
                 Exercises 13A / 159 \\
                 Notes / 161 \\
                 14: Derived Types \\
                 14.1: Derived-Type Definition / 164 \\
                 14.2: Structure Constructors / 166 \\
                 14.3: Structure Components / 168 \\
                 Exercises 14A / 169 \\
                 14.4: Structures of Structures / 170 \\
                 Exercises 14B / 171 \\
                 14.5: Functions and Operators with Derived Types / 172
                 \\
                 14.6: Defined Assignment / 174 \\
                 Exercises 14C / 178 \\
                 Notes / 180 \\
                 15: Arrays and Pointers \\
                 15.1: Array Element Order, Array Constructors; RESHAPE
                 / 181 \\
                 15.2: Vector Subscripts / 184 \\
                 15.3: Allocatable Arrays / 187 \\
                 Exercises 15A / 190 \\
                 15.4: LBOUND, SHAPE and SIZE / 190 \\
                 Exercises 15B / 191 \\
                 15.5: Simple Pointers / 192 \\
                 15.6: Pointers as Structures and as Structure
                 Components / 197 \\
                 15.7: Pointers and Procedures / 204 \\
                 15.8: Array Pointers / 205 \\
                 Exercises 15C / 207 \\
                 Notes / 208 \\
                 16: Input and Output; Data Format Specifications \\
                 16.1: Data Transfer Statements / 209 \\
                 16.2: The Item List / 210 \\
                 16.3: List-Directed Input / 212 \\
                 16.4: List-Directed Output / 216 \\
                 16.5: Explicit Formats / 217 \\
                 Exercises 16A / 219 \\
                 16.6: Data Edit Descriptors and Character Edit
                 Descriptors / 219 \\
                 16.7: Control Edit Descriptors / 223 \\
                 Exercises 16B / 225 \\
                 16.8: Namelists / 226 \\
                 16.9: Unformatted / 228 \\
                 16.10: The TRANSFER Function / 229 \\
                 16.11: Summary / 231 \\
                 Notes / 232 \\
                 17: File Handling \\
                 17.1: Units, Files and Records / 233 \\
                 17.2: Opening and Closing Files / 235 \\
                 17.3: BACKSPACE, ENDFTLE and REWIND / 240 \\
                 17.4: Control Specifications for / 240 \\
                 17.5: The ``INQUIRE'' Statement / 242 \\
                 17.6: Internal Files / 246 \\
                 Exercises 17A / 248 \\
                 Notes / 249 \\
                 18: Bits \\
                 18.1: Inside Integers / 250 \\
                 18.2: Bit Logic / 251 \\
                 18.3: A Warning / 252 \\
                 Exercises 18A / 253 \\
                 19: Programming Conventions and Program Architecture:
                 Putting It All Together \\
                 19.1: Coding Conventions / 254 \\
                 19.2: Towards Fortran 90 / 255 \\
                 Fortran 90 Recommended Statements / 256 \\
                 Intrinsic Functions / 257 \\
                 19.3: Program Unit Structure / 258 \\
                 19.4: Program Structure / 261 \\
                 19.5: Final Remarks / 262 \\
                 Answers to Selected Exercises / 263 \\
                 Appendices \\
                 A: Fortran 90 Statements \\
                 B: Intrinsic Procedures / 286 \\
                 C: Intrinsic Procedures: Names / 292 \\
                 D: Argument Keywords in Intrinsic Procedures / 294 \\
                 E: Edit Descriptors / 297 \\
                 F: The ASCII Character Set / 301 \\
                 Index / 304",
}

@Book{Cowart:2007:SEU,
  author =       "Robert Cowart and Brian Knittel",
  title =        "Special edition: Using {Microsoft Windows Vista}",
  publisher =    pub-QUE,
  address =      pub-QUE:adr,
  pages =        "xlv + 1458",
  year =         "2007",
  ISBN =         "0-7897-3472-9 (paperback)",
  ISBN-13 =      "978-0-7897-3472-3 (paperback)",
  LCCN =         "QA76.76.O63 C683376 2007",
  bibdate =      "Mon Oct 29 18:40:27 MDT 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/toc/ecip074/2006037794.html",
  acknowledgement = ack-nhfb,
  subject =      "Operating systems (Computers); Microsoft Windows
                 (Computer file)",
}

@Book{Cowlishaw:1990:RLP,
  author =       "Michael F. Cowlishaw",
  title =        "The {REXX} language: a practical approach to
                 programming",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  edition =      "Second",
  pages =        "xii + 203",
  year =         "1990",
  ISBN =         "0-13-780651-5",
  ISBN-13 =      "978-0-13-780651-5",
  LCCN =         "QA76.73.R24 C69 1990",
  bibdate =      "Tue Jun 28 16:07:24 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 =          "http://vig.prenhall.com/catalog/academic/product/0,1144,0137806515,00.html",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "REXX (Computer program language)",
  tableofcontents = "Background \\
                 What Kind of a Language is REXX? \\
                 Fundamental Language Concepts \\
                 Design Principles \\
                 History \\
                 Rexx Language Definition \\
                 Characters and Encodings \\
                 Structure and General Syntax \\
                 Expressions and Operators \\
                 Clauses and Instructions \\
                 Assignments and Variables \\
                 Commands to External Environments \\
                 Keyword Instructions \\
                 Function Calls \\
                 Built-in Functions \\
                 Parsing for ARG, PARSE, and PULL \\
                 Numbers and Arithmetic \\
                 Input and Output Streams \\
                 Conditions and Condition Traps \\
                 Interactive Tracing \\
                 Reserved Keywords and Language Extendibility \\
                 Special Variables \\
                 Error Numbers and Messages \\
                 Index",
}

@Book{Cox:2015:SBS,
  author =       "Trevor J. Cox",
  title =        "The sound book: the science of the sonic wonders of
                 the world",
  publisher =    pub-NORTON,
  address =      pub-NORTON:adr,
  pages =        "331",
  year =         "2015",
  ISBN =         "0-393-23979-9 (hardcover), 0-393-35058-4 (paperback)",
  ISBN-13 =      "978-0-393-23979-9 (hardcover), 978-0-393-35058-6
                 (paperback)",
  LCCN =         "QC225.3 .C69 2015",
  bibdate =      "Wed Apr 1 17:20:57 MDT 2015",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "With forays into archaeology, neuroscience, biology,
                 and design, Cox explains how sound is made and altered
                 by the environment, how our body reacts to peculiar
                 noises, and how these mysterious wonders illuminate
                 sound's surprising dynamics in everyday settings, from
                 your bedroom to the opera house. \ldots{} A professor
                 of acoustic engineering provides a tour of the world's
                 most amazing sound phenomena, including creaking
                 glaciers, whispering galleries, stalactite organs,
                 musical roads, humming dunes, seals that sound like
                 alien angels, and a Mayan pyramid that chirps like a
                 bird.",
  acknowledgement = ack-nhfb,
  remark =       "Published in Great Britain by The Bodley Head under
                 the title `Sonic wonderland: a scientific odyssey of
                 sound'.",
  subject =      "Sounds; Popular works; Noise; Noise; Sounds.",
  tableofcontents = "The most reverberant place in the world \\
                 Ringing rocks \\
                 Barking fish \\
                 Echoes of the past \\
                 Going round the bend \\
                 Singing sands \\
                 The quietest places in the world \\
                 Placing sound \\
                 Future wonders",
}

@Book{Craig:1971:DT,
  author =       "James Craig",
  title =        "Designing with Type",
  publisher =    pub-WATSON-GUPTILL,
  address =      pub-WATSON-GUPTILL:adr,
  pages =        "175",
  year =         "1971",
  ISBN =         "0-8230-1320-0",
  ISBN-13 =      "978-0-8230-1320-3",
  LCCN =         "70-159564",
  bibdate =      "Wed Jul 6 13:57:38 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  comments =     "Spiralbound. Seventh printing, 1978.",
  libnote =      "Not yet in my library.",
  subject =      "Graphic design (Typography); Caract{\`e}res
                 d'imprimerie; Imprimerie; Technique; Graphic design
                 (Typography)",
  tableofcontents = "1: Origins of the alphabet \\
                 2: Laying the groundwork \\
                 3: Units of measurement \\
                 4: Five families of type \\
                 5: Display types \\
                 6: Materials for the designer \\
                 7: Comping type \\
                 8: How do we read? \\
                 9: Designing with text type \\
                 10: Designing with display type \\
                 11: Copyfitting \\
                 12: Arranging type on the page \\
                 13: Preparing copy for type \\
                 14: Design projects for the classroom",
}

@Book{Craig:2005:VM,
  author =       "Iain D. Craig",
  title =        "Virtual Machines",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xv + 269",
  year =         "2005",
  ISBN =         "1-85233-969-1, 1-84628-246-2 (e-book)",
  ISBN-13 =      "978-1-85233-969-2, 978-1-84628-246-1 (e-book)",
  LCCN =         "QA76.9 CRA",
  bibdate =      "Thu Jul 14 12:01:15 MDT 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/java2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 library.ox.ac.uk:210/ADVANCE;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "In this book state transitions are used as a formal
                 technique for the specification of virtual machines
                 throughout and --- in addition --- transitions and
                 state transitions relating to the general operation are
                 included for specification of the virtual machine for
                 the event-based system. Two virtual machines are
                 defined using a simple sequential language, which is
                 then generalised to include object and parallelism.
                 Other themes explored include the implementation of VMs
                 and proposals for future work. Appendices contain
                 high-level specifications of two compilers: one for the
                 simple language that serves as the basic example
                 throughout the book, the other for the event-based
                 language specified in Chapter 6. This book is an
                 essential reference tool for academic and industrial
                 researchers as well as postgraduates in this area.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Virtual computer systems; Parallel processing",
  tableofcontents = "Title Page \\
                 Copyright Page \\
                 Preface \\
                 Acknowledgements \\
                 Table of Contents \\
                 1 Introduction \\
                 1.1 Introduction \\
                 1.2 Interpreters \\
                 1.3 Landin's SEeD Machine \\
                 1.4 The Organisation of this Book \\
                 1.5 Omissions \\
                 2 VMs for Portability: BCPL \\
                 2.1 Introduction \\
                 2.2 BCPL the Language \\
                 2.3 VM Operations \\
                 2.4 The OeODE Machine \\
                 2.5 OCODE Instructions and their Implementation \\
                 2.5.1 Expression Instructions \\
                 2.5.2 Load and Store Instructions \\
                 2.5.3 Instructions Relating to Routines \\
                 2.5.4 Control Instructions \\
                 2.5.5 Directives \\
                 2.6 The Intcode/Cintcode Machine \\
                 3 The Java Virtual Machine \\
                 3.1 Introduction \\
                 3.2 JVM Organisation: An Overview \\
                 3.2.1 The stack \\
                 3.2.2 Method areas \\
                 3.2.3 The PC register \\
                 3.2.4 Other structures \\
                 3.3 Class Files \\
                 3.4 Object Representation at Runtime \\
                 3.5 Initialisation \\
                 3.6 Object Deletion \\
                 3.7 JVM Termination \\
                 3.8 Exception Handling \\
                 3.9 Instructions \\
                 3.9.1 Data-manipulation instructions \\
                 3.9.2 Control instructions \\
                 3.9.3 Stack-manipulating instructions \\
                 3.9.4 Support for object orientation \\
                 3.9.5 Synchronisation \\
                 3.10 Concluding Remarks \\
                 4 DIY VMs \\
                 4.1 Introduction \\
                 4.2 ALEX \\
                 4.2.1 Language Overview \\
                 4.2.2 What the Virtual Machine Must Support \\
                 4.2.3 Virtual Machine-Storage Structures \\
                 4.2.4 Virtual Machine-Registers \\
                 4.2.5 Virtual Machine-Instruction Set \\
                 4.2.6 An Example \\
                 4.2.7 Implementation \\
                 4.2.8 Extensions \\
                 4.2.9 Alternatives \\
                 4.2.10 Specification \\
                 4.3 Issues \\
                 4.3.1 Indirect and Relative Jumps \\
                 4.3.2 More Data Types \\
                 4.3.3 Higher-Order Routines \\
                 4.3.4 Primitive Routines \\
                 4.4 Concluding Remarks \\
                 5 More Stack-Based VMs \\
                 5.1 Introduction \\
                 5.2 A Simple Object-Oriented Language \\
                 5.2.1 Language Overview \\
                 5.2.2 Virtual Machine-Storage Structures \\
                 5.2.3 Virtual Machine-Registers \\
                 5.2.4 Virtual Machine-Instruction Set \\
                 5.2.5 Extensions \\
                 5.2.6 Alternatives \\
                 5.3 A Parallel Language \\
                 5.3.1 Language Overview \\
                 5.3.2 Virtual Machine-Storage Structures \\
                 5.3.3 Virtual Machine-Registers \\
                 5.3.4 Virtual Machine-Instruction Set \\
                 5.3.5 Implementation \\
                 5.3.6 Extensions \\
                 5.3.7 Alternatives \\
                 5.3.8 Issues \\
                 5.4 Concluding Remarks \\
                 5.4.1 Some Optimisations \\
                 5.4.2 Combining the Languages \\
                 6 Case Study: An Event-Driven Language \\
                 6.1 Introduction \\
                 6.2 The Structure of Rules \\
                 6.3 Events \\
                 6.4 Execution Cycle \\
                 6.5 Interpretation Rules \\
                 6.6 VM Specification \\
                 6.6.1 States and Notational Conventions \\
                 6.6.2 Infra-Rule Transitions \\
                 6.6.3 Extra-Rule Transitions \\
                 6.6.4 VM-Only Transitions \\
                 6.6.5 Introspective Operations \\
                 6.7 Rule Equivalences \\
                 6.8 Concluding Remarks \\
                 7 Register-Based Machines \\
                 7.1 Introduction \\
                 7.2 The Register-Transfer Model \\
                 7.3 Register Machine Organisation \\
                 7.4 Parrot-General Organisation \\
                 7.5 Parrot Instruction Set \\
                 7.5.1 Control instructions \\
                 7.5.2 Data management instructions \\
                 7.5.3 Register and stack operations \\
                 7.6 DIY Register-Based Virtual Machine \\
                 7.6.1 Informal Design \\
                 7.6.2 Extensions \\
                 7.6.3 Transition Rules \\
                 7.7 Translating ALEXVM into RTM \\
                 7.8 Example Code \\
                 7.9 Correctness of the Translation \\
                 [detailed data not available for remainder] \\
                 Implementation techniques \\
                 Open issues \\
                 Compiling ALEX \\
                 Harrison machine compilation rules \\
                 Harrison machine instruction set",
}

@Book{Crandall:1991:MSa,
  author =       "Richard E. Crandall",
  title =        "{Mathematica} for the Sciences",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xiii + 300",
  year =         "1991",
  ISBN =         "0-201-51001-4",
  ISBN-13 =      "978-0-201-51001-0",
  LCCN =         "Q172 .C73 1991",
  bibdate =      "Wed Dec 15 07:59:15 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/c/crandall-richard-e.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/mathematica.bib",
  acknowledgement = ack-nhfb,
  keywords =     "Mathematica (Computer file); Science --- Mathematics
                 --- Data processing; Science --- Use of --- Software",
  xxnote =       "See \cite{Crandall:1991:MSb}.",
}

@Book{Cravens:2007:PSW,
  author =       "Gwyneth Cravens",
  title =        "Power to save the world: the truth about nuclear
                 energy",
  publisher =    pub-KNOPF,
  address =      pub-KNOPF:adr,
  pages =        "xv + 439",
  year =         "2007",
  ISBN =         "0-307-26656-7",
  ISBN-13 =      "978-0-307-26656-9",
  LCCN =         "TK9146 .C65 2007",
  bibdate =      "Fri Nov 12 14:45:25 MST 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0804/2007017611-b.ht;
                 http://www.loc.gov/catdir/enhancements/fy0804/2007017611-d.ht;
                 http://www.loc.gov/catdir/enhancements/fy0804/2007017611-s.ht;
                 http://www.loc.gov/catdir/toc/ecip0716/2007017611.html",
  acknowledgement = ack-nhfb,
  subject =      "nuclear engineering; United States; nuclear power
                 plants",
  tableofcontents = "Part 1. Origins \\
                 1. Survival \\
                 2. Always look at the whole \\
                 3. Ambrosia Lake \\
                 Part 2. The invisible storm \\
                 4. Mother Nature and Fencepost Man \\
                 5. Undark \\
                 6. Into the strange city \\
                 Part 3. The hidden world \\
                 7. Risk and consequence \\
                 8. Going to extremes \\
                 9. Tiny beads \\
                 Part 4. The kingdom of electricity \\
                 10. Man's smudge \\
                 11. From arrowheads to atoms \\
                 12. Barriers \\
                 13. Unobtainium \\
                 Part 5. Closing the circle \\
                 14. Ten thousand years \\
                 15. The huge factory \\
                 16. 32N164W \\
                 17. Those who say it can't be done \\
                 18. The gigantic crystal \\
                 Part 6. Borrowing from our children \\
                 19. The iron chamber \\
                 20. ``Water them anyway'' \\
                 21. The power within \\
                 Notes \\
                 Glossary \\
                 Acknowledgments \\
                 Index",
}

@Book{Crease:2010:GEB,
  author =       "Robert P. Crease",
  title =        "The Great Equations: Breakthroughs in Science from
                 {Pythagoras} to {Heisenberg}",
  publisher =    pub-NORTON,
  address =      pub-NORTON:adr,
  pages =        "315",
  year =         "2010",
  ISBN =         "0-393-33793-6",
  ISBN-13 =      "978-0-393-33793-8",
  LCCN =         "Q175 .C884 2010",
  bibdate =      "Mon Mar 8 20:24:04 MST 2010",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/h/heisenberg-werner.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 sirsi.library.utoronto.ca:2200/UNICORN",
  acknowledgement = ack-nhfb,
  subject =      "equations; history; science; philosophy;
                 mathematicians; biography; scientists",
  tableofcontents = "1: ``The Basis of Civilization'': The Pythagorean
                 Theorem \\
                 Interlude. Rules, Proofi, and the Magic of Mathematics
                 \\
                 2: ``The Soul of Classical Mechanics'': Newton's Second
                 Law of Motion \\
                 Interlude. Book of Nature \\
                 3: ``The High Point of the Scientific Revolution'':
                 Newton's Law of Universal Gravitation \\
                 Interlude. That Apple \\
                 4: ``The Gold Standard for Mathematical Beauty'':
                 Euler's Equation \\
                 Interlude. Equations as Icons \\
                 5: Scientific Equivalent of Shakespeare: The Second Law
                 of Thermodynamies \\
                 Interlude. Science of Impossibility \\
                 6: ``The Most Significant Event of the 19th Century'':
                 Maxwell's Equations \\
                 Interlude. Overcoming Anosognosia; or Restoring the
                 Vitality of the Humanities \\
                 7: Celebrity Equation: $E = m c^2$ \\
                 Interlude. Crazy Ideas \\
                 8: Golden Egg: Einstein's Equation for General
                 Relativity \\
                 Interlude. Science Critics \\
                 9: ``The Basic Equation of Quantum Theory'':
                 Schr{\"o}dinger's Equation \\
                 Interlude. Double Consciousness of Scientists \\
                 10: Living with Uncertainty: The Heisenberg Uncertainty
                 Principle \\
                 Interlude. Yogi and the Quantum \\
                 Conclusion: Bringing the Strange Home",
}

@Book{Crease:2011:WBH,
  author =       "Robert P. Crease",
  title =        "World in the balance: the historic quest for an
                 absolute system of measurement",
  publisher =    pub-NORTON,
  address =      pub-NORTON:adr,
  pages =        "317",
  year =         "2011",
  ISBN =         "0-393-07298-3",
  ISBN-13 =      "978-0-393-07298-3",
  LCCN =         "QC83 .C74 2011",
  bibdate =      "Wed Dec 7 07:19:22 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Weights and measures; History; Measurement;
                 Metrology",
  tableofcontents = "Vitruvian man \\
                 Ancient China: feet and flutes \\
                 West Africa: gold weights \\
                 France: ``realities of life and labor'' \\
                 Halting steps toward universality \\
                 ``One of the greatest triumphs of modern civilization''
                 \\
                 Metrophilia and metrophobia \\
                 Surely you're joking, Mr. Duchamp! \\
                 Dreams of a final standard \\
                 Universal system: the Si \\
                 The modern metroscape \\
                 Au revoir, kilogram",
}

@Book{Crease:2014:QMH,
  author =       "Robert P. Crease and Alfred S. Goldhaber",
  title =        "The quantum moment: how {Planck}, {Bohr}, {Einstein},
                 and {Heisenberg} taught us to love uncertainty",
  publisher =    pub-NORTON,
  address =      pub-NORTON:adr,
  pages =        "vii + 332",
  year =         "2014",
  ISBN =         "0-393-06792-0 (hardcover)",
  ISBN-13 =      "978-0-393-06792-7 (hardcover)",
  LCCN =         "QC174.123 .C74 2014",
  bibdate =      "Mon Dec 29 05:53:52 MST 2014",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/bohr-niels.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/h/heisenberg-werner.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/p/pauli-wolfgang.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/s/schroedinger-erwin.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "The authors --- one a philosopher, the other a
                 physicist --- draw on their training and six years of
                 co-teaching to dramatize the quantum's rocky path from
                 scientific theory to public understanding while also
                 exploring the quantum's manifestations in everything
                 from art and sculpture to the prose of John Updike and
                 David Foster Wallace.",
  acknowledgement = ack-nhfb,
  subject =      "Quantum theory; Popular works; Physics",
  tableofcontents = "Introduction / 1 \\
                 The Newtonian moment / 9 \\
                 Interlude: The Grand Design / 27 \\
                 A pixelated world / 33 \\
                 Interlude: Max Planck introduces the quantum / 47 \\
                 Quantum leaps / 55 \\
                 Interlude: Niels Bohr uses quantum leaps to make atoms
                 go / 67 \\
                 Randomness / 70 \\
                 Interlude: Albert Einstein shows how God plays dice /
                 83 \\
                 The matter of identity: a quantum shoe that hasn't
                 dropped / 86 \\
                 Interlude: Wolfgang Pauli and the Exclusion Principle,
                 Satyendra Bose, and bosons / 100 \\
                 Sharks and tigers: schizophrenia / 109 \\
                 Interlude: Erwin Schr{\"o}dinger's map, Werner
                 Heisenberg's map / 130 \\
                 Uncertainty / 137 \\
                 Interlude: The Uncertainty Principle / 162 \\
                 Reality manufactured: cubism and complementarity / 165
                 \\
                 Interlude: Complementarity, objectivity, and the
                 double-slit experiment / 182 \\
                 No dice! / 187 \\
                 Interlude: John Bell and his theorem / 205 \\
                 Schr{\"o}dinger's cat / 211 \\
                 Interlude: the border war / 228 \\
                 Rabbit hole: the thirst for parallel worlds / 233 \\
                 Interlude: multiverses / 251 \\
                 Saving physics / 254 \\
                 Conclusion: The now moment / 272 \\
                 Notes / 281 \\
                 Acknowledgments / 307 \\
                 Credits / 311 \\
                 Index / 313",
}

@Book{Crowther:1974:CLb,
  author =       "J. G. (James Gerald) Crowther",
  booktitle =    "The {Cavendish Laboratory}, 1874--1974",
  title =        "The {Cavendish Laboratory}, 1874--1974",
  publisher =    "Science History Publications",
  address =      "New York, NY, USA",
  pages =        "xvi + 464",
  year =         "1974",
  DOI =          "https://doi.org/10.1007/978-1-349-01670-9",
  ISBN =         "0-88202-029-3 (hardcover), 1-349-01670-5 (e-book)",
  ISBN-13 =      "978-0-88202-029-7 (hardcover), 978-1-349-01670-9
                 (e-book)",
  LCCN =         "QC51.G72 C353 1974",
  bibdate =      "Thu Mar 10 11:48:00 MST 2016",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/r/rutherford-ernest.bib;
                 https://www.math.utah.edu/pub/tex/bib/bjhs.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  author-dates = "1899--",
  tableofcontents = "List of Illustrations / ix \\
                 Prefix / xiii \\
                 Acknowledgments / xv \\
                 Introduction / 1--22 \\
                 Founding the Professorship and Laboratory / 23--34 \\
                 Creating the Cavendish Tradition / 35--46 \\
                 Building the Laboratory / 47--60 \\
                 The Early Atmosphere / 61--79 \\
                 Rayleigh / 80--87 \\
                 Systematising Teaching and Research / 88--102 \\
                 J. J. Thomson: Early Days / 103--108 \\
                 Building on the Foundations / 109--125 \\
                 Fruition / 126--140 \\
                 From Outside to Inside the Atom / 141--151 \\
                 Accommodation and Teaching / 152--159 \\
                 New Physics, and a New Professor / 160--175 \\
                 Rutherford's Background / 176--182 \\
                 The Apotheosis of the Cavendish Laboratory / 183--202
                 \\
                 The Rutherford Era / 203--212 \\
                 Cloud Chambers / 213--224 \\
                 Engineers and Electricians / 225--235 \\
                 Russian and Australian Views / 236--248 \\
                 Individual Genius also Flourished / 249--257 \\
                 The Cavendish in Transition / 258--268 \\
                 Bragg / 269--290 \\
                 The Technicians' Contribution / 291--300 \\
                 Physicists and Molecular Biology / 301--319 \\
                 Final Report / 320--328 \\
                 The Mond / 329--338 \\
                 `One Good Laboratory Among Many' / 339--357 \\
                 Current Researches / 358--367 \\
                 New Instruments / 368--380 \\
                 A New Line / 381--384 \\
                 The Depths of Space / 385--401 \\
                 Finance and Administration / 402--411 \\
                 The New Cavendish / 412--430 \\
                 Pippard's View / 431--441 \\
                 Farewell, and Hail! / 442--446 \\
                 References / 447--456 \\
                 Index / 457--464",
}

@Book{Crystal:2004:SE,
  author =       "David Crystal",
  title =        "The Stories of {English}",
  publisher =    "The Overlook Press",
  address =      "New York, NY, USA",
  pages =        "vi + 584",
  year =         "2004",
  ISBN =         "1-58567-601-2, 1-58567-719-1 (paperback),
                 1-4683-0617-0 (e-book)",
  ISBN-13 =      "978-1-58567-601-9, 978-1-58567-719-1 (paperback),
                 978-1-4683-0617-0 (e-book)",
  LCCN =         "PE1074.7 .C79 2004",
  bibdate =      "Fri May 21 20:34:07 MDT 2021",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Crystal turns the history of the language on its head
                 and provides a startlingly original view of where the
                 richness, creativity, and diversity of the language
                 truly lies: in the accents and dialects of nonstandard
                 English users all over the globe.",
  abstract =     "The Stories of English is a history of the language by
                 David Crystal. Crystal turns the history of English on
                 its head and provides an original view of where the
                 richness, creativity, and diversity of the language
                 truly lies --- in the accents and dialects of
                 nonstandard English users all over the world. Whatever
                 their regional, social, or ethnic background, each
                 group has a story worth telling, whether it is in
                 Scotland or Canada, South Africa or the United States
                 --- and Crystal relates the fascinating and sometimes
                 arcane details. Interwoven throughout the central
                 chronological story are accounts of uses of dialect
                 around the world, as well as in classics from The
                 Canterbury Tales to The Lord of the Rings. For the
                 first time, regional speech and writing is placed
                 center stage, giving a sense of the social realities
                 behind the development of the English language. This
                 shift in perspective enables the reader to understand,
                 for the first time, the importance of everyday,
                 previously marginalized voices in our language and
                 provides an argument for the way English should be
                 taught in the future.",
  acknowledgement = ack-nhfb,
  author-dates = "(1941--\ldots{})",
  subject =      "English language; Variation; English-speaking
                 countries; Dialects; Great Britain; History; Anglais
                 (Langue); Pays anglophones; Dialectes; Grande-Bretagne;
                 Histoire; English language; Dialects; Variation;
                 Variation (linguistique); Histoire; 1500--1700 (moderne
                 naissant); 20e si{\'y}ecle.",
  tableofcontents = "Introduction \\
                 The standard story \\
                 Real story \\
                 Origins of Old English: Interlude 1: Celtic language
                 puzzle \\
                 Old English dialects: Interlude 2: Rise and fall of
                 West Saxon Early lexical diversity: Interlude 3:
                 Understanding Danes \\
                 Stylistic variation in Old English: Interlude 4:
                 Grammatical transition \\
                 Transition to Middle English: Interlude 5: Two
                 Peterborough Chronicles \\
                 Trilingual nation: Interlude 6: Lay Subsidy dialects
                 \\
                 Lexical invasions: Interlude 7: First dialect story \\
                 Evolving variation: Interlude 8: Well well \\
                 Dialect age: Interlude 9: Where did the -s ending come
                 from? \\
                 Emerging standard: Interlude 10: Complaining about
                 change \\
                 Printing and its consequences: Interlude 11: First
                 English dictionary \\
                 Early Modern English preoccupations: Interlude 12:
                 Choosing thou or you \\
                 Linguistic daring: Interlude 13: Avoiding
                 transcriptional anaemia \\
                 Dialect fallout: Interlude 14: Beggarly portrayal \\
                 Stabilizing disorder: Interlude 15: Delusions of
                 simplicity \\
                 Standard rules: Interlude 16: Glottal stops \\
                 New horizons: Interlude 17: Tracking a change: the case
                 of y'all \\
                 Linguistic life goes on: Interlude 18: Grammatical
                 heart of nonstandard English \\
                 And dialect life goes on: Interlude 19: Dialect in
                 Middle Earth \\
                 Times a-changin' \\
                 Appendix: Location of the towns and counties of England
                 referred to in this book \\
                 Notes \\
                 References \\
                 Acknowledgements \\
                 Person Index \\
                 Subject Index",
}

@Book{Cuyt:2008:HCF,
  author =       "Annie Cuyt and Vigdis B. Petersen and Brigitte Verdonk
                 and Haakon Waadeland and William B. Jones",
  title =        "Handbook of Continued Fractions for Special
                 Functions",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xx + 440",
  year =         "2008",
  DOI =          "https://doi.org/10.1007/978-1-4020-6949-9",
  ISBN =         "1-4020-6948-0",
  ISBN-13 =      "978-1-4020-6948-2",
  LCCN =         "QA295 .H275 2008",
  bibdate =      "Tue Jun 24 07:17:37 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  keywords =     "applying the limit process; associated continued
                 fraction; asymptotic series expansion; basic
                 hypergeometric functions; canonical contraction;
                 combination with property; complementary incomplete
                 gamma function; complex error function; confluent
                 hypergeometric series; continued fraction converges;
                 continued fraction representations; fraction
                 approximants; modified approximant; monic orthogonal
                 polynomial sequence; normed field; nth approximant; nth
                 denominator; nth numerator; nth tail; oval sequence
                 theorem; parabola theorem; partial numerators; strong
                 moment distribution function; successive approximants;
                 truncation error bounds",
  shorttableofcontents = "General considerations \\
                 Part 1, Basic Theory \\
                 1. Basics \\
                 2. Continued fraction representation of functions \\
                 3. Convergence criteria \\
                 4. Pade approximants \\
                 5. Moment theory and orthogonal functions \\
                 Part 2, Numerics \\
                 6. Continued fraction construction \\
                 7. Truncation error bounds \\
                 8. Continued fraction evaluation \\
                 Part 3, Special Functions \\
                 9. On tables and graphs \\
                 10. Mathematical constants \\
                 11. Elementary functions \\
                 12. Gamma function and related functions \\
                 13. Error function and related integrals \\
                 14. Exponential integrals and related functions \\
                 15. Hypergeometric functions \\
                 16. Confluent hypergeometric functions, \\
                 17. Bessel functions \\
                 18. Probability functions \\
                 19. Basic hypergeometric functions",
  tableofcontents = "Preface / xi \\
                 Notation / xiii \\
                 0 General considerations \\
                 / 1 \\
                 0.1 Part one / 1 \\
                 0.2 Part two / 2 \\
                 0.3 Part three / 2 \\
                 \\
                 Part I: Basic Theory \\
                 \\
                 1 Basics / 9 \\
                 1.1 Symbols and notation \\
                 1.2 Definitions / 10 \\
                 1.3 Recurrence relations / 13 \\
                 1.4 Equivalence transformations / 15 \\
                 1.5 Contractions and extensions / 16 \\
                 1.6 Continued fractions with prescribed approximants /
                 18 \\
                 1.7 Connection between continued fractions and series /
                 19 \\
                 1.8 Periodic and limit periodic continued fractions /
                 21 \\
                 1.9 Tails of continued fractions / 23 \\
                 1.10 Continued fractions over normed fields / 26 \\
                 1.11 Generalisations of continued fractions / 28 \\
                 \\
                 2 Continued fraction representation of functions / 29
                 \\
                 2.1 Symbols and notation / 29 \\
                 2.2 Correspondence / 30 \\
                 2.3 Families of continued fractions / 35 \\
                 2.4 Correspondence of C-fractions / 39 \\
                 2.5 Correspondence of P-fractions / 40 \\
                 2.6 Correspondence of J-fractions and T-fractions / 41
                 \\
                 2.7 Correspondence and three-term recurrences / 42 \\
                 \\
                 3 Convergence criteria / 45 \\
                 3.1 Some classical theorems / 45 \\
                 3.2 Convergence sets and value sets / 47 \\
                 3.3 Parabola and oval theorems / 49 \\
                 3.4 Correspondence and uniform convergence / 52 \\
                 3.5 Periodic and limit periodic continued fractions /
                 53 \\
                 3.6 Convergence and minimal solutions / 56 \\
                 \\
                 4 Pad{\'e} approximants / 59 \\
                 4.1 Definition and notation / 59 \\
                 4.2 Fundamental properties / 60 \\
                 4.3 Connection with regular C-fractions / 64 \\
                 4.4 Connection with P-fractions / 65 \\
                 4.5 Extension of the Pad{\'e} table / 67 \\
                 4.6 Connection with M-fractions and the M-table / 68
                 \\
                 4.7 Convergence of Pad{\'e} approximants / 70 \\
                 4.8 Formal orthogonality property / 72 \\
                 \\
                 5 Moment theory and orthogonal functions / 77 \\
                 5.1 Moment theory / 77 \\
                 5.2 Stieltjes transforms / 85 \\
                 5.3 Construction of solutions / 90 \\
                 5.4 Orthogonal polynomials / 91 \\
                 5.5 Monic orthogonal polynomials on $\mathbb{R}$ and
                 J-fractions / 92 \\
                 5.6 Szeg{\H{o}} polynomials and PPC-fractions / 100 \\
                 5.7 Orthogonal Laurent polynomials and APT-fractions /
                 102 \\
                 \\
                 Part II: Numerics \\
                 \\
                 6 Continued fraction construction / 107 \\
                 6.1 Regular C-fractions / 107 \\
                 6.2 C-fractions / 113 \\
                 6.3 S-fractions / 114 \\
                 6.4 P-fractions / 114 \\
                 6.5 J-fractions / 120 \\
                 6.6 M-fractions / 122 \\
                 6.7 Positive T-fractions / 124 \\
                 6.8 Thiele fractions / 125 \\
                 \\
                 7 Truncation error bounds / 129 \\
                 7.1 Parabola theorems / 129 \\
                 7.2 The oval sequence theorem / 131 \\
                 7.3 The interval sequence theorem / 136 \\
                 7.4 Specific a priori bounds for S-fractions / 138 \\
                 7.5 A posteriori truncation error bounds / 140 \\
                 7.6 Tails and truncation error bounds / 143 \\
                 7.7 Choice of modification / 143 \\
                 \\
                 8 Continued fraction evaluation / 149 \\
                 8.1 The effect of finite precision arithmetic / 149 \\
                 8.2 Evaluation of approximants / 152 \\
                 8.3 The forward recurrence and minimal solutions / 154
                 \\
                 8.4 Round-off error in the backward recurrence / 156
                 \\
                 \\
                 Part III: Special Functions \\
                 \\
                 9 On tables and graphs / 163 \\
                 9.1 Introduction / 163 \\
                 9.2 Comparative tables / 163 \\
                 9.3 Reliable graphs / 168 \\
                 \\
                 10 Mathematical constants / 175 \\
                 10.1 Regular continued fractions / 175 \\
                 10.2 Archimedes' constant, symbol $\pi$ / 176 \\
                 10.3 Euler's number, base of the natural logarithm /
                 178 \\
                 10.4 Integer powers and roots of $\pi$ and $e$ / 180
                 \\
                 10.5 The natural logarithm, $\ln(2)$ / 181 \\
                 10.6 Pythagoras' constant, the square root of two / 183
                 \\
                 10.7 The cube root of two / 183 \\
                 10.8 Euler's constant, symbol $\gamma$ / 185 \\
                 10.9 Golden ratio, symbol $\phi$ / 185 \\
                 10.10 The rabbit constant, symbol $\rho$ / 186 \\
                 10.11 Ap{\'e}ry's constant, $\zeta(3)$ / 188 \\
                 10.12 Catalan's constant, symbol $C$ / 189 \\
                 10.13 Gompertz' constant, symbol $G$ / 190 \\
                 10.14 Khinchin's constant, symbol $K$ / 190 \\
                 \\
                 11 Elementary functions / 193 \\
                 11.1 The exponential function / 193 \\
                 11.2 The natural logarithm / 196 \\
                 11.3 Trigonometric functions / 200 \\
                 11.4 Inverse trigonometric functions / 204 \\
                 11.5 Hyperbolic functions / 210 \\
                 11.6 Inverse hyperbolic functions / 213 \\
                 11.7 The power function / 217 \\
                 \\
                 12 Gamma function and related functions / 221 \\
                 12.1 Gamma function / 221 \\
                 12.2 Binet function / 224 \\
                 12.3 Polygamma functions / 229 \\
                 12.4 Trigamma function / 232 \\
                 12.5 Tetragamma function / 235 \\
                 12.6 Incomplete gamma functions / 238 \\
                 \\
                 13 Error function and related integrals / 253 \\
                 13.1 Error function and Dawson's integral / 253 \\
                 13.2 Complementary and complex error function / 261 \\
                 13.3 Repeated integrals / 268 \\
                 13.4 Fresnel integrals / 269 \\
                 \\
                 14 Exponential integrals and related functions / 275
                 \\
                 14.7 Exponential integrals / 275 \\
                 14.2 Related functions / 285 \\
                 \\
                 15 Hypergeometric functions / 291 \\
                 15.1 Definition and basic properties / 291 \\
                 15.2 Stieltjes transform / 295 \\
                 15.3 Continued fraction representations / 295 \\
                 15.4 Pad{\'e} approximants / 309 \\
                 15.5 Monotonicity properties / 313 \\
                 15.6 Hypergeometric series $_pF_q$ / 315 \\
                 \\
                 16 Confluent hypergeometric functions / 319 \\
                 16.1 Kummer functions / 319 \\
                 16.2 Confluent hypergeometric series $_2F_0$ / 330 \\
                 16.3 Confluent hypergeometric limit function / 333 \\
                 16.4 Whittaker functions / 334 \\
                 16.5 Parabolic cylinder functions / 337 \\
                 \\
                 17 Bessel functions / 334 \\
                 17.7 Bessel functions / 334 \\
                 17.2 Modified Bessel functions / 356 \\
                 \\
                 18 Probability functions / 371 \\
                 18.1 Definitions and elementary properties / 371 \\
                 18.2 Normal and log-normal distributions / 373 \\
                 18.3 Repeated integrals / 377 \\
                 18.4 Gamma and chi-square distribution / 378 \\
                 18.5 Beta, $F$- and Student's $t$-distributions / 382
                 \\
                 \\
                 19 Basic hypergeometric functions / 391 \\
                 19.1 Definition and basic properties / 391 \\
                 19.2 Continued fraction representations / 395 \\
                 19.3 Higher order basic hypergeometric functions / 399
                 \\
                 \\
                 Bibliography / 401 \\
                 \\
                 Index / 421",
}

@Article{Cybenko:perfect,
  author =       "George Cybenko",
  title =        "Supercomputer Performance Trends and the {Perfect
                 Benchmarks}",
  journal =      j-SR,
  volume =       "4",
  number =       "4",
  pages =        "53--60",
  month =        apr,
  year =         "1991",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{daCruz:1987:KFT,
  author =       "Frank {da Cruz}",
  title =        "{Kermit}: a File Transfer Protocol",
  publisher =    pub-DP,
  address =      pub-DP:adr,
  pages =        "xvii + 379",
  year =         "1987",
  ISBN =         "0-932376-88-6",
  ISBN-13 =      "978-0-932376-88-6",
  LCCN =         "TK5105.5 .D23 1987",
  bibdate =      "Tue Dec 14 22:44:57 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{daCruz:1993:UCK,
  author =       "Frank {da Cruz} and Christine M. Gianone",
  title =        "Using {C-Kermit}",
  publisher =    pub-DP # " and " # pub-PH,
  address =      pub-DP:adr # " and " # pub-PH:adr,
  pages =        "xxi + 514",
  year =         "1993",
  ISBN =         "1-55558-108-0 (DP), 0-13-037490-3 (PH)",
  ISBN-13 =      "978-1-55558-108-4 (DP), 978-0-13-037490-5 (PH)",
  LCCN =         "TK5105.9.D33 1993",
  bibdate =      "Thu Aug 14 11:20:13 1997",
  bibsource =    "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/unix.bib",
  note =         "Available in German translation
                 \cite{daCruz:1996:CKE}.",
  acknowledgement = ack-nhfb,
  subject =      "C-Kermit; Communications software",
  tableofcontents = "1. Introduction \\
                 2. Running C-Kermit \\
                 3. Getting Connected \\
                 4. Terminal Connection \\
                 5. The Basics of File Transfer \\
                 6. Solving File Transfer Problems \\
                 7. Using a Kermit Server \\
                 8. File Transfer Power Tools \\
                 9. International Character Sets \\
                 10. Transferring Files without the Kermit Protocol \\
                 11. Command Files, Macros, and Variables \\
                 12. Programming Commands \\
                 13. Script Programming \\
                 14. Command-Line Options \\
                 Appendix I: C-Kermit Command Reference \\
                 Appendix II: A Condensed Guide to Serial Data
                 Communications \\
                 Appendix III: UNIX C-Kermit \\
                 Appendix IV: VMS C-Kermit \\
                 Appendix V: OS/2 C-Kermit \\
                 Appendix VI: AOS/VS C-Kermit \\
                 Appendix VII: Other C-Kermit Versions \\
                 Appendix VIII: Character Set Tables \\
                 Appendix IX: DOS/UNIX File Conversion Script \\
                 Appendix X: Hexification Programs \\
                 Appendix XI: Shift-In/Shift Out Filter",
}

@Book{daCruz:1996:CKE,
  author =       "Frank {da Cruz} and Christine M. Gianone",
  title =        "{C-Kermit: Einf{\"u}hrung und Referenz}",
  publisher =    pub-HEINZ-HEISE,
  address =      pub-HEINZ-HEISE:adr,
  pages =        "557",
  year =         "1996",
  ISBN =         "3-88229-023-4",
  ISBN-13 =      "978-3-88229-023-3",
  LCCN =         "????",
  bibdate =      "Thu Aug 14 11:17:19 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  note =         "German translation of \cite{daCruz:1993:UCK}.",
  price =        "88,00 DM",
  URL =          "http://www.emedia.de/bin/bookshop?show=3401&id=",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library",
}

@Book{daCruz:1997:UCK,
  author =       "Frank {da Cruz} and Christine M. Gianone",
  title =        "Using {C-Kermit}",
  publisher =    pub-DP,
  address =      pub-DP:adr,
  edition =      "Second",
  pages =        "xxii + 662",
  year =         "1997",
  ISBN =         "1-55558-164-1",
  ISBN-13 =      "978-1-55558-164-0",
  LCCN =         "TK5105.9.D33 1997",
  bibdate =      "Thu Jan 13 14:33:16 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Dahlquist:1974:NM,
  author =       "Germund Dahlquist and {\AA}ke Bj{\"o}rck and Ned
                 Anderson",
  title =        "Numerical Methods",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xviii + 573",
  year =         "1974",
  ISBN =         "0-13-627315-7",
  ISBN-13 =      "978-0-13-627315-8",
  LCCN =         "QA297 .D131 1969",
  bibdate =      "Tue Dec 14 22:44:59 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg-2ed.bib;
                 https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Translated by Ned Anderson.",
  series =       "Prentice-Hall Series in Automatic Computation",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "1: Some General Principles of Numerical
                 Calculation / 1 \\
                 2: How to Obtain and Estimate Accuracy in Numerical
                 Calculations / 21 \\
                 3: Numerical Uses of Series / 60 \\
                 4: Approximation of Functions / 81 \\
                 5: Numerical Linear Algebra / 137 \\
                 6: Nonlinear Equations / 218 \\
                 7: Finite Differences with Applications to Numerical
                 Integration, Differentiation, and Interpolation / 255
                 \\
                 8: Differential Equations / 330 \\
                 9: Fourier Methods / 405 \\
                 10: Optimization / 422 \\
                 11: The Monte Carlo Method and Simulation / 448 \\
                 12: Solutions to Problems / 465 \\
                 13: Bibliography and Published Algorithms / 536 \\
                 Index by Subject to Algorithms, 1960--1970 / 548 \\
                 Appendix Tables / 563 \\
                 Index / 565",
  tableofcontents = "Preface / xvii \\
                 Conventions / xix \\
                 1: Some General Principles of Numerical Calculation / 1
                 \\
                 1.1. Introduction / 1 \\
                 1.2. Some Common Ideas and Concepts in Numerical
                 Methods / 2 \\
                 1.3. Numerical Problems and Algorithms / 13 \\
                 1.3.1. Definitions / 13 \\
                 1.3.2. Recursive Formulas; Homer's Rule / 14 \\
                 1.3.3. An Example of Numerical Instability / 16 \\
                 2: How to Obtain and Estimate Accuracy in Numerical
                 Calculations / 21 \\
                 2.1. Basic Concepts in Error Estimation / 21 \\
                 2.1.1. Introduction / 21 \\
                 2.1.2. Sources of Error / 22 \\
                 2.1.3. Absolute and Relative Errors / 23 \\
                 2.1.4. Rounding and Chopping / 24 \\
                 2.2 Propagation of Errors / 26 \\
                 2.2.1. Simple Examples of Error Analysis / 26 \\
                 2.2.2. The General Formula for Error Propagation;
                 Maximum Error and Standard Error / 29 \\
                 2.2.3. On the Practical Application of Error Estimation
                 / 34 \\
                 2.2.4. The Use of Experimental Perturbations / 36 \\
                 2.2.5. Automatic Control of Accuracy / 37 \\
                 2.3. Number Systems; Floating and Fixed Representation
                 / 42 \\
                 2.3.1. The Position System / 42 \\
                 2.3.2. Floating and Fixed Representation / 43 \\
                 2.3.3. Floating Decimal Point / 44 \\
                 2.3.4. Fixed Decimal Point / 46 \\
                 2.3.5. Round-off Errors in Computation with Floating
                 Arithmetic Operations / 46 \\
                 2.4. Backward Error Analysis; Condition Numbers / 51
                 \\
                 2.4.1. Backward Error Analysis / 51 \\
                 2.4.2. Condition Numbers for Problems and Algorithms /
                 53 \\
                 2.4.3. Geometrical Illustration of Error Analysis / 56
                 \\
                 3: Numerical Uses of Series / 60 \\
                 3.1. Elementary Uses of Series / 60 \\
                 3.1.1. Simple Examples / 60 \\
                 3.1.2. Estimating the Remainder / 62 \\
                 3.1.3. Power Series / 65 \\
                 3.2. Acceleration of Convergence / 71 \\
                 3.2.1. Slowly Converging Alternating Series / 71 \\
                 3.2.2. Slowly Converging Series with Positive Terms /
                 73 \\
                 3.2.3. Other Simple Ways to Accelerate Convergence / 74
                 \\
                 3.2.4. Ill-Conditioned Series / 75 \\
                 3.2.5. Numerical Use of Divergent Series / 77 \\
                 4: Approximation of Functions / 81 \\
                 4.1. Basic Concepts in Approximation / 81 \\
                 4.1.1. Introduction / 81 \\
                 4.1.2. The Idea of a Function Space / 84 \\
                 4.1.3. Norms and Seminorms / 85 \\
                 4.1.4. Approximation of Functions as a Geometric
                 Problem in Function Space / 87 \\
                 4.2. The Approximation of Functions by the Method of
                 Least Squares / 88 \\
                 4.2.t. Statement of the Problems / 88 \\
                 4.2.2. Orthogonal Systems / 89 \\
                 4.2.3. Solution of the Approximation Problem / 92 \\
                 4.3. Polynomials / 97 \\
                 4.3.1. Basic Terminology; the Weierstrass Approximation
                 Theorem / 97 \\
                 4.3.2. Triangle Families of Polynomials / 98 \\
                 4.3.3. A Triangle Family and Its Application to
                 Interpolation / 99 \\
                 4.3.4. Equidistant Interpolation and the Runge
                 Phenomenon / 101 \\
                 4.4. Orthogonal Polynomials and Applications / 104 \\
                 4.4.1. Tchebycheff Polynomials / 104 \\
                 4.4.2. Tchebycheff Interpolation and Smoothing / 106
                 \\
                 4.4.3. General Theory of Orthogonal Polynomials / 108
                 \\
                 4.4.4. Legendre Polynomials and Gram Polynomials / 113
                 \\
                 4.5. Complementary Observations on Polynomial
                 Approximation / 117 \\
                 4.5.1. Summary of the Use of Polynomials / 117 \\
                 4.5.2. Some Inequalities for $E_n(f)$ with Applications
                 to the Computation of Linear Functionals / 120 \\
                 4.5.3. Approximation in the Maximum Norm / 124 \\
                 4.5.4. Economization of Power Series; Standard
                 Functions / 125 \\
                 4.5.5. Some Statistical Aspects of the Method of Least
                 Squares / 126 \\
                 4.6. Spline Functions / 131 \\
                 5: Numerical Linear Algebra / 137 \\
                 5,1. Introduction / 137 \\
                 5.2. Basic Concepts of Linear Algebra / 138 \\
                 5.2.1. Fundamental Definitions / 138 \\
                 5.2.2. Partitioned Matrices / 140 \\
                 5.2.3. Linear Vector Spaces / 141 \\
                 5.2.4. Eigenvalues and Similarity Transformations / 142
                 \\
                 5.2.5. Singular-Value Decomposition and Pseudo-Inverse
                 / 143 \\
                 5.3. Direct Methods for Solving Systems of Linear
                 Equations / 146 \\
                 5.3.1. Triangular Systems / 146 \\
                 5.3.2. Gaussian Elimination / 147 \\
                 5.3.3. Pivoting Strategies / 150 \\
                 5.3.4. $L U$-Decomposition / 152 \\
                 5.3.5. Compact Schemes for Gaussian Elimination / 157
                 \\
                 5.3.6. Inverse Matrices / 159 \\
                 5.4. Special Matrices / 162 \\
                 5.4.1. Symmetric Positive-Definite Matrices / 162 \\
                 5.4.2. Band Matrices / 165 \\
                 5.4.3. Large-Scale Linear Systems / 168 \\
                 5.4.4. Other Sparse Matrices / 169 \\
                 5.5. Error Analysis for Linear Systems / 174 \\
                 5.5.1. An Ill-Conditioned Example / 174 \\
                 5.5.2. Vector and Matrix Norms / 175 \\
                 5.5.3. Perturbation Analysis / 176 \\
                 5.5.4. Rounding Errors in Gaussian Elimination / 177
                 \\
                 5.5.5. Scaling of Linear Systems / 181 \\
                 5.5.6. Iterative Improvement of a Solution / 183 \\
                 5.6. Iterative Methods / 188 \\
                 5.7. Overdetermined Linear Systems / 196 \\
                 5.7.1. The Normal Equations / 197 \\
                 5.7.2. Orthogonalization Methods / 201 \\
                 5.7.3. Improvement of Least-Squares Solutions / 204 \\
                 5.7.4. Least-Squares Problems with Linear Constraints /
                 205 \\
                 5.8. Computation of Eigenvalues and Eigenvectors / 208
                 \\
                 5.8.1. The Power Method / 209 \\
                 5.8.2. Methods Based on Similarity Transformations /
                 211 \\
                 5.8.3. Eigenvalues by Equation Solving / 215 \\
                 5.8.4. The $Q R$-Algorithm / 216 \\
                 6: Nonlinear Equations / 218 \\
                 6.1. Introduction / 218 \\
                 6.2. Initial Approximations; Starting Methods / 219 \\
                 6.2.1. Introduction / 219 \\
                 6.2.2. The Bisection Method / 220 \\
                 6.3. Newton--Raphson's Method / 222 \\
                 6.4. The Secant Method / 227 \\
                 6.4.1. Description of the Method / 227 \\
                 6.4.2. Error Analysis for the Secant Method / 228 \\
                 6.4.3. Regula Falsi / 230 \\
                 6.4.4. Other Related Methods / 230 \\
                 6.5. General Theory of Iteration Methods / 233 \\
                 6.6. Error Estimation and Attainable Accuracy in
                 Iteration Methods / 238 \\
                 6.6.1. Error Estimation / 238 \\
                 6.6.2. Attainable Accuracy; Termination Criteria / 240
                 \\
                 6.7. Multiple Roots / 242 \\
                 6.8. Algebraic Equations / 243 \\
                 6.8.1. Introduction / 243 \\
                 6.8.2. Deflation / 245 \\
                 6.8.3. Ill-Conditioned Algebraic Equations / 246 \\
                 6.9. Systems of Nonlinear Equations / 248 \\
                 6.9.1. Iteration / 249 \\
                 6.9.2. Newton--Raphson's Method and Some Modifications
                 / 249 \\
                 6.9.3. Other Methods / 251 \\
                 7: Finite Differences with Applications to Numerical
                 Integration, Differentiation, and Interpolation / 255
                 \\
                 7.1. Difference Operators and Their Simplest Properties
                 / 255 \\
                 7.2. Simple Methods for Deriving Approximation Formulas
                 and Error Estimates / 263 \\
                 7.2.1. Statement of the Problems and Some Typical
                 Examples / 263 \\
                 7.2.2, Repeated Richardson Extrapolation / 269 \\
                 7.3. Interpolation / 275 \\
                 7.3.1. Introduction / 275 \\
                 7.3.2. When is Linear Interpolation Sufficient? / 276
                 \\
                 7.3.3. Newton's General Interpolation Formula / 277 \\
                 7.3.4. Formulas for Equidistant Interpolation / 279 \\
                 7.3.5. Complementary Remarks on Interpolation / 282 \\
                 7.3.6. Lagrange's Interpolation Formula / 284 \\
                 7.3.7. Hermite Interpolation / 285 \\
                 7.3.8. Inverse Interpolation / 286 \\
                 7.4. Numerical Integration / 290 \\
                 7.4.1. The Rectangle Rule, Trapezoidal Rule, and
                 Romberg's Method / 291 \\
                 7.4.2. The Truncation Error of the Trapezoidal Rule /
                 293 \\
                 7.4.3. Some Difficulties and Possibilities in Numerical
                 Integration / 294 \\
                 7.4.4. The Euler--Maclaurin Summation Formula / 297 \\
                 7.4.5. Uses of the Euler--Maclaurin Formula / 300 \\
                 7.4.6. Other Methods for Numerical Integration / 302
                 \\
                 7.5. Numerical Differentiation / 307 \\
                 7.6. The Calculus of Operators / 311 \\
                 7.6.1. Operator Algebra / 311 \\
                 7.6.2. Operator Series with Applications / 312 \\
                 7.7. Functions of Several Variables / 318 \\
                 7.7.1. Working with One Variable at a Time / 319 \\
                 7.7.2. Rectangular Grids / 319 \\
                 7.7.3. Irregular Triangular Grids / 322 \\
                 8: Differential Equations / 330 \\
                 8.1. Theoretical Background / 330 \\
                 8.1.1. Initial-Value Problems for Ordinary Differential
                 Equations / 330 \\
                 8.1.2. Error Propagation / 333 \\
                 8.1.3. Other Differential Equation Problems / 337 \\
                 8.2. Euler's Method, with Repeated Richardson
                 Extrapolation / 338 \\
                 8.3. Other Methods for Initial-Value Problems in
                 Ordinary Differential Equations / 342 \\
                 8.3.1. The Modified Midpoint Method / 342 \\
                 8.3.2. The Power-Series Method / 345 \\
                 8.3.3. Runge--Kutta Methods / 346 \\
                 8.3.4. Implicit Methods / 347 \\
                 8.3.5. Stiff Problems / 349 \\
                 8.3.6. Control of Step Size / 350 \\
                 8.3.7. A Finite-Difference Method for a Second-Order
                 Equation / 352 \\
                 8.4. Orientation on Boundary and Eigenvalue Problems
                 for Ordinary Differential Equations / 359 \\
                 8.4.1. Introduction / 359 \\
                 8.4.2. The Shooting Method / 359 \\
                 8.4.3. The Band Matrix Method / 361 \\
                 8.4.4. Numerical Example of an Eigenvalue Problem / 363
                 \\
                 8.5. Difference Equations / 367 \\
                 8.5.1. Homogeneous Linear Difference Equations with
                 Constant Coefficients / 368 \\
                 8.5.2. General Linear Difference Equations / 370 \\
                 8.5.3. Analysis of a Numerical Method with the Help of
                 a Test Problem / 372 \\
                 8.5.4. Linear Multistep Methods / 375 \\
                 8.6. Partial Differential Equations / 383 \\
                 8.6.1. Introduction / 383 \\
                 8.6.2. An Example of an Initial-Value Problem / 384 \\
                 8.6.3. An Example of a Boundary-Value Problem / 389 \\
                 8.6.4. Methods of Undetermined Coefficients and
                 Variational Methods / 392 \\
                 8.6.5. Finite-Element Methods / 395 \\
                 8.6.6. Integral Equations / 397 \\
                 9: Fourier Methods / 405 \\
                 9.1. Introduction / 405 \\
                 9.2. Basic Formulas and Theorems in Fourier Analysis /
                 406 \\
                 9.2.1. Functions of One Variable / 406 \\
                 9.2.2. Functions of Several Variables / 411 \\
                 9.3. Fast Fourier Analysis / 413 \\
                 9.3.1. An Important Special Case / 413 \\
                 9.3.2. Fast Fourier Analysis, General Case / 414 \\
                 9.4. Periodic Continuation of a Nonperiodic Function /
                 417 \\
                 9.5. The Fourier Integral Theorem / 419 \\
                 10: Optimization / 422 \\
                 10.1. Statement of the Problem, Definitions, and Normal
                 Form / 422 \\
                 10.2. The Simplex Method / 426 \\
                 10.3. Duality / 435 \\
                 10.4. The Transportation Problem and Some Other
                 Optimization Problems / 436 \\
                 10.5. Nonlinear Optimization Problems / 438 \\
                 10.5.1. Basic Concepts and Introductory Examples / 438
                 \\
                 10.5.2. Line Search / 440 \\
                 10.5.3. Algorithms for Unconstrained Optimization / 441
                 \\
                 10.5.4. Overdetermined Nonlinear Systems / 443 \\
                 10.5.5. Constrained Optimization / 444 \\
                 11: The Monte Carlo Method and Simulation / 448 \\
                 11.1. Introduction / 448 \\
                 11.2. Random Digits and Random Numbers / 449 \\
                 11.3. Applications; Reduction of Variance / 455 \\
                 11.4. Pseudorandom Numbers / 463 \\
                 12: Solutions to Problems / 465 \\
                 13: Bibliography and Published Algorithms / 536 \\
                 13.1. Introduction / 536 \\
                 13.2. General Literature in Numerical Analysis / 536
                 \\
                 13.3. Tables, Collections of Formulas, and Problems /
                 539 \\
                 13.4. Error Analysis and Approximation of Functions /
                 540 \\
                 13.5. Linear Algebra and Nonlinear Systems of Equations
                 / 541 \\
                 13.6. Interpolation, Numerical Integration, and
                 Numerical Treatment of Differential Equations / 543 \\
                 13.7. Optimization; Simulation / 545 \\
                 13.8. Reviews, Abstracts and Other Periodicals / 547
                 \\
                 13.9. Survey of Published Algorithms / 548 \\
                 Index by Subject to Algorithms, 1960--1970 / 548 \\
                 Appendix Tables / 563 \\
                 Index / 565",
}

@Book{Dalang:2009:MSP,
  author =       "Robert Dalang and Davar Khoshnevisan and Carl Mueller
                 and David Nualart and Yimin Xiao",
  title =        "A Minicourse on Stochastic Partial Differential
                 Equations",
  volume =       "1962",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xi + 216",
  year =         "2009",
  ISBN =         "3-540-85993-4 (softcover)",
  ISBN-13 =      "978-3-540-85993-2 (softcover)",
  LCCN =         "QA3 .L28 no.1962; QA3.L471",
  bibdate =      "Tue Jan 20 16:31:21 MST 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 library.mit.edu:9909/mit01;
                 z3950.loc.gov:7090/Voyager",
  series =       ser-LNM,
  acknowledgement = ack-nhfb,
}

@Book{Daniels:1962:EPC,
  author =       "Farrington Daniels and J. W. Williams and Paul Bender
                 and Robert A. Alberty and C. D. Cornwell",
  title =        "Experimental Physical Chemistry",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  edition =      "Sixth",
  pages =        "xv + 625",
  year =         "1962",
  LCCN =         "QD457 .D2 1962",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Darwin:2001:JCS,
  author =       "Ian Darwin",
  title =        "{Java} Cookbook: Solutions and Examples for {Java}
                 Developers",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xxix + 850",
  month =        jun,
  year =         "2001",
  ISBN =         "0-596-00170-3 (paperback)",
  ISBN-13 =      "978-0-596-00170-4 (paperback)",
  LCCN =         "QA76.73.J38 D348 2001",
  bibdate =      "Mon Jul 30 06:50:24 MDT 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/java2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/ora.bib;
                 http://www.oreilly.com/catalog/",
  price =        "US\$44.95",
  URL =          "http://www.oreilly.com/catalog/9780596001704;
                 http://www.oreilly.com/catalog/javacook",
  abstract =     "Offering Java developers short, focused pieces of code
                 that are easy to incorporate into other programs, this
                 text focuses on things that are useful, tricky, or
                 both. The book's code segments cover all of the
                 dominant APIs and many specialized APIs.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1. Getting Started: Compiling, Running, and
                 Debugging \\
                 2. Interacting with the Environment \\
                 3. Strings and Things \\
                 4. Pattern Matching with Regular Expressions \\
                 5. Numbers \\
                 6. Dates and Times \\
                 7. Structuring Data with Java \\
                 8. Object-Oriented Techniques \\
                 9. Input and Output \\
                 10. Directory and Filesystem Operations \\
                 11. Programming Serial and Parallel Ports \\
                 12. Graphics and Sound \\
                 13. Graphical User Interfaces \\
                 14. Internationalization and Localization \\
                 15. Network Clients \\
                 16. Server-Side Java: Sockets \\
                 17. Network Clients II: Applets and Web Clients \\
                 18. Web Server Java: Servlets and JSP \\
                 19. Java and Electronic Mail \\
                 20. Database Access \\
                 21. XML \\
                 22. Distributed Java: RMI \\
                 23. Packages and Packaging \\
                 24. Threaded Java \\
                 25. Introspection, or ``A Class Named Class'' \\
                 26. Using Java with Other Languages",
}

@Book{Davie:RDC81,
  author =       "A. J. T. Davie and R. Morrison",
  title =        "Recursive Descent Compiling",
  publisher =    pub-ELLIS-HORWOOD,
  address =      pub-ELLIS-HORWOOD:adr,
  pages =        "195",
  year =         "1981",
  ISBN =         "0-470-27270-8 (Halstead Press), 0-85312-386-1 (Ellis
                 Horwood)",
  ISBN-13 =      "978-0-470-27270-1 (Halstead Press), 978-0-85312-386-6
                 (Ellis Horwood)",
  LCCN =         "QA76.6 .D373",
  bibdate =      "Tue Dec 14 22:47:07 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Ellis Horwood Series in Computers and their
                 Applications, Editor: Brian Meek",
  acknowledgement = ack-nhfb,
}

@Book{Davis:1965:APC,
  author =       "Jeff C. {Davis, Jr.}",
  title =        "Advanced Physical Chemistry: Molecules, Structure, and
                 Spectra",
  publisher =    "Ronald Press Company",
  address =      "New York, NY, USA",
  pages =        "x + 632",
  year =         "1965",
  LCCN =         "QD453.D36",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Davis:1975:MNI,
  author =       "Philip J. Davis and Philip Rabinowitz",
  title =        "Methods of numerical integration",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "xii + 459",
  year =         "1975",
  ISBN =         "0-12-206350-3",
  ISBN-13 =      "978-0-12-206350-3",
  LCCN =         "QA299.3 .D28",
  bibdate =      "Sat Dec 24 15:53:15 MST 2005",
  bibsource =    "Amazon;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Computer science and applied mathematics",
  acknowledgement = ack-nhfb,
  bookformat =   "Unknown Binding",
  category =     "Science; Mathematics; Mathematical Analysis",
  DEWEY =        "515/.624",
  idnumber =     "543",
  keywords =     "Numerical integration",
  libnote =      "Not in my library",
}

@InProceedings{deBalbine:design,
  author =       "Guy de Balbine",
  title =        "Design Criteria for the Structuring Engine",
  crossref =     "AFIPS:1975:SUJ",
  pages =        "??--??",
  year =         "1975",
  bibdate =      "Sat Apr 29 17:51:17 1995",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{DeBrosse:2004:SBU,
  author =       "Jim DeBrosse and Colin B. Burke",
  title =        "The Secret in {Building 26}: the Untold Story of
                 {America}'s Ultra War Against the {U}-boat {Enigma}
                 Codes",
  publisher =    pub-RANDOM-HOUSE,
  address =      pub-RANDOM-HOUSE:adr,
  pages =        "xxix + 272",
  year =         "2004",
  ISBN =         "0-375-50807-4, 1-58836-353-8 (e-book), 0-375-75995-6",
  ISBN-13 =      "978-0-375-50807-3, 978-1-58836-353-4 (e-book),
                 978-0-375-75995-6",
  LCCN =         "D810.C88 D43 2004",
  bibdate =      "Fri Jan 13 17:17:54 MST 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/samples/random045/2003058494.html;
                 http://www.randomhouse.com/catalog/display.pperl?isbn=9781588363534",
  acknowledgement = ack-nhfb,
  remark =       "From the publisher: ``Much has been written about the
                 success of the British ``Ultra'' program in cracking
                 the Germans' Enigma code early in World War II, but few
                 know what really happened in 1942, when the Germans
                 added a fourth rotor to the machine that created the
                 already challenging naval code and plunged Allied
                 intelligence into darkness.

                 Enter one Joe Desch, an unassuming but brilliant
                 engineer at the National Cash Register Company in
                 Dayton, Ohio, who was given the task of creating a
                 machine to break the new Enigma settings. It was an
                 enterprise that rivaled the Manhattan Project for
                 secrecy and complexity---and nearly drove Desch to a
                 breakdown. Under enormous pressure, he succeeded in
                 creating a 5,000-pound electromechanical monster known
                 as the Desch Bombe, which helped turn the tide in the
                 Battle of the Atlantic---but not before a disgruntled
                 co-worker attempted to leak information about the
                 machine to the Nazis.

                 After toiling anonymously---it even took his daughter
                 years to learn of his accomplishments---Desch was
                 awarded the National Medal of Merit, the country's
                 highest civilian honor. In The Secret in Building 26,
                 the entire thrilling story of the final triumph over
                 Enigma is finally told.''",
  subject =      "World War, 1939--1945; Cryptography; Enigma cipher
                 system; United States; History; 20th century; Desch,
                 Joseph",
  tableofcontents = "Building the perfect machine \\
                 Guesswork, moxie, and just plain luck \\
                 Miss Aggie's big blunder \\
                 Toward an American Bletchley Park \\
                 A giant leap \\
                 and a step backward \\
                 The Turing memo \\
                 Troubles with Adam and Eve \\
                 U-boats on the run \\
                 The WAVES come aboard \\
                 A well-oiled machine \\
                 An enemy within? \\
                 Triumph! \\
                 New challenges \\
                 and breakdown \\
                 Burying the past",
}

@Book{deBruin:1988:PML,
  author =       "R. de Bruin and C. G. {van der Laan} and J. R. Luyten
                 and H. F. Vogt",
  title =        "Publiceren met {\LaTeX}",
  volume =       "19",
  publisher =    pub-CWI,
  address =      pub-CWI:adr,
  pages =        "196",
  year =         "1988",
  ISBN =         "90-6196-357-5",
  ISBN-13 =      "978-90-6196-357-8",
  LCCN =         "Z253.4.L38 .P97 1988",
  MRclass =      "68U15, 68-01",
  bibdate =      "Tue Dec 14 22:43:17 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  ZMnumber =     "0743.68137",
  acknowledgement = ack-nhfb,
  language =     "Dutch",
}

@Book{DEC:1982:PVC,
  author =       "{Digital Equipment Corporation}",
  title =        "Programming in {VAX-11 C}",
  publisher =    pub-DP,
  address =      pub-DP:adr,
  month =        may,
  year =         "1982",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{DEC:AAH92,
  author =       "Digital Equipment Corporation",
  title =        "{Alpha} Architecture Handbook",
  publisher =    pub-DP,
  address =      pub-DP:adr,
  year =         "1992",
  bibdate =      "Mon Jan 18 15:08:40 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{deDinechin:2024:ASA,
  author =       "Florent de Dinechin and Martin Kumm",
  title =        "Application-specific Arithmetic: Computing Just Right
                 for the Reconfigurable Computer and the Dark Silicon
                 Era",
  publisher =    pub-SV-CHAM,
  address =      pub-SV-CHAM:adr,
  pages =        "xxiii + 804",
  year =         "2024",
  DOI =          "https://doi.org/10.1007/978-3-031-42808-1",
  ISBN =         "3-031-42807-2, 3-031-42808-0 (e-book), 3-031-42809-9,
                 3-031-42810-2",
  ISBN-13 =      "978-3-031-42807-4, 978-3-031-42808-1 (e-book),
                 978-3-031-42809-8, 978-3-031-42810-4",
  LCCN =         "QA76.9.C62 D56 2024",
  bibdate =      "Fri Dec 8 13:09:29 MST 2023",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/cordic.bib;
                 https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://perso.citi-lab.fr/fdedinec/ASA-book/errata.pdf;
                 https://link.springer.com/book/10.1007/978-3-031-42808-1",
  abstract =     "Written by two experts of the domain, this book
                 presents the most recent advances in computer
                 arithmetic hardware, with a focus on
                 application-specific arithmetic beyond the classic
                 operators and the standard precisions. It targets
                 silicon designers who have to do better with less in
                 the post-Moore era, and FPGA developers who want to
                 exploit the full possibilities of reconfigurable
                 computing platforms. Presents a unique focus on
                 application-specific computer arithmetic; Helps
                 developers gain a deep understanding of the arithmetic
                 in their projects, and tailor it to their application;
                 Illustrates concepts and architectures by actual
                 implementations, using the FloPoCo open-source hardware
                 generator.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Introduction \\
                 2: Number Formats \\
                 3: Computing Just Right: Accuracy Specification and
                 Error Analysis \\
                 4: Field Programmable Gate Arrays \\
                 \\
                 Part 1 Revisiting Classic Arithmetic \\
                 5: Fixed-Point Addition \\
                 6: Fixed-Point Comparison \\
                 7: Sums of Weighted Bits \\
                 8: Fixed-Point Multiplication \\
                 9: Fixed-Point Division \\
                 10: Shifters and Leading Bit Counters \\
                 11: Basic Floating-Point Operators \\
                 \\
                 Part 2 Operator Specialization \\
                 12: Multiplication by Constants \\
                 13: Division by Constants \\
                 14: Fixed-Point Squares, Cubes, and Other Integer
                 Powers \\
                 15: Specialization and Fusion of Floating-Point
                 Operators \\
                 \\
                 Part 3 Generic Methods for Fixed-Point Function
                 Approximation \\
                 16: Generalities on Fixed-Point Function Approximation
                 \\
                 17: Function Evaluation Using Tables and Additions \\
                 18: Polynomial-Based Architectures for Function
                 Evaluation \\
                 19: Digit Recurrence for Algebraic Functions \\
                 \\
                 Part 4 Example Composite Operators \\
                 20: Fixed-Point Sine and Cosine \\
                 21: Floating-Point Accumulation and Sum-of-Products \\
                 22: Floating-Point Exponential \\
                 \\
                 Part 5 Application Domains \\
                 23: Arithmetic in The Design of Linear Time-Invariant
                 Filters \\
                 24: Arithmetic for Deep Learning \\
                 \\
                 Part 6 Appendix \\
                 25: Appendix A: Custom Arithmetic Datapath Design with
                 FloPoCo \\
                 26: Appendix B: Optimization Using Integer Linear
                 Programming",
}

@Book{Degering:1951:OCO,
  editor =       "Ed F. Degering and {Seventy Six Assistant Editors}",
  title =        "Organic Chemistry: An Outline of the Beginning Course
                 Including Material for Advanced Study",
  volume =       "6",
  publisher =    pub-BARNES-NOBLE,
  address =      pub-BARNES-NOBLE:adr,
  edition =      "Sixth",
  pages =        "xxv + 422",
  year =         "1951",
  LCCN =         "QD256 .D4 1968",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Revised, 1957.",
  series =       "College Outline Series",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{deGrasseTyson:2008:PFR,
  author =       "Neil deGrasse Tyson",
  title =        "The {Pluto} files: the rise and fall of {America}'s
                 favorite planet",
  publisher =    pub-NORTON,
  address =      pub-NORTON:adr,
  pages =        "xii + 194",
  year =         "2008",
  ISBN =         "0-393-06520-0 (hardcover)",
  ISBN-13 =      "978-0-393-06520-6 (hardcover)",
  LCCN =         "QB701 .T97 2009",
  bibdate =      "Tue Jan 24 14:06:56 MST 2012",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  subject =      "Pluto (Dwarf planet)",
  tableofcontents = "Preface xi \\
                 1 Pluto in Culture 3 \\
                 2 Pluto in History 21 \\
                 3 Pluto in Science 33 \\
                 4 Pluto's Fall from Grace 49 \\
                 5 Pluto Divides the Nation 95 \\
                 6 Pluto's Judgment Day 115 \\
                 7 Pluto the Dwarf Planet 131 \\
                 8 Pluto in the Elementary School Classroom",
}

@Book{deGrasseTyson:2018:AWU,
  author =       "Neil deGrasse Tyson and Avis Lang",
  title =        "Accessory to War: the Unspoken Alliance Between
                 Astrophysics and the Military",
  publisher =    pub-NORTON,
  address =      pub-NORTON:adr,
  pages =        "xiv + 576",
  year =         "2018",
  ISBN =         "0-393-06444-1 (hardcover)",
  ISBN-13 =      "978-0-393-06444-5 (hardcover)",
  LCCN =         "UG1523 .T97 2018",
  bibdate =      "Sat Dec 22 16:29:48 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "An exploration of the age-old complicity between
                 skywatchers and warfighters, from the best-selling
                 author of \booktitle{Astrophysics for People in a
                 Hurry}. In this fascinating foray into the
                 centuries-old relationship between science and military
                 power, acclaimed astrophysicist Neil deGrasse Tyson and
                 writer--researcher Avis Lang examine how the methods
                 and tools of astrophysics have been enlisted in the
                 service of war. The overlap is strong, and the
                 knowledge flows in both directions, say the authors,
                 because astrophysicists and military planners care
                 about many of the same things: multispectral detection,
                 ranging, tracking, imaging, high ground, nuclear
                 fusion, and access to space. Tyson and Lang call it a
                 `curiously complicit' alliance. Spanning early
                 celestial navigation to satellite-enabled warfare,
                 \booktitle{Accessory to War} is a richly researched and
                 provocative examination of the intersection of science,
                 technology, industry, and power that will introduce
                 Tyson's millions of fans to yet another dimension of
                 how the universe has shaped our lives and our world.",
  acknowledgement = ack-nhfb,
  subject =      "Astronautics, Military; United States; Astrophysics;
                 Military research; Military art and science;
                 Technological innovations; History; Science and state",
  tableofcontents = "Prologue \\
                 Situational awareness \\
                 A time to kill \\
                 Star power \\
                 Sea power \\
                 Arming the eye \\
                 The ultimate high ground \\
                 Unseen, undetected, unspoken \\
                 Detection stories \\
                 Making war, seeking peace \\
                 Space power \\
                 A time to heal",
}

@Book{DeGroot:2002:PS,
  author =       "Morris H. DeGroot and Mark J. Schervish",
  title =        "Probability and Statistics",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Third",
  pages =        "xv + 816",
  year =         "2002",
  ISBN =         "0-201-52488-0, 0-321-20473-5 (paperback),
                 0-201-71129-X (Solutions manual)",
  ISBN-13 =      "978-0-201-52488-8, 978-0-321-20473-8 (paperback),
                 978-0-201-71129-5 (Solutions manual)",
  LCCN =         "QA273 .D35 2002",
  bibdate =      "Mon Oct 26 17:55:42 MDT 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "The revision of this well-respected text presents a
                 balanced approach of the classical and Bayesian methods
                 and now includes a new chapter on simulation (including
                 Markov chain Monte Carlo and the Bootstrap), expanded
                 coverage of residual analysis in linear models, and
                 more examples using real data.",
  acknowledgement = ack-nhfb,
  subject =      "probabilities; mathematical statistics",
  tableofcontents = "1: Introduction to probability \\
                 2: Conditional probability \\
                 3: Random values and distributions \\
                 4: Expectation \\
                 5: Special distributions \\
                 6: Estimation \\
                 7: Sampling distributions of estimators \\
                 8: Testing hypotheses \\
                 9: Categorical data and nonparametric methods \\
                 10: Linear statistical models \\
                 11: Simulation",
}

@Book{DeLamarter:1986:BBI,
  author =       "Richard Thomas DeLamarter",
  title =        "{Big Blue}: {IBM}'s use and abuse of power",
  publisher =    "Dodd, Mead",
  address =      "New York, NY, USA",
  pages =        "xviii + 393",
  year =         "1986",
  ISBN =         "0-396-08515-6",
  ISBN-13 =      "978-0-396-08515-7",
  LCCN =         "HD9696.C64 I4835 1986",
  bibdate =      "Fri Jan 24 07:00:35 MST 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  remark =       "An account of the 1970s antitrust suit against IBM,
                 initiated by competitors known as the BUNCH (Burroughs,
                 Univac, NCR, CDC, and Honeywell), and prosecuted by the
                 US government.",
  subject =      "Computer industry; United States; Monopolies;
                 Government policy; IBM (International Business Machines
                 Corporation)",
}

@Book{DelZoppo:1976:VP,
  author =       "Annette {Del Zoppo}",
  title =        "The {Vegreville} Pysanka",
  publisher =    "Ronald D. Resch",
  address =      "Salt Lake City, UT, USA",
  pages =        "16",
  year =         "1976",
  bibdate =      "Sat Mar 25 06:34:32 2017",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  remark =       "This is a brief story with several photographs by the
                 author of the design, construction, and installation of
                 the Ukrainian Easter egg sculpture in Vegreville, AB,
                 Canada.",
}

@Book{Denbigh:1966:PCE,
  author =       "Kenneth Denbigh",
  title =        "The Principles of Chemical Equilibrium: With
                 Applications in Chemistry and Chemical Engineering",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xxi + 494",
  year =         "1966",
  LCCN =         "QD501 .D365 1966",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Dennis:1983:NMU,
  author =       "J. E. {Dennis, Jr.} and Robert B. Schnabel",
  title =        "Numerical Methods for Unconstrained Optimization and
                 Nonlinear Equations",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xiii + 378",
  year =         "1983",
  ISBN =         "0-13-627216-9",
  ISBN-13 =      "978-0-13-627216-8",
  LCCN =         "QA402.5 .D44 1983",
  bibdate =      "Tue Dec 14 22:47:13 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,
}

@Book{Deogun:2018:SD,
  author =       "Daniel Deogun and Dan Bergh Johnsson and Daniel
                 Sawano",
  title =        "Secure by Design",
  publisher =    pub-MANNING,
  address =      pub-MANNING:adr,
  pages =        "xxx + 368",
  year =         "2019",
  ISBN =         "1-61729-435-7 (paperback), 1-63835-231-3 (e-book)",
  ISBN-13 =      "978-1-61729-435-8 (paperback), 978-1-63835-231-0
                 (e-book)",
  LCCN =         "QA76.754 .D464 2018",
  bibdate =      "Tue May 6 09:36:40 MDT 2025",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Foreword by Daniel Terhorst-North.",
  URL =          "https://www.manning.com/books/secure-by-design",
  abstract =     "Secure by Design teaches you principles and best
                 practices for writing highly secure software. At the
                 code level, you'll discover security-promoting
                 constructs like safe error handling, secure validation,
                 and domain primitives. You'll also master
                 security-centric techniques you can apply throughout
                 your build-test-deploy pipeline, including the unique
                 concerns of modern microservices and cloud-native
                 designs.",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "Part 1: Introduction \\
                 1: Why design matters for security \\
                 2: Intermission: the anti-Hamlet \\
                 Part 2: Fundamentals \\
                 3: Core concepts of Domain-Driven Design \\
                 4: Code constructs promoting security \\
                 5: Domain primitives \\
                 6: Ensuring integrity of state \\
                 7: Reducing complexity of state \\
                 8: Leveraging your delivery pipeline for security \\
                 9: Handling failures securely \\
                 10: Benefits of cloud thinking \\
                 11: Intermission: an insurance policy for free \\
                 Part 3: Applying the Fundamentals \\
                 12: Guidance in legacy code \\
                 13: Guidance on microservices \\
                 14: A final word: don't forget about security!",
  subject =      "Computer software; Development",
  tableofcontents = "Intro \\
                 Secure by Design \\
                 Brief contents \\
                 Contents \\
                 Front matter \\
                 Foreword \\
                 Preface \\
                 Acknowledgments \\
                 About this book \\
                 Who should read this book \\
                 How this book is organized: A roadmap \\
                 About the code \\
                 LiveBook discussion forum \\
                 About the authors \\
                 About the cover illustration \\
                 Part 1 Introduction \\
                 1 Why design matters for security \\
                 1.1 Security is a concern, not a feature \\
                 1.1.1 The robbery of {\"O}st-G{\"o}tha Bank, 1854 \\
                 1.1.2 Security features and concerns \\
                 1.1.3 Categorizing security concerns: CIA-T \\
                 1.2 Defining design \\
                 1.3 The traditional approach to software security and
                 its shortcomings \\
                 1.3.1 Explicitly thinking about security \\
                 1.3.2 Everyone is a security expert \\
                 1.3.3 Knowing all and the unknowable \\
                 1.4 Driving security through design \\
                 1.4.1 Making the user secure by design \\
                 1.4.2 The advantages of the design approach \\
                 1.4.3 Staying eclectic \\
                 1.5 Dealing with strings, XML, and a billion laughs \\
                 1.5.1 Extensible Markup Language (XML) \\
                 1.5.2 Internal XML entities in a nutshell \\
                 1.5.3 The Billion Laughs attack \\
                 1.5.4 Configuring the XML parser \\
                 1.5.5 Applying a design mindset \\
                 1.5.6 Applying operational constraints \\
                 1.5.7 Achieving security in depth \\
                 Summary \\
                 2 Intermission: The anti-Hamlet \\
                 2.1 An online bookstore with business integrity issues
                 \\
                 2.1.1 The inner workings of the accounts receivable
                 ledger \\
                 2.1.2 How the inventory system tracks books in the
                 store \\
                 2.1.3 Shipping anti-books \\
                 2.1.4 Systems living the same lie \\
                 2.1.5 A do-it-yourself discount voucher \\
                 2.2 Shallow modeling \\
                 2.2.1 How shallow models emerge \\
                 2.2.2 The dangers of implicit concepts \\
                 2.3 Deep modeling \\
                 2.3.1 How deep models emerge \\
                 2.3.2 Make the implicit explicit \\
                 Summary \\
                 Part 2 Fundamentals \\
                 3 Core concepts of Domain-Driven Design3.1 Models as
                 tools for deeper insight \\
                 3.1.1 Models are simplifications \\
                 3.1.2 Models are strict \\
                 3.1.3 Models capture deep understanding \\
                 3.1.4 Making a model means choosing one \\
                 3.1.5 The model forms the ubiquitous language \\
                 3.2 Building blocks for your model \\
                 3.2.1 Entities \\
                 3.2.2 Value objects \\
                 3.2.3 Aggregates \\
                 3.3 Bounded contexts \\
                 3.3.1 Semantics of the ubiquitous language \\
                 3.3.2 The relationship between language, model, and
                 bounded context \\
                 3.3.3 Identifying the bounded context \\
                 3.4 Interactions between contexts \\
                 3.4.1 Sharing a model in two contexts \\
                 3.4.2 Drawing a context map \\
                 Summary \\
                 4 Code constructs promoting security \\
                 4.1 Immutability \\
                 4.1.1 An ordinary webshop \\
                 4.2 Failing fast using contracts \\
                 4.2.1 Checking preconditions for method arguments \\
                 4.2.2 Upholding invariants in constructors \\
                 4.2.3 Failing for bad state \\
                 4.3 Validation \\
                 4.3.1 Checking the origin of data \\
                 4.3.2 Checking the size of data \\
                 4.3.3 Checking lexical content of data \\
                 4.3.4 Checking the data syntax \\
                 4.3.5 Checking the data semantics \\
                 Summary \\
                 5 Domain primitives \\
                 5.1 Domain primitives and invariants \\
                 5.1.1 Domain primitives as the smallest building blocks
                 \\
                 5.1.2 Context boundaries define meaning \\
                 5.1.3 Building your domain primitive library \\
                 5.1.4 Hardening APIs with your domain primitive library
                 \\
                 5.1.5 Avoid exposing your domain publicly \\
                 5.2 Read-once objects \\
                 5.2.1 Detecting unintentional use \\
                 5.2.2 Avoiding leaks caused by evolving code \\
                 5.3 Standing on the shoulders of domain primitives \\
                 5.3.1 The risk with overcluttered entity methods \\
                 5.3.2 Decluttering entities \\
                 5.3.3 When to use domain primitives in entities \\
                 5.4 Taint analysis \\
                 Summary \\
                 6 Ensuring integrity of state \\
                 6.1 Managing state using entities \\
                 6.2 Consistent on creation6.2.1 The perils of no-arg
                 constructors \\
                 6.2.2 ORM frameworks and no-arg constructors \\
                 6.2.3 All mandatory fields as constructor arguments \\
                 6.2.4 Construction with a fluent interface \\
                 6.2.5 Catching advanced constraints in code \\
                 6.2.6 The builder pattern for upholding advanced
                 constraints \\
                 6.2.7 ORM frameworks and advanced constraints \\
                 6.2.8 Which construction to use when \\
                 6.3 Integrity of entities \\
                 6.3.1 Getter and setter methods \\
                 6.3.2 Avoid sharing mutable objects \\
                 6.3.3 Securing the integrity of collections \\
                 Summary \\
                 7 Reducing complexity of state \\
                 7.1 Partially immutable entities \\
                 7.2 Entity state objects \\
                 7.2.1 Upholding entity state rules \\
                 7.2.2 Implementing entity state as a separate object
                 \\
                 7.3 Entity snapshots \\
                 7.3.1 Entities represented with immutable objects \\
                 7.3.2 Changing the state of the underlying entity \\
                 7.3.3 When to use snapshots \\
                 7.4 Entity relay \\
                 7.4.1 Splitting the state graph into phases \\
                 7.4.2 When to form an entity relay \\
                 Summary \\
                 8 Leveraging your delivery pipeline for security \\
                 8.1 Using a delivery pipeline \\
                 8.2 Securing your design using unit tests \\
                 8.2.1 Understanding the domain rules \\
                 8.2.2 Testing normal behavior \\
                 8.2.3 Testing boundary behavior \\
                 8.2.4 Testing with invalid input \\
                 Testing with input that causes eventual harm \\
                 8.2.5 Testing the extreme \\
                 8.3 Verifying feature toggles \\
                 8.3.1 The perils of slippery toggles \\
                 8.3.2 Feature toggling as a development tool \\
                 8.3.3 Taming the toggles \\
                 8.3.4 Dealing with combinatory complexity \\
                 8.3.5 Toggles are subject to auditing \\
                 8.4 Automated security tests \\
                 8.4.1 Security tests are only tests \\
                 8.4.2 Working with security tests \\
                 8.4.3 Leveraging infrastructure as code \\
                 8.4.4 Putting it into practice \\
                 8.5 Testing for availability \\
                 8.5.1 Estimating the headroom8.5.2 Exploiting domain
                 rules \\
                 8.6 Validating configuration \\
                 8.6.1 Causes for configuration-related security flaws
                 \\
                 8.6.2 Automated tests as your safety net \\
                 8.6.3 Knowing your defaults and verifying them \\
                 Summary \\
                 9 Handling failures securely \\
                 9.1 Using exceptions to deal with failure \\
                 9.1.1 Throwing exceptions \\
                 9.1.2 Handling exceptions \\
                 9.1.3 Dealing with exception payload \\
                 9.2 Handling failures without exceptions \\
                 9.2.1 Failures aren't exceptional \\
                 9.2.2 Designing for failures \\
                 9.3 Designing for availability \\
                 9.3.1 Resilience \\
                 9.3.2 Responsiveness \\
                 9.3.3 Circuit breakers and timeouts \\
                 Always specify a timeout \\
                 9.3.4 Bulkheads \\
                 9.4 Handling bad data \\
                 Cross-site scripting and second-order attacks \\
                 9.4.1 Don't repair data before validation \\
                 9.4.2 Never echo input verbatim \\
                 Summary \\
                 10 Benefits of cloud thinking \\
                 10.1 The twelve-factor app and cloud-native concepts
                 \\
                 10.2 Storing configuration in the environment \\
                 10.2.1 Don't put environment configuration in code \\
                 10.2.2 Never store secrets in resource files \\
                 10.2.3 Placing configuration in the environment \\
                 10.3 Separate processes \\
                 10.3.1 Deploying and running are separate things \\
                 10.3.2 Processing instances don't hold state \\
                 10.3.3 Security benefits \\
                 10.4 Avoid logging to file \\
                 10.4.1 Confidentiality \\
                 10.4.2 Integrity \\
                 10.4.3 Availability \\
                 10.4.4 Logging as a service \\
                 10.5 Admin processes \\
                 10.5.1 The security risk of overlooked admin tasks \\
                 10.5.2 Admin tasks as first-class citizens \\
                 Admin of log files \\
                 10.6 Service discovery and load balancing \\
                 10.6.1 Centralized load balancing \\
                 10.6.2 Client-side load balancing \\
                 10.6.3 Embracing change \\
                 10.7 The three R's of enterprise security \\
                 10.7.1 Increase change to reduce risk \\
                 10.7.2 Rotate \\
                 10.7.3 Repave \\
                 10.7.4 Repair \\
                 Summary11 Intermission: An insurance policy for free
                 \\
                 11.1 Over-the-counter insurance policies \\
                 11.2 Separating services \\
                 11.3 A new payment type \\
                 11.4 A crashed car, a late payment, and a court case
                 \\
                 11.5 Understanding what went wrong \\
                 11.6 Seeing the entire picture \\
                 11.7 A note on microservices architecture \\
                 Summary \\
                 Part 3 Applying the fundamentals \\
                 12 Guidance in legacy code \\
                 12.1 Determining where to apply domain primitives in
                 legacy code \\
                 12.2 Ambiguous parameter lists \\
                 12.2.1 The direct approach \\
                 12.2.2 The discovery approach \\
                 12.2.3 The new API approach \\
                 12.3 Logging unchecked strings \\
                 12.3.1 Identifying logging of unchecked strings \\
                 12.3.2 Identifying implicit data leakage \\
                 12.4 Defensive code constructs \\
                 12.4.1 Code that doesn't trust itself \\
                 12.4.2 Contracts and domain primitives to the rescue
                 \\
                 12.4.3 Overlenient use of Optional \\
                 12.5 DRY misapplied-not focusing on ideas, but on text
                 \\
                 12.5.1 A false positive that shouldn't be DRY'd away
                 \\
                 12.5.2 The problem of collecting repeated pieces of
                 code \\
                 12.5.3 The good DRY \\
                 12.5.4 A false negative \\
                 12.6 Insufficient validation in domain types \\
                 12.7 Only testing the good enough \\
                 12.8 Partial domain primitives \\
                 No double money \\
                 12.8.1 Implicit, contextual currency \\
                 12.8.2 A U.S. dollar is not a Slovenian tolar \\
                 12.8.3 Encompassing a conceptual whole \\
                 Summary \\
                 13 Guidance on microservices \\
                 13.1 What's a microservice? \\
                 13.1.1 Independent runtimes \\
                 13.1.2 Independent updates \\
                 13.1.3 Designed for down \\
                 13.2 Each service is a bounded context \\
                 13.2.1 The importance of designing your API \\
                 13.2.2 Splitting monoliths \\
                 13.2.3 Semantics and evolving services \\
                 13.3 Sensitive data across services \\
                 13.3.1 CIA-T in a microservice architecture \\
                 13.3.2 Thinking ``sensitive'' \\
                 13.4 Logging in microservices \\
                 13.4.1 Integrity of aggregated log data \\
                 \ldots{}",
}

@Book{Derbyshire:2003:POH,
  author =       "John Derbyshire",
  title =        "Prime obsession: {Bernhard Riemann} and the greatest
                 unsolved problem in mathematics",
  publisher =    "Joseph Henry Press",
  address =      "Washington, DC, USA",
  pages =        "xv + 422",
  year =         "2003",
  DOI =          "https://doi.org/10.17226/10532",
  ISBN =         "0-309-08549-7",
  ISBN-13 =      "978-0-309-08549-6",
  LCCN =         "QA246 .D47 2003",
  bibdate =      "Wed Apr 5 12:16:56 MDT 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 melvyl.cdlib.org:210/CDL90",
  URL =          "http://www.loc.gov/catdir/toc/fy038/2002156310.html;
                 https://www.nap.edu/catalog/10532/prime-obsession-bernhard-riemann-and-the-greatest-unsolved-problem-in",
  abstract =     "In August 1859, Bernhard Riemann, a little-known
                 32-year old mathematician, presented a paper to the
                 Berlin Academy titled: ``On the Number of Prime Numbers
                 Less Than a Given Quantity.'' In the middle of that
                 paper, Riemann made an incidental remark a guess, a
                 hypothesis. What he tossed out to the assembled
                 mathematicians that day has proven to be almost cruelly
                 compelling to countless scholars in the ensuing years.
                 Today, after 150 years of careful research and
                 exhaustive study, the question remains. Is the
                 hypothesis true or false? Riemann's basic inquiry, the
                 primary topic of his paper, concerned a straightforward
                 but nevertheless important matter of arithmetic
                 defining a precise formula to track and identify the
                 occurrence of prime numbers. But it is that incidental
                 remark the Riemann Hypothesis that is the truly
                 astonishing legacy of his 1859 paper. Because Riemann
                 was able to see beyond the pattern of the primes to
                 discern traces of something mysterious and
                 mathematically elegant shrouded in the shadows subtle
                 variations in the distribution of those prime numbers.
                 Brilliant for its clarity, astounding for its potential
                 consequences, the Hypothesis took on enormous
                 importance in mathematics. Indeed, the successful
                 solution to this puzzle would herald a revolution in
                 prime number theory. Proving or disproving it became
                 the greatest challenge of the age. It has become clear
                 that the Riemann Hypothesis, whose resolution seems to
                 hang tantalizingly just beyond our grasp, holds the key
                 to a variety of scientific and mathematical
                 investigations. The making and breaking of modern
                 codes, which depend on the properties of the prime
                 numbers, have roots in the Hypothesis. In a series of
                 extraordinary developments during the 1970s, it emerged
                 that even the physics of the atomic nucleus is
                 connected in ways not yet fully understood to this
                 strange conundrum. Hunting down the solution to the
                 Riemann Hypothesis.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "Riemann, Bernhard; Numbers, Prime; Series",
  subject-dates = "1826--1866",
  tableofcontents = "Part I. The Prime Number Theorem \\
                 1: Card Trick \\
                 2: The Soil, the Crop \\
                 3: The Prime Number Theorem \\
                 4: On the Shoulders of Giants \\
                 5: Riemann's Zeta Function \\
                 6: The Great Fusion \\
                 7: The Golden Key, and an Improved Prime Number Theorem
                 \\
                 8: Not Altogether Unworthy \\
                 9: Domain Stretching \\
                 10: A Proof and a Turning Point \\
                 Part II. The Riemann Hypothesis \\
                 11: Nine Zulu Queens Ruled China \\
                 12: Hilbert's Eighth Problem \\
                 13: The Argument Ant and the Value Ant \\
                 14: In the Grip of an Obsession \\
                 15: Big Oh and M{\"o}bius Mu \\
                 16: Climbing the Critical Line \\
                 17: A Little Algebra \\
                 18: Number Theory Meets Quantum Mechanics \\
                 19: Turning the Golden Key \\
                 20: The Riemann Operator and Other Approaches \\
                 21: The Error Term \\
                 22: Either It's True, or Else It Isn't \\
                 Appendix: The Riemann Hypothesis in Song",
}

@Book{DeRespinis:2012:ISG,
  author =       "Francis DeRespinis and Peter Hayward and Jana Jenkins
                 and Amy Laird and Leslie McDonald and Eric Radzinski",
  title =        "The {IBM} style guide: conventions for writers and
                 editors",
  publisher =    "IBM Press/Pearson",
  address =      "Upper Saddle River, NJ, USA",
  pages =        "xxvi + 389",
  year =         "2012",
  ISBN =         "0-13-210130-0 (paperback)",
  ISBN-13 =      "978-0-13-210130-1 (paperback)",
  LCCN =         "T11 .I15 2012",
  bibdate =      "Fri Apr 13 10:09:33 MDT 2012",
  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 =      "Technical writing; Handbooks, manuals, etc; English
                 language; Technical English; Electronic data processing
                 documentation",
  tableofcontents = "Language and grammar \\
                 Punctuation \\
                 Formatting and organization \\
                 Structure \\
                 References \\
                 Numbers and measurements \\
                 Computer interfaces \\
                 Writing for diverse audiences \\
                 Glossaries \\
                 Indexes",
}

@Book{Dershowitz:1997:CC,
  author =       "Nachum Dershowitz and Edward M. Reingold",
  title =        "Calendrical Calculations",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xxi + 307",
  year =         "1997",
  ISBN =         "0-521-56474-3 (paperback), 0-521-56413-1 (hardcover)",
  ISBN-13 =      "978-0-521-56474-8 (paperback), 978-0-521-56413-7
                 (hardcover)",
  LCCN =         "CE12.D47 1997",
  bibdate =      "Wed Dec 09 12:45:55 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Introduction \\
                 Part I. Arithmetical Calendars \\
                 The Gregorian calendar \\
                 The ISO calendar \\
                 The Julian calendar \\
                 The Coptic and Ethiopic calendars \\
                 The Islamic calendar \\
                 The Persian calendar \\
                 The Baha'i calendar \\
                 The Hebrew calendar \\
                 The Mayan calendar \\
                 The Old Hindu calendars \\
                 Part II. Astronomical Calendars \\
                 Time and astronomy \\
                 The French Revolutionary calendar \\
                 The Chinese calendar \\
                 The Modern Hindu calendars",
}

@Book{DesJardins:2010:MCC,
  author =       "Julie {Des Jardins}",
  title =        "The {Madame Curie} complex: the hidden history of
                 women in science",
  publisher =    "Feminist Press at the City University of New York",
  address =      "New York, NY, USA",
  pages =        "312 + 8",
  year =         "2010",
  ISBN =         "1-55861-613-6 (paperback), 1-55861-655-1 (e-book)",
  ISBN-13 =      "978-1-55861-613-4 (paperback), 978-1-55861-655-4
                 (e-book)",
  LCCN =         "Q141 .D44 2010",
  bibdate =      "Thu Nov 20 06:10:19 MST 2014",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Women writing science",
  URL =          "http://catdir.loc.gov/catdir/enhancements/fy1008/2009037794-b.html;
                 http://catdir.loc.gov/catdir/enhancements/fy1008/2009037794-d.html",
  abstract =     "The \booktitle{Madame Curie Complex} gives fresh
                 insight into the barriers and successes for women in
                 science, and sheds light on the way our cultural ideas
                 of gender have shaped the profession.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "Femmes scientifiques; Biographies; Femmes
                 ing{\'e}nieurs; R{\^o}le selon le sexe; {\'E}tats-Unis;
                 Histoire.",
  subject =      "Spouses; Sex role; United States; History; Women in
                 engineering; Women in science; Women engineers;
                 Biography; Women scientists; Sex role; Spouses; Women
                 engineers; Women in engineering; Women in science;
                 Women scientists",
  tableofcontents = "Introduction: Through the Lives of Women Scientists
                 / 1 \\
                 I. Assistants, housekeepers, and interchangeable parts:
                 women scientists and professionalization, 1880--1940 /
                 11 \\
                 1. Madame Curie's American tours: women and science in
                 the 1920s / 23 \\
                 2. Making science domestic and domesticity scientific:
                 the ambiguous life and ambidextrous work of Lillian
                 Gilbreth / 53 \\
                 3. To embrace or decline marriage and family: Annie
                 Jump Cannon and the women of the Harvard Observatory,
                 1880--1940 / 88 \\
                 II. The cult of masculinity in the age of heroic
                 science, 1941--1962 / 117 \\
                 4. Those science made invisible: finding the women of
                 the Manhattan Project / 130 \\
                 5. Maria Goeppert Mayer and Rosalind Franklin: the
                 politics of partners and prizes in the heroic age of
                 science / 157 \\
                 III. American women and science in transition, 1962-- /
                 201 \\
                 6. Generational divides: Rosalyn Sussman Yalow, Evelyn
                 Fox Keller, Barbara McClintock, and feminism after 1963
                 / 219 \\
                 7. The lady trimates and feminist science?: Jane
                 Goodall, Dian Fossey, and Birute Galdikas / 253 \\
                 Conclusion: Apes, corn, and silent springs: a women's
                 tradition of science? / 285 \\
                 Acknowledgments / 295 \\
                 Index / 297",
}

@Book{Devitt:1993:CMV,
  author =       "John S. Devitt",
  title =        "Calculus with {Maple V}",
  publisher =    pub-BROOKS-COLE,
  address =      pub-BROOKS-COLE:adr,
  pages =        "xxii + 502",
  year =         "1993",
  ISBN =         "0-534-16362-9",
  ISBN-13 =      "978-0-534-16362-4",
  LCCN =         "QA303.5.D37 D48 1993",
  bibdate =      "Tue Dec 14 22:47:21 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/maple-extract.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "1 The Basics and Interactive Computing / 1 \\
                 1.1 Introduction / 1 \\
                 1.1.1 Some Pointers to Better User-Machine
                 Communication \\
                 1.1.2 A Sample Session / 3 \\
                 1.1.3 Basic Objectives / 6 \\
                 1.1.4 Expressions and Equations / 6 \\
                 1.1.5 Graphical Representations / 9 \\
                 1.2 Plotting as an Aid to Understanding Inequalities /
                 12 \\
                 1.2.1 More on Inequalities / 15 \\
                 1.2.2 Type 1 Inequalities / 15 \\
                 1.2.3 Type 2 Inequalities / 20 \\
                 1.3 Equations Involving Two Variables / 22 \\
                 1.3.1 Equations of Straight Lines / 23 \\
                 1.3.2 Distances Between Points / 26 \\
                 1.3.3 Solving an Algebraic Equation Step by Step / 27
                 \\
                 1.3.4 Quadratic Equations and Their Graphs / 29 \\
                 1.3.5 Solving a Quadratic / 30 \\
                 1.3.6 Equations Involving $x^2$ and $y^2$ / 31 \\
                 1.4 Functions / 36 \\
                 1.4.1 Defining a Function / 36 \\
                 1.4.2 Using Functions / 37 \\
                 1.4.3 Restricted Domains / 39 \\
                 1.4.4 Finding Domains of Functions / 40 \\
                 1.4.5 Absolute Values / 42 \\
                 1.4.6 Step Functions / 43 \\
                 1.4.7 Even Functions / 44 \\
                 1.4.8 Odd functions / 44 \\
                 1.4.9 Constant Functions / 45 \\
                 1.5 New Functions from Old / 45 \\
                 1.5.1 Arithmetic Operations / 46 \\
                 1.5.2 Composition of Functions / 46 \\
                 Exercise Set 1 / 48 \\
                 2 Limits / 57 \\
                 / 98 \\
                 2.1 Introduction / 57 \\
                 2.2 Limit Computations in Maple / 61 \\
                 2.3 Some Limit Computations / 62 \\
                 2.3.1 Ratios of Polynomials / 62 \\
                 2.3.2 Obscure Common Factors / 66 \\
                 2.3.3 Limits That Are Bounded but Do Not Exist / 69 \\
                 2.3.4 Unbounded Functions / 69 \\
                 2.4 A Formal Definition of a Limit / 70 \\
                 2.4.1 Computing $\delta$ / 71 \\
                 2.5 Properties of Limits / 77 \\
                 2.6 The Squeeze Theorem / 81 \\
                 2.7 Continuity / 83 \\
                 2.7.1 One-Sided Limits / 85 \\
                 2.7.2 Combining Continuous Functions / 88 \\
                 2.8 The Intermediate Value Theorem / 89 \\
                 2.9 Exact Computations Versus Approximations / 92 \\
                 Exercise Set 2 / 93 \\
                 3 Derivatives \\
                 3.1 Introduction / 98 \\
                 3.1.1 Interpretations of the Derivative / 101 \\
                 3.1.2 Leibnitz Notation / 110 \\
                 3.2 Differentials / 112 \\
                 3.3 Differentiation Formulas / 114 \\
                 3.3.1 Some Fundamental Examples / 115 \\
                 3.3.2 Constants / 116 \\
                 3.3.3 Pure Powers / 117 \\
                 3.3.4 Laws for Addition and Multiplication / 122 \\
                 3.3.5 Derivatives of $ 1 / g(x)$ / 126 \\
                 3.3.6 Summary / 128 \\
                 3.4 Expressions versus Functions / 130 \\
                 3.5 Trigonometric Functions / 131 \\
                 3.5.1 Limits of Trigonometric Functions / 131 \\
                 3.5.2 Derivatives of Trigonometric Functions / 135 \\
                 3.6 The Chain Rule / 137 \\
                 3.6.1 Compositions Involving More Than Two Functions /
                 146 \\
                 3.6.2 Summary / 147 \\
                 3.7 Derivatives of Exponentials and Logarithms / 148
                 \\
                 3.7.1 Logarithms as Inverse Exponential Functions / 150
                 \\
                 3.8 Implicit Derivatives / 152 \\
                 3.8.1 Treating x and y as Functions oft / 156 \\
                 3.8.2 Related Rates / 158 \\
                 3.9 A Derivation of Newton's Formula / 163 \\
                 Exercise Set 3 / 167 \\
                 4 Optimal Solutions and Extreme Values / 173 \\
                 / 227 \\
                 4.1 Maximums and Minimums / 173 \\
                 4.1.1 Optimizations in Maple / 179 \\
                 4.1.2 Local Maximums and Minimums / 179 \\
                 4.1.3 The Extreme Value Theorem / 187 \\
                 4.1.4 Summary / 188 \\
                 4.2 The Mean Value Theorem / 188 \\
                 4.2.1 The Average Slope / 190 \\
                 4.3 Monotonic Functions / 197 \\
                 4.3.1 The First Derivative Test / 198 \\
                 4.4 Concavity and Points of Inflection / 202 \\
                 4.5 Asymptotes / 209 \\
                 4.6 Applied Maximum and Minimum Problems \\
                 Exercise Set 4 / 223 \\
                 5 Integration \\
                 5.1 Introduction / 227 \\
                 5.2 Summations / 228 \\
                 5.2.1 Summations and Area Under a Curve / 231 \\
                 5.2.2 Rules for Combining Sums / 232 \\
                 5.2.3 Formulas for Specific Sums / 234 \\
                 5.2.4 Discovering Formulas / 235 \\
                 5.3 Area / 239 \\
                 5.3.1 An Underestimate of the Area / 239 \\
                 5.3.2 An Overestimate of the Area / 242 \\
                 5.3.3 Better Estimates / 243 \\
                 5.4 The Definite Integral / 245 \\
                 5.4.1 Curves Above the Axis / 246 \\
                 5.4.2 Curves Below the Axis / 247 \\
                 5.4.3 Curves That Cross the Axis / 249 \\
                 5.5 Shortcuts in Computation / 250 \\
                 5.5.1 The Basic Manipulations / 250 \\
                 5.5.2 Order Relationships / 254 \\
                 5.6 The Fundamental Theorem of Calculus / 260 \\
                 5.6.1 Indefinite Integrals / 265 \\
                 5.7 Applications of the Fundamental Theorem / 268 \\
                 Exercise Set 5 / 273 \\
                 6 Applications of Integration / 278 \\
                 / 313 \\
                 6.1 Areas Between Curves / 278 \\
                 6.2 Volume / 285 \\
                 6.3 Solids of Revolution / 288 \\
                 6.4 Generalized Cross Sections / 294 \\
                 6.5 Cylindrical Shells / 298 \\
                 6.5.1 Visualizing Cylinders / 301 \\
                 6.5.2 Cylindrical Decompositions Off the Axis / 303 \\
                 6.6 Work / 305 \\
                 Exercise Set 6 / 309 \\
                 7 Integration Techniques \\
                 7.1 Introduction / 313 \\
                 7.2 Changing Variables / 314 \\
                 7.2.1 Using a Change of Variables to Integrate / 316
                 \\
                 7.2.2 Summary / 316 \\
                 7.2.3 Additional Examples / 317 \\
                 7.2.4 The Effective Use of Change of Variables / 318
                 \\
                 7.2.5 Definite Integrals / 321 \\
                 7.3 Integration by Parts / 326 \\
                 7.3.1 Applications of Integration by Parts / 328 \\
                 7.3.2 Definite Integrals / 331 \\
                 7.3.3 Reduction Formulas / 333 \\
                 7.4 Trigonometric Substitutions / 334 \\
                 7.4.1 Mixtures of Sines and Cosines / 338 \\
                 7.4.2 Identities for Secant and Tangent / 339 \\
                 7.4.3 Integrating Secant / 342 \\
                 7.4.4 Sums and Differences of Angles / 344 \\
                 7.5 Square Roots of Quadratics / 344 \\
                 7.6 Partial Fraction Decompositions / 352 \\
                 7.6.1 Computing a Partial Fraction Decomposition / 352
                 \\
                 7.6.2 Patterns for Partial Fractions / 354 \\
                 7.6.3 Integrals with Quadratics in the Denominator /
                 356 \\
                 7.6.4 Partial Fractions in Action / 357 \\
                 7.7 Numerical Approximations / 361 \\
                 7.7.1 The Trapezoidal Rule / 361 \\
                 7.7.2 Simpson's Rule / 366 \\
                 Exercise Set 7 / 373 \\
                 8 More Applications of Integration / 380 \\
                 8.1 Volumes Through Integration / 380 \\
                 8.1.1 Visualizing Stacks of Disks / 385 \\
                 8.1.2 Variations on Volume / 388 \\
                 8.2 Cylindrical Shells / 396 \\
                 8.3 Arc Length / 398 \\
                 8.4 Surface Area / 405 \\
                 Exercise Set 8 / 409 \\
                 9 Parametric Equations \\
                 9.1 Introduction / 413 \\
                 9.2 Parametric Curves / 413 \\
                 9.2.1 Finding Cartesian Representations / 415 \\
                 9.3 Tangents and Areas Revisited / 420 \\
                 9.3.1 Second Derivatives / 424 \\
                 9.3.2 Areas / 426 \\
                 9.4 Arc Length and Surface Area Revisited / 427 \\
                 9.4.1 Arc Length / 428 \\
                 9.4.2 Surface Area / 429 \\
                 9.5 Polar Coordinates / 430 \\
                 9.5.1 Curve Sketching in Polar Coordinates / 431 \\
                 9.5.2 Tangent Lines and Polar Coordinates / 432 \\
                 9.6 Areas in Polar Coordinates / 435 \\
                 9.7 Arc Lengths in Polar Coordinates / 436 \\
                 Exercise Set 9 / 440 \\
                 10 Sequences and Series / 446 \\
                 10.1 Introduction / 446 \\
                 10.2 Sequences / 446 \\
                 10.2.1 Recurrence Relations / 447 \\
                 10.2.2 Asymptotic Behavior of Sequences / 449 \\
                 10.3 Series / 451 \\
                 10.3.1 Arithmetic on Series / 456 \\
                 10.4 Testing for Convergence and Divergence / 457 \\
                 10.4.1 The Integral Test / 457 \\
                 10.4.2 Comparison Tests / 460 \\
                 10.4.3 Ratio Tests / 463 \\
                 10.4.4 The Root Test / 465 \\
                 10.5 Alternating Series / 465 \\
                 10.6 Power Series / 468 \\
                 10.7 Constructing Power Series / 471 \\
                 10.7.1 Algebraic Manipulations of Power Series / 472
                 \\
                 10.7.2 Constructing Coefficients / 477 \\
                 10.7.3 Taylor Series / 480 \\
                 10.8 Approximations / 481 \\
                 10.8.1 Error Analysis / 483 \\
                 Exercise Set 10 / 488 \\
                 A The Computing Environment / 495 \\
                 A.1 The Student Package / 495 \\
                 A.2 Production Notes / 498",
}

@Book{Devlin:2000:MGH,
  author =       "Keith Devlin",
  title =        "The Math Gene: How Mathematical Thinking Evolved and
                 Why Numbers Are Like Gossip",
  publisher =    pub-BASIC-BOOKS,
  address =      pub-BASIC-BOOKS:adr,
  pages =        "xvii + 328",
  year =         "2000",
  ISBN =         "0-465-01618-9",
  ISBN-13 =      "978-0-465-01618-1",
  LCCN =         "QA141.5 .D49 2000",
  bibdate =      "Tue Jul 10 16:51:20 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Explains how our innate pattern-making abilities allow
                 us to perform mathematical reasoning. Why is math so
                 hard? And why, despite this difficulty, are some people
                 so good at it? If there's some inborn capacity for
                 mathematical thinking --- which there must be,
                 otherwise no one could do it --- why can't we all do it
                 well? Keith Devlin has answers to all these difficult
                 questions, and in giving them shows us how mathematical
                 ability evolved, why it's a part of language ability,
                 and how we can make better use of this innate talent.
                 He also offers a breathtakingly new theory of language
                 development --- that language evolved in two stages,
                 and its main purpose was not communication --- to show
                 that the ability to think mathematically arose out of
                 the same symbol-manipulating ability that was so
                 crucial to the emergence of true language. Why, then,
                 can't we do math as well as we can speak? The answer,
                 says Devlin, is that we can and do --- we just don't
                 recognize when we're using mathematical reasoning.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: A mind for mathematics \\
                 2: In the beginning is number \\
                 3: Everybody counts \\
                 4: What is this thing called mathematics? \\
                 5: Do mathematicians have different brains? \\
                 6: Born to speak \\
                 7: The brain that grew and learned to talk \\
                 8: Out of our minds \\
                 9: Where demons lurk and mathematicians work \\
                 10: Roads not taken",
}

@Book{Devlin:2002:MPS,
  author =       "Keith Devlin",
  title =        "The Millennium Problems: the Seven Greatest Unsolved
                 Mathematical Puzzles of Our Time",
  publisher =    "Basic Books",
  address =      "New York, NY, USA",
  pages =        "x + 237",
  year =         "2002",
  ISBN =         "0-465-01729-0 (hardcover), 0-465-01730-4 (paperback),
                 2-00-353546-8",
  ISBN-13 =      "978-0-465-01729-4 (hardcover), 978-0-465-01730-0
                 (paperback), 978-2-00-353546-8",
  LCCN =         "QA93 .D485 2002",
  bibdate =      "Fri Oct 17 10:10:24 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$26.00",
  abstract =     "In 2000, the Clay Foundation of Cambridge,
                 Massachusetts, announced a historic competition:
                 Whoever could solve any of seven extraordinarily
                 difficult mathematical problems, and have the solution
                 acknowledged as correct by the experts, would receive
                 \$1 million in prize money. There was some precedent
                 for doing this: In 1900 David Hilbert, one of the
                 greatest mathematicians of his day, proposed
                 twenty-three problems, now known as the Hilbert
                 Problems, that set much of the agenda for mathematics
                 in the twentieth century. The Millennium Problems are
                 likely to acquire similar stature, and their solution
                 (or lack of one) will play a strong role in determining
                 the course of mathematics in the current century. They
                 encompass many of the most fascinating areas of pure
                 and applied mathematics, from topology and number
                 theory to particle physics, cryptography, computing and
                 even aircraft design. Keith Devlin, renowned expositor
                 of mathematics, tells here what the seven problems are,
                 how they came about, and what they mean for math and
                 science. These problems are the brass rings held out to
                 today's mathematicians, glittering and just out of
                 reach. In the hands of Devlin, `the Math Guy' from
                 NPR's Weekend Edition, each Millennium Problem becomes
                 a fascinating window onto the deepest and toughest
                 questions in the field. For mathematicians, physicists,
                 engineers, and everyone else with an interest in
                 mathematics' cutting edge, The Millennium Problems is
                 the definitive account of a subject that will have a
                 very long shelf life.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Preface / vii \\
                 0: The gauntlet is thrown / 1 \\
                 1: The music of the primes: the Riemann Hypothesis / 19
                 \\
                 Appendix 1: Euclid's proof that there are infinitely
                 many primes / 53 \\
                 Appendix 2: How do mathematicians work out infinite
                 sums? / 55 \\
                 Appendix 3: How Euler discovered the Zeta Function 2:
                 The fields we are made of: Yang--Mills theory and the
                 Mass Gap Hypothesis / 59 \\
                 Appendix. Group theory: the mathematics of symmetry /
                 97 \\
                 3: When computers fail: The P vs. NP problem / 105 \\
                 4: Making waves: The Navier--Stokes Equations / 131 \\
                 5: The mathematics of smooth behavior: The Poincar{\'e}
                 Conjecture / 157 \\
                 6: Knowing when the equation can't be solved: The Birch
                 and Swinnerton-Dyer Conjecture / 189 \\
                 Appendix: Notation for infinite sums and products / 209
                 \\
                 7: Geometry without pictures: The Hodge Conjecture /
                 211 \\
                 Further Reading / 229 \\
                 Index / 231",
}

@Book{Devlin:2008:UGP,
  author =       "Keith J. Devlin",
  title =        "The unfinished game: {Pascal}, {Fermat}, and the
                 seventeenth-century letter that made the world modern:
                 a tale of how mathematics is really done",
  publisher =    pub-BASIC-BOOKS,
  address =      pub-BASIC-BOOKS:adr,
  pages =        "x + 191",
  year =         "2008",
  ISBN =         "0-465-00910-7",
  ISBN-13 =      "978-0-465-00910-7",
  LCCN =         "QA273 .D455 2008",
  bibdate =      "Tue Nov 11 14:00:48 MST 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 sirsi.library.utoronto.ca:2200/UNICORN;
                 z3950.gbv.de:20011/gvk",
  price =        "US\$24.95",
  series =       "Basic ideas",
  acknowledgement = ack-nhfb,
  subject =      "Probabilities; Pascal, Blaise; Correspondence; Fermat,
                 Pierre de; Mathematicians; France",
  subject-dates = "1623--1662; 1601--1665",
  tableofcontents = "Monday, August 24, 1654 \\
                 A problem worthy of great minds \\
                 On the shoulders of a giant \\
                 A man of slight build \\
                 The great amateur \\
                 Terrible confusions \\
                 Out of the gaming rooms \\
                 Into the everyday world \\
                 The chance of your life \\
                 The measure of our ignorance",
}

@Book{Devlin:2011:MNF,
  author =       "Keith J. Devlin",
  title =        "The man of numbers: {Fibonacci}'s arithmetic
                 revolution",
  publisher =    pub-WALKER,
  address =      pub-WALKER:adr,
  pages =        "viii + 183 + 8",
  year =         "2011",
  ISBN =         "0-8027-7812-7 (hardcover)",
  ISBN-13 =      "978-0-8027-7812-3 (hardcover)",
  LCCN =         "QA29.F5 D48 2011",
  bibdate =      "Sat Jul 16 09:27:27 MDT 2011",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/fibquart.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "Fibonacci, Leonardo; mathematicians; biography;
                 Fibonacci numbers; mathematics in nature",
  subject-dates = "ca. 1170--ca. 1240",
  tableofcontents = "Your days are numbered \\
                 A bridge of numbers \\
                 A child of Pisa \\
                 A mathematical journey \\
                 Sources \\
                 Liber abbaci \\
                 Fame \\
                 The Fibonacci aftermath \\
                 Whose revolution? \\
                 Fibonacci's legacy: in stone, parchment, and rabbits",
}

@Book{Devore:2008:PSE,
  author =       "Jay L. Devore",
  title =        "Probability and Statistics for Engineering and the
                 Sciences",
  publisher =    "Thomson\slash Brooks\slash Cole",
  address =      "Belmont, CA, USA",
  edition =      "Seventh",
  pages =        "xvi + 720",
  year =         "2008",
  ISBN =         "0-495-38217-5",
  ISBN-13 =      "978-0-495-38217-1",
  LCCN =         "QA273 .D46 2008",
  bibdate =      "Fri Sep 6 06:23:00 MDT 2013",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy1104/2006932557-b.html;
                 http://www.loc.gov/catdir/enhancements/fy1104/2006932557-d.html;
                 http://www.loc.gov/catdir/enhancements/fy1212/2006932557-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Probabilities; Mathematical statistics",
  tableofcontents = "1. OVERVIEW AND DESCRIPTIVE STATISTICS \\
                 Populations, Samples, and Processes \\
                 Pictorial and Tabular Methods in Descriptive Statistics
                 \\
                 Measures of Location \\
                 Measures of Variability \\
                 \\
                 2. PROBABILITY \\
                 Sample Spaces and Events \\
                 Axioms, Interpretations, and Properties of Probability
                 \\
                 Counting Techniques \\
                 Conditional Probability \\
                 Independence \\
                 \\
                 3. DISCRETE RANDOM VARIABLES AND PROBABILITY
                 DISTRIBUTIONS \\
                 Random Variables \\
                 Probability Distributions for Discrete Random Variables
                 \\
                 Expected Values of Discrete Random Variables \\
                 The Binomial Probability Distribution \\
                 Hypergeometric and Negative Binomial Distributions \\
                 The Poisson Probability Distribution \\
                 \\
                 4. CONTINUOUS RANDOM VARIABLES AND PROBABILITY
                 DISTRIBUTIONS \\
                 Continuous Random Variables and Probability Density
                 Functions \\
                 Cumulative Distribution Functions and Expected Values
                 \\
                 The Normal Distribution \\
                 The Exponential and Gamma Distribution \\
                 Other Continuous Distributions \\
                 Probability Plots \\
                 \\
                 5. JOINT PROBABILITY DISTRIBUTIONS AND RANDOM SAMPLES
                 \\
                 Jointly Distributed Random Variables \\
                 Expected Values, Covariance, and Correlation \\
                 Statistics and Their Distributions \\
                 The Distribution of the Sample Mean \\
                 The Distribution of a Linear Combination \\
                 \\
                 6. POINT ESTIMATION \\
                 Some General Concepts of Point Estimation \\
                 Methods of Point Estimation \\
                 \\
                 7. STATISTICAL INTERVALS BASED ON A SINGLE SAMPLE \\
                 Basic Properties of Confidence Intervals \\
                 Large-Sample Confidence Intervals for a Population Mean
                 and Proportion \\
                 Intervals Based on a Normal Population Distribution \\
                 Confidence Intervals for the Variance and Standard
                 Deviation of a Normal Population \\
                 \\
                 8. TESTS OF HYPOTHESES BASED ON A SINGLE SAMPLE \\
                 Hypothesis and Test Procedures \\
                 Tests About a Population Mean \\
                 Tests Concerning a Population Proportion \\
                 $P$-Values \\
                 Some Comments on Selecting a Test \\
                 \\
                 9. INFERENCES BASED ON TWO SAMPLES \\
                 $z$ Tests and Confidence Intervals for a Difference
                 Between Two Population Means \\
                 The Two-Sample $t$ Test and Confidence Interval \\
                 Analysis of Paired Data \\
                 Inferences Concerning a Difference Between Population
                 Proportions \\
                 Inferences Concerning Two Population Variances \\
                 \\
                 10. THE ANALYSIS OF VARIANCE \\
                 Single-Factor ANOVA \\
                 Multiple Comparisons in ANOVA \\
                 More on Single-Factor ANOVA \\
                 \\
                 11. MULTIFACTOR ANALYSIS OF VARIANCE \\
                 Two-Factor ANOVA with $K_{ij} = 1$ \\
                 Two-Factor ANOVA with $K_{ij} > 1$ \\
                 Three-Factor ANOVA \\
                 $2^p$ Factorial Experiments \\
                 \\
                 12. SIMPLE LINEAR REGRESSION AND CORRELATION \\
                 The Simple Linear Regression Model \\
                 Estimating Model Parameters \\
                 Inferences About the Slope Parameter $\beta_1$ \\
                 Inferences Concerning $\mu_{Y \cdot x^*}$ and the
                 Prediction of Future $Y$ Values \\
                 Correlation \\
                 \\
                 13. NONLINEAR AND MULTIPLE REGRESSION \\
                 Aptness of the Model and Model Checking \\
                 Regression with Transformed Variables \\
                 Polynomial Regression \\
                 Multiple Regression Analysis \\
                 Other Issues in Multiple Regression \\
                 \\
                 14. GOODNESS-OF-FIT TESTS AND CATEGORICAL DATA ANALYSIS
                 \\
                 Goodness-of-Fit Tests When Category Probabilities are
                 Completely Specified \\
                 Goodness of Fit for Composite Hypotheses \\
                 Two-Way Contingency Tables \\
                 \\
                 15. DISTRIBUTION-FREE PROCEDURES \\
                 The Wilcoxon Signed-Rank Test \\
                 The Wilcoxon Rank-Sum Test \\
                 Distribution-Free Confidence Intervals \\
                 Distribution-Free ANOVA \\
                 \\
                 16. QUALITY CONTROL METHODS \\
                 General Comments on Control Charts \\
                 Control Charts fort Process Location \\
                 Control Charts for Process Variation \\
                 Control Charts for Attributes \\
                 CUSUM Procedures \\
                 Acceptance Sampling \\
                 \\
                 APPENDIX TABLES \\
                 Cumulative Binomial Probabilities \\
                 Cumulative Poisson Probabilities \\
                 Standard Normal Curve Areas \\
                 The Incomplete Gamma Function \\
                 Critical Values for $t$ Distributions \\
                 Tolerance Critical Values for Normal Population
                 Distributions \\
                 Critical Values for Chi-Squared Distributions \\
                 $t$ Curve Tail Areas \\
                 Critical Values for $F$ Distributions \\
                 Critical Values for Studentized Range Distributions \\
                 Chi-Squared Curve Tail Areas \\
                 Critical Values for the Ryan--Joiner Test of Normality
                 \\
                 Critical Values for the Wilcoxon Signed-Rank Test \\
                 Critical Values for the Wilcoxon Rank-Sum Test \\
                 Critical Values for the Wilcoxon Signed-Rank Interval
                 \\
                 Critical Values for the Wilcoxon Rank-Sum Interval \\
                 $\beta$ Curves for $t$ Tests \\
                 Answers to Odd-Numbered Exercises \\
                 Index",
}

@Book{DeWolk:2019:ADS,
  author =       "Roland {De Wolk}",
  title =        "{American} disruptor: the scandalous life of {Leland
                 Stanford}",
  publisher =    pub-U-CALIFORNIA-PRESS,
  address =      pub-U-CALIFORNIA-PRESS:adr,
  pages =        "xvii + 299 + 23",
  year =         "2019",
  DOI =          "https://doi.org/10.1525/9780520973565",
  ISBN =         "0-520-30547-7 (hardcover), 0-520-97356-9 (e-book)",
  ISBN-13 =      "978-0-520-30547-2 (hardcover), 978-0-520-97356-5
                 (e-book)",
  LCCN =         "E664.S78 D4 2019",
  bibdate =      "Tue May 11 12:51:36 MDT 2021",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "The life of Leland Stanford reads like a tall tale of
                 the Old West. Born in a country tavern in upstate New
                 York, Stanford followed the Gold Rush to California,
                 became a successful businessman, and invested in
                 railroads. He then made headway into politics, becoming
                 governor of California and later a US senator. As
                 president of the Central Pacific Railroad, Stanford
                 brought the locomotive Jupiter to preside over the
                 completion of the first transcontinental railroad,
                 which led contemporaries to liken him to the namesake
                 Roman god. He then founded one of the most prestigious
                 universities in the world. Stanford lived large and
                 bold, amassing an astonishing fortune, only to die on
                 the brink of bankruptcy. In American Disruptor, Roland
                 De Wolk balances the accomplishments of this
                 quintessential self-made American man with the darker
                 aspects of his life. He shows how Stanford used high
                 public office to steal taxpayer money, only to squander
                 it on mansions, racehorses, jewels, and vast
                 landholdings. Even the eponymous university in Silicon
                 Valley that bears his name, created from the largest
                 private university endowment of all time, was born of
                 tragedy, a memorial to Stanford's fifteen-year-old son
                 who died from typhoid fever. Following his death, his
                 wife struggled to keep the fledgling university afloat,
                 only to be murdered under mysterious circumstances.
                 Although deeply conservative in belief and style,
                 Leland Stanford's life was one of almost unparalleled
                 risk, failure, and reward. Richly detailed and deeply
                 researched, American Disruptor helps restore his
                 rightful place as an architect of modern America.",
  acknowledgement = ack-nhfb,
  author-dates = "1953--",
  subject =      "Stanford, Leland; Businesspeople; California;
                 Biography; Governors; Legislators; United States",
  subject-dates = "1824--1893",
  tableofcontents = "Acknowledgments \\
                 Prologue: Fell Redemption \\
                 1. Start-Up \\
                 2. Everything Ventured \\
                 3. Crossing \\
                 4. The Gold under the Mountain \\
                 5. Ditching and Hitching \\
                 6. ``The Road Must Be Built'' \\
                 7. ``Egyptian Kings and Dynasties Shall Be Forgotten''
                 \\
                 8. Dungeons and Depredations \\
                 9. Living Up to the Landscape \\
                 10. Command and Control \\
                 11. ``The Machine of Steam on the Road of Iron'' \\
                 12. Unmasked \\
                 13. Gone Dark \\
                 14. Ingeniously Contrived Devices \\
                 15. Deposed \\
                 16. The Fundamental Standard \\
                 17. Sex and Socialism \\
                 18. ``God Forgive Me My Sins. Am I Prepared to Meet My
                 Dear Ones?'' \\
                 Requiem: American Disruptor \\
                 Notes \\
                 Bibliographical Note \\
                 Bibliography \\
                 Index \\
                 About the Author",
}

@Book{Diamond:2008:HDS,
  author =       "Harold G. Diamond and H. (Heini) Halberstam and
                 William F. Galway",
  title =        "A higher-dimensional sieve method: with procedures for
                 computing sieve functions",
  volume =       "177",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xxi + 266",
  year =         "2008",
  ISBN =         "0-521-89487-5 (hardcover)",
  ISBN-13 =      "978-0-521-89487-6 (hardcover)",
  LCCN =         "QA246 .D53 2008",
  bibdate =      "Sat Apr 23 09:33:38 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  note =         "The Mathematica package of sieve-related functions
                 described in Appendix 1, as well as a list of comments
                 and corrigenda, will be maintained at
                 \path=http://www.math.uiuc.edu/SieveTheoryBook=.",
  series =       "Cambridge tracts in mathematics",
  URL =          "http://www.math.uiuc.edu/SieveTheoryBook",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "sieves (mathematics)",
}

@Book{Dickson:2003:SSC,
  author =       "Paul Dickson",
  title =        "{Sputnik}: the Shock of the Century",
  publisher =    "Berkley Books",
  address =      "New York, NY, USA",
  pages =        "310",
  year =         "2003",
  ISBN =         "0-425-18843-4",
  ISBN-13 =      "978-0-425-18843-9",
  LCCN =         "TL796.5.S652.S664; TL796.5.S652.S664 2003",
  bibdate =      "Mon Mar 8 20:01:59 MST 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 library.mit.edu:9909/mit01",
  acknowledgement = ack-nhfb,
  remark =       "Originally published: New York: Walker Pub., 2001.",
  subject =      "Sputnik satellites; 20th Century history; artificial
                 satellites, Russian; political aspects; astronautics
                 and state; United States; public opinion; politics and
                 government",
  tableofcontents = "Introduction \\1: Sputnik night \\
                 2: Gravity fighters \\
                 3: Vengeance rocket \\
                 4: An open sky \\
                 5: The birth of Sputnik \\
                 6: Red Monday \\
                 7: Dog days \\
                 8: American birds \\
                 9: Ike scores \\
                 10: Sputnik's legacy \\
                 Epilogue \\
                 Appendix: Sputnik's long, lexical orbit",
}

@Article{Dijkstra:goto-harmful,
  author =       "Edsger Wybe Dijkstra",
  title =        "Go to statement considered harmful",
  journal =      j-CACM,
  volume =       "11",
  number =       "3",
  pages =        "147--148",
  month =        mar,
  year =         "1968",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "This paper inspired scores of others, published mainly
                 in SIGPLAN Notices up to the mid-1980s. The best-known
                 is \cite{Knuth:goto}.",
  acknowledgement = ack-nhfb,
}

@Book{Diller:1993:LLL,
  author =       "Antoni Diller",
  title =        "{\LaTeX} Line by Line: Tips and Techniques for
                 Document Processing",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xiii + 291",
  year =         "1993",
  ISBN =         "0-471-93471-2 (softcover)",
  ISBN-13 =      "978-0-471-93471-4 (softcover)",
  LCCN =         "Z253.4.L38 D55 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook1.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  note =         "Optionally accompanied by disk with examples, ISBN
                 0-471-93797-5.",
  price =        "US\$29.95",
  series =       "Wiley Professional Computing",
  acknowledgement = ack-bnb,
  tableofcontents = "1: Why use it? \\
                 2: Getting Started and Basic Principles \\
                 3: Fancy Prose (and Poetry) \\
                 4: Displaying Information \\
                 5: Bibliographies and Indexes \\
                 6: Formatting Articles, Reports, Books and Letters \\
                 7: Basic Mathematical Formatting \\
                 8: Further Ideas in Mathematical Formatting \\
                 9: Examples of Mathematical Formatting \\
                 10: Pictures \\
                 11: Two-column Output",
}

@Book{Dodd:1997:ASG,
  editor =       "Janet S. Dodd and Marvin Coyner and Madeleine Jacobs
                 and Barbara Friedman Polansky and K. Barbara Schowen
                 and David Weisgerber and Larry James Winn",
  title =        "The {ACS} Style Guide: a Manual for Authors and
                 Editors",
  publisher =    pub-ACS,
  address =      pub-ACS:adr,
  edition =      "Second",
  pages =        "xi + 460",
  year =         "1997",
  ISBN =         "0-8412-3461-2 (hardcover), 0-8412-3462-0 (paperback)",
  ISBN-13 =      "978-0-8412-3461-1 (hardcover), 978-0-8412-3462-8
                 (paperback)",
  LCCN =         "QD8.5.A25 1997",
  bibdate =      "Sat Dec 24 15:01:30 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$27.50",
  acknowledgement = ack-nhfb,
  DEWEY =        "808/.06654 21",
  idnumber =     "510",
  keywords =     "Chemical literature --- Authorship --- Handbooks,,
                 manuals, etc, English language --- Style --- Handbooks,
                 manuals,, etc, Authorship --- Style manuals",
  tableofcontents = "Writing a scientific paper \\
                 Communicating in other formats: posters, letters to the
                 editor, and press releases \\
                 Grammar, punctuation, and spelling \\
                 Editorial style \\
                 Numbers, mathematics, and units of measure \\
                 References \\
                 Names and numbers for chemical compounds \\
                 Conventions in chemistry \\
                 Illustrations and tables \\
                 Peer review \\
                 Copyright and permissions \\
                 Making effective oral presentations \\
                 ACS publications \\
                 ACS divisions \\
                 Ethical guidelines to publication of chemical research
                 \\
                 The chemist's code of conduct \\
                 Proofreader's marks",
}

@Book{Dollhoff:16B79,
  author =       "Terry Dollhoff",
  title =        "16-Bit Microprocessor Architecture",
  publisher =    pub-RESTON,
  address =      pub-RESTON:adr,
  pages =        "xii + 471",
  year =         "1979",
  ISBN =         "0-8359-7001-9",
  ISBN-13 =      "978-0-8359-7001-3",
  LCCN =         "QA76.5 .D65 1979",
  bibdate =      "Tue Dec 14 22:47:30 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Dolnick:2011:CUI,
  author =       "Edward Dolnick",
  title =        "The Clockwork Universe: {Isaac Newton}, the {Royal
                 Society}, and the Birth of the Modern World",
  publisher =    pub-HARPERCOLLINS,
  address =      pub-HARPERCOLLINS:adr,
  pages =        "xviii + 378",
  year =         "2011",
  ISBN =         "0-06-171951-X",
  ISBN-13 =      "978-0-06-171951-6",
  LCCN =         "Q127.E8 D65 2011",
  bibdate =      "Mon Jun 13 16:38:27 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Science; Europe; History; 17th century; Newton, Isaac;
                 Sir; Religion and science",
  subject-dates = "1642--1727",
  tableofcontents = "London, 1660 \\
                 Satan's claws \\
                 The end of the world \\
                 ``When spotted death ran arm'd through every street''
                 \\
                 Melancholy streets \\
                 Fire \\
                 God at His drawing table \\
                 The idea that unlocked the world \\
                 Euclid and unicorns \\
                 The boys' club \\
                 To the barricades! \\
                 Dogs and rascals \\
                 A dose of poison \\
                 Of mites and men \\
                 A play without an audience \\
                 All in pieces \\
                 Never seen until this moment \\
                 Flies as big as a lamb \\
                 From earthworms to angels \\
                 The parade of the horribles \\
                 ``Shuddering before the beautiful'' \\
                 Patterns made with ideas \\
                 God's strange cryptography \\
                 The secret plan \\
                 Tears of joy \\
                 Walrus with a golden nose \\
                 Cracking the cosmic safe \\
                 The view from the crow's nest \\
                 Sputnik in orbit, 1687 \\
                 Hidden in plain sight \\
                 Two rocks and a rope \\
                 A fly on the wall \\
                 ``Euclid alone has looked on beauty bare'' \\
                 Here be monsters! \\
                 Barricaded against the beast \\
                 Out of the whirlpool \\
                 All men are created equal \\
                 The miracle years \\
                 All mystery banished \\
                 Talking dogs and unsuspected powers \\
                 The world in close-up \\
                 When the cable snaps \\
                 The best of all possible feuds \\
                 Battle's end \\
                 The apple and the moon \\
                 A visit to Cambridge \\
                 Newton bears down \\
                 Trouble with Mr. Hooke \\
                 The system of the world \\
                 Only three people \\
                 Just crazy enough \\
                 In search of God \\
                 Conclusion",
}

@Book{Dongarra:1979:LUG,
  author =       "J. J. Dongarra and J. R. Bunch and C. B. Moler and G.
                 W. Stewart",
  title =        "{LINPACK} Users' Guide",
  publisher =    pub-SIAM,
  address =      pub-SIAM:adr,
  pages =        "320",
  year =         "1979",
  DOI =          "https://doi.org/10.1137/1.9781611971811",
  ISBN =         "0-89871-172-X (paperback)",
  ISBN-13 =      "978-0-89871-172-1 (paperback)",
  LCCN =         "QA76.73 .L22 L5 1979; QA184 .L56 1982; QA214 .L56
                 1979",
  bibdate =      "Mon Dec 13 15:18:20 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/d/dongarra-jack-j.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/m/moler-cleve-b.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/s/stewart-gilbert-w.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/cordic.bib;
                 https://www.math.utah.edu/pub/tex/bib/gnu.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "The authors of this carefully structured guide are the
                 principal developers of LINPACK, a unique package of
                 Fortran subroutines for analyzing and solving various
                 systems of simultaneous linear algebraic equations and
                 linear least squares problems. This guide supports both
                 the casual user of LINPACK who simply requires a
                 library subroutine, and the specialist who wishes to
                 modify or extend the code to handle special problems.
                 It is also recommended for classroom work.",
  acknowledgement = ack-nhfb,
  GWS-number =   "B2",
  keywords =     "book, Cholesky decomposition, cond, downd, linpack,
                 lud, lud, math, nla, qrd, qrd, soft, software, survey,
                 svd, svd, upd, updating",
  subject =      "LINPACK (Computer system); Equations, Simultaneous;
                 Data processing; Matrices; Data processing; LINPACK
                 (Computer system); LINPACK (Syst{\`e}me d'ordinateur);
                 {\'E}quations simultan{\'e}es; Informatique",
  tableofcontents = "General matrices \\
                 Band matrices \\
                 Positive definite matrices \\
                 Positive definite band matrices \\
                 Symmetric indefinite matrices \\
                 Triangular matrices \\
                 Tridiagonal matrices \\
                 The Cholesky decomposition \\
                 The $QR$ decomposition \\
                 Updating $QR$ and Cholesky decompositions \\
                 The singular value decomposition \\
                 References \\
                 Basic linear algebra subprograms \\
                 Timing data \\
                 Program listings \\
                 BLA listings",
  xxauthor =     "J. J. Dongarra and C. B. Moler and J. R. Bunch and G.
                 W. Stewart",
}

@Book{Dongarra:1991:SLS,
  author =       "Jack J. Dongarra and Iain S. Duff and Danny C.
                 Sorensen and Henk A. {van der Vorst}",
  title =        "Solving Linear Systems on Vector and Shared Memory
                 Computers",
  publisher =    pub-SIAM,
  address =      pub-SIAM:adr,
  pages =        "x + 256",
  year =         "1991",
  ISBN =         "0-89871-270-X",
  ISBN-13 =      "978-0-89871-270-4",
  LCCN =         "QA184 .S65 1991",
  bibdate =      "Mon Oct 26 07:30:53 1998",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/d/dongarra-jack-j.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/d/duff-iain-s.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/v/vandervorst-henk-a.bib;
                 https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/numana1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook2.bib;
                 MathSciNet database",
  acknowledgement = ack-nhfb,
  tableofcontents = "Introduction / 1 \\
                 1 Vector and Parallel Processing / 3 \\
                 1.1 Traditional Computers and Their Limitations / 3 \\
                 1.2 Parallelism within a Single Processor / 4 \\
                 1.2.1 Multiple Functional Units / 4 \\
                 1.2.2 Pipelining / 4 \\
                 1.2.3 Overlapping / 6 \\
                 1.2.4 RISC / 7 \\
                 1.2.5 VLIW / 8 \\
                 1.2.6 Vector Instructions / 8 \\
                 1.2.7 Chaining / 9 \\
                 1.2.8 Memory-to-Memory and Register-to-Register
                 Organizations / 10 \\
                 1.2.9 Register Set / 10 \\
                 1.2.10 Stripmining / 11 \\
                 1.2.11 Reconfigurable Vector Registers / 11 \\
                 1.2.12 Memory Organization / 12 \\
                 1.3 Data Organization / 14 \\
                 1.3.1 Main Memory / 14 \\
                 1.3.2 Cache / 16 \\
                 1.3.3 Local Memory / 18 \\
                 1.4 Memory Management / 18 \\
                 1.5 Parallelism through Multiple Pipes or Multiple
                 Processors / 21 \\
                 1.6 Interconnection Topology / 22 \\
                 1.6.1 Crossbar Switch / 23 \\
                 1.6.2 Timeshared Bus / 24 \\
                 1.6.3 Ring Connection / 25 \\
                 1.6.4 Mesh Connection / 25 \\
                 1.6.5 Hypercube / 26 \\
                 1.6.6 Multistaged Network / 27 \\
                 1.7 Programming Techniques / 29 \\
                 2 Overview of Current High-Performance Computers / 33
                 \\
                 2.1 Supercomputers / 33 \\
                 2.2 Mini-Supercomputers / 36 \\
                 2.3 Vector Mainframes / 37 \\
                 2.4 Novel Parallel Processors / 37 \\
                 3 Implementation Details and Overhead / 43 \\
                 3.1 Parallel Decomposition and Data Dependency Graphs /
                 43 \\
                 3.2 Synchronization / 46 \\
                 3.3 Load Balancing / 48 \\
                 3.4 Recurrence / 49 \\
                 3.5 Indirect Addressing / 51 \\
                 4 Performance: Analysis, Modeling, and Measurements /
                 53 \\
                 4.1 Amdahl's Law / 54 \\
                 4.1.1 Simple Case of Amdahl's Law / 54 \\
                 4.1.2 General Form of Amdahl's Law / 55 \\
                 4.2 Vector Speed and Vector Length / 56 \\
                 4.3 Amdahl's Law-Parallel Processing / 57 \\
                 4.3.1 A Simple Model / 60 \\
                 4.3.2 Gustafson's Model / 60 \\
                 4.4 Examples of $(r_\infty, n_{1/2})$-values for
                 Various Computers / 60 \\
                 4.4.1 CRAY-1 and CRAY-2 (one processor) / 62 \\
                 4.4.2 CRAY X-MP (one processor; clock cycle time 8.5
                 nsec) / 63 \\
                 4.4.3 CYBER 205 (2-pipe) and ETA-10P (single processor)
                 / 63 \\
                 4.4.4 IBM 3090/VF (1 processor; clock cycle time 18.5
                 nsec) / 64 \\
                 4.4.5 NEC SX/2 / 65 \\
                 4.4.6 Convex C-1 and Convex C-210 / 66 \\
                 4.4.7 Alliant FX/80 / 66 \\
                 4.4.8 General Observations / 68 \\
                 4.5 LINPACK Benchmark / 68 \\
                 4.5.1 Description of the Benchmark / 69 \\
                 4.5.2 Calls to the BLAS / 69 \\
                 4.5.3 Asymptotic Performance / 75 \\
                 5 Building Blocks in Linear Algebra / 75 \\
                 5.1 Basic Linear Algebra Subprograms / 75 \\
                 5.1.1 Level 1 BLAS / 76 \\
                 5.1.2 Level 2 BLAS / 77 \\
                 5.1.3 Level 3 BLAS / 78 \\
                 5.2 Levels of Parallelism / 81 \\
                 5.2.1 Vector Computers / 81 \\
                 5.2.2 Parallel Processors with Shared Memory / 82 \\
                 5.2.3 Parallel-Vector Computers / 83 \\
                 5.2.4 Clusters of Parallel Vector Processors / 84 \\
                 5.3 Basic Factorizations of Linear Algebra / 84 \\
                 5.3.1 Point Algorithm: Gaussian Elimination with
                 Partial Pivoting / 84 \\
                 5.3.2 Special Matrices / 86 \\
                 5.4 Blocked Algorithms: Matrix-Vector and Matrix-Matrix
                 Versions / 89 \\
                 5.4.1 Right-Looking Algorithm / 90 \\
                 5.4.2 Left-Looking Algorithm / 92 \\
                 5.4.3 Crout Algorithm / 98 \\
                 5.4.4 Typical Performance of Blocked LU Decomposition /
                 94 \\
                 5.4.5 Blocked Symmetric Indefinite Factorization / 95
                 \\
                 5.4.6 Typical Performance of Blocked Symmetric
                 Indefinite Factorization. / 98 \\
                 5.5 Linear Least Squares / 98 \\
                 5.5.1 Householder Method / 99 \\
                 5.5.2 Blocked Householder Method / 100 \\
                 5.5.3 Typical Performance of the Blocked Householder
                 Factorization / 101 \\
                 5.6 Organization of the Modules / 102 \\
                 5.6.1 Matrix--Vector Product / 102 \\
                 5.6.2 Matrix--Matrix Product / 103 \\
                 5.6.3 Typical Performance for Parallel Processing / 104
                 \\
                 5.6.4 Benefits / 105 \\
                 5.7 LAPACK / 106 \\
                 6 Direct Solution of Sparse Linear Systems / 109 \\
                 6.1 Introduction to Direct Methods for Sparse Linear
                 Systems / 111 \\
                 6.1.1 Three Approaches / 111 \\
                 6.1.2 Description of Sparse Data Structure / 112 \\
                 6.1.3 Manipulation of Sparse Data Structure / 114 \\
                 6.2 General Sparse Matrix Methods / 116 \\
                 6.3 Methods for Symmetric Matrices and Band Systems /
                 124 \\
                 6.3.1 The Clique Concept in Gaussian Elimination / 125
                 \\
                 6.3.2 Code Performance and Symmetry / 128 \\
                 6.4 Frontal Methods / 130 \\
                 6.4.1 Organization / 130 \\
                 6.4.2 Vector Performance / 132 \\
                 6.5 Multifrontal Methods / 135 \\
                 6.5.1 Performance on Vector Machines / 139 \\
                 6.5.2 Performance on Parallel Machines / 139 \\
                 6.6 Other Approaches for Exploitation of Parallelism /
                 141 \\
                 6.7 Software / 141 \\
                 6.8 Brief Summary / 142 \\
                 7 Iterative Solution of Sparse Linear Systems / 143 \\
                 7.1 Iterative Methods / 145 \\
                 7.1.1 Conjugate Gradient / 145 \\
                 7.1.2 Least Squares Conjugate Gradients / 148 \\
                 7.1.3 Biconjugate Gradients / 150 \\
                 7.1.4 Conjugate Gradient Squared / 152 \\
                 7.1.5 GMRES and GMRES(m) / 154 \\
                 7.1.6 Adaptive Chebychev / 156 \\
                 7.2 Vector and Parallel Aspects / 158 \\
                 7.2.1 General Remarks / 158 \\
                 7.2.2 Sparse Matrix-Vector Multiplication / 160 \\
                 7.2.3 Performance of the Unpreconditioned Methods / 164
                 \\
                 7.3 Preconditioning / 165 \\
                 7.3.1 General Aspects / 165 \\
                 7.3.2 Efficient Implementations / 168 \\
                 7.3.3 Partial Vectorization / 170 \\
                 7.3.4 Reordering the Unknowns / 172 \\
                 7.3.5 Changing the Order of Computation / 174 \\
                 7.3.6 Some Other Vectorizable Preconditioners / 180 \\
                 7.3.7 Parallel Aspects / 183 \\
                 7.4 Experiences with Parallelism / 186 \\
                 7.4.1 General Remarks / 186 \\
                 7.4.2 Overlapping Local Preconditioners / 186 \\
                 7.4.3 Repeated Twisted Factorization / 188 \\
                 7.4.4 Twisted and Nested Twisted Factorization / 189
                 \\
                 7.4.5 Hyperplane Ordering / 189 \\
                 A Acquiring Mathematical Software / 191 \\
                 B Glossary / 197 \\
                 C Information on Various High-Performance Computers /
                 213 \\
                 D Level 1, 2, and 3 BLAS Quick Reference / 221 \\
                 E Operation Counts for Various BLAS and Decompositions
                 / 227 \\
                 Index / 247",
}

@TechReport{Dongarra:ANL-23-89,
  author =       "J. J. Dongarra",
  title =        "Performance of Various Computers Using Standard Linear
                 Equations Software in a {Fortran} Environment",
  type =         "Technical Memorandum",
  number =       "23",
  institution =  pub-ANL,
  address =      pub-ANL:adr,
  month =        jun # " 4",
  year =         "1989",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Article{Dongarra:netlib,
  author =       "Jack Dongarra and Eric Grosse",
  title =        "Distribution of Mathematical Software via Electronic
                 Mail",
  journal =      j-CACM,
  volume =       "30",
  number =       "5",
  pages =        "403--407",
  month =        may,
  year =         "1987",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@TechReport{Donnelly:bison,
  author =       "Charles Donnelly and Richard M. Stallman",
  title =        "{BISON}: The {YACC}-compatible Parser Generator",
  institution =  pub-FSF,
  address =      pub-FSF:adr,
  year =         "1988",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Bison was largely written by Robert Corbett, and made
                 {\tt yacc}-compatible by Richard Stallman. Electronic
                 mail: \path|rms@prep.ai.mit.edu|. Software also
                 available via ANONYMOUS FTP to \path|prep.ai.mit.edu|.
                 See also \cite{Paxson:flex}.",
  acknowledgement = ack-nhfb,
}

@Book{Donovan:2016:GPL,
  author =       "Alan A. A. Donovan and Brian W. Kernighan",
  title =        "The {Go} Programming Language",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xvii + 380",
  year =         "2016",
  ISBN =         "0-13-419044-0 (paperback)",
  ISBN-13 =      "978-0-13-419044-0 (paperback)",
  LCCN =         "QA76.73.G63 D66 2016",
  bibdate =      "Fri Oct 11 12:07:52 MDT 2019",
  bibsource =    "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",
  series =       "Addison-Wesley professional computing series",
  URL =          "https://www.pearson.com/us/higher-education/program/Donovan-Go-Programming-Language-The/PGM234922.html",
  abstract =     "Go may be our generation's most important new
                 programming language. It is exceptionally expressive,
                 highly efficient in both compilation and execution, and
                 enables the development of extremely reliable and
                 robust programs. It shares the same spirit programmers
                 once found in C: it helps serious professional
                 programmers achieve maximum effect with minimum means.
                 Now, Go shares something else with C, too. Brian
                 Kernighan, who wrote the world's most respected and
                 useful C primer for working programmers, has just done
                 the same for Go. Together with Google Go insider Alan
                 Donovan, Kernighan explains what Go does and doesn't
                 borrow from C; the great ideas it borrows from other
                 modern languages; and how it avoids features that lead
                 to unnecessary complexity and unreliable code.
                 Throughout, their short, carefully-crafted code
                 examples demonstrate today's most effective Go idioms,
                 so you can start using Go effectively right from the
                 beginning, and quickly take advantage of its full
                 power. All code has been extensively reviewed by Go's
                 creators at Google for both completeness and
                 accuracy.",
  acknowledgement = ack-nhfb,
  author-dates = "1976--",
  shorttableofcontents = "1: Tutorial \\
                 2: Program structure \\
                 3: Basic data types \\
                 4: Composite types \\
                 5: Functions \\
                 6: Methods \\
                 7: Interfaces \\
                 8: Goroutines and channels \\
                 9: Concurrency with shared variables \\
                 10: Packages and the Go tool \\
                 11: Testing \\
                 12: Reflection \\
                 13: Low-level programming",
  subject =      "Go (Computer program language); Open source software;
                 Programming; G (Lenguaje de programaci\'on para
                 computadora); Programaci\'on de computadoras",
  tableofcontents = "Preface / xi \\
                 1: Tutorial / 1 \\
                 1.1 Hello, World / 1 \\
                 1.2 Command-Line Arguments / 4 \\
                 1.3 Finding Duplicate Lines / 8 \\
                 1.4 Animated GIFs / 13 \\
                 1.5 Fetching a URL / 15 \\
                 1.6 Fetching URLs Concurrently / 17 \\
                 1.7 A Web Server / 19 \\
                 1.8 Loose Ends / 23 \\
                 2: Program Structure / 27 \\
                 2.1 Names / 27 \\
                 2.2 Declarations / 28 \\
                 2.3 Variables / 30 \\
                 2.4 Assignments / 36 \\
                 2.5 Type Declarations / 39 \\
                 2.6 Packages and Files / 41 \\
                 2.7 Scope / 45 \\
                 3: Basic Data Types / 51 \\
                 3.1 Integers / 51 \\
                 3.2 Floating-Point Numbers / 56 \\
                 3.3 Complex Numbers / 61 \\
                 3.4 Booleans / 63 \\
                 3.5 Strings / 64 \\
                 3.6 Constants / 75 \\
                 4: Composite Types / 81 \\
                 4.1 Arrays / 81 \\
                 4.2 Slices / 84 \\
                 4.3 Maps / 93 \\
                 4.4 Structs / 99 \\
                 4.5 JSON / 107 \\
                 4.6 Text and HTML Templates / 113 \\
                 5: Functions / 119 \\
                 5.1 Function Declarations / 119 \\
                 5.2 Recursion / 121 \\
                 5.3 Multiple Return Values / 124 \\
                 5.4 Errors / 127 \\
                 5.5 Function Values / 132 \\
                 5.6 Anonymous Functions / 135 \\
                 5.7 Variadic Functions / 142 \\
                 5.8 Deferred Function Calls / 143 \\
                 5.9 Panic / 148 \\
                 5.10 Recover / 151 \\
                 6:. Methods / 155 \\
                 6.1 Method Declarations / 155 \\
                 6.2 Methods with a Pointer Receiver / 158 \\
                 6.3 Composing Types by Struct Embedding / 161 \\
                 6.4 Method Values and Expressions / 164 \\
                 6.5 Example: Bit Vector Type / 165 \\
                 6.6 Encapsulation / 168 \\
                 7: Interfaces / 171 \\
                 7.1 Interfaces as Contracts / 171 \\
                 7.2 Interface Types / 174 \\
                 7.3 Interface Satisfaction / 175 \\
                 7.4 Parsing Flags with flag.Value / 179 \\
                 7.5 Interface Values / 181 \\
                 7.6 Sorting with sort.Interface / 186 \\
                 7.7 The http.Handler Interface / 191 \\
                 7.8 The error Interface / 196 \\
                 7.9 Example: Expression Evaluator / 197 \\
                 7.10 Type Assertions / 205 \\
                 7.11 Discriminating Errors with Type Assertions / 206
                 \\
                 7.12 Querying Behaviors with Interface Type Assertions
                 / 208 \\
                 7.13 Type Switches / 210 \\
                 7.14 Example: Token-Based XML Decoding / 213 \\
                 7.15 A Few Words of Advice / 216 \\
                 8: Goroutines and Channels / 217 \\
                 8.1 Goroutines / 217 \\
                 8.2 Example: Concurrent Clock Server / 219 \\
                 8.3 Example: Concu rent Echo Server / 222 \\
                 8.4 Channels / 225 \\
                 8.5 Looping in Parallel / 234 \\
                 8.6 Example: Concurrent Web Crawler / 239 \\
                 8.7 Multiplexing with select / 244 \\
                 8.8 Example: Concurrent Directory Traversal / 247 \\
                 8.9 Cancellation / 251 \\
                 8.10 Example: Chat Server / 253 \\
                 9: Concurrency with Shared Variables / 257 \\
                 9.1 Race Conditions / 257 \\
                 9.2 Mutual Exclusion: sync.Mutex / 262 \\
                 9.3 Read/Write Mutexes: sync.RWMutex / 266 \\
                 9.4 Memory Synchronization / 267 \\
                 9.5 Lazy Initialization: sync.Once / 268 \\
                 9.6 The Race Detector / 271 \\
                 9.7 Example: Concurrent Non-Blocking Cache / 272 \\
                 9.8 Goroutines and Threads / 280 \\
                 10: Packages and the Go Tool / 283 \\
                 10.1 Introduction / 283 \\
                 10.2 Import Paths / 284 \\
                 10.3 The Package Declaration / 285 \\
                 10.4 Import Declarations / 285 \\
                 10.5 Blank Imports / 286 \\
                 10.6 Packages and Naming / 289 \\
                 10.7 The Go Tool / 290 \\
                 11: Testing / 301 \\
                 11.1 The go test Tool / 302 \\
                 11.2 Test Functions / 302 \\
                 11.3 Coverage / 318 \\
                 11.4 Benchmark Functions / 321 \\
                 11.5 Profiling / 323 \\
                 11.6 Example Functions / 326 \\
                 12: Reflection / 329 \\
                 12.1 Why Reflection? / 329 \\
                 12.2 reflect.Type and reflect.Value / 330 \\
                 12.3 Display, a Recursive Value Printer / 333 \\
                 12.4 Example: Encoding S-Expressions / 338 \\
                 12.5 Setting Variables with reflect.Value / 341 \\
                 12.6 Example: Decoding S-Expressions / 344 \\
                 12.7 Accessing Struct Field Tags / 348 \\
                 12.8 Displaying the Methods of a Type / 351 \\
                 12.9 A Word of Caution / 352 \\
                 13: Low-Level Programming / 353 \\
                 13.1 unsafe.Sizeof, Alignof, and Offsetof / 354 \\
                 13.2 unsafe.Pointer / 356 \\
                 13.3 Example: Deep Equivalence / 358 \\
                 13.4 Calling C Code with cgo / 361 \\
                 13.5 Another Word of Caution / 366 \\
                 Index / 367",
}

@Book{Doob:1993:TSS,
  author =       "Michael Doob",
  title =        "{\TeX}: Starting from Square 1",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "x + 114",
  year =         "1993",
  ISBN =         "3-540-56441-1, 0-387-56441-1 (US)",
  ISBN-13 =      "978-3-540-56441-6, 978-0-387-56441-8 (US)",
  LCCN =         "Z253.4.T47 D66 1993",
  bibdate =      "Wed Aug 10 14:00:46 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$25.00",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0902/93026025-d.html",
  acknowledgement = ack-nhfb,
  subject =      "TeX (Computer file); Computerized typesetting;
                 Mathematics printing; Computer programs",
}

@Book{Dorain:1965:SIC,
  author =       "Paul B. Dorain",
  title =        "Symmetry in Inorganic Chemistry",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "vi + 122",
  year =         "1965",
  LCCN =         "QD475.D6",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Dorren:2014:LAE,
  author =       "Gaston Dorren",
  title =        "Lingo: around {Europe} in sixty languages",
  publisher =    "Grove Press",
  address =      "New York, NY, USA",
  pages =        "303",
  year =         "2014",
  ISBN =         "0-8021-2571-9 (softcover)",
  ISBN-13 =      "978-0-8021-2571-2 (softcover)",
  LCCN =         "P380 .D6713 2016",
  bibdate =      "Sat Aug 27 12:16:03 MDT 2022",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "With contributions by Jenny Audring, Frauke Watson,
                 and Alison Edwards.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Language and culture; Europe; Philology; Language and
                 languages; Variation; Langage et culture; Philologie;
                 Variation (Linguistique); philology; Language and
                 culture; Language and languages; Variation; Philology;
                 Europe; Variation; Languages; Langues",
  tableofcontents = "What Europeans speak \\
                 Next of tongue:  Languages and their families \\
                 Past perfect discontinuous \\
                 Languages and their history \\
                 War and peace \\
                 Languages and politics \\
                 Werds, wirds, wurds \ldots{} \\
                 Written and spoken \\
                 Nuts and bolts \\
                 Languages and their vocabulary \\
                 Talking by the book \\
                 Languages and their grammar \\
                 Intensive care \\
                 Languages on the brink and beyond \\
                 Movers and shakers \\
                 Linguists who left their mark \\
                 Warts and all \\
                 Linguistic portrait studies \\
                 Part One: Next of tongue \\
                 Lithuanian \\
                 Finno-Ugric Languages \\
                 Romansh \\
                 French \\
                 Slavic languages \\
                 Balkan languages \\
                 Ossetian \\
                 Part Two: Past perfect discontinuous \\
                 German \\
                 Galician \\
                 Danish \\
                 Channel Island Norman \\
                 Karaim, Ladino and Yiddish \\
                 Icelandic \\
                 Part Three: War and peace \\
                 Norwegian \\
                 Belarus(s)ian \\
                 Luxembourgish \\
                 Scots and Frisian \\
                 Swedish \\
                 Catalan \\
                 Serbo-Croatian \\
                 Part Four: Werds, wirds, wurds \ldots{} \\
                 Czech \\
                 Polish \\
                 Scots Gaelic \\
                 Russian \\
                 Spanish \\
                 lovene \\
                 helta and Anglo-Romani \\
                 Part Five: Nuts and bolts \\
                 Greek \\
                 Portuguese \\
                 Sorbian \\
                 Latvian \\
                 Italian \\
                 Sami \\
                 Breton \\
                 Part Six: Talking by the book \\
                 Dutch \\
                 Romani \\
                 Bulgarian-Slovak \\
                 Welsh \\
                 Basque \\
                 Ukrainian \\
                 Part Seven: Intensive care \\
                 Monegasque \\
                 Irish \\
                 Gagauz \\
                 Dalmatian \\
                 Cornish \\
                 Manx \\
                 Part Eight: Movers and shakers \\
                 Slovak \\
                 Albanian \\
                 Germanic languages \\
                 Esperanto \\
                 Macedonian \\
                 Turkish \\
                 Part Nine: Warts and all \\
                 Finnish \\
                 Faroese \\
                 Sign languages \\
                 Armenian \\
                 Hungarian \\
                 Maltese \\
                 English",
}

@Book{Dorren:2018:BAW,
  author =       "Gaston Dorren",
  title =        "{Babel}: around the world in twenty languages",
  publisher =    "Atlantic Monthly Press",
  address =      "New York, NY, USA",
  pages =        "361",
  year =         "2018",
  ISBN =         "0-8021-2879-3 (hardcover)",
  ISBN-13 =      "978-0-8021-2879-9 (hardcover)",
  LCCN =         "P375 .D67 2018",
  bibdate =      "Sat Dec 22 16:00:19 MST 2018",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "A tour of the world's twenty most-spoken languages
                 explores the history, geography, linguistics, and
                 cultures that have been shaped by languages and their
                 customs. English is the world language, except that
                 most of the world doesn't speak it --- only one in five
                 people does. Gaston Dorren calculates that to speak
                 fluently with half of the world's 7.4 or so billion
                 people in their mother tongues, you would need to know
                 no fewer than twenty languages. He sets out to explore
                 these top twenty world languages, which range from the
                 familiar (French, Spanish) to the surprising (Malay,
                 Javanese, Punjabi). [This book] whisks the reader on a
                 delightful journey to every continent of the world,
                 tracing how these world languages rose to greatness
                 while others fell away, and showing how speakers today
                 handle the foibles of their mother tongues. Whether
                 exploring tongue-tying phonetics, complicated writing
                 scripts, or mind-bending quirks of grammar,
                 \booktitle{Babel} vividly illustrates that mother
                 tongues are like nations: each has its own customs and
                 beliefs. Among many other things, \booktitle{Babel}
                 will teach you why modern Turks can't read books that
                 are a mere seventy-five years old, what it means in
                 practice for Russian and English to be relatives, and
                 how Japanese developed separate `dialects' for men and
                 women. Dorren lets you in on his personal trials and
                 triumphs while studying Vietnamese, debunks ten
                 widespread myths about Chinese characters, and
                 discovers that Swahili became the lingua franca in a
                 part of the world where people routinely speak three or
                 more languages. Witty, fascinating and utterly
                 compelling, \booktitle{Babel} will change the way you
                 look at and listen to the world and how it speaks.",
  acknowledgement = ack-nhfb,
  subject =      "Linguistic geography; Language and languages;
                 Variation; Philology; Language Arts and Disciplines /
                 Linguistics / Historical and Comparative; Variation;
                 Linguistic geography",
  tableofcontents = "Introduction: twenty languages: half the world \\
                 Vietnamese, 85 million: linguistic moutaineering \\
                 Korean, 85 million: sound and sensibility \\
                 Tamil, 90 million: a matter of life and death \\
                 Turkish, 90 million: irreparably improved \\
                 Javanese, 95 million: talking up, talking down \\
                 Persian, 110 million: empire builders and construction
                 workers \\
                 Punjabi, 125 million: the tone is the message \\
                 Japanese, 130 million: linguistic gender apartheid \\
                 Swahili, 135 million: Africa's nonchalant
                 multilingualism \\
                 German, 200 million: an eccentric in central Europe \\
                 French, 250 million: death to la diff{\'e}rence \\
                 Malay, 275 million: the one that won \\
                 Russian, 275 million: on being Indo-European \\
                 Portuguese, 275 million: punching above its weight \\
                 Bengali, 275 million: world leaders in abugidas \\
                 Arabic, 375 million: a concise dictionary of our Arabic
                 \\
                 Hindi-Urdu, 550 million: always something breaking us
                 in two \\
                 Spanish, 575 million: {\AA}Ser or estar? that's the
                 question \\
                 Mandarin, 1.3 billion: the mythical Chinese script \\
                 Japanese revisited: a writing system lacking in system
                 \\
                 English, 1.5 billion: a special lingua franca?",
}

@Book{Dougherty:1987:MSI,
  author =       "Edward R. Dougherty and Charles R. Giardina",
  title =        "Matrix Structured Image Processing",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "x + 258",
  year =         "1987",
  ISBN =         "0-13-565623-0",
  ISBN-13 =      "978-0-13-565623-5",
  LCCN =         "TA1632.D68 1987",
  bibdate =      "Tue Dec 14 22:47:38 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$44.95",
  acknowledgement = ack-nhfb,
}

@Book{Dougherty:1991:SA,
  author =       "Dale Dougherty",
  title =        "sed \& awk",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xxii + 394",
  year =         "1991",
  ISBN =         "0-937175-59-5",
  ISBN-13 =      "978-0-937175-59-0",
  LCCN =         "QA76.76.U84 D69 1991",
  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/9780937175590",
  abstract =     "For people who create and modify text files, sed and
                 awk are power tools for editing. Most of the things
                 that you can do with these programs can be done
                 interactively with a text editor. However, using sed
                 and awk can save many hours of repetitive work in
                 achieving the same result. To master sed and awk you
                 must thoroughly understand UNIX regular expressions,
                 and understand the syntax of sed and awk commands. This
                 handbook treats regular expressions as a foundation for
                 learning about sed and awk and contains a comprehensive
                 treatment of sed and awk syntax. It emphasizes the
                 kinds of practical problems that sed and awk can help
                 users to solve, with many useful example scripts and
                 programs.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1. Power Tools for Editing \\
                 2. Understanding Basic Operations \\
                 3. Understanding Regular Expression Syntax \\
                 4. Writing Sed Scripts \\
                 5. Basic Sed Commands \\
                 6. Advanced Sed Commands \\
                 7. Writing Scripts for Awk \\
                 8. Conditionals, Loops, and Arrays \\
                 9. Functions \\
                 10. The Bottoms Drawer \\
                 11. Full-featured Applications \\
                 12. A Miscellany of Scripts \\
                 Appendices",
}

@Book{Doupnik:1990:MMK,
  author =       "Joe R. Doupnik",
  title =        "The Making of {MS-DOS} Kermit",
  publisher =    pub-DP,
  address =      pub-DP:adr,
  year =         "1990",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Not yet published.",
  acknowledgement = ack-nhfb,
}

@Book{Dowd:1993:HPC,
  author =       "Kevin Dowd",
  title =        "High Performance Computing",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xxv + 371",
  year =         "1993",
  ISBN =         "1-56592-032-5",
  ISBN-13 =      "978-1-56592-032-3",
  LCCN =         "QA76.88 .D6 1993; QA76.9.A73 D68 1993",
  bibdate =      "Mon Jan 3 18:34:37 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fortran3.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/hpfortran.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\$25.95",
  series =       "RISC architectures, optimization and benchmarks; A
                 Nutshell handbook",
  URL =          "http://www.oreilly.com/catalog/9781565920323",
  acknowledgement = ack-nhfb,
  subject =      "Computer architecture; Electronic digital computers;
                 Parallel processing (Electronic computers);
                 Supercomputers",
  tableofcontents = "Preface / xxi \\
                 Who Should Buy This Book? / xxii \\
                 What's in This Book / xxii \\
                 Conventions / xxiv \\
                 Acknowledgments / xxv \\
                 1 Modern Computer Architectures / 1 \\
                 1: What is High Performance Computing? / 3 \\
                 Why Worry About Performance? / 3 \\
                 Measuring Performance / 5 \\
                 The Next Step / 6 \\
                 2: RISC Computers / 9 \\
                 Why CISC? / 10 \\
                 Space and Time / 10 \\
                 Beliefs About Complex Instruction Sets / 11 \\
                 Memory Addressing Modes / 12 \\
                 Microcode / 14 \\
                 Making the Most of a Clock Tick / 17 \\
                 Pipelines / 18 \\
                 Instruction Pipelining / 19 \\
                 Why RISC? / 21 \\
                 Characterizing RISC / 22 \\
                 A Few More Words About Pipelining / 27 \\
                 Memory References / 27 \\
                 Floating Point Pipelines / 28 \\
                 Classes of Processors / 29 \\
                 Superscalar Processors / 30 \\
                 Superpipelined Processors / 32 \\
                 Long Instruction Word (LIW) / 34 \\
                 Other Advanced Features / 35 \\
                 Register Bypass / 36 \\
                 Register Renaming / 36 \\
                 Reducing Branch Penalties / 37 \\
                 Closing Notes / 40 \\
                 3: Memory / 43 \\
                 Memory Technology / 44 \\
                 Random Access Memory / 45 \\
                 Access Time / 47 \\
                 Caches / 48 \\
                 Direct Mapped Cache / 50 \\
                 Fully Associative Cache / 52 \\
                 Set Associative Cache / 52 \\
                 Uses of Cache / 54 \\
                 Virtual Memory / 54 \\
                 Page Tables / 55 \\
                 Translation Lookaside Buffer / 56 \\
                 Page Faults / 57 \\
                 Improving Bandwidth / 59 \\
                 Large Caches / 60 \\
                 Interleaved Memory Systems / 60 \\
                 Software Managed Caches / 64 \\
                 Memory Reference Reordering / 64 \\
                 Multiple References / 66 \\
                 Closing Notes / 67 \\
                 IL Porting and Tuning Software / 91 \\
                 4: What an Optimizing Compiler Does / 69 \\
                 Optimizing Compiler Tour / 70 \\
                 Intermediate Language Representation / 70 \\
                 Basic Blocks / 72 \\
                 Forming a DAG / 74 \\
                 Uses and Definitions / 76 \\
                 Loops / 78 \\
                 Object Code Generation / 80 \\
                 Classical Optimizations / 81 \\
                 Copy Propagation / 81 \\
                 Constant Folding / 82 \\
                 Dead Code Removal / 83 \\
                 Strength Reduction / 84 \\
                 Variable Renaming / 84 \\
                 Common Subexpression Elimination / 85 \\
                 Loop Invariant Code Motion / 86 \\
                 Induction Variable Simplification / 87 \\
                 Register Variable Detection / 88 \\
                 Closing Notes / 88 \\
                 5: Clarity / 93 \\
                 Under Construction / 94 \\
                 Comments / 94 \\
                 Clues in the Landscape / 95 \\
                 Variable Names / 96 \\
                 Variable Types / 98 \\
                 Named Constants / 99 \\
                 INCLUDE Statements / 100 \\
                 Use of COMMON / 101 \\
                 The Shape of Data / 102 \\
                 Closing Notes / 104 \\
                 6: Finding Porting Problems / 105 \\
                 Problems in Argument Lists / 106 \\
                 Aliasing / 106 \\
                 Argument Type Mismatch / 108 \\
                 Storage Issues / 110 \\
                 Equivalenced Storage / 111 \\
                 Memory Reference Alignment Restrictions / 112 \\
                 Closing Notes / 115 \\
                 7: Timing and Profiling / 119 \\
                 Timing / 120 \\
                 Timing a Whole Program / 120 \\
                 Timing a Portion of the Program / 124 \\
                 Using Timing Information / 126 \\
                 Subroutine Profiling / 127 \\
                 prof / 130 \\
                 gprof / 133 \\
                 gprofs Flat Profile / 138 \\
                 Accumulating the Results of Several gprof Runs / 139
                 \\
                 A Few Words About Accuracy / 140 \\
                 Basic Block Profilers / 140 \\
                 tcov / 141 \\
                 prof / 142 \\
                 pixie / 143 \\
                 Closing Notes / 144 \\
                 8: Understanding Parallelism / 147 \\
                 A Few Important Concepts / 148 \\
                 Constants / 148 \\
                 Scalars / 150 \\
                 Vectors and Vector Processing / 150 \\
                 Dependencies / 153 \\
                 Data Dependencies / 154 \\
                 Control Dependencies / 159 \\
                 Ambiguous References / 161 \\
                 Closing Notes / 162 \\
                 9: Eliminating Clutter / 165 \\
                 Subroutine Calls / 166 \\
                 Macros / 168 \\
                 Procedure Inlining / 170 \\
                 Branches / 171 \\
                 Wordy Conditionals / 171 \\
                 Redundant Tests / 172 \\
                 Branches Within Loops / 173 \\
                 Loop Invariant Conditionals / 174 \\
                 Loop Index Dependent Conditionals / 175 \\
                 Independent Loop Conditionals / 176 \\
                 Dependent Loop Conditionals / 177 \\
                 Reductions / 178 \\
                 Conditionals That Transfer Control / 179 \\
                 A Few Words About Branch Probability / 180 \\
                 Other Clutter / 181 \\
                 Data Type Conversions / 181 \\
                 Doing Your Own Common Subexpression Elimination / 182
                 \\
                 Doing Your Own Code Motion / 183 \\
                 Handling Array Elements in Loops / 184 \\
                 Closing Notes / 185 \\
                 10: Loop Optimizations / 187 \\
                 Basic Loop Unrolling / 188 \\
                 Qualifying Candidates for Loop Unrolling / 189 \\
                 Loops with Low Trip Counts / 190 \\
                 Fat Loops / 191 \\
                 Loops Containing Procedure Calls / 191 \\
                 Loops with Branches in Them / 193 \\
                 Recursive Loops / 194 \\
                 Negatives of Loop Unrolling / 195 \\
                 Unrolling by the Wrong Factor / 196 \\
                 Register Thrashing / 196 \\
                 Instruction Cache Miss / 197 \\
                 Other Hardware Delays / 197 \\
                 Outer Loop Unrolling / 197 \\
                 Outer Loop Unrolling to Expose Computations / 199 \\
                 Associative Transformations / 200 \\
                 Reductions / 202 \\
                 Dot Products and daxpys / 204 \\
                 Matrix Multiplication / 206 \\
                 Loop Interchange / 208 \\
                 Loop Interchange to Move Computations to the Center /
                 208 \\
                 Operation Counting / 209 \\
                 Closing Notes / 211 \\
                 11: Memory Reference Optimizations / 213 \\
                 Memory Access Patterns / 214 \\
                 Loop Interchange to Ease Memory Access Patterns / 215
                 \\
                 Blocking to Ease Memory Access Patterns / 216 \\
                 Ambiguity in Memory References / 223 \\
                 Ambiguity in Vector Operations / 224 \\
                 Pointer Ambiguity in Numerical C Applications / 225 \\
                 Programs That Require More Memory Than You Have / 227
                 \\
                 Software-Managed, Out-of-Core Solutions / 227 \\
                 Virtual Memory / 228 \\
                 Instruction Cache Ordering / 231 \\
                 Closing Notes / 232 \\
                 12: Language Support for Performance / 235 \\
                 Subroutine Libraries / 235 \\
                 Vectorizing Preprocessors / 237 \\
                 Explicitly Parallel Languages / 243 \\
                 Fortran 90 / 244 \\
                 High Performance Fortran (HPF) / 250 \\
                 Explicitly Parallel Programming Environments / 251 \\
                 Closing Notes / 253 \\
                 1/L Evaluating Performance / 255 \\
                 13: Industry Benchmarks / 257 \\
                 What is a MIP? / 258 \\
                 VAX MIPS / 259 \\
                 Dhrystones / 259 \\
                 Floating Point Benchmarks / 261 \\
                 Linpack / 262 \\
                 Whetstone / 264 \\
                 The SPEC Benchmarks / 265 \\
                 Individual SPEC Benchmarks / 266 \\
                 030.matrix300 Was Deleted / 272 \\
                 Transaction Processing Benchmarks / 272 \\
                 TPC-A / 273 \\
                 TPC-B / 273 \\
                 TPC-C / 273 \\
                 Closing Notes / 273 \\
                 14: Running Your Own Benchmarks / 275 \\
                 Choosing What to Benchmark / 275 \\
                 Benchmark Run Time / 276 \\
                 Benchmark Memory Size / 277 \\
                 Kernels and Sanitized Benchmarks / 277 \\
                 Benchmarking Third Party Codes / 278 \\
                 Types of Benchmarks / 279 \\
                 Single Stream Benchmarks / 280 \\
                 Throughput Benchmarks / 282 \\
                 Interactive Benchmarks / 283 \\
                 Preparing the Code / 285 \\
                 Portability / 285 \\
                 Making a Benchmark Kit / 286 \\
                 Benchmarking Checklist / 287 \\
                 Closing Notes / 288 \\
                 IV. Parallel Computing / 291 \\
                 15: Large Scale Parallel Computing / 293 \\
                 Problem Decomposition / 294 \\
                 Data Decomposition / 295 \\
                 Control Decomposition / 299 \\
                 Distributing Work Fairly / 300 \\
                 Classes of Parallel Architectures / 302 \\
                 Single Instruction, Multiple Data / 303 \\
                 SIMD Architecture / 305 \\
                 Mechanics of Programming a SIMD Machine / 309 \\
                 Multiple Instruction, Multiple Data / 312 \\
                 Distributed Memory MIMD Architecture / 314 \\
                 Programming a Distributed Memory MIMD Machine / 315 \\
                 A Few Words About Data Layout Directives / 319 \\
                 Virtual Shared Memory / 320 \\
                 Closing Notes / 323 \\
                 16: Shared-Memory Multiprocessors / 325 \\
                 Symmetric Multiprocessing / 326 \\
                 Operating System Support for Multiprocessing / 327 \\
                 Multiprocessor Architecture / 329 \\
                 Shared Memory / 330 \\
                 Conservation of Bandwidth / 330 \\
                 Coherency / 332 \\
                 Data Placement / 334 \\
                 Multiprocessor Software Concepts / 334 \\
                 Fork and Join / 335 \\
                 Synchronization with Locks / 337 \\
                 Synchronization with Barriers / 340 \\
                 Automatic Parallelization / 341 \\
                 Loop Splitting / 341 \\
                 Subroutine Calls in Loops / 342 \\
                 Nested Loops / 342 \\
                 Manual Parallelism / 344 \\
                 Closing Notes / 345 \\
                 A: Processor Overview / 347 \\
                 B: How to Tell When Loops Can Be Interchanged / 351 \\
                 C: Obtaining Sample Programs and Problem Set Answers /
                 357 \\
                 FTP / 357 \\
                 FTPMAIL / 358 \\
                 BITFTP / 359 \\
                 UUCP / 359 \\
                 Figures \\
                 2: RISC Computers / 9 \\
                 2-1 Registers, a single common data path, and an adder
                 / 15 \\
                 2-2 A pipeline / 18 \\
                 2-3 Three instructions in flight through one pipeline /
                 20 \\
                 2-4 Variable length instructions make pipelining
                 difficult / 23 \\
                 2-5 Variable length CISC versus fixed length RISC
                 instructions / 23 \\
                 2-6 Processor encounters a branch / 26 \\
                 2-7 The Branch Delay Slot --- ZERO R3 executes either
                 way / 27 \\
                 2-8 Memory references scheduled early to account for
                 pipeline depth / 28 \\
                 2-9 Decomposing a serial stream / 30 \\
                 2-10 RS/ 6000 functional blocks / 31 \\
                 2-11 MIPS R4000 Instruction Pipeline / 33 \\
                 2-12 Intel i860 transition between modes / 35 \\
                 3: Memory / 43 \\
                 3-1 Row--Column memory address / 46 \\
                 3-2 Direct mapping of memory address to RAM / 46 \\
                 3-3 Cache lines can come from different parts of memory
                 / 49 \\
                 3-4 Many memory addresses map to same cache line / 51
                 \\
                 3-5 Two -way set associative cache / 53 \\
                 3-6 Virtual to physical address mapping / 55 \\
                 3-7 Simple memory system / 59 \\
                 3-8 Page mode cache refill / 60 \\
                 3-9 Multi-banked memory system / 62 \\
                 3-10 Cache refill from interleaved memory / 63 \\
                 4: What an Optimizing Compiler Does / 69 \\
                 4-1 Example 4-1 divided into basic blocks / 73 \\
                 4-2 Tuple mapped into a DAG / 74 \\
                 4-3 Basic Block B / 75 \\
                 4-4 DAG for Block B / 75 \\
                 4-5 Revised Basic Block B / 76 \\
                 4-6 Flow graph for data flow analysis / 77 \\
                 4-7 Flow graph with a loop in it / 79 \\
                 5: Clarity / 93 \\
                 5-1 Array C in two -dimensional memory / 103 \\
                 6: Finding Porting Problems / 105 \\
                 6-1 IEEE 754 floating point formats / 109 \\
                 6-2 IBM 370 floating point formats / 110 \\
                 6-3 Equivalence storage relationship on most computers
                 / 111 \\
                 6-4 Misaligned variables / 113 \\
                 7: Timing and Pro.filing / 119 \\
                 7-1 The built-in csh time function / 123 \\
                 7-2 Sharp profile --- dominated by routine 1 / 128 \\
                 7-3 Flat profile --- no routine predominates / 129 \\
                 7-4 Simple call graph / 134 \\
                 7-5 FORTRAN example / 135 \\
                 7-6 Quantization Errors in Profiling / 140 \\
                 8: Understanding Parallelism / 147 \\
                 8-1 Vector Computer / 152 \\
                 8-2 A little section of your program / 159 \\
                 8-3 Expensive operation moved so that it's rarely
                 executed / 160 \\
                 11: Memory Reference Optimizations / 213 \\
                 11-1 Arrays A and B / 217 \\
                 11-2 How array elements are stored / 218 \\
                 11-3 2x2 squares / 219 \\
                 11-4 Picture of unblocked versus blocked references /
                 220 \\
                 11-5 Optimization performance for various sized loops /
                 222 \\
                 11-6 Vector machine memory access / 223 \\
                 12: Language Support for Performance / 235 \\
                 12-1 Linda's Tuple Space Bulletin Board / 252 \\
                 14: Running Your Own Benchmarks / 275 \\
                 14-1 Kernel benchmark / 278 \\
                 14-2 Single stream benchmarks / 280 \\
                 14-3 Computing an overall benchmark score / 281 \\
                 14-4 Wrong way to run a throughput benchmark / 282 \\
                 14-5 Benchmark stone wall / 283 \\
                 14-6 Interactive use benchmark / 284 \\
                 15: Large Scale Parallel Computing / 293 \\
                 15-1 Domain decomposition / 295 \\
                 15-2 Cells with X's have life / 296 \\
                 15-3 One iteration later / 297 \\
                 15-4 Two examples of division of cells between four
                 CPUs / 298 \\
                 15-5 Each processor with a piece of the domain / 300
                 \\
                 15-6 Duplicated data domain / 301 \\
                 15-7 Iterations mapped onto SIMD nodes / 304 \\
                 15-8 Mapping a route through a strictly Cartesian mesh
                 / 306 \\
                 15-9 Four nodes / 307 \\
                 15-10 A 3-cube and a 4-cube / 307 \\
                 15-11 Front-end and SIMD machine / 309 \\
                 15-12 KSR-1 ring of rings architecture / 322 \\
                 16: Shared-Memory Multiprocessors / 325 \\
                 16-1 A typical bus architecture / 329 \\
                 16-2 A $4 \times 4$ crossbar / 330 \\
                 16-3 High cache hit rate reduces main memory traffic /
                 331 \\
                 16-4 Multiple copies of variable A / 332 \\
                 16-5 Fork and join / 335 \\
                 16-6 Integration / 337 \\
                 16-7 Implementation of a spinlock / 339 \\
                 B: How to Tell When Loops Can Be Interchanged / 351 \\
                 B-1 $4 \times 4$ matrix / 352 \\
                 B-2 One iteration complete / 353 \\
                 B-3 All iterations completed / 354 \\
                 B-4 Movement of data in array A / 355 \\
                 Examples \\
                 4: What an Optimizing Compiler Does / 69 \\
                 4-1 Intermediate Language for a Single Loop / 72 \\
                 5: Clarity / 93 \\
                 5-1 Comments, asterisks, and pretty printing / 95 \\
                 5-2 Variable names count / 97 \\
                 5-3 Parameter statements \\
                 5-4 Declarations / 100 \\
                 5-5 Routine using both INCLUDE files / 100 \\
                 5-6 Changing the Shape of an Array / 100 \\
                 / 102 \\
                 6: Finding Porting Problems / 105 \\
                 6-1 Program for creating misaligned references \\
                 6-2 Misaligned reference in C / 114 \\
                 / 115 \\
                 7: Timing and Profiling / 119 \\
                 7-1 FORTRAN program using etime / 125 \\
                 7-2 etime implemented in C / 126 \\
                 7-3 loops.c --- a program for testing profilers / 131
                 \\
                 7-4 Profile of loops.c / 132 \\
                 7-5 A portion of gprof output / 135 \\
                 7-6 gprof flat profile / 138 \\
                 8: Understanding Parallelism / 147 \\
                 8-1 Vector Addition / 150 \\
                 9: Eliminating Clutter / 165 \\
                 9-1 Macro definition and use / 168 \\
                 10: Loop Optimizations / 187 \\
                 10-1 Loop containing a procedure call / 192 \\
                 10-2 Matrix multiply with daxpy inner loop / 206 \\
                 10-3 Matrix multiply with dot product inner loop / 206
                 \\
                 11: Memory Reference Optimizations / 213 \\
                 11-1 Two-dimensional vector sum / 216 \\
                 11-2 Outer and inner loop unrolled / 217 \\
                 B: How to Tell When Loops Can Be Interchanged / 351 \\
                 B-1 Each iteration is independent / 351 \\
                 B-2 Can we interchange these loops? / 352 \\
                 B-3 Legal alternate loop nests / 354 \\
                 B-4 More complicated references / 355 \\
                 B-5 More complicated references / 356 \\
                 Tables \\
                 6: Finding Porting Problems / 105 \\
                 6-1 Preferred Alignment Boundaries on Most Computers /
                 113 \\
                 15: Large Scale Parallel Computing / 293 \\
                 15-1 Worst Case Communication / 308 \\
                 A: Processor Overview / 347 \\
                 A-1 CPU Characteristics / 347 \\
                 A-2 Cache and Branch Architecture / 348 \\
                 A-2 Cache and Branch Architecture (continued) / 349",
}

@Book{Doxiadis:2000:UPG,
  author =       "Apostolos K. Doxiadis",
  title =        "{Uncle Petros} and {Goldbach's Conjecture}",
  publisher =    pub-FABER-FABER,
  address =      pub-FABER-FABER:adr,
  pages =        "209",
  year =         "2000",
  ISBN =         "0-571-20203-9 (paperback), 0-571-29569-X (e-book)",
  ISBN-13 =      "978-0-571-20203-4 (paperback), 978-0-571-29569-2
                 (e-book)",
  LCCN =         "PA5615.O87 T4813 2000b",
  bibdate =      "Mon Oct 1 16:07:44 MDT 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 library.ox.ac.uk:210/ADVANCE",
  acknowledgement = ack-nhfb,
  remark =       "Translated from the Greek. Available in 25+ languages.
                 This book is claimed on one Web site to be the first
                 work of mathematical fiction: the conjecture is real,
                 but the mathematician in the book is not a real person.
                 First published in 1992 in Greek as {\em O Theios
                 Petros kai i Eikasia tou Goldbach}.",
  subject =      "Uncles; Greece; Fiction; Mathematics; Mathematicians",
}

@Book{Dray:2012:GSR,
  author =       "Tevian Dray",
  title =        "The Geometry of {Special Relativity}",
  publisher =    pub-TAYLOR-FRANCIS,
  address =      pub-TAYLOR-FRANCIS:adr,
  pages =        "xvii + 131",
  year =         "2012",
  ISBN =         "1-4665-1047-1",
  ISBN-13 =      "978-1-4665-1047-0",
  LCCN =         "QC173.65 .D73 2012",
  bibdate =      "Fri Oct 26 09:31:57 MDT 2012",
  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 =     "The \booktitle{Geometry of Special Relativity}
                 provides an introduction to special relativity that
                 encourages readers to see beyond the formulas to the
                 deeper geometric structure. The text treats the
                 geometry of hyperbolas as the key to understanding
                 special relativity. This approach replaces the
                 ubiquitous $ \Gamma $ symbol of most standard
                 treatments with the appropriate hyperbolic
                 trigonometric functions. In most cases, this not only
                 simplifies the appearance of the formulas, but also
                 emphasizes their geometric content in such a way as to
                 make them almost obvious. Furthermore, many important
                 relations, including the famous relativistic addition
                 formula for velocities, follow directly from the
                 appropriate trigonometric addition formulas. The book
                 first describes the basic physics of special relativity
                 to set the stage for the geometric treatment that
                 follows. It then reviews properties of ordinary
                 two-dimensional Euclidean space, expressed in terms of
                 the usual circular trigonometric functions, before
                 presenting a similar treatment of two-dimensional
                 Minkowski space, expressed in terms of hyperbolic
                 trigonometric functions. After covering special
                 relativity again from the geometric point of view, the
                 text discusses standard paradoxes, applications to
                 relativistic mechanics, the relativistic unification of
                 electricity and magnetism, and further steps leading to
                 Einstein's general theory of relativity. The book also
                 briefly describes the further steps leading to
                 Einstein's general theory of relativity and then
                 explores applications of hyperbola geometry to
                 non-Euclidean geometry and calculus, including a
                 geometric construction of the derivatives of
                 trigonometric functions and the exponential function.",
  acknowledgement = ack-nhfb,
  remark =       "A reviewer's comment says that this book makes Special
                 Relativity accessible to anyone familiar with
                 trigonometric functions and elementary calculus.",
  subject =      "Special relativity (Physics); Space and time;
                 Mathematical models",
  subject =      "Space and time -- Mathematical models; Science;
                 Physics; Special relativity (Physics); Space and time;
                 Mathematical models; SCIENCE / Physics / Relativity",
  tableofcontents = "Front Cover \\
                 Contents \\
                 List of Figures and Tables \\
                 Preface \\
                 Acknowledgments \\
                 1. Introduction \\
                 2. The Physics of Special Relativity \\
                 3. Circle Geometry \\
                 4. Hyperbola Geometry \\
                 5. The Geometry of Special Relativity \\
                 6. Applications \\
                 7. Problems I \\
                 8. Paradoxes \\
                 9. Relativistic Mechanics \\
                 10. Problems II \\
                 11. Relativistic Electromagnetism \\
                 12. Problems III \\
                 13. Beyond Special Relativity \\
                 14. Hyperbolic Geometry \\
                 15. Calculus \\
                 Bibliography",
}

@TechReport{Dreyer:1946:REM,
  author =       "H.-J. Dreyer and A. Walther",
  title =        "{Der Rechenautomat Ipm. Entwicklung Mathematischer
                 Instrumente in Deutschland 1939 bis 1945}. ({German})
                 [{The} {Ipm} Calculator. {The} development of
                 mathematical instruments in {Germany} 1939--1945]",
  type =         "{Bericht}",
  number =       "A3",
  institution =  "Institut f{\"u}r Praktische Mathematik, Technische
                 Hochschule",
  address =      "Darmstadt, West Germany",
  day =          "19",
  month =        aug,
  year =         "1946",
  bibdate =      "Wed Oct 13 11:20:15 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Reprinted in \cite[\S 3.3]{Randell:1982:ODC}.
                 Translated by Mr. and Mrs. P. Jones",
  acknowledgement = ack-nhfb,
  language =     "German",
}

@Book{Dry:2014:NPS,
  author =       "Sarah Dry",
  title =        "The {Newton} Papers: the Strange and True Odyssey of
                 {Isaac Newton}'s Manuscripts",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  pages =        "xi + 238",
  year =         "2014",
  ISBN =         "0-19-995104-7 (hardcover)",
  ISBN-13 =      "978-0-19-995104-8 (hardcover)",
  LCCN =         "QC16.N7 D79 2014",
  bibdate =      "Thu Mar 5 05:42:19 MST 2015",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/histmath.bib;
                 https://www.math.utah.edu/pub/tex/bib/isis2010.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "When Isaac Newton died at 85 without a will on March
                 20, 1727, he left a mass of disorganized papers ---
                 upwards of 8 million words --- that presented an
                 immediate challenge to his heirs. Most of these
                 writings, on subjects ranging from secret alchemical
                 formulas to impassioned rejections of the Holy Trinity
                 to notes and calculations on his core discoveries in
                 calculus, universal gravitation, and optics, were
                 summarily dismissed by his heirs as ``not fit to be
                 printed.'' Rabidly heretical, alchemically obsessed,
                 and possibly even mad, the Newton presented in these
                 papers threatened to undermine not just his personal
                 reputation but the status of science itself. As a
                 result, the private papers of the world's greatest
                 scientist remained hidden to all but a select few for
                 over two hundred years. In \booktitle{The Newton
                 Papers}, Sarah Dry divulges the story of how this
                 secret archive finally came to light --- and the
                 complex and contradictory man it revealed. Covering a
                 broad swath of history, Dry explores who controlled
                 Newton's legacy, who helped uncover him, and what,
                 finally, we know about him today, nearly three hundred
                 years after his death. \booktitle{The Newton Papers}
                 presents the eclectic group of collectors, scholars,
                 and scientists who were motivated to track down and
                 collect Newton's private thoughts and obsessions, many
                 of whom led extraordinary lives themselves --- from
                 economist John Maynard Keynes to Abraham Yahuda, a
                 friend of Albert Einstein and key figure in the
                 founding of Israel. The 300-year history of the
                 disappearance, dispersal and eventual rediscovery of
                 Newton's papers exposes how Newton has been made, and
                 re-made, at the hands of unique and idiosyncratic
                 individuals, reflecting the changing status of science
                 over the centuries.",
  acknowledgement = ack-nhfb,
  author-dates = "1974--",
  subject =      "Newton, Isaac; Manuscripts; Psychology; Science;
                 History; HISTORY / Europe / Great Britain; SCIENCE /
                 History.",
  subject-dates = "1642--1727",
  tableofcontents = "Acknowledgments / ix \\
                 Prologue: Keynes at the sale / 3 \\
                 The death of Newton / 5 \\
                 The inheritors / 10 \\
                 Petrifying Newton / 22 \\
                 The madness of Newton / 33 \\
                 The meanness of Newton / 45 \\
                 Getting to know the knowers / 59 \\
                 Wrangling with Newton / 80 \\
                 Newton divided / 101 \\
                 English books, American buyers / 112 \\
                 The dealers / 131 \\
                 The Sotheby sale / 142 \\
                 The revealed Newton / 161 \\
                 The Newton industry / 176 \\
                 The search for unity / 199 \\
                 Epilogue: The ultimate value / 204 \\
                 Notes / 213 \\
                 Index / 229",
}

@Book{DuBois:1999:M,
  author =       "Paul DuBois",
  title =        "{MySQL}",
  publisher =    pub-NRP,
  address =      pub-NRP:adr,
  pages =        "xxix + 756",
  year =         "1999",
  ISBN =         "0-7357-0921-1",
  ISBN-13 =      "978-0-7357-0921-8",
  LCCN =         "QA76.73.S67 D83 2000",
  bibdate =      "Thu Mar 23 10:12:26 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$49.99",
  URL =          "http://www.mysql.com/Contrib/;
                 http://www2.newriders.com/cfm/prod_book.cfm?RecordID=584",
  abstract =     "Instead of merely giving you a general overview of
                 MySQL, Paul teaches you how to make the most of its
                 capabilities. Through two sample database applications
                 that run throughout the book, he gives you solutions to
                 problems you're sure to face. He helps you integrate
                 MySQL efficiently with third-party tools, such as PHP
                 and Perl, enabling you to generate dynamic Web pages
                 through database queries. He teaches you to write
                 programs that access MySQL databases, and also provides
                 a comprehensive set of references to column types,
                 operators, functions, SQL syntax, MySQL programming, C
                 API, Perl DBI, and PHP API.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "I: General MySQL Use \\
                 1: Introduction to MySQL and SQL \\
                 2: Working with Data in MySQL \\
                 3: MySQL SQL Syntax and Use \\
                 4: Query Optimization \\
                 II: Using MySQL Programming Interfaces \\
                 5: Introduction to MySQL Programming \\
                 6: MySQL C API \\
                 7: Perl DBI API \\
                 8: PHP API \\
                 III: MySQL Administration \\
                 9: Introduction to MySQL Administration \\
                 10: MySQL Data Directory \\
                 11: General MySQL Administration \\
                 12: Security \\
                 13: Database Maintenance and Repair. A: Obtaining and
                 Installing Software \\
                 B: Column Type Reference \\
                 C: Operator and Function Reference \\
                 D: SQL Syntax Reference \\
                 E: MySQL Program Reference \\
                 F: C API Reference \\
                 G: Perl DBI API Reference \\
                 H: PHP API Reference \\
                 I: Useful Third-Party Tools \\
                 J: Internet Service Providers",
}

@Book{Duckworth:1960:EM,
  author =       "Henry E. Duckworth",
  title =        "Electricity and Magnetism",
  publisher =    pub-HRW,
  address =      pub-HRW:adr,
  pages =        "xv + 424",
  year =         "1960",
  LCCN =         "QC519 .D8",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Duff:1986:DMS,
  author =       "I. S. Duff and A. M. Erisman and J. K. Reid",
  title =        "Direct Methods for Sparse Matrices",
  publisher =    pub-CLARENDON,
  address =      pub-CLARENDON:adr,
  pages =        "xiii + 341",
  year =         "1986",
  ISBN =         "0-19-853408-6 (hardcover), 0-19-853421-3 (paperback)",
  ISBN-13 =      "978-0-19-853408-2 (hardcover), 978-0-19-853421-1
                 (paperback)",
  LCCN =         "QA188 .D841 1986",
  bibdate =      "Tue Dec 14 22:47:43 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/d/duff-iain-s.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$37.50",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "1: Introduction \\
                 2: Sparse matrices: storage schemes and simple
                 Operations \\
                 3: Gaussian elimination for dense matrices: the
                 algebraic problem \\
                 4: Gaussian elimination for dense matrices: numerical
                 considerations \\
                 5: Gaussian elimination for sparse matrices: an
                 introduction \\
                 6: Reduction to block triangular form \\
                 7: Local pivotal strategies for sparse matrices \\
                 8: Ordering sparse matrices to special forms \\
                 9: Implementing Gaussian elimination: ANALYSE with
                 numerical values \\
                 10: Implementing Gaussian elimination with symbolic
                 ANALYSE \\
                 11: Partitioning, matrix modification, and tearing \\
                 12: Other sparsity-oriented issues \\
                 Appendix A: Matrix and vector norms / 281 \\
                 Appendix B: The LINPACK condition number estimate / 285
                 \\
                 Appendix C: Fortran Conventions / 287 \\
                 Appendix D: Pictures of sparse matrices / 289 \\
                 Solutions to selected exercises / 297 \\
                 References / 313 \\
                 Author index / 327 \\
                 Subject index / 331",
  tableofcontents = "1: Introduction \\
                 1.1 Introduction / 1 \\
                 1.2 Graph theory / 2 \\
                 1.3 Example / 4 \\
                 1.4 Advanced Computer architectures / 9 \\
                 1.5 Problem formulation / 11 \\
                 1.6 A sparse matrix test collection / 14 \\
                 2: Sparse matrices: storage schemes and simple
                 Operations \\
                 2.1 Introduction / 19 \\
                 2.2 Sparse vector storage / 19 \\
                 2.3 Inner product of two packed vectors / 20 \\
                 2.4 Adding packed vectors / 21 \\
                 2.5 Use of full-sized arrays / 22 \\
                 2.6 Coordinate scheme for storing sparse matrices / 23
                 \\
                 2.7 Sparse matrix as a collection of sparse vectors /
                 24 \\
                 2.8 Linked lists / 25 \\
                 2.9 Sparse matrix in row-linked list / 28 \\
                 2.10 Generating collections of sparse vectors / 30 \\
                 2.11 Access by rows and columns / 31 \\
                 2.12 Matrix by vector products / 32 \\
                 2.13 Matrix by matrix products / 33 \\
                 2.14 Permutation matrices / 34 \\
                 2.15 Clique (or finite-element) storage / 36 \\
                 2.16 Comparisons between sparse matrix structures / 37
                 \\
                 3: Gaussian elimination for dense matrices: the
                 algebraic problem \\
                 3.1 Introduction / 41 \\
                 3.2 Solution of triangular Systems / 41 \\
                 3.3 Gaussian elimination / 43 \\
                 3.4 Required row interchanges / 45 \\
                 3.5 Relationship with $L U$ factorization / 46 \\
                 3.6 Equivalent factorization methods, including
                 Doolittle and Crout / 49 \\
                 3.7 Computational sequences / 51 \\
                 3.8 Symmetric matrices / 53 \\
                 3.9 Gauss--Jordan elimination / 55 \\
                 3.10 Multiple right-hand sides and inverses / 56 \\
                 3.11 Computational cost / 57 \\
                 3.12 Block factorization / 59 \\
                 4: Gaussian elimination for dense matrices: numerical
                 considerations \\
                 4.1 Introduction / 65 \\
                 4.2 Computer arithmetic error / 66 \\
                 4.3 Algorithm instability / 67 \\
                 4.4 Controlling algorithm stability / 69 \\
                 4.5 Monitoring the stability / 72 \\
                 4.6 Special stability considerations / 76 \\
                 4.7 Solving indefinite symmetric systems / 77 \\
                 4.8 Ill-conditioning: introduction / 78 \\
                 4.9 Ill-conditioning: theoretical discussion / 79 \\
                 4.10 Ill-conditioning: automatic detection / 81 \\
                 4.11 Iterative refinement / 85 \\
                 4.12 Scaling / 86 \\
                 4.13 Prevention of ill-conditioning / 88 \\
                 4.14 Overall error bound / 89 \\
                 5: Gaussian elimination for sparse matrices: an
                 introduction \\
                 5.1 Introduction / 93 \\
                 5.2 Features of a sparse matrix code / 94 \\
                 5.3 Orderings / 96 \\
                 5.4 Numerical stability in sparse computation / 98 \\
                 5.5 Estimating condition numbers in sparse computation
                 / 100 \\
                 5.6 The ANALYSE phase / 101 \\
                 5.7 The FACTORIZE and SOLVE phases / 102 \\
                 5.8 Writing compared with using sparse matrix Software
                 / 103 \\
                 6: Reduction to block triangular form \\
                 6.1 Introduction / 105 \\
                 6.2 Background for finding a transversal / 107 \\
                 6.3 A depth-first search algorithm for transversal
                 extension / 109 \\
                 6.4 Analysis of the depth-first search transversal
                 algorithm / 111 \\
                 6.5 Implementation of the transversal algorithm / 112
                 \\
                 6.6 Symmetric permutations to block triangular form /
                 113 \\
                 6.7 The algorithm of Sargent and Westerberg / 114 \\
                 6.8 Tarjan's algorithm / 117 \\
                 6.9 Implementation of Tarjan's algorithm / 120 \\
                 6.10 Essential uniqueness of the block triangular form
                 / 121 \\
                 6.11 Experience with block triangular forms / 122 \\
                 6.12 Maximum transversals / 124 \\
                 7: Local pivotal strategies for sparse matrices \\
                 7.1 Introduction / 127 \\
                 7.2 The Markowitz criterion / 128 \\
                 7.3 Minimum degree (Tinney scheme 2) / 129 \\
                 7.4 Simpler strategies / 130 \\
                 7.5 Local minimum fill-in / 133 \\
                 7.6 Other local strategies / 135 \\
                 7.7 The effect of tie-breaking on the minimum degree
                 algorithm / 136 \\
                 7.8 Numerical pivoting / 139 \\
                 7.9 Sparsity in the right-hand side and partial
                 Solution / 140 \\
                 7.10 Variability-type ordering / 143 \\
                 7.11 The Symmetric indefinite case / 145 \\
                 7.12 Solution methods based on orthogonalization / 145
                 \\
                 8: Ordering sparse matrices to special forms \\
                 8.1 Introduction / 149 \\
                 8.2 Desirable forms / 149 \\
                 8.3 Band and variable-band matrices / 151 \\
                 8.4 Ordering for small bandwidth / 153 \\
                 8.5 Refined quotient trees / 157 \\
                 8.6 One-way dissection / 161 \\
                 8.7 Nested dissection / 163 \\
                 8.8 The Boeing version of the Hellerman--Rarick
                 algorithm / 168 \\
                 8.9 The Hellerman--Rarick ordering / 172 \\
                 9: Implementing Gaussian elimination: ANALYSE with
                 numerical values \\
                 9.1 Introduction / 177 \\
                 9.2 Markowitz ANALYSE / 178 \\
                 9.3 FACTORIZE / 183 \\
                 9.4 SOLVE / 186 \\
                 9.5 Switching to full form / 188 \\
                 9.6 Loop-free code / 191 \\
                 9.7 Interpretative code / 192 \\
                 9.8 A posteriori ordering for stability / 193 \\
                 9.9 The use of drop tolerances to preserve sparsity /
                 195 \\
                 10: Implementing Gaussian elimination with symbolic
                 ANALYSE 10.1 Introduction / 199 \\
                 10.2 Band methods / 200 \\
                 10.3 Variable-band (profile) methods / 204 \\
                 10.4 Special methods for banded Systems / 205 \\
                 10.5 Frontal methods for finite-element problems / 210
                 \\
                 10.6 Frontal methods for non-element problems / 216 \\
                 10.7 Multifrontal (substructuring) methods for
                 finite-element problems / 218 \\
                 10.8 Multifrontal methods for non-element problems /
                 222 \\
                 10.9 Minimum degree ordering / 226 \\
                 10.10 Generating static data structures for FACTORIZE /
                 229 \\
                 10.11 Numerical FACTORIZE and SOLVE using static data
                 structures / 232 \\
                 10.12 Accommodating numerical pivoting within static
                 data structures / 233 \\
                 10.13 Nested dissection, refined quotient tree, and
                 one-way dissection / 234 \\
                 10.14 Effects of Computer architecture / 234 \\
                 11: Partitioning, matrix modification, and tearing \\
                 11.1 Introduction / 239 \\
                 11.2 Exploiting the partitioned form / 240 \\
                 11.3 Using partitioning to handle low-rank
                 perturbations / 242 \\
                 11.4 The matrix modification formula / 243 \\
                 11.5 Low-rank modifications / 244 \\
                 11.6 Use of the modification formula to solve equations
                 / 245 \\
                 11.7 Perturbations that are full-rank submatrices / 247
                 \\
                 11.8 The equivalence of modification and partitioning /
                 249 \\
                 11.9 Modifications that change the matrix Order / 250
                 \\
                 11.10 Artificial perturbations / 251 \\
                 11.11 Branch tearing / 252 \\
                 11.12 Node tearing / 254 \\
                 11.13 Implementation of node and branch tearing / 255
                 \\
                 11.14 Manual choice of partitions and tear sets / 255
                 \\
                 11.15 Automatic choice of partitions and tear sets /
                 257 \\
                 11.16 Nonlinear tearing / 259 \\
                 11.17 Conclusions / 260 \\
                 12: Other sparsity-oriented issues \\
                 12.1 Introduction / 265 \\
                 12.2 Sparsity in nonlinear computations / 266 \\
                 12.3 Estimating a sparse Jacobian matrix / 267 \\
                 12.4 Updating a sparse Hessian matrix / 269 \\
                 12.5 Approximating a sparse matrix by a
                 positive-definite one / 270 \\
                 12.6 The inverse of a sparse matrix / 271 \\
                 12.7 Computing entries of the inverse of a sparse
                 matrix / 273 \\
                 12.8 Sparsity constrained backward error analysis / 275
                 \\
                 12.9 Assembling large finite-element matrices to band
                 form / 277 \\
                 12.10 Hypermatrices / 278 \\
                 Appendix A: Matrix and vector norms / 281 \\
                 Appendix B: The LINPACK condition number estimate / 285
                 \\
                 Appendix C: Fortran Conventions / 287 \\
                 Appendix D: Pictures of sparse matrices / 289 \\
                 Solutions to selected exercises / 297 \\
                 References / 313 \\
                 Author index / 327 \\
                 Subject index / 331",
}

@Book{Dupre:1995:BW,
  author =       "Lyn Dupr{\'e}",
  title =        "Bugs in Writing",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xxxiii + 649",
  year =         "1995",
  ISBN =         "0-201-60019-6 (paperback)",
  ISBN-13 =      "978-0-201-60019-3 (paperback)",
  LCCN =         "PEI 408.D85 1995",
  bibdate =      "Tue May 12 08:12:28 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$19.95, CDN\$25.95",
  acknowledgement = ack-nhfb,
  DEWEY =        "808/.042 20",
  idnumber =     "524",
  tableofcontents = "1: Required Reading \\
                 2: Passive or Missing Agents \\
                 3: You and Your Reader \\
                 4: So, So That, Such That \\
                 5: Two or More \\
                 6: Only \\
                 7: Redundant Erms \\
                 8: Pronouns \\
                 9: Undefined this \\
                 10: Motivate \\
                 11: Oxymorons \\
                 12: Shall Versus Proved \\
                 13: Everyone, Someone, No one, None \\
                 14: Color \\
                 15: Effort \\
                 16: Which Versus That \\
                 17: Spread-Out Phrases \\
                 18: While \\
                 19: Repeated prepositions \\
                 20: Abbreviations and Acronyms \\
                 21: Verbize \\
                 22: Commas \\
                 23: Number Spelling \\
                 24: Impact \\
                 25: Lists \\
                 26: Like Versus Such as \\
                 27: Either and Both \\
                 28: Hyphens \\
                 29: Full Versus Incomplete Infinities \\
                 30: Titles \\
                 31: Contractions \\
                 32: Per \\
                 33: Number Styles \\
                 34: Quotations \\
                 35: Fuzzy Words \\
                 36: Parentheses \\
                 37: Split Infinitives \\
                 38: Is Due to \\
                 39: Center on \\
                 40: Quotation Marks \\
                 41: Remarks Inserted After That \\
                 42: Picture Captions \\
                 43: Data \\
                 44: Ensure, Assure, Insure \\
                 45: Foreword Versus Forward \\
                 46: Blocks: Theorems, Proofs, Lemmas \\
                 47: Above and Below \\
                 48: En Dashes \\
                 49: As to Whether \\
                 50: Who Versus That \\
                 51: Though \\
                 52: References to Parts \\
                 53: Dates and Times of Day \\
                 54: Reason is Because \\
                 55: With Terms \\
                 56: Equals \\
                 57: Placement of Adverbs \\
                 58: U.S. Versus British Spelling \\
                 59: Placement of Prepositions \\
                 60: Different from \\
                 61: Callouts \\
                 62: Exclamation Point \\
                 63: Deduce Versus Infer \\
                 64: Citations \\
                 65: The Fact that \\
                 66: Cross References \\
                 67: Proposals \\
                 68: Better, Best, Worst \\
                 69: Missing Words \\
                 70: Aggravate \\
                 71: Upon \\
                 72: Whether Versus If \\
                 73: Sections and Heads \\
                 74: Comprise \\
                 75: In Order to \\
                 76: Em Dashes \\
                 77: Eminent, Emanate, Imminent, Immanent \\
                 78: Expected but Nonarriving Agents \\
                 79: Its and It's \\
                 80: Adverbs Versus Adjectives \\
                 81: Persons Versus People \\
                 82: Cap /LC \\
                 83: Feel Versus Think \\
                 84: Parallelism \\
                 85: Points of Ellipsis \\
                 86: Last \\
                 87: Focus On \\
                 88: Latin, Greek, and Other Troublesome Plurals \\
                 89: Around \\
                 90: Nose \\
                 91: Literal and Virtual \\
                 92: Semicolon \\
                 93: Colon \\
                 94: Comparatives \\
                 95: Tables \\
                 96: Tense \\
                 97: Abstracts \\
                 98: Neither Nor \\
                 99: Will Likely Be \\
                 100: Importantly \\
                 101: Since \\
                 102: References \\
                 103: Cannot Can Not \\
                 104: Also \\
                 105: Nonwords \\
                 106: Missing That \\
                 107: All of \\
                 108: Utilize \\
                 109: Dissertations \\
                 110: Issue \\
                 111: Terms for Describing Human-Computer Interaction
                 \\
                 112: So Called \\
                 113: Note that Versus Notice that \\
                 114: A Lot of \\
                 115: Indices Versus Indexes \\
                 116: Solids \\
                 117: Equations \\
                 118: Half \\
                 119: Media \\
                 120: Not Versus Rather than \\
                 121: Visual Aids for Presentations \\
                 122: Plural Acronyms \\
                 123: Style Sheets and Spell Checkers \\
                 124: Maybe Versus May Be \\
                 125: Figures \\
                 126: General-Specific Words \\
                 127: Continuous Versus Continual \\
                 128: Fewer Versus Less \\
                 129: Italic Type \\
                 130: Truncated Words \\
                 131: Percent \\
                 132: Object, Modifier, Activity \\
                 133: Rewords \\
                 134: Further Versus Farther \\
                 135: Pronouns for Recipients \\
                 136: Authorship on Research Articles \\
                 137: Respectively \\
                 138: Possessives \\
                 139: Cliches, Jargon, and Euphemisms \\
                 140: Design Elements \\
                 141: Word Match \\
                 142: Sex Versus Gender \\
                 143: Awhile \\
                 144: Footnotes \\
                 145: Mouth \\
                 146: Boxes \\
                 147: Exercises, Examples, and Questions \\
                 148: Writer's Block",
}

@Book{Dupre:1998:BWG,
  author =       "Lyn Dupr{\'e}",
  title =        "{BUGS} in writing: a guide to debugging your prose",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Revised.",
  pages =        "xxxv + 660",
  year =         "1998",
  ISBN =         "0-201-37921-X",
  ISBN-13 =      "978-0-201-37921-1",
  LCCN =         "PE1408 .D85 1998",
  bibdate =      "Wed Jan 5 10:22:44 MST 2022",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "English language; Rhetoric; Grammar; Report writing",
  tableofcontents = "Read Me: Ear \\
                 1: Passive or Missing Agents \\
                 2: You and Your Reader \\
                 3: So, So That, Such That \\
                 4: Two or More \\
                 5: Only \\
                 6: Redundant Terms \\
                 7: Pronouns \\
                 8: Undefined This \\
                 9: Motivate \\
                 10: Oxymorons \\
                 11: Shall Versus Will \\
                 12: Key Terms \\
                 13: Proven Versus Proved \\
                 14: Everyone, Someone, No One, None \\
                 15: Colon \\
                 16: Effort \\
                 17: Which Versus That \\
                 18: Spread-Out Phrases \\
                 19: While \\
                 20: Repeated Prepositions \\
                 21: Abbreviations and Acronyms \\
                 22: Verbize \\
                 23: Commas \\
                 24: Number Spelling \\
                 25: Impact \\
                 26: Lists \\
                 27: Like Versus Such As \\
                 28: Either and Both \\
                 29: Hyphens \\
                 30: Full Versus Incomplete Infinitives \\
                 31: Titles \\
                 32: Contractions \\
                 33: Per \\
                 34: Number Styles \\
                 35: Quotations \\
                 36: Fuzzy Words \\
                 37: Parentheses \\
                 38: Split Infinitives \\
                 39: Is Due To \\
                 40: Center On \\
                 41: Quotation Marks \\
                 42: Remarks Inserted After That \\
                 43: Figure Captions \\
                 44: Data \\
                 45: Ensure, Assure, Insure \\
                 46: Foreword Versus Forward \\
                 47: Blocks:Theorems, Proofs, Lemmas \\
                 48: Above and Below \\
                 49: En Dashes \\
                 50: As to Whether \\
                 51: Who Versus That \\
                 52: Though \\
                 53: References to Parts \\
                 54: Dates and Times of Day \\
                 55: Reason Is Because \\
                 56: With Terms \\
                 57: Equals \\
                 58: Placement of Adverbs \\
                 59: U.S. Versus British Spelling \\
                 60: Placement of Prepositions \\
                 61: Different From \\
                 62: Callouts \\
                 63: Exclamation Point \\
                 64: Deduce Versus Infer \\
                 65: Citations \\
                 66: The Fact That \\
                 67: Cross-References \\
                 68: Proposals \\
                 69: Better, Best, Worst \ldots{} 291 \\
                 70: Missing Words \\
                 71: Aggravate \\
                 72: Upon \\
                 73: Whether Versus If \\
                 74: Sections and Heads \\
                 75: Comprise \\
                 76: In Order To \\
                 77: Em Dashes \\
                 78: Eminent, Emanate, Imminent, Immanent \\
                 79: Expected but Nonarriving Agents \\
                 80: Its Versus It's \\
                 81: Adverbs Versus Adjectives \\
                 82: Persons Versus People \\
                 83: Cap / lc \\
                 84: Feel Versus Think \\
                 85: Parallelism \\
                 86: Points of Ellipsis \\
                 87: Last \\
                 88: Focus On \\
                 89: Troublesome Plurals \\
                 90: Around \\
                 91: Nose \\
                 92: Literal and Virtual \\
                 93: Semicolon \\
                 94: Code \\
                 95: Comparatives \\
                 96: Tables \\
                 97: Tense \\
                 98: Abstracts \\
                 99: Neither Nor \\
                 100: Will Likely Be \\
                 101: Importantly \\
                 102: Since \\
                 103: References \\
                 104: Cannot Versus Can Not \\
                 105: Also \\
                 106: Nonwords \\
                 107: Missing That \\
                 108: All Of \\
                 109: Utilize \\
                 110: Dissertations \\
                 111: Issue \\
                 112: Terms for Human-Computer Interaction \\
                 113: So Called \\
                 114: Note That Versus Notice That \\
                 115: Affect Versus Effect \\
                 116: Indices Versus Indexes \\
                 117: Solidus \\
                 118: Equations \\
                 119: Half \\
                 120: Media \\
                 121: Not Versus Rather Than \\
                 122: Visual Aids for Presentations \\
                 123: Plural Abbreviations \\
                 124: Style Sheets and Spell Checkers \\
                 125: Maybe Versus May Be \\
                 126: Figures \\
                 127: Gender-Specific Words \\
                 128: Continuous Versus Continual \\
                 129: Fewer Versus Less \\
                 130: Italic Type \\
                 131: Truncated Words \\
                 132: Percent \\
                 133: Object, Modifier, Activity \\
                 134: Rewords \\
                 135: Further Versus Farther \\
                 136: Pronouns for Recipients \\
                 137: Authorship on Research Articles \\
                 138: Respectively \\
                 139: Possessives \\
                 140: Cliches, Jargon, and Euphemisms \\
                 141: Design Elements and Eye \\
                 142: Word Match \\
                 143: Sex Versus Gender \\
                 144: Awhile \\
                 145: Footnotes \\
                 146: Mouth \\
                 147: Boxes \\
                 148: Exercises, Examples, and Questions \\
                 149: Writer's Block",
}

@Book{Durbeck:1988:OHD,
  editor =       "Robert C. Durbeck and Sol Sherr",
  title =        "Output Hardcopy Devices",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "xii + 526",
  year =         "1988",
  ISBN =         "0-12-225040-0",
  ISBN-13 =      "978-0-12-225040-8",
  LCCN =         "TK7887.7 .O981 1988",
  bibdate =      "Tue Dec 14 22:47:46 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See article by Mike Parker on printer fonts, and
                 undesirability of white-writing engines. I have not
                 bought this book.",
  URL =          "http://www.sciencedirect.com/science/book/9780122250408",
  acknowledgement = ack-nhfb,
}

@Book{duSautoy:2003:MPS,
  author =       "Marcus du Sautoy",
  title =        "The music of the primes: searching to solve the
                 greatest mystery in mathematics",
  publisher =    pub-HARPERCOLLINS,
  address =      pub-HARPERCOLLINS:adr,
  pages =        "335",
  year =         "2003",
  ISBN =         "0-06-621070-4",
  ISBN-13 =      "978-0-06-621070-4",
  LCCN =         "QA246 .D8 2003",
  bibdate =      "Mon Aug 11 12:28:44 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$24.95, CAN\$38.95",
  acknowledgement = ack-nhfb,
  keywords =     "Numbers, Prime; Riemann, Bernhard, 1826--1866",
  tableofcontents = "Who wants to be a millionaire? \\
                 The atoms of arithmetic \\
                 Riemann's imaginary mathematical looking-glass \\
                 The Riemann Hypothesis: From random primes to orderly
                 zeros \\
                 The mathematical relay race: Realising Riemann's
                 revolution \\
                 Ramanujan, the mathematical mystic \\
                 Mathematical exodus: From G{\"o}ttingen to Princeton
                 \\
                 Machines of the mind \\
                 The computer age: From the mind to the desktop \\
                 Cracking numbers and codes \\
                 From orderly zeros to quantum chaos \\
                 The missing piece of the jigsaw",
}

@Book{Dushman:1938:EQM,
  author =       "Saul Dushman",
  title =        "The Elements of Quantum Mechanics",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xiii + 452",
  year =         "1938",
  LCCN =         "QC174.1 .D8",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Article{Dvonch:color-pdl,
  author =       "Mary Ann Dvonch and Paul Roetling and Robert Buckley",
  title =        "Color Descriptors in Page Description Languages",
  journal =      j-PROC-SID,
  volume =       "30",
  number =       "2",
  pages =        "177--181",
  year =         "1989",
  bibdate =      "Sun Dec 4 12:30:46 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Dybvig:1987:SPL,
  author =       "R. Kent Dybvig",
  title =        "The {SCHEME} programming language",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "242",
  year =         "1987",
  ISBN =         "0-13-791864-X (paperback)",
  ISBN-13 =      "978-0-13-791864-5 (paperback)",
  LCCN =         "QA76.73.S34 D93 1987",
  bibdate =      "Sat Jan 19 08:19:21 MST 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  subject =      "SCHEME (Computer program language); computer systems",
  tableofcontents = "Preface / ix \\
                 Introduction / 1 \\
                 Getting Started / 11 \\
                 Going Further / 55 \\
                 Procedures and Variable Bindings / 83 \\
                 Control Operations / 93 \\
                 Operations as Objects / 119 \\
                 Input and Output / 169 \\
                 Syntactic Extension / 181 \\
                 Extended Examples / 211 \\
                 Bibliography / 259 \\
                 Answers to Selected Exercises / 261 \\
                 Formal Syntax of Scheme / 277 \\
                 Summary of Forms / 281 \\
                 Index / 289",
}

@Book{Dybvig:1996:SPL,
  author =       "R. Kent Dybvig",
  title =        "The {SCHEME} Programming Language: {ANSI} Scheme",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  edition =      "Second",
  pages =        "xii + 248",
  year =         "1996",
  ISBN =         "0-13-454646-6",
  ISBN-13 =      "978-0-13-454646-9",
  LCCN =         "QA76.73.S34 D93 1996",
  bibdate =      "Thu May 09 14:09:08 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$64.00",
  URL =          "http://www.scheme.com/tspl2d/",
  abstract =     "Scheme is a general purpose programming language
                 descended from Algol and Lisp. Because it is
                 conceptually clean and simple, it is an easy language
                 to learn. At the same time, it is a powerful language,
                 and full mastery of its power requires careful study
                 and practice. Scheme is widely used in computing
                 education and research, as well as for a broad spectrum
                 of industrial applications ranging from graphical user
                 interfaces and language compilers to virtual reality
                 engines, web navigators, and enterprise computing
                 solutions. This revised edition of \booktitle{The
                 Scheme Programming Language} provides an introduction
                 to the language for readers with some programming
                 experience. Beginning with a gentle introduction for
                 novice Scheme programmers, it leads the reader through
                 a series of progressively more difficult examples that
                 introduce each of the major features of the language.
                 Advanced concepts and features are thoroughly covered
                 with examples and exercises appropriate even for more
                 experienced programmers.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "1: Introduction \\
                 Scheme Syntax \\
                 Scheme Naming Conventions \\
                 Typographical and Notational Conventions \\
                 2: \\
                 Getting Started \\
                 Interacting with Scheme \\
                 Simple Expressions \\
                 Evaluating Scheme Expressions \\
                 Variables and Let Expressions \\
                 Lambda Expressions \\
                 Top-Level Definitions \\
                 Conditional Expressions \\
                 Simple Recursion \\
                 Assignment \\
                 3: \\
                 Going Further \\
                 Syntactic Extension \\
                 More Recursion \\
                 Continuations \\
                 Continuation Passing Style \\
                 Internal Definitions \\
                 4: \\
                 Variable Binding \\
                 Variable References \\
                 Lambda \\
                 Local Binding \\
                 Variable Definitions \\
                 Assignment \\
                 5: \\
                 Control Operations \\
                 Constants and Quotation \\
                 Procedure Application \\
                 Sequencing \\
                 Conditionals \\
                 Recursion, Iteration, and Mapping \\
                 Continuations \\
                 Delayed Evaluation \\
                 Multiple \\
                 Values \\
                 Eval \\
                 6: \\
                 Operations on Objects \\
                 Generic Equivalence and Type Predicates \\
                 Lists and Pairs \\
                 Numbers \\
                 Characters \\
                 Strings \\
                 Vectors \\
                 Symbols \\
                 7: \\
                 Input and Output \\
                 Input Operations \\
                 Output Operations \\
                 Loading Programs \\
                 Transcript Files \\
                 8: \\
                 Syntactic Extension \\
                 Keyword Bindings \\
                 Syntax-Rules Transformers \\
                 Syntax-Case Transformers \\
                 Examples \\
                 9: \\
                 Extended Examples \\
                 Matrix and Vector Multiplication \\
                 List Sorting \\
                 A Set Constructor \\
                 Word Frequency Counting \\
                 Scheme Printer \\
                 Formatted Output \\
                 A Meta-Circular Interpreter for Scheme \\
                 Defining Abstract Objects \\
                 Fast Fourier Transform \\
                 A Unification Algorithm \\
                 Multitasking with Engines \\
                 Bibliography \\
                 Formal Syntax of Scheme \\
                 Summary of Forms \\
                 Index",
}

@Book{Dybvig:2003:SPL,
  author =       "R. Kent Dybvig",
  title =        "The {Scheme} programming language",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  edition =      "Third",
  pages =        "xi + 295",
  year =         "2003",
  ISBN =         "0-262-54148-3 (paperback)",
  ISBN-13 =      "978-0-262-54148-0 (paperback)",
  LCCN =         "QA76.73.S34.D93; QA76.73.S34.D93 2003",
  bibdate =      "Mon Mar 20 16:43:23 MST 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 library.mit.edu:9909/mit01",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "Scheme (Computer program language)",
  tableofcontents = "1. Introduction\\
                 2. Getting Started\\
                 3. Going Further\\
                 4. Procedures and Variable Bindings\\
                 5. Control Operations\\
                 6. Operations on Objects\\
                 7. Input and Output\\
                 8. Syntactic Extension\\
                 9. Extended Examples",
}

@Book{Dyer:1965:AAS,
  author =       "John R. (John Robert) Dyer",
  title =        "Applications of Absorption Spectroscopy of Organic
                 Compounds",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "x + 147",
  year =         "1965",
  LCCN =         "QD476 .D9",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Dylla:2020:SJP,
  author =       "H. Frederick Dylla",
  booktitle =    "Scientific Journeys: a Physicist Explores the Culture,
                 History and Personalities of Science",
  title =        "Scientific Journeys: a Physicist Explores the Culture,
                 History and Personalities of Science",
  publisher =    "Springer",
  address =      "Cham, Switzerland",
  pages =        "xxv + 222",
  year =         "2020",
  DOI =          "https://doi.org/10.1007/978-3-030-55800-0",
  ISBN =         "3-030-55799-5 (paperback), 3-030-55800-2 (e-book)",
  ISBN-13 =      "978-3-030-55799-7 (paperback), 978-3-030-55800-0
                 (e-book)",
  LCCN =         "Q125 .D955 2020",
  bibdate =      "Tue May 4 06:37:04 MDT 2021",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/f/feynman-richard-p.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/r/rutherford-ernest.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "This collection of essays traces a scientific journey
                 bookmarked by remarkable mentors and milestones of
                 science. It provides fascinating reading for everyone
                 interested in the history, public appreciation, and
                 value of science, as well as giving first-hand accounts
                 of many key events and prominent figures. The author
                 was one of the ``sputnik kids'' growing up in the US at
                 the start of the space age. He built a working laser
                 just two years after they were first invented, an
                 experience that convinced him to become a physicist.
                 During his 50-year career in physics, many
                 personalities and notable events in science and
                 technology helped to form his view of how science
                 contributes to the modern world, including his
                 conviction that the impact of science can be most
                 effective when introduced within the context of the
                 humanities --- especially history, literature and the
                 arts. From the Foreword by former U.S. Congressman,
                 Rush D. Holt: In this volume, we have the wide-ranging
                 thoughts and observations of Fred Dylla, an
                 accomplished physicist with an engineer's fascination
                 for gadgets, a historian's long perspective, an
                 artist's aesthetic eye, and a teacher's passion for
                 sharing ideas. Throughout his varied career [\ldots{}]
                 his curiosity has been his foremost characteristic and
                 his ability to see the connection between apparently
                 disparate things his greatest skill. [\ldots{}] Here he
                 examines the roots and growth of innovation in examples
                 from Bell Laboratories, Edison Electric Light Company,
                 and cubist painter Georges Braque. He considers the
                 essential place of publishing in science, that epochal
                 intellectual technique for learning how the world
                 works. He shows the human enrichment and practical
                 benefits that derive from wise investments in
                 scientific research, as well as the waste resulting
                 from a failure to embrace appropriate technologies.",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "Introduction \\
                 Part 1: Signposts \\
                 Part 2: Mentors and Milestones \\
                 Part 3: Science Policy Matters \\
                 Part 4: Communicating Science \\
                 Part 5: Art and Science \\
                 Epilogue",
  subject =      "Physics; Science; Social aspects; Technology; History,
                 Modern; Printing; Publishers and publishing; Popular
                 Science in Physics; Societal Aspects of Physics,
                 Outreach and Education; Popular Science in Technology;
                 Modern History; Printing and Publishing; US Politics;
                 History, Modern; Physics; Printing; Publishers and
                 publishing; Social aspects; Technology; United States;
                 Politics and government",
  tableofcontents = "Part I: Signposts \\
                 1: Literature and Legacy Flow Along the Rhine / 3 \\
                 2: Invention and Discovery: Fleming and Edison / 7 \\
                 3: Rutherford's Nuclear World / 11 \\
                 4: Fueling Science for War and Peace / 17 \\
                 5: Shelter Island's Famous Physicists / 21 \\
                 6: Feynman's Scientific Integrity / 25 \\
                 7: Calculating from Memory / 29 \\
                 8: The Electronic Water Cooler / 33 \\
                 9: Lessons from Steve Jobs / 37 \\
                 10: What We Hear from Bose / 41 \\
                 11: The French Connection / 45 \\
                 12: Mr. Fresnel's Gift to the World / 49 \\
                 13: Lighting the Way for Innovation / 53 \\
                 14: China's Science Ambassador / 59 \\
                 15: Bringing Science Back to Vietnam / 63 \\
                 Part II: Mentors and Milestones \\
                 16: Exciting the Imagination: My First Laser / 69 \\
                 17: The Master Teacher / 75 \\
                 18: How Long is the Fuse on Fusion? 83 \\
                 19: Excitement and Disappointment: The Emotions of
                 Science / 89 \\
                 20: Considering Future Energy Options: Extrapolations
                 from a Real Experiment / 93 \\
                 21: My Encounters with the Queen of Carbon / 97 \\
                 22: A Prize Hidden Under a Piece of Tape / 101 \\
                 23: The Big Machine / 105 \\
                 24: The Collider that Couldn't / 111 \\
                 25: One Man Can Make a Difference / 115 \\
                 26: A Bright Light in Virginia / 125 \\
                 27: Gravity's Songs / 133 \\
                 Part III: Science Policy Matters \\
                 28: Innovation in a Young Nation / 143 \\
                 29: Big and Small Science: No Need to Choose / 147 \\
                 30: Reminding All of Us That Basic Research Pays Off /
                 149 \\
                 31: Science and Engineering: Hand-in-Hand / 153 \\
                 32: The Professor is on the Screen / 157 \\
                 33: Go Visit a Science Museum / 161 \\
                 Part IV: Communicating Science \\
                 34: Illuminating Manuscripts / 167 \\
                 35: Science Must Navigate the Gale of Creative
                 Destruction / 171 \\
                 36: Roundtables Help / 175 \\
                 37: Imagine a World Without Editors / 179 \\
                 38: Please Read My Paper / 183 \\
                 39: Getting It Right / 187 \\
                 40: A Vision for Open Scholarship / 191 \\
                 41: The Scientific Journal Marks 350 / 193 \\
                 Part V: Art and Science \\
                 42: Time Exposed for Science / 199 \\
                 43: Science, Art, and Theater / 203 \\
                 44: In and Out of the Plane / 207 \\
                 45 Following the White Line / 211 \\
                 Acknowledgements / 217 \\
                 Epilogue / 221",
}

@Book{Dyson:2010:MCG,
  author =       "Freeman J. Dyson",
  title =        "Many-Colored Glass: Reflections on the Place of Life
                 in the Universe",
  publisher =    "University of Virginia Press",
  address =      "Charlottesville, VA, USA",
  pages =        "xi + 162",
  year =         "2010",
  ISBN =         "0-8139-2973-3",
  ISBN-13 =      "978-0-8139-2973-6",
  LCCN =         "QH501 .D97 2010",
  bibdate =      "Mon Oct 18 16:54:08 MDT 2010",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/f/fermi-enrico.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Page--Barbour Lectures for 2004.",
  acknowledgement = ack-nhfb,
  keywords =     "Fermi Paradox",
  remark =       "Hardback edition 2007. Paperback edition 2010.",
  tableofcontents = "The future of biotechnology \\
                 A debate with Bill Joy \\
                 Heretical thoughts about science and society \\
                 A friendly universe \\
                 Can life go on forever? \\
                 Looking for life \\
                 The varieties of human experience",
}

@Book{Earnshaw:1985:FAC,
  author =       "Rae A. Earnshaw",
  title =        "Fundamental Algorithms for Computer Graphics",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xvi + 1042",
  year =         "1985",
  ISBN =         "0-387-13920-6 (New York), 3-540-13920-6 (Berlin)",
  ISBN-13 =      "978-0-387-13920-3 (New York), 978-3-540-13920-1
                 (Berlin)",
  LCCN =         "QA76.6 .N379 1985",
  bibdate =      "Wed Dec 15 08:55:01 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Line and area algorithms \\
                 Arcs, circles and conics \\
                 Curves and curve drawing \\
                 Character generation and display \\
                 Contouring and surface drawing \\
                 Hardware architectures and algorithms \\
                 Computational geometry and CAD \\
                 Theoretical aspects and models \\
                 Human-computer interface issues",
}

@Book{Earnshaw:1987:WPS,
  editor =       "Rae A. Earnshaw",
  title =        "Workstations and Publication Systems",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "viii + 229",
  year =         "1987",
  ISBN =         "0-387-96527-0, 3-540-96527-0",
  ISBN-13 =      "978-0-387-96527-7, 978-3-540-96527-5",
  LCCN =         "Z286.E43 W67 1987",
  bibdate =      "Fri Jul 22 01:06:23 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$29.50",
  acknowledgement = ack-nhfb,
}

@Article{Eckert:1948:EC,
  author =       "W. J. Eckert",
  title =        "Electrons and computation",
  journal =      j-SCI-MONTHLY,
  volume =       "67",
  number =       "5",
  pages =        "315--323",
  month =        nov,
  year =         "1948",
  CODEN =        "SCMOAA",
  ISSN =         "0096-3771",
  bibdate =      "Wed Oct 13 11:27:40 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Reprinted in \cite[\S 5.3]{Randell:1982:ODC}.",
  acknowledgement = ack-nhfb,
}

@Book{Eckhouse:1979:MSO,
  author =       "Richard H. {Eckhouse, Jr.} and L. Robert Morris",
  title =        "Minicomputer Systems: Organization, Programming, and
                 Applications ({PDP-11})",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  edition =      "Second",
  pages =        "xix + 491",
  year =         "1979",
  ISBN =         "0-13-583914-9",
  ISBN-13 =      "978-0-13-583914-0",
  LCCN =         "QA76.8.P2E26 1979",
  bibdate =      "Fri Aug 07 17:22:02 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Eckstein:2000:US,
  author =       "Robert Eckstein and David Collier-Brown and Peter
                 Kelly",
  title =        "Using {Samba}",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xi + 398",
  year =         "2000",
  ISBN =         "1-56592-449-5",
  ISBN-13 =      "978-1-56592-449-9",
  LCCN =         "QA76.9.C55 E267 2000; QA76.9.C55 E267 2000; TK5105.5
                 .E35 2000",
  bibdate =      "Mon Nov 22 15:57:08 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/linux.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/ora.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  note =         "Includes CD-ROM with complete mirror of Samba site
                 with Samba 2.0.5a, including sources, documentation,
                 binaries, and supplementary tools.",
  price =        "US\$34.95",
  URL =          "http://www.oreilly.com/catalog/9781565924499",
  abstract =     "Samba is cross-platform triumph: it turns a Unix or
                 Linux system into a file and print server for Microsoft
                 Windows network clients. Now you can let users store
                 their files (and even important executables) in a
                 single place for easy sharing and backup, protected by
                 Unix or NT security mechanisms, and still offer such
                 transparent access that PC users don't even realize
                 they're going to another system. The magic behind Samba
                 is that it recognizes and speaks the SMB protocol
                 developed by Microsoft for file and printer sharing on
                 its own systems. The authors present the most common
                 configurations and problems in an easy-to-follow
                 manner, along with instructions for getting the most
                 out of Samba. Whether you're playing on one note or a
                 full three-octave range, this book will give you an
                 efficient and secure server. The CD-ROM included with
                 this book is a complete mirror of the Samba FTP site,
                 including sources, ready-to-install binaries,
                 documentation, and related utilities.",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "1: Learning the Samba / 1 \\
                 2: Installing Samba on a Unix System / 31 \\
                 3: Configuring Windows Clients / 50 \\
                 4: Disk Shares / 82 \\
                 5: Browsing and Advanced Disk Shares / 114 \\
                 6: Users, Security, and Domains / 155 \\
                 7: Printing and Name Resolution / 201 \\
                 8: Additional Samba Information / 230 \\
                 9: Troubleshooting Samba / 250 \\
                 A: Configuring Samba with SSL / 295 \\
                 B: Samba Performance Tuning / 312 \\
                 C: Samba Configuration Option Quick Reference / 329 \\
                 D: Summary of Samba Daemons and Commands / 359 \\
                 E: Downloading Samba with CVS / 378 \\
                 F: Sample Configuration File / 379",
  tableofcontents = "1: Learning the Samba / 1 \\
                 What is Samba? / 2 \\
                 What Can Samba Do For Me? / 3 \\
                 Getting Familiar with a SMB/CIFS Network / 9 \\
                 Microsoft Implementations / 18 \\
                 An Overview of the Samba Distribution / 27 \\
                 How Can I Get Samba? / 28 \\
                 What's New in Samba 2.0? / 28 \\
                 And That's Not All / 30 \\
                 2: Installing Samba on a Unix System / 31 \\
                 Downloading the Samba Distribution / 32 \\
                 Configuring Samba / 34 \\
                 Compiling and Installing Samba / 38 \\
                 A Basic Samba Configuration File / 41 \\
                 Starting the Samba Daemons / 46 \\
                 Testing the Samba Daemons / 49 \\
                 3: Configuring Windows Clients / 50 \\
                 Setting Up Windows 95/98 Computers / 50 \\
                 Setting Up Windows NT 4.0 Computers / 63 \\
                 An Introduction to SMB/CIFS / 74 \\
                 4: Disk Shares / 82 \\
                 Learning the Samba Configuration File / 82 \\
                 Special Sections / 88 \\
                 Configuration File Options / 91 \\
                 Server Configuration / 93 \\
                 Disk Share Configuration / 96 \\
                 Networking Options with Samba / 101 \\
                 Virtual Servers / 106 \\
                 Logging Configuration Options / 108 \\
                 5: Browsing and Advanced Disk Shares / 114 \\
                 Browsing / 114 \\
                 Filesystem Differences / 127 \\
                 File Permissions and Attributes on MS-DOS and Unix /
                 135 \\
                 Name Mangling and Case / 143 \\
                 Locks and Oplocks / 149 \\
                 6: Users, Security, and Domains / 155 \\
                 Users and Groups / 155 \\
                 Controlling Access to Shares / 158 \\
                 Authentication Security / 164 \\
                 Passwords / 171 \\
                 Windows Domains / 184 \\
                 Logon Scripts / 192 \\
                 7: Printing and Name Resolution / 201 \\
                 Sending Print Jobs to Samba / 201 \\
                 Printing to Windows Client Printers / 213 \\
                 Name Resolution with Samba / 224 \\
                 8: Additional Samba Information / 230 \\
                 Supporting Programmers / 230 \\
                 Magic Scripts / 233 \\
                 Internationalization / 234 \\
                 WinPopup Messages / 237 \\
                 Recently Added Options / 238 \\
                 Miscellaneous Options / 240 \\
                 Backups with smbtar / 245 \\
                 9: Troubleshooting Samba / 250 \\
                 Tool Bag / 250 \\
                 Fault Tree / 257 \\
                 Extra Resources / 291 \\
                 A: Configuring Samba with SSL / 295 \\
                 B: Samba Performance Tuning / 312 \\
                 C: Samba Configuration Option Quick Reference / 329 \\
                 D: Summary of Samba Daemons and Commands / 359 \\
                 E: Downloading Samba with CVS / 378 \\
                 F: Sample Configuration File / 379",
}

@Book{Edmonds:2008:HTA,
  author =       "Jeff Edmonds",
  title =        "How to Think About Algorithms",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xiii + 448",
  year =         "2008",
  ISBN =         "0-521-84931-4 (hardcover), 0-521-61410-4 (paperback),
                 0-511-41278-9 (e-book), 0-511-41370-X (e-book)",
  ISBN-13 =      "978-0-521-84931-9 (hardcover), 978-0-521-61410-8
                 (paperback), 978-0-511-41278-3 (e-book),
                 978-0-511-41370-4 (e-book)",
  LCCN =         "QA9.58 .E36 2008",
  bibdate =      "Wed May 14 18:48:48 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0808/2008001238-b.html;
                 http://www.loc.gov/catdir/enhancements/fy0808/2008001238-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0808/2008001238-t.html",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Algorithms; Study and teaching; Loops (Group theory);
                 Invariants; Recursion theory",
  tableofcontents = "Iterative algorithms: measures of progress and loop
                 invariants \\
                 Examples using more-of-the-input loop invariants \\
                 Abstract data types \\
                 Narrowing the search space: binary search \\
                 Iterative sorting algorithms \\
                 Euclid's GCD algorithm \\
                 The loop invariant for lower bounds \\
                 Abstractions, techniques, and theory \\
                 Some simple examples of recursive algorithms \\
                 Recursion on trees \\
                 Recursive images \\
                 Parsing with context-free grammars \\
                 Definition of optimization problems \\
                 Graph search algorithms \\
                 Network flows and linear programming \\
                 Greedy algorithms \\
                 Recursive backtracking \\
                 Dynamic programming algorithms \\
                 Examples of dynamic programs \\
                 Reductions and NP-completeness \\
                 Randomized algorithms \\
                 Existential and universal quantifiers \\
                 Time complexity \\
                 Logarithms and exponentials \\
                 Asymptotic growth \\
                 Adding-made-easy approximations \\
                 Recurrence relations \\
                 A formal proof of correctness",
}

@Book{EFF:1998:CSE,
  author =       "{Electronic Frontier Foundation}",
  title =        "Cracking {DES}: Secrets of Encryption Research,
                 Wiretap Politics \& Chip Design",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "272",
  month =        jul,
  year =         "1998",
  ISBN =         "1-56592-520-3",
  ISBN-13 =      "978-1-56592-520-5",
  LCCN =         "QA76.9.A25 C783",
  bibdate =      "Thu Apr 15 07:49:39 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 http://www.oreilly.com/catalog/crackdes/",
  price =        "US\$29.95",
  URL =          "http://www.eff.org/descracker/;
                 http://www.sunworld.com/swol-07-1998/swol-07-if.html?072098a#2",
  abstract =     "Data Encryption Standard withstood the test of time
                 for twenty years. Cracking DES: Secrets of Encryption
                 Research, Wiretap Politics \& Chip Design shows exactly
                 how it was brought down. Every cryptographer, security
                 designer, and student of cryptography policy should
                 read this book to understand how the world changed as
                 it fell.",
  acknowledgement = ack-nhfb,
}

@Book{EguiaMoraza:2018:RHP,
  author =       "Iban {Eguia Moraza}",
  title =        "{Rust} High Performance: Learn to Skyrocket the
                 Performance of Your {Rust} Applications",
  publisher =    pub-PACKT,
  address =      pub-PACKT:adr,
  pages =        "265",
  year =         "2018",
  ISBN =         "1-78847-823-1",
  ISBN-13 =      "978-1-78839-948-7, 978-1-78847-823-6",
  LCCN =         "QA76.7",
  bibdate =      "Tue Dec 10 05:42:07 MST 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Sometimes it's difficult to get the best performance
                 out of Rust. This book teaches you how to optimize the
                 speed of your Rust code to the level of languages such
                 as C/C++. You'll understand and fix common pitfalls,
                 learn how to improve your productivity by using
                 metaprogramming, and speed up your code by concurrently
                 executing parts of it.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Programming languages (Electronic computers); Computer
                 programming; Application software; Development;
                 Computers; Programming; Parallel; Software Development
                 and Engineering; Tools; software development; Parallel
                 processing; Programming Languages; C; Programming and
                 scripting languages: general; Development; Computer
                 programming; Programming languages (Electronic
                 computers)",
  tableofcontents = "Preface \\
                 1: Common Performance Pitfalls \\
                 Asking the Rust compiler about performance \\
                 Optimizations \\
                 Build configuration \\
                 Optimization level \\
                 Debug information \\
                 Link-time optimizations \\
                 Debug assertions \\
                 Panic behavior \\
                 Runtime library paths \\
                 Translation issues \\
                 Indexing degradations \\
                 Using iterators \\
                 Iterator adaptors \\
                 Real-life example \\
                 Specialized adaptors \\
                 Interaction between adaptors \\
                 Itertools \\
                 Borrowing degradations \\
                 Cyclomatic complexity \\
                 Summary \\
                 2: Extra Performance Enhancements \\
                 Compile-time checks \\
                 Sequential state machines \\
                 Complex state machines \\
                 Real-life type system check example \\
                 Extra performance tips \\
                 Using closures to avoid runtime evaluation \\
                 Unstable sorting \\
                 Map hashing \\
                 Perfect hash functions \\
                 Standard library collections \\
                 Sequences \\
                 Maps \\
                 Sets \\
                 Summary \\
                 3: Memory Management in Rust \\
                 Mastering the borrow checker \\
                 Allocations \\
                 Mutability, borrowing, and owning \\
                 Lifetimes \\
                 Memory representation \\
                 Alignment \\
                 Complex enumerations \\
                 Unions \\
                 Shared pointers \\
                 The cell module \\
                 Cells \\
                 RefCell \\
                 The rc module \\
                 Summary \\
                 4: Lints and Clippy \\
                 Using Rust compiler lints \\
                 Lints \\
                 Avoiding anonymous parameters \\
                 Avoiding heap allocated box pointers \\
                 Avoiding missing implementations \\
                 Enforcing documentation \\
                 Pointing out trivial casts \\
                 Linting unsafe code blocks \\
                 Unused lints \\
                 Variant size differences \\
                 Lint groups \\
                 Clippy \\
                 Installation \\
                 Configuration \\
                 Lints \\
                 Casting \\
                 Bad practice \\
                 Performance lints \\
                 Unwraps \\
                 Shadowing \\
                 Integer overflow \\
                 Lint groups \\
                 Summary \\
                 5: Profiling Your Rust Application \\
                 Understanding the hardware \\
                 Understanding how the CPU works \\
                 Speeding up memory access with the cache \\
                 Cache misses \\
                 How can you fix it? \\
                 Cache invalidation \\
                 CPU pipeline \\
                 Branch prediction \\
                 The relevance of branch prediction for our code \\
                 Profiling tools \\
                 Valgrind \\
                 Callgrind \\
                 Cachegrind \\
                 OProfile \\
                 Summary \\
                 6: Benchmarking \\
                 Selecting what to benchmark \\
                 Benchmarking in nightly Rust \\
                 Benchmarking in stable Rust \\
                 Continuous integration for benchmarks \\
                 Travis-CI integration \\
                 Benchmark statistics with Criterion \\
                 Summary \\
                 7: Built-in Macros and Configuration Items \\
                 Understanding attributes \\
                 Trait derivations \\
                 Crate features \\
                 Configuration attributes \\
                 Macros \\
                 Console printing \\
                 String formatting \\
                 Compilation environment \\
                 Loading byte arrays and strings at compile time \\
                 Code paths \\
                 Checking preconditions and postconditions \\
                 Others \\
                 Nightly Rust \\
                 Conservative trait return \\
                 Constant functions \\
                 Inline assembly and naked functions \\
                 Using bigger integers \\
                 Single instruction multiple data \\
                 Allocation API \\
                 Compiler plugins \\
                 Summary \\
                 8: Must-Have Macro Crates \\
                 Working with external data \\
                 Data serialization and deserialization \\
                 Serializing and deserializing complex structures \\
                 Parsing byte streams \\
                 Learning about useful small crates \\
                 Creating lazily evaluated statics",
}

@Book{Ehrlich:1973:PCP,
  author =       "Robert Ehrlich",
  title =        "Physics and Computers; Problems, Simulations, and Data
                 Analysis",
  publisher =    pub-HOUGHTON-MIFFLIN,
  address =      pub-HOUGHTON-MIFFLIN:adr,
  pages =        "vi + 279",
  year =         "1973",
  ISBN =         "0-395-59472-1 (??invalid checksum??)",
  ISBN-13 =      "978-0-395-59472-8 (??invalid checksum??)",
  LCCN =         "QC20.2.E35",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Eijkhout:1992:TTT,
  author =       "Victor Eijkhout",
  title =        "{\TeX} by Topic, a {\TeX}nician's Reference",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "vii + 307",
  year =         "1992",
  ISBN =         "0-201-56882-9",
  ISBN-13 =      "978-0-201-56882-0",
  LCCN =         "Z253.4.T47 E38 1992",
  bibdate =      "Tue Dec 14 22:47:52 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/sgml.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  URL =          "http://eijkhout.net/texbytopic/",
  acknowledgement = ack-nhfb,
  tableofcontents = "License / 15 \\
                 Preface / 21 \\
                 1 The Structure of the TEX Processor / 23 \\
                 1.1 Four TEX processors / 23 \\
                 1.2 The input processor / 24 \\
                 1.2.1 Character input / 24 \\
                 1.2.2 Two-level input processing / 24 \\
                 1.3 The expansion processor / 25 \\
                 1.3.1 The process of expansion / 25 \\
                 1.3.2 Special cases: \expandafter, \noexpand, and \the
                 / 25 \\
                 1.3.3 Braces in the expansion processor / 26 \\
                 1.4 The execution processor / 26 \\
                 1.5 The visual processor / 27 \\
                 1.6 Examples / 28 \\
                 1.6.1 Skipped spaces / 28 \\
                 1.6.2 Internal quantities and their representations /
                 28 \\
                 2 Category Codes and Internal States / 29 \\
                 2.1 Introduction / 29 \\
                 2.2 Initial processing / 29 \\
                 2.3 Category codes / 30 \\
                 2.4 From characters to tokens / 32 \\
                 2.5 The input processor as a finite state automaton /
                 32 \\
                 2.5.1 State N: new line / 32 \\
                 2.5.2 State S: skipping spaces / 32 \\
                 2.5.3 State M: middle of line / 32 \\
                 2.6 Accessing the full character set / 33 \\
                 2.7 Transitions between internal states / 33 \\
                 2.7.1 0: escape character / 33 \\
                 2.7.2 1--4, 7--8, 11--13: non-blank characters / 34 \\
                 2.7.3 5: end of line / 34 \\
                 2.7.4 6: parameter / 34 \\
                 2.7.5 7: superscript / 34 \\
                 2.7.6 9: ignored character / 34 \\
                 2.7.7 10: space / 35 \\
                 2.7.8 14: comment / 35 \\
                 2.7.9 15: invalid / 35 \\
                 2.8 Letters and other characters / 35 \\
                 2.9 The \par token / 36 \\
                 2.10 Spaces / 37 \\
                 2.10.1 Skipped spaces / 37 \\
                 2.10.2 Optional spaces / 37 \\
                 2.10.3 Ignored and obeyed spaces / 38 \\
                 2.10.4 More ignored spaces / 38 \\
                 2.10.5 space token / 39 \\
                 2.10.6 Control space / 39 \\
                 2.10.7 ` ' / 39 \\
                 2.11 More about line ends / 40 \\
                 2.11.1 Obeylines / 40 \\
                 2.11.2 Changing the \endlinechar / 40 \\
                 2.11.3 More remarks about the end-of-line character /
                 41 \\
                 2.12 More about the input processor / 41 \\
                 2.12.1 The input processor as a separate process / 41
                 \\
                 2.12.2 The input processor not as a separate process /
                 42 \\
                 2.12.3 Recursive invocation of the input processor / 42
                 \\
                 2.13 The <at> convention / 43 \\
                 3 Characters / 45 \\
                 3.1 Character codes / 45 \\
                 3.2 Control sequences for characters / 46 \\
                 3.2.1 Denoting characters to be typeset: \char / 46 \\
                 3.2.2 Implicit character tokens: \let / 47 \\
                 3.3 Accents / 48 \\
                 3.4 Testing characters / 49 \\
                 3.5 Uppercase and lowercase / 50 \\
                 3.5.1 Uppercase and lowercase codes / 50 \\
                 3.5.2 Uppercase and lowercase commands / 50 \\
                 3.5.3 Uppercase and lowercase forms of keywords / 50
                 \\
                 3.5.4 Creative use of \uppercase and \lowercase / 51
                 \\
                 3.6 Codes of a character / 51 \\
                 3.7 Converting tokens into character strings / 51 \\
                 3.7.1 Output of control sequences / 52 \\
                 3.7.2 Category codes of a \string / 52 \\
                 4 Fonts / 53 \\
                 4.1 Fonts / 53 \\
                 4.2 Font declaration / 54 \\
                 4.2.1 Fonts and tfm files / 54 \\
                 4.2.2 Querying the current font and font names / 54 \\
                 4.2.3 \nullfont / 55 \\
                 4.3 Font information / 55 \\
                 4.3.1 Font dimensions / 55 \\
                 4.3.2 Kerning / 56 \\
                 4.3.3 Italic correction / 56 \\
                 4.3.4 Ligatures / 57 \\
                 4.3.5 Boundary ligatures / 57 \\
                 5 Boxes / 59 \\
                 5.1 Boxes / 60 \\
                 5.2 Box registers / 60 \\
                 5.2.1 Allocation: \newbox / 60 \\
                 5.2.2 Usage: \setbox, \box, \copy / 61 \\
                 5.2.3 Testing: \ifvoid, \ifhbox, \ifvbox / 61 \\
                 5.2.4 The \lastbox / 61 \\
                 5.3 Natural dimensions of boxes / 62 \\
                 5.3.1 Dimensions of created horizontal boxes / 62 \\
                 5.3.2 Dimensions of created vertical boxes / 62 \\
                 5.3.3 Examples / 63 \\
                 5.4 More about box dimensions / 64 \\
                 5.4.1 Predetermined dimensions / 64 \\
                 5.4.2 Changes to box dimensions / 65 \\
                 5.4.3 Moving boxes around / 65 \\
                 5.4.4 Box dimensions and box placement / 65 \\
                 5.4.5 Boxes and negative glue / 66 \\
                 5.5 Overfull and underfull boxes / 67 \\
                 5.6 Opening and closing boxes / 67 \\
                 5.7 Unboxing / 68 \\
                 5.8 Text in boxes / 69 \\
                 5.9 Assorted remarks / 70 \\
                 5.9.1 Forgetting the \box / 70 \\
                 5.9.2 Special-purpose boxes / 70 \\
                 5.9.3 The height of a vertical box in horizontal mode /
                 70 \\
                 5.9.4 More subtleties with vertical boxes / 70 \\
                 5.9.5 Hanging the \lastbox back in the list / 71 \\
                 5.9.6 Dissecting paragraphs with \lastbox / 72 \\
                 6 Horizontal and Vertical Mode / 73 \\
                 6.1 Horizontal and vertical mode / 73 \\
                 6.1.1 Horizontal mode / 73 \\
                 6.1.2 Vertical mode / 74 \\
                 6.2 Horizontal and vertical commands / 74 \\
                 6.3 The internal modes / 75 \\
                 6.3.1 Restricted horizontal mode / 75 \\
                 6.3.2 Internal vertical mode / 75 \\
                 6.4 Boxes and modes / 76 \\
                 6.4.1 What box do you use in what mode? / 76 \\
                 6.4.2 What mode holds in what box? / 76 \\
                 6.4.3 Mode-dependent behaviour of boxes / 76 \\
                 6.5 Modes and glue / 76 \\
                 6.6 Migrating material / 77 \\
                 6.6.1 \vadjust / 77 \\
                 6.7 Testing modes / 77 \\
                 7 Numbers / 79 \\
                 7.1 Numbers and number's / 79 \\
                 7.2 Integers / 79 \\
                 7.2.1 Denotations: integers / 80 \\
                 7.2.2 Denotations: characters / 80 \\
                 7.2.3 Internal integers / 81 \\
                 7.2.4 Internal integers: other codes of a character /
                 82 \\
                 7.2.5 special integer / 82 \\
                 7.2.6 Other internal quantities: coersion to integer /
                 82 \\
                 7.2.7 Trailing spaces / 82 \\
                 7.3 Numbers / 82 \\
                 7.4 Integer registers / 83 \\
                 7.5 Arithmetic / 83 \\
                 7.5.1 Arithmetic statements / 84 \\
                 7.5.2 Floating-point arithmetic / 84 \\
                 7.5.3 Fixed-point arithmetic / 84 \\
                 7.6 Number testing / 84 \\
                 7.7 Remarks / 85 \\
                 7.7.1 Character constants / 85 \\
                 7.7.2 Expanding too far / how far / 85 \\
                 8 Dimensions and Glue / 87 \\
                 8.1 Definition of glue and dimen / 88 \\
                 8.1.1 Definition of dimensions / 88 \\
                 8.1.2 Definition of glue / 89 \\
                 8.1.3 Conversion of glue to dimen / 90 \\
                 8.1.4 Registers for \dimen and \skip / 90 \\
                 8.1.5 Arithmetic: addition / 90 \\
                 8.1.6 Arithmetic: multiplication and division / 91 \\
                 8.2 More about dimensions / 91 \\
                 8.2.1 Units of measurement / 91 \\
                 8.2.2 Dimension testing / 92 \\
                 8.2.3 Defined dimensions / 92 \\
                 8.3 More about glue / 92 \\
                 8.3.1 Stretch and shrink / 93 \\
                 8.3.2 Glue setting / 94 \\
                 8.3.3 Badness / 94 \\
                 8.3.4 Glue and breaking / 95 \\
                 8.3.5 \kern / 95 \\
                 8.3.6 Glue and modes / 95 \\
                 8.3.7 The last glue item in a list: backspacing / 96
                 \\
                 8.3.8 Examples of backspacing / 96 \\
                 8.3.9 Glue in trace output / 97 \\
                 9 Rules and Leaders / 99 \\
                 9.1 Rules / 99 \\
                 9.1.1 Rule dimensions / 100 \\
                 9.2 Leaders / 100 \\
                 9.2.1 Rule leaders / 101 \\
                 9.2.2 Box leaders / 102 \\
                 9.2.3 Evenly spaced leaders / 102 \\
                 9.3 Assorted remarks / 103 \\
                 9.3.1 Rules and modes / 103 \\
                 9.3.2 Ending a paragraph with leaders / 103 \\
                 9.3.3 Leaders and box registers / 103 \\
                 9.3.4 Output in leader boxes / 104 \\
                 9.3.5 Box leaders in trace output / 104 \\
                 9.3.6 Leaders and shifted margins / 104 \\
                 10 Grouping / 105 \\
                 10.1 The grouping mechanism / 105 \\
                 10.2 Local and global assignments / 106 \\
                 10.3 Group delimiters / 106 \\
                 10.4 More about braces / 107 \\
                 10.4.1 Brace counters / 107 \\
                 10.4.2 The brace as a token / 108 \\
                 10.4.3 Open and closing brace control symbols / 108 \\
                 11 Macros / 109 \\
                 11.1 Introduction / 109 \\
                 11.2 Layout of a macro definition / 110 \\
                 11.3 Prefixes / 110 \\
                 11.4 The definition type / 111 \\
                 11.5 The parameter text / 111 \\
                 11.5.1 Undelimited parameters / 112 \\
                 11.5.2 Delimited parameters / 112 \\
                 11.5.3 Examples with delimited arguments / 113 \\
                 11.5.4 Empty arguments / 114 \\
                 11.5.5 The macro parameter character / 114 \\
                 11.5.6 Brace delimiting / 115 \\
                 11.6 Construction of control sequences / 115 \\
                 11.7 Token assignments by \let and \futurelet / 116 \\
                 11.7.1 \let / 116 \\
                 11.7.2 \futurelet / 117 \\
                 11.8 Assorted remarks / 117 \\
                 11.8.1 Active characters / 117 \\
                 11.8.2 Macros versus primitives / 117 \\
                 11.8.3 Tail recursion / 118 \\
                 11.9 Macro techniques / 119 \\
                 11.9.1 Unknown number of arguments / 119 \\
                 11.9.2 Examining the argument / 119 \\
                 11.9.3 Optional macro parameters with \futurelet / 121
                 \\
                 11.9.4 Two-step macros / 121 \\
                 11.9.5 A comment environment / 122 \\
                 12 Expansion / 125 \\
                 12.1 Introduction / 125 \\
                 12.2 Ordinary expansion / 125 \\
                 12.3 Reversing expansion order / 126 \\
                 12.3.1 One step expansion: \expandafter / 126 \\
                 12.3.2 Total expansion: \edef / 127 \\
                 12.3.3 \afterassignment / 127 \\
                 12.3.4 \aftergroup / 128 \\
                 12.4 Preventing expansion / 129 \\
                 12.4.1 \noexpand / 129 \\
                 12.4.2 \noexpand and active characters / 129 \\
                 12.5 \relax / 130 \\
                 12.5.1 \relax and \csname / 130 \\
                 12.5.2 Preventing expansion with \relax / 131 \\
                 12.5.3 TEX inserts a \relax / 131 \\
                 12.5.4 The value of non-macros; \the / 132 \\
                 12.6 Examples / 132 \\
                 12.6.1 Expanding after / 132 \\
                 12.6.2 Defining inside an \edef / 133 \\
                 12.6.3 Expansion and \write / 134 \\
                 12.6.4 Controlled expansion inside an \edef / 135 \\
                 12.6.5 Multiple prevention of expansion / 135 \\
                 12.6.6 More examples with \relax / 136 \\
                 12.6.7 Example: category code saving and restoring /
                 136 \\
                 12.6.8 Combining \aftergroup and boxes / 137 \\
                 12.6.9 More expansion / 138 \\
                 13 Conditionals / 139 \\
                 13.1 The shape of conditionals / 139 \\
                 13.2 Character and control sequence tests / 140 \\
                 13.2.1 \if / 140 \\
                 13.2.2 \ifcat / 140 \\
                 13.2.3 \ifx / 141 \\
                 13.3 Mode tests / 141 \\
                 13.4 Numerical tests / 142 \\
                 13.5 Other tests / 142 \\
                 13.5.1 Dimension testing / 142 \\
                 13.5.2 Box tests / 142 \\
                 13.5.3 I/O tests / 142 \\
                 13.5.4 Case statement / 142 \\
                 13.5.5 Special tests / 143 \\
                 13.6 The \newif macro / 143 \\
                 13.7 Evaluation of conditionals / 144 \\
                 13.8 Assorted remarks / 145 \\
                 13.8.1 The test gobbles up tokens / 145 \\
                 13.8.2 The test wants to gobble up the \else or \fi /
                 145 \\
                 13.8.3 Macros and conditionals; the use of \expandafter
                 / 146 \\
                 13.8.4 Incorrect matching / 147 \\
                 13.8.5 Conditionals and grouping / 147 \\
                 13.8.6 A trick / 148 \\
                 13.8.7 More examples of expansion in conditionals / 148
                 \\
                 14 Token Lists / 151 \\
                 14.1 Token lists / 151 \\
                 14.2 Use of token lists / 151 \\
                 14.3 token parameter / 152 \\
                 14.4 Token list registers / 152 \\
                 14.5 Examples / 153 \\
                 14.5.1 Operations on token lists: stack macros / 153
                 \\
                 14.5.2 Executing token lists / 154 \\
                 15 Baseline Distances / 155 \\
                 15.1 Interline glue / 155 \\
                 15.2 The perceived depth of boxes / 157 \\
                 15.3 Terminology / 158 \\
                 15.4 Additional remarks / 158 \\
                 16 Paragraph Start / 159 \\
                 16.1 When does a paragraph start / 159 \\
                 16.2 What happens when a paragraph starts / 160 \\
                 16.3 Assorted remarks / 160 \\
                 16.3.1 Starting a paragraph with a box / 160 \\
                 16.3.2 Starting a paragraph with a group / 160 \\
                 16.4 Examples / 161 \\
                 16.4.1 Stretchable indentation / 161 \\
                 16.4.2 Suppressing indentation / 161 \\
                 16.4.3 An indentation scheme / 161 \\
                 16.4.4 A paragraph skip scheme / 162 \\
                 17 Paragraph End / 165 \\
                 17.1 The way paragraphs end / 165 \\
                 17.1.1 The \par command and the \par token / 165 \\
                 17.1.2 Paragraph filling: \parfillskip / 166 \\
                 17.2 Assorted remarks / 166 \\
                 17.2.1 Ending a paragraph and a group at the same time
                 / 166 \\
                 17.2.2 Ending a paragraph with \hfill\break / 167 \\
                 17.2.3 Ending a paragraph with a rule / 167 \\
                 17.2.4 No page breaks in between paragraphs / 167 \\
                 17.2.5 Finite \parfillskip / 167 \\
                 17.2.6 A precaution for paragraphs that do not indent /
                 168 \\
                 18 Paragraph Shape / 169 \\
                 18.1 The width of text lines / 170 \\
                 18.2 Shape parameters / 170 \\
                 18.2.1 Hanging indentation / 170 \\
                 18.2.2 General paragraph shapes: \parshape / 171 \\
                 18.3 Assorted remarks / 171 \\
                 18.3.1 Centred last lines / 171 \\
                 18.3.2 Indenting into the margin / 172 \\
                 18.3.3 Hang a paragraph from an object / 172 \\
                 18.3.4 Another approach to hanging indentation / 173
                 \\
                 18.3.5 Hanging indentation versus \leftskip shifting /
                 173 \\
                 18.3.6 More examples / 174 \\
                 19 Line Breaking / 175 \\
                 19.1 Paragraph break cost calculation / 176 \\
                 19.1.1 Badness / 176 \\
                 19.1.2 Penalties and other break locations / 177 \\
                 19.1.3 Demerits / 177 \\
                 19.1.4 The number of lines of a paragraph / 178 \\
                 19.1.5 Between the lines / 178 \\
                 19.2 The process of breaking / 178 \\
                 19.2.1 Three passes / 179 \\
                 19.2.2 Tolerance values / 179 \\
                 19.3 Discretionaries / 179 \\
                 19.3.1 Hyphens and discretionaries / 179 \\
                 19.3.2 Examples of discretionaries / 180 \\
                 19.4 Hyphenation / 181 \\
                 19.4.1 Start of a word / 181 \\
                 19.4.2 End of a word / 181 \\
                 19.4.3 TEX2 versus TEX3 / 182 \\
                 19.4.4 Patterns and exceptions / 182 \\
                 19.5 Switching hyphenation patterns / 182 \\
                 20 Spacing / 185 \\
                 20.1 Introduction / 185 \\
                 20.2 Automatic interword space / 185 \\
                 20.3 User interword space / 186 \\
                 20.4 Control space and tie / 187 \\
                 20.5 More on the space factor / 188 \\
                 20.5.1 Space factor assignments / 188 \\
                 20.5.2 Punctuation / 188 \\
                 20.5.3 Other non-letters / 189 \\
                 20.5.4 Other influences on the space factor / 189 \\
                 21 Characters in Math Mode / 191 \\
                 21.1 Mathematical characters / 192 \\
                 21.2 Delimiters / 192 \\
                 21.2.1 Delimiter codes / 193 \\
                 21.2.2 Explicit \delimiter commands / 193 \\
                 21.2.3 Finding a delimiter; successors / 193 \\
                 21.2.4 \big, \Big, \bigg, and \Bigg delimiter macros /
                 194 \\
                 21.3 Radicals / 194 \\
                 21.4 Math accents / 195 \\
                 22 Fonts in Formulas / 197 \\
                 22.1 Determining the font of a character in math mode /
                 197 \\
                 22.2 Initial family settings / 198 \\
                 22.3 Family definition / 198 \\
                 22.4 Some specific font changes / 198 \\
                 22.4.1 Change the font of ordinary characters and
                 uppercase Greek / 198 \\
                 22.4.2 Change uppercase Greek independent of text font
                 / 199 \\
                 22.4.3 Change the font of lowercase Greek and
                 mathematical symbols / 199 \\
                 22.5 Assorted remarks / 199 \\
                 22.5.1 New fonts in formulas / 199 \\
                 22.5.2 Evaluating the families / 200 \\
                 23 Mathematics Typesetting / 201 \\
                 23.1 Math modes / 202 \\
                 23.2 Styles in math mode / 202 \\
                 23.2.1 Superscripts and subscripts 203 / 11 \\
                 23.2.2 Choice of styles / 203 \\
                 23.3 Classes of mathematical objects / 204 \\
                 23.4 Large operators and their limits / 204 \\
                 23.5 Vertical centring: \vcenter / 205 \\
                 23.6 Mathematical spacing: mu glue / 205 \\
                 23.6.1 Classification of mu glue / 206 \\
                 23.6.2 Muskip registers / 206 \\
                 23.6.3 Other spaces in math mode / 207 \\
                 23.7 Generalized fractions / 207 \\
                 23.8 Underlining, overlining / 208 \\
                 23.9 Line breaking in math formulas / 208 \\
                 23.10 Font dimensions of families 2 and 3 / 208 \\
                 23.10.1 Symbol font attributes / 208 \\
                 23.10.2 Extension font attributes / 209 \\
                 23.10.3 Example: subscript lowering / 210 \\
                 24 Display Math / 211 \\
                 24.1 Displays / 211 \\
                 24.2 Displays in paragraphs / 212 \\
                 24.3 Vertical material around displays / 212 \\
                 24.4 Glue setting of the display math list / 213 \\
                 24.5 Centring the display formula: displacement / 213
                 \\
                 24.6 Equation numbers / 214 \\
                 24.6.1 Ordinary equation numbers / 214 \\
                 24.6.2 The equation number on a separate line / 214 \\
                 24.7 Non-centred displays / 214 \\
                 25 Alignment / 217 \\
                 25.1 Introduction / 217 \\
                 25.2 Horizontal and vertical alignment / 217 \\
                 25.2.1 Horizontal alignments: \halign / 218 \\
                 25.2.2 Vertical alignments: \valign / 218 \\
                 25.2.3 Material between the lines: \noalign / 218 \\
                 25.2.4 Size of the alignment / 219 \\
                 25.3 The preamble / 219 \\
                 25.3.1 Infinite preambles / 219 \\
                 25.3.2 Brace counting in preambles / 220 \\
                 25.3.3 Expansion in the preamble / 220 \\
                 25.3.4 \tabskip / 220 \\
                 25.4 The alignment / 221 \\
                 25.4.1 Reading an entry / 221 \\
                 25.4.2 Alternate specifications: \omit / 221 \\
                 25.4.3 Spanning across multiple columns: \span / 222
                 \\
                 25.4.4 Rules in alignments / 222 \\
                 25.4.5 End of a line: \cr and \crcr / 223 \\
                 25.5 Example: math alignments / 224 \\
                 26 Page Shape / 225 \\
                 26.1 The reference point for global positioning / 225
                 \\
                 26.2 \topskip / 225 \\
                 26.3 Page height and depth / 226 \\
                 27 Page Breaking / 227 \\
                 27.1 The current page and the recent contributions /
                 228 \\
                 27.2 Activating the page builder / 228 \\
                 27.3 Page length bookkeeping / 228 \\
                 27.4 Breakpoints / 229 \\
                 27.4.1 Possible breakpoints / 229 \\
                 27.4.2 Breakpoint penalties / 229 \\
                 27.4.3 Breakpoint computation / 230 \\
                 27.5 \vsplit / 231 \\
                 27.6 Examples of page breaking / 232 \\
                 27.6.1 Filling up a page / 232 \\
                 27.6.2 Determining the breakpoint / 232 \\
                 27.6.3 The page builder after a paragraph / 233 \\
                 28 Output Routines / 235 \\
                 28.1 The \output token list / 235 \\
                 28.2 Output and \box255 / 236 \\
                 28.3 Marks / 236 \\
                 28.4 Assorted remarks / 238 \\
                 28.4.1 Hazards in non-trivial output routines / 238 \\
                 28.4.2 Page numbering / 238 \\
                 28.4.3 Headlines and footlines in plain TEX / 238 \\
                 28.4.4 Example: no widow lines / 238 \\
                 28.4.5 Example: no indentation top of page / 239 \\
                 28.4.6 More examples of output routines / 240 \\
                 29 Insertions / 241 \\
                 29.1 Insertion items / 241 \\
                 29.2 Insertion class declaration / 242 \\
                 29.3 Insertion parameters / 242 \\
                 29.4 Moving insertion items from the contributions list
                 / 243 \\
                 29.5 Insertions in the output routine / 244 \\
                 29.6 Plain TEX insertions / 244 \\
                 30 File Input and Output / 245 \\
                 30.1 Including files: \input and \endinput / 245 \\
                 30.2 File I/O / 246 \\
                 30.2.1 Opening and closing streams / 246 \\
                 30.2.2 Input with \read / 246 \\
                 30.2.3 Output with \write / 247 \\
                 30.3 Whatsits / 247 \\
                 30.4 Assorted remarks / 248 \\
                 30.4.1 Inspecting input / 248 \\
                 30.4.2 Testing for existence of files / 248 \\
                 30.4.3 Timing problems / 248 \\
                 30.4.4 \message versus \immediate\write16 / 248 \\
                 30.4.5 Write inside a vertical box / 249 \\
                 30.4.6 Expansion and spaces in \write and \message /
                 249 \\
                 31 Allocation / 251 \\
                 31.1 Allocation commands / 251 \\
                 31.1.1 \count, \dimen, \skip, \muskip, \toks / 252 \\
                 31.1.2 \box, \fam, \write, \read, \insert / 252 \\
                 31.2 Ground rules for macro writers / 252 \\
                 32 Running TEX / 255 \\
                 32.1 Jobs / 255 \\
                 32.1.1 Start of the job / 255 \\
                 32.1.2 End of the job / 256 \\
                 32.1.3 The log file / 256 \\
                 32.2 Run modes / 256 \\
                 33 TEX and the Outside World / 259 \\
                 33.1 TEX, IniTEX, VirTEX / 259 \\
                 33.1.1 Formats: loading / 259 \\
                 33.1.2 Formats: dumping / 260 \\
                 33.1.3 Formats: preloading / 260 \\
                 33.1.4 The knowledge of IniTEX / 260 \\
                 33.1.5 Memory sizes of TEX and IniTEX / 261 \\
                 33.2 More about formats / 261 \\
                 33.2.1 Compatibility / 261 \\
                 33.2.2 Preloaded fonts / 261 \\
                 33.2.3 The plain format / 262 \\
                 33.2.4 The LATEX format / 262 \\
                 33.2.5 Mathematical formats / 262 \\
                 33.2.6 Other formats / 262 \\
                 33.3 The dvi file / 263 \\
                 33.3.1 The dvi file format / 263 \\
                 33.3.2 Page identification / 263 \\
                 33.3.3 Magnification / 263 \\
                 33.4 Specials / 264 \\
                 33.5 Time / 264 \\
                 33.6 Fonts / 264 \\
                 33.6.1 Font metrics / 264 \\
                 33.6.2 Virtual fonts / 265 \\
                 33.6.3 Font files / 265 \\
                 33.6.4 Computer Modern / 266 \\
                 33.7 TEX and web / 266 \\
                 33.8 The TEX Users Group / 267 \\
                 34 Tracing / 269 \\
                 34.1 Meaning and content: \show, \showthe, \meaning /
                 270 \\
                 34.2 Show boxes: \showbox, \tracingoutput / 270 \\
                 34.3 Global statistics / 272 \\
                 34.4 Execution tracing / 273 \\
                 35 Errors, Catastrophes, and Help / 275 \\
                 35.1 Error messages / 275 \\
                 35.2 Overflow errors / 276 \\
                 35.2.1 Buffer size (500) / 276 \\
                 35.2.2 Exception dictionary (307) / 276 \\
                 35.2.3 Font memory (20,000) / 276 \\
                 35.2.4 Grouping levels / 277 \\
                 35.2.5 Hash size (2100) / 277 \\
                 35.2.6 Number of strings (3000) / 277 \\
                 35.2.7 Input stack size (200) / 277 \\
                 35.2.8 Main memory size (30,000) / 277 \\
                 35.2.9 Parameter stack size (60) / 277 \\
                 35.2.10 Pattern memory (8000) / 278 \\
                 35.2.11 Pattern memory ops per language / 278 \\
                 35.2.12 Pool size (32,000) / 278 \\
                 35.2.13 Save size (600) / 278 \\
                 35.2.14 Semantic nest size (40) / 278 \\
                 35.2.15 Text input levels (6) / 278 \\
                 36 The Grammar of TEX / 279 \\
                 36.1 Notations / 279 \\
                 36.2 Keywords / 280 \\
                 36.3 Specific grammatical terms / 280 \\
                 36.3.1 equals / 280 \\
                 36.3.2 filler, general text / 280 \\
                 36.3.3 {} and left brace right brace / 281 \\
                 36.3.4 math field / 281 \\
                 36.4 Differences between TEX versions 2 and 3 / 281 \\
                 37 Glossary of TEX Primitives / 283 \\
                 38 Tables / 297 \\
                 38.1 Character tables / 298 \\
                 38.2 Computer modern fonts / 300 \\
                 38.3 Plain TEX math symbols / 305 \\
                 38.3.1 Mathcharacter codes / 305 \\
                 38.3.2 Delimiter codes / 306 \\
                 38.3.3 mathchardef tokens: ordinary symbols / 307 \\
                 38.3.4 mathchardef tokens: large operators / 308 \\
                 38.3.5 mathchardef tokens: binary operations / 309 \\
                 38.3.6 mathchardef tokens: relations / 310 \\
                 38.3.7 \delimiter macros / 311 \\
                 39 Index / 313 \\
                 Bibliography / 321",
  xxnote =       "See \cite{Poppelier:1992:BRJ,Poppelier:1992:BR}.",
}

@Book{Einstein:1966:EPE,
  author =       "Albert Einstein and Leopold Infeld",
  title =        "The Evolution of Physics from Early Concepts to
                 Relativity and Quanta",
  publisher =    pub-SIMON-SCHUSTER,
  address =      pub-SIMON-SCHUSTER:adr,
  pages =        "xvi + 302",
  year =         "1966",
  ISBN =         "0-671-20156-5",
  ISBN-13 =      "978-0-671-20156-2",
  LCCN =         "QC7 .E5 1961",
  bibdate =      "Mon Oct 9 06:48:08 MDT 2006",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/i/infeld-leopold.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "A Touchstone book",
  acknowledgement = ack-nhfb,
  author-dates = "Albert Einstein (1879--1955); Leopold Infeld
                 (1898--1968)",
  remark =       "Reprint of 1938 and 1961 editions.",
  subject =      "Physics; History; Relativity (physics); Quantum
                 theory",
  tableofcontents = "Introduction to the new edition / xi \\
                 Preface / xv \\
                 Part I. the rise of the mechanical view \\
                 The great mystery story / 3 \\
                 The first clew / 5 \\
                 Vectors / 11 \\
                 The riddle of motion / 18 \\
                 One clew remains / 31 \\
                 Is heat a substance? / 35 \\
                 The roller-coaster / 44 \\
                 The rate of exchange / 47 \\
                 The philosophical background / 51 \\
                 The kinetic theory of matter / 55 \\
                 Part II. The decline of the mechanical view \\
                 The two electric fluids / 69 \\
                 The magnetic fluids / 80 \\
                 The first serious difficulty / 84 \\
                 The velocity of light / 90 \\
                 Light as a substance / 93 \\
                 The riddle of color / 96 \\
                 What is a wave? / 100 \\
                 The wave theory of light / 105 \\
                 Longitudinal or transverse light waves? / 116 \\
                 Ether and the mechanical view / 119 \\
                 Part III. Field, relativity \\
                 The field as representation / 125 \\
                 The two pillars of the field theory / 137 \\
                 The reality of the field / 142 \\
                 Field and ether / 150 \\
                 The mechanical scaffold / 153 \\
                 Ether and motion / 164 \\
                 Time, distance, relativity / 177 \\
                 Relativity and mechanics / 192 \\
                 The time--space continuum / 199 \\
                 General relativity / 209 \\
                 Outside and inside the elevator / 214 \\
                 Geometry and experiment / 222 \\
                 General relativity and its verification / 235 \\
                 Field and matter / 240 \\
                 Part IV. Quanta \\
                 Continuity--discontinuity / 149 \\
                 Elementary quanta of matter and electricity / 151 \\
                 The quanta of light / 157 \\
                 Light spectra / 165 \\
                 The waves of matter / 170 \\
                 Probability waves / 180 \\
                 Physics and reality / 194 \\
                 Index",
}

@Book{Einstein:2005:MRb,
  author =       "Albert Einstein and Brian Greene",
  title =        "The Meaning of {Relativity}",
  volume =       "1921",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  edition =      "Expanded {Princeton} Science Library",
  pages =        "xxiv + 166",
  year =         "2005",
  ISBN =         "0-691-12027-7",
  ISBN-13 =      "978-0-691-12027-0",
  LCCN =         "QC6",
  bibdate =      "Wed Nov 23 11:39:22 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/physperspect.bib",
  series =       "The Stafford Little lectures",
  URL =          "http://press.princeton.edu/titles/484.html",
  acknowledgement = ack-nhfb,
  remark =       "With a new introduction by Brian Greene.",
  tableofcontents = "Introduction by Brian Greene vii \\
                 A Note on the Fifth Edition xxv \\
                 Space and Time in Pre-Relativity Physics 1 \\
                 The Theory of Special Relativity 24 \\
                 The General Theory of Relativity 55 \\
                 The General Theory of Relativity (continued) 79 \\
                 Appendix for the Second Edition 109 \\
                 Appendix II. Relativistic Theory of the Non-Symmetric
                 Field 133 \\
                 Index 167",
}

@Book{Einstein:2025:EES,
  author =       "Albert Einstein",
  title =        "The Essential {Einstein}: Scientific Writings",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "xi + 540",
  year =         "2025",
  ISBN =         "0-691-13107-4 (hardcover), 0-691-27218-2 (e-book)",
  ISBN-13 =      "978-0-691-13107-8 (hardcover), 978-0-691-27218-4
                 (e-book)",
  LCCN =         "QC6 .E56 2025",
  bibdate =      "Sat Dec 13 15:48:25 MST 2025",
  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",
  note =         "Edited by Diana Kormos Buchwald and Tilman Sauer.",
  URL =          "http://www.gbv.de/dms/bowker/toc/9780691131078.pdf",
  abstract =     "\booktitle{The Essential Einstein: Scientific
                 Writings} presents Einstein's most important physics
                 papers, spanning his groundbreaking contributions to
                 statistical mechanics, quantum theory, and relativity
                 as well as his ambitious yet ultimately unrealized
                 attempts at a general unified field theory. This
                 incisive collection contains works that profoundly
                 influenced the trajectory of modern science. Each piece
                 serves not only as a reflection of his intellectual
                 rigor and creativity but also as a cornerstone of
                 contemporary scientific thought.",
  acknowledgement = ack-nhfb,
  author-dates = "Albert Einstein (1879--1955)",
  subject =      "Einstein, Albert; Relativit{\"a}tstheorie",
  tableofcontents = "Introduction to the Scientific Writings / ix \\
                 1: A Theory of the Foundations of Thermodynamics (1903)
                 / 1 \\
                 2: On a Heuristic Point of View Concerning the
                 Production and Transformation of Light (1905) / 18 \\
                 3: On the Motion of Small Particles Suspended in
                 Liquids at Rest Required by the Molecular-Kinetic
                 Theory of Heat (1905) / 33 \\
                 4: On the Electrodynamics of Moving Bodies (1905) / 43
                 \\
                 5: Does the Inertia of a Body Depend upon Its Energy
                 Content? (1905) / 72 \\
                 6: On the Theory of Light Production and Light
                 Absorption (1906) / 75 \\
                 7: Planck's Theory of Radiation and the Theory of
                 Specific Heat (1907) / 82 \\
                 8: On the Relativity Principle and the Conclusions
                 Drawn from It (1907) / 93 \\
                 9: On the Present Status of the Radiation Problem
                 (1909) / 147 \\
                 10: On the Development of Our Views Concerning the
                 Nature and Constitution of Radiation (1909) / 165 \\
                 11: On the Influence of Gravitation on the Propagation
                 of Light (1911) / 181 \\
                 12: Thermodynamic Proof of the Law of Photochemical
                 Equivalence (1912) / 191 \\
                 13: Experimental Proof of Amp{\`e}re's Molecular
                 Currents (1915) with W. de Haas / 198 \\
                 14: Explanation of the Perihelion Motion of Mercury
                 from the General Theory of Relativity (1915) / 202 \\
                 15: The Foundation of the General Theory of Relativity
                 (1916) / 212 \\
                 16: Approximative Integration of the Field Equations of
                 Gravitation (1916) / 265 \\
                 17: On the Quantum Theory of Radiation (1916) / 275 \\
                 18: Hamilton's Principle and the General Theory of
                 Relativity (1916) / 289 \\
                 19: Cosmological Considerations in the General Theory
                 of Relativity (1917) / 296 \\
                 20: On Gravitational Waves (1918) / 307 \\
                 21: On the Foundations of the General Theory of
                 Relativity (1918) / 323 \\
                 22: The Law of Energy Conservation in the General
                 Theory of Relativity (1918) / 326 \\
                 23: Does Field Theory Provide Possibilities for the
                 Solution of the Quantum Problem? (1923) / 339 \\
                 24: Quantum Theory of the Monatomic Ideal Gas (1924) /
                 346 \\
                 25: Quantum Theory of the Monatomic Ideal Gas. Second
                 Paper (1925) / 354 \\
                 26: Unified Field Theory of Gravitation and Electricity
                 (1925) / 369 \\
                 27: Patent of Refrigerator (1927) with L. Szilard / 376
                 \\
                 28: Unified Field Theory Based on Riemannian Metric and
                 Distant Parallelism (1930) / 384 \\
                 29: On the Cosmological Problem of the General Theory
                 of Relativity (1931) / 398 \\
                 30: On the Relation between the Expansion and the Mean
                 Density of the Universe (1932) with W. de Sitter / 402
                 \\
                 31: Elementary Derivation of the Equivalence of Mass
                 and Energy (1935) / 404 \\
                 32: Can Quantum-Mechanical Description of Physical
                 Reality Be Considered Complete? (1935) with B. Podolsky
                 and N. Rosen / 412 \\
                 33: The Particle Problem in the General Theory of
                 Relativity (1935) with N. Rosen / 420 \\
                 34: Lens-like Action of a Star by the Deflection of
                 Light in a Gravitational Field (1936) / 431 \\
                 35: On a Generalization of Kaluza's Theory of
                 Electricity (1938) with P. Bergmann / 433 \\
                 36: The Gravitational Equations and the Problem of
                 Motion [Excerpt] (1937) with L. Infeld and B. Hoffmann
                 / 455 \\
                 37: On the Non-Existence of Regular Stationary
                 Solutions of Relativistic Field Equations (1943) with
                 W. Pauli / 486 \\
                 38: Relativistic Theory of the Non-symmetric Field
                 (1955) / 494 \\
                 Bibliography / 521 \\
                 Index / 527",
}

@Book{Eisenberg:1969:SPW,
  author =       "D. (David) Eisenberg and W. (Walter) Kauzmann",
  title =        "The Structure and Properties of Water",
  publisher =    pub-CLARENDON,
  address =      pub-CLARENDON:adr,
  pages =        "ix + 296",
  year =         "1969",
  ISBN =         "0-19-855339-0",
  ISBN-13 =      "978-0-19-855339-7",
  LCCN =         "QD169.W3 E35",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Eisenstaedt:2006:CHR,
  author =       "Jean Eisenstaedt",
  title =        "The Curious History of {Relativity}: How {Einstein}'s
                 Theory of Gravity Was Lost and Found Again",
  volume =       "15",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "ix + 363",
  year =         "2006",
  ISBN =         "0-691-11865-5",
  ISBN-13 =      "978-0-691-11865-9",
  LCCN =         "QC173.6 EIS; 06.E06047",
  bibdate =      "Thu Jan 25 18:28:33 MST 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/jhistastron.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/physperspect.bib;
                 library.ox.ac.uk:210/ADVANCE",
  series =       "CNRS editions",
  abstract =     "[This book] tells the story of the events surrounding
                 general relativity and the techniques employed by
                 Einstein and the relativists to construct, develop, and
                 understand his almost impenetrable theory. [It] also
                 describes the theories place in the evolution of
                 twentieth-century physics.",
  acknowledgement = ack-nhfb,
  remark =       "Translated by Arturo Sangalli of {\em Einstein et la
                 relativit{\'e} g{\'e}n{\'e}rale. Les chemins de
                 l'espace-temps}, by Jean Eisenstaedt
                 \cite{Eisenstaedt:2002:ERG}. Foreword by Thibault
                 Damour.",
  subject =      "General relativity (Physics); Space and time;
                 Relativity; Light; Gravity; Physics; History; Einstein,
                 Albert",
  subject-dates = "Albert Einstein (1879--1955)",
  tableofcontents = "Foreword \\
                 Introduction: a difficult theory \\
                 1. The speed of light and classical physics \\
                 2: Light and the structure of space--time \\
                 3: Toward a new theory of gravitation \\
                 4: Einstein's principles \\
                 5: The birth of general relativity \\
                 6: General relativity: a physical geometry \\
                 7: Relativity verified: Mercury's anomaly \\
                 8: Relativity verified: the deflection of light rays
                 \\
                 9: Relativity verified: the line shift \\
                 10: The crossing of the desert \\
                 11: An unpopular theory \\
                 12: The rejection of black holes \\
                 13: Paths in Schwarzschild's space--time \\
                 14: No ordinary stars \\
                 15: Gravitation, astrophysics, and cosmology \\
                 Afterword: The paths of general relativity \\
                 Bibliography \\
                 Name index",
}

@Book{Ekman:2016:MBD,
  author =       "Martin Ekman",
  title =        "The man behind ``{Degrees Celsius}'': a pioneer in
                 investigating the {Earth} and its changes",
  publisher =    "Summer Institute for Historical Geophysics",
  address =      "Godby, {\AA}land Islands, Finland",
  pages =        "159",
  year =         "2016",
  ISBN =         "952-93-7732-0",
  ISBN-13 =      "978-952-93-7732-9",
  LCCN =         "????",
  bibdate =      "Thu Aug 30 10:20:37 MDT 2018",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/hgss.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "This is a book about an unknown person with a
                 well-known name, Anders Celsius, a book about his life
                 and works. It is, thereby, also a book about the
                 beginning of systematically investigating the Earth and
                 its changes. Celsius may be characterized as a pioneer
                 in investigating the Earth by means of systematic
                 observations and by collecting long series of numerical
                 data. In the early 1700s he and his assistants measured
                 and studied latitude, longitude, gravity, magnetism,
                 sea level change, land uplift, air pressure,
                 temperature and northern lights. Much of Celsius'
                 inspiration for his works came from his participation
                 in an international expedition to the Arctic Circle,
                 the purpose of which was nothing less than trying to
                 confirm the theories of Newton. In many respects
                 Celsius concentrated on utilizing Sweden's northerly
                 position on the Earth, promoting such investigations
                 that could not easily be made in more southerly
                 countries. This book is the story of the life and works
                 of a man who started from meager circumstances in an
                 isolated northern university but developed into a
                 pioneering Earth scientist with international contacts.
                 It is also the story of a scientist who was engaged in
                 creating an observatory and supporting an academy for
                 the benefit of society but who died in the middle of
                 his activities.",
  acknowledgement = ack-nhfb,
  author-dates = "1951--",
  remark =       "Anders Celsius may be characterized as a pioneer in
                 investigating the Earth by means of systematic
                 observations and by collecting long series of numerical
                 data. In the early 1700s he and his assistants measured
                 and studied latitude, longitude, gravity, magnetism,
                 sea level change, land uplift, air pressure,
                 temperature and northern lights.",
  subject =      "Celsius, Anders; Earth sciences; History",
  subject-dates = "1701--1744",
  tableofcontents = "Preface \\
                 The unknown man with the well-known name: An
                 introduction \\
                 Where and when: Official and personal background \\
                 2.1 University and science: From clerical control to
                 academic freedom \\
                 2.2 Father's parents: The quarrelling astronomer and
                 his wife \\
                 2.3 Mother's parents: The quiet astronomer and his wife
                 \\
                 2.4 Father and mother: The unhappy astronomer and his
                 wife \\
                 Curiosity and unpaid work: Student and young scientist
                 \\
                 3.1 Growing up \\
                 3.2 A novelty \\
                 3.3 Up in the church tower, down in the silver mine \\
                 3.4 Waiting in Uppsala \\
                 Out in the world: For or against Newton? \\
                 4.1 A safe position \\
                 4.2 Via Berlin to Rome \\
                 4.3 In Paris: A turning point \\
                 4.4 In London: Preparing for the north \\
                 4.5 To the Arctic Circle: Stars and ice \\
                 4.6 Was Newton right? \\
                 At home again: Investigating the unknown Earth \\
                 5.1 An observatory for investigating the Earth \\
                 5.2 Latitude, longitude and mapping \\
                 5.3 Gravity and the Earth's shape \\
                 5.4 Land uplift / water decrease and history \\
                 5.5 Sea level and the atmosphere \\
                 5.6 Temperature, air pressure and climate change \\
                 5.7 Magnetism and magnetic changes \\
                 5.8 Northern lights and a big surprise \\
                 5.9 Science, family and friendship --- and love? \\
                 After Celsius: An unusual heritage \\
                 6.1 The sudden end of life \\
                 6.2 The decline of the observatory \\
                 6.3 A new observatory in Stockholm \\
                 6.4 The unknown man with the well-known name: Looking
                 back \\
                 Appendix: A dramatic love story \\
                 References \\
                 Illustrations \\
                 Index",
}

@Book{Ekstrom:1984:DIP,
  author =       "Michael P. Ekstrom",
  title =        "Digital Image Processing Techniques",
  volume =       "2",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "xiii + 372",
  year =         "1984",
  ISBN =         "0-12-236760-X",
  ISBN-13 =      "978-0-12-236760-1",
  LCCN =         "TA1632 .D496 1984",
  bibdate =      "Tue Dec 14 22:47:54 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Computational Techniques, Editors: Berni J. Alder and
                 Sidney Fernbach",
  acknowledgement = ack-nhfb,
}

@Book{Eliel:1962:SCC,
  author =       "Ernest L. (Ernest Ludwig) Eliel",
  title =        "Stereochemistry of Carbon Compounds",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "xv + 486",
  year =         "1962",
  LCCN =         "QD481 .E45",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Ellis:1989:MCS,
  author =       "Wade {Ellis, Jr.} and Ed Lodi",
  title =        "{Maple} for the Calculus Student",
  publisher =    pub-BROOKS-COLE,
  address =      pub-BROOKS-COLE:adr,
  pages =        "vii + 67",
  year =         "1989",
  ISBN =         "0-534-11874-7",
  ISBN-13 =      "978-0-534-11874-7",
  LCCN =         "QA155.7.E4 E44 1989",
  bibdate =      "Wed Dec 15 08:56:03 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

@Book{Ellis:1990:ACR,
  author =       "Margaret A. Ellis and Bjarne Stroustrup",
  title =        "The Annotated {C++} Reference Manual",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "x + 447",
  year =         "1990",
  ISBN =         "0-201-51459-1 (hardcover)",
  ISBN-13 =      "978-0-201-51459-9 (hardcover)",
  LCCN =         "QA76.73.C153 E35 1990",
  bibdate =      "Tue Dec 14 22:47:56 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Lexical conventions \\
                 Basic concepts \\
                 Standard conversions \\
                 Expressions \\
                 Statements \\
                 Declarations \\
                 Declarators \\
                 Classes \\
                 Derived classes \\
                 Member access control \\
                 Special member functions \\
                 Overloading \\
                 Templates \\
                 Exception handling \\
                 Preprocessing \\
                 Grammar summary \\
                 Compatibility",
}

@Book{Ellis:1990:FPI,
  author =       "T. M. R. Ellis",
  title =        "{Fortran 77} Programming: With an Introduction to
                 {Fortran 90 Standard}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Second",
  pages =        "xxi + 641",
  year =         "1990",
  ISBN =         "0-201-41638-7 (paperback)",
  ISBN-13 =      "978-0-201-41638-1 (paperback)",
  LCCN =         "QA76.73.F25 E43 1990",
  bibdate =      "Mon Jan 3 11:48:52 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ansistd.bib;
                 https://www.math.utah.edu/pub/tex/bib/fortran3.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Rev. ed. of: A structured approach to FORTRAN 77
                 programming.",
  price =        "US\$38.75",
  series =       "International Computer Science Series",
  URL =          "http://www.cbooks.com/sqlnut/SP/search/gtsumt?source=&isbn=0-201-41638-7",
  acknowledgement = ack-nhfb,
  dimensions =   "9.10in x 7.48in x 1.42in",
  keywords =     "Computer systems --- Structured programming ---
                 Programming; Fortran 77 (computer program language);
                 Fortran 90 (computer program language); languages:
                 Fortran 77 language; Structured programming; {Fortran}
                 (Computer program language)",
  paperback =    "yes",
  tableofcontents = "Introduction, Fundamental principles \\
                 A simple program \\
                 Arithmetic, expressions and assignment \\
                 Procedures and structure plan \\
                 Loop \\
                 Array \\
                 Decision \\
                 Other types of loop \\
                 Simple input/output facilities \\
                 Keeping data in file \\
                 Developing and testing programs \\
                 Towards real programs: An intro to numerical methods in
                 Fortran 77 programs \\
                 Character handling \\
                 Other data types \\
                 More about arrays \\
                 Global data \\
                 More about procedures \\
                 More about formats and file-handling \\
                 More about numerical methods \\
                 Obsolete and little used features of Fortran 77 \\
                 Looking to the future: An outline of the next standard
                 Fortran language Fortran 90 \\
                 Seven golden rules \\
                 Appendices",
}

@Book{Emling:2012:MCH,
  author =       "Shelley Emling",
  title =        "{Marie Curie} and her daughters: the private lives of
                 science's first family",
  publisher =    "Palgrave Macmillan",
  address =      "New York, NY, USA",
  pages =        "xx + 219 + 8",
  year =         "2012",
  ISBN =         "0-230-11571-3 (hardback)",
  ISBN-13 =      "978-0-230-11571-2 (hardback)",
  LCCN =         "QD22.C8 E46 2012",
  bibdate =      "Sat Jan 5 06:22:11 MST 2013",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "Marie Curie was the first person to be honored by two
                 Nobel Prizes and she pioneered the use of radiation
                 therapy for cancer patients. But she was also a mother,
                 widowed young, who raised two extraordinary daughters
                 alone: Irene, a Nobel Prize winning chemist in her own
                 right, who played an important role in the development
                 of the atomic bomb, and Eve, a highly regarded
                 humanitarian and journalist, who fought alongside the
                 French Resistance during WW II. As a woman fighting to
                 succeed in a male dominated profession and a Polish
                 immigrant caught in a xenophobic society, she had to
                 find ways to support her research. Drawing on personal
                 interviews with Curie's descendents, as well as
                 revelatory new archives, this is a wholly new story
                 about Marie Curie--and a family of women inextricably
                 connected to the dawn of nuclear physics",
  acknowledgement = ack-nhfb,
  subject =      "Curie, Marie; Family; Joliot-Curie, Ir\`ene; Curie,
                 Eve; Women scientists; Family relationships; Mothers
                 and daughters; Women chemists; Biography; Women
                 philanthropists; Women journalists; Science / History;
                 Biography and Autobiography / Science and Technology;
                 History / Europe / France",
  subject-dates = "1867--1934; 1867--1934; 1897--1956; 1904--2007",
  tableofcontents = "Prologue \\
                 An Absolutely Miserable Year \\
                 Moving On \\
                 Meeting Missy \\
                 Finally, America \\
                 The White House \\
                 New and Improved \\
                 Another Dynamic Duo \\
                 Turning to America--Again \\
                 Into the Spotlight \\
                 The End Of A Quest \\
                 Tributes and New Causes \\
                 All About Eve \\
                 The Ravages Of Another World War \\
                 Rough Waters \\
                 The Legacy",
}

@Book{Enderle:1984:CGP,
  author =       "G. Enderle and K. Kansy and G. Pfaff",
  title =        "Computer Graphics Programming. {GKS}: The Graphics
                 Standard",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xvi + 542",
  year =         "1984",
  ISBN =         "0-387-11525-0 (New York), 3-540-11525-0 (Berlin)",
  ISBN-13 =      "978-0-387-11525-2 (New York), 978-3-540-11525-0
                 (Berlin)",
  LCCN =         "T385 .E531 1984",
  bibdate =      "Wed May 01 09:12:36 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Symbolic Computation, Editor: J. Encarna{\c{c}}{\~a}o
                 and P. Hayes",
  abstract =     "For several years the authors of this book have been
                 involved in the design and the national and
                 international review of the forthcoming graphical
                 standard. When the end of this process could be
                 foreseen and the International Standard ``Graphical
                 Kernel System'' (GKS) was cast into its. final form,
                 the urgent need arose for detailed information to the
                 graphics community about this standard and for the
                 education of graphics programmers. One major goal of
                 GKS, besides the portability of graphical application
                 programs and the device independence, is ``programmer
                 portability'' by establishing a common base for
                 training of graphics programmers. Having accompanied
                 the path of GKS from the very early stages of defining
                 the basic concepts and designing its first versions up
                 to the final draft of the International Standard, we
                 felt it worthwhile to start the venture of a text book
                 on computer graphics programming based on GKS. This
                 book is aimed, at one hand, at graphics users, experts
                 and managers who want to get an overview of the new
                 standard and a better understanding of its concepts. On
                 the other hand, it addresses the graphics programmers
                 who want to use GKS for realizing their graphical
                 applications. It can serve as the base for teaching and
                 studying functions, concepts and methods of GKS.
                 Additionally, it will be a valuable source of
                 information for implementors of GKS.",
  acknowledgement = ack-nhfb,
  tableofcontents = "I: Introduction to Computer Graphics Based on GKS
                 \\
                 1 What is Computer Graphics? \\
                 2 Intention and Contents of Part I \\
                 3 The Computer Graphics User \\
                 4 Interfaces of the Graphical Kernel System \\
                 5 Principles and Goals of the Graphical Kernel System
                 \\
                 6 Main Concepts of the Graphical Kernel System \\
                 7 Creating Graphical Output \\
                 8 Coordinate Systems and Transformations \\
                 9 The Graphical Workstation \\
                 10 Input \\
                 11 Segments \\
                 12 The GKS Metafile \\
                 13 States and State Lists \\
                 14 Error Handling \\
                 II: The Process of Generating a Standard \\
                 1 The Evolution of Computer Graphics \\
                 2 Committees, People and Events \\
                 3 GKS Review: Issues and Their Solution \\
                 III: Graphics Kernel System Programming \\
                 1 Format and Structure of Part III \\
                 2 Levels \\
                 3 States and State Lists \\
                 4 Workstations \\
                 5 Transformations \\
                 6 Output Primitives \\
                 7 Segments \\
                 8 Input \\
                 9 Error Handling \\
                 10 Inquiry Functions \\
                 11 Metafile Interface \\
                 IV: The GKS Environment \\
                 1 Mapping of Output Primitives and Attributes on
                 Physical Workstations \\
                 2 The Mapping of Logical to Physical Input Devices \\
                 3 Implementation Aspects \\
                 4 Language Interfaces and Their Implementation \\
                 5 Interfaces to Graphics Devices \\
                 6 Metafiles \\
                 7 Certification/Validation of GKS \\
                 8 Terminology \\
                 9 3D Extensions to GKS \\
                 Appendix 1: GKS Metafile Format \\
                 1.1 Status of the Metafile Definition \\
                 1.2 File Format and Data Format \\
                 1.3 Generation and Interpretation of Metafile \\
                 1.4 Control Items \\
                 1.5 Items for Output Primitives \\
                 1.6 Items for Output Primitive Attributes \\
                 1.7 Items for Workstation Attributes \\
                 1.8 Item for Clipping Rectangle \\
                 1.9 Items for Workstation Transformation \\
                 1.10 Items for Segment Manipulation \\
                 1.11 Items for Segment Attributes \\
                 1.12 User Items \\
                 Appendix 2: Vocabulary \\
                 References",
}

@Book{Enderle:1987:CGP,
  author =       "G. Enderle and K. Kansy and G. Pfaff",
  title =        "Computer Graphics Programming. {GKS}: The Graphics
                 Standard",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Second",
  pages =        "xxiii + 651",
  year =         "1987",
  ISBN =         "3-540-16317-4 (Berlin), 0-387-16317-4 (New York)",
  ISBN-13 =      "978-3-540-16317-6 (Berlin), 978-0-387-16317-8 (New
                 York)",
  LCCN =         "T385 .E531 1987",
  bibdate =      "Wed May 01 09:13:10 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Symbolic Computation, Editor: J. Encarna{\c{c}}{\~a}o
                 and P. Hayes",
  acknowledgement = ack-nhfb,
}

@Book{England:1987:SUG,
  author =       "D. England",
  title =        "A Sun User's Guide",
  publisher =    pub-MACMILLAN-EDUCATION,
  address =      pub-MACMILLAN-EDUCATION:adr,
  pages =        "viii + 220",
  year =         "1987",
  ISBN =         "0-333-44849-9",
  ISBN-13 =      "978-0-333-44849-6",
  LCCN =         "QA76.8.S9 S85 1987",
  bibdate =      "Tue Dec 14 22:48:00 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Macmillan Computer Science Series, Editor: F. H.
                 Sumner",
  acknowledgement = ack-nhfb,
}

@Book{Essinger:2004:JWH,
  author =       "James Essinger",
  title =        "{Jacquard}'s Web: How a Hand-Loom Led to the Birth of
                 the Information Age",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  pages =        "xi + 302",
  year =         "2004",
  ISBN =         "0-19-280577-0",
  ISBN-13 =      "978-0-19-280577-5",
  LCCN =         "QA76.17 .E88 2004",
  bibdate =      "Sun Feb 3 11:24:21 MST 2013",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/adabooks.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.bibsys.no:2100/BIBSYS;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0620/2004276200-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0620/2004276200-t.html",
  abstract =     "Jacquard's Web is the story of some of the most
                 ingenious inventors the world has ever known, a
                 fascinating account of how a hand-loom invented in
                 Napoleonic France led to the development of the modern
                 information age. James Essinger, a master story-teller,
                 shows through a series of remarkable and meticulously
                 researched historical connections (spanning two
                 centuries and never investigated before) that the
                 Jacquard loom kick-started a process of scientific
                 evolution which would lead directly to the development
                 of the modern computer. The invention of Jacquard's
                 loom in 1804 enabled the master silk-weavers of Lyons
                 to weave fabrics 25 times faster than had previously
                 been possible. The device used punched cards, which
                 stored instructions for weaving whatever pattern or
                 design was required; it proved an outstanding success.
                 These cards can very reasonably be described as the
                 world's first computer programmes. In this engaging and
                 delightful book, James Essinger reveals a plethora of
                 extraordinary links between the nineteenth-century
                 world of weaving and today's computer age: to give just
                 one example, modern computer graphics displays are
                 based on exactly the same principles as those employed
                 in Jacquard's special woven tableaux. Jacquard's Web
                 also introduces some of the most colourful and
                 interesting characters in the history of science and
                 technology: the modest but exceptionally dedicated
                 Jacquard himself, the brilliant but temperamental
                 Victorian polymath Charles Babbage, who dreamt of a
                 cogwheel computer operated using Jacquard cards, and
                 the imaginative and perceptive Ada Lovelace, Lord
                 Byron's only legitimate daughter.",
  acknowledgement = ack-nhfb,
  subject =      "Babbage, Charles; Jacquard, Joseph Marie; hullkort;
                 punched cards; computers; history; Jacquard knitting
                 machines; information technology",
  tableofcontents = "Acknowledgements \\
                 1. The engraving that wasn't \\
                 2. A better mouse-trap \\
                 3. The son of a master weaver \\
                 4. The Emperor's new clothes \\
                 5. From weaving to computing \\
                 6. The difference engine \\
                 7. The analytical engine \\
                 8. A question of faith and funding \\
                 9. The lady who loved the Jacquard loom \\
                 10. A crisis with the American census \\
                 11. The first Jacquard looms that wove information \\
                 12. The birth of IBM \\
                 13. The Thomas Watson phenomenon \\
                 14. Howard Aiken dreams of a computer \\
                 15. IBM and the Harvard Mark 1 \\
                 16. Weaving at the speed of light \\
                 17. The future \\
                 Index",
}

@Book{Esterson:2019:EWR,
  author =       "Allen Esterson and David C. Cassidy and Ruth Lewin
                 Sime",
  title =        "{Einstein}'s wife: the real story of {Mileva
                 Einstein-Mari{\'c}}",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "xxi + 313",
  year =         "2019",
  ISBN =         "0-262-03961-3 (hardcover), 0-262-53897-0 (paperback)",
  ISBN-13 =      "978-0-262-03961-1 (hardcover), 978-0-262-53897-8
                 (paperback)",
  LCCN =         "QC16.E52 E88 2019",
  bibdate =      "Thu May 23 10:15:05 MDT 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",
  abstract =     "Albert Einstein's first wife, Mileva
                 Einstein-Mari{\'c}, was forgotten for decades. When a
                 trove of correspondence between them beginning in their
                 student days was discovered in 1986, her story began to
                 be told. Some of the tellers of the ``Mileva Story''
                 made startling claims: that she was a brilliant
                 mathematician who surpassed her husband, and that she
                 made uncredited contributions to his most celebrated
                 papers in 1905, including his paper on special
                 relativity. This book, based on extensive historical
                 research, uncovers the real ``Mileva Story.'' Mileva
                 was one of the few women of her era to pursue higher
                 education in science; she and Einstein were students
                 together at the Zurich Polytechnic. Mileva's ambitions
                 for a science career, however, suffered a series of
                 setbacks --- failed diploma examinations, a
                 disagreement with her doctoral dissertation adviser, an
                 out-of-wedlock pregnancy by Einstein. She and Einstein
                 married in 1903 and had two sons, but the marriage
                 failed. Was Mileva her husband's uncredited coauthor,
                 unpaid assistant, or his essential helpmeet? It's
                 tempting to believe that she was her husband's secret
                 collaborator, but the authors of \booktitle{Einstein's
                 Wife} look at the actual evidence, and a chapter by
                 Ruth Lewin Sime offers important historical context.
                 The story they tell is that of a brave and determined
                 young woman who struggled against a variety of
                 obstacles at a time when science was not very welcoming
                 to women.",
  acknowledgement = ack-nhfb,
  author-dates = "1936--",
  subject =      "Einstein-Mari{\'c}, Mileva; Einstein, Albert;
                 Marriage; Family; Women mathematicians; Biography;
                 Serbia; Germany; Mathematicians",
  subject-dates = "Mileva Mari{\'c} (1875--1948); Albert Einstein
                 (1879--1955)",
  tableofcontents = "Acknowledgments / vii \\
                 Abbreviations / ix \\
                 Introduction / xi \\
                 I: Mileva and Albert / David C. Cassidy / 1 \\
                 1: Two Trajectories / 3 \\
                 2: The Zurich Polytechnic / 23 \\
                 3: An unsuccessful marriage / 65 \\
                 II: Women in science / Ruth Lewin Sime / 89 \\
                 4: Women in science: struggle and success / 91 \\
                 III: Examining the Mileva story / Allen Esterson / 99
                 \\
                 5: The story begins / 101 \\
                 6: The story emerges / 111 \\
                 7: Collaboration as students / 139 \\
                 8: Collaboration during their marriage / 161 \\
                 9: The story spreads / 201 \\
                 10: The story continues / 237 \\
                 11: The story concludes / 263 \\
                 Appendix A: Mari{\'c}'s Pre-Polytechnic Grades / 269
                 \\
                 Appendix B: Einstein's Pre-Polytechnic Grades / 271 \\
                 Appendix C: Semester Grades for Einstein and Mari{\'c}
                 at the Zurich Polytechnic / 273 \\
                 Appendix D: Grades on the Intermediate and Diploma
                 Exams / 275 \\
                 Appendix E: Grades on Leaving Certificates / 277 \\
                 Notes / 279 \\
                 Bibliography / 287 \\
                 Index / 303",
}

@Book{Estrada:1993:CI,
  author =       "Susan Estrada",
  title =        "Connecting to the Internet",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xv + 170",
  month =        aug,
  year =         "1993",
  ISBN =         "1-56592-061-9",
  ISBN-13 =      "978-1-56592-061-3",
  LCCN =         "TK 5105.875 I57 E82c 1993",
  bibdate =      "Thu Dec 9 18:37:47 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$15.95",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

@Book{Ethier:2007:OPM,
  editor =       "Stewart N. Ethier and William R. Eadington",
  title =        "Optimal Play: Mathematical Studies of Games and
                 Gambling",
  publisher =    "Institute for the Study of Gambling and Commercial
                 Gaming",
  address =      "Reno, NV, USA",
  pages =        "xxvi + 550",
  year =         "2007",
  ISBN =         "0-9796873-0-6",
  ISBN-13 =      "978-0-9796873-0-3",
  LCCN =         "QA273 .O685 2007",
  bibdate =      "Mon Dec 3 15:45:33 MST 2007",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/beebe-nelson-h-f.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  remark =       "NHFB provided technical advice for this volume.",
}

@Book{Ethier:2010:DCP,
  author =       "Stewart N. Ethier",
  title =        "The Doctrine of Chances: Probabilistic Aspects of
                 Gambling",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xiv + 816",
  year =         "2010",
  DOI =          "https://doi.org/10.1007/978-3-540-78783-9",
  ISBN =         "3-540-78782-8 (hardcover), 3-540-78783-6",
  ISBN-13 =      "978-3-540-78782-2 (hardcover), 978-3-540-78783-9",
  LCCN =         "QA271 .E84 2010",
  bibdate =      "Fri Mar 24 16:40:59 MDT 2017",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/beebe-nelson-h-f.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Probability and its applications",
  abstract =     "Three centuries ago Montmort and De Moivre published
                 two of the first books on probability theory, then
                 called the doctrine of chances, emphasizing its most
                 important application at that time, games of chance.
                 This volume, on the probabilistic aspects of gambling,
                 is a modern version of those classics. While covering
                 the classical material such as house advantage and
                 gambler's ruin, it also takes up such 20th-century
                 topics as martingales, Markov chains, game theory, bold
                 play, and optimal proportional play. In addition there
                 is extensive coverage of specific casino games such as
                 roulette, craps, video poker, baccarat, and twenty-one.
                 The volume addresses researchers and graduate students
                 in probability theory, stochastic processes, game
                 theory, operations research, statistics but it is also
                 accessible to undergraduate students, who have had a
                 course in probability.",
  acknowledgement = ack-nhfb,
  author-dates = "1948--",
  remark =       "NHFB provided bibliographic support and technical
                 advice for this volume.",
  subject =      "Games of chance (Mathematics); Gambling systems",
  tableofcontents = "Preface / v \\
                 List of Notation / xiii \\
                 Part I Theory \\
                 1 Review of Probability / 3 \\
                 1.1 Combinatorics and Probability / 3 \\
                 1.2 Independence and Conditional Probability / 15 \\
                 1.3 Random Variables and Random Vectors / 21 \\
                 1.4 Expectation and Variance / 27 \\
                 1.5 Law of Large Numbers and Central Limit Theorem / 42
                 \\
                 1.6 Problems / 52 \\
                 1.7 Notes / 64 \\
                 2 Conditional Expectation / 75 \\
                 2.1 Conditioning on an Event / 75 \\
                 2.2 Conditioning on a Random Vector / 79 \\
                 2.3 Problems / 88 \\
                 2.4 Notes / 92 \\
                 3 Martingales / 95 \\
                 3.1 Definitions and Examples / 95 \\
                 3.2 Optional Stopping Theorem / 99 \\
                 3.3 Martingale Convergence Theorem / 106 \\
                 3.4 Problems / 111 \\
                 3.5 Notes / 115 \\
                 4 Markov Chains / 119 \\
                 4.1 Definitions and Examples / 119 \\
                 4.2 Transience and Recurrence / 127 \\
                 4.3 Asymptotic Behavior / 136 \\
                 4.4 Renewal Theorem / 115 \\
                 4.5 Problems / 150 \\
                 4.6 Note / 157 \\
                 5 Game Theory / 159 \\
                 5.1 Matrix Games / 150 \\
                 5.2 Minimax Theorem / 171 \\
                 5.3 Utility Theory / 185 \\
                 5.4 Problems / 103 \\
                 5.5 Notes / 107 \\
                 6 House Advantage / 100 \\
                 6.1 A Single Wager / 100 \\
                 6.2 Composite Wagers / 219 \\
                 6.3 Volatility / 225 \\
                 6.4 Problems / 231 \\
                 6.5 Notes / 236 \\
                 7 Gambler's Ruin / 241 7.1 Even-Money Payoffs / 211 \\
                 7.2 Integer Payoffs / 252 \\
                 7.3 Arbitrary Payoffs / 250 \\
                 7.4 Problems / 267 \\
                 7.5 Notes / 271 \\
                 8 Betting Systems / 275 \\
                 8.1 Examples / 275 \\
                 8.2 Conservation of Fairness / 208 \\
                 8.3 Problems / 305 \\
                 8.4 Notes / 311 \\
                 9 Bold Play / 317 \\
                 9.1 Red-and-Black / 317 \\
                 9.2 Red-and-Black with a House Limit / 330 \\
                 9.3 Primitive Casinos / 338 \\
                 9.4 Problems / 350 \\
                 9.5 Notes / 355 \\
                 10 Optimal Proportional Play / 357 \\
                 10.1 A Single Wager / 357 \\
                 10.2 Simultaneous Wagers / 363 \\
                 10.3 Optimality Properties / 371 \\
                 10.4 Problems / 384 \\
                 10.5 Notes / 388 \\
                 11 Card Theory / 391 \\
                 11.1 Shuffling / 391 \\
                 11.2 Dealing / 400 \\
                 11.3 Card Counting / 408 \\
                 11.4 Problems / 421 \\
                 11.5 Notes / 424 \\
                 Part II Applications \\
                 12 Slot Machines / 429 \\
                 12.1 Expected Payout / 429 \\
                 12.2 Volatility and Ruin / 441 \\
                 12.3 Problems / 450 \\
                 12.4 Notes / 455 \\
                 13 Roulette / 461 \\
                 13.1 Unbiased Wheels / 461 \\
                 13.2 Biased Wheels / 469 \\
                 13.3 Problems / 474 \\
                 13.4 Notes / 477 \\
                 14 Keno / 483 \\
                 14.1 The m-Spot Ticket / 483 \\
                 14.2 Way Tickets / 489 \\
                 14.3 Problems / 493 \\
                 14.4 Notes / 496 \\
                 15 Craps / 501 \\
                 15.1 Line Bets and Free Odds / 501 \\
                 15.2 The Shooter's Hand / 505 \\
                 15.3 Problems / 513 \\
                 15.4 Notes / 517 \\
                 16 House-Banked Poker / 525 \\
                 16.1 Let It Ride / 525 \\
                 16.2 Three Card Poker / 534 \\
                 16.3 Problems / 539 \\
                 16.4 Notes / 542 \\
                 17 Video Poker / 545 \\
                 17.1 Jacks or Better / 545 \\
                 17.2 Deuces Wild / 553 \\
                 17.3 Problems / 566 \\
                 17.4 Notes / 570 \\
                 18 Faro / 573 \\
                 18.1 The Denomination Bet / 573 \\
                 18.2 Prom Soda to Hock / 578 \\
                 18.3 Problems / 586 \\
                 18.4 Notes / 589 \\
                 19 Baccarat / 597 \\
                 19.1 Player vs. Banker / 597 \\
                 19.2 Card Counting / 605 \\
                 19.3 Problems / 608 \\
                 19.4 Notes / 613 \\
                 20 Trente et Quarante / 623 \\
                 20.1 Red, Black, Color, Inverse / 623 \\
                 20.2 Card Counting / 628 \\
                 20.3 Problems / 634 \\
                 20.4 Notes / 637 \\
                 21 Twenty-One / 643 \\
                 21.1 Rules / 643 \\
                 21.2 Basic Strategy / 650 \\
                 21.3 Card Counting / 663 \\
                 21.4 Problems / 670 \\
                 21.5 Notes / 676 \\
                 22 Poker / 689 \\
                 22.1 Rules and Pot Odds / 689 \\
                 22.2 Poker Models and Game Theory / 694 \\
                 22.3 Texas Hold'em / 704 \\
                 22.4 Problems / 725 \\
                 22.5 Notes / 731 \\
                 A Results Cited / 745 \\
                 A.I Algebra and Number Theory / 745 \\
                 A.2 Analysis and Probability / 747 \\
                 Bibliography / 751 \\
                 Index / 783",
}

@Book{Etter:1987:SFE,
  author =       "D. M. Etter",
  title =        "Structured {FORTRAN} 77 for engineers and scientists",
  publisher =    pub-BENCUM,
  address =      pub-BENCUM:adr,
  edition =      "Second",
  pages =        "xxi + 519",
  year =         "1987",
  ISBN =         "0-8053-2495-X (paperback)",
  ISBN-13 =      "978-0-8053-2495-2 (paperback)",
  LCCN =         "QA76.73.F25 E85 1987",
  bibdate =      "Sat Jan 27 13:40:57 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  keywords =     "Structured programming; {Fortran} 77 (Computer program
                 language)",
}

@Book{Etter:1993:SFE,
  author =       "Delores M. Etter",
  title =        "Structured {Fortran 77} for Engineers and Scientists",
  publisher =    pub-BENCUM,
  address =      pub-BENCUM:adr,
  edition =      "Fourth",
  pages =        "xxiii + 616",
  year =         "1993",
  ISBN =         "0-8053-1775-9",
  ISBN-13 =      "978-0-8053-1775-6",
  LCCN =         "QA76.73.F25 E85 1993",
  bibdate =      "Sun Sep 28 10:42:07 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fortran3.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  dimensions =   "9.11in x 7.37in x 0.97in",
  keywords =     "computer programming; Computer programming; Fortran 77
                 (computer program language); Fortran 77 (Computer
                 program language)",
  libnote =      "Not yet in my library.",
  paperback =    "yes",
  tableofcontents = "1: An Introduction to Problem Solving with FORTRAN
                 77 / 1 \\
                 2: Arithmetic Computations / 25 \\
                 3: Control Structures / 91 \\
                 4: Engineering and Scientific Data Files / 165 \\
                 5: Array Processing / 203 \\
                 6: Function Subprograms / 259 \\
                 7: Subroutine Subprograms / 323 \\
                 8: Additional Data Types / 371 \\
                 9: Additional File Handling / 423 \\
                 10: Numerical Applications / 465 \\
                 11: The New Fortran 90 Standard / 517 \\
                 Appendix A: FORTRAN 77 Intrinsic Functions / 537 \\
                 Appendix B: Additional FORTRAN 77 Topics / 541 \\
                 Appendix C: Plotting Data Files with MATLAB and Lotus
                 1-2-3 / 552 \\
                 Glossary of Key Words / 558 \\
                 Answers to Self-Tests / 566 \\
                 Answers to Selected Problems / 578 \\
                 Index / 609",
}

@Book{Evans:2003:IAP,
  author =       "James S. Evans and Gregory L. Trimper",
  title =        "{Itanium} Architecture for Programmers: Understanding
                 64-bit Processors and {EPIC} Principles",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xxxiv + 529",
  year =         "2003",
  ISBN =         "0-13-101372-6",
  ISBN-13 =      "978-0-13-101372-8",
  LCCN =         "QA76.8.I83 E83 2003",
  bibdate =      "Wed Aug 20 08:55:32 MDT 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Step-by-step guide to assembly language for the 64-bit
                 Itanium processors, with extensive examples Details of
                 Explicitly Parallel Instruction Computing (EPIC):
                 Instruction set, addressing, register stack engine,
                 predication, I/O, procedure calls, floating-point
                 operations, and more Learn how to comprehend and
                 optimize open source, Intel, and HP-UX compiler output
                 Understand the full power of 64-bit Itanium EPIC
                 processors Itanium Architecture for Programmers is a
                 comprehensive introduction to the breakthrough
                 capabilities of the new 64-bit Itanium architecture.
                 Using standard command-line tools and extensive
                 examples, the authors illuminate the Itanium design
                 within the broader context of contemporary computer
                 architecture via a step-by-step investigation of
                 Itanium assembly language. Coverage includes: The
                 potential of Explicitly Parallel Instruction Computing
                 (EPIC) Itanium instruction formats and addressing modes
                 Innovations such as the register stack engine (RSE) and
                 extensive predication Procedure calls and
                 procedure-calling mechanisms Floating-point operations
                 I/O techniques, from simple debugging to the use of
                 files Optimization of output from open source, Intel,
                 and HP-UX compilers An essential resource for both
                 computing professionals and students of architecture or
                 assembly language, Itanium Architecture for Programmers
                 includes extensive printed and Web-based references,
                 plus many numeric, essay, and programming exercises for
                 each chapter.",
  acknowledgement = ack-nhfb,
  keywords =     "Itanium (microprocessor)",
  tableofcontents = "1. Architecture and Implementation \\
                 2. Computer Structures and Data Representations \\
                 3. The Program Assembler and Debugger \\
                 4. Itanium Instruction Formats and Addressing \\
                 5. Comparison, Branches, and Predication \\
                 6. Logical Operations, Bit-Shifts, and Bytes \\
                 7. Subroutines, Procedures, and Functions \\
                 8. Floating-Point Operations \\
                 9. Input and Output of Text \\
                 10. Performance Considerations \\
                 11. Looking at Output from Compilers \\
                 12. Parallel Operations \\
                 13. Variations Among Implementations \\
                 Appendix A: Command-Line Environments \\
                 Appendix C: Itanium Instruction Set \\
                 Appendix D: Itanium Registers and Their Uses \\
                 Appendix E: Conditional Assembly and Macros (GCC
                 Assembler) \\
                 Appendix F: Inline Assembly",
}

@Book{Everett:1965:TC,
  author =       "D. H. Everett",
  title =        "Thermodynamique Chimique",
  publisher =    pub-DUNOD,
  address =      pub-DUNOD:adr,
  pages =        "xix + 252",
  year =         "1965",
  LCCN =         "????",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "French translation by R. P{\^a}ris of original English
                 edition.",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Eves:1983:IHM,
  author =       "Howard Eves",
  title =        "An Introduction to the History of Mathematics",
  publisher =    "Saunders College Publishing",
  address =      "Philadelphia, PA, USA",
  pages =        "xviii + 593",
  year =         "1983",
  ISBN =         "0-03-062064-3",
  ISBN-13 =      "978-0-03-062064-5",
  LCCN =         "QA21.E8",
  bibdate =      "Sat Apr 27 15:49:51 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Rescued and inherited from INSCC discarded books
                 pile.",
  shorttableofcontents = "1: Numeral systems \\
                 2: Babylonian and Egyptian mathematics \\
                 3: Pythagorean mathematics \\
                 4: Duplication, trisection, and quadrature \\
                 5: Euclid and his elements \\
                 6: Greek mathematics after Euclid \\
                 7: Chinese, Hindu, and Arabian mathematics \\
                 8: European mathematics, 500 to 1600 \\
                 9: The dawn of modern mathematics \\
                 10: Analytical geometry and other precalculus
                 developments \\
                 11: The calculus and related concepts \\
                 12: The eighteenth century and the exploitation of the
                 calculus \\
                 13: The early nineteenth century and the liberation of
                 geometry and algebra \\
                 14: The later nineteenth century ad the arithmetization
                 of analysis \\
                 15: Abstraction and the transition into the twentieth
                 century \\
                 Essay Topics \\
                 Bibliography \\
                 General Bibliography \\
                 A Chronological Table \\
                 Answers and Suggestions for the Solution of the Problem
                 Studies \\
                 Index",
  subject =      "Mathematics; History; Math{\'e}matiques; Histoire;
                 Mathematics; Geschichte; Mathematik",
  tableofcontents = "Preface / v \\
                 Introduction / xvi \\
                 Before the Seventeenth Century / 1 \\
                 Numeral Systems / 2 \\
                 1-1 Primitive Counting \\
                 1-2 Number Bases \\
                 1-3 Written Number Systems \\
                 1-4 Simple Grouping Systems \\
                 1-5 Multiplicative Grouping Systems \\
                 1-6 Ciphered Numeral Systems \\
                 1-7 Positional Numeral Systems \\
                 1-8 Early Computing \\
                 1-9 The Hindu-Arabic Numeral System \\
                 1-10 Arbitrary Bases \\
                 Problem Studies / 16 \\
                 1.1 Number Words \\
                 1.2 Written Numbers \\
                 1.3 Alphabetic Greek Numeral System \\
                 1.4 Old and Hypothetical Numeral Systems \\
                 1.5 Finger Numbers \\
                 1.6 Radix Fractions \\
                 1.7 Arithmetic in Other Scales \\
                 1.8 Problems in Scales of Notation \\
                 1.9 Some Recreational Aspects of the Binary Scale \\
                 1.10 Some Number Tricks \\
                 Essay Topics / 20 \\
                 Bibliography / 20 \\
                 Babylonian and Egyptian Mathematics / 22 \\
                 2-1 The Ancient Orient \\
                 Babylonia: \\
                 2-2 Sources \\
                 2-3 Commercial and Agrarian Mathematics \\
                 2-4 Geometry \\
                 2-5 Algebra \\
                 2-6 Plimpton 322 \\
                 Egypt: \\
                 2-7 Sources and Dates \\
                 2-8 Arithmetic and Algebra \\
                 2-9 Geometry \\
                 2-10 A Curious Problem in the Rhind Papyrus \\
                 Problem Studies / 36 \\
                 2.1 Regular Numbers \\
                 2.2 Compound Interest \\
                 2.3 Quadratic Equations \\
                 2.4 Algebraic Geometry \\
                 2.5 The Susa Tablets \\
                 2.6 Cubics \\
                 2.7 Square Root Approximations \\
                 2.8 Duplation and Mediation \\
                 2.9 Unit Fractions \\
                 2.10 The Sylvester Process \\
                 2.11 The Seqt of a Pyramid \\
                 2.12 Egyptian Algebra \\
                 2.13 Egyptian Geometry \\
                 2.14 The Greatest Egyptian Pyramid \\
                 2.15 Some Problems from the Moscow Papyrus \\
                 2.16 The 3, 4, 5 Triangle \\
                 Essay Topics / 43 \\
                 Bibliography / 44 \\
                 Three: Pythagorean Mathematics / 45 \\
                 3-1 Birth of Demonstrative Mathematics \\
                 3-2 Pythagoras and the Pythagoreans \\
                 3-3 Pythagorean Arithmetic \\
                 3-4 Pythagorean Theorem and Pythagorean Triples \\
                 3-5 Discovery of Irrational Magnitudes \\
                 3-6 Algebraic Identities \\
                 3-7 Geometric Solution of Quadratic Equations \\
                 3-8 Transformation of Areas \\
                 3-9 The Regular Solids \\
                 3-10 Postulational Thinking \\
                 Problem Studies / 64 \\
                 3.1 The Practical Problems of Thales \\
                 3.2 Perfect and Amicable Numbers \\
                 3.3 Figurate Numbers \\
                 3.4 Means \\
                 3.5 Dissection Proofs of the Pythagorean Theorem \\
                 3.6 Pythagorean Triples \\
                 3.7 Irrational Numbers \\
                 3.8 Algebraic Identities \\
                 3.9 Geometric Algebra \\
                 3.10 Geometric Solution of Quadratic Equations \\
                 3.11 Transformation of Areas \\
                 3.12 Regular Solids \\
                 3.13 Some Problems Concerning the Regular Solids \\
                 3.14 Golden Section \\
                 3.15 An Interesting Relation \\
                 Essay Topics / 72 \\
                 Bibliography / 72 \\
                 Four: Duplication, Trisection, and Quadrature / 74 \\
                 4-1 The Period from Thales to Euclid \\
                 4-2 Lines of Mathematical Development \\
                 4-3 The Three Famous Problems \\
                 4-4 The Euclidean Tools \\
                 4-5 Duplication of the Cube \\
                 4-6 Trisection of an Angle \\
                 4-7 Quadrature of the Circle \\
                 4-8 A Chronology of $\pi$ \\
                 Problem Studies / 90 \\
                 4.1 Euclidean and Modern Compasses \\
                 4.2 Duplication by Archytas and Menaechmus \\
                 4.3 Duplication by Apollonius and Eratosthenes \\
                 4.4 The Cissoid of Diodes \\
                 4.5 Some Seventeenth-Century Duplications \\
                 4-6 Applications of the Insertion Principle \\
                 4.7 The Conchoid of Nicomedes \\
                 4.8 Trisection by Conics \\
                 4.9 Asymptotic Euclidean Constructions \\
                 4.10 The Quadratrix \\
                 4.11 Approximate Rectification \\
                 4.12 Lunes of Hippocrates \\
                 4.13 Computation of $\pi$ \\
                 4.14 The Snell Refinement \\
                 4.15 Mnemonics for $\pi$ \\
                 Essay Topics / 98 \\
                 Bibliography / 98 \\
                 Five: Euclid and His Elements / 100 \\
                 5-1 Alexandria \\
                 5-2 Euclid \\
                 5-3 Euclid's ``Elements'' \\
                 5-4 Content of the ``Elements'' \\
                 5-5 The Theory of Proportion \\
                 5-6 Regular Polygons \\
                 5-7 Formal Aspect of the ``Elements'' \\
                 5-8 Euclid's Other Works \\
                 Problem Studies / 113 \\
                 5.1 The Euclidean Algorithm \\
                 5.2 Applications of the Euclidean Algorithm \\
                 5.3 The Pythagorean Theorem \\
                 5.4 Euclid's Book II \\
                 5.5 Applications of the Fundamental Theorem of
                 Arithmetic \\
                 5.6 The Eudoxian Theory of Proportion \\
                 5.7 Regular Polygons \\
                 5.8 The Angle-Sum of a Triangle \\
                 5.9 A Deductive Sequence Concerning Areas \\
                 5.10 A Deductive Sequence Concerning Angles \\
                 5-11 Elements \\
                 5.12 Data \\
                 5.13 Constructions Employing Data \\
                 5.14 Divisions \\
                 Essay Topics / 119 \\
                 Bibliography / 119 \\
                 Greek Mathematics After Euclid / 121 \\
                 6-1 Historical Setting \\
                 6-2 Archimedes \\
                 6-3 Eratosthenes \\
                 6-4 Apollonius \\
                 6-5 Hipparchus, Menelaus, Ptolemy, and Greek
                 Trigonometry \\
                 6-6 Heron \\
                 6-7 Ancient Greek Algebra \\
                 6-8 Diophantus \\
                 6-9 Pappus \\
                 6-10 The Commentators \\
                 Problem Studies / 140 \\
                 6.1 Measurements by Aristarchus and Eratosthenes \\
                 6.2 On the Sphere and Cylinder \\
                 6.3 The Problem of the Crown \\
                 6.4 The Arbelos and the Salinon \\
                 6.5 The Theorem of the Broken Chord \\
                 6.6 The Focus--Directrix Property \\
                 6.7 Tangencies \\
                 6.8 Problems from Apollonius \\
                 6.9 Ptolemy's Table of Chords \\
                 6.10 Stereographic Projection \\
                 6.11 Problems from Heron \\
                 6.12 Simultaneous Equations \\
                 6.13 Problems from the ``Greek Anthology'' \\
                 6.14 Type Problems from the ``Greek Anthology'' \\
                 6.15 Diophantus \\
                 6.16 Some Number Theory in the ``Arithmetica'' \\
                 6.17 Problems from Pappus \\
                 6.18 The Centroid Theorems \\
                 6.19 The Trammel Construction of an Ellipse \\
                 6.20 The Theorem of Menelaus \\
                 6.21 More on Means \\
                 Essay Topics / 154 \\
                 Bibliography / 155 \\
                 Chinese, Hindu, and Arabian Mathematics / 156 \\
                 China: \\
                 7-1 Sources and Periods \\
                 7-2 From the Chou to the Tang \\
                 7-3 From the Tang Through the Ming \\
                 India: \\
                 7-4 General Survey \\
                 7-5 Number Computing \\
                 7-6 Arithmetic and Algebra \\
                 7-7 Geometry and Trigonometry \\
                 7-8 Contrast Between Greek and Hindu Mathematics \\
                 Arabia: \\
                 7-9 The Rise of Moslem Culture \\
                 7-10 Arithmetic and Algebra \\
                 7-11 Geometry and Trigonometry \\
                 7-12 Some Etymology \\
                 7-13 The Arabian Contribution \\
                 Problem Studies / 178 \\
                 7.1 Some Problems from the ``Arithmetic in Nine
                 Sections'' \\
                 7.2 The Pythagorean Theorem \\
                 7.3 Magic Squares \\
                 7.4 Some Early Hindu Problems \\
                 7.5 Problems from Mahavira \\
                 7.6 Problems from Bh{\=a}skara \\
                 7.7 Quadratic Surds \\
                 7.8 Indeterminate Equations of the First Degree \\
                 7.9 The Diagonals of a Cyclic Quadrilateral \\
                 7.10 Brahmagupta's Quadrilaterals \\
                 7.11 Tabit Ibn Qorra, Al-karkh{\=\i}, and Nasir
                 Ed-d{\=\i}n \\
                 7.12 Casting Out 9's \\
                 7.13 Casting Out 11's \\
                 7.14 Double False Position \\
                 7.15 Khayyam's Solution of Cubics \\
                 7.16 A Geometric Solution of Cubics \\
                 7.17 Geometrical Constructions on a Sphere \\
                 Essay Topics / 187 \\
                 Bibliography / 188 \\
                 Eight: European Mathematics, 500 to 1600 / 189 \\
                 8-1 The Dark Ages \\
                 8-2 The Period of Transmission \\
                 8-3 Fibonacci and the Thirteenth Century \\
                 8-4 The Fourteenth Century \\
                 8-5 The Fifteenth Century \\
                 8-6 The Early Arithmetics \\
                 8-7 Beginnings of Algebraic Symbolism \\
                 8-8 Cubic and Quartic Equations \\
                 8-9 Fran{\c{c}}ois Vi{\`e}te \\
                 8-10 Other Mathematicians of the Sixteenth Century \\
                 Problem Studies / 209 \\
                 8.1 Problems from the Dark Ages \\
                 8.2 The Fibonacci Sequence \\
                 8.3 Problems from the ``Liber Abaci'' \\
                 8.4 Further Problems of Fibonacci \\
                 8.5 Star-Polygons \\
                 8.6 Jordanus and Cusa \\
                 8.7 D{\"u}rer and Magic Squares of Doubly-Even Order
                 \\
                 8.8 Problems from Regiomontanus \\
                 8.9 Problems from Chuquet \\
                 8.10 Problems from Pacioli \\
                 8.11 Early Commercial Problems \\
                 8.12 The Gelosia and Galley Algorithms \\
                 8.13 Gematria and Arithmography \\
                 8.14 Cubic Equations \\
                 8.15 Quartic Equations \\
                 8-16 Sixteenth-Century Notation \\
                 8.17 Prolems from Vi{\`e}te \\
                 8-18 Problems from Clavius \\
                 8.19 Some Geometry \\
                 Essay Topics / 220 \\
                 Bibliography / 221 \\
                 Part Two: The Seventeenth Century and After the Dawn of
                 Modern Mathematics / 223 \\
                 Nine: The Dawn of Modern Mathematics / 224 \\
                 9-1 The Seventeenth Century \\
                 9-2 Napier \\
                 9-3 Logarithms \\
                 9-4 The Savilian and Lucasian Professorships \\
                 9-5 Harriot and Oughtred \\
                 9-6 Galileo \\
                 9-7 Kepler \\
                 9-8 Desargues \\
                 9-9 Pascal \\
                 Problem Studies / 246 \\
                 9.1 Logarithms \\
                 9.2 Napier and Spherical Trigonometry \\
                 9.3 Napier's Rods \\
                 9.4 The Slide Rule \\
                 9.5 Freely Falling Bodies \\
                 9.6 Sector Compasses \\
                 9.7 Some Simple Paradoxes from Galileo's ``Discorsi''
                 \\
                 9.8 Kepler's Laws \\
                 9.9 Mosaics \\
                 9.10 Proving Theorems by Projection \\
                 9.11 Pascal's Youthful Empirical ``Proof'' \\
                 9.12 Pascal's Theorem \\
                 9.13 Pascal's Triangle \\
                 Essay Topics / 256 \\
                 Bibliography / 256 \\
                 Ten: Analytic Geometry and Other Precalculus
                 Developments / 258 \\
                 10-1 Analytic Geometry \\
                 10-2 Descartes \\
                 10-3 Fermat \\
                 10-4 Roberval and Torricelli \\
                 10-5 Huygens \\
                 10-6 Some Seventeenth-Century Mathematicians of France
                 and Italy \\
                 10-7 Some Seventeenth-Century Mathematicians of Germany
                 and the Low Countries \\
                 10-8 Some Seventeenth-Century British Mathematicians
                 \\
                 Problem Studies / 279 \\
                 10.1 Geometric Algebra \\
                 10.2 Descartes's ``La G{\'e}ometrie'' \\
                 10.3 Descartes's Rule of Signs \\
                 10.4 Problems from Descartes \\
                 10.5 Fermat's Theorems \\
                 10.6 The Problem of the Points \\
                 10.7 Problems from Huygens \\
                 10.8 Higher Plane Curves \\
                 10.9 Recreational Problems from Bachet \\
                 10.10 Some Geometry \\
                 10.11 Computation of Logarithms by Series \\
                 Essay Topics / 285 \\
                 Bibliography / 285 \\
                 Eleven: The Calculus and Related Concepts / 287 \\
                 11-1 Introduction \\
                 11-2 Zeno's Paradoxes \\
                 11-3 Eudoxus' Method of Exhaustion \\
                 11-4 Archimedes' Method of Equilibrium \\
                 11-5 The Beginnings of Integration in Western Europe
                 \\
                 11-6 Cavalieri's Method of Indivisibles \\
                 11-7 The Beginning of Differentiation \\
                 11-8 Wallis and Barrow \\
                 11-9 Newton \\
                 11-10 Leibniz \\
                 Problem Studies / 311 \\
                 11.1 The Method of Exhaustion \\
                 11.2 The Method of Equilibrium \\
                 11.3 Some Archimedean Problems \\
                 11.4 The Method of Indivisibles \\
                 11.5 The Prismoidal Formula \\
                 11.6 Differentiation \\
                 11.7 The Binomial Theorem \\
                 11.8 An Upper Bound for the Roots of a Polynomial
                 Equation \\
                 11.9 Approximate Solution of Equations \\
                 11.10 Algebra of Classes \\
                 Essay Topics / 316 \\
                 Bibliography / 317 \\
                 Twelve: The Eighteenth Century and the Exploitation of
                 the Calculus / 319 \\
                 12-1 Introduction and Apology \\
                 12-2 The Bernoulli Family \\
                 12-3 De Moivre and Probability \\
                 12-4 Taylor and Maclaurin \\
                 12-5 Euler \\
                 12-6 Clairaut, D'Alembert, and Lambert \\
                 12-7 Lagrange \\
                 12-8 Laplace and Legendre \\
                 12-9 Monge and Carnot \\
                 12-10 The Metric System \\
                 12-11 Summary \\
                 Problem Studies / 344 \\
                 12.1 Bernoulli Numbers \\
                 12.2 De Moivre's Formula \\
                 12.3 Distributions \\
                 12.4 Formal Manipulation of Series \\
                 12.5 A Conjecture and a Paradox \\
                 12.6 Euler and an Infinite Series \\
                 12.7 Orbiform Curves \\
                 12.8 Unicursal and Multicursal Graphs \\
                 12.9 Some Differential Equations \\
                 12.10 Hyperbolic Functions \\
                 12.11 Lagrange and Analytic Geometry \\
                 12.12 Buffon's Needle Problem \\
                 12.13 Random Chord in a Circle \\
                 12.14 The Method of Least Squares \\
                 12.15 Some Mongean Geometry \\
                 12.16 Sensed Magnitudes \\
                 12.17 Carnot's Theorem \\
                 Essay Topics / 355 \\
                 Bibliography / 356 \\
                 Thirteen: The Early Nineteenth Century and the
                 Liberation of Geometry and Algebra / 357 \\
                 13-1 The Prince of Mathematicians \\
                 13-2 Fourier and Poisson \\
                 13-3 Cauchy \\
                 13-4 Abel and Galois \\
                 13-5 Jacobi and Dirichlet \\
                 13-6 Non-Euclidean Geometry \\
                 13-7 The Emergence of Algebraic Structure \\
                 13-8 The Liberation of Algebra \\
                 13-9 Hamilton, Grassmann, Boole, and De Morgan \\
                 13-10 Cayley, Sylvester, and Hermite \\
                 13-11 Academies, Societies, and Periodicals \\
                 Problem Studies / 392 \\
                 13.1 The Fundamental Theorem of Algebra \\
                 13.2 Basic Properties of Congruence \\
                 13.3 Gauss and Numbers \\
                 13.4 Fourier Series \\
                 13.5 Cauchy and Infinite Series \\
                 13.6 Group Theory \\
                 13.7 Examples of Groups \\
                 13.8 Abelian Groups \\
                 13.9 Saccheri Quadrilaterals \\
                 13.10 The Hypothesis of the Acute Angle \\
                 13.11 A Euclidean Model for Hyperbolic Geometry \\
                 13.12 Non-Euclidean Geometry and Physical Space \\
                 13.13 Systems with a Common Algebraic Structure \\
                 13.14 Algebraic Laws \\
                 13.15 More on Algebraic Laws \\
                 13.16 Complex Numbers as Ordered Pairs of Real Numbers
                 \\
                 13.17 Quaternions \\
                 13.18 Matrices \\
                 13.19 Jordan and Lie Algebras \\
                 13.20 Vectors \\
                 13.21 An Interesting Algebra \\
                 13.22 A Point Algebra \\
                 13.23 An Infinite Non-Abelian Group \\
                 13.24 The Hamiltonian Game \\
                 Essay Topics / 403 \\
                 Bibliography / 403 \\
                 The Later Nineteenth Century and the Arithmetization of
                 Analysis / 405 \\
                 14-1 Sequel to Euclid \\
                 14-2 Impossibility of Solving the Three Famous Problems
                 with Euclidean Tools \\
                 14-3 Compasses Or Straightedge Alone \\
                 14-4 Projective Geometry \\
                 14-5 Analytic Geometry \\
                 14-6 N-dimensional Geometry \\
                 14-7 Differential Geometry \\
                 14-8 The Erlanger Programm of Felix Klein \\
                 14-9 The Arithmetization of Analysis \\
                 14-10 Weierstrass and Riemann \\
                 14-11 Cantor, Kronecker, and Poincar{\'e} \\
                 14-12 Sonja Kovalevsky and Emmy Noether \\
                 14-13 The Prime Numbers \\
                 Problem Studies / 437 \\
                 14.1 The Feuerbach Configuration \\
                 14.2 Commandino's Theorem \\
                 14.3 The Altitudes of a Tetrahedron \\
                 14.4 Space Analogs \\
                 14.5 Isogonal Elements \\
                 14.6 Impossible Constructions \\
                 14.7 Some Approximate Constructions \\
                 14.8 Mascheroni Construction Theorem \\
                 14.9 Constructions with Straightedge and Rusty
                 Compasses \\
                 14.10 Lemoine's Geometrography \\
                 14.11 Principle of Duality \\
                 14.12 A Self-Dual Postulate Set for Projective Geometry
                 \\
                 14.13 Principle of Duality of Trigonometry \\
                 14.14 Coordinate Systems \\
                 14.15 Line Coordinates \\
                 14.16 Dimensionality \\
                 14.17 Abridged Notation \\
                 14.18 Homogeneous Coordinates \\
                 14.19 Plucker's Numbers \\
                 14.20 N-dimensional Geometry \\
                 14.21 Gaussian Curvature \\
                 14.22 The Tractoid \\
                 14.23 The Erlanger Programm \\
                 14.24 Mysticism and Absurdity in the Early Calculus \\
                 14.25 Early Difficulties with Infinite Series \\
                 14.26 Some Paradoxes in Elementary Algebra \\
                 14.27 Some Paradoxes in Calculus \\
                 14.28 A Continuous Curve Having No Tangents \\
                 14.29 Algebraic and Transcendental Numbers \\
                 14.30 Prime Numbers \\
                 Essay Topics / 454 \\
                 Bibliography / 455 \\
                 Fifteen: Abstraction and the Transition Into the
                 Twentieth Century / 457 \\
                 15-1 Logical Shortcomings of Euclid's ``Elements'' \\
                 15-2 Axiomatics \\
                 15-3 The Evolution of Some Basic Concepts \\
                 15-4 Transfinite Numbers \\
                 15-5 Topology \\
                 15-6 Mathematical Logic \\
                 15-7 Antinomies of Set Theory \\
                 15-8 Philosophies of Mathematics \\
                 15-9 Computers \\
                 15-10 The New Math and Bourbaki \\
                 15-11 The Tree of Mathematics \\
                 Problem Studies / 493 \\
                 15.1 Tacit Assumptions Made by Euclid \\
                 15.2 Three Geometrical Paradoxes \\
                 15.3 Dedekind's Continuity Postulate \\
                 15.4 A Coordinate Interpretation of Euclid's Postulates
                 \\
                 15.5 A Spherical Interpretation of Euclid's Postulates
                 \\
                 15.6 Pasch's Postulate \\
                 15.7 An Abstract Mathematical System \\
                 15.8 Axiomatics \\
                 15.9 Associated Hypothetical Propositions \\
                 15.10 Intuition Versus Proof \\
                 15.11 A Miniature Mathematical System \\
                 15.12 A Set of Inconsistent Statements \\
                 15.13 A Postulate Set Related to Relativity Theory \\
                 15.14 Bees and Hives \\
                 15.15 Metric Space \\
                 15.16 Equivalent Segments \\
                 15.17 Some Denumerable and Nondenumerable Sets \\
                 15.18 Polynomials of Heights 1, 2, 3, 4, and 5 \\
                 15.19 The Measure of a Denumerable Set of Points \\
                 15.20 Transfinite Numbers and Dimension Theory \\
                 15.21 Circles and Lines \\
                 15.22 Homeomorphic Surfaces \\
                 15.23 Sides and Edges \\
                 15.24 Paradromic Rings \\
                 15.25 Polyhedral Surfaces \\
                 15.26 Faces and Vertices of Polyhedral Surfaces \\
                 15.27 Hausdorff Space \\
                 15.28 Allied Propositions \\
                 15.29 Three-Valued Logics \\
                 15.30 The Russell Paradox \\
                 15.31 A Paradox \\
                 15.32 Some Dilemmas and Some Questions \\
                 15.33 Recreational Mathematics \\
                 Essay Topics / 506 \\
                 Bibliography / 507 \\
                 General Bibliography / 512 \\
                 A Chronological Table / 514 \\
                 Answers and Suggestions for the Solution of the Problem
                 Studies / 522 \\
                 Index / 553",
}

@Book{Eymard:2004:N,
  author =       "Pierre Eymard and Jean-Pierre Lafon",
  title =        "The Number $ \pi $",
  publisher =    pub-AMS,
  address =      pub-AMS:adr,
  pages =        "x + 322",
  year =         "2004",
  ISBN =         "0-8218-3246-8",
  ISBN-13 =      "978-0-8218-3246-2",
  LCCN =         "QA484 .E9613 2004",
  bibdate =      "Fri Apr 02 14:56:15 2004",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Translated by Stephen S. Wilson from the French {\em
                 Autour du nombre $ \pi $} (1999).",
  price =        "US\$36.00",
  URL =          "http://www.ams.org/bookpages/tnp/",
  acknowledgement = ack-nhfb,
  tableofcontents = "Measurement of the circle \\
                 Wallis's formula and some others \\
                 Euler, Euler again, always Euler \\
                 Squaring the circle \\
                 $\pi$ and elliptic integrals \\
                 Solutions to the exercises",
}

@Book{Fagan:2010:CMH,
  author =       "Brian M. Fagan",
  title =        "{Cro-Magnon}: how the {Ice Age} gave birth to the
                 first modern humans",
  publisher =    "Bloomsbury Press",
  address =      "New York, NY, USA",
  pages =        "xviii + 295",
  year =         "2010",
  ISBN =         "1-59691-582-X",
  ISBN-13 =      "978-1-59691-582-4",
  LCCN =         "GN286.3 .F34 2010",
  bibdate =      "Mon Mar 8 19:54:35 MST 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Cro-Magnons; Human evolution; Glacial epoch;
                 Neanderthals; Prehistoric peoples",
  tableofcontents = "Momentous encounters \\
                 Neanderthal ancestors \\
                 Neanderthals and their world \\
                 The quiet people \\
                 The 10,000th grandmother \\
                 Great mobility \\
                 The realm of the Lion Man \\
                 Fat, flints, and furs \\
                 Gravettians \\
                 The power of the hunt \\
                 Magdalenians \\
                 The challenge of warming",
}

@Book{Fagan:2019:LIA,
  author =       "Brian M. Fagan",
  title =        "The {Little Ice Age}: How Climate Made History
                 1300--1850",
  publisher =    pub-BASIC-BOOKS,
  address =      pub-BASIC-BOOKS:adr,
  pages =        "xxi + 258",
  year =         "2019",
  ISBN =         "1-5416-1859-9 (paperback)",
  ISBN-13 =      "978-1-5416-1859-6 (paperback)",
  LCCN =         "QC989.A1 F34 2019",
  bibdate =      "Mon Dec 9 07:04:57 MST 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "\booktitle{The Little Ice Age} tells the story of the
                 turbulent, unpredictable, and often very cold years of
                 modern European history, how this altered climate
                 affected historical events, and what it means for
                 today's global warming. Building on research that has
                 only recently confirmed that the world endured a
                 500year cold snap, renowned archaeologist Brian Fagan
                 shows how the increasing cold influenced familiar
                 events from Norse exploration to the settlement of
                 North America to the Industrial Revolution. This is a
                 fascinating book for anyone interested in history,
                 climate, and how they interact.",
  acknowledgement = ack-nhfb,
  remark =       "Previous edition 2000.",
  subject =      "Climatic changes; Europe; History; History / Europe;
                 Science / Earth Sciences / Meteorology and Climatology;
                 Science / Global Warming and Climate Change; Social
                 Science / Anthropology; Social Science / Archaeology;
                 Climatic changes",
  tableofcontents = "Preface / xi \\
                 Acknowledgments / xix \\
                 Author's Note / xxi \\
                 Part 1: Warmth and Its Aftermath \\
                 The Medieval Warm Period / 3 \\
                 The Great Famine / 23 \\
                 Part 2: Cooling Begins \\
                 The Climatic Seesaw / 47 \\
                 Storms, Cod and Doggers / 61 \\
                 A Vast Peasantry / 79 \\
                 Part 3: The End of the ``Full World'' \\
                 The Specter of Hunger / 101 \\
                 The War Against the Glaciers / 113 \\
                 ``More Like Winter Than Summer'' / 129 \\
                 Dearth and Revolution / 149 \\
                 The Year Without a Summer / 167 \\
                 An Ghorta M{\'o}r / 181 \\
                 Part 4: The Modern Warm Period \\
                 A Warmer Greenhouse / 201 \\
                 Notes / 219 \\
                 Index / 235",
}

@Book{Fagone:2017:WWS,
  author =       "Jason Fagone",
  title =        "The woman who smashed codes: a true story of love,
                 spies, and the unlikely heroine who outwitted
                 {America}'s enemies",
  publisher =    "Dey Street Books",
  address =      "New York, New York",
  pages =        "xvi + 444",
  year =         "2017",
  ISBN =         "0-06-243048-3 (hardcover)",
  ISBN-13 =      "978-0-06-243048-9 (hardcover)",
  LCCN =         "Z103.4.U6",
  bibdate =      "Fri Dec 22 09:19:43 MST 2017",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "In 1916, at the height of World War I, brilliant
                 Shakespeare expert Elizebeth Smith went to work for an
                 eccentric tycoon on his estate outside Chicago. The
                 tycoon had close ties to the U.S. government, and he
                 soon asked Elizebeth to apply her language skills to an
                 exciting new venture: code-breaking. There she met the
                 man who would become her husband, groundbreaking
                 cryptologist William Friedman. Though she and Friedman
                 are in many ways the ``Adam and Eve'' of the NSA,
                 Elizebeth's story, incredibly, has never been told. In
                 \booktitle{The Woman Who Smashed Codes}, Jason Fagone
                 chronicles the life of this extraordinary woman, who
                 played an integral role in our nation's history for
                 forty years. After World War I, Smith used her talents
                 to catch gangsters and smugglers during Prohibition,
                 then accepted a covert mission to discover and expose
                 Nazi spy rings that were spreading like wildfire across
                 South America, advancing ever closer to the United
                 States. As World War II raged, Elizebeth fought a
                 highly classified battle of wits against Hitler's
                 Reich, cracking multiple versions of the Enigma machine
                 used by German spies. Meanwhile, inside an Army vault
                 in Washington, William worked furiously to break
                 Purple, the Japanese version of Enigma --- and
                 eventually succeeded, at a terrible cost to his
                 personal life. Fagone unveils America's code-breaking
                 history through the prism of Smith's life, bringing
                 into focus the unforgettable events and colorful
                 personalities that would help shape modern
                 intelligence.",
  acknowledgement = ack-nhfb,
  subject =      "Friedman, Elizebeth; Friedman, Elizebeth,;
                 Cryptographers; United States; Biography; Cryptography;
                 History; Cryptographers; Cryptography; Riverbank
                 Laboratories",
  subject-dates = "Elizebeth Smith Friedman (1892--1980); William
                 Frederick Friedman (1891--1969)",
  tableofcontents = "Author's note: Prying eyes \\
                 Fabyan \\
                 Unbelievable, yet it was there \\
                 Bacon's ghost \\
                 He who fears is half dead \\
                 The escape plot \\
                 Target practice \\
                 Grandmother died \\
                 Magic \\
                 The Hauptsturmf{\"u}hrer and the Funkmeister \\
                 Circuit 3-N \\
                 The doll lady \\
                 Hitler's lair \\
                 Epilogue: Girl cryptanalyst and all that",
}

@Book{Falk:2011:FCH,
  author =       "Dean Falk",
  title =        "The fossil chronicles: how two controversial
                 discoveries changed our view of human evolution",
  publisher =    pub-U-CALIFORNIA-PRESS,
  address =      pub-U-CALIFORNIA-PRESS:adr,
  pages =        "xiv + 259",
  year =         "2011",
  ISBN =         "0-520-26670-6 (hardcover)",
  ISBN-13 =      "978-0-520-26670-4 (hardcover)",
  LCCN =         "GN282.5 .F35 2011",
  bibdate =      "Tue Jun 5 16:02:10 MDT 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  keywords =     "Hobbit (Flores Island, Indonesia); Taung child",
  subject =      "Fossil hominids; Flores man; Australopithecines; Human
                 remains (Archaeology); Human evolution; Philosophy;
                 Paleoanthropology",
  tableofcontents = "Of paleopolitics and missing links \\
                 Taung: a fossil to rival Piltdown \\
                 Taung's checkered past \\
                 Sulcal skirmishes \\
                 Once upon a hobbit \\
                 Flo's little brain \\
                 Sick hobbits, quarrelsome scientists \\
                 Whence Homo floresiensis? \\
                 Bones to pick",
}

@Book{Farin:1988:CSC,
  author =       "Gerald Farin",
  title =        "Curves and Surfaces for Computer-Aided Geometric
                 Design",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "xv + 334 + 4",
  year =         "1988",
  ISBN =         "0-12-249050-9",
  ISBN-13 =      "978-0-12-249050-7",
  LCCN =         "T385 .F371 1988",
  MRclass =      "68-02, 53A04, 53A05, 68U99",
  bibdate =      "Tue Dec 14 22:48:01 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  ZMnumber =     "0694.68004",
  acknowledgement = ack-nhfb,
  tableofcontents = "Preface / xiii \\
                 1: P. B{\'e}zier: How a Simple System Was Born / 1 \\
                 2: Introductory Material / 13 \\
                 2.1 Points and Vectors / 13 \\
                 2.2 Affine Maps / 16 \\
                 2.3 Linear Interpolation / 18 \\
                 2.4 Piecewise Linear Interpolation / 21 \\
                 2.5 Function Spaces / 22 \\
                 2.6 Problems / 24 \\
                 3: The de Casteljau Algorithm / 25 \\
                 3.1 Parabolas / 25 \\
                 3.2 The de Casteljau Algorithm / 27 \\
                 3.3 Some Properties of B{\'e}zier Curves / 28 \\
                 3.4 Problems / 30 \\
                 4: The Bernstein Form of a B{\'e}zier Curve / 33 \\
                 4.1 Bernstein Polynomials / 33 \\
                 4.2 Properties of B{\'e}zier Curves / 35 \\
                 4.3 The Derivative of a B{\'e}zier Curve / 37 \\
                 4.4 Higher Order Derivatives / 39 \\
                 4.5 Derivatives and the de Casteljau Algorithm / 41 \\
                 4.6 The Matrix Form of a B{\'e}zier Curve / 41 \\
                 4.7 Problems / 43 \\
                 5: B{\'e}zier Curve Topics / 45 \\
                 5.1 Degree Elevation / 45 \\
                 5.2 Repeated Degree Elevation / 47 \\
                 5.3 The Variation Diminishing Property / 48 \\
                 5.4 Degree Reduction / 49 \\
                 5.5 Nonparametric Curves / 50 \\
                 5.6 Cross Plots / 52 \\
                 5.7 Integrals / 52 \\
                 5.8 The B{\'e}zier Form of a B{\'e}zier Curve / 53 \\
                 5.9 The Barycentric Form of a B{\'e}zier Curve / 55 \\
                 5.10 The Weierstrass Approximation Theorem / 55 \\
                 5.11 Formulas for Bernstein Polynomials / 56 \\
                 5.12 Problems / 58 \\
                 6: Polynomial Interpolation / 59 \\
                 6.1 Aitken's Algorithm / 59 \\
                 6.2 Lagrange Polynomials / 62 \\
                 6.3 The Vandermonde Approach / 64 \\
                 6.4 Limits of Lagrange Interpolation / 65 \\
                 6.5 Cubic Hermite Interpolation / 66 \\
                 6.6 Quintic Hermite Interpolation / 70 \\
                 6.7 Problems / 71 \\
                 7: Spline Curves in B{\'e}zier Form / 73 \\
                 7.1 Global and Local Parameters / 73 \\
                 7.2 Subdivision / 75 \\
                 7.3 Domain Transformation / 77 \\
                 7.4 Smoothness Conditions / 77 \\
                 7.5 $C^1$ Continuity / 79 \\
                 7.6 $C^2$ Continuity / 80 \\
                 7.7 Finding a $C^1$ Parametrization / 82 \\
                 7.8 $C^1$ Quadratic B-spline Curves / 83 \\
                 7.9 $C^2$ Cubic B-spline Curves / 88 \\
                 7.10 Parametrizations / 91 \\
                 7.11 Problems / 92 \\
                 8: Piecewise Cubic Interpolation / 93 \\
                 8.1 $C^1$ Piecewise Cubic Hermite Interpolation / 93
                 \\
                 8.2 $C^1$ Piecewise Cubic Interpolation I / 95 \\
                 8.3 $C^1$ piecewise Cubic Interpolation II / 98 \\
                 8.4 Problems / 100 \\
                 9: Cubic Spline Interpolation / 101 \\
                 9.1 Cubic Interpolatory Splines: the B-spline Form /
                 101: \\
                 9.2 Cubic Spline Interpolation: The Hermite Form / 104
                 \\
                 9.3 End Conditions / 106 \\
                 9.4 The Parametrization / 109 \\
                 9.5 The Minimum Property / 112 \\
                 9.6 Problems / 115 \\
                 10: B-splines / 119 \\
                 10.1 Motivation / 120 \\
                 10.2 Knot Insertion / 121 \\
                 10.3 The de Boor Algorithm / 125 \\
                 10.4 Smoothness of B-spline Curves / 129 \\
                 10.5 The B-spline Basis / 129 \\
                 10.6 Two Recursion Formulas / 131 \\
                 10.7 Repeated Subdivision / 134 \\
                 10.8 More Facts about B-spline Curves / 136 \\
                 10.9 B-spline Basics / 137 \\
                 10.10 Problems / 138 \\
                 11: W. Boehm: Differential Geometry I / 141 \\
                 11.1 Parametric Curves and Arc Length / 141 \\
                 11.2 The Frenet Frame / 143 \\
                 11.3 Moving the Frame / 144 \\
                 11.4 The Osculating Circle / 146 \\
                 11.5 Nonparametric Curves / 148 \\
                 11.6 Composite Curves / 149 \\
                 12: Geometric Continuity I / 151 \\
                 12.1 Motivation / 151 \\
                 12.2 A Characterization of $G^2$ Curves / 152 \\
                 12.3 Nu-splines / 154 \\
                 12.4 $G^2$ Piecewise B{\'e}zier Curves / 157 \\
                 12.5 Direct $G^2$ Cubic Splines / 159 \\
                 12.6 Problems / 161 \\
                 Geometric Continuity II / 163 \\
                 13.1 Gamma-splines / 163 \\
                 13.2 Local Basis Functions for $G^2$ Splines / 166 \\
                 13.3 Beta-splines / 169 \\
                 13.4 A Second Characterization of $G^2$ Continuity /
                 171 \\
                 13.5 Problems / 172 \\
                 14: Conic Sections / 173 \\
                 14.1 Projective Maps of the Real Line / 173 \\
                 14.2 Conics as Rational Quadratics / 177 \\
                 14.3 A de Casteljau Algorithm / 181 \\
                 14.4 Derivatives / 182 \\
                 14.5 The Implicit Form / 183 \\
                 14.6 Two Classic Problems / 184 \\
                 14.7 Classification / 185 \\
                 14.8 Problems / 186 \\
                 15: Rational B{\'e}zier and B-spline Curves / 187 \\
                 15.1 Rational B{\'e}zier Curves / 187 \\
                 15.2 The de Casteljau Algorithm / 188 \\
                 15.3 Derivatives / 191 \\
                 15.4 Reparametrization and Degree Elevation / 192 \\
                 15.5 Rational Cubic B-spline Curves / 193 \\
                 15.6 Interpolation with Rational Cubics / 195 \\
                 15.7 Rational B-Splines of Arbitrary Degree / 196 \\
                 15.8 Problems / 197 \\
                 16: Tensor Product B{\'e}zier Surfaces / 199 \\
                 16.1 Bilinear Interpolation / 199 \\
                 16.2 The Direct de Casteljau Algorithm / 201 \\
                 16.3 The Tensor Product Approach / 203 \\
                 16.4 Properties / 207 \\
                 16.5 Degree Elevation / 208 \\
                 16.6 Derivatives / 209 \\
                 16.7 Normal Vectors / 211 \\
                 16.8 Twists / 213 \\
                 16.9 The Matrix Form of a B{\'e}zier Patch. / 214 \\
                 16.10 Nonparametric Patches / 215 \\
                 16.11 Problems / 216 \\
                 17: Composite Surfaces and Spline Interpolation / 219
                 \\
                 17.1 Smoothness and Subdivision / 219 \\
                 17.2 Bicubic B-spline Surfaces / 221 \\
                 17.3 Twist Estimation / 223 \\
                 17.4 Tensor Product Interpolants / 238 \\
                 17.5 Bicubic Hermite Patches / 231 \\
                 17.6 Problems / 233 \\
                 18: B{\'e}zier Triangles / 235 \\
                 18.1 Barycentric Coordinates and Linear Interpolation /
                 236: \\
                 18.2 The de Casteljau Algorithm / 238 \\
                 18.3 Bernstein Polynomials / 240 \\
                 18.4 Derivatives / 242 \\
                 18.5 Subdivision / 245 \\
                 18.6 Differentiability / 248 \\
                 18.7 Degree Elevation / 249 \\
                 18.8 Nonparametric Patches / 250 \\
                 18.9 Problems / 252 \\
                 19: Coons Patches / 255 \\
                 19.1 Ruled Surfaces / 256 \\
                 19.2 Coons Patches: Bilinearly Blended / 257 \\
                 19.3 Coons Patches: Partially Bicubically Blended / 260
                 \\
                 19.4 Coons Patches: Bicubically Blended / 261 \\
                 19.5 Piecewise Coons Surfaces / 263 \\
                 19.6 Problems / 263 \\
                 20: Coons Patches: Additional Material / 265 \\
                 20.1 Compatibility / 265 \\
                 20.2 Control Nets from Coons Patches / 268 \\
                 20.3 Translational Surfaces / 269 \\
                 20.4 Gordon Surfaces / 271 \\
                 20.5 Problems / 273 \\
                 21: W. Boehm: Differential Geometry II / 275 \\
                 21.1 Parametric Surfaces and Arc Element / 275 \\
                 21.2 The Local Frame / 278 \\
                 21.3 The Curvature of a Surface Curve / 278 \\
                 21.4 Meusnier's Theorem / 280 \\
                 21.5 Lines of Curvature / 281 \\
                 21.6 Gaussian and Mean Curvature / 282 \\
                 21.7 Euler's Theorem / 283 \\
                 21.8 Dupin's Indicatrix / 284 \\
                 21.9 Asymptotic Lines and Conjugate Directions / 285
                 \\
                 21.10 Ruled Surfaces and Developables / 287 \\
                 21.11 Nonparametric Surfaces / 288 \\
                 21.12 Composite Surfaces / 289 \\
                 22: Interrogation and Smoothing / 293 \\
                 22.1 Use of Curvature Plots / 293 \\
                 22.2 Curve and Surface Smoothing / 294 \\
                 22.3 Surface Interrogation / 296 \\
                 23: Evaluation of Some Methods / 301 \\
                 23.1 B{\'e}zier Curves or B-spline Curves? / 301 \\
                 23.2 Spline Curves or B-spline Curves? / 301 \\
                 23.3 The Monomial or the B{\'e}zier Form? / 302 \\
                 23.4 The B-spline Form or the Hermite Form? / 303 \\
                 23.5 Triangular or Rectangular Patches? / 304 \\
                 24: Quick Reference of Curve and Surface Terms / 307
                 \\
                 Bibliography / 311 \\
                 Index / 329",
}

@Book{Farin:1990:CSC,
  author =       "Gerald Farin",
  title =        "Curves and Surfaces for Computer-Aided Geometric
                 Design",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  edition =      "Second",
  pages =        "xvii + 444",
  year =         "1990",
  ISBN =         "0-12-249051-7",
  ISBN-13 =      "978-0-12-249051-4",
  LCCN =         "T385 .F371 1990",
  bibdate =      "Tue Dec 14 22:48:03 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  ZMnumber =     "0702.68004",
  acknowledgement = ack-nhfb,
  tableofcontents = "How a Simple System Was Born \\
                 Introductory Material \\
                 The De Castelajau Algorithm \\
                 The Bernstein Form of a B{\'e}zier Curve \\
                 B{\'e}zier Curve Topics \\
                 Polynomial Interpolation \\
                 Spline Curves in B{\'e}zier Form \\
                 Piecewise Cubic Interpolation \\
                 Cubic Spline Interpolation \\
                 B-Splines \\
                 Differential Geometry I \\
                 Geometric Continuity I \\
                 Geometric Continuity II \\
                 Conic Sections \\
                 Rational B{\'e}zier and B-Spline Curves \\
                 Tensor Product B{\'e}zier Surfaces \\
                 Composite Surfaces and Spline Interpolation \\
                 B{\'e}zier Triangles \\
                 Geometric Continuity for Surfaces \\
                 Coons Patches \\
                 Coons Patches: Additional Material \\
                 Differential Geometry II \\
                 Interrogation and Smoothing \\
                 Evaluation of Some Methods \\
                 Quick References of Curve and Surface Term",
}

@Book{Farin:1993:CSC,
  author =       "Gerald Farin",
  title =        "Curves and Surfaces for Computer-Aided Geometric
                 Design: a Practical Guide",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  edition =      "Third",
  pages =        "xvii + 473",
  year =         "1993",
  ISBN =         "0-12-249052-5, 0-12-249054-1, 1-4832-9699-7 (e-book)",
  ISBN-13 =      "978-0-12-249052-1, 978-0-12-249054-5,
                 978-1-4832-9699-9 (e-book)",
  LCCN =         "T385 .F37 1993",
  bibdate =      "Fri Oct 26 08:52:06 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "The emphasis in this beautifully illustrated text is
                 on the concepts of B{\'e}zier and B-spline methods for
                 curves, rational B{\'e}zier and B-spline curves,
                 geometric continuity, spline interpolation and Coon
                 methods. While no prior geometric training is needed as
                 a prerequisite for this text --- a background in
                 calculus and basic linear algebra is sufficient --- two
                 chapters written by W. Boehm have been included to
                 introduce the reader to those concepts of differential
                 geometry that are relevant to computer aided geometric
                 design. The volume also contains one chapter by P.
                 B{\'e}zier: \booktitle{How a Simple System Was Born}.
                 This book is of interest to software developers for
                 CAD/CAM systems, geometric modeling researchers and
                 graphics programmers. This third edition includes
                 several new sections and numerical examples, a
                 treatment of the new blossoming principle, and new C
                 programs. All C programs are available on a disk
                 included with the book. The Problems Sections at the
                 end of each chapter have also been extended.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "How a Simple System Was Born \\
                 Introductory Material \\
                 The De Casteljau Algorithm \\
                 The Bernstein Form of a B{\'e}zier Curve \\
                 B{\'e}zier Curve Topics \\
                 Polynomial Interpolation \\
                 Spline Curves in B{\'e}zier Form \\
                 Piecewise Cubic Interpolation \\
                 Cubic Spline Interpolation \\
                 B-Splines \\
                 W. Boehm: Differential Geometry I \\
                 Geometric Continuity I \\
                 Geometric Continuity II \\
                 Conic Sections \\
                 Rational B{\'e}zier and B-Spline Curves \\
                 Tensor Product B{\'e}zier Surfaces \\
                 Composite Surfaces and Spline Interpolation \\
                 B{\'e}zier Triangles \\
                 Geometric Continuity for Surfaces \\
                 Coons Patches \\
                 Coons Patches: Additional Material \\
                 W. Boehm: Differential Geometry II \\
                 Interrogation and Smoothing \\
                 Evaluation of Some Methods \\
                 Quick References of Curve and Surface Terms",
}

@Book{Farin:1995:NCS,
  author =       "Gerald E. Farin",
  title =        "{NURB} Curves and Surfaces: from Projective Geometry
                 to Practical Use",
  publisher =    pub-A-K-PETERS,
  address =      pub-A-K-PETERS:adr,
  pages =        "xii + 229",
  year =         "1995",
  ISBN =         "1-56881-038-5",
  ISBN-13 =      "978-1-56881-038-6",
  LCCN =         "QA224 .F37 1995",
  bibdate =      "Fri Oct 26 08:53:08 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$39.95",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "1: The Projective Plane \\
                 2: Projective Maps \\
                 3: Conics \\
                 4: Conics in Parametric Form \\
                 5: Rational Quadratic Conics \\
                 6: Conic Splines \\
                 7: Rational B{\'e}zier Curves \\
                 8: Rational Cubics \\
                 9: Projective Splines \\
                 10: Rational B-splines \\
                 11: Rectangular Patches \\
                 12: Rational B{\'e}zier Triangles \\
                 13: Quadrics \\
                 14: Gregory Patches \\
                 15: Examples and Standards",
}

@Book{Farin:1997:CSC,
  author =       "Gerald Farin",
  title =        "Curves and Surfaces for Computer-Aided Geometric
                 Design: a Practical Guide",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  edition =      "Fourth",
  pages =        "xvii + 429",
  year =         "1997",
  ISBN =         "0-12-249054-1",
  ISBN-13 =      "978-0-12-249054-5",
  LCCN =         "T385 .F37 1997",
  bibdate =      "Fri Oct 26 08:52:08 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

@Book{Farin:1999:NCS,
  author =       "Gerald E. Farin",
  title =        "{NURB} Curves and Surfaces: from Projective Geometry
                 to Practical Use",
  publisher =    pub-A-K-PETERS,
  address =      pub-A-K-PETERS:adr,
  edition =      "Second",
  pages =        "xv + 267",
  year =         "1999",
  ISBN =         "1-56881-084-9",
  ISBN-13 =      "978-1-56881-084-3",
  LCCN =         "QA224 .F37 1999",
  bibdate =      "Fri Oct 26 08:53:08 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "NURBS (Non-Uniform Rational B-Splines) have become the
                 de facto standard for geometric definitions in CAD/CAM
                 and computer graphics. This well-known book covers
                 NURBS from their geometric beginnings to their
                 industrial applications. The second edition
                 incorporates new research results and a chapter on
                 Pythagorean curves, a development that shows promise in
                 applications such as NC machining or robot motion
                 control. More than fifty new figures have been added.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "The projective plane \\
                 Projective maps \\
                 Conics \\
                 Conics in parametric form \\
                 Rational quadratic conics \\
                 Conic splines \\
                 Rational B{\'e}zier curves \\
                 Rational cubics \\
                 NURBS \\
                 Pythagorean curves \\
                 Rectangular patches \\
                 Rational B{\'e}zier triangles \\
                 Quadrics \\
                 Gregory patches \\
                 Examples and standards",
}

@Book{Farin:2001:CSC,
  author =       "Gerald E. Farin",
  title =        "Curves and Surfaces for {CAGD}: a Practical Guide",
  publisher =    pub-MORGAN-KAUFMANN,
  address =      pub-MORGAN-KAUFMANN:adr,
  edition =      "Fifth",
  pages =        "xvii + 497",
  year =         "2001",
  ISBN =         "1-55860-737-4, 0-08-050354-3 (e-book)",
  ISBN-13 =      "978-1-55860-737-8, 978-0-08-050354-7 (e-book)",
  LCCN =         "T385 .F37 2001",
  bibdate =      "Tue Jul 23 18:50:58 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$69.95",
  series =       "The Morgan Kaufmann series in computer graphics and
                 geometric modeling.",
  abstract =     "This fifth edition has been fully updated to cover the
                 many advances made in CAGD and curve and surface theory
                 since 1997, when the fourth edition appeared. Material
                 has been restructured into theory and applications
                 chapters. The theory material has been streamlined
                 using the blossoming approach; the applications
                 material includes least squares techniques in addition
                 to the traditional interpolation methods. In all other
                 respects, it is, thankfully, the same. This means you
                 get the informal, friendly style and unique approach
                 that has made \booktitle{Curves and Surfaces for CAGD:
                 A Practical Guide} a true classic. The book's unified
                 treatment of all significant methods of curve and
                 surface design is heavily focused on the movement from
                 theory to application. The author provides complete C
                 implementations of many of the theories he discusses,
                 ranging from the traditional to the leading-edge.
                 You'll gain a deep, practical understanding of their
                 advantages, disadvantages, and interrelationships, and
                 in the process you'll see why this book has emerged as
                 a proven resource for thousands of other professionals
                 and academics. * Provides authoritative and accessible
                 information for those working with or developing
                 computer-aided geometric design applications. * Covers
                 all significant CAGD curve and surface design
                 techniques-from the traditional to the experimental. *
                 Includes a new chapter on recursive subdivision and
                 triangular meshes. * Presents topical programming
                 exercises useful to professionals and students alike. *
                 Offers complete C implementations of many of the book's
                 examples via a companion Web site.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "Preface \\
                 1: P. B{\'e}zier: How a Simple System Was Born \\
                 2: Introductory Material \\
                 3: Linear Interpolation \\
                 4: The de Casteljau Algorithm \\
                 5: The Bernstein Form of a B{\'e}zier Curve \\
                 6: B{\'e}zier Curve Topics \\
                 7: Polynomial Curve Constructions \\
                 8: B-Spline Curves \\
                 9: Constructing Spline Curves \\
                 10: W. Boehm: Differential Geometry I \\
                 11: Geometric Continuity \\
                 12: Conic Sections \\
                 13: Rational B{\'e}zier and B-Spline Curves \\
                 14: Tensor Product Patches \\
                 15: Constructing Polynomial Patches \\
                 16: Composite Surfaces \\
                 17: B{\'e}zier Triangles \\
                 18: Practical Aspects of B{\'e}zier Triangles \\
                 19: W. Boehm: Differential Geometry II \\
                 20: Geometric Continuity for Surfaces \\
                 21: Surfaces with Arbitrary Topology \\
                 22: Coons Patches \\
                 23: Shape \\
                 24: Evaluation of Some Methods \\
                 Appendix A: Quick Reference of Curve and Surface Terms
                 \\
                 Appendix B: List of Programs \\
                 Appendix C: Notation \\
                 References \\
                 Index",
}

@Book{Farmelo:2009:SMH,
  author =       "Graham Farmelo",
  title =        "The Strangest Man: The Hidden Life of {Paul Dirac},
                 Mystic of the Atom",
  publisher =    pub-BASIC-BOOKS,
  address =      pub-BASIC-BOOKS:adr,
  pages =        "539 + 8",
  year =         "2009",
  ISBN =         "0-465-01827-0",
  ISBN-13 =      "978-0-465-01827-7",
  LCCN =         "QC16.D57; QC16.D57 F37 2009",
  bibdate =      "Wed Sep 23 11:41:26 2009",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/d/dirac-p-a-m.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;
                 library.mit.edu:9909/mit01",
  price =        "US\$29.95",
  URL =          "http://bnreview.barnesandnoble.com/t5/The-Thinking-Read/The-Strangest-Man-The-Hidden-Life-of-Paul-Dirac-Mystic-of-the/ba-p/1243",
  abstract =     "Paul Dirac was among the great scientific geniuses of
                 the modern age. One of the discoverers of quantum
                 mechanics, the most revolutionary theory of the past
                 century, his contributions had a unique insight,
                 eloquence, clarity, and mathematical power. His
                 prediction of antimatter was one of the greatest
                 triumphs in the history of physics. One of Einstein's
                 most admired colleagues, Dirac was in 1933 the youngest
                 theoretician ever to win the Nobel Prize in physics.
                 Dirac's personality is legendary. He was an
                 extraordinarily reserved loner, relentlessly
                 literal-minded and appeared to have no empathy with
                 most people. Yet he was a family man and was intensely
                 loyal to his friends. His tastes in the arts ranged
                 from Beethoven to Cher, from Rembrandt to Mickey Mouse.
                 Based on previously undiscovered archives, The
                 Strangest Man reveals the many facets of Dirac's
                 brilliantly original mind. A compelling human story,
                 The Strangest Man also depicts a spectacularly exciting
                 era in scientific history.",
  acknowledgement = ack-nhfb,
  subject =      "Dirac, P. A. M; (Paul Adrien Maurice); quantum theory;
                 physicists; Great Britain; biography",
  subject-dates = "1902--1984",
  tableofcontents = "Prologue \\
                 Strangest man \\
                 Abbreviations in notes \\
                 Notes \\
                 Bibliography \\
                 List of plates \\
                 Acknowledgements \\
                 Index",
}

@Book{Farquhar:1994:MPH,
  author =       "Erin Farquhar and Philip Bruce",
  title =        "The {MIPS} Programmer's Handbook",
  publisher =    pub-MORGAN-KAUFMANN,
  address =      pub-MORGAN-KAUFMANN:adr,
  pages =        "viii + 408",
  year =         "1994",
  ISBN =         "1-55860-297-6",
  ISBN-13 =      "978-1-55860-297-7",
  LCCN =         "QA76.6 .F375 1994",
  bibdate =      "Fri May 13 18:21:14 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/microchip.bib",
  price =        "US\$36.95",
  abstract =     "A hands-on view of the highly successful MIPS family
                 of microprocessors, written for programmers developing
                 systems applications for the MIPS platform. The MIPS
                 Programmer's Handbook describes the MIPS architecture
                 from the perspective of assembly- and C-language
                 programmers, with special emphasis on issues related to
                 embedded applications. Engineers writing system-level
                 programs for MIPS-based embedded systems will find the
                 topic selection especially useful including the
                 sections on software conventions, initializing the
                 processor in a bare machine environment, and writing
                 exception handlers. For convenient use, the instruction
                 set reference is presented with only one page per
                 instruction. The authors focus on the instructions
                 available to assembly-language programmers, rather than
                 on the hardware-level instruction set documented in
                 data books released by vendors of the MIPS processor.
                 Provides enough detail for anyone doing serious
                 system-level programming. Also included are ten
                 complete program examples, with line-by-line
                 explanations.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "1: Introduction \\
                 2: Software Conventions \\
                 3: Initialization \\
                 4: Exceptions \\
                 5: Instruction Set Reference \\
                 A: Overview of the MIPS1 Architecture \\
                 B: Instruction Summary \\
                 C: Prologue and Epilogue Templates \\
                 D: Include Files \\
                 E: Libraries \\
                 F: Vendors of MIPS Products",
}

@Book{Fattahi:1992:MVC,
  author =       "Abi Fattahi",
  title =        "{Maple V} Calculus Labs",
  publisher =    pub-BROOKS-COLE,
  address =      pub-BROOKS-COLE:adr,
  pages =        "92 + 3",
  year =         "1992",
  ISBN =         "0-534-19272-6",
  ISBN-13 =      "978-0-534-19272-3",
  LCCN =         "QA155.7.E4 F37 1992",
  bibdate =      "Fri May 28 12:12:01 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/maple-extract.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Faux:1979:CGD,
  author =       "I. D. Faux and M. J. Pratt",
  title =        "Computational Geometry for Design and Manufacture",
  publisher =    pub-ELLIS-HORWOOD,
  address =      pub-ELLIS-HORWOOD:adr,
  pages =        "329",
  year =         "1979",
  ISBN =         "0-470-26473-X",
  ISBN-13 =      "978-0-470-26473-7",
  LCCN =         "QA447 .F33",
  bibdate =      "Tue Dec 14 22:48:04 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "UK\pounds 12.00",
  series =       "Ellis Horwood Series in Mathematics and its
                 Applications, Editor: G. M. Bell",
  acknowledgement = ack-nhfb,
}

@Book{Feeney:1988:SGM,
  author =       "Mary Feeney",
  title =        "The Standard Generalized Markup Language ({SGML})",
  volume =       "9",
  publisher =    "British Library Research and Development Dept. and
                 Library \& Information Technology Centre",
  address =      "London, UK",
  pages =        "15",
  year =         "1988",
  ISSN =         "0954-1829",
  LCCN =         "Z286.E43 F44 1988",
  bibdate =      "Thu Jun 23 16:19:44 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Library \& information briefing",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  xxISBN =       "none",
}

@Book{Feiveson:2014:UBF,
  author =       "Harold A. Feiveson and Alexander Glaser and Zia Mian
                 and Frank N. von Hippel",
  title =        "Unmaking the bomb: a fissile material approach to
                 nuclear disarmament and nonproliferation",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "x + 4 + 277",
  year =         "2014",
  ISBN =         "0-262-02774-7 (hardcover), 0-262-31918-7 (e-book)",
  ISBN-13 =      "978-0-262-02774-8 (hardcover), 978-0-262-31918-8
                 (e-book)",
  LCCN =         "JZ5675 .F45 2014",
  bibdate =      "Sat Mar 14 10:51:34 MDT 2015",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/s/szilard-leo.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  subject =      "Polemologie; Kernenergie",
  subject =      "Nuclear nonproliferation; Nuclear disarmament; Nuclear
                 fuels; Management; Security measures; POLITICAL
                 SCIENCE; Government; International; International
                 Relations; General; Nuclear disarmament; Management;
                 Security measures; Nuclear nonproliferation; POLITICAL
                 SCIENCE / Security (National and International)",
  tableofcontents = "1. Introduction / 1 \\
                 I. How the Nuclear World Emerged / 19 \\
                 2. Production, uses and stocks of nuclear-weapon
                 materials / 21 \\
                 3. The history of fissile-material production for
                 weapons / 43 \\
                 4. The global stockpile of fissile material / 69 \\
                 II. Breaking the Nuclear Energy--Weapons Link / 85 \\
                 5. Fissile materials, nuclear power, and nuclear
                 proliferation / 87 \\
                 6. Ending the separation of plutonium / 107 \\
                 7. Ending the use of HEU as a reactor fuel / 125 \\
                 III. Eliminating Fissile Materials / 141 \\
                 8. Ending production of fissile materials for weapons /
                 143 \\
                 9. Disposal of fissile materials / 159 \\
                 10. Conclusion: meeting the fissile material challenge
                 / 173 \\
                 Appendix 1: Enrichment Plants / 185 \\
                 Appendix 2: Reprocessing Plants / 187 \\
                 Notes / 189 \\
                 Glossary / 233 \\
                 Bibliography / 243 \\
                 Index / 263",
}

@Book{Feldman:2007:MSE,
  author =       "Burton Feldman and Katherine Williams",
  title =        "{112 Mercer Street}: {Einstein}, {Russell},
                 {G{\"o}del}, {Pauli}, and the end of innocence in
                 science",
  publisher =    "Arcade Publishing",
  address =      "New York, NY, USA",
  pages =        "xx + 243",
  year =         "2007",
  ISBN =         "1-55970-704-6",
  ISBN-13 =      "978-1-55970-704-6",
  LCCN =         "Q141 .F345 2007",
  bibdate =      "Mon Aug 20 14:51:01 MDT 2007",
  bibsource =    "clio-db.cc.columbia.edu:7090/Voyager;
                 https://www.math.utah.edu/pub/bibnet/authors/h/heisenberg-werner.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/o/oppenheimer-j-robert.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/p/pauli-wolfgang.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://www.loc.gov/catdir/toc/ecip078/2007001194.html",
  abstract =     "Recounts the friendship between Albert Einstein,
                 Bertrand Russell, Wolfgang Pauli, and Kurt G{\"o}del in
                 the final years of World War II, exploring how the
                 friends influenced one another's work and beliefs.",
  acknowledgement = ack-nhfb,
  remark =       "The first author died before the book was completed;
                 the second author edited and completed the work.",
  subject =      "Scientists; History; Biography; Philosophy; Science;
                 Einstein, Albert; Russell, Bertrand; G{\"o}del, Kurt;
                 Pauli, Wolfgang; Heisenberg, Werner; Oppenheimer, J.
                 Robert",
  subject-dates = "1879--1955 (Einstein); 1872--1970 (Russell);
                 1906--1978 (G{\"o}del)",
  tableofcontents = "Part 1: The pathos of science \\
                 Princeton, Winter 1943--44 \\
                 Aging genius \\
                 Science and sin \\
                 At home in Princeton \\
                 Part 2 Four lives \\
                 Einstein \\
                 Russell: aristocrat in turmoil \\
                 G{\"o}del: ghost of genius \\
                 Pauli: the Devil's advocate \\
                 Part 3: The universe \\
                 The logic of paradox \\
                 The mechanical world \\
                 Relativity of time and space \\
                 On the quantum path \\
                 The Copenhagen Interpretation \\
                 Einstein and Unified Theory: chasing the rainbow \\
                 The persistence of nature \\
                 Part 4: Beyond pathos: Oppenheimer, Heisenberg, and the
                 War \\
                 Wartime Berlin, Winter 1943--44 \\
                 Heisenberg \\
                 Wartime Los Alamos, Winter 1943--44 \\
                 Oppenheimer \\
                 Dangerous knowledge: the new security order \\
                 The projects of science",
}

@TechReport{Feldman:fortlex,
  author =       "Stuart I. Feldman",
  title =        "{FORTLEX}: {A} General Purpose Lexical Analyzer for
                 {Fortran}",
  number =       "51",
  institution =  pub-ATT-BELL,
  address =      pub-ATT-BELL:adr,
  month =        oct,
  year =         "1976",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Ferguson:1993:MRM,
  author =       "Paula Ferguson and David Brennan",
  title =        "{Motif} Reference Manual",
  volume =       "6B",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xii + 908",
  month =        jun,
  year =         "1993",
  ISBN =         "1-56592-038-4",
  ISBN-13 =      "978-1-56592-038-5",
  LCCN =         "QA76.76.W56F47 1993",
  bibdate =      "Fri Jul 22 08:30:58 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$34.95",
  series =       "The definitive guides to the X Window System",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0915/94185493-b.html;
                 http://www.loc.gov/catdir/enhancements/fy0915/94185493-d.html",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "Motif (Computer file); X Window System (Computer
                 system)",
}

@Book{Ferguson:2003:PC,
  author =       "Niels Ferguson and Bruce Schneier",
  title =        "Practical Cryptography",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xx + 410",
  year =         "2003",
  ISBN =         "0-471-22894-X (hardcover), 0-471-22357-3 (paperback)",
  ISBN-13 =      "978-0-471-22894-3 (hardcover), 978-0-471-22357-3
                 (paperback)",
  LCCN =         "QA76.9.A25 F466 2003",
  bibdate =      "Mon Apr 21 16:29:39 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://www.counterpane.com/book-practical.html;
                 http://www.loc.gov/catdir/bios/wiley044/2003276249.html;
                 http://www.loc.gov/catdir/description/wiley036/2003276249.html;
                 http://www.loc.gov/catdir/toc/wiley032/2003276249.html",
  abstract =     "Security is the number one concern for businesses
                 worldwide. The gold standard for attaining security is
                 cryptography because it provides the most reliable
                 tools for storing or transmitting digital
                 information.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Our design philosophy \\
                 2: The context of cryptography \\
                 3: Introduction to cryptography \\
                 4: Block ciphers \\
                 5: Block cipher modes \\
                 6: Hash functions \\
                 7: Message authentication codes \\
                 8: The secure channel \\
                 9: Implementation issues \\
                 10: Generating randomness \\
                 11: Primes \\
                 12: Diffie--Hellman \\
                 13: RSA \\
                 14: Introduction to cryptographic protocols \\
                 15: Key negotiation protocol \\
                 16: Implementation issues 2 \\
                 17: The clock \\
                 18: Key servers \\
                 19: The dream of PKI \\
                 20: PKI reality \\
                 21: PKI practicalities \\
                 22: Storing secrets \\
                 23: Standards \\
                 24: Patents \\
                 25: Involving experts",
}

@Book{Ferguson:2010:CED,
  author =       "Niels Ferguson and Bruce Schneier and Tadayoshi
                 Kohno",
  title =        "Cryptography Engineering: Design Principles and
                 Practical Applications",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xxix + 353",
  year =         "2010",
  DOI =          "https://doi.org/10.1002/9781118722367",
  ISBN =         "0-470-47424-6 (paperback)",
  ISBN-13 =      "978-0-470-47424-2 (paperback)",
  LCCN =         "QA76.9.A25 F466 2010",
  bibdate =      "Sun Mar 28 14:55:52 MDT 2010",
  bibsource =    "aubrey.tamu.edu:7090/voyager;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  remark =       "A fully updated version of the first two authors' {\em
                 Practical cryptography} (2003).",
  tableofcontents = "Part I. Introduction. The context of cryptography
                 \\
                 Introduction to cryptography \\
                 Part II. Message security. Block ciphers \\
                 Block cipher modes \\
                 Hash functions \\
                 Message authentication codes \\
                 The secure channel \\
                 Implementation issues (I) \\
                 Part III. Key negotiation. Generating randomness \\
                 Primes \\
                 Diffie--Hellman \\
                 RSA \\
                 Introduction to cryptographic protocols \\
                 Key negotiation \\
                 Implementation issues (II) \\
                 Part IV. Key management. The clock \\
                 Key servers \\
                 The dream of PKI \\
                 PKI reality \\
                 PKI practicalities \\
                 Storing secrets \\
                 Part V. Miscellaneous. Standards and patents \\
                 Involving experts",
}

@Book{Fernando:2004:GGP,
  editor =       "Randima Fernando",
  title =        "{GPU} gems: programming techniques, tips, and tricks
                 for real-time graphics",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xvv + 765",
  year =         "2004",
  ISBN =         "0-321-22832-4",
  ISBN-13 =      "978-0-321-22832-1",
  LCCN =         "T385 .G6879 2004",
  bibdate =      "Mon Apr 5 18:05:00 MDT 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  price =        "US\$45.99",
  abstract =     "Randima Fernando removes the mystery behind complex
                 effects and reveals the full potential of programmable
                 GPUs (graphics processing units). He covers some of the
                 most difficult effects, such as simulating fire, water,
                 and waving blades of grass.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "Computer graphics; Real-time programming",
  tableofcontents = "Natural effects \\
                 Lighting and shadows \\
                 Materials \\
                 Image processing \\
                 Performance and practicalities \\
                 Beyond triangles",
}

@Book{Fernbach:1986:SCV,
  author =       "Sidney Fernbach",
  title =        "Supercomputers: Class {VI} Systems, Hardware and
                 Software",
  publisher =    pub-NORTH-HOLLAND,
  address =      pub-NORTH-HOLLAND:adr,
  pages =        "vii + 251",
  year =         "1986",
  ISBN =         "0-444-87981-1",
  ISBN-13 =      "978-0-444-87981-3",
  LCCN =         "QA76.5.S896 1986",
  bibdate =      "Tue Dec 14 22:48:08 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Ferraro:1988:PGE,
  author =       "Richard F. Ferraro",
  title =        "Programmer's Guide to the {EGA} and {VGA} Cards",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xxvii + 607",
  year =         "1988",
  ISBN =         "0-201-12692-3",
  ISBN-13 =      "978-0-201-12692-1",
  LCCN =         "QA 76.8 I2594 .F48 1988",
  bibdate =      "Tue Dec 14 22:48:16 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$29.95",
  acknowledgement = ack-nhfb,
}

@Book{Ferris:2020:BEA,
  author =       "John Ferris",
  title =        "Behind the {Enigma}: the authorised history of {GCHQ},
                 {Britain}'s secret cyber-intelligence agency",
  publisher =    "Bloomsbury",
  address =      "London, UK",
  pages =        "xiv + 823 + 24",
  year =         "2020",
  ISBN =         "1-5266-0546-5 (hardcover), 1-5266-0547-3 (paperback),
                 1-5266-0548-1 (paperback), 1-5266-0549-X (e-book)",
  ISBN-13 =      "978-1-5266-0546-7 (hardcover), 978-1-5266-0547-4
                 (paperback), 978-1-5266-0548-1 (paperback),
                 978-1-5266-0549-8 (e-book)",
  LCCN =         "UB251.G7 F47 2020",
  bibdate =      "Tue Jan 13 06:31:38 MST 2026",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "For a hundred years GCHQ Government Communications
                 Headquarters has been at the forefront of British
                 secret statecraft. Born out of the need to support
                 military operations in the First World War, and fought
                 over ever since, today it is the UK's biggest
                 intelligence, security and cyber agency and a powerful
                 tool of the British state. Famed primarily for its
                 codebreaking achievements at Bletchley Park against
                 Enigma ciphers in the Second World War, GCHQ has
                 intercepted, interpreted and disrupted the information
                 networks of Britain's foes for a century, and yet it
                 remains the least known and understood of British
                 intelligence services. It has been one of the most
                 open-minded, too --- GCHQ has always demanded a
                 diversity of intellectual firepower, finding it in
                 places which strike us as ground-breaking today, and
                 allying it to the efforts of ordinary men and women to
                 achieve extraordinary insights in war, diplomacy and
                 peace. GCHQ shapes British decision-making more than
                 any other intelligence organisation and, along with its
                 partners in the Five Eyes intelligence partnership, has
                 become ever more crucial in an age governed by
                 information technology. Based on unprecedented access
                 to documents in GCHQ's archive, many of them hitherto
                 classified, this is the first book to authoritatively
                 explain the entire history of one of the world's most
                 potent intelligence agencies. Many of the major
                 international episodes of the last century including
                 the retreat from empire, the Cold War and the Falklands
                 become fully explicable only in the light of the secret
                 intelligence record. Written by one of the world's
                 leading experts in intelligence and strategy, Behind
                 the Enigma reveals the fascinating truth behind this
                 most remarkable and enigmatic of organisations.",
  acknowledgement = ack-nhfb,
  subject =      "Intelligence service; Great Britain; History;
                 Espionage, British; Enigma cipher system; Espionnage
                 britannique; Histoire; Enigma (Machine {\`a}
                 chiffrer)",
  tableofcontents = "Foreword / xi / \\
                 Introduction / 1 \\
                 1: The origins of modern British Sigint, 1844--1914 / 9
                 \\
                 2: Britain and the birth of Signals Intelligence,
                 1914--18 / 29 \\
                 3: Whitehall's Black Chamber: British cryptology and
                 the Government Code and Cypher School, 1919--39 / 66
                 \\
                 4: Cryptoanalysis and British foreign policy, 1919--39
                 / 117 \\
                 5: Bletchley / 163 \\
                 6: Ultra and the Second World War, 1939--45 / 223 \\
                 7: Cheltenham: GCHQ, Britain and Whitehall, 1945--92 /
                 267 \\
                 8: UKUSA and the international politics of Sigint,
                 1941--92 / 324 \\
                 9: 'We want to be Chetlonians': the Department / 390
                 \\
                 10: Just who are these guys, anyway? A
                 historical--sociological analysis of GCHQ, 1939--89 /
                 437 \\
                 11: Intercept to end product: the collection,
                 processing and dissemination of Sigint, 1945--92 / 480
                 \\
                 12: GCHQ vs the Main Enemy: Signals Intelligence and
                 the Cold War, 1945--92 / 502 \\
                 13: Comint and the End of Empire, 1945--82: Palestine,
                 Konfrontasi and the Falkland Islands / 552 \\
                 14: Secrecy, translucency and oversight, 1830--2019 /
                 658 \\
                 15: GCHQ and the Second Age of Sigint, 1990--2020 / 676
                 \\
                 Conclusion / 714 \\
                 Appendix; GCHQ by the Numbers, 1960--95 / 717 \\
                 Notes / 730 \\
                 Acknowledgements / 805 \\
                 Index / 807",
}

@Book{Feynman:1985:SYJ,
  author =       "Richard P. Feynman and Ralph Leighton and Edward
                 Hutchings",
  title =        "``Surely You're Joking, {Mr. Feynman}!'': {Adventures}
                 of a Curious Character",
  publisher =    pub-BANTAM,
  address =      pub-BANTAM:adr,
  pages =        "xi + 322",
  year =         "1985",
  ISBN =         "0-553-25649-1",
  ISBN-13 =      "978-0-553-25649-9",
  LCCN =         "QC16.F49A37 1986",
  bibdate =      "Sat Jan 21 18:59:43 GMT 1995",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  remark =       "Chapter `Lucky Numbers', pages 173--178.",
  subject =      "Feynman, Richard Phillips; Physicists; United States;
                 Biography; Science; Anecdotes",
}

@Book{Feynman:1988:WDY,
  author =       "Richard Phillips Feynman and Ralph Leighton",
  title =        "What do {YOU} care what other people think?: {Further}
                 adventures of a curious character",
  publisher =    pub-NORTON,
  address =      pub-NORTON:adr,
  pages =        "255",
  year =         "1988",
  ISBN =         "0-393-02659-0",
  ISBN-13 =      "978-0-393-02659-7",
  LCCN =         "QC16.F49 A3 1988",
  bibdate =      "Mon Dec 12 15:40:42 MST 2005",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/f/feynman-richard-p.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.loc.gov:7090/Voyager",
  price =        "US\$17.95",
  abstract =     "One of the greatest physicists of the twentieth
                 century, Richard Feynman possessed an unquenchable
                 thirst for adventure and an unparalleled ability to
                 tell the stories of his life. Here is the story of how
                 two people most influenced Feynman's early years ---
                 his father, who taught him to think, and his first wife
                 Arlene [sic, i.e. Arline] who taught him to love, even
                 as she lay dying in an Albuquerque hospital while
                 Feynman worked nearby, on the atomic bomb at Los
                 Alamos. And here are lighter moments, some told through
                 letters, as Feynman reports from Geneva, Trinidad,
                 Greece, and Japan on the effects this curious character
                 has had on the locals. The second half of the book
                 \ldots{} is Feynman's behind-the-scenes account of the
                 investigation that followed the space shuttle
                 Challenger's explosion in January 1986.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "Feynman, Richard Phillips; Physicists; United States;
                 Biography; Science; Anecdotes",
  tableofcontents = "Part I. A curious character. The making of a
                 scientist \\
                 ``What do you care what other people think?'' \\
                 It's as simple as one, two three \ldots{} --- Getting
                 ahead \\
                 Hotel city \\
                 Who the hell is Herman? \\
                 Feynman sexist pig! \\
                 I just shook his hand, can you believe it? \\
                 Letters, photos, and drawings \\
                 Part II. Mr. Feynman goes to Washington: investigating
                 the space shuttle Challenger disaster. Preliminaries
                 \\
                 Committing suicide \\
                 The cold facts \\
                 Check six! \\
                 Gumshoes \\
                 Fantastic figures \\
                 An inflamed appendix \\
                 The tenth recommendation \\
                 Meet the press \\
                 Afterthoughts \\
                 Appendix F: Personal observations on the reliability of
                 the shuttle \\
                 Epilogue",
}

@Book{Feynman:1994:CPL,
  author =       "Richard Phillips Feynman",
  title =        "The Character of Physical Law",
  publisher =    "Modern Library",
  address =      "New York, NY, USA",
  edition =      "Modern Library",
  pages =        "xx + 167",
  year =         "1994",
  ISBN =         "0-679-60127-9",
  ISBN-13 =      "978-0-679-60127-2",
  LCCN =         "QC71 .F44 1994",
  bibdate =      "Fri Apr 8 22:15:10 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/f/feynman-richard-p.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  author-dates = "Richard Phillips Feynman (1918--1988)",
  libnote =      "Not yet in my library.",
  remark =       "Originally published in hardcover by the British
                 Broadcasting Corporation in 1965 and in paperback by
                 MIT Press in 1967.",
  subject =      "Physics",
  tableofcontents = "The law of gravitation, an example of physical law
                 \\
                 The relation of mathematics to physics \\
                 The great conservation principles \\
                 Symmetry in physical law \\
                 The distinction of past and future \\
                 Probability and uncertainty: the quantum mechanical
                 view of nature \\
                 Seeking new laws",
}

@Book{Feynman:1995:ARP,
  author =       "Richard P. (Richard Phillips) Feynman and Michelle
                 Feynman",
  title =        "The art of {Richard P. Feynman}: images by a curious
                 character",
  publisher =    "GB Science Publishers SA",
  address =      "Basel, Switzerland",
  pages =        "173",
  year =         "1995",
  ISBN =         "2-88449-047-7",
  ISBN-13 =      "978-2-88449-047-4",
  LCCN =         "NC1075.F44 A4 1995",
  bibdate =      "Fri Apr 8 22:15:10 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/f/feynman-richard-p.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  author-dates = "Richard Phillips Feynman (1918--1988)",
  libnote =      "Not yet in my library.",
  subject =      "Feynman, Richard Phillips",
  subject-dates = "Richard Phillips Feynman (1918--1988)",
  tableofcontents = "Foreword / 9 \\
                 Preface / 13 \\
                 But Is It Art? / 17 \\
                 Reminiscences \\
                 Drumming Up a Friendship / 41 \\
                 A Fine Man and Feyn Art / 45 \\
                 We Both Admired Leonardo / 49 \\
                 An Exercise in Honesty / 53 \\
                 Black and White Figures / 59 \\
                 Color Plates / 153 \\
                 Contributors / 169 \\
                 Biographical Note / 173",
}

@Book{Feynman:1995:SEP,
  author =       "Richard Phillips Feynman and Robert B. Leighton and
                 Matthew L. (Matthew Linzee) Sands",
  title =        "Six easy pieces: essentials of physics, explained by
                 its most brilliant teacher",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xxix + 145",
  year =         "1995",
  ISBN =         "0-201-40955-0, 0-201-40956-9 (set), 0-201-48308-4
                 (cassettes), 0-201-40825-2 (paperback)",
  ISBN-13 =      "978-0-201-40955-0, 978-0-201-40956-7 (set),
                 978-0-201-48308-6 (cassettes), 978-0-201-40825-6
                 (paperback)",
  LCCN =         "QC21.2 .F52 1995b; QC21.2 .F52 1995",
  bibdate =      "Mon Oct 26 18:14:25 MDT 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 melvyl.cdlib.org:210/CDL90",
  price =        "US\$22.00",
  series =       "Helix books",
  acknowledgement = ack-nhfb,
  subject =      "Physics",
  tableofcontents = "Introduction / Paul Davies \\
                 1. Atoms in Motion \\
                 2. Basic Physics \\
                 3. The Relation of Physics to Other Sciences \\
                 4. Conservation of Energy \\
                 5. The Theory of Gravitation \\
                 6. Quantum Behavior",
}

@Book{Feynman:1997:SEP,
  author =       "Richard Phillips Feynman",
  title =        "Six Not-so-easy Pieces: {Einstein}'s {Relativity},
                 Symmetry, and Space--time",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xxvii + 152",
  year =         "1997",
  ISBN =         "0-201-32841-0 (set), 0-201-15025-5 (hardcover),
                 0-201-32842-9 (paperback), 0-201-31151-8 (disc 1),
                 0-201-31152-6 (disc 2), 0-201-31153-4 (disc 3),
                 0-201-31154-2 (disc 4), 0-201-31155-0 (disc 5),
                 0-201-31156-9 (disc 6)",
  ISBN-13 =      "978-0-201-32841-7 (set), 978-0-201-15025-4
                 (hardcover), 978-0-201-32842-4 (paperback),
                 978-0-201-31151-8 (disc 1), 978-0-201-31152-5 (disc 2),
                 978-0-201-31153-2 (disc 3), 978-0-201-31154-9 (disc 4),
                 978-0-201-31155-6 (disc 5), 978-0-201-31156-3 (disc
                 6)",
  LCCN =         "QC793.3.S9 F49 199",
  bibdate =      "Mon Oct 26 18:17:15 MDT 2009",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/f/feynman-richard-p.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.gbv.de:20011/gvk",
  note =         "Originally prepared for publication by Robert B.
                 Leighton and Matthew L. (Matthew Linzee) Sands. New
                 introduction by Roger Penrose. See also
                 \cite{Feynman:1995:SEP}",
  series =       "Helix books",
  acknowledgement = ack-nhfb,
  author-dates = "Richard Phillips Feynman (1918--1988)",
  subject =      "Symmetry (Physics); Special Relativity (physics);
                 Space and time",
  tableofcontents = "1. Vectors \\
                 2. Symmetry in Physical Laws \\
                 3. The Special Theory of Relativity \\
                 4. Relativistic Energy and Momentum \\
                 5. Space--time \\
                 6. Curved Space",
}

@Book{Feynman:1998:MIA,
  author =       "Richard Phillips Feynman",
  title =        "The Meaning of It All: Thoughts of a Citizen
                 Scientist",
  publisher =    pub-PERSEUS,
  address =      pub-PERSEUS:adr,
  pages =        "133",
  year =         "1998",
  ISBN =         "0-7382-0166-9 (paperback)",
  ISBN-13 =      "978-0-7382-0166-5 (paperback)",
  LCCN =         "Q175.55 .F49 1998",
  bibdate =      "Mon Dec 12 15:45:23 MST 2005",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/f/feynman-richard-p.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "In April 1963, Richard P. Feynman gave a series of
                 remarkable lectures at the University of Washington in
                 Seattle. These three consecutive talks were classic
                 Feynman --- full of wit and wisdom --- but their
                 subject matter was wholly unexpected: Feynman spoke not
                 as a physicist but as a concerned fellow citizen,
                 revealing his uncommon insights into the religious,
                 political, and social issues of the day. Now, at last,
                 these lectures have been published under the collective
                 title \booktitle{The Meaning of It All}. Here is
                 Feynman on mind reading and the laws of probability and
                 statistics; on Christian Science and the dubious effect
                 of prayer on healing; and on human interpersonal
                 relationships. Here is the citizen--scientist on the
                 dramatic effect simple engineering projects could have
                 on the plague of poverty; the vital role creativity
                 plays in science; the conflict between science and
                 religion; the efficacy of doubt and uncertainty in
                 arriving at scientific truths; and why honest
                 politicians can never be successful.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "Science; Social aspects; Religion and science",
  tableofcontents = "The Uncertainty of Science \\
                 The Uncertainty of Values \\
                 This Unscientific Age",
}

@Book{Feynman:2005:FTN,
  author =       "Richard P. (Richard Phillips) Feynman and Laurie M.
                 Brown and P. A. M. (Paul Adrien Maurice) Dirac",
  title =        "{Feynman}'s Thesis: a New Approach to Quantum Theory",
  publisher =    pub-WORLD-SCI,
  address =      pub-WORLD-SCI:adr,
  pages =        "xxii + 119",
  year =         "2005",
  ISBN =         "981-256-366-0, 981-256-380-6 (paperback)",
  ISBN-13 =      "978-981-256-366-8, 978-981-256-380-4 (paperback)",
  LCCN =         "QC174.12 .F48 2005",
  bibdate =      "Fri Apr 8 22:15:10 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/d/dirac-p-a-m.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/f/feynman-richard-p.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  ZMnumber =     "Zbl 1122.81007",
  acknowledgement = ack-nhfb,
  author-dates = "Richard Phillips Feynman (1918--1988); P. A. M. Dirac
                 (1902--1984)",
  libnote =      "Not yet in my library.",
  remark =       "First paper originally presented as R. P. Feynman's
                 thesis (Ph.D., Princeton University, 1942). Second
                 paper originally published: 1948; third paper
                 originally published: 1933. The principle of least
                 action in quantum mechanics / R. P. Feynman.
                 Space--time approach to non-relativistic quantum
                 mechanics / R. P. Feynman. The Lagrangian in quantum
                 mechanics / P. A. M. Dirac.",
  subject =      "Quantum theory; Least action; Lagrangian functions",
  tableofcontents = "The principle of least action in quantum mechanics
                 / R. P. Feynman \\
                 Space--time approach to non-relativistic quantum
                 mechanics / R. P. Feynman \\
                 The Lagrangian in quantum mechanics / P. A. M. Dirac",
  xxISBN =       "Bad ISBN in book: 981-256-366-0, 981-256-380-6
                 (paperback)",
}

@Book{Finch:2003:MC,
  author =       "Steven R. Finch",
  title =        "Mathematical Constants",
  volume =       "94",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xix + 602",
  year =         "2003",
  ISBN =         "0-521-81805-2 (hardcover), 1-107-26335-2 (e-book),
                 1-107-26691-2 (e-book)",
  ISBN-13 =      "978-0-521-81805-6 (hardcover), 978-1-107-26335-2
                 (e-book), 978-1-107-26691-9 (e-book)",
  LCCN =         "QA41 .F54 2003",
  bibdate =      "Mon Dec 31 07:47:16 MST 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/pi.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Encyclopedia of mathematics and its applications",
  URL =          "http://algo.inria.fr/bsolve/constant/table.html;
                 http://numbers.computation.free.fr/Constants/constants.html;
                 http://www.cambridge.org/us/catalogue/catalogue.asp?isbn=0521818052;
                 http://www.loc.gov/catdir/description/cam031/2002074058.html;
                 http://www.loc.gov/catdir/samples/cam034/2002074058.html;
                 http://www.loc.gov/catdir/toc/cam031/2002074058.html",
  abstract =     "Famous mathematical constants include the ratio of
                 circular circumference to diameter, $ \pi = 3.14 \ldots
                 {} $, and the natural logarithmic base, $ e = 2.178
                 \ldots {} $. Students and professionals usually can
                 name at most a few others, but there are many more
                 buried in the literature and awaiting discovery. How do
                 such constants arise, and why are they important? Here
                 Steven Finch provides 136 essays, each devoted to a
                 mathematical constant or a class of constants, from the
                 well known to the highly exotic. Topics covered include
                 the statistics of continued fractions, chaos in
                 nonlinear systems, prime numbers, sum-free sets,
                 isoperimetric problems, approximation theory,
                 self-avoiding walks and the Ising model (from
                 statistical physics), binary and digital search trees
                 (from theoretical computer science), the
                 Prouhet--Thue--Morse sequence, complex analysis,
                 geometric probability and the traveling salesman
                 problem. This book will be helpful both to readers
                 seeking information about a specific constant, and to
                 readers who desire a panoramic view of all constants
                 coming from a particular field, for example
                 combinatorial enumeration or geometric optimization.
                 Unsolved problems appear virtually everywhere as well.
                 This is an outstanding scholarly attempt to bring
                 together all significant mathematical constants in one
                 place.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Mathematical constants",
  tableofcontents = "Volume 1 \\
                 1. Well-known constants \\
                 2: Constants associated with number theory \\
                 3: Constants associated with analytic inequalities \\
                 4: Constants associated with the approximation of
                 functions \\
                 5: Constants associated with enumerating discrete
                 structures \\
                 6: Constants associated with functional iteration \\
                 7: Constants associated with complex analysis \\
                 8: Constants associated with geometry \\
                 Volume 2:\\
                 1: Number theory and combinatorics \\
                 2: Inequalitites and approximation \\
                 3: Real and complex analysis \\
                 4: Probability and stochastic processes \\
                 5: Geometry and topology",
}

@Book{Finlayson:2011:HWW,
  author =       "Clive Finlayson",
  title =        "Humans who went extinct: why {Neanderthals} died out
                 and we survived",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  pages =        "xii + 273",
  year =         "2009",
  ISBN =         "0-19-923918-5 (hardcover), 0-19-923919-3 (paperback)",
  ISBN-13 =      "978-0-19-923918-4 (hardcover), 978-0-19-923919-1
                 (paperback)",
  LCCN =         "GN285 .F54 2009",
  bibdate =      "Fri Mar 27 14:24:18 MDT 2015",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "``We have all heard the account of how our clever
                 ancestors spread From Africa and ousted the primitive
                 Neanderthals, driving them to extinction. But was that
                 really how it happened?'' ```History is typically the
                 story of victors over vanquished and prehistory is no
                 different', says Clive Finlayson. He presents an
                 altogether more humbling view: there is nothing to
                 suggest that our ancestors were inherently smarter than
                 the Neanderthals. We should think of the two as
                 different kinds of human.'' ``The topic of early human
                 history is highly contentious. Finlayson presents an
                 account that places the various human populations
                 firmly within an ecological context. Drawing on
                 evidence not only from fossils and genes, but also from
                 the many clues about lifestyle from plant and animal
                 remains, he underlines the interweaving of climate,
                 ecology, geography, and lifestyle in the fortunes of
                 populations. What emerges is no simple linear rise to
                 conquest and dominance by one superior species.
                 Instead, we find a complex tale of shifting patterns of
                 settlement and migration, of new skills learnt and
                 lost, as groups of humans of initially quite similar
                 abilities sought out a living in changing mosaics of
                 vegetation and wildlife. Chance, climate, and geography
                 favoured a sturdy group of our ancestors who had honed
                 their skills in the harsh, persistent Asian
                 steppes.''",
  acknowledgement = ack-nhfb,
  subject =      "Neanderthals; Extinction (Biology); Evolutionary
                 paleoecology; Evolutionary paleoecology; Extinction
                 (Biology); Neanderthals",
  tableofcontents = "Prologue: When climate changed the course of
                 history \\
                 The road to extinction is paved with good intentions
                 \\
                 Once we were not alone \\
                 Failed experiments \\
                 Stick to what you know best \\
                 Being in the right place at the right time \\
                 If only\ldots{} \\
                 Africa in Europe: a Mediterranean Serengeti \\
                 One small step for man\ldots{} \\
                 Forever opportunists \\
                 The pawn turned player \\
                 Epilogue: Children of chance",
}

@Book{Finseth:1991:CTE,
  author =       "Craig A. Finseth",
  title =        "The Craft of Text Editing: {Emacs} for the Modern
                 World",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xii + 220",
  year =         "1991",
  ISBN =         "0-387-97616-7 (New York), 3-540-97616-7 (Berlin)",
  ISBN-13 =      "978-0-387-97616-7 (New York), 978-3-540-97616-5
                 (Berlin)",
  LCCN =         "QA76.76.T49 F56 1991",
  MRclass =      "68-01, 68U15",
  bibdate =      "Tue Dec 14 22:48:42 1993",
  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",
  note =         "Contains extensive discussion of design issues for
                 text editors, with examples from Emacs. Appendix B
                 gives sources of numerous Emacs implementations.
                 Appendix D summarizes the TECO command set.",
  ZMnumber =     "0810.68012",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

@Book{Firmage:1993:AAS,
  author =       "Richard A. Firmage",
  title =        "The Alphabet Abecedarium: Some Notes on Letters",
  publisher =    pub-GODINE,
  address =      pub-GODINE:adr,
  pages =        "xi + 307",
  year =         "1993",
  ISBN =         "0-87923-987-5 (hardcover), 0-87923-998-0 (paperback)",
  ISBN-13 =      "978-0-87923-987-9 (hardcover), 978-0-87923-998-5
                 (paperback)",
  LCCN =         "P211 .F6 1993",
  bibdate =      "Wed Aug 10 09:58:07 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Drawing from Mythology, cosmology, history, the Bible,
                 literature, and esoteric and conventional sources, this
                 book takes the reader on a tour of each of the
                 twenty-six letters that comprise one of civilization's
                 greatest inventions, the Roman alphabet. In chapters
                 that are descriptive, illustrative, and diverse, we are
                 shown the history and development of every letter, how
                 its shape evolved, how its characteristics were
                 encoded, and how its history, attributes, and. Meanings
                 were reflected in myth, literature, science, and
                 religion. This is one of those books full of the fruits
                 of an inquiring and wide-ranging mind, rich in
                 surprises and serendipities, and profusely illustrated
                 with hundreds of letterforms and related drawings from
                 ancient scripts to present-day digitized computer
                 alphabets. The twenty-six alphabetic signs are, as
                 Firmage shows, building blocks of our consciousness.
                 Through the centuries they have been altered,. Written
                 about, and thought of in ways that will surprise and
                 delight even those who feel they are quite familiar
                 with our letters. Quoting sources as diverse as James
                 Joyce, Rabelais, Dostoevsky, Twain, Elmer Fudd, and Bob
                 Dylan, ranging from historical scholarship to deadpan
                 comedy, from mysticism to McLuhan, from Pompeii to Poe
                 to Pynchon, The Alphabet Abecedarium is a book for all
                 those who think they know their ABCs or would like to
                 learn them.",
  acknowledgement = ack-nhfb,
  idnumber =     "508",
  keywords =     "Alphabet --- History, Alphabets, Printing ---
                 History",
}

@Book{Fischer:1988:CC,
  author =       "Charles N. Fischer and Richard Joseph LeBlanc",
  title =        "Crafting a Compiler",
  publisher =    pub-BENCUM,
  address =      pub-BENCUM:adr,
  pages =        "xix + 811",
  year =         "1988",
  ISBN =         "0-8053-3201-4",
  ISBN-13 =      "978-0-8053-3201-8",
  LCCN =         "QA76.76.C65 F57 1988",
  bibdate =      "Tue Jan 13 09:46:14 MST 2026",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "The Benjamin/Cummings series in computer science",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library",
  tableofcontents = "A simple compiler \\
                 Scanning \\
                 Theory and practice \\
                 Grammars and Parsing \\
                 Grammars and Parsers \\
                 LR parsing \\
                 Semantic processing \\
                 Symbol tables \\
                 Run-time storage organization \\
                 Processing declarations \\
                 Processing expressions and data structure references
                 \\
                 Translating control structures \\
                 Translating procedures and functions \\
                 Attribute grammars and multipass translation \\
                 Code generation and local code optimization \\
                 Global optimization \\
                 Parsing in the real world",
}

@Book{Fischer:2010:CC,
  author =       "Charles N. Fischer and Ron K. Cytron and Richard J.
                 LeBlanc",
  title =        "Crafting a Compiler",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xxvii + 683",
  year =         "2010",
  ISBN =         "0-13-606705-0 (hardcover), 0-13-801785-9 (paperback)",
  ISBN-13 =      "978-0-13-606705-4 (hardcover), 978-0-13-801785-9
                 (paperback)",
  LCCN =         "QA76.76.C65 F57 2010",
  bibdate =      "Tue Jan 13 09:50:20 MST 2026",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Crafting a compiler with C",
  URL =          "https://www.pearson.com/en-us/subject-catalog/p/crafting-a-compiler/P200000003253/9780136067054",
  abstract =     "\booktitle{Crafting a Compiler} is an
                 undergraduate-level text that presents a practical
                 approach to compiler construction with thorough
                 coverage of the material and examples that clearly
                 illustrate the concepts in the book. Unlike other texts
                 on the market, Fischer / Cytron / LeBlanc use
                 object-oriented design patterns and incorporate an
                 algorithmic exposition with modern software practices.
                 The text and its package of accompanying resources
                 allow any instructor to teach a thorough and compelling
                 course in compiler construction in a single semester.
                 An ideal reference and tutorial.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library",
  subject =      "Compilers (Computer programs); Compilateurs
                 (Logiciels); Compilers (Computer programs)",
  tableofcontents = "Introduction \\
                 A simple compiler \\
                 Scanning \\
                 theory and practice \\
                 Grammars and parsing \\
                 Top-down parsing \\
                 Bottum-up parsing \\
                 Syntax-directed translation \\
                 Symbol tables and declaration processing \\
                 Semantic analysis \\
                 Intermediate representations \\
                 Code generation for a virtual machine \\
                 Runtime support \\
                 Target code generation \\
                 Program optimization",
}

@Book{Fisher:1961:CAG,
  author =       "Robert C. Fisher and Allen D. Ziebur",
  title =        "Calculus and Analytic Geometry",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "766",
  year =         "1961",
  LCCN =         "QA 303 F53c",
  bibdate =      "Wed Dec 15 15:39:38 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Fiume:1989:MSR,
  author =       "Eugene L. Fiume",
  title =        "The Mathematical Structure of Raster Graphics",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "xvi + 221",
  year =         "1989",
  ISBN =         "0-12-257960-7",
  ISBN-13 =      "978-0-12-257960-8",
  LCCN =         "T385 .F581 1989",
  bibdate =      "Tue Dec 14 22:48:45 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Flanagan:1991:PSR,
  author =       "David Flanagan",
  title =        "Programmer's Supplement for Release 5 of the {X}
                 Window System, Version 11",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xx + 367",
  year =         "1991",
  ISBN =         "0-937175-86-2",
  ISBN-13 =      "978-0-937175-86-6",
  LCCN =         "QA76.76.W56 F5 1991",
  bibdate =      "Tue Dec 14 22:48:47 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Flanagan:1992:XTI,
  author =       "David Flanagan",
  title =        "{X Toolkit Intrinsics} Reference Manual",
  volume =       "5",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  edition =      "Third",
  pages =        "xiii + 899",
  year =         "1992",
  ISBN =         "1-56592-007-4",
  ISBN-13 =      "978-1-56592-007-1",
  LCCN =         "QA76.76.W56 N94 1992",
  bibdate =      "Tue Dec 14 23:30:37 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/ora.bib",
  series =       "The Definitive guides to the X Window System",
  URL =          "http://www.oreilly.com/catalog/9781565920071;
                 http://www.oreilly.com/catalog/v5",
  abstract =     "Volume 5, \booktitle{X Toolkit Intrinsics Reference
                 Manual} is a complete programmer's reference for The X
                 Toolkit (Xt). Xt is a library of C functions that ease
                 the development of graphical user interfaces under the
                 X Window System by using pre-defined interface
                 components called ``widgets.'' This book covers the X
                 Toolkit Intrinsics in depth, and contains reference
                 pages for the Athena widgets. The third edition has
                 been updated to cover both Release 4 and Release 5 of
                 Xt, and each reference page has been revised and
                 reorganized to be easier to use and understand. This
                 book is designed to be used with Volume Four,
                 \booktitle{X Toolkit Intrinsics Programming Manual},
                 which describes how to build applications using the Xt
                 Intrinsics and provides a complete tutorial with
                 programming examples.",
  acknowledgement = ack-nhfb,
}

@Book{Flanagan:1995:JND,
  author =       "David Flanagan",
  title =        "{Java} in a Nutshell: a Desktop Quick Reference for
                 {Java} Programmers",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xix + 438",
  year =         "1995",
  ISBN =         "1-56592-183-6",
  ISBN-13 =      "978-1-56592-183-2",
  LCCN =         "QA76.73.J38F553 1996",
  bibdate =      "Tue May 14 15:29:59 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/java.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/ora.bib",
  price =        "US\$19.95",
  series =       "A Nutshell handbook",
  URL =          "http://www.ora.com/info/java",
  acknowledgement = ack-nhfb,
  annote =       "Covers Java 1.0. Contains an accelerated introduction
                 to Java for C and C++ programmers who want to learn the
                 language fast.",
  keywords =     "Java (Computer program language); Object-oriented
                 programming (Computer science); World Wide Web
                 servers.",
  tableofcontents = "Part 1. Introducing Java: How Java differs from C
                 \\
                 Classes and objects in Java \\
                 Part 2. Programming with the Java API \\
                 Applets \\
                 Graphical user interfaces \\
                 Input and output \\
                 Networking \\
                 Advanced graphics and images \\
                 Advanced threads \\
                 Part 3. Java syntax \\
                 Events \\
                 Fonts, colors, and cursors \\
                 System properties and applet parameters \\
                 Applet security \\
                 Java-related HTML and HTTP syntax \\
                 Unicode standard \\
                 JDK development tools \\
                 Part 4. API quick reference \\
                 java.applet package \\
                 java.awt package \\
                 java.awt.peer package \\
                 java.io package \\
                 java.lang package \\
                 java.net package \\
                 java.util package \\
                 Java errors and exceptions \\
                 Part 5. API cross references \\
                 Class defined-in index \\
                 Method defined-in index \\
                 Subclass index \\
                 Implemented-by index \\
                 Returned-by index \\
                 Passed-to index \\
                 Thrown-by index",
}

@Book{Flanagan:1997:JDG,
  author =       "David Flanagan",
  title =        "{JavaScript}: The Definitive Guide",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  edition =      "Second",
  pages =        "xiv + 647",
  year =         "1997",
  ISBN =         "1-56592-234-4",
  ISBN-13 =      "978-1-56592-234-1",
  LCCN =         "QA76.73.J39 F53 1997; QA76.73.V38 F53 1997",
  bibdate =      "Mon Apr 18 14:52:49 MDT 2005",
  bibsource =    "ftp://ftp.ora.com/pub/products/catalogs/book.catalog;
                 http://www.amazon.com/exec/obidos/ISBN=1565922344/wholesaleproductA/;
                 https://www.math.utah.edu/pub/tex/bib/java.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/ora.bib",
  URL =          "http://www.oreilly.com/catalog/9781565922341;
                 http://www.oreilly.com/catalog/jscript2",
  abstract =     "This reference guide to JavaScript, the HTML extension
                 that gives Web pages programming-language capabilities,
                 covers JavaScript as it is used in Netscape 3.0 and 2.0
                 and in Microsoft Internet Explorer 2.0. The book
                 includes the version of JavaScript shipped with
                 Navigator 2.0, 2.0.1, and 2.0.2, and also the
                 much-changed version of JavaScript shipped with
                 Navigator 3.0. LiveConnect, used for communication
                 between JavaScript and Java applets, and commonly
                 encountered bugs on JavaScript objects, are also
                 covered. This reference guide to JavaScript, the HTML
                 extension that gives Web pages programming-language
                 capabilities, covers JavaScript as it is used in
                 Netscape 3.0 and 2.0 and in Microsoft Internet Explorer
                 2.0. It includes the version of JavaScript shipped with
                 Navigator 2.0, 2.0.1, and 2.0.2.",
  acknowledgement = ack-nhfb,
  dimensions =   "9.23in x 7.04in x 1.38in",
  keywords =     "(computer program language); Java (Computer program
                 language); JavaScript; Object-oriented programming
                 (Computer science); technology --- computers and
                 computer technology; World Wide Web servers",
  paperback =    "yes",
  subject =      "JavaScript (Computer program language); Web servers;
                 Object-oriented programming (Computer science)",
  tableofcontents = "Introduction to JavaScript \\
                 Lexical structure \\
                 Variables and data types \\
                 Expressions and operators \\
                 Statements \\
                 Functions \\
                 Objects \\
                 Arrays \\
                 Further topics in JavaScript \\
                 Client-side program structure \\
                 Windows and the JavaScript name space \\
                 Programming with Windows \\
                 Navigator, location, and history objects \\
                 Documents and their contents \\
                 Saving state with cookies \\
                 Special effects with images \\
                 Forms and form elements \\
                 Compatibility techniques \\
                 LiveConnect: JavaScript and Java \\
                 JavaScript security",
}

@Book{Flannery:2001:CYW,
  author =       "Sarah Flannery and David Flannery",
  title =        "In Code: a [Young Women's] Mathematical Journey",
  publisher =    "Algonquin Books of Chapel Hill",
  address =      "Chapel Hill, NC, USA",
  pages =        "ix + 341",
  year =         "2001",
  ISBN =         "1-56512-377-8",
  ISBN-13 =      "978-1-56512-377-9",
  LCCN =         "QA29.F6 A3 2003",
  bibdate =      "Tue Feb 18 10:28:42 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$13.95",
  abstract =     "In January 1999, Sarah Flannery, a sports-loving
                 teenager from Blarney in County Cork, won Ireland's
                 Young Scientist of the Year award for her extraordinary
                 research and discoveries in Internet cryptography. Soon
                 her story and photograph were splashed across the front
                 page of the London Times, where she was called
                 ``brilliant.'' Her discoveries earned her the title
                 European Young Scientist of the Year. Just sixteen, she
                 was suddenly a mathematician with an international
                 reputation. Here is the story of how a girl next door
                 moved from the simple math puzzles that were the staple
                 of her family's dinnertime conversation to prime
                 numbers, the Sieve of Eratosthenes, Fermat's Little
                 Theorem, googols --- and finally into her breathtaking
                 algorithm. Parallel with each step is a modest girl's
                 own self-discovery. It's a heartwarming story that will
                 have readers cheering Sarah on.",
  acknowledgement = ack-nhfb,
  keywords =     "Cayley--Purser (CP) encryption; cryptography; RSA",
  tableofcontents = "Foreword / vii \\
                 Preface / ix \\
                 Part I: Background / 1 \\
                 1: Early influences / 3 \\
                 2: Early challenges / 8 \\
                 3: Beginning my first project / 32 \\
                 Part II: Mathematical excursions / 41 \\
                 4: Dad's evening class / 43 \\
                 5: Of prime importance / 47 \\
                 6: The Arithmetic of cryptography / 71 \\
                 7: Sums with a difference / 113 \\
                 8: One way only / 149 \\
                 9: Public key cryptography / 164 \\
                 Part III: Exhibition time / 187 \\
                 10: Young scientist '98 / 189 \\
                 11: Birth of a project / 194 \\
                 12: Young scientist '99 / 218 \\
                 Part IV: After-math / 229 13: Media blitz / 231 \\
                 14: Around the world and back / 254 \\
                 About this book / 269 \\
                 Appendix A: ``Cryptography --- New algorithm versus the
                 RSA'' / 271 \\
                 Appendix B: Answers to miscellaneous questions / 297
                 \\
                 Appendix C: Euclid's algorithm / 305 \\
                 Appendix D: Euler $\phi$-function and the Euler--Fermat
                 Theorem / 315 \\
                 Acknowledgments / 320 \\
                 Bibliography / 323 \\
                 Index / 325",
}

@Book{Fleisch:2008:SGM,
  author =       "Daniel A. Fleisch",
  title =        "A Student's Guide to {Maxwell}'s Equations",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "ix + 134",
  year =         "2008",
  ISBN =         "0-521-87761-X (hardcover), 0-521-70147-3 (paperback)",
  ISBN-13 =      "978-0-521-87761-9 (hardcover), 978-0-521-70147-1
                 (paperback)",
  LCCN =         "QC670 .F56 2008",
  bibdate =      "Sat Jun 13 11:04:54 MDT 2009",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/c/clerk-maxwell-james.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0803/2007037901-b.html;
                 http://www.loc.gov/catdir/enhancements/fy0803/2007037901-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0803/2007037901-t.html",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "1: Gauss's law for electric fields \\
                 2: Gauss's law for magnetic fields \\
                 3: Faraday's law \\
                 4: The Amp{\`e}re--Maxwell law \\
                 5: From Maxwell's equations to the wave equation \\
                 Appendix: Maxwell's equations in matter \\
                 Further reading \\
                 Index",
  subject =      "Maxwell equations",
  tableofcontents = "Preface / vii \\
                 Acknowledgments / ix \\
                 \\
                 1 Gauss's law for electric fields / 1 \\
                 1.1 The integral form of Gauss's law / 1 \\
                 The electric field / 3 \\
                 The dot product / 6 \\
                 The unit normal vector / 7 \\
                 The component of E normal to a surface / 8 \\
                 The surface integral / 9 \\
                 The flux of a vector field / 10 \\
                 The electric flux through a closed surface / 13 \\
                 The enclosed charge / 16 \\
                 The permittivity of free space / 18 \\
                 Applying Gauss's law (integral form) / 20 \\
                 1.2 The differential form of Gauss's law / 29 \\
                 Nabla --- the del operator / 31 \\
                 Del dot --- the divergence / 32 \\
                 The divergence of the electric field / 36 \\
                 Applying Gauss's law (differential form) / 38 \\
                 2 Gauss's law for magnetic fields / 43 \\
                 2.1 The integral form of Gauss's law / 43 \\
                 The magnetic field / 45 \\
                 The magnetic flux through a closed surface / 48 \\
                 Applying Gauss's law (integral form) / 50 \\
                 2.2 The differential form of Gauss's law / 53 \\
                 The divergence of the magnetic field / 54 \\
                 Applying Gauss's law (differential form) / 55 \\
                 3 Faraday's law / 58 \\
                 3.1 The integral form of Faraday's law / 58 \\
                 The induced electric field / 62 \\
                 The line integral / 64 \\
                 The path integral of a vector field / 65 \\
                 The electric field circulation / 68 \\
                 The rate of change of flux / 69 \\
                 Lenz's law / 71 \\
                 Applying Faraday's law (integral form) / 72 \\
                 3.2 The differential form of Faraday's law / 75 \\
                 Del cross --- the curl / 76 \\
                 The curl of the electric field / 79 \\
                 Applying Faraday's law (differential form) / 80 \\
                 4 The Ampere --- Maxwell law / 83 \\
                 4.1 The integral form of the Ampere --- Maxwell law /
                 83 \\
                 The magnetic field circulation / 85 \\
                 The permeability of free space / 87 \\
                 The enclosed electric current / 89 \\
                 The rate of change of flux / 91 \\
                 Applying the Ampere --- Maxwell law (integral form) /
                 95 \\
                 4.2 The differential form of the Ampere --- Maxwell law
                 / 101 \\
                 The curl of the magnetic field / 102 \\
                 The electric current density / 105 \\
                 The displacement current density / 107 \\
                 Applying the Ampere --- Maxwell law (differential form)
                 / 108 \\
                 5 From Maxwell's Equations to the wave equation / 112
                 \\
                 The divergence theorem / 114 \\
                 Stokes' theorem / 116 \\
                 The gradient / 119 \\
                 Some useful identities / 120 \\
                 The wave equation / 122 \\
                 \\
                 Appendix: Maxwell's Equations in matter / 125 \\
                 Further reading / 131 \\
                 Index / 132",
}

@Book{Fletcher:1980:PMO,
  author =       "R. Fletcher",
  title =        "Practical Methods of Optimization. Volume 1:
                 Unconstrained Optimization",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "viii + 120",
  year =         "1980",
  ISBN =         "0-471-27711-8",
  ISBN-13 =      "978-0-471-27711-8",
  LCCN =         "QA402.5 .F43",
  bibdate =      "Wed Dec 15 15:03:15 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Preface / vii \\
                 1: Introduction / 1 \\
                 2: Structure of Methods / 10 \\
                 3: Newton-like Methods / 33 \\
                 4: Conjugate Direction Methods / 63 \\
                 5: Restricted Step Methods / 77 \\
                 6: Sums of Squares and Non-linear Equations / 91 \\
                 References / 113 \\
                 Subject Index / 118",
  tableofcontents = "Preface / vii \\
                 1: Introduction / 1 \\
                 1.1 History and Applications / 1 \\
                 1.2 Mathematical Background / 4 \\
                 Questions for Chapter 1 / 9 \\
                 2: Structure of Methods / 10 \\
                 2.1 Conditions for Local Minima / 10 \\
                 2.2 Ad hoc Methods / 13 \\
                 2.3 Useful Algorithmic Properties / 16 \\
                 2.4 Descent Methods and Stability / 20 \\
                 2.5 Quadratic Models / 23 \\
                 2.6 Algorithms for the Line Search / 25 \\
                 Questions for Chapter 2 / 29 \\
                 3: Newton-like Methods / 33 \\
                 3.1 Newton's Method / 33 \\
                 3.2 Quasi-Newton Methods / 38 \\
                 3.3 Invariance and Metrics / 45 \\
                 3.4 The Broyden Family / 48 \\
                 3.5 Numerical Experiments / 54 \\
                 3.6 Other Formulae / 58 \\
                 Questions for Chapter 3 / 60 \\
                 4: Conjugate Direction Methods / 63 \\
                 4.1 Conjugate Gradient Methods / 63 \\
                 4.2 Direction Set Methods / 70 \\
                 Questions for Chapter 4 / 75 \\
                 5: Restricted Step Methods / 77 \\
                 5.1 A Model Algorithm / 77 \\
                 5.2 Levenberg--Marquardt Methods / 82 \\
                 Questions for Chapter 5 / 88 \\
                 6: Sums of Squares and Non-linear Equations / 91 \\
                 6.1 Over-determined Systems / 91 \\
                 6.2 Well-determined Systems of Equations / 98 \\
                 6.3 No-derivative Methods / 106 \\
                 Questions for Chapter 6 / 110 \\
                 References / 113 \\
                 Subject Index / 118",
}

@Book{Fletcher:1981:PMO,
  author =       "R. Fletcher",
  title =        "Practical Methods of Optimization. Volume 2:
                 Constrained Optimization",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "ix + 224",
  year =         "1981",
  ISBN =         "0-471-27828-9",
  ISBN-13 =      "978-0-471-27828-3",
  LCCN =         "QA402.5 .F43",
  bibdate =      "Wed Dec 15 15:03:44 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "Preface / vii \\
                 Errata to Volume 1 / ix \\
                 7: Introduction / 1 \\
                 8: Linear Programming / 11 \\
                 9: The Theory of Constrained Optimization / 46 \\
                 10: Quadratic Programming / 79 \\
                 11: General Linearly Constrained Optimization / 105 \\
                 12: Nonlinear Programming / 120 \\
                 13: Other Optimization Problems / 157 \\
                 14: Non-differentiable Optimization / 172 \\
                 References / 215 \\
                 Subject Index / 221",
  tableofcontents = "Preface / vii \\
                 Errata to Volume 1 / ix \\
                 7: Introduction / 1 \\
                 7.1 Preview / 1 \\
                 7.2 Elimination and Other Transformations / 6 \\
                 Questions for Chapter 7 / 10 \\
                 8: Linear Programming / 11 \\
                 8.1 Structure / 11 \\
                 8.2 The Simplex Method / 13 \\
                 8.3 Other LP Techniques / 19 \\
                 8.4 Feasible Points for Linear Constraints / 22 \\
                 8.5 Stahle and Large-scale Linear Programming / 27 \\
                 8.6 Degeneracy / 34 \\
                 Questions for Chapter 8 / 39 \\
                 9: The Theory of Constrained Optimization / 46 \\
                 9.1 Lagrange Multipliers / 46 \\
                 9.2 First Order Conditions / 52 \\
                 9.3 Second Order Conditions / 58 \\
                 9.4 Convexity / 63 \\
                 9.5 Duality / 69 \\
                 Questions for Chapter 9 / 74 \\
                 10: Quadratic Programming / 79 \\
                 10.1 Equality Constraints / 79 \\
                 10.2 Lagrangian Methods / 86 \\
                 10.3 The Active Set Method / 88 \\
                 10.4 Advanced Features / 92 \\
                 10.5 Special QP Problems / 95 \\
                 10.6 Complementary Pivoting and Other Methods / 97 \\
                 Questions for Chapter 10 / 101 \\
                 11: General Linearly Constrained Optimization / 105 \\
                 11.1 Equality Constraints / 105 \\
                 11.2 Inequality Constraints / 110 \\
                 11.3 Zigzagging / 113 \\
                 Questions for Chapter 11 / 117 \\
                 12: Nonlinear Programming / 120 \\
                 12.1 Penalty and Barrier Functions / 120 \\
                 12.2 Multiplier Penalty Functions / 130 \\
                 12.3 The Lagrange-Newton (SOLVER) Method / 138 \\
                 12.4 Nonlinear Elimination and Feasible Direction
                 Methods / 145 \\
                 12.5 Other Methods / 150 \\
                 Questions for Chapter 12 / 153 \\
                 13: Other Optimization Problems / 157 \\
                 13.1 Integer Programming / 157 \\
                 13.2 Geometric Programming / 164 \\
                 Questions for Chapter 13 / 170 \\
                 14: Non-differentiable Optimization / 172 \\
                 14.1 Introduction / 172 \\
                 14.2 Optimality Conditions / 178 \\
                 14.3 Exact Penalty Functions / 190 \\
                 14.4 Algorithms / 196 \\
                 14.5 A Globally Convergent Model Algorithm / 207 \\
                 Questions for Chapter 14 / 211 \\
                 References / 215 \\
                 Subject Index / 221",
}

@Book{Fletcher:2018:ESB,
  author =       "Seth Fletcher",
  title =        "{Einstein}'s Shadow: a Black Hole, a Band of
                 Astronomers, and the Quest to See the Unseeable",
  publisher =    "Ecco",
  address =      "New York, NY",
  pages =        "xxvii + 255",
  year =         "2018",
  ISBN =         "0-06-231204-9 (paperback), 0-06-231202-2 (hardcover),
                 0-06-231203-0 (e-book)",
  ISBN-13 =      "978-0-06-231204-4 (paperback), 978-0-06-231202-0
                 (hardcover), 978-0-06-231203-7 (e-book)",
  LCCN =         "QB843.B55 F595 2018",
  bibdate =      "Tue Nov 20 10:52:40 MST 2018",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Traces the efforts of an elite scientific team who
                 tested Einstein's theory of relativity during a
                 historic mission to photograph a black hole, addressing
                 key questions about time, space, and the nature of the
                 universe. [This book] follows a team of elite
                 scientists on their historic mission to take the first
                 picture of a black hole, putting Einstein's theory of
                 relativity to its ultimate test and helping to answer
                 our deepest questions about space, time, the origins of
                 the universe, and the nature of reality. Photographing
                 a black hole sounds impossible, a contradiction in
                 terms. But Shep Doeleman and a global coalition of
                 scientists are on the cusp of doing just that. With
                 exclusive access to the team, journalist Seth Fletcher
                 spent five years following Shep and an extraordinary
                 cast of characters as they assembled the Event Horizon
                 Telescope, a worldwide network of radio telescopes
                 created to study black holes. He witnessed the team's
                 struggles, setbacks, and breakthroughs, and, along the
                 way, Fletcher explored the latest thinking on the most
                 profound questions about black holes: Do they represent
                 a limit to our ability to understand reality? Or will
                 they reveal the clues that lead to the long-sought
                 theory of everything? Fletcher transforms astrophysics
                 into something exciting, accessible, and immediate,
                 taking us on an incredible adventure to better
                 understand the complexity of our galaxy, the boundaries
                 of human perception and knowledge, and how the messy
                 endeavor of science really works. Weaving a compelling
                 narrative account of human ingenuity with excursions
                 into cutting-edge science, Einstein's Shadow is a tale
                 of great minds on a mission to change the way we
                 understand our universe --- and our place in it.",
  acknowledgement = ack-nhfb,
  author-dates = "1979--",
  subject =      "Black holes (Astronomy); Space telescopes; SCIENCE /
                 Astronomy.; SCIENCE / Cosmology.; SCIENCE / Scientific
                 Instruments.; Astronomy; Popular works; Relativity
                 (Physics); Black holes (Astronomy.); Black holes
                 (Astronomy)",
  tableofcontents = "Acronyms and abbreviations \\
                 Selected cast of characters \\
                 Part One. The Veil and the Shadow \\
                 Part Two. Monsters Out There \\
                 Part Three. Firewalls \\
                 Part Four. The Earth-Size Telescope",
}

@Book{Flynn:1995:WHH,
  author =       "Peter Flynn",
  title =        "The {WorldWideWeb} Handbook: An {HTML} Guide for
                 Users, Authors and Publishers",
  publisher =    pub-ITCP,
  address =      pub-ITCP:adr,
  pages =        "xix + 351",
  year =         "1995",
  ISBN =         "1-85032-205-8",
  ISBN-13 =      "978-1-85032-205-4",
  LCCN =         "TK5105.888 .F56 1995",
  bibdate =      "Wed Nov 15 08:24:30 1995",
  bibsource =    "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/sgml.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook2.bib",
  note =         "Foreword by Tim Berners-Lee. Three sections deal with
                 (1) Getting connected to the Internet and using
                 Internet software; (2) Writing HTML (2.0) files for the
                 WorldWideWeb; (3) Running a HTTP server and providing a
                 Web service. Author is a member of the IETF Working
                 Group on HTML. Text includes additional material on
                 SGML; choice of editors, browsers and servers;
                 copyright and intellectual property; and advance
                 details of HTML3.",
  acknowledgement = ack-nhfb,
  remark =       "The book was written with the O'Reilly/Davenport
                 DocBook SGML DTD, then translated with SGML2{\TeX} to
                 plain {\TeX}, and typeset with Karl Berry's Eplain
                 macros.",
  tableofcontents = "1: Introduction \\
                 2: WorldWideWhat? \\
                 3: For beginners \\
                 4: Getting used to the Internet \\
                 5: Using a WorldWideWeb browser \\
                 6: How it works \\
                 7: Introduction to HTML \\
                 8: Simple document markup \\
                 9: Hypertext links and graphics \\
                 10: Tables, mathematics, and forms \\
                 11: Controlling appearances \\
                 12: Server software \\
                 13: `Searchable' URLs \\
                 14: Keeping things straight \\
                 15: Rights and responsibilities \\
                 16: Copyright and intellectual property \\
                 17: Authentication, encryption, and charging \\
                 18: Future developments \\
                 Appendix A: Converting existing text \\
                 Appendix B: HTML3 \\
                 Appendix C: Resources \\
                 Appendix D: ISO and other sets of code tables",
}

@Book{Flynn:1998:USX,
  author =       "Peter Flynn",
  title =        "Understanding {SGML} and {XML} Tools: Practical
                 Programs for Handling Structured Text",
  publisher =    pub-KLUWER,
  address =      pub-KLUWER:adr,
  pages =        "xxvi + 432",
  year =         "1998",
  ISBN =         "0-7923-8169-6",
  ISBN-13 =      "978-0-7923-8169-3",
  LCCN =         "QA76.76.H94F59 1998",
  bibdate =      "Fri Sep 11 08:29:11 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/sgml.bib",
  acknowledgement = ack-nhfb,
  annote =       "System requirements: PC, Mac or UNIX platforms.",
  keywords =     "SGML (Document markup language); XML (Document markup
                 language)",
  tableofcontents = "1. Introduction \\
                 1.1. What it's all about \\
                 1.2. Selection of tools \\
                 1.3. How much do I need to know about computers? \\
                 1.4. Organization of the book \\
                 1.5. The quick-start guide to SGML \\
                 2: What type of document? \\
                 2.1. Describing the type of document \\
                 2.2. Understanding Document Type Definitions \\
                 2.3. What's available in public? \\
                 2.4. Extensible Markup Language (XML) \\
                 2.5. Identifying the DTD \\
                 2.6. Writing and modifying DTDs \\
                 2.7. SGML update \\
                 3. Editors \\
                 3.1. Editors and DTDs \\
                 3.2. Stylesheets and WYSIWYG \\
                 3.3. General-purpose editors \\
                 3.4. SGML extensions to non-SGML editors \\
                 4. Parsing and validating \\
                 4.1. Using a built-in parser \\
                 4.2. Interpreting and reusing parser output \\
                 4.3. Stand-alone parsing \\
                 5. Manipulation and conversion \\
                 5.1. Quick and dirty: using non-SGML tools \\
                 5.2. Programmable conversion engines \\
                 5.3. SGML export and import without programming \\
                 6. Finding, viewing, and printing \\
                 6.1. Searching \\
                 6.2. Viewers and browsers \\
                 6.3. Non-visual representations \\
                 6.4. Stylesheet software \\
                 6.5. Printing and publishing \\
                 6.6. Document management and archiving \\
                 7. Rolling your own \\
                 7.1. Toolkits for the programmer \\
                 A. The CD-ROM \\
                 A.1. Browsing the CD-ROM: using Synex/Inso ViewPort \\
                 A.2. Words of warning about the software \\
                 A.3. How does it work? \\
                 A.4. What am I allowed to do with it? \\
                 A.5. Documentation \\
                 A.6. GNU software \\
                 B. SGML resources \\
                 B.1. On the Web \\
                 B.2. Usenet news \\
                 B.3. Mailing lists \\
                 B.4. SGML User Groups \\
                 Index of markup elements and parameters",
}

@TechReport{Flynn:sf2,
  author =       "John A. Flynn and Gary P. Carr",
  title =        "User's Guide to {SFTRAN II}",
  number =       "1846-79",
  institution =  pub-JPL,
  address =      pub-JPL:adr,
  month =        oct,
  year =         "1976",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@TechReport{Flynn:sf3,
  author =       "John A. Flynn",
  title =        "{SFTRAN} User Guide",
  number =       "Section 914, Internal Computing Memorandum 337",
  institution =  pub-JPL,
  address =      pub-JPL:adr,
  month =        jul,
  year =         "1973",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "{Also} catalogued as JPL Document No.1846-7.",
  acknowledgement = ack-nhfb,
}

@Book{Foley:1982:FIC,
  author =       "James D. Foley and Andries {van Dam}",
  title =        "Fundamentals of Interactive Computer Graphics",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xx + 664",
  year =         "1982",
  ISBN =         "0-201-14468-9",
  ISBN-13 =      "978-0-201-14468-0",
  LCCN =         "T385 .F63 1982",
  bibdate =      "Mon Oct 26 07:30:11 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "The Systems Programming Series",
  acknowledgement = ack-nhfb,
  tableofcontents = "What is interactive graphics? \\
                 Basic interactive graphics programming \\
                 Graphics hardware \\
                 Implementation of a Simple Graphics Package (SGP) \\
                 Interaction devices and techniques \\
                 The design of user-computer graphic conversations \\
                 Geometrical transformations \\
                 Viewing in three dimensions \\
                 Modeling and object hierarchy \\
                 Advanced display architecture \\
                 Raster algorithms and software \\
                 Display architecture \\
                 Representation of 3D shapes \\
                 The quest for visual realism \\
                 Algorithms for removing hidden edges and surfaces \\
                 Shading models \\
                 Intensity and color",
}

@Book{Foley:1990:CGP,
  author =       "James D. Foley and Andries {van Dam} and Steven K.
                 Feiner and John F. Hughes",
  title =        "Computer Graphics: Principles and Practice",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Second",
  pages =        "xxiii + 1174",
  year =         "1990",
  ISBN =         "0-201-12110-7 (hardcover)",
  ISBN-13 =      "978-0-201-12110-0 (hardcover)",
  LCCN =         "T385 .C568 1990",
  bibdate =      "Fri Feb 25 06:54:28 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "The Systems Programming Series",
  abstract =     "A comprehensive book on computer graphics, with
                 examples in the C programming language. Providing a
                 combination of concepts and practical applications,
                 this book contains algorithms in 2D and 3D graphics for
                 easy implementation, including a close look at the
                 special cases. Over 100 full-color plates and over 700
                 figures illustrate the techniques.",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "Introduction \\
                 Programming in the Simple Raster Graphics Package
                 (SRGP) \\
                 Basic raster graphics algorithms for drawing 2D
                 primitives \\
                 Graphics hardware \\
                 Geometrical transformations \\
                 Viewing in 3D \\
                 Object hierarchy and Simple PHIGS (SPHIGS) \\
                 Input devices, interaction techniques, and interaction
                 tasks \\
                 Dialogue design \\
                 User interface software \\
                 Representing curves and surfaces \\
                 Solid modeling \\
                 Achromatic and colored light \\
                 The quest for visual realism \\
                 Visible-surface determination \\
                 Illumination and shading \\
                 Image manipulation and storage \\
                 Advanced raster graphics architecture \\
                 Advanced geometric and raster algorithms \\
                 Advanced modeling techniques \\
                 Animation \\
                 Appendix: mathematics for computer graphics",
  tableofcontents = "1: Introduction / 1 \\
                 1.1 Image Processing as Picture Analysis / 2 \\
                 1.2 The Advantages of Interactive Graphics / 3 \\
                 1.3 Representative Uses of Computer Graphics / 4 \\
                 1.4 Classification of Applications / 6 \\
                 1.5 Development of Hardware and Software for Computer
                 Graphics / 8 \\
                 1.6 Conceptual Framework for Interactive Graphics / 17
                 \\
                 1.7 Summary / 21 \\
                 Exercises / 22 \\
                 2: Programming in the Simple Raster Graphics Package
                 (SRGP) / 25 \\
                 2.1 Drawing with SRGP / 26 \\
                 2.2 Basic Interaction Handling / 40 \\
                 2.3 Raster Graphics Features / 52 \\
                 2.4 Limitations of SRGP / 60 \\
                 2.5 Summary / 63 \\
                 Exercises / 64 \\
                 3: Basic Raster Graphics Algorithms for Drawing 2D
                 Primitives / 67 \\
                 3.1 Overview / 67 \\
                 3.2 Scan Converting Lines / 72 \\
                 3.3 Scan Converting Circles / 81 \\
                 3.4 Scan Converting Ellipses / 88 \\
                 3.5 Filling Rectangles / 91 \\
                 3.6 Filling Polygons / 92 \\
                 3.7 Filling Ellipse Arcs / 99 \\
                 3.8 Pattern Filling / 100 \\
                 3.9 Thick Primitives / 104 \\
                 3.10 Line Style and Pen Style / 109 \\
                 3.11 Clipping in a Raster World / 110 \\
                 3.12 Clipping Lines / 111 \\
                 3.13 Clipping Circles and Ellipses / 124 \\
                 3.14 Clipping Polygons / 124 \\
                 3.15 Generating Characters / 127 \\
                 3.16 SRGP\_copyPixel / 132 \\
                 3.17 Antialiasing / 132 \\
                 3.18 Summary / 140 \\
                 Exercises / 142 \\
                 4: Graphics Hardware / 145 \\
                 4.1 Hardcopy Technologies / 146 \\
                 4.2 Display Technologies / 155 \\
                 4.3 Raster-Scan Display Systems / 165 \\
                 4.4 The Video Controller / 179 \\
                 4.5 Random-Scan Display Processor / 184 \\
                 4.6 Input Devices for Operator Interaction / 188 \\
                 4.7 Image Scanners / 195 \\
                 Exercises / 197 \\
                 5: Geometrical Transformations / 201 \\
                 5.1 2D Transformations / 201 \\
                 5.2 Homogeneous Coordinates and Matrix Representation
                 of 2D Transformations / 204 \\
                 5.3 Composition of 2D Transformations / 208 \\
                 5.4 The Window-to-Viewport Transformation / 210 \\
                 5.5 Efficiency / 212 \\
                 5.6 Matrix Representation of 3D Transformations / 213
                 \\
                 5.7 Composition of 3D Transformations / 217 \\
                 5.8 Transformations as a Change in Coordinate System /
                 222 \\
                 Exercises / 226 \\
                 6: Viewing in 3D / 229 \\
                 6.1 Projections / 230 \\
                 6.2 Specifying an Arbitrary 3D View / 237 \\
                 6.3 Examples of 3D Viewing / 242 \\
                 6.4 The Mathematics of Planar Geometric Projections /
                 253 \\
                 6.5 Implementing Planar Geometric Projections / 258 \\
                 6.6 Coordinate Systems / 279 \\
                 Exercises / 281 \\
                 7: Object Hierarchy and Simple PHIGS (SPHIGS) / 285 \\
                 7.1 Geometric Modeling / 286 \\
                 7.2 Characteristics of Retained-Mode Graphics Packages
                 / 293 \\
                 7.3 Defining and Displaying Structures / 295 \\
                 7.4 Modeling Transformations / 304 \\
                 7.5 Hierarchical Structure Networks / 308 \\
                 7.6 Matrix Composition in Display Traversal / 315 \\
                 7.7 Appearance-Attribute Handling in Hierarchy / 318
                 \\
                 7.8 Screen Updating and Rendering Modes / 322 \\
                 7.9 Structure Network Editing for Dynamic Effects / 324
                 \\
                 7.10 Interaction / 328 \\
                 7.11 Additional Output Features / 332 \\
                 7.12 Implementation Issues / 334 \\
                 7.13 Optimizing Display of Hierarchical Models / 340
                 \\
                 7.14 Limitations of Hierarchical Modeling in PHIGS /
                 341 \\
                 7.15 Alternative Forms of Hierarchical Modeling / 343
                 \\
                 7.16 Summary / 345 \\
                 Exercises / 346 \\
                 8: Input Devices, Interaction Techniques, and
                 Interaction Tasks / 347 \\
                 8.1 Interaction Hardware / 349 \\
                 8.2 Basic Interaction Tasks / 358 \\
                 8.3 Composite Interaction Tasks / 381 \\
                 Exercises / 388 \\
                 9: Dialogue Design / 391 \\
                 9.1 The Form and Content of User-Computer Dialogues /
                 392 \\
                 9.2 User-Interface Styles / 395 \\
                 9.3 Important Design Considerations / 403 \\
                 9.4 Modes and Syntax / 414 \\
                 9.5 Visual Design / 418 \\
                 9.6 The Design Methodology / 429 \\
                 Exercises / 431 \\
                 10: User Interface Software / 435 \\
                 10.1 Basic Interaction-Handling Models / 436 \\
                 10.2 Window-Management Systems / 439 \\
                 10.3 Output Handling in Window Systems / 443 \\
                 10.4 Input Handling in Window Systems / 447 \\
                 10.5 Interaction-Technique Toolkits / 451 \\
                 10.6 User-Interface Management Systems / 456 \\
                 Exercises / 468 \\
                 11: Representing Curves and Surfaces / 471 \\
                 11.1 Polygon Meshes / 473 \\
                 11.2 Parametric Cubic Curves / 478 \\
                 11.3 Parametric Bicubic Surfaces / 516 \\
                 11.4 Quadric Surfaces / 528 \\
                 11.5 Summary / 529 \\
                 Exercises / 530 \\
                 12: Solid Modeling / 533 \\
                 12.1 Representing Solids / 534 \\
                 12.2 Regularized Boolean Set Operations / 535 \\
                 12.3 Primitive Instancing / 539 \\
                 12.4 Sweep Representations / 540 \\
                 12.5 Boundary Representations / 542 \\
                 12.6 Spatial-Partitioning Representations / 548 \\
                 12.7 Constructive Solid Geometry / 557 \\
                 12.8 Comparison of Representations / 558 \\
                 12.9 User Interfaces for Solid Modeling / 561 \\
                 12.10 Summary / 561 \\
                 Exercises / 562 \\
                 13: Achromatic and Colored Light / 563 \\
                 13.1 Achromatic Light / 563 \\
                 13.2 Chromatic Color / 574 \\
                 13.3 Color Models for Raster Graphics / 584 \\
                 13.4 Reproducing Color / 599 \\
                 13.5 Using Color in Computer Graphics / 601 \\
                 13.6 Summary / 603 \\
                 Exercises / 603 \\
                 14: The Quest for Visual Realism / 605 \\
                 14.1 Why Realism? / 606 \\
                 14.2 Fundamental Difficulties / 607 \\
                 14.3 Rendering Techniques for Line Drawings / 609 \\
                 14.4 Rendering Techniques for Shaded Images / 612 \\
                 14.5 Improved Object Models / 615 \\
                 14.6 Dynamics / 615 \\
                 14.7 Stereopsis / 616 \\
                 14.8 Improved Displays / 617 \\
                 14.9 Interacting with Our Other Senses / 617 \\
                 14.10 Aliasing and Antialiasing / 617 \\
                 14.11 Summary / 646 \\
                 Exercises / 647 \\
                 15: Visible-Surface Determination / 649 \\
                 15.1 Functions of Two Variables / 651 \\
                 15.2 Techniques for Efficient Visible-Surface
                 Algorithms / 656 \\
                 15.3 Algorithms for Visible-Line Determination / 665
                 \\
                 15.4 The z-Buffer Algorithm / 668 \\
                 15.5 List-Priority Algorithms / 672 \\
                 15.6 Scan-Line Algorithms / 680 \\
                 15.7 Area-Subdivision Algorithms / 686 \\
                 15.8 Algorithms for Octrees / 695 \\
                 15.9 Algorithms for Curved Surfaces / 698 \\
                 15.10 Visible-Surface Ray Tracing / 701 \\
                 15.11 Summary / 715 \\
                 Exercises / 718 \\
                 16: Illumination and Shading / 721 \\
                 16.1 Illumination Models / 722 \\
                 16.2 Shading Models for Polygons / 734 \\
                 16.3 Surface Detail / 741 \\
                 16.4 Shadows / 745 \\
                 16.5 Transparency / 754 \\
                 16.6 Interobject Reflections / 758 \\
                 16.7 Physically Based Illumination Models / 760 \\
                 16.8 Extended Light Sources / 772 \\
                 16.9 Spectral Sampling / 773 \\
                 16.10 Improving the Camera Model / 774 \\
                 16.11 Global Illumination Algorithms / 775 \\
                 16.12 Recursive Ray Tracing / 776 \\
                 16.13 Radiosity Methods / 793 \\
                 16.14 The Rendering Pipeline / 806 \\
                 16.15 Summary / 813 \\
                 Exercises / 813 \\
                 17: Image Manipulation and Storage / 815 \\
                 17.1 What Is an Image? / 816 \\
                 17.2 Filtering / 817 \\
                 17.3 Image Processing / 820 \\
                 17.4 Geometric Transformations of Images / 820 \\
                 17.5 Multipass Transformations / 828 \\
                 17.6 Image Compositing / 835 \\
                 17.7 Mechanisms for Image.Storage / 843 \\
                 17.8 Special Effects with Images / 850 \\
                 17.9 Summary / 851 \\
                 Exercises / 851 \\
                 18: Advanced Raster Graphics Architecture / 855 \\
                 18.1 Simple Raster-Display System / 856 \\
                 18.2 Display-Processor Systems / 861 \\
                 18.3 Standard Graphics Pipeline / 866 \\
                 18.4 Introduction to Multiprocessing r / 873 \\
                 18.5 Pipeline Front-End Architectures / 877 \\
                 18.6 Parallel Front-End Architectures / 880 \\
                 18.7 Multiprocessor Rasterization Architectures / 882
                 \\
                 18.8 Image-Parallel Rasterization / 887 \\
                 18.9 Object-Parallel Rasterization / 899 \\
                 18.10 Hybrid-Parallel Rasterization / 902 \\
                 18.11 Enhanced Display Capabilities / 907 \\
                 18.12 Summary / 920 \\
                 Exercises / 920 \\
                 19: Advanced Geometric and Raster Algorithms / 923 \\
                 19.1 Clipping / 924 \\
                 19.2 Scan-Converting Primitives / 945 \\
                 19.3 Antialiasing / 965 \\
                 19.4 The Special Problems of Text / 976 \\
                 19.5 Filling Algorithms / 979 \\
                 19.6 Making copyPixel Fast / 986 \\
                 19.7 The Shape Data Structure and Shape Algebra / 992
                 \\
                 19.8 Managing Windows with bitBlt / 996 \\
                 19.9 Page-Description Languages / 998 \\
                 19.10 Summary / 1006 \\
                 Exercises / 1006 \\
                 20: Advanced Modeling Techniques / 1011 \\
                 20.1 Extensions of Previous Techniques / 1012 \\
                 20.2 Procedural Models / 1018 \\
                 20.3 Fractal Models / 1020 \\
                 20.4 Grammar-Based Models / 1027 \\
                 20.5 Particle Systems / 1031 \\
                 20.6 Volume Rendering / 1034 \\
                 20.7 Physically Based Modeling / 1039 \\
                 20.8 Special Models for Natural and Synthetic Objects /
                 1043 \\
                 20.9 Automating Object Placement / 1050 \\
                 20.10 Summary / 1054 \\
                 Exercises / 1054 \\
                 21: Animation / 1057 \\
                 21.1 Conventional and Computer-Assisted Animation /
                 1058 \\
                 21.2 Animation Languages / 1065 \\
                 21.3 Methods of Controlling Animation / 1070 \\
                 21.4 Basic Rules of Animation / 1077 \\
                 21.5 Problems Peculiar to Animation / 1078 \\
                 21.6 Summary / 1080 \\
                 Exercises / 1080 \\
                 Appendix: Mathematics for Computer Graphics / 1083 \\
                 A.I Vector Spaces and Affine Spaces / 1083 \\
                 A.2 Some Standard Constructions in Vector Spaces / 1091
                 \\
                 A.3 Dot Products and Distances / 1094 \\
                 A.4 Matrices / 1103 \\
                 A.5 Linear and Affine Transformations / 1106 \\
                 A.6 Eigenvalues and Eigenvectors / 1108 \\
                 A.7 Newton--Raphson Iteration for Root Finding / 1109
                 \\
                 Exercises / 1111 \\
                 Bibliography / 1113 \\
                 Index / 1153",
}

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

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

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

@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;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/numana1990.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",
}

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

@Book{Gillam:2003:UDP,
  author =       "Richard Gillam",
  title =        "{Unicode} demystified: a practical programmer's guide
                 to the encoding standard",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xxxiii + 853",
  year =         "2003",
  ISBN =         "0-201-70052-2 (paperback)",
  ISBN-13 =      "978-0-201-70052-7 (paperback)",
  LCCN =         "QA76.6 .G5535 2002",
  bibdate =      "Tue Nov 05 14:15:02 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "UK\pounds 37.99",
  abstract =     "Unicode is a critical enabling technology for
                 developers who want to internationalize applications
                 for global environments. But, until now, developers
                 have had to turn to standards documents for crucial
                 information on utilizing Unicode. In Unicode
                 Demystified, one of IBM's leading software
                 internationalization experts covers every key aspect of
                 Unicode development, offering practical examples and
                 detailed guidance for integrating Unicode 3.0 into
                 virtually any application or environment. Writing from
                 a developer's point of view, Rich Gillam presents a
                 systematic introduction to Unicode's goals, evolution,
                 and key elements. Gillam illuminates the Unicode
                 standards documents with insightful discussions of
                 character properties, the Unicode character database,
                 storage formats, character sequences, Unicode
                 normalization, character encoding conversion, and more.
                 He presents practical techniques for text processing,
                 locating text boundaries, searching, sorting, rendering
                 text, accepting user input, and other key development
                 tasks. Along the way, he offers specific guidance on
                 integrating Unicode with other technologies, including
                 Java, JavaScript, XML, and the Web. For every developer
                 building internationalized applications,
                 internationalizing existing applications, or
                 interfacing with systems that already utilize
                 Unicode.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Part I. Unicode in Essence: An Architectural
                 Overview of the Unicode Standard \\
                 1: Language, Computers, and Unicode \\
                 2: A Brief History of Character Encoding \\
                 3: Architecture: Not Just a Pile of Code Charts \\
                 4: Combining Character Sequences and Unicode
                 Normalization \\
                 5: Character Properties and the Unicode Character
                 Database \\
                 6: Unicode Storage and Serialization Formats \\
                 Part II. Unicode in Depth: A Guided Tour of the
                 Character Repertoire \\
                 7: Scripts of Europe \\
                 8: Scripts of the Middle East \\
                 9: Scripts of India and Southeast Asia \\
                 10: Scripts of East Asia \\
                 11: Scripts from Other Parts of the World \\
                 12: Numbers, Punctuation, Symbols, and Specials \\
                 Part III. Unicode in Action: Implementing and Using the
                 Unicode Standard \\
                 13: Techniques and Data Structures for Handling Unicode
                 Text \\
                 14: Conversions and Transformations \\
                 15: Searching and Sorting \\
                 16: Rendering and Editing",
}

@Book{Gilly:1990:XWS,
  author =       "Daniel Gilly and Tim O'Reilly",
  title =        "The {X Window System} in a Nutshell",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xi + 367",
  year =         "1990",
  ISBN =         "0-937175-24-2",
  ISBN-13 =      "978-0-937175-24-8",
  LCCN =         "QA76.76.W56 X84x",
  bibdate =      "Wed Dec 15 19:44:49 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Gilly:1992:UN,
  author =       "Daniel Gilly and {the staff of O'Reilly \&
                 Associates}",
  title =        "{UNIX} in a Nutshell",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  edition =      "Second",
  year =         "1992",
  ISBN =         "1-56592-001-5",
  ISBN-13 =      "978-1-56592-001-9",
  LCCN =         "QA76.76.O63 G55 1992",
  bibdate =      "Tue Dec 14 22:53:27 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/string-matching.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "Introduction \\
                 UNIX commands \\
                 UNIX shell \\
                 Bourne shell and Korn shell \\
                 C shell \\
                 Pattern matching \\
                 Emacs editor \\
                 Vi editor \\
                 Ex editor \\
                 Sed editor \\
                 Awk scripting language",
  tableofcontents = "Commands and shells \\
                 Introduction \\
                 UNIX commands \\
                 The UNIX shell: an overview \\
                 The Bourne shell and Korn shell \\
                 The C shell \\
                 Text editing \\
                 Pattern matching \\
                 The emacs editor \\
                 The Vi editor \\
                 The ex editor \\
                 The sed editor \\
                 The awk scripting language \\
                 Text formatting \\
                 nroff and troff \\
                 mm macros \\
                 ms macros \\
                 me macros \\
                 Preprocessors \\
                 Software development \\
                 The SCCS utility \\
                 The RCS utility \\
                 The make utility \\
                 Program debugging \\
                 Loose ends \\
                 ASCII character set",
}

@Book{Gilly:1992:XWS,
  author =       "Daniel Gilly and Tim O'Reilly",
  title =        "The {X Window System} in a Nutshell",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  edition =      "Second",
  pages =        "xi + 409",
  year =         "1992",
  ISBN =         "1-56592-017-1",
  ISBN-13 =      "978-1-56592-017-0",
  LCCN =         "QA76.76.W56 X24 1992",
  bibdate =      "Wed Jul 6 13:58:36 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

@Book{Giloi:1978:ICG,
  author =       "Wolfgang K. Giloi",
  title =        "Interactive Computer Graphics: Data Structures,
                 Algorithms, Languages",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xiii + 354",
  year =         "1978",
  ISBN =         "0-13-469189-X",
  ISBN-13 =      "978-0-13-469189-3",
  LCCN =         "T385 .G54 1978",
  bibdate =      "Tue Dec 14 22:53:41 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$18.50",
  abstract =     "Data structures, data bases, and list handiling.
                 Picture structure and picture transformations.
                 Interpolation and approximation of curves and surfaces.
                 Rendering of surfaces and solids. Interaction handling.
                 The display processor. Display file and picture file
                 organization. Language concepts for interactive
                 computer graphics. High-level language implementation
                 of display programming systems. Implementation of the
                 GRIP concept.",
  acknowledgement = ack-nhfb,
  subject =      "Computer graphics; Interactive computer systems;
                 Algorithms; Programming languages (Electronic
                 computers); Data structures (Computer science);
                 Infographie; Syst{\`e}mes conversationnels
                 (Informatique); Algorithmes; Langages de programmation;
                 Donn{\'e}es graphiques sur ordinateur; Structures de
                 donn{\'e}es (Informatique); Algorithms; Computer
                 graphics; Data structures (Computer science);
                 Interactive computer systems; Programming languages
                 (Electronic computers); Computergraphics; Interactieve
                 computerprogramma's; Grafische methoden; Computers.",
}

@Book{Gilster:1993:INE,
  author =       "Paul Gilster",
  title =        "The Internet Navigator --- The Essential Guide to
                 Network Exploration for the Individual Dial-up User",
  publisher =    pub-WILEY-INTERSCIENCE,
  address =      pub-WILEY-INTERSCIENCE:adr,
  pages =        "xxiv + 470",
  year =         "1993",
  ISBN =         "0-471-59782-1",
  ISBN-13 =      "978-0-471-59782-7",
  LCCN =         "TK5105.875.I57 G55 1993",
  bibdate =      "Mon Oct 11 08:39:42 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/internet.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$24.95",
  abstract =     "Guide to the Internet computer network with
                 information on sending and receiving electronic mail,
                 locating service providers, and more.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Foreword / Vinton G. Cerf \\
                 1: A Wild Surmise / 1 \\
                 Destinations You Haven't Thought Of \\
                 Internet Echoes from All Over \\
                 Via the Internet to the Asteroids \\
                 Finding a Map of Finland \\
                 Software in Profusion \\
                 Tracking White House Press Releases \\
                 Burrowing into the INTERNIC \\
                 Rocky Mountain High \\
                 Checking Out the News on Campus \\
                 All the Way to the Supreme Court \\
                 To New Zealand by way of USENET \\
                 On-Line to Ancient Greece \\
                 A Nice Day for Networking \\
                 BITNET and the Overstuffed Mailbox \\
                 The Internet Catch \\
                 2. The Internet Defined / 13 \\
                 A Brief History of the Internet \\
                 The Structure of the Internet \\
                 Managing the Internet \\
                 Key Internet Organizations \\
                 Internet Documentation \\
                 Network Information Centers \\
                 International Connectivity List \\
                 3. Signing On to the Internet / 49 \\
                 Dial-Up Connectivity and the Client/Server Model \\
                 Terminal Emulation \\
                 Signing on \\
                 A Personal Odyssey \\
                 Using a Local Bulletin Board \\
                 Commercial On-Line Services \\
                 The Free-Net Advantage \\
                 A New Alternative \\
                 DELPHI and BIX \\
                 Commercial Dial-Up Providers \\
                 SLIPping onto the Internet \\
                 Full Access: The Internet's Holy Grail \\
                 4. One Language Among Many / 75 \\
                 Why UNIX? Of Interfaces and Complexity \\
                 Dial-Up Assumptions \\
                 The Smattering of UNIX You'll Need \\
                 Understanding UNIX Files \\
                 UNIX Directory Structure \\
                 Basic UNIX Commands \\
                 5. Files by the Gigabyte / 83 \\
                 Shareware and Public Domain Software \\
                 Description of Archive Sites \\
                 Courtesy When Using FTP \\
                 A Sample FTP Session \\
                 The NIC Goldmine \\
                 Getting Files to Your Computer \\
                 Translating ASCII for Your Computer \\
                 Xmodem Parameters \\
                 Other Xmodem Options \\
                 Retrieving Two Useful Files \\
                 Basic FTP Principles Applied \\
                 Uncompressing a File \\
                 Using archie to Track Down Files \\
                 6. Telnet Shrinks the World / 113 \\
                 Telnet Versus Dial-Up Systems \\
                 Through Telnet to the Gateway City \\
                 Learning the Commands \\
                 The Telnet Command Structure \\
                 Using Computer Ports \\
                 Telnet and ``Big Blue Iron'' \\
                 7. A World of Electronic Mail / 127 \\
                 Shattering the Borders \\
                 A Word to Users of Commercial On-Line Services \\
                 Electronic Mail Defined \\
                 Electronic Mail Programs \\
                 What Is Mail? Putting Mail to Work \\
                 Internet Addressing \\
                 The Long Way Home \\
                 Hitting a Brick Wall \\
                 A Brief Look at elm \\
                 Electronic Mail Manners \\
                 8. Electronic Mail as a Gateway to the Internet / 159
                 \\
                 Retrieving Files by Mail \\
                 Finding Files to Retrieve \\
                 archie Through Electronic Mail \\
                 WAIS by Electronic Mail \\
                 Sending Electronic Mail to Other Networks \\
                 Mailing Lists and Electronic Journals \\
                 A Final Caution \\
                 9. BITNET: The Art of the List / 187 \\
                 Why BITNET \\
                 BITNET's Background \\
                 BITNET and the Medieval University \\
                 When Analogies Fail \\
                 Bringing Order to the Chaos \\
                 BITNET's Mailing List Community \\
                 The Niceties of BITNET Participation \\
                 Puzzling Out a BITNET Address \\
                 LISTSERV and the Pleasures of Automation \\
                 Signing on to a List \\
                 BITNET Archives \\
                 Where the Treasure Is \\
                 LISTSERV's Database Capabilities \\
                 Delving Deeper Into the Database \\
                 Tapping BITNET as a Reference Source \\
                 Narrowing Down the Search \\
                 Using Logical Operators \\
                 Adding to the Library \\
                 BITNET via USENET \\
                 The Future of BITNET \\
                 10. Electronic Journals, Mailing Lists, and Project
                 Gutenberg / 215 \\
                 The Internet's Mailing Lists \\
                 Topics in Profusion \\
                 Tapping an Archive \\
                 The Electronic Publishing Edge \\
                 Project Gutenberg and the Next Publishing Revolution
                 \\
                 Living on the Textual Frontier \\
                 11. USENET: Keeping Up with the News / 241 \\
                 What is USENET? USENET Newsgroups \\
                 USENET Topics \\
                 Useful USENET Lists \\
                 Reading the News \\
                 Configuring trn \\
                 Knowing What to Read \\
                 The Core Newsgroups \\
                 Using trn to Read Your Newsgroups \\
                 Moving Photographs Over the Network \\
                 FAQs and How to Find Them \\
                 USENET Rules of the Road \\
                 12. Resource Discovery: Knowing Where and How to Look /
                 279 \\
                 gopher Tracks Resources \\
                 veronica Saves the Day \\
                 HYTELNET Power \\
                 13. Tracking Down Information / 279 \\
                 Wide Area Information Servers \\
                 World Wide Web: The Pleasures of Hypertext \\
                 14. An Internet Toolbox / 307 \\
                 finger Finds People and Information \\
                 nslookup \\
                 netfind \\
                 Using WHOIS \\
                 Using the NetMail Database \\
                 Finding People with CSOs \\
                 Knowbots and the Intelligent Directory \\
                 Digging Out a Name From USENET \\
                 BITNET Names \\
                 Campus Wide Information Systems \\
                 X.500 and the Conquest of Paradise \\
                 The Mother of All Directories \\
                 Real-Time Conversation \\
                 Well-Populated Dungeons \\
                 A Directory of Internet Resources / 365 \\
                 archie Sites \\
                 BITNET Mailing Lists \\
                 Campus Wide Information Systems \\
                 Directories \\
                 Finger Sites \\
                 FTP Sites \\
                 gopher Sites Available Through Telnet \\
                 Internet Mailing Lists \\
                 Internet Relay Chat and Other Interactive Sites \\
                 Library Catalogs \\
                 Mail Resources \\
                 On-Line Journals and Newsletters \\
                 Telnet Resources \\
                 USENET \\
                 WAIS Databases \\
                 White Pages Directories \\
                 The Future of the Internet / 397 \\
                 Commerce Takes to the Data Packets \\
                 The Internet and the Future of the Newspaper \\
                 Making Mail Come Alive \\
                 Internet Talk Radio \\
                 IP Multicasting --- The Internet by Sight and Sound \\
                 The Evolution of the NREN \\
                 A Truly Global Network \\
                 Bibliography / 409 \\
                 Appendix: Dial-Up Internet Service Providers / 415 \\
                 A Word on Sources \\
                 Obtaining Updated Lists \\
                 Dial-Up Service Providers \\
                 U.S. Public Access UNIX Sites by State \\
                 Internet Access Worldwide \\
                 Index / 455",
}

@Book{Glass:1997:BRS,
  author =       "Robert L. Glass",
  title =        "In the Beginning: Recollections of Software Pioneers",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "vi + 318",
  year =         "1997",
  ISBN =         "0-8186-7999-9",
  ISBN-13 =      "978-0-8186-7999-5",
  LCCN =         "QA76.76.D47I517 1998",
  bibdate =      "Wed Jan 27 06:33:19 1999",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/w/wilkes-maurice-v.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "IEEE catalog number BP07999.",
  price =        "US\$29.00",
  abstract =     "\booktitle{In the Beginning: Recollections of Software
                 Pioneers} records the stories of computing's past,
                 enabling today's professionals to improve on the
                 realities of yesterday. The stories in this book
                 clearly show that modern concepts, such as data
                 abstraction, modularity, and structured approaches,
                 date much earlier in the field than their appearance in
                 academic literature. These stories help capture the
                 true evolution. The book illustrates human experiences
                 and industry turning points through personal
                 recollections by the pioneers, people like Barry Boehm,
                 Peter Denning, Watts Humphrey, Frank Land, and a dozen
                 others.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  tableofcontents = "Life before software, a few reminiscences / David
                 Myers \\
                 Software reflections: a pioneer's view of the history
                 of the field / Robert L. Glass \\
                 Reflections on a software life / Watts S. Humphrey \\
                 How I watched in pain as IBM outsmarted UNIVAC / Norman
                 F. Scneidewind \\
                 An early application generator and other recollections
                 / Barry Boehm \\
                 View from below / Robert N. Britcher \\
                 Almost thirty years as a change agent / Donald J.
                 Reifer \\
                 Leo, the first business computer: a personal experience
                 / Frank Land \\
                 Compu-THEN: before megabytes / Ben G. Matley \\
                 Four anecdotes / Harold Joseph Highland \\
                 The prolonged metamorphosis of a software engineer /
                 Robert L. Baber \\
                 Autobiographical snippets / John M. Bennett \\
                 Closing the circle / Bruce I. Blum \\
                 Before memory was virtual / Peter J. Denning \\
                 Growing up with software tools / Raymond C. Houghton",
}

@Book{Glass:1998:SRM,
  author =       "Robert L. Glass",
  title =        "Software Runaways: Monumental Software Disasters",
  publisher =    pub-PHPTR,
  address =      pub-PHPTR:adr,
  pages =        "xvi + 259",
  year =         "1998",
  ISBN =         "0-13-673443-X",
  ISBN-13 =      "978-0-13-673443-7",
  LCCN =         "QA76.76.F34G54 1998",
  bibdate =      "Mon Aug 30 18:55:20 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$29.99",
  URL =          "http://www.phptr.com/ptrbooks/ptr_013673443X.html",
  abstract =     "In \booktitle{Software Runaways}, software failure
                 expert Robert Glass shows exactly what went wrong in 16
                 colossal software disasters --- and how to keep
                 disasters from happening to you. Glass goes behind the
                 scenes of those awful projects you've seen on the
                 nightly news --- the Denver Airport baggage system, the
                 IRS modernization --- and a host of less
                 well-publicized failures that are equally instructive.
                 Along the way, he identifies six characteristics of
                 projects likely to fail --- and some will surprise you.
                 Whether you're an IT executive, project manager or
                 developer, Software Runaways helps you learn from
                 someone else's mistakes.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Introduction \\
                 Software runaway war stories \\
                 Software runaway remedies \\
                 Conclusions",
}

@Book{Glass:1999:CCL,
  author =       "Robert L. Glass",
  title =        "Computing Calamities: Lessons Learned from Products,
                 Projects, and Companies That Failed",
  publisher =    pub-PHPTR,
  address =      pub-PHPTR:adr,
  pages =        "xiv + 302",
  year =         "1999",
  ISBN =         "0-13-082862-9",
  ISBN-13 =      "978-0-13-082862-0",
  LCCN =         "HD9696.2.U62G55 199",
  bibdate =      "Mon Aug 02 14:15:39 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$29.99",
  abstract =     "Many great advances in technology have resulted from
                 risky experimentation, but it's critical to remember
                 and study the spectacular failures that also resulted
                 from some of those risks. Failures can be mundane, like
                 the typical complaints of software projects that are
                 behind schedule and over budget, while others can be
                 much more extravagant. In \booktitle{Computing
                 Calamities}, Robert L. Glass has collected war stories
                 from around the industry. Laugh at these mistakes, and
                 learn from them. Someone else's failure could be the
                 foundation of your success.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  tableofcontents = "1: Introduction: What's So Great About Failure? \\
                 2: Overview: The Many Faces of Failure \\
                 3: Keep Your Eyes on the Enterprise: Stories of
                 Corporate Failure \\
                 4: Mission Impossible's Dirty Little Secrets: Stories
                 of Project and Product Failure \\
                 5: The Taming of the Shrewd: Stories of Failures of the
                 Best and Brightest \\
                 6: Summary: Now Remind Me: What's So Great About
                 Failure?",
}

@Book{Glassner:1989:IRT,
  editor =       "Andrew S. Glassner",
  title =        "An Introduction to Ray Tracing",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "xiii + 329",
  year =         "1989",
  ISBN =         "0-12-286160-4",
  ISBN-13 =      "978-0-12-286160-4",
  LCCN =         "T385 .I58 1989",
  bibdate =      "Tue Dec 14 22:53:55 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Glassner:1990:GG,
  editor =       "Andrew S. Glassner",
  title =        "Graphics Gems",
  volume =       "1",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "xxix + 833",
  year =         "1990",
  ISBN =         "0-12-286165-5 (paperback), 0-12-286166-3",
  ISBN-13 =      "978-0-12-286165-9 (paperback), 978-0-12-286166-6",
  LCCN =         "T385 .G75 1990",
  bibdate =      "Tue Dec 14 22:53:50 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Graphics Gems",
  acknowledgement = ack-nhfb,
  tableofcontents = "2D Geometry \\
                 2D rendering \\
                 Image processing \\
                 Frame buffer techniques \\
                 3D Geometry \\
                 3D rendering \\
                 Ray tracing \\
                 Numerical and programming techniques \\
                 Matrix techniques \\
                 Modeling and transformations \\
                 Curves and surfaces",
}

@Book{Glasstone:1946:EPC,
  author =       "Samuel Glasstone",
  title =        "Elements of Physical Chemistry",
  publisher =    pub-VAN-NOSTRAND-REINHOLD,
  address =      pub-VAN-NOSTRAND-REINHOLD:adr,
  pages =        "vii + 695",
  year =         "1946",
  LCCN =         "QD453.G53",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Glasstone:1960:EPC,
  author =       "Samuel Glasstone and David Lewis",
  title =        "Elements of Physical Chemistry",
  publisher =    "D. Van Nostrand",
  address =      "Princeton, NJ, USA",
  edition =      "Second",
  pages =        "v + 758",
  year =         "1960",
  LCCN =         "QD453 .G53 1960",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Gleick:1999:FAJ,
  author =       "James Gleick",
  title =        "Faster: The Acceleration of Just About Everything",
  publisher =    pub-PANTHEON,
  address =      pub-PANTHEON:adr,
  pages =        "x + 324",
  year =         "1999",
  ISBN =         "0-679-40837-1",
  ISBN-13 =      "978-0-679-40837-6",
  LCCN =         "QB209.G48 1999",
  bibdate =      "Mon Dec 06 16:00:20 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$24.00",
  abstract =     "Most of us suffer some degree of ``hurry sickness'' a
                 malady that has launched us into the ``epoch of the
                 nanosecond,'' a need-everything-yesterday sphere
                 dominated by cell phones, computers, faxes, and remote
                 controls. Yet for all the hours, minutes, and even
                 seconds being saved, we're still filling our days to
                 the point that we have no time for such basic human
                 activities as eating, sex, and relating to our
                 families. Written with fresh insight and thorough
                 research, \booktitle{Faster} is a wise and witty look
                 at a harried world not likely to slow down anytime
                 soon.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Pacemaker \\
                 Life as type a \\
                 The door close button \\
                 Your other face \\
                 Time goes standard \\
                 The new accelerators \\
                 Seeing in slow motion \\
                 In real time \\
                 Lost in time \\
                 On Internet time \\
                 Quick --- your opinion? \\
                 Decomposition takes time \\
                 On your mark, get set, think \\
                 A millisecond here, a millisecond there \\
                 1,440 minutes a day \\
                 Sex and paperwork \\
                 Modern conveniences \\
                 Jog more, read less \\
                 Eat and run \\
                 How many hours do you work? \\
                 7:15. took shower \\
                 Attention! Multitaskers \\
                 Shot-shot-shot-shot \\
                 Prest-o change-o! \\
                 MTV zooms by \\
                 Allegro ma non troppo \\
                 Can you see it? \\
                 High-pressure minutes \\
                 Time and motion \\
                 The paradox of efficiency \\
                 365 ways to save time \\
                 The telephone lottery \\
                 Time is not money \\
                 Short-term memory \\
                 The law of small numbers \\
                 Bored \\
                 The end",
}

@Book{Gleick:2003:IN,
  author =       "James Gleick",
  title =        "{Isaac Newton}",
  publisher =    pub-VINTAGE,
  address =      pub-VINTAGE:adr,
  pages =        "xii + 272",
  year =         "2003",
  ISBN =         "1-4000-3295-4",
  ISBN-13 =      "978-1-4000-3295-2",
  LCCN =         "QC16.N7 .G55 2003",
  bibdate =      "Sat Sep 08 16:52:00 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$13.95; CDN\$21.00",
  acknowledgement = ack-nhfb,
  tableofcontents = "1. What imployment is he fit for \\
                 2. Some philosophical questions \\
                 3. To resolve problems by motion \\
                 4. Two great orbs \\
                 5. Bodys and senses \\
                 6. The oddest if not the most considerable detection
                 \\
                 7. Reluctancy and rection \\
                 8. In the midst of a whirlwind \\
                 9. All things are corruptible \\
                 10. Heresy, blasphemy, idolatry \\
                 11. First principles \\
                 12. Every body perseveres \\
                 13. Is he like other men \\
                 14. No man is a witness in his own cause \\
                 15. The marble index of a mind.",
}

@Book{Gleiser:2010:TEC,
  author =       "Marcelo Gleiser",
  title =        "A tear at the edge of creation: a radical new vision
                 for life in an imperfect universe",
  publisher =    "Free Press",
  address =      "New York, NY, USA",
  pages =        "xvii + 285",
  year =         "2010",
  ISBN =         "1-4391-0832-3",
  ISBN-13 =      "978-1-4391-0832-1",
  LCCN =         "QB981 .G575 2010",
  bibdate =      "Sat Sep 18 08:06:18 MDT 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  price =        "US\$25.00",
  URL =          "http://www.loc.gov/catdir/enhancements/fy1009/2009046247-s.html;
                 http://www.loc.gov/catdir/enhancements/fy1011/2009046247-b.html;
                 http://www.loc.gov/catdir/enhancements/fy1011/2009046247-d.html",
  acknowledgement = ack-nhfb,
  subject =      "cosmology; life (Biology)",
  tableofcontents = "Part 1: Oneness. Burst! \\
                 Fear of darkness \\
                 Transition \\
                 Belief \\
                 Oneness: beginnings \\
                 The Pythagorean myth \\
                 Living the Platonic dream \\
                 God, the sun \\
                 To hold the key to the cosmos in your mind-- \\
                 Kepler's mistake \\
                 Part 2: The asymmetry of time \\
                 The Big Bang confirmed \\
                 The world in a grain of sand \\
                 Light acts in mysterious ways \\
                 The imperfection of electromagnetism \\
                 The birth of atoms \\
                 From creation myths to the quantum: a brief history \\
                 Leap of faith \\
                 The jitterbug cosmos \\
                 The universe that we see \\
                 The faltering Big Bang model \\
                 Back to the beginning \\
                 Exotic primordial matter \\
                 A small patch of weirdness \\
                 Darkness falls \\
                 Darkness rules \\
                 Part 3: The asymmetry of matter \\
                 Symmetry and beauty \\
                 A more intimate look at symmetry \\
                 Energy flows, matter dances \\
                 Violation of a beautiful symmetry \\
                 The material world \\
                 Science of the gaps \\
                 Symmetries and asymmetries of matter \\
                 The origin of matter in the universe \\
                 A universe in transition \\
                 Unification: a critique \\
                 Part 4: The asymmetry of life \\
                 Life! \\
                 The spark of life \\
                 Life from no life: first steps \\
                 First life: the ``when'' question \\
                 First life: the ``where'' question \\
                 First life: the ``how'' question \\
                 First life: the building blocks \\
                 The man who killed the life force \\
                 L'univers est dissym\'etrique! \\
                 The chirality of life \\
                 From so asymmetric a beginning \\
                 We are all mutants \\
                 Part 5: The asymmetry of existence \\
                 Fear of darkness II \\
                 Is the universe conscious? \\
                 Meaning and awe \\
                 Beyond symmetry and unification \\
                 Marilyn Monroe's mole and the fallacy of a cosmos
                 ``just right'' for life \\
                 Rare earth, rare life? \\
                 Us and them \\
                 Cosmic loneliness \\
                 A new direction for humanity \\
                 Epilogue: Garden of delights",
}

@Book{Glickstein:1997:WGE,
  author =       "Bob Glickstein",
  title =        "Writing {GNU Emacs} Extensions",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xviii + 215",
  year =         "1997",
  ISBN =         "1-56592-261-1",
  ISBN-13 =      "978-1-56592-261-7",
  LCCN =         "QA76.76.T49G56 1997",
  bibdate =      "Sat Jun 28 10:22:02 1997",
  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/ora.bib",
  abstract =     "This book introduces Emacs Lisp and tells you how to
                 make the editor do whatever you want, whether it's
                 altering the way text scrolls or inventing a whole new
                 ``major mode.'' Topics progress from simple to complex,
                 from lists, symbols, and keyboard commands to syntax
                 tables, macro templates, and error recovery.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Customizing Emacs \\
                 2: Simple New Commands \\
                 3: Cooperating Commands \\
                 4: Searching and Modifying Buffers \\
                 5: Lisp Files \\
                 6: Lists \\
                 7: Minor Mode \\
                 8: Evaluation and Error Recovery \\
                 9: A Major Mode \\
                 10: A Comprehensive Example \\
                 A: Lisp Quick Reference \\
                 B: Debugging and Profiling \\
                 C: Sharing Your Code \\
                 D: Obtaining and Building Emacs",
}

@Book{Gnosis:1984:LL,
  author =       "{Gnosis, Inc.}",
  title =        "Learning Lisp",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "200",
  year =         "1984",
  ISBN =         "0-13-527813-9",
  ISBN-13 =      "978-0-13-527813-0",
  LCCN =         "QA76.73.L23 L43 1984",
  bibdate =      "Thu Sep 30 15:02:58 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Godfrey:1982:MIO,
  author =       "M. D. Godfrey and D. F. Hendry and H. J. Hermans and
                 R. K. Hessenberg",
  title =        "Machine-Independent Organic Software Tools ({MINT})",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  edition =      "Second",
  pages =        "xv + 369",
  year =         "1982",
  ISBN =         "0-12-286982-6",
  ISBN-13 =      "978-0-12-286982-2",
  LCCN =         "QA76.6.M319 1982",
  bibdate =      "Tue Dec 14 22:54:00 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Goldfarb:1990:SH,
  author =       "Charles F. Goldfarb and Yuri Rubinsky",
  title =        "The {SGML} Handbook",
  publisher =    pub-CLARENDON,
  address =      pub-CLARENDON:adr,
  pages =        "xxiv + 663",
  year =         "1990",
  ISBN =         "0-19-853737-9 (hardcover)",
  ISBN-13 =      "978-0-19-853737-3 (hardcover)",
  LCCN =         "Z286.E43 G64 1990",
  bibdate =      "Fri May 26 08:13:56 1995",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/sgml.bib",
  price =        "US\$75.00",
  acknowledgement = ack-nhfb,
  tableofcontents = "Part I: Tutorials \\
                 Annex A: Introduction to Generalized Markup \\
                 Annex B: Basic Concepts \\
                 Annex C: Additional Concepts \\
                 Tutorial D: Link in a Nutshell \\
                 Part II: Overview of the Standard \\
                 1: Introduction \\
                 2: Text Processing Application \\
                 3: SGML Application \\
                 4: SGML Document \\
                 5: Processing Model \\
                 6: Storage Model \\
                 7: Character Sets \\
                 8: Markup Declarations \\
                 9: Conformance \\
                 Part III: SGML Annotated \\
                 Part IV: 8879 Annexes",
}

@Book{Goldfarb:2004:CFG,
  author =       "Charles F. Goldfarb and Paul Prescod",
  title =        "{Charles F. Goldfarb}'s {XML} Handbook",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  edition =      "Fifth",
  pages =        "lv + 1222",
  year =         "2004",
  ISBN =         "0-13-049765-7",
  ISBN-13 =      "978-0-13-049765-9",
  LCCN =         "QA76.76.H94 G65 2004",
  bibdate =      "Wed Dec 31 13:58:26 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Charles F. Goldfarb definitive XML series",
  acknowledgement = ack-nhfb,
  keywords =     "XML (document markup language)",
  tableofcontents = "Preface / Charles F. Goldfarb \\
                 Part 1: The Who, What, and Why of XML \\
                 1: Why XML? \\
                 2: Just enough XML \\
                 3: The XML usage spectrum \\
                 4: XML for people \\
                 5: XML for machines \\
                 6: Secrets of the XML programmers \\
                 7: XML Jargon Demystifier \\
                 Part 2: Three-tier Applications \\
                 8: Personalized frequent-flyer website \\
                 9: Building an online auction website \\
                 10: Enabling data sources for XML \\
                 Part 3: E-commerce \\
                 11: From EDI to IEC: The new Web commerce \\
                 12: XML and EDI: Working together \\
                 Part 4: Integration \\
                 13: Application integration with Web and email \\
                 14: Business integration \\
                 Part 5: Content Management \\
                 15: ``World'' class content management \\
                 16: Content systems \\
                 17: Components: Key to content management \\
                 18: Components for graphic content \\
                 Part 6: Portals \\
                 19: Portal servers for e-business \\
                 20: RxML: Your prescription for healthcare \\
                 Part 7: Publishing \\
                 21: Personalized financial publishing \\
                 22: WYSIWYG XML editing and formatting \\
                 23: Using XSL-FO formatting objects \\
                 24: Beyond XSL: The real DSSSL at work \\
                 Part 8: Desktop XML \\
                 25: XML in office applications \\
                 26: Flexible data capture with adaptive forms \\
                 Part 9: Databases \\
                 27: XML and databases \\
                 28: XPath-based XML DBMS \\
                 29: Storing XML in a relational DBMS \\
                 30: XML, SQL, and XPath: Getting it all together \\
                 Part 10: Content Acquisition \\
                 31: Syndicating content with Web services \\
                 32: Acquiring reusable renditions \\
                 33: Managing change in XML content \\
                 Part 11: Semantic Web \\
                 34: Extended linking \\
                 35: Topic maps: Knowledge navigation aids \\
                 36: RDF: Metadata description for Web resources \\
                 Part 12: Topic Map Applications \\
                 37: Improving intelligence for Intelligence \\
                 38: Application integration using topic maps \\
                 Part 13: Web Services \\
                 39: The Web services vision \\
                 40: Web services technologies \\
                 41: Deploying a Web service \\
                 Part 14: Rich Clients \\
                 42: Converting to rich client Web services \\
                 43: Portable rich client applications \\
                 Part 15: Schemas \\
                 44: Building a schema for a product catalog \\
                 45: Building your e-commerce vocabulary \\
                 Part 16: Voice \\
                 46: VoiceXML in a mobile environment \\
                 47: Adding telephony to your website \\
                 Part 17: Infrastructure \\
                 48: Compression techniques for XML \\
                 49: XML security \\
                 50: New directions for XML applications \\
                 Part 18: XML Core Tutorials \\
                 51: XML basics \\
                 52: Creating a document type definition \\
                 53: Namespaces \\
                 Part 19: Additional XML Tutorials \\
                 54: Entities: Breaking up is easy to do \\
                 55: Advanced features of XML \\
                 56: XML version 1.1 \\
                 57: Reading the XML specification \\
                 Part 20: XPath Tutorials \\
                 58: XPath Primer \\
                 59: XML Path Language (XPath) \\
                 Part 21: Transform Tutorials \\
                 60: XSL Transformations (XSLT) \\
                 61: XSL formatting objects (XSL-FO) \\
                 Part 22: Schema Tutorials \\
                 62: Datatypes \\
                 63: XML Schema (XSDL) \\
                 Part 23: Navigation Tutorials \\
                 64: XML Pointer Language (XPointer) \\
                 65: XML Linking Language (XLink) \\
                 Part 24: Resources \\
                 66: Public XML vocabularies \\
                 67: The XML Handbook Acronym Guide \\
                 68: Other books on XML \\
                 69: Free resources on the CD-ROM",
}

@Book{Goldstein:1998:APS,
  editor =       "Norm Goldstein",
  title =        "The {Associated Press} Stylebook and Libel Manual:
                 Including Guidelines on Photo Captions, Filing the
                 Wire, Proofreaders' Marks, Copyright",
  publisher =    pub-PERSEUS,
  address =      pub-PERSEUS:adr,
  pages =        "334",
  year =         "1998",
  ISBN =         "0-201-33985-4 (paperback)",
  ISBN-13 =      "978-0-201-33985-7 (paperback)",
  LCCN =         "PN4783 .A83 1998",
  bibdate =      "Tue Aug 20 07:37:33 MDT 2013",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Goldstein:2005:IPP,
  author =       "Rebecca Goldstein",
  title =        "Incompleteness: the proof and paradox of {Kurt
                 G{\"o}del}",
  publisher =    pub-NORTON,
  address =      pub-NORTON:adr,
  pages =        "296",
  year =         "2005",
  ISBN =         "0-393-05169-2",
  ISBN-13 =      "978-0-393-05169-8",
  LCCN =         "QA29.G58 G65 2005",
  bibdate =      "Mon Apr 10 06:46:15 MDT 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Great discoveries",
  URL =          "http://www.loc.gov/catdir/toc/ecip051/2004023052.html",
  abstract =     "An introduction to the life and thought of Kurt
                 G{\"o}del, who transformed our conception of math
                 forever.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  remark =       "A Platonist among the positivists -- Hilbert and the
                 formalists -- The proof of incompleteness --
                 G{\"o}del's incompleteness.",
  subject =      "G{\"o}del, Kurt; Logicians; United States; Biography;
                 Austria; Proof theory",
  tableofcontents = "Introduction / \\
                 I: A Platonist among the positivists / 53 \\
                 II: Hilbert and the formalists / 121 \\
                 III: The proof of incompleteness / 147 \\
                 IV: G{\"o}del's incompleteness / 207 \\
                 End Notes / \\
                 Suggested Reading / \\
                 Acknowledgments / \\
                 Index /",
}

@Article{Goldstine:1946:ENI,
  author =       "H. H. Goldstine and Adele Goldstine",
  title =        "The {Electronic Numerical Integrator and Computer
                 (ENIAC)}",
  journal =      j-MATH-TABLES-OTHER-AIDS-COMPUT,
  volume =       "2",
  number =       "15",
  pages =        "97--110",
  month =        jul,
  year =         "1946",
  CODEN =        "MTTCAS",
  ISSN =         "0891-6837",
  bibdate =      "Tue Oct 13 08:44:19 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib; JSTOR
                 database",
  note =         "Reprinted in \cite[\S 7.7]{Randell:1982:ODC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Mathematical Tables and Other Aids to Computation",
  journal-URL =  "http://www.ams.org/mcom/",
}

@Book{Goldstone:2005:FCR,
  author =       "Lawrence Goldstone and Nancy Bazelon Goldstone",
  title =        "The Friar and the Cipher: {Roger Bacon} and the
                 Unsolved Mystery of the Most Unusual Manuscript in the
                 World",
  publisher =    pub-DOUBLEDAY,
  address =      pub-DOUBLEDAY:adr,
  pages =        "xi + 320",
  year =         "2005",
  ISBN =         "0-7679-1473-2",
  ISBN-13 =      "978-0-7679-1473-4",
  LCCN =         "Z105.5.V65 G65 2005",
  bibdate =      "Mon Oct 5 21:14:57 MDT 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/bios/random056/2004050164.html;
                 http://www.loc.gov/catdir/description/random051/2004050164.html;
                 http://www.loc.gov/catdir/enhancements/fy0618/2004050164-s.html",
  acknowledgement = ack-nhfb,
  subject =      "Voynich manuscript; Bacon, Roger",
  subject-dates = "1214?--1294",
  tableofcontents = "Turmoil and opportunity: Roger Bacon's England \\
                 Logic and mysticism: Aristotle, Plato, and Christianity
                 \\
                 Logic and theology: the evolution of scholasticism \\
                 Dogma, drink, and dissent: the University of Paris \\
                 Rebels in gray robes: Oxford \\
                 Science goes mainstream: the rise of Albertus Magnus
                 \\
                 The dumb ox: Thomas Aquinas \\
                 The miraculous doctor: Roger Bacon at Oxford \\
                 Autocracy in the Order of St. Francis \\
                 Theology becomes a science: the logic of Thomas Aquinas
                 \\
                 The great work \\
                 Seeing the future: the Scientia Experimentalis of Roger
                 Bacon \\
                 Knowledge suppressed: the conservatives \\
                 Enigmas and espionage: the strange journey of Dr. Dee
                 \\
                 Brilliant braggart: Francis Bacon \\
                 The trail of the cipher manuscript \\
                 The making of the most mysterious manuscript in the
                 world \\
                 MS 408 \\
                 The unfinished legacy of Roger Bacon",
}

@Book{Golub:1983:MC,
  author =       "Gene H. Golub and Charles F. {Van Loan}",
  title =        "Matrix Computations",
  publisher =    pub-JOHNS-HOPKINS # " and " # pub-NORTH-OXFORD,
  address =      pub-JOHNS-HOPKINS:adr # " and " # pub-NORTH-OXFORD:adr,
  pages =        "xvi + 476",
  year =         "1983",
  ISBN =         "0-8018-3010-9 (hardcover), 0-8018-3011-7 (paperback),
                 0-946536-00-7, 0-946536-05-8 (paperback)",
  ISBN-13 =      "978-0-8018-3010-5 (hardcover), 978-0-8018-3011-2
                 (paperback), 978-0-946536-00-9, 978-0-946536-05-4
                 (paperback)",
  LCCN =         "QA188 .G65 1983",
  MRclass =      "65Fxx (65-02)",
  MRnumber =     "85h:65063",
  MRreviewer =   "C. Ilioi",
  bibdate =      "Sun Jan 14 09:27:53 1996",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/l/lanczos-cornelius.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Johns Hopkins Series in the Mathematical Sciences",
  URL =          "http://www.jstor.org/stable/2008107;
                 http://www.jstor.org/stable/2030489;
                 http://www.jstor.org/stable/3616959",
  acknowledgement = ack-nhfb,
  author-dates = "Gene Howard Golub (February 29, 1932--November 16,
                 2007)",
  keywords =     "algebra --- matrices --- computation by digital
                 computer systems; matrices --- data processing",
  remark =       "See review by James W. Demmel in SIAM Review, Vol. 28,
                 No. 2 (Jul., 1986), pp. 252-255, review by David F.
                 Mayers, Mathematics of Computation, Vol. 47, No. 175
                 (Jul., 1986), pp. 376-377, and review by T. J. Randall,
                 The Mathematical Gazette, Vol. 69, No. 448 (Jun.,
                 1985), p. 152.",
  tableofcontents = "Preface to the Third Edition \\
                 Software \\
                 Selected References \\
                 Matrix Multiplication Problems / 1 \\
                 Matrix Analysis / 48 \\
                 General Linear Systems / 87 \\
                 Special Linear Systems / 133 \\
                 Orthogonalization and Least Squares / 206 \\
                 Parallel Matrix Computations / 275 \\
                 The Unsymmetric Eigenvalue Problem / 308 \\
                 The Symmetric Eigenvalue Problem / 391 \\
                 Lanczos Methods / 470 \\
                 Iterative Methods for Linear Systems / 508 \\
                 Functions of Matrices / 555 \\
                 Special Topics / 579 \\
                 Bibliography / 637 \\
                 Index / 687",
}

@Book{Golub:1989:MC,
  author =       "Gene H. Golub and Charles F. {Van Loan}",
  title =        "Matrix Computations",
  volume =       "3",
  publisher =    pub-JOHNS-HOPKINS,
  address =      pub-JOHNS-HOPKINS:adr,
  edition =      "Second",
  pages =        "xix + 642",
  year =         "1989",
  ISBN =         "0-8018-3772-3 (hardcover), 0-8018-3739-1 (paperback)",
  ISBN-13 =      "978-0-8018-3772-2 (hardcover), 978-0-8018-3739-5
                 (paperback)",
  LCCN =         "QA188 .G65 1989",
  MRclass =      "65Fxx (65-02)",
  MRnumber =     "90d:65055",
  MRreviewer =   "Perry Smith",
  bibdate =      "Mon Oct 26 07:31:01 1998",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/l/lanczos-cornelius.bib;
                 https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
                 https://www.math.utah.edu/pub/bibnet/subjects/domain-decomp.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/matlab.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook2.bib",
  price =        "US\$14.50",
  series =       "Johns Hopkins Series in the Mathematical Sciences",
  ZMnumber =     "0733.65016",
  abstract =     "Thoroughly revised, updated, and expanded by more than
                 one third, this new edition of Golub and Van Loan's
                 landmark book in scientific computing provides the
                 vital mathematical background and algorithmic skills
                 required for the production of numerical software. New
                 chapters on high performance computing use matrix
                 multiplication to show how to organize a calculation
                 for vector processors as well as for computers with
                 shared or distributed memories. Also new are
                 discussions of parallel vector methods for linear
                 equations, least squares, and eigenvalue problems.",
  acknowledgement = ack-nhfb,
  author-dates = "Gene Howard Golub (February 29, 1932--November 16,
                 2007)",
  keywords =     "book; math; matrices --- data processing; matrices ---
                 informatique; na; nla",
  libnote =      "Not yet in my library.",
  remark =       "See review by G. W. Steward in Mathematics of
                 Computation, Vol. 56, No. 193 (Jan., 1991), pp.
                 380--381.",
  shorttableofcontents = "Preface to the Third Edition \\
                 Software \\
                 Selected References \\
                 Matrix Multiplication Problems / 1 \\
                 Matrix Analysis / 48 \\
                 General Linear Systems / 87 \\
                 Special Linear Systems / 133 \\
                 Orthogonalization and Least Squares / 206 \\
                 Parallel Matrix Computations / 275 \\
                 The Unsymmetric Eigenvalue Problem / 308 \\
                 The Symmetric Eigenvalue Problem / 391 \\
                 Lanczos Methods / 470 \\
                 Iterative Methods for Linear Systems / 508 \\
                 Functions of Matrices / 555 \\
                 Special Topics / 579 \\
                 Bibliography / 637 \\
                 Index / 687",
  tableofcontents = "Preface to the First Edition / xi \\
                 Preface to the Second Edition / xv \\
                 Using the Book / xvii \\
                 1: Matrix Multiplication Problems / 1 \\
                 1.1 Basic Algorithms and Notations / 2 \\
                 1.2 Exploiting Structure / 16 \\
                 1.3 Block Matrices and Algorithms / 25 \\
                 1.4 Aspects of Vector Pipeline Computing / 35 \\
                 2: Matrix Analysis / 49 \\
                 2.1 Basic Ideas from Linear Algebra / 49 \\
                 2.2 Vector Norms / 53 \\
                 2.3 Matrix Norms / 55 \\
                 2.4 Finite Precision Matrix Computations / 60 \\
                 2.5 Orthogonality and the SVD / 70 \\
                 2.6 Projections and the CS Decomposition / 75 \\
                 2.7 The Sensitivity of Square Linear Systems / 79 \\
                 3: General Linear Systems / 86 \\
                 3.1 Triangular Systems / 86 \\
                 3.2 Computing the LU Factorization / 92 \\
                 3.3 Roundoff Analysis of Gaussian Elimination / 104 \\
                 3.4 Pivoting / 108 \\
                 3.5 Improving and Estimating Accuracy / 123 \\
                 4: Special Linear Systems / 133 \\
                 4.1 The $LDM^T$ and $LDL^T$ Factorizations / 134 \\
                 4.2 Positive Definite Systems / 139 \\
                 4.3 Banded Systems / 149 \\
                 4.4 Symmetric Indefinite Systems / 159 \\
                 4.5 Block Tridiagonal Systems / 170 \\
                 4.6 Vandermonde Systems / 178 \\
                 4.7 Toeplitz Systems / 183 \\
                 5: Orthogonalization and Least Squares / 193 \\
                 5.1 Householder and Givens Transformations / 194 \\
                 5.2 The $Q R$ Factorization / 211 \\
                 5.3 The Full Rank Least Squares Problem / 221 \\
                 5.4 Other Orthogonal Factorizations / 233 \\
                 5.5 The Rank Deficient Least Squares Problem / 241 \\
                 5.6 Weighting and Iterative Improvement / 250 \\
                 5.7 A Note on Square and Underdetermined Systems / 256
                 \\
                 6: Parallel Matrix Computations / 260 \\
                 6.1 Distributed Memory Gaxpy / 261 \\
                 6.2 Shared Memory Gaxpy / 276 \\
                 6.3 Parallel Matrix Multiplication / 288 \\
                 6.4 Ring Factorization Procedures / 301 \\
                 6.5 Mesh Factorization Procedures / 310 \\
                 6.6 Shared Memory Factorization Methods / 321 \\
                 7: The Unsymmetric Eigenvalue Problem / 331 \\
                 7.1 Properties and Decompositions / 332 \\
                 7.2 Perturbation Theory / 341 \\
                 7.3 Power Iterations / 351 \\
                 7.4 Hessenberg and Real Schur Forms / 361 \\
                 7.5 The Practical $Q R$ Algorithm / 373 \\
                 7.6 Invariant Subspace Computations / 382 \\
                 7.7 The $QZ$ Method for $A x = \lambda B x$ / 394 \\
                 8: The Symmetric Eigenvalue Problem / 409 \\
                 8.1 Properties, Decompositions, Perturbation Theory /
                 410 \\
                 8.2 The Symmetric $Q R$ Algorithm / 418 \\
                 8.3 Computing the SVD / 427 \\
                 8.4 Some Special Methods / 437 \\
                 8.5 Jacobi Methods / 444 \\
                 8.6 A Divide and Conquer Method / 459 \\
                 8.7 More Generalized Eigenvalue Problems / 466 \\
                 9: Lanczos Methods / 475 \\
                 9.1 Derivation and Convergence Properties / 476 \\
                 9.2 Practical Lanczos Procedures / 484 \\
                 9.3 Applications and Extensions / 494 \\
                 10: Iterative Methods for Linear Systems / 505 \\
                 10.1 The Standard Iterations / 506 \\
                 10.2 The Conjugate Gradient Method / 516 \\
                 10.3 Preconditioned Conjugate Gradient Methods / 527
                 \\
                 11: Functions of Matrices / 539 \\
                 11.1 Eigenvalue Methods / 540 \\
                 11.2 Approximation Methods / 546 \\
                 11.3 The Matrix Exponential / 555 \\
                 12: Special Topics / 561 \\
                 12.1 Some Constrained Least Squares Problems / 561 \\
                 12.2 Subset Selection Using the SVD / 571 \\
                 12.3 Total Least Squares / 576 \\
                 12.4 Comparing Subspaces Using the SVD / 581 \\
                 12.5 Some Modified Eigenvalue Problems / 587 \\
                 12.6 Updating the $Q R$ Factorization / 592 \\
                 Bibliography / 601 \\
                 Index / 635",
}

@Book{Gomez:1999:ESC,
  editor =       "Claude Gomez and others",
  title =        "Engineering and Scientific Computing with {Scilab}",
  publisher =    pub-BIRKHAUSER,
  address =      pub-BIRKHAUSER:adr,
  pages =        "xxv + 491",
  year =         "1999",
  ISBN =         "0-8176-4009-6, 3-7643-4009-6",
  ISBN-13 =      "978-0-8176-4009-5, 978-3-7643-4009-4",
  LCCN =         "TA345 .E5334 1999",
  bibdate =      "Sat Jun 13 10:48:46 MDT 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  remark =       "Contributing authors: Cary Bunks and Jean-Philippe
                 Chancelier and Fran{\c{c}}ois Delebecque and Maurice
                 Goursat and Ramine Nikoukhah and Serge Steer.",
  subject =      "Engineering; Computer programs; Science; SciLab",
}

@Book{Gomez:2018:RPE,
  author =       "Guillaume Gomez and Antoni Boucher",
  title =        "{Rust} Programming by Example: Enter the World of
                 {Rust} by Building Engaging, Concurrent, Reactive, and
                 Robust Applications",
  publisher =    pub-PACKT,
  address =      pub-PACKT:adr,
  pages =        "viii + 437",
  year =         "2018",
  ISBN =         "1-78839-063-6, 1-78847-030-3 (e-book)",
  ISBN-13 =      "978-1-78839-063-7, 978-1-78847-030-8 (e-book)",
  LCCN =         "QA76.73.R88",
  bibdate =      "Tue Dec 10 05:30:42 MST 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://proquestcombo.safaribooksonline.com/9781788390637",
  abstract =     "Rust is an open source, safe, concurrent, practical
                 language created by Mozilla. It runs blazingly fast,
                 prevents segfaults, and guarantees safety. This book
                 gets you started with essential software development by
                 guiding you through the different aspects of Rust
                 programming. With this approach, you can bridge the gap
                 between learning and implementing immediately.
                 Beginning with an introduction to Rust, you'll learn
                 the basic aspects such as its syntax, data types,
                 functions, generics, control flows, and more. After
                 this, you'll jump straight into building your first
                 project, a Tetris game. Next you'll build a graphical
                 music player and work with fast, reliable networking
                 software using Tokio, the scalable and productive
                 asynchronous IO Rust library. Over the course of this
                 book, you'll explore various features of Rust
                 Programming including its SDL features, event loop,
                 File I/O, and the famous GTK+ widget toolkit. Through
                 these projects, you'll see how well Rust performs in
                 terms of concurrency --- including parallelism,
                 reliability, improved performance, generics, macros,
                 and thread safety. We'll also cover some asynchronous
                 and reactive programming aspects of Rust. By the end of
                 the book, you'll be comfortable building various
                 real-world applications in Rust. Style and approach.
                 This comprehensive guide uses practical examples to
                 implement various Rust programming features.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Rust (System programming language); Programming
                 languages (Electronic computers); Computer programming;
                 Portable and handheld devices: consumer/user guides;
                 Mobile phones: consumer/user guides; Parallel
                 processing; Programming and scripting languages:
                 general; Computers; Programming; Parallel; Hardware;
                 Handheld Devices; Programming Languages; Java; Computer
                 programming; Programming languages (Electronic
                 computers)",
  tableofcontents = "Preface \\
                 1: Basics of Rust \\
                 Getting to know Rust \\
                 Installing Rust \\
                 Windows \\
                 Linux/Mac \\
                 Test your installation \\
                 Documentation and reference \\
                 Main function \\
                 Variables \\
                 Built-in data types \\
                 Integer types \\
                 Floating-point types \\
                 Boolean type \\
                 Character type \\
                 Control flow \\
                 Writing a condition \\
                 Creating while loops \\
                 Creating functions \\
                 Creating structures \\
                 References \\
                 Clone types \\
                 Copy types \\
                 Mutable references \\
                 Methods \\
                 Constructors \\
                 Tuples \\
                 Enumerations \\
                 Pattern matching \\
                 Irrefutable patterns \\
                 Traits \\
                 Default methods \\
                 Associated types \\
                 Rules \\
                 Generics \\
                 The Option type \\
                 Arrays \\
                 Slices \\
                 For loops \\
                 Macros \\
                 Multiple pattern rules \\
                 Repetitions \\
                 Optional quantifier \\
                 Summary \\
                 2: Starting with SDL \\
                 Understanding Rust crates \\
                 Installing SDL2 \\
                 Installing SDL2 on Linux \\
                 Installing SDL2 on Mac \\
                 Installing SDL2 on Windows \\
                 Windows with Build Script \\
                 Windows (MinGW) \\
                 Windows (MSVC) \\
                 Setting up your Rust project \\
                 Cargo and crates.io \\
                 The docs.rs documentation \\
                 Back to our Cargo.toml file \\
                 Rust's modules \\
                 Tetris \\
                 Creating a window \\
                 Drawing \\
                 Playing with Options \\
                 Solution \\
                 Loading images \\
                 Installing SDL2\_image on Mac \\
                 Installing SDL2\_image on Linux \\
                 Installing SDL2\_image on Windows \\
                 Playing with features \\
                 Playing with images \\
                 Handling files \\
                 Saving/loading high scores \\
                 Iterators \\
                 Reading formatted data from files \\
                 Summary \\
                 3: Events and Basic Game Mechanisms \\
                 Writing Tetris \\
                 Tetrimino \\
                 Creating tetriminos \\
                 Generating a tetrimino \\
                 Rotating a tetrimino \\
                 Tetris struct \\
                 Interacting with the game map \\
                 SDL events \\
                 Score, level, lines sent \\
                 Levels and lines sent \\
                 Highscores loading/overwriting \\
                 Summary \\
                 4: Adding All Game Mechanisms \\
                 Getting started with game mechanisms \\
                 Rendering UI \\
                 Rendering initialization \\
                 Rendering \\
                 Playing with fonts \\
                 Install on OS X \\
                 Install on Linux \\
                 Other system/package manager \\
                 Loading font \\
                 Summary \\
                 5: Creating a Music Player \\
                 Installing the prerequisite \\
                 Installing GTK+ on Linux \\
                 Installing GTK+ on Mac \\
                 Installing GTK+ on Windows \\
                 Creating your first window \\
                 Closure \\
                 Preventing the default behavior of an event \\
                 Creating a toolbar \\
                 Stock item \\
                 Improving the organization of the application \\
                 Adding tool button events \\
                 Lifetime \\
                 Ownership \\
                 Containers \\
                 Types of containers \\
                 The Box container \\
                 Adding a playlist \\
                 The MVC pattern \\
                 Opening MP3 files \\
                 Reference-counting pointer \\
                 ID3 (??) \\
                 (??) \\
                 MP3 metadata \\
                 Opening files with a file dialog \\
                 Deleting a song \\
                 Displaying the cover when playing a song \\
                 Summary \\
                 6: Implementing the Engine of the Music Player \\
                 Installing the dependencies \\
                 Installing dependencies on Linux \\
                 Installing dependencies on Mac \\
                 Installing dependencies on Windows \\
                 Decoding MP3 files \\
                 Adding dependencies \\
                 Implementing an MP3 decoder \\
                 Getting the frame samples \\
                 Playing music \\
                 Event loop \\
                 Atomic reference counting \\
                 Mutual exclusion \\
                 Send trait \\
                 Sync trait",
}

@Book{Gonnet:1984:HAD,
  author =       "Gaston H. Gonnet",
  title =        "Handbook of Algorithms and Data Structures",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xi + 286",
  year =         "1984",
  ISBN =         "0-201-14218-X",
  ISBN-13 =      "978-0-201-14218-1",
  LCCN =         "QA76.6 .G636 1984",
  bibdate =      "Tue Dec 14 22:54:11 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$12.95",
  series =       "International Computer Science Series. Editors: A. D.
                 McGettrick and J. van Leeuwen",
  acknowledgement = ack-nhfb,
}

@Book{Gonzalez:1977:DIP,
  author =       "Rafael C. Gonzalez and Paul Wintz",
  title =        "Digital Image Processing",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xvi + 431",
  year =         "1977",
  ISBN =         "0-201-02596-5 (hardcover), 0-201-02597-3 (paperback)",
  ISBN-13 =      "978-0-201-02596-5 (hardcover), 978-0-201-02597-2
                 (paperback)",
  LCCN =         "TA1632 .G66 1977",
  bibdate =      "Tue Dec 14 22:54:13 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "1. Introduction \\
                 2. Digital image fundamentals \\
                 3. Image transforms \\
                 4. Image enhancement \\
                 5. Image restoration \\
                 6. Image encoding \\
                 7. Image segmentation and description",
  tableofcontents = "Chapters end with a Summary \\
                 References and Further Reading, and Problems \\
                 Introduction \\
                 What Is Digital Image Processing? The Origins of
                 Digital Image Processing \\
                 Examples of Fields that Use Digital Image Processing
                 \\
                 Fundamental Steps in Digital Image Processing \\
                 Components of an Image Processing System \\
                 Digital Image Fundamentals \\
                 Elements of Visual Perception \\
                 Light and the Electromagnetic Spectrum \\
                 Image Sensing and Acquisition \\
                 Image Sampling and Quantization \\
                 Some Basic Relationships Between Pixels \\
                 Linear and Nonlinear Operations \\
                 Image Enhancement in the Spatial Domain \\
                 Background \\
                 Some Basic Gray Level Transformations \\
                 Histogram Processing \\
                 Enhancement Using Arithmetic/Logic Operations \\
                 Basics of Spatial Filtering \\
                 Smoothing Spatial Filters \\
                 Sharpening Spatial Filters \\
                 Combining Spatial Enhancement Methods \\
                 Image Enhancement in the Frequency Domain \\
                 Background \\
                 Introduction to the Fourier Transform and the Frequency
                 Domain \\
                 Smoothing Frequency-Domain Filters \\
                 Sharpening Frequency Domain Filters \\
                 Homomorphic Filtering \\
                 Implementation \\
                 Image Restoration \\
                 A Model of the Image Degradation/Restoration Process
                 \\
                 Noise Models \\
                 Restoration in the Presence of Noise Only-Spatial
                 Filtering \\
                 Periodic Noise Reduction by Frequency Domain Filtering
                 \\
                 Linear, Position-Invariant Degradations \\
                 Estimating the Degradation Function \\
                 Inverse Filtering \\
                 Minimum Mean Square Error (Wiener) Filtering \\
                 Constrained Least Squares Filtering \\
                 Geometric Mean Filter \\
                 Geometric Transformations \\
                 Color Image Processing \\
                 Color Fundamentals \\
                 Color Models \\
                 Pseudocolor Image Processing \\
                 Basics of Full-Color Image Processing \\
                 Color Transformations \\
                 Smoothing and Sharpening \\
                 Color Segmentation \\
                 Noise in Color Images \\
                 Color Image Compression \\
                 Wavelets and Multiresolution Processing \\
                 Background \\
                 Multiresolution Expansions \\
                 Wavelet Transforms in One Dimension \\
                 The Fast Wavelet Transform \\
                 Wavelet Transforms in Two Dimensions \\
                 Wavelet Packets \\
                 Image Compression \\
                 Fundamentals \\
                 Image Compression Models \\
                 Elements of Information Theory \\
                 Error-Free Compression \\
                 Lossy Compression \\
                 Image Compression Standards \\
                 Morphological Image Processing \\
                 Preliminaries \\
                 Dilation and Erosion \\
                 Opening and Closing \\
                 The Hit-or-Miss Transformation \\
                 Some Basic Morphological Algorithms \\
                 Extensions to Gray-Scale Images \\
                 Image Segmentation \\
                 Detection of Discontinuities \\
                 Edge Linking and Boundary Detection \\
                 Thresholding \\
                 Region-Based Segmentation \\
                 Segmentation by Morphological Watersheds \\
                 The Use of Motion in Segmentation \\
                 Representation and Description \\
                 Representation \\
                 Boundary Descriptors \\
                 Regional Descriptors \\
                 Use of Principal Components for Description \\
                 Relational Descriptors \\
                 Object Recognition \\
                 Patterns and Pattern Classes \\
                 Recognizing \ldots{}",
}

@Book{Goodchild:2004:ETRb,
  author =       "Peter Goodchild",
  title =        "{Edward Teller}, the real {Dr. Strangelove}",
  publisher =    pub-HARVARD,
  address =      pub-HARVARD:adr,
  pages =        "xxv + 469 + 16",
  year =         "2004",
  ISBN =         "0-674-01669-6",
  ISBN-13 =      "978-0-674-01669-9",
  LCCN =         "QC16.T37 G66 2004",
  bibdate =      "Thu Oct 6 06:57:45 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/t/teller-edward.bib;
                 https://www.math.utah.edu/pub/tex/bib/bullatsci.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 melvyl.cdlib.org:210/CDL90;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://alsos.wlu.edu/information.aspx?id=2237",
  abstract =     "This excellent biography illuminates the enigmatic
                 character of the powerful twentieth century physicist,
                 Edward Teller, and gives perspective on the
                 intersection of science and technology with United
                 States policies in the last half of the 20th century.
                 Initially, it describes Teller's early years in
                 Hungary, which molded his personality and formed his
                 views of an untrustworthy Soviet Union. It then
                 narrates significant events in his education and early
                 academic career including his doctoral work with Werner
                 Heisenberg and migration to an academic position in the
                 United States in 1935. The narrative then describes his
                 work in the Manhattan Project at Los Alamos under the
                 leadership of J. Robert Oppenheimer, where Teller
                 pursued the idea of a hydrogen bomb, a more powerful
                 weapon than the fission bomb developed by the Project.
                 After the end of World War II, he continued the
                 development of the hydrogen bomb, which was
                 successfully tested in 1952. Throughout the Cold War,
                 Teller's obsession with the Soviet threat led him to
                 oppose nuclear arms control, continue development of
                 nuclear weapons, and strongly support the Star Wars
                 anti-ballistic missile program of the Reagan
                 administration. Those views brought him into conflict
                 with Oppenheimer and other members of the scientific
                 community. Teller was an important witness in the
                 Atomic Energy Commission (AEC) hearing that denied
                 Oppenheimer's security clearance in 1954. The biography
                 contains extensive endnotes and references.",
  acknowledgement = ack-nhfb,
  remark =       "Originally published: Great Britain: Weinfeld and
                 Nicolson, 2004.",
  subject =      "Teller, Edward; physicists; United States; biography;
                 atomic bomb; history",
  subject-dates = "1908--2003",
  tableofcontents = "War, revolution, peace and maths \\
                 In the company of Gods \\
                 Twilight of a golden age \\
                 American the beautiful \\
                 The Hungarian conspiracy \\
                 Skirmishes \\
                 Maverick on the Mesa \\
                 The little toe of the ghost \\
                 The legacy of Hiroshima \\
                 Wilderness years \\
                 The taking of Washington \\
                 Unholy alliances \\
                 A `simple, great and stupid' mistake \\
                 Technically so sweet \\
                 Mike \\
                 `Soled' to the Californians \\
                 Bravo \\
                 The hearing \\
                 Aftermath \\
                 `Almost like Ivory soap' \\
                 A matter of detection \\
                 Plowshare \\
                 Confounding Camelot \\
                 Struggling uphill \\
                 Bringing up the props \\
                 Excalibur \\
                 Reykjavik \\
                 Brilliant pebbles.",
}

@Book{Goodheart:1994:MGE,
  author =       "Berny Goodheart and James Cox",
  title =        "The Magic Garden Explained: The Internals of {UNIX}
                 System {V} Release 4, an Open Systems Design",
  publisher =    pub-PH,
  pages =        "xxviii + 664",
  year =         "1994",
  ISBN =         "0-13-098138-9",
  ISBN-13 =      "978-0-13-098138-7",
  LCCN =         "QA76.76.O63 G6633 1994",
  bibdate =      "Wed Aug 10 11:59:36 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  note =         "Probably a good companion to \cite{Bach:1986:DUO}
                 \ldots{}. Covering the internals, system calls, kernal
                 of {System V Release 4} \ldots{}.",
  price =        "US\$38.00",
  acknowledgement = ack-sk,
  libnote =      "Not in my library.",
  tableofcontents = "Part 1. Overview \\
                 1: Background and History \\
                 2: Concepts and Facilities \\
                 \\
                 Part 2. UNIX Internals \\
                 3: Memory Management Subsystem \\
                 4: Process Management Subsystem \\
                 5: I/O Subsystem \\
                 6: File Management Subsystem \\
                 \\
                 Part 3. Additional Facilities \\
                 7: Streams \\
                 8: Interprocess Communication \\
                 9: Crash \\
                 Appendix A: System call error codes \\
                 Appendix B: filock structure \\
                 Appendix C: siginfo structure \\
                 Appendix D: strevent structure \\
                 Appendix E: Streams D3DK functions \\
                 Appendix F: Crash commands \\
                 Appendix G: IEEE POSIX Suite",
}

@Book{Goossens:1994:LC,
  author =       "Michel Goossens and Frank Mittelbach and Alexander
                 Samarin",
  title =        "The {\LaTeX} Companion",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xxi + 528 + 2",
  year =         "1994",
  ISBN =         "0-201-54199-8 (paperback), 0-201-77591-3 (hardcover)",
  ISBN-13 =      "978-0-201-54199-1 (paperback), 978-0-201-77591-4
                 (hardcover)",
  LCCN =         "Z253.4.L38 G66 1994",
  bibdate =      "Thu Jun 03 09:31:37 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  series =       "Tools and Techniques for Computer Typesetting",
  ZMnumber =     "0816.68140",
  abstract =     "This volume includes the revised LaTeX standard and
                 introduces extensions not covered in Lamport. The book
                 also introduces tools and techniques that will enhance
                 use of Lamport's LaTeX and help format documents more
                 quickly and efficiently. It provides guidance for
                 customizing commands.",
  acknowledgement = ack-nhfb,
}

@Book{Goossens:1997:LGC,
  author =       "Michel Goossens and Sebastian Rahtz and Frank
                 Mittelbach",
  title =        "The {\LaTeX} Graphics Companion: Illustrating
                 Documents with {\TeX} and {PostScript}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xxi + 554",
  year =         "1997",
  ISBN =         "0-201-85469-4",
  ISBN-13 =      "978-0-201-85469-5",
  LCCN =         "Z253.4.L38G663 1997",
  bibdate =      "Fri Jul 11 07:51:47 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  price =        "US\$39.75",
  series =       "Tools and Techniques for Computer Typesetting",
  acknowledgement = ack-nhfb,
  keywords =     "Computerized typesetting; LaTeX (Computer file);
                 Mathematics printing --- Computer programs; PostScript
                 (Computer program language); Scientific illustration
                 --- Computer programs; Technical publishing ---
                 Computer programs.",
  tableofcontents = "1: Graphics with \LaTeX{} \\
                 2: The \LaTeX{} $2_\epsilon$ graphics bundle \\
                 3: Working with METAFONT and METAPOST \\
                 4: Harnessing PostScript inside \LaTeX{}: the PSTricks
                 package \\
                 5: The Xy-pic package \\
                 6: Applications in chemistry, physics, and engineering
                 \\
                 7: Preparing music scores \\
                 8: Playing games \\
                 9: The world of color \\
                 10: Using PostScript fonts \\
                 11: PostScript drivers and tools \\
                 A: Technical appendixes \\
                 B: Getting all the goodies",
}

@Book{Goossens:1999:LWC,
  author =       "Michel Goossens and Sebastian Rahtz",
  title =        "The {\LaTeX} {Web} Companion: Integrating {\TeX},
                 {HTML}, and {XML}",
  publisher =    pub-AW-LONGMAN,
  address =      pub-AW-LONGMAN:adr,
  pages =        "xxii + 522",
  year =         "1999",
  ISBN =         "0-201-43311-7",
  ISBN-13 =      "978-0-201-43311-1",
  LCCN =         "QA76.76.H94G66 1999",
  bibdate =      "Thu Jun 03 09:32:08 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "With Eitan M. Gurari and Ross Moore and Robert S.
                 Sutor.",
  price =        "US\$36.95",
  series =       "Tools and Techniques for Computer Typesetting",
  abstract =     "This book shows how you can publish LaTeX documents on
                 the Web. LaTeX was born of the scientist's need to
                 prepare well-formatted information, particularly with
                 pictures and mathematics included; the Web was born of
                 the scientist's need to communicate information
                 electronically. Until now, it has been difficult to
                 find solutions that address both needs. HTML and
                 today's Web browsers deal inadequately with the
                 nontextual components of scientific documents. This
                 book, at last, describes tools and techniques for
                 transforming LaTeX sources into Web formats for
                 electronic publication, and for transforming Web
                 sources into LaTeX documents for optimal printing.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: The Web, its documents, and {\LaTeX} \\
                 2: Portable Document Format \\
                 3: The {\LaTeX}2HTML translator \\
                 4: Translating {\LaTeX} to HTML using {\TeX}4ht \\
                 5: Direct display of {\LaTeX} on the Web \\
                 6: HTML, SGML, and XML: Three markup languages \\
                 7: CSS, DSSSL, and XSL: Doing it with style \\
                 8: MathML, intelligent math markup \\
                 A: Example files \\
                 B: Technical appendixes \\
                 C: Internalization issues",
}

@Book{Goossens:2008:LGC,
  editor =       "Michel Goossens and Frank Mittelbach and Sebastian
                 Rahtz and Denis Roegel and Herbert Vo{\ss}",
  title =        "The {\LaTeX} Graphics Companion",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Second",
  year =         "2008",
  ISBN =         "0-321-50892-0",
  ISBN-13 =      "978-0-321-50892-8",
  LCCN =         "Z253.4.L38G663 2008",
  bibdate =      "Thu Sep 20 12:02:17 MDT 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib;
                 z3950.bibsys.no:2100/BIBSYS",
  series =       "Addison-Wesley series on tools and techniques for
                 computer typesetting",
  abstract =     "The LaTeX typesetting system remains a popular choice
                 for typesetting a wide variety of documents, from
                 papers, journal articles, and presentations, to books
                 --- especially those that include technical text or
                 demand high-quality composition. This book is the most
                 comprehensive guide to making illustrations in LaTeX
                 documents, and it has been completely revised and
                 expanded to include the latest developments in LaTeX
                 graphics. The authors describe the most widely used
                 packages and provide hundreds of solutions to the most
                 commonly encountered LaTeX illustration problems.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Graphics with LaTeX \\
                 Standard LaTeX interfaces \\
                 The METAFONT and METAPOST: TeX's mates \\
                 METAPOST applications \\
                 Harnessing PostScript inside LaTeX: PSTricks \\
                 The main PSTricks packages \\
                 The XY-pic package \\
                 Applications in science, technique and medicine \\
                 Preparing music scores \\
                 Playing games \\
                 The world of color \\
                 Appendix A. Producing PDF from various sources \\
                 Appendix B. LaTeX software and user group information",
}

@Book{Gordin:2004:WOT,
  author =       "Michael D. Gordin",
  title =        "A well-ordered thing: {Dmitrii Mendeleev} and the
                 shadow of the periodic table",
  publisher =    pub-BASIC-BOOKS,
  address =      pub-BASIC-BOOKS:adr,
  pages =        "xx + 364",
  year =         "2004",
  ISBN =         "0-465-02775-X",
  ISBN-13 =      "978-0-465-02775-0",
  LCCN =         "QD22.M43 G67 2004",
  bibdate =      "Mon Jul 5 08:06:41 MDT 2010",
  bibsource =    "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",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0832/2003025533-b.html;
                 http://www.loc.gov/catdir/enhancements/fy0832/2003025533-d.html;
                 http://www.loc.gov/catdir/toc/ecip0411/2003025533.html",
  acknowledgement = ack-nhfb,
  subject =      "Mendeleyev, Dmitry Ivanovich; chemists; Russia
                 (Federation); biography; periodic law",
  subject-dates = "1834--1907",
  tableofcontents = "List of Figures \\
                 Acknowledgments \\
                 Note to the Reader \\
                 Preface \\
                 Chapter 1: Introduction: Autocracy and Mr. Mendeleev
                 \\
                 Liberalism in the Name of Autocracy \\
                 Making Sense of the Man \\
                 Notes \\
                 Chapter 2: Elements of the System: Building Periodicity
                 and a Scientific Petersburg \\
                 The Education of Dmitrii Mendeleev \\
                 The Principles of Chemistry and the Periodic System \\
                 System into Law: Making Periodicity Natural \\
                 Clairvoyance: The Eka-Elements \\
                 The Vindication of Prophecy: The Eka-Discoveries \\
                 Conclusion: Gathering the Elements of the System \\
                 Notes \\
                 Chapter 3: The Ideal Gas Lawyer: Expanding Science on
                 the Banks of the Neva \\
                 True Bedrock: The Cultural Significance of Ether \\
                 Confined Spaces: The Prosecution of the Gas Project \\
                 Clearing the Atmosphere: Strategies of Publication \\
                 The Weather Overground: Mendeleev's Meteorology \\
                 Plagued by Theory: Abandoning Gases \\
                 Notes \\
                 Chapter 4: Chasing Ghosts: Spiritualism and the
                 Struggle for Public Knowledge \\
                 Made in America, Remade in Russia: The Transfer of
                 Spiritualism \\
                 Spiritualism in 1875: Tenuous Cooperation \\
                 Spiritualism in 1876: A Meltdown of Method \\
                 Public Spirited: Rhetorical Strategies and Spinning the
                 Commission \\
                 At Wit's End: Spiritualism after the Commission \\
                 Notes \\
                 Chapter 5: The Great Reaction: Everyone against the
                 Academy of Sciences \\
                 Social Climbing: The Academy and the Physico-Chemical
                 Society \\
                 The Ballot Booth: Voting on Mendeleev \\
                 Tempest in the Teapot: Russian Chemists \\
                 Outside the Teapot: The Great Newspaper War \\
                 Back Rooms: Why Was Mendeleev Rejected? \\
                 To Thine Own Self: The Making of a New Mendeleev \\
                 Notes \\
                 Chapter 6: The Imperial Turn: Economics, Evolution, and
                 Empire \\
                 The Two Petersburgs: Mendeleev's Early Economics \\
                 Real Economics: Mendeleev and the Russian Economy \\
                 Theoretical Economics: The Evolution of Societies \\
                 Theoretical Politics: Governments and Populations \\
                 Measure of All the Russias: Mendeleev and the Metric
                 Reform \\
                 Conclusion: Virtuous Circles \\
                 Notes \\
                 Chapter 7: Making Newtons: Romantic Journeys towards
                 Genius \\
                 Out of Siberia: Romantic Biography \\
                 Russian Newton: Mendeleev the Lawgiver \\
                 Northward Bound: The Arctic Project \\
                 Full of Hot Air: Mendeleev, Aeronaut \\
                 The Limits of Romance: Mendeleev Leaves Petersburg
                 University \\
                 Notes \\
                 Chapter 8: Disintegration: Fighting Revolutions with
                 Faith \\
                 Chemistry under Attack: Disintegration in
                 Fin-de-Si{\`e}cle Physical Sciences \\
                 Pondering the Imponderable: The Chemical Ether \\
                 Tripartite Metaphysics: Mendeleev in the Abstract \\
                 Things Fall Apart: The Revolution of 1905 \\
                 Notes \\
                 Chapter 9: The Many Mendeleevs \\
                 Notes \\
                 Bibliography",
}

@Book{Gordin:2015:SBH,
  author =       "Michael D. Gordin",
  title =        "Scientific {Babel}: how science was done before and
                 after global {English}",
  publisher =    pub-U-CHICAGO,
  address =      pub-U-CHICAGO:adr,
  pages =        "415",
  year =         "2015",
  ISBN =         "0-226-00029-X (hardcover), 0-226-00032-X (e-book)",
  ISBN-13 =      "978-0-226-00029-9 (hardcover), 978-0-226-00032-9
                 (e-book)",
  LCCN =         "Q223 .G67 2015",
  bibdate =      "Mon Apr 12 08:19:42 MDT 2021",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "English is the language of science today. No matter
                 which languages you know, if you want your work seen,
                 studied, and cited, you need to publish in English. But
                 that hasn't always been the case. Though there was a
                 time when Latin dominated the field, for centuries
                 science has been a polyglot enterprise, conducted in a
                 number of languages whose importance waxed and waned
                 over time --- until the rise of English in the
                 twentieth century. So how did we get from there to
                 here? How did French, German, Latin, Russian, and even
                 Esperanto give way to English? And what can we
                 reconstruct of the experience of doing science in the
                 polyglot past? With Scientific Babel, Michael D. Gordin
                 resurrects that lost world, in part through an
                 ingenious mechanism: the pages of his highly readable
                 narrative account teem with footnotes --- not offering
                 background information, but presenting quoted material
                 in its original language. The result is stunning: as we
                 read about the rise and fall of languages, driven by
                 politics, war, economics, and institutions, we actually
                 see it happen in the ever-changing web of multilingual
                 examples. The history of science, and of English as its
                 dominant language, comes to life, and brings with it a
                 new understanding not only of the frictions generated
                 by a scientific community that spoke in many often
                 mutually unintelligible voices, but also of the
                 possibilities of the polyglot, and the losses that the
                 dominance of English entails. Few historians of science
                 write as well as Gordin, and Scientific Babel reveals
                 his incredible command of the literature, language, and
                 intellectual essence of science past and present. No
                 reader who takes this linguistic journey with him will
                 be disappointed",
  acknowledgement = ack-nhfb,
  subject =      "Englisch, \ldots{}; Communication in science; English
                 language; Technical English; 02.01 history of science
                 and culture.; Communication in science.; Technical
                 English.; Latein; Wissenschaftssprache; Communication
                 in science.; Technical English.",
  tableofcontents = "Introduction: Talking science \\
                 Introduction: Talking Science / 1 \\
                 1: The perfect past that almost was / 23 \\
                 2: The table and the word / 41 \\
                 3: Hydrogen oxygenovich / 79 \\
                 4: Speaking Utopian / 105 \\
                 5: The wizards of Ido / 131 \\
                 6: The linguistic shadow of the Great War / 159 \\
                 7: Unspeakable / 187 \\
                 8: The Dostoevsky machine / 213 \\
                 9: All the Russian that's fit to print / 241 \\
                 10: The Fe Curtain / 267 \\
                 11: Anglophonia / 293 \\
                 Conclusion: Babel beyond / 317 \\
                 Acknowledgments / 327 \\
                 List of Archives / 331 \\
                 Notes / 333 \\
                 Index / 403",
}

@Book{Gordin:2020:EB,
  author =       "Michael D. Gordin",
  title =        "{Einstein in Bohemia}",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "xi + 343",
  year =         "2020",
  DOI =          "https://doi.org/10.1515/9780691199849",
  ISBN =         "0-691-17737-6 (hardcover), 0-691-19984-1 (e-book)",
  ISBN-13 =      "978-0-691-17737-3 (hardcover), 978-0-691-19984-9
                 (e-book)",
  LCCN =         "QC16.E5 G6794 2020",
  bibdate =      "Sat Mar 6 09:08:19 MST 2021",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Though Einstein is undoubtedly one of the most
                 important figures in the history of modern science, he
                 was in many respects marginal. Despite being one of the
                 creators of quantum theory, he remained skeptical of
                 it, and his major research program while in Princeton
                 --- the quest for a unified field --- ultimately
                 failed. In this book, Michael Gordin explores this
                 paradox in Einstein's life by concentrating on a brief
                 and often overlooked interlude: his tenure as professor
                 of physics in Prague, from April of 1911 to the summer
                 of 1912. Though often dismissed by biographers and
                 scholars, it was a crucial year for Einstein both
                 personally and scientifically: his marriage
                 deteriorated, he began thinking seriously about his
                 Jewish identity for the first time, he attempted a new
                 explanation for gravitation --- which though it failed
                 had a significant impact on his later work --- and he
                 met numerous individuals, including Max Brod, Hugo
                 Bergmann, Philipp Frank, and Arno{\v{s}}t Kolman, who
                 would continue to influence him. In a kind of
                 double-biography of the figure and the city, this book
                 links Prague and Einstein together. Like the man, the
                 city exhibits the same paradox of being both central
                 and marginal to the main contours of European history.
                 It was to become the capital of the Czech Republic but
                 it was always, compared to Vienna and Budapest, less
                 central in the Habsburg Empire. Moreover, it was home
                 to a lively Germanophone intellectual and artistic
                 scene, thought the vast majority of its population
                 spoke only Czech. By emphasizing the marginality and
                 the centrality of both Einstein and Prague, Gordin
                 sheds new light both on Einstein's life and career and
                 on the intellectual and scientific life of the city in
                 the early twentieth century.",
  acknowledgement = ack-nhfb,
  subject =      "Einstein, Albert; Homes and haunts; Czech Republic;
                 Prague; Bohemia; Homes; B{\"o}hmen; Prag",
  subject-dates = "Albert Einstein (1879--1955)",
  tableofcontents = "Introduction: a spacetime interval / 1 \\
                 1: First and second place / 20 \\
                 2: The speed of light / 47 \\
                 3: Anti-Prague / 79 \\
                 4: Einstein positive and Einstein negative / 108 \\
                 5: The hidden Kepler / 145 \\
                 6: Out of Josefov / 180 \\
                 7: From revolution to normalization / 213 \\
                 8: Conclusion: Princeton, Tel Aviv, Prague / 253 \\
                 Acknowledgments / 267 \\
                 Notes / 271 \\
                 Index / 333",
}

@Book{Gordon:1973:MGE,
  author =       "Mark A. Gordon and Lewis E. Snyder",
  title =        "Molecules in the Galactic Environment",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xv + 475",
  year =         "1973",
  ISBN =         "0-471-31608-3",
  ISBN-13 =      "978-0-471-31608-4",
  LCCN =         "QB790.M64",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Gorin:1981:IDA,
  author =       "Ralph E. Gorin",
  title =        "Introduction to {DECSYSTEM-20} Assembly Language
                 Programming",
  publisher =    pub-DP,
  address =      pub-DP:adr,
  pages =        "xxx + 545",
  year =         "1981",
  ISBN =         "0-932376-12-6",
  ISBN-13 =      "978-0-932376-12-1",
  LCCN =         "QA76.8.D17 .G67",
  bibdate =      "Tue Dec 14 22:54:14 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$40.00",
  acknowledgement = ack-nhfb,
}

@Book{Gortemaker:2011:EBL,
  author =       "Heike B. G{\"o}rtemaker",
  title =        "{Eva Braun}: life with {Hitler}",
  publisher =    "Alfred A. Knopf",
  address =      "New York, NY, USA",
  pages =        "324",
  year =         "2011",
  ISBN =         "0-307-59582-X",
  ISBN-13 =      "978-0-307-59582-9",
  LCCN =         "DD247.B66 G67 2011",
  bibdate =      "Sat Oct 23 16:37:00 MDT 2021",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  author-dates = "1964--",
  remark =       "Translated from the German by Damion Searls. ``This is
                 a Borzoi book''. Originally published in Germany as
                 \booktitle{Eva Braun: Leben mit Hitler}, by Verlag C.H.
                 Beck, Munich, in 2010.",
  subject =      "Braun, Eva; Hitler, Adolf; Friends and associates;
                 Family; Braun, Eva; Hitler, Adolf,; Mistresses;
                 Germany; Biography; Spouses of heads of state; Women;
                 Families; Friendship; Mistresses; Spouses of heads of
                 state; Women; History; 1933--1945",
  subject-dates = "1889--1945",
  tableofcontents = "Part 1. The meeting \\
                 Heinrich Hoffmann's studio \\
                 Munich After the First World War \\
                 The Braun family \\
                 Rise to power at Hitler's side \\
                 Part 2. Contrasting worlds \\
                 Women in national socialism \\
                 The myth of the F{\"u}hrer, or, Herr Hitler in private
                 \\
                 The mistress and the inner circle \\
                 Life at the Obersalzberg \\
                 Part 3. Downfall \\
                 Isolation during the war \\
                 The events of July 20, 1944 and their aftermath \\
                 The decision for Berlin \\
                 After death",
}

@Book{Gosling:1989:NBI,
  author =       "James Gosling and David S. H. Rosenthal and Michelle
                 Arden",
  title =        "The {NeWS} Book: an introduction to the {Network\slash
                 extensible Window System}",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "vi + 235",
  year =         "1989",
  ISBN =         "0-387-96915-2",
  ISBN-13 =      "978-0-387-96915-2",
  LCCN =         "QA76.76.W56 A731 1989",
  bibdate =      "Tue May 25 07:20:00 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  keywords =     "NeWS (computer file); Windows (computer programs)",
}

@Book{Gosling:2000:JLS,
  author =       "James Gosling and Bill Joy and Guy L. Steele and Gilad
                 Bracha",
  title =        "The {Java} Language Specification",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Second",
  pages =        "xxv + 505",
  year =         "2000",
  ISBN =         "0-201-31008-2",
  ISBN-13 =      "978-0-201-31008-5",
  LCCN =         "QA76.73.J38 G68 2000",
  bibdate =      "Tue Feb 20 18:39:03 MST 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/java2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unicode.bib",
  series =       "Java series",
  URL =          "http://java.sun.com/people/jag/",
  abstract =     "The book provides complete, accurate, and detailed
                 coverage of the syntax and semantics of the Java
                 programming language. It describes all aspects of the
                 language, including the semantics of all types,
                 statements, and expressions, as well as threads and
                 binary compatibility.",
  acknowledgement = ack-nhfb,
  keywords =     "java (computer program language)",
  tableofcontents = "1: Introduction \\
                 2: Grammars \\
                 3: Lexical Structure \\
                 4: Types, Values, and Variables \\
                 5: Conversions and Promotions \\
                 6: Names \\
                 7: Packages \\
                 8: Classes \\
                 9: Interfaces \\
                 10: Arrays \\
                 11: Exceptions \\
                 12: Execution \\
                 13: Binary Compatibility \\
                 14: Blocks and Statements \\
                 15: Expressions \\
                 16: Definite Assignment \\
                 17: Threads and Locks \\
                 18: Syntax",
}

@Book{Gotlieb:1978:DTS,
  author =       "C. C. Gotlieb and Leo R. Gotlieb",
  title =        "Data Types and Structures",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xii + 444",
  year =         "1978",
  ISBN =         "0-13-197095-X",
  ISBN-13 =      "978-0-13-197095-3",
  LCCN =         "QA76.9.D35 .G67",
  bibdate =      "Tue Dec 14 22:54:18 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$18.95",
  acknowledgement = ack-nhfb,
}

@Book{Goudsmit:1996:A,
  author =       "Samuel Abraham Goudsmit",
  title =        "{Alsos}",
  publisher =    pub-AIP,
  address =      pub-AIP:adr,
  pages =        "xxxviii + 259",
  year =         "1996",
  ISBN =         "1-56396-415-5",
  ISBN-13 =      "978-1-56396-415-2",
  LCCN =         "D810.S2 G6 1996",
  bibdate =      "Fri Mar 27 16:04:25 2015",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/h/heisenberg-werner.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "History of modern physics and astronomy",
  acknowledgement = ack-nhfb,
  keywords =     "Alsos (World War II Allies mission to discover the
                 status of Germany's atomic bomb project).",
  remark =       "Alsos is Greek for grove, possibly a reference to
                 General Leslie Groves, head of the Manhattan Project.
                 Originally published: New York: H. Schuman, c1947.",
  subject =      "World War, 1939--1945; Science; Atomic bomb; Germany;
                 Nuclear physics; Research; Germany; Science; Germany;
                 History; 20th century",
  tableofcontents = "Introduction / David Cassidy / ix \\
                 Foreword / xxxiii \\
                 1: The Fear of a German Atom Bomb / 3 \\
                 We overestimate the German scientific effort --- and
                 the Germans do likewise \\
                 2: We Prepare to Investigate German Science / 14 \\
                 The task of the Alsos Mission \\
                 Radioactive wine \\
                 A polyp in his right nostril \\
                 3: The Need for Secrecy / 26 \\
                 Nobody knew what we were after \\
                 How we went about our work \\
                 4: Operation Cellastic / 34 \\
                 What our French colleagues told us \\
                 A German technical intelligence organization \\
                 Dutch collaborators \\
                 The house in The Hague \\
                 5: Operation Toothpaste / 50 \\
                 O.S.S. finds a German chemical expert for us \\
                 The thorium scare \\
                 Our first prisoner and his papers \\
                 The solution of the thorium secret \\
                 6: Operation Jackpot / 66 \\
                 The fall of Strasbourg \\
                 We capture our first scientists \\
                 Their papers tell everything \\
                 Experiments on humans \\
                 7: We Meet Some German Colleagues / 77 \\
                 Entering Heidelberg \\
                 Friend or enemy \\
                 Notes on four different German scientists \\
                 8: The Breakthrough / 87 \\
                 Our first German ``pile'' laboratory \\
                 Centrifuges, silk, and an old friend \\
                 Preparing for the final operation \\
                 We take their principal laboratory \\
                 9: Operation Humbug / 101 \\
                 Whom shall we take with us? \\
                 The hidden papers \\
                 A report by the Germans \\
                 Heisenberg \\
                 The last roundup of physicists \\
                 Alsos in Berlin \\
                 10: Hiroshima and the German Scientists / 128 \\
                 Flight to Frankfurt \\
                 The reaction of the internees \\
                 The new German theme song \\
                 11: The Misorganization of German Science / 140 \\
                 The Professor of Military Physics \\
                 Peenem{\"u}nde trouble \\
                 Superior German Air Force Research \\
                 The anti-physics physicists \\
                 Physics is a weapon \\
                 12: The Uranium Club / 160 \\
                 The early decision to work in secret \\
                 Visitors to the United States \\
                 The Postal Minister \\
                 The ``coming-out party'' \\
                 Gerlach takes over \\
                 13: The Gestapo in Science / 187 \\
                 Osenberg \\
                 Gestapo reports \\
                 The railroad switchyard \\
                 Himmler's scientific interests \\
                 The SS academy \\
                 Rewarming by two women \\
                 Pseudo-science and the dog \\
                 14: The Efficiency of German Industry / 214 \\
                 Underground factories \\
                 Slave labor \\
                 The SS quarrels with labor and industry \\
                 15: It Can't Happen Here / 232 \\
                 The German mistakes \\
                 The lessons for us \\
                 Appendix: An Outline of the Uranium Problem / 247 \\
                 Index / 255",
}

@Article{Gourlay:music-printing,
  author =       "John S. Gourlay",
  title =        "A Language for Music Printing",
  journal =      j-CACM,
  volume =       "29",
  number =       "3",
  pages =        "388--401",
  year =         "1986",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Graetz:2011:EEU,
  author =       "Michael J. Graetz",
  title =        "The end of energy: the unmaking of {America}'s
                 environment, security, and independence",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "x + 369",
  year =         "2011",
  ISBN =         "0-262-01567-6 (hardcover)",
  ISBN-13 =      "978-0-262-01567-7 (hardcover)",
  LCCN =         "HD9502.U52 G685 2011",
  bibdate =      "Tue Jun 5 16:01:51 MDT 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "energy policy; United States; energy development;
                 energy industries; economic policy",
  tableofcontents = "A ``new economic policy'' \\
                 Losing control over oil \\
                 The environment moves front and center \\
                 No more nuclear \\
                 The changing face of coal \\
                 Natural gas and the ability to price \\
                 The quest for alternatives and to conserve \\
                 A crisis of confidence \\
                 The end of an era \\
                 Climate change: a game changer \\
                 Shock to trance: the power of price \\
                 The invisible hand: regulation and the rise of cap and
                 trade \\
                 Government for the people: Congress and the road to
                 reform \\
                 Disaster in the Gulf",
}

@Book{Gradshteyn:2007:TIS,
  author =       "I. S. Gradshteyn and I. M. Ryzhik and Alan Jeffrey and
                 Daniel Zwillinger",
  title =        "Table of Integrals, Series and Products",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  edition =      "Seventh",
  pages =        "xlv + 1171",
  year =         "2007",
  ISBN =         "0-12-373637-4 (hardcover)",
  ISBN-13 =      "978-0-12-373637-6 (hardcover)",
  LCCN =         "QA55 .G6613 2007",
  bibdate =      "Thu Feb 18 12:04:10 MST 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                  https://www.math.utah.edu/pub/tex/bib/mathcw.bib;
                 prodorbis.library.yale.edu:7090/voyager",
  acknowledgement = ack-nhfb,
  remark =       "Previous edition 2000. Includes CD-ROM.",
  subject =      "Mathematics; Tables",
  tableofcontents = "0 Introduction \\
                 1 Elementary Functions \\
                 2 Indefinite Integrals of Elementary Functions \\
                 3 Definite Integrals of Elementary Functions \\
                 4.Combinations involving trigonometric and hyperbolic
                 functions and power \\
                 5 Indefinite Integrals of Special Functions \\
                 6 Definite Integrals of Special Functions \\
                 7.Associated Legendre Functions \\
                 8 Special Functions \\
                 9 Hypergeometric Functions \\
                 10 Vector Field Theory \\
                 11 Algebraic Inequalities \\
                 12 Integral Inequalities \\
                 13 Matrices and related results \\
                 14 Determinants \\
                 15 Norms \\
                 16 Ordinary differential equations \\
                 17 Fourier, Laplace, and Mellin Transforms \\
                 18 The z-transform",
  xxauthor =     "I. S. (Izrail Solomonovich) Gradshteyn and I. M.
                 (Iosif Moiseevich) Ryzhik and Alan Jeffrey and Daniel
                 Zwillinger",
}

@Book{Graff:2003:SCP,
  author =       "Mark Graff and Kenneth R. {Van Wyk}",
  title =        "Secure Coding: Principles and Practices",
  publisher =    pub-ORA-MEDIA,
  address =      pub-ORA-MEDIA:adr,
  pages =        "xx + 202",
  year =         "2003",
  ISBN =         "0-596-00242-4 (paperback), 0-596-52217-7",
  ISBN-13 =      "978-0-596-00242-8 (paperback), 978-0-596-52217-9",
  LCCN =         "QA76.9.A25 G69 2003",
  bibdate =      "Tue May 6 09:07:00 MDT 2025",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Practically every day, we read about a new type of
                 attack on computer systems and networks. Viruses,
                 worms, denials of service, and password sniffers are
                 attacking all types of systems --- from banks to major
                 e-commerce sites to seemingly impregnable government
                 and military computers --- at an alarming rate. Despite
                 their myriad manifestations and different targets,
                 nearly all attacks have one fundamental cause: the code
                 used to run far too many systems today is not secure.
                 Flaws in its design, implementation, testing, and
                 operations allow attackers all-too-easy access. Secure
                 Coding, by Mark G. Graff and Ken vanWyk, looks at the
                 problem of bad code in a new way. Packed with advice
                 based on the authors' decades of experience in the
                 computer security field, this concise and highly
                 readable book explains why so much code today is filled
                 with vulnerabilities, and tells readers what they must
                 do to avoid writing code that can be exploited by
                 attackers. Writing secure code isn't easy, and there
                 are no quick fixes to bad code. To build code that
                 repels attack, readers need to be vigilant through each
                 stage of the entire code lifecycle: Architecture:
                 during this stage, applying security principles such as
                 ``least privilege'' will help limit even the impact of
                 successful attempts to subvert software. Design: during
                 this stage, designers must determine how programs will
                 behave when confronted with fatally flawed input data.
                 The book also offers advice about performing security
                 retrofitting when you don't have the source code ---
                 ways of protecting software from being exploited even
                 if bugs can't be fixed. Implementation: during this
                 stage, programmers must sanitize all program input (the
                 character streams representing a programs' entire
                 interface with its environment --- not just the command
                 lines and environment variables that are the focus of
                 most security analysis). Testing: during this stage,
                 programs must be checked using both static code
                 checkers and runtime testing methods --- for example,
                 the fault injection systems now available to check for
                 the presence of such flaws as buffer overflow.
                 Operations: during this stage, patch updates must be
                 installed in a timely fashion. In early 2003, sites
                 that had diligently applied Microsoft SQL Server
                 updates were spared the impact of the Slammer worm that
                 did serious damage to thousands of systems. Beyond the
                 technical, Secure Coding sheds new light on the
                 economic, psychological, and sheer practical reasons
                 why.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Information Technology; General and Others",
  tableofcontents = "1. No Straight Thing \\
                 2. Architecture \\
                 3. Design \\
                 4. Implementation \\
                 5. Operations \\
                 6. Automation and Testing",
}

@Book{Graham:1989:CM,
  author =       "Ronald L. Graham and Donald E. Knuth and Oren
                 Patashnik",
  title =        "Concrete Mathematics",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xiii + 625",
  year =         "1989",
  ISBN =         "0-201-14236-8",
  ISBN-13 =      "978-0-201-14236-5",
  LCCN =         "QA39.2 .G7331 1989",
  MRclass =      "00A05 (00-01 05-01 68-01 68Rxx)",
  MRnumber =     "91f:00001",
  MRreviewer =   "Volker Strehl",
  bibdate =      "Wed Dec 15 08:01:55 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
                 https://www.math.utah.edu/pub/tex/bib/fibquart.bib;
                 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/sigact.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook2.bib",
  acknowledgement = ack-nhfb,
  keywords =     "computer science -- mathematics; mathematics",
  remark-1 =     "Second printing, revised, January 1989. Third
                 printing, revised, May 1989. Fourth printing, revised,
                 January 1990. Fifth printing, revised, July 1990. Sixth
                 printing, revised, October 1990. Seventh printing,
                 revised, December 1991. Eighth printing, revised,
                 October 1992.",
  remark-2 =     "See translations
                 \cite{Knuth:1990:JTS,Knuth:1991:JTS,Knuth:1992:MD,Knuth:1992:xx,Knuth:1993:KS,Knuth:199x:xxc}.",
  shorttableofcontents = "1: Recurrent Problems / 1 \\
                 2: Sums / 21 \\
                 3: Integer Functions / 67 \\
                 4: Number Theory / 102 \\
                 5: Binomial Coefficients / 153 \\
                 6: Special Numbers / 243 \\
                 7: Generating Functions / 306 \\
                 8: Discrete Probability / 367 \\
                 9: Asymptotics / 425 \\
                 A: Answers to Exercises / 483 \\
                 B: Bibliography / 578 \\
                 C: Credits for Exercises / 601 \\
                 Index / 606 \\
                 List of Tables / 624",
  tableofcontents = "1: Recurrent Problems / 1 \\
                 1.1 The Tower of Hanoi / 1 \\
                 1.2 Lines in the Plane / 4 \\
                 1.3 The Josephus Problem / 8 \\
                 Exercises / 17 \\
                 2: Sums / 21 \\
                 2.1 Notation / 21 \\
                 2.2 Sums and Recurrences / 25 \\
                 2.3 Manipulation of Sums / 30 \\
                 2.4 Multiple Sums / 34 \\
                 2.5 General Methods / 41 \\
                 2.6 Finite and Infinite Calculus / 47 \\
                 2.7 Infinite Sums / 56 \\
                 Exercises / 62 \\
                 3: Integer Functions / 67 \\
                 3.1 Floors and Ceilings / 67 \\
                 3.2 Floor/Ceiling Applications / 70 \\
                 3.3 Floor/Ceiling Recurrences / 78 \\
                 3.4 `mod': The Binary Operation / 81 \\
                 3.5 Floor/Ceiling Sums / 86 \\
                 Exercises / 95 \\
                 4: Number Theory / 102 \\
                 4.1 Divisibility / 102 \\
                 4.2 Primes / 105 \\
                 4.3 Prime Examples / 107 \\
                 4.4 Factorial Factors / 111 \\
                 4.5 Relative Primality / 115 \\
                 4.6 `mod': The Congruence Relation / 123 \\
                 4.7 Independent Residues / 126 \\
                 4.8 Additional Applications / 129 \\
                 4.9 Phi and Mu / 133 \\
                 Exercises / 144 \\
                 5: Binomial Coefficients / 153 \\
                 5.1 Basic Identities / 153 \\
                 5.2 Basic Practice / 172 \\
                 5.3 Tricks of the Trade / 186 \\
                 5.4 Generating Functions / 196 \\
                 5.5 Hypergeometric Functions / 204 \\
                 5.6 Hypergeometric Transformations / 216 \\
                 5.7 Partial Hypergeometric Sums / 223 \\
                 Exercises / 230 \\
                 6: Special Numbers / 243 \\
                 6.1 Stirling Numbers / 243 \\
                 6.2 Eulerian Numbers / 253 \\
                 6.3 Harmonic Numbers / 258 \\
                 6.4 Harmonic Summation / 265 \\
                 6.5 Bernoulli Numbers / 269 \\
                 6.6 Fibonacci Numbers / 276 \\
                 6.7 Continuants / 287 \\
                 Exercises / 295 \\
                 7: Generating Functions / 306 \\
                 7.1 Domino Theory and Change / 306 \\
                 7.2 Basic Maneuvers / 317 \\
                 7.3 Solving Recurrences / 323 \\
                 7.4 Special Generating Functions / 336 \\
                 7.5 Convolutions / 339 \\
                 7.6 Exponential Generating Functions / 350 \\
                 7.7 Dirichlet Generating Functions / 356 \\
                 Exercises / 357 \\
                 8: Discrete Probability / 367 \\
                 8.1 Definitions / 367 \\
                 8.2 Mean and Variance / 373 \\
                 8.3 Probability Generating Functions / 380 \\
                 8.4 Flipping Coins / 387 \\
                 8.5 Hashing / 397 \\
                 Exercises / 413 \\
                 9: Asymptotics / 425 \\
                 9.1 A Hierarchy / 426 \\
                 9.2 0 Notation / 429 \\
                 9.3 0 Manipulation / 436 \\
                 9.4 Two Asymptotic Tricks / 449 \\
                 9.5 Euler's Summation Formula / 455 \\
                 9.6 Final Summations / 462 \\
                 Exercises / 475 \\
                 A: Answers to Exercises / 483 \\
                 B: Bibliography / 578 \\
                 C: Credits for Exercises / 601 \\
                 Index / 606 \\
                 List of Tables / 624",
}

@Book{Graham:1994:CM,
  author =       "Ronald L. Graham and Donald E. Knuth and Oren
                 Patashnik",
  title =        "Concrete Mathematics",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Second",
  pages =        "xiii + 657",
  year =         "1994",
  ISBN =         "0-201-55802-5",
  ISBN-13 =      "978-0-201-55802-9",
  LCCN =         "QA39.2 .G733 1994",
  MRclass =      "68-01 (00-01 00A05 05-01 68Rxx)",
  MRnumber =     "97d:68003",
  bibdate =      "Wed Jul 6 14:39:36 1994",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg-2ed.bib;
                 https://www.math.utah.edu/pub/bibnet/subjects/han-wri-mat-sci-2ed.bib;
                 https://www.math.utah.edu/pub/tex/bib/fibquart.bib;
                 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/texbook2.bib",
  acknowledgement = ack-nhfb,
  keywords =     "computer science -- mathematics; mathematics",
  shorttableofcontents = "1: Recurrent Problems / 1 \\
                 2: Sums / 21 \\
                 3: Integer Functions / 67 \\
                 4: Number Theory / 102 \\
                 5: Binomial Coefficients / 153 \\
                 6: Special Numbers / 257 \\
                 7: Generating Functions / 320 \\
                 8: Discrete Probability / 381 \\
                 9: Asymptotics / 439 \\
                 A: Answers to Exercises / 497 \\
                 B: Bibliography / 604 \\
                 C: Credits for Exercises / 632 \\
                 Index / 637 \\
                 List of Tables / 657",
  tableofcontents = "1: Recurrent Problems / 1 \\
                 1.1 The Tower of Hanoi / 1 \\
                 1.2 Lines in the Plane / 4 \\
                 1.3 The Josephus Problem / 8 \\
                 Exercises / 17 \\
                 2: Sums / 21 \\
                 2.1 Notation / 21 \\
                 2.2 Sums and Recurrences / 25 \\
                 2.3 Manipulation of Sums / 30 \\
                 2.4 Multiple Sums / 34 \\
                 2.5 General Methods / 41 \\
                 2.6 Finite and Infinite Calculus / 47 \\
                 2.7 Infinite Sums / 56 \\
                 Exercises / 62 \\
                 3: Integer Functions / 67 \\
                 3.1 Floors and Ceilings / 67 \\
                 3.2 Floor/Ceiling Applications / 70 \\
                 3.3 Floor/Ceiling Recurrences / 78 \\
                 3.4 `mod': The Binary Operation / 81 \\
                 3.5 Floor/Ceiling Sums / 86 \\
                 Exercises / 95 \\
                 4: Number Theory / 102 \\
                 4.1 Divisibility / 102 \\
                 4.2 Primes / 105 \\
                 4.3 Prime Examples / 107 \\
                 4.4 Factorial Factors / 111 \\
                 4.5 Relative Primality / 115 \\
                 4.6 `mod': The Congruence Relation / 123 \\
                 4.7 Independent Residues / 126 \\
                 4.8 Additional Applications / 129 \\
                 4.9 Phi and Mu / 133 \\
                 Exercises / 144 \\
                 5: Binomial Coefficients / 153 \\
                 5.1 Basic Identities / 153 \\
                 5.2 Basic Practice / 172 \\
                 5.3 Tricks of the Trade / 186 \\
                 5.4 Generating Functions / 196 \\
                 5.5 Hypergeometric Functions / 204 \\
                 5.6 Hypergeometric Transformations / 216 \\
                 5.7 Partial Hypergeometric Sums / 223 \\
                 5.8 Mechanical Summation / 229 \\
                 Exercises / 242 \\
                 6: Special Numbers / 257 \\
                 6.1 Stirling Numbers / 257 \\
                 6.2 Eulerian Numbers / 267 \\
                 6.3 Harmonic Numbers / 272 \\
                 6.4 Harmonic Summation / 279 \\
                 6.5 Bernoulli Numbers / 283 \\
                 6.6 Fibonacci Numbers / 290 \\
                 6.7 Continuants / 301 \\
                 Exercises / 309 \\
                 7: Generating Functions / 320 \\
                 7.1 Domino Theory and Change / 320 \\
                 7.2 Basic Maneuvers / 331 \\
                 7.3 Solving Recurrences / 337 \\
                 7.4 Special Generating Functions / 350 \\
                 7.5 Convolutions / 353 \\
                 7.6 Exponential Generating Functions / 364 \\
                 7.7 Dirichlet Generating Functions / 370 \\
                 Exercises / 371 \\
                 8: Discrete Probability / 381 \\
                 8.1 Definitions / 381 \\
                 8.2 Mean and Variance / 387 \\
                 8.3 Probability Generating Functions / 394 \\
                 8.4 Flipping Coins / 401 \\
                 8.5 Hashing / 411 \\
                 Exercises / 427 \\
                 9: Asymptotics / 439 \\
                 9.1 A Hierarchy / 440 \\
                 9.2 O Notation / 443 \\
                 9.3 O Manipulation / 450 \\
                 9.4 Two Asymptotic Tricks / 463 \\
                 9.5 Euler's Summation Formula / 469 \\
                 9.6 Final Summations / 476 \\
                 Exercises / 489 \\
                 A: Answers to Exercises / 497 \\
                 B: Bibliography / 604 \\
                 C: Credits for Exercises / 632 \\
                 Index / 637 \\
                 List of Tables / 657",
}

@Book{Graham:2000:XLD,
  author =       "Ian S. Graham",
  title =        "{XHTML 1.0} Language and Design Sourcebook: the Next
                 Generation of {HTML}",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xxv + 692",
  year =         "2000",
  ISBN =         "0-471-37485-7 (paperback)",
  ISBN-13 =      "978-0-471-37485-5 (paperback)",
  LCCN =         "QA76.76.H94 G7334 2000",
  bibdate =      "Mon Oct 26 17:58:57 MDT 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/sgml2000.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0706/99089119-b.html;
                 http://www.loc.gov/catdir/toc/onix04/99089119.html",
  abstract =     "In \booktitle{XHTML 1.0 Language and Design
                 Sourcebook}, author Ian Graham introduces you to HTML,
                 XHTML, and Cascading Style Sheets (CSS) --- the
                 language for controlling how these documents look when
                 viewed by a Web browser. Beginning with a clear
                 tutorial on HTML, XHTML, and CSS, you'll quickly learn
                 the basic ideas of markup and style sheet formatting.
                 The book then goes into the details of XHTML, carefully
                 explaining the role of each language component and the
                 purpose of the various CSS mechanisms by which the
                 default formatting can be controlled. You'll also find
                 helpful references sections that offer concise
                 summaries of all the elements defined in HTML and
                 XHTML, and of all CSS formatting properties.",
  acknowledgement = ack-nhfb,
  subject =      "XHTML (document markup language)",
  tableofcontents = "1: Introduction to Markup \\
                 2: XHTML and HTML \\
                 3: Basic Document Structure \\
                 4: Inline Text Elements \\
                 5: Hypertext Linking \\
                 6: Inline Images \\
                 7: Block and Special Elements \\
                 8: Replaced Elements: Applets et al. \\
                 9: Imagemapped Images \\
                 10: Graphics Issues \\
                 11: Floating Elements \\
                 12: Frames and Framesets \\
                 13: Positioning of Elements Using CSS \\
                 14: Table Markup, Part 1 \\
                 15: Tables, Part 2: Advanced Markup, Accessibility, and
                 Style Sheets \\
                 16: Fill-in Forms \\
                 17: Proprietary Markup Extensions \\
                 18: Advanced Style Sheet Tools \\
                 19: Dynamic Documents: Scripting and Event Handlers \\
                 20: XHTML Handled as XML \\
                 21: XHTML Element Reference \\
                 22: CSS Property Specifications \\
                 Appendix A: Character Sets, Character Encodings, and
                 Document Character Sets \\
                 Appendix B: XHTML for HTML Experts \\
                 Appendix C: Tags for Identifying Languages \\
                 RFC 1766 \\
                 Appendix D: Color Names and RGB Codes \\
                 Appendix E: Cascading Style Sheet Length Units",
}

@Book{Grandine:1990:NMP,
  author =       "Thomas A. Grandine",
  title =        "The Numerical Methods Programming Projects Book",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  pages =        "viii + 146",
  year =         "1990",
  ISBN =         "0-19-853385-3 (hardcover), 0-19-853387-X (paperback)",
  ISBN-13 =      "978-0-19-853385-6 (hardcover), 978-0-19-853387-0
                 (paperback)",
  LCCN =         "QA76.6 .G718 1990",
  bibdate =      "Tue Dec 14 22:54:20 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/numana1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook2.bib",
  ZMnumber =     "0687.65002",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "Introduction \\
                 1. The Set Up \\
                 2. Project 1 Through Project 22 \\
                 3. Documentation \\
                 4. Co5adf \\
                 5. Do1ajf \\
                 6. Do2hbf \\
                 7. Eo2baf \\
                 8. Eo2bcf \\
                 9. Eo2bdf \\
                 10. Eo4vdf \\
                 11. Fo1btf \\
                 12. Fo2waf \\
                 13. Fo4ayf \\
                 14. FO4JGf",
  tableofcontents = "Introduction / 1 \\
                 The setup / 6 \\
                 Project 1 / 8 \\
                 Project 2 / 10 \\
                 Project 3 / 12 \\
                 Project 4 / 14 \\
                 Project 5 / 16 \\
                 Project 6 / 18 \\
                 Project 7 / 20 \\
                 Project 8 / 22 \\
                 Project 9 / 25 \\
                 Project 10 / 27 \\
                 Project 11 / 30 \\
                 Project 12 / 32 \\
                 Project 13 / 36 \\
                 Project 14 / 38 \\
                 Project 15 / 40 \\
                 Project 16 / 42 \\
                 Project 17 / 44 \\
                 Project 18 / 46 \\
                 Project 19 / 48 \\
                 Project 20 / 51 \\
                 Project 21 / 53 \\
                 Project 22 / 56 \\
                 Documentation / 59 \\
                 C0SADF / 60 \\
                 D01AJF / 63 \\
                 D02BBF / 67 \\
                 D02HBF / 73 \\
                 E02BAF / 82 \\
                 E02BCF / 88 \\
                 E02BDF / 92 \\
                 E04VDF / 95 \\
                 F01BTF / 106 \\
                 F02WAF / 109 \\
                 F04AYF / 113 \\
                 F04JGF / 116 \\
                 Answers to exercises / 121 \\
                 NAG Graphical Library examples / 135 Index / 144",
}

@Book{Grant:1993:AAH,
  author =       "Kenneth Grant and W. David Schwaderer",
  title =        "{Adobe Acrobat} Handbook: Digital Publishing in the
                 Post-{Gutenberg} Era",
  publisher =    pub-HWS,
  address =      pub-HWS:adr,
  pages =        "xxvii + 254",
  year =         "1993",
  ISBN =         "0-672-30393-0 (includes diskette)",
  ISBN-13 =      "978-0-672-30393-7 (includes diskette)",
  LCCN =         "QA76.76.W56 G833 1993",
  bibdate =      "Thu May 12 08:17:37 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$19.95",
  acknowledgement = ack-nhfb,
}

@Book{Gratzer:1996:MLI,
  author =       "George Gr{\"a}tzer",
  title =        "Math into {\LaTeX}: an introduction to {\LaTeX}2e and
                 {\AMSLaTeX} 1.2",
  publisher =    pub-BIRKHAUSER,
  address =      pub-BIRKHAUSER:adr,
  pages =        "xxvii + 451",
  year =         "1996",
  ISBN =         "0-8176-3805-9, 3-7643-3805-9",
  ISBN-13 =      "978-0-8176-3805-4, 978-3-7643-3805-3",
  LCCN =         "Z253.4.A65G69 199",
  MRclass =      "68U15, 68-01, 68NXX",
  bibdate =      "Mon Aug 12 16:20:51 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  price =        "US\$49.50",
  acknowledgement = ack-nhfb,
  keywords =     "AMS-LaTeX; AMS-LaTeX (Ficher d'ordinateur);
                 Composition automatique (Industries graphiques);
                 Computerized typesetting; Mathematics printing --
                 Computer programs; Mathematiques -- Impression --
                 Logiciels.",
  tableofcontents = "I. A short course \\
                 II. Text and math \\
                 III. Document structure \\
                 IV. Customizing \\
                 V. Long bibliographies and indexes \\
                 A Math symbol tables \\
                 B Text symbol tables \\
                 C The AMS-LATEX sample article \\
                 D Sample article with user-defined commands \\
                 E Background \\
                 F PostScript fonts \\
                 G Getting it \\
                 H Conversions \\
                 I Final word",
}

@Book{Gratzer:1999:FSL,
  author =       "George Gr{\"a}tzer",
  title =        "First Steps in {\LaTeX}",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xx + 131",
  year =         "1999",
  ISBN =         "0-8176-4132-7, 3-7643-4132-7",
  ISBN-13 =      "978-0-8176-4132-0, 978-3-7643-4132-9",
  LCCN =         "Z253.4.L38 G74 1999",
  bibdate =      "Wed Jan 31 05:59:06 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$19.95",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Typing text \\
                 2: Typing math \\
                 3: Formulas and user-defined commands \\
                 4: The anatomy of an article \\
                 5: An AMS article \\
                 6: Working with LaTeX \\
                 A: Math symbol tables \\
                 B: Text symbol tables \\
                 C: LaTeX and the Internet",
}

@Book{Gratzer:2000:ML,
  author =       "George Gr{\"a}tzer",
  title =        "Math into {\LaTeX}",
  publisher =    pub-BIRKHAUSER # " and " # pub-SV,
  address =      pub-BIRKHAUSER:adr # " and " # pub-SV:adr,
  edition =      "Third",
  pages =        "xxv + 584",
  year =         "2000",
  ISBN =         "0-8176-4131-9, 3-7643-4131-9",
  ISBN-13 =      "978-0-8176-4131-3, 978-3-7643-4131-2",
  LCCN =         "Z253.4.L38 G745 2000",
  bibdate =      "Thu Aug 23 10:53:02 2001",
  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",
  price =        "US\$49.95",
  abstract =     "\booktitle{Math Into LaTeX} is for the mathematician,
                 physicist, engineer, scientist, or technical typist who
                 needs to quickly learn how to write and typeset
                 articles and books containing mathematical formulas,
                 and requires a thorough reference book on all aspects
                 of LaTeX and the AMS packages (the enhancements to
                 LaTeX by the American Mathematical Society). Key
                 features of \booktitle{Math Into LaTeX}: * A simple,
                 example-based, visual approach * A quick introduction
                 (Part I) allowing readers to type their first articles
                 in only a few hours * Sample articles to demonstrate
                 the basic structure of LaTeX and AMS articles * Useful
                 appendices containing mathematical and text symbol
                 tables and information on how to convert from older
                 versions * A new chapter in the fourth edition,
                 ``\booktitle{A Visual Introduction to MikTeX},'' an
                 open source implementation of TeX and LaTeX for Windows
                 operating systems * Another new chapter describing
                 amsrefs, a simpler method for formatting references
                 that incorporates and replaces BibTeX data * This
                 edition also integrates a major revision to the amsart
                 document class, along with updated examples.",
  acknowledgement = ack-nhfb,
  keywords =     "AMS-LaTeX; AMS-LaTeX (Ficher d'ordinateur);
                 Composition automatique (Industries graphiques);
                 Computerized typesetting; Mathematics printing ---
                 Computer programs; Math{\'e}matiques --- Impression ---
                 Logiciels",
  tableofcontents = "I: A short course \\
                 1: Typing your first article \\
                 II: Text and math \\
                 2: Typing text \\
                 3: Text environments \\
                 4: Typing math \\
                 5: Multiline math displays \\
                 III: Document structure \\
                 6: \LaTeX{} documents \\
                 7: Standard \LaTeX{} document classes \\
                 8: AMS documents \\
                 IV: Customization \\
                 9: Customizing \LaTeX{} \\
                 V: Long documents \\
                 10: BibTeX \\
                 11: MakeIndex \\
                 12: Books in \LaTeX{} \\
                 VI: Math and the Web \\
                 13: TEX, \LaTeX{}, and the Internet \\
                 14: Putting \LaTeX{} on the Web \\
                 A: Math symbol tables \\
                 A.1: Hebrew and Greek letters \\
                 A.1.1: Hebrew letters \\
                 A.1.2: Greek letters \\
                 A.2: Binary relations \\
                 A.2.3: Negated binary relations \\
                 A.3: Binary operations \\
                 A.4: Arrows \\
                 A.5: Miscellaneous symbols \\
                 A.6: Delimiters \\
                 A.7: Operators \\
                 A.7.1: Pure operators, with no limits \\
                 A.7.2: Operators with limits \\
                 A.7.3: Large operators \\
                 A.8: Math accents and fonts \\
                 A.8.1: Math accents \\
                 A.8.2: Math fonts \\
                 A.9: Math spacing commands \\
                 B: Text symbol tables \\
                 B.1: Some European characters \\
                 B.2: Text accents \\
                 B.3: Text font commands \\
                 B.3.1: Text font family commands \\
                 B.4: Additional text symbols \\
                 B.5: Additional text symbols with T1 encoding \\
                 B.5.1: Accents \\
                 B.5.2: European characters \\
                 B.5.3: Quotation marks \\
                 B.6: Text spacing commands \\
                 C: Background \\
                 C.1: A short history \\
                 C.1.2: Recent developments \\
                 C.2.1: The layers \\
                 C.2.2: Typesetting \\
                 C.2.3: Viewing and printing \\
                 D: PostScript fonts \\
                 D.2: The Times font and MathTime \\
                 D.3: Lucida Bright fonts \\
                 D.4: More PostScript fonts \\
                 F: A book document class \\
                 G: Conversions \\
                 H: Final word \\
                 H.1: What was left out? \\
                 H.2: Further reading",
}

@Book{Gratzer:2007:ML,
  author =       "George Andrew Gr{\"a}tzer",
  title =        "Math into {\LaTeX}",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Fourth",
  pages =        "xxxiv + 619",
  year =         "2007",
  ISBN =         "0-387-32289-2",
  ISBN-13 =      "978-0-387-32289-6",
  LCCN =         "Z253.4.L38 G745 2007",
  bibdate =      "Thu Oct 25 19:42:34 MDT 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib;
                 z3950.loc.gov:7090/Voyager",
  note =         "Forward by Rainer Sch{\"o}pf.",
  acknowledgement = ack-nhfb,
  tableofcontents = "I: Short course \\
                 1: Your \LaTeX{} \\
                 2: Typing text \\
                 3: Typing math \\
                 4: Your first article and presentation \\
                 II: Text and math \\
                 5: Typing text \\
                 6: Text environments \\
                 7: Typing math \\
                 8: More math \\
                 9: Multiline math displays \\
                 III: Document structure \\
                 10: \LaTeX{} documents \\
                 11: AMS article document class \\
                 12: Legacy document classes \\
                 IV: Presentations and PDF documents \\
                 13: PDF documents \\
                 14: Presentations \\
                 V: Customization \\
                 15: Customizing \LaTeX{} \\
                 VI: Long documents \\
                 16: \BibTeX{} \\
                 17: MakeIndex \\
                 18: Books in \LaTeX{} \\
                 A: Installation \\
                 B: Math symbol tables \\
                 C: Text symbol tables \\
                 D: Some background \\
                 E: \LaTeX{} and the Internet \\
                 F: PostScript fonts \\
                 G: \LaTeX{} localized \\
                 H: Final thoughts",
}

@Book{Gratzer:2016:MML,
  author =       "George Gr{\"a}tzer",
  title =        "More Math Into {\LaTeX}",
  publisher =    "Springer International Publishing",
  address =      "Cham, Switzerland",
  edition =      "Fifth",
  pages =        "xxx + 609",
  year =         "2016",
  DOI =          "https://doi.org/10.1007/978-3-319-23796-1",
  ISBN =         "3-319-23795-0, 3-319-23796-9 (e-book)",
  ISBN-13 =      "978-3-319-23795-4, 978-3-319-23796-1 (e-book)",
  LCCN =         "Z253.4.L38 G745 2016",
  bibdate =      "Wed Mar 29 06:08:19 MDT 2017",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  URL =          "http://www.springerlink.com/content/978-3-319-23796-1",
  abstract =     "Providing an introduction and complete reference for
                 writing articles and books containing mathematical
                 formulas, this example-based book has been brought up
                 to date and reflects a modern and practical approach to
                 LaTeX usage.",
  tableofcontents = "Part 1. Mission impossible \\
                 Short course \\
                 And a few more things\ldots{} \\
                 Part 2. Text and math \\
                 Typing text \\
                 Text environments \\
                 Typing math \\
                 Multiline math displays \\
                 Part 3. Document structure \\
                 Documents \\
                 The AMS article document class \\
                 Legacy documents \\
                 Part 4. PDF documents \\
                 The PDF file format \\
                 Presentations \\
                 Illustrations \\
                 Part 5. Customization \\
                 Commands and environments \\
                 Part 6. Long documents \\
                 BibTeX \\
                 MakeIndex \\
                 Books in LaTeX \\
                 Appendices A-H \\
                 Bibliography \\
                 Index",
}

@Book{Gratzer:2024:TML,
  author =       "George Gr{\"a}tzer",
  title =        "Text and Math into {\LaTeX}",
  publisher =    "Springer",
  address =      "Cham, Switzerland",
  edition =      "Sixth",
  pages =        "xxxii + 612",
  year =         "2024",
  DOI =          "https://doi.org/10.1007/978-3-031-55281-6",
  ISBN =         "3-031-55280-6, 3-031-55281-4 (e-book)",
  ISBN-13 =      "978-3-031-55280-9, 978-3-031-55281-6 (e-book)",
  LCCN =         "QA76.95",
  bibdate =      "Thu May 16 12:37:58 MDT 2024",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  abstract =     "For more than 30 years, this comprehensive manual has
                 been the standard introduction and complete reference
                 for writing articles and books containing mathematical
                 formulas. This sixth edition uses a slightly changed
                 title, Text and Math into {\LaTeX}, to emphasize the
                 importance of text in mathematical\slash scientific
                 composition. Sections that contained commands no longer
                 much needed (such as \includeonly) and the introductory
                 sections to PDF (now ubiquitous) have been omitted.
                 Many sections are now enhanced with discussion of new
                 and useful packages. An occasional encouragement for
                 the reader to consult ChatGPT for confirmation on
                 various points illustrates the positive relationship
                 between ChatGPT and LaTeX. The new Chapter 17 describes
                 recent developments that enhance, or replace, \BibTeX;
                 the new Appendix C, introduces the reader to ChatGPT.",
  acknowledgement = ack-nhfb,
  remark =       "Foreword by Rainer Sch{\"o}pf and the {\LaTeX3
                 Team}.",
  shorttableofcontents = "Foreword / xxi \\
                 Preface to the sixth edition / xxv \\
                 Introduction / xxvii \\
                 I Mission Impossible / 1 \\
                 1 Short course / 3 \\
                 2 And one more thing / 33 \\
                 II Text into {\LaTeX} / 45 \\
                 3 Typing text / 47 \\
                 4 Text environments / 97 \\
                 III Fonts for text and math / 131 \\
                 5 Font basics / 133 \\
                 6 Font encoding / 141 \\
                 IV Math into {\LaTeX} / 147 \\
                 7 Typing math / 149 \\
                 8 More math / 187 \\
                 9 Multiline math displays / 211 \\
                 V Document Structure / 249 \\
                 10 Documents / 251 \\
                 11 The AMS article document class / 279 \\
                 VI PDF Documents / 313 \\
                 12 Hyperlinks / 315 \\
                 13 Presentations / 321 \\
                 14 Illustrations / 357 \\
                 VII Customization / 401 \\
                 15 Commands and environments / 403 \\
                 VIII Long Documents / 463 \\
                 16 {\BibTeX} / 465 \\
                 17 Beyond {\BibTeX} / 491 \\
                 18 MakeIndex / 499 \\
                 19 Books in {\LaTeX} / 515 \\
                 A Math symbol tables / 531 \\
                 B Text symbol tables / 545 \\
                 C ChatGPT 101 / 551 \\
                 Bibliography / 559 \\
                 Index / 562",
  subject =      "LaTeX (Computer file); Mathematics; Computer
                 programs",
  tableofcontents = "Intro \\
                 Short Contents \\
                 Contents \\
                 Foreword \\
                 Preface to the Sixth Edition \\
                 Introduction \\
                 What's this book about? \\
                 A quick overview of this book. \\
                 What is document markup? \\
                 The three layers \\
                 The three platforms \\
                 An outline of the book \\
                 Mission statement \\
                 Conventions \\
                 Part I Mission Impossible \\
                 1: Short course \\
                 1.1 Getting started \\
                 1.1.1 Your {\LaTeX} \\
                 1.1.2 Sample files \\
                 1.1.3 Editing cycle \\
                 1.1.4 Typing the source file \\
                 1.2 The keyboard \\
                 1.3 Your first text note \\
                 1.4 Lines too wide \\
                 1.5 A note with formulas1.6 The building blocks of a
                 formula \\
                 1.7 Displayed formulas \\
                 1.7.1 Equations \\
                 1.7.2 Symbolic referencing \\
                 1.7.3 Aligned formulas \\
                 1.7.4 Cases \\
                 1.8 The anatomy of a document \\
                 1.9 Your own commands \\
                 1.10 Adding an illustration \\
                 1.11 The anatomy of a presentation \\
                 2: And one more thing \\
                 2.1 Structure \\
                 2.2 Auxiliary files \\
                 2.3 Logical and visual design \\
                 2.4 General error messages \\
                 2.5 Errors in math \\
                 2.6 Your errors: Davey's Dos and Don'ts \\
                 Part II Text into {\LaTeX} \\
                 3: Typing text \\
                 3.1 The keyboard \\
                 3.1.1 Basic keys \\
                 3.1.2 Special keys3.1.3 Prohibited keys \\
                 3.2 Words, sentences, and paragraphs \\
                 3.2.1 Spacing rules \\
                 3.2.2 Periods \\
                 3.3 Commanding {\LaTeX} \\
                 3.3.1 Commands and environments \\
                 3.3.2 Scope \\
                 3.3.3 Types of commands \\
                 3.4 Symbols not on the keyboard \\
                 3.4.1 Quotation marks \\
                 3.4.2 Dashes \\
                 3.4.3 Ties or nonbreakable spaces \\
                 3.4.4 Special characters \\
                 3.4.5 Ellipses \\
                 3.4.6 Ligatures \\
                 3.4.7 Accents and symbols in text \\
                 3.4.8 Logos and dates \\
                 3.4.9 Hyphenation \\
                 3.5 Comments and footnotes \\
                 3.5.1 Comments \\
                 3.5.2 Footnotes \\
                 3.6 Lines, paragraphs, and pages \\
                 3.6.1 Lines \\
                 3.6.2 Paragraphs3.6.3 Pages \\
                 3.6.4 Multicolumn printing \\
                 3.7 Spaces \\
                 3.7.1 Horizontal spaces \\
                 3.7.2 Vertical spaces \\
                 3.7.3 Relative spaces \\
                 3.7.4 Expanding spaces \\
                 3.8 Boxes \\
                 3.8.1 Line boxes \\
                 3.8.2 Frame boxes \\
                 3.8.3 Paragraph boxes \\
                 3.8.4 Marginal comments \\
                 3.8.5 Solid boxes \\
                 3.8.6 Fine tuning boxes \\
                 4: Text environments \\
                 4.1 Some general rules \\
                 4.2 List environments \\
                 4.2.1 Numbered lists \\
                 4.2.2 Bulleted lists \\
                 4.2.3 Captioned lists \\
                 4.2.4 A rule and combinations \\
                 4.3 Style and size environments \\
                 4.4 Proclamations (theorem-like structures)4.4.1 The
                 full syntax \\
                 4.4.2 Proclamations with style \\
                 4.5 Proof environments \\
                 4.6 Tabular environments \\
                 4.6.1 Table styles \\
                 4.7 Tabbing environments \\
                 4.8 Miscellaneous displayed text environments \\
                 Part III Fonts for text and math \\
                 5: Font basics \\
                 5.1 Shape, size, serif \\
                 5.2 Document font families \\
                 5.3 Shape commands \\
                 5.3.1 Italic corrections \\
                 5.3.2 Series \\
                 5.4 Size changes \\
                 5.5 Orthogonality \\
                 5.6 Obsolete two-letter commands \\
                 6: Font encoding \\
                 6.1 OT1, T1, \ldots{} \\
                 6.2 Low-level commands \\
                 6.3 PostScript fonts \\
                 The Times font and MathTime \\
                 \ldots{}",
}

@Book{Gray:1983:TT,
  author =       "Bill Gray",
  title =        "Tips on Type",
  publisher =    pub-VAN-NOSTRAND-REINHOLD,
  address =      pub-VAN-NOSTRAND-REINHOLD:adr,
  pages =        "128",
  year =         "1983",
  ISBN =         "0-442-22888-0",
  ISBN-13 =      "978-0-442-22888-0",
  LCCN =         "Z250.G78 1983",
  bibdate =      "Tue Dec 14 22:54:21 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Little coverage of computer-based typesetting, but an
                 excellent coverage of principles of typography, with
                 lots of examples of fonts.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

@InProceedings{Gray:lex,
  author =       "Robert W. Gray",
  booktitle =    "Summer USENIX '88",
  title =        "$ \gamma $-{GLA}: {A} Generator for Lexical Analyzers
                 that Programmers Can Use",
  publisher =    pub-USENIX,
  address =      pub-USENIX:adr,
  pages =        "147--160",
  month =        jun # " 20--24",
  year =         "1988",
  bibdate =      "Sat Apr 29 17:52:15 1995",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


@Book{Graydon:2023:ETS,
  author =       "Samuel Graydon",
  title =        "{Einstein} in Time and Space: a Life in 99 Particles",
  publisher =    pub-SIMON-SCHUSTER,
  address =      pub-SIMON-SCHUSTER:adr,
  pages =        "xvi + 342",
  year =         "2023",
  ISBN =         "1-982185-10-4 (hardcover)",
  ISBN-13 =      "978-1-982185-10-7 (hardcover)",
  LCCN =         "QC16.E5 G73 2023",
  bibdate =      "Sat Aug 10 08:19:23 MDT 2024",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Most of us would agree that Albert Einstein's name is
                 synonymous with ``genius'' and that his likeness is
                 often used as a shorthand for all scientists, appearing
                 everywhere from cartoons to textbooks. He has become
                 more myth than man. That being the case, how best to
                 capture his essence? In \booktitle{Einstein in Time and
                 Space}, talented young science journalist Samuel
                 Graydon answers that question with an illuminating
                 mosaic: 99 intriguingly different particles that
                 cumulatively reveal Einstein's contradictory and
                 multitudinous nature. Glimpsed among these shards: a
                 slacker who failed every subject but math, a job seeker
                 who couldn't get hired, a lothario who courted many
                 women, and a charmer who was the life of the party. As
                 brilliant as he was inconsistent, Einstein was
                 simultaneously an avid supporter of the NAACP and the
                 fight for civil rights and someone capable of great
                 prejudice. He was loved by many, known by few, and
                 inspirational to a generation of young physicists.
                 Graydon reveals every corner of Einstein's world: the
                 false reporting that rocketed Einstein to fame nearly
                 overnight, his effect on people he met merely in
                 passing, even the remarkable posthumous journey of the
                 famed physicist's brain.",
  acknowledgement = ack-nhfb,
  subject =      "20th century history: c 1900 to c 2000; Biography and
                 Autobiography / Science and Technology; Biografien:
                 Wissenschaft, Technologie und Medizin; Biography:
                 science, technology and medicine; General and world
                 history; Geschichte allgemein und Weltgeschichte;
                 History / Modern / 20th Century; Relativity physics;
                 Relativit{\"a}tstheorie; Science / Relativity",
  tableofcontents = "Introduction \\
                 Particles 1--99 \\
                 Sources and acknowledgments \\
                 Credits \\
                 Quotations \\
                 Index",
}

@Book{Green:1968:NIP,
  author =       "A. E. S. Green and T. Sawada and D. S. Saxon",
  title =        "The Nuclear Independent Particle Model: The Shell and
                 Optical Models",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "x + 363",
  year =         "1968",
  LCCN =         "QC721 .G678 1968",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Green:1983:DIP,
  author =       "William B. Green",
  title =        "Digital Image Processing",
  publisher =    pub-VAN-NOSTRAND-REINHOLD,
  address =      pub-VAN-NOSTRAND-REINHOLD:adr,
  pages =        "xi + 192",
  year =         "1983",
  ISBN =         "0-442-28801-8",
  ISBN-13 =      "978-0-442-28801-3",
  LCCN =         "TA1632 .G727 1983",
  bibdate =      "Tue Dec 14 22:54:22 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Computer Science and Engineering Series",
  acknowledgement = ack-nhfb,
}

@Book{Greenberg:2022:BPC,
  author =       "Joel Greenberg",
  booktitle =    "The {Bletchley Park} Codebreakers in Their Own Words",
  title =        "The {Bletchley Park} Codebreakers in Their Own Words",
  publisher =    "Greenhill Books",
  address =      "Barnsley, South Yorkshire, UK",
  pages =        "xvii + 334 + 16",
  year =         "2022",
  ISBN =         "1-78438-811-4 (hardcover), 1-78438-812-2 (e-book),
                 1-78438-814-9",
  ISBN-13 =      "978-1-78438-811-9 (hardcover), 978-1-78438-812-6
                 (e-book), 978-1-78438-814-0",
  LCCN =         "D810.S7 G74 2022",
  bibdate =      "Tue Dec 2 10:41:14 MST 2025",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/g/good-i-j.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "With an introduction by Tony Comer.",
  URL =          "http://digital.casalini.it/9781784388140",
  abstract =     "A fascinating anthology which sheds new light on the
                 Bletchley Park story and shows that there is still more
                 to tell.' --- Tony Comer OBE, formerly Departmental
                 Historian at GCHQ. This important volume tells the
                 story of Bletchley Park through countless letters
                 written by key players to former colleagues and loved
                 ones as the war unfolded. Having intercepted millions
                 of German communications, the codebreakers had felt
                 bound by the Official Secrets Act and said little about
                 their wartime activities. Some who had stayed on at
                 GCHQ after the war, were concerned that speaking out
                 could jeopardise their pensions. Over one hundred
                 letters have been included in this volume and have
                 either been recovered from family members or
                 declassified by GCHQ. They reveal fresh information
                 about the clandestine operation and disclose the true
                 feelings of the participants at Bletchley Park. In
                 contrast to early accounts, which lacked detail and
                 were occasionally inaccurate, this book thoroughly lays
                 bare the day-to-day experiences at Bletchley Park and
                 uncovers the operational and technical reasons behind
                 the organisation's successes and failures.
                 Simultaneously intimate and comprehensive, it will
                 interest historians, World War II researchers, and
                 anyone who wants to learn the secrets of Britain's
                 signal intelligence effort.",
  acknowledgement = ack-nhfb,
}

@Book{Greene:1982:MAA,
  author =       "Daniel H. Greene and Donald E. Knuth",
  title =        "Mathematics for the Analysis of Algorithms",
  publisher =    pub-BIRKHAUSER,
  address =      pub-BIRKHAUSER:adr,
  edition =      "Second",
  pages =        "123",
  year =         "1982",
  ISBN =         "3-7643-3102-X",
  ISBN-13 =      "978-3-7643-3102-3",
  LCCN =         "QA76.6 .G7423 1982",
  bibdate =      "Tue Dec 14 22:54:24 1993",
  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/sigact.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook2.bib",
  acknowledgement = ack-nhfb,
  descriptor =   "Algorithmus, Asymptotische Analyse, Erzeugende
                 Funktion, Identitaet, Komplexitaetsanalyse, Mathematik,
                 Operationsmethode, Rekursionsformel",
  keywords =     "computer algorithms; electronic digital computers --
                 programming",
  remark =       "{Mathematische Methoden zur Aufwandsabschaetzung von
                 Algorithmen. Allgemein Dargestellt, Aber Haeufig durch
                 Beispiele Motiviert (z.b. Zeitaufwand von
                 Hash-verfahren). Zum Teil Vertiefende Darstellung der
                 "optionalen" Kapitel aus "the Art of Computer
                 Programming, Band 3". Themengebiete: Rechnen MIT
                 Binomialkoeffizienten, Geschlossene Darstellungen fuer
                 Rekurrente Relationen, Operatormethoden, Herleitung
                 Asymptotischer Abschaetzungen}.",
  shorttableofcontents = "1: Binomial Identities / 5 \\
                 2: Recurrence Relations / 15 \\
                 3: Operator Methods / 35 \\
                 4: Asymptotic Analysis / 46 \\
                 5: Bibliography / 81 \\
                 6: Appendices / 85 \\
                 A: Lectures / 85 \\
                 B: Homework Assignments / 87 \\
                 C: Midterm Exam I and Solutions / 88 \\
                 D: Final Exam I and Solutions / 99 \\
                 E: Midterm Exam II and Solutions / 105 \\
                 F: Final Exam II and Solutions / 111 \\
                 G: A Qualifying Exam Problem and Solution / 115 \\
                 7: Index / 120",
  tableofcontents = "1: Binomial Identities / 5 \\
                 1.1 Summary of Useful Identities / 5 \\
                 1.2 Deriving the Identities / 7 \\
                 1.3 Inverse Relations / 9 \\
                 1.4 Operator Calculus / 12 \\
                 1.5 Hypergeometric Series / 13 \\
                 1.6 Identities with the Harmonic Numbers / 14 \\
                 2: Recurrence Relations / 15 \\
                 2.1 Linear Recurrence Relations / 15 \\
                 2.1.1 Finite History / 16 \\
                 2.1.1.1 Constant Coefficients / 16 \\
                 2.1.1.2 Variable Coefficients / 18 \\
                 2.1.2 Full History / 21 \\
                 2.1.2.1 Differencing / 21 \\
                 2.1.2.2 By Repertoire / 21 \\
                 2.2 Nonlinear Recurrence Relations / 25 \\
                 2.2.1 Relations with Maximum or Minimum Functions / 25
                 \\
                 2.2.2 Continued Fractions / 29 \\
                 2.2.3 Doubly Exponential Sequences / 31 \\
                 3: Operator Methods / 35 \\
                 3.1 The Cookie Monster / 35 \\
                 3.2 Coalesced Hashing / 38 \\
                 3.3 Open Addressing: Uniform Hashing / 42 \\
                 3.4 Open Addressing: Secondary Clustering / 43 \\
                 4: Asymptotic Analysis / 46 \\
                 4.1 Basic Concepts / 46 \\
                 4.1.1 Notation / 47 \\
                 4.1.2 Bootstrapping / 47 \\
                 4.1.3 Dissecting / 48 \\
                 4.1.4 Limits of Limits / 49 \\
                 4.1.5 Summary of Useful Asymptotic Expansions / 51 \\
                 4.1.6 An Example / 52 \\
                 4.2 Stieltjes Integration / 59 \\
                 4.2.1 $O$-notation and Integrals / 61 \\
                 4.2.2 Euler's Summation Formula / 62 \\
                 4.2.3 A Number Theory Example / 63 \\
                 4.3 Asymptotics from Generating Functions / 69 \\
                 4.3.1 Darboux's Method / 69 \\
                 4.3.2 Residue Calculus / 72 \\
                 4.3.3 The Saddle Point Method / 74 \\
                 5: Bibliography / 81 \\
                 6: Appendices / 85 \\
                 A: Lectures / 85 \\
                 B: Homework Assignments / 87 \\
                 C: Midterm Exam I and Solutions / 88 \\
                 D: Final Exam I and Solutions / 99 \\
                 E: Midterm Exam II and Solutions / 105 \\
                 F: Final Exam II and Solutions / 111 \\
                 G: A Qualifying Exam Problem and Solution / 115 \\
                 7: Index / 120",
}

@Book{Greene:2004:FCS,
  author =       "Brian Greene",
  title =        "The Fabric of the Cosmos: Space, Time, and the Texture
                 of Reality",
  publisher =    pub-VINTAGE,
  address =      pub-VINTAGE:adr,
  pages =        "xii + 569",
  year =         "2004",
  ISBN =         "0-375-41288-3, 0-375-72720-5 (paperback)",
  ISBN-13 =      "978-0-375-41288-2, 978-0-375-72720-7 (paperback)",
  LCCN =         "QB982 .G74 2004",
  bibdate =      "Thu Aug 21 17:36:28 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.bibsys.no:2100/BIBSYS",
  abstract =     "Space and time form the very fabric of the cosmos. Yet
                 they remain among the most mysterious of concepts. Is
                 space an entity? Why does time have a direction? Could
                 the universe exist without space and time? Can we
                 travel to the past? The author uses these questions to
                 guide us toward modern science's new and deeper
                 understanding of the universe. From Newton's unchanging
                 realm in which space and time are absolute, to
                 Einstein's fluid conception of spacetime, to quantum
                 mechanics' entangled arena where vastly distant objects
                 can bridge their spatial separation to instantaneously
                 coordinate their behavior or even undergo
                 teleportation, Greene reveals our world to be very
                 different from what common experience leads us to
                 believe. Focusing on the enigma of time, Greene
                 establishes that nothing in the laws of physics insists
                 that it run in any particular direction and that
                 ``time's arrow'' is a relic of the universe's condition
                 at the moment of the big bang. And in explaining the
                 big bang itself, Green shows how recent cutting-edge
                 developments in super-string and M-theory may reconcile
                 the behavior of everything from the smallest particle
                 to the largest black hole. This startling vision
                 culminates in the vibrant eleven-dimensional
                 ``multiverse,'' pulsating with ever-changing textures,
                 where space and time themselves may dissolve into
                 subtler, more fundamental entities.",
  acknowledgement = ack-nhfb,
  subject =      "kosmologi; universet",
  tableofcontents = "Part I: Reality's arena \\
                 1: Roads to reality: Space, time, and why things are as
                 they are \\
                 2: The universe and the bucket: Is space a human
                 abstraction or a physical entity? \\
                 3: Relativity and the absolute: Is spacetime an
                 Einsteinian abstraction or a physical entity? \\
                 4: Entangling space: What does it mean to be separate
                 in a quantum universe? \\
                 Part II: Time and experience \\
                 5: The frozen river: Does time flow? \\
                 6: Chance and the arrow: Does time have a direction?
                 \\
                 7: Time and the quantum: Insights into time's nature
                 from the quantum realm \\
                 Part III: Spacetime and cosmology \\
                 8: Of snowflakes and spacetime: Symmetry and the
                 evolution of the cosmos \\
                 9: Vaporizing the vacuum: Heat, nothingness, and
                 unification \\
                 10: Deconstructing the bang: What banged? \\
                 11: Quanta in the sky with diamonds: Inflation, quantum
                 jitters, and the arrow of time \\
                 Part IV: Origins and unification \\
                 12: The world on a string: The fabric according to
                 string theory \\
                 13: The universe on a brane: Speculations on space and
                 time in M-theory \\
                 Part V: Reality and imagination \\
                 14 Up in the heavens and down in the earth:
                 Experimenting with space and time \\
                 15: Teleporters and time machines: Traveling through
                 space and time \\
                 16: The future of an allusion: Prospects for space and
                 time",
}

@Book{Greene:2011:HRP,
  author =       "B. (Brian) Greene",
  title =        "The Hidden Reality: Parallel Universes and the Deep
                 Laws of the Cosmos",
  publisher =    pub-KNOPF,
  address =      pub-KNOPF:adr,
  pages =        "xi + 370",
  year =         "2011",
  ISBN =         "0-307-26563-3",
  ISBN-13 =      "978-0-307-26563-0",
  LCCN =         "QC6 .G6885 2011",
  bibdate =      "Mon Jun 13 16:37:18 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Physics; Philosophy; Quantum theory; General
                 relativity (Physics); Cosmology",
  tableofcontents = "The bounds of reality: on parallel worlds \\
                 Endless doppelgangers: the quilted multiverse \\
                 Eternity and infinity: the inflationary multiverse \\
                 Unifying nature's laws: on the road to string theory
                 \\
                 Hovering universes in nearby dimensions: the brane and
                 cyclic multiverses \\
                 New thinking about an old constant: the landscape
                 multiverse \\
                 Science and the multiverse: on inference, explanation,
                 and prediction \\
                 The many worlds of quantum measurement: the quantum
                 multiverse \\
                 Black holes and holograms: the holographic multiverse
                 \\
                 Universes, computers, and mathematical reality: the
                 simulated and ultimate multiverses \\
                 The limits of inquiry: multiverses and the future",
}

@Book{Gregory:1978:CMT,
  author =       "Robert T. Gregory and David L. Karney",
  title =        "A Collection of Matrices for Testing Computational
                 Algorithms",
  publisher =    pub-R-E-KRIEGER,
  address =      pub-R-E-KRIEGER:adr,
  pages =        "ix + 154",
  year =         "1978",
  ISBN =         "0-88275-649-4",
  ISBN-13 =      "978-0-88275-649-3",
  LCCN =         "QA188 .G72 1978",
  bibdate =      "Wed Dec 15 09:01:31 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "This monograph is intended primarily as a reference
                 book for numerical analysts and others who are
                 interested in computational methods for solving
                 problems in matrix algebra. It is well known that a
                 good mathematical algorithm may or may not be a good
                 computational algorithm. Consequently, what is needed
                 is a collection of numerical examples with which to
                 test each algorithm as soon as it is proposed. It is
                 our hope that the matrices we have collected will help
                 fulfill this need.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Introduction \\
                 Construction of test matrices \\
                 Test matrices: inverses, systems of linear equations,
                 and determinants \\
                 Test matrices: eigenvalues and eigenvectors of real
                 symmetric matrices \\
                 Test matrices: eigenvalues and eigenvectors of real
                 nonsymmetric matrices \\
                 Test matrices: eigenvalues and eigenvectors of complex
                 matrices \\
                 Test matrices: eigenvalues and eigenvectors of
                 tridiagonal matrices",
}

@Book{Grier:2005:WCW,
  author =       "David Alan Grier",
  title =        "When Computers Were Human",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "viii + 411",
  year =         "2005",
  ISBN =         "0-691-09157-9 (hardcover), 0-691-13382-4 (paperback),
                 1-4008-4936-5 (e-book)",
  ISBN-13 =      "978-0-691-09157-0 (hardcover), 978-0-691-13382-9
                 (paperback), 978-1-4008-4936-9 (e-book)",
  LCCN =         "QA303.2 .G75 2005",
  bibdate =      "Wed Jan 23 18:35:00 MST 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0654/2004022631-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0734/2004022631-b.html;
                 http://www.loc.gov/catdir/toc/ecip051/2004022631.html",
  abstract =     "Before Palm Pilots and iPods, PCs and laptops, the
                 term `computer' referred to the people who did
                 scientific calculations by hand. These workers were
                 neither calculating geniuses nor idiot savants but
                 knowledgeable people who, in other circumstances, might
                 have become scientists in their own right.
                 \booktitle{When Computers Were Human} represents the
                 first in-depth account of this little-known, 200-year
                 epoch in the history of science and technology.
                 Beginning with the story of his own grandmother, who
                 was trained as a human computer, David Alan Grier
                 provides an introduction to the wider world of women
                 and men who did the hard computational labor of
                 science. \booktitle{When Computers Were Human} is the
                 sad but lyrical story of workers who gladly did the
                 hard labor of research calculation in the hope that
                 they might be part of the scientific community. In the
                 end, they were rewarded by a new electronic machine
                 that took the place and the name of those who were,
                 once, the computers.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  remark =       "See also \cite{Campbell-Kelly:2003:HMT} and positive
                 lengthy review by David E. Zitarelli, American
                 Mathematical Monthly, {\bf 113}(7), August\slash
                 September 2006, pp. 663--668.",
  subject =      "calculus; history; science; mathematics; mental
                 calculators",
  tableofcontents = "Astronomy and the Division of Labor 1682--1880 \\
                 The First Anticipated Return: Halley's Comet 1758 \\
                 The Children of Adam Smith \\
                 The Celestial Factory: Halley's Comet 1835 \\
                 The American Prime Meridian \\
                 A Carpet for the Computing Room \\
                 Mass Production and New Fields of Science 1880--1930
                 \\
                 Looking Forward, Looking Backward: Machinery 1893 \\
                 Darwin's Cousins \\
                 Breaking from the Ellipse: Halley's Comet 1910 \\
                 Captains of Academe \\
                 War Production \\
                 Fruits of the Conflict: Machinery 1922 \\
                 Professional Computers and an Independent Discipline
                 1930--1964 \\
                 The Best of Bad Times \\
                 Scientific Relief \\
                 Tools of the Trade: Machinery 1937 \\
                 Professional Ambition \\
                 New York Mid-town Glide Bomb Club \\
                 The Victor's Share \\
                 Only I Alone am Left to Tell Thee",
}

@Book{Gries:1978:PMC,
  editor =       "David Gries",
  title =        "Programming Methodology: a Collection of Articles by
                 Members of {IFIP WG2.3}",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xiv + 437",
  year =         "1978",
  ISBN =         "0-387-90329-1",
  ISBN-13 =      "978-0-387-90329-3",
  LCCN =         "QA76.6.P7516",
  bibdate =      "Tue Dec 14 22:54:27 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{Gries:1990:BDO,
  author =       "David Gries",
  title =        "Binary to Decimal, One More Time",
  crossref =     "Feijen:1990:BOB",
  chapter =      "16",
  pages =        "141--148",
  year =         "1990",
  bibdate =      "Sun Mar 27 17:53:57 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "This paper presents an alternate proof of Knuth's
                 algorithm \cite{Knuth:1990:SPW} for conversion between
                 decimal and fixed-point binary numbers.",
  acknowledgement = ack-nhfb,
}

@Article{Griffiths:space-fill,
  author =       "J. G. Griffiths",
  title =        "An Algorithm for Displaying a Class of Space-filling
                 Curves",
  journal =      j-SPE,
  volume =       "16",
  number =       "5",
  pages =        "403--411",
  month =        may,
  year =         "1986",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Grimson:1981:IS,
  author =       "William Eric Leifur Grimson",
  title =        "From Images to Surfaces",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "274",
  year =         "1981",
  ISBN =         "0-262-07083-9 (hardcover), 0-262-57185-4 (paperback),
                 0-262-25627-4 (e-book)",
  ISBN-13 =      "978-0-262-07083-6 (hardcover), 978-0-262-57185-2
                 (paperback), 978-0-262-25627-8 (e-book)",
  LCCN =         "QP487 .G74",
  bibdate =      "Tue Dec 14 22:54:29 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://mitpress.mit.edu/9780262070836",
  abstract =     "The projection of light rays onto the retina of the
                 eye forms a two-dimensional image, but through
                 combining the stereoscopic aspect of vision with other
                 optical clues by means of some remarkably effective
                 image-processing procedures, the viewer is able to
                 perceive three-dimensional representations of scenes.
                 From Images to Surfaces proposes and examines a
                 specific image-processing procedure to account for this
                 remarkable effect --- a computational approach that
                 provides a framework for understanding the
                 transformation of a set of images into a representation
                 of the shapes of surfaces visible in a scene. Although
                 much of the analysis is applicable to any visual
                 information processing system --- biological or
                 artificial --- Grimson constrains his final choice of
                 computational algorithms to those that are biologically
                 feasible and consistent with what is known about the
                 human visual system. In order to clarify the analysis,
                 the approach distinguishes three independent levels:
                 the computational theory itself, the algorithms
                 employed, and the underlying implementation of the
                 computation, in this case through the human neural
                 mechanisms. This separation into levels facilitates the
                 generation of specific models from general concepts.
                 This research effort had its origin in a theory of
                 human stereo vision recently developed by David Marr
                 and Tomaso Poggio. Grimson presents a computer
                 implementation of this theory that serves to test its
                 adequacy and provide feedback for the identification of
                 unsuspected problems embedded in it. The author then
                 proceeds to apply and extend the theory in his analysis
                 of surface interpolation through the computational
                 methodology. This methodology allows the activity of
                 the human early visual system to be followed through
                 several stages: the Primal Sketch, in which intensity
                 changes at isolated points on a surface are noted; the
                 Raw 2.5-D Sketch, in which surface values at these
                 points are computed; and the Full 2.5-D Sketch, in
                 which these values --- including stereo and motion
                 perception --- are interpolated over the entire
                 surface. These stages lead to the final 3-D Model, in
                 which the three-dimensional shapes of objects, in
                 object-centered coordinates, are made explicit.",
  acknowledgement = ack-nhfb,
  remark =       "Based on the author's thesis (Ph.D.--Massachusetts
                 Institute of Technology).",
}

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

@TechReport{Hall:pfort,
  author =       "A. D. Hall",
  title =        "A Portable {Fortran IV} Subset",
  institution =  pub-ATT-BELL,
  address =      pub-ATT-BELL:adr,
  year =         "1969",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

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

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

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

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

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

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

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

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

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

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

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

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

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

@Book{Harnwell:1933:EAP,
  author =       "G. P. (Gaylord Probasco) Harnwell and J. J. (John
                 Jacob) Livingood",
  title =        "Experimental Atomic Physics",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "xiii + 472",
  year =         "1933",
  LCCN =         "QC173 .H38",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Harold:1999:J,
  author =       "Elliotte Rusty Harold",
  title =        "{Java I/O}",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xxvi + 568",
  year =         "1999",
  ISBN =         "1-56592-485-1",
  ISBN-13 =      "978-1-56592-485-7",
  LCCN =         "QA76.73.J38 H372 1999",
  bibdate =      "Wed Jul 07 07:31:19 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$32.95",
  URL =          "http://metalab.unc.edu/javafaq/books/javaio/;
                 http://www.oreilly.com/catalog/javaio/",
  acknowledgement = ack-nhfb,
}

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

@Book{Hawking:2005:GCI,
  author =       "Stephen Hawking",
  title =        "{God} Created the Integers: the Mathematical
                 Breakthroughs That Changed History",
  publisher =    "Running Press Book Publishers",
  address =      "Philadelphia, PA; London, UK",
  pages =        "xiii + 1160",
  year =         "2005",
  ISBN =         "0-7624-1922-9 (hardcover)",
  ISBN-13 =      "978-0-7624-1922-7 (hardcover)",
  LCCN =         "QA21 .G63 2005",
  bibdate =      "Wed Oct 26 15:10:09 MDT 2005",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  price =        "US\$29.95",
  URL =          "http://www.perseusbooksgroup.com/runningpress/book_detail.jsp?isbn=0762419229",
  acknowledgement = ack-nhfb,
  keywords =     "Euclid (ca. 325BCE--265BCE); Archimedes
                 (287BCE--212BC); Diophantus (Third Century AD);
                 Ren{\'e} Descartes (1596--1650); Isaac Newton
                 (1642--1727); Pierre Simon de LaPlace (1749--1827);
                 Jean Baptiste Joseph Fourier (1768--1830); Carl
                 Friedrich Gauss (1777--1855); Augustin-Louis Cauchy
                 (1789--1857); George Boole (1815--1864); Georg
                 Friedrich Berhard Riemann (1826--1866); Karl
                 Weierstrass (1815--1897); Richard Julius Wilhelm
                 Dedekind (1831--1916); Georg Cantor (1845--1918); Henri
                 Lebesgue (1875--1941); Kurt G{\"o}del (1906--1978);
                 Alan Mathison Turing (1912--1954)",
  remark-1 =     "From the publisher: ``Stephen Hawking explores the
                 `masterpieces' of mathematics, 25 landmarks spanning
                 2,500 years and representing the work of 15
                 mathematicians, including Augustin Cauchy, Bernard
                 Riemann, and Alan Turing.''",
  remark-2 =     "Chapters cover Euclid (ca. 325BCE--265BCE), Archimedes
                 (287BCE--212BC), Diophantus (Third Century AD),
                 Ren{\'e} Descartes (1596--1650), Isaac Newton
                 (1642--1727), Pierre Simon de LaPlace (1749--1827),
                 Jean Baptiste Joseph Fourier (1768--1830), Carl
                 Friedrich Gauss (1777--1855), Augustin-Louis Cauchy
                 (1789--1857), George Boole (1815--1864), Georg
                 Friedrich Berhard Riemann (1826--1866), Karl
                 Weierstrass (1815--1897), Richard Julius Wilhelm
                 Dedekind (1831--1916), Georg Cantor (1845--1918), Henri
                 Lebesgue (1875--1941), Kurt G{\"o}del (1906--1978), and
                 Alan Mathison Turing (1912--1954).",
  tableofcontents = "Introduction / xi \\
                 \\
                 Euclid (c. 325BC--265BC): His Life and Work / 01 \\
                 Selections from Euclid's \booktitle{Elements} \\
                 Book I: Basic Geometry-Definitions, Postulates, Common
                 Notions and Proposition 47 (Leading up to the
                 Pythagorean Theorem) / 07 \\
                 Book V: The Eudoxian Theory of Proportion-Definitions
                 \& Propositions / 25 \\
                 Book VII: Elementary Number Theory --- Definitions \&
                 Propositions / 63 \\
                 Book IX: Proposition 20: The Infinitude of Prime
                 Numbers / 101 \\
                 Book IX: Proposition 36: Even Perfect Numbers / 102 \\
                 Book X: Commensurable and Incommensurable Magnitudes /
                 104 \\
                 \\
                 Archimedes (287BC--212BC): His Life and Work / 119 \\
                 Selections from \booktitle{The Works of Archimedes} \\
                 On the Sphere and Cylinder, Book I / 126 \\
                 On the Sphere and Cylinder, Book II / 168 \\
                 Measurement of a Circle / 194 \\
                 The Sand Reckoner / 200 \\
                 The Methods / 209 \\
                 \\
                 Diophantus (Third Century AD): His Life and Work / 241
                 \\
                 Selections from \booktitle{Diophantus of Alexandria, A
                 Study in the History of Greek Algebra} \\
                 Book II Problems 8--35 / 246 \\
                 Book III Problems 5--21 / 255 \\
                 Book V Problems 1--29 / 265 \\
                 \\
                 Ren{\'e} Descartes (1596--1650): His Life and Work /
                 285 \\
                 \booktitle{The Geometry of Ren{\'e} Descartes} / 292
                 \\
                 \\
                 Isaac Newton (1642--1727): His Life and Work / 365 \\
                 Selections from \booktitle{Principia} \\
                 Book I: Of the Motion of Bodies / 374 \\
                 \\
                 Pierre Simon de Laplace (1749--1827): His Life and Work
                 / 383 \\
                 \booktitle{A Philosophical Essay on Probabilities} /
                 390 \\
                 \\
                 Jean Baptiste Joseph Fourier (1768--1830): His Life and
                 Work / 491 \\
                 Selection from \booktitle{The Analytical Theory of
                 Heat} \\
                 Chapter III: Propagation of Heat in an Infinite
                 Rectangular Solid (The Fourier series) / 500 \\
                 \\
                 Carl Friedrich Gauss (1777--1855): His Life and Work /
                 563 \\
                 Selections from \booktitle{Disquisitiones Arithmeticae
                 (Arithmetic Disquisitions)} \\
                 Section III Residues of Powers / 571 \\
                 Section IV Congruences of the Second Degree / 597 \\
                 \\
                 Augustin-Louis Cauchy (1789--1857): His Life and Work /
                 635 \\
                 Selection from \booktitle{Oeuvres compl{\`e}tes
                 d'Augustin Cauchy} \booktitle{R{\'e}sum{\'e} des
                 le{\c{c}}ons donn{\'e}es a l'{\'E}cole Royale
                 Polytechnique sur le calcul infinitesimal} (1823),
                 series 2, vol. 4 Lessons 3--4 on differential calculus
                 / 643 \\
                 Lessons 21--24 on the integral / 651 \\
                 \\
                 George Boole (1815--1864): His Life and Work / 669 \\
                 \booktitle{An Investigation of the Laws of Thought} /
                 676 \\
                 \\
                 Georg Friedrich Bernhard Riemann (1826--1866): His Life
                 and Work / 813 \\
                 \booktitle{On the Representability of a Function by
                 Means of a Trigonometric Series} (Ueber die
                 Darstellbarkeit einer Function durch einer
                 trigonometrische Reihe) / 826 \\
                 \booktitle{On the Hypotheses which lie at the Bases of
                 Geometry} (Ueber die Hypothesen welche der Geometrie zu
                 Grunde liegen) / 865 \\
                 \booktitle{On the Number of Prime Numbers Less than a
                 Given Quantity} (Ueber di Anzahl of Primzahlen unter,
                 eine gegeben Grosse) / 876 \\
                 \\
                 Karl Weierstrass (1815--1897): His Life and Work / 887
                 \\
                 \booktitle{A Theory of Functions (Lecture Given in
                 Berlin in 1886, with the Inaugural Academic Speech,
                 Berlin 1857)} \S 7 Uniform Continuity
                 (\booktitle{Gleichm{\"a}ssige Stetigkeit}) / 894 \\
                 \\
                 Richard Julius Wilhelm Dedekind (1831--1916): His Life
                 and Work / 901 \\
                 \booktitle{Essays on the Theory of Numbers} / 906 \\
                 \\
                 Georg Cantor (1845--1918): His Life and Work / 965 \\
                 Selections from \booktitle{Contributions to the
                 Founding of the Theory of Transfinite Numbers} \\
                 Articles I and II / 971 \\
                 \\
                 Henri Lebesgue (1875--1941): His Life and Work / 1041
                 \\
                 Selections from \booktitle{Int{\'e}grale, Longeur, Aire
                 (Integral, Length, Area)} / 1046 \\
                 \\
                 Kurt G{\"o}del (1906--1978): His Life and Work / 1089
                 \\
                 \booktitle{On Formally Undecidable Propositions of
                 \booktitle{Principia Mathematica} and Related Systems}
                 / 1097 \\
                 \\
                 Alan Mathison Turing (1912--1954): His Life and Work /
                 1119 \\
                 \booktitle{On computable numbers with an application to
                 the Entscheidungsproblem}, \booktitle{Proceedings of
                 the London Mathematical Society} / 1127",
}

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

@TechReport{Hershey:advanced-typography,
  author =       "Allen V. Hershey",
  title =        "Advanced Computer Typography",
  number =       "NPS012-81-005",
  institution =  pub-USNPS,
  address =      pub-USNPS:adr,
  month =        dec,
  year =         "1981",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@TechReport{Hershey:calligraphy,
  author =       "Allen V. Hershey",
  title =        "Calligraphy for Computers",
  number =       "TR-2101",
  institution =  pub-USNWL,
  address =      pub-USNWL:adr,
  month =        aug,
  year =         "1967",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

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

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

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

@TechReport{Hershey:fourier,
  author =       "Allen V. Hershey",
  title =        "A Comment on the {Fourier} Theorem",
  number =       "TR-3145",
  institution =  pub-USNWL,
  address =      pub-USNWL:adr,
  month =        jun,
  year =         "1974",
  bibdate =      "Fri Feb 9 18:04:33 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@TechReport{Hershey:lagally,
  author =       "Allen V. Hershey",
  title =        "A Comment on the Lagally Theorem",
  number =       "TR-3133",
  institution =  pub-USNWL,
  address =      pub-USNWL:adr,
  month =        may,
  year =         "1974",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@TechReport{Hershey:wavetrains,
  author =       "Allen V. Hershey",
  title =        "{FORTRAN} Programming for Surface Wave Trains",
  number =       "TR-2714",
  institution =  pub-USNWL,
  address =      pub-USNWL:adr,
  month =        sep,
  year =         "1972",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@TechReport{Hershey:wavetrains-2,
  author =       "Allen V. Hershey",
  title =        "Interpolation of Surface Wave Trains",
  number =       "TR-3064",
  institution =  pub-USNWL,
  address =      pub-USNWL:adr,
  month =        sep,
  year =         "1972",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

@Book{Hoenig:1998:TUL,
  author =       "Alan Hoenig",
  title =        "{\TeX} Unbound: {\LaTeX} and {\TeX} Strategies for
                 Fonts, Graphics, \& More",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  pages =        "ix + 580",
  year =         "1998",
  ISBN =         "0-19-509686-X (paperback), 0-19-509685-1 (hardcover)",
  ISBN-13 =      "978-0-19-509686-6 (paperback), 978-0-19-509685-9
                 (hardcover)",
  LCCN =         "Z253.4.L38H64 1997",
  bibdate =      "Wed Apr 29 14:32:29 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  price =        "US\$60.00 (hardcover), US\$35.00 (paperback)",
  URL =          "http://www.oup-usa.org/gcdocs/gc_0195096851.html",
  abstract =     "TeX and LaTeX are some of the premier technical
                 typesetting systems in existence. While there are many
                 books on TeX and LaTeX, none offers more than slight
                 coverage of issues not directly related to using TeX
                 and LaTeX commands. This book fills this important gap,
                 bringing together for the first time hard-to-find
                 information on essential aspects of document
                 production. TeX Unbound includes practical advice and
                 numerous examples for a wide range of topics. Readers
                 who devour their books from cover to cover will enjoy
                 the lively style, but the copious index, detailed table
                 of contents, many illustrations, and frequent boxed
                 summaries make this book equally valuable to those who
                 simply need a quick and concise answer to a pressing
                 question.",
  acknowledgement = ack-nhfb,
  keywords =     "Computer fonts; Computer graphics; Computerized
                 typesetting; Mathematics printing --- Computer
                 programs; METAFONT; Technical publishing --- Computer
                 programs; {\LaTeX} (Computer file); {\TeX} (Computer
                 file)",
  tableofcontents = "1: About \TeX{} and \LaTeX{} \\
                 2: \TeX{}, the Internet, and Multimedia \\
                 3: Mostly Metafont \\
                 4: Logical Documents via \LaTeX{} \\
                 5: \TeX{} in the Workplace \\
                 6: Installing and Selecting Fonts \\
                 7: Virtual Fonts, Virtuous Fonts \\
                 8: Virtual-Font Projects \\
                 9: More Virtual Fonts \\
                 10: New Math Fonts \\
                 11: Graphic Discussions \\
                 12: Graphics via \TeX{} and \LaTeX{} \\
                 13: Using Metafont and MetaPost \\
                 14: PSTricks \\
                 15: Mfpic Pictures \\
                 Appendix 1: Basic \TeX{} Commands \\
                 Appendix 2: More About \LaTeX{} \\
                 Appendix 3: Producing this Book",
}

@PhdThesis{Hohn:2001:SMB,
  author =       "Michael Hohn",
  title =        "On the Solution of Mixed Boundary Value Problems in
                 Elasticity",
  type =         "{Ph.D.} thesis",
  school =       "Department of Mathematics, University of Utah",
  address =      "Salt Lake City, UT, USA",
  pages =        "x + 221",
  month =        dec,
  year =         "2001",
  bibdate =      "Mon Apr 29 16:20:16 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  keywords =     "Maple; OCAML; sinc functions",
}

@Book{Holmes:1993:ECM,
  author =       "Mark H. Holmes and Joseph G. Ecker and William E.
                 Boyce and William L. Siegmann",
  title =        "Exploring Calculus with {Maple}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "vii + 258",
  year =         "1993",
  ISBN =         "0-201-52616-6",
  ISBN-13 =      "978-0-201-52616-5",
  LCCN =         "QA303.5.D37 E97 1993",
  bibdate =      "Wed Dec 15 09:12:29 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

@Book{Holmes:2008:AWHc,
  author =       "Richard Holmes",
  title =        "The age of wonder: how the romantic generation
                 discovered the beauty and terror of science",
  publisher =    pub-VINTAGE,
  address =      pub-VINTAGE:adr,
  pages =        "xxi + 552 + 24",
  year =         "2008",
  ISBN =         "1-4000-3187-7 (paperback), 0-307-37832-2 (e-book)",
  ISBN-13 =      "978-1-4000-3187-0 (paperback), 978-0-307-37832-3
                 (e-book)",
  LCCN =         "Q127.G4 H65 2010",
  bibdate =      "Tue Jul 2 11:38:00 MDT 2013",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/physperspect.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "``\booktitle{The Age of Wonder}'' explores the
                 earliest ideas of deep time and space, and the
                 explorers of ``dynamic science'': an infinite,
                 mysterious Nature waiting to be discovered. Three lives
                 dominate the book: William Herschel, his sister
                 Caroline, and Humphry Davy.",
  acknowledgement = ack-nhfb,
  subject =      "Herschel, William; Herschel, Caroline Lucretia; Davy,
                 Humphry; Sir; Science; Great Britain; History; 18th
                 century; Discoveries in science",
  subject-dates = "1738--1822; 1750--1848; 1778--1829",
  tableofcontents = "Joseph Banks in paradise \\
                 Herschel on the moon \\
                 Balloonists in heaven \\
                 Herschel among the stars \\
                 Mungo Park in Africa \\
                 Davy on the gas \\
                 Dr. Frankenstein and the soul \\
                 Davy and the lamp \\
                 Sorcerer and apprentice \\
                 Young scientists",
}

@Book{Holoien:1991:FES,
  author =       "Martin O. Holoien and Ali Behforooz",
  title =        "{FORTRAN} 77 for Engineers and Scientists",
  publisher =    pub-BROOKS-COLE,
  address =      pub-BROOKS-COLE:adr,
  edition =      "Second",
  pages =        "x + 463",
  year =         "1991",
  ISBN =         "0-534-14166-8",
  ISBN-13 =      "978-0-534-14166-0",
  LCCN =         "Q183.9 .H64 1991",
  bibdate =      "Thu Dec 16 08:56:27 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$28.00",
  acknowledgement = ack-nhfb,
}

@Book{Holt:2018:WEW,
  author =       "Jim Holt",
  title =        "When {Einstein} walked with {G{\"o}del}: excursions to
                 the edge of thought",
  publisher =    pub-FARRAR,
  address =      pub-FARRAR:adr,
  pages =        "xi + 368",
  year =         "2018",
  ISBN =         "0-374-14670-5 (hardcover), 0-374-71784-2 (e-book)",
  ISBN-13 =      "978-0-374-14670-2 (hardcover), 978-0-374-71784-1
                 (e-book)",
  LCCN =         "PS3608.O4943595 A6 2018",
  bibdate =      "Fri May 18 13:58:57 MDT 2018",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/h/heisenberg-werner.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/l/lovelace-ada-augusta.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.bib;
                 https://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "A collection of essays on philosophy, mathematics, and
                 science, and the people who pursue them.",
  acknowledgement = ack-nhfb,
  author-dates = "1954--",
  remark =       "Chapter 8 discusses the influence of Zipf's Law on
                 Mandelbrot's discovery of fractals.",
  shorttableofcontents = "Part I: The moving image of eternity \\
                 Part II: Numbers in the brain, in platonic heaven, and
                 in society \\
                 Part III: Mathematics, pure and impure \\
                 Part IV: Higher dimensions, abstract maps \\
                 Part V: Infinity, large and small \\
                 Part VI: Heroism, tragedy, and the computer age \\
                 Part VII: The cosmos reconsidered \\
                 Part VIII: Quick studies: A selection of shorter essays
                 \\
                 Part IX: God, sainthood, truth and bullshit",
  tableofcontents = "Part I: The moving image of eternity \\
                 1: When Einstein walked with G{\"o}del \\
                 2: Time --- the grand illusion? \\
                 Part II: Numbers in the brain, in platonic heaven, and
                 in society \\
                 3: Numbers guy: the neuroscience of math \\
                 4: The Riemann Zeta conjecture and the laughter of the
                 primes \\
                 5: Sir Francis Galton, the father of
                 statistics\ldots{}and eugenics \\
                 Part III: Mathematics, pure and impure \\
                 6: A mathematical romance \\
                 7: The avatars of higher mathematics \\
                 8: Beno{\^\i}t Mandelbrot and the discovery of fractals
                 \\
                 Part IV: Higher dimensions, abstract maps \\
                 9: Geometrical creatures \\
                 10: A comedy of colors \\
                 Part V: Infinity, large and small \\
                 11: Infinite visions: Georg Cantor v. David Foster
                 Wallace \\
                 12: Worshipping infinity: why the Russians do and the
                 French don't \\
                 13: The dangerous idea of the infinitesimal \\
                 Part VI: Heroism, tragedy, and the computer age \\
                 14: The Ada perplex: was Byron's daughter the first
                 coder? \\
                 15: Alan Turing in life, logic, and death \\
                 16: Dr. Strangelove makes a thinking machine \\
                 17: Smarter, happier, more productive \\
                 Part VII: The cosmos reconsidered \\
                 18: The string theory wars: is beauty truth? \\
                 19: Einstein, ``Spooky action,'' and the reality of
                 space \\
                 20: How will the Universe end? \\
                 Part VII: Quick studies: a selection of shorter essays
                 \\
                 Little big man \\
                 Doom soon \\
                 Death: bad? \\
                 The looking-glass war \\
                 Astrology and the demarcation problem \\
                 G{\"o}del takes on the U.S. Constitution \\
                 The law of least action \\
                 Emmy Noether's beautiful theorem \\
                 Is logic coercive? \\
                 Newcomb's problem and the paradox of choice \\
                 The right not to exist \\
                 Can't anyone get Heisenberg right? \\
                 Overconfidence and the Monty Hall problem \\
                 The cruel law of eponymy \\
                 The mind of a rock \\
                 Part IX: God, sainthood, truth, and bullshit \\
                 21: Dawkins and the deity \\
                 22: On moral sainthood \\
                 23: Truth and reference: a philosophical feud \\
                 24: Say anything \\
                 Further Reading \\
                 Acknowledgments \\
                 Index",
}

@Book{Holub:1987:CWU,
  author =       "Allen I. Holub",
  title =        "On Command: Writing a {Unix}-Like Shell for {MS-DOS}",
  publisher =    pub-MT,
  address =      pub-MT:adr,
  pages =        "319",
  year =         "1987",
  ISBN =         "0-934375-29-1",
  ISBN-13 =      "978-0-934375-29-0",
  LCCN =         "QA76.76.O63H65 1987",
  bibdate =      "Fri Sep 11 07:45:53 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Holub:1990:CDC,
  author =       "Allen I. Holub",
  title =        "Compiler Design in {C}",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xviii + 924",
  year =         "1990",
  ISBN =         "0-13-155045-4, 0-13-155151-5 (paperback)",
  ISBN-13 =      "978-0-13-155045-2, 978-0-13-155151-0 (paperback)",
  LCCN =         "QA76.76.C65 H65 1990",
  bibdate =      "Wed Dec 15 09:13:20 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/litprog.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://www.holub.com/software/compiler.design.in.c.html",
  acknowledgement = ack-nhfb,
  remark =       "Prentice-Hall Software Series, Editor: Brian W.
                 Kernighan.",
  tableofcontents = "1: Basic concepts \\
                 2: Input and lexical analysis \\
                 3: Context-free grammars \\
                 4: Top-down parsing \\
                 5: Bottom-up parsing \\
                 6: Code generation \\
                 7: Optimization strategies \\
                 Appendix A: Support functions \\
                 Appendix B: Notes on Pascal compilers \\
                 Appendix C: A grammar for C \\
                 Appendix D: LeX \\
                 Appendix E: LLama and Occs \\
                 Appendix F: A C-code summary",
}

@Book{Holub:2004:HPL,
  author =       "Allen I. Holub",
  title =        "{Holub} on Patterns: Learning Design Patterns by
                 Looking at Code",
  publisher =    pub-APRESS,
  address =      pub-APRESS:adr,
  pages =        "xv + 414",
  year =         "2004",
  ISBN =         "1-59059-388-X",
  ISBN-13 =      "978-1-59059-388-2",
  LCCN =         "QA76.76.P37 H65 2004",
  bibdate =      "Thu Sep 30 05:58:14 2004",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$49.95",
  URL =          "http://www.holub.com/software/holubSQL/",
  abstract =     "The existing books on design patterns take a catalog
                 approach, where they show the individual design
                 patterns in isolation. This approach is fundamentally
                 flawed, because you can't see how the design patterns
                 actually function in the real world. Most programmers
                 learn by looking at computer programs. Holub on
                 Patterns: Learning Design Patterns by Looking at Code
                 teaches you design patterns in exactly this way: by
                 looking at computer programs and analyzing them in
                 terms of the patterns that they use. Consequently, you
                 learn how the patterns actually occur in the real world
                 and how to apply the patterns to solve real problems.
                 This book also looks at the broader context of
                 object-oriented (OO) design and how patterns solve
                 commonplace OO design problems. It covers many of the
                 principles of OO design--principles not covered by most
                 books on Java--and shows you how to apply these
                 principles to make your code easier to maintain and
                 debug.",
  acknowledgement = ack-nhfb,
  keywords =     "HolubSQL (an embedded SQL interpreter)",
  libnote =      "Not yet in my library.",
  tableofcontents = "1 Preliminaries: 00 and Design Patterns 101 \\
                 2 Programming with Interfaces, and a Few Creational
                 Patterns \\
                 3 The Game of Life \\
                 4 Implementing Embedded SQL \\
                 Appendix A Design-Pattern Quick Reference \\
                 Creational Patterns \\
                 Abstract Factory \\
                 Builder \\
                 Factory Method \\
                 Prototype \\
                 Singleton \\
                 Structural Patterns \\
                 Adapter \\
                 Bridge \\
                 Composite \\
                 Decorator \\
                 Facade \\
                 Flyweight \\
                 Proxy \\
                 Behavioral Patterns \\
                 Chain of Responsibility \\
                 Command \\
                 Interpreter \\
                 Iterator \\
                 Mediator \\
                 Memento \\
                 Observer (Publish/Subscribe) \\
                 State \\
                 Strategy \\
                 Template Method \\
                 Visitor",
}

@Article{Holub:curses,
  author =       "Allen I. Holub",
  title =        "Curses: {UNIX}-Compatible Windowing Output Functions",
  journal =      j-DDJ,
  volume =       "12",
  number =       "7",
  pages =        "94--104, 74--93",
  month =        jul,
  year =         "1987",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Holzgang:1987:UPP,
  author =       "David A. Holzgang",
  title =        "Understanding {PostScript} Programming",
  publisher =    pub-SYBEX,
  address =      pub-SYBEX:adr,
  pages =        "xxxii + 459",
  year =         "1987",
  ISBN =         "0-89588-396-1",
  ISBN-13 =      "978-0-89588-396-4",
  LCCN =         "QA76.73.P67 H65 1987",
  bibdate =      "Sat Aug 27 10:56:46 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Holzgang:1989:PPR,
  author =       "David A. Holzgang",
  title =        "{PostScript} Programmer's Reference Guide",
  publisher =    pub-SCOTT-FORESMAN,
  address =      pub-SCOTT-FORESMAN:adr,
  pages =        "x + 486",
  year =         "1989",
  ISBN =         "0-673-38574-4",
  ISBN-13 =      "978-0-673-38574-1",
  LCCN =         "QA76.73.P67 H64 1989",
  bibdate =      "Sat Aug 27 10:56:45 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Holzgang:1990:DPP,
  author =       "David A. Holzgang",
  title =        "{Display PostScript} Programming",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "x + 406",
  year =         "1990",
  ISBN =         "0-201-51814-7",
  ISBN-13 =      "978-0-201-51814-6",
  LCCN =         "QA76.73.P67 H63 1990",
  bibdate =      "Sat Aug 27 10:56:38 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Hopgood:1983:IGK,
  author =       "F. Robert A. Hopgood and Julian R. Gallop and David A.
                 Duce and Dale C. Sutcliffe",
  title =        "Introduction to the Graphical Kernel System ({GKS})",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "xi + 200",
  year =         "1983",
  ISBN =         "0-12-355570-1",
  ISBN-13 =      "978-0-12-355570-0",
  LCCN =         "T385 .I57 1983",
  bibdate =      "Wed Dec 15 10:30:59 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "{A. P. I. C.} Studies in Data Processing No. 19.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Graphical output \\
                 Coordinate systems \\
                 Segments and their attributes \\
                 Graphical input devices \\
                 Styles of interaction \\
                 Workstations \\
                 GKS environment \\
                 Control of input devices \\
                 Segment storage \\
                 Metafiles \\
                 Further output \\
                 Individual attributes \\
                 Appendices: abbreviations \\
                 Language binding",
}

@Book{Hopgood:1986:IGK,
  author =       "F. Robert A. Hopgood and Julian R. Gallop and David A.
                 Duce and Dale C. Sutcliffe",
  title =        "Introduction to the Graphical Kernel System ({GKS})",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  edition =      "Second",
  pages =        "xii + 250",
  year =         "1986",
  ISBN =         "0-12-355571-X (paperback)",
  ISBN-13 =      "978-0-12-355571-7 (paperback)",
  LCCN =         "T385 .I571 1986",
  bibdate =      "Wed Dec 15 10:31:02 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Revised for the International Standard. {A. P. I. C.}
                 Studies in Data Processing No. 28",
  price =        "UK\pounds 12.50",
  acknowledgement = ack-nhfb,
}

@Book{Hopgood:1986:MWM,
  author =       "F. Robert A. Hopgood and David A. Duce and Elizabeth
                 V. C. Fielding and Ken Robinson and Antony S.
                 Williams",
  title =        "Methodology of Window Management",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xv + 250",
  year =         "1986",
  ISBN =         "0-387-16116-3",
  ISBN-13 =      "978-0-387-16116-7",
  LCCN =         "T385 .C671 1985",
  bibdate =      "Wed Dec 15 10:31:05 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Horowitz:1976:FDS,
  author =       "Ellis Horowitz and Sartaj Sahni",
  title =        "Fundamentals of Data Structures",
  publisher =    pub-CSP,
  address =      pub-CSP:adr,
  pages =        "xii + 564",
  year =         "1976, 1982, 1983",
  ISBN =         "0-914894-20-X",
  ISBN-13 =      "978-0-914894-20-9",
  LCCN =         "QA76.9.D35 H67 1977",
  bibdate =      "Wed Dec 15 10:31:28 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$15.95",
  acknowledgement = ack-nhfb,
  tableofcontents = "Arrays \\
                 Stacks and queues \\
                 Linked lists \\
                 Trees \\
                 Graphs \\
                 Internal sorting \\
                 External sorting \\
                 Symbol tables \\
                 Files",
}

@Book{Horowitz:1978:FCA,
  author =       "Ellis Horowitz and Sartaj Sahni",
  title =        "Fundamentals of Computer Algorithms",
  publisher =    pub-CSP,
  address =      pub-CSP:adr,
  pages =        "xiv + 626",
  year =         "1978",
  ISBN =         "0-914894-22-6 (hardcover)",
  ISBN-13 =      "978-0-914894-22-3 (hardcover)",
  LCCN =         "QA76.6 .H67 1978",
  bibdate =      "Wed Dec 15 10:31:07 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/hash.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "1: Introduction \\
                 2: Elementary Data Structures \\
                 3: Divide-and-Conquer \\
                 4: The Greedy Method \\
                 5: Dynamic Programming \\
                 6: Basic Search and Traversal Techniques \\
                 7: Backtracking \\
                 8: Branch-and-Bound \\
                 9: Algebraic Simplification and Transformations \\
                 10: Lower Bound Theory \\
                 11: NP-Hard and NP-Complete Problems \\
                 12: Approximation Algorithms for NP-Hard Problems
                 Appendix A: SPARKS \\
                 Index",
  tableofcontents = "Preface / vii \\
                 1: Introduction \\
                 1.1 What is an algorithm / 1 \\
                 1.2 Writing algorithms in SPARKS / 4 \\
                 1.3 Writing structured programs / 14 \\
                 1.4 Analyzing algorithms / 24 \\
                 References and selected readings / 40 \\
                 Exercises / 41 \\
                 2: Elementary Data Structures \\
                 2.1 Stacks and queues / 48 \\
                 2.2 Trees / 53 \\
                 2.3 Heaps and heapsort / 61 \\
                 2.4 Sets and disjoint set union / 70 \\
                 2.5 Graphs / 79 \\
                 2.6 Hashing / 82 \\
                 References and selected readings / 93 \\
                 Exercises / 94 \\
                 3: Divide-and-Conquer \\
                 3.1 The general method / 98 \\
                 3.2 Binary search / 100 \\
                 3.3 Finding the maximum and minimum / 108 \\
                 3.4 Mergesort / 113 \\
                 3.5 Quicksort / 121 \\
                 3.6 Selection / 127 \\
                 3.7 Strassen's matrix multiplication / 137 \\
                 References and selected readings / 140 \\
                 Exercises / 141 \\
                 4: The Greedy Method \\
                 4.1 The general method / 152 \\
                 4.2 Optimal storage on tapes / 153 \\
                 4.3 Knapsack problem / 157 \\
                 4.4 Job sequencing with deadlines / 161 \\
                 4.5 Optimal merge patterns / 169 \\
                 4.6 Minimum spanning trees / 174 \\
                 4.7 Single source shortest paths / 183 \\
                 References and selected readings / 188 \\
                 Exercises / 191 \\
                 5: Dynamic Programming \\
                 5.1 The general method / 198 \\
                 5.2 Multistage graphs / 203 \\
                 5.3 All pairs shortest paths / 208 \\
                 5.4 Optimal binary search trees / 211 \\
                 5.5 0/1 knapsack / 219 \\
                 5.6 Reliability design / 228 \\
                 5.7 The traveling salesperson problem / 231 \\
                 5.8 Flow shop scheduling / 234 \\
                 References and selected readings / 238 \\
                 Exercises / 240 \\
                 6: Basic Search and Traversal Techniques \\
                 6.1 The techniques / 248 \\
                 6.2 Code optimization / 270 \\
                 6.3 AND/OR graphs / 286 \\
                 6.4 Game trees / 290 \\
                 6.5 Biconnected components and depth first search / 302
                 \\
                 References and selected readings / 309 \\
                 Exercises / 311 \\
                 7: Backtracking \\
                 7.1 The general method / 323 \\
                 7.2 The 8-queens problem / 337 \\
                 7.3 Sum of subsets / 339 \\
                 7.4 Graph coloring / 343 \\
                 7.5 Hamiltonian cycles / 348 \\
                 7.6 Knapsack problem / 350 \\
                 References and selected readings / 359 \\
                 Exercises / 363 \\
                 8: Branch-and-Bound \\
                 8.1 The method / 370 \\
                 8.2 0/1 knapsack problem / 390 \\
                 8.3 Traveling salesperson / 403 \\
                 8.4 Efficiency considerations / 412 \\
                 References and selected readings / 415 \\
                 Exercises 41 / 7 \\
                 9: Algebraic Simplification and Transformations \\
                 9.1 The general method / 422 \\
                 9.2 Evaluation and interpolation / 424 \\
                 9.3 The fast Fourier transform / 431 \\
                 9.4 Modular arithmetic / 440 \\
                 9.5 Even faster evaluation and interpolation / 447 \\
                 References ans selected readings / 455 \\
                 Exercises / 457 \\
                 10: Lower Bound Theory \\
                 10.1 Comparison trees for sorting and searching / 461
                 \\
                 10.2 Oracles and Adversary Arguments / 469 \\
                 10.3 Techniques for algebraic problems / 478 \\
                 10.4 Some lower bounds on parallel computation / 488
                 \\
                 References and selected readings / 494 \\
                 Exercises / 497 \\
                 11: NP-Hard and NP-Complete Problems \\
                 11.1 Basic concepts / 501 \\
                 11.2 Cook's theorem / 513 \\
                 11.3 NP-Hard graph problems / 522 \\
                 11.4 NP-Hard scheduling problems / 532 \\
                 11.5 NP-Hard code generation problems / 538 \\
                 11.6 Some simplified NP-Hard problems / 545 \\
                 References and selected readings / 548 \\
                 Exercises / 552 \\
                 12: Approximation Algorithms for NP-Hard Problems \\
                 12.1 Introduction / 559 \\
                 12.2 Absolute approximations / 562 \\
                 12.3 $\epsilon$-approximations / 567 \\
                 12.4 Polynomial time approximation schemes / 578 \\
                 12.5 Fully polynomial time approximation schemes / 585
                 \\
                 12.6 Probabilistically good algorithms / 596 \\
                 References and selected readings / 599 \\
                 Exercises / 604 \\
                 Appendix A: SPARKS / 614 \\
                 Index / 622",
}

@Book{Hoskin:2011:DUW,
  author =       "Michael A. Hoskin",
  title =        "Discoverers of the universe: {William and Caroline
                 Herschel}",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "xvi + 237 + 16",
  year =         "2011",
  ISBN =         "0-691-14833-3 (hardcover)",
  ISBN-13 =      "978-0-691-14833-5 (hardcover)",
  LCCN =         "QB35 .H75 2011",
  bibdate =      "Fri Jul 22 15:56:43 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Herschel, William; Sir; Herschel, Caroline Lucretia;
                 Astronomers; Great Britain; Biography",
  subject-dates = "1738--1822; 1750--1848",
  tableofcontents = "The Herschel family \\
                 August 1772: the partnership convenes \\
                 1707--1773: a musician's odyssey \\
                 1773--1778: vocations in conflict \\
                 1779--1781: an enthusiasm shared \\
                 1781--1782: royal patronage \\
                 1782--1783: ``Astronomer to his majesty'' \\
                 1783--1785: the construction of the heavens \\
                 1782--1790: ``one of the greatest mechanics of his
                 day'' \\
                 1786--1788: ``gold can glitter as well as the stars''
                 \\
                 1788--1798: ``noble and worthy priestess of the new
                 heavens'' \\
                 1788--1810: ``the most celebrated of all the
                 astronomers of the universe'' \\
                 1792--1822: the torch is handed on \\
                 1822--1833: John's ``sacred duty'' \\
                 1833--1848: ``the completion of my father's work''",
}

@Book{Hoskins:1991:IRS,
  author =       "Jim Hoskins",
  title =        "{IBM RISC System\slash 6000}: a Business Perspective",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xx + 295",
  year =         "1991",
  ISBN =         "0-471-53294-0",
  ISBN-13 =      "978-0-471-53294-1",
  LCCN =         "QA76.8.I25975 H67 1991",
  bibdate =      "Thu Dec 16 08:56:00 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Article{Hough:fps-applications,
  author =       "David Hough",
  title =        "Applications of the Proposed {IEEE-754} Standard for
                 Floating Point Arithmetic",
  journal =      j-COMPUTER,
  volume =       "14",
  number =       "3",
  pages =        "70--74",
  month =        mar,
  year =         "1981",
  bibdate =      "Sun May 2 07:48:22 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See \cite{IEEE:p754}.",
  acknowledgement = ack-nhfb,
}

@Book{Howard:2003:WSC,
  author =       "Michael Howard and David LeBlanc",
  title =        "Writing Secure Code: Practical Strategies and Proven
                 Techniques for Building Secure Applications in a
                 Networked World",
  publisher =    pub-MICROSOFT,
  address =      pub-MICROSOFT:adr,
  edition =      "Second",
  pages =        "xxviii + 768",
  year =         "2003",
  ISBN =         "0-7356-1722-8",
  ISBN-13 =      "978-0-7356-1722-3",
  LCCN =         "QA76.9.A25 H698 2003",
  bibdate =      "Tue May 6 09:12:37 MDT 2025",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://proquest.safaribooksonline.com/0735617228;
                 http://proquest.tech.safaribooksonline.de/0735617228",
  abstract =     "Keep black-hat hackers at bay with the tips and
                 techniques in this entertaining, eye-opening book!
                 Developers will learn how to padlock their applications
                 throughout the entire development process --- from
                 designing secure applications to writing robust code
                 that can withstand repeated attacks to testing
                 applications for security flaws. Easily digested
                 chapters reveal proven principles, strategies, and
                 coding techniques. The authors --- two battle-scarred
                 veterans who have solved some of the industry's
                 toughest security problems --- provide sample code in
                 several languages. This edition includes updated
                 information about threat modeling, designing a security
                 process, international issues, file-system issues,
                 adding privacy to applications, and performing security
                 code reviews. It also includes enhanced coverage of
                 buffer overruns, Microsoft .NET security, and Microsoft
                 ActiveX development, plus practical checklists for
                 developers, testers, and program managers.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Computer security; Data encryption (Computer
                 science)",
  tableofcontents = "Contemporary security \\
                 Secure coding techniques \\
                 Even more secure coding techniques \\
                 Special topics",
}

@Book{Howes:2015:AWU,
  author =       "Ruth H. Howes and Caroline L. Herzenberg",
  title =        "After the War: {US} Women in Physics",
  publisher =    "Morgan and Claypool Publishers",
  address =      "San Rafael, CA 94903, USA",
  pages =        "123",
  year =         "2015",
  DOI =          "https://doi.org/10.1088/978-1-6817-4094-2",
  ISBN =         "1-68174-030-3 (print), 1-68174-094-X (PDF),
                 1-68174-222-5 (mobi)",
  ISBN-13 =      "978-1-68174-030-0 (print), 978-1-68174-094-2 (PDF),
                 978-1-68174-222-9 (mobi)",
  LCCN =         "QC15 .H683 2015",
  bibdate =      "Wed Sep 6 10:56:51 MDT 2023",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "IOP Concise Physics Series",
  URL =          "https://iopscience.iop.org/book/mono/978-1-6817-4094-2.pdf",
  abstract =     "This book examines the lives and contributions of
                 American women physicists who were active in the years
                 following World War II, during the middle decades of
                 the 20th century. It covers the strategies they used to
                 survive and thrive in a time where their gender was
                 against them. The percentage of woman taking PhDs in
                 physics has risen from 6\% in 1983 to 20\% in 2012 (an
                 all-time high for women). By understanding the history
                 of women in physics, these gains can continue. It
                 discusses two major classes of women physicists; those
                 who worked on military projects, and those who worked
                 in industrial laboratories and at universities largely
                 in the late 1940s and 1950s. While it includes minimal
                 discussion of physics and physicists in the 1960s and
                 later, this book focuses on the challenges and
                 successes of women physicists in the years immediately
                 following World War II and before the eras of
                 affirmative actions and the use of the personal
                 computer.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Preface / vii \\
                 Acknowledgements / ix \\
                 Author biographies: Ruth H Howes [Photograph by Anton
                 Brki{\'c}] and Caroline L Herzenberg / x \\
                 1: Introduction. The setting for women in physics after
                 World War II \\
                 References \\
                 2: Women physicists in the National Laboratories \\
                 References \\
                 3: Women physicists in research universities \\
                 References \\
                 4: Women physicists in industry \\
                 References \\
                 5: Women physicists in the women's colleges \\
                 References \\
                 6: Women in astrophysics and early NASA space science
                 \\
                 References \\
                 7: Other women physicists \\
                 8: Epilogue: some final thoughts \\
                 References",
}

@Book{Hsu:2001:CAS,
  author =       "John Y. Hsu",
  title =        "Computer Architecture: Software Aspects, Coding,
                 Hardware",
  publisher =    pub-CRC,
  address =      pub-CRC:adr,
  pages =        "427",
  year =         "2001",
  ISBN =         "0-8493-1026-1, 1-351-83604-8, 1-4200-4110-X (e-book)",
  ISBN-13 =      "978-0-8493-1026-3, 978-1-351-83604-3,
                 978-1-4200-4110-1 (e-book)",
  LCCN =         "A76.9.A73 H758 2001",
  bibdate =      "Fri Jan 19 15:47:59 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/java2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/microchip.bib;
                 https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib;
                 https://www.math.utah.edu/pub/tex/bib/visual-instruction-set.bib",
  price =        "US\$89.95, UK\pounds 59.99",
  abstract =     "With the new developments in computer architecture,
                 fairly recent publications can quickly become outdated.
                 Computer Architecture: Software Aspects, Coding, and
                 Hardware takes a modern approach. This comprehensive,
                 practical text provides that critical understanding of
                 a central processor by clearly detailing fundamentals,
                 and cutting edge design features. With its balanced
                 software/hardware perspective and its description of
                 Pentium processors, the book allows readers to acquire
                 practical PC software experience. The text presents a
                 foundation-level set of ideas, design concepts, and
                 applications that fully meet the requirements of
                 computer organization and architecture courses. The
                 book features a ``bottom up'' computer design approach,
                 based upon the author's thirty years experience in both
                 academe and industry. By combining computer engineering
                 with electrical engineering, the author describes how
                 logic circuits are designed in a CPU. The extensive
                 coverage of a microprogrammed CPU and new processor
                 design features gives the insight of current computer
                 development. Computer Architecture: Software Aspects,
                 Coding, and Hardware presents a comprehensive review of
                 the subject, from beginner to advanced levels. Topics
                 include: * Two's complement numbers * Integer overflow
                 * Exponent overflow and underflow * Looping *
                 Addressing modes * Indexing * Subroutine linking * I/O
                 structures * Memory mapped I/O * Cycle stealing *
                 Interrupts * Multitasking * Microprogrammed CPU *
                 Multiplication tree * Instruction queue * Multimedia
                 instructions * Instruction cache * Virtual memory *
                 Data cache * Alpha chip * Interprocessor communications
                 * Branch prediction * Speculative loading * Register
                 stack * JAVA virtual machine * Stack machine
                 principles.",
  acknowledgement = ack-nhfb,
  keywords =     "Compaq/DEC Alpha; floating-point arithmetic; Intel
                 x86; Java Virtual Machine; multimedia instructions;
                 Pentium",
  libnote =      "Not yet in my library.",
  tableofcontents = "Number Systems \\
                 Basic Computer Principles \\
                 Assembly Language Principles \\
                 Computer Architecture--General Features \\
                 Microprogrammed CPU Design \\
                 Superscalar Machine Principles \\
                 Vector and Multiple-Processor Machines \\
                 Processor Design Case Studies \\
                 Stack Machine Principles",
}

@Book{Hubbard:1984:CGG,
  author =       "Stuart W. Hubbard",
  title =        "The Computer Graphics Glossary",
  publisher =    pub-VAN-NOSTRAND-REINHOLD,
  address =      pub-VAN-NOSTRAND-REINHOLD:adr,
  pages =        "vi + 94",
  year =         "1984",
  ISBN =         "0-89774-072-6",
  ISBN-13 =      "978-0-89774-072-2",
  LCCN =         "T385 .H78 1983",
  bibdate =      "Sun Jul 10 01:08:48 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Hudson:2006:PN,
  author =       "Paul Hudson",
  title =        "{PHP} in a nutshell",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xv + 352",
  year =         "2006",
  ISBN =         "0-596-10067-1 (paperback)",
  ISBN-13 =      "978-0-596-10067-4 (paperback)",
  LCCN =         "QA76.73.P224 H83 2006",
  bibdate =      "Wed Nov 15 09:59:06 MST 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "PHP (Computer program language); Internet
                 programming",
  tableofcontents = "Introduction to PHP \\
                 Installing PHP \\
                 The PHP interpreter \\
                 The PHP language \\
                 Variables and constants \\
                 Operators \\
                 Function reference \\
                 Object-oriented PHP \\
                 HTML forms \\
                 Cookies and sessions \\
                 Output buffering \\
                 Security \\
                 Files \\
                 Databases \\
                 Regular expressions \\
                 Manipulating images \\
                 Creating PDFs \\
                 Creating flash \\
                 XML and XSLT \\
                 Network programming \\
                 Distributing your code \\
                 Debugging \\
                 Performance",
}

@Book{Hult:1999:NCH,
  author =       "Christine Hult and Thomas N. Huckin",
  title =        "New Century Handbook",
  publisher =    pub-ALLYN-BACON,
  address =      pub-ALLYN-BACON:adr,
  pages =        "xxxvii + 870",
  year =         "1999",
  ISBN =         "0-205-27352-1 (hardcover), 0-205-32970-5",
  ISBN-13 =      "978-0-205-27352-2, 978-0-205-32970-0",
  LCCN =         "PE1408 .H688 1999",
  bibdate =      "Thu May 16 14:23:46 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://occawlonline.pearsoned.com/bookbind/pubbooks/hult2_awl/;
                 http://www.ablongman.com/hult",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "Part 1: Writing \\
                 1: Writing and computers \\
                 2: The reading and writing process \\
                 3: Preparing \\
                 4: Composing \\
                 5: Rewriting \\
                 6: Structuring paragraphs \\
                 7: Formulating arguments \\
                 Part 2: Research \\
                 8: The research project \\
                 9: Using the internet for research \\
                 10: Evaluating electronic and print sources \\
                 11: Using sources \\
                 12: Writing the research paper \\
                 13: Documentation formats \\
                 Part 3: Writing in the disciplines \\
                 14: Writing in the humanities \\
                 15: Writing in the natural sciences \\
                 16: Writing in the social sciences \\
                 Part 4: Document design \\
                 17: Design principles and graphics \\
                 18: Desktop publishing \\
                 19: Designing for the web \\
                 20: Writing for the web \\
                 Part 5: Special purpose writing \\
                 21: Communicating via computer networks \\
                 22: business correspondence and reports \\
                 23: Essay exams \\
                 Part 6: Sentence grammar \\
                 24: Sentence structure \\
                 25: Pronoun case \\
                 26: Verbs \\
                 27: Agreement \\
                 28: Adjectives and adverbs \\
                 Part 7: Correct sentences \\
                 29: Sentence fragments \\
                 30: Comma splices and run-on sentences \\
                 31: Pronoun reference \\
                 32: Misplaced and dangling modifiers \\
                 33: Consistency \\
                 Part 8: Effective sentences \\
                 34: Clarity and conciseness \\
                 35: Coordination and subordination \\
                 36: Parallelism \\
                 37: Emphasis \\
                 38: Variety \\
                 39. Word-processing tools and online resources for
                 improving sentences \\
                 Part 9: Effective words \\
                 40: Choosing the right words \\
                 41: Avoiding biased language \\
                 42: Building a powerful vocabulary \\
                 43: Using a thesaurus and dictionary \\
                 44: Spelling \\
                 Part 10: Punctuation \\
                 45: End punctuation \\
                 46: The comma \\
                 47: The semicolon \\
                 48: The colon \\
                 49: The apostrophe \\
                 50: Quotation marks \\
                 51: Other punctuation marks \\
                 Part 11: Mechanics \\
                 52: Capital letters and italics \\
                 53: Abbreviations and numbers \\
                 54: The hyphen \\
                 Part 12: ESL issues \\
                 55: Tips on nouns and articles \\
                 56: Tips on verbs \\
                 57: Tips on word order \\
                 58: Tips on vocabulary \\
                 Glossary of computer terms \\
                 Glossary of grammatical and rhetorical terms \\
                 Glossary of usage",
}

@Book{Hunt:1985:CT,
  author =       "William James Hunt",
  title =        "The {C} Toolbox",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xviii + 413",
  year =         "1985",
  ISBN =         "0-201-11111-X",
  ISBN-13 =      "978-0-201-11111-8",
  LCCN =         "QA76.73.C15 H85 1985",
  bibdate =      "Wed Dec 15 10:34:33 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "An excellent introduction to the use of C for the
                 writing of software tools, with particular emphasis
                 (but not limited to) the IBM PC. Tools developed
                 include a screen-based file viewing utility, sorting
                 programs, a B-tree module, assembly language
                 primitives, and a terminal emulator.",
  price =        "US\$19.95",
  acknowledgement = ack-nhfb,
  tableofcontents = "A quick tour through C \\
                 Adapting C to our use \\
                 Viewing ASCII files \\
                 Dumping files in hexadecimal notation \\
                 Tools for sorting \\
                 BTREE: an indexed file module \\
                 A low-level toolkit for IBM-PC-specific tools \\
                 A terminal emulation program \\
                 Loose ends and final thoughts \\
                 Compiling and executing the programs \\
                 C compilers for the IBM PC environment \\
                 IBM PC architecture and C memory models \\
                 Reference materials \\
                 Index",
}

@Book{Hunt:1992:TIN,
  author =       "Craig Hunt",
  title =        "{TCP\slash IP} Network Administration",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xxii + 471",
  year =         "1992",
  ISBN =         "0-937175-82-X (paperback)",
  ISBN-13 =      "978-0-937175-82-8 (paperback)",
  LCCN =         "TK5105.9 .H86",
  bibdate =      "Wed Dec 15 10:34:47 1993",
  bibsource =    "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;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "Preface / xi \\
                 Overview of TCP/IP / 1 \\
                 TCP/IP and the Internet / 2 \\
                 A Data Communications Model / 6 \\
                 TCP/IP Protocol Architecture / 9 \\
                 Network Access Layer / 11 \\
                 Internet Layer / 12 \\
                 Transport Layer / 18 \\
                 Application Layer / 22 \\
                 Summary / 23 \\
                 Delivering the Data / 24 \\
                 Addressing, Routing, and Multiplexing / 24 \\
                 The IP Address / 25 \\
                 Internet Routing Architecture / 35 \\
                 The Routing Table / 37 \\
                 Address Resolution / 43 \\
                 Protocols, Ports, and Sockets / 44 \\
                 Summary / 50 \\
                 Network Services / 51 \\
                 Names and Addresses / 51 \\
                 The Host Table / 52 \\
                 DNS / 54 \\
                 Mail Services / 62 \\
                 File and Print Servers / 75 \\
                 Configuration Servers / 76 \\
                 Summary / 82 \\
                 Getting Started / 84 \\
                 Connected and Non-Connected Networks / 85 \\
                 Basic Information / 86 \\
                 Planning Routing / 97 \\
                 Planning Naming Service / 101 \\
                 Other Services / 104 \\
                 Informing the Users / 106 \\
                 Summary / 107 \\
                 Basic Configuration / 108 \\
                 Kernel Configuration / 108 \\
                 Startup Files / 124 \\
                 The Internet Daemon / 129 \\
                 The Extended Internet Daemon / 132 \\
                 Summary / 133 \\
                 Configuring the Interface / 134 \\
                 The ifconfig Command / 134 \\
                 TCP/IP Over a Serial Line / 150 \\
                 Installing PPP / 153 \\
                 Summary / 169 \\
                 Configuring Routing / 170 \\
                 Common Routing Configurations / 170 \\
                 The Minimal Routing Table / 171 \\
                 Building a Static Routing Table / 173 \\
                 Interior Routing Protocols / 178 \\
                 Exterior Routing Protocols / 188 \\
                 Gateway Routing Daemon / 191 \\
                 Configuring gated / 193 \\
                 Summary / 204 \\
                 Configuring DNS / 205 \\
                 BIND: Unix Name Service / 205 \\
                 Configuring the Resolver / 207 \\
                 Configuring named / 211 \\
                 Using nslookup / 228 \\
                 Summary / 232 \\
                 Local Network Services / 233 \\
                 The Network File System / 233 \\
                 Sharing Unix Printers / 252 \\
                 Using Samba to Share Resources with Windows / 259 \\
                 Network Information Service / 268 \\
                 DHCP / 272 \\
                 Managing Distributed Servers / 277 \\
                 Post Office Servers / 280 \\
                 Summary / 283 \\
                 sendmail / 285 \\
                 sendmail's Function / 285 \\
                 Running sendmail as a Daemon / 286 \\
                 sendmail Aliases / 288 \\
                 The sendmail.cf File / 290 \\
                 sendmail.cf Configuration Language / 297 \\
                 Rewriting the Mail Address / 309 \\
                 Modifying a sendmail.cf File / 319 \\
                 Testing sendmail.cf / 323 \\
                 Summary / 332 \\
                 Configuring Apache / 333 \\
                 Installing Apache Software / 334 \\
                 Configuring the Apache Server / 338 \\
                 Understanding an httpd.conf File / 341 \\
                 Web Server Security / 361 \\
                 Managing Your Web Server / 378 \\
                 Summary / 380 \\
                 Network Security / 381 \\
                 Security Planning / 382 \\
                 User Authentication / 387 \\
                 Application Security / 402 \\
                 Security Monitoring / 404 \\
                 Access Control / 409 \\
                 Encryption / 418 \\
                 Firewalls / 425 \\
                 Words to the Wise / 433 \\
                 Summary / 434 \\
                 Troubleshooting TCP/IP / 435 \\
                 Approaching a Problem / 435 \\
                 Diagnostic Tools / 438 \\
                 Testing Basic Connectivity / 440 \\
                 Troubleshooting Network Access / 443 \\
                 Checking Routing / 450 \\
                 Checking Name Service / 456 \\
                 Analyzing Protocol Problems / 471 \\
                 Protocol Case Study / 474 \\
                 Summary / 478 \\
                 PPP Tools / 479 \\
                 A gated Reference / 503 \\
                 A named Reference / 548 \\
                 A dhcpd Reference / 586 \\
                 A sendmail Reference / 599 \\
                 Solaris httpd.conf File / 661 \\
                 RFC Excerpts / 679 \\
                 Index / 687",
}

@Book{Hunter:1981:DCC,
  author =       "Robin Hunter",
  title =        "The Design and Construction of Compilers",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xii + 272",
  year =         "1981",
  ISBN =         "0-471-28054-2",
  ISBN-13 =      "978-0-471-28054-5",
  LCCN =         "QA76.6.H86 1981",
  bibdate =      "Wed Dec 15 10:34:50 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "The compilation process \\
                 Language definition \\
                 Lexical analysis \\
                 Context-free grammars and top-down syntax analysis \\
                 Bottom-up syntax analysis \\
                 Embedding actions in syntax \\
                 Compiler design \\
                 Symbol and mode tables \\
                 Storage allocation \\
                 Code generation \\
                 Generation of machine code \\
                 Error recovery and diagnostics \\
                 Writing reliable compilers",
}

@Book{Hurley:1978:PP,
  author =       "James P. Hurley and Claude Garrod",
  title =        "Principles of Physics",
  publisher =    pub-HOUGHTON-MIFFLIN,
  address =      pub-HOUGHTON-MIFFLIN:adr,
  pages =        "xvii + 773",
  year =         "1978",
  ISBN =         "0-395-25036-6",
  ISBN-13 =      "978-0-395-25036-5",
  LCCN =         "QC23.H89",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Hurter:2022:TBS,
  author =       "Tobias H{\"u}rter",
  title =        "Too Big for a Single Mind: How the Greatest Generation
                 of Physicists Uncovered the Quantum World",
  publisher =    "The Experiment",
  address =      "New York, NY, USA",
  pages =        "357",
  year =         "2022",
  ISBN =         "1-61519-920-9 (hardcover), 1-61519-921-7 (e-book)",
  ISBN-13 =      "978-1-61519-920-4 (hardcover), 978-1-61519-921-1
                 (e-book)",
  LCCN =         "QC7 .H88813 2022",
  bibdate =      "Mon Nov 21 06:04:11 MST 2022",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/b/bohr-niels.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/d/dirac-p-a-m.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/h/heisenberg-werner.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/s/schroedinger-erwin.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Translation to English by David Shaw of \booktitle{Das
                 Zeitalter der Unsch{\"a}rfe}, published by Klett-Cotta
                 (2021).",
  abstract =     "The epic true story of how a global team of physics
                 luminaries --- Einstein, Curie, Schr{\"o}dinger, and
                 more --- toppled the Newtonian universe amid the
                 turmoil of two World Wars.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Prologue / 1 \\
                 1: PARIS, 1903: Cracks Begin to Appear / 2 \\
                 2: BERLIN, 1900: An Act of Desperation / 11 \\
                 3: BERN, 1905: The Patent Serf / 21 \\
                 4: PARIS, 1906: The Decline and Fall of Pierre Curie /
                 29 \\
                 5: BERLIN, 1909: The End of the Flying Cigars / 31 \\
                 6: PRAGUE, 1911: Einstein Says It with Flowers / 32 \\
                 7: CAMBRIDGE, 1911: A Dane Grows Up / 34 \\
                 8: THE NORTH ATLANTIC, 1912: The Sinking
                 of Infallibility / 42 \\
                 9: MUNICH, 1913: A Painter Moves to Munich / 44 \\
                 10: MUNICH, 1914: On Tour with the Atom / 46 \\
                 11: BERLIN, 1915: Good at Theory, Bad at Relationships
                 / 53 \\
                 12: GERMANY, 1916: War and Peace / 60 \\
                 13: BERLIN, 1917: Einstein Breaks Down / 62 \\
                 14: BERLIN, 1918: Pandemic / 64 \\
                 15: THE MID-ATLANTIC, 1919: The Moon Obscures the Sun
                 / 68 \\
                 16: MUNICH, 1919: A Young Man Reads Plato / 71 \\
                 17: BERLIN, 1920: Great Minds Meet / 75 \\
                 18: G{\"O}TTINGEN, 1922: A Son Finds His Father / 82
                 \\
                 19: MUNICH, 1923: A Highflier Almost Crashes / 95 \\
                 20: COPENHAGEN, 1923: Bohr and Einstein Take the Tram /
                 102 \\
                 21: COPENHAGEN, 1924: One Last Try / 104 \\
                 22: PARIS, 1924: A Prince Makes Atoms Sing / 110 \\
                 24: CAMBRIDGE, 1925: The Quiet Genius / 127 \\
                 25: LEIDEN, 1925: The Prophet of Spin / 132 \\
                 26: AROSA, 1925: A Late Erotic Outburst / 135 \\
                 27: COPENHAGEN, 1926: Waves and Particles / 141 \\
                 28: BERLIN, 1926: A Visit with the Demigods / 144 \\
                 29: BERLIN, 1926: The Plancks Throw a Party / 155 \\
                 30: G{\"O}TTINGEN, 1926: The Abolition of Reality / 158
                 \\
                 31: MUNICH, 1926: A Turf War / 167 \\
                 32: COPENHAGEN, 1926: Exquisitely Carved Marble Statues
                 Falling Out of the Sky / 176 \\
                 33: COPENHAGEN, 1926: A Game with Sharpened Knives /
                 182 \\
                 34: COPENHAGEN, 1927: The World Goes Fuzzy / 189 \\
                 35: COMO, 1927: Dress Rehearsal / 199 \\
                 36: BRUSSELS, 1927: The Great Debate / 204 \\
                 37: BERLIN, 1930: Germany Flourishes; Einstein Falls
                 Ill / 225 \\
                 38: BRUSSELS, 1930: KO in the Second Round / 229 \\
                 39: ZURICH, 1931: Pauli's Dreams / 240 \\
                 40: COPENHAGEN, 1932: Faust in Copenhagen / 256 \\
                 41: BERLIN, 1933: Some Flee; Some Stay / 262 \\
                 42: AMSTERDAM, 1933: A Sad End / 272 \\
                 43: OXFORD, 1935: The Cat That Isn't There / 275 \\
                 44: PRINCETON, 1935: Einstein Puts the World Back in
                 Focus / 283 \\
                 45: GARMISCH, 1936: Dirty Snow / 289 \\
                 46: MOSCOW, 1937: On the Other Side / 293 \\
                 47: BERLIN, 1938: Bursting Nuclei / 298 \\
                 48: THE ATLANTIC, 1939: Terrible News / 306 \\
                 49: COPENHAGEN, 1941: Estrangement / 312 \\
                 50: BERLIN, 1942: No Bomb for Hitler / 316 \\
                 51: STOCKHOLM, 1943: Flight / 319 \\
                 52: PRINCETON, 1943: Einstein Mellows / 324 \\
                 53: ENGLAND, 1945: The Impact of the Explosion / 327
                 \\
                 Epilogue / 335 \\
                 Further Reading / 337 \\
                 Image Credits / 342 \\
                 Index of Names and Places / 343 \\
                 About the Author and About the Translator / 360",
}

@Book{Hutchins:1952:ECA,
  editor =       "Robert Maynard Hutchins",
  title =        "Elements of Chemistry, by {Antoine Laurent Lavoisier};
                 Analytical Theory of Heat, by {Jean Baptiste Joseph
                 Fourier}; Experimental Researches in Electricity, by
                 {Michael Faraday}",
  volume =       "45",
  publisher =    "Encyclopaedia Britannica",
  address =      "Chicago, IL, USA",
  pages =        "xii + 898",
  year =         "1952",
  LCCN =         "????",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Great Books of the Western World",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Hwang:1984:TSP,
  editor =       "Kai Hwang",
  title =        "Tutorial: Supercomputers: Design and Applications",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "viii + 640",
  year =         "1984",
  ISBN =         "0-8186-0581-2",
  ISBN-13 =      "978-0-8186-0581-9",
  LCCN =         "TK 7888.3 H82 1984",
  bibdate =      "Wed Dec 15 10:34:52 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Article{Hyman:1990:LC,
  author =       "Marco S. Hyman",
  title =        "Literate {C++}",
  journal =      j-COMP-LANG-MAG,
  volume =       "7",
  number =       "7",
  pages =        "67--68, 70, 72, 74--77, 79",
  month =        jul,
  year =         "1990",
  CODEN =        "CSAEEU",
  ISSN =         "0749-2839",
  bibdate =      "Wed Aug 31 00:52:14 MDT 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "The author discusses the application of literate
                 programming to object-oriented C++. He develops an Awk
                 preprocessor to store documentation along with source
                 code. The information can be extracted just before
                 compilation. (2 Refs.)",
  acknowledgement = ack-nhfb,
  classification = "C6115 (Programming support); C6140D (High level
                 languages); C6150C (Compilers, interpreters and other
                 processors)",
  keywords =     "Awk preprocessor; Compilation; Literate programming;
                 Object-oriented C++; Source code; Store documentation",
  thesaurus =    "C language; C listings; Object-oriented programming;
                 Program processors; Software tools; System
                 documentation",
}

@Book{IBM:IRP86,
  author =       "{IBM}",
  title =        "{IBM RT} Personal Computer Technology, publication
                 {SA23-1057}",
  publisher =    pub-IBM,
  address =      pub-IBM:adr,
  year =         "1986",
  bibdate =      "Sat Oct 28 08:26:19 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{IBM:IRS90,
  editor =       "Mamata Misra",
  title =        "{IBM RISC} System\slash 6000 Technology, publication
                 {SA23-2619-00}",
  publisher =    pub-IBM,
  address =      pub-IBM:adr,
  year =         "1990",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{IEEE:ITU85,
  author =       "{IEEE}",
  title =        "{IEEE} Trial-Use Standard Specifications for
                 Microprocessor Operating Systems Interfaces",
  publisher =    pub-WILEY-INTERSCIENCE,
  address =      pub-WILEY-INTERSCIENCE:adr,
  pages =        "173",
  year =         "1985",
  ISBN =         "0-471-01073-1",
  ISBN-13 =      "978-0-471-01073-9",
  LCCN =         "QA76.5 .I23 1985",
  bibdate =      "Sat Oct 28 08:26:25 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "IEEE {Std}. 855.",
  acknowledgement = ack-nhfb,
}

@Book{IEEE:ITU86,
  author =       "{IEEE}",
  title =        "{IEEE} Trial-Use Standard Portable Operating System
                 for Computer Environments",
  publisher =    pub-WILEY-INTERSCIENCE,
  address =      pub-WILEY-INTERSCIENCE:adr,
  edition =      "{IEEE Std} 1003.1",
  pages =        "207",
  month =        apr,
  year =         "1986",
  ISBN =         "0-471-85027-6",
  ISBN-13 =      "978-0-471-85027-4",
  LCCN =         "TK 275 I5 Std 1003.1",
  bibdate =      "Sat Oct 28 08:26:29 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Manual{IEEE:p754,
  author =       "{IEEE Task P754}",
  title =        "{ANSI}\slash {IEEE} 754-1985, Standard for Binary
                 Floating-Point Arithmetic",
  organization = "IEEE, New York, NY, USA",
  month =        aug # " 12",
  year =         "1985",
  bibdate =      "Sat Oct 28 08:26:33 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "A preliminary draft was published in the January 1980
                 issue of IEEE Computer, together with several companion
                 articles
                 \cite{Cody:fps-analysis,Coonen:ufl-denorm,Coonen:fps-guide,Coonen:fps-guide-errata,Hough:fps-applications,Stevenson:COMPUTER-14-3-51}.
                 Available from the IEEE Service Center, Piscataway, NJ,
                 USA.",
  acknowledgement = ack-nhfb,
}

@Book{Ifrah:2000:UHN,
  author =       "Georges Ifrah",
  title =        "The Universal History of Numbers from Prehistory to
                 the Invention of the Computer",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xxii + 633",
  year =         "2000",
  ISBN =         "0-471-37568-3, 0-471-39340-1, 0-471-39671-0,
                 0-9650455-0-1",
  ISBN-13 =      "978-0-471-37568-5, 978-0-471-39340-5,
                 978-0-471-39671-0, 978-0-9650455-0-6",
  LCCN =         "QA141.I3713 2000",
  bibdate =      "Mon Dec 06 16:02:33 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Translated from the French edition, {\em Histoire
                 universelle des chiffres}, by David Bellos, E. F.
                 Harding, Sophie Wood, and Ian Monk.",
  price =        "US\$39.95",
  abstract =     "Chronicles the history of counting and calculating
                 from the time of cave dwellers to the late twentieth
                 century, examining how different cultures used numbers
                 to solve basic problems related to their everyday
                 needs.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Explaining the origins: ethnological and
                 psychological approaches to the sources of numbers \\
                 Base numbers and the birth of number systems \\
                 The earliest calculating machine-- the hand \\
                 How Cro-Magnon Man counted \\
                 Tally sticks: accounting for beginners \\
                 Numbers on strings \\
                 Number, value and money \\
                 Numbers of Sumer \\
                 The enigma of the sexagesimal base \\
                 The development of written numerals in Elam and
                 Mesopotamia \\
                 The decipherment of a five-thousand-year-old system \\
                 How the Sumerians did their sums \\
                 Mesopotamian numbering after the eclipse of Sumer \\
                 The numbers of ancient Egypt \\
                 Counting in the times of the Cretan and Hittite kings
                 \\
                 Greek and Roman numerals \\
                 Letters and numbers \\
                 The invention of alphabetic numerals \\
                 Other alphabetic number-systems \\
                 Magic, mysticism, divination, and other secrets \\
                 The numbers of Chinese civilisation \\
                 The amazing achievements of the Maya \\
                 The final state of numerical notation \\
                 Indian civilisation: the cradle of modern numerals \\
                 Dictionary of the numeral symbols of Indian
                 civilisation \\
                 Indian numerals and calculation in the Islamic world
                 \\
                 The slow progress of Indo-Arabic numerals in Western
                 Europe \\
                 Beyond perfection",
}

@Book{Impey:2019:EML,
  author =       "Chris Impey",
  title =        "{Einstein}'s Monsters: the Life and Times of Black
                 Holes",
  publisher =    pub-NORTON,
  address =      pub-NORTON:adr,
  pages =        "xix + 295",
  year =         "2019",
  ISBN =         "1-324-00093-7 (hardcover), 1-324-00094-5 (e-book)",
  ISBN-13 =      "978-1-324-00093-8 (hardcover), 978-1-324-00094-5
                 (e-book)",
  LCCN =         "QB843.B55 I47 2019",
  bibdate =      "Tue Nov 20 10:56:46 MST 2018",
  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 =     "The astonishing science of black holes and their role
                 in understanding the history and future of our
                 universe. Black holes are the most extreme objects in
                 the universe, and yet they are ubiquitous. Every
                 massive star leaves behind a black hole when it dies,
                 and every galaxy harbors a supermassive black hole at
                 its center. Frighteningly enigmatic, these dark giants
                 continue to astound even the scientists who spend their
                 careers studying them. Which came first, the galaxy or
                 its central black hole? What happens if you travel into
                 one --- instant death or something weirder? And,
                 perhaps most important, how can we ever know anything
                 for sure about black holes when they destroy
                 information by their very nature? In [this book],
                 distinguished astronomer Chris Impey takes readers on
                 an exploration of these and other questions at the
                 cutting edge of astrophysics, as well as the history of
                 black holes' role in theoretical physics --- from
                 confirming Einstein's equations for general relativity
                 to testing string theory. He blends this history with a
                 poignant account of the phenomena scientists have
                 witnessed while observing black holes: stars swarming
                 like bees around the center of our galaxy; black holes
                 performing gravitational waltzes with visible stars;
                 the cymbal clash of two black holes colliding,
                 releasing ripples in space--time. Clear, compelling,
                 and profound, \booktitle{Einstein's Monsters} reveals
                 how our comprehension of black holes is intrinsically
                 linked to how we make sense of the universe and our
                 place within it. From the small questions to the big
                 ones --- from the tiniest particles to the nature of
                 space--time itself --- black holes might be the key to
                 a deeper understanding of the cosmos.",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "Part A: Evidence for black holes, large and
                 small \\
                 1: The heart of darkness \\
                 2: Black holes from star death \\
                 3: Supermassive black holes \\
                 4: Gravitational engines \\
                 Part B: Black holes, past, present, and future \\
                 5: The lives of black holes \\
                 6: Black holes as tests of gravity \\
                 7: Seeing with gravity eyes \\
                 8: The fate of black holes",
  subject =      "Black holes (Astronomy); Popular works; Gravitation",
  tableofcontents = "Acknowledgments / xv \\
                 Foreword / xvii \\
                 Part A: Evidence for Black Holes, Large and Small / 1
                 \\
                 1: The Heart of Darkness / 3 \\
                 An English Clergyman Imagines Dark Stars / 3 \\
                 A Great French Mathematician Weighs In / 5 \\
                 Understanding the Fabric of Space-Time / 7 \\
                 A Singularity and a Life Cut Short / 12 \\
                 The Master of Implosions and Explosions / 14 \\
                 Coining the Perfect Term for the Inscrutable / 16 \\
                 A Genius Struggles with Gravity and Disease / 18 \\
                 Betting on Black Holes / 23 \\
                 The Golden Age of Black Hole Theory / 26 \\
                 2: Black Holes from Star Death / 30 \\
                 The Forces of Light and Darkness / 30 \\
                 Gravity and Darkness Are the Final Victors / 33 \\
                 Finding the First Black Swan / 38 \\
                 Weighing the Invisible Dance Partner / 40 \\
                 Black Holes with Gold-Plated Credentials / 43 \\
                 Using Gravitational Optics / 47 \\
                 Physics at the Edge of the Maelstrom / 50 \\
                 A Tour of the Binary Star Bestiary / 54 \\
                 3: Supermassive Black Holes / 57 \\
                 The Only Radio Astronomer in the World / 57 \\
                 Galaxies with Bright Nuclei / 61 \\
                 Radio Astronomy Comes of Age / 62 \\
                 A Dutch Astronomer Discovers Quasars / 68 \\
                 Astronomers Harvest Distant Points of Light / 71 \\
                 Hypothesizing Massive Black Holes / 74 \\
                 Mapping Radio Jets and Lobes / 77 \\
                 The Zoo of Active Galaxies / 81 \\
                 A Matter of Perspective / 85 \\
                 4: Gravitational Engines / 88 \\
                 The Big Black Hole Next Door / 89 \\
                 Stars at the Edge of the Abyss / 93 \\
                 The Dark Core in Every Galaxy / 95 \\
                 Baron Rees of Ludlow Tames the Beast / 100 \\
                 Using Quasars to Probe the Universe / 103 \\
                 Weighing Black Holes by the Thousand / 106 \\
                 Accretion Power in the Cosmos / 113 \\
                 Massive Black Holes Are Not Scary / 116 \\
                 Part B: Black Holes Past, Present, and Future / 121 \\
                 5: The Lives of Black Holes / 123 \\
                 Seeds of the Universe / 123 \\
                 First Light and First Darkness / 125 \\
                 Black Hole Birth by Stellar Cataclysm / 129 \\
                 Finding the Missing Links / 133 \\
                 Simulating Extreme Gravity in a Computer / 137 \\
                 How Black Holes and Galaxies Grow / 143 \\
                 The Universe as a Black Hole / 148 \\
                 Making Black Holes in the Lab / 150 \\
                 6: Black Holes as Tests of Gravity / 153 \\
                 Gravity from Newton to Einstein and Beyond / 154 \\
                 What Black Holes Do to Space-Time / 158 \\
                 How Black Holes Affect Radiation / 162 \\
                 Inside the Iron Curtain / 166 \\
                 X-Rays Flickering Near the Abyss / 168 \\
                 When a Black Hole Eats a Star / 171 \\
                 Taking a Black Hole for a Spin / 174 \\
                 The Event Horizon Telescope / 177 \\
                 7: Seeing with Gravity Eyes / 181 \\
                 A New Way of Seeing the Universe / 181 \\
                 Ripples in Space-Time / 185 \\
                 An Eccentric Millionaire and a Solitary Engineer / 188
                 \\
                 When Black Holes Collide / 194 \\
                 The Most Precise Machine Ever Built / 197 \\
                 Meet the Maestro of Gravity / 204 \\
                 Viewing the Universe with Gravity Eyes / 207 \\
                 Collisions and Mergers of Massive Black Holes / 213 \\
                 Gravity and the Big Bang / 216 \\
                 8: The Fate of Black Holes / 219 \\
                 The New Age of Gravity / 219 \\
                 Quasar on Our Doorstep / 224 \\
                 Merging with Andromeda / 227 \\
                 The Biggest Black Holes in the Universe / 230 \\
                 The Era of Stellar Corpses / 234 \\
                 A Future of Evaporation and Decay / 236 \\
                 Living with Black Holes / 239 \\
                 Notes / 245 \\
                 Index / 283",
}

@Book{Intel:286-hrm,
  author =       "Intel",
  title =        "The {iAPX} 286 Hardware Reference Manual",
  publisher =    pub-INTEL,
  address =      pub-INTEL:adr,
  year =         "1983",
  LCCN =         "QA76.8.I264 I14 1983",
  bibdate =      "Wed Feb 9 09:02:53 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "The definitive statement of the 80286 and 80287
                 hardware at a strongly technical level. Not an
                 instruction set reference, but does contain instruction
                 timing tables. See also \cite{Intel:286-prm}.",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Intel:286-prm,
  author =       "Intel",
  title =        "The {iAPX} 286 Programmer's Reference Manual",
  publisher =    pub-INTEL,
  address =      pub-INTEL:adr,
  year =         "1985",
  bibdate =      "Sun May 02 07:49:01 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "The definitive statement of what the 80286 and 80287
                 are. A valuable reference for instruction definitions.
                 See also
                 \cite{Intel:286-hrm,Morse:80286,Palmer:8087}.",
  acknowledgement = ack-nhfb,
}

@Book{Intel:386-hrm,
  author =       "Intel",
  title =        "80386 Hardware Reference Manual",
  publisher =    pub-INTEL,
  address =      pub-INTEL:adr,
  year =         "1987",
  ISBN =         "1-55512-069-5",
  ISBN-13 =      "978-1-55512-069-6",
  LCCN =         "TK7895.M5 E33 1986",
  bibdate =      "Wed Dec 15 10:35:07 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "The definitive statement of the 80386 and 80387
                 hardware at a strongly technical level. Not an
                 instruction set reference, but does contain instruction
                 timing tables. See also \cite{Intel:386-prm}.",
  acknowledgement = ack-nhfb,
}

@Book{Intel:386-prm,
  author =       "Intel",
  title =        "80386 Programmer's Reference Manual",
  publisher =    pub-INTEL,
  address =      pub-INTEL:adr,
  year =         "1986",
  ISBN =         "1-55512-022-9",
  ISBN-13 =      "978-1-55512-022-1",
  LCCN =         "QA76.8.I2928 E5 1986",
  bibdate =      "Wed Dec 15 10:35:16 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "The definitive statement of what the 80386 and 80387
                 are. A valuable reference for instruction definitions.
                 See also \cite{Intel:386-hrm}.",
  acknowledgement = ack-nhfb,
}

@Book{Intel:860-hrm,
  author =       "Intel",
  title =        "i860 64-bit Microprocessor Hardware Reference Manual",
  publisher =    pub-INTEL,
  address =      pub-INTEL:adr,
  year =         "1990",
  ISBN =         "1-55512-106-3",
  ISBN-13 =      "978-1-55512-106-8",
  LCCN =         "TK7895.M5 I57662 1990",
  bibdate =      "Wed Dec 15 10:35:21 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Intel:860-prm,
  author =       "Intel",
  title =        "i860 64-bit Microprocessor Family Programmer's
                 Reference Manual",
  publisher =    pub-INTEL,
  address =      pub-INTEL:adr,
  year =         "1991",
  ISBN =         "1-55512-135-7",
  ISBN-13 =      "978-1-55512-135-8",
  LCCN =         "QA76.8.I57 I44 1991",
  bibdate =      "Wed Dec 15 10:35:26 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Intel:II85,
  author =       "Intel",
  title =        "Introduction to the {iAPX} 286",
  publisher =    pub-INTEL,
  address =      pub-INTEL:adr,
  year =         "1985",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Intel:OSW83,
  author =       "Intel",
  title =        "{iAPX} 286 Operating Systems Writer's Guide",
  publisher =    pub-INTEL,
  address =      pub-INTEL:adr,
  year =         "1983",
  LCCN =         "TK7874 .I56 198",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{IPA:1999:HIP,
  author =       "{International Phonetic Association}",
  title =        "Handbook of the {International Phonetic Association}:
                 {A} Guide to the Use of the {International Phonetic
                 Alphabet}",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "viii + 204",
  month =        aug,
  year =         "1999",
  ISBN =         "0-521-63751-1 (paperback), 0-521-65236-7 (hardcover)",
  ISBN-13 =      "978-0-521-63751-0 (paperback), 978-0-521-65236-0
                 (hardcover)",
  LCCN =         "P227 .I52 1999",
  bibdate =      "Mon May 01 11:21:18 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$17.95",
  abstract =     "A comprehensive guide to the international phonetic
                 alphabet, whose aim is to provide a universally agreed
                 system of notation for the sounds of languages, and
                 which has been widely used for over a century. The
                 handbook presents the basics of phonetic analysis so
                 that the principles underlying the alphabet can be
                 readily understood, and gives examples of the use of
                 each of the phonetic symbols. The application of the
                 alphabet is then demonstrated in nearly 30
                 illustrations --- concise analyses of the sound systems
                 of a range of languages, each of them accompanied by a
                 phonetic transcription of a passage of speech. The
                 handbook also includes the extensions to the alphabet,
                 covering speech sounds beyond the sound-systems of
                 languages, and a listing of the internationally agreed
                 computer codings for phonetic symbols. It should be a
                 useful reference work for all those involved in the
                 analysis of speech. A guide to the international
                 phonetic alphabet, whose aim is to provide a
                 universally agreed system of notation for the sounds of
                 languages. The text presents the basics of phonetic
                 analysis in order to understand the underlying
                 principles, and gives examples of the uses of the
                 phonetic symbols.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "Part 1: Introduction to the IPA \\
                 1: What is the International Phonetic Alphabet? \\
                 2: Phonetic description and the IPA Chart \\
                 3: Guide to IPA notation \\
                 4: The phonemic principle \\
                 5: Broad and narrow transcriptions \\
                 6: IPA transcriptions for a language \\
                 7: Working with the IPA \\
                 8: Going beyond the IPA \\
                 9: Some problematic issues \\
                 10: The IPA and phonological theory \\
                 Part 2: Illustrations of the IPA \\
                 American English \\
                 Amharic \\
                 Arabic \\
                 Bulgarian \\
                 Cantonese \\
                 Catalan \\
                 Croatian \\
                 Czech \\
                 Dutch \\
                 French \\
                 Galician \\
                 German \\
                 Hausa \\
                 Hebrew \\
                 Hindi \\
                 Hungarian \\
                 Igbo \\
                 Irish \\
                 Japanese \\
                 Korean \\
                 Persian (Farsi) \\
                 Portuguese \\
                 Sindhi \\
                 Slovene \\
                 Swedish \\
                 Taba \\
                 Thai \\
                 Tukang Besi \\
                 Turkish \\
                 Part 3: Appendices \\
                 Appendix 1: The Principles of the International
                 Phonetic Association \\
                 Appendix 2: Computer coding of IPA symbols \\
                 Appendix 3: Extensions to the IPA \\
                 Appendix 4: About the International Phonetic
                 Association \\
                 Appendix 5: Reference charts",
}

@Book{Isaacson:2007:EHL,
  author =       "Walter Isaacson",
  title =        "{Einstein}: his life and universe",
  publisher =    pub-SIMON-SCHUSTER,
  address =      pub-SIMON-SCHUSTER:adr,
  pages =        "xxii + 675 + 16",
  year =         "2007",
  ISBN =         "0-7432-6473-8",
  ISBN-13 =      "978-0-7432-6473-0",
  LCCN =         "QC16.E5 I76 2007",
  bibdate =      "Tue Apr 17 09:37:45 MDT 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 melvyl.cdlib.org:210/CDL90",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0708/2006051264-d.html",
  acknowledgement = ack-nhfb,
  remark =       "This book received a three-page review in the 16 April
                 2007 issue of Newsweek magazine.",
  subject =      "Einstein, Albert; Friends and associates; Physicists;
                 Biography; Relativity (Physics); Unified field
                 theories",
  subject-dates = "Albert Einstein (1879--1955)",
  tableofcontents = "The light-beam rider \\
                 Childhood, 1879--1896 \\
                 The Zurich Polytechnic, 1896--1900 \\
                 The lovers, 1900--1904 \\
                 The miracle year: quanta and molecules, 1905 \\
                 Special relativity, 1905 \\
                 The happiest thought, 1906--1909 \\
                 The wandering professor, 1909--1914 \\
                 General relativity, 1911--1915 \\
                 Divorce, 1916--1919 \\
                 Einstein's universe, 1916--1919 \\
                 Fame, 1919 \\
                 The wandering zionist, 1920--1921 \\
                 Nobel laureate, 1921--1927 \\
                 Unified field theories, 1923--1931 \\
                 Turning fifty, 1929--1931 \\
                 Einstein's god \\
                 The refugee, 1932--1933 \\
                 America, 1933--1939 \\
                 Quantum entanglement, 1935 \\
                 The bomb, 1939--1945 \\
                 One-worlder, 1945--1948 \\
                 Landmark, 1948--1953 \\
                 Red scare, 1951--1954 \\
                 The end, 1955 \\
                 Epilogue: Einstein's brain and Einstein's mind",
}

@Book{Isaacson:2014:IHG,
  author =       "Walter Isaacson",
  title =        "The Innovators: How a Group of Hackers, Geniuses and
                 Geeks Created the Digital Revolution",
  publisher =    pub-SIMON-SCHUSTER,
  address =      pub-SIMON-SCHUSTER:adr,
  pages =        "viii + 542",
  year =         "2014",
  ISBN =         "1-4711-3879-8 (hardcover), 1-4767-0869-X (cloth),
                 1-4711-3897-6 (paperback), 1-4104-7497-6 (cloth),
                 1-4767-0870-3",
  ISBN-13 =      "978-1-4711-3879-9 (hardcover), 978-1-4767-0869-0
                 (cloth), 978-1-4711-3897-3 (paperback),
                 978-1-4104-7497-1 (cloth), 978-1-4767-0870-6",
  LCCN =         "QA76.2.A2",
  bibdate =      "Wed Jan 28 21:35:36 MST 2015",
  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/l/lovelace-ada-augusta.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.bib;
                 https://www.math.utah.edu/pub/tex/bib/adabooks.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "\booktitle{The Innovators} is Walter Isaacson's
                 revealing story of the people who created the computer
                 and the Internet. It is also a history of the digital
                 revolution and a guide to how innovation really
                 happens. What were the talents that allowed certain
                 inventors and entrepreneurs to turn their visionary
                 ideas into disruptive realities? What led to their
                 creative leaps? Why did some succeed and others fail?
                 Isaacson begins with Ada Lovelace, Lord Byron's
                 daughter, who pioneered computer programming in the
                 1840s. He explores the fascinating personalities that
                 created our current digital revolution, such as
                 Vannevar Bush, Alan Turing, John von Neumann, J. C. R.
                 Licklider, Doug Engelbart, Robert Noyce, Bill Gates,
                 Steve Wozniak, Steve Jobs, Tim Berners-Lee, and Larry
                 Page. This is the story of how their minds worked and
                 what made them so inventive. It's also a narrative of
                 how their ability to collaborate and master the art of
                 teamwork made them even more creative. For an era that
                 seeks to foster innovation, creativity, and teamwork,
                 \booktitle{The Innovators} shows how they happen",
  acknowledgement = ack-nhfb,
  subject =      "Lovelace, Ada King; Countess of; Babbage, Charles;
                 Bush, Vannevar; Eckert, John Presper; Licklider, J. C.
                 R; Mauchly, John William; Noyce, Robert Norton;
                 Roberts, Lawrence G; Shockley, William; Computer
                 scientists; Biography; Computer science; History;
                 Internet; Creative ability in technology",
  subject-dates = "1815--1852; 1791--1871; 1890--1974; 1919--1995;
                 1907--1980; 1927--1990; 1910--1989",
  tableofcontents = "Illustrated Timeline / x \\
                 Introduction / 1 \\
                 Ada, Countess of Lovelace / 7 \\
                 The computer / 35 \\
                 Programming / 82 \\
                 The transistor / 131 \\
                 The microchip / 171 \\
                 Video games / 201 \\
                 The Internet / 212 \\
                 The personal computer / 263 \\
                 Software / 313 \\
                 Online / 383 \\
                 The Web / 405 \\
                 Ada forever / 467 \\
                 Acknowledgments / 491 \\
                 Notes / 493 \\
                 Photo Credits / 525 \\
                 Index / 529",
}

@Manual{ISO:pascal,
  title =        "Specification for Computer Programming Language
                 {Pascal}, {ISO} 7185-1982",
  organization = pub-ISO,
  address =      pub-ISO:adr,
  year =         "1982",
  bibdate =      "Sat Apr 29 15:50:08 1995",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Jackson:1962:CE,
  author =       "John David Jackson",
  title =        "Classical Electrodynamics",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xvii + 641",
  year =         "1962",
  LCCN =         "QC670 .J2",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/f/fermi-enrico.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Jackson:2017:EBV,
  author =       "Tom Jackson",
  title =        "The Elements Book: a Visual Encyclopedia of the
                 Periodic Table",
  publisher =    "DK Publishing",
  address =      "New York, NY, USA",
  pages =        "208",
  year =         "2017",
  ISBN =         "1-4654-5660-0 (hardcover)",
  ISBN-13 =      "978-1-4654-5660-1 (hardcover)",
  LCCN =         "QD466 .J335 2017",
  bibdate =      "Tue Jul 8 18:13:20 MDT 2025",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Profiles every element on the periodic table and
                 describes their properties, when they were discovered,
                 and how they are used in household materials.",
  acknowledgement = ack-nhfb,
  author-dates = "1972--",
  libnote =      "Not yet in my library.",
  tableofcontents = "Elemental building blocks \\
                 Chemical discoveries \\
                 Inside an atom \\
                 Periodic table of elements \\
                 Reactions and uses \\
                 Hydrogen \\
                 Alkali metals \\
                 Alkaline earth metals \\
                 Transition metals \\
                 Lanthanides \\
                 Actinides \\
                 The Boron group \\
                 The Carbon group \\
                 The Nitrogen group \\
                 The Oxygen group \\
                 The Halogen Group \\
                 Noble gases",
}

@Book{Jacob:2008:MSC,
  author =       "Bruce Jacob and Spencer W. Ng and David T. Wang",
  title =        "Memory Systems: Cache, {DRAM}, Disk",
  publisher =    pub-MORGAN-KAUFMANN,
  address =      pub-MORGAN-KAUFMANN:adr,
  pages =        "xxxiv + 982",
  year =         "2008",
  ISBN =         "0-12-379751-9 (paperback)",
  ISBN-13 =      "978-0-12-379751-3 (paperback)",
  LCCN =         "TK7895.M4 J336 2007",
  bibdate =      "Fri Oct 31 09:41:10 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0805/2007282120-d.html",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "Computer storage devices",
  tableofcontents = "Preface: ``It's the memory, stupid!'' \\
                 Overview: on memory systems and their design \\
                 Part I: Cache \\
                 1: An overview of cache principles \\
                 2: Logical organization \\
                 3: Management of cache contents \\
                 4: Management of cache consistency \\
                 5: Implementation issues \\
                 6: Cache case studies \\
                 Part II: DRAM \\
                 7: Overview of DRAMs \\
                 8: DRAM device organization; basic circuits and
                 architecture \\
                 9: DRAM system signaling and timing \\
                 10: DRAM memory system organization \\
                 11: Basic DRAM memory-access protocol \\
                 12: Evolutionary developments of DRAM device
                 architecture \\
                 13: DRAM memory controller \\
                 14: The fully buffered DIMM memory system \\
                 15: Memory system design analysis \\
                 Part III: Disk \\
                 16: Overview of disks \\
                 17: The physical layer \\
                 18: The data layer \\
                 19: Performance issues and design trade-offs \\
                 20: Drive interface \\
                 21: Operational performance improvement \\
                 22: The cache layer \\
                 23: Performance testing \\
                 24: Storage subsystems \\
                 25: Advanced topics \\
                 26: Case study \\
                 Part IV: Cross-cutting issues \\
                 27: The case for holistic design \\
                 28: Analysis of cost and performance \\
                 29: Power and leakage \\
                 30: Memory errors and error correction \\
                 31: Virtual memory",
}

@Book{Jacobsen:2014:OPS,
  author =       "Annie Jacobsen",
  title =        "{Operation Paperclip}: the secret intelligence program
                 to bring {Nazi} scientists to {America}",
  publisher =    pub-LITTLE-BROWN,
  address =      pub-LITTLE-BROWN:adr,
  pages =        "xii + 575 + 16",
  year =         "2014",
  ISBN =         "0-316-22104-X, 0-316-23982-8, 0-316-25169-0 (e-book)",
  ISBN-13 =      "978-0-316-22104-7, 978-0-316-23982-0,
                 978-0-316-25169-3 (e-book)",
  LCCN =         "D810.S2",
  bibdate =      "Tue Jun 3 11:01:11 MDT 2014",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Details how the U.S. government embarked on a covert
                 operation to recruit and employ Nazi scientists in the
                 years following World War II in an effort to prevent
                 their knowledge and expertise from falling into the
                 hands of the Soviet Union.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "World War, 1939--1945; Technology; Brain drain;
                 Germany; History; 20th century; Scientists; Recruiting;
                 United States; Physicians; Nazis; War criminals;
                 Intelligence service; Military research; German
                 Americans; Brain drain; German Americans; Intelligence
                 service; Military research; Nazis; Recruiting;
                 Technology; War criminals",
  tableofcontents = "The war and the weapons \\
                 Destruction \\
                 The hunters and the hunted \\
                 Liberation \\
                 The captured and their interrogators \\
                 Harnessing the chariot of destruction \\
                 Hitler's doctors \\
                 Black, white and gray \\
                 Hitler's chemists \\
                 Hired or hanged \\
                 The ticking clock \\
                 Total war of apocalyptic proportions \\
                 Science at any price \\
                 Strange judgment \\
                 Chemical menace \\
                 Headless monster \\
                 Hall of mirrors \\
                 Downfall \\
                 Truth serum \\
                 In the dark shadows \\
                 Limelight \\
                 Legacy \\
                 What lasts?",
}

@Book{Jaeschke:1989:PCL,
  author =       "Rex Jaeschke",
  title =        "Portability and the {C} Language",
  publisher =    pub-HAYDEN,
  address =      pub-HAYDEN:adr,
  pages =        "xvi + 382",
  year =         "1989",
  ISBN =         "0-672-48428-5",
  ISBN-13 =      "978-0-672-48428-5",
  LCCN =         "QA76.76.C64 J34 1988",
  bibdate =      "Wed Dec 15 10:35:29 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "https://en.wikibooks.org/wiki/Portability_and_the_C_Language",
  acknowledgement = ack-nhfb,
  remark =       "Updated in 2022 and donated to Wikibooks.",
}

@Book{Jaeschke:1991:DSC,
  author =       "Rex Jaeschke",
  title =        "The Dictionary of Standard {C}",
  publisher =    pub-PPB,
  address =      pub-PPB:adr,
  pages =        "x + 165",
  year =         "1991",
  ISBN =         "1-878956-07-8",
  ISBN-13 =      "978-1-878956-07-1",
  LCCN =         "QA76.73.C15 J335 1991",
  bibdate =      "Wed Dec 15 17:47:50 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Jaeschke:1993:CIE,
  author =       "Rex Jaeschke",
  title =        "{C++}: An Introduction for Experienced {C}
                 Programmers",
  publisher =    pub-CBM,
  address =      pub-CBM:adr,
  pages =        "xii + 236",
  year =         "1993",
  ISBN =         "1-878956-27-2",
  ISBN-13 =      "978-1-878956-27-9",
  LCCN =         "QA76.73.C15J3354 1993",
  bibdate =      "Wed Dec 15 10:35:32 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Jaeschke:1996:MSC,
  author =       "Rex Jaeschke",
  title =        "Mastering {Standard C}: a Self-Paced Training Course
                 in Modern {C}",
  publisher =    pub-CBM,
  address =      pub-CBM:adr,
  edition =      "Second",
  pages =        "xvi + 472",
  year =         "1996",
  ISBN =         "1-878956-55-8",
  ISBN-13 =      "978-1-878956-55-2",
  LCCN =         "QA76.73.C15J337 1996",
  bibdate =      "Fri Jun 14 16:14:12 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$40.00",
  acknowledgement = ack-nhfb,
}

@Book{Jaeschke:2001:DSC,
  author =       "Rex Jaeschke",
  title =        "The Dictionary of {Standard C}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "viii + 263",
  year =         "2001",
  ISBN =         "0-13-090620-4",
  ISBN-13 =      "978-0-13-090620-5",
  LCCN =         "QA76.73.C15 J335 2001",
  bibdate =      "Mon Dec 04 18:24:20 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Jaffe:2018:PE,
  author =       "Robert L. Jaffe and Washington {Taylor, IV}",
  title =        "The Physics of Energy",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xxi + 874",
  year =         "2018",
  ISBN =         "1-107-01665-7 (hardcover)",
  ISBN-13 =      "978-1-107-01665-1 (hardcover)",
  LCCN =         "QC28 .J34 2018",
  bibdate =      "Mon Mar 4 08:05:07 MST 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "\booktitle{The Physics of Energy} provides a
                 comprehensive and systematic introduction to the
                 scientific principles governing energy sources, uses,
                 and systems. This definitive textbook traces the flow
                 of energy from sources such as solar power, nuclear
                 power, wind power, water power, and fossil fuels
                 through its transformation in devices such as heat
                 engines and electrical generators, to its uses
                 including transportation, heating, cooling, and other
                 applications. The flow of energy through the Earth's
                 atmosphere and oceans, and systems issues including
                 storage, electric grids, and efficiency and
                 conservation are presented in a scientific context
                 along with topics such as radiation from nuclear power
                 and climate change from the use of fossil fuels.
                 Students, scientists, engineers, energy industry
                 professionals, and concerned citizens with some
                 mathematical and scientific background who wish to
                 understand energy systems and issues quantitatively
                 will find this textbook of great interest. Robert L.
                 Jaffe holds the Morningstar Chair in the Department of
                 Physics at MIT. He was formerly director of MIT's
                 Center for Theoretical Physics and recently chaired the
                 American Physical Society's Panel on Public Affairs.
                 Jaffe is best known for his research on the quark
                 substructure of the proton and other strongly
                 interacting particles, on exotic states of matter, and
                 on the quantum structure of the vacuum. He received his
                 BA from Princeton and his PhD from Stanford. In
                 recognition of his contributions to teaching and course
                 development at MIT, Jaffe has received numerous awards
                 including a prestigious MacVicar Fellowship''",
  acknowledgement = ack-nhfb,
  subject =      "Power resources; Textbooks; Physics; Renewable energy
                 sources; Physics.; Power resources.; Renewable energy
                 sources.",
  tableofcontents = "Mechanical energy \\
                 Electromagnetic energy \\
                 Waves and light \\
                 Thermodynamics I: Heat and thermal energy \\
                 Heat transfer \\
                 Introduction to quantum physics \\
                 Thermodynamics II: Entropy and temperature \\
                 Energy in matter \\
                 Thermal energy conversion \\
                 Internal combustion engines \\
                 Phase change energy conversion \\
                 Thermal power and heat extraction cycles \\
                 The forces of nature \\
                 Quantum phenomena in energy systems \\
                 An overview of nuclear power \\
                 Structure properties and decays of nuclei \\
                 Nuclear energy processes: Fission and fusion \\
                 Nuclear fission reactors and nuclear fusion experiments
                 \\
                 Ionizing radiation \\
                 Energy in the universe \\
                 Solar energy: Solar production and radiation \\
                 Solar energy: Solar radiation on Earth \\
                 Solar thermal energy \\
                 Photovoltaic solar cells \\
                 Biological energy \\
                 Ocean energy flow \\
                 Wind: A highly variable resource \\
                 Fluids: The basics \\
                 Wind turbines \\
                 Energy from moving water: Hydro wave tidal and marine
                 current power \\
                 Geothermal energy \\
                 Fossil fuels \\
                 Energy and climate \\
                 Earth's climate: Past present and future \\
                 Energy efficiency conservation and changing energy
                 sources \\
                 Energy storage \\
                 Electricity generation and transmission",
}

@Book{Jagger:2007:ACS,
  author =       "Jon Jagger and Nigel Perry and Peter Sestoft",
  title =        "Annotated {C\#} standard",
  publisher =    pub-MORGAN-KAUFMANN,
  address =      pub-MORGAN-KAUFMANN:adr,
  pages =        "xxiii + 825",
  year =         "2007",
  ISBN =         "0-12-372511-9",
  ISBN-13 =      "978-0-12-372511-0",
  LCCN =         "QA76.73.C154 J35 2007",
  bibdate =      "Sat Sep 8 16:31:37 MDT 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "C\# (Computer program language)",
  tableofcontents = "1. Scope \\
                 2. Conformance \\
                 3. Normative references \\
                 4. Definitions \\
                 5. Notational conventions \\
                 6. Acronyms and abbreviations \\
                 7. General description \\
                 8. Language overview \\
                 9. Lexical structure \\
                 10. Basic concepts \\
                 11. Types \\
                 12. Variables \\
                 13. Conversions \\
                 14. Expressions \\
                 15. Statements \\
                 16. Namespaces \\
                 17. Classes \\
                 18. Structs \\
                 19. Arrays \\
                 20. Interfaces \\
                 21. Enums \\
                 22. Delegates \\
                 23. Exceptions \\
                 24. Attributes \\
                 25. Generics \\
                 26. Iterators \\
                 27. Unsafe code \\
                 A. Grammar \\
                 B. Portability issues \\
                 C. Naming guidelines \\
                 D. Standard library \\
                 E. Documentation comments \\
                 F. Bibliography",
}

@Book{Jeffers:2013:IXP,
  author =       "Jim Jeffers and James Reinders",
  title =        "{Intel Xeon Phi} coprocessor high-performance
                 programming",
  publisher =    "Morgan Kaufmann\slash Elsevier",
  address =      "Waltham, MA, USA",
  pages =        "xx + 409",
  year =         "2013",
  DOI =          "https://doi.org/10.1016/C2011-0-06997-1",
  ISBN =         "0-12-410414-2 (paperback), 0-12-410494-0 (e-book)",
  ISBN-13 =      "978-0-12-410414-3 (paperback), 978-0-12-410494-5
                 (e-book)",
  LCCN =         "QA76.5 .J44 2013",
  bibdate =      "Sat Jul 27 10:24:43 MDT 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "https://www.sciencedirect.com/book/9780124104143/intel-xeon-phi-coprocessor-high-performance-programming",
  acknowledgement = ack-nhfb,
  subject =      "Coprocessors; Computer programming; High performance
                 computing; Computer programming.; Coprocessors.; High
                 performance computing.",
  tableofcontents = "1: Introduction / 1--22 \\
                 2: High Performance Closed Track Test Drive! / 23--57
                 \\
                 3: A Friendly Country Road Race / 59--81 \\
                 4: Driving Around Town: Optimizing A Real-World Code
                 Example / 83--106 \\
                 5: Lots of Data (Vectors) / 107--164 \\
                 6: Lots of Tasks (not Threads) / 165--188 \\
                 7: Offload / 189--241 \\
                 8: Coprocessor Architecture / 243--268 \\
                 9: Coprocessor System Software / 269--291 \\
                 10: Linux on the Coprocessor / 293--323 \\
                 11: Math Library / 325--342 \\
                 12: MPI / 343--362 \\
                 13: Profiling and Timing / 363--384 \\
                 14: Summary / 385--386 \\
                 Glossary / 387--399 \\
                 Index / 401--409",
}

@Book{Jeffrey:2008:HMF,
  author =       "Alan Jeffrey and Hui-Hui Dai",
  title =        "Handbook of Mathematical Formulas and Integrals",
  publisher =    pub-ELSEVIER-ACADEMIC,
  address =      pub-ELSEVIER-ACADEMIC:adr,
  edition =      "Fourth",
  pages =        "xlv + 541",
  year =         "2008",
  ISBN =         "0-12-374288-9 (paperback), 0-08-055684-1 (e-book)",
  ISBN-13 =      "978-0-12-374288-9 (paperback), 978-0-08-055684-0
                 (e-book)",
  LCCN =         "QA47 .J38 2008",
  bibdate =      "Thu May 8 16:02:52 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/mathcw.bib;
                 melvyl.cdlib.org:210/CDL90",
  URL =          "https://shop.elsevier.com/books/handbook-of-mathematical-formulas-and-integrals/jeffrey/978-0-12-374288-9",
  acknowledgement = ack-nhfb,
  subject =      "mathematics; tables; formulae",
  tableofcontents = "Preface \\
                 Preface to the Fourth Edition \\
                 Notes for Handbook Users \\
                 Index of Special Functions and Notations \\
                 0. Quick Reference List of Frequently Used Data \\
                 1. Numerical, Algebraic, and Analytical Results for
                 Series and Calculus \\
                 2. Functions and Identities \\
                 3. Derivatives of Elementary Functions \\
                 4. Indefinite Integrals of Algebraic Functions \\
                 5. Indefinite Integrals of Exponential Functions \\
                 6. Indefinite Integrals of Logarithmic Functions \\
                 7. Indefinite Integrals of Hyperbolic Functions \\
                 8. Indefinite Integrals Involving Inverse Hyperbolic
                 Functions \\
                 9. Indefinite Integrals of Trigonometric Functions \\
                 10. Indefinite Integrals of Inverse Trigonometric
                 Functions \\
                 11. The Gamma, Beta, Pi, and Psi Functions, and the
                 Incomplete Gamma Functions \\
                 12. Elliptic Integrals and Functions \\
                 13. Probability Distributions and Integrals, and the
                 Error Function \\
                 14. Fresnel Integrals, Sine and Cosine Integrals \\
                 15. Definite Integrals \\
                 16. Different Forms of Fourier Series \\
                 17. Bessel Functions \\
                 18. Orthogonal Polynomials \\
                 19. Laplace Transformation \\
                 20. Fourier Transforms \\
                 21. Numerical Integration \\
                 22. Solutions of Standard Ordinary Differential
                 Equations \\
                 23. Vector Analysis \\
                 24. Systems of Orthogonal Coordinates \\
                 25. Partial Differential Equations and Special
                 Functions \\
                 26. Qualitative Properties of the Heat and Laplace
                 Equation \\
                 27. Solutions of Elliptic, Parabolic, and Hyperbolic
                 Equations \\
                 28. The z-Transform \\
                 29. Numerical Approximation \\
                 30. Conformal Mapping and Boundary Value Problems \\
                 Short Classified Reference List \\
                 Index",
}

@Book{Jenkins:1976:FO,
  author =       "Francis A. Jenkins and Harvey E. White",
  title =        "Fundamentals of Optics",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  edition =      "Fourth",
  pages =        "xx + 746",
  year =         "1976",
  ISBN =         "0-07-032330-5",
  ISBN-13 =      "978-0-07-032330-8",
  LCCN =         "QC355.2.J46 1976",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  subject =      "Optics; Optique; Optics; Optica; Optik;
                 Einf{\"u}hrung; Optics and Photonics; Einf{\"u}hrung;
                 Optik",
  tableofcontents = "Part I. Geometrical optics \\
                 1: Properties of light \\
                 2: Plane surfaces and prisms \\
                 3: Spherical surfaces \\
                 4: Thin lenses \\
                 5: Thick lenses \\
                 6: Spherical mirrors \\
                 7: The effects of stops \\
                 8: Ray tracing \\
                 9: Lens aberrations \\
                 10: Optical instruments \\
                 Part II. Wave optics \\
                 11: Vibrations and waves \\
                 12: The superposition of waves \\
                 13: Interference of two beams of light \\
                 14: Interference involving multiple reflections \\
                 15: Fraunhofer diffraction by a single opening \\
                 16: The double slit \\
                 17: The diffraction grating \\
                 18: Fresnel diffraction \\
                 19: The speed of light \\
                 20: The electromagnetic character of light \\
                 21: Sources of light and their spectra \\
                 22: Absorption and scattering \\
                 23: Dispersion \\
                 24: The polarization of light \\
                 25: Reflection \\
                 26: Double refraction \\
                 27: Interference of polarized light \\
                 28: Optical activity and modern wave optics \\
                 Part III. Quantum optics \\
                 29: Light quanta and their origin \\
                 30: Lasers \\
                 31: Holography \\
                 32: Magneto-optics and electro-optics \\
                 33: The dual nature of light \\
                 Appendix 1: The physical constants \\
                 Appendix 2: Electron subshells \\
                 Appendix 3: Refractive indices and dispersions for
                 optical glasses \\
                 Appendix 4: Refractive indices and dispersions of
                 optical crystals \\
                 Appendix 5: The most intense Fraunhofer lines \\
                 Appendix 6: Abbreviated number system \\
                 Appendix 7: Significant figures",
}

@Book{Jenks:1992:ASC,
  author =       "Richard D. Jenks and Robert S. Sutor",
  title =        "{AXIOM}: The Scientific Computation System",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xxiv + 742",
  year =         "1992",
  DOI =          "https://doi.org/10.1007/978-1-4612-2940-7",
  ISBN =         "0-387-97855-0 (New York), 3-540-97855-0 (Berlin)",
  ISBN-13 =      "978-0-387-97855-0 (New York), 978-3-540-97855-8
                 (Berlin)",
  LCCN =         "QA76.95.J46 1992",
  MRclass =      "68Q40 (68-04 68N15)",
  MRnumber =     "95k:68089",
  MRreviewer =   "P. D. F. Ion",
  bibdate =      "Fri Dec 29 18:16:15 1995",
  bibsource =    "/usr/local/src/bib/bibliography/Theory/Comp.Alg.bib;
                 https://www.math.utah.edu/pub/tex/bib/axiom.bib;
                 https://www.math.utah.edu/pub/tex/bib/maple-extract.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://link.springer.com/10.1007/978-1-4612-2940-7",
  ZMnumber =     "0758.68010",
  abstract =     "Recent advances in hardware performance and software
                 technology have made possible a wholly different
                 approach to computational mathematics. Symbolic
                 computation systems have revolutionized the field,
                 building upon established and recent mathematical
                 theory to open new possibilities in virtually every
                 industry. Formerly dubbed Scratchpad, AXIOM is a
                 powerful new symbolic and numerical system developed at
                 the IBM Thomas J. Watson Research Center. AXIOM's
                 scope, structure, and organization make it outstanding
                 among computer algebra systems. AXIOM: The Scientific
                 Computation System is a companion to the AXIOM system.
                 The text is written in a straightforward style and
                 begins with a spirited foreword by David and Gregory
                 Chudnovsky. The book gives the reader a technical
                 introduction to AXIOM, interacts with the system's
                 tutorial, accesses algorithms newly developed by the
                 symbolic computation community, and presents advanced
                 programming and problem solving techniques. Eighty
                 illustrations and eight pages of color inserts
                 accompany text detailing methods used in the 2D and 3D
                 interactive graphics system, and over 2500 example
                 input lines help the reader solve formerly intractable
                 problems.",
  acknowledgement = ack-nhfb,
  subject =      "Axiom (Computer file); Axiom (Computer file);
                 Mathematics; Data processing; Mathematics; Data
                 processing.; AXIOM (computerprogramma); Mathematics.;
                 Physical Sciences and Mathematics.; Mathematical
                 Theory.",
  tableofcontents = "Foreword / David V. Chudnovsky and Gregory V.
                 Chudnovsky / vii \\
                 Contributors Introduction to AXIOM / 1 \\
                 A Technical Introduction to AXIOM / 9 \\
                 I Basic Features of AXIOM / 17 \\
                 1 An Overview of AXIOM / 19 \\
                 1.1 Starting Up and Winding Down / 19 \\
                 1.2 Typographic Conventions 2 / 1 \\
                 1.3 The AXIOM Language 2 / 2 \\
                 1.4 Graphics / 28 \\
                 1.5 Numbers / 29 \\
                 1.6 Data Structures / 33 \\
                 1.7 Expanding to Higher Dimensions / 38 \\
                 1.8 Writing Your Own Functions / 39 \\
                 1.9 Polynomials / 43 \\
                 1.10 Limits / 44 \\
                 1.11 Series / 45 \\
                 1.12 Derivatives / 47 \\
                 1.13 Integration / 49 \\
                 1.14 Differential Equations / 52 \\
                 1.15 Solution of Equations / 53 \\
                 1.16 System Commands / 55 \\
                 2 Using Types and Modes / 59 \\
                 2.1 The Basic Idea / 59 \\
                 2.2 Writing Types and Modes / 66 \\
                 2.3 Declarations / 69 \\
                 2.4 Records / 71 \\
                 2.5 Unions / 73 \\
                 2.6 The ``Any'' Domain / 77 \\
                 2.7 Conversion / 78 \\
                 2.8 Subdomains Again / 80 \\
                 2.9 Package Calling and Target Types / 83 \\
                 2.10 Resolving Types / 86 \\
                 2.11 Exposing Domains and Packages / 87 \\
                 2.12 Commands for Snooping / 89 \\
                 3 Using HyperDoc / 93 \\
                 3.1 Headings / 94 \\
                 3.2 Scroll Bars / 94 \\
                 3.3 Input Areas / 95 \\
                 3.4 Buttons / 96 \\
                 3.5 Search Strings / 96 \\
                 3.6 Example Pages / 97 \\
                 3.7 X Window Resources for HyperDoc / 97 \\
                 4 Input Files and Output Styles / 99 \\
                 4.1 Input Files / 99 \\
                 4.2 The axiom.input File / 100 \\
                 4.3 Common Features of Using Output Formats / 101 \\
                 4.4 Monospace Two-Dimensional Mathematical Format / 102
                 \\
                 4.5 TeX Format / 103 \\
                 4.6 IBM Script Formula Format / 104 \\
                 4.7 FORTRAN Format / 104 \\
                 5 Introduction to the AXIOM Interactive Language / 109
                 \\
                 5.1 Immediate and Delayed Assignments / 109 \\
                 5.2 Blocks 11 / 2 \\
                 5.3 if-then-else 11 / 5 \\
                 5.4 Loops / 117 \\
                 5.5 Creating Lists and Streams with Iterators / 130 \\
                 5.6 An Example: Streams of Primes / 132 \\
                 6 User-Defined Functions, Macros and Rules / 135 \\
                 6.1 Functions vs. Macros / 135 \\
                 6.2 Macros / 136 \\
                 6.3 Introduction to Functions / 138 \\
                 6.4 Declaring the Type of Functions / 140 \\
                 6.5 One-Line Functions / 141 \\
                 6.6 Declared vs. Undeclared Functions / 142 \\
                 6.7 Functions vs. Operations / 143 \\
                 6.8 Delayed Assignments vs. Functions with No Arguments
                 / 144 \\
                 6.9 How AXIOM Determines What Function to Use / 145 \\
                 6.10 Compiling vs. Interpreting / 146 \\
                 6.11 Piece-Wise Function Definitions / 148 \\
                 6.12 Caching Previously Computed Results / 153 \\
                 6.13 Recurrence Relations / 155 \\
                 6.14 Making Functions from Objects / 157 \\
                 6.15 Functions Defined with Blocks / 159 \\
                 6.16 Free and Local Variables / 162 \\
                 6.17 Anonymous Functions / 165 \\
                 6.18 Example: A Database / 168 \\
                 6.19 Example: A Famous Triangle / 170 \\
                 6.20 Example: Testing for Palindromes / 171 \\
                 6.21 Rules and Pattern Matching / 173 \\
                 7 Graphics / 179 \\
                 7.1 Two-Dimensional Graphics / 180 \\
                 7.2 Three-Dimensional Graphics / 196 \\
                 II Advanced Problem Solving and Examples / 225 \\
                 8 Advanced Problem Solving / 227 \\
                 8.1 Numeric Functions / 227 \\
                 8.2 Polynomial Factorization / 236 \\
                 8.3 Manipulating Symbolic Roots of a Polynomial / 239
                 \\
                 8.4 Computation of Eigenvalues and Eigenvectors / 241
                 \\
                 8.5 Solution of Linear and Polynomial Equations / 244
                 \\
                 8.6 Limits / 249 \\
                 8.7 Laplace Transforms 25 / 1 \\
                 8.8 Integration / 252 \\
                 8.9 Working with Power Series / 255 \\
                 8.10 Solution of Differential Equations / 269 \\
                 8.11 Finite Fields / 276 \\
                 8.12 Primary Decomposition of Ideals / 294 \\
                 8.13 Computation of Galois Groups / 296 \\
                 8.14 Non-Associative Algebras and Modelling Genetic
                 Laws / 303 \\
                 9 Some Examples of Domains and Packages / 309 \\
                 9.1 AssociationList / 309 \\
                 9.2 BalancedBinaryTree 31 / 1 \\
                 9.3 BinaryExpansion / 312 \\
                 9.4 BinarySearchTree / 313 \\
                 9.5 CardinalNumber / 315 \\
                 9.6 CartesianTensor / 317 \\
                 9.7 Character / 325 \\
                 9.8 CharacterClass / 326 \\
                 9.9 CliffordAlgebra / 328 \\
                 9.10 Complex / 333 \\
                 9.11 ContinuedFraction / 335 \\
                 9.12 CycleIndicators / 339 \\
                 9.13 DeRhamComplex / 346 \\
                 9.14 DecimalExpansion / 350 \\
                 9.15 DistributedMultivariatePolynomial / 352 \\
                 9.16 EqTable / 353 \\
                 9.17 Equation / 354 \\
                 9.18 Exit / 355 \\
                 9.19 Factored / 356 \\
                 9.20 FactoredFunctions2 / 361 \\
                 9.21 File / 362 \\
                 9.22 FileName / 364 \\
                 9.23 FlexibleArray / 366 \\
                 9.24 Float / 368 \\
                 9.25 Fraction / 373 \\
                 9.26 GeneralSparseTable / 375 \\
                 9.27 GroebnerFactorizationPackage / 376 \\
                 9.28 Heap / 378 \\
                 9.29 HexadecimalExpansion / 379 \\
                 9.30 Integer / 380 \\
                 9.31 IntegerLinearDependence / 385 \\
                 9.32 IntegerNumberTheoryFunctions / 387 \\
                 9.33 KeyedAccessFile / 390 \\
                 9.34 Library / 393 \\
                 9.35 LinearOrdinaryDifferentialOperator / 394 \\
                 9.36 List / 404 \\
                 9.37 MakeFunction / 409 \\
                 9.38 MappingPackage / 411 \\
                 9.39 Matrix / 414 \\
                 9.40 MultiSet / 420 \\
                 9.41 MultivariatePolynomial 42 / 1 \\
                 9.42 None / 423 \\
                 9.43 Octonion / 423 \\
                 9.44 OneDimensionalArray / 425 \\
                 9.45 Operator / 426 \\
                 9.46 OrderlyDifferentialPolynomial / 429 \\
                 9.47 PartialFraction / 433 \\
                 9.48 Permanent / 436 \\
                 9.49 Polynomial / 436 \\
                 9.50 Quaternion / 442 \\
                 9.51 RadixExpansion / 444 \\
                 9.52 RomanNumeral / 446 \\
                 9.53 Segment / 447 \\
                 9.54 SegmentBinding / 448 \\
                 9.55 Set / 449 \\
                 9.56 SmallFloat / 452 \\
                 9.57 Smalllnteger / 453 \\
                 9.58 SparseTable / 455 \\
                 9.59 SquareMatrix / 456 \\
                 9.60 Stream / 457 \\
                 9.61 String / 458 \\
                 9.62 StringTable / 462 \\
                 9.63 Symbol / 462 \\
                 9.64 Table / 465 \\
                 9.65 TextFile / 468 \\
                 9.66 TwoDimensionalArray / 469 \\
                 9.67 UnivariatePolynomial / 472 \\
                 9.68 UniversalSegment / 477 \\
                 9.69 Vector / 478 \\
                 9.70 Void / 480 \\
                 III Advanced Programming in AXIOM 48 / 1 \\
                 10 Interactive Programming / 483 \\
                 10.1 Drawing Ribbons Interactively / 483 \\
                 10.2 A Ribbon Program / 487 \\
                 10.3 Coloring and Positioning Ribbons / 488 \\
                 10.4 Points, Lines, and Curves / 489 \\
                 10.5 A Bouquet of Arrows / 492 \\
                 10.6 Drawing Complex Vector Fields / 493 \\
                 10.7 Drawing Complex Functions / 495 \\
                 10.8 Functions Producing Functions / 497 \\
                 10.9 Automatic Newton Iteration Formulas / 497 \\
                 11 Packages / 501 \\
                 11.1 Names, Abbreviations, and File Structure / 502 \\
                 11.2 Syntax / 503 \\
                 11.3 Abstract Datatypes / 504 \\
                 11.4 Capsules / 504 \\
                 11.5 Input Files vs. Packages / 505 \\
                 11.6 Compiling Packages / 506 \\
                 11.7 Parameters / 507 \\
                 11.8 Conditionals / 509 \\
                 11.9 Testing 51 / 1 \\
                 11.10 How Packages Work / 512 \\
                 12 Categories / 515 \\
                 12.1 Definitions / 516 \\
                 12.2 Exports / 517 \\
                 12.3 Documentation / 518 \\
                 12.4 Hierarchies / 519 \\
                 12.5 Membership / 519 \\
                 12.6 Defaults / 520 \\
                 12.7 Axioms 52 / 1 \\
                 12.8 Correctness / 522 \\
                 12.9 Attributes / 522 \\
                 12.10 Parameters / 524 \\
                 12.11 Conditionals / 524 \\
                 12.12 Anonymous Categories / 525 \\
                 13 Domains / 527 \\
                 13.1 Domains vs. Packages / 527 \\
                 13.2 Definitions / 528 \\
                 13.3 Category Assertions / 529 \\
                 13.4 A Demo / 530 \\
                 13.5 Browse 53 / 1 \\
                 13.6 Representation / 532 \\
                 13.7 Multiple Representations / 532 \\
                 13.8 Add Domain / 533 \\
                 13.9 Defaults / 534 \\
                 13.10 Origins / 535 \\
                 13.11 Short Forms / 535 \\
                 13.12 Example 1: Clifford Algebra / 536 \\
                 13.13 Example 2: Building A Query Facility / 537 \\
                 14 Browse / 547 \\
                 14.1 The Front Page: Searching the Library / 547 \\
                 14.2 The Constructor Page / 551 \\
                 14.3 Miscellaneous Features of Browse / 562 \\
                 Appendices / 569 \\
                 A AXIOM System Commands / 571 \\
                 A.1 Introduction / 571 \\
                 A.2 )abbreviation / 572 \\
                 A.3 )boot / 573 \\
                 A.4 )cd / 574 \\
                 A.5 )clear / 574 \\
                 A.6 )compile / 575 \\
                 A.7 )display / 577 \\
                 A.8 )edit / 578 \\
                 A.9 )fin / 578 \\
                 A.10 )frame / 579 \\
                 A.11 )help / 580 \\
                 A.12 )history / 580 \\
                 A.13 )lisp / 582 \\
                 A.14 )load / 583 \\
                 A.15 )ltrace / 584 \\
                 A.16 )pquit / 584 \\
                 A.17 )quit / 585 \\
                 A.18 )read / 585 \\
                 A.19 )set / 586 \\
                 A.20 )show: / 586 \\
                 A.21 )spool / 587 \\
                 A.22 )synonym / 587 \\
                 A.23 )system / 588 \\
                 A.24 )trace / 589 \\
                 A.25 )undo / 592 \\
                 A.26 )what / 592 \\
                 B Categories / 595 \\
                 C Domains / 601 \\
                 D Packages / 619 \\
                 E Operations / 627 \\
                 F Programs for AXIOM Images / 691 \\
                 F.1 images1.input / 691 \\
                 F.2 images2.input / 692 \\
                 F.3 images3.input / 692 \\
                 F.4 images5.input / 692 \\
                 F.5 images6.input / 693 \\
                 F.6 images7.input / 694 \\
                 F.7 images8.input / 694 \\
                 F.8 conformal.input / 695 \\
                 F.9 tknot.input / 697 \\
                 F.10 ntube.input / 697 \\
                 F.11 dhtri.input / 699 \\
                 F.12 tetra.input / 700 \\
                 F.13 antoine.input / 701 \\
                 F.14 scherk.input / 702 \\
                 G Glossary / 703 \\
                 Index / 717",
}

@Book{Jennings:1977:MCE,
  author =       "Alan Jennings",
  title =        "Matrix Computation for Engineers and Scientists",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xv + 330",
  year =         "1977",
  ISBN =         "0-471-99421-9 (hardcover), 0-471-27832-7 (paperback)",
  ISBN-13 =      "978-0-471-99421-3 (hardcover), 978-0-471-27832-0
                 (paperback)",
  LCCN =         "TA347 .D4J461",
  bibdate =      "Wed Dec 15 10:35:36 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/l/lanczos-cornelius.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/numana1990.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Basic algebraic and numerical concepts \\
                 What is a matrix \\
                 The matrix equation \\
                 Matrix multiplication \\
                 Some special matrix forms \\
                 The matrix transpose and symmetry \\
                 The determinant of a matrix \\
                 The solution of simultaneous equations \\
                 Gaussian elimination and pivotal condensation \\
                 Equations with multiple right-hand sides \\
                 Transforming matrix equations \\
                 The rank of a matrix \\
                 The matrix inverse \\
                 Significance of the inverse \\
                 The transpose and inverse in matrix expressions \\
                 Partitioning of matrices \\
                 The eigenvalues of a matrix \\
                 Some eigenvalue properties \\
                 Eigenvectors \\
                 Norms and normalization \\
                 Orthogonality conditions for eigenvectors of symmetric
                 matrices \\
                 Quadric forms and positive definite matrices \\
                 Gerschgorin discs \\
                 2: Some matrix problems \\
                 An electrical resistance network \\
                 Alternative forms of the network equations \\
                 Properties of electrical resistance network equations
                 \\
                 Other network problems \\
                 Least squares for overdetermined equations \\
                 Error adjustments in surveying \\
                 Curve fitting by least squares \\
                 A heat transfer field problem \\
                 The finite difference method \\
                 The finite element method \\
                 A source and sink method \\
                 A non-linear cable analysis by the Newton--Raphson
                 method \\
                 3: Computer implementation \\
                 Storage of numbers \\
                 Rounding errors \\
                 Array storage for matrices \\
                 Matrix multiplication using two dimensional arrays \\
                 On program efficiency \\
                 One-dimensional storage for matrix operations \\
                 One the use of backing store \\
                 Computer packages \\
                 Sparse storage \\
                 Random packing \\
                 The use of address links \\
                 Systematic packing \\
                 Some notes on sparse packing schemes \\
                 Operations involving systematically packed matrices \\
                 Series storage of sparse matrices \\
                 regular pattern storage schemes \\
                 variable bandwidth storage \\
                 Submatrix storage schemes \\
                 4: Elimination methods for linear equations \\
                 Triangular decomposition \\
                 Equivalence of Gaussian elimination of triangular
                 decomposition \\
                 When pivot selection is unnecessary \\
                 Pivot selection \\
                 Row and column scaling \\
                 On loss of accuracy in elimination \\
                 On pivot selection \\
                 Ill-conditioning \\
                 \ldots{} in practice \\
                 Residuals and iterative improvement \\
                 Twin pivoting for symmetric matrices \\
                 Equations with prescribed variables \\
                 5: Sparse matrix elimination \\
                 Changes in sparsity pattern during elimination \\
                 Graphical interpretation of sparse elimination \\
                 Diagonal band elimination \\
                 A variable bandwidth elimination algorithm \\
                 The Cuthill--McKee algorithm and its reverse \\
                 Some other renumbering schemes \\
                 Elimination in a packed store \\
                 Elimination using submatrices \\
                 Substructure methods \\
                 Nested dissection \\
                 On the use of backing store \\
                 Unsymmetric band elimination \\
                 Unsymmetric elimination in a packed store \\
                 Computing elements of a sparse inverse \\
                 6: Some matrix eigenvalue problems \\
                 Column buckling \\
                 Structural vibration \\
                 Linearized eigenvalue problems \\
                 Damped vibration \\
                 Dynamic stability \\
                 reduction of the quadratic eigenvalue problem to
                 standard form \\
                 Principal component analysis \\
                 A geometrical interpretation of principal component
                 analysis \\
                 Markov chains \\
                 Markov chains for assessing computer performance \\
                 Some eigenvalue properties of stochastic matrices \\
                 7: Transformation methods for eigenvalue problems \\
                 Orthogonal transformation of a matrix \\
                 Jacobi diagonalization \\
                 Computer implementation of Jacobi diagonalization \\
                 Givens tridiagonalization \\
                 Householder's transformation \\
                 Implementation of Householder's tridiagonalization \\
                 Transformation of band symmetric matrices \\
                 Eigenvalue properties of unsymmetric matrices \\
                 Similarity transformations \\
                 Reduction to upper Hessenberg form \\
                 The LR transformation \\
                 Convergence of the LR method \\
                 The QR and QL transformations \\
                 Origin shift with the QR method \\
                 Discussion of the QR method \\
                 The application of the transformation methods \\
                 8: Sturm sequence methods \\
                 The characteristic equation \\
                 The Sturm sequence property \\
                 Bisection for tridiagonal matrices \\
                 Discussion of bisection for tridiagonal matrices \\
                 Bisection for general symmetric matrices \\
                 Bisection for band matrices \\
                 Non-linear symmetric eigenvalue problems \\
                 9: Vector iterative methods for partial eigensolution
                 \\
                 The power method \\
                 Convergence characteristics of the power method \\
                 Eigenvalue shift and inverse iteration \\
                 A simultaneous iteration method \\
                 The convergence rate and efficiency of simultaneous
                 iteration \\
                 Simultaneous iteration for symmetric matrices \\
                 \ldots{} unsymmetric \\
                 Simultaneous and subspace iteration for vibration
                 frequency analysis \\
                 The symmetric Lanczos method \\
                 Theoretical basis for the Lanczos \\
                 Convergence characteristics of Lanczos' method \\
                 Extensions of Lanczos' method \\
                 Shift strategies with advanced vector \\
                 10: Orthogonalization and re-solution techniques for
                 linear equations \\
                 Decompositions of a rectangular matrix \\
                 Efficiency and accuracy in least squares problems \\
                 Sparse least squares problems \\
                 Singular value decomposition \\
                 Use of singular value composition \\
                 The solution of modified equations \\
                 The use of supplementary variables \\
                 Updating factorization \\
                 Discussion of equation modification \\
                 11: Iterative methods for linear equations \\
                 Jacobi and Gauss--Seidel iteration \\
                 Successive over-relaxation \\
                 General characterization of iterative methods \\
                 The iteration matrix \\
                 SOR convergence with a symmetric positive definite
                 matrix \\
                 Matrices with property A \\
                 On the acceleration of stationary methods \\
                 The method of steepest decent \\
                 The method of conjugate gradients (CG) \\
                 Convergence of the CG method \\
                 Generalized CG formulations \\
                 Block relaxation \\
                 Preconditioning \\
                 ICCG methods \\
                 12: Non-linear equations \\
                 The Newton--Raphson method \\
                 Globally convergent algorithms \\
                 Dealing with ill-conditioning \\
                 Avoiding the need to compute derivatives \\
                 Overdetermined sets of equations \\
                 Practical considerations \\
                 13: Parallel and vector computing \\
                 Mutual independence in matrix operations \\
                 High-speed computer architecture \\
                 Matrix--vector multiplication on non-sequential
                 machines \\
                 Solving dense sets of linear equations on
                 non-sequential machines \\
                 Solution of banded equations \\
                 General sparse equations \\
                 Parallelizing a sequential code",
}

@Book{Jensen:1974:PUM,
  author =       "Kathleen Jensen and Niklaus Wirth",
  title =        "{Pascal} User Manual and Report",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Second",
  pages =        "viii + 167",
  year =         "1974",
  DOI =          "https://doi.org/10.1007/978-3-540-37500-5",
  ISBN =         "0-387-90144-2, 3-540-90144-2, 3-540-07167-9 (print),
                 3-540-37500-7 (e-book)",
  ISBN-13 =      "978-0-387-90144-2, 978-3-540-90144-0,
                 978-3-540-07167-9 (print), 978-3-540-37500-5 (e-book)",
  LCCN =         "QA76.73.P35 J461 1975",
  bibdate =      "Sun May 02 07:49:16 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See also \cite{Jensen:1985:PUM,ANSI:pascal}.",
  URL =          "http://link.springer.com/10.1007/978-3-540-37500-5",
  acknowledgement = ack-nhfb,
  tableofcontents = "User Manual \\
                 0. Introduction \\
                 1. Notation and Vocabulary \\
                 2. The Concept of Data \\
                 3. The Program Heading and the Declaration Part \\
                 4. The Concept of Action \\
                 5. Scalar and Subrange Types \\
                 6. Structured Types in General: The Array in Particular
                 \\
                 7. Record Types \\
                 8. Set Types \\
                 9. File Types \\
                 10. Pointer Types \\
                 11. Procedures and Functions \\
                 12. Input and Output \\
                 13. PASCAL 6000-3.4 \\
                 14. How to Use the PASCAL 6000-3.4 System \\
                 Report \\
                 15. Index",
}

@Book{Jensen:1985:PUM,
  author =       "Kathleen Jensen and Niklaus Wirth",
  title =        "{Pascal} User Manual and Report: {ISO Pascal
                 Standard}",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Third",
  pages =        "xvi + 266",
  year =         "1985",
  ISBN =         "0-387-96048-1, 3-540-96048-1",
  ISBN-13 =      "978-0-387-96048-7, 978-3-540-96048-5",
  LCCN =         "QA76.73.P2 J46 1985",
  bibdate =      "Sun May 02 07:49:43 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Revised by Andrew B. Mickel and James F. Miner. See
                 \cite{ANSI:pascal,Jensen:1974:PUM}.",
  acknowledgement = ack-nhfb,
}

@Book{Jerome:2002:EFJ,
  author =       "Fred Jerome",
  title =        "The {Einstein} file: {J. Edgar Hoover}'s secret war
                 against the world's most famous scientist",
  publisher =    pub-ST-MARTINS,
  address =      pub-ST-MARTINS:adr,
  pages =        "xxii + 358",
  year =         "2002",
  ISBN =         "0-312-28856-5",
  ISBN-13 =      "978-0-312-28856-3",
  LCCN =         "QC16.E5 J46 2002",
  bibdate =      "Wed Mar 8 10:50:24 MST 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 melvyl.cdlib.org:210/CDL90",
  URL =          "http://www.loc.gov/catdir/toc/fy022/2001058850.html",
  acknowledgement = ack-nhfb,
  subject =      "Einstein, Albert; Political and social views; United
                 States; Politics and government; 1945--1953",
  subject-dates = "Albert Einstein (1879--1955)",
  tableofcontents = "Discovering America\\
                 Postwar fallout\\
                 Guilt by associations\\
                 Operation ``get Einstein''\\
                 Denouement",
}

@Manual{JISCII:charset,
  title =        "{Japanese Industrial Standard JIS C 6626-1978 Code of
                 the Japanese Graphics Character Set for Information
                 Interchange}",
  organization = pub-JSA,
  address =      pub-JSA:adr,
  year =         "1978",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Manual{JISCII:dot-printers,
  title =        "{Japanese Industrial Standard JIS C 6234-1983 24-dots
                 Matrix Character Patterns for Dot Printers}",
  organization = pub-JSA,
  address =      pub-JSA:adr,
  year =         "1983",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Johanson:2006:LL,
  author =       "Donald C. Johanson and Blake Edgar",
  title =        "From {Lucy} to language",
  publisher =    pub-SIMON-SCHUSTER,
  address =      pub-SIMON-SCHUSTER:adr,
  edition =      "Revised, updated, and expanded",
  pages =        "288",
  year =         "2006",
  ISBN =         "0-7432-8064-4",
  ISBN-13 =      "978-0-7432-8064-8",
  LCCN =         "GN281 .J57 2006",
  bibdate =      "Wed Apr 1 05:47:16 MDT 2015",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  note =         "Principal photography by David L. Brill.",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0705/2007270098-t.html;
                 http://www.loc.gov/catdir/enhancements/fy0713/2007270098-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0735/2007270098-b.html;
                 http://www.loc.gov/catdir/enhancements/fy1310/2007270098-s.html",
  acknowledgement = ack-nhfb,
  subject =      "Human evolution; Fossil hominids; Australopithecines;
                 Lucy (Prehistoric hominid); Hominidae; Fossils;
                 Anthropology, Physical; Paleontology",
  tableofcontents = "Part I: Central issues of paleoanthropology. What
                 is a human? \\
                 Evidence \\
                 Ancestors \\
                 Lineages \\
                 Migration \\
                 Diversity \\
                 Anatomy \\
                 Society \\
                 Bipedalism \\
                 Tool \\
                 Customs \\
                 Culture \\
                 Imponderables \\
                 Part 2: Encountering the evidence.
                 Pre-Australopithecines \\
                 Australopithecines \\
                 Homo \\
                 Paleolithic technology \\
                 Appendix 1: Type specimens for hominid species \\
                 Appendix 2: Hominid fossil and archeological sites",
}

@Article{Johnson:1978:LDT,
  author =       "Steven C. Johnson and Michael E. Lesk",
  title =        "Language Development Tools",
  journal =      j-BELL-SYST-TECH-J,
  volume =       "57",
  number =       "6",
  pages =        "2155--2176",
  month =        jul # "\slash  " # aug,
  year =         "1978",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{Johnson:1987:LDT,
  author =       "Steven C. Johnson and Michael E. Lesk",
  booktitle =    "{UNIX} System Readings and Applications",
  title =        "Language Development Tools",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "245--265",
  year =         "1987",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Reprinted from {The Bell System Technical} {Journal},
                 1978",
  acknowledgement = ack-nhfb,
}

@Book{Johnson:1989:XWA,
  author =       "Eric F. Johnson and Kevin Reichard",
  title =        "{X} Window Applications Programming",
  publisher =    pub-MIS,
  address =      pub-MIS:adr,
  pages =        "xxii + 562",
  year =         "1989",
  ISBN =         "1-55828-016-2",
  ISBN-13 =      "978-1-55828-016-8",
  LCCN =         "QA76.76.W56 J64 1989",
  bibdate =      "Wed Dec 15 10:35:41 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Johnson:1990:AXW,
  author =       "Eric F. Johnson and Kevin Reichard",
  title =        "Advanced {X} Window Applications Programming",
  publisher =    pub-MIS,
  address =      pub-MIS:adr,
  pages =        "xxii + 615",
  year =         "1990",
  ISBN =         "1-55828-029-4",
  ISBN-13 =      "978-1-55828-029-8",
  LCCN =         "QA76.76.W56 J63 1990",
  bibdate =      "Wed Dec 15 17:49:00 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

@Book{Johnson:1991:PPL,
  author =       "Eric F. Johnson and Kevin Reichard",
  title =        "power programming \ldots{} {MOTIF}",
  publisher =    pub-MIS,
  address =      pub-MIS:adr,
  pages =        "xv + 464",
  year =         "1991",
  ISBN =         "1-55828-059-6",
  ISBN-13 =      "978-1-55828-059-5",
  LCCN =         "QA76.76.W56M68 1990",
  bibdate =      "Sat Nov 12 21:23:27 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$29.95 (book), US\$59.95 (book + diskette)",
  acknowledgement = ack-nhfb,
}

@Book{Johnson:1993:LAM,
  author =       "Eugene W. Johnson",
  title =        "Linear Algebra with {Maple V}",
  publisher =    pub-BROOKS-COLE,
  address =      pub-BROOKS-COLE:adr,
  pages =        "xii + 142",
  year =         "1993",
  ISBN =         "0-534-13069-0",
  ISBN-13 =      "978-0-534-13069-5",
  LCCN =         "QA185.D37 J64 1993",
  bibdate =      "Tue Nov 2 12:22:39 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/maple-extract.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "0 Introduction \\
                 0.1 Getting Started with Maple / 2 \\
                 0.2 Editing, Saving, and Retrieving Your Work / 2 \\
                 0.3 An Introductory Tour of Maple / 2 \\
                 0.3.1 Arithmetic / 3 \\
                 0.3.2 Prompts / 4 \\
                 0.3.3 The Terminators in Maple / 5 \\
                 0.3.4 Getting Help / 6 \\
                 0.3.5 Ditto, Ditto, Ditto / 6 \\
                 0.3.6 Built-in Functions and Constants / 7 \\
                 0.3.7 Approximate Solutions / 7 \\
                 0.3.8 Assigning Names / 8 \\
                 0.3.9 Unassigning Names / 9 \\
                 0.3.10 Extending Maple \\
                 0.3.11 Symbolic Calculations with Maple / 11 \\
                 0.3.12 Equations / 12 \\
                 0.3.13 Calculus with Maple / 14 \\
                 0.3.14 Graphing Functions with Maple / 15 \\
                 0.3.15 Other Types of Maple Objects / 16 \\
                 0.3.16 Substitution / 18 \\
                 0.3.17 Automating Repetitive Procedures: Loops / 18 \\
                 0.3.18 Generating Sequences, Sums, and Products / 20
                 \\
                 0.3.19 Aliases and Macros / 21 \\
                 0.3.20 Simplification and Evaluation / 23 \\
                 0.3.21 Quitting a Maple Session / 23 \\
                 Exercises / 24 \\
                 1 Matrices and Linear Systems / 26 \\
                 1.1 The Linear Algebra Package / 26 \\
                 1.2 Gaussian Elimination and Row Reduction / 26 \\
                 1.2.1 Manual Row Reduction / 28 \\
                 1.2.2 Automated Gaussian Elimination and
                 Back-Substitution / 30 \\
                 Exercises 1.2 / 31 \\
                 1.3 More on Matrices in Maple / 32 \\
                 Reviewing and Editing Matrix Definitions / 34 \\
                 Exercises 1.3 / 35 \\
                 1.4 Matrix Arithmetic / 36 \\
                 1.4.1 A Few Pitfalls to Avoid / 39 \\
                 1.4.2 Legal Names / 39 \\
                 1.4.3 Random Matrices / 41 \\
                 1.4.4 Symbolic Matrices / 41 \\
                 Exercises 1.4 / 43 \\
                 1.5 det and Other Built-in Matrix Functions / 45 \\
                 Exercises 1.5 / 46 \\
                 1.6 Applications / 46 \\
                 Curve Fitting and Interpolation / 46 \\
                 Problems on Curve Fitting and Interpolation / 48 \\
                 Leontief Economic Model / 49 \\
                 Problems on the Leontief Model / 51 \\
                 Incidence Matrices / 51 \\
                 Problems on Incidence Matrices / 53 \\
                 Coding Theory / 55 \\
                 Problems on Coding Theory / 57 \\
                 2 The Algebra of Vectors / 59 \\
                 2.1 Introduction to Vectors in Maple / 59 \\
                 2.1.1 Defining Vectors in Maple / 59 \\
                 Reviewing and Editing Vector Definitions / 60 \\
                 2.1.2 Vector Arithmetic / 60 \\
                 2.1.3 ``Cutting and Pasting'' Vectors and Matrices / 62
                 \\
                 2.1.4 Solving Linear Matrix--Vector Equations / 63 \\
                 The Solutions of a Homogeneous Linear System / 64 \\
                 Exercises 2.1 / 65 \\
                 2.2 Span and Linear Independence / 67 \\
                 Exercises 2.2 / 69 \\
                 2.3 Bases, Dimension, and Coordinates / 69 \\
                 Change of Coordinates / 71 \\
                 Exercises 2.3 / 71 \\
                 2.4 Subspaces Associated with a Matrix / 72 \\
                 Exercises 2.4 / 73 \\
                 2.5 The Gram-Schmidt Procedure / 74 \\
                 Exercises 2.5 / 76 \\
                 2.6 Applications / 76 \\
                 Stability and Steady-state Vectors / 76 \\
                 Problems on Stability and Steady-state Vectors / 79 \\
                 Orthogonal Projection / 80 \\
                 Problems on Least Squares / 81 \\
                 Curve Fitting with Too Many Points / 82 \\
                 Problems on Curve Fitting / 83 \\
                 Curve Fitting with Other Inner Products / 84 \\
                 Additional Problems on Curve Fitting / 85 \\
                 3 Eigenspaces \\
                 3.1 Eigenvalues and Eigenvectors / 86 \\
                 Exercises 3.1 / 90 \\
                 3.2 Similarity / 90 \\
                 3.2.1 Similarity and Diagonalization / 91 \\
                 Diagonalizing with jordan / 95 \\
                 Exercises on Diagonalization / 96 \\
                 3.2.2 Similarity and Triangularization / 96 \\
                 Triangularizing with jordan / 98 \\
                 Exercises on Triangularization / 99 \\
                 3.2.3 Orthogonal Diagonalization / 99 \\
                 Exercises on Orthogonal Diagonalization / 100 \\
                 3.2.4 Similarity, Smith Form, and Frobenius Form / 101
                 \\
                 Smith Form / 101 \\
                 Frobenius Form / 101 \\
                 Exercises on Smith Form and Frobenius Form / 102 \\
                 3.3 Applications / 102 \\
                 Systems of Linear Differential Equations / 102 \\
                 Exercises on Systems of Linear Differential Equations /
                 104 \\
                 Problems on Systems of Linear Differential Equations /
                 105 \\
                 The Exponential Function / 107 \\
                 Exercises on the Exponential Function / 110 \\
                 Problems on the Exponential Function / 111 \\
                 Systems of Recurrence Relations / 111 \\
                 Problems on Systems of Recurrence Relations / 114 \\
                 Quadratic Forms: The Principal Axis Theorem / 115 \\
                 Exercises on Quadratic Forms / 116 \\
                 4 Linear Transformations / 118 \\
                 4.1 Linear Transformations in Maple / 118 \\
                 Exercises 4.1 / 119 \\
                 4.2 Matrices and Linear Transformations / 120 \\
                 Exercises 4.2 / 122 \\
                 4.3 Applications / 123 \\
                 Differential Equations / 123 \\
                 The Wronskian / 125 \\
                 Initial Conditions / 127 \\
                 Exercises on Differential Equations / 128 \\
                 Problems on Differential Equations / 129 \\
                 Linear Recurrence Relations and Difference Equations /
                 130 \\
                 The Casoratian / 133 \\
                 Initial Conditions / 134 \\
                 Exercises on Linear Recurrence Relations / 136 \\
                 Problems on Linear Recurrence Relations / 136 \\
                 Index / 139",
}

@Book{Johnson:1993:PPL,
  author =       "Eric F. Johnson and Kevin Reichard",
  title =        "power programming \ldots{} {MOTIF}",
  publisher =    pub-MIS,
  address =      pub-MIS:adr,
  edition =      "Second",
  pages =        "xxxvii + 991",
  year =         "1993",
  ISBN =         "1-55828-322-6",
  ISBN-13 =      "978-1-55828-322-0",
  LCCN =         "QA76.76.W56 J636 1993",
  bibdate =      "Sat Nov 12 21:23:38 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$59.95",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

@Book{Johnson:1996:GAT,
  author =       "Eric F. Johnson",
  title =        "Graphical Applications with {Tcl} and {Tk}",
  publisher =    pub-MT,
  address =      pub-MT:adr,
  pages =        "x + 374",
  year =         "1996",
  ISBN =         "1-55851-471-6",
  ISBN-13 =      "978-1-55851-471-3",
  LCCN =         "T385.J618 1996",
  bibdate =      "Wed Aug 20 16:36:53 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$39.95",
  acknowledgement = ack-nhfb,
  tableofcontents = "What is Tcl? \\
                 When to Use Tcl \\
                 1: Your First Tcl Programs \\
                 2: Tcl Basics \\
                 3: Interacting with the User \\
                 4: Menus \\
                 5: Text Editing with Tcl and Tk \\
                 6: Lists, Files, and Directories \\
                 7: Dialog Windows \\
                 8: Tcl Tricks and Traps: Handling Errors and Debugging
                 \\
                 9: The Canvas Widget, Bitmaps, and Images \\
                 10: Launching Applications from Tcl \\
                 11: Embedding Tcl in Your Applications \\
                 12: Extending Tcl \\
                 13: Advanced Applications \\
                 Appendix A \\
                 For More Information \\
                 Appendix B \\
                 Installing Tcl and Tk \\
                 Appendix C \\
                 The CD-ROM",
}

@Book{Johnson:2018:HFP,
  author =       "Andrew Johnson",
  title =        "Hands-on Functional Programming in {Rust}: Build
                 Modular and Reactive Applications with Functional
                 Programming Techniques in {Rust 2018}",
  publisher =    pub-PACKT,
  address =      pub-PACKT:adr,
  pages =        "v + 278",
  year =         "2018",
  ISBN =         "1-78883-935-8 (paperback)",
  ISBN-13 =      "978-1-78883-935-8 (paperback)",
  LCCN =         "QA76.62",
  bibdate =      "Tue Dec 10 05:57:08 MST 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Rust (System programming language); Functional
                 programming (Computer science); Programming languages
                 (Electronic computers); Application software;
                 Development; Development; Functional programming
                 (Computer science); Programming languages (Electronic
                 computers)",
  tableofcontents = "1: Functional Programming --- a comparison \\
                 2: Functional Control Flow \\
                 3: Functional Data Structures \\
                 4: Generics and Polymorphism \\
                 5: Code Organization and Application Architecture \\
                 6: Mutability, Ownership, and Pure Functions \\
                 7: Design Patterns \\
                 8: Implementing Concurrency \\
                 9: Performance, Debugging, and Metaprogramming \\
                 Assessments \\
                 Other Books You May Enjoy \\
                 Index",
}

@InCollection{Johnson:yacc,
  author =       "Steven C. Johnson",
  booktitle =    "{UNIX} Programmer's Manual",
  title =        "Yacc: Yet Another Compiler Compiler",
  volume =       "2",
  publisher =    pub-HRW,
  address =      pub-HRW:adr,
  pages =        "353--387",
  year =         "1979",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "AT\&T Bell Laboratories Technical Report July 31,
                 1978.",
  acknowledgement = ack-nhfb,
}

@Book{Johnstone:1992:LC,
  author =       "Adrian Johnstone",
  title =        "{\LaTeX}, Concisely",
  publisher =    pub-ELLIS-HORWOOD,
  address =      pub-ELLIS-HORWOOD:adr,
  pages =        "xviii + 170",
  year =         "1992",
  ISBN =         "0-13-524539-7 (paperback)",
  ISBN-13 =      "978-0-13-524539-2 (paperback)",
  LCCN =         "Z253.4.L38 J64 1992",
  bibdate =      "Wed Jul 6 14:01:03 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  price =        "US\$30.00",
  acknowledgement = ack-nhfb,
  tableofcontents = "Preface First examples / 1 \\
                 Commands and variables / 17 \\
                 Document styles / 23 \\
                 Structuring a document / 33 \\
                 Fonts and special symbols / 43 \\
                 Text displays / 59 \\
                 Tables, figures and pictures / 67 \\
                 Typesetting mathematics / 81 \\
                 Cross referencing and bibliographies / 89 \\
                 Defining commands / 97 \\
                 LaTeX style parameters / 101 \\
                 Writing a style file / 123 \\
                 LaTeX past, present and future / 141 \\
                 A Hints on running LaTeX / 149 \\
                 B Error messages / 151 \\
                 Index / 161",
}

@Book{Jones:1978:WWB,
  author =       "R. V. (Reginald Victor) Jones",
  title =        "The Wizard War: {British} Scientific Intelligence,
                 1939--1945",
  publisher =    "Coward, McCann and Geoghegan",
  address =      "New York, NY, USA",
  pages =        "xx + 556 + 16",
  year =         "1978",
  ISBN =         "0-698-10896-5",
  ISBN-13 =      "978-0-698-10896-7",
  LCCN =         "D810.C88 J66 1978",
  bibdate =      "Thu Aug 9 14:32:26 MDT 2012",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/bohr-niels.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/h/heisenberg-werner.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "https://en.wikipedia.org/wiki/Reginald_Victor_Jones",
  acknowledgement = ack-nhfb,
  author-dates = "Reginald Victor Jones (29 September 1911--17 December
                 1997)",
  remark =       "This is an excellent memoir by the World War II head
                 of British Air Intelligence. It has extensive coverage
                 of the development and use of radar and signal-homing
                 on both sides of the War. The author had substantial
                 influence in the intelligence services because he had
                 authority for direct contact with Prime Minister
                 Winston Churchill, when the need arose. Chapter 48
                 describes extensive meetings between the author and
                 Niels Bohr, and his son Aage Bohr. Chapters 44--46
                 discuss the Nazi flying bombs and rockets developed,
                 and tested in Baltic Ocean flights, by the Werner von
                 Braun team at Peenemuende on the north German coast,
                 and how successful the British were at eliminating many
                 of them before the attacks were successful. The book
                 also has shorter commentary on the 1945--1946
                 internment at Farm Hall (just outside Cambridge, UK) of
                 ten German atomic scientists, and the fact that all of
                 their conversations were secretly recorded,
                 transcribed, and translated from German to English. The
                 book was written more than 15 years before the expiry
                 of the fifty-year period mandated by the British
                 Official Secrets Act that finally allowed the release
                 of the transcripts of the recordings, but nevertheless
                 appears to be quite accurate about what was learned
                 from them. After the war, the author had several
                 opportunities to meet with high-ranking officers from
                 the war-time German military, and to learn how much
                 each side of the conflict knew of the other's
                 activities.",
  subject =      "Geheimdienst; Spionage; Weltkrieg (1939--1945);
                 Geschichte; Gro{\ss}britannien; Jones, R. V (Reginald
                 Victor); World War, 1939--1945; Secret service; Great
                 Britain; Personal narratives, British; Technology;
                 Scientists; England; Biography; Service des
                 renseignements militaires; Guerre mondiale, 1939--1945;
                 Service secret; Grande-Bretagne; Tweede Wereldoorlog;
                 Geheime Diensten; Natuurwetenschappen; Technische
                 wetenschappen; Scientists; Secret service; Technology;
                 History; George VI, 1936--1952",
  tableofcontents = "Illustrations / ix \\
                 Foreword by the Vicomtesse de Clarens / xiii \\
                 Acknowledgements / xv \\
                 Introduction / xvii \\
                 Part 1 \\
                 1: The men who went first / 3 \\
                 2: Friends and rivals / 13 \\
                 3: The Clarendon laboratory 1936--1938 / 21 \\
                 4: Inferior red 1936--1938 / 34 \\
                 5: Exile / 45 \\
                 6: The day before war broke out / 53 \\
                 7: The secret weapon / 57 \\
                 8: The Oslo report / 67 \\
                 9: A plan for intelligence / 72 \\
                 10: The phoney war / 78 \\
                 11: The crooked leg / 92 \\
                 12: Reflections / 106 \\
                 13: The fortunes of major Wintle / 111 \\
                 14: The fifth column / 114 \\
                 15: The Edda revived / 120 \\
                 16: Knickebein Jammed --- and photographed / 127 \\
                 17: The X-apparatus / 135 \\
                 18: Coventry / 146 \\
                 19: Target no. 54 / 154 \\
                 20: The atrocious crime / 161 \\
                 21: Wotan's other eye / 172 \\
                 22: Retrospect and prospect / 179 \\
                 Part 2 \\
                 23: Freya / 189 \\
                 24: Beams on the wane / 203 \\
                 25: `Jay' / 215 \\
                 26: W{\"u}rzburg / 223 \\
                 27: The Bruneval raid / 233 \\
                 28: The Baedeker beams / 250 \\
                 29: El Hatto / 254 \\
                 30: Pineapple / 260 \\
                 31: The Kammhuber line / 264 \\
                 32: Lichtenstein / 280 \\
                 33: Window / 287 \\
                 34: Hamburg / 300 \\
                 35: Heavy water / 306 \\
                 36: Revelations from the Secret Service / 310 \\
                 37: Full stretch / 318 \\
                 38: Peenem{\"u}nde / 332 \\
                 39: FZG 76 / 349 \\
                 40: The Americans convinced / 376 \\
                 41: Flames: problems of bomber command / 381 \\
                 42: The Baby Blitz / 396 \\
                 43: D-Day / 400 \\
                 44: V-1 / 413 \\
                 45: V-2 / 430 \\
                 46: V-3 / 462 \\
                 47: Bomber triumph / 465 \\
                 48: Nuclear energy / 472 \\
                 49: A.D.I. (science) overseas / 484 \\
                 50: The year of madness / 492 \\
                 51: German generals and staff colleges / 499 \\
                 52: Swords into ploughshares, bombs into saucers / 507
                 \\
                 53: Exeunt / 514 \\
                 Epilogue / 523 \\
                 Notes / 535 \\
                 Glossary / 539 \\
                 Index / 543",
}

@Book{Jones:1989:IXW,
  author =       "Oliver Jones",
  title =        "Introduction to the {X Window System}",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xii + 511",
  year =         "1989",
  ISBN =         "0-13-499997-5",
  ISBN-13 =      "978-0-13-499997-5",
  LCCN =         "QA76.76.W56 J66 1989",
  bibdate =      "Wed Dec 15 10:35:42 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Jones:1996:GCA,
  author =       "Richard Jones and Rafael Lins",
  title =        "Garbage Collection: Algorithms for Automatic Dynamic
                 Memory Management",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xxvi + 377",
  year =         "1996",
  ISBN =         "0-471-94148-4",
  ISBN-13 =      "978-0-471-94148-4",
  LCCN =         "QA76.9.G37J66 1996",
  MRclass =      "68M99",
  bibdate =      "Tue May 25 06:57:21 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/java.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Reprinted in 1999 with improved index, and corrected
                 errata.",
  price =        "US\$60.00",
  URL =          "http://www.ukc.ac.uk/computer_science/Html/Jones/gc.html",
  abstract =     "The memory storage requirements of complex programs
                 are extremely difficult to manage correctly by hand. A
                 single error may lead to indeterminate and inexplicable
                 program crashes. Worse still, failures are often
                 unrepeatable and may surface only long after the
                 program has been delivered to the customer. The
                 eradication of memory errors typically consumes a
                 substantial amount of development time. And yet the
                 answer is relatively easy --- garbage collection;
                 removing the clutter of memory management from module
                 interfaces, which then frees the programmer to
                 concentrate on the problem at hand rather than
                 low-level book-keeping details. For this reason, most
                 modern object-oriented languages such as Smalltalk,
                 Eiffel, Java and Dylan, are supported by garbage
                 collection. Garbage collecting, libraries are even
                 available for such uncooperative languages as C and
                 C++. This book considers how dynamic memory can be
                 recycled automatically to guarantee error-free memory
                 management. There is an abundant but disparate
                 literature on the subject, largely confined to research
                 papers.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Introduction \\
                 2: The Classical Algorithms \\
                 3: Reference Counting \\
                 4: Mark-Sweep Garbage Collection \\
                 5: Mark-Compact Garbage Collection \\
                 6: Copying Garbage Collection \\
                 7: Generational Garbage Collection \\
                 8: Incremental and Concurrent Garbage Collection \\
                 9: Garbage Collection for C \\
                 10: Garbage Collection for C++ \\
                 11: Cache-Conscious Garbage Collection \\
                 12: Distributed Garbage Collection",
}

@Book{Jones:2008:QTS,
  author =       "Sheilla Jones",
  title =        "The Quantum Ten: a Story of Passion, Tragedy, Ambition
                 and Science",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  pages =        "xii + 323 + 8",
  year =         "2008",
  ISBN =         "0-19-536909-2",
  ISBN-13 =      "978-0-19-536909-0",
  LCCN =         "QC174.12 .J66 2008",
  bibdate =      "Thu Aug 21 17:35:44 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/bohr-niels.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/b/born-max.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/d/dirac-p-a-m.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/h/heisenberg-werner.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/s/schroedinger-erwin.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.loc.gov:7090/Voyager",
  abstract =     "The seeds of the problem of unifying the classical and
                 quantum worlds were sewn 80 years ago when a dramatic
                 revolution in physics reached a climax at the 1927
                 Solvay conference in Brussels. The story of the rush to
                 formalize quantum physics is that of the work of just a
                 handful of men fired by ambition, conflicts and
                 personal agendas.",
  acknowledgement = ack-nhfb,
  remark =       "Albert Einstein (1879--1955), Niels Bohr (1885--1962),
                 Paul Ehrenfest (1880--1933), Max Born (1882--1970),
                 Erwin Schr{\"o}dinger (1887--1961), Wolfgang Pauli
                 (1900--1958), Louis de Broglie (1892--1987), Werner
                 Heisenberg (1901--1976), Paul Dirac (1902--1984),
                 Pascual Jordan (1902--1980).",
  subject =      "Quantum theory; Physics",
  tableofcontents = "The regression of science \\
                 The quantum showdown \\
                 The birth of the quantum \\
                 A place to belong \\
                 Building a foundation \\
                 The cost of compromise \\
                 Taking a new path \\
                 Only what the eye can see \\
                 The emergence of the boys' club \\
                 The G{\"o}ttingen gospel \\
                 A meeting of minds \\
                 Shock waves \\
                 Drawing the battle lines \\
                 Dark night of the scientific soul \\
                 Solvay prelude \\
                 Coming undone \\
                 Picking up the pieces \\
                 Quantum confusion",
}

@Book{Jorgensen:1983:PQC,
  author =       "Poul J{\o}rgensen and Jens Oddershede",
  title =        "Problems in Quantum Chemistry",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "x + 286",
  year =         "1983",
  ISBN =         "0-201-05486-8",
  ISBN-13 =      "978-0-201-05486-6",
  LCCN =         "QD462.7.J67 1982",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Josuttis:1999:CSL,
  author =       "Nicolai M. Josuttis",
  title =        "The {C++ Standard Library}: a tutorial and reference",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xx + 799",
  year =         "1999",
  ISBN =         "0-201-37926-0",
  ISBN-13 =      "978-0-201-37926-6",
  LCCN =         "QA76.73.C153J69 1999",
  bibdate =      "Tue May 11 06:58:58 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$49.95",
  abstract =     "Contains full coverage of the ANSI/ISO C++ standard.
                 The text covers classes, methods, interfaces and
                 objects that make up the standard C++ libraries.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  tableofcontents = "1: About this Book \\
                 2: Introduction to C++ and the Standard Library \\
                 3: General Concepts \\
                 4: Utilities \\
                 5: The Standard Template Library \\
                 6: STL Containers \\
                 7: STL Iterators \\
                 8: STL Function Objects \\
                 9: STL Algorithms \\
                 10: Special Containers \\
                 11: Strings \\
                 12: Numerics \\
                 13: Input/Output Using Stream Classes \\
                 14: Internationalization \\
                 15: Allocators",
}

@Book{Jude:2016:FMA,
  author =       "Allan Jude and Michael W. Lucas",
  title =        "{FreeBSD} Mastery: Advanced {ZFS}",
  publisher =    "Tilted Windmill Press",
  address =      "????",
  pages =        "xx + 222",
  year =         "2016",
  ISBN =         "0-692-68868-4 (paperback)",
  ISBN-13 =      "978-0-692-68868-7 (paperback)",
  LCCN =         "????",
  bibdate =      "Wed Oct 19 07:05:27 2016",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "0: Introduction / 1 \\
                 1: Boot Environments / 13 \\
                 2: Delegation and jails / 27 \\
                 3: Sharing Datasets / 45 \\
                 4: Replication / 53 \\
                 5: ZFS Volumes / 87 \\
                 6: Advanced Hardware / 95 \\
                 7: Caches / 121 \\
                 8: Performance / 143 \\
                 9: Tuning / 173 \\
                 10: ZFS Potpourri / 187\\
                 Afterword / 211 \\
                 Sponsors / 213 \\
                 About the Authors / 215",
}

@Article{Juley:1947:BC,
  author =       "J. Juley",
  title =        "The Ballistic Computer",
  journal =      j-BELL-LABS-RECORD,
  volume =       "24",
  number =       "??",
  pages =        "5--9",
  year =         "1947",
  CODEN =        "BLRCAB",
  ISSN =         "0005-8564",
  bibdate =      "Wed Oct 13 11:32:38 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Reprinted in \cite[\S 6.3]{Randell:1982:ODC}.",
  acknowledgement = ack-nhfb,
}

@Article{Kahan:SIGPLAN-27-1-61,
  author =       "W. Kahan",
  title =        "Analysis and Refutation of the {LCAS}",
  journal =      j-SIGPLAN,
  volume =       "27",
  number =       "1",
  pages =        "61--74",
  month =        jan,
  year =         "1992",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Kahaner:1989:NMS,
  author =       "David Kahaner and Cleve Moler and Stephen Nash",
  title =        "Numerical Methods and Software",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xii + 495",
  year =         "1989",
  ISBN =         "0-13-627258-4",
  ISBN-13 =      "978-0-13-627258-8",
  LCCN =         "TA345 .K341 1989",
  bibdate =      "Mon Jul 08 19:17:50 2013",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moler-cleve-b.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$50",
  series =       "Prentice-Hall series in computational mathematics",
  abstract =     "The following topics were dealt with: computer
                 arithmetic and computational errors; linear systems of
                 equations; interpolation; numerical quadrature; linear
                 least-squares data fitting; solution of nonlinear
                 equations; ordinary differential equations;
                 optimization and nonlinear least squares; simulation
                 and random numbers; and trigonometric approximation and
                 the fast Fourier transform. A significant part of the
                 book is a set of Fortran subroutines, these are
                 provided on a floppy disk for use on IBM PC compatibles
                 under MS DOS. They have been gathered from collections
                 such as Linpack, Quadpack, Minpack, SLATEC and others.
                 They represent the state of the art in mathematical
                 software and a significant part of each chapter acts as
                 a user guide to them and contains listings of the
                 routines.",
  acknowledgement = ack-nhfb,
  classcodes =   "B0120 (Education and training); B0290 (Numerical
                 analysis); C7310 (Mathematics); C4100 (Numerical
                 analysis)",
  classification = "B0120 (Education and training); B0290 (Numerical
                 analysis); C4100 (Numerical analysis); C7310
                 (Mathematics)",
  keywords =     "algorithms; approximation; computational errors;
                 Computational errors; Computer arithmetic; computer
                 arithmetic; differential equations; equations; fast
                 Fourier transform; Fast Fourier transform; floppy disk;
                 Floppy disk; FORTRAN listings; Fortran subroutines; IBM
                 PC compatibles; interpolation; Interpolation; linear
                 least-; Linear least-squares data fitting; linear
                 systems of; Linear systems of equations; Linpack;
                 mathematical software; Mathematical software;
                 mathematics computing; Minpack; Nonlinear equations;
                 nonlinear equations; nonlinear least; Nonlinear least
                 squares; numerical methods; numerical quadrature;
                 Numerical quadrature; optimization; Optimization;
                 ordinary; Ordinary differential equations; Quadpack;
                 random numbers; Random numbers; Simulation; simulation;
                 SLATEC; squares; squares data fitting; theory;
                 trigonometric; Trigonometric approximation; user guide;
                 User guide",
  review =       "ACM CR 8911-0779",
  subject =      "G.1 Mathematics of Computing, NUMERICAL ANALYSIS \\
                 F.2.1 Theory of Computation, ANALYSIS OF ALGORITHMS AND
                 PROBLEM COMPLEXITY, Numerical Algorithms and Problems,
                 Computation of transforms",
  tableofcontents = "Acknowledgments / xi \\
                 \\
                 1 Introduction \\
                 1.1 Why a New Book? / 1 \\
                 1.2 The Subroutines / 4 \\
                 1.3 Mathematical Software --- an Example: Square Root
                 of Sum of Squares / 7 \\
                 1.4 Portability / 9 \\
                 1.5 Software Design: Error Handling / 10 \\
                 1.6 Software Design: Scratch Storage / 11 \\
                 1.7 Historical Perspective: Backus and the Fortran
                 Language / 12 \\
                 1.8 Other Useful Sources of Information / 13 \\
                 1.9 Problems / 15 \\ \\
                 \\
                 2 Computer Arithmetic and Computational Errors / 17 \\
                 2.1 Introduction / 17 \\
                 2.2 Representation of Numbers / 21 \\
                 2.3 Machine Constants / 24 \\
                 2.4 Errors In Scientific Computing / 27 \\
                 *2.5 Extrapolation / 31 \\
                 2.6 Historical Perspective: Ekert and Mauchly / 33 \\
                 2.7 Problems / 35 \\ \\
                 \\
                 3 Linear Systems of Equations / 41 \\
                 3.1 Introduction / 41 \\
                 3.2 Linear Systems For Stored Matrices / 44 \\
                 3.3 Subroutine SGEFS / 54 \\
                 3.4 Historical Perspective: J. H. Wilkinson / 57 \\
                 3.5 Column-oriented Algorithms / 59 \\
                 *3.6 More About Condition Numbers / 61 \\
                 *3.7 Norms and Error Analysis / 66 \\
                 *3.8 Estimating the Condition Number / 68 \\
                 3.9 Further Ideas / 70 \\
                 3.10 Problems / 75 \\ \\
                 \\
                 4 Interpolation / 81 \\
                 4.1 Introduction / 81 \\
                 4.2 Polynomial Interpolation / 87 \\
                 4.3 Using Other Basis Functions / 89 \\
                 4.4 How Good Is Polynomial Interpolation? / 93 \\
                 4.5 Historical Perspective: Runge / 95 \\
                 4.6 Evaluation of Polynomials / 96 \\
                 4.7 Piecewise Linear Interpolation / 97 \\
                 4.8 Piecewise Cubic Functions / 100 \\
                 4.9 PCHIP, Piecewise Cubic Hermite Interpolation
                 Package / 104 \\
                 *4.10 Cubic Hermite Interpolation --- Details / 106 \\
                 4.11 Cubic Splines / 108 \\
                 4.12 Practical Differences Between Splines and Cubic
                 Hermites / 110 \\
                 4.13 B{\'e}zier Curves / 114 \\
                 *4.14 B-splines / 120 \\
                 4.15 Problems / 125 \\ \\
                 \\
                 5 Numerical Quadrature / 138 \\
                 5.1 Introduction / 138 \\
                 5.2 One Dimensional Quadrature Rules and Formulas / 140
                 \\
                 5.3 Change of Interval / 148 \\
                 5.4 Compound Quadrature Rules and Error Estimates / 149
                 \\
                 5.5 Gauss--Kronrod Quadrature Rules / 153 \\
                 5.6 Automatic and Adaptive Quadrature Algorithms / 155
                 \\
                 5.7 Subroutines QIDA and QKI5 / 157 \\
                 5.8 Data Integration / 160 \\
                 5.9 Infinite and Semi-infinite Intervals / 163 \\
                 *5.10 Double Integrals / 169 \\
                 5.11 Monte Carlo Methods / 176 \\
                 5.12 Historical Perspective: Ulam (1909--1984) and von
                 Neumann (1903--1957) / 179 \\
                 5.13 Problems / 181 \\ \\
                 \\
                 6 Linear Least-Squares Data Fitting / 190 \\
                 6.1 Introduction / 190 \\
                 6.2 Exploring Data / 196 \\
                 6.3 The Normal Equations / 201 \\
                 6.4 Orthogonal Factorizations / 203 \\
                 6.5 Subroutine SQRLS / 210 \\
                 6.6 Historical Perspective: Gauss / 212 \\
                 *6.7 Degenerate Least-squares Problems / 214 \\
                 *6.8 The Singular-value Decomposition / 218 \\
                 *6.9 The Null-space Problem / 223 \\
                 6.10 Problems / 226 \\ \\
                 \\
                 7 Solution of Nonlinear Equations / 235 \\
                 7.1 Introduction / 235 \\
                 7.2 Methods For Computing Real Roots / 239 \\
                 7.3 Subroutine FZERO / 248 \\
                 7.4 Historical Perspective: {\'E}variste Galois / 251
                 \\
                 7.5 Systems of Nonlinear Equations / 253 \\
                 7.6 Subroutine SNSQE / 258 \\
                 7.7 Problems / 260 \\
                 7.8 Prologues: FZERO and SNSQE / 264 \\ \\
                 \\
                 8 Ordinary Differential Equations / 272 \\
                 8.1 Introduction / 272 \\
                 8.2 Stable and Unstable Equations, Numerical Methods /
                 280 \\
                 8.3 Stiff Differential Equations / 284 \\
                 8.4 Euler's Method / 285 \\
                 8.5 Accuracy and Stability of Numerical Methods / 287
                 \\
                 8.6 Order of an Integration Method / 294 \\
                 8.7 Subroutine SDRIV2 / 295 \\
                 8.8 Implicit Methods / 298 \\
                 8.9 Multi-step Methods / 303 \\
                 *8.10 Order and Error of a Multi-step Method / 304 \\
                 8.11 Stability For Multi-step Methods / 306 \\
                 8.12 Functional Iteration and Newton's Method For
                 Solving the Implicit Equations / 306 \\
                 *8.13 Ozone In the Atmosphere --- a Stiff System / 311
                 \\
                 8.14 Multi-value Methods / 314 \\
                 8.15 An Example of Multi-value / 317 \\
                 8.16 Other Multi-value Methods / 319 \\
                 8.17 Relation of Multi-step and Multi-value Methods /
                 321 \\
                 *8.18 Attractive Characteristics of Multi-value: Step
                 Size and Order Changing / 322 \\
                 *8.19 Taylor Series and Runge Kutta Methods / 325 \\
                 *8.20 Some Topics Omitted / 329 \\
                 8.21 Problems / 331 \\
                 8.22 Prologue: SDRIV2 / 341 \\ \\
                 \\
                 9 Optimization and Nonlinear Least Squares / 347 \\
                 9.1 Introduction / 347 \\
                 9.2 One-dimensional Optimization / 350 \\
                 9.3 Subroutine FMIN / 361 \\
                 9.4 Optimization In Many Dimensions / 363 \\
                 9.5 Subroutine UNCMIN / 370 \\
                 9.6 Nonlinear Data Fitting / 372 \\
                 9.7 Historical Perspective: Sir Isaac Newton
                 (1642--1727) / 374 \\
                 9.8 Further Ideas / 376 \\
                 9.9 Problems / 377 \\
                 9.10 Prologues: FMIN and UNCMIN / 381 \\ \\
                 \\
                 10 Simulation and Random Numbers / 385 \\
                 10.1 Introduction / 385 \\
                 10.2 Random Numbers / 387 \\
                 10.3 Generation of Uniformly Distributed Numbers / 389
                 \\
                 10.4 Applications of Random Numbers: Brownian Motion
                 and Fractals / 392 \\
                 10.5 Congruential and Fibonacci Generators / 395 \\
                 10.6 Function UNI / 397 \\
                 10.7 Sampling From Other Distributions / 397 \\
                 10.8 Function RNOR / 400 \\
                 *10.9 Example: Radiation Shielding and Reactor
                 Criticality / 403 \\
                 *10.10 Problems / 404 \\
                 10.11 Prologues: UNI and RNOR / 410 \\ \\
                 \\
                 11 Trigonometric Approximation and the Fast Fourier
                 Transform / 413 \\
                 11.1 Introduction / 413 \\
                 11.2 Fourier Integral Transform, Discrete-Fourier
                 Transform, and Fourier Series / 414 \\
                 11.3 Energy and Power / 417 \\
                 11.4 Historical Perspective: Fourier (1786--1830) / 421
                 \\
                 11.5 Practical Computation of Fourier Coefficients; The
                 Discrete Fourier Transform / 422 \\
                 11.6 Subroutines EZFFTF and EZFFTB / 427 \\
                 11.7 Truncated Fourier Series as an Approximation / 430
                 \\
                 11.8 Relationships Between Fourier Transforms and
                 Fourier Series / 437 \\
                 11.9 Least Squares Applications: El Nino / 441 \\
                 11.10 The Fast Fourier Transform / 445 \\
                 *11.11 Complex Representation / 448 \\
                 *11.12 Two-dimensional Transforms / 454 \\
                 *11.13 Convolution and Correlation / 458 \\
                 *11.14 Historical Perspective: the Fast Fourier
                 Transform / 465 \\
                 11.15 Problems / 466 \\
                 11.16 Prologues: EZFFTF, EZFFTB, CFFTF, CFFTB and
                 CFFT2D / 470 \\ \\
                 \\
                 Bibliography / 476 \\ \\
                 \\
                 Index / 483",
  thesaurus =    "FORTRAN listings; Mathematics computing; Numerical
                 methods",
  treatment =    "G General Review; P Practical; T Theoretical or
                 Mathematical",
}

@Book{Kahn:1974:C,
  author =       "David Kahn",
  title =        "The Codebreakers",
  publisher =    "Weidenfeld and Nicolson",
  address =      "London, UK",
  edition =      "Abridged",
  pages =        "xvi + 576",
  year =         "1974",
  ISBN =         "0-02-560460-0, 0-297-76785-2",
  ISBN-13 =      "978-0-02-560460-5, 978-0-297-76785-5",
  LCCN =         "Z103 .K28 1974",
  bibdate =      "Thu Jul 23 17:02:35 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "The first comprehensive history of secret
                 communication from ancient times to the threshold of
                 outer space.",
  acknowledgement = ack-nhfb,
  subject =      "Cryptography; History; Ciphers; Cryptographie;
                 Histoire; Ciphers; Cryptography; Codierung;
                 Geheimschrift; Geschichte; Informationstheorie;
                 Kryptologie; Cryptographers; Informationstheorie;
                 Geheimschrift; Geschichte; Codierung; Kryptologie",
  tableofcontents = "A few words \\
                 One day of MAGIC \\
                 The pageant of cryptology \\
                 The first 3,000 years \\
                 The rise of the West \\
                 On the origin of a species \\
                 The era of the black chambers \\
                 The contribution of the dilettantes \\
                 Crises of the Union \\
                 The professor, the soldier, and the man on Devil's
                 Island \\
                 Room 40 \\
                 A war of intercepts \\
                 Two Americans \\
                 Secrecy for sale \\
                 Duel in the ether: the Axis \\
                 Duel in the ether: neutrals and Allies \\
                 Censors, scramblers, and spies \\
                 The scrutable orientals \\
                 PYCCKAR KPNNTONOTNR \\
                 N.S.A. \\
                 Sideshows \\
                 The anatomy of cryptology \\
                 Heterogeneous impulses \\
                 Rumrunners, businessmen, and makers of non-secret codes
                 \\
                 Ciphers in the past tense \\
                 The pathology of cryptology \\
                 Paracryptology \\
                 Ancestral voices \\
                 Messages from outer space",
}

@Book{Kahn:1996:CSS,
  author =       "David Kahn",
  title =        "The Codebreakers: the Story of Secret Writing",
  publisher =    "Scribner",
  address =      "New York, NY, USA",
  edition =      "Revised",
  pages =        "xviii + 1181",
  year =         "1996",
  ISBN =         "0-684-83130-9",
  ISBN-13 =      "978-0-684-83130-5",
  LCCN =         "Z103 .K28 1996",
  MRclass =      "11T71, 94A05",
  bibdate =      "Thu Jul 23 17:00:42 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "With a new chapter on computer security issues, this
                 updated and revised history of codes and codebreaking
                 takes the reader from the protocryptography of Egyptian
                 Pharoah Khnuumhotep II through to the speculations of
                 scientists solving messages from outer space.",
  acknowledgement = ack-nhfb,
  remark =       "Revised and updated from 1967.",
  tableofcontents = "One day of magic \\
                 The first 3,000 years \\
                 The rise of the west \\
                 On the origin of a species \\
                 The era of the black chambers \\
                 The contribution of the Dilettantes \\
                 Crises of the union \\
                 The professor, the soldier, and the man on devil's
                 island \\
                 Room 40 \\
                 A war of intercepts: I \\
                 A war of intercepts: II \\
                 Two Americans \\
                 Secrecy for sale \\
                 Duel in the ether: the axis \\
                 Duel in the ether: neutrals and allies \\
                 Censors, scramblers, and spies \\
                 The scrutable orientals \\
                 Russkaya Kriptologiya \\
                 N.S.A. \\
                 The anatomy of cryptology \\
                 Heterogeneous impulses \\
                 Rumrunners, businessmen, and makers of non-secret codes
                 \\
                 Ciphers in the past tense \\
                 The pathology of cryptology \\
                 Ancestral voices \\
                 Messages from outer space \\
                 Cryptology goes public",
  xxnote =       "See \cite{Tuchman:1966:ZT}.",
}

@Misc{Kahn:c,
  author =       "Philippe Kahn",
  year =         "1987",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Borland International, 1800 Green Hills Road, P. O.
                 Box 660005, Scotts Valley, CA 95066-0005. The quote ``C
                 is a write-only language'' was attributed to Kahn by a
                 trade journal columnist",
  acknowledgement = ack-nhfb,
}

@Article{Kahrs:ditroff,
  author =       "Mark Kahrs and Lee Moore",
  title =        "Adventures with Typesetter-Independent {TROFF}",
  journal =      j-USENIX-SCP,
  pages =        "258--269",
  month =        jun # " 12--15",
  year =         "1984",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Article{Kajiya:grey-scale,
  author =       "J. Kajiya and M. Ullner",
  title =        "Filtering High Quality Text for Display on Raster Scan
                 Devices",
  journal =      j-SIGGRAPH,
  volume =       "15",
  number =       "3",
  pages =        "7--15",
  month =        aug,
  year =         "1981",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See more recent work in \cite{Naiman:grey-scale}.",
  acknowledgement = ack-nhfb,
}

@Book{Kane:1987:MRR,
  author =       "Gerry Kane",
  title =        "{MIPS R2000 RISC} Architecture",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  year =         "1987",
  ISBN =         "0-13-584749-4",
  ISBN-13 =      "978-0-13-584749-7",
  LCCN =         "QA76.8.M52 K36 1987",
  bibdate =      "Wed Dec 15 17:51:38 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Kane:1992:MRA,
  author =       "Gerry Kane and Joe Heinrich",
  title =        "{MIPS RISC} Architecture",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  year =         "1992",
  ISBN =         "0-13-590472-2",
  ISBN-13 =      "978-0-13-590472-5",
  LCCN =         "QA76.8.M52 K37 1992",
  bibdate =      "Wed Dec 15 10:35:45 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/microchip.bib",
  acknowledgement = ack-nhfb,
  keywords =     "computer architecture; MIPS R2000 series
                 microprocessors; reduced instruction set computers",
  tableofcontents = "RISC Architecture: An Overview \\
                 MIPS Processor Architecture Overview \\
                 CPU Instruction Set Summary \\
                 Memory Management System \\
                 Caches \\
                 Exception Processing \\
                 FPU Overview \\
                 FPU Instruction Set Summary and Instruction Pipeline
                 \\
                 Floating Point Exceptions \\
                 Appendixes \\
                 Index",
}

@Book{Kane:1996:PRA,
  author =       "Gerry Kane",
  title =        "{PA-RISC 2.0} Architecture",
  publisher =    pub-PHPTR,
  address =      pub-PHPTR:adr,
  pages =        "various",
  year =         "1996",
  ISBN =         "0-13-182734-0",
  ISBN-13 =      "978-0-13-182734-9",
  LCCN =         "QA76.8.H48K36 1996",
  bibdate =      "Tue Jan 09 12:34:37 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$34.40",
  URL =          "http://devresource.hp.com/devresource/Docs/Refs/PA2_0/index.html;
                 http://devresource.hp.com/devresource/Docs/Refs/PA2_0/updates/index.html",
  abstract =     "This is the authoritative definition of
                 Hewlett-Packard's 2.0 PA-RISC architecture, one of the
                 most mature and efficient RISC (Reduced Instruction Set
                 Computer) processor architectures in the industry.
                 PA-RISC is the foundation for machines proving
                 especially well-suited for such markets as high
                 performance graphics, mission critical transaction
                 processing, and emerging multimedia applications such
                 as interactive video services.",
  acknowledgement = ack-nhfb,
  keywords =     "Hewlett--Packard computers; PA-RISC microprocessors",
  tableofcontents = "1: Overview \\
                 2: Processing Resources \\
                 3: Addressing and Access Control \\
                 4: Control Flow \\
                 5: Interruptions \\
                 6: Instruction Set Overview \\
                 7: Instruction Descriptions \\
                 8: Floating-point Coprocessor \\
                 9: Floating-Point Instruction Set \\
                 10: Floating-Point Exceptions \\
                 11: Performance Monitor Coprocessor \\
                 B: Instruction Formats \\
                 C: Operation Codes \\
                 D: Conditions \\
                 E: Instruction Notation Control Structures \\
                 F: TLB and Cache Control \\
                 G: Memory Ordering Model \\
                 H: Address Formation Details \\
                 I: Programming Notes \\
                 PA-RISC 2 Instruction Completers and Pseudo-Ops",
}

@Book{Kanigel:1991:MWK,
  author =       "Robert Kanigel",
  title =        "The Man Who Knew Infinity --- a Life of the Genius
                 {Ramanujan}",
  publisher =    pub-COLLIER-MACMILLAN,
  address =      pub-COLLIER-MACMILLAN:adr,
  pages =        "ix + 438",
  year =         "1991",
  ISBN =         "0-684-19259-4",
  ISBN-13 =      "978-0-684-19259-8",
  LCCN =         "QA29.R3 K36 1991",
  bibdate =      "Fri Apr 1 18:24:29 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$27.95",
  abstract =     "A biography of one of the most innovative
                 mathematicians of all time traces the rise of Srinivasa
                 Ramanujan from his days as a clerk to his collaboration
                 with one of England's greatest mathematicians.",
  acknowledgement = ack-nhfb,
  tableofcontents = "In the temple's coolness / 1887 to 1903 \\
                 Ranging with delight / 1903--1908 \\
                 The search for patrons / 1908--1913 \\
                 Hardy / G. H. Hardy to 1913 \\
                 ``I beg to introduce myself \ldots{}'' / 1913 to 1914
                 \\
                 Ramanujan's spring / 1914 to 1916 \\
                 The English chill / 1916 to 1918 \\
                 ``In somewhat indifferent health'' / from 1918",
}

@Book{Kaplan:1999:NNH,
  author =       "Robert Kaplan",
  title =        "The Nothing That Is: a Natural History of Zero",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  pages =        "xii + 225",
  year =         "1999",
  ISBN =         "0-19-512842-7 (hardcover), 0-19-514237-3 (paperback),
                 1-280-53045-6, 1-4294-0474-4 (e-book)",
  ISBN-13 =      "978-0-19-512842-0 (hardcover), 978-0-19-514237-2
                 (paperback), 978-1-280-53045-6, 978-1-4294-0474-7
                 (e-book)",
  LCCN =         "QA141 .K36 1999",
  bibdate =      "Mon Dec 06 16:15:22 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$22.00",
  abstract =     "In this book, Kaplan shows how zero is a lens through
                 which we can see the evolution of mathematics as our
                 tool for understanding the universe. Where did zero
                 come from --- and what, exactly, does it mean? The
                 Nothing That Is begins as a mystery story, tracing back
                 to ancient times the way this symbol for nothing
                 developed, constantly changing shape, even going
                 underground at times. The trail leads from Babylon
                 through Athens, to India, then to Europe in the Middle
                 Ages. Brought to the West by Arab traders, zero was
                 called ``dangerous Saracen magic'' at first, but
                 quickly made itself indispensable. With the invention
                 of calculus in the seventeenth century, zero became a
                 linchpin of the Scientific Revolution. And in our own
                 time, even deeper layers of this thing that is nothing
                 are coming to light: our computers speak only in zeros
                 and ones, and modern mathematics and physics have shown
                 that ``nothing'' can be the source of everything.",
  acknowledgement = ack-nhfb,
  tableofcontents = "The lens \\
                 Mind puts its stamp on matter \\
                 The Greeks had no word for it \\
                 Travelers' tales \\
                 Eastward \\
                 Dust \\
                 Into the unknown \\
                 A paradigm shifts \\
                 A Mayan interlude: the dark side of counting \\
                 Much ado \\
                 Envoys of emptiness \\
                 A sypher in augrim \\
                 The year, next year, sometimes, never \\
                 Still it moves \\
                 Entertaining angels \\
                 The power of nothing \\
                 Knowing squat \\
                 The fabric of this vision \\
                 Leaving no wrack behind \\
                 Almost nothing \\
                 Slouching toward Bethlehem \\
                 Two victories, a defeat and distant thunder \\
                 Is it out there? \\
                 Bath-house with spiders \\
                 a land where it was always afternoon \\
                 Was Lear right? \\
                 The unthinkable",
}

@Book{Kaplan:2020:BPG,
  author =       "Fred M. Kaplan",
  title =        "The Bomb: Presidents, Generals, and the Secret History
                 of Nuclear War",
  publisher =    "Simon and Schuster Paperbacks",
  address =      "New York, NY, USA",
  pages =        "372 + 8",
  year =         "2020",
  ISBN =         "1-982107-29-4, 1-982107-30-8 (paperback),
                 1-982107-31-6 (e-book)",
  ISBN-13 =      "978-1-982107-29-1, 978-1-982107-30-7 (paperback),
                 978-1-982107-31-4 (e-book)",
  LCCN =         "U264.3 .K37 2021",
  bibdate =      "Fri Jun 24 13:18:22 MDT 2022",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Pulitzer Prize-winning journalist Fred Kaplan takes us
                 into the White House Situation Room, the Joint Chiefs
                 of Staff's ``Tank'' in the Pentagon, and the vast
                 chambers of Strategic Command in Omaha to bring us the
                 untold stories --- based on exclusive interviews and
                 previously classified documents --- of how America's
                 presidents and generals have thought about, threatened,
                 broached, and, in some cases, just barely avoided
                 nuclear war from the dawn of the atomic age until
                 now.",
  acknowledgement = ack-nhfb,
  subject =      "Nuclear weapons; Government policy; United States;
                 History; Nuclear arms control; Nuclear disarmament;
                 National security; Armes nucl{\'e}aires; Politique
                 gouvernementale; {\'E}tats-Unis; Histoire;
                 Contr{\^o}le; D{\'e}sarmement nucl{\'e}aire; National
                 security.; Government policy.; Nuclear disarmament.;
                 International relations.; Military; Research.; Military
                 policy",
  tableofcontents = "``Killing a nation'' \\
                 The race begins \\
                 The crises \\
                 ``This goddamn poker game'' \\
                 Madman theories \\
                 Bargaining chips \\
                 ``A super idea'' \\
                 Pulling back the curtain \\
                 ``A shrimp among whales'' \\
                 ``Let's stipulate that this is all insane'' \\
                 ``Fire and fury.''",
}

@Book{Karin:1987:SE,
  author =       "Sidney Karin and Norris Parker Smith",
  title =        "The Supercomputer Era",
  publisher =    pub-HBJ,
  address =      pub-HBJ:adr,
  pages =        "x + 313",
  year =         "1987",
  ISBN =         "0-15-186787-9",
  ISBN-13 =      "978-0-15-186787-5",
  LCCN =         "QA76.5 .K356 1987",
  bibdate =      "Wed Dec 15 10:35:49 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Karow:1987:DFT,
  author =       "Peter Karow",
  title =        "Digital Formats for Typefaces",
  publisher =    pub-URW,
  address =      pub-URW:adr,
  pages =        "400",
  year =         "1987",
  ISBN =         "3-926515-01-5",
  ISBN-13 =      "978-3-926515-01-8",
  LCCN =         "Z253.3 .K371 1987",
  bibdate =      "Wed Dec 15 10:35:50 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@TechReport{Karp:TR-31-81,
  author =       "R. M. Karp and M. O. Rabin",
  title =        "Efficient Randomized Pattern-Matching Algorithms",
  number =       "TR-31-81",
  institution =  "Harvard University",
  address =      "Cambridge, MA, USA",
  year =         "1981",
  bibdate =      "Sun May 02 07:50:09 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See \cite{Baeza-Yates:j-CACM-35-10-74}.",
  acknowledgement = ack-nhfb,
}

@Book{Karski:2001:SSS,
  author =       "Jan Karski",
  title =        "Story of a Secret State",
  publisher =    pub-HOUGHTON-MIFFLIN,
  address =      pub-HOUGHTON-MIFFLIN:adr,
  pages =        "vi + 391",
  year =         "2001",
  ISBN =         "1-931541-39-6 (hardcover)",
  ISBN-13 =      "978-1-931541-39-8 (hardcover)",
  LCCN =         "D802.P6 K3 2001",
  bibdate =      "Thu Feb 23 07:42:11 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  subject =      "World War, 1939--1945; Personal narratives; Polish
                 World War, 1939--1945 --- Poland; Poland --- History
                 --- Occupation, 1939--1945",
  tableofcontents = "Note on the Text / xi \\
                 Publisher's Note / xii \\
                 Preface / xv \\
                 Foreword / xvii \\
                 Biographical Essay of Jan Karski / xxv \\
                 1 Defeat / 1 \\
                 2 Prisoner in Russia / 15 \\
                 3 Exchange and Escape / 28 \\
                 4 Devastated Poland / 45 \\
                 5 The Beginning / 54 \\
                 6 Transformation / 66 \\
                 7 Initiation / 73 \\
                 8 Borecki / 79 \\
                 9 Contact between Cells / 89 \\
                 10 Mission to France / 101 \\
                 11 The Underground State / 117 \\
                 12 Caught by the Gestapo / 127 \\
                 13 Torture / 136 \\
                 14 The SS Hospital / 156 \\
                 15 Rescue / 168 \\
                 16 The ``Gardener'' / 180 \\
                 17 Propaganda from the Country / 189 \\
                 18 Execution of a Traitor / 207 \\
                 19 The Four Branches of the Underground / 218 \\
                 20 The Laskowa Apartment / 225 \\
                 21 Assignment in Lublin / 232 \\
                 22 Retribution / 240 \\
                 23 The Secret Press / 250 \\
                 24 My ``Conspiratorial Apparatus'' / 260 \\
                 25 The Liaison Women / 265 \\
                 26 Marriage per Procuram / 272 \\
                 27 School-Underground / 277 \\
                 28 Parliament in Poland / 293 \\
                 29 The Ghetto / 302 \\
                 30 ``To Die in Agony'' / 320 \\
                 31 Unter den Linden Revisited / 335 \\
                 32 Journey through France and Spain / 340 \\
                 33 My Report to the World / 358 \\
                 Notes / 367 \\
                 Glossary / 385 \\
                 Further Reading / 397 \\
                 Afterword / 401 \\
                 Index / 403",
}

@Book{Katz:2007:MEM,
  editor =       "Victor J. Katz and Annette Imhausen and Eleanor Robson
                 and Joseph W. Dauben and Kim Plofker and J. Lennart
                 Berggren",
  title =        "The mathematics of {Egypt}, {Mesopotamia}, {China},
                 {India}, and {Islam}: a sourcebook",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "xiv + 685",
  year =         "2007",
  ISBN =         "0-691-11485-4 (hardcover)",
  ISBN-13 =      "978-0-691-11485-9 (hardcover)",
  LCCN =         "QA22 .M3735 2007",
  bibdate =      "Sat Dec 15 07:28:32 MST 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://press.princeton.edu/titles/8583.html;
                 http://www.loc.gov/catdir/enhancements/fy0726/2006030851-b.html;
                 http://www.loc.gov/catdir/enhancements/fy0726/2006030851-d.html;
                 http://www.loc.gov/catdir/toc/ecip071/2006030851.html",
  abstract =     "In recent decades it has become obvious that
                 mathematics has always been a worldwide activity. But
                 this is the first book to provide a substantial
                 collection of English translations of key mathematical
                 texts from the five most important ancient and medieval
                 non-Western mathematical cultures, and to put them into
                 full historical and mathematical context. The
                 Mathematics of Egypt, Mesopotamia, China, India, and
                 Islam gives English readers a firsthand understanding
                 and appreciation of these cultures' important
                 contributions to world mathematics.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Mathematics, Ancient; Sources; Mathematics; History",
  tableofcontents = "Preface \\
                 Permissions \\
                 1 Introduction \\
                 1: Egyptian mathematics / Annette Imhausen \\
                 Preliminary remarks \\
                 1: Introduction \\
                 a: Invention of writing and number systems \\
                 b: Arithmetic \\
                 c: Metrology \\
                 2: Hieratic mathematical texts \\
                 a: Table texts \\
                 b: Problem texts \\
                 3: Mathematics in administrative texts \\
                 a: Middle Kingdom texts: the Reisner papyri \\
                 b: New Kingdom texts: Ostraca from Deir el Medina \\
                 4: Mathematics in the Graeco--Roman period \\
                 a: Context \\
                 b: Table texts \\
                 c: Problem texts \\
                 5: Appendices \\
                 a: Glossary of Egyptian terms \\
                 b: Sources \\
                 c: References \\
                 2: Mesopotamian mathematics / Eleanor Robson \\
                 1: Introduction \\
                 a: Mesopotamian mathematics through Western eyes \\
                 b: Mathematics and scribal culture in ancient Iraq \\
                 c: From tablet to translation \\
                 d: Explananda \\
                 2: The long third millennium, c. 3200--2000 BCE \\
                 a: Uruk in the late fourth millennium \\
                 b: Shuruppag in the mid-third millennium \\
                 c: Nippur and Girsu in the twenty-fourth century BCE
                 \\
                 d: Umma and Girsu in the twenty-first century BCE \\
                 3: The old Babylonian period, c. 2000--1600 BCE \\
                 a: Arithmetical and metrological tables \\
                 b: Mathematical problems \\
                 c: Rough work and reference lists \\
                 4: Later Mesopotamia, c. 1400--150 BCE \\
                 5: Appendices \\
                 a: Sources \\
                 b: References \\
                 3: Chinese mathematics / Joseph W. Dauben \\
                 Preliminary remarks \\
                 1: China: the historical and social context \\
                 2: Methods and procedures: counting rods, the
                 ``out-in'' principle \\
                 3: Recent archaeological discoveries: the earliest
                 yet-known bamboo text \\
                 4: Mathematics and astronomy: the Zhou bi suan jing and
                 right triangles (The Gou-gu or ``Pythagorean'' theorem)
                 \\
                 5: The Chinese ``Euclid'', Liu Hui \\
                 a: The Nine Chapters \\
                 b: The Sea Island Mathematical Classic \\
                 6: The ``Ten Classics'' of ancient Chinese mathematics
                 \\
                 a: Numbers and arithmetic: the Mathematical Classic of
                 Master Sun \\
                 b: The Mathematical Classic of Zhang Qiujian \\
                 7: Outstanding achievements of the Song and Yuan
                 dynasties (960--1368 CE) \\
                 a: Qin Jiushao \\
                 b: Li Zhi (Li Ye) \\
                 c: Yang Hui \\
                 d. Zhu Shijie \\
                 8: Matteo Ricci and Xu Guangxi, ``prefaces'' to the
                 first Chinese edition of Euclid's Elements (1607) \\
                 9: Conclusion \\
                 10: Appendices \\
                 a: Sources \\
                 b: Bibliographical guides \\
                 c: References \\
                 4: Mathematics in India / Kim Plofker \\
                 1: Introduction: origins of Indian mathematics \\
                 2: Mathematical texts in ancient India \\
                 a: The Vedas \\
                 b: The {\'S}ulbas{\=u}tras \\
                 c: Mathematics in other ancient texts \\
                 d: Number systems and numerals \\
                 3: Evolution of mathematics in medieval India \\
                 a: Mathematics chapters in Siddh{\=a}nta texts \\
                 b: Transmission of mathematical ideas to the Islamic
                 world \\
                 c: Textbooks on mathematics as a separate subject \\
                 d: The audience for mathematics education \\
                 e: Specialized mathematics: astronomical and
                 cosmological problems \\
                 4: The Kerala school \\
                 a: M{\=a}dhava, his work, and his school \\
                 b: Infinite series and the role of demonstrations \\
                 c: Other mathematical interests in the Kerala school
                 \\
                 5: Continuity and transition in the second millennium
                 \\
                 a: The ongoing development of Sanskrit mathematics \\
                 b: Scientific exchanges at the courts of Delhi and
                 Jaipur \\
                 c: Assimilation of ideas from Islam; mathematical table
                 texts \\
                 6: Encounters with modern Western mathematics \\
                 a: Early exchanges with European mathematics \\
                 b: European versus ``native'' mathematics education in
                 British India \\
                 c: Assimilation into modern global mathematics \\
                 7: Appendices \\
                 a: Sources \\
                 b: References \\
                 5: Mathematics in medieval Islam / J. Lennart Berggren
                 \\
                 1: Introduction \\
                 2: Appropriation of the ancient heritage \\
                 3: Arithmetic \\
                 4: Algebra \\
                 5: Number theory \\
                 6: Geometry \\
                 a: Theoretical geometry \\
                 b: Practical geometry \\
                 7: Trigonometry \\
                 8: Combinatorics \\
                 9: On mathematics \\
                 10: Appendices \\
                 a: Sources \\
                 b: References \\
                 Contributors \\
                 Index",
}

@Book{Katzan:1978:F,
  author =       "Harry {Katzan, Jr.}",
  title =        "{Fortran 77}",
  publisher =    pub-VAN-NOSTRAND-REINHOLD,
  address =      pub-VAN-NOSTRAND-REINHOLD:adr,
  pages =        "xvi + 207",
  year =         "1978",
  ISBN =         "0-442-24278-6",
  ISBN-13 =      "978-0-442-24278-7",
  LCCN =         "QA76.73 .F25 K373 1978",
  bibdate =      "Wed Dec 15 10:35:56 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Computer Science Series",
  acknowledgement = ack-nhfb,
}

@Book{Kaufman:1978:FCB,
  author =       "Roger Emanuel Kaufman",
  title =        "A Fortran Coloring Book",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "285",
  year =         "1978",
  ISBN =         "0-262-61026-4",
  ISBN-13 =      "978-0-262-61026-1",
  LCCN =         "QA76.73 F25 K38 1978",
  bibdate =      "Mon Dec 13 17:19:24 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$6.95",
  acknowledgement = ack-nhfb,
}

@Book{Kauzmann:1957:QCI,
  author =       "Walter Kauzmann",
  title =        "Quantum Chemistry: An Introduction",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "xii + 744",
  year =         "1957",
  LCCN =         "QD453 .K3 1957",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  remark =       "First Printing, 1957. Second Printing, 1959. Third
                 Printing, 1961. Fourth Printing, 1964. Fifth Printing,
                 1966.",
  tableofcontents = "Preface / v \\
                 Suggested Plan of Study / viii \\
                 1. Introduction / 1 \\
                 A. Chemistry as a Branch of Mechanics / 1 \\
                 B. The Structure and Aims of Scientific Theories / 3
                 \\
                 C. Quantum Mechanics as a Tool and as a Language / 8
                 \\
                 References / 10 \\
                 Part I: Mathematical Background \\
                 2. Some Basic Mathematical Concepts / 13 \\
                 A. Operators / 13 \\
                 B. Complex Numbers / 20 \\
                 C. Well Behaved Functions / 22 \\
                 D. Vectors / 23 \\
                 E. Probability Functions and Average Values / 27 \\
                 F. Series Expansions of Functions / 29 \\
                 G. Ordinary Differential Equations / 36 \\
                 H. Partial Differential Equations / 42 \\
                 I. Determinants / 46 \\
                 References / 50 \\
                 3. The Classical Theory of Vibrations I: Some Typical
                 Vibrating Systems / 51 \\
                 A. Vibrations in One Dimension / 51 \\
                 B. Vibrations of Two-Dimensional Systems / 72 \\
                 C. Vibrations of Three-Dimensional Systems / 99 \\
                 References / 108 \\
                 4. The Classical Theory of Vibrations II: Approximate
                 Methods for Complex Systems / 109 \\
                 A. The Sturm--Liouville Theory / 109 \\
                 B. The Variation Met hod / 118 \\
                 C. The Perturbation Method / 128 \\
                 D. The Use of Symmetry and Commutation Properties in
                 the Variation and Perturbation Methods / 138 \\
                 E. The Interaction of Vibrating Systems / 145 \\
                 References / 150 \\
                 Part II: General Principles of Quantum Mechanics \\
                 5. The Schroedinger Formulation of Quantum Mechanics /
                 153 \\
                 A. Some Fundamental Concepts used in Quantum Mechanics
                 / 153 \\
                 B. The Laws of Quantum Mechanics / 158 \\
                 C. Some Important Corollaries of the Laws of Quantum
                 Mechanics / 159 \\
                 D. The Quantum Mechanical Treatment of Chemical Systems
                 / 173 \\
                 E. Atomic Units / 176 \\
                 References / 178 \\
                 6. Some Solutions of the Steady State Schroedinger
                 Equation / 179 \\
                 I. Systems with Constant Potential Energy / 179 \\
                 A. Free Particles / 179 \\
                 B. Particles in Boxes / 183 \\
                 C. Systems involving Potential Walls of Finite Height /
                 188 \\
                 D. Rotating Bodies / 198 \\
                 II. Systems for which the Potential Energy is not
                 Constant / 201 \\
                 E. The One-Dimensional Harmonic Oscillator / 201 \\
                 F. The Sinusoidal Potential / 209 \\
                 G. The Hydrogen Atom and Hydrogen-Like Ions / 210 \\
                 H. The Hydrogen Molecular Ion, H$_2^+$ / 226 \\
                 I. The Morse Potential / 227 \\
                 J. The Virial Theorem / 229 \\
                 References / 233 \\
                 7. The Uncertainty Relations / 235 \\
                 A. Limitations on the Simultaneous Measurement of
                 Position and Momentum / 235 \\
                 B. Limitations on the Measurement of Energy in an
                 Observation of Limited Duration / 240 \\
                 C. Relationship of Zero-Point Energies to the
                 Uncertainty Principle / 241 \\
                 D. Zero-Point Energies and the Formation of Molecules /
                 243 \\
                 References / 246 \\
                 8. Angular Momentum in Quantum Mechanics / 247 \\
                 A. The Angular Momentum of a Single Particle / 247 \\
                 B. The Angular Momentum of Systems Composed of Many
                 Particles / 255 \\
                 C. Spectroscopic Notation Based on Angular Momentum /
                 260 \\
                 D. Use of Magnetic Fields in Studying the Angular
                 Momentum of Charged Particles / 261 \\
                 References / 270 \\
                 Part III: Atomic Systems \\
                 Hydrogen, Helium, and Electron Spin / 273 \\
                 A. The Experimental Determination of the Energy Levels
                 of Atoms / 273 \\
                 B. The Energy Levels, Wave Functions, and Spectrum of
                 Hydrogen / 278 \\
                 C. The Energy Levels, Wave Functions, and Spectrum of
                 Helium / 283 \\
                 D. Electron Spin and the Pauli Principle / 305 \\
                 References / 320 \\
                 1O. Atomic Structure II: Elements other than Hydrogen
                 and Helium / 322 \\
                 A. The Energies of Orbitals in Elements beyond Helium;
                 the Periodic System / 322 \\
                 B. Multiplet Structure / 336 \\
                 C. Spin-Orbit Interaction (Fine Structure) / 349 \\
                 D. The Magnetic Properties of Atoms / 365 \\
                 References / 370 \\
                 Part IV: Molecular Systems \\
                 11. Molecules and the Chemical Bond I: The First
                 Approximation / 375 \\
                 A. The Hydrogen Molecular Ion, H$_2^+$ / 376 \\
                 B. The Hydrogen Molecule, H$_2$ / 386 \\
                 C. Other Diatomic Molecules / 399 \\
                 D. Directed Valence Bonds in H$_2$O and NH$_3$ / 407
                 \\
                 E. Hybridization and Directed Valence Bonds / 409 \\
                 F. Multiple Bonds / 417 \\
                 G. Aromatic Compounds / 418 \\
                 References / 431 \\
                 12. Molecules and the Chemical Bond II: Difficulties in
                 Developing Satisfactory Quantitative Theories / 433 \\
                 A. Criteria for the Reliability of Approximate Wave
                 Functions / 434 \\
                 B. Some Problems in Constructing Accurate Molecular
                 Wave Functions / 440 \\
                 C. The Quantitative Treatment of Aromatic Hydrocarbons
                 / 459 \\
                 D. The Quantitative Comparison of Chemical Bonds
                 between Different Pairs of Atoms / 478 \\
                 References / 50 \\
                 13. Van der Waals Forces / 503 \\
                 A. General Discussion of Intermolecular Forces Not
                 Involving Chemical Bonds / 503 \\
                 B. The Interaction of a Pair of Dipoles / 505 \\
                 C. The London Forces between a Pair of Oscillating
                 Dipoles / 507 \\
                 D. London Forces between Two Hydrogen Atoms / 509 \\
                 E. London Forces between More Complex Atoms and
                 Molecules / 512 \\
                 References / 517 \\
                 Part V: Systems in Non-Stationary States \\
                 14. Time-Dependent Processes / 521 \\
                 A. The Behavior of Localized Clusters of Free Particles
                 / 521 \\
                 B. Perturbation Theory for Time-Dependent Processes /
                 524 \\
                 C. Resonance and the Rate of Electronic Tautomerism /
                 534 \\
                 D. Nonadiabatic Transitions / 536 \\
                 References / 545 \\
                 15. The Interactions of Matter with Light I: The
                 Classical Electron Theory of Optics / 546 \\
                 A. The Basic Assumptions in the Classical Electron
                 Theory of Optics / 547 \\
                 B. The Emission of Light by Excited Atoms and Molecules
                 / 556 \\
                 C. The Widths and Shapes of Spectral Lines / 563 \\
                 D. The Response of Bound Electrons to Light / 568 \\
                 E. The Scattering of Light and Some of its Consequences
                 / 584 \\
                 F. Other Modes of Producing Radiation / 610 \\
                 G. Optical Rotatory Power / 616 \\
                 References / 635 \\
                 16. The Interactions of Matter with Light II: Quantum
                 Mechanical Aspects / 637 \\
                 A. General Theory / 638 \\
                 B. Selection Rules for Dipole Transitions / 654 \\
                 C. Absorption Spectra and Color / 668 \\
                 D. The Relationship of Absorption and Dispersion / 688
                 \\
                 E. The Return of Excited Molecules to their Ground
                 States / 693 \\
                 F. The Quantum Mechanical Basis of Optical Rotatory
                 Power / 703 \\
                 References / 723 \\
                 Appendixes \\
                 I. Atomic Units / 729 \\
                 II. Conversion Factors for Energy Units / 730 \\
                 III. Hydrogen Atom Wave Functions / 730 \\
                 Index of Symbols / 732 \\
                 Subject Index / 734",
  xxISBN =       "none",
}

@Book{Kay:1992:GFF,
  author =       "David C. Kay and John R. Levine",
  title =        "Graphics File Formats",
  publisher =    pub-WINDCREST,
  address =      pub-WINDCREST:adr,
  pages =        "xviii + 278",
  year =         "1992",
  ISBN =         "0-8306-3060-0 (hardcover), 0-8306-3059-7 (paperback)",
  ISBN-13 =      "978-0-8306-3060-8 (hardcover), 978-0-8306-3059-2
                 (paperback)",
  LCCN =         "T385 .K376 1992",
  bibdate =      "Thu May 12 08:30:09 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/postscri.bib",
  price =        "US\$24.95",
  acknowledgement = ack-nhfb,
  tableofcontents = "Acknowledgments \\
                 Introduction \\
                 Graphics representation theory / 1 \\
                 Image compression / 21 \\
                 Choosing formats / 33 \\
                 PCX / 44 \\
                 MacPaint / 53 \\
                 TIFF / 60 \\
                 GIF / 96 \\
                 GEM bit image / 132 \\
                 IFF/ILBM / 136 \\
                 Truevision Targa / 151 \\
                 Microsoft Windows Device Independent Bitmap / 162 \\
                 WordPerfect Graphics / 169 \\
                 Sun Rasterfiles / 188 \\
                 PBM / 193 \\
                 X Window bitmaps / 199 \\
                 X Window Dump / 203 \\
                 JPEG / 211 \\
                 FITS / 235 \\
                 DXF / 245 \\
                 HPGL / 270 \\
                 Lotus PIC / 285 \\
                 UNIX plot format / 291 \\
                 PCL / 295 \\
                 Basic PostScript graphics / 312 \\
                 WMF / 338 \\
                 PICT / 372 \\
                 CGM / 386 \\
                 RIB / 394 \\
                 FLI/FLC / 412 \\
                 MPEG overview / 424 \\
                 QuickTime animation / 428 \\
                 Other file formats / 450 \\
                 Index / 458",
}

@Book{Kay:1995:GFF,
  author =       "David C. Kay and John R. Levine",
  title =        "Graphics File Formats",
  publisher =    pub-WINDCREST,
  address =      pub-WINDCREST:adr,
  edition =      "Second",
  pages =        "xx + 476",
  year =         "1995",
  ISBN =         "0-07-034025-0",
  ISBN-13 =      "978-0-07-034025-1",
  LCCN =         "T385.K376 1995",
  bibdate =      "Sat Oct 10 12:44:04 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$29.95",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "1: Graphics representation theory \\
                 2: Image compression \\
                 3: Choosing formats \\
                 4: PCX \\
                 5: MacPaint \\
                 6: TIFF \\
                 7: GIF \\
                 8: GEM bit image \\
                 9: IFF/ILBM \\
                 10: Truevision Targa \\
                 11: Microsoft Windows Device Independent Bitmap \\
                 12: WordPerfect Graphics \\
                 13: Sun Rasterfiles \\
                 14: PBM \\
                 15: X Window bitmaps \\
                 16: X Window Dump \\
                 17: JPEG \\
                 18: FITS \\
                 19: DXF \\
                 20: HPGL \\
                 21: Lotus PIC \\
                 22: UNIX plot format \\
                 23: PCL \\
                 24: Basic PostScript graphics \\
                 25: WMF \\
                 26: PICT \\
                 27: CGM \\
                 28: RIB \\
                 29: FLI/FLC \\
                 30: MPEG overview \\
                 31: QuickTime animation \\
                 32: Other file formats",
}

@Book{Kean:2010:DSO,
  author =       "Sam Kean",
  title =        "The disappearing spoon: and other true tales of
                 madness, love, and the history of the world from the
                 periodic table of the elements",
  publisher =    pub-LITTLE-BROWN,
  address =      pub-LITTLE-BROWN:adr,
  pages =        "vi + 391",
  year =         "2010",
  ISBN =         "0-316-05164-0",
  ISBN-13 =      "978-0-316-05164-4",
  LCCN =         "QD466 .K37 2010",
  bibdate =      "Thu Aug 12 12:07:04 MDT 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/foundchem.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 melvyl.cdlib.org:210/CDL90;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "chemical elements; miscellanea",
  tableofcontents = "Orientation: column by column, row by row.
                 Geography is destiny \\
                 Near twins and black sheep: the genealogy of elements
                 \\
                 The Gal{\'a}pagos of the periodic table \\
                 Making atoms, breaking atoms. Where atoms come from:
                 ``We are all star stuff'' \\
                 Elements in time of war \\
                 Completing the table-- with a bang \\
                 Extending the table, expanding the Cold War \\
                 Periodic confusion: the emergence of complexity. From
                 physics to biology \\
                 Poisoner's corridor: ``Ouch-ouch'' \\
                 Take two elements, call me in the morning \\
                 How elements deceive \\
                 The elements of human character. Political elements \\
                 Elements as money \\
                 Artistic elements \\
                 An element of madness \\
                 Element science today and tomorrow. Chemistry way, way
                 below zero \\
                 Spheres of splendor: the science of bubbles \\
                 Tools of ridiculous precision \\
                 Above (and beyond) the periodic table",
}

@Book{Kean:2012:VTO,
  author =       "Sam Kean",
  title =        "The Violinist's Thumb: and Other Lost Tales of Love,
                 War, and Genius, as Written by Our Genetic Code",
  publisher =    pub-LITTLE-BROWN,
  address =      pub-LITTLE-BROWN:adr,
  pages =        "ix + 403",
  year =         "2012",
  ISBN =         "0-316-18231-1 (hardcover)",
  ISBN-13 =      "978-0-316-18231-7 (hardcover)",
  LCCN =         "QH431 .K24 2012",
  bibdate =      "Wed Sep 12 18:03:53 MDT 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "In The Disappearing Spoon, bestselling author Sam Kean
                 unlocked the mysteries of the periodic table. In {\em
                 The Violinist's Thumb}, he explores the wonders of the
                 magical building block of life: DNA. There are genes to
                 explain crazy cat ladies, why other people have no
                 fingerprints, and why some people survive nuclear
                 bombs. Genes illuminate everything from JFK's bronze
                 skin (it wasn't a tan) to Einstein's genius. They prove
                 that Neanderthals and humans bred thousands of years
                 more recently than any of us would feel comfortable
                 thinking. They can even allow some people, because of
                 the exceptional flexibility of their thumbs and
                 fingers, to become truly singular violinists. Kean's
                 vibrant storytelling once again makes science
                 entertaining, explaining human history and whimsy while
                 showing how DNA will influence our species' future.",
  acknowledgement = ack-nhfb,
  subject =      "Human genetics; Miscellanea; Science / Life Sciences /
                 Genetics and Genomics; Science / Life Sciences /
                 Biology / General",
  tableofcontents = "Genes, freaks, DNA: how do living things pass down
                 traits to their children? \\
                 The near death of Darwin: why did geneticists try to
                 kill natural selection? \\
                 Them's the DNA breaks: how does nature read \\
                 and misread \\
                 DNA? \\
                 The musical scores of DNA: what kinds of information
                 does DNA store? \\
                 DNA vindication: why did life evolve so slowly, then
                 explode in complexity? \\
                 The survivors, the livers: what's our most ancient and
                 important DNA? \\
                 The Machiavelli microbe: how much human DNA is actually
                 human? \\
                 Love and atavisms: what genes make mammals mammals? \\
                 Humanzees and other near misses: when did humans break
                 away from monkeys, and why? \\
                 Scarlet A's, C's, G's, and T's: why did humans almost
                 go extinct? \\
                 Size matters: how did humans get such grotesquely large
                 brains? \\
                 The art of the gene: how deep in our DNA is artistic
                 genius? \\
                 The past is prologue sometimes: what can (and can't)
                 genes teach us about historical heroes? \\
                 Three billion little pieces: why don't humans have more
                 genes than other species? \\
                 Easy come, easy go?: how come identical twins aren't
                 identical? \\
                 Life as we do (and don't) know it: what the heck will
                 happen now? \\
                 Epilogue: genomics gets personal",
}

@Book{Keating:2018:LNP,
  author =       "Brian (Brian Gregory) Keating",
  title =        "Losing the {Nobel Prize}: a story of cosmology,
                 ambition, and the perils of science's highest honor",
  publisher =    pub-NORTON,
  address =      pub-NORTON:adr,
  pages =        "xxi + 326",
  year =         "2018",
  ISBN =         "1-324-00091-0 (hardcover)",
  ISBN-13 =      "978-1-324-00091-4 (hardcover)",
  LCCN =         "QB991.B54 K43 2018",
  bibdate =      "Sat Apr 21 10:28:50 2018",
  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 =     "The inside story of a quest to unlock one of
                 cosmology's biggest mysteries, derailed by the lure of
                 the Nobel Prize. What would it have been like to be an
                 eyewitness to the Big Bang? In 2014, astronomers
                 wielding BICEP2, the most powerful cosmology telescope
                 ever made, thought they'd glimpsed the spark that
                 ignited the Big Bang. Millions around the world tuned
                 in to the announcement, and Nobel whispers began to
                 spread. But had these cosmologists truly read the
                 cosmic prologue or, driven by ambition in pursuit of
                 Nobel gold, had they been deceived by a galactic
                 mirage? In \booktitle{Losing the Nobel Prize},
                 cosmologist Brian Keating --- who first conceived of
                 the BICEP (Background Imaging of Cosmic Extragalactic
                 Polarization) experiments --- tells the inside story of
                 BICEP2's detection and the ensuing scientific drama.
                 Along the way, Keating provocatively argues that the
                 Nobel Prize actually hampers scientific progress by
                 encouraging speed and competition while punishing
                 inclusivity, collaboration, and bold innovation. To
                 build on BICEP2's efforts to reveal the cosmos'
                 ultimate secrets --- indeed, to advance science itself
                 --- the Nobel Prize must be radically reformed.",
  acknowledgement = ack-nhfb,
  subject =      "Big bang theory; Astronomy; Awards; Cosmology;
                 Science; Methodology; Nobel Prizes",
  tableofcontents = "Introduction: a Noble will / ix \\
                 1: Reading the cosmic prologue / 1 \\
                 2: Losing my religions / 8 \\
                 3: A brief history of time machines / 28 \\
                 4: The bigger the bang, the bigger the problems / 51
                 \\
                 5L Broken lens 1: the Nobel Prize's credit problem / 81
                 \\
                 6: Ashes to ashes / 92 \\
                 7: The spark that ignited the Big Bang / 110 \\
                 8: BICEP: the ultimate time machine / 135 \\
                 9: Heroes of fire, heroes of ice / 150 \\
                 10: Broken lens 2: the Nobel Prize's cash problem / 171
                 \\
                 11: Elation! / 189 \\
                 12: Inflation and its discontents / 205 \\
                 13: Broken lens 3: the Nobel Prize's collaboration
                 problem / 219 \\
                 14: Deflation / 233 \\
                 15: Poetry for physicists / 249 \\
                 16: Restoring Alfred's vision / 262 \\
                 Epilogue: an ethical will / 275 \\
                 Acknowledgments / 283 \\
                 Notes / 289 \\
                 Index / 313",
}

@Book{Keay:2000:GAD,
  author =       "John Keay",
  title =        "The Great Arc: the Dramatic Tale of How {India} Was
                 Mapped and {Everest} Was Named",
  publisher =    pub-HARPERCOLLINS,
  address =      pub-HARPERCOLLINS:adr,
  pages =        "xxi + 182",
  year =         "2000",
  ISBN =         "0-06-019518-5 (paperback), 0-00-257062-9 (hardcover)",
  ISBN-13 =      "978-0-06-019518-2 (paperback), 978-0-00-257062-6
                 (hardcover)",
  LCCN =         "QB296.I5 K43 2000",
  bibdate =      "Mon Aug 27 09:45:39 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$13.00",
  abstract =     "The Great Indian Arc of the Meridian, begun in 1800,
                 was the longest measurement of the earth's surface ever
                 to have been attempted. Its 1,600 miles of inch-perfect
                 survey took nearly fifty years, cost more lives than
                 most contemporary wars, and involved equations more
                 complex than any in the precomputer age. Rightly hailed
                 as ``one of the most stupendous works in the history of
                 science,'' it was also one of the most perilous.
                 Through hill and jungle, flood and fever, an intrepid
                 band of surveyors carried the Arc from the southern tip
                 of the Indian subcontinent up into the frozen wastes of
                 the Himalayas. William Lambton, an endearing genius,
                 had conceived the idea; George Everest, an impossible
                 martinet, completed it. Both found the technical
                 difficulties horrendous. With instruments weighing a
                 half-ton, their observations often had to be conducted
                 from flimsy platforms ninety feet above the ground or
                 from mountain peaks enveloped in blizzard. Malaria
                 wiped out whole survey parties; tigers and scorpions
                 also took their toll. Yet the results were
                 commensurate. The Great Arc made possible the mapping
                 of the entire Indian subcontinent and the development
                 of its roads, railways and telegraphs. India as we now
                 know it was defined in the process. The Arc also
                 resulted in the first accurate measurements of the
                 Himalayas, an achievement that was acknowledged by the
                 naming of the world's highest mountain in honor of
                 Everest. More important still, by producing new values
                 for the curvature of the earth's surface, the Arc
                 significantly advanced our knowledge of the exact shape
                 of our planet.",
  acknowledgement = ack-nhfb,
  tableofcontents = "A Baptism of Fever \\
                 The Elusive Lambton \\
                 Tall Tales from the Hills \\
                 Droog Dependent \\
                 The Far-Famed Geodesist \\
                 Everywhere in Chains \\
                 Crossing the Rubicon \\
                 So Far as Our Knowledge Extends \\
                 Through the Haze of Hindustan \\
                 Et in Arcadia \\
                 A Stupendous Snowy Mass",
}

@Book{Kehoe:1993:ZAI,
  author =       "Brendan P. Kehoe",
  title =        "Zen and the Art of the {Internet}: a Beginner's
                 Guide",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  edition =      "Second",
  pages =        "xv + 112",
  year =         "1993",
  ISBN =         "0-13-010778-6",
  ISBN-13 =      "978-0-13-010778-7",
  LCCN =         "TK5105.875.I57 K44 1993",
  bibdate =      "Wed Dec 15 10:36:04 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/internet.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "The first edition of this book was and is available
                 only online, from various anonymous FTP servers. This
                 second edition is somewhat enlarged and updated, yet is
                 still the shortest introductory Internet book.",
  abstract =     "A readable introduction to the Internet explains how
                 to use this worldwide system of computer networks,
                 examining the various available networks and explaining
                 how to use as E-mail, File Transfer Protocol, and
                 special commercial services via Internet.",
  acknowledgement = ack-nhfb,
  bookreview =   "Link Letter, 5(3):3, Nov. 1992; MicroTimes, 102:3,
                 Nov. 23, 1992. \path|simsc.si.edu:networks/zen.ad|.",
  keywords =     "Internet (computer network); location",
  tableofcontents = "Network basics \\
                 Electronic mail \\
                 Anonymous FTP \\
                 Usenet news \\
                 Telnet \\
                 Various tools \\
                 Commercial services \\
                 Things you'll hear about \\
                 Finding out more \\
                 Getting to other networks \\
                 Retrieving files via Email \\
                 Newsgroup creation \\
                 Items available for FTP \\
                 Country codes",
}

@Book{Kelly:2009:MPB,
  editor =       "Cynthia C. Kelly",
  title =        "The {Manhattan Project}: the birth of the atomic bomb
                 in the words of its creators, eyewitnesses, and
                 historians",
  publisher =    "Black Dog and Leventhal",
  address =      "New York, NY, USA",
  pages =        "xiv + 495",
  year =         "2009",
  ISBN =         "1-57912-808-4 (paperback), 1-57912-747-9,
                 1-60376-206-X (e-book)",
  ISBN-13 =      "978-1-57912-808-1 (paperback), 978-1-57912-747-3,
                 978-1-60376-206-9 (e-book)",
  LCCN =         "QC773.3.U6 M27 2009",
  bibdate =      "Sat Jun 13 08:50:45 MDT 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 library.tcd.ie:210/advance",
  price =        "US\$10.95",
  abstract =     "A collection of writings --- including essays,
                 articles, and excerpts from biographies, plays, novels,
                 letters, and oral histories --- explores the history of
                 the Manhattan Project and analyzes its legacy.",
  acknowledgement = ack-nhfb,
  subject =      "Atomic bomb; United States; History",
  tableofcontents = "From the editor: Preserving the Manhattan Project /
                 Cynthia C. Kelly \\
                 Introduction: A great work of human collaboration /
                 Richard Rhodes \\
                 Section 1: Explosive discoveries and bureaucratic
                 inertia \\
                 Thinking no pedestrian thoughts / Richard Rhodes \\
                 The atomic bombs burst in their fumbling hands / H. G.
                 Wells \\
                 If only we had been clever enough / Leona Marshall
                 Libby \\
                 What wasn't expected wasn't seen! / Edward Teller \\
                 I had come close but had missed a great discovery /
                 Philip Abelson \\
                 Enlisting Einstein / William Lanouette \\
                 Albert Einstein to F. D. Roosevelt / Albert Einstein and
                 Franklin D. Roosevelt \\
                 A practically irresistible super-bomb / Otto Frisch and
                 Rudolf Peierls \\
                 Working for Otto Frisch / J. Wechsler \\
                 Likely to lead to decisive results / The Maud Report,
                 March 1941 \\
                 Wild notions about atomic bombs / G. Pascal Zachary \\
                 Transatlantic travails / Andrew Brown \\
                 Section 2: An unprecedented alliance \\
                 The rather fuzzy state of our thinking / James
                 Hershberg \\
                 The stuff will be more powerful than we thought /
                 Vannevar Bush \\
                 You'll never get a chain reaction going here / Richard
                 Rhodes \\
                 The Chicago Pile-1: the first chain reaction / Enrico
                 Fermi \\
                 Fermi was cool as a cucumber / Crawford Greenewalt \\
                 Proceeding in the dark / Leslie R. Groves \\
                 Swimming in syrup / Robert Jungk \\
                 The Los Alamos primer: how to make an atomic bomb /
                 Robert Serber \\
                 These were very great men indeed / Richard Feynman \\
                 Misunderstandings and anxieties / Stephane Groueff \\
                 A weapon of devastating power will soon become
                 available / Niels Bohr to Winston Churchill \\
                 One top secret agreement too many / Winston Churchill
                 \\
                 Section 3: An extraordinary pair \\
                 His potential outweighed any security risk / Leslie R.
                 Groves \\
                 Scientific director for the special laboratory in New
                 Mexico / James B. Conant and Leslie R. Groves to J.
                 Robert Oppenheimer \\
                 When you looked at Captain Groves, a little alarm bell
                 rang ``caution'' / Robert S. Norris \\
                 Decisive, confident and cool / Robert DeVore \\
                 A bureaucratic warrior of the first rank / Robert S.
                 Norris \\
                 The biggest S.O.B. / Kenneth D. Nichols \\
                 Not right, do it again! / John Lansdale, Jr. \\
                 A ``Jewish Pan'' at Berkeley / Kai Bird and Martin
                 Sherwin \\
                 The absent-minded professor / Berkeley Gazette,
                 February 14, 1934 \\
                 His head wreathed in a cloud of smoke / Edward Gerjuoy
                 \\
                 A psychiatrist by vocation, and a physicist by
                 avocation / Jeremy Bernstein \\
                 The most compelling man / Jennet Conant \\
                 Appeasing General Groves / Kai Bird and Martin Sherwin
                 \\
                 Visions of immortality / Robert S. Norris \\
                 An audacious gamble / Kai Bird and Martin Sherwin \\
                 When Robert Oppenheimer walked onto the page / Joseph
                 Kanon \\
                 Doctor Atomic: the myth and the man / John Adams \\
                 A cascade of different Oppenheimers / Jon Else \\
                 Section 4: Secret cities \\
                 A new and uncertain adventure in the wilderness /
                 Stephane Groueff \\
                 A crazy place to do any war thing / Stirling Colgate
                 \\
                 Excitement, devotion, and patriotism prevailed / J.
                 Robert Oppenheimer \\
                 The case of the vanishing physicists / Stanislaw Ulam
                 \\
                 Learning on the job / Rebecca Diven \\
                 Life at P.O. Box 1663 / Ruth Marshak \\
                 A boy's adventures at Los Alamos / Dana Mitchell \\
                 Something extraordinary was happening here / Katrina
                 Mason \\
                 A relief from the hubbub of the hill / Katrina Mason
                 \\
                 An SED at Los Alamos / Benjamin Bederson \\
                 A bad time to get a new boss / Joseph Kanon \\
                 Tumbleweed and jackrabbits in the Evergreen State /
                 Steve Buckingham \\
                 Making toilet paper / Roger Rohrbacher \\
                 Termination winds / Michele Gerber \\
                 Whoever gets there first will win the war / Leon
                 Overstreet \\
                 The whole project was like a three-legged stool /
                 Walter Simon \\
                 Cover stories / Franklin T. Matthias \\
                 K-25 Plant: forty-four acres and a mile long / William
                 J. Wilcox \\
                 Tennessee girls on the job / Colleen Black \\
                 Ode to life behind the fence / Clifford and Colleen
                 Black \\
                 Operating Oak Ridge's ``calutrons'' / Theodore Rockwell
                 \\
                 Men, write home for Christmas / Norman Brown \\
                 An answer to their prayers / Valeria Steele \\
                 All-Black crews with white foremen / Robert Bauman \\
                 Manhattan Project sites in Manhattan / Robert S. Norris
                 \\
                 Manhattan Project sites in Washington, D.C. / Robert S.
                 Norris \\
                 Monsanto's playhouse for polonium / Stephane Groueff
                 \\
                 Mysteries at the Met lab / Isabella Karle \\
                 Section 5: Secrecy, intelligence and
                 counterintelligence \\
                 Unprecedented security measures /: Robert S. Norris \\
                 Security: a headache on the hill / Kai Bird and Martin
                 Sherwin \\
                 Mrs. Farmer, I presume / Laura Fermi \\
                 As if they were walking in the woods / John Lansdale,
                 Jr. \\
                 Electric rocket story fails to launch / Charlotte
                 Serber \\
                 A spy in our midst / Laura Fermi \\
                 Never in our wildest dreams / Lilli Hornig \\
                 The youngest spies / Joseph Albright and Marcia Kunstel
                 \\
                 Enormoz espionage / Gregg Herken \\
                 Jump start for the Soviets / David Holloway, Joseph
                 Albright and Marcia Kunstel \\
                 Holes in the security fence / Joseph Albright and
                 Marcia Kunstel \\
                 A calming role for the counterintelligence corps /
                 Thomas O. Jones \\
                 The Alsos mission: scientists as sleuths / Robert S.
                 Norris \\
                 From France to the Black Forest: seeking atomic
                 scientists / Richard Rhodes \\
                 I have been expecting you / John Lansdale, Jr. \\
                 Section 6: The Trinity Test \\
                 Leaving the bomb project / Joseph Rotblat \\
                 Anticipating the end of war / Kai Bird and Martin
                 Sherwin \\
                 Scientists will be held responsible / Arthur Holly
                 Compton \\
                 Advising against the bomb / The Franck Report, June
                 1945 \\
                 No acceptable alternative / The Interim Committee
                 Report, June 1945 \\
                 Scientists petition the President / Leo Szilard and
                 other scientists \\
                 Watching Trinity / Thomas Farrell and Leslie R. Groves
                 \\
                 Babysitting the bomb / Donald Hornig \\
                 A handful of soldiers at Trinity / Val Fitch \\
                 Eyewitness accounts of the Trinity Test / Edwin
                 McMillan, Kenneth Greisen, Enrico Fermi, Maurice
                 Shapiro, Robert Serber \\
                 Violence without limit / Joseph Kanon \\
                 Section 7: Dropping the bombs \\
                 Aiming for military and psychological effects / Target
                 Committee \\
                 Admiral Chester W. Nimitz: born too soon / Frederick L.
                 Ashworth \\
                 The 509th Composite Group at Tinian Island / Stephen
                 Walker \\
                 Official bombing order, 25 July 1945 / Thos. T. Handy
                 \\
                 A very sobering event: operational history of the 509th
                 Bombardment \\
                 Massive pain, suffering and horror / Tsuyoshi Hasegawa
                 \\
                 Miss Yamaoka, you look like a monster / Richard B.
                 Frank \\
                 For all we know, we have created a Frankenstein! / Paul
                 Boyer \\
                 The battle of the laboratories / Harry S. Truman \\
                 The culmination of years of Herculean effort / Henry L.
                 Stimson \\
                 Eyewitness over Nagasaki / William Laurence \\
                 It was over! / Frederick J. Olivi \\
                 The atomic bomb's peculiar ``disease'' / George Weller
                 \\
                 Section 8: Reflections on the bomb \\
                 Outwitting General Groves / Harold Agnew \\
                 Speech to the Association of Los Alamos Scientists / J.
                 Robert Oppenheimer \\
                 You have done excellent work / J. Robert Oppenheimer
                 \\
                 A citizen's guide to the atomic bomb: The Smyth Report
                 / Henry DeWolf Smyth \\
                 Hersey's Hiroshima / John Hersey \\
                 The decision to use the atomic bomb / Henry L. Stimson
                 \\
                 History is often not what actually happened / Barton J.
                 Bernstein \\
                 A question of motives / Patrick M.S. Blackett \\
                 Thank God for the atomic bomb / Paul Fussell \\
                 The return to nothingness / Felix Morley \\
                 The bomb in national memories / Tsuyoshi Hasegawa \\
                 Hiroshima in History / J. Samuel Walker \\
                 Why does this decision continue to haunt us? / Gar
                 Alperovitz \\
                 Section 9: Living with the bomb \\
                 On the international control of atomic energy /
                 Acheson-Lilienthal Report, March 1946 \\
                 Open letter to the United Nations / Niels Bohr, June
                 1950 \\
                 I hope not a soul will remember my name / Paul Mullins,
                 ``Louis Slotin Sonata'' \\
                 Atoms for peace / Dwight D. Eisenhower, December 1953
                 \\
                 A cold war warning / The Russell-Einstein Manifesto,
                 July 1955 \\
                 A world free of nuclear weapons / George P. Schultz,
                 William J. Perry, Henry A. Kissinger, and Sam Nunn \\
                 The nuclear threat / Mikhail Gorbachev \\
                 Thoughts on a 21st-century Manhattan Project / George
                 A. Cowan \\
                 Chronology \\
                 Biographies \\
                 Bibliography \\
                 Index \\
                 Text credits",
}

@Book{Kelly:2017:EYS,
  author =       "Scott Kelly and Margaret Lazarus Dean",
  title =        "Endurance: a Year in Space, a Lifetime of Discovery",
  publisher =    pub-KNOPF,
  address =      pub-KNOPF:adr,
  pages =        "387 + 24",
  year =         "2017",
  ISBN =         "1-5247-3159-5 (hardcover)",
  ISBN-13 =      "978-1-5247-3159-5 (hardcover)",
  LCCN =         "TL789.85.K45 A3 2017",
  bibdate =      "Thu May 17 07:30:51 MDT 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "The veteran of four space flights and the American
                 record holder for consecutive days spent in space,
                 Scott Kelly has experienced things very few have. Now,
                 he takes us inside a sphere utterly inimical to human
                 life. He describes navigating the extreme challenge of
                 long-term spaceflight, both existential and banal: the
                 devastating effects on the body; the isolation from
                 everyone he loves and the comforts of Earth; the
                 pressures of constant close cohabitation; the
                 catastrophic risks of depressurization or colliding
                 with space junk, and the still more haunting threat of
                 being unable to help should tragedy strike at home--an
                 agonizing situation Kelly faced when, on another
                 mission, his twin brother's wife, Gabrielle Giffords,
                 was shot while he still had two months in space.
                 Kelly's humanity, compassion, humor, and passion
                 resonate throughout, as he recalls his rough-and-tumble
                 New Jersey childhood and the youthful inspiration that
                 sparked his astounding career, and as he makes clear
                 his belief that Mars will be the next, ultimately
                 challenging step in American spaceflight. A natural
                 storyteller and modern-day hero, Kelly has a message of
                 hope for the future that will inspire for generations
                 to come. Here, in his personal story, we see the
                 triumph of the human imagination, the strength of the
                 human will, and the boundless wonder of the galaxy.",
  acknowledgement = ack-nhfb,
  author-dates = "1964--",
  remark =       "This book has no chapters.",
  subject =      "Kelly, Scott; Astronauts; United States; Biography",
}

@Book{Kennedy:2012:SGE,
  author =       "Robert E. Kennedy",
  title =        "A student's guide to {Einstein}'s major papers",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  pages =        "xxi + 303",
  year =         "2012",
  ISBN =         "0-19-969403-6 (hardcover)",
  ISBN-13 =      "978-0-19-969403-7 (hardcover)",
  LCCN =         "QC16.E5 K466 2012",
  bibdate =      "Fri Dec 16 07:21:48 MST 2011",
  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 =     "Our understanding of the physical universe underwent a
                 revolution in the early twentieth century--evolving
                 from the classical physics of Newton, Galileo, and
                 Maxwell to the modern physics of relativity and quantum
                 mechanics. The dominant figure in this revolutionary
                 change was Albert Einstein. In a single year, 1905,
                 Einstein produced breakthrough works in three areas of
                 physics: on the size and the effects of atoms; on the
                 quantization of the electromagnetic field; and on the
                 special theory of relativity. In 1916 he produced a
                 fourth breakthrough work, the general theory of
                 relativity. A \booktitle{Student's Guide to Einstein's
                 Major Papers} focuses on Einstein's contributions,
                 setting his major works into their historical context,
                 and then takes the reader through the details of each
                 paper, including the mathematics. This book helps the
                 reader appreciate the simplicity and insightfulness of
                 Einstein's ideas and how revolutionary his work was,
                 and locate it in the evolution of scientific thought
                 begun by the ancient Greek natural philosophers.",
  acknowledgement = ack-nhfb,
  remark =       "TO DO: Table of contents at bookseller site appears to
                 be garbled, or is out of order??",
  subject =      "Einstein, Albert; Einstein, Albert,; Einstein,
                 Albert,; Einstein, Albert / 1879-1955; Physics;
                 Philosophy; Mathematical physics; Mathematical physics;
                 Philosophy; Physics / Philosophy",
  subject-dates = "1879--1955; 1879--1955; 1879--1955",
  tableofcontents = "1: Setting the stage for 1905 \\
                 2: Radiation and the quanta \\
                 3: The atom and Brownian motion \\
                 4: The special theory of relativity \\
                 5: The general theory of relativity \\
                 Part A: ``Fundamental considerations on the postulate
                 of relativity'' \\
                 Part B: ``Mathematical aids to the formulation of
                 generally covariant equations'' \\
                 Part C: ``Theory of the gravitational field'' \\
                 Part D: ``Material phenomena'' \\
                 Part E \\
                 6: Einstein and quantum mechanics \\
                 7: Epilogue \\
                 Index",
}

@Book{Kernighan:1974:EPS,
  author =       "Brian W. Kernighan and P. J. Plauger",
  title =        "The Elements of Programming Style",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "147",
  year =         "1974",
  ISBN =         "0-07-034199-0",
  ISBN-13 =      "978-0-07-034199-9",
  LCCN =         "QA76.6 .K47",
  bibdate =      "Thu Mar 25 16:02:37 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

@Book{Kernighan:1976:ST,
  author =       "Brian W. Kernighan and P. J. Plauger",
  title =        "Software Tools",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "338",
  year =         "1976",
  ISBN =         "0-201-03669-X",
  ISBN-13 =      "978-0-201-03669-5",
  LCCN =         "QA76.6 .K42 1976",
  bibdate =      "Thu Mar 25 16:01:54 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Kernighan:1978:CPL,
  author =       "Brian W. Kernighan and Dennis M. Ritchie",
  title =        "The {C} Programming Language",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "x + 228",
  year =         "1978",
  ISBN =         "0-13-110163-3",
  ISBN-13 =      "978-0-13-110163-0",
  LCCN =         "QA76.73 .C15 K47 1978",
  bibdate =      "Wed Dec 15 10:36:07 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "A tutorial introduction \\
                 Types, operators and expressions \\
                 Control flow \\
                 Functions and program structure \\
                 Pointes and arrays \\
                 Structures \\
                 Input and output \\
                 The UNIX system interface \\
                 C reference",
}

@Book{Kernighan:1978:EPS,
  author =       "Brian W. Kernighan and P. J. Plauger",
  title =        "The Elements of Programming Style",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  edition =      "Second",
  pages =        "xii + 168",
  year =         "1978",
  ISBN =         "0-07-034207-5",
  ISBN-13 =      "978-0-07-034207-1",
  LCCN =         "QA76.6 .K39 1978",
  bibdate =      "Thu Mar 25 16:01:59 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "Expression \\
                 Control structure \\
                 Program structure \\
                 Input and output \\
                 Common blunders \\
                 Efficiency and instrumentation \\
                 Documentation",
}

@Book{Kernighan:1981:STP,
  author =       "Brian W. Kernighan and P. J. Plauger",
  title =        "Software Tools in {Pascal}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "ix + 366",
  year =         "1981",
  ISBN =         "0-201-10342-7",
  ISBN-13 =      "978-0-201-10342-7",
  LCCN =         "QA76.6 .K493",
  bibdate =      "Thu Mar 25 16:01:52 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$13.95",
  acknowledgement = ack-nhfb,
  tableofcontents = "Getting started \\
                 Filters \\
                 Files \\
                 Sorting \\
                 Text patterns \\
                 Editing \\
                 Formatting \\
                 Macro processing \\
                 Appendix: Implementation of primitives \\
                 Index",
}

@TechReport{Kernighan:1981:WPM,
  author =       "Brian W. Kernighan",
  title =        "Why {Pascal} is Not My Favorite Programming Language",
  type =         "Computing Science Technical Report",
  number =       "100",
  institution =  pub-ATT-BELL,
  address =      pub-ATT-BELL:adr,
  day =          "2",
  month =        apr,
  year =         "1981",
  bibdate =      "Thu Sep 21 06:22:29 2017",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/w/wirth-niklaus.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  URL =          "https://github.com/arnoldrobbins/cstr100",
  abstract =     "The programming language Pascal has become the
                 dominant language of instruction in computer science
                 education. It has also strongly influenced languages
                 developed subsequently, in particular Ada.\par

                 Pascal was originally intended primarily as a teaching
                 language, but it has been more and more often
                 recommended as a language for serious programming as
                 well, for example, for system programming tasks and
                 even operating systems.\par

                 Pascal, at least in its standard form, is just plain
                 not suitable for serious programming. This paper
                 discusses my personal discovery of some of the reasons
                 why.",
  acknowledgement = ack-nhfb,
  remark-1 =     "From the first paragraph: ``This paper has its origins
                 in two events --- a spate of papers that compare C and
                 Pascal [1, 2, 3, 4] and a personal attempt to rewrite
                 \booktitle{Software Tools} [5] in Pascal.'' See
                 \cite{Kernighan:1981:STP}.",
  remark-2 =     "From the first two pages: ``Pascal may be an admirable
                 language for teaching beginners how to program; I have
                 no first-hand experience with that. It was a
                 considerable achievement for 1968. It has certainly
                 influenced the design of recent languages, of which Ada
                 is likely to be the most important. But in its standard
                 form (both current and proposed), Pascal is not
                 adequate for writing real programs. It is suitable only
                 for small, self-contained programs that have only
                 trivial interactions with their environment and that
                 make no use of any software written by anyone else.''",
   remark-3 =       "From page 3: ``This botch [array length is part of
                 array type] is the biggest single problem with
                 Pascal. I believe that if it could be fixed, the
                 language would be an order of magnitude more usable.''",
}

@Book{Kernighan:1984:UPE,
  author =       "Brian W. Kernighan and Rob Pike",
  title =        "The {UNIX} Programming Environment",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "x + 357",
  year =         "1984",
  ISBN =         "0-13-937699-2 (hardcover), 0-13-937681-X (paperback)",
  ISBN-13 =      "978-0-13-937699-3 (hardcover), 978-0-13-937681-8
                 (paperback)",
  LCCN =         "QA76.76.O63 K48 1984",
  bibdate =      "Wed Dec 15 10:36:12 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  URL =          "http://wiki.tuhs.org/doku.php?id=publications:unix_prog_environment",
  acknowledgement = ack-nhfb,
  tableofcontents = "Preface / vii \\
                 1. UNIX for Beginners / 1 \\
                 1.1 Getting started / 2 \\
                 1.2 Day-to-day use: files and common commands / 11 \\
                 1.3 More about files: directories / 21 \\
                 1.4 The shell / 26 \\
                 1.5 The rest of the UNIX system / 38 \\
                 2. The File System / 41 \\
                 2. The File System 2.1 The basics of files / 41 \\
                 2.2 What's in a file? / 46 \\
                 2.3 Directories and filenames / 48 \\
                 2.4 Permissions / 52 \\
                 2.5 Inodes / 57 \\
                 2.6 The directory hierarchy / 63 \\
                 2.7 Devices / 65 \\
                 3. Using the Shell / 71 \\
                 3.1 Command line structure / 71 \\
                 3.2 Metacharacters / 74 \\
                 3.3 Creating new commands / 80 \\
                 3.4 Command arguments and parameters / 82 \\
                 3.5 Program output as arguments / 86 \\
                 3.6 Shell variables / 88 \\
                 3.7 More on I/O redirection / 92 \\
                 3.8 Looping in shell programs / 94 \\
                 3.9 bundle: putting it all together / 97 \\
                 3.10 Why a programmable shell? / 99 \\
                 4. Filters / 101 \\
                 4.1 The grep family / 102 \\
                 4.2 Other filters / 106 \\
                 4.3 The stream editor sed / 108 \\
                 4.4 The awk pattern scanning and processing language /
                 114 \\
                 4.5 Good files and good filters / 130 \\
                 5. Shell Programming / 133 \\
                 5.1 Customizing the c a l command / 133 \\
                 5.2 Which command is which? / 138 \\
                 5.3 while and u n t i l loops: watching for things /
                 144 \\
                 5.4 Traps: catching interrupts / 150 \\
                 5.5 Replacing a file: overwrite / 152 \\
                 5.6 zap: killing processes by name / 156 \\
                 5.7 The pick command: blanks vs. arguments / 159 \\
                 5.8 The news command: community service messages / 162
                 \\
                 5.9 get and put: tracking file changes / 165 \\
                 5.10 A look back / 169 \\
                 6. Programming with Standard I/O / 171 \\
                 6.1 Standard input and output: vis / 172 \\
                 6.2 Program arguments: vis version 2 / 174 \\
                 6.3 File access: vis version 3 / 176 \\
                 6.4 A screen-at-a-time printer: p / 180 \\
                 6.5 An example: pick / 186 \\
                 6.6 On bugs and debugging / 187 \\
                 6.7 An example: zap / 190 \\
                 6.8 An interactive file comparison program: idiff / 192
                 \\
                 6.9 Accessing the environment / 199 \\
                 7. UNIX System Calls / 201 \\
                 7.1 Low-level I/O / 201 \\
                 7.2 File system: directories \ / 208 \\
                 7.3 File system: inodes / 214 \\
                 7.4 Processes / 220 \\
                 7.5 Signals and interrupts / 225 \\
                 8. Program Development / 233 \\
                 8.1 Stage 1: A four-function calculator / 234 \\
                 8.2 Stage 2: Variables and error recovery / 242 \\
                 8.3 Stage 3: Arbitrary variable names; built-in
                 functions / 245 \\
                 8.4 Stage 4: Compilation into a machine / 258 \\
                 8.5 Stage 5: Control flow and relational operators /
                 266 \\
                 8.6 Stage 6: Functions and procedures; input/output /
                 273 \\
                 8.7 Performance evaluation / 284 \\
                 8.8 A look back / 286 \\
                 9. Document Preparation / 289 \\
                 9.1 The ms macro package / 290 \\
                 9.2 The troff level / 297 \\
                 9.3 The tbl and eqn preprocessors / 301 \\
                 9.4 The manual page / 308 \\
                 9.5 Other document preparation tools / 313 \\
                 10. Epilog / 315 \\
                 Appendix 1: Editor Summary / 319 \\
                 Appendix 2: hoc Manual / 329 \\
                 Appendix 3: hoc Listing / 335 \\
                 Index / 349",
}

@Book{Kernighan:1988:CPL,
  author =       "Brian W. Kernighan and Dennis M. Ritchie",
  title =        "The {C} Programming Language",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  edition =      "Second",
  pages =        "xii + 272",
  year =         "1988",
  ISBN =         "0-13-110362-8 (paperback), 0-13-110370-9 (hardcover),
                 0-13-115817-1, 0-13-308621-6 (e-book), 0-13-308624-0",
  ISBN-13 =      "978-0-13-110362-7 (paperback), 978-0-13-110370-2
                 (hardcover), 978-0-13-115817-7, 978-0-13-308621-8
                 (e-book), 978-0-13-308624-9",
  LCCN =         "QA76.73.C15 K47 1988",
  bibdate =      "Wed Dec 15 10:36:09 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cccuj.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  note =         "This book is 200\% a {\em must} for any C programmers
                 \ldots{}. The answers to the exercises can be found in
                 \cite{Tondo:1989:CAB}.",
  URL =          "http://wiki.tuhs.org/doku.php?id=publications:c_prog_language",
  acknowledgement = ack-nhfb,
  remark =       "This book is 200\% a {\em must} for any C programmers
                 \ldots{}. The answers to the exercises can be found in
                 \cite{Tondo:1989:CAB}.",
  shorttableofcontents = "1: A Tutorial Introduction / 5 \\
                 2: Types, Operators, and Expressions / 35 \\
                 3: Control Flow / 55 \\
                 4: Functions and Program Structure / 67 \\
                 5: Pointers and Arrays / 93 \\
                 6: Structures / 127 \\
                 7: Input and Output / 151 \\
                 8: The UNIX System Interface / 169 \\
                 Appendix A: Reference Manual / 191 \\
                 Appendix B: Standard Library / 241 \\
                 B1 Input and Output: <stdio.h> / 241 \\
                 B2 Character Class Tests: <ctype.h> / 248 \\
                 B3 String Functions: <string.h> / 249 \\
                 B4 Mathematical Functions: <math.h> / 250 \\
                 B5 Utility Functions: <stdlib.h> / 251 \\
                 B6 Diagnostics: < assert.h> / 253 \\
                 B7 Variable Argument Lists: <stdarg.h> / 254 \\
                 B8 Non-local Jumps: <setjmp.h> / 254 \\
                 B9 Signals: <signal.h> / 255 \\
                 B10 Date and Time Functions: <time.h> / 255 \\
                 B11 Implementation-defined Limits: <limits.h> and
                 <float.h> / 257 \\
                 Appendix C: Summary of Changes / 259",
  tableofcontents = "Preface / ix \\
                 Preface to the First Edition / xi \\
                 Introduction / 1 \\
                 1: A Tutorial Introduction / 5 \\
                 1.1 Getting Started / 5 \\
                 1.2 Variables and Arithmetic Expressions / 8 \\
                 1.3 The For Statement / 13 \\
                 1.4 Symbolic Constants / 14 \\
                 1.5 Character Input and Output / 15 \\
                 1.6 Arrays / 22 \\
                 1.7 Functions / 24 \\
                 1.8 Arguments --- Call by Value / 27 \\
                 1.9 Character Arrays / 28 \\
                 1.10 External Variables and Scope / 31 \\
                 2: Types, Operators, and Expressions / 35 \\
                 2.1 Variable Names / 35 \\
                 2.2 Data Types and Sizes / 36 \\
                 2.3 Constants / 37 \\
                 2.4 Declarations / 40 \\
                 2.5 Arithmetic Operators / 41 \\
                 2.6 Relational and Logical Operators / 41 \\
                 2.7 Type Conversions / 42 \\
                 2.8 Increment and Decrement Operators / 46 \\
                 2.9 Bitwise Operators / 48 \\
                 2.10 Assignment Operators and Expressions / 50 \\
                 2.11 Conditional Expressions / 51 \\
                 2.12 Precedence and Order of Evaluation / 52 \\
                 3: Control Flow / 55 \\
                 3.1 Statements and Blocks / 55 \\
                 3.2 If-Else / 55 \\
                 3.3 Else-If / 57 \\
                 3.4 Switch / 58 \\
                 3.5 Loops --- While and For / 60 \\
                 3.6 Loops --- Do-while / 63 \\
                 3.7 Break and Continue / 64 \\
                 3.8 Goto and Labels / 65 \\
                 4: Functions and Program Structure / 67 \\
                 4.1 Basics of Functions / 67 \\
                 4.2 Functions Returning Non-integers / 71 \\
                 4.3 External Variables / 73 \\
                 4.4 Scope Rules / 80 \\
                 4.5 Header Files / 81 \\
                 4.6 Static Variables / 83 \\
                 4.7 Register Variables / 83 \\
                 4.8 Block Structure / 84 \\
                 4.9 Initialization / 85 \\
                 4.10 Recursion / 86 \\
                 4.11 The C Preprocessor / 88 \\
                 5: Pointers and Arrays / 93 \\
                 5.1 Pointers and Addresses / 93 \\
                 5.2 Pointers and Function Arguments / 95 \\
                 5.3 Pointers and Arrays / 97 \\
                 5.4 Address Arithmetic / 100 \\
                 5.5 Character Pointers and Functions / 104 \\
                 5.6 Pointer Arrays; Pointers to Pointers / 107 \\
                 5.7 Multi-dimensional Arrays / 110 \\
                 5.8 Initialization of Pointer Arrays / 113 \\
                 5.9 Pointers vs. Multi-dimensional Arrays / 113 \\
                 5.10 Command-line Arguments / 114 \\
                 5.11 Pointers to Functions / 118 \\
                 5.12 Complicated Declarations / 122 \\
                 6: Structures / 127 \\
                 6.1 Basics of Structures / 127 \\
                 6.2 Structures and Functions / 129 \\
                 6.3 Arrays of Structures / 132 \\
                 6.4 Pointers to Structures / 136 \\
                 6.5 Self-referential Structures / 139 \\
                 6.6 Table Lookup / 143 \\
                 6.7 Typedef / 146 \\
                 6.8 Unions / 147 \\
                 6.9 Bit-fields / 149 \\
                 7: Input and Output / 151 \\
                 7.1 Standard Input and Output / 151 \\
                 7.2 Formatted Output --- Printf / 153 \\
                 7.3 Variable-length Argument Lists / 155 \\
                 7.4 Formatted Input --- Scanf / 157 \\
                 7.5 File Access / 160 \\
                 7.6 Error Handling --- Stderr and Exit / 163 \\
                 7.7 Line Input and Output / 164 \\
                 7.8 Miscellaneous Functions / 166 \\
                 8: The UNIX System Interface / 169 \\
                 8.1 File Descriptors / 169 \\
                 8.2 Low Level I/O --- Read and Write / 170 \\
                 8.3 Open, Creat, Close, Unlink / 172 \\
                 8.4 Random Access --- Lseek / 174 \\
                 8.5 Example --- An Implementation of Fopen and Getc /
                 175 \\
                 8.6 Example --- Listing Directories / 179 \\
                 8.7 Example --- A Storage Allocator / 185 \\
                 Appendix A: Reference Manual / 191 \\
                 A1 Introduction / 191 \\
                 A2 Lexical Conventions / 191 \\
                 A3 Syntax Notation / 194 \\
                 A4 Meaning of Identifiers / 195 \\
                 A5 Objects and Lvalues / 197 \\
                 A6 Conversions / 197 \\
                 A7 Expressions / 200 \\
                 A8 Declarations / 210 \\
                 A9 Statements / 222 \\
                 A10 External Declarations / 225 \\
                 All Scope and Linkage / 227 \\
                 A12 Preprocessing / 228 \\
                 A13 Grammar / 234 \\
                 Appendix B: Standard Library / 241 \\
                 B1 Input and Output: <stdio.h> / 241 \\
                 B2 Character Class Tests: <ctype.h> / 248 \\
                 B3 String Functions: <string.h> / 249 \\
                 B4 Mathematical Functions: <math.h> / 250 \\
                 B5 Utility Functions: <stdlib.h> / 251 \\
                 B6 Diagnostics: < assert.h> / 253 \\
                 B7 Variable Argument Lists: <stdarg.h> / 254 \\
                 B8 Non-local Jumps: <setjmp.h> / 254 \\
                 B9 Signals: <signal.h> / 255 \\
                 B10 Date and Time Functions: <time.h> / 255 \\
                 B11 Implementation-defined Limits: <limits.h> and
                 <float.h> / 257 \\
                 Appendix C: Summary of Changes / 259 \\
                 Index / 263",
}

@Book{Kernighan:2018:MBZ,
  author =       "Brian W. Kernighan",
  title =        "Millions, Billions, Zillions: Defending Yourself in a
                 World of Too Many Numbers",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "xiv + 160",
  year =         "2018",
  ISBN =         "0-691-18277-9 (hardcover)",
  ISBN-13 =      "978-0-691-18277-3 (hardcover)",
  LCCN =         "QA93 .K44 2018",
  bibdate =      "Fri Feb 7 11:10:34 MST 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "Numbers are often intimidating, confusing, and even
                 deliberately deceptive --- especially when they are
                 really big. The media loves to report on millions,
                 billions, and trillions, but frequently makes basic
                 mistakes or presents such numbers in misleading ways.
                 And misunderstanding numbers can have serious
                 consequences, since they can deceive us in many of our
                 most important decisions, including how to vote, what
                 to buy, and whether to make a financial investment. In
                 this short, accessible, enlightening, and entertaining
                 book, leading computer scientist Brian Kernighan
                 teaches anyone --- even diehard math-phobes --- how to
                 demystify the numbers that assault us every day. With
                 examples drawn from a rich variety of sources,
                 including journalism, advertising, and politics,
                 Kernighan demonstrates how numbers can mislead and
                 misrepresent. In chapters covering big numbers, units,
                 dimensions, and more, he lays bare everything from
                 deceptive graphs to speciously precise numbers. And he
                 shows how anyone --- using a few basic ideas and lots
                 of shortcuts --- can easily learn to recognize common
                 mistakes, determine whether numbers are credible, and
                 make their own sensible estimates when needed. Giving
                 you the simple tools you need to avoid being fooled by
                 dubious numbers, Millions, Billions, Zillions is an
                 essential survival guide for a world drowning in big
                 --- and often bad --- data",
  acknowledgement = ack-nhfb,
  subject =      "Mathematics; Popular works; Mathematics in mass media;
                 Critical thinking; Statistics; Evaluation; Methodology;
                 Big data; Million (The number); Billion (The number);
                 Data mining",
  tableofcontents = "Getting started \\
                 Millions, billions, zillions \\
                 Big numbers \\
                 Mega, giga, tera, and beyond \\
                 Units \\
                 Dimensionality \\
                 Milestones \\
                 Specious precision \\
                 Lies, damned lies, and statistics \\
                 Graphical trickery \\
                 Bias \\
                 Arithmetic \\
                 Estimation \\
                 Self defense",
}

@Book{Kernighan:2019:UHM,
  author =       "Brian W. Kernighan",
  title =        "{UNIX}: A History and a Memoir",
  publisher =    "Kindle Direct Publishing",
  address =      "????",
  pages =        "xiii + 183",
  year =         "2019",
  ISBN =         "1-69597-855-2",
  ISBN-13 =      "978-1-69597-855-3",
  LCCN =         "????",
  bibdate =      "Mon Oct 21 15:12:52 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  URL =          "https://www.cs.princeton.edu/~bwk/memoir.html",
  acknowledgement = ack-nhfb,
  tableofcontents = "Preface / ix \\
                 1: Bell Labs / 1 \\
                 1.1 Physical sciences at Bell Labs / 5 \\
                 1.2 Communications and computer science / 7 \\
                 1.3 BWK at BTL / 8 \\
                 1.4 Office space / 11 \\
                 1.5 137 $ \to $ 127 $ \to $ 1127 $ \to $ 11276 / 19 \\
                 \\
                 2: Proto-Unix (1969) / 27 \\
                 2.1 A bit of technical background / 27 \\
                 2.2 CTSS and Multics / 30 \\
                 2.3 The origin of Unix / 32 \\
                 2.4 What's in a name? / 34 \\
                 2.5 Biography: Ken Thompson / 35 \\
                 \\
                 3: First Edition (1971) / 41 \\
                 3.1 Unix for patent applications / 42 \\
                 3.2 The Unix room / 45 \\
                 3.3 The Unix Programmer's Manual / 49 \\
                 3.4 A few words about memory / 52 \\
                 3.5 Biography: Dennis Ritchie / 55 \\
                 \\
                 4: Sixth Edition (1975) / 61 \\
                 4.1 File systems / 62 \\
                 4.2 Systems calls / 63 \\
                 4.3 Shell / 65 \\
                 4.4 Pipes / 67 \\
                 4.5 Grep / 70 \\
                 4.6 Regular expressions / 73 \\
                 4.7 The C programming language / 76 \\
                 4.8 Software Tools and Ratfor / 80 \\
                 4.9 Biography: Doug McIlroy / 82 \\
                 \\
                 5: Seventh Edition (1976--1979) / 87 \\
                 5.1 Bourne shell / 88 \\
                 5.2 Yacc, Lex, Make / 90 \\
                 5.3 Document preparation / 98 \\
                 5.4 Sed and Awk / 113 \\
                 5.5 Other languages / 117 \\
                 5.6 Other contributions / 121 \\
                 \\
                 6: Beyond Research / 131 \\
                 6.1 Programmer's Workbook / 131 \\
                 6.2 University licenses / 134 \\
                 6.3 User groups and Usenix / 136 \\
                 6.4 John Lions' Commentary / 137 \\
                 6.5 Portability / 140 \\
                 \\
                 7: Commercialization / 143 \\
                 7.1 Divestiture / 143 \\
                 7.2 UNIX^{\TM} / 146 \\
                 7.4 Public relations / 147 \\
                 \\
                 8: Descendants / 153 \\
                 8.1 Berkeley Software Distribution / 153 \\
                 8.2 Unix wars / 156 \\
                 8.3 Minix and Linux / 158 \\
                 8.4 Plan 9 / 160 \\
                 8.5 Diaspora / 163 \\
                 \\
                 9: Legacy / 165 \\
                 9.1 Technical / 166 \\
                 9.2 Organization / 170 \\
                 9.3 Recognition / 175 \\
                 9.4 Could history repeat? / 177 \\
                 \\
                 Sources / 181",
}

@TechReport{Kernighan:ditroff,
  author =       "Brian W. Kernighan",
  title =        "A Typesetter-independent {TROFF}",
  number =       "Computer Science Report 91",
  institution =  pub-ATT-BELL,
  address =      pub-ATT-BELL:adr,
  year =         "1981",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Article{Kernighan:pic,
  author =       "Brian W. Kernighan",
  title =        "{PIC}: {A} language for typesetting graphics",
  journal =      j-SPE,
  volume =       "12",
  number =       "1",
  pages =        "1--22",
  month =        jan,
  year =         "1982",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Kerrigan:1993:MF,
  author =       "James F. Kerrigan",
  title =        "Migrating to {Fortran 90}",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xxvi + 361",
  month =        oct,
  year =         "1993",
  ISBN =         "1-56592-049-X",
  ISBN-13 =      "978-1-56592-049-1",
  LCCN =         "QA76.73.F28 K47 1993",
  bibdate =      "Mon Jan 3 18:29:56 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$24.95",
  series =       "A Nutshell handbook",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0715/94174237-d.html",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

@Book{Kerrisk:2010:LPI,
  author =       "Michael Kerrisk",
  title =        "The {Linux} programming interface: a {Linux} and
                 {UNIX} system programming handbook",
  publisher =    pub-NO-STARCH,
  address =      pub-NO-STARCH:adr,
  pages =        "xli + 1506",
  year =         "2010",
  ISBN =         "1-59327-220-0 (hardcover)",
  ISBN-13 =      "978-1-59327-220-3 (hardcover)",
  LCCN =         "QA76.76.O63 K496 2010",
  bibdate =      "Mon Sep 27 10:50:46 MDT 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Linux; UNIX (Computer file); Operating systems
                 (Computers)",
  tableofcontents = "History and standards \\
                 Fundamental concepts \\
                 System programming concepts \\
                 File I/O: the universal I/O model \\
                 File I/O: further details \\
                 Processes \\
                 Memory allocation \\
                 Users and groups \\
                 Process credentials \\
                 Time \\
                 System limits and options \\
                 System and process information \\
                 File I/O buffering \\
                 File systems \\
                 File attributes \\
                 Extended attributes \\
                 Access control lists \\
                 Directories and links \\
                 Monitoring file events \\
                 Signals: fundamental concepts \\
                 Signals: signal handlers \\
                 Signals: advanced features \\
                 Timers and sleeping \\
                 Process creation \\
                 Process termination \\
                 Monitoring child processes \\
                 Program execution \\
                 Process creation and program execution in more detail
                 \\
                 Threads: introduction \\
                 Threads: thread synchronization \\
                 Threads: thread safety and per-thread storage \\
                 Threads: thread cancellation \\
                 Threads: further details \\
                 Process groups, sessions, and job control \\
                 Process priorities and scheduling \\
                 Process resources \\
                 Daemons \\
                 Writing secure privileged programs \\
                 Capabilities \\
                 Login accounting \\
                 Fundamentals of shared libraries \\
                 Advanced features of shared libraries \\
                 Interprocess communication overview \\
                 Pipes and FIFOs \\
                 Introduction to System V IPC \\
                 System V message queues \\
                 System V semaphores \\
                 System V shared memory \\
                 Memory mappings \\
                 Virtual memory operations \\
                 Introduction to POSIX IPC \\
                 POSIX message queues \\
                 POSIX semaphores \\
                 POSIX shared memory \\
                 File locking \\
                 Sockets: introduction \\
                 Sockets: UNIX domain \\
                 Sockets: fundamentals of TCP/IP networks \\
                 Sockets: Internet domains \\
                 Sockets: server design \\
                 Sockets: advanced topics \\
                 Terminals \\
                 Alternative I/O models \\
                 Pseudoterminals \\
                 Appendixes. Tracing system calls \\
                 Parsing command-line options \\
                 Casting the NULL pointer \\
                 Kernel configuration \\
                 Further sources of information \\
                 Solutions to selected exercises",
}

@Book{Kershaw:2005:MFH,
  editor =       "Ian Kershaw",
  title =        "Making Friends with {Hitler}: {Lord Londonderry}, the
                 {Nazis}, and the Road to {World War II}",
  publisher =    pub-PENGUIN,
  address =      pub-PENGUIN:adr,
  pages =        "xix + 488",
  year =         "2005",
  ISBN =         "1-59420-030-0, 0-14-303607-6",
  ISBN-13 =      "978-1-59420-030-4, 978-0-14-303607-4",
  LCCN =         "D750 .K49 2004",
  bibdate =      "Mon Oct 26 18:18:36 MDT 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 zeus.statsbiblioteket.dk:210/Horizon",
  acknowledgement = ack-nhfb,
  subject =      "Londonderry; Charles Stewart Henry
                 Vane-Tempest-Stewart; Marquess; 1878--1949; World War,
                 1939--1945; Diplomatic history; Great Britain; Foreign
                 relations; Germany; 1936--1945; 1933--1945",
  tableofcontents = "A Patrician's progress \\
                 Illusions and delusions about Hitler \\
                 Downfall of the Air Minister \\
                 Nazi friends \\
                 Lengthening shadows \\
                 Hope at last \\
                 End of the dream \\
                 Out in the cold \\
                 Mount Stewart, September 1947",
}

@Book{Kessener:1986:DSR,
  author =       "L. R. A. Kessener and F. J. Peters and M. L. P. {van
                 Lierop}",
  title =        "Data Structures for Raster Graphics",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "vi + 201",
  year =         "1986",
  ISBN =         "0-387-16310-7",
  ISBN-13 =      "978-0-387-16310-9",
  LCCN =         "QA76.9.D35 D381 1986",
  bibdate =      "Mon Oct 26 08:36:47 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Kessler:1988:LOS,
  author =       "Robert R. Kessler",
  title =        "{LISP}, Objects, and Symbolic Programming",
  publisher =    pub-SCOTT-FORESMAN,
  address =      pub-SCOTT-FORESMAN:adr,
  pages =        "xii + 644",
  year =         "1988",
  ISBN =         "0-673-39773-4 (paperback), 0-673-39773-1",
  ISBN-13 =      "978-0-673-39773-7 (paperback), 978-0-673-39773-7",
  LCCN =         "QA76.73.L23 K47 1988",
  bibdate =      "Wed Dec 15 10:36:15 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Kevles:1979:PHS,
  author =       "Daniel J. Kevles",
  title =        "The Physicists: the History of a Scientific Community
                 in Modern {America}",
  publisher =    "Vintage Books",
  address =      "New York, NY, USA",
  pages =        "xi + 489",
  year =         "1979",
  ISBN =         "0-394-72669-3 (paperback)",
  ISBN-13 =      "978-0-394-72669-4 (paperback)",
  LCCN =         "QC9.U5 K48 1979",
  bibdate =      "Wed Aug 16 06:36:20 MDT 2023",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  remark =       "Not in my library. Reprint of the edition published by
                 Knopf, New York. Copyright page says 1971, 1972, 1974,
                 1977, and First Vintage Books Edition, February 1979.
                 The preface is dated February 1977.",
  subject =      "Science; United States; History; Physicists; Physics",
  tableofcontents = "Preface / ix \\
                 1: The many wants of science / 3 \\
                 2: Ennobling and purifying the mind / 14 \\
                 3: The flaws of American physics / 25 \\
                 4: Pure science and practical politics / 45 \\
                 5: Research and reform / 60 \\
                 6: Joining the revolution / 75 \\
                 7: A need for new patrons / 91 \\
                 8: ``War should mean research'' / 102 \\
                 9: The war work of the physicists / 117 \\
                 10: Cold War in science / 139 \\
                 11: The impact of quantum mechanics / 155 \\
                 12: Popularization and conservatism / 170 \\
                 13: Making the peaks higher / 185 \\
                 14: A new center of physics / 200 \\
                 15: Miraculous year / 222 \\
                 16: Revolt against science / 236 \\
                 17: The New Deal and research / 252 \\
                 18: Recovery in physics / 267 \\
                 19: Organizing for defense / 287 \\
                 20: A physicists' war / 302 \\
                 21: The bomb and postwar research policy / 324 \\
                 22: Victory for elitism / 349 \\
                 23: The physicists established / 367 \\
                 24: New revolt against science / 393 \\
                 25: A degree of disestablishment / 410 \\
                 Glossary of manuscript citations / 427 \\
                 Acknowledgments / 431 \\
                 Essay on source / 435 \\
                 Index / 465",
}

@Article{Keyes:IBMJRD-32-1-24,
  author =       "Robert W. Keyes",
  title =        "Miniaturization of electronics and its limits",
  journal =      j-IBM-JRD,
  volume =       "32",
  number =       "1",
  pages =        "24--28",
  month =        jan,
  year =         "1988",
  bibdate =      "Sun Mar 27 18:26:09 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Article{Khayat:arabic-dot-matrix,
  author =       "M. G. Khayat",
  title =        "Printing {Arabic} Text on Dot Matrix Printers",
  journal =      j-SPE,
  volume =       "16",
  number =       "2",
  pages =        "165--172",
  month =        feb,
  year =         "1986",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Khoshnevisan:2002:MPI,
  author =       "Davar Khoshnevisan",
  title =        "Multiparameter Processes: An Introduction to Random
                 Fields",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xix + 584",
  year =         "2002",
  DOI =          "https://doi.org/10.1007/b97363",
  ISBN =         "0-387-95459-7",
  ISBN-13 =      "978-0-387-95459-2",
  LCCN =         "QA274.45 .K58 2002",
  bibdate =      "Thu Sep 12 15:52:23 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/utah-math-dept-books.bib",
  series =       "Springer Monographs in Mathematics",
  abstract =     "Multiparameter processes extend the existing
                 one-parameter theory of random processes in an elegant
                 way, and have found connections to diverse disciplines
                 such as probability theory, real and functional
                 analysis, group theory, analytic number theory, and
                 group renormalization in mathematical physics, to name
                 a few. This book lays the foundation of aspects of the
                 rapidly-developing subject of random fields, and is
                 designed for a second graduate course in probability
                 and beyond. Its intended audience is pure, as well as
                 applied, mathematicians. Davar Khoshnevisan is
                 Professor of Mathematics at the University of Utah. His
                 research involves random fields, probabilistic
                 potential theory, and stochastic analysis.",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "Discrete-Parameter Random Fields \\
                 Discrete-Parameter Martingales \\
                 Two Applications in Analysis \\
                 Random Walks \\
                 Multiparameter Walks \\
                 Gaussian Random Variables \\
                 Limit Theorems \\
                 Continuous-Parameter Random Fields \\
                 Continuous-Parameter Martingales \\
                 Constructing Markov Processes \\
                 Generation of Markov Processes \\
                 Probabilistic Potential Theory \\
                 Multiparameter Markov Processes \\
                 The Brownian Sheet and Potential Theory",
  tableofcontents = "Preface \\
                 List of Figures \\
                 General Notation \\
                 I Discrete-Parameter Random Fields \\
                 1 Discrete-Parameter Martingales \\
                 1 One-Parameter Martingales \\
                 2 Orthomartingales: Aspects of the Cairoli \ldots{}
                 Walsh Theory \\
                 3 Martingales \\
                 4 Supplementary Exercises \\
                 5 Notes on Chapter 1 \\
                 2 Two Applications in Analysis \\
                 1 Haar Systems \\
                 2 Differentiation \\
                 3 Supplementary Exercises \\
                 4 Notes on Chapter 2 \\
                 3 Random Walks \\
                 1 One-Parameter Random Walks \\
                 2 Intersection Probabilities \\
                 3 The Simple Random Walk \\
                 4 Supplementary Exercises \\
                 5 Notes on Chapter 3 \\
                 4 Multiparameter Walks \\
                 1 The Strong Law of Large Numbers \\
                 2 The Law of the Iterated Logarithm \\
                 3 Supplementary Exercises \\
                 4 Notes on Chapter 4 \\
                 5 Gaussian Random Variables \\
                 1 The Basic Construction \\
                 2 Regularity Theory \\
                 3 The Standard Brownian Sheet \\
                 4 Supplementary Exercises \\
                 5 Notes on Chapter 5 \\
                 6 Limit Theorems \\
                 1 Random Variables \\
                 2 Weak Convergence \\
                 3 The Space C \\
                 4 Invariance Principles \\
                 5 Supplementary Exercises \\
                 6 Notes on Chapter 6 \\
                 II Continuous-Parameter Random Fields \\
                 7 Continuous-Parameter Martingales \\
                 1 One-Parameter Martingales \\
                 2 Multiparameter Martingales \\
                 3 One-Parameter Stochastic Integration \\
                 4 An Introduction to Stochastic PDEs \\
                 5 Supplementary Exercises \\
                 6 Notes on Chapter 7 \\
                 8 Constructing Markov Processes \\
                 1 Discrete Markov Chains \\
                 2 Markov Semigroups \\
                 3 Markov Processes \\
                 4 Feller Processes \\
                 5 Supplementary Exercises \\
                 6 Notes on Chapter 8 \\
                 9 Generation of Markov Processes \\
                 1 Generation \\
                 2 Explicit Computations \\
                 3 The Feynman \ldots{} Kac Formula \\
                 4 Exit Times and Brownian Motion \\
                 5 Supplementary Exercises \\
                 6 Notes on Chapter 9 \\
                 10 Probabilistic Potential Theory \\
                 1 Recurrent Levy Processes \\
                 2 Hitting Probabilities for Feller Processes \\
                 3 Explicit Computations \\
                 4 Supplementary Exercises \\
                 5 Notes on Chapter 10 \\
                 11 Multiparameter Markov Processes \\
                 1 Definitions \\
                 2 Examples \\
                 3 Potential Theory \\
                 4 Applications \\
                 5 a-Regular Gaussian Random Fields \\
                 6 Supplementary Exercises \\
                 7 Notes on Chapter 11 \\
                 12 The Brownian Sheet and Potential Theory \\
                 1 Polar Sets for the Range of the Brownian Sheet \\
                 2 The Codimension of the Level Sets \\
                 3 Local Times as Frostman's Measures \\
                 4 Supplementary Exercises \\
                 5 Notes on Chapter 12 \\
                 III Appendices \\
                 A Kolmogorov's Consistency Theorem \\
                 B Laplace Transforms \\
                 1 Uniqueness and Convergence Theorems \\
                 2 A Tauberian Theorem \\
                 C Hausdorff Dimensions and Measures \\
                 1 Preliminaries \\
                 2 Frostman's Theorems \\
                 3 Notes on Appendix C \\
                 D Energy and Capacity \\
                 1 Preliminaries \\
                 2 Choquet Capacities \\
                 3 Notes on Appendix D \\
                 References \\
                 Name Index",
}

@Book{Khoshnevisan:2007:P,
  author =       "Davar Khoshnevisan",
  title =        "Probability",
  volume =       "80",
  publisher =    pub-AMS,
  address =      pub-AMS:adr,
  pages =        "xvi + 224",
  year =         "2007",
  ISBN =         "0-8218-4215-3",
  ISBN-13 =      "978-0-8218-4215-7",
  ISSN =         "1065-7339",
  LCCN =         "QA273 .K488 2007",
  bibdate =      "Tue May 1 14:40:56 MDT 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Graduate studies in mathematics",
  acknowledgement = ack-nhfb,
  subject =      "Probabilities",
  tableofcontents = "1: Classical probability \\
                 2: Bernoulli trials \\
                 3: Measure theory \\
                 4: Integration \\
                 5: Product spaces \\
                 6: Independence \\
                 7: The central limit theorem \\
                 8: Martingales \\
                 9: Brownian motion \\
                 10: Terminus: stochastic integration",
}

@Book{Kiernan:2013:GAC,
  author =       "Denise Kiernan",
  title =        "The girls of {Atomic City}: the untold story of the
                 women who helped win {World War II}",
  publisher =    pub-SIMON-SCHUSTER,
  address =      pub-SIMON-SCHUSTER:adr,
  pages =        "xvii + 373 + 16",
  year =         "2013",
  ISBN =         "1-4516-1752-6 (hardcover), 1-4516-1754-2 (e-book)",
  ISBN-13 =      "978-1-4516-1752-8 (hardcover), 978-1-4516-1754-2
                 (e-book)",
  LCCN =         "F444.O3 K54 2013",
  bibdate =      "Wed Apr 01 17:34:47 2015",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/f/fermi-enrico.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 jenson.stanford.edu:2210/unicorn;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "In this book the author traces the story of the unsung
                 World War II workers in Oak Ridge, Tennessee through
                 interviews with dozens of surviving women and other Oak
                 Ridge residents. This is the story of the young women
                 of Oak Ridge, Tennessee, who unwittingly played a
                 crucial role in one of the most significant moments in
                 U.S. history. The Tennessee town of Oak Ridge was
                 created from scratch in 1942. One of the Manhattan
                 Project's secret cities, it did not appear on any maps
                 until 1949, and yet at the height of World War II it
                 was using more electricity than New York City and was
                 home to more than 75,000 people, many of them young
                 women recruited from small towns across the South.
                 Their jobs were shrouded in mystery, but they were
                 buoyed by a sense of shared purpose, close friendships,
                 and a surplus of handsome scientists and Army men. But
                 against this wartime backdrop, a darker story was
                 unfolding. The penalty for talking about their work,
                 even the most innocuous details, was job loss and
                 eviction. One woman was recruited to spy on her
                 coworkers. They all knew something big was happening at
                 Oak Ridge, but few could piece together the true nature
                 of their work until the bomb ``Little Boy'' was dropped
                 over Hiroshima, Japan, and the secret was out. The
                 shocking revelation: the residents of Oak Ridge were
                 enriching uranium for the atomic bomb. Though the young
                 women originally believed they would leave Oak Ridge
                 after the war, many met husbands there, made lifelong
                 friends, and still call the seventy-year-old town home.
                 The reverberations from their work there, work they did
                 not fully understand at the time, are still being felt
                 today.",
  acknowledgement = ack-nhfb,
  subject =      "Oak Ridge (Tenn.); History; 20th century; Social life
                 and customs; Women employees; Tennessee; Oak Ridge;
                 Women; Interviews; Biography; Uranium enrichment;
                 Official secrets; United States; World War,
                 1939--1945",
  tableofcontents = "Introduction / ix \\
                 Principal Cast of Characters / xiii \\
                 Map --- Clinton Engineer Works, Tennessee, 1943--1945 /
                 xviii \\
                 Revelation, August 1945 / 1 \\
                 1: Everything will be taken care of: train to nowhere,
                 August 1943 / 3 \\
                 Tubealloy: the Bohemian Grove to the Appalachian Hills,
                 September 1942 / 15 \\
                 2: Peaches and pearls: the taking of Site X, Fall 1942
                 / 20 \\
                 Tubealloy: Ida and the atom, 1934 / 32 \\
                 3: Through the gates: Clinton Engineer Works, Fall 1943
                 / 35 \\
                 Tubealloy: Lise and fission, 1938 / 57 \\
                 4: Bull pens and creeps: the Project's welcome for new
                 employees / 63 \\
                 Tubealloy: Leona and success in Chicago, December 1942
                 / 75 \\
                 5: Only temporary: spring into Summer, 1944 / 81 \\
                 Tubealloy: the quest for product / 99 \\
                 6: To work / 109 \\
                 Tubealloy: the couriers / 131 \\
                 7: Rhythms of life / 133 \\
                 Tubealloy: Security, censorship, and the press / 151
                 \\
                 8: The one about fireflies \ldots{} / 156 \\
                 Tubealloy: pumpkins, spies, and chicken soup, Fall 1944
                 / 172 \\
                 9: The unspoken: sweethearts and secrets / 176 \\
                 Tubealloy: combining efforts in the New Year / 191 \\
                 10: Curiosity and silence / 193 \\
                 Tubealloy: the project's crucial spring / 205 \\
                 11: Innocence lost / 209 \\
                 Tubealloy: hope and the haberdasher, April--May 1945 /
                 223 \\
                 12: Sand jumps in the desert, July 1945 / 232 \\
                 13: The gadget revealed / 249 \\
                 14: Dawn of a thousand suns / 269 \\
                 15: Life in the new age / 286 \\
                 Epilogue / 311 \\
                 Notes / 317 \\
                 Acknowledgments / 349 \\
                 Index / 353 \\
                 About the author / 373",
}

@Book{Kim:2019:NPE,
  author =       "Y. S. Kim and Marilyn E. Noz",
  title =        "New perspectives on {Einstein}'s {$ E = m c^2 $}",
  publisher =    pub-WORLD-SCI,
  address =      pub-WORLD-SCI:adr,
  pages =        "xi + 192",
  year =         "2019",
  DOI =          "https://doi.org/10.1142/10925",
  ISBN =         "981-323-770-8 (hardcover), 981-323-771-6 (e-book)",
  ISBN-13 =      "978-981-323-770-4 (hardcover), 978-981-323-771-1
                 (e-book)",
  LCCN =         "QC173.59.S65 K56 2018",
  bibdate =      "Fri Mar 5 17:41:06 MST 2021",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/f/feynman-richard-p.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 =     "Einstein's energy--momentum relation is applicable to
                 particles of all speeds, including the particle at rest
                 and the massless particle moving with the speed of
                 light. If one formula or formalism is applicable to all
                 speeds, we say it is ''Lorentz-covariant.`` As for the
                 internal space-time symmetries, there does not appear
                 to be a clear way to approach this problem. For a
                 particle at rest, there are three spin degrees of
                 freedom. For a massless particle, there are helicity
                 and gauge degrees of freedom. The aim of this book is
                 to present one Lorentz-covariant picture of these two
                 different space--time symmetries. Using the same
                 mathematical tool, it is possible to give a
                 Lorentz-covariant picture of Gell-Mann's quark model
                 for the proton at rest and Feynman's parton model for
                 the fast-moving proton. The mathematical formalism for
                 these aspects of the Lorentz covariance is based on
                 two-by-two matrices and harmonic oscillators which
                 serve as two basic scientific languages for many
                 different branches of physics. It is pointed out that
                 the formalism presented in this book is applicable to
                 various aspects of optical sciences of current
                 interest.",
  acknowledgement = ack-nhfb,
  subject =      "Space and time; Lorentz transformations; Special
                 relativity (Physics); Lorentz transformations.; Space
                 and time.; Special relativity (Physics)",
  tableofcontents = "1: Introduction / 1--7 \\
                 2: Einstein's Philosophical Base / 9--19 \\
                 3: More about Einstein / 21--32 \\
                 4: Einstein in the United States / 33--51 \\
                 5: Introduction to the Lorentz Group / 53--64 \\
                 6: Wigner's Little Groups / 65--83 \\
                 7: Lorentz Completion of the Little Groups / 85--103
                 \\
                 8: Lorentz-covariant Harmonic Oscillators / 105--125
                 \\
                 9: Quarks and Partons / 127--145 \\
                 10: Feynman's Rest of the Universe / 147--165 \\
                 11: Further Applications of the Lorentz Group /
                 167--173 \\
                 Bibliography / 175--185 \\
                 Index / 187--192",
}

@Book{Kirk:1992:GGI,
  editor =       "David Kirk",
  title =        "Graphics Gems {III}",
  volume =       "3",
  publisher =    pub-HBJ,
  address =      pub-HBJ:adr,
  pages =        "xxxi + 631",
  year =         "1992",
  ISBN =         "0-12-409670-0 (with IBM disk), 0-12-409671-9 (with
                 Macintosh disk)",
  ISBN-13 =      "978-0-12-409670-7 (with IBM disk), 978-0-12-409671-4
                 (with Macintosh disk)",
  LCCN =         "T385 .G6973 1992",
  bibdate =      "Mon Aug 24 17:10:51 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Graphics Gems",
  abstract =     "This sequel to Graphics Gems (Academic Press, 1990),
                 and Graphics Gems II (Academic Press, 1991) is a
                 practical collection of computer graphics programming
                 tools and techniques. Graphics Gems III contains a
                 larger percentage of gems related to modeling and
                 rendering, particularly lighting and shading. This new
                 edition also covers image processing, numerical and
                 programming techniques, modeling and transformations,
                 2D and 3D geometry and algorithms, ray tracing and
                 radiosity, rendering, and more clever new tools and
                 tricks for graphics programming.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "Foreword \\
                 Preface \\
                 Mathematical Notation \\
                 Pseudo-Code \\
                 Contributors \\
                 Part I: Image Processing \\
                 Section I: Introduction \\
                 1: Fast Bitmap Stretching \\
                 Introduction \\
                 The Algorithm \\
                 Some Projects Using the Bitmap Stretcher \\
                 Further Work \\
                 2: General Filtered Image Rescaling \\
                 3: Optimization of Bitmap Scaling Operations \\
                 4: A Simple Color Reduction Filter \\
                 Introduction \\
                 The Filter \\
                 Implementation \\
                 Summary \\
                 5: Compact Isocontours from Sampled Data \\
                 Problem \\
                 Cube-Based Contouring \\
                 Compact Cubes \\
                 6: Generating Isovalue Contours from a Pixmap \\
                 7: Compositing Black-and-White Bitmaps \\
                 Introduction \\
                 Compositing Bitmaps \\
                 8: 2 1/2-D Depth-of-Field Simulation for Computer
                 Animation \\
                 Introduction \\
                 Related Work \\
                 The Algorithm \\
                 Change-of-Focus Simulation \\
                 Acknowledgment and Historical Note \\
                 9: A Fast Boundary Generator for Composited Regions \\
                 Problem \\
                 Other Methods \\
                 Fast Boundary Generation \\
                 Considerations \\
                 Part II: Numerical and Programming Techniques \\
                 Section II: Introduction \\
                 1: IEEE Fast Square Root \\
                 2: A Simple Fast Memory Allocator \\
                 3: The Rolling Ball \\
                 The Rolling-Ball Algorithm \\
                 Implementation \\
                 Extensions of the Rolling-Ball Method \\
                 Group Theory of Infinitesimal Rotations \\
                 Quaternion rotations, $2 \times 2$ Matrices, and SU(2)
                 Spinors \\
                 Four Euclidean Dimensions \\
                 Lorentz Transformations \\
                 Summary \\
                 Acknowledgment \\
                 4: Interval Arithmetic \\
                 5: Fast Generation of Cyclic Sequences \\
                 6: A Generic Pixel Selection Mechanism \\
                 7: Nonuniform Random Points Sets via Warping \\
                 8: Cross Product in Four Dimensions and Beyond \\
                 Introduction \\
                 Tensor Product \\
                 Wedge Product \\
                 Acknowledgment \\
                 9: Face-Connected Line Segment Generation in an
                 n-Dimensional Space \\
                 Part III: Modeling and Transformations \\
                 Section III: Introduction \\
                 1: Quaternion Interpolation with Extra Spins \\
                 2: Decomposing Projective Transformations \\
                 Introduction \\
                 First Decomposition Algorithm \\
                 Perspective in Four Dimensions \\
                 Second Decomposition Algorithm \\
                 Affine *Projective \\
                 Third Decomposition Algorithm \\
                 Perspective *Affine \\
                 Fourth Decomposition Algorithm \\
                 Affine * Perspective \\
                 Summary \\
                 3: Decomposing Linear and Affine Transformations \\
                 Goal \\
                 Nonsingular Linear Transformations \\
                 Singular Linear Transformations \\
                 Affine Transformations \\
                 4: Fast Random Rotation Matrices \\
                 5: Issues and Techniques for Keyframing Transformations
                 \\
                 Introduction \\
                 Interpolating in Logarithmic Space \\
                 Relative Motion \\
                 Linear vs. Splined Interpolation \\
                 Subdividing Motion \\
                 6: Uniform Random Rotations \\
                 Background \\
                 Planar Rotations \\
                 Uniform Spherical Distribution \\
                 Spatial Rotations \\
                 Angles Not Uniform \\
                 Uniform Rotations from Gaussians \\
                 Subgroup Algorithm \\
                 Distribution Check \\
                 Acknowledgments \\
                 7: Interpolation Using B{\'e}zier Curves \\
                 Introduction \\
                 Numeric Solution",
}

@Book{Kirk:2010:PMP,
  author =       "David B. Kirk and Wen-mei W. Hwu",
  title =        "Programming Massively Parallel Processors: a Hands-on
                 Approach",
  publisher =    pub-MORGAN-KAUFMANN,
  address =      pub-MORGAN-KAUFMANN:adr,
  pages =        "xviii + 258",
  year =         "2010",
  ISBN =         "0-12-381472-3",
  ISBN-13 =      "978-0-12-381472-2",
  LCCN =         "QA76.642 .K57 2010",
  bibdate =      "Thu Jul 29 13:33:50 MDT 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/pvm.bib;
                 https://www.math.utah.edu/pub/tex/bib/scpe.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib;
                 z3950.bibsys.no:2100/BIBSYS;
                 z3950.loc.gov:7090/Voyager",
  note =         "Chapter 7 (pages 125--140) discusses GPU
                 floating-point considerations.",
  acknowledgement = ack-nhfb,
  keywords =     "CUDA; nVIDIA",
  libnote =      "Not yet in my library.",
  subject =      "parallel programming (computer science); parallel
                 processing (electronic computers); multiprocessors;
                 computer architecture",
  tableofcontents = "1: Introduction \\
                 1.1 GPUs as Parallel Computers \\
                 1.2 Architecture of a Modern GPU \\
                 1.3 Why More Speed or Parallelism? \\
                 1.4 Parallel Programming Languages and Models \\
                 1.5 Overarching Goals \\
                 1.6 Organization of the Book \\
                 2: History of GPU Computing \\
                 2.1. Evolution of Graphics Pipelines The Era of Fixed
                 Function Graphics Pipeline Evolution of Programmable
                 Real-Time Graphics Unified Graphics and Computing
                 Processors \\
                 2.2. GPGPU: an Intermediate Step Scalable GPUs Recent
                 Developments Future Trends \\
                 3: Introduction to CUDA \\
                 3.1. Data Parallelism \\
                 3.2. CUDA Program Structure \\
                 3.3. A Matrix--Matrix Multiplication Example \\
                 3.4. Device Memories and Data Transfer \\
                 3.5. Kernel Functions and Threading \\
                 3.6. Summary Function Declarations Kernel Launch
                 Predefined Variables Runtime API \\
                 4: CUDA Threads \\
                 4.1. CUDA Thread Organization \\
                 4.2. More on BlockIdx and ThreadIdx \\
                 4.3. Synchronization and Transparent Scalability \\
                 4.4. Thread Assignment \\
                 4.5. Thread Scheduling and Latency Tolerance \\
                 4.6. Summary \\
                 5: CUDA Memories \\
                 5.1. Importance of Memory Access Efficiency \\
                 5.2. CUDA Device Memory Types \\
                 5.3. A Strategy for Reducing Global Memory Traffic \\
                 5.4. Memory as a Limiting Factor to Parallelism \\
                 5.5. Summary \\
                 6: Performance Considerations \\
                 6.1. More on Thread Execution \\
                 6.2. Global Memory Bandwidth \\
                 6.3. Dynamic Partitioning of SM Resources \\
                 6.4. Data Prefetching \\
                 6.5. Instruction Mix \\
                 6.6. Thread Granularity \\
                 6.7. Measured Performance and Summary \\
                 \\
                 7: Floating-Point Considerations \\
                 7.1. Floating-Point Format Normalized representation of
                 M Excess encoding of E \\
                 7.2. Representable Numbers \\
                 7.3. Special Bit Patterns and Precision \\
                 7.4. Arithmetic Accuracy and Rounding \\
                 7.5. Algorithm Considerations \\
                 7.6. Summary \\
                 8: Application Case Study I \\
                 Advanced MRI Reconstruction \\
                 8.1. Application Background \\
                 8.2. Iterative Reconstruction \\
                 8.3. Computing FHd \\
                 Step 1: Determine the Kernel Parallelism Structure \\
                 Step 2: Getting Around the Memory Bandwidth Limitation
                 \\
                 Step 3: Use Hardware Trigonometry Functions \\
                 Step 4: Experimental Performance Testing \\
                 8.4. Final Evaluation \\
                 9: Application Case Study II \\
                 Molecular Visualization and Analysis \\
                 9.1. Application Background \\
                 9.2. A Simple Kernel Implementation \\
                 9.3. Instruction Execution Efficiency \\
                 9.4. Memory Coalescing \\
                 9.5. Additional Performance Comparisons \\
                 9.6. Using Multiple GPUs \\
                 10: Parallel Programming and Computational Thinking \\
                 10.1. Goals of Parallel Programming \\
                 10.2. Problem Decomposition \\
                 10.3. Algorithm Selection \\
                 10.4. Computational Thinking \\
                 11: A Brief Introduction to OpenCL? \\
                 11.1. Background \\
                 11.2. Data Parallelism Model \\
                 11.3. Device Architecture \\
                 11.4. Kernel Functions \\
                 11.5. Device Management and Kernel Launch \\
                 11.6. Electrostatic Potential Map in OpenCL \\
                 11.7. Summary \\
                 12: Conclusion and Future Outlook \\
                 12.1. Goals Revisited \\
                 12.2. Memory Architecture Evolution \\
                 12.3. Kernel Execution Control Evolution \\
                 12.4. Core Performance \\
                 12.5. Programming Environment \\
                 12.6. A Bright Outlook \\
                 Appendix A: Matrix Multiplication Example Code \\
                 Appendix B: Speed and feed of current generation CUDA
                 devices",
}

@Book{Kirschenbaum:2005:GGH,
  author =       "Valerie Kirschenbaum",
  title =        "Goodbye {Gutenberg}: hello to a new generation of
                 readers and writers",
  publisher =    "Global Renaissance Society",
  address =      "New York, NY, USA",
  pages =        "416",
  year =         "2005",
  ISBN =         "0-9745750-3-8",
  ISBN-13 =      "978-0-9745750-3-2",
  LCCN =         "Z116.A3 K57 2005",
  bibdate =      "Thu Jul 12 12:30:02 MDT 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 melvyl.cdlib.org:210/CDL90",
  series =       "Designer Writers series",
  URL =          "http://www.goodbyegutenberg.com/",
  acknowledgement = ack-nhfb,
  subject =      "printing; history; books; book design; book
                 ornamentation",
  tableofcontents = "1: Hello to a new generation of writers \\
                 The first generation \\
                 The birth of the designer writer \\
                 Writing with body language \\
                 Writing in the color of the stars \\
                 Writers on designer writing \\
                 The visual prophet: William Blake \\
                 2: Hello to a new generation of readers \\
                 The Gutenberg clich\'e \\
                 Designer writing in Egypt \\
                 The visual secrets of Greece and Rome \\
                 Dawn of the designer poet: China \\
                 The philosopher painters of Maya \\
                 The golden ecstasies of Islam \\
                 These are the images: Hebrew illuminated manuscripts
                 \\
                 Thinking in images: Aristotle in medieval Europe \\
                 Seeing the divine in the Hindu and Buddhist traditions
                 \\
                 3: Hello to a new generation of women \\
                 Godmother of designer writing: Christine de Pisan \\
                 Feminine fonts \\
                 Booklady: a modern feminine font \\
                 4: Beauty and the book \\
                 Beauty and the book Part 1 \\
                 Beauty and the book Part 2 \\
                 5: Hello to a new generation of teachers \\
                 Color in education, advertising and the arts \\
                 Color, reading and the brain \\
                 Edgar Allan Poe \\
                 The eye is full of deceit: Plato \\
                 Birth of the comic book: Homer \\
                 Measuring the immeasurable: Chaucer \\
                 Image magic in Ethiopia \\
                 A new generation of visual theorists \\
                 Writing outside the box \\
                 Chaos in the classroom \\
                 6: Hello to the critics and skeptics \\
                 Critics of designer writing \\
                 Words on trial: ornament and decoration \\
                 7: Goodbye Gutenberg \\
                 A revaluation of visual values \\
                 Dawn of designer prose \\
                 The visual vernacular \\
                 The old way of reading and the new \\
                 Terror in the arts \\
                 And so begin the beautiful books.",
}

@Book{Kissinger:2011:C,
  author =       "Henry Kissinger",
  title =        "On {China}",
  publisher =    pub-PENGUIN,
  address =      pub-PENGUIN:adr,
  pages =        "xviii + 586 + 16",
  year =         "2011",
  ISBN =         "1-59420-271-0 (hardcover)",
  ISBN-13 =      "978-1-59420-271-1 (hardcover)",
  LCCN =         "DS775.8 .K47 2011",
  bibdate =      "Thu Jul 30 16:00:53 MDT 2015",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "In this sweeping and insightful history, Henry
                 Kissinger turns for the first time at book-length to a
                 country he has known intimately for decades, and whose
                 modern relations with the West he helped shape. Drawing
                 on historical records as well as his conversations with
                 Chinese leaders over the past forty years, Kissinger
                 examines how China has approached diplomacy, strategy,
                 and negotiation throughout its history, and reflects on
                 the consequences for the global balance of power in the
                 21st century. Since no other country can claim a more
                 powerful link to its ancient past and classical
                 principles, any attempt to understand China's future
                 world role must begin with an appreciation of its long
                 history. For centuries, China rarely encountered other
                 societies of comparable size and sophistication; it was
                 the `Middle Kingdom,' treating the peoples on its
                 periphery as vassal states. At the same time, Chinese
                 statesmen-facing threats of invasion from without, and
                 the contests of competing factions within-developed a
                 canon of strategic thought that prized the virtues of
                 subtlety, patience, and indirection over feats of
                 martial prowess. In \booktitle{On China}, Kissinger
                 examines key episodes in Chinese foreign policy from
                 the classical era to the present day, with a particular
                 emphasis on the decades since the rise of Mao Zedong.
                 He illuminates the inner workings of Chinese diplomacy
                 during such pivotal events as the initial encounters
                 between China and modern European powers, the formation
                 and breakdown of the Sino-Soviet alliance, the Korean
                 War, Richard Nixon's historic trip to Beijing, and
                 three crises in the Taiwan Straits. Drawing on his
                 extensive personal experience with four generations of
                 Chinese leaders, he brings to life towering figures
                 such as Mao, Zhou Enlai, and Deng Xiaoping, revealing
                 how their different visions have shaped China's modern
                 destiny. With his singular vantage on U.S.-China
                 relations, Kissinger traces the evolution of this
                 fraught but crucial relationship over the past 60
                 years, following its dramatic course from estrangement
                 to strategic partnership to economic interdependence,
                 and toward an uncertain future. With a final chapter on
                 the emerging superpower's 21st-century world role,
                 \booktitle{On China} provides an intimate historical
                 perspective on Chinese foreign affairs from one of the
                 premier statesmen of the 20th century.",
  acknowledgement = ack-nhfb,
  author-dates = "1923--",
  subject =      "World politics; 21st century; China; Foreign
                 relations; 20th century",
  tableofcontents = "1. The singularity of China: The era of Chinese
                 preeminence; Confucianism; Concepts of international
                 relations: impartiality or equality?; Chinese
                 Realpolitik and Sun Tzu's Art of War \\
                 2. The Kowtow question and the opium war: The Macartney
                 mission; The clash of two world orders: The Opium War;
                 Qiying's diplomacy: soothing the barbarians \\
                 3. From preeminence to decline: Wei Yuan's blueprint:
                 ``Using barbarians against barbarians,'' learning their
                 techniques; The erosion of authority: domestic
                 upheavals and the challenge of foreign encroachments;
                 Managing decline; The challenge of Japan; Korea; The
                 Boxer Uprising and the new era of warring states \\
                 4. Mao's continuous revolution: Mao and the great
                 harmony; Mao and international relations: the empty
                 city stratagem, Chinese deterrence, and the quest for
                 psychological advantage; The continuous revolution and
                 the Chinese people \\
                 5. Triangular diplomacy and the Korean War: Acheson and
                 the lure of Chinese Titoism; Kim Il-sung and the
                 outbreak of war; American intervention: resisting
                 aggression; Chinese reactions: another approach to
                 deterrence; Sino-American confrontation \\
                 6. China confronts both superpowers: The first Taiwan
                 Strait crisis; Diplomatic interlude with the United
                 States; Mao, Khrushchev, and the Sino-Soviet split; The
                 second Taiwan Strait crisis \\
                 7. A decade of crises: The great leap forward; The
                 Himalayan border dispute and the 1962 Sino-Indian War;
                 The cultural revolution; Was there a lost opportunity?
                 \\
                 8. The road to reconciliation: The Chinese strategy;
                 The American strategy; First steps: clashes at the
                 Ussuri River \\
                 9. Resumption of relations: first encounters with Mao
                 and Zhou: Zhou Enlai; Nixon in China: the meeting with
                 Mao; The Nixon-Zhou dialogue; The Shanghai
                 communiqu\'e; The aftermath \\
                 10. The quasi-alliance: conversations with Mao: The
                 ``horizontal line'': Chinese approaches to containment;
                 The impact of Watergate \\
                 11. The end of the Mao era: The succession crisis; The
                 fall of Zhou Enlai; Final meetings with Mao: the
                 swallows and the coming of the storm \\
                 12. The indestructible Deng: Deng's first return to
                 power; The death of leaders: Hua Guofeng; Deng's
                 ascendance: ``reform and opening up'' \\
                 13. ``Touching the tiger's buttocks'': the third
                 Vietnam War: Vietnam: confounder of great powers;
                 Deng's foreign policy: dialogue with America and
                 normalization; Deng's journeys; Deng's visit to America
                 and the new definition of Alliance; The third Vietnam
                 War \\
                 14. Reagan and the advent of normalcy: Taiwan arms
                 sales and the third communiqu\'e; China and the
                 superpowers: the new equilibrium; Deng's reform program
                 \\
                 15. Tiananmen: American dilemmas; The Fang Lizhi
                 controversy; The 12- and 24-character statements \\
                 16. What kind of reform? Deng's southern tour \\
                 17. A roller coaster ride toward another
                 reconciliation: the Jiang Zemin era: China and the
                 disintegrating Soviet Union; The Clinton administration
                 and China policy; The third Taiwan Strait crisis;
                 China's resurgence and Jiang's reflections \\
                 18. The new millennium: Differences in perspective; How
                 to define strategic opportunity; The national destiny
                 debate: the triumphalist view; Dai Bingguo: a
                 reaffirmation of peaceful rise \\
                 Does history repeat itself? The Crowe memorandum:
                 Toward a Pacific community?",
}

@Book{Kittsley:1963:PCE,
  author =       "Scott L. Kittsley",
  title =        "Physical Chemistry: Essentials of the Introductory
                 Course. Review Questions. Problems with Answers",
  volume =       "97",
  publisher =    pub-BARNES-NOBLE,
  address =      pub-BARNES-NOBLE:adr,
  edition =      "Second",
  pages =        "xvii + 217",
  year =         "1963",
  LCCN =         "QD453 .K47 1963",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "College Outline Series",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Klabnik:2017:RPL,
  author =       "Steve Klabnik and Carol Nichols",
  title =        "The {Rust} Programming Language",
  publisher =    pub-NO-STARCH,
  address =      pub-NO-STARCH:adr,
  pages =        "xxvii + 519",
  year =         "2017",
  ISBN =         "1-59327-828-4 (paperback), 1-59327-851-9 (e-pub)",
  ISBN-13 =      "978-1-59327-828-1 (paperback), 978-1-59327-851-9
                 (e-pub)",
  LCCN =         "QA76.73.R87 K53 2018",
  bibdate =      "Thu Oct 31 18:42:15 MDT 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/multithreading.bib",
  abstract =     "\booktitle{The Rust Programming Language} is the
                 official book on Rust; a community-developed, systems
                 programming language that runs blazingly fast, prevents
                 segfaults, and guarantees thread safety. Rust's memory
                 safety guarantees, enforced at compile time, safeguard
                 your programs against the many problems that pervade
                 other systems languages. Rust offers the control and
                 performance of a low-level language with the helpful
                 abstractions of a high level one, and does this all
                 without having a garbage collector. These
                 characteristics make Rust useful for embedding in other
                 languages, programs with specific space and time
                 requirements, and writing low-level code, like device
                 drivers and operating systems. \booktitle{The Rust
                 Programming Language} begins with a quick hands-on
                 project to introduce the basics, then explores key
                 concepts in depth, such as ownership, the type system,
                 error handling, and fearless concurrency. Detailed
                 explanations of Rust-oriented takes on topics like
                 pattern matching, iterators, and smart pointers combine
                 with examples and exercises to take you from theory to
                 practice. In addition to its thorough coverage of more
                 granular topics, \booktitle{The Rust Programming
                 Language} will show you how to: * Grasp important
                 concepts unique to Rust like ownership, borrowing, and
                 lifetimes; * Use Cargo, Rust's built-in package
                 manager, to build your code, including downloading and
                 building dependencies; * Effectively use Rust's
                 zero-cost abstractions and learn to build your own.
                 Developed with help from the community, \booktitle{The
                 Rust Programming Language} is your official guide to
                 becoming a productive Rust programmer. The official
                 guide to Rust, a community-developed, systems
                 programming language. Begins with a hands-on project to
                 introduce the basics, then explores key concepts in
                 depth''",
  acknowledgement = ack-nhfb,
  subject =      "Computer programming; Programming languages
                 (Electronic computers); Computer programming;
                 Programming languages (Electronic computers)",
  tableofcontents = "Foreword / by Nicholas Matsakis and Aaron Turon \\
                 Introduction \\
                 1: Getting Started \\
                 2: A Quick Tutorial \\
                 Guessing Game \\
                 3: Common Programming Concepts \\
                 4: Understanding Ownership \\
                 5: Structs \\
                 6: Enums and Pattern Matching \\
                 7: Modules \\
                 8: Common Collections \\
                 9: Error Handling \\
                 10: Generic Types, Traits, and Lifetimes \\
                 11: Testing \\
                 12: An Input\slash Output Project \\
                 13: Functional Language Features in Rust \\
                 Iterators and Closures \\
                 14: More about Cargo and Crates io \\
                 15: Smart Pointers \\
                 16: Concurrency \\
                 17: Is Rust Object Oriented? \\
                 18: Patterns \\
                 19: More About Lifetimes \\
                 20: Advanced Type System Features \\
                 Appendix A: Keywords \\
                 Appendix B: Operators \\
                 Appendix C: Derivable Traits \\
                 Appendix D: Nightly Rust\ \\
                 Nightly Rust \\
                 Glossary",
}

@Book{Klabnik:2019:RPL,
  author =       "Steve Klabnik and Carol Nichols",
  title =        "The {Rust} programming language",
  publisher =    pub-NO-STARCH,
  address =      pub-NO-STARCH:adr,
  edition =      "Second",
  pages =        "xxix + 526",
  year =         "2019",
  ISBN =         "1-09-812253-4, 1-71850-044-0 (paperback)",
  ISBN-13 =      "978-1-09-812253-9, 978-1-71850-044-0 (paperback)",
  LCCN =         "QA76.73.R87",
  bibdate =      "Fri Nov 8 05:59:02 MST 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/multithreading.bib",
  URL =          "http://proquest.safaribooksonline.com/?fpi=9781098122539;
                 https://nostarch.com/download/samples/RustProgrammingLanguage2018_Sample_ToC.pdf;
                 https://nostarch.com/Rust2018",
  abstract =     "\booktitle{The Rust Programming Language} is the
                 official book on Rust: an open source systems
                 programming language that helps you write faster, more
                 reliable software. Rust offers control over low-level
                 details (such as memory usage) in combination with
                 high-level ergonomics, eliminating the hassle
                 traditionally associated with low-level languages. The
                 authors of \booktitle{The Rust Programming Language},
                 members of the Rust Core Team, share their knowledge
                 and experience to show you how to take full advantage
                 of Rust's features-from installation to creating robust
                 and scalable programs. You'll begin with basics like
                 creating functions, choosing data types, and binding
                 variables and then move on to more advanced concepts,
                 such as: * Ownership and borrowing, lifetimes, and
                 traits * Using Rust's memory safety guarantees to build
                 fast, safe programs; * Testing, error handling, and
                 effective refactoring; * Generics, smart pointers,
                 multithreading, trait objects, and advanced pattern
                 matching; * Using Cargo, Rust's built-in package
                 manager, to build, test, and document your code and
                 manage dependencies; * How best to use Rust's advanced
                 compiler with compiler-led programming techniques
                 You'll find plenty of code examples throughout the
                 book, as well as three chapters dedicated to building
                 complete projects to test your learning: a number
                 guessing game, a Rust implementation of a command line
                 tool, and a multithreaded server. New to this edition:
                 An extended section on Rust macros, an expanded chapter
                 on modules, and appendixes on Rust development tools
                 and editions.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Rust (Computer program language); Computer
                 programming; Computer programming.; Rust (Computer
                 program language)",
  tableofcontents = "1: Getting started \\
                 2: Programming a guessing game \\
                 3: Common programming concepts \\
                 4: Understanding ownership \\
                 5: Using structs to structure related data \\
                 6: Enums and pattern matching \\
                 7: Managing growing projects with packages, crates, and
                 modules \\
                 8: Common collections \\
                 9: Error handling \\
                 10: Generic types, traits, and lifetimes \\
                 11: Writing automated tests \\
                 12: An I/O project: building a command line program \\
                 13: Functional language features: iterators and
                 closures \\
                 14: More about Cargo and Crates.io \\
                 15: Smart pointers \\
                 16: Fearless concurrency \\
                 17: Object-oriented programming features of Rust \\
                 18: Patterns and matching \\
                 19: Advanced features \\
                 20: Final project: building a multithreaded web server
                 \\
                 Appendix A: Keywords \\
                 Appendix B: Operators and Symbols \\
                 Appendix C: Derivable Traits \\
                 Appendix D: Useful Development Tools \\
                 Appendix E: Editions \\
                 Index",
}

@InCollection{Kleene:1956:REN,
  author =       "S. C. Kleene",
  editor =       "Claude E. Shannon and John McCarthy",
  booktitle =    "Automata studies",
  title =        "Representation of events in nerve nets and finte
                 automata",
  volume =       "34",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  bookpages =    "viii + 285",
  pages =        "3--40",
  year =         "1956",
  LCCN =         "QA1.A626 no.34; TJ211 .S47",
  bibdate =      "Thu Sep 19 08:19:19 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "This is the original paper that introduced the concept
                 of regular expressions, later widely implemented in
                 software tools in the Bell Laboratories Unix operating
                 system.",
  series =       "Annals of mathematics studies",
  acknowledgement = ack-nhfb,
}

@Book{Klemens:2006:MYC,
  author =       "Ben Klemens",
  title =        "Ma$+$h you can't use: patents, copyright, and
                 software",
  publisher =    "Brookings Institution Press",
  address =      "Washington, DC, USA",
  pages =        "ix + 181",
  year =         "2006",
  ISBN =         "0-8157-4942-2 (cloth)",
  ISBN-13 =      "978-0-8157-4942-4 (cloth)",
  LCCN =         "K1519.C6 K54 2006",
  bibdate =      "Wed Oct 14 08:20:54 MDT 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/toc/ecip0519/2005027332.html",
  abstract =     "Gathering perspectives from law, computer science,
                 mathematics, and economics, examines the intellectual
                 property issues surrounding computer software and
                 suggests how patents might accommodate the unique
                 structure of code and copyright for software could be
                 more effectively implemented.",
  acknowledgement = ack-nhfb,
  subject =      "Intellectual property; United States; Computer
                 software; Law and legislation",
  tableofcontents = "Introduction \\
                 Optimal breadth \\
                 From equations to software \\
                 Patenting math \\
                 Profiting from overbroad patents \\
                 The decentralized software market \\
                 Interoperability \\
                 Protecting text \\
                 Policy recommendations",
}

@Book{Klerer:1967:DCU,
  editor =       "Melvin Klerer and Granino A. Korn",
  title =        "Digital Computer User's Handbook",
  booktitle =    "Digital Computer User's Handbook",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  year =         "1967",
  LCCN =         "QA76.5 .K524",
  bibdate =      "Wed Dec 15 17:52:19 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/h/hamming-richard-w.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/w/wilkinson-james-hardy.bib;
                 https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/mathcw.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/technometrics1960.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Contributors / v \\
                 Preface / vii \\
                 \\
                 Part I Topics in Programming \\
                 \\
                 1.1. Elements of Programming / Melvin Klerer / 1-3 \\
                 1.2. Computer Number Systems and Arithmetic / Melvin
                 Klerer / 1-34 \\
                 1.3. Errors, Loss of Significance, and Data
                 Presentation / Melvin Klerer / 1-67 \\
                 1.4. Computer Characteristics Table / Charles W. Adams
                 Associates / 1-81 \\
                 1.5. Algorithmic Compiler Design / A. A. Grau / 1-141
                 \\
                 1.6. Structure and Use of ALGOL 60 / H. Bottenbruch /
                 1-181 \\
                 1.7. List-processing Languages / Paul W. Abrahams /
                 1-239 \\
                 1.8. Computer Languages for System Simulation / Howard
                 S. Krasnow / 1-258 \\
                 1.9. PERT/CPM / William C. Geoghan / 1-278 \\
                 1.10. Sorting and Merging / Martin A. Goetz / 1-292 \\
                 \\
                 Part II Numerical Techniques \\
                 \\
                 2.1. A Survey of Function-approximation Techniques /
                 Granino A. Korn / 2-3 \\
                 2.2. Solution of Linear Algebraic Equations and Matrix
                 Problems by Direct Method / James H. Wilkinson / 2-18
                 \\
                 2.3. Solution of Nonlinear Equations / Royce E. Beckett
                 / 2-56 \\
                 2.4. Interpolation, Curve Fitting, and Differentiation
                 / Kaiser S. Kunz / 2-82 \\
                 2.5. Numerical Integration / A. H. Stroud / 2-117 \\
                 2.6. Numerical Solution of Ordinary Differential
                 Equations / R. W. Hamming / 2-144 \\
                 2.7. Numerical Solution of Partial Differential
                 Equations / Walter J. Karplus and Venkateswararao
                 Vemuri / 2-163 \\
                 \\
                 Part III Statistical Methods \\
                 \\
                 3.1. Introduction to Statistical Methods / Granino A.
                 Korn / 3-3 \\
                 3.2. Statistical Techniques and Computations / Henry
                 Tucker / 3-18 \\
                 3.3. Computation of Power Spectra / Melvin Klerer /
                 3-53 \\
                 3.4. Random-number Generation and Monte-Carlo Methods /
                 T. E. Hull / 3-63 \\
                 \\
                 Part IV Computer Applications \\
                 \\
                 4.1. Symbolic Logic and Practical Applications / J. V.
                 Wait / 4-3 \\
                 4.2. Information Theory and Codes / Harvey L. Garner /
                 4-29 \\
                 4.3. Linear Programming / Lloyd Rosenberg / 4-63 \\
                 4.4. Nonlinear Programming / E. M. L. Beale / 4-117 \\
                 4.5. Commercial Data Processing / Robert V. Head /
                 4-153 \\
                 4.6. Digital Computers for Logical Design / Richard E.
                 Merwin and Jere L. Sanborn / 4-167 \\
                 4.7. Information Retrieval / Jack Belzer and Orrin E.
                 Taulbee / 4-193 \\
                 4.8. Some Parameter-optimization Techniques / Robert B.
                 McGhee / 4-234 \\
                 4.9. Scheduling and Inventory Control / Jerry L.
                 Sanders / 4-256 \\
                 4.10. Real-time Operations with Small General-purpose
                 Computers / Barbera W. Stephenson / 4-263 \\
                 \\
                 Index",
  xxISBN =       "none",
}

@Book{Klotz:1986:DDF,
  author =       "Irving M. (Irving Myron) Klotz",
  title =        "Diamond Dealers and Feather Merchants: Tales from the
                 Sciences",
  publisher =    pub-BIRKHAUSER,
  address =      pub-BIRKHAUSER:adr,
  pages =        "x + 120",
  year =         "1986",
  ISBN =         "0-8176-3303-0",
  ISBN-13 =      "978-0-8176-3303-5",
  LCCN =         "Q173 .K5735 1986",
  bibdate =      "Tue Dec 13 11:59:04 MST 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "To paraphrase Saul Bellow, it is extremely difficult
                 to escape from the conceptual bottles into which we
                 have been processed, or even to become aware that we
                 are confined within them. Anthropocentrism, an ancient
                 tradition, is an intellectual constraint that has
                 continually impeded objective probing of the universe
                 around and within us. We are probably born with that
                 constriction, perhaps as a result of evolutionary
                 selection or because each of us has been created in the
                 image of the Deity. But it is only the core of our
                 mental ``gestalt.'' Around it we find additional shells
                 of intellectual obstructions deposited by accretion
                 from our family, our teachers, our experiences and the
                 society in which we are immersed. It is very hazardous
                 to embrace novel scientific ideas. Personal and social
                 experiences show that the vast majority turn out to be
                 failures. What standards can one use to make judgments?
                 There is a universal tendency to rely on ``common
                 sense;'' but as Einstein pointed out, this is a
                 collection of views, sensible or not, imprinted in us
                 before the age of sixteen. I have found it a challenge
                 to convince young students that much of what they are
                 certain about and, in fact, correct about, is actually
                 contrary to common sense. For example, on any bright
                 day, anyone who is not blind or an idiot can see the
                 sun literally moving around the earth, from east to
                 west.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  remark =       "False claims and mistakes in science.",
  subject =      "Science; Miscellanea",
  tableofcontents = "Preface / ix \\
                 I: Bending Perception to Wish: The Future as Froth and
                 Fantasy / 1 \\
                 II: The Clouded Crystal Ball: Creases of the Mind / 21
                 \\
                 III: Great Discoveries Not Mentioned in Textbooks: N
                 Rays / 39 \\
                 IV: Grand Illusions: Russian Water / 67 \\
                 V: People Yearn to Believe: Dr. Fox Experiments / 97
                 \\
                 Epilogue / 117 \\
                 Acknowledgments / 119",
}

@Article{Klotz:1995:NMS,
  author =       "Irving M. Klotz",
  title =        "Number mysticism in scientific thinking",
  journal =      j-MATH-INTEL,
  volume =       "17",
  number =       "1",
  pages =        "43--51",
  year =         "1995",
  CODEN =        "MAINDC",
  ISSN =         "0343-6993",
  bibdate =      "Tue Dec 13 12:02:19 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Knuth:1979:TMN,
  author =       "Donald E. Knuth",
  title =        "{\TeX} and {\METAFONT}: New Directions in
                 Typesetting",
  publisher =    pub-DP,
  address =      pub-DP:adr,
  pages =        "xi + 201 + 105",
  year =         "1979",
  ISBN =         "0-932376-02-9",
  ISBN-13 =      "978-0-932376-02-2",
  LCCN =         "Z253.3 .K58 1979",
  bibdate =      "Wed Dec 15 10:37:42 1993",
  bibsource =    "Graphics/imager/imager.books.bib;
                 Graphics/siggraph/79.bib;
                 https://www.math.utah.edu/pub/tex/bib/font.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/siggraph/new/79.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib;
                 https://www.math.utah.edu/pub/tex/bib/texgraph.bib;
                 https://www.math.utah.edu/pub/tex/bib/typeset.bib",
  acknowledgement = ack-nhfb,
  keywords =     "Applications; character display/generation; character
                 display/generation and Applications; general
                 references; printing/publishing industry; programming
                 systems; software; standards text books; standards text
                 books and software",
  remark =       "A landmark book at the time it was published. Newer
                 versions exist. Less than portable as claimed, but
                 still significant. Required reading for anyone doing
                 font design and type setting.",
  tableofcontents = "Part 1: Mathematical Typography \\
                 Part 2: \TeX, a system for technical text \\
                 Part 3: METAFONT, a system for alphabet design",
}

@Article{Knuth:1984:LP,
  author =       "Donald E. Knuth",
  title =        "Literate Programming",
  journal =      j-CJ,
  volume =       "27",
  number =       "2",
  pages =        "97--111",
  month =        may,
  year =         "1984",
  bibdate =      "Wed Aug 24 17:14:45 MDT 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  keywords =     "design; human factors; languages",
  review =       "ACM CR 8501-0018",
  subject =      "D.2.7 Software, SOFTWARE ENGINEERING, Distribution and
                 Maintenance, Documentation \\ I.7.1 Computing
                 Methodologies, TEXT PROCESSING, Text Editing, Languages
                 \\ H.1.2 Information Systems, MODELS AND PRINCIPLES,
                 User/Machine Systems, Human factors \\ D.3 Software,
                 PROGRAMMING LANGUAGES, Language Constructs \\ I.7.1
                 Computing Methodologies, TEXT PROCESSING, Text Editing,
                 WEB",
}

@Book{Knuth:1984:TB,
  author =       "Donald E. Knuth",
  title =        "The {\TeX}book",
  volume =       "{\noopsort{1984a}}A",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "ix + 483",
  year =         "1984",
  ISBN =         "0-201-13447-0 (hardcover), 0-201-13448-9 (paperback)",
  ISBN-13 =      "978-0-201-13447-6 (hardcover), 978-0-201-13448-3
                 (paperback)",
  LCCN =         "Z253.4.T47 K58 1986",
  bibdate =      "Wed Dec 15 10:36:52 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 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/texgraph.bib;
                 https://www.math.utah.edu/pub/tex/bib/typeset.bib",
  note =         "Second printing, revised, October 1984. Sixth
                 printing, revised, January 1986; also published as {\sl
                 Computers \& Typesetting}, Vol. A. Twenty-fourth
                 printing, summer 1993, contains final revisions.
                 Twenty-first printing, June 1992.",
  price =        "US\$15.95 (paperback), US\$32.95 (hardcover)",
  series =       "Computers and Typesetting",
  acknowledgement = ack-nhfb,
  keywords =     "computerized typesetting; documentation; languages;
                 mathematics printing -- computer programs; TeX
                 (computer file)",
  remark =       "See translations
                 \cite{Knuth:1989:TBK,Knuth:1993:VT}.",
  subject =      "TeX (Computer file); TeX (Logiciel); TeX (Computer
                 file); Computerized typesetting; Mathematics printing;
                 Computer programs; Imprimerie; Composition automatique;
                 Math{\'e}matiques; Impression; Logiciels;
                 Math{\'e}matiques; Imprimerie; Computerized
                 typesetting; Computer programs; TeX (logiciel); TeX;
                 I.7.2 Computing Methodologies, TEXT PROCESSING,
                 Document Preparation \\ J.7 Computer Applications,
                 COMPUTERS IN OTHER SYSTEMS, Publishing \\ I.7.1
                 Computing Methodologies, TEXT PROCESSING, Text
                 Editing",
  tableofcontents = "1: The Name of the Game / 1 \\
                 2: Book Printing versus Ordinary Typing / 3 \\
                 3: Controlling \TeX{} / 7 \\
                 4: Fonts of Type / 13 \\
                 5: Grouping / 19 \\
                 6: Running \TeX{} / 23 \\
                 7: How \TeX{} Reads What You Type / 37 \\
                 8: The Characters You Type / 43 \\
                 9: \TeX{}'s Roman Fonts / 51 \\
                 10: Dimensions / 57 \\
                 11: Boxes / 63 \\
                 12: Glue / 69 \\
                 13: Modes / 85 \\
                 14: How \TeX{} Breaks Paragraphs into Lines / 91 \\
                 15: How \TeX{} Makes Lines into Pages / 109 \\
                 16: Typing Math Formulas / 127 \\
                 17: More about Math / 139 \\
                 18: Fine Points of Mathematics Typing / 161 \\
                 19: Displayed Equations / 185 \\
                 20: Definitions (also called Macros) / 199 \\
                 21: Making Boxes / 221 \\
                 22: Alignment / 231 \\
                 23: Output Routines / 251 \\
                 24: Summary of Vertical Mode / 267 \\
                 25: Summary of Horizontal Mode / 285 \\
                 26: Summary of Math Mode / 289 \\
                 27: Recovery from Errors / 295 \\
                 Appendices \\
                 A: Answers to All the Exercises / 305 \\
                 B: Basic Control Sequences / 339 \\
                 C: Character Codes / 367 \\
                 D: Dirty Tricks / 373 \\
                 E: Example Formats / 403 \\
                 F: Font Tables / 427 \\
                 G: Generating Boxes from Formulas / 441 \\
                 H: Hyphenation / 449 \\
                 I: Index / 457 \\
                 J: Joining the \TeX{} Community / 483",
}

@InCollection{Knuth:1990:SPW,
  author =       "Donald E. Knuth",
  editor =       "W. H. J. Feijen and A. J. M. van Gasteren and D. Gries
                 and J. Misra",
  title =        "A Simple Program Whose Proof Isn't",
  crossref =     "Feijen:1990:BOB",
  chapter =      "27",
  pages =        "233--242",
  year =         "1990",
  bibdate =      "Sun Mar 27 17:53:57 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "This paper discusses the algorithm used in {\TeX} for
                 converting between decimal and scaled fixed-point
                 binary values, and for guaranteeing a minimum number of
                 digits in the decimal representation. See also
                 \cite{Clinger:floating-point-input} for decimal to
                 binary conversion, \cite{Steele:floating-point-output}
                 for binary to decimal conversion, and
                 \cite{Gries:1990:BDO} for an alternate proof of Knuth's
                 algorithm.",
  acknowledgement = ack-nhfb,
}

@Book{Knuth:1992:LP,
  author =       "Donald E. Knuth",
  title =        "Literate Programming",
  volume =       "27",
  publisher =    pub-SUCSLI,
  address =      pub-SUCSLI:adr,
  pages =        "xv + 368",
  year =         "1992",
  ISBN =         "0-937073-80-6 (paperback), 0-937073-81-4 (hardcover)",
  ISBN-13 =      "978-0-937073-80-3 (paperback), 978-0-937073-81-0
                 (hardcover)",
  LCCN =         "QA76.6.K644",
  bibdate =      "Tue Mar 03 12:24:41 1998",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 https://www.math.utah.edu/pub/tex/bib/acm-turing-awards.bib;
                 https://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/css.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/spell.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  series =       "CSLI Lecture Notes",
  URL =          "http://csli-www.stanford.edu/publications/literate.html",
  acknowledgement = ack-nhfb,
  keywords =     "electronic digital computers --- programming",
  remark =       "See translation \cite{Knuth:1994:BP}.",
  tableofcontents = "1: Computer programming as an art / 1 \\
                 2: Structured programming with go to statements / 17
                 \\
                 3: A structured program to generate all topological
                 sorting arrangements / 91 \\
                 4: Literate programming / 99 \\
                 5: Programming pearls: Sampling / 137 \\
                 6: Programming pearls, continued: Common Words / 151
                 \\
                 7: How to read a WEB / 179 \\
                 8: Excerpts from the programs for \TeX{} and METAFONT /
                 185 \\
                 9: Mathematical writing / 235 \\
                 10: Errors of \TeX{} / 243 \\
                 11: Error log of \TeX{} / 293 \\
                 12: Example of CWEB / 341 \\
                 Further Reading / 349 \\
                 Index / 359",
}

@Book{Knuth:1993:CSS,
  author =       "Donald E. Knuth and Silvio Levy",
  title =        "The {CWEB} System of Structured Documentation, Version
                 3.0",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "226",
  year =         "1993",
  ISBN =         "0-201-57569-8",
  ISBN-13 =      "978-0-201-57569-9",
  LCCN =         "QA76.9.D3 K6 1993",
  bibdate =      "Thu May 12 08:36:22 1994",
  bibsource =    "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/texbook3.bib",
  abstract =     "WEB is a software system that facilitates the creation
                 of readable programs. It was originally developed by
                 Donald E. Knuth as he programmed the TEX typesetting
                 system. Users of WEB are able to write programs of
                 superior quality; produce state-of-the-art
                 documentation; greatly reduce debugging time and
                 maintain programs easily as conditions change. CWEB is
                 a version of WEB for documenting C and C++ programs.
                 WEB was adapted to C by Silvio Levy in 1987, and since
                 then both Knuth and Levy have revised and enhanced the
                 system in many ways, notably to support C++ and ANSI C.
                 Thus CWEB combines TEX with two of today's most widely
                 used professional programming languages. This book is
                 the definitive user's guide and reference manual for
                 the CWEB system. The CWEB software itself is freely
                 available via anonymous ftp from labrea.stanford.edu on
                 the Internet.",
  acknowledgement = ack-nhfb,
}

@Book{Knuth:1997:FA,
  author =       "Donald E. Knuth",
  title =        "Fundamental Algorithms",
  volume =       "1",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Third",
  pages =        "xix + 650",
  year =         "1997",
  ISBN =         "0-201-89683-4",
  ISBN-13 =      "978-0-201-89683-1",
  LCCN =         "QA76.6 .K64 1997",
  bibdate =      "Fri Jul 11 15:41:22 1997",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg-2ed.bib;
                 https://www.math.utah.edu/pub/tex/bib/fibquart.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook2.bib",
  price =        "US\$49.50",
  series =       "The Art of Computer Programming",
  acknowledgement = ack-nhfb,
  keywords =     "computer algorithms; electronic digital computers --
                 programming",
  tableofcontents = "1: Basic Concepts / 1 \\
                 1.1. Algorithms / 1 \\
                 1.2. Mathematical Preliminaries / 10 \\
                 1.2.1. Mathematical Induction / 11 \\
                 1.2.2. Numbers, Powers, and Logarithms / 21 \\
                 1.2.3. Sums and Products / 27 \\
                 1.2.4. Integer Functions and Elementary Number Theory /
                 39 \\
                 1.2.5. Permutations and Factorials / 45 \\
                 1.2.6. Binomial Coefficients / 52 \\
                 1.2.7. Harmonic Numbers / 75 \\
                 1.2.8. Fibonacci Numbers / 79 \\
                 1.2.9. Generating Functions / 87 \\
                 1.2.10. Analysis of an Algorithm / 96 \\
                 * 1.2.11. Asymptotic Representations / 107 \\
                 *1.2.11.1. The $O$-notation / 107 \\
                 *1.2.11.2. Euler's summation formula / 111 \\
                 *1.2.11.3. Some asymptotic calculations / 116 \\
                 1.3. MIX / 124 \\
                 1.3.1. Description of MIX / 124 \\
                 1.3.2. The MIX Assembly Language / 144 \\
                 1.3.3. Applications to Permutations / 164 \\
                 1.4. Some Fundamental Programming Techniques / 186 \\
                 1.4.1. Subroutines / 186 \\
                 1.4.2. Coroutines / 193 \\
                 1.4.3. Interpretive Routines / 200 \\
                 1.4.3.1. A MIX simulator / 202 \\
                 *1.4.3.2. Trace routines / 212 \\
                 1.4.4. Input and Output / 215 \\
                 1.4.5. History and Bibliography / 229 \\
                 2: Information Structures / 232 \\
                 2.1. Introduction / 232 \\
                 2.2. Linear Lists / 238 \\
                 2.2.1. Stacks, Queues, and Deques / 238 \\
                 2.2.2. Sequential Allocation / 244 \\
                 2.2.3. Linked Allocation / 254 \\
                 2.2.4. Circular Lists / 273 \\
                 2.2.5. Doubly Linked Lists / 280 \\
                 2.2.6. Arrays and Orthogonal Lists / 298 \\
                 2.3. Trees / 308 \\
                 2.3.1. Traversing Binary Trees / 318 \\
                 2.3.2. Binary Tree Representation of Trees / 334 \\
                 2.3.3. Other Representations of Trees / 348 \\
                 2.3.4. Basic Mathematical Properties of Trees / 362 \\
                 2.3.4.1. Free trees / 363 \\
                 2.3.4.2. Oriented trees / 372 \\
                 *2.3.4.3. The ``infinity lemma'' / 382 \\
                 *2.3.4.4. Enumeration of trees / 386 \\
                 2.3.4.5. Path length / 399 \\
                 *2.3.4.6. History and bibliography / 406 \\
                 2.3.5. Lists and Garbage Collection / 408 \\
                 2.4. Multilinked Structures / 424 \\
                 2.5. Dynamic Storage Allocation / 435 \\
                 2.6. History and Bibliography / 457 \\
                 Answers to Exercises / 466 \\
                 Appendix A: Tables of Numerical Quantities / 619 \\
                 1. Fundamental Constants (decimal) / 619 \\
                 2. Fundamental Constants (octal) / 620 \\
                 3. Harmonic Numbers, Bernoulli Numbers, Fibonacci
                 Numbers / 621 \\
                 Appendix B: Index to Notations / 623 \\
                 Appendix C: Index to Algorithms and Theorems / 628 \\
                 Index and Glossary / 630",
}

@Book{Knuth:1998:SA,
  author =       "Donald E. Knuth",
  title =        "Seminumerical Algorithms",
  volume =       "2",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Third",
  pages =        "xiii + 762",
  year =         "1998",
  ISBN =         "0-201-89684-2",
  ISBN-13 =      "978-0-201-89684-8",
  LCCN =         "QA76.6 .K64 1997",
  bibdate =      "Fri Jul 11 15:41:22 1997",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.bib;
                 https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg-2ed.bib;
                 https://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
                 https://www.math.utah.edu/pub/tex/bib/css.bib;
                 https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook2.bib",
  price =        "US\$52.75",
  series =       "The Art of Computer Programming",
  acknowledgement = ack-nhfb,
  tableofcontents = "3: Random Numbers / 1 \\
                 3.1. Introduction / 1 \\
                 3.2. Generating Uniform Random Numbers / 10 \\
                 3.2.1. The Linear Congruential Method / 10 \\
                 3.2 1.1. Choice of modulus / 12 \\
                 3.2.1.2 Choice of multiplier / 16 \\
                 3.2.1.3. Potency / 23 \\
                 3.2.2. Other Methods / 26 \\
                 3.3. Statistical Tests / 41 \\
                 3.3.1. General Test Procedures for Studying Random Data
                 / 41 \\
                 3.3.2. Empirical Tests / 61 \\
                 *3.3.3. Theoretical Tests / 80 \\
                 3.3.4. The Spectral Test / 93 \\
                 3.4. Other Types of Random Quantities / 119 \\
                 3.4 1. Numerical Distributions / 119 \\
                 3.4.2. Random Sampling and Shuffling / 142 \\
                 *3.5. What Is a Random Sequence? / 149 \\
                 3.6. Summary / 184 \\
                 4: Arithmetic / 194 \\
                 4.1. Positional Number Systems / 195 \\
                 4.2. Floating Point Arithmetic / 214 \\
                 4.2.1. Single-Precision Calculations / 214 \\
                 4.2 2. Accuracy of Floating Point Arithmetic / 229 \\
                 *4.2.3. Double-Precision Calculations / 246 \\
                 4.2.4. Distribution of Floating Point Numbers / 253 \\
                 4.3 Multiple Precision Arithmetic / 265 \\
                 4.3.1. The Classical Algorithms / 265 \\
                 *4.3.2. Modular Arithmetic / 284 \\
                 *4.3.3. How Fast Can We Multiply? / 294 \\
                 4.4. Radix Conversion / 319 \\
                 4.5. Rational Arithmetic / 330 \\
                 4.5.1. Fractions / 330 \\
                 4.5.2. The Greatest Common Divisor / 333 \\
                 *4.5.3. Analysis of Euclid's Algorithm / 356 \\
                 4.5.4. Factoring into Primes / 379 \\
                 4.6. Polynomial Arithmetic / 418 \\
                 4.6.1. Division of Polynomials / 420 \\
                 *4.6.2. Factorization of Polynomials / 439 \\
                 4.6.3. Evaluation of Powers / 461 \\
                 4.6.4. Evaluation of Polynomials / 485 \\
                 *4.7. Manipulation of Power Series / 525 \\
                 Answers to Exercises / 538 \\
                 Appendix A: Tables of Numerical Quantities / 726 \\
                 1. Fundamental Constants (decimal) / 726 \\
                 2; Fundamental Constants ( octal) / 727 \\
                 3. Harmonic Numbers, Bernoulli Numbers, Fibonacci
                 Numbers / 728 \\
                 Appendix B: Index to Notations / 730 \\
                 Index and Glossary / 735",
}

@Book{Knuth:1998:SS,
  author =       "Donald E. Knuth",
  title =        "Sorting and Searching",
  volume =       "3",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Second",
  pages =        "xiv + 780",
  year =         "1998",
  ISBN =         "0-201-89685-0",
  ISBN-13 =      "978-0-201-89685-5",
  LCCN =         "QA76.6.K64 1997",
  bibdate =      "Sat Feb 27 11:11:53 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/string-matching.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook2.bib",
  price =        "US\$49.95",
  series =       "The Art of Computer Programming",
  acknowledgement = ack-nhfb,
  tableofcontents = "5: Sorting / 1 \\
                 *5.1. Combinatorial Properties of Permutations / 11 \\
                 *5.1.1. Inversions / 11 \\
                 *5.1.2. Permutations of a Multiset / 22 \\
                 *5.1.3. Runs / 35 \\
                 *5.1.4 Tableaux and Involutions / 47 \\
                 5.2. Internal sorting / 73 \\
                 5.2 l. Sorting by Insertion / 80 \\
                 5.2.2. Sorting by Exchanging / 105 \\
                 5.2.3. Sorting by Selection / 138 \\
                 5.2.4 Sorting by Merging / 158 \\
                 5.2 5. Sorting by Distribution / 168 \\
                 5.3. Optimum Sorting / 180 \\
                 5.3 l. Minimum-Comparison Sorting / 180 \\
                 *5.3.2. Minimum-Comparison Merging / 197 \\
                 *5.3.3. Minimum-Comparison Selection / 207 \\
                 *5.3.4. Networks for Sorting / 219 \\
                 5.4. External Sorting / 248 \\
                 5.4.1. Multiway Merging and Replacement Selection / 252
                 \\
                 *5.4.2. The Polyphase Merge / 267 \\
                 *5.4.3 The Cascade Merge / 288 \\
                 *5.4.4. Reading Tape Backwards / 299 \\
                 *5.4.5. The Oscillating Sort / 311 \\
                 *5.4.6. Practical Considerations for Tape Merging / 317
                 \\
                 *5.4.7. External Radix Sorting / 343 \\
                 *5.4.8. Two-Tape Sorting / 348 \\
                 *5.4.9 Disks and Drums / 356 \\
                 5.5. Summary, History, and Bibliography / 380 \\
                 6: Searching / 392 \\
                 6.1. Sequential Searching / 396 \\
                 6.2. Searching by Comparison of Keys / 409 \\
                 6.2.1. Searching an Ordered Table / 409 \\
                 6.2.2 Binary Tree Searching / 426 \\
                 6.2.3. Balanced Trees / 458 \\
                 6.2.4. Multiway Trees / 481",
}

@Book{Knuth:1999:DT,
  author =       "Donald E. Knuth",
  title =        "Digital Typography",
  volume =       "78",
  publisher =    pub-CSLI,
  address =      pub-CSLI:adr,
  pages =        "xvi + 685",
  year =         "1999",
  ISBN =         "1-57586-010-4 (paperback), 1-57586-011-2 (hardcover)",
  ISBN-13 =      "978-1-57586-010-7 (paperback), 978-1-57586-011-4
                 (hardcover)",
  LCCN =         "Z249.3.K59 1998",
  MRclass =      "68U15",
  MRnumber =     "MR1676044 (2002k:68194)",
  bibdate =      "Mon May 10 18:01:36 1999",
  bibsource =    "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/texbook3.bib;
                 https://www.math.utah.edu/pub/tex/bib/typeset.bib;
                 MathSciNet database",
  price =        "US\$90.00 (cloth), US\$39.95 (paperback)",
  series =       "CSLI Lecture Notes",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Digital Typography / 1 \\
                 2: Mathematical Typography / 19 \\
                 3: Breaking Paragraphs Into Lines / 67 \\
                 4: Mixing Right-to-Left Texts with Left-to-Right Texts
                 / 157 \\
                 5: Recipes and Fractions / 177 \\
                 6: The \TeX{} Logo in Various Fonts / 181 \\
                 7: Printing Out Selected Pages / 183 \\
                 8: Macros for Jill / 185 \\
                 9: Problem for a Saturday Morning / 195 \\
                 10: Exercises for \TeX{}: The Program / 197 \\
                 11: Mini-Indexes for Literate Programs / 225 \\
                 12: Virtual Fonts: More Fun for Grand Wizards / 247 \\
                 13: The Letter S / 263 \\
                 14: My First Experience with Indian Scripts / 285 \\
                 15: Concept of a Meta-Font / 289 \\
                 16: Lessons Learned from METAFONT / 315 \\
                 17: AMS Euler --- A New Typeface for Mathematics / 339
                 \\
                 18: Typesetting Concrete Mathematics / 367 \\
                 19: Course on METAFONT Programming / 379 \\
                 20: Punk Meta-Font / 391 \\
                 21: Fonts for Digital Halftones / 415 \\
                 22: Digital Halftones by Dot Diffusion / 449 \\
                 23: A Note on Digital Angles / 473 \\
                 24: TEXDR.AFT / 481 \\
                 25: TEX.ONE / 505 \\
                 26: \TeX{} Incunabula / 533 \\
                 27: Icons for \TeX{} and METAFONT / 547 \\
                 28: Computers and Typesetting / 555 \\
                 29: The New Versions of \TeX{} and METAFONT / 563 \\
                 30: The Future of \TeX{} and METAFONT / 571 \\
                 31: Questions and Answers, I / 573 \\
                 32: Questions and Answers, II / 601 \\
                 33: Questions and Answers, III / 625 \\
                 34: Final Errors of \TeX{} / 655 \\
                 Index / 663",
}

@Book{Knuth:1999:MRC,
  author =       "Donald E. Knuth",
  title =        "{MMIXware}: a {RISC} computer for the third
                 millennium",
  volume =       "1750",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "viii + 550",
  year =         "1999",
  DOI =          "https://doi.org/10.1007/3-540-46611-8",
  ISBN =         "3-540-66938-8 (softcover)",
  ISBN-13 =      "978-3-540-66938-8 (softcover)",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  LCCN =         "QA76.9.A73 K62 1999",
  bibdate =      "Mon Oct 16 18:31:56 MDT 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/lncs.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       ser-LNCS,
  URL =          "http://link.springer-ny.com/link/service/series/0558/tocs/t1750.htm;
                 http://www.springerlink.com/content/978-3-540-66938-8;
                 http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=1750",
  acknowledgement = ack-nhfb,
  keywords =     "computer architecture; Reduced Instruction Set
                 Computers",
  tableofcontents = "READ ME (a preface) / v \\
                 CONTENTS / 1 \\
                 MMIX (a definition) / 2 \\
                 MMIX-ARITH (a library) / 62 \\
                 MMIX-CONFIG (a part of MMMIX) / 110 \\
                 MMIX-IO (a library) / 138 \\
                 MMIX-MEM (a triviality) / 148 \\
                 MMIX-PIPE (a part of MMMIX) / 150 \\
                 MMIX-SIM (a simulator) / 332 \\
                 MMIXAL (an assembler) / 422 \\
                 MMMIX (a meta-simulator) / 494 \\
                 MMOTYPE (a utility program) / 510 \\
                 Master Index (a table of references) / 524",
}

@Book{Knuth:2000:SPA,
  author =       "Donald E. Knuth",
  title =        "Selected Papers on Analysis of Algorithms",
  volume =       "102",
  publisher =    pub-CSLI,
  address =      pub-CSLI:adr,
  pages =        "xvi + 621",
  year =         "2000",
  ISBN =         "1-57586-212-3 (paperback), 1-57586-211-5 (hardcover)",
  ISBN-13 =      "978-1-57586-212-5 (paperback), 978-1-57586-211-8
                 (cloth)",
  LCCN =         "QA9.58 .K65 2000",
  MRclass =      "68Q25 (01A75 68W40)",
  MRnumber =     "1762319 (2001c:68066)",
  MRreviewer =   "A. D. Booth",
  bibdate =      "Fri Mar 22 18:03:29 MST 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  series =       "CSLI Lecture Notes",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Mathematical Analysis of Algorithms / 1 \\
                 2: The Dangers of Computer Science Theory / 19 \\
                 3: The Analysis of Algorithms / 27 \\
                 4: Big Omicron and Big Omega and Big Theta / 35 \\
                 5: Optimal Measurement Points for Program Frequency
                 Counts / 43 \\
                 6: Estimating the Efficiency of Backtrack Programs / 55
                 \\
                 7: Ordered Hash Tables / 77 \\
                 8: Activity in an Interleaved Memory / 101 \\
                 9: An Analysis of Alpha-Beta Pruning / 105 \\
                 10: Notes on Generalized Dedekind Sums / 149 \\
                 11: The Distribution of Continued Fraction
                 Approximations / 181 \\
                 12: Evaluation of Porter's Constant / 189 \\
                 13: The Subtractive Algorithm for Greatest Common
                 Divisors / 195 \\
                 14: Length of Strings for a Merge Sort / 205 \\
                 15: The Average Height of Planted Plane Trees / 215 \\
                 16: The Toilet Paper Problem / 225 \\
                 17: An Analysis of Optimum Caching / 235 \\
                 18: A Trivial Algorithm Whose Analysis Isn't / 257 \\
                 19: Deletions That Preserve Randomness / 283 \\
                 20: Analysis of a Simple Factorization Algorithm / 303
                 \\
                 21: The Expected Linearity of a Simple Equivalence
                 Algorithm / 341 \\
                 22: Textbook Examples of Recursion / 391 \\
                 23: An Exact Analysis of Stable Allocation / 415 \\
                 24: Stable Husbands / 429 \\
                 25 Shellsort With Three Increments / 447 \\
                 26: The Average Time for Carry Propagation / 467 \\
                 27: Linear Probing and Graphs / 473 \\
                 28: A Terminological Proposal / 485 \\
                 29: Postscript About NP-Hard Problems / 493 \\
                 30: An Experiment in Optimal Sorting / 495 \\
                 31: Duality in Addition Chains / 501 \\
                 32: Complexity Results for Bandwidth Minimization / 505
                 \\
                 33: The Problem of Compatible Representatives / 535 \\
                 34: The Complexity of Nonuniform Random Number
                 Generation / 545 \\
                 Index / 605",
}

@Book{Knuth:2003:SPC,
  author =       "Donald E. Knuth",
  title =        "Selected Papers on Computer Languages",
  volume =       "139",
  publisher =    pub-CSLI,
  address =      pub-CSLI:adr,
  pages =        "xviii + 594",
  year =         "2003",
  ISBN =         "1-57586-381-2 (hardcover), 1-57586-382-0 (paperback)",
  ISBN-13 =      "978-1-57586-381-8 (hardcover), 978-1-57586-382-5
                 (paperback)",
  LCCN =         "QA76.7 .K63 2002",
  MRclass =      "68N15 (01A75 68-03 68-06)",
  MRnumber =     "MR2019164 (2005b:68045)",
  MRreviewer =   "Julian Padget",
  bibdate =      "Thu Sep 30 07:16:32 2004",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$75.00 (hardcover), US\$35.00 (paperback)",
  series =       "CSLI Lecture Notes",
  acknowledgement = ack-nhfb,
  classmath =    "68-03 (Historical (computer science)); 00B60
                 (Collections of reprinted articles); 01A75 (Collected
                 or selected works); 68-02 (Research monographs
                 (computer science))",
  keywords =     "Algol; attribute grammars; automata; BNF; compiler;
                 Fortran; programming history; programming language;
                 semantics; syntax",
  remark =       "This book is the fifth volume of the papers written by
                 Donald E. Knuth, the pioneer of computer science. The
                 previous volumes were: 1. Literate Programming (1992);
                 2. Selected Papers on Computer Science (1996; Zbl
                 0866.68002); 3. Digital Typography (1999; Zbl
                 0927.68109); 4. Selected Papers on Analysis of
                 Algorithms (2000; Zbl 0966.68082). This fifth volume
                 contains 25 papers on programming languages, their
                 syntax, semantics and translation. The book begins with
                 a survey `The Early Development of Programming
                 Languages' originally published in 1977. It is followed
                 by the well known paper `Backus Normal Form versus
                 Backus Naur Form' (1964). Five papers are concerned
                 with Algol-60, two with SOL. The remaining papers deal
                 with the theory of programming languages, context-free
                 languages, formal semantics, attribute grammars,
                 compilers, algebraic translation, coroutine generation,
                 etc. The reader will be able to see the early history
                 and development of fundamental concepts that have now
                 become thoroughly integrated into modern software
                 systems.",
  tableofcontents = "1: The Early Development of Programming Languages
                 \\
                 2: Backus Normal Form versus Backus Naur Form \\
                 3: Teaching ALGOL 60 \\
                 4: ALGOL 60 Confidential \\
                 5: Smalgol-61 \\
                 6: Man or Boy? \\
                 7: A Proposal for Input-Output Conventions in ALGOL 60
                 \\
                 8: The Remaining Trouble Spots in ALGOL 60 \\
                 9: SOL \\
                 A Symbolic Language for Systems Simulation \\
                 10: A Formal Definition of SOL \\
                 11: The Science of Programming Languages \\
                 12: Programming Languages for Automata \\
                 13: A Characterization of Parenthesis Languages \\
                 14: Top-Down Syntax Analysis \\
                 15: On the Translation of Languages from Left to Right
                 \\
                 16: Context-Free Multilanguages \\
                 17: Semantics of Context-Free Languages \\
                 18: Examples of Formal Semantics",
  xxpages =      "xvi + 594",
}

@Book{Knuth:2003:SPD,
  author =       "Donald E. Knuth",
  title =        "Selected Papers on Discrete Mathematics",
  volume =       "106",
  publisher =    pub-CSLI,
  address =      pub-CSLI:adr,
  pages =        "xvi + 812",
  year =         "2003",
  ISBN =         "1-57586-248-4 (paperback), 1-57586-249-2 (hardcover)",
  ISBN-13 =      "978-1-57586-248-4 (paperback), 978-1-57586-249-1
                 (hardcover)",
  LCCN =         "QA39.3 .K59 2001",
  MRclass =      "01A75 (05-06 68-06)",
  MRnumber =     "MR2030307 (2005c:01030)",
  MRreviewer =   "Alexander Zvonkin",
  bibdate =      "Fri Mar 4 15:20:28 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$40.00",
  series =       "CSLI Lecture Notes",
  abstract =     "Donald Knuth's influence in computer science ranges
                 from the invention of literate programming to the
                 development of the TeX programming language. One of the
                 foremost figures in the field of mathematical sciences,
                 his papers are widely referenced and stand as
                 milestones of development over a wide range of topics.
                 This volume assembles more than three dozen of
                 Professor Knuth's pioneering contributions to discrete
                 mathematics. It includes a variety of topics in
                 combinatorial mathematics (finite geometries, graph
                 theory, enumeration, partitions, tableaux, matroids,
                 codes); discrete algebra (finite fields, groupoids,
                 closure operators, inequalities, convolutions,
                 Pfaffians); and concrete mathematics (recurrence
                 relations, special numbers and notations, identities,
                 discrete probability). Of particular interest are two
                 fundamental papers in which the evolution of random
                 graphs is studied by means of generating functions.",
  acknowledgement = ack-nhfb,
  classmath =    "01A75 (Collected or selected works); 00B60
                 (Collections of reprinted articles)",
  keywords =     "discrete mathematics; graph theory; groupoid;
                 identities; matrix theory; matroid; partitions;
                 permutations; recurrences",
  remark =       "This book is number six in a series of eight of Donald
                 E. Knuth's collected papers that Stanford's Center for
                 the Study of Language and Information plans to publish.
                 The previous already published volumes were: 1.
                 Literate Programming (1992); 2. Selected Papers on
                 Computer Science (1996; Zbl 0866.68002); 3. Digital
                 Typography (1999; Zbl 0927.68109); 4. Selected Papers
                 on Analysis of Algorithms (2000; Zbl 0966.68082). 5.
                 Selected Papers on Computer Languages (2003; Zbl
                 1046.68003). This sixth volume is devoted to
                 mathematical topics and contains 41 papers written
                 during the last four decades.\par

                 Donald E. Knuth is widely known as a pioneer of the
                 computer science and most of his papers are devoted to
                 this field. However he has solid mathematical
                 background and has published a lot of mathematical
                 papers covering the entire range of discrete
                 mathematics. Let us mention some topics exposed in this
                 collection of papers: combinatorial analysis related to
                 computers (sequences, backtrack, Latin squares,
                 projective planes), notes on mathematical notation,
                 notes on some 17th century mathematical publications,
                 doubly stochastic matrices, Pfaffians (arrays of
                 numbers), relations between matrices, graphs and trees,
                 large numbers (power series raised to the power), floor
                 function, random sequences, finite fields, central
                 groupoids, algebraic approach of Huffman's algorithm,
                 directed graphs, random matroids, permutations,
                 efficient balanced codes, various aspects of partitions
                 (enumeration, identities, etc.), recurrences (linear,
                 minimization, related to trees), cycles in an evolving
                 graph.\par

                 The collection ends with two lengthy papers: ``First
                 Cycles in an Evolving Graph'' (56 pages) (see Zbl
                 0696.05045) and ``The Birth of the Giant Component''
                 (150 pages) devoted to random graph problems (see Zbl
                 0795.05127), initiated by [{\it P. Erd{\H{o}}s} and
                 {\it A. R{\'e}nyi}, ``On random graphs I''. Publ. Math.
                 (Debrecen) 6, 290--297 (1959; Zbl 0092.15705)]. The
                 papers are self-contained so that a reader with a
                 general mathematical background would be able to
                 understand the content.\par

                 Almost every paper in this book is supplemented with an
                 addendum where the author presents short information
                 about what has happened after the paper was published:
                 further investigations and new results related to the
                 topic of the paper, comments, corrections.",
  tableofcontents = "1: Discussion of Mr. Riordan's paper `Abel
                 identities and inverse relations' \\
                 2: Duality in addition chains \\
                 3: Combinatorial analysis and computers \\
                 4: Tables of finite fields \\
                 5: Finite semifields and projective planes \\
                 6: A class of projective planes \\
                 7: Construction of a random sequence \\
                 8: Oriented subtrees of an arc digraph \\
                 9: Another enumeration of trees \\
                 10: Notes on central groupoids \\
                 11: Permutations, matrices, and generalized Young
                 tableaux \\
                 12: A note on solid partitions \\
                 13: Subspaces, subsets, and partitions \\
                 14: Enumeration of plane partitions \\
                 15: Complements and transitive closures \\
                 16: Permutations with nonnegative partial sums \\
                 17: Wheels within wheels \\
                 18: The asymptotic number of geometries \\
                 19: Random matroids \\
                 20: Identities from partition involutions \\
                 21: Huffman's algorithm via algebra \\
                 22: A permanent inequality \\
                 23: Efficient balanced codes \\
                 24: The power of a prime that divides a generalized
                 binomial coefficient \\
                 25: The first cycles in an evolving graph \\
                 26: The birth of the giant component \\
                 27: Polynomials involving the floor function \\
                 28: The sandwich theorem \\
                 29: Aztec diamonds, checkerboard graphs, and spanning
                 trees",
}

@Book{Knuth:2005:ACPa,
  author =       "Donald E. Knuth",
  title =        "The Art of Computer Programming: Volume 1, Fascicle 1.
                 {MMIX}, a {RISC} Computer for the New Millennium",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "v + 134",
  year =         "2005",
  ISBN =         "0-201-85392-2",
  ISBN-13 =      "978-0-201-85392-6",
  LCCN =         "QA76.6 .K64 2005",
  MRclass =      "68-02 (68M01 68N15)",
  MRnumber =     "MR2245382 (2007f:68004a)",
  bibdate =      "Tue Oct 11 05:24:35 MDT 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook2.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Computer programming; Computer algorithms",
  tableofcontents = "1: Basic Concepts / 1 \\
                 1.3'. MMIX / 2 \\
                 1.3.1'. Description of MMIX / 2 \\
                 1.3.2'. The MMIX Assembly Language / 28 \\
                 1.3.3'. Applications to Permutations / 51 \\
                 1.4'. Some Fundamental Programming Techniques / 52 \\
                 1.4.1' Subroutines / 52 \\
                 1.4.2' Coroutines / 66 \\
                 1.4.3'. Interpretive Routines / 73 \\
                 Answers to Exercises / 94 \\
                 Index and Glossary / 127",
}

@Book{Knuth:2005:ACPb,
  author =       "Donald E. Knuth",
  title =        "The Art of Computer Programming: Volume 4, Fascicle 3.
                 Generating All Combinations and Partitions",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "iv + 150",
  year =         "2005",
  ISBN =         "0-201-85394-9",
  ISBN-13 =      "978-0-201-85394-0",
  LCCN =         "QA76.6 .K64 2005",
  bibdate =      "Tue Oct 11 05:24:35 MDT 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/string-matching.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook2.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Computer programming; Computer algorithms",
  tableofcontents = "7: Combinatorial Searching / 0 \\
                 7.2. Generating All Possibilities / 0 \\
                 7.2.1. Generating Basic Combinatorial Patterns / 0 \\
                 7.2.1.1. Generating all n-tuples / 0 \\
                 7.2.1.2. Generating all permutations / 0 \\
                 7.2.1.3. Generating all combinations / 1 \\
                 7.2.1.4. Generating all partitions / 36 \\
                 7.2.1.5. Generating all set partitions / 61 \\
                 Answers to Exercises / 87 \\
                 Index and Glossary / 144",
}

@Book{Knuth:2008:ICA,
  author =       "Donald E. Knuth",
  title =        "The Art of Computer Programming: Volume 4, Fascicle 0.
                 Introduction to Combinatorial Algorithms and {Boolean}
                 Functions",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "ix + 216",
  year =         "2008",
  ISBN =         "0-321-53496-4",
  ISBN-13 =      "978-0-321-53496-5",
  LCCN =         "QA76.6 .K64 2005",
  bibdate =      "Fri Jun 12 07:16:46 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook2.bib",
  series =       "The art of computer programming",
  acknowledgement = ack-nhfb,
  tableofcontents = "7: Combinatorial Searching / 1 \\
                 7.1. Zeros and Ones / 47 \\
                 7.1.1. Boolean Basics / 47 \\
                 7.1.2 Boolean Evaluation / 96 \\
                 Answers to Exercises / 134 \\
                 Index and Glossary / 201",
}

@Book{Knuth:2009:ACP,
  author =       "Donald E. Knuth",
  title =        "The Art of Computer Programming: Volume 4, Fascicle 1.
                 {Bitwise} Tricks and Techniques. {Binary} Decision
                 Diagrams",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "vii + 260",
  year =         "2009",
  ISBN =         "0-321-58050-8",
  ISBN-13 =      "978-0-321-58050-4",
  LCCN =         "QA76.6 .K64 2009",
  bibdate =      "Fri Jun 12 07:20:05 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook2.bib",
  series =       "The art of computer programming",
  acknowledgement = ack-nhfb,
  tableofcontents = "7: Combinatorial Searching / 1 \\
                 7 1. Zeros And Ones / 1 \\
                 7.1.1. Boolean Basics / 1 \\
                 7.1.2. Boolean Evaluation / 1 \\
                 7.1.3. Bitwise Tricks and Techniques / 1 \\
                 7.1.4. Binary Decision Diagrams / 70 \\
                 Answers to Exercises / 149 \\
                 Index and Glossary / 244",
}

@Book{Knuth:2011:ACP,
  author =       "Donald E. Knuth",
  title =        "The Art of Computer Programming: Volume 4,
                 {Combinatorial} algorithms. {Part 1}",
  volume =       "4A",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xv + 883",
  year =         "2011",
  ISBN =         "0-201-03804-8",
  ISBN-13 =      "978-0-201-03804-0",
  LCCN =         "QA76.6 2005",
  bibdate =      "Fri Mar 4 17:53:38 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.gbv.de:20011/gvk",
  series =       "The art of computer programming",
  acknowledgement = ack-nhfb,
  remark =       "Also issued from 2005 to 2010 in four fascicles prior
                 to this complete edition.",
  tableofcontents = "7: Combinatorial Searching \\
                 7.1. Zeros and Ones \\
                 7.1.1. Boolean Baiscs \\
                 7.1.2. Boolean Evaluation \\
                 7.1.3. Bitwise Tricks and Techniques \\
                 7.1.4. Binary Decision Diagrams \\
                 7.2. Generating All Possibilities \\
                 7.2.1. Generating Basic Cambinatorial Patterns \\
                 7.2.1.1. Generating all n-Tuples \\
                 7.2.1.2. Generating all Permutations \\
                 7.2.1.3. Generating all Combinations \\
                 7.2.1.4. Generating all Partitions \\
                 7.2.1.5. Generating all Set Partitions \\
                 7.2.1.6. Generating all Trees \\
                 7.2.1.7. History and Further References \\
                 Answers to Exercises \\
                 Appendix A. Tables of Numerical Quantities \\
                 1. Fundamental Constants (decimal) \\
                 2. Fundamental Constants (hexadecimal) \\
                 3. Harmonic Numbers, Bernoulli Numbers, Fibonacci
                 Numbers \\
                 Appendix B. Index to Notations \\
                 Appendix C. Index to Algorithms and Theorems \\
                 Appendix D. Index to Combinatorial Problems \\
                 Index and Glossary",
}

@Book{Knuth:ACP68-1,
  author =       "Donald E. Knuth",
  title =        "Fundamental Algorithms",
  volume =       "1",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xxi + 634",
  year =         "{\noopsort{1968a}}1968",
  ISBN =         "0-201-03803-X",
  ISBN-13 =      "978-0-201-03803-3",
  LCCN =         "QA76.5 .K74",
  bibdate =      "Wed Jun 26 15:14:29 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$19.75",
  series =       "The Art of Computer Programming",
  acknowledgement = ack-nhfb,
}

@Book{Knuth:ACP69-2,
  author =       "Donald E. Knuth",
  title =        "Seminumerical Algorithms",
  volume =       "2",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xi + 624",
  year =         "1969",
  ISBN =         "0-201-03802-1",
  ISBN-13 =      "978-0-201-03802-6",
  LCCN =         "QA76.5 .K57",
  MRclass =      "68.00 (65.00)",
  MRnumber =     "44 \#3531",
  MRreviewer =   "M. Muller",
  bibdate =      "Wed Dec 15 15:47:38 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$19.75",
  series =       "The Art of Computer Programming",
  acknowledgement = ack-nhfb,
  remark =       "Benford's Law is discussed on pp. 219--229.",
  tableofcontents = "3: Random Numbers \\
                 3.1. Introduction / 1 \\
                 3.2. Generating Uniform Random Numbers / 9 \\
                 3.2.1. The Linear Congruential Method / 9 \\
                 3.2.1.1. Choice of modulus / 11 \\
                 3.2.1.2. Choice of multiplier / 15 \\
                 3.2.1.3. Potency / 21 \\
                 3.2.2. Other Methods / 25 \\
                 3.3. Statistical Tests / 34 \\
                 3.3.1. General Test Procedures for Studying Random Data
                 / 35 \\
                 3.3.2. Empirical Tests / 54 \\
                 *3.3.3. Theoretical Tests / 69 \\
                 3.3.4. The Spectral Test / 82 \\
                 3.4. Other Types of Random Quantities / 100 \\
                 3.4.1. Numerical Distributions / 101 \\
                 3.4.2. Random Sampling and Shuffling / 121 \\
                 *3.5. What is a Random Sequence? / 127 \\
                 3.6. Summary / 155 \\
                 4: Arithmetic \\
                 4.1. Positional Number Systems / 162 \\
                 4.2. Floating-Point Arithmetic / 180 \\
                 4.2.1. Single-Precision Calculations / 180 \\
                 4.2.2. Accuracy of Floating-Point Arithmetic / 195 \\
                 *4.2.3. Double-Precision Calculations / 210 \\
                 4.2.4. Statistical Distribution / 218 \\
                 4.3. Multiple-Precision Arithmetic / 229 \\
                 4.3.1. The Classical Algorithms / 229 \\
                 *4.3.2. Modular Arithmetic / 248 \\
                 *4.3.3. How Fast Can We Multiply? / 258 \\
                 4.4. Radix Conversion / 280 \\
                 4.5. Rational Arithmetic / 290 \\
                 4.5.1. Fractions / 290 \\
                 4.5.2. The Greatest Common Divisor / 293 \\
                 *4.5.3. Analysis of Euclid's Algorithm / 316 \\
                 4.5.4. Factoring into Primes / 339 \\
                 4.6. Polynomial Arithmetic / 360 \\
                 4.6.1. Division of Polynomials / 363 \\
                 *4.6.2. Factorization of Polynomials / 381 \\
                 4.6.3. Evaluation of Powers / 398 \\
                 4.6.4. Evaluation of Polynomials / 422 \\
                 *4.7. Manipulation of Power Series / 444 \\
                 Answers to Exercises / 452 \\
                 Appendix A: MIX / 565 \\
                 1. Description of MIX / 565 \\
                 2. The MIX Assembly Language / 584 \\
                 Appendix B: Tables of Numerical Quantities / 596 \\
                 1. Fundamental Constants (decimal) / 596 \\
                 2. Fundamental Constants (octal) / 597 \\
                 3. Harmonic Numbers, Bernoulli Numbers, Fibonacci
                 Numbers / 598 \\
                 Appendix C: Index to Notations / 600 \\
                 Index and Glossary / 605",
  xxyear =       "{\noopsort{1968c}}1969",
}

@Book{Knuth:ACP73-1,
  author =       "Donald E. Knuth",
  title =        "Fundamental Algorithms",
  volume =       "1",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Second",
  pages =        "xxi + 634",
  year =         "{\noopsort{1968b}}1973",
  ISBN =         "0-201-03809-9",
  ISBN-13 =      "978-0-201-03809-5",
  LCCN =         "QA76.6 .K641 1973",
  bibdate =      "Wed Dec 15 10:36:21 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "The Art of Computer Programming",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Basic Concepts / 1 \\
                 1.1. Algorithms / 1 \\
                 1.2. Mathematical Preliminaries / 10 \\
                 1.2.1. Mathematical Induction / 11 \\
                 1.2.2. Numbers, Powers, and Logarithms / 21 \\
                 1.2.3. Sums and Products / 26 \\
                 1.2.4. Integer Functions and Elementary Number Theory /
                 37 \\
                 1.2.5. Permutations and Factorials / 44 \\
                 1.2.6. Binomial Coefficients / 51 \\
                 1.2.7. Harmonic Numbers / 73 \\
                 1.2.8. Fibonacci Numbers / 78 \\
                 1.2.9. Generating Functions / 86 \\
                 1.2.10. Analysis of an Algorithm / 94 \\
                 *1.2.11. Asymptotic Representations / 104 \\
                 *1.2.11.1. The O-notation / 104 \\
                 *1.2.11.2. Euler's summation formula / 108 \\
                 *1.2.11.3. Some asymptotic calculations / 112 \\
                 1.3. MIX / 120 \\
                 1.3.1. Description of MIX / 120 \\
                 1.3.2. The MIX Assembly Language / 141 \\
                 1.3.3. Applications to Permutations / 160 \\
                 1.4. Some Fundamental Programming Techniques / 182 \\
                 1.4.1. Subroutines / 182 \\
                 1.4.2. Coroutines / 190 \\
                 1.4.3. Interpretive Routines / 197 \\
                 1.4.3.1. A MIX simulator / 198 \\
                 1.4.3.2. Trace routines / 208 \\
                 1.4.4. Input and Output / 211 \\
                 1.4.5. History and Bibliography / 225 \\
                 2: Information Structures / 228 \\
                 2.1. Introduction / 228 \\
                 2.2 Linear Lists / 234 \\
                 2.2.1. Stacks, Queues, and Deques / 234 \\
                 2.2.2. Sequential Allocation / 240 \\
                 2.2.3. Linked Allocation / 251 \\
                 2.2.4. Circular Lists / 270 \\
                 2.2.5. Doubly Linked Lists / 278 \\
                 2.2.6. Arrays and Orthogonal Lists / 295 \\
                 2.3. Trees / 305 \\
                 2.3.1. Traversing Binary Trees / 315 \\
                 2.3.2. Binary Tree Representation of Trees / 332 \\
                 2.3.3. Other Representations of Trees / 347 \\
                 2.3.4. Basic Mathematical Properties of Trees / 362 \\
                 2.3.4.1. Free trees / 362 \\
                 *2.3.4.2. Oriented trees / 371 \\
                 *2.3.4.3. The ``infinity lemma'' / 381 \\
                 *2.3.4.4. Enumeration of trees / 385 \\
                 2.3.4.5. Path length / 399 \\
                 *2.3.4.6. History and bibliography / 405 \\
                 2.3.5. Lists and Garbage Collection / 406 \\
                 2.4. Multilinked Structures / 423 \\
                 2.5. Dynamic Storage Allocation / 435 \\
                 2.6. History and Bibliography / 456 \\
                 Answers to Exercises / 465 \\
                 Appendix A: Index to Notations / 607 \\
                 Appendix B: Tables of Numerical Quantities \\
                 1. Fundamental Constants (decimal) / 613 \\
                 2. Fundamental Constants (octal) / 614 \\
                 3. Harmonic Numbers, Bernoulli Numbers, Fibonacci
                 Numbers / 615 \\
                 Index and Glossary / 617",
}

@Book{Knuth:ACP73-3,
  author =       "Donald E. Knuth",
  title =        "Sorting and Searching",
  volume =       "3",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xi + 723",
  year =         "1973",
  ISBN =         "0-201-03803-X",
  ISBN-13 =      "978-0-201-03803-3",
  LCCN =         "QA76.5 .K74",
  bibdate =      "Wed Dec 15 15:47:47 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/hash.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "The Art of Computer Programming",
  acknowledgement = ack-nhfb,
  tableofcontents = "5: Sorting / 1 \\
                 *5.1. Combinatorial Properties of Permutations / 11 \\
                 *5.1.1. Inversions / 11 \\
                 *5.1.2. Permutations of a Multiset / 22 \\
                 *5.1.3. Runs / 34 \\
                 *5.1.4. Tableaux and Involutions / 48 \\
                 5.2. Internal Sorting / 73 \\
                 5.2.1. Sorting by Insertion / 80 \\
                 5.2.2. Sorting by Exchanging / 105 \\
                 5.2.3. Sorting by Selection / 139 \\
                 5.2.4. Sorting by Merging / 159 \\
                 5.2.5. Sorting by Distribution / 170 \\
                 5.3. Optimum Sorting / 181 \\
                 5.3.1. Minimum-Comparison Sorting / 181 \\
                 *5.3.2. Minimum-Comparison Merging / 198 \\
                 *5.3.3. Minimum-Comparison Selection / 209 \\
                 *5.3.4. Networks for Sorting / 220 \\
                 5.4. External Sorting / 247 \\
                 5.4.1. Multiway Merging and Replacement Selection / 251
                 \\
                 5.4.2. The Polyphase Merge / 266 \\
                 5.4.3. The Cascade Merge / 289 \\
                 5.4.4. Reading Tape Backwards / 301 \\
                 5.4.5. The Oscillating Sort / 314 \\
                 5.4.6. Practical Considerations for Tape Merging / 320
                 \\
                 *5.4.7. External Radix Sorting / 347 \\
                 *5.4.8. Two-Tape Sorting / 352 \\
                 5.4.9. Disks and Drums / 361 \\
                 5.5. Summary, History, and Bibliography / 379 \\
                 6: Searching / 389 \\
                 6.1. Sequential Searching / 393 \\
                 6.2. Searching by Comparison of Keys / 406 \\
                 6.2.1. Searching an Ordered Table / 406 \\
                 6.2.2. Binary Tree Searching / 422 \\
                 6.2.3. Balanced Trees / 451 \\
                 6.2.4. Multiway Trees / 471 \\
                 6.3. Digital Searching / 481 \\
                 6.4. Hashing / 506 \\
                 6.5. Retrieval on Secondary Keys / 550 \\
                 Answers to Exercises / 571 \\
                 Appendix A --- Tables of Numerical Quantities / 701 \\
                 1. Fundamental Constants (decimal) / 701 \\
                 2. Fundamental Constants (octal) / 702 \\
                 3. Harmonic Numbers, Bernoulli Numbers, Fibonacci
                 Numbers / 703 \\
                 Appendix B --- Index to Notations / 705 \\
                 Index and Glossary / 710",
}

@Book{Knuth:ct-b,
  author =       "Donald E. Knuth",
  title =        "{\TeX}: The Program",
  volume =       "B",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xv + 594",
  year =         "{\noopsort{1986b}}1986",
  ISBN =         "0-201-13437-3",
  ISBN-13 =      "978-0-201-13437-7",
  LCCN =         "Z253.4.T47 K578 1986",
  bibdate =      "Wed Dec 15 10:36:54 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
                 https://www.math.utah.edu/pub/tex/bib/datacompression.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/texbook3.bib;
                 https://www.math.utah.edu/pub/tex/bib/texgraph.bib;
                 https://www.math.utah.edu/pub/tex/bib/typeset.bib",
  series =       "Computers and Typesetting",
  acknowledgement = ack-nhfb,
  tableofcontents = "1 Introduction / \S 1 \\
                 2 The character set / \S 17 \\
                 3 Input and output / \S 25 \\
                 4 String handling / \S 38 \\
                 5 On-line and off-line printing / \S 54 \\
                 6 Reporting errors / \S 72 \\
                 7 Arithmetic with scaled dimensions / \S 99 \\
                 8 Packed data / \S 110 \\
                 9 Dynamic memory allocation / \S 115 \\
                 10 Data structures for boxes and their friends / \S 133
                 \\
                 11 Memory layout / \S 162 \\
                 12 Displaying boxes / \S 173 \\
                 13 Destroying boxes / \S 199 \\
                 14 Copying boxes / \S 203 \\
                 15 The command codes / \S 207 \\
                 16 The semantic nest / \S 211 \\
                 17 The table of equivalents / \S 220 \\
                 18 The hash table / \S 256 \\
                 19 Saving and restoring equivalents / \S 268 \\
                 20 Token lists / \S 289 \\
                 21 Introduction to the syntactic routines / \S 297 \\
                 22 Input stacks and states / \S 300 \\
                 23 Maintaining the input stacks / \S 321 \\
                 24 Getting the next token / \S 332 \\
                 25 Expanding the next token / \S 366 \\
                 26 Basic scanning subroutines / \S 402 \\
                 27 Building token lists / \S 464 \\
                 28 Conditional processing / \S 487 \\
                 29 File names / \S 511 \\
                 30 Font metric data / \S 539 \\
                 31 Device-independent file format / \S 583 \\
                 32 Shipping pages out / \S 592 \\
                 33 Packaging / \S 644 \\
                 34 Data structures for math mode / \S 680 \\
                 35 Subroutines for math mode / \S 699 \\
                 36 Typesetting math formulas / \S 719 \\
                 37 Alignment / \S 768 \\
                 38 Breaking paragraphs into lines / \S 813 \\
                 39 Breaking paragraphs into lines, continued / \S 862
                 \\
                 40 Pre-hyphenation / \S 891 \\
                 41 Post-hyphenation / \S 900 \\
                 42 Hyphenation / \S 919 \\
                 43 Initializing the hyphenation tables / \S 942 \\
                 44 Breaking vertical lists into pages / \S 967 \\
                 45 The page builder / \S 980 \\
                 46 The chief executive / \S 1029 \\
                 47 Building boxes and lists / \S 1055 \\
                 48 Building math lists / \S 1136 \\
                 49 Mode-independent processing / \S 1208 \\
                 50 Dumping and undumping the tables / \S 1299 \\
                 51 The main program / \S 1330 \\
                 52 Debugging / \S 1338 \\
                 53 Extensions / \S 1340 \\
                 54 System-dependent changes / \S 1376 \\
                 55 Index / \S 1377",
}

@Book{Knuth:ct-c,
  author =       "Donald E. Knuth",
  title =        "The {\METAFONT}book",
  volume =       "C",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xi + 361",
  year =         "{\noopsort{1986c}}1986",
  ISBN =         "0-201-13445-4 (hardcover), 0-201-13444-6 (paperback)",
  ISBN-13 =      "978-0-201-13445-2 (hardcover), 978-0-201-13444-5
                 (paperback)",
  LCCN =         "Z250.8.M46 K58 1986",
  bibdate =      "Wed Dec 15 10:37:29 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 https://www.math.utah.edu/pub/tex/bib/font.bib;
                 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/texgraph.bib;
                 https://www.math.utah.edu/pub/tex/bib/typeset.bib",
  series =       "Computers and Typesetting",
  acknowledgement = ack-nhfb,
  tableofcontents = "1 The Name of the Game / 1 \\
                 2 Coordinates / 5 \\
                 3 Curves / 13 \\
                 4 Pens / 21 \\
                 5 Running \METAFONT{} / 31 \\
                 6 How \METAFONT{} Reads What You Type / 49 \\
                 7 Variables / 53 \\
                 8 Algebraic Expressions / 59 \\
                 9 Equations / 75 \\
                 10 Assignments / 87 \\
                 11 Magnification and Resolution / 91 \\
                 12 Boxes / 101 \\
                 13 Drawing, Filling, and Erasing / 109 \\
                 14 Paths / 123 \\
                 15 Transformations / 141 \\
                 16 Calligraphic Effects / 147 \\
                 17 Grouping / 155 \\
                 18 Definitions ( also called Macros) / 159 \\
                 19 Conditions and Loops / 169 \\
                 20 More about Macros / 175 \\
                 21 Random Numbers / 183 \\
                 22 Strings / 187 \\
                 23 Online Displays / 191 \\
                 24 Discreteness and Discretion / 195 \\
                 25 Summary of Expressions / 209 \\
                 26 Summary of the Language / 217 \\
                 27 Recovering from Errors / 223 \\
                 Appendices \\
                 A Answers to All the Exercises / 233 \\
                 B Basic Operations / 257 \\
                 C Character Codes / 281 \\
                 D Dirty Tricks / 285 \\
                 E Examples / 301 \\
                 F Font Metric Information / 315 \\
                 G Generic Font Files / 323 \\
                 H Hardcopy Proofs / 327 \\
                 I Index / 345 \\
                 J Joining the \TeX{} Community / 361",
}

@Book{Knuth:ct-d,
  author =       "Donald E. Knuth",
  title =        "{\METAFONT}: The Program",
  volume =       "D",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xv + 560",
  year =         "{\noopsort{1986d}}1986",
  ISBN =         "0-201-13438-1",
  ISBN-13 =      "978-0-201-13438-4",
  LCCN =         "Z250.8.M46 K578 1986",
  bibdate =      "Wed Dec 15 10:37:32 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
                 https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 https://www.math.utah.edu/pub/tex/bib/font.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/texbook3.bib;
                 https://www.math.utah.edu/pub/tex/bib/texgraph.bib;
                 https://www.math.utah.edu/pub/tex/bib/typeset.bib",
  series =       "Computers and Typesetting",
  acknowledgement = ack-nhfb,
  tableofcontents = "1 Introduction / \S 1 \\
                 2 The character set / \S 17 \\
                 3 Input and output / \S 24 \\
                 4 String handling / \S 37 \\
                 5 On-line and off-line printing / \S 54 \\
                 6 Reporting errors / \S 67 \\
                 7 Arithmetic with scaled numbers / \S 95 \\
                 8 Algebraic and transcendental functions / \S 120 \\
                 9 Packed data / \S 153 \\
                 10 Dynamic memory allocation / \S 158 \\
                 11 Memory layout / \S 175 \\
                 12 The command codes / \S 186 \\
                 13 The hash table / \S 200 \\
                 14 Token lists / \S 214 \\
                 15 Data structures for variables / \S 228 \\
                 16 Saving and restoring equivalents / \S 250 \\
                 17 Data structures for paths / \S 255 \\
                 18 Choosing control points / \S 269 \\
                 19 Generating discrete moves / \S 303 \\
                 20 Edge structures / \S 323 \\
                 21 Subdivision into octants / \S 386 \\
                 22 Filling a contour / \S 460 \\
                 23 Polygonal pens / \S 469 \\
                 24 Filling an envelope / \S 490 \\
                 25 Elliptical pens / \S 524 \\
                 26 Direction and intersection times / \S 538 \\
                 27 Online graphic output / \S 564 \\
                 28 Dynamic linear equations / \S 585 \\
                 29 Dynamic nonlinear equations / \S 618 \\
                 30 Introduction to the syntactic routines / \S 624 \\
                 31 Input stacks and states / \S 627 \\
                 32 Maintaining the input stacks / \S 647 \\
                 33 Getting the next token / \S 658 \\
                 34 Scanning macro definitions / \S 683 \\
                 35 Expanding the next token / \S 706 \\
                 36 Conditional processing / \S 738 \\
                 37 Iterations / \S 752 \\
                 38 File names / \S 766 \\
                 39 Introduction to the parsing routines / \S 796 \\
                 40 Parsing primary expressions / \S 823 \\
                 41 Parsing secondary and higher expressions / \S 862
                 \\
                 42 Doing the operations / \S 893 \\
                 43 Statements and commands / \S 989 \\
                 44 Commands / \S 1020 \\
                 45 Font metric data / \S 1087 \\
                 46 Generic font file format / \S 1142 \\
                 47 Shipping characters out / \S 1149 \\
                 48 Dumping and undumping the tables / \S 1183 \\
                 49 The main program / \S 1202 \\
                 50 Debugging / \S 1212 \\
                 51 System-dependent changes / \S 1214 \\
                 52 Index / \S 1215",
}

@Book{Knuth:ct-e,
  author =       "Donald E. Knuth",
  title =        "{Computer Modern} Typefaces",
  volume =       "E",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xv + 588",
  year =         "{\noopsort{1986e}}1986",
  ISBN =         "0-201-13446-2",
  ISBN-13 =      "978-0-201-13446-9",
  LCCN =         "Z250.8.M46 K574 1986",
  bibdate =      "Wed Dec 15 10:37:33 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
                 https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 https://www.math.utah.edu/pub/tex/bib/font.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/texbook3.bib;
                 https://www.math.utah.edu/pub/tex/bib/texgraph.bib;
                 https://www.math.utah.edu/pub/tex/bib/typeset.bib",
  series =       "Computers and Typesetting",
  acknowledgement = ack-nhfb,
  remark =       "Reprinted with corrections July, 1987.",
  tableofcontents = "Introduction to the Parameters / 1 \\
                 Organization of the Files / 8 \\
                 Parameter Files / 10 \\
                 Driver Files / 36 \\
                 {\tt roman}: Roman text and typewriter text / 36 \\
                 {\tt title}: Caps and digits only / 38 \\
                 {\tt texset}: Extended ASCII character set / 38 \\
                 {\tt csc}: Caps and small caps / 40 \\
                 {\tt textit}: Italic text and typewriter text / 41 \\
                 {\tt mathit}: Math italic / 42 \\
                 {\tt mathsy}: Math symbols / 44 \\
                 {\tt mathex}: Math extension characters / 44 \\
                 Program Files / 46 \\
                 {\tt accent}: Accents common to roman and italic / 49
                 \\
                 {\tt bigacc}: Wide accents for math extension font / 63
                 \\
                 {\tt bigdel}: Delimiters for math extension font / 66
                 \\
                 {\tt bigop}: Operators for math extension font / 103
                 \\
                 {\tt calu}: Calligraphic capitals / 123 \\
                 {\tt comlig}: Ligatures common to roman and italic /
                 141 \\
                 {\tt cscspu}: Special uppercase for caps and small caps
                 / 145 \\
                 {\tt greekl}: Lowercase Greek / 147 \\
                 {\tt greeku}: Upper case Greek / 171 \\
                 {\tt itald}: Italic digits / 193 \\
                 {\tt italig}: Italic f-ligatures / 199 \\
                 {\tt itall}: Italic lowercase / 209 \\
                 {\tt italms}: Italic math specials / 233 \\
                 {\tt italp}: Italic punctuation / 239 \\
                 {\tt italsp}: Special lowercase for italic / 245 \\
                 {\tt olddig}: Oldstyle digits / 251 \\
                 {\tt punct}: Punctuation common to roman and italic /
                 265 \\
                 {\tt romand}: Roman digits / 285 \\
                 {\tt romanl}: Roman lowercase / 305 \\
                 {\tt romanp}: Roman punctuation / 361 \\
                 {\tt romanu}: Roman uppercase / 369 \\
                 {\tt romlig}: Roman f-ligatures / 421 \\
                 {\tt romms}: Roman math specials / 431 \\
                 {\tt romspl}: Special lowercase for roman / 443 \\
                 {\tt romspu}: Special uppercase for roman / 451 \\
                 {\tt romsub}: Substitutes for ligatures / 457 \\
                 {\tt sym}: Math symbols common to several fonts / 459
                 \\
                 {\tt symbol}: Math symbols in symbol font only / 483
                 \\
                 {\tt tset}: Extended ASCII symbols / 542 \\
                 {\tt tsetsl}: Extended ASCII symbols to be slanted /
                 543 \\
                 The Base File / 545 \\
                 Font Specimens / 554 \\
                 General Index / 571 Index to Character Programs / 581",
}

@Article{Knuth:goto,
  author =       "D. E. Knuth",
  title =        "Structured Programming with Go To Statements",
  journal =      j-CS,
  volume =       "6",
  pages =        "261--301",
  year =         "1974",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "This paper is a response to
                 \cite{Dijkstra:goto-harmful}.",
  acknowledgement = ack-nhfb,
}

@Article{Knuth:halftone,
  author =       "Donald E. Knuth",
  title =        "Digital Halftones by Dot Diffusion",
  journal =      j-TOG,
  volume =       "6",
  number =       "4",
  pages =        "245--273",
  month =        oct,
  year =         "1987",
  bibdate =      "Fri Aug 26 08:55:16 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Manual{Knuth:math-writing,
  author =       "Donald E. Knuth and Tracy Larrabee and Paul M.
                 Roberts",
  title =        "Mathematical Writing",
  organization = "Mathematical Association of America Notes Number 14",
  year =         "1989",
  ISBN =         "0-88385-063-X",
  ISBN-13 =      "978-0-88385-063-3",
  LCCN =         "QA42 .K58 1989",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Article{Knuth:new-tex-mf,
  author =       "Donald E. Knuth and Joe Weening",
  title =        "New {{\TeX\slash \METAFONT}} sources available on
                 {Stanford's} master archive",
  journal =      j-TEXHAX,
  volume =       "90",
  number =       "13",
  month =        jan,
  year =         "1990",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Article{Knuth:string-search,
  author =       "Donald E. Knuth and J. H. Morris and V. R. Pratt",
  title =        "Fast pattern matching in strings",
  journal =      j-SIAM-J-COMPUT,
  volume =       "6",
  number =       "2",
  pages =        "323--350",
  month =        jun,
  year =         "1977",
  bibdate =      "Sun May 2 07:50:30 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See also
                 \cite{Boyer:string-search,Sunday:string-search,Baeza-Yates:j-CACM-35-10-74}.",
  acknowledgement = ack-nhfb,
}

@Article{Knuth:tex-3.0,
  author =       "Donald E. Knuth",
  title =        "Calling all Grand Wizards",
  journal =      j-TEXHAX,
  volume =       "89",
  number =       "98",
  month =        nov,
  year =         "1989",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@TechReport{Knuth:tex-errors,
  author =       "Donald E. Knuth",
  title =        "The Errors of {\TeX}",
  number =       "{STAN-CS-88-1223}",
  institution =  pub-STAN-CS,
  address =      pub-STAN-CS:adr,
  month =        sep,
  year =         "1988",
  bibdate =      "Sun May 2 07:50:41 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See \cite{Knuth:tex-errors-2}.",
  acknowledgement = ack-nhfb,
}

@Article{Knuth:tex-errors-2,
  author =       "Donald E. Knuth",
  title =        "The Errors of {\TeX}",
  journal =      j-SPE,
  volume =       "19",
  number =       "7",
  pages =        "607--681",
  month =        jul,
  year =         "1989",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "This is an updated version of
                 \cite{Knuth:tex-errors}.",
  acknowledgement = ack-nhfb,
}

@Article{Knuth:virtual-fonts,
  author =       "Donald E. Knuth",
  title =        "Virtual fonts: More fun for Grand Wizards",
  journal =      j-TEXHAX,
  volume =       "90",
  number =       "11 and 12",
  month =        jan,
  year =         "1990",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Kogge:1981:APC,
  author =       "Peter M. Kogge",
  title =        "The Architecture of Pipelined Computers",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "xii + 334",
  year =         "1981",
  ISBN =         "0-07-035237-2",
  ISBN-13 =      "978-0-07-035237-7",
  LCCN =         "QA76.5 .K587",
  bibdate =      "Wed Dec 15 10:37:46 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Kohnfelder:2021:DSS,
  author =       "Loren Kohnfelder",
  title =        "Designing Secure Software",
  publisher =    pub-NO-STARCH,
  address =      pub-NO-STARCH:adr,
  pages =        "xxxi + 291",
  year =         "2021",
  ISBN =         "1-0981-2980-6, 1-71850-192-7 (paperback),
                 1-71850-193-5 (e-book)",
  ISBN-13 =      "978-1-0981-2980-4, 978-1-71850-192-8 (paperback),
                 978-1-71850-193-5 (e-book)",
  LCCN =         "QA76.758 .K675 2022",
  bibdate =      "Tue May 6 09:30:32 MDT 2025",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Designing Secure Software consolidates Loren
                 Kohnfelder's more than twenty years of experience into
                 a concise, elegant guide to improving the security of
                 technology products. Written for a wide range of
                 software professionals, it emphasizes building security
                 into software design early and involving the entire
                 team in the process. The book begins with a discussion
                 of core concepts like trust, threats, mitigation,
                 secure design patterns, and cryptography. The second
                 part, perhaps this book's most unique and important
                 contribution to the field, covers the process of
                 designing and reviewing a software design with security
                 considerations in mind. The final section details the
                 most common coding flaws that create vulnerabilities,
                 making copious use of code snippets written in C and
                 Python to illustrate implementation vulnerabilities.
                 You'll learn how to: Identify important assets, the
                 attack surface, and the trust boundaries in a system
                 Evaluate the effectiveness of various threat mitigation
                 candidates Work with well-known secure coding patterns
                 and libraries Understand and prevent vulnerabilities
                 like XSS and CSRF, memory flaws, and more Use security
                 testing to proactively identify vulnerabilities
                 introduced into code Review a software design for
                 security flaws effectively and without judgment.",
  libnote =      "Not in my library.",
}

@Book{Kolbert:2014:SEU,
  author =       "Elizabeth Kolbert",
  title =        "The sixth extinction: an unnatural history",
  publisher =    pub-HENRY-HOLT,
  address =      pub-HENRY-HOLT:adr,
  pages =        "319",
  year =         "2014",
  ISBN =         "0-8050-9299-4 (hardcover), 0-8050-9979-4 (e-book),
                 1-4088-5123-7 (e-book), 1-4088-5122-9 (paperback),
                 1-4088-5121-0 (hardcover), 1-4088-5711-1 (paperback)",
  ISBN-13 =      "978-0-8050-9299-8 (hardcover), 978-0-8050-9979-9
                 (e-book), 978-1-4088-5123-4 (e-book), 978-1-4088-5122-7
                 (paperback), 978-1-4088-5121-0 (hardcover),
                 978-1-4088-5711-3 (paperback)",
  LCCN =         "QE721.2.E97",
  bibdate =      "Tue Jun 3 10:54:11 MDT 2014",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Over the last half billion years, there have been five
                 major mass extinctions, when the diversity of life on
                 Earth suddenly and dramatically contracted. Scientists
                 are currently monitoring the sixth extinction,
                 predicted to be the most devastating since the asteroid
                 impact that wiped out the dinosaurs. This time around
                 the cataclysm is us. In this book the author tells us
                 why and how human beings have altered life on the
                 planet in a way no species has before. She provides a
                 moving account of the disappearances of various species
                 occurring all around us and traces the evolution of
                 extinction as concept, from its first articulation by
                 Georges Cuvier in revolutionary Paris up to Lyell and
                 Darwin, and through the present day. The sixth
                 extinction is likely to be mankind's most lasting
                 legacy, compelling us to rethink the fundamental
                 question of what it means to be human.",
  acknowledgement = ack-nhfb,
  subject =      "Mass extinctions; Extinction (Biology); Environmental
                 disasters",
  tableofcontents = "The sixth extinction \\
                 The mastodon's molars \\
                 The original penguin \\
                 The luck of the ammonites \\
                 Welcome to the Anthropocene \\
                 The sea around us \\
                 Dropping acid \\
                 The forest and the trees \\
                 Islands on dry land \\
                 The new Pangaea \\
                 The rhino gets an ultrasound \\
                 The madness gene \\
                 The thing with feathers",
}

@Book{Kolodin:2019:HMR,
  author =       "Denis Kolodin",
  title =        "Hands-on Microservices with {Rust}: Build, Test, and
                 Deploy Scalable and Reactive Microservices with {Rust
                 2018}",
  publisher =    pub-PACKT,
  address =      pub-PACKT:adr,
  pages =        "511 (est.)",
  year =         "2019",
  ISBN =         "1-78934-198-1, 1-78934-275-9",
  ISBN-13 =      "978-1-78934-198-0, 978-1-78934-275-8",
  LCCN =         "QA76.73.R87",
  bibdate =      "Tue Dec 10 06:02:23 MST 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://proquest.safaribooksonline.com/?fpi=9781789342758",
  abstract =     "A comprehensive guide in developing and deploying high
                 performance microservices with Rust Key Features Start
                 your microservices journey and get a broader
                 perspective on microservices development using RUST
                 2018, Build, deploy, and test microservices using AWS
                 Explore advanced techniques for developing
                 microservices such as actor model, Requests Routing,
                 and threads Book Description Microservice architecture
                 is sweeping the world as the de facto pattern for
                 building web-based applications. Rust is a language
                 particularly well-suited for building microservices. It
                 is a new system programming language that offers a
                 practical and safe alternative to C. This book
                 describes web development using the Rust programming
                 language and will get you up and running with modern
                 web frameworks and crates with examples of RESTful
                 microservices creation. You will deep dive into
                 Reactive programming, and asynchronous programming, and
                 split your web application into a set of concurrent
                 actors. The book provides several HTTP-handling
                 examples with manageable memory allocations. You will
                 walk through stateless high-performance microservices,
                 which are ideally suitable for computation or caching
                 tasks, and look at stateful microservices, which are
                 filled with persistent data and database interactions.
                 As we move along, you will learn how to use Rust macros
                 to describe business or protocol entities of our
                 application and compile them into native structs, which
                 will be performed at full speed with the help of the
                 server's CPU. Finally, you will be taken through
                 examples of how to test and debug microservices and
                 pack them into a tiny monolithic binary or put them
                 into a container and deploy them to modern cloud
                 platforms such as AWS. What you will learn Get
                 acquainted with leveraging Rust web programming Get to
                 grips with various Rust crates, such as hyper, Tokio,
                 and Actix Explore RESTful microservices with Rust
                 Understand how to pack Rust code to a container using
                 Docker Familiarize yourself with Reactive microservices
                 Deploy your microservices to modern cloud platforms
                 such as AWS Who this book is for This book is for
                 developers who have basic knowledge of RUST, and want
                 to learn how to build, test, scale, and manage RUST
                 microservices. No prior experience of writing
                 microservices in RUST is assumed. Downloading the
                 example code for this book You can download the example
                 code files for all Packt books you have purchased from
                 your account at http://www.PacktPub.com.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Rust (Computer program language); Application
                 software; Development; Web applications; Development.;
                 Rust (Computer program language); Web applications.",
}

@Book{Kolthoff:1952:TQI,
  author =       "I. M. Kolthoff and E. B. Sandell",
  title =        "Textbook of Quantitative Inorganic Analysis",
  publisher =    pub-MACMILLAN,
  address =      pub-MACMILLAN:adr,
  edition =      "Third",
  pages =        "xv + 759",
  year =         "1952",
  LCCN =         "QD101 .K6 1952",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Kopka:1988:LE,
  author =       "Helmut Kopka",
  title =        "{{\LaTeX}: Eine Einf{\"u}hrung}",
  publisher =    pub-AWV,
  address =      pub-AWV:adr,
  edition =      "Second",
  pages =        "xvi + 340",
  year =         "1988",
  ISBN =         "3-89319-136-4, 3-89319-199-2",
  ISBN-13 =      "978-3-89319-136-9, 978-3-89319-199-4",
  bibdate =      "Wed Jul 6 15:09:48 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "1 Grundlagen / 1 \\
                 1.1 TeX und LaTeX / 2 \\
                 1.2 Text und Befehle / 3 \\
                 1.3 Grundstruktur eines LaTeX-Files / 3 \\
                 1.4 LaTeX-Bearbeitungsnioden / 5 \\
                 1.5 Erl{\"a}uterungen zum vorliegenden Text / 5 \\
                 1.6 Die Erzeugung eines LaTeX-Dokuments / 6 \\
                 1.7 Hinweise f{\"u}r Autoren / 7 \\
                 2 Befehle und Umgebungen / 9 \\
                 2.1 Befehlsnamen und Befehlsargumente / 9 \\
                 2.2 Umgebungen (environment) / 10 \\
                 2.3 Erkl{\"a}rungen (declaration) / 11 \\
                 2.4 Ma{\ss}angaben / 12 \\
                 2.4.1 Feste Ma{\ss}e / 12 \\
                 2.4.2 Elastische Ma{\ss}e / 12 \\
                 2.5 Sonderzeichen / 13 \\
                 2.5.1 Eingabe der Umlaute und des {\ss} / 13 \\
                 2.5.2 Anf{\"u}hrungsstriche / 13 \\
                 2.5.3 Trenn-, Binde- und Gedankenstriche / 14 \\
                 2.5.4 Der Druck von Befehlszeichen / 14 \\
                 2.5.5 Die Sonderzeichen \S, $\dagger$, $\ddagger$,
                 $\P$, $\copyright$ und $\pounds$ / 14 \\
                 2.5.6 Sonderbuchstaben in Fremdsprachen / 14 \\
                 2.5.7 Akzente / 14 \\
                 2.5.8 Ligaturen / 15 \\
                 2.5.9 Das Datum / 15 \\
                 2.6 Zerbrechliche Befehle / 15 \\
                 2.7 {\"U}bungen / 16 \\
                 3 Dokument- und Seitenstil / 19 \\
                 3.1 Der Dokumentstil / 19 \\
                 3.2 Der Seitenstil / 21 \\
                 3.2.1 Kopfdeklarationen / 21 \\
                 3.2.2 Seitennumerierung / 22 \\
                 3.2.3 Zeilen- und Absatzabst{\"a}nde / 23 \\
                 3.2.4 Seitendeklarationen / 23 \\
                 3.2.5 Ein- und zweispaltige Seiten / 25 \\
                 3.3 Dokumentuntergliederung / 25 \\
                 3.3.1 Die Titelseite / 26 \\
                 3.3.2 Der Abstrakt / 28 \\
                 3.3.3 Die fortlaufende Untergliederung / 28 \\
                 3.3.4 Der Anhang / 30 \\
                 3.4 Das Inhaltsverzeichnis / 31 \\
                 3.4.1 Automatische Eintragungen / 31 \\
                 3.4.2 Der Ausdruck des Inhaltsverzeichnisses / 31 \\
                 3.4.3 Zus{\"a}tzliche Eintragungen / 31 \\
                 3.4.4 Weitere Verzeichnisse / 32 \\
                 3.5 Formatierungshilfen / 33 \\
                 3.5.1 Zeichen- und Wortabst{\"a}nde / 33 \\
                 3.5.1.1 Der und das Satzende / 33 \\
                 3.5.1.2 Frenchspacing / 33 \\
                 3.5.1.3 Die Zeichenkombination `` und '' / 34 \\
                 3.5.1.4 Italic-Korrektur / 34 \\
                 3.5.1.5 Die Ausschaltung von Ligaturen / 34 \\
                 3.5.1.6 Einf{\"u}gung beliebiger Zwischenr{\"a}ume / 34
                 \\
                 3.5.1.7 Einf{\"u}gung von \ldots{} und \_\_\_ Sequenzen
                 / 35 \\
                 3.5.2 Zeilenumbruch / 36 \\
                 3.5.2.1 Der Befehl \\ / 36 \\
                 3.5.2.2 Weitere Zeilenumbruchbefehle / 36 \\
                 3.5.3 Absatzabstand / 37 \\
                 3.5.4 Absatzeinr{\"u}ckungen / 37 \\
                 3.5.5 Seitenumbruch / 38 \\
                 3.5.5.1 Normale Textseiten / 38 \\
                 3.5.5.2 Seiten mit Bildern und Tabellen / 38 \\
                 3.5.5.3 Zweispaltige Seiten / 39 \\
                 3.5.5.4 Doppelseitiger Druck / 39 \\
                 3.5.5.5 Eingeschr{\"a}nkter Umbruch / 39 \\
                 3.5.5.6 Weitere Hilfen zum Seitenumbruch / 40 \\
                 3.6 Trennhilfen / 41 \\
                 3.6.1 Direkte Trennhilfen / 41 \\
                 3.6.2 Erzeugung einer Trennliste / 42 \\
                 3.6.3 Vermeidung von Trennungen / 42 \\
                 3.6.4 Zeilenbreite und Trennungen / 43 \\
                 3.6.5 Zusatzinformation {\"u}ber Trennungen / 43 \\
                 4 Texthervorhebungen / 45 \\
                 4.1 {\"A}nderung der Schrift / 45 \\
                 4.1.1 Die Standardumschaltung \em / 45 \\
                 4.1.2 Die verf{\"u}gbaren Schriftarten / 46 \\
                 4.1.3 Die Wahl der Schriftgr{\"o}{\ss}e / 46 \\
                 4.1.4 Zus{\"a}tzliche Schriftarten / 48 \\
                 4.1.5 Zeichens{\"a}tze und Symbole / 48 \\
                 4.2 Textverschiebungen / 49 \\
                 4.2.1 Zentrierter Text / 49 \\
                 4.2.2 Einseitig b{\"u}ndiger Text / 49 \\
                 4.2.3 Beidseitig einger{\"u}ckter Text / 49 \\
                 4.2.4 Verseinr{\"u}ckungen / 50 \\
                 4.3 Aufz{\"a}hlungen / 51 \\
                 4.3.1 Beispiel `itemize' / 51 \\
                 4.3.2 Beispiel `enumerate' / 52 \\
                 4.3.3 Beispiel `description' / 52 \\
                 4.3.4 Geschachtelte Aufz{\"a}hlungen / 52 \\
                 4.3.5 {\"A}nderung der Markierungen / 54 \\
                 4.3.6 Literaturverzeichnis / 56 \\
                 4.4 Allgemeine Listen / 58 \\
                 4.4.1 Die Standardmarke / 58 \\
                 4.4.2 Die Listenerkl{\"a}rung / 59 \\
                 4.4.3 Beispiel f{\"u}r eine benutzergestaltete Liste /
                 60 \\
                 4.4.4 Listendefinitionen als neue Umgebungen / 61 \\
                 4.4.5 Triviale Listen / 62 \\
                 4.4.6 Verschachtelte Listen / 62 \\
                 4.5 Regels{\"a}tze / 63 \\
                 4.6 Tabulatorsetzungen / 64 \\
                 4.6.1 Grundlagen / 64 \\
                 4.6.2 Musterzeile / 64 \\
                 4.6.3 Tabstops und linker Rand / 65 \\
                 4.6.4 Weitere Tabulatorbefehle / 65 \\
                 4.6.5 Zusatzbemerkungen / 66 \\
                 4.7 Boxen / 68 \\
                 4.7.1 LR-Boxen / 68 \\
                 4.7.2 Vertikale Verschiebungen von LR-Boxen / 69 \\
                 4.7.3 Absatzboxen und Teilseiten / 70 \\
                 4.7.4 Rule-Boxen / 71 \\
                 4.7.5 Verschachtelte Boxen / 72 \\
                 4.7.6 Box-Stilparameter / 73 \\
                 4.8 Tabellen / 74 \\
                 4.8.1 Die Konstruktion von Tabellen / 74 \\
                 4.8.2 Die {\"A}nderung des Tabellenstils / 76 \\
                 4.8.3 Beispiele von Tabellenkonstruktionen / 77 \\
                 4.8.4 Gleitende Tabellen / 84 \\
                 4.9 Fu{\ss}noten und Randnotizen / 86 \\
                 4.9.1 Standardfu{\ss}noten / 86 \\
                 4.9.2 Abweichungen vom Standard / 86 \\
                 4.9.3 {\"A}nderung des Fu{\ss}notenstils / 87 \\
                 4.9.4 Fu{\ss}noten in unerlaubten Moden / 88 \\
                 4.9.5 Fu{\ss}noten in Minipages / 89 \\
                 4.9.6 Randnotizen / 89 \\
                 4.9.7 Stilparameter f{\"u}r Randboxen / 91 \\
                 4.10 Ausdruck von Originaltext / 91 \\
                 4.11 Kommentare im Eingabetext / 92 \\
                 5 Mathematische Formeln / 93 \\
                 5.1 Mathematische Umgebungen / 93 \\
                 5.2 Die Hauptkonstruktionselemente / 94 \\
                 5.2.1 Konstante, Variable und ihre Verkn{\"u}pfungen /
                 94 \\
                 5.2.2 Hoch- und Tiefstellungen von Zeichen / 95 \\
                 5.2.3 Br{\"u}che / 95 \\
                 5.2.4 Wurzeln / 96 \\
                 5.2.5 Summen und Integrale / 96 \\
                 5.2.6 Fortsetzungspunkte - Ellipsen / 97 \\
                 5.3 Mathematische Symbole / 98 \\
                 5.3.1 Griechische Buchstaben / 98 \\
                 5.3.2 Kalligraphische Buchstaben / 98 \\
                 5.3.3 Bin{\"a}re Operationssymbole / 99 \\
                 5.3.4 Vergleichssymbole und deren Negation / 99 \\
                 5.3.5 Pfeil- oder Zeigersymbole / 100 \\
                 5.3.6 Verschiedene sonstige Symbole / 100 \\
                 5.3.7 Symbole in zwei Gr{\"o}{\ss}en / 101 \\
                 5.3.8 Funktionsnamen / 101 \\
                 5.3.9 Mathematische Akzente / 102 \\
                 5.4 Weitere Konstruktionselemente / 103 \\
                 5.4.1 Automatische Gr{\"o}{\ss}enanpassung von
                 Klammersymbolen / 104 \\
                 5.4.2 Gew{\"o}hnlicher Text innerhalb von Formeln / 105
                 \\
                 5.4.3 Matrizen und Felder / 105 \\
                 5.4.4 Uber- und Unterstreichen von Teilformeln / 108
                 \\
                 5.4.5 Gestockte Symbole / 108 \\
                 5.4.6 Zus{\"a}tzliche mathematische T{\ss}X-Befehle /
                 109 \\
                 5.4.7 Mehrzellige Formeln / 110 \\
                 5.4.8 Gerahmte oder nebeneinander stehende Formeln /
                 113 \\
                 5.4.9 Chemische Formeln - Fettdruck in Formeln / 114
                 \\
                 5.5 Mathematische Formatierungshilfen / 115 \\
                 5.5.1 Horizontale Abst{\"a}nde / 115 \\
                 5.5.2 Die Wahl der Schriftgr{\"o}{\ss}en in Formeln /
                 116 \\
                 5.5.3 Manuelle Gr{\"o}{\ss}enwahl der Klammersymbole /
                 118 \\
                 5.5.4 Mathematische Stilparameter / 118 \\
                 5.5.5 Einige Zusatzempfehlungen / 119 \\
                 5.5.6 Gerahmte abgesetzte Formeln / 121 \\
                 5.5.7 Was ist sonst noch m{\"o}glich? / 122 \\
                 6 Bilder / 123 \\
                 6.1 Ma{\ss}- und Positionierungsangaben / 123 \\
                 6.2 Die Bildumgebung - picture / 124 \\
                 6.3 Die Positionierungsbefehle / 125 \\
                 6.4 Die Bildobjekt-Befehle / 126 \\
                 6.4.1 Text im Bild / 126 \\
                 6.4.2 Bildboxen - Rechtecke / 126 \\
                 6.4.3 Gerade Linien / 129 \\
                 6.4.4 Pfeile / 130 \\
                 6.4.5 Kreise / 131 \\
                 6.4.6 Ovale und gerundete Ecken / 131 \\
                 6.4.7 Vertikal gestockte Texte / 133 \\
                 6.4.8 Textangepa{\ss}te Rahmen / 133 \\
                 6.5 Weitere Bildbefehle und Beispiele / 134 \\
                 6.5.1 Strichst{\"a}xken / 134 \\
                 6.5.2 Verschachtelte Bilder / 135 \\
                 6.5.3 Speicherung von Bildteilen / 136 \\
                 6.5.4 Erweiterte picture-Umgebung / 139 \\
                 6.5.5 Weitere Beispiele / 139 \\
                 6.5.6 Allgemeine Empfehlungen / 141 \\
                 6.6 Gleitende Tabellen und Bilder / 142 \\
                 6.6.1 Die Plazierung von Gleitobjekten / 142 \\
                 6.6.2 Stilparameter f{\"u}r gleitende Objekte / 143 \\
                 6.6.3 Uber- und Unterschriften f{\"u}r gleitende
                 Objekte / 145 \\
                 6.6.4 Beispiele f{\"u}r Gleitobjekte / 146 \\
                 6.6.5 Bild- und Tabellenreferenzen im Text / 148 \\
                 7 Benutzereigene Strukturen / 149 \\
                 7.1 Z{\"a}hler / 149 \\
                 7.1.1 M?{\ss}X-eigene Z{\"a}hler / 149 \\
                 7.1.2 Benutzereigene Z{\"a}hler / 150 \\
                 7.1.3 Ver{\"a}nderung der Z{\"a}hlerwerte / 150 \\
                 7.1.4 Der Ausdruck von Z{\"a}hlerst{\"a}nden / 151 \\
                 7.2 L{\"a}ngen / 152 \\
                 7.3 Benutzereigene Befehle / 153 \\
                 7.3.1 Befehle ohne Parameter / 153 \\
                 7.3.2 Befehle mit Parametern / 155 \\
                 7.3.3 Weitere Beispiele / 156 \\
                 7.4 Benutzereigene Umgebungen / 159 \\
                 7.4.1 Umgebungen ohne Parameter / 159 \\
                 7.4.2 Umgebungen mit Parametern / 161 \\
                 7.5 Allgemeine Bemerkungen zu Benutzerstrukturen / 163
                 \\
                 7.5.1 Abspeichern von benutzereigenen Strukturen / 163
                 \\
                 7.5.2 Strukturen zur Abk{\"u}rzung / 163 \\
                 7.5.3 Gleiche Befehls- und Z{\"a}hlernamen / 164 \\
                 7.5.4 Die Reichweite benutzereigener Definitionen / 164
                 \\
                 7.5.5 Die Reihenfolge von Strukturdefinitionen / 164
                 \\
                 7.5.6 Weitergereichte Parameter / 165 \\
                 7.5.7 Verschachtelte Definitionen / 165 \\
                 7.5.8 Unerw{\"u}nschte Zwischenr{\"a}ume / 166 \\
                 7.5.9 Zwei abschlie{\ss}ende Beispiele / 167 \\
                 7.6 Benutzerspezifische LaTeX-Anpassungen / 169 \\
                 7.6.1 LaTeX-Strukturbeschreibung / 170 \\
                 7.6.2 LaTeX-Anpassungen f{\"u}r deutsche Texte / 171
                 \\
                 7.6.3 Weitere Dokumentstil-Optionen / 173 \\
                 7.6.4 Einige Zusatzhinweise / 174 \\
                 7.6.5 PC-LaTeX Anpassungen / 175 \\
                 7.6.6 Anmerkungen zum WEB-Programmsystem / 176 \\
                 8 Miszellaneen / 177 \\
                 8.1 Behandlung von Teildokumenten / 177 \\
                 8.1.1 Der ``input'' Befehl / 177 \\
                 8.1.2 Der ``include'' Befehl / 178 \\
                 8.1.3 Terminal Ein- und Ausgabe / 180 \\
                 8.2 Textbez{\"u}ge / 182 \\
                 8.2.1 Kreuzreferenzen / 182 \\
                 8.2.2 Bez{\"u}ge zum Literaturverzeichnis / 183 \\
                 8.2.3 Indexregister / 185 \\
                 8.2.4 Glossaxy / 186 \\
                 8.3 Die verschiedenen LaTeX-Files / 187 \\
                 8.4 Geladene und nachladbare Zeichens{\"a}tze / 189 \\
                 9 Fehlerbehandlung / 101 \\
                 9.1 Grundstruktur der Fehlermeldungen / 191 \\
                 9.1.1 TeX-Fehlermeldungen / 191 \\
                 9.1.2 LaTeX-Fehlermeldungen / 194 \\
                 9.1.3 Fehlermeldungen aus TeX-Makros / 198 \\
                 9.2 Fehler durch Fehler / 199 \\
                 9.2.1 Typische Fehler mit Folgewirkung / 201 \\
                 9.2.2 Mathematische Fehlermeldungen / 203 \\
                 9.2.3 Fehlermeldungen bei Mehrfiletexten / 205 \\
                 9.3 Verzeichnis aller LaTeX-Fehler / 206 \\
                 9.4 TeX-Fehlermeldungen / 209 \\
                 9.5 Warnungen / 215 \\
                 9.5.1 LaTeX-Warnungen / 215 \\
                 9.5.2 TeX-Warnungen / 216 \\
                 9.6 Suche nach versteckten Fehlern / 217 \\
                 A Briefe / 219 \\
                 A.1 Der LaTeX-letter Stil / 219 \\
                 A.2 Ein hauseigener letter Stil / 223 \\
                 A.3 Hinweise zur firmenspezifischen Anpassung / 226 \\
                 A.3.1 Benutzereigene Briefbefehle / 227 \\
                 A.3.2 Benutzereigene Briefformulare / 228 \\
                 B Literaturdatenbanken / 231 \\
                 B.1 Das BiBTeX-Programm / 231 \\
                 B.2 Die Erstellung einer Literaturdatenbank / 233 \\
                 B.2.1 Die verschiedenen Eingabetypen / 234 \\
                 B.2.2 Felder / 236 \\
                 B.2.3 Spezielle Feldformate / 237 \\
                 B.2.4 Abk{\"u}rzungen / 239 \\
                 C Zeichens{\"a}tze / 241 \\
                 C.1 Vorbemerkungen / 241 \\
                 C.2 Klassifizierung der TeX-Grundzeichens{\"a}tze / 242
                 \\
                 C.3 Proportionalschriften / 244 \\
                 C.3.1 Serifenschriften / 244 \\
                 C.3.1.1 Die Zeichensatzfamilie ``Roman'' / 244 \\
                 C.3.1.2 Die Zeichensatzfamilie ``Slanted'' / 246 \\
                 C.3.1.3 Die Zeichensatzfamilie ``Italic'' / 246 \\
                 C.3.1.4 Die Zeichensatzfamilie ``Bold Face''
                 (Fettdruck) / 247 \\
                 C.3.2 Sans Serifenschriften / 248 \\
                 C.3.2.1 Die ``senkrechten Sans Serif'' Zeichens{\"a}tze
                 / 249 \\
                 C.3.2.2 Die ``geneigten Sans Serif'' Zeichens{\"a}tze /
                 250 \\
                 C.3.2.3 Die ``fetten Sans Serif'' Zeichens{\"a}tze /
                 251 \\
                 C.3.2.4 Der Zeichensatz cminch / 251 \\
                 C.3.3 Zier- und Sonderschriften / 253 \\
                 C.4 Fixschriften - Schreibmaschinenschriften / 254 \\
                 C.4.1 Senkrechte Schreibmaschinenschriften / 254 \\
                 C.4.2 Gro{\ss}schreibung / 255 \\
                 C.4.3 Geneigte Schreibmaschinenschriften / 255 \\
                 C.4.4 Mathematische Schreibmaschinenschrift / 255 \\
                 C.5 Mathematik- und Symbolzeichens{\"a}tze / 256 \\
                 C.5.1 Mathematische Textzeichens{\"a}tze / 256 \\
                 C.5.2 Mathematische Symbole / 257 \\
                 C.5.3 Variable Symbole / 258 \\
                 C.5.4 Zus{\"a}tzliche Zeichens{\"a}tze / 258 \\
                 C.5.4.1 Die LaTeX-lasy Zeichens{\"a}tze / 259 \\
                 C.5.4.2 Zeichens{\"a}tze zur Erzeugung von Bildern /
                 259 \\
                 C.5.4.3 Logo Zeichens{\"a}tze / 259 \\
                 C.6 Die Anordnung innerhalb der Zeichens{\"a}tze / 260
                 \\
                 C.7 Die Zeichensatzfiles / 265 \\
                 C.7.1 Die Grundnamen / 265 \\
                 C.7.2 Vergr{\"o}{\ss}erte Zeichens{\"a}tze / 265 \\
                 C.7.3 Pixel-Kodierung / 267 \\
                 C.7.4 Gepackte Kodierung / 269 \\
                 C.8 Anmerkungen zu METflFONT / 270 \\
                 D LaTeX-Erg{\"a}nzungen / 273 \\
                 D.1 Der deutsche TEX-Befehlszusatz / 273 \\
                 D.1.1 Die Umlaute und das {\ss} / 274 \\
                 D.1.2 Trennhilfen / 274 \\
                 D.1.3 Aufhebung von Ligaturen / 275 \\
                 D.1.4 Deutsche Anf{\"u}hrungszeichen / 275 \\
                 D.1.5 Franz{\"o}sische Anf{\"u}hrungszeichen / 275 \\
                 D.1.6 Sprachumschaltung / 276 \\
                 D.1.7 Umschaltung auf das TeX-Original / 276 \\
                 D.1.8 Der Aufruf des german.sty Files / 277 \\
                 D.2 Der german.sty File / 278 \\
                 D.2.1 Strukturbeschreibung des german.sty Files / 278
                 \\
                 D.2.2 Anpassung der LaTeX .sty Files an den german.sty
                 File / 281 \\
                 D.2.3 Die Kombination der letter.sty und german.sty
                 Files / 283 \\
                 D.3 Weitere LaTeX Erg{\"a}nzungen / 285 \\
                 Literaturverzeichnis / 287 \\
                 Befehlsindex / 289 \\
                 Kurzbeschreibung der LaTeX-Befehle / 289 \\
                 Zusammenfassende Tabellen und Diagramme / 332 \\
                 Verbotene TeX-Befehle / 339",
}

@Book{Kopka:1993:GLD,
  author =       "Helmut Kopka and Patrick W. Daly",
  title =        "A Guide to {\LaTeX}: Document Preparation for
                 Beginners and Advanced Users",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xvi + 436",
  year =         "1993",
  ISBN =         "0-201-56889-6",
  ISBN-13 =      "978-0-201-56889-9",
  LCCN =         "Z253.4.L38 K66 1993",
  bibdate =      "Wed Jul 6 14:19:35 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  price =        "US\$34.50",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Introduction \\
                 2: Commands and Environments \\
                 3: Document and Page Styles \\
                 4: Displayed Text \\
                 5: Mathematical Formulas \\
                 6: Pictures \\
                 7: User-Defined Structures \\
                 8: Advanced Features \\
                 9: Error Messages \\
                 A: Letters \\
                 B: Bibliographic Data Bases \\
                 C: \SliTeX{} \\
                 D: \LaTeX{} Extensions \\
                 E: Character Fonts \\
                 F: Command Summary",
}

@Book{Kopka:1995:GDP,
  author =       "Helmut Kopka and Patrick W. Daly",
  title =        "A Guide to {\LaTeX}2e: Document Preparation for
                 Beginners and Advanced Users",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Second",
  pages =        "x + 554",
  year =         "1995",
  ISBN =         "0-201-42777-X",
  ISBN-13 =      "978-0-201-42777-6",
  LCCN =         "Z253.4.L38 K66 1995",
  bibdate =      "Thu May 25 15:18:31 1995",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  price =        "US\$37.61",
  abstract =     "If you are a user with little or no experience of
                 computers or text formatting and you want to master
                 \LaTeX{} to produce documents of high quality, this is
                 the book for you. Fully revised to cover both \LaTeX{}
                 2.09 and the latest version \LaTeX{} $ 2_\epsilon $,
                 this tutorial contains an exciting new text design that
                 makes it even more accessible than before.",
  acknowledgement = ack-nhfb,
}

@Book{Kopka:1999:GLD,
  author =       "Helmut Kopka and Patrick W. Daly",
  title =        "A Guide to {\LaTeXe}: Document Preparation for
                 Beginners and Advanced Users",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Third",
  pages =        "xv + 600",
  year =         "1999",
  ISBN =         "0-201-39825-7",
  ISBN-13 =      "978-0-201-39825-0",
  LCCN =         "Z253.4.L38 K66 1999",
  bibdate =      "Thu Apr 12 11:15:10 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$44.95",
  abstract =     "This updated guide to LaTeX document preparation. It
                 covers the basics as well as advanced topics and recent
                 LaTeX extensions. A section is included on 32-bit PCs
                 and LaTeX on Windows and NT.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Introduction \\
                 Commands and environments \\
                 Document layout and organization \\
                 Displayed text \\
                 Mathematical formulas \\
                 Illustrations \\
                 User Customization \\
                 Advanced features \\
                 Error messages",
}

@Book{Kopka:2004:GLT,
  author =       "Helmut Kopka and Patrick W. Daly",
  title =        "Guide to {\LaTeX}: Tools and Techniques for Computer
                 Typesetting",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Fourth",
  pages =        "xii + 597",
  year =         "2004",
  ISBN =         "0-321-17385-6 (paperback)",
  ISBN-13 =      "978-0-321-17385-0 (paperback)",
  LCCN =         "Z253.4.L38 K66 2004",
  bibdate =      "Wed Jan 21 05:16:54 2004",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  note =         "Includes CD-ROM.",
  price =        "US\$49.99, CAN\$75.99",
  abstract =     "\LaTeX{} is the text-preparation system of choice for
                 scientists and academics, and is especially useful for
                 typesetting technical materials. This popular book
                 shows you how to begin using \LaTeX{} to create
                 high-quality documents. The book also serves as a handy
                 reference of all \LaTeX{} users. In this completely
                 revised edition, the authors cover the \LaTeX$_{2
                 \epsilon }$ standard and offer more details, examples,
                 exercises, tips, and tricks. They go beyond the core
                 installation to describe the key contributed packages
                 that have become essential to \LaTeX{} processing.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Text, symbols, and commands \\
                 Document layout and organization \\
                 Displaying text \\
                 Text in boxes \\
                 Tables \\
                 Mathematical formulas \\
                 Graphics inclusion and color \\
                 Floating tables and figures \\
                 User customizations \\
                 Document management \\
                 Bibliographic databases and BibTeX \\
                 PostScript and PDF \\
                 Multilingual LaTeX \\
                 Math extensions with AMS-LaTeX \\
                 Drawing with LaTeX\\
                 Presentation material \\
                 Letters.",
}

@Book{Koren:2002:CAA,
  author =       "Israel Koren",
  title =        "Computer Arithmetic Algorithms",
  publisher =    pub-A-K-PETERS,
  address =      pub-A-K-PETERS:adr,
  edition =      "Second",
  pages =        "xv + 281",
  year =         "2002",
  ISBN =         "1-56881-160-8 (hardcover), 1-4398-6371-7 (e-book)",
  ISBN-13 =      "978-1-56881-160-4 (hardcover), 978-1-4398-6371-8
                 (e-book)",
  LCCN =         "QA76.9.C62 K67",
  bibdate =      "Sat May 04 10:29:22 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Concentrating on the underlying principles, this book
                 explains the algorithms used in arithmetic operations
                 on digital computers. It identifies the similarities
                 between the different algorithms and provides guidance
                 for selecting the appropriate algorithms for a given
                 technology. Chapters cover conventional number systems,
                 unconventional fixed-radix number systems, sequential
                 algorithms for multiplication and division, binary
                 floating-point numbers, fast addition, high-speed
                 multiplication, fast division, division through
                 multiplication, the evaluations of elementary
                 functions, logarithmic number systems, and the residue
                 number system.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Conventional Number Systems \\
                 2: Unconventional Fixed-Radix Number Systems \\
                 3: Sequential Algorithms for Multiplication and
                 Division \\
                 4: Binary Floating-Point Numbers \\
                 5: Fast Addition \\
                 6: High-Speed Multiplication \\
                 7: Fast Division \\
                 8: Division Through Multiplication \\
                 9: Evaluation of Elementary Functions \\
                 10: Logarithmic Number Systems \\
                 11: The Residue Number System",
}

@Book{Kornrumpf:1998:LET,
  author =       "H.-J. Kornrumpf and Resuhi Abdekmen",
  title =        "{Langenscheidt} {English--Turkish}, {Turkish--English}
                 Universal Dictionary",
  publisher =    "Altin K{\i}taplar",
  address =      "Istanbul, Turkey",
  pages =        "444",
  year =         "1998",
  ISBN =         "975-405-683-8",
  ISBN-13 =      "978-975-405-683-9",
  LCCN =         "PL191.L36 1998",
  bibdate =      "Sat Dec 24 11:53:05 MST 2005",
  bibsource =    "Amazon;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  bookformat =   "Paperback",
  category =     "Reference; Dictionaries \& Thesauruses; Foreign
                 Language; Turkish",
  idnumber =     "515",
}

@Book{Korpela:2006:UE,
  author =       "Jukka Korpela",
  title =        "{Unicode} Explained",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xvii + 658",
  year =         "2006",
  ISBN =         "0-596-10121-X",
  ISBN-13 =      "978-0-596-10121-3",
  LCCN =         "QA268 .K67 2006",
  bibdate =      "Mon Mar 20 05:43:48 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$59.99",
  URL =          "http://www.oreilly.com/catalog/unicode/index.html",
  abstract =     "Fundamentally, computers just deal with numbers. They
                 store letters and other characters by assigning a
                 number for each one. There are hundreds of different
                 encoding systems for mapping characters to numbers, but
                 Unicode promises a single mapping. Unicode enables a
                 single software product or website to be targeted
                 across multiple platforms, languages and countries
                 without re-engineering. It's no wonder that industry
                 giants like Apple, Hewlett-Packard, IBM and Microsoft
                 have all adopted Unicode. Containing everything you
                 need to understand Unicode, this comprehensive
                 reference from O'Reilly \ldots{}",
  acknowledgement = ack-nhfb,
  bookreview =   "http://www.unixreview.com/documents/s=10102/ur0611d/ur0610d.htm",
  tableofcontents = "Part I. Working with characters \\
                 Characters as data \\
                 Writing characters \\
                 Character sets and encodings \\
                 Part II. A systemic look at Unicode \\
                 The structure of Unicode \\
                 Properties of characters \\
                 Unicode encodings \\
                 Part III. Advanced Unicode topics \\
                 Characters and languages \\
                 Character usage \\
                 The character level and above \\
                 Characters in Internet protocols \\
                 Characters in programming",
}

@Book{Krauss:2011:QMR,
  author =       "Lawrence Maxwell Krauss",
  title =        "Quantum Man: {Richard Feynman}'s Life in Science",
  publisher =    pub-NORTON,
  address =      pub-NORTON:adr,
  pages =        "xvii + 350",
  year =         "2011",
  ISBN =         "0-393-06471-9",
  ISBN-13 =      "978-0-393-06471-1",
  LCCN =         "QC16.F49 K73 2011",
  bibdate =      "Wed Mar 23 12:02:36 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/physperspect.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Great discoveries",
  URL =          "http://www.scientificcomputing.com/news-DS-Illuminating-the-Life-and-Legacy-of-Richard-Feynman-032211.aspx",
  abstract =     "Richard Feynman changed the way we think about quantum
                 mechanics. In this gripping new scientific biography of
                 the revered Nobel Prize-winning physicist (and curious
                 character), Lawrence M. Krauss, himself a theoretical
                 physicist, offers a rollicking narrative coupled with
                 clear and novel expositions of science at the limits.
                 An immensely colourful persona, Feynman revolutionised
                 our understanding of nature amid a turbulent life.
                 Krauss presents that life - from the death of Feynman's
                 childhood sweetheart during the Manhattan Project to
                 his reluctant rise as a scientific icon - as seen
                 through the science; providing a new understanding of
                 the legacy of a man who has fascinated millions. An
                 accessible reflection on the issues that drive physics
                 today, Quantum Man captures the story of a man who was
                 willing to break all the rules to tame a theory that
                 broke all the rules.",
  acknowledgement = ack-nhfb,
  subject =      "Feynman, Richard P; (Richard Phillips); physicists;
                 United States; biography",
  subject-dates = "1918--1988",
  tableofcontents = "The paths to greatness. Lights, camera, action \\
                 The quantum universe \\
                 A new way of thinking \\
                 Alice in Quantumland \\
                 Endings and beginnings \\
                 Loss of innocence \\
                 Paths to greatness \\
                 From here to infinity \\
                 Splitting an atom \\
                 Through a glass darkly \\
                 The rest of the universe. Matter of the heart and the
                 heart of matter \\
                 Rearranging the universe \\
                 Hiding in the mirror \\
                 Distractions and delights \\
                 Twisting the tail of the cosmos \\
                 From top to bottom \\
                 Truth, beauty, and freedom \\
                 Character is destiny",
}

@Book{Kreyszig:1993:AEM,
  author =       "Erwin Kreyszig",
  title =        "Advanced Engineering Mathematics",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  edition =      "Seventh",
  pages =        "xviii + 1272 + 112 + 18",
  year =         "1993",
  ISBN =         "0-471-55380-8 (hardcover), 0-471-59989-1 (paperback)",
  ISBN-13 =      "978-0-471-55380-9 (hardcover), 978-0-471-59989-0
                 (paperback)",
  LCCN =         "QA401 .K7 1993",
  bibdate =      "Fri Sep 6 06:18:02 MDT 2013",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0707/92006989-d.html;
                 http://www.loc.gov/catdir/toc/onix05/92006989.html",
  acknowledgement = ack-nhfb,
  subject =      "Mathematical physics; Engineering mathematics",
  tableofcontents = "\\
                 Part A: Ordinary Differential Equations \\
                 1: First-Order Differential Equations \\
                 2: Second-Order Linear Differential Equations \\
                 3: Higher Order Linear Differential Equations \\
                 4: Systems of Differential Equations. Phase Plane,
                 Stability \\
                 5: Series Solutions of Differential Equations. Special
                 Functions \\
                 6: Laplace Transforms \\
                 \\
                 Part B: Linear Algebra, Vector Calculus \\
                 7: Linear Algebra: Matrices, Vectors, Determinants \\
                 8: Vector Differential Calculus. Grad, Div, Curl \\
                 9: Vector Integral Calculus. Integral Theorems \\
                 \\
                 Part C: Fourier Analysis and Partial Differential
                 Equations \\
                 10: Fourier Series, Integrals, and Transforms \\
                 11: Partial Differential Equations \\
                 \\
                 Part D: Complex Analysis \\
                 12: Complex Numbers. Complex Analytic Functions \\
                 13: Complex Integration \\
                 14: Power Series, Taylor Series, Laurent Series \\
                 15: Residue Integration Method \\
                 16: Conformal Mapping \\
                 17: Complex Analysis Applied to Potential Theory \\
                 \\
                 Part E: Numerical Methods \\
                 18: Numerical Methods in General \\
                 19: Numerical Methods in Linear Algebra \\
                 20: Numerical Methods for Differential Equations \\
                 \\
                 Part F: Optimization, Graphs \\
                 21: Unconstrained Optimization, Linear Programming \\
                 22: Graphs and Combinatorial Optimization \\
                 \\
                 Part G: Probability and Statistics \\
                 23: Probability Theory \\
                 24: Mathematical Statistics",
}

@Book{Kreyszig:1994:MCM,
  author =       "E. Kreyszig and E. J. Normington",
  title =        "{Maple} Computer Manual for Seventh Edition Advanced
                 Engineering Mathematics: {Erwin Kreyszig}",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xii + 506",
  year =         "1994",
  ISBN =         "0-471-31126-X",
  ISBN-13 =      "978-0-471-31126-3",
  LCCN =         "QA401 K74 1993",
  bibdate =      "Thu Jul 7 07:55:36 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/maple-extract.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "There is a companion {\em Instructor's Maple Manual},
                 but I have not yet found an exact citation for it.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Introduction / 1 \\
                 General Commands / 3 \\
                 1 First Order Differential Equations / 10 \\
                 Ex. 1.1 Radioactivity, exponential decay / 12 \\
                 Ex. 1.2 Separation of variables. Plot of several curves
                 / 14 \\
                 Ex. 1.3 Checking solutions. Two ways of writing
                 derivatives / 15 \\
                 Ex. 1.4 Flow through an outlet. Torricelli's law / 16
                 \\
                 Ex. 1.5 Mixing problem / 16 \\
                 Ex. 1.6 Exact differential equation / 18 \\
                 Ex. 1.7 Integrating factors / 18 \\
                 Ex. 1.8 Linear differential equations / 19 \\
                 Ex. 1.9 Bernoulli equation. Verhulst equation / 20 \\
                 Ex. 1.10 RC-circuit / 21 \\
                 Ex. 1.11 RL-circuit. TRIGONOMETRIC TRICK / 22 \\
                 Ex. 1.12 Orthogonal trajectories / 23 \\
                 Ex. 1.13 Plotting trajectories by the command seq / 24
                 \\
                 Ex. 1.14 Direction field / 25 \\
                 Ex. 1.15 Picard iteration / 26 \\
                 Problems for Chapter 1 / 28 \\
                 2 Second Order Differential Equations / 34 \\
                 Ex. 2.1 General solution. Initial value problem / 35
                 \\
                 Ex. 2.2 Double root (cf. Sec. 2.2) / 35 \\
                 Ex. 2.3 Complex roots of the characteristic equation /
                 37 \\
                 Ex. 2.4 Boundary value problem / 38 \\
                 Ex. 2.5 Undamped free vibrations / 38 \\
                 Ex. 2.6 Overdamped free motions / 40 \\
                 Ex. 2.7 Critically damped free motion / 41 \\
                 Ex. 2.8 Underdamped oscillations / 42 \\
                 Ex. 2.9 Euler--Cauchy equation / 43 \\
                 Ex. 2.10 Wronskian / 44 \\
                 Ex. 2.11 Reduction of order / 45 \\
                 Ex. 2.12 Nonhomogeneous differential equation / 45 \\
                 Ex. 2.13 Solution by undetermined coefficients / 47 \\
                 Ex. 2.14 Variation of parameters / 48 \\
                 Ex. 2.15 Resonance in an undamped vibrating system / 49
                 \\
                 Ex. 2.16 Forced undamped oscillations. Beats. / 50 \\
                 Ex. 2.17 Forced damped oscillations in Sec. 2.11 / 51
                 \\
                 Ex. 2.18 RLC-circuit / 52 \\
                 Problems for Chapter 2 / 54 \\
                 3 Higher Order Linear Differential Equations / 57 \\
                 Ex. 3.1 Basis of solutions. Wronskian / 58 \\
                 Ex. 3.2 Initial value problem / 59 \\
                 Ex. 3.3 Verification of solutions / 60 \\
                 Ex. 3.4 Differential equation for a given basis / 60
                 \\
                 Ex. 3.5 Method of undetermined coefficients / 61 \\
                 Ex. 3.6 Initial value problems for nonhomogeneous
                 equations / 62 \\
                 Ex. 3.7 Variation of parameters / 62 \\
                 Problems for Chapter 3 / 65 \\
                 4 Systems of Differential Equations Phase Plane,
                 Stability / 67 \\
                 Ex. 4.1 Improper node / 70 \\
                 Ex. 4.2 Improper node. Use of matrices / 71 \\
                 Ex. 4.3 Direction field of vectors in the phase plane /
                 73 \\
                 Ex. 4.4 Saddle point / 74 \\
                 Ex. 4.5 Center / 75 \\
                 Ex. 4.6 Spiral point / 76 \\
                 Ex. 4.7 System without basis of eigenvectors / 78 \\
                 Ex. 4.8 Pendulum equation (Sec. 4.5) / 79 \\
                 Ex. 4.9 Van der Pol equation. Limit cycle (Sec. 4.5) /
                 81 \\
                 Ex. 4.10 Nonhomogeneous system / 82 \\
                 Ex. 4.11 Method of undetermined coefficients / 83 \\
                 Ex. 4.12 Variation of parameters / 84 \\
                 Ex. 4.13 Diagonalization of systems of differential
                 equations / 85 \\
                 Problems for Chapter 4 / 88 \\
                 5 Series Solutions of Differential Equations. Special
                 Functions / 92 \\
                 Ex. 5.1 Series solution. Plot from it / 94 \\
                 Ex. 5.2 Legendre polynomials. The orthopoly package /
                 95 \\
                 Ex. 5.3 Legendre polynomials. Simplification of results
                 / 97 \\
                 Ex. 5.4 Legendre polynomials from boundary value
                 problems / 98 \\
                 Ex. 5.5 Coefficient recursion for series solution / 98
                 \\
                 Ex. 5.6 Coefficient recursion for the Legendre equation
                 / 100 \\
                 Ex. 5.7 Frobenius method / 100 \\
                 Ex. 5.8 Bessel functions / 101 \\
                 Ex. 5.9 Bessel functions of the second kind / 103 \\
                 Ex. 5.10 Orthogonal expansions. Fourier--Legendre
                 series / 104 \\
                 Problems for Chapter 5 / 106 \\
                 6 Laplace Transforms / 108 \\
                 Ex. 6.1 Beginnings / 109 \\
                 Ex. 6.2 Inverse Laplace transform / 110 \\
                 Ex. 6.3 Differentiation and integration of functions /
                 111 \\
                 Ex. 6.4 Differential equation / 111 \\
                 Ex. 6.5 Initial value problem for a nonhomogeneous
                 equation / 112 \\
                 Ex. 6.6 Unit step function. Dirac's delta function /
                 113 \\
                 Ex. 6.7 Discontinuous periodic driving force / 115 \\
                 Ex. 6.8 General formulas / 116 \\
                 Ex. 6.9 Forced oscillations. Resonance / 117 \\
                 Ex. 6.10 System of differential equations. Spacecurve /
                 118 \\
                 Problems for Chapter 6 / 121 \\
                 7 Linear Algebra, Vector Calculus / 125 \\
                 Ex. 7.1 Matrices and vectors: Addition and
                 multiplication / 129 \\
                 Ex. 7.2 Further operations on matrices / 131 \\
                 Ex. 7.3 Special matrices / 133 \\
                 Ex. 7.4 Solution of a linear system / 134 \\
                 Ex. 7.5 Gauss elimination, further cases / 135 \\
                 Ex. 7.6 Determinants / 135 \\
                 Ex. 7.7 Inverse of a matrix / 136 \\
                 Ex. 7.8 Rank of a matrix / 137 \\
                 Ex. 7.9 Linear independence and dependence / 138 \\
                 Ex. 7.10 Eigenvalues, eigenvectors / 139 \\
                 Ex. 7.11 Complex eigenvalues / 140 \\
                 Ex. 7.12 Orthogonal transformations / 141 \\
                 Ex. 7.13 Complex matrices / 142 \\
                 Ex. 7.14 Diagonalization of a matrix / 143 \\
                 Ex. 7.15 Similar matrices / 144 \\
                 Problems for Chapter 7 / 146 \\
                 8 Vector Differential Calculus. Grad, Div, Curl / 149
                 \\
                 Ex. 8.1 Vector with given endpoints. Length / 151 \\
                 Ex. 8.2 Vector addition. Scalar multiplication / 152
                 \\
                 Ex. 8.3 Inner product (dot product) / 152 \\
                 Ex. 8.4 Vector product (cross product) / 154 \\
                 Ex. 8.5 Differentiation of vectors. Tangent. Spaceplots
                 / 155 \\
                 Ex. 8.6 Arc length, curvature, torsion of a curve / 156
                 \\
                 Ex. 8.7 Gradient, directional derivative / 157 \\
                 Ex. 8.8 Gradient as surface normal vector. Vector
                 substitution / 158 \\
                 Ex. 8.9 Potential of a vector field / 159 \\
                 Ex. 8.10 Divergence. Laplacian / 159 \\
                 Ex. 8.11 Curl / 160 \\
                 Problems for Chapter 8 / 162 \\
                 9 Vector Integral Calculus. Integral Theorems / 167 \\
                 Ex. 9.1 Line integral in the plane / 167 \\
                 Ex. 9.2 Line integral in space / 168 \\
                 Ex. 9.3 Dependence of integrals on path / 169 \\
                 Ex. 9.4 Line integral of the form (7), p. 505 / 169 \\
                 Ex. 9.5 Independence of path / 170 \\
                 Ex. 9.6 Path independence; Use of potential / 170 \\
                 Ex. 9.7 Exactness and independence of path / 171 \\
                 Ex. 9.8 Double integrals / 171 \\
                 Ex. 9.9 Green's theorem in the plane / 172 \\
                 Ex. 9.10 Surface plot. Normal vector / 172 \\
                 Ex. 9.11 Surface integral (flux) / 174 \\
                 Ex. 9.12 Triple integral / 174 \\
                 Ex. 9.13 Gauss's divergence theorem / 174 \\
                 Ex. 9.14 Verification of the divergence theorem / 175
                 \\
                 Ex. 9.15 Stokes's theorem / 176 \\
                 Problems for Chapter 9 / 178 \\
                 10 Fourier Series, Integrals, and Transforms / 181 \\
                 Ex. 10.1 Periodic square wave / 181 \\
                 Ex. 10.2 Piecewise linear function / 183 \\
                 Ex. 10.3 Series with cosine and sine terms / 184 \\
                 Ex. 10.4 Period different from 2?r / 184 \\
                 Ex. 10.5 Saw tooth waves. Gibbs phenomenon / 185 \\
                 Ex. 10.6 Even and odd functions / 186 \\
                 Ex. 10.7 Half-range expansions / 186 \\
                 Ex. 10.8 Rectifier / 187 \\
                 Ex. 10.9 Forced oscillations / 189 \\
                 Ex. 10.10 Square error / 191 \\
                 Ex. 10.11 Fourier integral / 191 \\
                 Ex. 10.12 Fourier transform / 192 \\
                 Problems for Chapter 10 / 193 \\
                 11 Partial Differential Equations / 198 \\
                 Ex. 11.1 Basic equations in this chapter / 198 \\
                 Ex. 11.2 Plot of level curves / 199 \\
                 Ex. 11.3 Surface plots of solutions / 200 \\
                 Ex. 11.4 Separation of variables / 200 \\
                 Ex. 11.5 D'Alembert's solution / 201 \\
                 Ex. 11.6 Vibrating beam / 202 \\
                 Ex. 11.7 Heat equation / 203 \\
                 Ex. 11.8 Heat flow: Adiabatic ends / 204 \\
                 Ex. 11.9 Two-dimensional heat flow / 204 \\
                 Ex. 11.10 Error function / 206 \\
                 Ex. 11.11 Rectangular membrane / 208 \\
                 Ex. 11.12 Square Membrane / 209 \\
                 Problems for Chapter 11 / 211 \\
                 12 Complex Numbers Complex Analytic Functions / 215 \\
                 Ex. 12.1 Complex numbers / 217 \\
                 Ex. 12.2 Polar form / 218 \\
                 Ex. 12.3 Plotting complex numbers / 219 \\
                 Ex. 12.4 Absolute value of a quotient / 221 \\
                 Ex. 12.5 De Moivre's formula / 221 \\
                 Ex. 12.6 Quadratic and cubic equations. Roots of
                 complex numbers / 222 \\
                 Ex. 12.7 Roots of unity and their plots / 222 \\
                 Ex. 12.8 Unit circle, annulus / 224 \\
                 Ex. 12.9 Circles. Completing squares / 224 \\
                 Ex. 12.10 Inequalities / 225 \\
                 Ex. 12.11 Function, derivative, surface plot / 225 \\
                 Ex. 12.12 Cauchy--Riemann equations / 227 \\
                 Ex. 12.13 Harmonic functions / 227 \\
                 Ex. 12.14 Exponential, trigonometric and hyperbolic
                 functions / 228 \\
                 Ex. 12.15 Complex logarithm In* (cf. Sec. 12.8) / 229
                 \\
                 Problems for Chapter 12 / 232 \\
                 13 Complex Integration / 236 \\
                 Ex. 13.1 Integration by using a formula for the path /
                 236 \\
                 Ex. 13.2 A most important integral (Sec. 13.2) / 237
                 \\
                 Ex. 13.3 Path consisting of two parts. Path dependence
                 / 238 \\
                 Ex. 13.4 Indefinite integration (Sec. 13.2) / 238 \\
                 Ex. 13.5 Linearity of integration / 239 \\
                 Ex. 13.6 WARNING: Contour integrals / 239 \\
                 Ex. 13.7 Partial fractions in integration / 240 \\
                 Ex. 13.8 Contour integral of integer powers / 241 \\
                 Ex. 13.9 Integration by Cauchy's integral formula / 241
                 \\
                 Ex. 13.10 Integration by derivative formulas (Sec.
                 13.6) / 242 \\
                 Problems for Chapter 13 / 243 \\
                 14 Power Series, Taylor Series, Laurent Series / 245
                 \\
                 Ex. 14.1 Complex sequences and their plots / 246 \\
                 Ex. 14.2 Ratio test for complex series / 248 \\
                 Ex. 14.3 Radius of convergence. Cauchy--Hadamard
                 formula / 249 \\
                 Ex. 14.4 Taylor series / 250 \\
                 Ex. 14.5 Differentiation and integration of Taylor
                 series / 251 \\
                 Ex. 14.6 Generating function / 252 \\
                 Ex. 14.7 Use of complex series for computing function
                 values / 254 \\
                 Ex. 14.8 Uniform convergence / 254 \\
                 Ex. 14.9 Laurent series / 255 \\
                 Ex. 14.10 Laurent series by partial fractions / 255 \\
                 Ex. 14.11 Zeros / 257 \\
                 Ex. 14.12 Singularities / 258 \\
                 Ex. 14.13 Analytic at infinity / 258 \\
                 Problems for Chapter 14 / 260 \\
                 15 Residue Integration Method / 262 \\
                 Ex. 15.1 Residue integration / 262 \\
                 Ex. 15.2 Location of singularities. Residues / 263 \\
                 Ex. 15.3 Higher order pole. Partial fractions / 264 \\
                 Ex. 15.4 Essential singularity / 264 \\
                 Ex. 15.5 Integration by the residue theorem / 265 \\
                 Ex. 15.6 The command residue / 266 \\
                 Ex. 15.7 Real integrals / 266 \\
                 Ex. 15.8 Complex transformation of real integrals / 267
                 \\
                 Ex. 15.9 Caution with improper real integrals on the
                 computer! / 268 \\
                 Ex. 15.10 Fourier integrals, Sec. 15.4 / 269 \\
                 Ex. 15.11 Cauchy principal value / 270 \\
                 Problems for Chapter 15 / 271 \\
                 16 Conformal Mapping / 273 \\
                 Ex. 16.1 Plotting images of straight lines under w = z2
                 / 273 \\
                 Conformal mapping / 274 \\
                 Mapping w = l/z / 276 \\
                 Mapping of the unit disk onto the unit disk / 277 \\
                 Linear fractional transformation / 278 \\
                 Linear fractional transformation for given points / 278
                 \\
                 Mapping w = l/z / 279 \\
                 Inverse linear fractional transformation / 280 \\
                 Mappings of half-planes onto half-planes / 280 \\
                 Ex. 16.10 Images of several rectangles on common axes /
                 281 \\
                 Ex. 16.11 Joukowski airfoil (Sec. 16.5) / 282 \\
                 Problems for Chapter 16 / 283 \\
                 17 Complex Analysis Applied to Potential Theory / 291
                 \\
                 Ex. 17.1 Finding and plotting equipotential lines / 291
                 \\
                 Ex. 17.2 Plotting equipotential lines and lines of
                 forces. / 293 \\
                 Ex. 17.3 Equipotential lines / 293 \\
                 Ex. 17.4 Equipotential surfaces of In z / 294 \\
                 Ex. 17.5 Noncoaxial cylinders (p. 891) / 295 \\
                 Ex. 17.6 Flow around a cylinder / 296 \\
                 Ex. 17.7 Increase of the density of streamlines / 298
                 \\
                 Ex. 17.8 Plotting equipotential lines by f i e l d p l
                 o t / 298 \\
                 Ex. 17.9 Series representation of potential (Sec. 17.5)
                 / 300 \\
                 Ex. 17.10 Mean value theorem for analytic functions /
                 301 \\
                 Problems for Chapter 17 / 302 \\
                 18 Numerical Methods in General / 305 \\
                 Ex. 18.1 Numerical Errors - Quadratic Equation / 306
                 \\
                 Ex. 18.2 Fixed-point iteration / 307 \\
                 Ex. 18.3 Fixed point iteration / 308 \\
                 Ex. 18.4 Fixed-point iteration (Sec. 18.2) / 309 \\
                 Ex. 18.5 Newton's method. Square root / 310 \\
                 Ex. 18.6 Iteration for a transcendental equation / 311
                 \\
                 Ex. 18.7 Newton's method / 311 \\
                 Ex. 18.8 Secant method / 313 \\
                 Ex. 18.9 Bisection method (AEM, p. 935) / 313 \\
                 Ex. 18.10 Lagrange interpolation (Sec. 18.3) / 314 \\
                 Ex. 18.11 Newton's divided difference interpolation /
                 316 \\
                 Ex. 18.12 Newton's forward difference interpolation /
                 318 \\
                 Ex. 18.13 High-degree interpolation polynomials / 318
                 \\
                 Ex. 18.14 Numerical integration / 319 \\
                 Ex. 18.15 Gauss integration / 320 \\
                 Problems for Chapter 18 / 322 \\
                 Procedures / 325 \\
                 19 Numerical Methods in Linear Algebra / 327 \\
                 Ex. 19.1 Gauss elimination. Pivoting / 327 \\
                 Ex. 19.2 Details of the Gauss elimination / 329 \\
                 Ex. 19.3 Doolittle's method (p. 982) / 332 \\
                 Ex. 19.4 Doolittle LU-factorization / 334 \\
                 Ex. 19.5 Cholesky's method (p. 983) / 334 \\
                 Ex. 19.6 Gauss--Jordan elimination / 336 \\
                 Ex. 19.7 Gauss--Seidel iteration / 337 \\
                 Ex. 19.8 Matrix norms, condition numbers (Sees. 19.3,
                 19.4) / 338 \\
                 Ex. 19.9 Gauss--Seidel iteration. Test for convergence
                 / 339 \\
                 Ex. 19.10 Procedure for the Gauss--Seidel iteration /
                 340 \\
                 Ex. 19.11 Least squares / 341 \\
                 Ex. 19.12 Least squares / 342 \\
                 Ex. 19.13 Example 19.12 revisited: Normal equations /
                 343 \\
                 Ex. 19.14 Least squares: Quadratic polynomial / 344 \\
                 Ex. 19.15 Eigenvalues, eigenvectors / 346 \\
                 Ex. 19.16 Collatz's theorem for eigenvalues / 346 \\
                 Ex. 19.17 Power method for eigenvalues (Sec. 19.8) /
                 348 \\
                 Ex. 19.18 Wielandt's deflation / 350 \\
                 Ex. 19.19 Householder tridiagonalization / 350 \\
                 Ex. 19.20 QR Factorization method / 352 \\
                 Ex. 19.21 Pivoting in Gaussian Elimination / 355 \\
                 Problems for Chapter 19 / 357 \\
                 20 Numerical Methods for Differential Equations / 360
                 \\
                 Ex. 20.1 Two ways of writing a differential equation /
                 360 \\
                 Ex. 20.2 Euler method (p. 1035) / 361 \\
                 Ex. 20.3 Improved Euler method / 362 \\
                 Ex. 20.4 Runge--Kutta method / 364 \\
                 Ex. 20.5 Procedure for the Runge--Kutta method / 365
                 \\
                 Ex. 20.6 Adams--Moulton two-step method / 366 \\
                 Ex. 20.7 Adams--Moulton two-step method, with built-in
                 Runge--Kutta / 367 \\
                 Ex. 20.8 Second order differential equations, simplest
                 method / 368 \\
                 Ex. 20.9 Runge--Kutta--Nystr{\"o}m method / 370 \\
                 Ex. 20.10 Laplace equation in Example 1, p. 1059 / 372
                 \\
                 Ex. 20.11 Program for the Laplace equation. Band
                 matrices / 373 \\
                 Ex. 20.12 Laplace equation: Refinement of grids / 375
                 \\
                 Ex. 20.13 Laplace equation: Procedure / 376 \\
                 Ex. 20.14 Poisson Equation: Mixed Boundary Values / 377
                 \\
                 Ex. 20.15 Parabolic Equations: Crank--Nicolson Method /
                 378 \\
                 Problems for Chapter 20 / 380 \\
                 21 Chapter / 22 \\
                 No examples, no problems. 23 Probability Theory / 385
                 \\
                 Ex. 23.1 Stirling formula / 385 \\
                 Ex. 23.2 Sum of binomial coefficients / 386 \\
                 Ex. 23.3 Plotting distribution functions / 387 \\
                 Ex. 23.4 Plotting distribution function and density /
                 387 \\
                 Ex. 23.5 Distribution function, density, critical value
                 / 387 \\
                 Ex. 23.6 Uniform distribution / 388 \\
                 Ex. 23.7 Binomial distribution / 389 \\
                 Ex. 23.8 Binomial distribution / 389 \\
                 Ex. 23.9 Poisson distribution with a large mean / 391
                 \\
                 Ex. 23.10 Hypergeometric distribution / 391 \\
                 Ex. 23.11 Normal distribution / 391 \\
                 Problems for Chapter 23 / 394 \\
                 24 Mathematical Statistics / 396 \\
                 Ex. 24.1 Random numbers / 397 \\
                 Ex. 24.2 Random numbers. Sample means / 398 \\
                 Ex. 24.3 Frequency polygon / 400 \\
                 Ex. 24.4, Sample mean, variance, and standard deviation
                 / 400 \\
                 Ex. 24.5 Confidence interval for the mean of the normal
                 distribution with known variance / 401 \\
                 Ex. 24.6 Confidence interval for the mean of the normal
                 distribution with unknown variance, $t$-distribution /
                 402 \\
                 Ex. 24.7 Confidence interval for the variance of the
                 normal distribution / 402 \\
                 Ex. 24.8 Test for the mean / 403 \\
                 Ex. 24.9 Power function for different sample sizes. OC
                 curves / 403 \\
                 Ex. 24.10 Tests for the mean of the normal distribution
                 with known variance / 404 \\
                 Ex. 24.11 $t$-test for the mean of the normal
                 distribution with unknown variance / 405 \\
                 Ex. 24.12 Test for the variance of the normal
                 distribution / 405 \\
                 Ex. 24.13 Comparison of means by independent samples /
                 406 \\
                 Ex. 24.14 Comparison of variances of normal
                 distributions / 406 \\
                 Ex. 24.15 Acceptance sampling / 407 \\
                 Ex. 24.16 Linear regression / 408 \\
                 Ex. 24.17 Nonlinear regression / 409 \\
                 Problems for Chapter 24 / 411 \\
                 Appendix 1 References / A1 \\
                 Appendix 2 Solutions to Odd-Numbered Problems / A2 \\
                 Index of Maple Commands and Keywords / J1 Index of
                 Maple Commands Arranged by Chapters / J11",
}

@Book{Krieger:1990:IT,
  author =       "Jost Krieger and Norbert Schwarz",
  title =        "Introduction to {\TeX}",
  publisher =    pub-AWE,
  address =      pub-AWE:adr,
  pages =        "278",
  year =         "1990",
  ISBN =         "0-201-51141-X",
  ISBN-13 =      "978-0-201-51141-3",
  LCCN =         "Z253.4.T47 K75 1990",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  acknowledgement = ack-nhfb,
  xxnote =       "English translation of \cite{Schwarz:1988:ET}. See
                 also the Dutch translation, \cite{Schwarz:1990:IT}.",
}

@Book{Krol:1993:WIU,
  author =       "Ed Krol",
  title =        "The Whole {Internet}: User's Guide and Catalog",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xxiv + 376",
  year =         "1993",
  ISBN =         "1-56592-025-2",
  ISBN-13 =      "978-1-56592-025-5",
  LCCN =         "TK5105.875.I57 K86 1992",
  bibdate =      "Wed Dec 15 10:37:48 1993",
  bibsource =    "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",
  series =       "Nutshell handbook",
  acknowledgement = ack-nhfb,
  tableofcontents = "What is this book about \\
                 What is the internet \\
                 How the internet works \\
                 What's allowed on the internet \\
                 Remote login \\
                 Moving files: FTP \\
                 Electronic mail \\
                 Network news \\
                 Finding software \\
                 Finding someone \\
                 Tunneling through the internet: gopher \\
                 Searching indexed databases: WAIS \\
                 Hypertext spanning the internet: WWW \\
                 Other applications \\
                 Dealing with problems \\
                 Resources on the internet",
}

@Article{Krommes:fortran-web,
  author =       "John Krommes",
  title =        "{\FWEB} ({Krommes}) vs. {\FWEB} ({Avenarius} and
                 {Oppermann})",
  journal =      j-TEXHAX,
  volume =       "90",
  number =       "19",
  month =        feb,
  year =         "1990",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Kronrod:1965:NWQ,
  author =       "Aleksandr Semenovich Kronrod",
  title =        "Nodes and weights of quadrature formulas:
                 sixteen-place tables",
  publisher =    "Consultants Bureau",
  address =      "New York, NY, USA",
  pages =        "vii + 143",
  year =         "1965",
  LCCN =         "QA310 .K7613",
  bibdate =      "Sat Dec 24 16:43:03 MST 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Integrals",
}

@Book{Kronsjo:1985:CCS,
  author =       "L. Kronsj{\"o}",
  title =        "Computational Complexity of Sequential and Parallel
                 Algorithms",
  publisher =    pub-WILEY-INTERSCIENCE,
  address =      pub-WILEY-INTERSCIENCE:adr,
  pages =        "x + 224",
  year =         "1985",
  ISBN =         "0-471-90814-2",
  ISBN-13 =      "978-0-471-90814-2",
  LCCN =         "QA76.6 .K7631 1985",
  bibdate =      "Wed Dec 15 10:37:49 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$50.00",
  acknowledgement = ack-nhfb,
}

@Book{Kruglinski:1994:IVC,
  author =       "David J. Kruglinski",
  title =        "Inside {Visual C++}: Version 1.5",
  publisher =    pub-MICROSOFT,
  address =      pub-MICROSOFT:adr,
  edition =      "Second",
  pages =        "xxx + 732",
  year =         "1994",
  ISBN =         "1-55616-661-8",
  ISBN-13 =      "978-1-55616-661-7",
  LCCN =         "QA76.73.C153K78 1994",
  bibdate =      "Mon Sep 21 17:23:45 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Kruse:1984:DSP,
  author =       "Robert L. Kruse",
  title =        "Data Structures and Program Design",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xxi + 486",
  year =         "1984",
  ISBN =         "0-13-196253-1",
  ISBN-13 =      "978-0-13-196253-8",
  LCCN =         "QA76.6 .K77 1984",
  bibdate =      "Wed Dec 15 10:37:49 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$28.95",
  series =       "Prentice-Hall Software Series, Editor: Brian W.
                 Kernighan",
  acknowledgement = ack-nhfb,
  tableofcontents = "Programming principles \\
                 Lists \\
                 Information retrieval \\
                 Sorting \\
                 Binary trees \\
                 Case study: an index writer \\
                 Recursion \\
                 Case study: the polish notation \\
                 Further topics on trees \\
                 Mathematical methods \\
                 Removal of recursion \\
                 Pascal notes",
}

@Book{Kumar:2010:QEB,
  author =       "Manjit Kumar",
  title =        "Quantum: {Einstein}, {Bohr} and the great debate about
                 the nature of reality",
  publisher =    pub-NORTON,
  address =      pub-NORTON:adr,
  pages =        "xvi + 448 + 16",
  year =         "2010",
  ISBN =         "0-393-07829-9 (hardcover)",
  ISBN-13 =      "978-0-393-07829-9 (hardcover)",
  LCCN =         "QC173.98 .K86 2010; QC173.98.K86",
  bibdate =      "Wed Jul 28 08:34:27 MDT 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 library.mit.edu:9909/mit01",
  abstract =     "Describes the conflict between Einstein and Bohr over
                 the nature of reality and the soul of science as the
                 author discusses quantum theory -- ``an idea that
                 ignited the greatest intellectual debate of the
                 twentieth century.''.",
  acknowledgement = ack-nhfb,
  subject =      "Einstein, Albert; Bohr, Niels; Quantum theory;
                 History; Popular works; Physicists",
  subject-dates = "Albert Einstein (1879--1955); Niels Bohr
                 (1885--1962)",
  tableofcontents = "The quantum. The reluctant revolutionary \\
                 The patent slave \\
                 The golden Dane \\
                 The quantum atom \\
                 When Einstein met Bohr \\
                 The prince of duality \\
                 Boy physics. Spin doctors \\
                 The quantum magician \\
                 ``A late erotic outburst'' \\
                 Uncertainty in Copenhagen \\
                 Titans clash over reality. Solvay 1927 \\
                 Einstein forgets relativity \\
                 Quantum reality \\
                 Does God play dice? For whom Bell's theorem tolls \\
                 The quantum demon \\
                 Timeline \\
                 Glossary",
}

@Book{Kunii:1983:CGT,
  editor =       "Tosiyasu L. Kunii",
  title =        "Computer Graphics: Theory and Applications",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "ix + 530",
  year =         "1983",
  ISBN =         "0-387-70001-3",
  ISBN-13 =      "978-0-387-70001-4",
  LCCN =         "T385 .I49 1983",
  bibdate =      "Wed Dec 15 10:37:51 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Proceedings of Intergraphics '83.",
  acknowledgement = ack-nhfb,
}

@Book{Kunii:1985:CGV,
  editor =       "Tosiyasu L. Kunii",
  title =        "Computer Graphics: Visual Technology and Art",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "ix + 382",
  year =         "1985",
  ISBN =         "0-387-70009-9, 3-540-70009-9, 4-431-70009-9",
  ISBN-13 =      "978-0-387-70009-0, 978-3-540-70009-8,
                 978-4-431-70009-8",
  LCCN =         "T385.C5995 1985",
  bibdate =      "Wed Dec 15 10:37:51 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Proceedings of Computer Graphics Tokyo '85.",
  price =        "US\$45.00",
  acknowledgement = ack-nhfb,
}

@Book{Kunii:1985:FCG,
  editor =       "Tosiyasu L. Kunii",
  title =        "Frontiers in Computer Graphics",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "ix + 443",
  year =         "1985",
  ISBN =         "0-387-70004-8, 3-540-70004-8, 4-431-70004-8",
  ISBN-13 =      "978-0-387-70004-5, 978-3-540-70004-3,
                 978-4-431-70004-3",
  LCCN =         "T385 .C593 1984",
  bibdate =      "Wed Dec 15 10:37:54 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Proceedings of Computer Graphics Tokyo '84.",
  acknowledgement = ack-nhfb,
}

@Book{Kunii:1986:ACG,
  editor =       "Tosiyasu L. Kunii",
  title =        "Advanced Computer Graphics",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "ix + 504",
  year =         "1986",
  ISBN =         "0-387-70011-0",
  ISBN-13 =      "978-0-387-70011-3",
  LCCN =         "T385 .C5931 1986",
  bibdate =      "Wed Dec 15 10:37:50 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Proceedings of Computer Graphics Tokyo '86.",
  price =        "US\$45.00",
  acknowledgement = ack-nhfb,
  tableofcontents = "1 Computational Geometry \\
                 Localized Surface Interpolation Method for Irregular
                 Meshes \\
                 Environment for Fast Elaboration of Constructive Solid
                 Geometry \\
                 Interactive Solid Modeling in HutDesign \\
                 Polygonal Subdivision of Parametric Surfaces \\
                 Algorithms for Automatic Mould Division Design \\
                 Geometry in Prolog \\
                 On the Boundary of Digital Straight Line Segments \\
                 2 Rendering \\
                 Soft Objects \\
                 The Simulation of Natural Features Using Cone Tracing
                 \\
                 Shadows for Bump-Mapped Surfaces \\
                 3 Visual Interface and Languages \\
                 Interaction with IBS: An Icon-Based System \\
                 GEO: Graphics System with Editable Objects \\
                 A Pixelated Design Medium \\
                 A New Graphics User Interface for Accessing a Database
                 \\
                 4 Visual Data Bases \\
                 Solid Modeler with Assembly Representation Tables \\
                 Visual Business Graphics Query Interface \\
                 The Geo-Graph Simulation System: Towards Dynamic Use of
                 a Geomatic Data Base \\
                 5 Computer Animation \\
                 Integrating Key-Frame Animation and Algorithmic
                 Animation of Articulated Bodies \\
                 Molecular Shape Embedding in a Grid Stage: Modelling
                 and Animation \\
                 6 Graphics Software/Hardware Architecture \\
                 Dynamic Display of Heart Potential Images with Parallel
                 Processing \\
                 The Single Array Approach to Engineering and
                 Maintenance of CAD Software \\
                 The Integration of Computer Graphics and Image
                 Processing Techniques for the Display and Manipulation
                 of Geophysical Data \\
                 Applications of the $4 \times 4$ Determinant Method and
                 the Triangle Processor to Various Interference Problems
                 \\
                 7 Mechanical and General Purpose CAD/CAM \\
                 On Design of a Robot with Three Legs by Computer
                 Graphics \\
                 High Performance CAD System with Full Automatic
                 Dimensioning and Multi-Modeling Features Based on
                 Engineering Workstation \\
                 VIRGO: A Computer-Aided Apparel Pattern-Making System
                 \\
                 8 VLSI CAD/CAM \\
                 Efficient Algorithms for Validating VLSI Design
                 Database \\
                 Format-Independent CAD Software for VLSI Mask Data
                 Preparation \\
                 NISC: Non-Iterative Silicon Compiler \\
                 9 Marketing and Business/Technical Trends \\
                 Computer Animation around the World: A Marketing
                 Oriented Overview of Industry Development and Direction
                 \\
                 Business Computer Graphics: Usage and Effectiveness \\
                 Computer Graphics for Office Automation: A Case Study
                 \\
                 The Influence of CADD of Teaching Traditional
                 Descriptive Geometry and Orthographic Projection \\
                 Trends in Microcomputer-Based CAD in the USA \\
                 Author Index \\
                 Keywords Index",
}

@Book{Kuran:2006:HPA,
  author =       "Peter Kuran",
  title =        "How to Photograph an Atomic Bomb",
  publisher =    "VCE",
  address =      "Santa Clarita, CA, USA",
  pages =        "141",
  year =         "2006",
  ISBN =         "1-889054-19-4 (paperback), 1-889054-11-9",
  ISBN-13 =      "978-1-889054-19-3 (paperback), 978-1-889054-11-7",
  LCCN =         "UG476 .K87 2006",
  bibdate =      "Mon Oct 10 11:50:38 MDT 2011",
  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",
  price =        "US\$24.95",
  acknowledgement = ack-nhfb,
  subject =      "Military cinematography; Photography, Military;
                 Photography; Scientific applications; Atomic bomb;
                 United States; Testing; History; Nuclear weapons;
                 Hydrogen bomb",
  tableofcontents = "Introduction \\
                 History of Atomic Bomb Photography \\
                 After the War \\
                 Operation Crossroads \\
                 Lookout Mountain Studios \\
                 EG and G \\
                 Technical Difficulties of Atomic Bomb Photography \\
                 Photo Gallery \\
                 Structural Effects Tests \\
                 High Altitude Tests \\
                 Nuclear Testing Timeline",
}

@Book{Kurani:1994:AUP,
  author =       "Bharat Kurani",
  title =        "Applied {Unix} programming",
  volume =       "2",
  publisher =    pub-PHPTR,
  address =      pub-PHPTR:adr,
  pages =        "xviii + 1250",
  year =         "1994",
  ISBN =         "0-13-304338-X (vol. 1), 0-13-304346-0 (vol. 2)",
  ISBN-13 =      "978-0-13-304338-9 (vol. 1), 978-0-13-304346-4 (vol.
                 2)",
  LCCN =         "QA76.76.O63 K86 1994",
  bibdate =      "Thu Sep 19 09:23:41 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Two volumes.",
  acknowledgement = ack-nhfb,
  keywords =     "X/Open",
  libnote =      "Not yet in my library.",
  tableofcontents = "Open Systems \\
                 The UNIX Model and Terminology \\
                 Software Design and Testing \\
                 Internationalization \\
                 The C Language \\
                 The C++ Language",
}

@Book{Kurlansky:1998:CBF,
  author =       "Mark Kurlansky",
  title =        "Cod: a biography of the fish that changed the world",
  publisher =    pub-PENGUIN,
  address =      pub-PENGUIN:adr,
  pages =        "viii + 294",
  year =         "1998",
  ISBN =         "0-8027-1326-2 (hardcover), 0-14-027501-0 (paperback),
                 1-4406-7287-3 (e-book)",
  ISBN-13 =      "978-0-8027-1326-1 (hardcover), 978-0-14-027501-8
                 (paperback), 978-1-4406-7287-3 (e-book)",
  LCCN =         "SH351.C5 K87 1998",
  bibdate =      "Sat Dec 23 09:16:57 MST 2017",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "{{\booktitle{Cod}}} spans a thousand years and four
                 continents. From the Vikings, who pursued the codfish
                 across the Atlantic, and the enigmatic Basques, who
                 first commercialized it in medieval times, to
                 Bartholomew Gosnold, who named Cape Cod in 1602, and
                 Clarence Birdseye, who founded an industry on frozen
                 cod in the 1930s, Mark Kurlansky introduces the
                 explorers, merchants, writers, chefs, and of course the
                 fishermen, whose lives have interwoven with this
                 prolific fish. He chronicles the fifteenth-century
                 politics of the Hanseatic League and the cod wars of
                 the sixteenth and twentieth centuries. He embellishes
                 his story with gastronomic detail, blending in recipes
                 and lore from the Middle Ages to the present. And he
                 brings to life the cod itself: its personality, habits,
                 extended family, and ultimately the tragedy of how the
                 most profitable fish in history is today faced with
                 extinction. From fishing ports in New England and
                 Newfoundland to coastal skiffs, schooners, and factory
                 ships across the Atlantic; from Iceland and Scandinavia
                 to the coasts of England, Brazil, and West Africa, Mark
                 Kurlansky tells a story that brings world history and
                 human passions into captivating focus. The codfish.
                 Wars have been fought over it, revolutions have been
                 spurred by it, national diets have been based on it,
                 economies and livelihoods have depended on it, and the
                 settlement of North America was driven by it. To the
                 millions it has sustained, it has been a treasure more
                 precious than gold. Indeed, the codfish has played a
                 fascinating and crucial role in world history.",
  acknowledgement = ack-nhfb,
  subject =      "Cod fisheries; History; Cooking (Codfish); Cod
                 fisheries; Cooking (Codfish)",
  tableofcontents = "1: Race to Codlandia \\
                 2: With mouth wide open \\
                 3: Cod rush \\
                 4: 1620: the rock and the cod \\
                 5: Certain inalienable rights \\
                 6: Cod war heard 'round the world \\
                 7: Few new ideas versus nine million eggs \\
                 8: Last two ideas \\
                 9: Iceland discovers the finite universe \\
                 10: Three wars to close the open sea \\
                 11: Requiem for the Grand Banks \\
                 12: Dangerous waters of nature's resilience \\
                 13: Bracing for the Spanish Armada \\
                 14: Bracing for the Canadian Armada \\
                 Cook's tale: six centuries of cod recipes",
}

@Book{Kurlansky:1999:BHW,
  author =       "Mark Kurlansky",
  title =        "The {Basque} history of the world",
  publisher =    pub-WALKER,
  address =      pub-WALKER:adr,
  pages =        "xii + 387",
  year =         "1999",
  ISBN =         "0-8027-1349-1",
  ISBN-13 =      "978-0-8027-1349-0",
  LCCN =         "DP302.B46 K87 1999",
  bibdate =      "Sat Dec 23 09:12:51 MST 2017",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://lcweb.loc.gov/catdir/toc/99026808.html;
                 http://www.loc.gov/catdir/enhancements/fy0601/99026808-b.html;
                 http://www.loc.gov/catdir/enhancements/fy0601/99026808-d.html",
  acknowledgement = ack-nhfb,
  subject =      "Pa\'is Vasco (Spain); Pays Basque (France); Basques",
  tableofcontents = "Maps / ix \\
                 Introduction: The Island and the World / 1 \\
                 Part One: The Survival of Euskal Herria \\
                 The Basque Cake / 13 \\
                 1: The Basque Myth / 18 \\
                 2: The Basque Problem / 27 \\
                 3: The Basque Whale / 43 \\
                 4: The Basque Saint / 65 \\
                 5: The Basque Billy Goat / 80 \\
                 6: The Wealth of Non-Nations / 103 \\
                 Part Two: The Dawn of Euskadi \\
                 The Basque Onomatopoeia / 129 \\
                 7: The Basque Beret / 134 \\
                 8: The Basque Ear / 153 \\
                 9: Gernika / 177 \\
                 10: The Potato Time / 206 \\
                 11: Speaking Christian / 224 \\
                 12: Eventually Night Falls / 242 \\
                 Part Three: Euskadi Askatuta \\
                 Slippery Maketos / 259 \\
                 13: The Great Opportunity / 267 \\
                 14: Checks and Balances / 285 \\
                 15: Surviving Democracy / 308 \\
                 16: The Nation / 326 \\
                 Postscript: The Death of a Basque Pig / 352 \\
                 The Basque Thank You / 360 \\
                 Bibliography / 362 \\
                 Index of Proper Nouns / 373",
}

@Book{Kurlansky:2003:SWH,
  author =       "Mark Kurlansky",
  title =        "Salt: a world history",
  publisher =    pub-PENGUIN,
  address =      pub-PENGUIN:adr,
  pages =        "x + 484",
  year =         "2003",
  ISBN =         "0-14-200161-9 (paperback)",
  ISBN-13 =      "978-0-14-200161-5 (paperback)",
  LCCN =         "TN900 .K865 2003",
  bibdate =      "Sat Jun 17 09:17:49 MDT 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  price =        "US\$16",
  abstract =     "Mark Kurlansky, the bestselling author of Cod and The
                 Basque History of the World, here turns his attention
                 to a common household item with a long and intriguing
                 history: salt. The only rock we eat, salt has shaped
                 civilization from the very beginning, and its story is
                 a glittering, often surprising part of the history of
                 humankind. A substance so valuable it served as
                 currency, salt has influenced the establishment of
                 trade routes and cities, provoked and financed wars,
                 secured empires, and inspired revolutions. Populated by
                 colorful characters and filled with an unending series
                 of fascinating details, Kurlansky's kaleidoscopic
                 history is a supremely entertaining, multi-layered
                 masterpiece.",
  acknowledgement = ack-nhfb,
  subject =      "Salt; History; Salt industry and trade",
  tableofcontents = "A discourse on salt, cadavers, and pungent sources.
                 A mandate of salt \\
                 Fish, fowl, and pharaohs \\
                 Saltmen hard as codfish \\
                 Salt's salad days \\
                 Salting it away in the Adriatic \\
                 Two ports and the prosciutto in between \\
                 The glow of herring and the scent of conquest. Friday's
                 salt \\
                 A Nordic dream \\
                 A well-salted hexagon \\
                 The Hapsburg pickle \\
                 The leaving of Liverpool \\
                 American salt wars \\
                 Salt and independence \\
                 Libert{\'e}, egalit{\'e}, tax breaks \\
                 Preserving independence \\
                 The war between the salts \\
                 Red salt \\
                 Sodium's perfect marriage. The odium of sodium \\
                 The mythology of geology \\
                 The soil never sets on \\
                 Salt and the great soul \\
                 Not looking back \\
                 The last salt days of Zigong \\
                 Ma, la, and Mao \\
                 More salt than fish \\
                 Big salt, little salt",
}

@Book{Kurlansky:2017:PPT,
  author =       "Mark Kurlansky",
  title =        "Paper: paging through history",
  publisher =    pub-NORTON,
  address =      pub-NORTON:adr,
  pages =        "xx + 389",
  year =         "2017",
  ISBN =         "0-393-23961-6 (hardcover), 0-393-35370-2 (paperback)",
  ISBN-13 =      "978-0-393-23961-4 (hardcover), 978-0-393-35370-9
                 (paperback)",
  LCCN =         "TS1090 .K87 2017",
  bibdate =      "Sat Dec 23 09:09:31 MST 2017",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/typeset.bib",
  abstract =     "Through tracing paper's evolution, Mark Kurlansky
                 challenges common assumptions about technology's
                 influence, affirming that paper is here to stay. Paper
                 is one of the simplest and most essential pieces of
                 human technology. For the past two millennia, the
                 ability to produce it in ever more efficient ways has
                 supported the proliferation of literacy, media,
                 religion, education, commerce, and art; it has formed
                 the foundation of civilizations, promoting revolutions
                 and restoring stability. One has only to look at
                 history's greatest press run, which produced 6.5
                 billion copies of Quotations from Chairman Mao (which
                 doesn't include editions in 37 foreign languages and in
                 braille) to appreciate the range and influence of a
                 single publication, in paper. Or take the fact that one
                 of history's most revered artists, Leonardo da Vinci,
                 left behind only 15 paintings but 4,000 works on paper.
                 And though the colonies were at the time calling for a
                 boycott of all British goods, the one exception they
                 made speaks to the essentiality of the material; they
                 penned the Declaration of Independence on British
                 paper. Now, amid discussion of ``going paperless'' ---
                 And as speculation about the effects of a digitally
                 dependent society grows rampant --- we've come to a
                 world-historic juncture. Thousands of years ago,
                 Socrates and Plato warned that written language would
                 be the end of ``true knowledge,'' replacing the need to
                 exercise memory and think through complex questions.
                 Similar arguments were made about the switch from
                 handwritten to printed books, and today about the role
                 of computer technology. By tracing paper's evolution
                 from antiquity to the present, with an emphasis on the
                 contributions made in Asia and the Middle East, Mark
                 Kurlansky challenges common assumptions about
                 technology's influence, affirming that paper is here to
                 stay.",
  acknowledgement = ack-nhfb,
  subject =      "Papermaking; History; Paper industry",
  tableofcontents = "Prologue: The technological fallacy \\
                 Being human \\
                 The moths that circle a Chinese candle \\
                 The Islamic birth of literacy \\
                 And where is X{\'a}tiva? \\
                 Europe between two felts \\
                 Making words soar \\
                 The art of printing \\
                 Out from Mainz \\
                 Tenochtitl{\'a}n and the blue-eyed devil \\
                 The trumpet call \\
                 Rembrandt's discovery \\
                 The traitorous corruption of England \\
                 Papering independence \\
                 Diderot's promise \\
                 Invitation from a wasp \\
                 Advantages in the head \\
                 To die like gentlemen \\
                 Return to Asia \\
                 Epilogue: change \\
                 Appendix: Timeline",
}

@Book{Kurzweil:2012:HCM,
  author =       "Ray Kurzweil",
  title =        "How to Create a Mind: the Secret of Human Thought
                 Revealed",
  publisher =    pub-PENGUIN,
  address =      pub-PENGUIN:adr,
  pages =        "xi + 336",
  year =         "2012",
  ISBN =         "0-14-312404-8",
  ISBN-13 =      "978-0-14-312404-7",
  LCCN =         "QP385 .K87 2013",
  bibdate =      "Sat Oct 4 10:11:11 MDT 2014",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  remark =       "Chapter 1 contains a brief, but clear, nonmathematical
                 description of how Albert Einstein arrived at the ideas
                 of length contraction and time dilation from his
                 guiding belief that the velocity of light in vacuo is a
                 constant.",
  subject =      "Brain; Localization of functions; Self-consciousness
                 (Awareness); Artificial intelligence; Artificial
                 intelligence; Localization of functions;
                 Self-consciousness (Awareness)",
  tableofcontents = "Introduction / 1 \\
                 1: Thought experiments on the world / 13 \\
                 2: Thought experiments on thinking / 25 \\
                 3: A model of the neocortex: the pattern recognition
                 theory of mind / 34 \\
                 4: The biological neocortex / 75 \\
                 5: The old brain / 93 \\
                 6: Transcendent abilities / 109 \\
                 7: The biologically inspired digital neocortex / 121
                 \\
                 8: The mind as computer / 179 \\
                 9: Thought experiments on the mind / 199 \\
                 10: The law of accelerating returns applied to the
                 brain / 248 \\
                 11: Objections / 266 \\
                 Epilog / 277 \\
                 Notes / 283 \\
                 Index / 321",
}

@Book{Kyker:1976:IMA,
  author =       "Granvil C. {Kyker, Jr.} and D. Rae {Carpenter, Jr.}
                 and Richard B. Minnix and William R. Riley and Stanley
                 Williams",
  title =        "Instructor's Manual to Accompany {{\em Physics, by
                 Paul A. Tipler}}",
  publisher =    "Worth Publishers, Inc.",
  address =      "New York, NY, USA",
  pages =        "v + 189",
  year =         "1976",
  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",
}

@Book{Kyker:1976:SGA,
  author =       "Granvil C. {Kyker, Jr.}",
  title =        "Study Guide to Accompany {{\em Physics, by Paul A.
                 Tipler}}",
  publisher =    "Worth Publishers, Inc.",
  address =      "New York, NY, USA",
  pages =        "x + 345",
  year =         "1976",
  ISBN =         "0-87901-055-X",
  ISBN-13 =      "978-0-87901-055-3",
  LCCN =         "QC21.2 .T5482",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Kylander:1999:GUM,
  author =       "Olof Kylander and Karin Kylander",
  title =        "The {GIMP} User's Manual",
  publisher =    pub-CORIOLIS,
  address =      pub-CORIOLIS:adr,
  pages =        "xxiv + 895",
  year =         "1999",
  ISBN =         "1-57610-520-2 (paperback)",
  ISBN-13 =      "978-1-57610-520-7 (paperback)",
  LCCN =         "T385 .K866 1999",
  bibdate =      "Mon Dec 06 16:18:41 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$49.99, CAN\$73.99, UK\pounds 34.99",
  acknowledgement = ack-nhfb,
}

@Book{Lafore:1984:ALP,
  author =       "Robert Lafore",
  title =        "Assembly Language Primer for the {IBM PC} and {XT}",
  publisher =    pub-PLUME-WAITE,
  address =      pub-PLUME-WAITE:adr,
  pages =        "viii + 501",
  year =         "1984",
  ISBN =         "0-452-25497-3",
  ISBN-13 =      "978-0-452-25497-8",
  LCCN =         "QA76.8.I2594 L34 1984",
  bibdate =      "Sun May 02 07:51:02 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "A companion book for \cite{Morgan:1984:BAR}, written
                 for novice assembly-language programmers, with
                 considerable emphasis on the IBM PC. More elementary
                 than \cite{Bradley:1984:ALP}. See
                 \cite{Scanlon:1984:ALP}.",
  acknowledgement = ack-nhfb,
}

@Book{Laidler:1965:CK,
  author =       "Keith J. (Keith James) Laidler",
  title =        "Chemical Kinetics",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  edition =      "Second",
  pages =        "ix + 566",
  year =         "1965",
  LCCN =         "QD501 .L3 1965",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Misc{LALR:lalr,
  author =       "{LALR Research}",
  key =          "LALR",
  title =        "{LALR} 3.0",
  year =         "1987",
  bibdate =      "Sat Oct 28 08:26:40 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "P. O. Box 50755, Knoxville, TN 37950.",
  acknowledgement = ack-nhfb,
}

@Book{Lamport:1986:LDP,
  author =       "Leslie Lamport",
  title =        "{\LaTeX}: a Document Preparation System: User's Guide
                 and Reference Manual",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xiv + 242",
  year =         "1986",
  ISBN =         "0-201-15790-X",
  ISBN-13 =      "978-0-201-15790-1",
  LCCN =         "Z253.4.L38 L35 1986",
  bibdate =      "Wed Dec 15 10:38:04 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
                 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/texgraph.bib;
                 https://www.math.utah.edu/pub/tex/bib/typeset.bib",
  abstract =     "LaTeX is a special version of Donald Knuth's TeX
                 program for computer typesetting, a program
                 particularly suitable for producing high-quality
                 documents with mathematical text. LaTeX is a collection
                 of high-level commands, called macros, which simplify
                 the use of TeX and make the typesetting relatively
                 easy.",
  acknowledgement = ack-nhfb,
  listoffigures = "5.1 Points and their coordinates / 102 \\
                 5.2 \verb=\put(1.4,2.6){\line(3,-1){4.8}}= / 106 \\
                 5.3 The format of a list / 113 \\
                 C.1 Making footnotes without the \verb=\footnote=
                 command / 156 \\
                 C.2 Sectioning and table of contents commands / 158 \\
                 C.3 An example title / 164 \\
                 C.4 A \verb=tabbing= environment example / 180 \\
                 C.5 An example of the \verb=tabular= environment / 182
                 \\
                 C.6 A sample \verb=picture= environment / 197",
  listoftables = "3.1 Accents / 40 \\
                 3.2 Foreign Symbols / 40 \\
                 3.3 Greek Letters / 43 \\
                 3.4 Binary Operation Symbols / 44 \\
                 3.5 Relation Symbols / 44 \\
                 3.6 Arrow Symbols / 45 \\
                 3.7 Miscellaneous Symbols / 45 \\
                 3.8 Variable-sized Symbols / 45 \\
                 3.9 Log-like Functions / 46 \\
                 3.10 Delimiters / 48 \\
                 3.11 Math Mode Accents / 51",
  review =       "ACM CR 9001-0030",
  shorttableofcontents = "Preface / xiii \\
                 1: Getting Acquainted / 1 \\
                 2: Getting Started / 11 \\
                 3: Carrying On / 37 \\
                 4: Moving Information Around / 69 \\
                 5: Designing It Yourself / 81 \\
                 6: Errors / 117 \\
                 A: \SLiTeX{} / 131 \\
                 B: The Bibliography Database / 139 \\
                 C: Reference Manual / 149 \\
                 D: Using Plain \TeX{} Commands / 203 \\
                 Bibliography / 207 \\
                 Index / 209",
  subject =      "I.7.2 Computing Methodologies, TEXT PROCESSING,
                 Document Preparation, LaTeX \\ D.2.3 Software, SOFTWARE
                 ENGINEERING, Coding, Pretty printers",
  tableofcontents = "Preface / xiii \\
                 1: Getting Acquainted / 1 \\
                 1.1 How to Avoid Reading This Book / 2 \\
                 1.2 How to Read This Book / 2 \\
                 1.3 The Game of the Name / 4 \\
                 1.4 Turning Typing into Typography / 5 \\
                 1.5 Turning Ideas into Input / 8 \\
                 1.6 Trying It Out / 8 \\
                 2: Getting Started / 11 \\
                 2.1 Preparing an Input File / 12 \\
                 2.2 The Input / 13 \\
                 2.2.1 Sentences and Paragraphs / 13 \\
                 Quotation Marks / 13 \\
                 Dashes / 14 \\
                 Space After a Period / 14 \\
                 Special Symbols / 15 \\
                 Simple Text-Generating Commands / 15 \\
                 Emphasizing Text / 16 \\
                 Preventing Line Breaks / 18 \\
                 Footnotes / 19 \\
                 Formulas / 19 \\
                 Ignorable Input / 20 \\
                 2.2.2 The Document / 21 \\
                 The Document Style / 21 \\
                 The Title ``Page'' / 22 \\
                 2.2.3 Sectioning / 22 \\
                 2.2.4 Displayed Material / 24 \\
                 Quotations / 26 \\
                 Lists / 26 \\
                 Poetry / 27 \\
                 Displayed Formulas / 28 \\
                 2.3 Running \LaTeX{} / 28 \\
                 2.4 Helpful Hints / 32 \\
                 2.5 Summary / 33 \\
                 3: Carrying On / 37 \\
                 3.1 Changing the Type Style / 38 \\
                 3.2 Symbols from Other Languages / 39 \\
                 3.2.1 Accents / 40 \\
                 3.2.2 Symbols / 40 \\
                 3.3 Mathematical Formulas / 41 \\
                 3.3.1 Some Common Structures / 41 \\
                 Subscripts and Superscripts / 41 \\
                 Fractions / 41 \\
                 Roots / 42 \\
                 Ellipsis / 42 \\
                 3.3.2 Mathematical Symbols / 42 \\
                 Greek Letters / 43 \\
                 Calligraphic Letters / 43 \\
                 A Menagerie of Mathematical Symbols / 44 \\
                 Log-like Functions / 46 \\
                 3.3.3 Arrays / 47 \\
                 The array Environment / 47 \\
                 Vertical Alignment / 47 \\
                 More Complex Arrays / 48 \\
                 3.3.4 Delimiters / 48 \\
                 3.3.5 Multiline Formulas / 49 \\
                 3.3.6 Putting One Thing Above Another / 50 \\
                 Over- and Underlining / 51 \\
                 Accents / 51 \\
                 Stacking Symbols / 52 \\
                 3.3.7 Spacing in Math Mode / 52 \\
                 3.3.8 Changing Style in Math Mode / 53 \\
                 Type Style / 53 \\
                 Math Style / 54 \\
                 3.3.9 When All Else Fails / 54 \\
                 3.4 Defining Commands and Environments / 54 \\
                 3.4.1 Defining Commands / 55 \\
                 3.4.2 Defining Environments / 57 \\
                 3.4.3 Theorems and Such / 58 \\
                 3.5 Figures and Other Floating Bodies / 59 \\
                 3.5.1 Figures and Tables / 59 \\
                 3.5.2 Marginal Notes / 61 \\
                 3.6 Lining It Up in Columns / 62 \\
                 3.6.1 The tabbing Environment / 62 \\
                 3.6.2 The tabular Environment / 63 \\
                 3.7 Simulating Typed Text / 65 \\
                 3.8 Letters / 66 \\
                 4: Moving Information Around / 69 \\
                 4.1 The Table of Contents / 70 \\
                 4.2 Cross-References / 71 \\
                 4.3 Bibliography and Citation / 72 \\
                 4.3.1 Doing It Yourself / 73 \\
                 4.3.2 Using \BibTeX{} / 74 \\
                 4.4 Splitting Your Input / 75 \\
                 4.5 Making an Index or Glossary / 77 \\
                 4.5.1 Producing an Index or Glossary / 77 \\
                 4.5.2 Compiling the Entries / 78 \\
                 4.6 Keyboard Input and Screen Output / 79 \\
                 5: Designing It Yourself / 81 \\
                 5.1 Document and Page Styles / 82 \\
                 5.1.1 Document Styles / 82 \\
                 5.1.2 Page Styles / 83 \\
                 5.1.3 The Title Page and Abstract / 84 \\
                 5.1.4 Customizing the Document Style / 85 \\
                 5.2 Line and Page Breaking / 87 \\
                 5.2.1 Line Breaking / 87 \\
                 5.2.2 Page Breaking / 90 \\
                 5.3 Numbering / 91 \\
                 5.4 Length, Spaces, and Boxes / 93 \\
                 5.4.1 Length / 93 \\
                 5.4.2 Spaces / 95 \\
                 5.4.3 Boxes / 96 \\
                 LR Boxes / 97 \\
                 Parboxes / 98 \\
                 Rule Boxes / 100 \\
                 Raising and Lowering Boxes / 100 \\
                 Saving Boxes / 101 \\
                 5.5 Pictures / 101 \\
                 5.5.1 The picture Environment / 102 \\
                 5.5.2 Picture Objects / 103 \\
                 Text / 104 \\
                 Boxes / 104 \\
                 Straight Lines / 105 \\
                 Arrows / 106 \\
                 Stacks / 107 \\
                 Circles / 107 \\
                 Ovals and Rounded Corners / 108 \\
                 Framing / 108 \\
                 5.5.3 Reusing Objects / 109 \\
                 5.5.4 Repeated Patterns / 109 \\
                 5.5.5 Some Hints on Drawing Pictures / 110 \\
                 5.6 Centering and ``Flushing'' / 111 \\
                 5.7 List-Making Environments / 112 \\
                 5.7.1 The {\tt list} Environment / 112 \\
                 5.7.2 The {\tt trivlist} Environment / 115 \\
                 5.8 Fonts / 115 \\
                 5.8.1 Changing Type Size / 115 \\
                 5.8.2 Loading Fonts / 116 \\
                 6: Errors / 117 \\
                 6.1 Finding the Error / 118 \\
                 6.2 \LaTeX's Error Messages / 120 \\
                 6.3 \TeX's Error Messages / 123 \\
                 6.4 \LaTeX{} Warnings / 128 \\
                 6.5 \TeX{} Warnings / 129 \\
                 A: \SLiTeX{} / 131 \\
                 A.l How \SLiTeX{} makes Colors / 132 \\
                 A.2 The Root File / 133 \\
                 A.3 The Slide File / 134 \\
                 A.3.1 Slides / 134 \\
                 A.3.2 Overlays / 136 \\
                 A.3.3 Notes / 137 \\
                 A.3.4 Page Styles for Slides / 137 \\
                 A.4 Making Only Some Slides / 138 \\
                 B: The Bibliography Database / 139 \\
                 B.1 The Format of the {\tt bib} File / 140 \\
                 B.1.1 The Entry Format / 140 \\
                 B.1.2 The Text of a Field / 141 \\
                 Names / 141 \\
                 Titles / 142 \\
                 B.1.3 Abbreviations / 143 \\
                 B.2 The Entries / 144 \\
                 B.2.1 Entry Types / 144 \\
                 B.2.2 Fields / 146 \\
                 C: Reference Manual / 149 \\
                 C.1 Commands and Environments / 150 \\
                 C.1.1 Command Names and Arguments / 150 \\
                 C.1.2 Environments / 151 \\
                 C.1.3 Fragile Commands / 151 \\
                 C.1.4 Declarations / 152 \\
                 C.1.5 Invisible Commands and Environments / 152 \\
                 C.1.6 The {\tt \backslash\backslash} command / 153 \\
                 C.2 Sentences and Paragraphs / 154 \\
                 C.2.1 Making Sentences / 154 \\
                 C.2.2 Making Paragraphs / 154 \\
                 C.2.3 Footnotes / 156 \\
                 C.2.4 Accents and Special Symbols / 157 \\
                 C.3 Sectioning and Table of Contents / 157 \\
                 C.3.1 Sectioning Commands / 157 \\
                 C.3.2 The Appendix / 158 \\
                 C.3.3 Table of Contents / 158 \\
                 C.3.4 Style Parameters / 159 \\
                 C.4 Document and Page Styles / 160 \\
                 C.4.1 Document Styles / 160 \\
                 C.4.2 Page Styles / 161 \\
                 C.4.3 The Title Page and Abstract / 163 \\
                 C.5 Displayed Paragraphs / 165 \\
                 C.5.1 Quotations and Verse / 165 \\
                 C.5.2 List-Making Environments / 165 \\
                 C.5.3 The {\tt list} and {\tt trivlist} Environments /
                 166 \\
                 C.5.4 Verbatim / 168 \\
                 C.6 Mathematical Formulas / 169 \\
                 C.6.1 Math Mode Environments / 169 \\
                 C.6.2 Common Structures / 170 \\
                 C.6.3 Mathematical Symbols / 171 \\
                 C.6.4 Arrays / 171 \\
                 C.6.5 Delimiters / 171 \\
                 C.6.6 Putting One Thing Above Another / 171 \\
                 C.6. 7 Spacing / 172 \\
                 C.6.8 Changing Style / 172 \\
                 C. 7 Definitions / 173 \\
                 C.7.1 Defining Commands / 173 \\
                 C. 7.2 Defining Environments / 173 \\
                 C.7.3 Theorem-like Environments / 174 \\
                 C.7.4 Numbering / 174 \\
                 C.8 Figures and Other Floating Bodies / 176 \\
                 C.8.1 Figures and Tables / 176 \\
                 C.8.2 Marginal Notes / 178 \\
                 C.9 Lining It Up in Columns / 179 \\
                 C.9.1 The tabbing Environment / 179 \\
                 C.9.2 The array and tabular Environments / 182 \\
                 C.10 Moving Information Around / 185 \\
                 C.10.1 Files / 185 \\
                 C.10.2 Cross-References / 186 \\
                 C.10.3 Bibliography and Citation / 187 \\
                 C.10.4 Splitting the Input / 188 \\
                 C.10.5 Index and Glossary / 189 \\
                 Producing an Index / 189 \\
                 Compiling the Entries / 189 \\
                 C.10.6 Terminal Input and Output / 189 \\
                 C.11 Line and Page Breaking / 190 \\
                 C.11.1 Line Breaking / 190 \\
                 C.11.2 Page Breaking / 191 \\
                 C.12 Lengths, Spaces, and Boxes / 192 \\
                 C.12.1 Length / 192 \\
                 C.12 2 Space / 193 \\
                 C.12.3 Boxes / 194 \\
                 C.13 The picture Environment / 196 \\
                 C.13.1 Picture-Mode Commands / 196 \\
                 C.13.2 Picture Objects / 197 \\
                 C.13.3 Picture Declarations / 199 \\
                 C.14 Font Selection / 199 \\
                 C.14.1 Changing the Type Style / 199 \\
                 C.14.2 Changing the Type Size / 200 \\
                 C.14.3 Loading Fonts / 200 \\
                 C.14.4 Fonts in Math Mode / 200 \\
                 D: Using Plain \TeX{} Commands / 203 \\
                 Bibliography / 207 \\
                 Index / 209",
}

@Book{Lamport:1994:LDP,
  author =       "Leslie Lamport",
  title =        "{\LaTeX}: a Document Preparation System: User's Guide
                 and Reference Manual",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Second",
  pages =        "xvi + 272",
  year =         "1994",
  ISBN =         "0-201-52983-1",
  ISBN-13 =      "978-0-201-52983-8",
  LCCN =         "Z253.4.L38L35 1994",
  bibdate =      "Wed Aug 10 09:55:59 1994",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
                 https://www.math.utah.edu/pub/bibnet/subjects/han-wri-mat-sci-2ed.bib;
                 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/texgraph.bib;
                 https://www.math.utah.edu/pub/tex/bib/typeset.bib",
  abstract =     "\LaTeX{} is a software system for typesetting
                 documents. Because it is especially good for technical
                 documents and is available for almost any computer
                 system, \LaTeX{} has become a lingua franca of the
                 scientific world. Researchers, educators, and students
                 in universities, as well as scientists in industry, use
                 \LaTeX{} to produce professionally formatted papers,
                 proposals, and books. They also use \LaTeX{} input to
                 communicate information electronically to their
                 colleagues around the world. With the release of
                 \LaTeX{} $ 2_\epsilon $, the new standard version,
                 \LaTeX{} has become even more powerful. Among its new
                 features are an improved method for handling different
                 styles of type, and commands for including graphics and
                 producing colors. \LaTeX{} $ 2_\epsilon $ makes
                 available to all \LaTeX{} users valuable enhancements
                 to the software that have been developed over the years
                 by users in many different places to satisfy a variety
                 of needs. This book, written by the original architect
                 and implementer of \LaTeX{} is both the user's guide
                 and the reference manual for the software. It has been
                 updated to reflect the changes in the new release. The
                 book begins with instructions for formatting simpler
                 text, and progressively describes commands and
                 techniques for handling larger and more complicated
                 documents. A separate chapter explains how to deal with
                 errors. An added appendix describes what is new and
                 different in \LaTeX{} $ 2_\epsilon $. Other additions
                 to the second edition include descriptions of new
                 commands for inserting pictures prepared with other
                 programs and for producing colored output; new sections
                 on how to make books and slides; instructions for
                 making an index with the MakeIndex program, and an
                 updated guide to preparing a bibliography with the
                 BibTeX program; plus a section on how to send your
                 \LaTeX{} documents electronically. Users new to
                 \LaTeX{} will find here a book that has earned
                 worldwide praise as a model for clear, concise, and
                 practical documentation. Experienced users will want to
                 update their \LaTeX{} library. Although most standard
                 \LaTeX{} input files will work with \LaTeX{} $
                 2_\epsilon $, to take advantage of the new features, a
                 few \LaTeX{} $ 2_\epsilon $ conventions must first be
                 learned. For users who want an advanced guide to
                 \LaTeX{} $ 2_\epsilon $ and to more than 150 packages
                 that can now be used at any site to provide additional
                 features, a useful companion to this book is
                 \booktitle{The \LaTeX{} Companion}, by Goossens,
                 Mittelbach, and Samarin (also published by
                 Addison-Wesley).",
  acknowledgement = ack-nhfb,
  listoffigures = "6.1 Boxes and how \TeX{} puts them together / 103 \\
                 6.2 The complete definition of the \verb=\face= command
                 / 110 \\
                 6.3 The format of a list / 113 \\
                 7.1 Points and their coordinates / 119 \\
                 7.2 \verb=\put (1.4,2.6){\line(3,-1){4.8}}= / 122 \\
                 C.1 Making footnotes without the \verb=\footnote=
                 command / 173 \\
                 C.2 Sectioning and table of contents commands / 174 \\
                 C.3 Page style parameters / 182 \\
                 C.4 An example title / 183 \\
                 C.5 Writing programs with the \verb=ifthen= package's
                 commands / 196 \\
                 C.6 A \verb=tabbing= environment example / 202 \\
                 C.7 Examples of the \verb=tabular= and \verb=tabular*=
                 environments / 204 \\
                 C.8 A sample \verb=picture= environment / 220",
  listoftables = "3.1 Accents / 38 \\
                 3.2 Non-English Symbols / 39 \\
                 3.3 Greek Letters / 41 \\
                 3.4 Binary Operation Symbols / 42 \\
                 3.5 Relation Symbols / 43 \\
                 3.6 Arrow Symbols / 43 \\
                 3.7 Miscellaneous Symbols / 43 \\
                 3.8 Variable-sized Symbols / 44 \\
                 3.9 Log-like Functions / 44 \\
                 3.10 Delimiters / 47 \\
                 3.11 Math Mode Accents / 50",
  shorttableofcontents = "Preface / xvii \\
                 1: Getting Acquainted / 1 \\
                 2: Getting Started / 11 \\
                 3: Carrying On / 35 \\
                 4: Moving Information Around / 65 \\
                 5: Other Document Classes / 79 \\
                 6: Designing It Yourself / 87 \\
                 7: Pictures and Colors / 117 \\
                 8: Errors / 133 \\
                 A: Using MakeIndex / 149 \\
                 B: The Bibliography Database / 155 \\
                 C: Reference Manual / 165 \\
                 D: What's New / 227 \\
                 E: Using Plain TEX Commands / 231 \\
                 Bibliography / 235 \\
                 Index / 237",
  tableofcontents = "Preface / xvii \\
                 1: Getting Acquainted / 1 \\
                 1.1 How to Avoid Reading This Book / 2 \\
                 1.2 How to Read This Book / 3 \\
                 1.3 The Game of the Name / 5 \\
                 1.4 Turning Typing into Typography / 5 \\
                 1.5 Why \LaTeX{}? / 7 \\
                 1.6 Turning Ideas into Input / 8 \\
                 1.7 Trying It Out / 8 \\
                 2: Getting Started / 11 \\
                 2.1 Preparing an Input File / 12 \\
                 2.2 The Input / 13 \\
                 2.2.1 Sentences and Paragraphs / 13 \\
                 Quotation Marks / 13 \\
                 Dashes / 14 \\
                 Space After a Period / 14 \\
                 Special Symbols / 15 \\
                 Simple Text-Generating Commands / 15 \\
                 Emphasizing Text / 16 \\
                 Preventing Line Breaks / 17 \\
                 Footnotes / 17 \\
                 Formulas / 18 \\
                 Ignorable Input / 19 \\
                 2.2.2 The Document / 19 \\
                 The Document Class / 19 \\
                 The Title ``Page'' / 20 \\
                 2.2.3 Sectioning / 21 \\
                 2.2.4 Displayed Material / 23 \\
                 Quotations / 24 \\
                 Lists / 24 \\
                 Poetry / 25 \\
                 Displayed Formulas / 26 \\
                 2.2.5 Declarations / 27 \\
                 2.3 Running \LaTeX{} / 28 \\
                 2.4 Helpful Hints / 31 \\
                 2.5 Summary / 32 \\
                 3: Carrying On / 35 \\
                 3.1 Changing the Type Style. / 36 \\
                 3.2 Symbols from Other Languages / 38 \\
                 3.2.1 Accents / 38 \\
                 3.2.2 Symbols / 38 \\
                 3.3 Mathematical Formulas / 39 \\
                 3.3.1 Some Common Structures / 40 \\
                 Subscripts and Superscripts / 40 \\
                 Fractions / 40 \\
                 Roots / 40 \\
                 Ellipsis / 40 \\
                 3.3.2 Mathematical Symbols / 41 \\
                 Greek Letters / 41 \\
                 Calligraphic Letters / 42 \\
                 A Menagerie of Mathematical Symbols / 42 \\
                 Log-like Functions / 44 \\
                 3.3.3 Arrays / 45 \\
                 The array Environment / 45 \\
                 Vertical Alignment / 46 \\
                 More Complex Arrays / 46 \\
                 3.3.4 Delimiters / 46 \\
                 3.3.5 Multiline Formulas / 47 \\
                 3.3.6 Putting One Thing Above Another / 49 \\
                 Over- and Underlining. / 49 \\
                 Accents / 49 \\
                 Stacking Symbols / 50 \\
                 3.3.7 Spacing in Math Mode / 50 \\
                 3.3.8 Changing Style in Math Mode / 51 \\
                 Type Style / 51 \\
                 Math Style / 52 \\
                 3.3.9 When All Else Fails / 52 \\
                 3.4 Defining Commands and Environments / 53 \\
                 3.4.1 Defining Commands / 53 \\
                 3.4.2 Defining Environments / 55 \\
                 3.4.3 Theorems and Such / 56 \\
                 3.5 Figures and Other Floating Bodies / 58 \\
                 3.5.1 Figures and Tables / 58 \\
                 3.5.2 Marginal Notes / 59 \\
                 3.6 Lining It Up in Columns / 60 \\
                 3.6.1 The tabbing Environment / 60 \\
                 3.6.2 The tabular Environment / 62 \\
                 3.7 Simulating Typed Text / 63 \\
                 4: Moving Information Around / 65 \\
                 4.1 The Table of Contents / 66 \\
                 4.2 Cross-References / 67 \\
                 4.3 Bibliography and Citation / 69 \\
                 4.3.1 Using \BibTeX{} / 70 \\
                 4.3.2 Doing It Yourself / 71 \\
                 4.4 Splitting Your Input / 72 \\
                 4.5 Making an Index or Glossary / 74 \\
                 4.5.1 Compiling the Entries / 74 \\
                 4.5.2 Producing an Index or Glossary by Yourself / 75
                 \\
                 4.6 Keyboard Input and Screen Output / 76 \\
                 4.7 Sending Your Document / 77 \\
                 5: Other Document Classes / 79 \\
                 5.1 Books / 80 \\
                 5.2 Slides / 80 \\
                 5.2.1 Slides and Overlays / 81 \\
                 5.2.2 Notes / 83 \\
                 5.2.3 Printing Only Some Slides and Notes / 83 \\
                 5.2.4 Other Text / 84 \\
                 5.3 Letters / 84 \\
                 6: Designing It Yourself / 87 \\
                 6.1 Document and Page Styles / 88 \\
                 6.1.1 Document-Class Options / 88 \\
                 6.1.2 Page Styles / 89 \\
                 6.1.3 The Title Page and Abstract / 90 \\
                 6.1.4 Customizing the Style / 91 \\
                 6.2 Line and Page Breaking / 93 \\
                 6.2.1 Line Breaking / 93 \\
                 6.2.2 Page Breaking / 96 \\
                 6.3 Numbering / 97 \\
                 6.4 Length, Spaces, and Boxes / 99 \\
                 6.4.1 Length / 99 \\
                 6.4.2 Spaces / 101 \\
                 6.4.3 Boxes / 103 \\
                 LR Boxes / 104 \\
                 Parboxes / 104 \\
                 Rule Boxes / 106 \\
                 Raising and Lowering Boxes / 107 \\
                 Saving Boxes / 107 \\
                 6.4.4 Formatting with Boxes / 108 \\
                 6.5 Centering and ``Flushing'' / 111 \\
                 6.6 List-Making Environments / 112 \\
                 6.6.1 The {\tt list} Environment / 112 \\
                 6.6.2 The {\tt trivlist} Environment / 115 \\
                 6.7 Fonts / 115 \\
                 6.7.1 Changing Type Size / 115 \\
                 6.7.2 Special Symbols / 116 \\
                 7: Pictures and Colors / 117 \\
                 7.1 Pictures / 118 \\
                 7.1.1 The picture Environment / 119 \\
                 7.1.2 Picture Objects / 120 \\
                 Text / 120 \\
                 Boxes / 120 \\
                 Straight Lines / 122 \\
                 Arrows / 123 \\
                 Stacks / 123 \\
                 Circles / 124 \\
                 Ovals and Rounded Corners / 124 \\
                 Framing / 125 \\
                 7.1.3 Curves / 125 \\
                 7.1:4 Grids / 126 \\
                 7.1.5 Reusing Objects / 127 \\
                 7.1.6 Repeated Patterns / 127 \\
                 7.1.7 Some Hints on Drawing Pictures / 128 \\
                 7.2 The graphics Package / 129 \\
                 7.3 Color / 131 \\
                 8: Errors / 133 \\
                 8.1 Finding the Error / 134 \\
                 8.2 \LaTeX{}'s Error Messages / 136 \\
                 8.3 \TeX{}'s Error Messages / 140 \\
                 8.4 \LaTeX{} Warnings / 145 \\
                 8.5 \TeX{} Warnings / 147 \\
                 A: Using MakeIndex / 149 \\
                 A.1 How to Use MakeIndex / 150 \\
                 A.2 How to Generate Index Entries / 150 \\
                 A.2.1 When, Why, What, and How to Index / 150 \\
                 A.2.2 The Basics / 151 \\
                 A.2.3 The Fine Print / 153 \\
                 A.3 Error Messages / 154 \\
                 B: The Bibliography Database / 155 \\
                 B.1 The Format of the bib File / 156 \\
                 B.1.1 The Entry Format / 156 \\
                 B.1.2 The Text of a Field / 157 \\
                 Names / 157 \\
                 Titles / 158 \\
                 B.1.3 Abbreviations / 158 \\
                 B.1.4 Cross-References / 159 \\
                 B.2 The Entries / 160 \\
                 B.2.1 Entry Types / 160 \\
                 B.2.2 Fields / 162 \\
                 C: Reference Manual / 165 \\
                 C.1 Commands and Environments / 166 \\
                 C.1.1 Command Names and Arguments / 166 \\
                 C.1.2 Environments / 167 \\
                 C.1.3 Fragile Commands / 167 \\
                 C.1.4 Declarations / 168 \\
                 C.1.5 Invisible Commands and Environments / 169 \\
                 C.1.6 The\\ Command / 169 \\
                 C.2 The Structure of the Document / 170 \\
                 C.3 Sentences and Paragraphs / 170 \\
                 C.3.1 Making Sentences / 170 \\
                 C.3.2 Making Paragraphs / 171 \\
                 C.3.3 Footnotes / 172 \\
                 C.3.4 Accents and Special Symbols / 173 \\
                 C.4 Sectioning and Table of Contents / 174 \\
                 C.4.1 Sectioning Commands / 174 \\
                 C.4.2 The Appendix / 175 \\
                 C.4.3 Table of Contents / 175 \\
                 C.4.4 Style Parameters / 176 \\
                 C.5 Classes, Packages, and Page Styles / 176 \\
                 C.5.1 Document Class / 176 \\
                 C.5.2 Packages / 178 \\
                 C.5.3 Page Styles / 179 \\
                 C.5.4 The Title Page and Abstract / 181 \\
                 C.6 Displayed Paragraphs / 183 \\
                 C.6.1 Quotations and Verse / 184 \\
                 C.6.2 List-Making Environments / 184 \\
                 C.6.3 The list and trivlist Environments / 185 \\
                 C.6.4 Verbatim / 186 \\
                 C.7 Mathematical Formulas / 187 \\
                 C.7.1 Math Mode Environments / 187 \\
                 C.7.2 Common Structures / 189 \\
                 C.7.3 Mathematical Symbols / 189 \\
                 C.7.4 Arrays / 190 \\
                 C.7.5 Delimiters / 190 \\
                 C.7.6 Putting One Thing Above Another / 190 \\
                 C.7.7 Spacing / 191 \\
                 C.7.8 Changing Style / 191 \\
                 C.8 Definitions, Numbering, and Programming. / 192 \\
                 C.8.1 Defining Commands / 192 \\
                 C.8.2 Defining Environments / 192 \\
                 C.8.3 Theorem-like Environments / 193 \\
                 C.8.4 Numbering / 194 \\
                 C.8.5 The ifthen Package / 195 \\
                 C.9 Figures and Other Floating Bodies / 197 \\
                 C.9.1 Figures and Tables / 197 \\
                 C.9.2 Marginal Notes / 200 \\
                 C.10 Lining It Up in Columns / 201 \\
                 C.10.1 The tabbing Environment / 201 \\
                 C.10.2 The array and tabular Environments / 204 \\
                 C.11 Moving Information Around / 207 \\
                 C.11.1 Files / 207 \\
                 C.11.2 Cross-References / 209 \\
                 C.11.3 Bibliography and Citation / 209 \\
                 C.11.4 Splitting the Input / 210 \\
                 C.11.5 Index and Glossary / 211 \\
                 Producing an Index / 211 \\
                 Compiling the Entries / 212 \\
                 C.11.6 Terminal Input and Output / 212 \\
                 C.12 Line and Page Breaking / 213 \\
                 C.12.1 Line Breaking / 213 \\
                 C.12.2 Page Breaking / 214 \\
                 C.13 Lengths, Spaces, and Boxes / 215 \\
                 C.13.1 Length / 215 \\
                 C.13.2 Space / 216 \\
                 C.13.3 Boxes / 217 \\
                 C.14 Pictures and Color / 219 \\
                 C.14.1 The picture Environment / 219 \\
                 Picture-Mode Commands / 220 \\
                 Picture Objects / 221 \\
                 Picture Declarations / 223 \\
                 C.14.2 The graphics Package. / 223 \\
                 C.14.3 The color Package / 224 \\
                 C.15 Font Selection / 225 \\
                 C.15.1 Changing the Type Style / 225 \\
                 C.15.2 Changing the Type Size / 226 \\
                 C.15.3 Special Symbols / 226 \\
                 D: What's New / 227 \\
                 E: Using Plain TEX Commands / 231 \\
                 Bibliography / 235 \\
                 Index / 237",
}

@Book{Lancaster:2014:QFT,
  author =       "Tom Lancaster and Stephen Blundell",
  title =        "Quantum Field Theory for the Gifted Amateur",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  pages =        "xvii + 485",
  year =         "2014",
  ISBN =         "0-19-969933-X (paperback), 0-19-969932-1 (hardcover)",
  ISBN-13 =      "978-0-19-969933-9 (paperback), 978-0-19-969932-2
                 (hardcover)",
  LCCN =         "QC174.45 .L36 2014",
  bibdate =      "Fri Oct 3 15:00:54 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "Quantum field theory is arguably the most far-reaching
                 and beautiful physical theory ever constructed, with
                 aspects more stringently tested and verified to greater
                 precision than any other theory in physics.
                 Unfortunately, the subject has gained a notorious
                 reputation for difficulty, with forbidding looking
                 mathematics and a peculiar diagrammatic language
                 described in an array of unforgiving, weighty textbooks
                 aimed firmly at aspiring professionals. However,
                 quantum field theory is too important, too beautiful,
                 and too engaging to be restricted to the professionals.
                 This book on quantum field theory is designed to be
                 different. It is written by experimental physicists and
                 aims to provide the interested amateur with a bridge
                 from undergraduate physics to quantum field theory. The
                 imagined reader is a gifted amateur, possessing a
                 curious and adaptable mind, looking to be told an
                 entertaining and intellectually stimulating story, but
                 who will not feel patronised if a few mathematical
                 niceties are spelled out in detail. Using numerous
                 worked examples, diagrams, and careful physically
                 motivated explanations, this book will smooth the path
                 towards understanding the radically different and
                 revolutionary view of the physical world that quantum
                 field theory provides, and which all physicists should
                 have the opportunity to experience.",
  acknowledgement = ack-nhfb,
  subject =      "Quantum field theory; Amateurs' manuals; Problems,
                 exercises, etc; Quantum field theory;
                 Quantenfeldtheorie",
  tableofcontents = "Overture \\
                 I: The Universe as a Set of Harmonic Oscillators \\
                 1. Lagrangians \\
                 2. Simple harmonic oscillators \\
                 3. Occupation number representation \\
                 4. Making second quantization work \\
                 II: Writing Down Lagrangians \\
                 5. Continuous systems \\
                 6. A first stab at relativistic quantum mechanics \\
                 7. Examples of Lagrangians, or how to write down a
                 theory \\
                 III: The Need for Quantum Fields \\
                 8. The passage of time \\
                 9. Quantum mechanical transformations \\
                 10. Symmetry \\
                 11. Canonical quantization of fields \\
                 12. Examples of canonical quantization \\
                 13. Fields with many components and massive
                 electromagnetism \\
                 14. Gauge fields and gauge theory \\
                 15. Discrete transformations \\
                 IV: Propagators and Perturbations \\
                 16. Ways of doing quantum mechanics: propagators and
                 Green's functions \\
                 17. Propagators and Fields \\
                 18. The S-matrix \\
                 19. Expanding the S-matrix: Feynman diagrams \\
                 20. Scattering theory \\
                 V: Interlude: Wisdom from Statistical Physics \\
                 21. Statistical physics: a crash course \\
                 22. The generating functional for fields \\
                 VI: PATH INTEGRALS \\
                 23. Path Integrals: I said to him, ``You're crazy'' \\
                 24. Field Integrals \\
                 25. Statistical field theory \\
                 26. Broken symmetry \\
                 27. Coherent states \\
                 28. Grassmann numbers: coherent states and the path
                 integral for fermions \\
                 VII: Topological Ideas \\
                 29. Topological objects \\
                 30. Topological field theory \\
                 VIII: Renormalization: Taming the Infinite \\
                 31. Renormalization, quasiparticles and the Fermi
                 surface \\
                 32. Renormalization: the problem and its solution \\
                 33. Renormalization in action: propagators and Feynman
                 diagrams \\
                 34. The renormalization group \\
                 35. Ferromagnetism: a renormalization group tutorial
                 \\
                 IX: Putting a Spin on QFT \\
                 36. The Dirac equation \\
                 37. How to transform a spinor \\
                 38. The quantum Dirac field \\
                 39. A rough guide to quantum electrodynamics \\
                 40. QED scattering: three famous cross sections \\
                 41. The renormalization of QED and two great results
                 \\
                 X: Some Applications from the World of Condensed Matter
                 \\
                 42. Superfluids \\
                 43. The many-body problem and the metal \\
                 44. Superconductors \\
                 45. The fractional quantum Hall fluid \\
                 XI: Some Applications from the World of Particle
                 Physics \\
                 46. Non-abelian gauge theory \\
                 47. The Weinberg--Salam model \\
                 48. Majorana fermions \\
                 49. Magnetic monopoles \\
                 50. Instantons, tunnelling and the end of the world \\
                 Appendix A: Further reading \\
                 Appendix B: Useful complex analysis \\
                 Index",
}

@Book{Langenscheidt:2001:LPD,
  author =       "{Langenscheidt Editorial}",
  title =        "{Langenscheidt}'s Pocket Dictionary {Chinese\slash
                 English, English\slash Chinese}",
  publisher =    "Langenscheidt Publishers",
  address =      "New York, NY, USA",
  pages =        "672",
  year =         "2001",
  ISBN =         "1-58573-057-2",
  ISBN-13 =      "978-1-58573-057-5",
  LCCN =         "PL1455 .L35 2001",
  bibdate =      "Sat Dec 24 11:53:05 MST 2005",
  bibsource =    "Amazon;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Asian Language Pocket Dictionaries Series",
  acknowledgement = ack-nhfb,
  bookformat =   "Turtleback",
  category =     "Reference: Dictionaries \& Thesauruses: English
                 (British)",
  comments =     "Pocket Chinese--English, English--Chinese Dictionary
                 is a convenient reference for everyday use containing a
                 wealth of authentic idiomatic expressions and
                 up-to-date words, Pinyin romanization of all Chinese
                 characters, and a Chinese--English section arranged
                 alphabetically according to pronunciation. Over 40,000
                 references.",
  idnumber =     "507",
}

@Book{Langville:2006:GPB,
  author =       "Amy N. Langville and Carl D. (Carl Dean) Meyer",
  title =        "{Google}'s {PageRank} and beyond: the science of
                 search engine rankings",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "x + 224",
  year =         "2006",
  ISBN =         "0-691-12202-4 (hardcover)",
  ISBN-13 =      "978-0-691-12202-1 (hardcover)",
  LCCN =         "TK5105.885.G66 L36 2006",
  MRclass =      "68-02 (00-01 00A05 15A18 68U35)",
  MRnumber =     "MR2262054 (2007h:68002)",
  MRreviewer =   "Jiu Ding",
  bibdate =      "Fri Oct 23 16:04:57 MDT 2009",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/pagerank.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0654/2005938841-b.html;
                 http://www.loc.gov/catdir/enhancements/fy0654/2005938841-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0668/2005938841-t.html",
  ZMnumber =     "1104.68042",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "Preface / ix \\
                 1: Introduction to Web Search Engines / 1 \\
                 2: Crawling, Indexing, and Query Processing / 15 \\
                 3: Ranking Webpages by Popularity / 25 \\
                 4: The Mathematics of Google's PageRank / 31 \\
                 5: Parameters in the PageRank Model / 47 \\
                 6: The Sensitivity of PageRank / 57 \\
                 7: The PageRank Problem as a Linear System / 71 \\
                 8: Issues in Large-Scale Implementation of PageRank /
                 75 \\
                 9: Accelerating the Computation of PageRank / 89 \\
                 10: Updating the PageRank Vector / 99 \\
                 11: The HITS Method for Ranking Webpages / 115 \\
                 12: Other Link Methods for Ranking Webpages / 121 \\
                 13: The Future of Web Information Retrieval / 139 \\
                 14: Resources for Web Information Retrieval / 149 \\
                 15: The Mathematics Guide / 153 \\
                 16: Glossary / 201 \\
                 Bibliography / 207 \\
                 Index / 219",
  subject =      "Google; Web search engines; Web sites; Ratings;
                 Mathematics; Internet searching; World Wide Web;
                 Subject access",
  tableofcontents = "Preface / ix \\
                 1. Introduction to Web Search Engines / 1 \\
                 1.1 A Short History of Information Retrieval / 1 \\
                 1.2 An Overview of Traditional Information Retrieval /
                 5 \\
                 1.3 Web Information Retrieval / 9 \\
                 \\
                 2. Crawling, Indexing, and Query Processing / 15 \\
                 2.1 Crawling / 15 \\
                 2.2 The Content Index / 19 \\
                 2.3 Query Processing / 21 \\
                 \\
                 3. Ranking Webpages by Popularity / 25 \\
                 3.1 The Scene in 1998 / 25 \\
                 3.2 Two Theses / 26 \\
                 3.3 Query-Independence / 30 \\
                 \\
                 4. The Mathematics of Google's PageRank / 31 \\
                 4.1 The Original Summation Formula for PageRank / 32
                 \\
                 4.2 Matrix Representation of the Summation Equations /
                 33 \\
                 4.3 Problems with the Iterative Process / 34 \\
                 4.4 A Little Markov Chain Theory / 36 \\
                 4.5 Early Adjustments to the Basic Model / 36 \\
                 4.6 Computation of the PageRank Vector / 39 \\
                 4.7 Theorem and Proof for Spectrum of the Google Matrix
                 / 45 \\
                 \\
                 5. Parameters in the PageRank Model / 47 \\
                 5.1 The $\alpha$ Factor / 47 \\
                 5.2 The Hyperlink Matrix $H$ / 48 \\
                 5.3 The Teleportation Matrix $E$ / 49 \\
                 \\
                 6. The Sensitivity of PageRank / 57 \\
                 6.1 Sensitivity with respect to $\alpha$ / 57 \\
                 6.2 Sensitivity with respect to $H$ / 62 \\
                 6.3 Sensitivity with respect to $v^T$ / 63 \\
                 6.4 Other Analyses of Sensitivity / 63 \\
                 6.5 Sensitivity Theorems and Proofs / 66 \\
                 \\
                 7. The PageRank Problem as a Linear System / 71 \\
                 7.1 Properties of $(I - \alpha S)$ / 71 \\
                 7.2 Properties of $(I - \alpha H)$ / 72 \\
                 7.3 Proof of the PageRank Sparse Linear System / 73 \\
                 \\
                 8. Issues in Large-Scale Implementation of PageRank /
                 75 \\
                 8.1 Storage Issues / 75 \\
                 8.2 Convergence Criterion / 79 \\
                 8.3 Accuracy / 79 \\
                 8.4 Dangling Nodes / 80 \\
                 8.5 Back Button Modeling / 84 \\
                 \\
                 9. Accelerating the Computation of PageRank / 89 \\
                 9.1 An Adaptive Power Method / 89 \\
                 9.2 Extrapolation / 90 \\
                 9.3 Aggregation / 94 \\
                 9.4 Other Numerical Methods / 97 \\
                 \\
                 10. Updating the PageRank Vector / 99 \\
                 10.1 The Two Updating Problems and their History / 100
                 \\
                 10.2 Restarting the Power Method / 101 \\
                 10.3 Approximate Updating Using Approximate Aggregation
                 / 102 \\
                 10.4 Exact Aggregation / 104 \\
                 10.5 Exact vs. Approximate Aggregation / 105 \\
                 10.6 Updating with Iterative Aggregation / 107 \\
                 10.7 Determining the Partition / 109 \\
                 10.8 Conclusions / 111 \\
                 \\
                 11. The HITS Method for Ranking Webpages / 115 \\
                 11.1 The HITS Algorithm / 115 \\
                 11.2 HITS Implementation / 117 \\
                 11.3 HITS Convergence / 119 \\
                 11.4 HITS Example / 120 \\
                 11.5 Strengths and Weaknesses of HITS / 122 \\
                 11.6 HITS's Relationship to Bibliometrics / 123 \\
                 11.7 Query-Independent HITS / 124 \\
                 11.8 Accelerating HITS / 126 \\
                 11.9 HITS Sensitivity / 126 \\
                 \\
                 12. Other Link Methods for Ranking Webpages / 131 \\
                 12.1 SALSA / 131 \\
                 12.2 Hybrid Ranking Methods / 135 \\
                 12.3 Rankings based on Traffic Flow / 136 \\
                 \\
                 13. The Future of Web Information Retrieval / 139 \\
                 13.1 Spam / 139 \\
                 13.2 Personalization / 142 \\
                 13.3 Clustering / 142 \\
                 13.4 Intelligent Agents / 143 \\
                 13.5 Trends and Time-Sensitive Search / 144 \\
                 13.6 Privacy and Censorship / 146 \\
                 13.7 Library Classification Schemes / 147 \\
                 13.8 Data Fusion / 148 \\
                 \\
                 14. Resources for Web Information Retrieval / 149 \\
                 14.1 Resources for Getting Started / 149 \\
                 14.2 Resources for Serious Study / 150 \\
                 \\
                 15. The Mathematics Guide / 153 \\
                 15.1 Linear Algebra / 153 \\
                 15.2 Perron-Frobenius Theory / 167 \\
                 15.3 Markov Chains / 175 \\
                 15.4 Perron Complementation / 186 \\
                 15.5 Stochastic Complementation / 192 \\
                 15.6 Censoring / 194 \\
                 15.7 Aggregation / 195 \\
                 15.8 Disaggregation / 198 \\
                 \\
                 16. Glossary / 201 \\
                 \\
                 Bibliography / 207 \\
                 \\
                 Index / 219",
}

@Book{LaPaglia:1971:IQC,
  author =       "S. (Salvatore) R. {La Paglia}",
  title =        "Introductory Quantum Chemistry",
  publisher =    pub-HARPER-ROW,
  address =      pub-HARPER-ROW:adr,
  pages =        "xiii + 402",
  year =         "1971",
  LCCN =         "QD462 .L35",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Lapidus:2008:SRZ,
  author =       "Michel L. (Michel Laurent) Lapidus",
  title =        "In Search of the {Riemann} Zeros: Strings, Fractal
                 Membranes and Noncommutative Spacetimes",
  publisher =    pub-AMS,
  address =      pub-AMS:adr,
  pages =        "xxix + 558",
  year =         "2008",
  ISBN =         "0-8218-4222-6",
  ISBN-13 =      "978-0-8218-4222-5",
  LCCN =         "QA333 .L37 2008",
  bibdate =      "Fri Aug 14 21:10:27 MDT 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Riemann surfaces; functions, zeta; string models;
                 number theory; fractals; space and time; geometry",
  tableofcontents = "Dedication \\
                 Quotes \\
                 Contents \\
                 Preface \\
                 Acknowledgments \\
                 Credits \\
                 Overview \\
                 About the cover \\
                 Introduction \\
                 String theory on a circle and T-duality: Analogy with
                 the Riemann zeta function \\
                 Fractal strings and fractal membranes \\
                 Noncommutative models of fractal strings: Fractal
                 membranes and beyond \\
                 Towards an `arithmetic site': Moduli spaces of fractal
                 strings and membranes \\
                 Appendix A. Vertex algebras \\
                 Appendix B. The Weil conjectures and the Riemann
                 hypothesis \\
                 Appendix C. The Poisson summation formula, with
                 applications \\
                 Appendix D. Generalized primes and Beurling zeta
                 functions \\
                 Appendix E. The Selberg class of zeta functions \\
                 Appendix F. The noncommutative space of Penrose tilings
                 and quasicrystals \\
                 Bibliography \\
                 Conventions \\
                 Index of symbols \\
                 Subject index \\
                 Author index \\
                 Back Cover",
}

@Book{Lapin:1987:PCU,
  author =       "J. E. Lapin",
  title =        "Portable {C} and {UNIX} Programming",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xiv + 249",
  year =         "1987",
  ISBN =         "0-13-686494-5",
  ISBN-13 =      "978-0-13-686494-3",
  LCCN =         "QA76.73.C15 L36 1987",
  bibdate =      "Wed Dec 15 10:38:06 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Larousse:2006:PLI,
  editor =       "{Larousse}",
  title =        "Le Petit {Larousse} Illustr{\'e}",
  publisher =    "Larousse",
  address =      "21, rue du Montparnasse, 75283 Paris Cedex 06,
                 France",
  pages =        "1918",
  year =         "2006",
  ISBN =         "2-03-582492-3",
  ISBN-13 =      "978-2-03-582492-9",
  LCCN =         "AG25 N75 2006",
  bibdate =      "Thu Nov 16 15:48:50 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$78.95",
  acknowledgement = ack-nhfb,
}

@Book{Larsen:1989:LPD,
  author =       "Steen Larsen",
  title =        "{\LaTeX} p{\aa} dansk",
  publisher =    pub-UNIC,
  address =      pub-UNIC:adr,
  pages =        "viii + 111",
  year =         "1989",
  ISBN =         "87-7252-089-2",
  ISBN-13 =      "978-87-7252-089-6",
  bibdate =      "Wed Dec 15 17:54:21 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Latimer:1952:OSE,
  author =       "Wendell M. Latimer",
  title =        "The oxidation states of the elements and their
                 potentials in aqueous solutions",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  edition =      "Second",
  pages =        "xvi + 392",
  year =         "1952",
  LCCN =         "QD561 .L35 1952",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Laurie:1997:ADG,
  author =       "Ben Laurie and Peter Laurie",
  title =        "{Apache}: The Definitive Guide",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xvi + 255",
  year =         "1997",
  ISBN =         "1-56592-250-6",
  ISBN-13 =      "978-1-56592-250-1",
  LCCN =         "QA76.76.A7 L3 1997",
  bibdate =      "Wed Jul 23 14:54:43 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$34.95",
  URL =          "http://www.ora.com/catalog/apache/;
                 http://www.oreilly.com/catalog/apache",
  acknowledgement = ack-nhfb,
}

@Book{Lawson:1974:SLS,
  author =       "Charles L. Lawson and Richard J. Hanson",
  title =        "Solving Least Squares Problems",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xii + 340",
  year =         "1974",
  ISBN =         "0-13-822585-0",
  ISBN-13 =      "978-0-13-822585-8",
  LCCN =         "QA275 .L425 1974",
  bibdate =      "Wed Dec 15 10:38:07 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Prentice-Hall Series in Automatic Computation",
  ZMnumber =     "0860.65028",
  acknowledgement = ack-nhfb,
  subject =      "Least squares; Data processing; Moindres carr{\'e}s;
                 Informatique; Math{\'e}matiques; Traitement des
                 donn{\'e}es; Ordinateurs; Programmation informatique;
                 Data processing; Niet-lineaire problemen; Kwadratische
                 systemen; Kleinste-kwadratenmethode; Computers;
                 Algorithmus; Ausgleichsrechnung; Datenverarbeitung;
                 Methode der kleinsten Quadrate; informatique;
                 Electronic Data Processing; Regression Analysis",
  tableofcontents = "Analysis of the least squares problem \\
                 Orthogonal decomposition by certain elementary
                 orthogonal transformations \\
                 Orthogonal decomposition by singular values \\
                 Bounds for the condition number of a triangular matrix
                 \\
                 The pseudoinverse \\
                 Pertubation bounds for the pseudoinverse \\
                 Perturbation bounds for the solution of problem LS \\
                 Numerical computations using elementary orthogonal
                 transformations \\
                 Computing the solution for the overdetermined or
                 exactly determined full rank problem \\
                 Computation of the covariance matrix of the solution
                 parameters \\
                 Computing the solution for the underdetermined full
                 rank problem \\
                 Computing the solution for problem LS with possibly
                 deficient pseudorank \\
                 Analysis of computing errors for the problem LS \\
                 Analysis of computing errors for the problem LS using
                 mixed precision arithmetic \\
                 Computation of the singular value decomposition and the
                 solution of problem LS \\
                 Other methods for least squares problems \\
                 Linear least squares with linear equality constraints
                 using a basis of the null space \\
                 Linear least squares with linear equality constraints
                 by direct elimination \\
                 Linear least squares with linear equality constraints
                 by weighting \\
                 Linear least squares with linear inequality constraints
                 \\
                 Modifying a $ Q R $ decomposition to add or remove
                 column vectors \\
                 Practical analysis of least squares problems \\
                 Example of some methods of analyzing a least squares
                 problem \\
                 Modifying a $ Q R $ decomposition to add or remove row
                 vectors with application to sequential processing of
                 problems having a large or banded coefficient matrix
                 \\
                 Basic Linear Algebra Including Projections \\
                 Proof of Global Quadratic Convergence of the $ Q R $
                 Algorithm \\
                 Description and Use of FORTRAN Codes for Solving
                 Problem LS \\
                 Developments from 1974 to 1995 \\
                 Bibliography \\
                 Index",
}

@TechReport{Lawson:sf3,
  author =       "C. L. Lawson and J. A. Flynn",
  title =        "{SFTRAN3} Programmer's Reference Manual",
  number =       "1846-98",
  institution =  pub-JPL,
  address =      pub-JPL:adr,
  month =        dec,
  year =         "1978",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@TechReport{Lawson:sftran,
  author =       "C. L. Lawson",
  title =        "{SFTRAN} Language Constructs Supported by a Portable
                 Preprocessor",
  number =       "JPL Section 366 Internal Computing Memorandum 437",
  institution =  pub-JPL,
  address =      pub-JPL:adr,
  month =        jan,
  year =         "1978",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@TechReport{Lawson:sftran-conversion,
  author =       "C. L. Lawson and W. V. Snyder",
  title =        "Conversion of {SFTRAN} Programs to {SFTRAN 3}",
  number =       "1846-99",
  institution =  pub-JPL,
  address =      pub-JPL:adr,
  month =        dec,
  year =         "1978",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Article{Le-Ngoc:1989:IPF,
  author =       "Tho Le-Ngoc and Minh Tue Vo",
  title =        "Implementation and Performance of the {Fast Hartley
                 Transform}",
  journal =      j-IEEE-MICRO,
  volume =       "9",
  number =       "5",
  pages =        "20--27",
  month =        sep # "\slash " # oct,
  year =         "1989",
  CODEN =        "IEMIDZ",
  DOI =          "https://doi.org/10.1109/40.45824",
  ISSN =         "0272-1732 (print), 1937-4143 (electronic)",
  ISSN-L =       "0272-1732",
  bibdate =      "Thu Dec 14 06:08:58 MST 2000",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/ieeemicro.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 Science Citation Index database (1980--2000)",
  acknowledgement = ack-nhfb,
  affiliation =  "Concordia Univ, Montreal, Can",
  classcodes =   "C4190 (Other numerical methods); C5260 (Digital signal
                 processing)",
  classification = "721; 722; 723; 921",
  corpsource =   "Concordia Univ., Montreal, Que., Canada",
  fjournal =     "IEEE Micro",
  keywords =     "computerised signal processing; Computers, Digital;
                 convolution; digital signal processors; execution time;
                 fast Fourier; Fast Fourier Transform (FFT); fast
                 Fourier transforms; fast Hartley transform; Fast
                 Hartley Transform (FHT); hardware; Mathematical
                 Transformations--Fast Fourier Transforms; memory
                 storage requirements; microprocessors; power spectrum
                 calculation; Signal Processing--Digital Techniques;
                 software; Special Purpose Application; transform",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Book{Lebedev:1972:SFT,
  author =       "N. N. (Nikolai Nikolaevich) Lebedev",
  title =        "Special functions and their applications",
  publisher =    pub-DOVER,
  address =      pub-DOVER:adr,
  pages =        "xii + 308",
  year =         "1972",
  ISBN =         "0-486-60624-4 (paperback)",
  ISBN-13 =      "978-0-486-60624-8 (paperback)",
  LCCN =         "QA351 .L3613 1972",
  bibdate =      "Sat Oct 30 16:25:05 MDT 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  note =         "Translated to English and edited by Richard A.
                 Silverman.",
  URL =          "http://www.loc.gov/catdir/description/dover031/72086228.html",
  acknowledgement = ack-nhfb,
  remark =       "Translation of Spe{\"e}t{\`\i}sial\S{}nye
                 funk{\"e}t{\`\i}sii i ikh prilozheni{\"e}i{\`\i}a.",
  subject =      "Functions, Special; Mathematical physics",
  tableofcontents = "1 The Gamma Function \\
                 \\
                 1.1. Definition of the Gamma Function \\
                 1.2. Some Relations Satisfied by the Gamma Function \\
                 1.3. The Logarithmic Derivative of the Gamma Function
                 \\
                 1.4. Asymptotic Representation of the Gamma Function
                 for Large $ |z| $ \\
                 1.5. Definite Integrals Related to the Gamma Function
                 \\
                 Problems \\
                 \\
                 2 The Probability Integral and Related Functions \\
                 \\
                 2.1. The Probability Integral and Its Basic Properties
                 \\
                 2.2. Asymptotic Representation of the Probability
                 Integral for Large $ |z| $ \\
                 2.3. The Probability Integral of Imaginary Argument.
                 The Function $ F(z) $ \\
                 2.4. The Probability Integral of Argument $\sqrt{i} x$.
                 The Fresnel Integrals, 21 \\
                 2.5. Application to Probability Theory \\
                 2.6. Application to the Theory of Heat Conduction.
                 Cooling of the Surface of a Heated Object \\
                 2.7. Application to the Theory of Vibrations.
                 Transverse Vibrations of an Infinite Rod under the
                 Action of a Suddenly Applied Concentrated Force \\
                 Problems \\
                 \\
                 3 The Exponential Integral and Related Functions \\
                 \\
                 3.1. The Exponential Integral and its Basic Properties
                 \\
                 3.2. Asymptotic Representation of the Exponential
                 Integral for Large $|z|$ \\
                 3.3. The Exponential Integral of Imaginary Argument.
                 The Sine and Cosine Integrals \\
                 3.4. The Logarithmic Integral \\
                 3.5. Application to Electromagnetic Theory, Radiation
                 of a Linear Half-Wave Oscillator Problems \\
                 \\
                 4 Orthogonal Polynomials \\
                 \\
                 4.1. Introductory Remarks \\
                 4.2. Definition and Generating Function of the Legendre
                 Polynomials \\
                 4.3. Recurrence Relations and Differential Equation for
                 the Legendre Polynomials \\
                 4.4. Integral Representations of the Legendre
                 Polynomials \\
                 4.5. Orthogonality of the Legendre Polynomials \\
                 4.6. Asymptotic Representation of the Legendre
                 Polynomials for Large $n$ \\
                 4.7. Expansion of Functions in Series of Legendre
                 Polynomials \\
                 4.8. Examples of Expansions in Series of Legendre
                 Polynomials \\
                 4.9. Definition and Generating Function of the Hermite
                 Polynomials \\
                 4.10. Recurrence Relations and Differential Equation
                 for the Hermite Polynomials \\
                 4.11. Integral Representations of the Hermite
                 Polynomials \\
                 4.12. Integral Equations Satisfied by the Hermite
                 Polynomials \\
                 4.13. Orthogonality of the Hermite Polynomials \\
                 4.14. Asymptotic Representation of the Hermite
                 Polynomials for Large n \\
                 4.15. Expansion of Functions in Series of Hermite
                 Polynomials \\
                 4.16. Examples of Expansions in Series of Hermite
                 Polynomials \\
                 4.17. Definition and Generating Function of the
                 Laguerre Polynomials \\
                 4.18. Recurrence Relations and Differential Equation
                 for the Laguerre Polynomials \\
                 4.19. An Integral Representation of the Laguerre
                 Polynomials. Relation between the Laguerre and Hermite
                 Polynomials \\
                 4.20. An Integral Equation Satisfied by the Laguerre
                 Polynomials \\
                 4.21. Orthogonality of the Laguerre Polynomials \\
                 4.22. Asymptotic Representation of the Laguerre
                 Polynomials for Large $n$ \\
                 4.23. Expansion of Functions in Series of Laguerre
                 Polynomials \\
                 4.24. Examples of Expansions in Series of Laguerre
                 Polynomials \\
                 4.25. Application to the Theory of Propagation of
                 Electromagnetic Waves. Reflection from the End of a
                 Long Transmission Line Terminated by a Lumped
                 Inductance \\
                 Problems \\
                 \\
                 5 Cylinder Functions: Theory \\
                 \\
                 5.1. Introductory Remarks \\
                 5.2. Bessel Functions of Nonnegative Integral Order \\
                 5.3. Bessel Functions of Arbitrary Order \\
                 5.4. General Cylinder Functions. Bessel Functions of
                 the Second Kind \\
                 5.5. Series Expansion of the Function$ $Y_n(z)$ \\
                 5.6. Bessel Functions of the Third Kind \\
                 5.7. Bessel Functions of Imaginary Argument \\
                 5.8. Cylinder Functions of Half-Integral Order \\
                 5.9. Wronskians of Pairs of Solutions of Bessel s
                 Equation \\
                 5.10. Integral Representations of the Cylinder
                 Functions \\
                 5.11. Asymptotic Representations of the Cylinder
                 Functions for Large $|z|$ \\
                 5.12. Addition Theorems for the Cylinder Functions,
                 124.Zeros of the Cylinder Functions \\
                 5.13. Expansions in Series and Integrals Involving
                 Cylinder Functions \\
                 5.14. Definite Integrals Involving Cylinder Functions
                 \\
                 5.15. Cylinder Functions of Nonnegative Argument and
                 Order \\
                 5.16. Airy Functions \\
                 Problems \\
                 \\
                 6 Cylinder Functions: Applications \\
                 \\
                 6.1. Introductory Remarks \\
                 6.2. Separation of Variables in Cylindrical Coordinates
                 \\
                 6.3. The Boundary Value Problems of Potential Theory.
                 The Dirichlet Problem for a Cylinder \\
                 6.4. The Dirichlet Problem for a Domain Bounded by Two
                 Parallel Planes \\
                 6.5. The Dirichlet Problem for a Wedge \\
                 6.6. The Field of a Point Charge near the Edge of a
                 Conducting Sheet \\
                 6.7. Cooling of a Heated Cylinder \\
                 6.8. Diffraction by a Cylinder \\
                 Problems \\
                 \\
                 7 Spherical Harmonics: Theory \\
                 \\
                 7.1. Introductory Remarks \\
                 7.2. The Hypergeometric Equation and Its Series
                 Solution \\
                 7.3. Legendre Functions \\
                 7.4. Integral Representations of the Legendre Functions
                 \\
                 7.5. Some Relations Satisfied by the Legendre Functions
                 \\
                 7.6. Series Representations of the Legendre Functions
                 \\
                 7.7. Wronskians of Pairs of Solutions of Legend-re s
                 Equation \\
                 7.8. Recurrence Relations for the Legendre Functions
                 \\
                 7.9. Legendre Functions of Nonnegative Integral Degree
                 and Their Relation to Legendre Polynomials \\
                 7.10. Legendre Functions of Half-Integral Degree \\
                 7.11. Asymptotic Representations of the Legendre
                 Functions for Large $|v|$ \\
                 7.12. Associated Legendre Functions \\
                 Problems \\
                 \\
                 8 Spherical Harmonics: Applications \\
                 \\
                 8.1. Introductory Remarks \\
                 8.2. Solution of Laplace's Equation in Spherical
                 Coordinates \\
                 8.3. The Dirichlet Problem for a Sphere \\
                 8.4. The Field of a Point Charge Inside a Hollow
                 Conducting Sphere \\
                 8.5. The Dirichlet Problem for a Cone \\
                 8.6. Solution of Laplace's Equation in Spheroidal
                 Coordinates \\
                 8.7. The Dirichlet Problem for a Spheroid \\
                 8.8. The Gravitational Attraction of a Homogeneous
                 Solid Spheroid \\
                 8.9. The Dirichlet Problem for a Hyperboloid of
                 Revolution \\
                 8.10. Solution of Laplace's Equation in Toroidal
                 Coordinates \\
                 8.11. The Dirichlet Problem for a Torus \\
                 8.12. The Dirichlet Problem for a Domain Bounded by Two
                 Intersecting Spheres \\
                 8.13. Solution of Laplace's Equation in Bipolar
                 Coordinates \\
                 8.14. Solution of Helmholtz's Equation in Spherical
                 Coordinates \\
                 Problems \\
                 \\
                 9 Hypergeometric Functions \\
                 \\
                 9.1. The Hypergeometric Series and Its Analytic
                 Continuation \\
                 9.2. Elementary Properties of the Hypergeometric
                 Function \\
                 9.3. Evaluation of $F(\alpha, \beta; \gamma; z)$ for
                 $\Re(\gamma \alpha \beta) > 0$, 243. \\
                 9.4. $F(\alpha, \beta; \gamma; z)$ as a Function of its
                 Parameters \\
                 9.5. Linear Transformations of the Hypergeometric
                 Function \\
                 9.6. Quadratic Transformations of the Hypergeometric
                 Function \\
                 9.7. Formulas for Analytic Continuation of $F(\alpha,
                 \beta; \gamma; z)$ in Exceptional Cases \\
                 9.8. Representation of Various Functions in Terms of
                 the Hypergeometric Function \\
                 9.9. The Confluent Hypergeometric Function \\
                 9.10. The Differential Equation for the Confluent
                 Hypergeometric Function and Its Solution. The Confluent
                 Hypergeometric Function of the Second Kind \\
                 9.11. Integral Representations of the Confluent
                 Hypergeometric Functions \\
                 9.12. Asymptotic Representations of the Confluent
                 Hypergeometric Functions for Large $|z|$ \\
                 9.13. Representation of Various Functions in Terms of
                 the Confluent Hypergeometric Functions \\
                 9.14. Generalized Hypergeometric Functions \\
                 Problems \\
                 \\
                 10 Parabolic Cylinder Functions \\
                 \\
                 10.1. Separation of Variables in Laplace's Equation in
                 Parabolic Coordinates \\
                 10.2. Hermite Functions \\
                 10.3. Some Relations Satisfied by the Hermite Functions
                 \\
                 10.4. Recurrence Relations for the Hermite Functions
                 \\
                 10.5. Integral Representations of the Hermite Functions
                 \\
                 10.6. Asymptotic Representations of the Hermite
                 Functions for Large $|z|$ \\
                 10.7. The Dirichlet Problem for a Parabolic Cylinder
                 \\
                 10.8. Application to Quantum Mechanics \\
                 Problems \\
                 \\
                 Bibliography \\
                 \\
                 Index",
}

@Book{Ledgard:1979:PS,
  author =       "Henry F. Ledgard and John F. Hueras and Paul A.
                 Nagin",
  title =        "{Pascal} with Style",
  publisher =    pub-HAYDEN,
  address =      pub-HAYDEN:adr,
  pages =        "210",
  year =         "1979",
  ISBN =         "0-8104-5124-7",
  ISBN-13 =      "978-0-8104-5124-7",
  LCCN =         "QA76.73.P2 L4",
  bibdate =      "Wed Dec 15 10:38:08 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/w/wirth-niklaus.bib",
  acknowledgement = ack-nhfb,
}

@Book{Leech:1965:CM,
  author =       "J. W. Leech",
  title =        "Classical Mechanics",
  volume =       "8",
  publisher =    "Science Paperbacks and Methuen \& Co., Ltd.",
  address =      "London, England",
  edition =      "Second",
  pages =        "ix + 153",
  year =         "1965",
  LCCN =         "QA807 .L4 1965",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Methuen's Monographs on Physical Subjects",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Leffler:1989:DIU,
  author =       "Samuel J. Leffler and Marshall Kirk McKusick and
                 Michael J. Karels and John S. Quarterman",
  title =        "The Design and Implementation of the {4.3BSD UNIX}
                 Operating System",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xxii + 471",
  year =         "1989",
  ISBN =         "0-201-06196-1",
  ISBN-13 =      "978-0-201-06196-3",
  LCCN =         "QA76.76.O63 D4741 1989",
  bibdate =      "Wed Dec 15 10:38:09 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  ZMnumber =     "0744.68006",
  acknowledgement = ack-nhfb,
  tableofcontents = "Part 1: Overview / 1 \\
                 1: History and Goals / 3 \\
                 1.1 History of the UNIX System / 3 \\
                 Origins / 3 \\
                 Research UNIX / 4 \\
                 AT\&T UNIX System III and System V / 6 \\
                 Other Organizations / 7 \\
                 Berkeley Software Distributions / 7 \\
                 UNIX in the World / 8 \\
                 1.2 BSD and Other Systems / 8 \\
                 The Influence of the User Community / 9 \\
                 1.3 Design Goals of 4BSD / 10 \\
                 4.2BSD Design Goals / 11 \\
                 4.3BSD Design Goals / 12 \\
                 Future Berkeley Releases / 12 \\
                 1.4 Release Engineering / 14 \\
                 References / 15 \\
                 2: Design Overview of 4.3BSD / 19 \\
                 2.1 UNIX Facilities and the Kernel / 19 \\
                 The Kernel / 20 \\
                 2.2 Kernel Organization / 20 \\
                 2.3 Kernel Services / 23 \\
                 2.4 Process Management / 23 \\
                 Signals / 25 \\
                 Process Groups / 26 \\
                 2.5 Memory Management / 26 \\
                 BSD Memory-Management Design Decisions / 27 \\
                 Memory Management Inside the Kernel / 28 \\
                 2.6 I/O System / 29 \\
                 Descriptors and I/O / 30 \\
                 Descriptor Management / 31 \\
                 Files / 32 \\
                 Devices / 33 \\
                 Socket IPC / 33 \\
                 Scatter/Gather I/O / 34 \\
                 2.7 Filesystem / 34 \\
                 2.8 Devices / 37 \\
                 2.9 Terminals / 38 \\
                 2.10 Interprocess Communication / 38 \\
                 2.11 Network Communication / 39 \\
                 2.12 Network Implementation / 40 \\
                 2.13 System Operation / 40 \\
                 Exercises / 41 \\
                 References / 41 \\
                 3: Kernel Services / 43 \\
                 3.1 Kernel Organization /43 \\
                 System Activities / 43 \\
                 Run-Time Organization / 44 \\
                 System Processes / 45 \\
                 Entry to the Kernel / 46 \\
                 Return from the Kernel / 47 \\
                 3.2 System Calls / 47 \\
                 Result Handling / 47 \\
                 Returning from a System Call / 48 \\
                 3.3 Traps and Interrupts / 49 \\
                 I/O Device Interrupts / 49 \\
                 Software Interrupts / 50 \\
                 3.4 Clock Interrupts / 50 \\
                 Timeouts / 51 \\
                 Process Scheduling / 53 \\
                 3.5 Timing / 53 \\
                 Real Time / 53 \\
                 Adjusting the Time / 53 \\
                 External Representation / 54 \\
                 Interval Time / 55 \\
                 Profiling / 55 \\
                 3.6 Process Management / 55 \\
                 3.7 User and Group Identifiers / 58 \\
                 Host Identifier / 60 \\
                 3.8 Resource Controls / 60 \\
                 Process Priorities / 60 \\
                 Resource Utilization / 61 \\
                 Resource Limits / 61 \\
                 Filesystem Quotas / 62 \\
                 3.9 System Operation / 62 \\
                 Accounting / 62 \\
                 Exercises / 63 \\
                 References / 64 \\
                 Part 2: Processes / 67 \\
                 4: Process Management / 69 \\
                 4.1 Introduction / 69 \\
                 Multiprogramming / 70 \\
                 Scheduling / 71 \\
                 4.2 Process State / 72 \\
                 The Proc Structure / 72 \\
                 The User Structure / 77 \\
                 Memory / 79 \\
                 The Text Structure / 79 \\
                 4.3 Context Switching / 79 \\
                 Process State / 80 \\
                 Low-Level Context Switching / 80 \\
                 Voluntary Context Switching / 81 \\
                 Intraprocess Context Switching / 83 \\
                 Synchronization / 84 \\
                 4.4 Process Scheduling / 86 \\
                 Calculations of Process Priority / 87 \\
                 Process-Priority Routines / 88 \\
                 Process Run Queues and Context Switching / 89 \\
                 4.5 Process Creation / 91 \\
                 4.6 Process Termination / 93 \\
                 4.7 Signals / 94 \\
                 Process Groups / 96 \\
                 Comparison with Other Systems / 97 \\
                 Changes to 4.3BSD Signals in POSIX / 99 \\
                 Posting a Signal / 99 \\
                 Delivering a Signal / 101 \\
                 Job Control / 102 \\
                 4.8 Process Debugging / 103 \\
                 Exercises / 105 \\
                 References / 107 \\
                 5: Memory Management / 109 \\
                 5.1 Terminology / 109 \\
                 Processes and Memory / 110 \\
                 Paging / 111 \\
                 Replacement Algorithms / 112 \\
                 Working-Set Model / 113 \\
                 Swapping / 113 \\
                 Secondary Storage / 114 \\
                 Advantages of Virtual Memory / 114 \\
                 Hardware Requirements for Virtual Memory / 114 \\
                 5.2 Evolution of 4.3BSD Memory Management / 115 \\
                 Version 7 UNIX / 115 \\
                 UNIX 32V / 116 \\
                 3BSD / 116 \\
                 4.1BSD / 117 \\
                 4.3BSD / 118 \\
                 5.3 VAX Memory-Management Hardware / 118 \\
                 VAX Virtual Address Space / 118 \\
                 VAX Page Tables / 119 \\
                 System-Address Translation / 120 \\
                 User-Address Translation / 121 \\
                 Page Faults / 122 \\
                 Translation Buffers / 124 \\
                 5.4 Management of Main Memory: The Core Map / 124 \\
                 Physical-to-Virtual Translation / 126 \\
                 Memory Free List / 126 \\
                 Synchronization / 126 \\
                 Text-Page Cache / 127 \\
                 Core-Map Limits / 127 \\
                 Memory-Allocation Routines / 127 \\
                 5.5 Management of Swap Space / 128 \\
                 5.6 Per-Process Resources / 129 \\
                 4.3BSD Process Virtual Address Space / 129 \\
                 Page Tables / 129 \\
                 Types of Page-Table Entries / 131 \\
                 Modified Pages / 134 \\
                 Text Page Tables / 134 \\
                 Swap Space / 134 \\
                 5.7 Creation of a New Process / 136 \\
                 Duplicating Kernel Resources / 136 \\
                 Duplicating the User Address Space / 137 \\
                 Implementation Issues / 138 \\
                 Creating a New Process Without Copying / 138 \\
                 5.8 Execution of a File / 140 \\
                 5.9 Change Process Size / 142 \\
                 5.10 Termination of a Process / 144 \\
                 5.11 Demand Paging / 145 \\
                 Fill-on-Demand Pages / 146 \\
                 Fill-on-Demand Klustering / 146 \\
                 Interaction with the Filesystem Cache / 147 \\
                 Pagein of Swapped Pages / 147 \\
                 5.12 Page Replacement / 149 \\
                 Global CLOCK Algorithm / 150 \\
                 The Paging Daemon. / 151 \\
                 Paging Parameters / 151 \\
                 Two-Handed Clock / 153 \\
                 Operation of Pageout / 153 \\
                 5.13 Swapping / 155 \\
                 The Swapping Process / 156 \\
                 Choosing a Process to Swap In / 156 \\
                 Involuntary Swapping / 157 \\
                 Choosing a Process to Swap Out / 158 \\
                 Swapout / 158 \\
                 Swapin / 159 \\
                 Swapping of Text Images / 160 \\
                 Exercises / 161 \\
                 References / 163 \\
                 Part 3: I/O System / 167 \\
                 6: I/O System Overview / 169 \\
                 6.1 I/O Mapping from User to Device / 169 \\
                 Character Devices / 170 \\
                 Block Devices / 171 \\
                 Socket-Interface Buffering / 172 \\
                 6.2 Descriptor Management and Services / 172 \\
                 Open File Table / 173 \\
                 Management of Descriptors / 175 \\
                 Descriptor Locking / 177 \\
                 Implementation of Locking / 178 \\
                 Multiplexing I/O on Descriptors / 179 \\
                 Implementation of Select / 181 \\
                 Moving Data Inside the Kernel / 184 \\
                 Exercises / 185 \\
                 References / 186 \\
                 7: The Filesystem / 187 \\
                 7.1 Structure and Overview / 187 \\
                 Directories / 187 \\
                 Links / 189 \\
                 Quotas / 191 \\
                 7.2 Overview of the Internal Filesystem / 191 \\
                 Allocating and Finding the Blocks on the Disk / 193 \\
                 7.3 Internal Structure and Redesign / 195 \\
                 New Filesystem Organization / 196 \\
                 Optimizing Storage Utilization / 198 \\
                 Filesystem Parameterization / 200 \\
                 Layout Policies / 201 \\
                 7.4 Filesystem Data Structures / 203 \\
                 Inode Management / 205 \\
                 Finding File Blocks / 206 \\
                 File-Block Allocation / 207 \\
                 7.5 Buffer Management / 208 \\
                 Implementation of Buffer Management / 211 \\
                 7.6 Quotas / 213 \\
                 7.7 Allocation Mechanisms / 217 \\
                 7.8 Translation of Filesystem Names / 219 \\
                 Exercises / 221 \\
                 References / 223 \\
                 8: Device Drivers / 225 \\
                 8.1 Overview / 225 \\
                 8.2 Device Drivers / 227 \\
                 I/O Queueing / 228 \\
                 Interrupt Handling / 229 \\
                 8.3 Block Devices / 229 \\
                 8.4 Character Devices / 230 \\
                 Raw Devices and Physical I/O / 231 \\
                 Character-Oriented Devices / 233 \\
                 Entry Points for Character Device Drivers / 233 \\
                 8.5 Autoconfiguration / 234 \\
                 Probing for Devices / 235 \\
                 Attaching a Device / 236 \\
                 Device Naming / 236 \\
                 8.6 UNIBUS Devices / 237 \\
                 The up Device Driver / 238 \\
                 Autoconfiguration Support / 239 \\
                 Logical-to-Device Mapping of I/O Requests / 242 \\
                 I/O Strategy / 243 \\
                 Disksort / 244 \\
                 Drive-Positioning Algorithm / 245 \\
                 Initiating an I/O Operation / 246 \\
                 Interrupt Handling / 247 \\
                 UNIBUS Adapter Support Routines / 249 \\
                 8.7 MASSBUS Devices / 253 \\
                 Autoconfiguration / 253 \\
                 I/O Strategy / 253 \\
                 Interrupt Handling / 254 \\
                 Exercises / 256 \\
                 9: Terminal Handling / 259 \\
                 9.1 Terminal Processing Modes / 259 \\
                 9.2 Line Disciplines / 260 \\
                 9.3 User Interface / 262 \\
                 9.4 The tty Structure / 263 \\
                 9.5 Process Groups and Terminal Control / 265 \\
                 9.6 C-lists / 266 \\
                 9.7 RS-232 and Modem Control / 267 \\
                 9.8 Terminal Operations / 268 \\
                 Open / 268 \\
                 Output Line Discipline / 268 \\
                 Output Top Half / 270 \\
                 Output Bottom Half / 271 \\
                 Input Bottom Half / 271 \\
                 Input Top Half / 273 \\
                 The stop Routine / 273 \\
                 The ioctl Routine / 274 \\
                 Modem Transitions / 275 \\
                 Closing Terminal Devices / 275 \\
                 9.9 Other Line Disciplines / 276 \\
                 Berknet / 276 \\
                 Serial Line IP Discipline / 276 \\
                 Graphics Tablet Discipline / 277 \\
                 9.10 Summary / 277 \\
                 Exercises / 277 \\
                 References / 278 \\
                 Part 4: Interprocess Communication / 279 \\
                 10: Interprocess Communication / 281 \\
                 10.1 Interprocess-Communication Model / 282 \\
                 Using Sockets / 284 \\
                 10.2 Implementation Structure and Overview / 288 \\
                 10.3 Memory Management / 289 \\
                 Mbufs / 289 \\
                 Storage-Management Algorithms / 291 \\
                 Mbuf Utility Routines / 292 \\
                 10.4 Data Structures / 292 \\
                 Communication Domains / 293 \\
                 Sockets / 294 \\
                 Socket Addresses / 296 \\
                 10.5 Connection Setup / 298 \\
                 10.6 Data Transfer / 300 \\
                 Transmitting Data / 301 \\
                 Receiving Data / 302 \\
                 Passing Access Rights / 304 \\
                 Access Rights in the UNIX Domain / 305 \\
                 10.7 Socket Shutdown / 306 \\
                 Exercises / 307 \\
                 References / 309 \\
                 11: Network Communication / 311 \\
                 11.1 Internal Structure / 312 \\
                 Data Flow / 312 \\
                 Communication Protocols / 314 \\
                 Network Interfaces / 315 \\
                 11.2 Socket-to-Protocol Interface / 318 \\
                 Protocol User-Request Routine / 318 \\
                 Internal Requests / 321 \\
                 Protocol Control-Output Routine / 322 \\
                 11.3 Protocol-Protocol Interface / 322 \\
                 proutput / 323 \\
                 prinput / 323 \\
                 prctlinput / 323 \\
                 11.4 Protocol-Network-Interface Interface / 324 \\
                 Packet Transmission / 324 \\
                 Packet Reception / 325 \\
                 11.5 Routing / 327 \\
                 Routing Tables / 328 \\
                 Routing Redirects / 329 \\
                 Routing-Table Interface / 330 \\
                 User-Level Routing Policies / 330 \\
                 11.6 Buffering and Congestion Control / 331 \\
                 Protocol Buffering Policies / 331 \\
                 Queue Limiting / 332 \\
                 11.7 Raw Sockets / 332 \\
                 Control Blocks / 332 \\
                 Input Processing / 333 \\
                 Output Processing / 334 \\
                 11.8 Additional Network Subsystem Topics / 334 \\
                 Out-of-Band Data / 334 \\
                 Address Resolution Protocol / 335 \\
                 VAX UNIBUS Interfaces / 336 \\
                 Trailer Protocols / 338 \\
                 Exercises / 340 \\
                 References / 341 \\
                 12: Network Protocols / 343 \\
                 12.1 DARPA Internet Network Protocols / 343 \\
                 Internet Addresses / 345 \\
                 Subnets / 346 \\
                 Broadcast Addresses / 347 \\
                 Internet Ports and Associations / 348 \\
                 Protocol Control Blocks / 348 \\
                 12.2 User Datagram Protocol (UDP) / 350 \\
                 Initialization / 350 \\
                 Output / 350 \\
                 Input / 351 \\
                 Control Operations / 352 \\
                 12.3 Internet Protocol (IP) / 352 \\
                 Output / 353 \\
                 Input / 354 \\
                 Forwarding / 356 \\
                 12.4 Transmission Control Protocol (TCP) / 357 \\
                 TCP Connection States / 358 \\
                 Sequence Variables / 360 \\
                 12.5 TCP Algorithms / 362 \\
                 Timers / 363 \\
                 Estimation of Round-Trip Time / 365 \\
                 Connection Establishment / 366 \\
                 Connection Shutdown / 367 \\
                 12.6 TCP Input Processing / 368 \\
                 12.7 TCP Output Processing / 371 \\
                 Sending Data / 371 \\
                 Avoidance of the Silly-Window Syndrome / 372 \\
                 Avoidance of Small Packets / 373 \\
                 Window Updates / 374 \\
                 Retransmit State / 375 \\
                 Source-Quench Processing and Congestion Control / 375
                 \\
                 Slow Start / 376 \\
                 Avoidance of Congestion with Slow Start / 377 \\
                 12.8 Internet Control Message Protocol (ICMP) / 378 \\
                 12.9 ARPANET Host Interface / 380 \\
                 12.10 Xerox Network Systems Communication Domain (XNS)
                 / 381 \\
                 XNS Control Operations / 383 \\
                 12.11 Summary / 384 \\
                 Creating a Communication Channel / 384 \\
                 Sending and Receiving Data / 385 \\
                 Terminating Data Transmission and/or Reception / 386
                 \\
                 Exercises / 387 \\
                 References / 389 \\
                 Part 5: System Operation / 391 \\
                 13: System Startup / 393 \\
                 13.1 Overview / 393 \\
                 13.2 Bootstrapping / 394 \\
                 13.3 The boot Program / 394 \\
                 VAX Console Media / 396 \\
                 Kernel Initialization / 396 \\
                 Assembly-Language Startup / 397 \\
                 Machine-Dependent Initialization / 398 \\
                 Message Buffer / 399 \\
                 System Data Structures / 399 \\
                 Memory Allocator / 400 \\
                 Autoconfiguration / 400 \\
                 Machine-Independent Initialization / 403 \\
                 13.4 User-Level Initialization / 405 \\
                 /etc/init / 406 \\
                 /etc/rc / 406 \\
                 /etc/getty / 407 \\
                 /bin/login / 407 \\
                 13.5 System Startup Topics / 407 \\
                 Kernel Configuration / 408 \\
                 System Shutdown and Autoreboot / 409 \\
                 System Debugging / 410 \\
                 Exercises / 410 \\
                 References / 411 \\
                 Glossary / 413 \\
                 Index / 451",
}

@Book{Lehey:2003:CFD,
  author =       "Greg Lehey",
  title =        "The Complete {FreeBSD}: Documentation from the
                 Source",
  publisher =    pub-ORCP,
  address =      pub-ORCP:adr,
  edition =      "Fourth",
  pages =        "xxxiii + 679",
  year =         "2003",
  ISBN =         "0-596-00516-4 (paperback), 0-596-80213-7 (e-book)",
  ISBN-13 =      "978-0-596-00516-0 (paperback), 978-0-596-80213-4
                 (e-book)",
  LCCN =         "QA76.76.O63 L43 2003",
  bibdate =      "Tue May 13 15:31:58 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  price =        "US\$44.09, CAN\$69.95, UK\pounds 31.95",
  URL =          "http://press.oreilly.com/commpress.html;
                 http://www.oreilly.com/catalog/cfreebsd/desc.html",
  abstract =     "FreeBSD is by far the most popular version of BSD, the
                 legendary operating system that has contributed a great
                 deal to every version of Unix in use today (including
                 Mac OS X). Originally a community effort by the
                 University of California at Berkeley, FreeBSD was aimed
                 at making Unix a little friendlier and easier to use.
                 By the time other free operating systems came along,
                 BSD was firmly established and very reliable. And it
                 continues to be today. For seven years, the FreeBSD
                 community has relied on Greg Lehey's classic,
                 \booktitle{The Complete FreeBSD}, to guide them through
                 its configuration and \ldots{}",
  acknowledgement = ack-nhfb,
  tableofcontents = "Foreword / xxv \\
                 Preface / xxvii \\
                 1. Introduction / 1 \\
                 2: Before you install / 25 \\
                 3: Quick installation / 47 \\
                 4: Shared OS installation / 51 \\
                 5: Installing FreeBSD / 59 \\
                 6: Post-installation configuration / 91 \\
                 7: The tools of the trade / 111 \\
                 8: Taking control / 143 \\
                 9: The Ports Collection / 167 \\
                 10: File systems and devices / 181 \\
                 11: Disks / 199 \\
                 12: The Vinum Volume Manager / 221 \\
                 13: Writing CD-Rs / 243 \\
                 14: Tapes, backups and floppy disks / 251 \\
                 15: Printers / 263 \\
                 16: Networks and the Internet / 277 \\
                 17: Configuring the local network / 297 \\
                 18: Connecting to the Internet / 315 \\
                 19: Serial communications / 325 \\
                 20: Configuring PPP / 339 \\
                 21: The Domain Name Service / 363 \\
                 22: Firewalls, IP aliasing and proxies / 385 \\
                 23: Network debugging / 401 \\
                 24: Basic network access: clients / 417 \\
                 25: Basic network access: servers / 447 \\
                 26: Electronic mail: clients / 471 \\
                 27: Electronic mail: servers / 491 \\
                 28: XFree86 in depth / 507 \\
                 29: Starting and stopping the system / 527 \\
                 30: FreeBSD configuration files / 551 \\
                 31: Keeping up to date / 581 \\
                 32: Updating the system software / 593 \\
                 33: Custom kernels / 607 \\
                 A: Bibliography / 627 \\
                 B: The evolution of FreeBSD / 633 \\
                 Index",
}

@Book{Lehto:1998:MBH,
  author =       "Olli Lehto",
  title =        "Mathematics Without Borders: a History of the
                 {International Mathematical Union}",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xvi + 399",
  year =         "1998",
  ISBN =         "0-387-98358-9",
  ISBN-13 =      "978-0-387-98358-5",
  LCCN =         "QA1 .L42 1998",
  bibdate =      "Mon Dec 06 18:24:16 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$35.00",
  abstract =     "The history of international mathematical co-operation
                 over the last hundred years --- from the first
                 international congress in 1897 to plans for the World
                 Mathematical Year 2000 --- is a surprisingly compelling
                 story. For reflected in the history of the
                 International Mathematical Union (IMU) is all the
                 strife among world powers, as well as aspirations for
                 co-operation among nations in an increasingly
                 interdependent world. As early as the 1920s, the IMU
                 embraced principles of political neutrality, inviting
                 every national mathematical organisation to join, and
                 this principle of non-discrimination, while sometimes
                 sorely tried, has held the IMU in good stead. A number
                 of issues --- the Cold War, the conflict between the
                 Peoples Republic of China and Taiwan, a divided
                 Germany, problems in the emerging nations of Africa ---
                 at times led to attempts to influence the IMU Executive
                 Committee in its decisions regarding membership,
                 location of international congresses, committee
                 assignments, handling of protests, and awarding the
                 coveted Fields Medals. Yet throughout, the IMU has
                 sponsored international congresses around the world,
                 and Professor Lehtos gripping story is one of
                 individuals, among them many of the great
                 mathematicians of our century, united in the common
                 purpose of advancing their science, told against the
                 backdrop of world events.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "1 Prologue to the History of the IMU \\
                 1.1 Ideas of International Mathematical Cooperation
                 Awaken \\
                 1.2 Formation of Institutionalized Congresses in \\
                 1.3 International Mathematical Activities Before World
                 War I \\
                 1.4 Politics Enters into International Cooperation in
                 Science \\
                 2 The Old IMU (1920--1932) \\
                 2.1 The Foundation of the IMU in the Aftermath of World
                 War I \\
                 2.2 Mounting Opposition Against the IMU's Policy of
                 Exclusion \\
                 2.3 Transformation of the International Research
                 Council into the International Council of Scientific
                 Unions \\
                 2.4 The IMU Separates from the Congresses \\
                 2.5 The IMU Adrift \\
                 2.6 Suspension of the IMU \\
                 3 Mathematical Cooperation Without the IMU (1933--1939)
                 \\
                 3.1 The Fields Medals \\
                 3.2 Collaboration in Mathematical Education \\
                 3.3 A Failed Attempt to Found a New IMU \\
                 3.4 The Oslo Congress in \\
                 4 Foundation of the New IMU (1945--1951) 73 \\
                 4.1 American Declaration of Universality \\
                 4.2 Preparation of the IMU Statutes \\
                 4.3 The Rebirth of the IMU \\
                 4.4 ICM--1950 at Harvard: American Tour de Force \\
                 5 The IMU Takes Shape (1952--1954) \\
                 5.1 The First General Assembly in Rome in \\
                 5.2 The Secretariat of the IMU \\
                 5.3 Starting the IMU's Activities \\
                 5.4 ICMI Becomes Attached to the Union \\
                 5.5 The 1954 General Assembly in the Netherlands \\
                 5.6 ICM--1954 in Amsterdam: Comeback of the Old World
                 \\
                 6 Expansion of the IMU (1955--1958) 121 \\
                 6.1 Membership of Socialist Countries \\
                 6.2 The Chinese Problem Emerges \\
                 6.3 The World Directory of Mathematicians \\
                 6.4 Extension of Mathematical Activities \\
                 7 The IMU and International Congresses (1958--1962) \\
                 7.1 The 1958 General Assembly in Scotland \\
                 7.2 ICM--1958 in Edinburgh \\
                 7.3 Why Organize Large ICMs? \\
                 7.4 The IMU Becomes a Partner of the ICMs \\
                 7.5 The 1962 General Assembly in Sweden \\
                 7.6 ICM-1962 in Stockholm: An IMU Breakthrough \\
                 8 Consolidation of the IMU (1963--1970) \\
                 8.1 The USSR Hosts the 1966 General Assembly \\
                 8.2 ICM-1966 in Moscow: East and West Meet \\
                 8.3 The 1970 General Assembly in France \\
                 8.4 ICM-1970 in Nice \\
                 9 North-South and East-West Connections (1971--1978)
                 \\
                 9.1 New Programs and Trends \\
                 9.2 The 1974 General Assembly in Canada \\
                 9.3 ICM-1974 in Vancouver: Disagreement About the
                 Program \\
                 9.4 How to Make an ICM \\
                 9.5 The 1978 General Assembly in Finland \\
                 9.6 ICM-1978 in Helsinki \\
                 10 Politics Interferes with the IMU (1979--1986) \\
                 10.1 The IMU and the Soviet National Committee \\
                 10.2 Martial Law in the Host Country of the Congress
                 \\
                 10.3 The 1982 General Assembly in Poland \\
                 10.4 ICM-1983 in Warsaw: Mathematics Above Politics \\
                 10.5 The 1986 Presidential Election \\
                 10.6 China Joins the IMU \\
                 11 The IMU and Related Organizations \\
                 11.1 The IMU as a Member of ICSU \\
                 11.2 ICMI as a Subcommission of the IMU \\
                 11.3 Commission on Development and Exchange \\
                 11.4 Problems in Africa \\
                 11.5 The IMU and the History of Mathematics \\
                 11.6 The IMU and Applied Mathematics \\
                 12 The IMU in a Changing World (1986--1990) \\
                 12.1 The 1986 General Assembly in California \\
                 12.2 ICM-1986 at Berkeley \\
                 12.3 Japan Hosts the 1990 General Assembly \\
                 12.4 ICM-1990 in Kyoto \\
                 12.5 World Mathematical Year 2000 \\
                 1 Members of the IMU \\
                 2 General Assemblies of the IMU \\
                 3 Executive Committees of the IMU \\
                 4 Meetings of the IMU Executive Committees \\
                 5 Central Committees of the International Commission on
                 the Teaching of Mathematics \\
                 6 Executive Committees of ICMI \\
                 7 Commissions on Development and Exchange \\
                 8 International Congresses of Mathematicians \\
                 9 Fields Medals \\
                 10 Rolf Nevanlinna Prizes \\
                 11 Union Lectures \\
                 12 Finances \\
                 13 Archives (as of June 1996) \\
                 Notes",
}

@Book{Leighton:2000:TBR,
  author =       "Ralph Leighton",
  title =        "{Tuva} Or Bust!: {Richard Feynman}'s Last Journey",
  publisher =    pub-NORTON,
  address =      pub-NORTON:adr,
  pages =        "260",
  year =         "2000",
  ISBN =         "0-393-32069-3 (paperback), 0-393-02953-0",
  ISBN-13 =      "978-0-393-32069-5 (paperback), 978-0-393-02953-6",
  LCCN =         "QC16.F49 L45 2000",
  bibdate =      "Mon Dec 12 15:40:26 MST 2005",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/f/feynman-richard-p.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "In 1930s, a young stamp collector named Richard
                 Feynman coveted the unusually exotic stamps from a land
                 called Tannu Tuva, ringed by mountains deep in Siberia,
                 just beyond Outer Mongolia.Forty years later, the
                 maverick Nobel Prize-winning physicist challenged his
                 side-kick, fellow drummer and geography enthusiast
                 Ralph Leighton: ``Whatever happened to Tannu Tuva?''
                 Thus began a poignant and funny decade-long adventure.
                 When the pair found Tuvas capital on the map,they were
                 hooked. ``Any place that's spelled K-Y-Z-Y-L,'' Feynman
                 exclaimed, ``has just got to be interesting!'' In their
                 efforts to reach Tuva, Leighton and Feynman learned of
                 its resident shamanic shepherds who revere the Dalai
                 Lama, discovered the wonders of ``throat-singing'',and
                 brought to the United States the largest archaeological
                 exhibition ever from the Soviet Union.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "Feynman, Richard Phillips; Travel; Russia
                 (Federation); Tuva; Tuva (Russia); Description and
                 travel; Physicists; United States; Biography",
  tableofcontents = "To the Reader / 7 \\
                 1: There is no such country / 13 \\
                 2: Forty-five snowy I / 18 \\
                 3: Mysterious melodies / 39 \\
                 4: Hail to the chief! / 62 \\
                 5: We appear in the center of Asia / 74 \\
                 6: Three Americans reach Tuva / 90 \\
                 7: Meeting in Moscow / 104 \\
                 8: Amateur ambassadors / 130 \\
                 9: Clowns or con men? / 148 \\
                 10: The Keller accord / 168 \\
                 11: The trip is arranged / 185 \\
                 12: Catalina cowboys / 203 \\
                 13: The invitation arrives / 214 \\
                 14: Epilogue / 221 Reflections 2000 / 231 \\
                 Painting of Richard Feynman / 236 \\
                 Appendix A: Protocol / 237 \\
                 Appendix B: Welcome by Richard Feynman / 247 \\
                 Appendix C: Friends of Tuva / 251 \\
                 Index / 253",
}

@Book{Lesk:1997:PDL,
  author =       "Michael Lesk",
  title =        "Practical Digital Libraries: Books, Bytes, and Bucks",
  publisher =    pub-MORGAN-KAUFMANN,
  address =      pub-MORGAN-KAUFMANN:adrnew,
  pages =        "xxii + 297 + 11",
  year =         "1997",
  ISBN =         "1-55860-459-6 (paperback)",
  ISBN-13 =      "978-1-55860-459-9 (paperback)",
  LCCN =         "Z692.C65 L47 1997",
  bibdate =      "Thu Sep 11 07:09:14 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$49.95",
  series =       "The Morgan Kaufmann series in multimedia information
                 and systems",
  URL =          "http://www.loc.gov/catdir/description/els032/97022069.html;
                 http://www.loc.gov/catdir/toc/els032/97022069.html",
  abstract =     "Offers a wide ranging overview of digital libraries
                 currently available; analyzes economic and intellectual
                 property issues in the emerging digital environment and
                 show how text, images and audio and video can be
                 represented, distributed, used and collected as forms
                 of knowledge.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "Libraries; United States; Special collections;
                 Computer files; Digital libraries",
  tableofcontents = "1: Evolution of Libraries \\
                 2: Text Access Methods \\
                 3: Images of Pages \\
                 4: Multimedia Storage and Access \\
                 5: Knowledge Representation Methods \\
                 6: Distribution \\
                 7: Usability and Retrieval Evaluation \\
                 8: Collections and Preservation \\
                 9: Economics \\
                 10: Intellectual Property Rights \\
                 11: International Activities \\
                 12: Future: Ubiquity, Diversity, Creativity, and Public
                 Policy",
}

@InCollection{Lesk:lex,
  author =       "Michael E. Lesk and Eric Schmidt",
  booktitle =    "{UNIX} Programmer's Manual",
  title =        "Lex: {A} Lexical Analyzer Generator",
  volume =       "2",
  publisher =    pub-HRW,
  address =      pub-HRW:adr,
  pages =        "388--400",
  year =         "1979",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "AT\&T Bell Laboratories Technical Report in 1975.",
  acknowledgement = ack-nhfb,
}

@Book{Level:1995:PTF,
  author =       "Jeff Level and Bruce Newman and Brenda Newman",
  title =        "Precision Type Font Reference Guide, Version 5.0",
  publisher =    "Precision Type",
  address =      "Commack, NY, USA",
  pages =        "xxv + 653",
  year =         "1995",
  ISBN =         "0-9646252-0-2",
  ISBN-13 =      "978-0-9646252-0-4",
  LCCN =         "Z250.7 .P74 1995",
  bibdate =      "Wed Feb 28 15:00:20 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/font.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  keywords =     "Printing --- Specimens --- Handbooks, manuals, etc.;
                 Type and type-founding --- Handbooks, manuals, etc.",
}

@Book{Level:2000:PTF,
  author =       "Jeff Level and Bruce Newman and Brenda Newman",
  title =        "Precision Type Font Reference Guide, Version 5.0",
  publisher =    pub-HARTLEY-MARKS,
  address =      pub-HARTLEY-MARKS:adr,
  pages =        "xxv + 653",
  year =         "2000",
  ISBN =         "0-88179-182-2",
  ISBN-13 =      "978-0-88179-182-2",
  LCCN =         "Z250.7 .P74 2000",
  bibdate =      "Thu Apr 12 10:59:49 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/font.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  note =         "Republication of \cite{Level:1995:PTF}.",
  price =        "US\$39.95, CDN\$59.95",
  acknowledgement = ack-nhfb,
  keywords =     "Printing --- Specimens --- Handbooks, manuals, etc.;
                 Type and type-founding --- Handbooks, manuals, etc.",
}

@Book{Levin:2016:BHB,
  author =       "Janna Levin",
  title =        "Black hole blues: and other songs from outer space",
  publisher =    pub-KNOPF,
  address =      pub-KNOPF:adr,
  pages =        "241",
  year =         "2016",
  ISBN =         "0-307-95819-1 (hardcover), 0-307-94848-X (paperback)",
  ISBN-13 =      "978-0-307-95819-8 (hardcover), 978-0-307-94848-9
                 (paperback)",
  LCCN =         "QC179 .L48 2016",
  bibdate =      "Thu Jan 18 11:19:16 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy1605/2015046692-b.html;
                 http://www.loc.gov/catdir/enhancements/fy1605/2015046692-d.html",
  abstract =     "In 1916, Einstein became the first to predict the
                 existence of gravitational waves: sounds without a
                 material medium generated by the unfathomably
                 energy-producing collision of black holes. Now, Janna
                 Levin, herself an astrophysicist, recounts the story of
                 the search, over the last fifty years, for these
                 elusive waves --- a quest that has culminated in the
                 creation of the most expensive project ever funded by
                 the National Science Foundation (\$1 billion-plus). She
                 makes clear how the waves are created in the cosmic
                 collision of black holes, and why the waves can never
                 be detected by telescope. And, most revealingly, she
                 delves into the lives and fates of the four scientists
                 currently engaged in --- and obsessed with ---
                 discerning this soundtrack of the universe's history.
                 Levin's account of the surprises, disappointments,
                 achievements, and risks of this unfolding story
                 provides us with a uniquely compelling and intimate
                 portrait of the people and processes of modern
                 science.",
  acknowledgement = ack-nhfb,
  subject =      "Gravitational waves; Black holes (Astronomy)",
  tableofcontents = "When black holes collide \\
                 High fidelity \\
                 Natural resources \\
                 Culture shock \\
                 Joe Weber \\
                 Prototypes \\
                 The Troika \\
                 The climb \\
                 Weber and Trimble \\
                 LHO \\
                 Skunkworks \\
                 Gambling \\
                 Rashomon \\
                 LLO \\
                 Little cave on Figueroa \\
                 The race is on",
}

@Book{Levine:1992:LY,
  author =       "John R. Levine and Tony Mason and Doug Brown",
  title =        "{\tt lex} \& {\tt yacc}",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  edition =      "Second",
  pages =        "xxii + 366",
  year =         "1992",
  ISBN =         "1-56592-000-7",
  ISBN-13 =      "978-1-56592-000-2",
  LCCN =         "QA76.76.U84M37 1992",
  bibdate =      "Wed Dec 15 10:38: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\$29.95",
  URL =          "http://www.oreilly.com/catalog/9781565920002;
                 http://www.oreilly.com/catalog/lex",
  acknowledgement = ack-nhfb,
  tableofcontents = "Preface \\
                 Lex and Yacc \\
                 Using Lex \\
                 Using Yacc \\
                 A Menu Generation Language \\
                 Parsing SQL \\
                 A Reference for Lex Specifications \\
                 A Reference for Yacc Grammars \\
                 Yacc Ambiguities and Conflicts \\
                 Error Reporting and Recovery \\
                 AT\&T; Lex \\
                 AT\&T; Yacc \\
                 Berkeley Yacc \\
                 GNU Bison \\
                 Flex \\
                 MKS lex and yacc \\
                 Abraxas lex and yacc \\
                 POSIX lex and yacc \\
                 MGL Compiler Code \\
                 SQL Parser Code \\
                 SQL Parser Code \\
                 Glossary \\
                 Bibliography",
}

@Book{Levy:1980:CPA,
  author =       "Henry M. Levy and Richard H. {Eckhouse, Jr.}",
  title =        "Computer Programming and Architecture --- the
                 {VAX-11}",
  publisher =    pub-DP,
  address =      pub-DP:adr,
  pages =        "xxi + 407",
  year =         "1980",
  ISBN =         "0-932376-07-X",
  ISBN-13 =      "978-0-932376-07-7",
  LCCN =         "QA76.8 .V37 L48 1980",
  bibdate =      "Wed Dec 15 10:38:14 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  subject =      "VAX-11 (Computer); Programming; Assembly languages
                 (Electronic computers); Computer architecture; VAX-11
                 (Ordinateur); Programmation; Langage assembleur
                 (Langage de programmation); Ordinateurs; Architecture;
                 Assembly languages (Electronic computers); Computer
                 architecture; Programming; Programmeren (computers);
                 Computerarchitectuur; Computerarchitektur;
                 Programmierung; VAX 11; VAX-11 (Computer) ---
                 Programming; Assembler language (Computer program
                 language)",
  tableofcontents = "Part 1: The user architecture \\
                 Architecture and implementation \\
                 Computer structures and elementary VAX-11 programming
                 \\
                 Instruction and addressing fundamentals \\
                 More advanced programming techniques \\
                 Data types and data structures \\
                 Comparative architectures \\
                 Part 2: The system architecture \\
                 Physical input and output \\
                 The support of an operating system \\
                 The structure of a VAX-11 operating system \\
                 The operating system interface \\
                 The efficient implementation of an architecture",
}

@Book{Levy:2019:LIT,
  author =       "Buddy Levy",
  title =        "Labyrinth of Ice: the Triumphant and Tragic {Greely}
                 Polar Expedition",
  publisher =    "St. Martin's Press",
  address =      "New York, NY, USA",
  pages =        "xviii + 376 + 16",
  year =         "2019",
  ISBN =         "1-250-18219-0 (hardcover), 1-250-18220-4 (e-book)",
  ISBN-13 =      "978-1-250-18219-7 (hardcover), 978-1-250-18220-3
                 (e-book)",
  LCCN =         "G670 1881 .L48 2019",
  bibdate =      "Sat Apr 25 16:56:37 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "Based on the author's exhaustive research, the
                 incredible true story of the Greely Expedition, one of
                 the most harrowing adventures in the annals of polar
                 exploration. In July 1881, Lt. A. W. Greely and his
                 crew of 24 scientists and explorers were bound for the
                 last region unmarked on global maps. Their goal:
                 Farthest North. What would follow was one of the most
                 extraordinary and terrible voyages ever made. Greely
                 and his men confronted every possible challenge-vicious
                 wolves, sub-zero temperatures, and months of total
                 darkness-as they set about exploring one of the most
                 remote, unrelenting environments on the planet. In May
                 1882, they broke the 300-year-old record, and returned
                 to camp to eagerly await the resupply ship scheduled to
                 return at the end of the year. Only nothing came. 250
                 miles south, a wall of ice prevented any rescue from
                 reaching them. Provisions thinned and a second winter
                 descended. Back home, Greely's wife worked tirelessly
                 against government resistance to rally a rescue
                 mission. Months passed, and Greely made a drastic
                 choice: he and his men loaded the remaining provisions
                 and tools onto their five small boats, and pushed off
                 into the treacherous waters. After just two weeks,
                 dangerous floes surrounded them. Now new dangers
                 awaited: insanity, threats of mutiny, and cannibalism.
                 As food dwindled and the men weakened, Greely's
                 expedition clung desperately to life. Labyrinth of Ice
                 tells the true story of the heroic lives and deaths of
                 these voyagers hell-bent on fame and fortune --- at any
                 cost --- and how their journey changed the world.",
  acknowledgement = ack-nhfb,
  author-dates = "1960--",
  subject =      "Greely, A. W; (Adolphus Washington); Arctic regions;
                 Discovery and exploration; American",
  subject-dates = "1844--1935",
}

@Book{Lewine:1991:PPG,
  author =       "Donald A. Lewine",
  title =        "{POSIX} programmer's guide: writing portable {UNIX}
                 programs with the {POSIX.1} standard",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xxvii + 607",
  year =         "1991",
  ISBN =         "0-937175-73-0",
  ISBN-13 =      "978-0-937175-73-6",
  LCCN =         "QA76.76.O63 L487 1991b",
  bibdate =      "Wed Nov 13 14:58:22 1996",
  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/standard.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  note =         "March 1994 printing with corrections, updates, and
                 December 1991 Appendix G.",
  price =        "US\$34.95",
  abstract =     "Most UNIX systems today are POSIX compliant because
                 the federal government requires it for its purchases.
                 Given the manufacturer's documentation, however, it can
                 be difficult to distinguish system-specific features
                 from those features defined by POSIX. The POSIX
                 Programmer's Guide, intended as an explanation of the
                 POSIX standard and as a reference for the POSIX.1
                 programming library, helps you write more portable
                 programs.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Introduction to POSIX and portability \\
                 Developing POSIX applications \\
                 Standard file and terminal I/O \\
                 Files and directories \\
                 Advanced file operations \\
                 Working with processes \\
                 Obtaining information at run-time \\
                 Terminal I/O \\
                 POSIX and standard C \\
                 Porting to far-off lands \\
                 Library functions",
}

@Book{Lewis:1961:T,
  author =       "Gilbert Newton Lewis and Merle Randall",
  title =        "Thermodynamics",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  edition =      "Second",
  pages =        "xii + 723",
  year =         "1961",
  LCCN =         "QC311 .L4 1961",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Revised by Kenneth S. Pitzer and Leo Brewer",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Lewis:2017:FUL,
  author =       "Geraint F. Lewis and Luke A. Barnes and Brian
                 Schmidt",
  title =        "A fortunate universe: life in a finely-tuned cosmos",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xvii + 373",
  year =         "2017",
  DOI =          "https://doi.org/10.1017/CBO9781316661413",
  ISBN =         "1-107-15661-0 (hardcover), 1-316-66141-5 (e-book)",
  ISBN-13 =      "978-1-107-15661-6 (hardcover), 978-1-316-66141-3
                 (e-book)",
  LCCN =         "Q172.5.C45 L4845 2017",
  bibdate =      "Sat Apr 1 16:47:01 MDT 2017",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "Over the last forty years, scientists have uncovered
                 evidence that if the Universe had been forged with even
                 slightly different properties, life as we know it ---
                 and life as we can imagine it --- would be impossible.
                 Join us on a journey through how we understand the
                 Universe, from its most basic particles and forces, to
                 planets, stars and galaxies, and back through cosmic
                 history to the birth of the cosmos. Conflicting notions
                 about our place in the Universe are defined, defended
                 and critiqued from scientific, philosophical and
                 religious viewpoints. The authors' engaging and witty
                 style addresses what fine-tuning might mean for the
                 future of physics and the search for the ultimate laws
                 of nature. Tackling difficult questions and providing
                 thought-provoking answers, this volumes challenges us
                 to consider our place in the cosmos, regardless of our
                 initial convictions.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  review-url =   "http://mathscholar.org/is-the-universe-fine-tuned-for-intelligent-life",
  subject =      "Pattern formation (Physical sciences); Pattern
                 formation (Biology); Life; Origin; Universe; Cosmology;
                 Philosophy",
  tableofcontents = "A conversation on fine-tuning \\
                 I'm only human! \\
                 Can you feel the force? \\
                 Energy and entropy \\
                 The universe is expanding \\
                 All bets are off! \\
                 A dozen (or so) reactions to fine-tuning \\
                 A conversation continued",
}

@Book{Libes:1989:LU,
  author =       "Don Libes and Sandy Ressler",
  title =        "Life with {UNIX}",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xx + 346",
  year =         "1989",
  ISBN =         "0-13-536657-7",
  ISBN-13 =      "978-0-13-536657-8",
  LCCN =         "QA76.76.O63 L52 1989",
  bibdate =      "Wed Dec 15 10:38:15 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  URL =          "http://minnie.tuhs.org/Archive/Documentation/Books/",
  acknowledgement = ack-nhfb,
  tableofcontents = "UNIX history \\
                 UNIX present \\
                 UNIX future \\
                 Printed information \\
                 Nonprinted information \\
                 The user's environment \\
                 The programmer's environment \\
                 The administrator's environment \\
                 UNIX underground \\
                 UNIX services \\
                 UNIX applications \\
                 UNIX meets the real world",
}

@Book{Libes:1994:EET,
  author =       "Don Libes",
  title =        "Exploring Expect: {A Tcl}-based Toolkit for Automating
                 Interactive Programs",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xxxiii + 566",
  month =        dec,
  year =         "1994",
  ISBN =         "1-56592-090-2",
  ISBN-13 =      "978-1-56592-090-3",
  LCCN =         "QA76.755 .L52 1995",
  bibdate =      "Sat Dec 02 17:04:17 1995",
  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;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  price =        "US\$29.95",
  URL =          "http://www.ora.com/gnn/bus/ora/item/expect.html;
                 http://www.oreilly.com/catalog/9781565920903;
                 http://www.oreilly.com/catalog/expect",
  abstract =     "Written by the author of Expect, this is the first
                 book to explain how this new part of the UNIX toolbox
                 can be used to automate Telnet, FTP, passwd, rlogin,
                 and hundreds of other interactive applications. Based
                 on Tcl (Tool Command Language), Expect lets you
                 automate interactive applications that have previously
                 been extremely difficult to handle with any scripting
                 language.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Dedication \\
                 Preface \\
                 How To Read This Book \\
                 1: Intro --- What Is Expect? \\
                 2: Tcl --- Introduction And Overview \\
                 3: Getting Started With Expect \\
                 4: Glob Patterns And Other Basics \\
                 5: Regular Expressions \\
                 6: Patterns, Actions, And Limits \\
                 7: Debugging Patterns And Controlling Output \\
                 8: Handling A Process And A User \\
                 9: The Expect Program \\
                 10: Handling Multiple Processes \\
                 11: Handling Multiple Processes Simultaneously \\
                 12: Send \\
                 13: Spawn \\
                 14: Signals \\
                 15: Interact \\
                 16: Interacting With Multiple Processes \\
                 17: Background Processing \\
                 18: Debugging Scripts \\
                 19: Expect + Tk = Expectk \\
                 20: Extended Examples \\
                 21: Expect, C, And C++ \\
                 22: Expect As Just Another Tcl Extension \\
                 23: Miscellaneous \\
                 Appendix --- Commands and Variables",
}

@Book{Linderberg:1973:PQC,
  author =       "Jan Linderberg and Yngve {\"O}hrn",
  title =        "Propagators in Quantum Chemistry",
  volume =       "3",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "v + 151",
  year =         "1973",
  ISBN =         "0-12-450350-0",
  ISBN-13 =      "978-0-12-450350-2",
  LCCN =         "QD462.L56",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Monographs in Theoretical Chemistry",
  acknowledgement = ack-nhfb,
  tableofcontents = "Preface / v \\
                 1: The Purpose of Propagators in Quantum Chemistry / 1
                 \\
                 2: Differential Equations and their Green's Functions /
                 3 \\
                 3: Schr{\"o}dinger's Equations and their Green's
                 Functions / 10 \\
                 4: Fermion Operators / 18 \\
                 5: Double-time Green's Functions / 26 \\
                 6: Simple Applications / 31 \\
                 7: Aspects of the Hartree--Fock Approximation / 39 \\
                 8: The Atomic Central Field Problem / 50 \\
                 9: Atomic and Molecular Orbitals / 74 \\
                 10: The Model Hamiltonian of Pariser, Parr and Pople /
                 90 \\
                 11: Diagrammatic Expansions. Temperature Dependent
                 Perturbation Theory / 113 \\
                 12: Description of Some Processes Involving Photons /
                 129 \\
                 13: Nuclear Displacements, Nuclear Spins and Magnetic
                 Fields / 137 \\
                 Subject Index / 149",
}

@Book{Linderberg:2004:PQC,
  author =       "Jan Linderberg and Yngve {\"O}hrn",
  title =        "Propagators in Quantum Chemistry",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  edition =      "Second",
  pages =        "vii + 267",
  year =         "2004",
  DOI =          "https://doi.org/10.1002/0471721549",
  ISBN =         "0-471-66257-7",
  ISBN-13 =      "978-0-471-66257-0",
  LCCN =         "QD462 L56 2004",
  bibdate =      "Mon Feb 4 08:40:38 MST 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Theoretical chemistry",
  URL =          "http://catdir.loc.gov/catdir/description/wiley041/2003069509.html;
                 http://catdir.loc.gov/catdir/toc/wiley041/2003069509.html;
                 https://onlinelibrary.wiley.com/doi/book/10.1002/0471721549",
  abstract =     "The authors offer a general introduction to the
                 concept of propagators, how they can be used to study
                 atomic and molecular properties and spectra, and
                 provide examples and technical details of their use in
                 various common approximate treatments as well as some
                 illustrative applications.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  remark =       "Previous edition: London: Academic Press, 1973.",
  shorttableofcontents = "1: Introduction \\
                 2: Differential Equations and their Green's Functions
                 \\
                 3: Green's Functions or Propagators and Second
                 Quantization \\
                 4: Electron Interaction and Double-Time Green's
                 Functions \\
                 5: The Excitation Propagator \\
                 6: Interaction of Radiation and Matter \\
                 7: Temperature Dependent Perturbation Theory \\
                 8: Molecules in Magnetic Fields \\
                 9: The Electron Propagator in Higher Order Treatments
                 \\
                 10: Atomic and Molecular Orbitals \\
                 11: The Pariser--Parr--Pople Model \\
                 12: The Excitation Propagator in Higher Order
                 Treatments \\
                 13: Propagators and Chemical Reaction Rate \\
                 Appendix A: Complex Differential and Integral Calculus
                 Primer \\
                 Appendix B: First and Second Quantization \\
                 Appendix C: Stability of Hartree--Fock Solutions \\
                 Appendix D: Third-Order Self-Energy of the Electron
                 Propagator \\
                 Appendix E: Temperatures Dependent Propagators \\
                 Appendix F: The Eckart Potential and its Propagator",
  subject =      "Quantum chemistry; Many-body problem; Many-body
                 problem; Quantum chemistry",
  tableofcontents = "1: Introduction \\
                 2: Differential Equations \\
                 3: Propagators and Second Quantization \\
                 3.1 The H{\"u}ckel Model \\
                 3.2 Electron Field Operators \\
                 3.3 Angular Momentum \\
                 4: Double-Time Green's Functions \\
                 4.1 The Electron Propagator \\
                 4.2 Electrons in a Central Potential \\
                 4.3 The Atomic Central Field Problem \\
                 4.4 Complex Spectra \\
                 4.5 Single Subshell Approximation \\
                 4.6 Approximate Atomic Transition Amplitudes \\
                 5: The Excitation Propagator \\
                 5.1 Antisymmetrized Geminal Power \\
                 6: Interaction of Radiation and Matter \\
                 6.1 A Charged Particle in an Electromagnetic Field \\
                 6.2 Quantization of the Radiation Field \\
                 6.3 Absorption Spectroscopy \\
                 6.4 RPA Transition Moments \\
                 6.5 Optical Rotatory Dispersion and Circular Dichroism
                 \\
                 7: Temperature-Dependent Perturbation Theory \\
                 8: Molecules in Magnetic Fields \\
                 8.1 Nuclear Spins \\
                 8.2 Magnetic Susceptibility \\
                 8.3 NMR-Spectra \\
                 8.4 Magnetic Properties of Molecules \\
                 8.5 Diamagnetic Molecules \\
                 8.6 Units and Magnitude of Magnetic Susceptibilities
                 \\
                 8.7 Paramagnetic Molecules \\
                 8.8 NMR Spectra and Shielding \\
                 8.9 NMR Spectra and Spin--Spin Coupling \\
                 8.10 The Origin Problem \\
                 8.11 The Gauge Problem \\
                 8.12 An Elementary Example of NMR Spectra \\
                 8.13 Paramagnetic Molecules \\
                 9: The Electron Propagator in Higher Orders \\
                 9.1 Renormalization of the Electron Propagator \\
                 9.2 Partitioning and Inner Projections \\
                 9.3 Recipe for Diagrams \\
                 9.4 Photoelectron Spectra \\
                 9.5 Photoionization Cross Sections \\
                 10: Atomic and Molecular Orbitals \\
                 10.1 Nonorthogonal Basis Sets \\
                 10.2 Green's Function Considerations \\
                 10.3 A Simple Model Hamiltonian \\
                 10.4 Electronic Indices from Green's Functions \\
                 10.5 Orthogonalized Atomic Orbitals \\
                 11: The Pariser--Parr--Pople Model \\
                 11.1 Introduction \\
                 11.2 Reduction to the Pariser--Parr--Pople Model \\
                 11.3 Limit of Separated Atoms \\
                 11.4 Interacting Atoms \\
                 11.5 Calculation of Expectation Values \\
                 11.6 Application to Linear Chains \\
                 12: The Excitation Propagator in Higher Orders \\
                 12.1 Auger Spectroscopy \\
                 13: Propagators and Chemical Reaction Rate \\
                 A: Complex Calculus Primer \\
                 A.1 Continuity \\
                 A.2 Differentiability \\
                 A.3 Analytic Functions \\
                 A.4 Complex Integration \\
                 A.5 Cauchy's Theorem \\
                 A.6 Laurent Series \\
                 A.7 Isolated Singularities \\
                 A.8 Residue at a Singularity \\
                 A.9 Expansion of a Meromorphic Function \\
                 B: First and Second Quantization \\
                 C: Stability of Hartree--Fock Solutions \\
                 D: Third-Order Self-Energy \\
                 E: Temperature-Dependent Propagators \\
                 E.1 Preliminaries \\
                 E.2 Wick's Theorem \\
                 E.3 Diagrams \\
                 F: The Eckart Potential and its Propagator \\
                 Index",
}

@Book{Lindholm:1997:JVM,
  author =       "Tim Lindholm and Frank Yellin",
  title =        "The {Java} Virtual Machine Specification",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xvi + 475",
  year =         "1997",
  ISBN =         "0-201-63452-X",
  ISBN-13 =      "978-0-201-63452-5",
  LCCN =         "QA76.73.J38L56 1997",
  bibdate =      "Tue Mar 04 15:04:45 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$36.53",
  series =       "The Java Series",
  URL =          "http://www.aw.com/cp/javaseries.html",
  acknowledgement = ack-nhfb,
  keywords =     "Internet (Computer network); Java (Computer program
                 language); Java (computer program language);
                 programming languages (electronic computers); systems;
                 virtual computer; Virtual computer systems",
  lccnalt =      "96-015897",
  tableofcontents = "1. Introduction\\
                 2. Java Concepts\\
                 3. Structure of the Java Virtual Machine\\
                 4. The class File Format\\
                 5. Constant Pool Resolution\\
                 6. Java Virtual Machine Instruction Set\\
                 7. Compiling for the Java Virtual Machine\\
                 8. Threads and Locks\\
                 9. An Optimization \\
                 10. Opcode Mnemonics by Opcode",
}

@Book{Lindholm:1999:JVM,
  author =       "Tim Lindholm and Frank Yellin",
  title =        "The {Java} Virtual Machine Specification",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Second",
  pages =        "xv + 473",
  year =         "1999",
  ISBN =         "0-201-43294-3 (paperback)",
  ISBN-13 =      "978-0-201-43294-7 (paperback)",
  LCCN =         "QA76.73.J38L56 1999",
  bibdate =      "Tue May 11 07:30:11 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/java.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$42.95",
  abstract =     "The nucleus of the Java 2 platform, the Java Virtual
                 Machine is the technology that enables the Java 2
                 platform to host applications on any computer or
                 operating system without rewriting or recompiling. This
                 book was written by those directly responsible for the
                 design and implementation of the Java Virtual Machine,
                 and is the complete and definitive specification for
                 the technology. It is an essential reference for
                 writers of compilers for the Java programming language
                 and implementors of the Java Virtual Machine. This
                 second edition specifies the newest version of the Java
                 Virtual Machine and provides a fascinating view into
                 the inner workings of the Java 2 platform.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Introduction \\
                 2: Java Programming Language Concepts \\
                 3: The Structure of the Java Virtual Machine \\
                 4: The class File Format \\
                 5: Loading, Linking, and Initializing \\
                 6: The Java Virtual Machine Instruction Set \\
                 7: Compiling for the Java Virtual Machine \\
                 8: Threads and Locks \\
                 9: Opcode Mnemonics by Opcode \\
                 Appendix: Summary of Clarifications and Amendments",
}

@Book{Lindley:2004:DKT,
  author =       "David Lindley",
  title =        "{Degrees Kelvin}: a Tale of Genius, Invention, and
                 Tragedy",
  publisher =    "Joseph Henry Press",
  address =      "Washington, DC, USA",
  pages =        "viii + 366",
  year =         "2004",
  ISBN =         "0-309-09073-3 (hardcover), 0-309-53095-4 (e-book)",
  ISBN-13 =      "978-0-309-09073-5 (hardcover), 978-0-309-53095-8
                 (e-book)",
  LCCN =         "QC16.K3 L56 2004",
  bibdate =      "Mon Nov 22 18:16:00 MST 2004",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  price =        "US\$27.59",
  URL =          "ftp://uiarchive.cso.uiuc.edu/pub/etext/gutenberg/;
                 http://www.loc.gov/catdir/toc/ecip0410/2003022885.html",
  abstract =     "Destined to become the definitive biography of one of
                 the most important figures in modern science,
                 \booktitle{Degrees Kelvin} unravels the mystery of a
                 life composed of equal parts triumph and tragedy,
                 hubris and humility, yielding a surprising and
                 compelling portrait of a complex and enigmatic man.",
  acknowledgement = ack-nhfb,
  keywords =     "cable; Cambridge; compass; controversies; conundrums;
                 Kelvin",
  subject =      "Kelvin, William Thomson, Baron; Physicists: Great
                 Britain; Biography",
  subject-dates = "1824--1907",
  tableofcontents = "Acknowledgments \\
                 Introduction \\
                 1: Cambridge \\
                 2: Conundrums \\
                 3: Cable \\
                 4: Controversies \\
                 5: Compass \\
                 6: Kelvin \\
                 Epilogue \\
                 Bibliography \\
                 Notes \\
                 Index",
}

@Book{Lindley:2008:UEH,
  author =       "David Lindley",
  title =        "Uncertainty: {Einstein}, {Heisenberg}, {Bohr}, and the
                 struggle for the soul of science",
  publisher =    pub-ANCHOR-BOOKS,
  address =      pub-ANCHOR-BOOKS:adr,
  pages =        "viii + 257",
  year =         "2008",
  ISBN =         "1-4000-7996-9",
  ISBN-13 =      "978-1-4000-7996-4",
  LCCN =         "QC174.17.H4 L56 2007",
  bibdate =      "Tue Dec 09 15:00:37 2008",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/bohr-niels.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/h/heisenberg-werner.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 melvyl.cdlib.org:210/CDL90",
  URL =          "http://www.loc.gov/catdir/toc/ecip0614/2006017029.html",
  abstract =     "The remarkable story of a startling scientific idea
                 that ignited a battle among the greatest minds of the
                 twentieth century and profoundly influenced
                 intellectual inquiry in fields ranging from physics to
                 literary criticism, anthropology and journalism. In
                 1927, young German physicist Werner Heisenberg
                 challenged centuries of scientific understanding when
                 he introduced what came to be known as `the uncertainty
                 principle.' Heisenberg proved that in many physical
                 measurements, you can obtain one bit of information
                 only at the price of losing another. This proposition,
                 undermining the cherished belief that science could
                 reveal the physical world with limitless detail and
                 precision, placed Heisenberg in direct opposition to
                 the revered Albert Einstein. Niels Bohr, Heisenberg's
                 mentor and Einstein's long-time friend, found himself
                 caught between the two. Bohr understood that Heisenberg
                 was correct, but he also recognized the vital necessity
                 of gaining Einstein's support as the world faced the
                 shocking implications of Heisenberg's principle.",
  acknowledgement = ack-nhfb,
  subject =      "Heisenberg uncertainty principle; Physics;
                 Philosophy",
  tableofcontents = "Contents \\
                 Introduction \\
                 1. Irritable Particles \\
                 2. Entropy Strives Toward a Maximum \\
                 3. An Enigma, a Subject of Profound Astonishment \\
                 4. How Does an Electron Decide? \\
                 5. An Audacity Unheard of in Earlier Times \\
                 6. Lack of Knowledge is No Guarantee of Success \\
                 7. How Can One Be Happy? \\
                 8. I Would Rather Be a Cobbler \\
                 9. Something Has Happened \\
                 10. The Soul of the Old System \\
                 11. I Am Inclined to Give Up Determinism \\
                 12. Our Words Don't Fit \\
                 13. Awful Bohr Incantation Terminology \\
                 14. Now the Game Was Won \\
                 15. Life Experience and not Scientific Experience \\
                 16. Possibilities of Unambiguous Interpretation \\
                 17. The No-Man's-Land Between Logic and Physics \\
                 18. Anarchy At Last \\
                 Postscript",
}

@Book{Lions:1996:LCU,
  author =       "John Lions",
  title =        "{Lions'} Commentary on {UNIX 6th Edition}, with Source
                 Code",
  publisher =    "Peer-to-Peer Communications",
  address =      "San Jose, CA 95164-0218, USA",
  pages =        "254",
  year =         "1996",
  ISBN =         "1-57398-013-7",
  ISBN-13 =      "978-1-57398-013-5",
  LCCN =         "QA76.76.O63 L562 1996",
  bibdate =      "Fri Jun 26 10:43:09 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  note =         "With forewords by Dennis M. Ritchie and Ken Thompson.
                 Prefatory notes by Peter H. Salus and Michael Tilson; a
                 Historical Note by Peter H. Salus; and Appreciations by
                 Greg Rose, Mike O'Dell, Berny Goodheart, Peter
                 Collinson, and Peter Reintjes. Originally circulated as
                 two restricted-release volumes: ``UNIX Operating System
                 Source Code Level Six'', and ``A Commentary on the UNIX
                 Operating System''.",
  price =        "US\$29.96; CAN\$41.95",
  series =       "Computer classics revisited",
  URL =          "http://wiki.tuhs.org/doku.php?id=publications:lions_commentary;
                 http://www.lemis.com/grog/Documentation/Lions/;
                 http://www.peer-to-peer.com/catalog/opsrc/lions.html;
                 https://github.com/kanner/lions-book",
  acknowledgement = ack-nhfb,
  tableofcontents = "UNIX operating system source code level six \\
                 A commentary on the UNIX operating system",
}

@Book{Lipkin:1999:LLV,
  author =       "Bernice Sacks Lipkin",
  title =        "{\LaTeX} for {Linux}: a Vade Mecum",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xxxi + 568",
  year =         "1999",
  ISBN =         "0-387-98708-8 (paperback)",
  ISBN-13 =      "978-0-387-98708-8 (paperback)",
  LCCN =         "Z253.4 L38 L56 1999",
  bibdate =      "Thu Sep 21 10:27:12 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/linux.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  price =        "US\$49.95",
  abstract =     "\booktitle{LaTeX for Linux} is a comprehensive
                 introduction and guide to using LaTeX. While it is
                 directed at Linux and UNIX users, it is also a
                 first-rate how-to book on using LaTeX to prepare
                 articles, books, and theses for users of any system
                 that supports LaTeX. Unlike other LaTeX books, it is
                 especially useful for someone coming to LaTeX for the
                 first time. As Linux grows rapidly in popularity, more
                 and more people looking to take advantage of the
                 desktop publishing power of LaTeX --- included with
                 most Linux distributions --- will find LaTeX for Linux
                 a wonderful way to get started.",
  acknowledgement = ack-nhfb,
  keywords =     "Computerized typesetting; LaTeX (Computer file)",
  tableofcontents = "Part I: Reading {\LaTeX} / 1 \\
                 1: What a {\LaTeX} Command Does / 3 \\
                 2: Concepts: How {\LaTeX} Operates on Text / 7 \\
                 2.1: Grammatical Elements / 8 \\
                 2.2: Instructions to {\LaTeX} / 9 \\
                 2.2.1: Commands / 10 \\
                 2.2.2: Declarations / 11 \\
                 2.2.3: Environments / 12 \\
                 2.3: Basic Principles in Reading and Writing {\LaTeX}
                 Commands / 14 \\
                 2.4: The Scope of an Instruction / 15 \\
                 2.5: {\LaTeX} Conventions / 17 \\
                 3: Document Classes / 21 \\
                 3.1: {\LaTeX}'s Style of Styling Styles / 21 \\
                 3.2: Format of a Very Simple {\LaTeX} File / 23 \\
                 3.3: {\LaTeX}-defined Classes / 23 \\
                 3.4: Slides / 24 \\
                 3.5: Letters / 25 \\
                 3.6: Articles / 29 \\
                 3.7: Reports / 30 \\
                 3.8: Books / 30 \\
                 3.9: Document Class Options / 32 \\
                 3.10: TOC Option / 36 \\
                 Part II: Preparatory Tasks / 37 \\
                 4: Constructing practice.tex, a Practice File / 39 \\
                 5: Setting Emacs Keys for Common Constructions / 45 \\
                 5.1: Writing in Emacs / 45 \\
                 5.2: A Font Shape Template / 46 \\
                 5.3: A List Template / 48 \\
                 5.4: A Verbatim Template / 51 \\
                 5.5: A Macro Template / 52 \\
                 5.6: A Logo Template / 53 \\
                 6: Viewing and Printing Marked Up Files / 55 \\
                 7: Dealing with Errors / 59 \\
                 7.1: Real Errors / 60 \\
                 7.2: Overfull and Underfull Lines and Pages / 64 \\
                 7.2.1: The overfull line / 64 \\
                 7.2.2: The underfull line / 67 \\
                 7.2.3: The overfull page / 67 \\
                 7.2.4: The underfull page / 68 \\
                 7.2.5: Other alerts / 68 \\
                 Part III: Writing {\LaTeX} / 71 \\
                 8: {\LaTeX}-Reserved Single-Character Commands / 73 \\
                 8.1: Single-Character Command Symbols / 73 \\
                 8.2: Writing Special Symbols As Ordinary Text / 75 \\
                 8.3: Writing Aliases For Single Character Commands / 77
                 \\
                 8.4: Meta Level Mimicking Of Text Commands / 78 \\
                 9: Single-Word Instructions / 81 \\
                 9.1: Font Features / 81 \\
                 9.2: Commands / 83 \\
                 9.2.1: The {\LaTeX} repertoire of commands / 84 \\
                 9.2.2: User-created new commands / 87 \\
                 9.3: Declarations / 88 \\
                 9.4: Environments / 89 \\
                 9.4.1: Using an environment whose name is a defined
                 declaration / 90 \\
                 9.4.2: Constructing an environment from an existing
                 environment / 91 \\
                 9.4.3: Creating environments from scratch / 92 \\
                 9.4.4: Trouble spots in creating a new environment / 93
                 \\
                 10: Newcommands and Macros / 95 \\
                 10.1: What a Macro Is / 95 \\
                 10.2: Exact Substitution / 95 \\
                 10.3: PlaceHolder Substitution / 96 \\
                 10.3.1: Composing the macro / 97 \\
                 10.3.2: Using the macro / 98 \\
                 10.3.3: Revising a macro definition / 99 \\
                 10.4: Using {\LaTeX} Instructions in the Macro / 99 \\
                 10.4.1: Commands in the macro argument / 99 \\
                 10.4.2: Declarations in the macro argument / 100 \\
                 10.4.3: Environments and macros / 101 \\
                 10.5: Incorporating a Macro in a Macro / 103 \\
                 10.6: The Complete Newcommand Format / 104 \\
                 10.7: Trouble Spots in Writing Macros / 107 \\
                 10.8: The Complete Newenvironment Format / 108 \\
                 Part IV: Formatting in Text Mode / 111 \\
                 11: Fonts / 115 \\
                 11.1: Font Terminology / 116 \\
                 11.2: Commands/Declarations That Control Font Features
                 / 118 \\
                 11.2.1: Manipulating font family, series and shapes /
                 118 \\
                 11.2.2: Font sizes / 121 \\
                 11.2.3: Changing both font size and type style / 123
                 \\
                 11.3: Naming Conventions for Fonts / 123 \\
                 11.3.1: Classic TEX fonts / 123 \\
                 11.3.2: Using NFSS to classify names / 125 \\
                 11.3.3: Fonts supplied with {\LaTeX} / 130 \\
                 11.4: The Directory Structure for Storing Fonts / 133
                 \\
                 11.5: To Load a New Font / 134 \\
                 11.5.1: Why load yet another font? / 134 \\
                 11.5.2: To change the main font family for the entire
                 document / 135 \\
                 11.5.3: To load an additional font from NFSS
                 descriptors / 139 \\
                 11.5.4: The main font and the selectfont font / 145 \\
                 11.5.5: Behind the scenes in loading and using a font /
                 146 \\
                 12: Accents, Dingbats, Standard and Nonstandard Codes /
                 157 \\
                 12.1: The Fonts on Disk / 159 \\
                 12.1.1: Naming font files / 159 \\
                 12.1.2: Directory names / 160 \\
                 12.1.3: To view and use a font table / 161 \\
                 12.2: The Standard ASCII Codes / 164 \\
                 12.2.1: Built-In letter accents / 167 \\
                 12.2.2: Trademarks and registries / 168 \\
                 12.3: Nonstandard Coding Tables / 170 \\
                 12.3.1: Dingbats / 172 \\
                 12.3.2: Saint Mary Road symbol fonts / 174 \\
                 12.3.3: European Computer Modern text fonts / 177 \\
                 12.3.4: text companion symbols / 178 \\
                 12.3.5: Math symbol fonts / 179 \\
                 12.3.6: wasy symbol fonts / 181 \\
                 12.4: Nonstandard Sizes: Banners, Posters And Spreads /
                 182 \\
                 13: Manipulating Space / 195 \\
                 13.1: Adding a Small Amount of Space Between
                 Characters/Words / 195 \\
                 13.2: Adding Significant Space Between Words / 197 \\
                 13.3: Adding Space Between Sentences / 200 \\
                 13.4: Adding Space Between Two Lines / 201 \\
                 13.4.1: Using \\ [length] / 201 \\
                 13.4.2: Using the \vspace command / 202 \\
                 13.4.3: Using fixed size vertical skips / 203 \\
                 13.4.4: Filling vertical space up to what's needed /
                 204 \\
                 13.4.5: The /par command / 205 \\
                 13.5: Changing the Permanent Spacing Between Lines /
                 205 \\
                 13.6: Adding a Blank Line Between Paragraphs / 205 \\
                 13.7: Adding Permanent Space Between Paragraphs / 206
                 \\
                 13.8: Double Spacing a Draft Copy / 206 \\
                 14: Lists / 209 \\
                 14.1: The Itemize List / 210 \\
                 14.2: The Enumerate List / 212 \\
                 14.3: The Description List / 214 \\
                 14.4: Other Description List Styles / 216 \\
                 14.5: The Trivlist Environment / 219 \\
                 15: Aligning and Indenting Text / 221 \\
                 15.1: Aligning the Text Horizontally / 221 \\
                 15.2: Raising Text / 223 \\
                 15.3: Outdenting / 224 \\
                 15.4: Breaking Single Lines on the Right / 225 \\
                 15.5: Creating an Outline / 226 \\
                 15.6: Using Displayed Paragraph Formats / 228 \\
                 15.6.1: Quotation and quote environments / 228 \\
                 15.6.2: Verse environment / 229 \\
                 15.6.3: Center environment / 230 \\
                 15.6.4: An ordinary description list / 231 \\
                 15.7: Simple Paragraph Indenting / 232 \\
                 15.8: Controlling the Degree of Indentation / 232 \\
                 16: Floating Objects / 237 \\
                 16.1.1: General format / 237 \\
                 16.1.2: Usage / 239 \\
                 16.1.3: Subfigures / 242 \\
                 16.1.4: Working text around a figure / 243 \\
                 16.1.5: Creating new float styles / 250 \\
                 16.1.6: Captions / 251 \\
                 16.2: Marginal Notes / 252 \\
                 16.3.1: Tabs / 254 \\
                 16.3.2: The tabular environment / 258 \\
                 16.3.3: Floats and multiple columns / 270 \\
                 17.1: Footnotes in Text / 273 \\
                 17.1.1: Footnote syntax in text / 274 \\
                 17.1.2: Shifting between numbers and symbols / 275 \\
                 17.1.3: Numbering by symbol / 275 \\
                 17.1.4: Resetting the counter / 276 \\
                 17.1.5: Examples of numbering styles / 277 \\
                 17.2: Footnotes in a Minipage / 279 \\
                 17.2.1: Minipage footnotes with independent numbering /
                 279 \\
                 17.2.2: Blending minipage and text footnotes / 281 \\
                 17.3: Changing Footnote Style / 284 \\
                 17.4: Footnote Modification Packages / 285 \\
                 18: Cross-Referencing / 287 \\
                 18.1: Referencing Numbered {\LaTeX} Objects / 287 \\
                 18.2: Page References / 289 \\
                 18.3: Referencing Footnotes / 290 \\
                 18.4: Positioning the Label / 291 \\
                 18.4.1: The {\LaTeX} object is stylized / 291 \\
                 18.4.2: The {\LaTeX} object is not stylized / 292 \\
                 19: Literal Text and Silent Text / 295 \\
                 19.1: Verbatim Text / 295 \\
                 19.2: Writing Notes To Yourself / 299 \\
                 19.2.1: Using the \% / 299 \\
                 19.2.2: Invisible reminders / 299 \\
                 19.2.3: Visible reminders / 300 \\
                 19.2.4: The {\LaTeX} /typeout and /typein commands /
                 301 \\
                 Part V: Formatting in Math Mode / 303 \\
                 20: Math Symbols, Alphabets and Grammar / 305 \\
                 20.1: Built-in Symbols / 306 \\
                 20.1.1: Greek letters, booleans, integrals and sums /
                 306 \\
                 20.1.2: Some common mathematical operators / 307 \\
                 20.1.3: Math accents / 308 \\
                 20.1.4: Adding ordinary text in math mode / 309 \\
                 20.2: Modifying the Appearance of Equations / 310 \\
                 20.2.1: Changing math type style / 310 \\
                 20.2.2: Space wedges / 312 \\
                 20.2.3: Size / 313 \\
                 20.2.4: Creating a New Math Alphabet Command Name / 315
                 \\
                 20.2.5: Adding Math Symbols / 318 \\
                 20.3: Writing, Protecting and Revising Math Macros /
                 320 \\
                 20.3.1: Writing a math macro / 320 \\
                 20.3.2: Redefining the math macro / 321 \\
                 20.4: Lemmas, Axioms and Conjectures / 322 \\
                 21: Single Line Math Modes / 325 \\
                 21.1: Unnumbered Equation in Running Text / 325 \\
                 21.2: displaymath for a Single Unnumbered Equation /
                 326 \\
                 21.3: A Numbered Equation on a Separate Line / 327 \\
                 22: Arrays: Multi-Line Math Mode / 329 \\
                 22.1: Creating an Array / 329 \\
                 Part VI: Formatting in Box Mode / 337 \\
                 23: Box Mode / 339 \\
                 23.1: The Single Line Box: \makebox, \framebox / 340
                 \\
                 23.1.1: The \makebox and \mbox commands / 340 \\
                 23.1.2: \framebox and \fbox commands / 341 \\
                 23.1.3: Changing the appearance of the frame / 342 \\
                 23.1.4: Fancy frames / 344 \\
                 23.2: The Paragraph Box: Parboxes and Minipages / 345
                 \\
                 23.2.1: The parbox / 345 \\
                 23.2.2: The minipage environment / 348 \\
                 23.2.3: Framing the minipage / 354 \\
                 23.3: The Inked Rectangle: The Rulebox / 356 \\
                 23.3.1: Solid boxes / 356 \\
                 23.3.2: Struts / 358 \\
                 23.4: Sizing the Box in Relative Terms / 358 \\
                 23.5: Saving Designs / 362 \\
                 Part VII: Enhancements to the Text / 369 \\
                 24: Creating Pictures and Graphics / 371 \\
                 24.1: Creating Pictures in {\LaTeX} / 371 \\
                 24.1.1: Positioning the picture / 372 \\
                 24.1.2: Picture commands / 372 \\
                 24.1.3: Additional graphics packages / 374 \\
                 24.2: The xv Package / 376 \\
                 24.3: The XFig Package / 379 \\
                 24.4: The XPaint Package / 382 \\
                 24.5: ImageMagick / 382 \\
                 24.6: GIMP / 386 \\
                 24.7: Packages for Ready Money / 388 \\
                 25: Inserting Completed Pictures and Graphics / 391 \\
                 25.1: Step 1: Linking the Printer Driver and graphicx /
                 392 \\
                 25.2: Step 2: Size Information in the EPS File / 393
                 \\
                 25.2.1: The BoundingBox / 394 \\
                 25.2.2: The calc package / 396 \\
                 25.3: Step 3: Using the /includegraphics Command / 398
                 \\
                 25.4: //includegraphics Options / 401 \\
                 25.4.1: Resetting the BoundingBox / 402 \\
                 25.4.2: viewport: resetting the part of the picture to
                 exhibit / 403 \\
                 25.4.3: Resetting exhibition width / 403 \\
                 25.4.4: Resetting exhibition height / 404 \\
                 25.4.5: Scaling: another way to reset size / 404 \\
                 25.4.6: Resetting exhibition orientation / 405 \\
                 25.4.7: The interaction between size and orientation /
                 408",
}

@Book{Lippman:1991:CP,
  author =       "Stanley B. Lippman",
  title =        "{C++} Primer",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Second",
  pages =        "xvi + 614",
  year =         "1991",
  ISBN =         "0-201-54848-8 (paperback)",
  ISBN-13 =      "978-0-201-54848-8 (paperback)",
  LCCN =         "QA76.73.C15 L57 1991",
  bibdate =      "Wed Dec 15 10:38:15 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
}

@Book{Liu:1984:MSF,
  author =       "Yu-Cheng Liu and Glenn A. Gibson",
  title =        "Microcomputer Systems: The 8086\slash 8088 Family.
                 Architecture, Programming, and Design",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "ix + 550",
  year =         "1984",
  ISBN =         "0-13-580944-4",
  ISBN-13 =      "978-0-13-580944-0",
  LCCN =         "QA76.8.I292 L58 1984",
  bibdate =      "Wed Dec 15 10:38:16 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "A broad treatment of the Intel 8086 and 8088, with
                 shorter surveys of the 8087, 80186, and 80286. Nothing
                 specific to the IBM PC.",
  acknowledgement = ack-nhfb,
}

@Book{Livio:2002:GRS,
  author =       "Mario Livio",
  title =        "The Golden Ratio: the Story of Phi, the World's Most
                 Astonishing Number",
  publisher =    "Broadway Books",
  address =      "New York, NY, USA",
  pages =        "viii + 294",
  year =         "2002",
  ISBN =         "0-7679-0815-5",
  ISBN-13 =      "978-0-7679-0815-3",
  LCCN =         "QA466 .L58 2002",
  bibdate =      "Tue Jul 08 12:29:44 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Benford's Law is treated on pages 231--237.",
  price =        "US\$24.95, CAN\$37.95",
  abstract =     "Throughout history, thinkers from mathematicians to
                 theologians have pondered the mysterious relationship
                 between numbers and the nature of reality. In this
                 fascinating book, the author tells the tale of a number
                 at the heart of that mystery: phi, or
                 1.6180339887\ldots{}. This curious mathematical
                 relationship, widely known as ``The Golden Ratio,'' was
                 discovered by Euclid more than two thousand years ago
                 because of its crucial role in the construction of the
                 pentagram, to which magical properties had been
                 attributed. Since then it has shown a propensity to
                 appear in the most astonishing variety of places, from
                 mollusk shells, sunflower florets, and rose petals to
                 the shape of the galaxy. Psychological studies have
                 investigated whether the Golden Ratio is the most
                 aesthetically pleasing proportion extant, and it has
                 been asserted that the creators of the Pyramids and the
                 Parthenon employed it. It is believed to feature in
                 works of art from Leonardo da Vinci's Mona Lisa to
                 Salvador Dali's The Sacrament of the Last Supper, and
                 poets and composers have used it in their works. It has
                 even been found to be connected to the behavior of the
                 stock market! This book is a captivating journey
                 through art and architecture, botany and biology,
                 physics and mathematics. It tells the human story of
                 numerous phi-fixated individuals, including the
                 followers of Pythagoras who believed that this
                 proportion revealed the hand of God; astronomer
                 Johannes Kepler, who saw phi as the greatest treasure
                 of geometry; such Renaissance thinkers as mathematician
                 Leonardo Fibonacci of Pisa; and such masters of the
                 modern world as Goethe, Cezanne, Bartok, and physicist
                 Roger Penrose. Wherever his quest for the meaning of
                 phi takes him, the author reveals the world as a place
                 where order, beauty, and eternal mystery will always
                 coexist.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Prelude to a number \\
                 The pitch and the pentagram \\
                 Under a star-Y-pointing pyramid? \\
                 The second treasure \\
                 Son of good nature \\
                 The divine proportion \\
                 Painters and poets have equal license \\
                 From the tiles to the heavens \\
                 Is God a mathematician?",
}

@Book{Livio:2005:ECS,
  author =       "Mario Livio",
  title =        "The Equation That Couldn't Be Solved: How Mathematical
                 Genius Discovered the Language of Symmetry",
  publisher =    pub-SIMON-SCHUSTER,
  address =      pub-SIMON-SCHUSTER:adr,
  pages =        "x + 353",
  year =         "2005",
  ISBN =         "0-7432-5820-7 (hardcover), 0-7432-5821-5 (e-book),
                 0-7432-7462-8 (e-book)",
  ISBN-13 =      "978-0-7432-5820-3 (hardcover), 978-0-7432-5821-0
                 (e-book), 978-0-7432-7462-3 (e-book)",
  LCCN =         "QA174.2 .L58 2005",
  bibdate =      "Tue Oct 11 05:00:45 MDT 2005",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/i/infeld-leopold.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "Traces the four-thousand-year-old mathematical effort
                 to discover and define the laws of symmetry, citing the
                 achievements of doomed geniuses Niels Henrick Abel and
                 Evariste Galois to solve the quintic equation and give
                 birth to group theory.",
  acknowledgement = ack-nhfb,
  subject =      "Group theory; History; Galois theory; History; Galois,
                 Evariste; Symmetric functions; History; Symmetry;
                 Mathematics; History; Diophantine analysis; History",
  subject-dates = "1811--1832",
  tableofcontents = "Symmetry \\
                 eye s'dnim eht ni yrtemmyS \\
                 Never forget this in the midst of your equations \\
                 The poverty-stricken mathematician \\
                 The romantic mathematician \\
                 Groups \\
                 Symmetry rules \\
                 Who's the most symmetrical of them all? \\
                 Requiem for a romantic genius \\
                 Appendix 1. Card puzzle \\
                 Appendix 2. Solving a system of two linear equations
                 \\
                 Appendix 3. Diophantus's solution \\
                 Appendix 4. A Diophantine equation \\
                 Appendix 5. Tartaglia's verses and formula \\
                 Appendix 6. Adriaan van Roomen's challenge \\
                 Appendix 7. Properties of the roots of quadratic
                 equations \\
                 Appendix 8. The Galois family tree \\
                 Appendix 9. The 14--15 puzzle \\
                 Appendix 10. Solution to the matches problem",
}

@Book{Lloyd:1987:FLP,
  author =       "J. W. (John Wylie) Lloyd",
  title =        "Foundations of Logic Programming",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Second",
  pages =        "xii + 212",
  year =         "1987",
  ISBN =         "0-387-18199-7, 3-540-18199-7",
  ISBN-13 =      "978-0-387-18199-8, 978-3-540-18199-6",
  LCCN =         "QA76.6.L583 1987",
  bibdate =      "Fri Sep 11 07:42:16 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Lockhart:2017:A,
  author =       "Paul Lockhart",
  title =        "Arithmetic",
  publisher =    "The Belknap Press of Harvard University Press",
  address =      "Cambridge, MA, USA",
  pages =        "223",
  year =         "2017",
  ISBN =         "0-674-97223-6",
  ISBN-13 =      "978-0-674-97223-0",
  LCCN =         "QA115 .L713 2017",
  bibdate =      "Sat Dec 22 16:04:02 MST 2018",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Educator Paul Lockhart's goal is to demystify
                 arithmetic: to bring the subject to life in a fun and
                 accessible way, and to reveal its profound and simple
                 beauty, as seen through the eyes of a modern research
                 mathematician. The craft of arithmetic arises from our
                 natural desire to count, arrange, and compare
                 quantities. Over the centuries, humans have devised a
                 wide variety of strategies for representing and
                 manipulating numerical information: tally marks, rocks
                 and beads, marked-value and place-value systems, as
                 well as mechanical and electronic calculators.
                 \booktitle{Arithmetic} traces the history and
                 development of these various number languages and
                 calculating devices and examines their comparative
                 advantages and disadvantages, providing readers with an
                 opportunity to develop not only their computational
                 skills but also their own personal tastes and
                 preferences. The book is neither a training manual nor
                 an authoritative history, but rather an entertaining
                 survey of ideas and methods for the reader to enjoy and
                 appreciate. Written in a lively conversational style,
                 \booktitle{Arithmetic} is a fun and engaging
                 introduction to both practical techniques as well as
                 the more abstract mathematical aspects of the
                 subject.",
  acknowledgement = ack-nhfb,
  subject =      "Talteori; Arithmetic; History",
  tableofcontents = "Dear Reader / vii \\
                 Things / 1 \\
                 Language / 5 \\
                 Repetition / 10 \\
                 Tribes / 15 \\
                 Egypt / 25 \\
                 Rome / 32 \\
                 China and Japan / 41 \\
                 India / 48 \\
                 Europe / 75 \\
                 Multiplication / 87 \\
                 Division / 117 \\
                 Machines / 136 \\
                 Fractions / 151 \\
                 Negative numbers / 180 \\
                 The art of counting / 197 \\
                 Afterword / 215 \\
                 Index / 217",
}

@Book{Lomb:2011:TVP,
  author =       "Nick Lomb",
  title =        "Transit of {Venus}: 1631 to the present",
  publisher =    "Experiment",
  address =      "New York, NY, USA",
  pages =        "228",
  year =         "2011",
  ISBN =         "1-61519-055-4",
  ISBN-13 =      "978-1-61519-055-3",
  LCCN =         "QB509 .L66 2012",
  bibdate =      "Thu Sep 6 12:00:55 MDT 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/annscience.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "Every so often, the planet Venus does something
                 remarkable. Its orbit brings it to a point directly
                 between the Sun and the Earth, where it appears to us
                 as a black dot moving across the bright disc of the
                 Sun. This transit of Venus is rare, occurring in pairs
                 eight years apart and then not for more than a hundred
                 years; it has fascinated astronomers for centuries.",
  acknowledgement = ack-nhfb,
  remark =       "Transit of Venus was first published in Australia by
                 NewSouth, an imprint of UNSW Press. The first North
                 American edition is published in association with the
                 Powerhouse Museum, Sydney, Australia, and NewSouth.",
  tableofcontents = "Transit fast facts \\
                 Introduction \\
                 A spot of unusual magnitude: 1639 \\
                 Frozen plains and tropical seas: 1761 \\
                 Venus of the South Seas: 1769 \\
                 Capturing the transit: 1874 and 1882 \\
                 Space-age transit: 2004 \\
                 Observing the 2012 transit \\
                 Glossary \\
                 Bibliography \\
                 Acknowledgments \\
                 Index",
}

@Book{Lomuto:1983:UP,
  author =       "Ann Nicols Lomuto and Nico Lomuto",
  title =        "A {UNIX} Primer",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xvi + 239",
  year =         "1983",
  ISBN =         "0-13-938886-9",
  ISBN-13 =      "978-0-13-938886-6",
  LCCN =         "QA76.8.U65 L65 1983",
  bibdate =      "Wed Dec 15 10:38:17 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  series =       "Prentice-Hall Software Series, Editor: Brian W.
                 Kernighan",
  URL =          "https://archive.org/details/unixprimer0000lomu/mode/1up",
  acknowledgement = ack-nhfb,
}

@Book{Lord:1984:MDS,
  author =       "E. A. Lord and C. B. Wilson",
  title =        "The Mathematical Description of Shape and Form",
  publisher =    pub-ELLIS-HORWOOD,
  address =      pub-ELLIS-HORWOOD:adr,
  pages =        "260",
  year =         "1984",
  ISBN =         "0-85312-722-0, 0-85312-726-3, 0-470-20043-X
                 (paperback)",
  ISBN-13 =      "978-0-85312-722-2, 978-0-85312-726-0,
                 978-0-470-20043-8 (paperback)",
  LCCN =         "QA501 .L86 1984",
  bibdate =      "Sun Jul 10 01:10:05 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Ellis Horwood Series in Mathematics and its
                 Applications, Editor: G. M. Bell",
  acknowledgement = ack-nhfb,
}

@Book{Lorentz:1952:PRC,
  author =       "H. A. (Hendrik Antoon) Lorentz and A. (Albert)
                 Einstein and H. (Hermann) Minkowski and H. (Hermann)
                 Weyl",
  title =        "The {Principle of Relativity}: a Collection of
                 Original Memoirs on the {Special and General Theory of
                 Relativity}",
  publisher =    pub-DOVER,
  address =      pub-DOVER:adr,
  pages =        "viii + 216",
  year =         "1952",
  ISBN =         "0-486-60081-5, 0-486-31840-0 (e-book)",
  ISBN-13 =      "978-0-486-60081-9, 978-0-486-31840-0 (e-book)",
  LCCN =         "QC 173.55 L67 1952",
  bibdate =      "Mon Feb 11 17:22:28 2019",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/s/sommerfeld-arnold.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 library.ox.ac.uk:210/ADVANCE",
  note =         "With notes by A. Sommerfeld. Translated By W. Perrett
                 and G. B. Jeffery",
  abstract =     "Here are the 11 papers that forged the general and
                 special theories of relativity: seven papers by
                 Einstein, plus two papers by Lorentz and one each by
                 Minkowski and Weyl. A thrill to read again the original
                 papers by these giants. School Science and Mathematics.
                 1923 edition.",
  acknowledgement = ack-nhfb,
  remark =       "First published in translation: Methuen, 1923.. With
                 contributions by A. Einstein, H. Minkowski and H.
                 Weyl.",
  remark =       "Unabridged and unaltered republication of the 1923
                 translation originally published by Methuen and
                 Company, 1923. Translated sections have come from the
                 text as published in a German collection, under the
                 title ``Des Relativit{\"a}tsprinzip'' (Teubner, 4th
                 ed., 1922).",
  subject =      "Relativity (Physics)",
  tableofcontents = "1: Michelson's interference experiment / H. A.
                 Lorentz \\
                 2: On the electrodynamics of moving bodies / A.
                 Einstein \\
                 3: On the electrodynamics of moving bodies / A.
                 Einstein \\
                 4: Does the inertia of a body depend upon its
                 energy-content? / A. Einstein \\
                 5: Space and time / H. Minkowski \\
                 6: On the influence of gravitation on the propagation
                 of light / A. Einstein \\
                 7: The foundation of the general theory of relativity /
                 A. Einstein \\
                 8: Hamilton's principle and the general theory of
                 relativity / A. Einstein \\
                 9: Cosmological considerations on the general theory of
                 relativity / A. Einstein \\
                 10: Do gravitational fields play an essential part in
                 the structure of the elementary particles of matter? /
                 A. Einstein \\
                 11: Gravitation and electricity / H. Weyl",
}

@Book{Lorenzo:2018:ASB,
  author =       "Mark Jones Lorenzo",
  title =        "Adventures of a Statistician: The Biography of {John
                 W. Tukey}",
  publisher =    "SE Books",
  address =      "5307 West Tyson Street, Philadelphia, PA 19107, USA",
  pages =        "340",
  year =         "2018",
  ISBN =         "1-72201-358-3 (paperback)",
  ISBN-13 =      "978-1-72201-358-5 (paperback)",
  LCCN =         "QA276.157 .T854 2018",
  bibdate =      "Thu Apr 16 12:55:18 MDT 2020",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/t/tukey-john-w.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  subject =      "Tukey, John W.; mathematical statistics",
  subject-dates = "1915--2000",
  tableofcontents = "Prologue / 13 \\
                 Part One: The Path to Statistics \\
                 1: Origins / 27 \\
                 2: Studying Chemistry at Brown / 32 \\
                 3: Making his mark at Princeton / 36 \\
                 4: Reaching the mathematical summit / 47 \\
                 5: Becoming a specialist in topology / 51 \\
                 6: Navigating world crisis / 55 \\
                 7: The war, multiple comparisons, and a seismic shift /
                 62 \\
                 Part Two: Working as a Statistician \\
                 8: A finger in every pie / 81 \\
                 9: Government science / 89 \\
                 10: Counting every vote / 97 \\
                 11: Stories from the birthplace of the future / 103 \\
                 12: The development of the Fast Fourier Transform / 112
                 \\
                 13: Explorations in time series / 122 \\
                 14: The difference between science and mathematics /
                 128 \\
                 15: The ontology of statistics / 137 \\
                 16: Teaching at Princeton / 145 \\
                 17: Statistical computing and the PRIM-9 / 154 \\
                 18: Clashes, criticism, \ldots{} / 171 \\
                 19: \ldots{} and Controversy: the Kinsey affair / 176
                 \\
                 Part Three: Life among the Academics \\
                 20: The quest for robustness / 195 \\
                 21: The elders and their children / 210 \\
                 22: Making the census count / 224 \\
                 23: Playing favorites / 236 \\
                 24: Statistics at Princeton / 242 \\
                 25: The development of \booktitle{Exploratory Data
                 Analysis} / 251 \\
                 26: Discovering surprises in the data / 262 \\
                 27: A graphical touch / 265 \\
                 28: Hunting for wild shots / 269 \\
                 29: Critical reaction to \booktitle{EDA} / 278 \\
                 30: Exploratory data analysis practiced as ritual / 282
                 \\
                 31: Unpacking Statistics 411 / 289 \\
                 Part Four: The Post-Retirement Years \\
                 32: Statistics at sunset / 295 \\
                 33: Still keeping busy / 299 \\
                 34: Down to one / 304 \\
                 35: The greatest symposium / 307 \\
                 36: His working boots stayed on / 310 \\
                 Epilogue / 313 \\
                 Coda / 317 \\
                 Resources / 319 \\
                 Acknowledgements / 339 \\
                 About the author / 341",
}

@Book{Lorenzo:2019:AMH,
  author =       "Mark Jones Lorenzo",
  title =        "Abstracting Away the Machine: The History of the
                 {Fortran} Programming Language ({FORmula
                 TRANslation})",
  publisher =    "SE Books",
  address =      "5307 West Tyson Street, Philadelphia, PA 19107, USA",
  pages =        "325",
  year =         "2019",
  ISBN =         "1-08-239594-3",
  ISBN-13 =      "978-1-08-239594-9",
  LCCN =         "QA76.73.F25 BT22 2019",
  bibdate =      "Thu Apr 16 12:36:44 2020",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.bib;
                 https://www.math.utah.edu/pub/tex/bib/fortran3.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  remark =       "See book review by Michael Metcalf in ACM Fortran
                 Forum, 39(1) 1--2 (2020).",
  tableofcontents = "Introduction / 13 \\
                 1: The Two Births of 1924 / 17 \\
                 2: A Stroll Down Madison Avenue / 27 \\
                 3: Hand-to-Hand Combat with the Machine / 39 \\
                 4: The UNIVAC and the IBM 701 / 43 \\
                 5: Speedcoding / 49 \\
                 6: Building the IBM 704 / 55 \\
                 7: The Automatic Programming Proposal / 59 \\
                 8: Assembling the Team / 73 \\
                 9: The Language Takes Shape / 85 \\
                 10: Punching a Shared Place in History / 93 \\
                 11: A Motley Crew / 105 \\
                 12: Making a Statement / 111 \\
                 13: The Symbolic/SHARE Assembly Program / 127 \\
                 14: Building the Firstr FORTRAN Compiler / 133 \\
                 15: FORTRAN I, Accidentally Distributed / 147 \\
                 16: The (Short) History of FOR TRANSIT / 161 \\
                 17: FORTRAN, the Sequel / 167 \\
                 18: Great Optimism and Little Discipline / 173 \\
                 19: The Need for Some Standards / 177 \\
                 20: Knocking Down the Tower of Babel / 191 \\
                 21: Coloring Outside the Lines / 199 \\
                 22: Setting the Standards, Again / 211 \\
                 23: FORTRAN the Foil: Rise of the Competition / 227 \\
                 24: Implicit None / 263 \\
                 25: In the Shadow of John von Neumann / 277 \\
                 26: High Performance and Beyond / 283 \\
                 27: Too Afraid to Fail / 293 \\
                 In the Beginning \ldots{} / 297 \\
                 Resources / 301 \\
                 Acknowledgments / 323 \\
                 About the Author / 325",
}

@Book{Lorin:1975:SSS,
  author =       "Harold Lorin",
  title =        "Sorting and Sort Systems",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xv + 373",
  year =         "1975",
  ISBN =         "0-201-14453-0",
  ISBN-13 =      "978-0-201-14453-6",
  LCCN =         "QA76.5 .L577 1975",
  bibdate =      "Wed Dec 15 10:38:19 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "The Systems Programming Series",
  acknowledgement = ack-nhfb,
  tableofcontents = "Basic sort concepts and basic sorts \\
                 Exchange sorts and linear insertion \\
                 Shell's sorting method \\
                 Structure in sorting \\
                 Tournament sorts \\
                 Trees in insertion \\
                 Quicksort \\
                 High-order selection sorts \\
                 Internal merging \\
                 Distributive sorts \\
                 Comparison of internal sorts \\
                 The sort phase of an external sort \\
                 Tape merging \\
                 Poliphase tape merging \\
                 Cascade and compromise tape merges \\
                 Oscillating and crisscross merges \\
                 Tape merge overview \\
                 Random-access sorting \\
                 Generalized sorting systems \\
                 Special systems considerations",
}

@Book{Low:1960:PRS,
  author =       "William Low",
  title =        "Paramagnetic Resonance in Solids",
  volume =       "2",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "viii + 212",
  year =         "1960",
  LCCN =         "QC176 .L6 1960",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Solid state physics. Supplement",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{LSBT:2005:BAL,
  author =       "{Core Members of the Linux Standard Base Team}",
  title =        "Building applications with the {Linux Standard Base}",
  publisher =    pub-PHPTR,
  address =      pub-PHPTR:adr,
  pages =        "xxvi + 246",
  year =         "2005",
  ISBN =         "0-13-145695-4 (hardcover)",
  ISBN-13 =      "978-0-13-145695-2 (hardcover)",
  LCCN =         "QA76.76.O63 B8375 2004",
  bibdate =      "Thu Jun 22 05:22:21 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/linux.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib;
                 z3950.loc.gov:7090/Voyager",
  note =         "Foreword by Theodore Ts'o. Includes CD-ROM.",
  URL =          "http://www.freestandards.org/; http://www.lanana.org/;
                 http://www.linuxbase.org/;
                 http://www.linuxbase.org/test/registered.html;
                 http://www.phptr.com/title/0131456954",
  acknowledgement = ack-nhfb,
  baseteam =     "Stuart Anderson and Mark Brown and Kevin Caunt and
                 Marvin Heffler and Andrew Josey and George Kraft IV and
                 Radhakrishnan Sethuraman and Matt Taggart and Kristin
                 Thomas and Theodore Ts'o and Mats Wichmann and Chris
                 Yeoh",
  subject =      "Linux; Operating systems (Computers); Application
                 software; Development",
  tableofcontents = "Part I. Introduction \\
                 1. Understanding the LSB \\
                 2. Ensuring binary compatibility \\
                 Part II. Developing LSB applications \\
                 3. Using LSB coding practices \\
                 4. Packaging your LSB application \\
                 5. Migrating Solaris applications to Linux \\
                 Part III. Certifying for the LSB \\
                 6. LSB certification for Linux distributions \\
                 7. ISB certification for software products \\
                 Part IV. Contributing to the LSB project \\
                 8. Adding new interfaces to the LSB written
                 specification \\
                 9. Adding new architectures to the LSB portfolio \\
                 Part V. Using LSB resources \\
                 10. Using the LSB written specification \\
                 11. Using the LSB test suites \\
                 12. Using the sample implementation \\
                 13. Using the LSB development environment \\
                 14. Using the application battery \\
                 Appendices \\
                 A. GNU free documentation license \\
                 B. Resources \\
                 C. Book logistics",
}

@Book{Lucas:2015:FM,
  author =       "Michael W. Lucas and Allan Jude",
  title =        "{FreeBSD} Mastery: {ZFS}",
  publisher =    "Tilted Windmill Press",
  address =      "????",
  pages =        "xx + 212",
  year =         "2015",
  ISBN =         "0-692-45235-4 (paperback)",
  ISBN-13 =      "978-0-692-45235-6 (paperback)",
  LCCN =         "????",
  bibdate =      "Fri Jun 24 17:30:44 MDT 2016",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "0: Introduction / 1 \\
                 1: Introducing ZFS / 15 \\
                 2: Virtual Devices / 23 \\
                 3: Pools / 45 \\
                 4: ZFS Datasets / 75 \\
                 5: Repairs \& Renovations / 103 \\
                 6: Disk Space Management / 131 \\
                 7: Snapshots and Clones / 161 \\
                 8: Installing to ZFS / 195 \\
                 Afterword / 201 \\
                 About the Authors / 203",
}

@Article{Ludgate:1909:PAM,
  author =       "P. E. Ludgate",
  title =        "On a proposed analytical machine",
  journal =      j-SCI-PROC-ROY-DUBLIN-SOC,
  volume =       "12",
  number =       "9",
  pages =        "77--91",
  year =         "1909",
  bibdate =      "Wed Oct 13 11:14:08 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Reprinted in \cite[\S 2.4]{Randell:1982:ODC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Scientific proceedings of the Royal Dublin Society",
}

@Book{Luke:1969:SFTa,
  author =       "Yudell L. Luke",
  title =        "The Special Functions and Their Approximations",
  volume =       "I",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "xx + 349",
  year =         "1969",
  ISBN =         "0-12-459901-X, 0-08-095560-6 (e-book)",
  ISBN-13 =      "978-0-12-459901-7, 978-0-08-095560-5 (e-book)",
  LCCN =         "QA351 .L94 1969",
  bibdate =      "Wed Dec 15 17:55:35 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Mathematics in Science and Engineering, Volume 53-I,
                 Editor: Richard Bellman",
  URL =          "http://www.sciencedirect.com/science/book/9780124599017",
  acknowledgement = ack-nhfb,
  tableofcontents = "I: Asymptotic expansions \\
                 II: Gamma function and related functions \\
                 III: Hypergeometric functions \\
                 IV: Confluent hypergeometric functions \\
                 V: Generalized hypergeometric function and the
                 $G$-function \\
                 VI: Identification of the $F$ and $G$-functions with
                 the special functions of mathematical physics \\
                 VII: Asymptotic expansions of $F$ for large parameters
                 \\
                 VIII: Orthogonal polynomials \\
                 Bibliography \\
                 Notation Index \\
                 Index",
}

@Book{Luke:1969:SFTb,
  author =       "Yudell L. Luke",
  title =        "The Special Functions and Their Approximations",
  volume =       "II",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "xx + 485",
  year =         "1969",
  ISBN =         "0-12-459902-8",
  ISBN-13 =      "978-0-12-459902-4",
  LCCN =         "QA351 .L797",
  bibdate =      "Wed Dec 15 17:55:38 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Mathematics in Science and Engineering, Volume 53-II,
                 Editor: Richard Bellman",
  URL =          "http://www.sciencedirect.com/science/book/9780124599024",
  acknowledgement = ack-nhfb,
  tableofcontents = "Dedication / v \\
                 Preface / vii--ix \\
                 Contents of Volume I / xv \\
                 Introduction / xvii--xx \\
                 IX: Expansions of Generalized Hypergeometric Functions
                 in Series of Functions of the Same Kind / 1--65 \\
                 X: The $\tau$-Method / 66--91 \\
                 XI: Polynomial and Rational Approximations to
                 Generalized Hypergeometric Functions / 92--132 \\
                 XII: Recursion Formulas for Polynomials and Functions
                 which Occur in Infinite Series and Rational
                 Approximations to Generalized Hypergeometric Functions
                 / 133--166 \\
                 XIII: Polynomial and Rational Approximations for $E(z)
                 = _2F_1(1, \sigma; \rho + 1; 1/z)$ / 167--185 \\
                 XIV: Polynomial and Rational Approximations for the
                 Incomplete Gamma Function / 186--213 \\
                 XV: Trapezoidal Rule Integration Formulas / 214--226
                 \\
                 XVI: Applications / 227--281 \\
                 XVII: Tables of Coefficients / 282--452 \\
                 Bibliography / 453--461 \\
                 Notation Index / 463--467 \\
                 Subject Index to Volumes I and II / 468--485",
}

@Book{Luke:1975:MFT,
  author =       "Yudell L. Luke",
  title =        "Mathematical Functions and Their Approximations",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "xvii + 568",
  year =         "1975",
  ISBN =         "0-12-459950-8, 1-4832-6245-6 (e-book)",
  ISBN-13 =      "978-0-12-459950-5, 978-1-4832-6245-1 (e-book)",
  LCCN =         "QA55 .L96 1975",
  bibdate =      "Fri Jun 30 05:58:16 MDT 2023",
  bibsource =    "ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip;
                 https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "https://shop.elsevier.com/books/mathematical-functions-and-their-approximations/luke/978-0-12-459950-5",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  remark =       "An updated version of part of Handbook of mathematical
                 functions with formulas, graphs, and mathematical
                 tables, edited by M. Abramowitz and I. A. Stegun.
                 Includes indexes.",
  subject =      "Mathematics; Tables; Fonctions (Math{\'e}ematiques);
                 Math{\'e}ematiques; Calculus; Mathematical Analysis;
                 Mathematics; Approximation; Funktion; Mathematik;
                 Spezielle Funktion",
  tableofcontents = "Preface / xv \\
                 \\
                 I. The Gamma Function and Related Functions \\
                 \\
                 1.1 Definitions and Elementary Properties / 1 \\
                 1.2 Power Series and Other Series Expansions / 1 \\
                 1.3 Asymptotic Expansions / 7 \\
                 1.4 Rational Approximations for y (z) / 13 \\
                 1.5 Inequalities / 17 \\
                 1.6 Bibliographic and Numerical Data / 20 \\
                 1.6.1 General References / 20 \\
                 1.6.2 Description of and References to Tables / 21 \\
                 1.6.3 Description of and References to Other
                 Approximations and Expansions / 22 \\
                 \\
                 II. The Binomial Function \\
                 \\
                 2.1 Power Series / 24 \\
                 2.2 Expansions in Series of Jacobi and Chebyshev
                 Polynomials / 24 \\
                 2.3 Expansions in Series of Bessel Functions / 26 \\
                 2.4 Pad{\'e} Approximations / 27 \\
                 24.1 $(1 + 1 / z)^{-c}$ / 27 \\
                 2.4.2 The Square Root / 28 \\
                 2.4.3 Pad{\'e} Coefficients / 30 \\
                 2.4.4 The Function $e^{-w}$ / 31 \\
                 2.5 Inequalities / 34 \\
                 \\
                 III. Elementary Functions \\
                 \\
                 3.1 Logarithmic Functions / 36 \\
                 3.1.1 Power Series / 36 \\
                 3.1.2 Expansion in Series of Chebyshev Polynomials / 38
                 \\
                 3.1.3 Pad{\'e} Approximations / 39 \\
                 3.1.4 Inequalities / 41 \\
                 3.2 Exponential Function / 42 \\
                 3.2.1 Series Expansions / 42 \\
                 3.2.2 Expansions in Series of Jacobi and Chebyshev
                 Polynomials and Bessel Functions / 42 \\
                 3.2.3 Pad{\'e} Approximations / 46 \\
                 3.2.4 Inequalities / 51 \\
                 3.3 Circular and Hyperbolic Functions / 52 \\
                 3.3.1 Power Series / 52 \\
                 3.3.2 Expansions in Series of Jacobi and Chebyshev
                 Polynomials and Bessel Functions / 52 \\
                 3.3.3 Rational and Pad{\'e} Approximations / 57 \\
                 3.3.4 Inequalities / 60 \\
                 3.4 Inverse Circular and Hyperbolic Functions / 61 \\
                 3.4.1 Power Series / 61 \\
                 3.4.2 Expansions in Series of Chebyshev Polynomials /
                 63 \\
                 3.4.3 Pad{\'e} Approximations / 68 \\
                 3.4.4 Inequalities / 72 \\
                 3.5 Bibliographic and Numerical Data / 74 \\
                 3.5.1 Description of and References to Tables / 74 \\
                 3.5.2 Description of and References to Other
                 Approximations and Expansions / 74 \\
                 \\
                 IV. Incomplete Gamma Functions \\
                 \\
                 4.1 Definitions and Series Expansions / 77 \\
                 4.2 Differential Equations and Difference Equations /
                 78 \\
                 4.3 Pad{\'e} Approximations / 79 \\
                 4.3.1 $_1F_1(1; \nu + 1; -z)$ / 79 \\
                 4.3.2 $z^{1 - \nu} e^z \Gamma(\nu, z)$ / 82 \\
                 4.3.3 The Error $T_n(\nu, z)$ for $|{\rm arg} z/k| \leq
                 \pi$ / 84 \\
                 4.3.4 The Negative Real Axis and the Zeros of $F_n(\nu,
                 z)$ / 89 \\
                 4.4 Inequalities / 95 \\
                 4.4.1 $H(\nu, z)$ / 95 \\
                 4.4.2 $\Gamma(\nu, z)$ / 96 \\
                 4.5 Notes on the Computation of the Incomplete Gamma
                 Function / 97 \\
                 4.6 Exponential Integrals / 103 \\
                 4.6.1 Relation to Incomplete Gamma Function and Other
                 Properties / 103 \\
                 4.6.2 Expansions in Series of Chebyshev Polynomials /
                 104 \\
                 4.6.3 Rational and Pad Approximations / 106 \\
                 4.7 Cosine and Sine Integrals / 115 \\
                 4.7.1 Relation to Exponential Integral and Other
                 Properties / 115 \\
                 4.7.2 Expansions in Series of Chebyshev Polynomials /
                 116 \\
                 4.8 Error Functions / 119 \\
                 4.8.1 Relation to Incomplete Gamma Function and Other
                 Properties / 119 \\
                 4.8.2 Expansions in Series of Chebyshev Polynomials and
                 Bessel Functions / 122 \\
                 4.8.3 Pad{\'e} Approximations / 124 \\
                 4.8.4 Trapezoidal Rule Approximations / 134 \\
                 4.8.5 Inequalities / 137 \\
                 4.9 Fresnel Integrals / 139 \\
                 4.9.1 Relation to Error Functions and Other Properties
                 / 139 \\
                 4.9.2 Expansions in Series of Chebyshev Polynomials /
                 140 \\
                 4.10 Bibliographic and Numerical Data / 143 \\
                 4.10.1 References / 143 \\
                 4.10.2 Description of and References to Tables / 143
                 \\
                 4.10.3 Description of and References to Other
                 Approximations and Expansions / 149 \\
                 \\
                 V. The Generalized Hypergeometric Function $_pF_g$ and
                 the $G$-Function \\
                 \\
                 5.1 Introduction / 154 \\
                 5.2 The $_pF_q$ / 155 \\
                 5.2.1 Power Series / 155 \\
                 5.2.2 Derivatives and Contiguous Relations / 159 \\
                 5.2.3 Integral Representations and Integrals Involving
                 the $_pF_q$ / 160 \\
                 5.2.4 Evaluation for Special Values of the Variable and
                 Parameters / 163 \\
                 5.3 The $G$-Function / 170 \\
                 5.3.1 Definition and Relation to the $_pF_q$ / 170 \\
                 5.3.2 Elementary Properties / 176 \\
                 5.3.3 Analytic Continuation of $G_{p, p}^{m, n}(z)$ /
                 178 \\
                 5.4 The Confluence Principle / 179 \\
                 5.5 Multiplication Theorems / 184 \\
                 5.6 Integrals Involving $G$-Functions / 186 \\
                 5.7 Differential Equations / 190 \\
                 5.7.1 The $_pF_q$ / 190 \\
                 5.7.2 The $G$-Function / 192 \\
                 5.8 Series of $G$-Functions / 194 \\
                 5.8.1 Introduction / 194 \\
                 5.8.2 Notation / 194 \\
                 5.8.3 Expansion Theorems / 197 \\
                 5.9 Asymptotic Expansions / 199 \\
                 5.9.1 $G_{p, q}^{q, n}(z)$, $n = 0, 1$ / 199 \\
                 5.9.2 $G_{p, q}^{m, n}(z)$ / 201 \\
                 5.9.3 $_pF_q(z)$ / 206 \\
                 5.10 Expansions in Series of Generalized Jacobi,
                 Generalized Laguerre and Chebyshev Polynomials / 213
                 \\
                 5.10.1 Expansions for $G$-Functions / 213 \\
                 5.10.2 Expansions for $_pF_q$ / 220 \\
                 5.11 Expansions in Series of Bessel Functions / 223 \\
                 5.12 Polynomial and Rational Approximations / 224 \\
                 5.13 Recurrence Formulas for Polynomials and Functions
                 Occurring in Approximations to Generalized
                 Hypergeometric Functions / 234 \\
                 5.13.1 Introduction / 234 \\
                 5.13.2 Recursion Formulas for Extended Jacobi and
                 Laguerre Functions / 235 \\
                 5.13.3 Recursion Formulas for the Numerator and
                 Denominator Polynomials in the Rational Approximations
                 for the Generalized Hypergeometric Function / 244 \\
                 5.13.4 Recursion Formula for Coefficients in the
                 Expansion of the $G$-Function in Series of Extended
                 Jacobi Polynomials / 247 \\
                 5.14 Inequalities / 252 \\
                 \\
                 VI. The Gaussian Hypergeometric Function $_2F_1$ \\
                 \\
                 6.1 Introduction / 257 \\
                 6.2 Elementary Properties / 257 \\
                 6.2.1 Derivatives / 257 \\
                 6.2.2 Contiguous Relations / 258 \\
                 6.2.3 Integral Representations / 259 \\
                 6.3 Differential Equations / 260 \\
                 6.4 Kummer Solutions and Transformation Formulae / 262
                 \\
                 6.5 Analytic Continuation / 263 \\
                 6.6 The Complete Solution and Wronskians / 265 \\
                 6.7 Quadratic Transformations / 270 \\
                 6.8 The $_2F_1$ for Special Values of the Argument /
                 271 \\
                 6.9 Expansion in Series of Chebyshev Polynomials / 274
                 \\
                 6.10 Pad{\'e} Approximations for $_2F_1(1, \sigma;\rho
                 + 1;-1/z)$ / 274 \\
                 6.11 Inequalities / 278 \\
                 6.12 Bibliographic and Numerical Data / 279 \\
                 6.12.1 References / 279 \\
                 6.12.2 Description of and References to Tables / 279
                 \\
                 \\
                 VII. The Confluent Hypergeometric Function \\
                 \\
                 7.1 Introduction / 284 \\
                 7.2 Integral Representations / 284 \\
                 7.3 Elementary Relations / 285 \\
                 7.3.1 Derivatives / 285 \\
                 7.3.2 Contiguous Relations / 285 \\
                 7.3.3 Products of Confluent Functions / 286 \\
                 7.4 Differential Equations / 287 \\
                 7.5 The Complete Solution and Wronskians / 288 \\
                 7.6 Asymptotic Expansions / 291 \\
                 7.7 Expansions in Series of Chebyshev Polynomials / 293
                 \\
                 7.8 Expansions in Series of Besse! Functions / 294 \\
                 7.9 Inequalities / 295 \\
                 7.10 Other Notations and Related Functions / 295 \\
                 7.11 Bibliographic and Numerical Data / 296 \\
                 7.11.1 References / 296 \\
                 7.11.2 Description of and References to Tables and
                 Other Approximations / 296 \\
                 \\
                 VIII. Identification of the $_pF_q$, and $G$-Functions
                 with the Special Functions \\
                 \\
                 8.1 Introduction / 298 \\
                 8.2 Named Special Functions Expressed as $_pF_q$'s /
                 298 \\
                 8.2.1 Elementary Functions / 298 \\
                 8.2.2 The Incomplete Gamma Function and Related
                 Functions / 298 \\
                 8.2.3 The Gaussian Hypergeometric Function / 298 \\
                 8.2.4 Legendre Functions / 299 \\
                 8.2.5 Orthogonal Polynomials / 299 \\
                 8.2.6 Complete Elliptic Integrals / 299 \\
                 8.2.7 Confluent Hypergeometric Functions, Whittaker
                 Functions and Bessel Functions / 300 \\
                 8.3 Named Functions Expressed in Terms of the
                 $G$-Function / 300 \\
                 8.4 The $G$-Function Expressed as a Named Function /
                 306 \\
                 \\
                 IX. Bessel Functions and Their Integrals \\
                 \\
                 9.1 Introduction / 311 \\
                 9.2 Definitions, Connecting Relations and Power Series
                 / 311 \\
                 9.3 Difference--Differential Formulas / 313 \\
                 9.4 Products of Bessel Functions / 314 \\
                 9.5 Asymptotic Expansions for Large Variable / 315 \\
                 9.6 Integrals of Bessel Functions / 315 \\
                 9.7 Expansions in Series of Chebyshev Polynomials / 316
                 \\
                 9.8 Expansions in Series of Bessel Functions / 360 \\
                 9.9 Rational Approximations / 361 \\
                 9.9.1 Introduction / 361 \\
                 9.9.2 $I_\nu(z)$, $z$ Small / 361 \\
                 9.9.3 $K_\nu(z)$, $z$ Large / 366 \\
                 9.10 Computation of Bessel Functions by Use of
                 Recurrence Formulas / 380 \\
                 9.10.1 Introduction / 380 \\
                 9.10.2 Backward Recurrence Schemata for Generating
                 $I_\nu(z)$ / 380 \\
                 9.10.3 Closed Form Expressions / 382 \\
                 9.10.4 Expressions for $J_\nu(z)$ / 389 \\
                 9.10.5 Numerical Examples / 392 \\
                 9.11 Evaluation of Bessel Functions by Application of
                 Trapezoidal Type Integration Formulas / 395 \\
                 9.12 Inequalities / 399 \\
                 9.13 Bibliographic and Numerical Data / 403 \\
                 9.13.1 References / 403 \\
                 9.13.2 Description of and References to Tables / 404
                 \\
                 9.13.3 Description of and References to Other
                 Approximations and Expansions / 410 \\
                 \\
                 X. Lommel Functions, Struve Functions, and Associated
                 Bessel Functions \\
                 \\
                 10.1 Definitions, Connecting Relations and Power Series
                 / 413 \\
                 10.2 Asymptotic Expansions / 415 \\
                 10.3 Expansions in Series of Chebyshev Polynomials and
                 Bessel Functions / 415 \\
                 10.4 Rational Approximations for $H_\nu(z) - Y_\nu(z)$
                 and the Errors in These Approximations / 422 \\
                 10.5 Bibliographic and Numerical Data / 426 \\
                 10.5.1 References / 426 \\
                 10.5.2 Description of and References to Tables / 426
                 \\
                 \\
                 XI. Orthogonal Polynomials \\
                 \\
                 11.1 Introduction / 428 \\
                 11.2 Orthogonal Properties / 428 \\
                 11.3 Jacobi Polynomials / 436 \\
                 11.3.1 Expansion Formulae / 436 \\
                 11.3.2 Difference--Differential Formulae / 439 \\
                 11.3.3 Integrals / 439 \\
                 11.3.4 Expansion of $x^\rho$ in Series of Jacobi
                 Polynomials / 440 \\
                 11.3.5 Convergence Theorems for the Expansion of
                 Arbitrary Functions in Series of Jacobi Polynomials /
                 442 \\
                 11.3.6 Evaluation and Estimation of the Coefficients in
                 the Expansion of a Given Function $f(x)$ in Series of
                 Jacobi Polynomials / 443 \\
                 11.4 The Chebyshev Polynomials $T_n(x)$ and $U_n(x)$ /
                 453 \\
                 11.5 The Chebyshev Polynomials $T_n^*(x)$ and
                 $U_n^*(x)$ / 459 \\
                 11.6 Coefficients for Expansion of Integrals of
                 Functions in Series of Chebyshev Polynomials of the
                 First Kind / 464 \\
                 11.6.1 Introduction / 464 \\
                 11.6.2 Series of Shifted Chebyshev Polynomials / 464
                 \\
                 11.6.3 Series of Chebyshev Polynomials of Even Order /
                 468 \\
                 11.6.4 Series of Chebyshev Polynomials of Odd Order /
                 468 \\
                 11.7 Orthogonality Properties of Chebyshev Polynomials
                 with Respect to Summation / 469 \\
                 11.8 A Nesting Procedure for the Computation of
                 Expansions in Series of Functions Where the Functions
                 Satisfy a Linear Finite Difference Equation / 475 \\
                 \\
                 XII. Computation by Use of Recurrence Formulas \\
                 \\
                 12.1 Introduction / 483 \\
                 12.2 Homogeneous Difference Equations / 483 \\
                 12.3 Inhomogeneous Difference Equations / 487 \\
                 \\
                 XIII. Some Aspects of Rational and Polynomial
                 Approximations \\
                 \\
                 13.1 Introduction / 490 \\
                 13.2 Approximations in Series of Chebyshev Polynomials
                 of the First Kind / 490 \\
                 13.3 The Pad{\'e} Table / 493 \\
                 13.4 Approximation of Functions Defined by a
                 Differential Equation --- The $\tau$-Method / 495 \\
                 13.5 Approximations of Functions Defined by a Series /
                 499 \\
                 13.6 Solution of Differential Equations in Series of
                 Chebyshev Polynomials of the First Kind / 500 \\
                 \\
                 XIV. Miscellaneous Topics \\
                 \\
                 14.1 Introduction / 505 \\
                 14.2 Bernoulli Polynomials and Numbers / 505 \\
                 14.3 $D$ and $\delta$ Operators / 507 \\
                 14.4 Computation and Check of the Tables / 509 \\
                 14.5 Mathematical Constants / 512 \\
                 14.6 Late Bibliography / 516 \\
                 \\
                 Bibliography / 517 \\
                 \\
                 Notation Index / 545 \\
                 \\
                 Subject Index / 551",
}

@Book{Luke:1977:ACM,
  author =       "Yudell L. Luke",
  title =        "Algorithms for the Computation of Mathematical
                 Functions",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "xiii + 284",
  year =         "1977",
  ISBN =         "0-12-459940-0",
  ISBN-13 =      "978-0-12-459940-6",
  LCCN =         "QA351 .L7961",
  bibdate =      "Wed Dec 15 10:38:19 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/mathcw.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Preface / xi \\
                 1: Basic Formulas / 1 \\
                 1.1 Introduction / 1 \\
                 1.2 The Generalized Hypergeometric Function and the
                 $G$-Function / 1 \\
                 1.3 Expansion of $_pF_q(z)$ and $G^{q - r, 1}_{p + 1,
                 q}(z)$, $r = 0$ or $r = 1$, in Series of Chebyshev
                 Polynomials of the First Kind / 4 \\
                 1.4 Efficient Evaluation of Series of Chebyshev
                 Polynomials / 17 \\
                 1.5 Rational Approximations for Generalized
                 Hypergeometric Functions / 20 \\
                 1.6 The Pad{\'e} Table / 27 \\
                 1.7 Computations of and Checks on Coefficients and
                 Tables / 29 \\
                 1.8 Tables of the Functions $e^{-\zeta}$, and
                 $e^{-\xi}$ / 35 \\
                 2: Identification of Functions / 41 \\
                 2.1 Introduction / 41 \\
                 2.2 The Generalized Hypergeometric Function $_pF_q(z)$
                 / 41 \\
                 2.3 The G-Function / 47 \\
                 2.4 Miscellaneous Functions / 48 \\
                 3: General Remarks on the Algorithms and Programs / 49
                 \\
                 3.1 Introduction / 49 \\
                 3.2 Precision and Complex Arithmetic / 49 \\
                 4: Chebyshev Coefficients for $_2F_1(a.b;c;z)$ / 52 \\
                 5: Coefficients for the Expansion of the Confluent
                 Hypergeometric Function $_1F_1(a;c;z)$ in Ascending
                 Series of Chebyshev Polynomials / 70 \\
                 6: Chebyshev Coefficients for $_0F_1(c;z)$ / 77 \\
                 7: Coefficients for the Expansion of $_1F_2(a;b,c;z)$
                 in Ascending Series of Chebyshev Polynomials / 82 \\
                 8: Coefficients for the Expansion of the Confluent
                 Hypergeometric Functions $U(a;c;z)$ and $_1F_1(a;c;-z)$
                 in Descending Series of Chebyshev Polynomials / 88 \\
                 9: Coefficients for the Expansion of the Functions
                 $G^{m,1}_{1,3}(z^2/4|^1_{a,b,c})$, $m = 3$ or $m = 2$,
                 in Descending Series of Chebyshev Polynomials / 101 \\
                 10: Differential and Integral Properties of Expansions
                 in Series of Chebyshev Polynomials of the First Kind /
                 116 \\
                 11: Expansion of Exponential Type Integrals in Series
                 of Chebyshev Polynomials of the First Kind / 126 \\
                 11.1 Introduction / 126 \\
                 11.2 The Representation for $g(x)$ / 127 \\
                 11.3 The Representation for $G(x)$ / 129 \\
                 11.4 Exponential Type Integrals Involving Logarithms /
                 133 \\
                 11.5 Numerical Examples / 135 \\
                 11.6 Errata / 139 \\
                 12: Conversion of a Power Series into a Series of
                 Chebyshev Polynomials of the First Kind / 154 \\
                 13: Rational Approximations for $_2F_1(a,b;c;-z)$ / 159
                 \\
                 14: Pad{\'e} Approximations for $_2F_1(1,b;c;-z)$ / 174
                 \\
                 15: Rational Approximations for $_1F_1(a;c;-z)$ / 182
                 \\
                 16: Pad{\'e} Approximations for $_1F_1(1;c;-z)$ / 192
                 \\
                 17: Rational Approximations for Bessel Functions of the
                 First Kind / 203 \\
                 18: Pad{\'e} Approximations for $I_{\nu +
                 1}(z)/I_\nu(z)$ / 220 \\
                 19: Evaluation of Bessel Functions of the First Kind by
                 Use of the Backward Recurrence Formula \\
                 19.1 Introduction / 230 \\
                 19.2 Backward Recurrence Schemata for $I_\nu(z)$ and
                 $J_\nu(z)$ / 230 \\
                 19.3 Numerical Examples / 240 \\
                 19.4 Mathematical Description of Programs / 243 \\
                 19.4.1 Evaluation of Functions Related to $I_{m +
                 \nu}(z)$ and $J_{m + \nu}(z)$ / 243 \\
                 19.4.2 Evaluation of Functions Related to $e^{-l}I_{m +
                 \nu}(z)$ / 245 \\
                 20: Rational Approximations for $z^aU(a;1 + a - b;z)$ /
                 252 \\
                 21: Pad{\'e} Approximations for $z U(1;2-b;z)$ / 265
                 \\
                 Appendices \\
                 Bibliography / 280 \\
                 Notation Index / 281 \\
                 Subject Index / 283",
  wrongisbn =    "0-12-459940-6",
}

@Book{Lunde:1993:UJI,
  author =       "Ken Lunde",
  title =        "Understanding {Japanese} Information Processing",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xxxii + 435",
  year =         "1993",
  ISBN =         "1-56592-043-0",
  ISBN-13 =      "978-1-56592-043-9",
  LCCN =         "PL524.5.L86 1993",
  bibdate =      "Sun May 02 07:51:15 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See \cite{Reischauer:1988:JTC}.",
  price =        "US\$29.95",
  acknowledgement = ack-nhfb,
}

@Book{Lunde:1999:CIP,
  author =       "Ken Lunde",
  title =        "{CJKV} Information Processing: {Chinese}, {Japanese},
                 {Korean} \& {Vietnamese} Computing",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xxiv + 1101",
  year =         "1999",
  ISBN =         "1-56592-224-7",
  ISBN-13 =      "978-1-56592-224-2",
  LCCN =         "PL1074.5 .L85 1999",
  bibdate =      "Sat Apr 07 10:38:11 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$64.95",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0715/00700462-d.html;
                 http://www.loc.gov/catdir/enhancements/fy1008/00700462-b.html;
                 http://www.oreilly.com/catalog/cjkvinfo/",
  acknowledgement = ack-nhfb # " and " # ack-kl,
  tableofcontents = "Foreword xv\\
                 Preface xvii\\
                 1. CJKV Information Processing Overview 1\\
                 Multiple Writing Systems 2\\
                 Character Set Standards 7\\
                 Encoding Methods 8\\
                 Input Methods 10\\
                 Typography 14\\
                 Basic Concepts & Terminology 14\\
                 2. Writing Systems 29\\
                 Latin Characters & Transliteration 30\\
                 Zhuyin 43\\
                 Kana 44\\
                 Hangul 50\\
                 Chinese Characters 52\\
                 Non-Chinese Chinese Characters 64\\
                 3. Character Set Standards 69\\
                 Non-Coded Character Set Standards 70\\
                 Coded Character Set Standards 74\\
                 International Character Set Standards 124\\
                 Character Set Standard Oddities 134\\
                 Non-Coded Versus Coded Character Sets 136\\
                 Information Interchange Versus Professional Publishing
                 138\\
                 Advice to Developers 140\\
                 4. Encoding Methods 143\\
                 Locale-Independent Encoding Methods 145\\
                 Locale-Specific Encoding Methods 176\\
                 Comparing CJKV Encoding Methods 194\\
                 International Encoding Methods 195\\
                 Charset Designations 206\\
                 Code Pages 209\\
                 Code Conversion 213\\
                 Repairing Unreadable CJKV Text 219\\
                 Beware of Little & Big Endian Issues 224\\
                 Advice to Developers 224\\
                 5. Input Methods 227\\
                 Transliteration Techniques 229\\
                 Input Techniques 235\\
                 User Interface Concerns 249\\
                 Keyboard Arrays 249\\
                 Other Input Hardware 272\\
                 Input Method Software 273\\
                 6. Font Formats 281\\
                 Typeface Design Issues 282\\
                 Bitmapped Fonts 283\\
                 Outline Fonts 289\\
                 Ruby Fonts 322\\
                 Host-Based Versus Printer-Resident Fonts 323\\
                 Creating Your Own Fonts 335\\
                 External Character Handling 339\\
                 Advice to Developers 350\\
                 7. Typography 351\\
                 Rules, Rules, Rules \ldots{} 352\\
                 Typographic Units & Measurements 353\\
                 Horizontal & Vertical Layout 357\\
                 Line Breaking & Word Wrapping 368\\
                 Character Spanning 372\\
                 Alternate Metrics 373\\
                 Kerning 380\\
                 Line Length Issues 381\\
                 Multilingual Text 383\\
                 Glyph Substitution 387\\
                 Annotations 389\\
                 Typographic Software 394\\
                 8. Output Methods 405\\
                 Where Can Fonts Live? 406\\
                 Printer Output 407\\
                 PostScript CJKV Printers 407\\
                 Computer Monitor Output 412\\
                 Other Printing Methods 416\\
                 The Role of Printer Drivers 417\\
                 Output Tips & Tricks 420\\
                 Advice to Developers 422\\
                 9. Information Processing Techniques 425\\
                 Language, Country & Script Codes 426\\
                 Programming Languages 429\\
                 Code Conversion Algorithms 433\\
                 Java Programming Examples 442\\
                 Miscellaneous Algorithms 446\\
                 Byte Versus Character Handling 452\\
                 Character Sorting 460\\
                 Natural Language Processing 462\\
                 Regular Expressions 464\\
                 Search Engines 467\\
                 Code Processing Tools 467\\
                 10. Operating Systems, Text Editors & Word Processors
                 475\\
                 Viewing CJKV Text on Non-CJKV Systems 477\\
                 Operating Systems 477\\
                 Hybrid Environments 489\\
                 Text Editors 492\\
                 Word Processors 499\\
                 Dedicated Word Processors 503\\
                 11. Dictionaries & Dictionary Software 505\\
                 Chinese Character Dictionary Indexes 505\\
                 Character Dictionaries 513\\
                 Other Useful Dictionaries 518\\
                 Dictionary Hardware 519\\
                 Dictionary Software 520\\
                 Machine Translation Software 528\\
                 Machine Translation Services 529\\
                 Learning Aids 530\\
                 12. The Internet 533\\
                 Email 534\\
                 News 539\\
                 FTP & Telnet 540\\
                 Network Domains 542\\
                 Getting Connected 545\\
                 Internet Software 545\\
                 13. The World Wide Web 553\\
                 Content Versus Presentation 553\\
                 Displaying Web Documents 556\\
                 Authoring HTML Documents 557\\
                 Authoring XML Documents 561\\
                 Authoring PDF Documents 562\\
                 Character References 564\\
                 CGI Programming Examples 565\\
                 Shall We Surf? 568\\
                 A. Code Conversion Tables 569\\
                 B. Notation Conversion Table 573\\
                 C. Vendor Character Set Standards 577\\
                 Chinese Vendor Character Sets -- China 578\\
                 Chinese Vendor Character Sets -- Taiwan 582\\
                 Chinese Vendor Character Sets -- Hong Kong 587\\
                 Japanese Vendor Character Sets 593\\
                 Korean Vendor Character Sets 623\\
                 D. Vendor Encoding Methods 635\\
                 Brief Overview of IBM Encodings 636\\
                 Chinese Vendor Encodings -- China 637\\
                 Chinese Vendor Encodings -- Taiwan 640\\
                 Chinese Vendor Encodings -- Hong Kong 643\\
                 Japanese Vendor Encodings 644\\
                 Korean Vendor Encodings 665\\
                 E. GB 2312-80 Table 671\\
                 F. GB/T 12345-90 Table 687\\
                 G. CNS 11643-1992 Table 703\\
                 CNS 11643-1992 Plane 1 703\\
                 CNS 11643-1992 Plane 2 715\\
                 CNS 11643-1992 Plane 3 729\\
                 CNS 11643-1992 Plane 4 741\\
                 CNS 11643-1992 Plane 5 755\\
                 CNS 11643-1992 Plane 6 771\\
                 CNS 11643-1992 Plane 7 783\\
                 CNS 11643-1986 Plane 15 795\\
                 H. Big Five Table 809\\
                 Big Five Level 1 809\\
                 Big Five Level 2 823\\
                 I. Hong Kong GCCS Table 841\\
                 J. JIS X 0208:1997 Table 851\\
                 K. JIS X 0212-1990 Table 865\\
                 L. KS X 1001:1992 Table 877\\
                 M. KS X 1002:1991 Hanja Table 893\\
                 N. Hangul Reading Table 899\\
                 O. TCVN 6056:1995 Table 913\\
                 P. Code Table Indexes 921\\
                 GB 2312-80 Level 1 Reading Index 921\\
                 GB 2312-80 Level 2 Radical Index 922\\
                 Big Five & CNS 11643-1992 Stroke Index 924\\
                 JIS X 0208:1997 Level 1 Reading Index 926\\
                 JIS Radical Index 926\\
                 KS Hanja Reading Index 933\\
                 Q. Character Lists & Mapping Tables 935\\
                 GB 2312-80 Versus GB/T 12345-90 935\\
                 CNS 11643-1986 Versus CNS 11643-1992 954\\
                 JIS C 6226-1978 Versus JIS X 0208-1983 956\\
                 JIS X 0208-1983 Versus JIS X 0208-1990 960\\
                 JIS X 0212-1990 Versus JIS C 6226-1978 962\\
                 Joyo Kanji 963\\
                 IBM Selected Kanji & Non-Kanji 967\\
                 Duplicate Hanja in KS X 1001:1992 971\\
                 R. Chinese Character Lists 979\\
                 Hanzi Lists From China 979\\
                 Hanzi Lists From Taiwan 983\\
                 Kanji Lists From Japan 994\\
                 Hanja Lists From Korea 999\\
                 S. Single-Byte Code Tables 1003\\
                 Non-CJKV Code Tables 1003\\
                 Chinese Code Tables 1005\\
                 Japanese Code Tables 1006\\
                 Korean Code Tables 1008\\
                 TCVN-Roman Code Tables 1009\\
                 T. Software & Document Sources 1015\\
                 Anonymous FTP 1015\\
                 Searching for Files 1016\\
                 Useful URLs 1016\\
                 Commercial Sources 1017\\
                 U. Mailing Lists 1035\\
                 General Mailing Lists 1035\\
                 Chinese Mailing Lists 1040\\
                 Japanese Mailing Lists 1040\\
                 Korean Mailing Lists 1045\\
                 V. Professional Organizations 1047\\
                 Oriental Language Computer Society 1047\\
                 International Macintosh Users Group 1047\\
                 The Localisation Industry Standards Association 1048\\
                 The Unicode Consortium 1048\\
                 W. Perl Code Examples 1049\\
                 Japanese Code Conversion 1049\\
                 Korean Code Conversion 1054\\
                 TRON Code Conversion 1056\\
                 Unicode Code Conversion 1058\\
                 Encoding Detection 1059\\
                 Repairing ISO-2022-JP Encoding 1061\\
                 Other Useful Transformations 1062\\
                 CJKV Encoding Templates 1062\\
                 Multiple-Byte Anchoring 1064\\
                 Multiple-Byte Processing 1065\\
                 X. Glossary 1067\\
                 Bibliography 1095\\
                 Index 1113",
}

@Book{Ma:2009:FPL,
  author =       "M. Y. (Matthew Y.) Ma",
  title =        "Fundamentals of Patenting and Licensing for Scientists
                 and Engineers",
  publisher =    pub-WORLD-SCI,
  address =      pub-WORLD-SCI:adr,
  pages =        "xxiii + 265",
  year =         "2009",
  ISBN =         "981-283-420-6",
  ISBN-13 =      "978-981-283-420-1",
  LCCN =         "T339 .M3 2009",
  bibdate =      "Thu Oct 15 09:07:32 MDT 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.spectrum.ieee.org/at-work/innovation/fundamentals-of-patenting-and-licensing",
  abstract =     "This book is the first of its kind to teach scientists
                 and engineers how to go beyond simply getting a patent
                 granted. It covers various aspects, from basic concepts
                 of patent laws, patent preparation to patent post
                 granting, in an easy-to-understand language for
                 inventors. It also introduces the basis of patent
                 licensing and related business aspects, helping
                 inventors create patents that can be better
                 capitalized. Through the author's extensive scientific
                 background and experience, it provides common pitfalls
                 and tips on how an inventor should assist in all phases
                 of patent filing, prosecution and licensing.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Patents; Patent laws and legislation",
  tableofcontents = "Part 1. The basics \\
                 1. Introduction \\
                 1.1. Ideas to assets: patent value chain \\
                 1.2. The scope and organization of this book \\
                 2. Common misconceptions about patents \\
                 2.1. Exclusive right \\
                 2.2. A single patent protection scheme \\
                 2.3. Trade secret vs. patenting \\
                 2.4. Patents vs. publications \\
                 2.5. Best mode vs. protection \\
                 2.6. A first glance at attorney's draft \\
                 2.7. Patent maturity date \\
                 3. What you should know about patent laws and rules \\
                 3.1. The system of patent laws and rules \\
                 3.2. Types of patents \\
                 3.3. Patent dates \\
                 3.4. Eligibility of priority date \\
                 3.5. Patentability \\
                 3.6. True inventorship \\
                 3.7. Patent ownership \\
                 3.8. Accelerated examination \\
                 3.9. Enablement and best mode \\
                 3.10. Patent search \\
                 3.11. Duty of disclosure \\
                 3.12. No new matter after the disclosure is filed \\
                 3.13. International treaty \\
                 Part 2. Fundamentals in patenting \\
                 4. How to read a patent \\
                 4.1. Anatomy of a patent \\
                 4.2. Find your easiest entry point \\
                 a first glance \\
                 4.3. Understand embodiments of a patent \\
                 4.4. Understand claims \\
                 4.5. Different types of claims \\
                 4.6. Understand the scope of the invention \\
                 4.7. What to look for when you read a patent \\
                 4.8. Published patent application \\
                 5. Innovation harvesting \\
                 5.1. Knowing the art \\
                 5.2. Patentability test \\
                 5.3. Patenting beyond core algorithms \\
                 5.4. Innovation harvesting \\
                 5.5. Patent landscaping \\
                 5.6. Making filing decisions \\
                 6. Preparations before filing \\
                 6.1. Lab book: to document your invention \\
                 6.2. Priority date \\
                 6.3. Prior art and statutory bar against your
                 application \\
                 6.4. Working with attorney \\
                 6.5. Filing it yourself \\
                 6.6. Trade-off solution \\
                 7. Essentials in patent filing \\
                 7.1. Structural parts of a patent and their purposes
                 \\
                 7.2. Specification and claims \\
                 7.3. Citing other people's works \\
                 citations \\
                 7.4. What is considered new matter? 7.5. Broaden and
                 diversify your claims \\
                 Part 3. Patent prosecution and post granting \\
                 8. Patent prosecution \\
                 8.1. Prosecution history \\
                 8.2. Response to office action \\
                 8.3. Duty of disclosure \\
                 8.4. Restriction and election requirements \\
                 8.5. Overcoming rejections \\
                 8.6. When conditional allowance is received \\
                 8.7. Telephone interview with the examiner \\
                 8.8. When final rejection is received \\
                 8.9. Appeal \\
                 8.10. When your claims are allowed at the first office
                 action \\
                 8.11. Protest \\
                 8.12. Continuation-in-part (CIP) and chain of
                 co-pending applications \\
                 9. Tactics For overcoming rejections \\
                 9.1. Common rejections on the merits \\
                 9.2. 112 first paragraph rejection \\
                 9.3. 102 rejection and prior art \\
                 9.4. Overcoming 102 rejection \\
                 9.5. 103 rejection \\
                 9.6. Admission of prior art by applicant \\
                 10. Post patent granting \\
                 10.1. Publications \\
                 10.2. Reissue \\
                 Part 4. Business perspectives and beyond \\
                 11. Patent protection and beyond \\
                 11.1. Patenting should be business driven \\
                 11.2. Defense strategy \\
                 11.3. Offense strategy \\
                 11.4. The ``carrot'' licensing and the ``stick''
                 licensing \\
                 11.5. Patent issues in standards \\
                 11.6. Patent issues in open source \\
                 11.7. Uncovering of infringing products \\
                 12. Patent evaluation and patent maintenance \\
                 12.1. Patent use \\
                 12.2. Market potential \\
                 12.3. Claim quality \\
                 12.4. Technical strength \\
                 12.5. Ease of detection and reverse engineering cost
                 \\
                 12.6. Surrounding patents \\
                 12.7. Patent enforceability \\
                 12.8. About patent maintenance \\
                 13. Patent sales, licensing and common practices \\
                 13.1. Outright sale or licensing \\
                 13.2. Bundling and field of use \\
                 13.3. Patent ownership \\
                 13.4. Litigation history \\
                 14. Patent valuation \\
                 14.1. Intangible assets and why valuation \\
                 14.2. Representative valuation approaches \\
                 14.3. Exemplary case study of patent valuation \\
                 14.4. Patent auction pricing case study \\
                 14.5. Patent infringement damage statistics \\
                 15. Patent search \\
                 15.1. U.S. patent search basics \\
                 15.2. International and other foreign patent databases.
                 \\
                 15.3. Patent classification \\
                 15.4. Progressive patent search \\
                 15.5. USPTO PAIR and image file wrapper",
}

@Book{Macdougall:2011:WGM,
  author =       "Doug Macdougall",
  title =        "Why Geology Matters: Decoding the Past, Anticipating
                 the Future",
  publisher =    pub-U-CALIFORNIA-PRESS,
  address =      pub-U-CALIFORNIA-PRESS:adr,
  pages =        "xv + 285",
  year =         "2011",
  ISBN =         "0-520-26642-0 (hardcover), 0-520-27271-4 (paperback),
                 0-520-94892-0 (e-book)",
  ISBN-13 =      "978-0-520-26642-1 (hardcover), 978-0-520-27271-2
                 (paperback), 978-0-520-94892-1 (e-book)",
  LCCN =         "QE28.3 M334 2011",
  bibdate =      "Mon Sep 18 12:35:18 MDT 2023",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Volcanic dust, climate change, tsunamis, earthquakes
                 --- geoscience explores phenomena that profoundly
                 affect our lives. But more than that, as Doug
                 Macdougall makes clear, the science also provides
                 important clues to the future of the planet. In an
                 entertaining and accessibly written narrative,
                 Macdougall gives an overview of Earth's astonishing
                 history based on information extracted from rocks, ice
                 cores, and other natural archives. He explores such
                 questions as: What is the risk of an asteroid striking
                 Earth? Why does the temperature of the ocean millions
                 of years ago matter today? How are efforts to predict
                 earthquakes progressing? Macdougall also explains the
                 legacy of greenhouse gases from Earth's past and shows
                 how that legacy shapes our understanding of today's
                 human-caused climate change. We find that geoscience in
                 fact illuminates many of today's most pressing issues
                 --- the availability of energy, access to fresh water,
                 sustainable agriculture, maintaining biodiversity ---
                 and we discover how, by applying new technologies and
                 ideas, we can use it to prepare for the future.",
  acknowledgement = ack-nhfb,
  subject =      "Geology; Historical geology; G{\'e}ologie;
                 G{\'e}ologie historique",
  tableofcontents = "Intro / \\
                 Title Page / \\
                 Copyright Page / \\
                 Dedication Page / \\
                 Contents / \\
                 List of Illustrations / ix \\
                 Preface / xi \\
                 Acknowledgments / xv \\
                 1. Set in Stone / 1 \\
                 2. Building Our Planet / 21 \\
                 3. Close Encounters / 35 \\
                 4. The First Two Billion Years / 63 \\
                 5. Wandering Plates / 81 \\
                 6. Shaky Foundations / 101 \\
                 7. Mountains, Life, and the Big Chill / 126 \\
                 8. Cold Times / 147 \\
                 9. The Great Warming / 168 \\
                 10. Reading LIPs / 188 \\
                 11. Restless Giants / 206 \\
                 12. Swimming, Crawling, and Flying Toward the Present /
                 225 \\
                 13. Why Geology Matters / 249 \\
                 Bibliography and Further Reading / 269 \\
                 Index / 279",
}

@Book{MacInnes:1961:PE,
  author =       "Duncan A. MacInnes",
  title =        "The Principles of Electrochemistry",
  publisher =    pub-DOVER,
  address =      pub-DOVER:adr,
  pages =        "478",
  year =         "1961",
  LCCN =         "QD553 .M25 1961",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Reprint of the original 1939 edition.",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Macintyre:2018:STG,
  author =       "Ben Macintyre",
  title =        "The Spy and the Traitor: the Greatest Espionage Story
                 of the {Cold War}",
  publisher =    "Crown Publishing Group",
  address =      "New York, NY, USA",
  year =         "2018",
  ISBN =         "1-101-90419-4 (hardcover), 1-101-90420-8 (e-book)",
  ISBN-13 =      "978-1-101-90419-0 (hardcover), 978-1-101-90420-6
                 (e-book)",
  LCCN =         "UB271.R92 G675 2018",
  bibdate =      "Sat Dec 22 16:32:49 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "If anyone could be considered a Russian counterpart to
                 the infamous British double-agent Kim Philby, it was
                 Oleg Gordievsky. The son of two KGB agents and the
                 product of the best Soviet institutions, the savvy,
                 sophisticated Gordievsky grew to see his nation's
                 communism as both criminal and philistine. He took his
                 first posting for Russian intelligence in 1968 and
                 eventually became the Soviet Union's top man in London,
                 but from 1973 on he was secretly working for MI6. For
                 nearly a decade, as the Cold War reached its twilight,
                 Gordievsky helped the West turn the tables on the KGB,
                 exposing Russian spies and helping to foil countless
                 intelligence plots, as the Soviet leadership grew
                 increasingly paranoid at the United States's nuclear
                 first-strike capabilities and brought the world closer
                 to the brink of war. Desperate to keep the circle of
                 trust close, MI6 never revealed Gordievsky's name to
                 its counterparts in the CIA, which in turn grew
                 obsessed with figuring out the identity of Britain's
                 obviously top-level source. Their obsession ultimately
                 doomed Gordievsky: the CIA officer assigned to identify
                 him was none other than Aldrich Ames, the man who would
                 become infamous for secretly spying for the Soviets.",
  acknowledgement = ack-nhfb,
  author-dates = "1963--",
  subject =      "Gordievsky, Oleg; Spies; Soviet Union; Biography;
                 Intelligence service; History; Cold War",
  tableofcontents = "Operation Pimlico Map / ix \\
                 Introduction: 19 May 1985 / 1 \\
                 Part I \\
                 1: The KGB / 7 \\
                 2: Uncle Gormsson / 24 \\
                 3: SUNBEAM / 41 \\
                 4: Green ink and microfilm / 60 \\
                 5: A plastic bag and a Mars bar / 84 \\
                 6: Agent BOOT / 106 \\
                 Part II \\
                 7: The safe house / 123 \\
                 8: Operation RYAN / 142 \\
                 9: Koba / 160 \\
                 10: Mr Collins and Mrs Thatcher / 165 \\
                 11: Russian roulette / 198 \\
                 Part III \\
                 12: Cat and mouse / 223 \\
                 13: The dry-cleaner / 246 \\
                 14: The Runner / 270 \\
                 15: Finlandia / 293 \\
                 Epilogue: Passport for Pimlico / 312 \\
                 Codenames and aliases / 331 \\
                 Acknowledgements / 333\\
                 References / 335 \\
                 Selected Bibliography / 341 \\
                 Photo Credits / 345 \\
                 Index / 347",
}

@Book{Mackenzie:1980:CCS,
  author =       "Charles E. Mackenzie",
  title =        "Coded Character Sets: History and Development",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xxi + 513",
  year =         "1980",
  ISBN =         "0-201-14460-3",
  ISBN-13 =      "978-0-201-14460-4",
  LCCN =         "QA268 .M27 1980",
  bibdate =      "Wed Dec 15 10:38:43 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$24.95",
  series =       "The Systems Programming Series",
  acknowledgement = ack-nhfb,
  tableofcontents = "The standards process \\
                 Terms and concepts \\
                 Early codes \\
                 The duals of BCDIC \\
                 The size of BCDIC \\
                 The size and structure of PTTC \\
                 The structure of EBCDIC \\
                 The sequence of EBCDIC \\
                 The duals of EBCDIC \\
                 The graphic subsets of EBCDIC \\
                 The card code of EBCDIC \\
                 The new PTTC \\
                 The size and structure of ASCII \\
                 The sequence of ASCII \\
                 Which bit first? \\
                 Decimal ASCII \\
                 Which Hollerith? \\
                 Katakana and the Hollerith card code \\
                 What is a CPU code? \\
                 ASCII in 8-bit interchange environment \\
                 The alphabetic extender problem \\
                 Graphic subsets for the government \\
                 Which ASCII? Logical or, logical not \\
                 A comparison of contiguous, noncontiguous, and
                 interleaved alphabets \\
                 Code extension examples \\
                 The 96-column card code \\
                 Glossary \\
                 Index",
}

@Book{MacMillan:2003:PSM,
  author =       "Margaret MacMillan",
  title =        "{Paris 1919}: six months that changed the world",
  publisher =    pub-RANDOM-HOUSE,
  address =      pub-RANDOM-HOUSE:adr,
  pages =        "xxxi + 570",
  year =         "2003",
  ISBN =         "0-375-50826-0, 0-375-76052-0",
  ISBN-13 =      "978-0-375-50826-4, 978-0-375-76052-5",
  LCCN =         "D644 .M32 2002",
  bibdate =      "Fri Jul 27 12:57:36 MDT 2012",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "For six months in 1919, after the end of ``the war to
                 end all war,'' the Big Three --- President Woodrow
                 Wilson, British prime minister David Lloyd George, and
                 French premier Georges Clemenceau --- met in Paris to
                 shape a lasting peace. [This book] gives a view of
                 those fateful days, which saw new political entities
                 Iraq, Yugoslavia, and Palestine, among them --- born
                 out of the ruins of bankrupt empires, and the borders
                 of the modern world redrawn.",
  acknowledgement = ack-nhfb,
  remark =       "Originally published: New York: Random House Trade
                 Paperbacks, 2003, c2002. Random House Trade Paperback
                 ed.. Previously published: Peacemakers. London: J.
                 Murray, 2001.",
  subject =      "Wilson, Woodrow; Treaty of Versailles; World War,
                 1914--1918; Peace; Germany; History; 1918--1933;
                 Boundaries",
  subject-dates = "1856--1924; (1919)",
  tableofcontents = "Foreword by Richard Holbrooke / vii \\
                 Acknowledgments / xi \\
                 Note on Place-names / xv \\
                 Introduction / xxv \\
                 Part 1: Getting Ready for Peace \\
                 1: Woodrow Wilson comes to Europe / 3 \\
                 2: First impressions / 17 \\
                 3: Paris / 26 \\
                 4: Lloyd George and the British Empire delegation / 36
                 \\
                 Part 2: A new world order \\
                 5: We are the league of the people / 53 \\
                 6: Russia / 63 \\
                 7: League of Nations / 83 \\
                 8: Mandates / 98 \\
                 Part 3: The Balkans again \\
                 9: Yugoslavia / 109 \\
                 10: Rumania / 125 \\
                 11: Bulgaria / 136 \\
                 12: Midwinter break / 143 \\
                 Part 4: The German issue \\
                 13: Punishment and prevention / 157 \\
                 14: Keeping Germany down / 166 \\
                 15: Footing the bill / 180 \\
                 16: Deadlock over the German terms / 194 \\
                 Part 5: Between East and West \\
                 17: Poland reborn / 207 \\
                 18: Czechs and Slovaks / 229 \\
                 19: Austria / 243 \\
                 20: Hungary / 254 \\
                 Part 6: Troubled spring \\
                 21: The Council of Four / 273 \\
                 22: Italy leaves / 279 \\
                 23: Japan and racial equality / 306 \\
                 24: Dagger pointed at the heart of China / 322 \\
                 Part 7: Setting the Middle East alight \\
                 25: The Greatest Greek statesman since Pericles / 347
                 \\
                 26: The End of the Ottomans / 366 \\
                 27: Arab independence / 381 \\
                 28: Palestine / 410 \\
                 29: Atat{\"u}rk and the breaking of S{\`e}vres / 427
                 \\
                 Part 8: Finishing up \\
                 30: Hall of mirrors / 459 \\
                 Conclusion / 485 \\
                 Appendix: Woodrow Wilson's fourteen points / 495 \\
                 Bibliography / 497 \\
                 Notes / 513",
}

@Book{Macomber:1976:DST,
  author =       "James D. Macomber",
  title =        "The Dynamics of Spectroscopic Transitions: Illustrated
                 by Magnetic Resonance and Laser Effects",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xxiv + 332",
  year =         "1976",
  ISBN =         "0-471-56300-5",
  ISBN-13 =      "978-0-471-56300-6",
  LCCN =         "QC454.M8M3",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  subject =      "Nuclear spectroscopy; Magnetic resonance; Quantum
                 optics; Spectroscopie nucl{\'e}aire; R{\'e}sonance
                 magn{\'e}tique; Optique quantique; Magnetic resonance;
                 Nuclear spectroscopy; Quantum optics",
  tableofcontents = "Introduction \\
                 Elementary quantum theory \\
                 Elementary electromagnetic theory \\
                 Interaction of radiation and matter \\
                 Ensembles of radiating systems \\
                 Applications to magnetic resonance \\
                 Generalization to all spectroscopic transitions \\
                 Propagation of light through two-level systems",
}

@Book{Macrae:1992:JNSa,
  author =       "Norman Macrae",
  title =        "{John von Neumann}: The Scientific Genius Who
                 Pioneered the Modern Computer, Game Theory, Nuclear
                 Deterrence, and Much More",
  publisher =    pub-PANTHEON,
  address =      pub-PANTHEON:adr,
  pages =        "x + 405",
  year =         "1992",
  ISBN =         "0-679-41308-1",
  ISBN-13 =      "978-0-679-41308-0",
  LCCN =         "QA29.V66 M33 1992",
  MRclass =      "01A70 (03-03 68-03 90-03)",
  MRnumber =     "1300409 (95g:01023)",
  MRreviewer =   "A. D. Booth",
  bibdate =      "Tue Jun 25 08:46:32 2013",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/t/teller-edward.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  price =        "US\$25.00 (US\$31.50 Can.)",
  abstract =     "The first full-scale biography of the man widely
                 regarded as the greatest scientist of the century after
                 Einstein. Born in Budapest in 1903, John von Neumann
                 grew up in one of the most extraordinary of scientific
                 communities. From his arrival in America in the
                 mid-1930s --- with bases in Boston, Princeton,
                 Washington, and Los Alamos --- von Neumann pioneered
                 and participated in the major scientific and political
                 dramas of the next three decades, leaving his mark on
                 more fields of scientific endeavor than any other
                 scientist. Von Neumann's work in areas such as game
                 theory, mathematics, physics, and meteorology formed
                 the building blocks for the most important discoveries
                 of the century: the modern computer, game theory, the
                 atom bomb, radar, and artificial intelligence, to name
                 just a few. From the laboratory to the highest levels
                 of government, this definitive biography gives us a
                 behind-the-scenes look at the politics and
                 personalities involved in these world-changing
                 discoveries. Written more than thirty years after von
                 Neumann's untimely death at age fifty-six, it was
                 prepared with the cooperation of his family, and
                 includes information gained from interviewing countless
                 sources across Europe and America. Norman Macrae paints
                 a highly readable, humanizing portrait of a man whose
                 legacy still influences and shapes modern science and
                 knowledge.",
  acknowledgement = ack-nhfb,
  remark =       "A Cornelia and Michael Bessie book.",
  subject =      "von Neumann, John; Mathematicians; United States;
                 Biography",
  subject-dates = "1903--1957",
  tableofcontents = "The cheapest way to make the world richer \\
                 A silver spoon in Budapest, 1903--14 \\
                 At the Lutheran Gymnasium, 1914--21 \\
                 An undergraduate with lion's claws, 1921--26 \\
                 Rigor becomes more relaxed, 500 B.C.--A.D. 1931 \\
                 The quantum leap, 1926--32 \\
                 Sturm und Drang, marriage, emigration, 1927--31 \\
                 Depression at Princeton, 1931--37 \\
                 The calculating exploder, 1937--43 \\
                 Los Alamos to Trinity, 1943--45 \\
                 In the domain of economics \\
                 The computers at Philadelphia, 1944--46 \\
                 The computers from Princeton, 1946--52 \\
                 And then the H-Bomb \\
                 With astonishing influence, 1950--56",
}

@Book{Magueijo:2009:BDE,
  author =       "Jo{\~a}o Magueijo",
  title =        "A brilliant darkness: the extraordinary life and
                 disappearance of {Ettore Majorana}, the troubled genius
                 of the nuclear age",
  publisher =    pub-BASIC-BOOKS,
  address =      pub-BASIC-BOOKS:adr,
  pages =        "xxi + 280",
  year =         "2009",
  ISBN =         "0-465-00903-4",
  ISBN-13 =      "978-0-465-00903-9",
  LCCN =         "QC774.M34 M35 2009",
  bibdate =      "Wed Mar 13 06:40:39 MDT 2013",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/f/fermi-enrico.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/m/majorana-ettore.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/physperspect.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "A theoretical physicist reveals one of the greatest
                 untold stories of 20th-century science: the tormented
                 genius Ettore Majorana, who discovered a key element of
                 atomic fission, then disappeared and was never seen
                 again.",
  acknowledgement = ack-nhfb,
  remark =       "Numerous references to Enrico Fermi.",
  subject =      "Majorana, Ettore; Legends; Nuclear physicists; Italy;
                 Biography; Physics; History; 20th century; Neutrinos",
  tableofcontents = "Prologue: a moment of fatigue or moral discomfort
                 \\
                 Part I: Life: the grand inquisitor \\
                 The attic of 251 Via Etnea \\
                 Nuclear crisis \\
                 Frankenstein's youth \\
                 Poltergeist exposed \\
                 Bread and sperm \\
                 Strong interactions \\
                 Meet Ettore Majorana \\
                 Boys will be boys \\
                 Neutrinos from Transylvania \\
                 Ode to the vanquished \\
                 Creation and annihilation \\
                 The serpent's egg \\
                 His unfinished symphony \\
                 The hand that rocks the cradle \\
                 Stellar collapse \\
                 Artichokes \\
                 Meanwhile, at Via Panisperna \\
                 The crepuscule of Via Panisperna \\
                 Ettore's neutrino \\
                 The quiet before the storm \\
                 The search party \\
                 Part II: Afterlife: the dark matter \\
                 Pagliacci \\
                 A pirandellian intermezzo \\
                 Don't cry for him, Argentina \\
                 They thought the sun was sick \\
                 The sign of the beast \\
                 Ettore Majorana \\
                 A vote of silence \\
                 Epilogue: Mediterranean whales",
}

@Book{Mahaffey:2009:AAN,
  author =       "James A. Mahaffey",
  title =        "Atomic awakening: a new look at the history and future
                 of nuclear power",
  publisher =    "Pegasus Books",
  address =      "New York, NY, USA",
  pages =        "xxiii + 344",
  year =         "2009",
  ISBN =         "1-60598-040-4",
  ISBN-13 =      "978-1-60598-040-9",
  LCCN =         "TK9145 .M34 2009; TK9145.M34",
  bibdate =      "Tue Sep 1 16:24:38 MDT 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 library.mit.edu:9909/mit01",
  abstract =     "Evaluates the potential of nuclear technology as a
                 non-polluting, renewable energy source while describing
                 how nuclear energy's negative association with weapons
                 development and the Cold War has stymied the progress
                 of its beneficial uses.",
  acknowledgement = ack-nhfb,
  subject =      "nuclear engineering; nuclear energy",
  tableofcontents = "The paradox inside a puzzle inside a fantasy \\
                 1: The fantasy \\
                 Invisible demons \\
                 A couple of remaining questions \\
                 Einstein drops a bomb \\
                 The other end of the universe \\
                 Breaking open the atom \\
                 2: The puzzle \\
                 A fortuitous condensation of genius \\
                 An implied threat from the Fatherland \\
                 A jolt in the dark \\
                 A light at the mouth of the tunnel \\
                 Post-war planning \\
                 3: The paradox \\
                 A quest for power \\
                 Digging canals, curing cancer, and flying to Jupiter
                 \\
                 The graphite's on fire! \\
                 Nuclear rockets and nuclear airplanes \\
                 The building boom, the bust, and a resurgence \\
                 The radioactive park",
}

@Book{Maiman:2018:LIM,
  author =       "Theodore H. Maiman",
  title =        "The Laser Inventor: Memoirs of {Theodore H. Maiman}",
  publisher =    "Springer International Publishing",
  address =      "Cham, Switzerland",
  pages =        "xxxix + 312 + 89",
  year =         "2018",
  DOI =          "https://doi.org/10.1007/978-3-319-61940-8",
  ISBN =         "3-319-61939-X (hardcover)m 3-319-61940-3 (e-book)",
  ISBN-13 =      "978-3-319-61939-2 (hardcover)m 978-3-319-61940-8
                 (e-book)",
  ISSN =         "2365-0613 (print), 2365-0621 (electronic)",
  ISSN-L =       "2365-0621",
  LCCN =         "QC16 .M356 2018",
  bibdate =      "Thu Aug 30 09:58:42 MDT 2018",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Springer Biographies",
  abstract =     "In these engaging memoirs of a maverick, Theodore H.
                 Maiman describes the life events leading to his
                 invention of the laser in 1960. Maiman succeeded using
                 his expertise in physics and engineering along with an
                 ingenious and elegant design not anticipated by others.
                 His pink ruby laser produced mankind's first-ever
                 coherent light and has provided transformational
                 technology for commerce, industry, telecom, the
                 Internet, medicine, and all the sciences. Maiman also
                 chronicles the?resistance from his employer and
                 the?ongoing intrigue by competing researchers in
                 industry and academia seeking to diminish his
                 contribution in inventing the first laser. This work
                 will appeal to a wide readership, from physicists and
                 engineers through science enthusiasts to general
                 readers. The volume includes extensive photos and
                 documentary materials related to Maiman's life and
                 accomplishments never before published. ``No one beat
                 Maiman to the laser. How important is the laser? How
                 important are all lasers? That is how important we have
                 to regard Maiman's contribution.He and the laser
                 changed all of our lives, everyone's!'' Dr. Nick
                 Holonyak, Jr., Professor of Electrical and Computer
                 Engineering and Physics, University of Illinois at
                 Champaigne-Urbana, and inventor of the light-emitting
                 diode (LED) and co-inventor of the transistor laser
                 ``More than five decades later, we can safely conclude
                 that Theodore Maiman's groundbreaking discovery changed
                 the world. Our modern life just as scientific research
                 would be quite different without the laser.'' Dr.
                 Ferenc Krausz, Director, Max Planck Institute for
                 Quantum Optics, Garching, Germany, and Professor of
                 Physics, Ludwig Maximilian University, Munich, and
                 pioneer in attosecond lasers and attophysics? ``Maiman
                 had the stroke of genius needed to take a different
                 approach [from his competitors]. The sheer elegance and
                 simplicity of his design belies the intellectual
                 achievement it represents. If his invention seems
                 obvious to some today, it was far from obvious in
                 1960.'' Jeff Hecht, authoritative science writer on the
                 historical development of the laser, author of books on
                 lasers and fiber optics.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "Popular works; Physics; Technology; Popular Science;
                 Popular Science in Physics; Popular Science in
                 Technology; Optics, Lasers, Photonics, Optical Devices;
                 History and Philosophical Foundations of Physics",
  tableofcontents = "Dedication \\
                 Acknowledgments \\
                 Introductory Notes (Kathleen Maiman) \\
                 Prologue \\
                 1: Setting the Stage \\
                 2: Stepping Stones \\
                 3: The Ivory Tower \\
                 4: Entering the Real World \\
                 5: The Ruby Maser Distraction \\
                 6: Building Blocks \\
                 7: Laser Chronology \\
                 8: Race to the Light \\
                 9: Three Levels Can't Work: \\
                 10: Obstacles and Solutions \\
                 11: Let There Be Coherent Light \\
                 12: The Light Fantastic \\
                 13: Publication Fiasco: Enter Politics \\
                 14: The News Release \\
                 15: Aftershocks and Ripple Effects \\
                 16: Nullification Tactics \\
                 17: Bandwagoning \\
                 18: Forty Years of Spin \\
                 19: Exploding a Myth \\
                 20: Exit Hughes, Enter Korad \\
                 21: A Solution Looking for a Problem \\
                 22: Hughes Patent Blunders \\
                 23: The Paper Patents \\
                 24: Award Happenings \\
                 25: South American Adventure \\
                 Epilogue: Afterthoughts \\
                 Addendum 1: Speech by Dr. Theodore H. Maiman, July 7,
                 1960, at Press Conference,: New York, Announcing the
                 Creation of the First Laser \\
                 Addendum 2: Ted Maiman and the Laser: 50 Years Later,
                 Tribute by Nick Holonyak, Jr. \\
                 Addendum 3: Maiman's Laser: A Legacy of Limitless
                 Applications, by Jeff Hecht \\
                 Addendum 4: Pretenders to Invention of the Laser, by
                 Kathleen Maiman \\
                 Addendum 5: Scientific Papers and Patents by Theodore
                 H. Maiman \\
                 Addendum 6: Theodore H. Maiman's Major Awards, Prizes,
                 and Citations \\
                 Addendum 7: Table of 35 Nobel Prize Awards Citing the
                 Laser, 1964--2014 \\
                 Addendum 8: Table of Japan Prize Awards Citing the
                 Laser, 1987--2014 \\
                 Addendum 9: U.S. Patent Number 3,353,115: Ruby Laser
                 Systems, Inventor Theodore H. Maiman \\
                 Addendum 10: Reprint of T. H. Maiman,
                 \booktitle{Stimulated Optical Radiation in Ruby}:
                 Nature, 187, 493--494 (August 6, 1960) \\
                 Name Index \\
                 Subject Index",
}

@Article{Malcolm:j-CACM-15-11-949,
  author =       "Michael A. Malcolm",
  title =        "Algorithms to Reveal Properties of Floating-Point
                 Arithmetic",
  journal =      j-CACM,
  volume =       "15",
  number =       "11",
  pages =        "949--951",
  month =        nov,
  year =         "1972",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Malley:2011:RHM,
  author =       "Marjorie Caroline Malley",
  title =        "Radioactivity: a history of a mysterious science",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  pages =        "xxi + 267",
  year =         "2011",
  ISBN =         "0-19-976641-X (hardcover)",
  ISBN-13 =      "978-0-19-976641-3 (hardcover)",
  LCCN =         "QC794.6.R3 M35 2011",
  bibdate =      "Wed Dec 7 07:18:24 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/physperspect.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Radioactivity",
  tableofcontents = "Part One: A new science \\
                 1. The beginnings \\
                 The setting \\
                 Rays and radiation \\
                 Becquerel's discovery \\
                 2. The Curies \\
                 Maria Sk{\l}odowska \\
                 A consequential meeting \\
                 New elements! \\
                 3. Rutherford, Soddy, particles, and alchemy? \\
                 Rutherford and the rays \\
                 Where did the energy come from? \\
                 Material rays? Discovery of the beta particle \\
                 Thorium's rays \\
                 Vanishing radioactivity \\
                 Transmutation! \\
                 A missed discovery \\
                 Reactions \\
                 Atomic energy? \\
                 Tragedy \\
                 More rays \\
                 The alpha particle \\
                 4. The radioactive Earth \\
                 The prospectors \\
                 How old is the earth? \\
                 A new property of matter? \\
                 5. Speculations \\
                 Early theories \\
                 Radioactivity and probability \\
                 Kinetic models of the atom \\
                 6. Radioactivity and chemistry \\
                 The rise of radiochemistry \\
                 Radioactive genealogy \\
                 Chemistry of the imponderable \\
                 Inseparable radioelements \\
                 Isotopes \\
                 Displacement laws \\
                 The end of the lines \\
                 More isotopes \\
                 7. Inside the atom \\
                 Building blocks \\
                 Bombarding atoms \\
                 The nuclear atom \\
                 The nucleus and the periodic table \\
                 The gamma rays \\
                 Theories of the nucleus \\
                 8. Sequel \\
                 War! \\
                 Radioactivity during World War I \\
                 From radioactivity to nuclear and particle physics \\
                 Part Two: Measuring and using radioactivity \\
                 9. Methods and instruments \\
                 Crucial choices \\
                 Standardizing the measures \\
                 Innovations \\
                 Size, money, and machines \\
                 10. Radioactivity, medicine, and life \\
                 Unpleasant surprises \\
                 From burns to treatments \\
                 Rays and other organisms \\
                 Miracle cure? \\
                 Radioactive spas \\
                 Dangers in the laboratory \\
                 11. New industries \\
                 Early industry \\
                 Soaring demand and new institutions \\
                 Paint that glowed in the dark \\
                 A new poison \\
                 Fission, bombs, and the uranium rush \\
                 Radioactivity and the oil industry \\
                 Part Three: Beyond the story \\
                 12. Radioactivity's prime movers \\
                 Technology, resources, and professional changes \\
                 Individuals \\
                 Research groups \\
                 Scientific ideals and culture \\
                 Mentors and models \\
                 Age, attitudes, and ambition \\
                 Nationalism \\
                 13. Radioactivity and timeless questions \\
                 The quest for understanding \\
                 Models and theories for radioactivity \\
                 Patterns in radioactivity's development \\
                 Radioactivity and ideas about change \\
                 Radioactivity and ideas about matter and energy \\
                 Radioactivity and ideas about continuity and
                 discontinuity \\
                 Eternal conundrums \\
                 14. The imaginative appeal of a discovery \\
                 Mythological and romantic dimensions of radioactivity
                 \\
                 An ongoing task \\
                 Appendices \\
                 1. Glossary of Rays and Radiation \\
                 2. Family Trees for Radioactive Elements \\
                 3. Radioactivity's Elusive Cause \\
                 4. Nobel Prize Winners Included in This Book \\
                 5. Radioactivity's Web of Influence \\
                 6. Timeline \\
                 Notes \\
                 Selected Bibliography \\
                 Index of Persons \\
                 Index of Subjects",
}

@Book{Mallory:2013:OI,
  author =       "J. P. Mallory",
  title =        "Origins of the {Irish}",
  publisher =    "Thames and Hudson Ltd.",
  address =      "London, UK",
  pages =        "328",
  year =         "2013",
  ISBN =         "0-500-29330-9 (paperback), 0-500-77137-5 (e-book)",
  ISBN-13 =      "978-0-500-29330-0 (paperback), 978-0-500-77137-2
                 (e-book)",
  LCCN =         "DA910 .M25 2013",
  bibdate =      "Mon Dec 9 07:17:38 MST 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "About eighty million people today can trace their
                 descent back to the occupants of Ireland. But where did
                 the occupants of the island themselves come from and
                 what do we even mean by ``Irish'' in the first place?
                 This is the first major attempt to deal with the core
                 issues of how the Irish came into being. The author
                 emphasizes that the Irish did not have a single origin,
                 but are a product of multiple influences that can only
                 be tracked by employing the disciplines of archaeology,
                 genetics, geology, linguistics, and mythology.
                 Beginning with the collision that fused the two halves
                 of Ireland together, the book traces Ireland's long
                 journey through space and time to become an island. The
                 origins of its first farmers and their monumental
                 impact on the island is followed by an exploration of
                 how metallurgists in copper, bronze, and iron brought
                 Ireland into increasingly wider orbits of European
                 culture. Assessments of traditional explanations of
                 Irish origins are combined with the very latest genetic
                 research into the biological origins of the Irish.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Dedication \\
                 Contents \\
                 Preface \\
                 Introduction \\
                 One: The Origins of Ireland \\
                 Two: First Colonists \\
                 Three: First Farmers \\
                 Four: Beakers and Metal \\
                 Five: The Rise of the Warriors \\
                 Six: The Iron Age \\
                 Seven: The Native Version \\
                 Eight: Skulls, Blood and Genes \\
                 Nine: The Evidence of Language \\
                 Ten: The Origins of the Irish \\
                 Notes \\
                 Bibliography \\
                 Sources of Illustrations \\
                 Index",
}

@Book{Malone:1995:MB,
  author =       "Michael S. Malone",
  title =        "The Microprocessor: a Biography",
  publisher =    pub-TELOS,
  address =      pub-TELOS:adr,
  pages =        "xiv + 333",
  year =         "1995",
  ISBN =         "0-387-94145-2, 0-387-94342-0",
  ISBN-13 =      "978-0-387-94145-5, 978-0-387-94342-8",
  LCCN =         "TK7895.M5 M35 1995",
  bibdate =      "Wed Jan 10 08:22:23 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$49.95",
  abstract =     "This book is not what it seems. It appears to be about
                 technology, but it is really about people. It looks
                 like a history book, but it is really an adventure
                 story. Even its title is an oxymoron. \booktitle{The
                 Microprocessor: A Biography} was not written for a
                 select audience, but for every audience --- and
                 especially for the general reader. The general reader,
                 with little or no understanding of electronics and
                 computers, will find a complete overview of the
                 microprocessor written in a style that is intentionally
                 non-technical and that takes great pains to explain
                 complicated topics. He or she will also find, I hope,
                 an entertaining story about human ambition, greed,
                 teamwork, feuds, and glory.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library. Listed as out-of-print.",
  tableofcontents = "A calculating risk: inventing the first
                 microprocessors \\
                 A revolution in miniature: the importance of the
                 microprocessor \\
                 Fire, water, earth and air: fabricating the
                 microprocessor \\
                 The cities of the planar: how the microprocessor works
                 \\
                 History 1: Beginnings: the first decade \\
                 History 2: The PC era: the second decade \\
                 History 3: Break-out: the third decade \\
                 The future: dreams of light: the microprocessor in the
                 21st century \\
                 Glossary",
}

@InProceedings{Manber:1994:FSF,
  author =       "Udi Manber",
  title =        "Finding Similar Files in a Large File System",
  crossref =     "USENIX:PUC94",
  pages =        "1--10",
  year =         "1994",
  bibdate =      "Wed Aug 10 12:21:21 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Manber:1994:GTS,
  author =       "Udi Manber and Sun Wu",
  title =        "{GLIMPSE}: a Tool to Search Through Entire File
                 Systems",
  crossref =     "USENIX:PUC94",
  pages =        "23--32",
  year =         "1994",
  bibdate =      "Wed Aug 10 12:21:21 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Mandelbrot:1983:FGN,
  author =       "Beno{\^\i}t B. Mandelbrot",
  title =        "The Fractal Geometry of Nature",
  publisher =    pub-W-H-FREEMAN,
  address =      pub-W-H-FREEMAN:adr,
  pages =        "468 + 1",
  year =         "1983",
  ISBN =         "0-7167-1186-9",
  ISBN-13 =      "978-0-7167-1186-5",
  LCCN =         "QA447 .M271 1983",
  bibdate =      "Wed Dec 15 10:38:44 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Updated and augment edition of
                 \cite{Mandelbrot:1983:FGN}, but with same ISBN.",
  abstract =     "Clouds are not spheres, mountains are not cones, and
                 lightening does not travel in a straight line. The
                 complexity of nature's shapes differs in kind, not
                 merely degree, from that of the shapes of ordinary
                 geometry, the geometry of fractal shapes.",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "I: Introduction \\
                 II: Three classic fractals, tamed \\
                 III: Galaxies and eddies \\
                 IV: Scaling fractals \\
                 V: Nonscaling fractals \\
                 VI: Self-mapping fractals \\
                 VII: Randomness \\
                 VIII: Stratified random fractals \\
                 IX: Fractional Brown fractals \\
                 X: Random tremas: texture \\
                 XI: Miscellany \\
                 XII: Of men and ideas",
  subject =      "Geometry; Mathematical models; Stochastic processes;
                 Fractals; G{\'e}om{\'e}trie; Mod{\`e}les
                 math{\'e}matiques; Processus stochastiques; Fractals;
                 Geometry; Mathematical models; Stochastic processes;
                 Fractals; Meetkunde; Natuur; Fraktal",
  tableofcontents = "Introduction. \\
                 Theme \\
                 The irregular and fragmented in nature \\
                 Dimension, symmetry, divergence \\
                 Variations and disclaimers \\
                 Three classic fractals, tamed. \\
                 How long is the coast of Britain? \\
                 Snowflakes and other Koch curves \\
                 Harnessing the Peano Monster curves \\
                 Fractal events and Cantor dusts \\
                 Galaxies and eddies \\
                 Fractal view of galaxy clusters \\
                 Geometry of turbulence \\
                 Intermittency \\
                 Fractal singularities of differential equations \\
                 Scaling fractals \\
                 Length-area-volume relations \\
                 Islands, clusters and percolation \\
                 Diameter-number relations \\
                 Ramification and fractal lattices \\
                 Nonscaling fractals \\
                 Surfaces with positive volume, and flesh \\
                 Trees \\
                 Scaling residues \\
                 Nonuniform fractals \\
                 Trees and the diameter exponent \\
                 Self-mapping fractals \\
                 Self-inverse fractals, Apollonian nets, and soap \\
                 Cantor and Fatou dusts \\
                 Self-squared dragons \\
                 Fractal attractors and fractal (``Chaotic'') evolutions
                 \\
                 Randomness \\
                 Chance as a tool in model making \\
                 Conditional stationarity and cosmographic principles
                 \\
                 Stratified random fractals \\
                 Random curds: contact clusters and fractal percolation
                 \\
                 Random chains and squigs \\
                 Brownian motion and brown fractals \\
                 Random midpoint displacement curves \\
                 Fractional brown fractals \\
                 River discharges \\
                 Scaling nets and noises \\
                 Relief and coastlines \\
                 The areas of Islands, lakes and cups \\
                 A book-within-the-book, in color \\
                 Isothermal surfaces of homogeneous turbulence \\
                 Random tremas \\
                 Texture \\
                 Interval tremas \\
                 Linear L{\'e}vy dusts \\
                 Subordination \\
                 Spatial L{\'e}vy dusts \\
                 Ordered galaxies \\
                 Disc and sphere tremas: moon craters and galaxies \\
                 Texture: gaps and lacunarity \\
                 Cirri and succolarity \\
                 General tremas, and the control of texture \\
                 Miscellany \\
                 Logic of fractals in statistical lattice physics \\
                 Price change and scaling in economics \\
                 Scaling and power laws without geometry \\
                 Mathematical backup and addenda \\
                 Of men and ideas \\
                 Biographical sketches \\
                 Historical sketches \\
                 The path to fractals",
}

@Book{Mao:2004:MCT,
  author =       "Wenbo Mao",
  title =        "Modern Cryptography: Theory and Practice",
  publisher =    pub-PHPTR,
  address =      pub-PHPTR:adr,
  pages =        "xxxviii + 707",
  year =         "2004",
  ISBN =         "0-13-066943-1 (hardcover)",
  ISBN-13 =      "978-0-13-066943-8 (hardcover)",
  LCCN =         "QA76.9.A25 M36 2003",
  bibdate =      "Wed Dec 03 07:48:43 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$54.99",
  abstract =     "Many cryptographic schemes and protocols, especially
                 those based on public-key cryptography, have basic or
                 so-called ``textbook crypto'' versions, as these
                 versions are usually the subjects for many textbooks on
                 cryptography. This book takes a different approach to
                 introducing cryptography: it pays much more attention
                 to fit-for-application aspects of cryptography. It
                 explains why ``textbook crypto'' is only good in an
                 ideal world where data are random and bad guys behave
                 nicely.It reveals the general unfitness of ``textbook
                 crypto'' for the real world by demonstrating numerous
                 attacks on such schemes, protocols and systems under
                 various real-world application scenarios. This book
                 chooses to introduce a set of practical cryptographic
                 schemes, protocols and systems, many of them standards
                 or de facto ones, studies them closely, explains their
                 working principles, discusses their practical usages,
                 and examines their strong (i.e., fit-for-application)
                 security properties, often with security evidence
                 formally established. The book also includes
                 self-contained theoretical background material that is
                 the foundation for modern cryptography.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Part 1. Introduction. Beginning with a simple
                 communication game \\
                 Wrestling between safeguard and attack \\
                 Part 2. Mathematical foundations. Probability and
                 information theory \\
                 Computational complexity \\
                 Algebraic foundations \\
                 Number theory \\
                 Part 3. Basic cryptographic techniques. Encryption:
                 symmetric techniques \\
                 Encryption: asymmetric techniques \\
                 In an ideal world: bit security of the basic public-key
                 cryptographic functions \\
                 Data integrity techniques \\
                 Part 4. Authentication. Authentication protocols:
                 principles \\
                 Authentication protocols: the real world \\
                 Authentication framework for public-key cryptography
                 \\
                 Part 5. Formal approaches to security establishment.
                 Formal and strong security definitions for public-key
                 cryptosystems \\
                 Provably secure and efficient public-key cryptosystems
                 \\
                 Strong and provable security for digital signatures \\
                 Formal methods for authentication protocols analysis
                 \\
                 Part 6. Cryptographic protocols. Zero-knowledge
                 protocols \\
                 Returning to ``coin flipping over telephone'' \\
                 Afterremark",
}

@Book{Maor:1991:IBC,
  author =       "Eli Maor",
  title =        "To Infinity and Beyond: a Cultural History of the
                 Infinite",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "xvi + 284",
  year =         "1991",
  ISBN =         "0-691-02511-8 (paperback)",
  ISBN-13 =      "978-0-691-02511-7 (paperback)",
  LCCN =         "QA9 .M316 1991",
  MRclass =      "*01A05, 01-02, 01A99",
  bibdate =      "Tue Jun 21 18:34:48 MDT 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Princeton paperbacks",
  URL =          "ftp://uiarchive.cso.uiuc.edu/pub/etext/gutenberg/;
                 http://www.loc.gov/catdir/description/prin021/91004396.html;
                 http://www.loc.gov/catdir/samples/prin031/91004396.html;
                 http://www.loc.gov/catdir/toc/prin051/91004396.html",
  ZMnumber =     "0787.01001",
  abstract =     "Eli Maor examines the role of infinity in mathematics
                 and geometry and its cultural impact on the arts and
                 sciences. He evokes the profound intellectual impact
                 the infinite has exercised on the human mind, from the
                 ``horror infiniti'' of the Greeks to the works of M. C.
                 Escher; from the ornamental designs of the Moslems, to
                 the sage Giordano Bruno, whose belief in an infinite
                 universe led to his death at the hands of the
                 Inquisition. But above all, the book describes the
                 mathematician's fascination with infinity, a
                 fascination mingled with puzzlement. ``Maor explores
                 the idea of infinity in mathematics and in art and
                 argues that this is the point of contact between the
                 two, best exemplified by the work of the Dutch artist
                 M. C. Escher, six of whose works are shown here in
                 beautiful color plates.'' ---- Los Angeles Times ``[Eli
                 Maor's] enthusiasm for the topic carries the reader
                 through a rich panorama.'' Choice ``Fascinating and
                 enjoyable. Places the ideas of infinity in a cultural
                 context and shows how they have been espoused and
                 molded by mathematics.'' --- Science.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  remark =       "Originally published: Boston: Birkh{\"a}user, c1987.",
  tableofcontents = "Preface / vii \\
                 Mathematical Infinity \\
                 First Steps to Infinity / 2 \\
                 Zero, One, Infinity / 6 \\
                 Towards Legitimation / 10 \\
                 Numbers Large and Small / 14 \\
                 Convergence and Limit / 17 \\
                 The Prime Numbers / 21 \\
                 The Fascination of Infinite Series / 25 \\
                 The Geometric Series / 29 \\
                 More about Infinite Series / 34 \\
                 Interlude: An Excursion into the Number Concept / 40
                 \\
                 The Discovery of Irrational Numbers / 44 \\
                 A Do-It-Yourself Method for Finding $\sqrt{2}$ 49 \\
                 Three Celebrated Irrationals / 50 \\
                 Cantor's New Look at the Infinite / 54 \\
                 Beyond Infinity / 61 \\
                 Geometric Infinity \\
                 Some Functions and Their Graphs / 68 \\
                 Some Geometric Paradoxes Involving Infinity / 83 \\
                 Inversion in a Circle / 88 \\
                 Geographic Maps and Infinity / 95 \\
                 Tiling the Plane / 102 \\
                 A New Look at Geometry / 108 \\
                 The Vain Search for Absolute Truth / 118 \\
                 Aesthetic Infinity \\
                 Rejoice the Infinite! / 136 \\
                 The M{\"o}bius Strip / 139 \\
                 The Magic World of Mirrors / 149 \\
                 Horror Vacui, Amor Infiniti / 155 \\
                 Escher--Master of the Infinite / 164 \\
                 The Modern Kabbalists / 179 \\
                 Cosmological Infinity \\
                 The Ancient World / 184 \\
                 The New Cosmology / 190 \\
                 The Horizons Are Receding / 199 \\
                 A Paradox and Its Aftermath / 204 \\
                 The Expanding Universe / 212 \\
                 The Modern Atomists / 224 \\
                 Which Way from Here? / 227 \\
                 Epilogue / 232",
}

@Book{Maor:1994:SN,
  author =       "Eli Maor",
  title =        "$e$: The Story of a Number",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "xiv + 223",
  year =         "1994",
  DOI =          "https://doi.org/10.1515/9781400832347",
  ISBN =         "0-691-03390-0",
  ISBN-13 =      "978-0-691-03390-7",
  LCCN =         "QA247.5.M33 1994",
  bibdate =      "Thu Sep 08 11:13:04 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  note =         "This book chronicles the story of the ultimate version
                 number of {\MF}.",
  URL =          "http://www-gap.dcs.st-and.ac.uk/~history/HistTopics/e.html",
  abstract =     "The story of $ \pi $ has been told many times, both in
                 scholarly works and in popular books. But its close
                 relative, the number $e$, has fared less well: despite
                 the central role it plays in mathematics, its history
                 has never before been written for a general audience.
                 The present work fills this gap. Geared to the reader
                 with only a modest background in mathematics, the book
                 describes the story of $e$ from a human as well as a
                 mathematical perspective. In a sense, it is the story
                 of an entire period in the history of mathematics, from
                 the early seventeenth to the late nineteenth century,
                 with the invention of calculus at its center. Many of
                 the players who took part in this story are here
                 brought to life. Among them are John Napier, the
                 eccentric religious activist who invented logarithms
                 and --- unknowingly --- came within a hair's breadth of
                 discovering $e$; William Oughtred, the inventor of the
                 slide rule, who lived a frugal and unhealthful life and
                 died at the age of 86, reportedly of joy when hearing
                 of the restoration of King Charles II to the throne of
                 England; Newton and his bitter priority dispute with
                 Leibniz over the invention of the calculus, a conflict
                 that impeded British mathematics for more than a
                 century; and Jacob Bernoulli, who asked that a
                 logarithmic spiral be engraved on his tombstone but a
                 linear spiral was engraved instead! The unifying theme
                 throughout the book is the idea that a single number
                 can tie together so many different aspects of
                 mathematics --- from the law of compound interest to
                 the shape of a hanging chain, from the area under a
                 hyperbola to Euler's famous formula $ e^{i \pi } = -
                 1$, from the inner structure of a nautilus shell to
                 Bach's equal-tempered scale and to the art of M. C.
                 Escher. The book ends with an account of the discovery
                 of transcendental numbers, an event that paved the way
                 for Cantor's revolutionary ideas about infinity. No
                 knowledge of calculus is assumed, and the few places
                 where calculus is used are fully explained.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  tableofcontents = "Preface / xi \\
                 1. John Napier, 1614 / 3 \\
                 2. Recognition / 11 \\
                 Computing with Logarithms / 18 3. Financial Matters /
                 23 \\
                 4. To the Limit, If It Exists / 28 \\
                 Some Curious Numbers Related to $e$ / 37 \\
                 5. Forefathers of the Calculus / 40 \\
                 6. Prelude to Breakthrough / 49 \\
                 Indivisibles at Work / 56 \\
                 7. Squaring the Hyperbola / 58 \\
                 8. The Birth of a New Science / 70 \\
                 9. The Great Controversy / 83 \\
                 The Evolution of a Notation / 95 \\
                 10. $e^x$: The Function That Equals its Own Derivative
                 / 98 \\
                 The Parachutist / 109 \\
                 Can Perceptions be Quantified? / 111 \\
                 11. $e^\theta$: Spira Mirabilis / 114 \\
                 A Historic Meeting between J. S. Bach and Johann
                 Bernoulli / 129 \\
                 The Logarithmic Spiral in Art and Nature / 134 \\
                 12. $(e^x + e^{-x})/2$: The Hanging Chain / 140 \\
                 Remarkable Analogies / 147 \\
                 Some Interesting Formulas Involving $e$ / 151 \\
                 13. $e^{i x}$: ``The Most Famous of All Formulas'' /
                 153 \\
                 A Curious Episode in the History of $e$ / 162 \\
                 14. $e^{x + i y}$: The Imaginary Becomes Real / 164 \\
                 15. But What Kind of Number Is It? / 183 \\
                 Appendix 1. Some Additional Remarks on Napier's
                 Logarithms / 195 \\
                 Appendix 2. The Existence of $\lim (1 + 1/n)^n$ as $n
                 \to \infty$ / 197 \\
                 Appendix 3. A Heuristic Derivation of the Fundamental
                 Theorem of Calculus / 200 \\
                 Appendix 4. The Inverse Relation between $\lim (b^h -
                 1) / h = 1$ and $\lim (1 + h)^{1 / h} = b$ as $h \to 0$
                 / 202 \\
                 Appendix 5. An Alternative Definition of the
                 Logarithmic Function / 203 \\
                 Appendix 6. Two Properties of the Logarithmic Spiral /
                 205 \\
                 Appendix 7. Interpretation of the Parameter $\phi$ in
                 the Hyperbolic Functions / 208 \\
                 Appendix 8. $e$ to One Hundred Decimal Places / 211 \\
                 Bibliography / 213 \\
                 Index / 217",
}

@Book{Maor:2007:PTY,
  author =       "Eli Maor",
  title =        "The {Pythagorean} Theorem: a 4,000-year History",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "xvi + 259",
  year =         "2007",
  ISBN =         "0-691-12526-0",
  ISBN-13 =      "978-0-691-12526-8",
  LCCN =         "QA460.P8 M36 2007",
  bibdate =      "Thu Feb 14 12:29:09 MST 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0704/2006050969-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0726/2006050969-t.html;
                 http://www.loc.gov/catdir/enhancements/fy0734/2006050969-b.html",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "Pythagorean theorem; History",
  tableofcontents = "Prologue: Cambridge, England, 1993 \\
                 Mesopotamia, 1800 BCE \\
                 Sidebar 1: Did the Egyptians know it? \\
                 Pythagoras \\
                 Euclid's Elements \\
                 Sidebar 2: The Pythagorean theorem in art, poetry, and
                 prose \\
                 Archimedes \\
                 Translators and commentators, 500--1500 CE \\
                 Fran{\c}cois Vi{\`e}te makes history \\
                 From the infinite to the infinitesimal \\
                 Sidebar 3: A remarkable formula by Euler \\
                 371 proofs, and then some \\
                 Sidebar 4: The folding bag \\
                 Sidebar 5: Einstein meets Pythagoras \\
                 Sidebar 6: A most unusual proof \\
                 A theme and variations \\
                 Sidebar 7: A Pythagorean curiosity \\
                 Sidebar 8: A case of overuse \\
                 Strange coordinates \\
                 Notation, notation, notation \\
                 From flat space to curved spacetime \\
                 Sidebar 9: A case of misuse \\
                 Prelude to relativity \\
                 From Bern to Berlin, 1905--1915 \\
                 Sidebar 10: Four Pythagorean brainteasers \\
                 But is it universal? \\
                 Afterthoughts \\
                 Epilogue: Samos, 2005",
}

@Periodical{MAPLETECH,
  editor =       "Tony Scott",
  key =          "MAPLETECH",
  title =        "The Maple Technical Newsletter",
  organization = "Mathematical Institute, University of Oxford",
  publisher =    pub-BIRKHAUSER,
  address =      pub-BIRKHAUSER:adr,
  ISSN =         "1061-5733",
  bibdate =      "Thu Jul 07 18:10:56 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Published twice annually.",
  acknowledgement = ack-nhfb,
}

@Book{Marciano:2014:WHM,
  author =       "John Bemelmans Marciano",
  title =        "Whatever happened to the metric system?: how {America}
                 kept its feet",
  publisher =    "Bloomsbury",
  address =      "New York, NY, USA",
  edition =      "Paperback",
  pages =        "310 + 16",
  year =         "2014",
  ISBN =         "1-60819-475-2 (hardcover), 1-60819-940-1 (paperback),
                 1-60819-941-X (ePub)",
  ISBN-13 =      "978-1-60819-475-9 (hardcover), 978-1-60819-940-2
                 (paperback), 978-1-60819-941-9 (ePub)",
  LCCN =         "QC92.U54 M37 2015; QC92.U6 M37 2015",
  bibdate =      "Thu Sep 24 06:48:55 MDT 2015",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "The American standard system of measurement is a
                 unique and odd thing to behold with its esoteric,
                 inconsistent standards: twelve inches in a foot, three
                 feet in a yard, sixteen ounces in a pound, one hundred
                 pennies in a dollar. For something as elemental as
                 counting and estimating the world around us, it seems
                 like a confusing tool to use. So how did we end up with
                 it?.",
  acknowledgement = ack-nhfb,
  subject =      "Metric system; Weights and measures; United States;
                 History; Metric system; Weights and measures",
  tableofcontents = "The day the metric died \\
                 Thomas Jefferson plans \\
                 American Paris \\
                 Metric systems \\
                 The decimation of everything \\
                 Napoleonic measures \\
                 Lighthouses of the sky \\
                 The internationalists \\
                 A universal coin \\
                 The battle of the standards \\
                 Standard time \\
                 A toolkit for the world \\
                 The Great Calendar Debate \\
                 Shocks to the system \\
                 A metric America \\
                 Isolated \\
                 Appendix A: U.S. customary and metric measures \\
                 Appendix B: Customary metric measures",
}

@Book{Margenau:1956:MPC,
  author =       "Henry Margenau and George Moseley Murphy",
  title =        "The Mathematics of Physics and Chemistry",
  volume =       "1",
  publisher =    "D. Van Nostrand",
  address =      "Princeton, NJ, USA",
  edition =      "Second",
  pages =        "xiv + 604",
  year =         "1956",
  LCCN =         "QA37 .M3818 1956",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  remark =       "First Published, May 1943. Fourteen Reprintings.
                 Second Edition, January 1956. Reprinted June 1956, July
                 1957, March 1959, January 1961, March 1962, January
                 1964, March 1965, March 1967.",
  shorttableofcontents = "1: The Mathematics of Thermodynamics \\
                 2: Ordinary Differential Equations \\
                 3: Special Functions \\
                 4: Vector Analysis \\
                 5: Coordinate Systems. Vectors and Curvilinear
                 Coordinates \\
                 6: Calculus of Variations \\
                 7: Partial Differential Equations of Classical Physics
                 \\
                 8: Eigenvalues and Eigenfunctions \\
                 9: Mechanics of Molecules \\
                 10: Matrices and Matrix Algebra \\
                 11: Quantum Mechanics \\
                 12: Statistical Mechanics \\
                 13: Numerical Calculations \\
                 14: Linear Integral Equations \\
                 15: Group Theory \\
                 Index",
  tableofcontents = "1: The Mathematics of Thermodynamics \\
                 1.1 Introduction / 1 \\
                 1.2 Differentiation of Functions of Several Independent
                 Variables / 2 \\
                 1.3 Total Differentials / 3 \\
                 1.4 Higher Order Differentials / 5 \\
                 1.5 Implicit Functions / 6 \\
                 1.6 Implicit Functions in Thermodynamics / 7 \\
                 1.7 Exact Differentials and Line Integrals / 8 \\
                 1.8 Exact and Inexact Differentials in Thermodynamics /
                 8 \\
                 1.9 The Laws of Thermodynamics / 11 \\
                 1.10 Systematic Derivation of Partial Thermodynamic
                 Derivatives / 15 \\
                 1.11 Thermodynamic Derivatives by Method of Jacobians /
                 17 \\
                 1.12 Properties of the Jacobian / 18 \\
                 1.13 Application to Thermodynamics / 20 \\
                 1.14 Thermodynamic Systems of Variable Mass / 24 \\
                 1.15 The Principle of Carath{\'e}odory / 26 \\
                 2: Ordinary Differential Equations \\
                 2.1 Preliminaries / 32 \\
                 2.2 The Variables are Separable / 33 \\
                 2.3 The Differential Equation Is, or Can be Made, Exact
                 Linear Equations / 41 \\
                 2.4 Equations Reducible to Linear Form / 44 \\
                 2.5 Homogeneous Differential Equations / 45 \\
                 2.6 Note on Singular Solutions. Clairaut's Equation /
                 47 \\
                 2.7 Linear Equations with Constant Coefficients;
                 Right-Hand Member Zero / 48 \\
                 2.8 Linear Equations with Constant Coefficients;
                 Right-Hand Member a Function of $x$ / 53 \\
                 2.9 Other Special Forms of Second Order Differential
                 Equations / 57 \\
                 2.10 Qualitative Considerations Regarding Eq. 27 / 60
                 \\
                 2.11 Example of Integration in Series Legendre's
                 Equation / 61 \\
                 2.12 General Considerations Regarding Series
                 Integration. Fuchs' Theorem / 69 \\
                 2.13 Gauss' (Hypergeometric) Differential Equation / 72
                 \\
                 2.14 Bessel's Equation / 74 \\
                 2.15 Hermite's Differential Equation / 76 \\
                 2.16 Laguerre's Differential Equation / 77 \\
                 2.17 Mathieu's Equation / 78 \\
                 2.18 Pfaff Differential Expressions and Equations / 82
                 \\
                 3: Special Functions \\
                 3.1 Elements of Complex Integration / 89 \\
                 3.1a Theorem of Laurent. Residues / 91 \\
                 3.2 Gamma Function / 93 \\
                 3.3 Legendre Polynomials / 98 \\
                 3.4 Integral Properties of Legendre Polynomials / 104
                 \\
                 3.5 Recurrence Relations between Legendre Polynomials /
                 105 \\
                 3.6 Associated Legendre Polynomials / 106 \\
                 3.7 Addition Theorem for Legendre Polynomials / 109 \\
                 3.8 Bessel Functions / 113 \\
                 3.9 Hankel Functions and Summary on Bessel Functions /
                 118 \\
                 3.10 Hermite Polynomials and Functions / 121 \\
                 3.11 Laguerre Polynomials and Functions / 126 \\
                 3.12 Generating Functions / 132 \\
                 3.13 Linear Dependence / 132 \\
                 3.14 Schwarz' Inequality / 134 \\
                 4: Vector Analysis \\
                 4.1 Definition of a Vector / 137 \\
                 4.2 Unit Vectors / 140 \\
                 4.3 Addition and Subtraction of Vectors / 140 \\
                 4.4 The Scalar Product of Two Vectors / 141 \\
                 4.5 The Vector Product of Two Vectors / 142 \\
                 4.6 Products Involving Three Vectors / 146 \\
                 4.7 Differentiation of Vectors / 148 \\
                 4.8 Scalar and Vector Fields / 149 \\
                 4.9 The Gradient / 150 \\
                 4.10 The Divergence / 151 \\
                 4.11 The Curl / 152 \\
                 4.12 Composite Functions Involving $\nabla$ / 153 \\
                 4.13 Successive Applications of $\nabla$ / 153 \\
                 4.14 Vector Integration / 154 \\
                 4.15 Line Integrals / 155 \\
                 4.16 Surface and Volume Integrals / 156 \\
                 4.17 Stokes' Theorem / 157 \\
                 4.18 Theorem of the Divergence / 159 \\
                 4.19 Green's Theorems / 161 \\
                 4.20 Tensors / 161 \\
                 4.21 Addition, Multiplication and Contraction / 164 \\
                 4.22 Differentiation of Tensors / 167 \\
                 4.23 Tensors and the Elastic Body / 169 \\
                 5: Coordinate Systems. Vectors and Curvilinear
                 Coordinates \\
                 5.1 Curvilinear Coordinates / 172 \\
                 5.2 Vector Relations in Curvilinear Coordinates / 174
                 \\
                 5.3 Cartesian Coordinates / 177 \\
                 5.4 Spherical Polar Coordinates / 177 \\
                 5.5 Cylindrical Coordinates / 178 \\
                 5.6 Confocal Ellipsoidal Coordinates / 178 \\
                 5.7 Prolate Spheroidal Coordinates / 180 \\
                 5.8 Oblate Spheroidal Coordinates / 182 \\
                 5.9 Elliptic Cylindrical Coordinates / 182 \\
                 5.10 Conical Coordinates / 183 \\
                 5.11 Confocal Paraboloidal Coordinates / 184 \\
                 5.12 Parabolic Coordinates / 185 \\
                 5.13 Parabolic Cylindrical Coordinates / 186 \\
                 5.14 Bipolar Coordinates / 187 \\
                 5.15 Toroidal Coordinates / 190 \\
                 5.16 Tensor Relations in Curvilinear Coordinates / 192
                 \\
                 5.17 The Differential Operators in Tensor Notation /
                 195 \\
                 6: Calculus of Variations \\
                 6.1 Single Independent and Single Dependent Variable /
                 198 \\
                 6.2 Several Dependent Variables / 203 \\
                 6.3 Example: Hamilton's Principle / 204 \\
                 6.4 Several Independent Variables / 207 \\
                 6.5 Accessory Conditions; Lagrangian Multipliers / 209
                 \\
                 6.6 Schr{\"o}dinger Equation / 213 \\
                 6.7 Concluding Remarks / 214 \\
                 7: Partial Differential Equations of Classical Physics
                 \\
                 7.1 General Considerations / 216 \\
                 7.2 Laplace's Equation / 217 \\
                 7.3 Laplace's Equation in Two Dimensions / 218 \\
                 7.4 Laplace's Equation in Three Dimensions / 220 \\
                 7.5 Sphere Moving through an Incompressible Fluid
                 without Vortex Formation / 224 \\
                 7.6 Simple Electrostatic Potentials / 224 \\
                 7.7 Conducting Sphere in the Field of a Point Charge /
                 226 \\
                 7.8 The Wave Equation / 228 \\
                 7.9 One Dimension / 231 \\
                 7.10 Two Dimensions / 231 \\
                 7.11 Three Dimensions / 232 \\
                 7.12 Examples of Solutions of the Wave Equation / 235
                 \\
                 7.13 Equation of Heat Conduction and Diffusion / 237
                 \\
                 7.14 Example: Linear Flow of Heat / 238 \\
                 7.15 Two-Dimensional Flow of Heat / 240 \\
                 7.16 Heat Flow in Three Dimensions / 240 \\
                 7.17 Poisson's Equation / 241 \\
                 8: Eigenvalues and Eigenfunctions \\
                 8.1 Simple Examples of Eigenvalue Problems / 246 \\
                 8.2 Vibrating String; Fourier Analysis / 247 \\
                 8.3 Vibrating Circular Membrane. Fourier--Bessel
                 Transforms / 254 \\
                 8.4 Vibrating Sphere with Fixed Surface / 258 \\
                 8.5 Laplace and Related Transformations / 259 \\
                 8.6 Use of Transforms in Solving Differential Equations
                 / 263 \\
                 8.7 Sturm--Liouville Theory / 267 \\
                 8.8 Variational Aspects of the Eigenvalue Problem / 270
                 \\
                 8.9 Distribution of High Eigenvalues / 274 \\
                 8.10 Completeness of Eigenfunctions / 277 \\
                 8.11 Further Comments and Generalizations / 279 \\
                 9: Mechanics of Molecules \\
                 9.1 Introduction / 282 \\
                 9.2 General Principles of Classical Mechanics / 282 \\
                 9.3 The Rigid Body in Classical Mechanics / 284 \\
                 9.4 Velocity, Angular Momentum, and Kinetic Energy /
                 285 \\
                 9.5 The Eulerian Angles / 286 \\
                 9.6 Absolute and Relative Velocity / 289 \\
                 9.7 Motion of a Molecule / 290 \\
                 9.8 The Kinetic Energy of a Molecule / 292 \\
                 9.9 The Hamiltonian Form of the Kinetic Energy / 293
                 \\
                 9.10 The Vibrational Energy of a Molecule / 294 \\
                 9.11 Vibrations of a Linear Triatomic Molecule / 297
                 \\
                 9.12 Quantum Mechanical Hamiltonian / 299 \\
                 10: Matrices and Matrix Algebra \\
                 10.1 Arrays / 302 \\
                 10.2 Determinants / 302 \\
                 10.3 Minors and Cofactors / 303 \\
                 10.4 Multiplication and Differentiation of Determinants
                 / 304 \\
                 10.5 Preliminary Remarks on Matrices / 305 \\
                 10.6 Combination of Matrices / 306 \\
                 10.7 Special Matrices / 307 \\
                 10.8 Real Linear Vector Space / 311 \\
                 10.9 Linear Equations / 313 \\
                 10.10 Linear Transformations / 314 \\
                 10.11 Equivalent Matrices / 316 \\
                 10.12 Bilinear and Quadratic Forms / 317 \\
                 10.13 Similarity Transformations / 318 \\
                 10.14 The Characteristic Equation of a Matrix / 318 \\
                 10.15 Reduction of a Matrix to Diagonal Form / 319 \\
                 10.16 Congruent Transformations / 322 \\
                 10.17 Orthogonal Transformations / 324 \\
                 10.18 Hermitian Vector Space / 328 \\
                 10.19 Hermitian Matrices / 329 \\
                 10.20 Unitary Matrices / 330 \\
                 10.21 Summary on Diagonalization of Matrices / 331 \\
                 11: Quantum Mechanics \\
                 11.1 Introduction / 333 \\
                 11.2 Definitions / 335 \\
                 11.3 Postulates / 337 \\
                 11.4 Orthogonality and Completeness of Eigenfunctions /
                 344 \\
                 11.5 Relative Frequencies of Measured Values / 346 \\
                 11.6 Intuitive Meaning of a State Function / 347 \\
                 11.7 Commuting Operators / 348 \\
                 11.8 Uncertainty Relation / 348 \\
                 11.9 Free Mass Point / 350 \\
                 11.10 One-Dimensional Barrier Problems / 353 \\
                 11.11 Simple Harmonic Oscillator / 358 \\
                 11.12 Rigid Rotator, Eigenvalues and Eigenfunctions of
                 $L^2$ / 360 \\
                 11.13 Motion in a Central Field / 363 \\
                 11.14 Symmetrical Top / 368 \\
                 11.15 General Remarks on Matrix Mechanics / 371 \\
                 11.16 Simple Harmonic Oscillator by Matrix Methods /
                 372 \\
                 11.17 Equivalence of Operator and Matrix Methods / 374
                 \\
                 11.18 Variational (Ritz) Method / 377 \\
                 11.19 Example: Normal State of the Helium Atom / 380
                 \\
                 11.20 The Method of Linear Variation Functions / 383
                 \\
                 11.21 Example: The Hydrogen Molecular Ion Problem / 385
                 \\
                 11.22 Perturbation Theory / 387 \\
                 11.23 Example: Non-Degenerate Case. The Stark Effect /
                 391 \\
                 11.24 Example: Degenerate Case. The Normal Zeeman
                 Effect / 392 \\
                 11.25 General Considerations Regarding Time-Dependent
                 States / 393 \\
                 11.26 The Free Particle; Wave Packets / 396 \\
                 11.27 Equation of Continuity, Current / 399 \\
                 11.28 Application of Schr{\"o}dinger's Time Equation.
                 Simple Radiation Theory / 400 \\
                 11.29 Fundamentals of the Pauli Spin Theory / 402 \\
                 11.30 Applications / 408 \\
                 11.31 Separation of the Coordinates of the Center of
                 Mass in the Many-Body Problem / 411 \\
                 11.32 Independent Systems / 414 \\
                 11.33 The Exclusion Principle / 415 \\
                 11.34 Excited States of the Helium Atom / 418 \\
                 11.35 The Hydrogen Molecule / 424 \\
                 12: Statistical Mechanics \\
                 12.1 Permutations and Combinations / 431 \\
                 12.2 Binomial Coefficients / 433 \\
                 12.3 Elements of Probability Theory / 435 \\
                 12.4 Special Distributions / 438 \\
                 12.5 Gibbsian Ensembles / 442 \\
                 12.6 Ensembles and Thermodynamics / 444 \\
                 12.7 Further Considerations Regarding the Canonical
                 Ensemble / 448 \\
                 12.8 The Method of Darwin and Fowler / 452 \\
                 12.9 Quantum Mechanical Distribution Laws / 453 \\
                 12.10 The Method of Steepest Descents / 459 \\
                 13: Numerical Calculations \\
                 13.1 Intro duct ion / 467 \\
                 13.2 Interpolation for Equal Values of the Argument /
                 467 \\
                 13.3 Interpolation for Unequal Values of the Argument /
                 470 \\
                 13.4 In verse Interpolation / 471 \\
                 13.5 Two-way Interpolation / 471 \\
                 13.6 Differentiation Using Interpolation Formula / 472
                 \\
                 13.7 Differentiation Using a Polynomial / 473 \\
                 13.8 Introduction to Numerical Integration / 473 \\
                 13.9 The Euler--Maclaurin Formula / 474 \\
                 13.10 Gregory's Formula / 476 \\
                 13.11 The Newton--Cotes Formula / 476 \\
                 13.12 Gauss' Method / 479 \\
                 13.13 Remarks Concerning Quadrature Formulas / 481 \\
                 13.14 Introduction to Numerical Solution of
                 Differential Equations / 482 \\
                 13.15 The Taylor Series Method / 483 \\
                 13.16 The Method of Picard (Successive Approximations
                 or Iteration) / 484 \\
                 13.17 The Modified Euler Method / 485 \\
                 13.18 The Runge--Kutta Method / 486 \\
                 13.19 Continuing the Solution / 487 \\
                 13.20 Milne's Method / 489 \\
                 13.21 Simultaneous Differential Equations of the First
                 Order / 489 \\
                 13.22 Differential Equations of Second or Higher Order
                 / 490 \\
                 13.23 Numerical Solution of Transcendental Equations /
                 491 \\
                 13.24 Simultaneous Equations in Several Unknowns / 493
                 \\
                 13.25 Numerical Determination of the Roots of
                 Polynomials / 494 \\
                 13.26 Numerical Solution of Simultaneous Linear
                 Equations / 497 \\
                 13.27 Evaluation of Determinants / 499 \\
                 13.28 Solution of Secular Determinants / 500 \\
                 13.29 Errors / 504 \\
                 13.30 Principle of Least Squares / 506 \\
                 13.31 Errors and Residuals / 507 \\
                 13.32 Measures of Precision / 510 \\
                 13.33 Precision Measures and Residuals / 513 \\
                 13.34 Experiments of Unequal Weight / 514 \\
                 13.35 Probable Error of a Function / 515 \\
                 13.36 Rejection of Observations / 516 \\
                 13.37 Empirical Formulas / 516 \\
                 14: Linear Integral Equations \\
                 14.1 Definitions and Terminology / 520 \\
                 14.2 The Liouville--Neumann Series / 521 \\
                 14.3 Fredholm's Method of Solution / 526 \\
                 14.4 The Schmidt--Hilbert Method of Solution / 528 \\
                 14.5 Summary of Methods of Solution / 532 \\
                 14.6 Relation between Differential and Integral
                 Equations. / 532 \\
                 14.7 Green's Function / 534 \\
                 14.8 The Inhomogeneous Sturm--Liouville Equation / 538
                 \\
                 14.9 Some Examples of Green's Function / 539 \\
                 14.10 Abel's Integral Equation / 541 \\
                 14.11 Vibration Problems / 542 \\
                 15: Group Theory \\
                 15.1 Definitions / 545 \\
                 15.2 Subgroups / 546 \\
                 15.3 Classes / 547 \\
                 15.4 Complexes / 548 \\
                 15.5 Conjugate Subgroups / 548 \\
                 15.6 Isomorphism / 549 \\
                 15.7 Representation of Groups / 550 \\
                 15.8 Reduction of a Representation / 552 \\
                 15.9 The Character / 554 \\
                 15.10 The Direct Product / 556 \\
                 15.11 The Cyclic Group / 557 \\
                 15.12 The Symmetric Group / 558 \\
                 15.13 The Alternating Group / 561 \\
                 15.14 The Unitary Group / 562 \\
                 15.15 The Three-Dimensional Rotation Groups / 565 \\
                 15.16 The Two-Dimensional Rotation Groups / 570 \\
                 15.17 The Dihedral Groups / 572 \\
                 15.18 The Crystallographic Point Groups / 574 \\
                 15.19 Applications of Group Theory / 581 \\
                 Index / 587",
  xxISBN =       "none",
}

@Book{Margulis:1990:IMA,
  author =       "Neal Margulis",
  title =        "i860 Microprocessor Architecture",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "xxiii + 631",
  year =         "1990",
  ISBN =         "0-07-881645-9",
  ISBN-13 =      "978-0-07-881645-1",
  LCCN =         "QA76.5.M37 1990",
  bibdate =      "Wed Dec 15 10:38:45 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

@Book{Markstein:2000:IEF,
  author =       "Peter Markstein",
  title =        "{IA-64} and Elementary Functions: Speed and
                 Precision",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xix + 298",
  year =         "2000",
  ISBN =         "0-13-018348-2",
  ISBN-13 =      "978-0-13-018348-4",
  LCCN =         "QA76.9.A73 M365 2000",
  bibdate =      "Fri Jan 5 08:00:52 MST 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/intel-ia-64.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/microchip.bib;
                 University of California MELVYL catalog.",
  series =       "Hewlett--Packard professional books",
  URL =          "http://www.markstein.org/",
  acknowledgement = ack-nhfb,
  keywords =     "IA-64 (computer architecture)",
  remark =       "Besides recipes for accurate computation of elementary
                 functions, this book also contains algorithms for the
                 correctly-rounded computation of floating-point
                 division and square-root, and of integer division,
                 starting from low-precision reciprocal approximations.
                 There is also a wealth of information on the tradeoffs
                 between integer and floating-point instruction use in a
                 pipelined parallel architecture.",
  tableofcontents = "IA-64 Architecture \\
                 New Architecture Objectives \\
                 VLIW \\
                 Memory Enhancements \\
                 Software Pipelining \\
                 Floating Point Enhancements \\
                 Summary \\
                 IA-64 Instructions And Registers \\
                 Instructions \\
                 Register Sets \\
                 Accessing Memory \\
                 Assembly Language \\
                 Problems \\
                 Increasing Instruction Level Parallelism \\
                 Branching \\
                 Speculation \\
                 Problems \\
                 Floating Point Architecture \\
                 Floating Point Status Register \\
                 Precision \\
                 Fused Multiply-Add \\
                 Division and Square Root Assists \\
                 Floating Comparisons \\
                 Communication between Floating Point and General
                 Purpose Registers \\
                 Fixed Point Multiplication \\
                 SIMD Arithmetic \\
                 Problems \\
                 Programming For IA-64 \\
                 Compiler Options \\
                 Pragmas \\
                 Floating Point Data Types \\
                 In-Line Assembly \\
                 The fenv.h Header \\
                 Extended Examples \\
                 Quad Precision \\
                 Problems \\
                 Computation of Elementary Functions \\
                 Mathematical Preliminaries \\
                 Floating Point \\
                 Approximation and Error Analysis \\
                 The Exclusion Theorem \\
                 Ulps \\
                 Problems \\
                 Approximation Of Functions \\
                 Taylor Series \\
                 Lagrangian Interpolation \\
                 Chebychev Approximation \\
                 Remez Approximation \\
                 Practical Considerations \\
                 Function Evaluation \\
                 Table Construction \\
                 Problems \\
                 Division \\
                 Approximations for the Reciprocal \\
                 Computing the Quotient \\
                 Division Using Only Final Precision Results \\
                 Fast Variants of Division \\
                 Remainder \\
                 Integer Division \\
                 An Implementation of Division \\
                 Problems \\
                 Square Root \\
                 Approximations \\
                 Rounding the Square Root \\
                 Computing the Square Root \\
                 Calculating the Reciprocal Square Root \\
                 An Implementation of Square Root \\
                 Problems \\
                 Exponential Functions \\
                 Definitions and Formulas \\
                 Argument Reduction \\
                 Error Containment \\
                 Computing the Exponential \\
                 The Function expm \\
                 Problems \\
                 Logarithmic Functions \\
                 General Relations \\
                 Argument Reductions \\
                 Error Analysis \\
                 The Function log1p \\
                 Computing the Logarithm \\
                 Problems \\
                 The Power Function \\
                 Definition \\
                 Single Precision \\
                 Double Precision \\
                 Double-Extended Precision \\
                 Quad Precision \\
                 Computing the Power Function \\
                 Problems \\
                 Trigonometric Functions \\
                 Formulas and Identities \\
                 Argument Reduction \\
                 Error Analysis \\
                 Computing the Trigonometric Functions \\
                 Problems \\
                 Inverse Sine And Cosine \\
                 Definitions and Formulas \\
                 Argument Reduction \\
                 Error Analysis \\
                 Computing the arcsin \\
                 Problems \\
                 Inverse Tangent Functions \\
                 Definitions and Formulas \\
                 Argument Reduction \\
                 Error Analysis \\
                 Computing the arctan \\
                 Problems \\
                 Hyperbolic Functions \\
                 Definitions and Formulas \\
                 Argument Reduction \\
                 Error Analysis \\
                 Computing the Hyperbolic Functions \\
                 Problems \\
                 Inverse Hyperbolic Functions \\
                 Definitions and Formulas. arcsinh. arccosh. arctanh \\
                 Problems \\
                 Odds And Ends \\
                 Correctly Rounded Functions \\
                 Monotonicity \\
                 Alternative Algorithms \\
                 Testing \\
                 New Architectural Directions \\
                 Problems \\
                 In-Line Assembly \\
                 Solutions To Problems \\
                 Bibliography \\
                 Subject Index",
}

@Book{Marshall:1997:WAS,
  author =       "I. N. Marshall and Danah Zohar and F. David Peat",
  title =        "Who's afraid of {Schr{\"o}dinger}'s cat?: all the new
                 science ideas you need to keep up with the new
                 thinking",
  publisher =    "Morrow",
  address =      "New York, NY, USA",
  pages =        "xxx + 402",
  year =         "1997",
  ISBN =         "0-688-11865-8",
  ISBN-13 =      "978-0-688-11865-5",
  LCCN =         "Q158.5 .M356 1997",
  bibdate =      "Fri Aug 8 06:17:25 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/s/schroedinger-erwin.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Science",
  tableofcontents = "Absolute zero \\
                 Actuality and potentiality in quantum mechanics \\
                 Anthropic principle \\
                 Antimatter \\
                 Arrow of time \\
                 Artificial intelligence \\
                 Artificial life \\
                 Atomism \\
                 Attention \\
                 Attractors \\
                 Autopoietic systems \\
                 Becoming \\
                 Behaviorism \\
                 Bell's theorem \\
                 Big bang \\
                 Binding problem \\
                 Black box \\
                 Black holes \\
                 Blindsight \\
                 Bose--Einstein condensation \\
                 Bosons \\
                 Butterfly effect \\
                 Catastrophe theory \\
                 Causality --Chaos and self-organization \\
                 Chaos theories of mind \\
                 Chemical abundances \\
                 Chemical organization \\
                 Chinese room \\
                 Church-Turing thesis \\
                 Coevolution \\
                 Cognitive psychology \\
                 Cognitive science \\
                 Coherence \\
                 Cold fusion \\
                 Collapse of wave function \\
                 Color: what is it? \\
                 Complementarity \\
                 Complexity \\
                 Computational psychology \\
                 Connectionism \\
                 Consciousness, toward a science of \\
                 Construction copier machines \\
                 Contextualism \\
                 Continuous symmetries \\
                 Cosmic background radiation \\
                 Cosmological principle \\
                 Cosmology \\
                 CPT symmetry \\
                 Crick's hypothesis \\
                 Cybernetics \\
                 Dark matter \\
                 Darwinian evolution \\
                 Determinism \\
                 Dissipative structures \\
                 Distance measurements in astronomy \\
                 DNA \\
                 Edge of chaos \\
                 Electroweak force \\
                 Emergence \\
                 Entropy \\
                 Equilibrium \\
                 Expanding universe \\
                 Expert systems \\
                 Feedback \\
                 Psychology in 20th century \\
                 Punctuated equilibrium \\
                 Quantum \\
                 Quantum chromodynamics \\
                 Quantum electrodynamics \\
                 Quantum field theory \\
                 Quantum gravity \\
                 Quantum hussy \\
                 Quantum physics \\
                 Quantum theories of mind \\
                 Quantum tunneling \\
                 Quantum vacuum \\
                 Quarks \\
                 Quasars \\
                 Reductionism \\
                 Relativistic cosmology \\
                 Relativity and relativism \\
                 Resonance \\
                 Second law of thermodynamics \\
                 Self-energy \\
                 Serial processing \\
                 Sociobiology \\
                 Solitions \\
                 Special relativity \\
                 Speed of light \\
                 Spin and statistics \\
                 Split-brain phenomena \\
                 Standard model \\
                 Stars \\
                 Statistical mechanics \\
                 Steady-state hypothesis \\
                 Structuralism \\
                 Superconductors \\
                 Superfluids \\
                 Supergravity \\
                 Supernovas \\
                 Superpositions \\
                 Superstrings \\
                 Supersymmetry \\
                 Symmetry \\
                 Symmetry Breaking \\
                 Systems Theory \\
                 Tachyons \\
                 Teleology \\
                 Theories of Everything \\
                 Thermodynamics \\
                 Thinking \\
                 The Three-Body Problem \\
                 Time \\
                 Time Travel \\
                 Transpersonal psychology \\
                 Turing machines \\
                 The Turing Test \\
                 The Twins Paradox \\
                 Twistors \\
                 Virtual particles \\
                 Virtual transitions \\
                 Visual perception \\
                 Vitalism \\
                 The wave equation and Schr{\"o}dinger's equation \\
                 Wave/particle duality \\
                 Wormholes \\
                 Wrinkles in the microwave background \\
                 Index",
}

@Book{Martel:2014:MCW,
  author =       "Gordon Martel",
  title =        "The month that changed the world: {July 1914}",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  pages =        "xxii + 484",
  year =         "2014",
  ISBN =         "0-19-966538-9 (hardcover)",
  ISBN-13 =      "978-0-19-966538-9 (hardcover)",
  LCCN =         "D511 .M268 2014",
  bibdate =      "Thu Jan 11 15:29:59 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.h-net.org/reviews/showrev.php?id=42971;
                 http://www.loc.gov/catdir/enhancements/fy1604/2013953482-b.html;
                 http://www.loc.gov/catdir/enhancements/fy1604/2013953482-d.html;
                 http://www.loc.gov/catdir/enhancements/fy1604/2013953482-t.html",
  abstract =     "Dedicating a chapter to every day of July 1914, the
                 author retraces the actions that led to World War I,
                 beginning with the assassination of Archduke Franz
                 Ferdinand and following leaders of the time as they
                 escalated the crisis.",
  acknowledgement = ack-nhfb,
  subject =      "World War, 1914--1918; Causes; Diplomatic history;
                 Europe; History; July Crisis, 1914; Austria; Franz
                 Joseph I, 1848--1916; Weltkrieg; Kriegsausbruch",
  tableofcontents = "The long European peace \\
                 The making of a crisis \\
                 The killing \\
                 The reaction \\
                 The July Crisis \\
                 Friday, 24 July \\
                 Saturday, 25 July \\
                 Sunday, 26 July \\
                 Monday, 27 July \\
                 Tuesday, 28 July \\
                 Wednesday, 29 July \\
                 Thursday, 30 July \\
                 Friday, 31 July \\
                 Days of decision \\
                 Saturday to Tuesday, 1--4 August \\
                 The aftermath \\
                 Making sense of the madness",
}

@Book{Martin:2015:DBD,
  author =       "Anthony J. Martin",
  title =        "Dinosaurs Without Bones: Dinosaur Lives Revealed by
                 Their Trace Fossils",
  publisher =    "Pegasus Books",
  address =      "New York, NY, USA",
  pages =        "460 + 24",
  year =         "2015",
  ISBN =         "1-60598-703-4 (paperback)",
  ISBN-13 =      "978-1-60598-703-3 (paperback)",
  LCCN =         "QE861.4 .M367 2015",
  bibdate =      "Mon Aug 3 14:52:51 MDT 2015",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Martin introduces readers to the world of ichnology,
                 the study of traces and trace fossils -- such as
                 tracks, trails, burrows, nests, toothmarks, and other
                 vestiges of behavior -- and how by utilizing these
                 clues, scientists explore and intuit the rich and
                 complicated lives of dinosaurs during the Mesozoic
                 era.",
  acknowledgement = ack-nhfb,
  author-dates = "1960--",
  subject =      "Dinosaurs; Ichnology; Trace fossils; Paleontology;
                 Mesozoic; Dinosaurs; Ichnology; Mesozoic Geologic
                 Period; Paleontology; Trace fossils",
  tableofcontents = "Sleuthing dinosaurs \\
                 These feet were made for walking, running, sitting,
                 swimming, herding, and hunting \\
                 The mystery of Lark Quarry \\
                 Dinosaur nests and bringing up babies \\
                 Dinosaurs down underground \\
                 Broken bones, toothmarks, and marks on teeth \\
                 Why would a dinosaur eat a rock? \\
                 The remains of the day: dinosaur vomit, stomach
                 contents, feces, and other gut feelings \\
                 The great Cretaceous walk \\
                 Tracking the dinosaurs among us \\
                 Dinosaurian landscapes and evolutionary traces",
}

@Book{Mason:1990:LY,
  author =       "Tony Mason and Doug Brown",
  title =        "{\tt lex} \& {\tt yacc}",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xviii + 216",
  year =         "1990",
  ISBN =         "0-937175-49-8",
  ISBN-13 =      "978-0-937175-49-1",
  LCCN =         "QA76.76.O63 M37 1990",
  bibdate =      "Wed Dec 15 17:56:32 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Mathworks:1992:SEM,
  author =       "{The MathWorks, Inc.}",
  key =          "MAT92a",
  title =        "The Student Edition of {Matlab} for {MS-DOS} Personal
                 Computers",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xiv + 494",
  year =         "1992",
  ISBN =         "0-13-855974-0, 0-13-855982-1",
  ISBN-13 =      "978-0-13-855974-8, 978-0-13-855982-3",
  LCCN =         "QA297 .S8433 1992",
  bibdate =      "Wed Jul 6 15:27:50 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/matlab.bib",
  abstract =     "Full featured version of 3.5 of MATLAB limited only in
                 the size of the matrix (1024 elements, $ 32 \times 32 $
                 array) and printing accomplished by screen dump
                 procedures.",
  acknowledgement = ack-nhfb,
}

@Book{Matsen:1986:SAA,
  editor =       "F. A. Matsen and T. Tajima",
  title =        "Supercomputers: Algorithms, Architectures, and
                 Scientific Computation",
  publisher =    pub-U-TEXAS-PRESS,
  address =      pub-U-TEXAS-PRESS:adr,
  pages =        "vi + 480",
  year =         "1986",
  ISBN =         "0-292-70388-0",
  ISBN-13 =      "978-0-292-70388-9",
  LCCN =         "QA76.5.S8945 1986",
  bibdate =      "Wed Dec 15 10:38:48 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Matzinger:2019:HDS,
  author =       "Claus Matzinger",
  title =        "Hands-on Data Structures and Algorithms with {Rust}:
                 Learn Programming Techniques to Build Effective,
                 Maintainable, and Readable Code in {Rust 2018}",
  publisher =    pub-PACKT,
  address =      pub-PACKT:adr,
  pages =        "vii + 298",
  year =         "2019",
  ISBN =         "1-78899-149-4",
  ISBN-13 =      "978-1-78899-149-0, 978-1-78899-552-8",
  LCCN =         "Q76.73.R87",
  bibdate =      "Tue Dec 10 06:05:05 MST 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Rust (Computer program language); Computer
                 programming; Computer algorithms; Computer algorithms;
                 Computer programming; Rust (Computer program
                 language)",
  tableofcontents = "Hello Rust! \\
                 Cargo and crates \\
                 Storing efficiently \\
                 Lists, lists, and more lists \\
                 Robust trees \\
                 Exploring maps and sets \\
                 Collections in Rust \\
                 Algorithm evaluation \\
                 Ordering things \\
                 Finding stuff \\
                 Random and combinatorial \\
                 Algorithms of the standard library",
}

@Book{Matzinger:2019:RPC,
  author =       "Claus Matzinger",
  title =        "{Rust} Programming Cookbook: Explore the Latest
                 Features of {Rust 2018} for Building Fast and Secure
                 Apps",
  publisher =    pub-PACKT,
  address =      pub-PACKT:adr,
  pages =        "434",
  year =         "2019",
  ISBN =         "1-78953-066-0, 1-78953-174-8 (PDF e-book)",
  ISBN-13 =      "978-1-78953-066-7, 978-1-78953-174-9 (PDF e-book)",
  LCCN =         "QA76.73.R87",
  bibdate =      "Tue Dec 10 05:37:41 MST 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Practical solutions to overcome challenges in creating
                 console and web applications and working with
                 systems-level and embedded code, network programming,
                 deep neural networks, and much more. Key Features Work
                 through recipes featuring advanced concepts such as
                 concurrency, unsafe code, and macros to migrate your
                 codebase to the Rust programming language Learn how to
                 run machine learning models with Rust Explore error
                 handling, macros, and modularization to write
                 maintainable code Book Description Rust 2018, Rust's
                 first major milestone since version 1.0, brings more
                 advancement in the Rust language. The \booktitle{Rust
                 Programming Cookbook} is a practical guide to help you
                 overcome challenges when writing Rust code. This Rust
                 book covers recipes for configuring Rust for different
                 environments and architectural designs, and provides
                 solutions to practical problems. It will also take you
                 through Rust's core concepts, enabling you to create
                 efficient, high-performance applications that use
                 features such as zero-cost abstractions and improved
                 memory management. As you progress, you'll delve into
                 more advanced topics, including channels and actors,
                 for building scalable, production-grade applications,
                 and even get to grips with error handling, macros, and
                 modularization to write maintainable code. You will
                 then learn how to overcome common roadblocks when using
                 Rust for systems programming, IoT, web development, and
                 network programming. Finally, you'll discover what Rust
                 2018 has to offer for embedded programmers. By the end
                 of the book, you'll have learned how to build fast and
                 safe applications and services using Rust. What you
                 will learn Understand how Rust provides unique
                 solutions to solve system programming language problems
                 Grasp the core concepts of Rust to develop fast and
                 safe applications Explore the possibility of
                 integrating Rust units into existing applications for
                 improved efficiency Discover how to achieve better
                 parallelism and security with Rust Write Python
                 extensions in Rust Compile external assembly files and
                 use the Foreign Function Interface (FFI) Build web
                 applications and services using Rust for high
                 performance Who this book is for The Rust cookbook is
                 for software developers looking to enhance their
                 knowledge of Rust and leverage its features using
                 modern programming practices. Familiarity with Rust
                 language is expected to get the most out of this
                 book.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  remark =       "How to do it\ldots{}",
  subject =      "Rust (Computer program language); Computer
                 programming; Computer programming; Rust (Computer
                 program language)",
  tableofcontents = "Cover \\
                 Title Page \\
                 Copyright and Credits \\
                 Dedication \\
                 About Packt \\
                 Foreword \\
                 Contributors \\
                 Table of Contents \\
                 Preface \\
                 Chapter 1: Starting Off with Rust \\
                 Setting up your environment \\
                 Getting ready \\
                 How to do it\ldots{} \\
                 Managing the Rust installation with rustup.rs \\
                 Installing Visual Studio Code and extensions \\
                 Troubleshooting \\
                 How it works\ldots{} \\
                 Working with the command line I/O \\
                 How to do it\ldots{} \\
                 How it works\ldots{} \\
                 Creating and using data types \\
                 How to do it\ldots{} \\
                 How it works\ldots{} \\
                 Controlling execution flow \\
                 How to do it\ldots{} \\
                 How it works\ldots{} \\
                 Splitting your code with crates and modules \\
                 Getting ready \\
                 How to do it\ldots{} \\
                 How it works\ldots{} \\
                 Writing tests and benchmarks \\
                 Getting ready \\
                 How to do it\ldots{} \\
                 How it works\ldots{} \\
                 Documenting your code \\
                 Getting ready \\
                 How to do it\ldots{} \\
                 How it works\ldots{} \\
                 Testing your documentation \\
                 Getting ready \\
                 How to do it\ldots{} \\
                 How it works\ldots{} \\
                 Sharing code among types \\
                 How to do it\ldots{} \\
                 How it works\ldots{} \\
                 Sequence types in Rust \\
                 How to do it\ldots{} \\
                 How it works\ldots{} \\
                 Debugging Rust \\
                 Getting ready \\
                 How to do it\ldots{} \\
                 How it works\ldots{} \\
                 Chapter 2: Going Further with Advanced Rust \\
                 Creating meaningful numbers with enums \\
                 How to do it\ldots{} \\
                 How it works\ldots{} \\
                 There is no null \\
                 How to do itHow it works\ldots{}Complex conditions with
                 pattern matching \\
                 How to do it\ldots{} \\
                 How it works\ldots{} \\
                 Implementing custom iterators \\
                 Getting ready \\
                 How to do it\ldots{} \\
                 How it works\ldots{} \\
                 Filtering and transforming sequences efficiently \\
                 Getting ready \\
                 How to do it\ldots{} \\
                 How it works\ldots{} \\
                 Reading memory the unsafe way \\
                 How to do it\ldots{} \\
                 How it works\ldots{} \\
                 Shared ownership \\
                 Getting ready \\
                 How to do it\ldots{} \\
                 How it works\ldots{} \\
                 Shared mutable ownership \\
                 Getting ready \\
                 How to do it\ldots{} \\
                 How it works\ldots{} \\
                 Referencing with explicit lifetimes \\
                 How to do it\ldots{} \\
                 How it works\ldots{} \\
                 Enforcing behavior with trait bounds \\
                 How to do it\ldots{} \\
                 How it works\ldots{} \\
                 Working with generic data types \\
                 How to do it\ldots{} \\
                 How it works\ldots{} \\
                 Chapter 3: Managing Projects with Cargo \\
                 Organizing large projects with workspaces \\
                 How to do it\ldots{} \\
                 How it works\ldots{} \\
                 Uploading to crates.io \\
                 Getting ready \\
                 How to do it\ldots{} \\
                 How it works\ldots{} \\
                 Using dependencies and external crates \\
                 How to do it\ldots{} \\
                 How it works\ldots{} \\
                 See also\ldots{} \\
                 Extending cargo with sub-commands \\
                 Getting ready \\
                 How to do it\ldots{} \\
                 How it works\ldots{} \\
                 Testing your project with cargo \\
                 How to do it\ldots{} \\
                 How it works\ldots{} \\
                 Continuous integration with cargo \\
                 Getting ready \\
                 How to do it \\
                 How it works\ldots{} \\
                 Customizing the build \\
                 How to do it\ldots{} \\
                 How it works\ldots{} \\
                 Chapter 4: Fearless Concurrency \\
                 Moving data into new threads \\
                 How to do it\ldots{} \\
                 How it works\ldots{} \\
                 Managing multiple threads \\
                 How to do it\ldots{} \\
                 How it works\ldots{} \\
                 Using channels to communicate between threads \\
                 How to do it\ldots{} \\
                 How it works\ldots{} \\
                 Sharing mutable states \\
                 How to do it\ldots{} \\
                 How it works\ldots{} \\
                 Multiprocessing in Rust \\
                 How to do it\ldots{} \\
                 How it works\ldots{} \\
                 Making sequential code parallel \\
                 How to do it\ldots{} \\
                 How it works\ldots{} \\
                 Concurrent data processing in vectors \\
                 How to do it\ldots{} \\
                 How it works\ldots{} \\
                 Shared immutable states",
}

@TechReport{Mauchly:1942:UHS,
  author =       "J. W. Mauchly",
  title =        "The use of high speed vacuum tube devices for
                 calculating",
  type =         "Privately circulated memorandum",
  institution =  "Moore School of Electrical Engineering, University of
                 Pennsylvania",
  address =      "Philadelphia, PA, USA",
  month =        aug,
  year =         "1942",
  bibdate =      "Wed Oct 13 11:52:54 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Reprinted in \cite[\S 7.6]{Randell:1982:ODC}.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Mauchly:1947:PPE,
  author =       "J. W. Mauchly",
  booktitle =    "{Proceedings of a Symposium on Large Scale Digital
                 Calculating Machinery, 7--10 January 1947}",
  title =        "Preparation of problems for {EDVAC}-type machines",
  publisher =    pub-HARVARD,
  address =      pub-HARVARD:adr,
  year =         "1947",
  bibdate =      "Wed Oct 13 11:55:58 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Reprinted in {\em Annals of the Computation Laboratory
                 of Harvard University}, {\bf 16}, 203--207 (1948).
                 Reprinted in \cite[\S 8.2]{Randell:1982:ODC}.",
  acknowledgement = ack-nhfb,
}

@Book{Mauro:2001:SIC,
  author =       "Jim Mauro and Richard McDougall",
  title =        "{Solaris} Internals: Core Kernel Architecture",
  publisher =    pub-SUN-MICROSYSTEMS-PRESS,
  address =      pub-SUN-MICROSYSTEMS-PRESS:adr,
  pages =        "xli + 657",
  year =         "2001",
  ISBN =         "0-13-022496-0",
  ISBN-13 =      "978-0-13-022496-5",
  LCCN =         "QA76.76.O63 M37195 2001",
  bibdate =      "Fri Apr 11 16:56:49 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/multithreading.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  series =       "Sun BluePrints Program",
  URL =          "http://www.sun.com/books/catalog/mauro/index.html",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  shorttableofcontents = "The Solaris Memory System \\
                 Threads, Processes, and IPC \\
                 Files and File Systems \\
                 Kernel Tunables, Switches, and Limits \\
                 Kernel Virtual Address Maps",
  tableofcontents = "List of Header Files \\
                 Part 1: Introduction to Solaris Internals \\
                 1: An Introduction to Solaris \\
                 2: Kernel Services \\
                 3: Kernel Synchronization Primitives \\
                 4: Kernel Bootstrap and Initialization \\
                 Part 2: The Solaris Memory System \\
                 5: Solaris Memory Architecture \\
                 6: Kernel Memory \\
                 7: Memory Monitoring \\
                 Part 3: Threads, Processes, and IPC \\
                 8: The Solaris Multithreaded Process Architecture \\
                 9: The Solaris Kernel dispatcher \\
                 10: Interprocess Communication \\
                 Part 4: Files and File Systems \\
                 11: Solaris Files and File I/O \\
                 12: File System Overview \\
                 13: File System Framework \\
                 14: The UNIX File System \\
                 15: Solaris File System Cache \\
                 Appendix A: Kernel Tunables, Switches, and Limits \\
                 Appendix B: Kernel Virtual Address Maps \\
                 Appendix C: A Sample Profs Utility",
}

@Book{May:1994:PAS,
  editor =       "Cathy May and Ed Silha and Rick Simpson and Hank
                 Warren",
  title =        "The {PowerPC} Architecture: a Specification for a New
                 Family of {RISC} Processors",
  publisher =    pub-MORGAN-KAUFMANN,
  address =      pub-MORGAN-KAUFMANN:adr,
  edition =      "Second",
  pages =        "xxxi + 518",
  year =         "1994",
  ISBN =         "1-55860-316-6",
  ISBN-13 =      "978-1-55860-316-5",
  LCCN =         "QA76.8.P67 P68 1994",
  bibdate =      "Sat Feb 24 10:55:16 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/microchip.bib",
  price =        "US\$49.95",
  acknowledgement = ack-nhfb,
  oldlabel =     "IBM:1994:PAS",
  tableofcontents = "Book III. PowerPC Operating Environment
                 Architecture \\
                 2. Branch Processor \\
                 3. Fixed-Point Processor \\
                 4. Storage Control \\
                 5. Interrupts \\
                 6. Timer Facilities \\
                 7. Synchronization Requirements for Special Registers
                 and for Lookaside Buffers \\
                 Appendix A. Optional Facilities and Instructions \\
                 Appendix B. Assembler Extended Mnemonics \\
                 Appendix C. Cross-Reference for Changed POWER Mnemonics
                 \\
                 Appendix D. New Instructions \\
                 Appendix E. Implementation-Specific SPRs \\
                 Appendix F. Interpretation of the DSISR as Set by an
                 Alignment Interrupt \\
                 Appendix G. PowerPC Operating Environment Instruction
                 Set",
}

@Book{Mayoh:1982:PSA,
  author =       "Brian Mayoh",
  title =        "Problem Solving with {Ada}",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "viii + 233",
  year =         "1982",
  ISBN =         "0-471-10025-0",
  ISBN-13 =      "978-0-471-10025-6",
  LCCN =         "QA76.8.A15 M38 1982",
  bibdate =      "Wed Dec 15 10:38:49 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$59.00",
  acknowledgement = ack-nhfb,
}

@Book{Mazur:2010:WLG,
  author =       "Joseph Mazur",
  title =        "What's luck got to do with it?: the history,
                 mathematics, and psychology behind the gambler's
                 illusion",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "xvii + 277",
  year =         "2010",
  ISBN =         "0-691-13890-7 (hardcover)",
  ISBN-13 =      "978-0-691-13890-9 (hardcover)",
  LCCN =         "QA271 .M39 2010",
  bibdate =      "Tue Nov 27 15:13:07 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Games of chance (Mathematics); Chance; Psychological
                 aspects; Gambling; Social aspects",
  tableofcontents = "The history \\
                 Pits, pebbles, and bones: rolling to discover fate \\
                 The professionals: luck becomes measurable \\
                 From coffeehouses to casinos: gaming becomes big
                 business \\
                 There's no stopping it now: from bans to bookies \\
                 Betting with trillions: the 2008 world economic
                 calamity \\
                 The mathematics \\
                 Who's got a royal flush?: one deal as likely as another
                 \\
                 The behavior of a coin: making predictions with
                 probability \\
                 Someone has to win: betting against expectation \\
                 A truly astonishing result: the weak law of large
                 numbers \\
                 The skill\slash luck spectrum: even great talent needs
                 some good fortune \\
                 The analysis \\
                 Let it ride: the house money effect \\
                 Knowing when to quit: psychomanaging risk \\
                 The theories: what makes a gambler? \\
                 Hot hands: expecting long runs of the same outcome \\
                 Luck: the dicey illusion",
}

@Book{Mazur:2015:PNR,
  author =       "Barry Mazur and William A. Stein",
  title =        "Prime numbers and the {Riemann} hypothesis",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xi + 142",
  year =         "2015",
  ISBN =         "1-107-10192-1 (hardcover), 1-107-49943-7 (paperback)",
  ISBN-13 =      "978-1-107-10192-0 (hardcover), 978-1-107-49943-0
                 (paperback)",
  LCCN =         "QA246 .M49 2015",
  bibdate =      "Thu Sep 22 06:29:17 MDT 2016",
  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 =      "Riemann hypothesis; Numbers, Prime",
  tableofcontents = "The Riemann Hypothesis \\
                 Thoughts about numbers \\
                 What are prime numbers? \\
                 ``Named'' prime numbers \\
                 Sieves \\
                 Questions about primes \\
                 Further questions about primes \\
                 How many primes are there? \\
                 Prime numbers viewed from a distance \\
                 Pure and applied mathematics \\
                 A probabilistic first guess \\
                 What is a ``good approximation'' \\
                 Square root error and random walks \\
                 What is Riemann's Hypothesis \\
                 The mystery moves to the error term \\
                 Ces{\`a}ro smoothing \\
                 A view of Li(X) - [pi](X) \\
                 The prime number theorem \\
                 The staircase of primes \\
                 Tinkering with the staircase of primes \\
                 Computer music files and prime numbers \\
                 The word ``spectrum'' \\
                 Spectra and trigonometric sums \\
                 The spectrum and the staircase of primes \\
                 To our readers of Part I \\
                 Distributions \\
                 Slopes of graphs that have no slopes \\
                 Distributions \\
                 Fourier Transforms: second visit \\
                 Fourier Transform of delta \\
                 Trigonometric series \\
                 A sneak preview of Part III --- The Riemann Spectrum of
                 prime numbers \\
                 On losing no information \\
                 From primes to the Riemann Spectrum \\
                 How many [theta][subscript i]'s are there? \\
                 Further questions about the Riemann Spectrum \\
                 From the Riemann Spectrum to primes \\
                 Back to Riemann \\
                 Building [pi](X) from the Spectrum \\
                 As Riemann envisioned it \\
                 Companions to the zeta function",
}

@Book{Mazza:1997:OPI,
  editor =       "Debora Mazza",
  title =        "{Oxford} paperback {Italian} dictionary. The {Oxford}
                 {Italian} dictionary: {Italian--English},
                 {English--Italian} = italiano-inglese,
                 inglese-italiano",
  publisher =    "Berkley Books",
  address =      "New York, NY, USA",
  pages =        "viii + 264",
  year =         "1997",
  ISBN =         "0-425-16012-2 (paperback)",
  ISBN-13 =      "978-0-425-16012-1 (paperback)",
  LCCN =         "PC1640 .O94 1997",
  bibdate =      "Thu Jan 5 17:36:20 MST 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  price =        "US\$5.99",
  acknowledgement = ack-nhfb,
  remark =       "Originally published: The Oxford paperback Italian
                 dictionary. Oxford: Oxford University Press, 1989.",
  subject =      "Italian language; Dictionaries; English; English
                 language; Italian",
}

@Book{MC:68000,
  author =       "Motorola",
  title =        "{MC68000} 16\slash 32-Bit Microprocessor Programmer's
                 Reference Manual",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  edition =      "Fourth",
  pages =        "xiii + 218",
  year =         "1984",
  ISBN =         "0-13-541400-8",
  ISBN-13 =      "978-0-13-541400-2",
  LCCN =         "QA76.8.M6895 M25 1984",
  bibdate =      "Wed Jul 6 13:48:45 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{MC:68020,
  author =       "Motorola",
  title =        "{MC68020} 32-Bit Microprocessor User's Manual",
  publisher =    pub-MOTOROLA,
  address =      pub-MOTOROLA:adr,
  edition =      "Second",
  year =         "1985",
  ISBN =         "0-13-566878-6",
  ISBN-13 =      "978-0-13-566878-8",
  LCCN =         "QA76.8.M6897 M37 1985",
  bibdate =      "Wed Jul 6 13:48:43 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{MC:68881,
  author =       "Motorola",
  title =        "{MC68881} Floating-Point Coprocessor User's Manual",
  publisher =    pub-MOTOROLA,
  address =      pub-MOTOROLA:adr,
  edition =      "Second",
  year =         "1985",
  bibdate =      "Wed Dec 15 17:59:06 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{McCarthy:1998:IS,
  author =       "Linda McCarthy",
  title =        "Intranet Security",
  publisher =    pub-SUN,
  address =      pub-SUN:adr,
  pages =        "xxv + 260",
  year =         "1998",
  ISBN =         "0-13-894759-0",
  ISBN-13 =      "978-0-13-894759-0",
  LCCN =         "TK5105.59 .M352 1998",
  bibdate =      "Wed Jun 03 11:51:09 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$29.95, CDN\$41.95",
  acknowledgement = ack-nhfb,
}

@Book{McCartney:2001:ETT,
  author =       "Scott McCartney",
  title =        "{ENIAC}: the Triumphs and Tragedies of the World's
                 First Computer",
  publisher =    pub-BERKLEY-BOOKS,
  address =      pub-BERKLEY-BOOKS:adr,
  pages =        "vii + 262",
  year =         "2001",
  ISBN =         "0-425-17644-4",
  ISBN-13 =      "978-0-425-17644-3",
  LCCN =         "QA76.5",
  bibdate =      "Fri Jun 12 07:36:26 MDT 2009",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.bib;
                 https://www.math.utah.edu/pub/tex/bib/annhistcomput.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.gbv.de:20011/gvk",
  acknowledgement = ack-nhfb,
  remark-1 =     "The second half of this book contains an extensive
                 discussion, with literate references, of the role that
                 John von Neumann played in the origins of the digital
                 computer, and how his writing, and professional
                 stature, led to his overshadowing the significant
                 earlier contributions of John Atanasoff, Clifford
                 Berry, John Mauchly, Presper Eckert, and Maurice
                 Wilkes",
  remark-2 =     "See \cite[Chapters 10--12]{Smiley:2010:MWI} for a
                 strong rebuttal of McCartney's views on the proper
                 assignment of credit for the invention of the digital
                 computer.",
  tableofcontents = "1: Ancestors \\
                 2: Kid and a dreamer \\
                 3: Crunched by numbers \\
                 4: Getting started \\
                 5: Five times one thousand \\
                 6: Whose machine was it, anyway? \\
                 7: Out on their own \\
                 8: Whose idea was it, anyway?",
}

@Book{McCracken:1987:SCC,
  author =       "Daniel D. McCracken and William I. Salmon",
  title =        "A Second Course in Computer Science with {Modula-2}",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xiii + 464 + 10",
  year =         "1987",
  ISBN =         "0-471-63111-6",
  ISBN-13 =      "978-0-471-63111-8",
  LCCN =         "QA76.73.M63 M43 1987",
  bibdate =      "Wed Dec 15 10:39:03 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{McCracken:1988:CES,
  author =       "Daniel D. McCracken and William I. Salmon",
  title =        "Computing for Engineers and Scientists With {Fortran
                 77}",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  edition =      "Second",
  pages =        "xiii + 730",
  year =         "1988",
  ISBN =         "0-471-62552-3 (paperback)",
  ISBN-13 =      "978-0-471-62552-0 (paperback)",
  LCCN =         "TA345 .M3951 1988",
  bibdate =      "Sun Sep 28 10:42:07 MDT 1997",
  bibsource =    "http://www.amazon.com/exec/obidos/ISBN=0471625523/wholesaleproductA/;
                 http://www.cbooks.com/;
                 https://www.math.utah.edu/pub/tex/bib/fortran2.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$59.75; US\$65.95",
  URL =          "http://www.cbooks.com/sqlnut/SP/search/gtsumt?source=&isbn=0471625523",
  acknowledgement = ack-nhfb,
  dimensions =   "9.97in x 6.95in x 1.37in",
  keywords =     "engineering -- data processing; Engineering --- Data
                 processing; FORTRAN 77 (Computer program language);
                 Fortran 77 (computer program language); science -- data
                 processing; Science --- Data processing",
  tableofcontents = "Hardware and software \\
                 A first look at programming \\
                 Data and operations \\
                 Control structures \\
                 Subprograms, I \\
                 Program development and testing \\
                 Formatted input and output \\
                 DO loops and arrays \\
                 Subprograms, II \\
                 Files \\
                 Further features of Fortran \\
                 Appendices \\
                 Index",
}

@Book{McDougall:2007:SIS,
  author =       "Richard McDougall and Jim Mauro",
  title =        "{Solaris} internals: {Solaris 10} and {OpenSolaris}
                 kernel architecture",
  publisher =    "Sun Microsystems Press\slash Prentice Hall",
  address =      "Upper Saddle River, NJ, USA",
  edition =      "Second",
  pages =        "xlvi + 1020",
  year =         "2007",
  ISBN =         "0-13-148209-2 (hardcover)",
  ISBN-13 =      "978-0-13-148209-8 (hardcover)",
  LCCN =         "QA76.76.O63 M37195 2007",
  bibdate =      "Wed Apr 25 14:28:03 MDT 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/toc/ecip0613/2006015114.html",
  acknowledgement = ack-nhfb,
  remark =       "See also first edition \cite{Mauro:2001:SIC}.",
  subject =      "Operating systems (Computers); Solaris (Computer
                 file)",
  tableofcontents = "Part 1: Introduction to Solaris Internals / 1 \\
                 1.1: Key Features of Solaris 10, Solaris 9, and Solaris
                 8 / 4 \\
                 1.2: Key Differentiators / 12 \\
                 1.3: Kernel Overview / 15 \\
                 1.4: Processes, Threads, and Scheduling / 18 \\
                 1.5: Interprocess Communication / 23 \\
                 1.6: Signals / 25 \\
                 1.7: Memory Management / 26 \\
                 1.8: Files and File Systems / 29 \\
                 1.9: Resource Management / 30 \\
                 Part 2: The Process Model / 41 \\
                 2: The Solaris Process Model / 43 \\
                 2.1: Components of a Process / 44 \\
                 2.2: Process Model Evolution / 48 \\
                 2.3: Executable Objects / 52 \\
                 2.4: Process Structures / 55 \\
                 2.5: Kernel Process Table / 79 \\
                 2.6: Process Resource Attributes / 84 \\
                 2.7: Process Creation / 89 \\
                 2.8: System Calls / 98 \\
                 2.9: Process Termination / 106 \\
                 2.10: The Process File System / 110 \\
                 2.11: Signals / 129 \\
                 2.12: Sessions and Process Groups / 150 \\
                 3: Scheduling Classes and the Dispatcher / 157 \\
                 3.2: Processor Abstractions / 162 \\
                 3.3: Dispatcher Queues, Structures, and Variables / 171
                 \\
                 3.4: Dispatcher Locks / 183 \\
                 3.5: Dispatcher Initialization / 190 \\
                 3.6: Scheduling Classes / 192 \\
                 3.7: Thread Priorities / 207 \\
                 3.8: Dispatcher Functions / 234 \\
                 3.9: Preemption / 246 \\
                 3.10: The Kernel Sleep/Wakeup Facility / 253 \\
                 3.11: Interrupts / 262 \\
                 4: Interprocess Communication / 273 \\
                 4.1: The System V IPC Framework / 274 \\
                 4.2: System V IPC Resource Controls / 282 \\
                 4.3: Configuring IPC Tuneables on Solaris 10 / 285 \\
                 4.4: System V Shared Memory / 286 \\
                 4.5: System V Semaphores / 295 \\
                 4.6: System V Message Queues / 299 \\
                 4.7: Posix IPC / 303 \\
                 4.8: Solaris Doors / 312 \\
                 5: Process Rights Management / 323 \\
                 5.1: Then and Now / 323 \\
                 5.2: Least Privilege in Solaris / 324 \\
                 5.3: Process Privilege Models / 325 \\
                 5.4: Privilege Awareness: The Details / 334 \\
                 5.5: Least Privilege Interfaces / 344 \\
                 Part 3: Resource Management / 365 \\
                 6: Zones / 367 \\
                 6.2: Zone Runtime / 371 \\
                 6.3: Booting Zones / 375 \\
                 6.4: Security / 379 \\
                 6.5: Process Model / 386 \\
                 6.6: File Systems / 389 \\
                 6.7: Networking / 393 \\
                 6.8: Devices / 398 \\
                 6.9: Interprocess Communication / 405 \\
                 6.10: Resource Management and Observability / 407 \\
                 7: Projects, Tasks, and Resource Controls / 415 \\
                 7.1: Projects and Tasks Framework / 415 \\
                 7.2: The Project Database / 418 \\
                 7.3: Project and Task APIs / 419 \\
                 7.4: Kernel Infrastructure for Projects and Tasks / 420
                 \\
                 7.5: Resource Controls / 423 \\
                 7.6: Interfaces for Resource Controls / 432 \\
                 7.7: Kernel Interfaces for Resource Controls / 437 \\
                 Part 4: Memory / 445 \\
                 8: Introduction to Solaris Memory / 447 \\
                 8.1: Virtual Memory Primer / 447 \\
                 8.2: Two Levels of Memory / 448 \\
                 8.3: Memory Sharing and Protection / 448 \\
                 8.4: Pages: Basic Units of Physical Memory / 448 \\
                 8.5: Virtual-to-Physical Translation / 449 \\
                 8.6: Physical Memory Management: Paging and Swapping /
                 450 \\
                 8.7: Virtual Memory as a File System Cache / 450 \\
                 8.8: New Features of the Virtual Memory Implementation
                 / 451 \\
                 9: Virtual Memory / 455 \\
                 9.1: Design Overview / 455 \\
                 9.2: Virtual Address Spaces / 457 \\
                 9.3: Tracing the VM System / 466 \\
                 9.4: Virtual Address Space Management / 467 \\
                 9.5: Segment Drivers / 476 \\
                 9.6: Anonymous Memory / 485 \\
                 9.7: The Anonymous Memory Layer / 487 \\
                 9.8: The swapfs Layer / 489 \\
                 9.9: Virtual Memory Watchpoints / 492 \\
                 9.10: Changes to Support Large Pages / 494 \\
                 10: Physical Memory / 503 \\
                 10.1: Physical Memory Allocation / 503 \\
                 10.2: Pages: The Basic Unit of Solaris Memory / 506 \\
                 10.3: The Page Scanner / 516 \\
                 11: Kernel Memory / 527 \\
                 11.1: Kernel Virtual Memory Layout / 527 \\
                 11.2: Kernel Memory Allocation / 534 \\
                 11.3: The Vmem Allocator / 552 \\
                 11.4: Kernel Memory Allocator Tracing / 562 \\
                 12: Hardware Address Translation / 581 \\
                 12.1: HAT Overview / 581 \\
                 12.2: The UltraSPARC HAT Layer / 583 \\
                 12.3: The x64 HAT Layer / 625 \\
                 13: Working with Multiple Page Sizes in Solaris / 639
                 \\
                 13.1: Determining When to Use Large Pages / 639 \\
                 13.2: Measuring Application Performance / 640 \\
                 13.3: Configuring for Multiple Page Sizes / 645 \\
                 Part 5: File Systems / 655 \\
                 14: File System Framework / 657 \\
                 14.1: File System Framework / 657 \\
                 14.2: Process-Level File Abstractions / 658 \\
                 14.3: Solaris File System Framework / 668 \\
                 14.4: File System Modules / 672 \\
                 14.5: The Virtual File System (vfs) Interface / 675 \\
                 14.6: The Vnode / 685 \\
                 14.7: File System I/O / 707 \\
                 14.8: File Systems and Memory Allocation / 718 \\
                 14.9: Path-Name Management / 722 \\
                 14.10: The Directory Name Lookup Cache / 726 \\
                 14.11: The File System Flush Daemon / 734 \\
                 14.12: File System Conversion to Solaris 10 / 734 \\
                 15: The UFS File System / 737 \\
                 15.1: UFS Development History / 737 \\
                 15.2: UFS On-Disk Format / 739 \\
                 15.3: The UFS Inode / 751 \\
                 15.4: Access Control in UFS / 764 \\
                 15.5: Extended Attributes in UFS / 767 \\
                 15.6: Locking in UFS / 768 \\
                 15.7: Logging / 775 \\
                 Part 6: Platform Specifics / 793 \\
                 16: Support for NUMA and CMT Hardware / 795 \\
                 16.1: Memory Hierarchy Designs / 796 \\
                 16.2: Memory Placement Optimization Framework / 799 \\
                 16.3: Initial Thread Placement / 802 \\
                 16.4: Scheduling / 802 \\
                 16.5: Memory Allocation / 803 \\
                 16.6: Lgroup Implementation / 804 \\
                 16.7: MPO APIs / 807 \\
                 16.8: Locality Group Hierarchy / 811 \\
                 16.9: MPO Statistics / 813 \\
                 17: Locking and Synchronization / 815 \\
                 17.1: Synchronization / 815 \\
                 17.2: Parallel Systems Architectures / 816 \\
                 17.3: Hardware Considerations for Locks and
                 Synchronization / 819 \\
                 17.4: Introduction to Synchronization Objects / 824 \\
                 17.5: Mutex Locks / 827 \\
                 17.6: Reader/Writer Locks / 835 \\
                 17.7: Turnstiles and Priority Inheritance / 840 \\
                 17.8: Kernel Semaphores / 844 \\
                 17.9: DTrace Lockstat Provider / 846 \\
                 Part 7: Networking / 853 \\
                 18: The Solaris Network Stack / 855 \\
                 18.1: STREAMS and the Network Stack / 855 \\
                 18.2: Solaris 10 Stack: Design Goals / 862 \\
                 18.3: Solaris 10 Network Stack Framework / 863 \\
                 18.4: TCP as an Implementation of the New Framework /
                 870 \\
                 18.5: UDP / 875 \\
                 18.6: Synchronous STREAMS / 878 \\
                 18.7: IP / 880 \\
                 18.8: Solaris Device Driver Framework / 882 \\
                 18.9: Interrupt Model and NIC Speeds / 891 \\
                 Part 8: Kernel Services / 899 \\
                 19: Clocks and Timers / 901 \\
                 19.1: The System Clock Thread / 901 \\
                 19.2: Callouts and Callout Tables / 904 \\
                 19.3: System Time Facilities / 910 \\
                 19.4: The Cyclic Subsystem / 912 \\
                 20: Task Queues / 927 \\
                 20.1: Overview of Task Queues / 927 \\
                 20.2: Dynamic Task Queues / 928 \\
                 20.3: Task Queues Kernel Programming Interfaces / 932
                 \\
                 20.4: Device Driver Interface for Task Queues / 934 \\
                 20.5: Task Queue Observability / 935 \\
                 20.6: Task Queue Implementation Notes / 937 \\
                 21: Kmdb Implementation / 943 \\
                 Appendix: A Kernel Virtual Address Maps / 965 \\
                 Appendix B: Adding a System Call to Solaris / 971 \\
                 Appendix C: A Sample Procfs Utility / 975",
}

@Book{McDougall:2007:SPT,
  author =       "Richard McDougall and Jim Mauro and Brendan Gregg",
  title =        "{Solaris} performance and tools: {DTrace} and {MDB}
                 techniques for {Solaris 10} and {OpenSolaris}",
  publisher =    "Sun Microsystems Press\slash Prentice Hall",
  address =      "Upper Saddle River, NJ",
  pages =        "xl + 444",
  year =         "2007",
  ISBN =         "0-13-156819-1 (hardcover)",
  ISBN-13 =      "978-0-13-156819-8 (hardcover)",
  LCCN =         "QA76.76.O63 M3957 2007",
  bibdate =      "Wed Apr 25 14:28:24 MDT 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/toc/ecip0615/2006020138.html",
  acknowledgement = ack-nhfb,
  subject =      "Solaris (Computer file); Operating systems
                 (Computers)",
  tableofcontents = "1: Introduction to observability tools \\
                 2: CPUs \\
                 3: Processes \\
                 4: Disk behavior and analysis \\
                 5: File systems \\
                 6: Memory \\
                 7: Networks \\
                 8: Performance counters \\
                 9: Kernel monitoring \\
                 10: Dynamic tracing \\
                 11: Kernel statistics \\
                 12: The modular debugger \\
                 13: An MDB tutorial \\
                 14: Debugging kernels \\
                 Appendix A: Tunables and settings \\
                 Appendix B: DTrace one-liners \\
                 Appendix C: Java DTrace scripts \\
                 Appendix D: Sample Perl Kstat utilities",
}

@Book{McGilton:1983:IUS,
  author =       "Henry McGilton and Rachel Morgan",
  title =        "Introducing the {UNIX} System",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "xix + 556",
  year =         "1983",
  ISBN =         "0-07-045001-3",
  ISBN-13 =      "978-0-07-045001-1",
  LCCN =         "QA76.8.U65 M38 1983",
  bibdate =      "Mon Oct 4 11:56:31 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  price =        "US\$18.95",
  acknowledgement = ack-nhfb,
  tableofcontents = "Getting started on the Unix system \\
                 Directories and files \\
                 Commands and standard files \\
                 User to user communications \\
                 Text manipulation \\
                 The ed and sed editors \\
                 The ex and vi editors \\
                 Formatting documents \\
                 More formatting tools \\
                 Programming the Unix shell \\
                 Tools for software development \\
                 The Unix system at Berkeley \\
                 Unix system management guide \\
                 A selected Unix bibliography",
}

@Book{McGilton:1990:TTU,
  author =       "Henry McGilton and Mary McNabb",
  title =        "Typesetting Tables on the {UNIX} System",
  publisher =    pub-TRILITHON,
  address =      pub-TRILITHON:adr,
  pages =        "xxii + 282",
  year =         "1990",
  ISBN =         "0-9626289-0-5",
  ISBN-13 =      "978-0-9626289-0-0",
  LCCN =         "Z253.4.U53 M33 1990",
  bibdate =      "Tue Oct 12 18:19:25 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  price =        "US\$22.00",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "Preface / xv \\
                 1. Introduction To Tables / 1 \\
                 2. Getting Started Building Tables / 11 \\
                 3. Describing Column Formats / 45 \\
                 4. Arranging Data In Your Table / 89 \\
                 5. Optional Modifiers For Format Specifications / 149
                 \\
                 6. Options Affecting The Entire Table / 191 \\
                 7. TBL With Other Document Processors / 207 \\
                 8. TBL With Macro Packages / 229 \\
                 A. Typographical Terminology / 253 \\
                 B. TBL Reference Summary / 257 \\
                 C. Further Reading And Resources / 265 \\
                 Index / 267",
  tableofcontents = "Preface / xv \\
                 1. Introduction To Tables / 1 \\
                 A Short History Of TROFF / 2 \\
                 A Short History Of TBL / 3 \\
                 Formatting Tables The Hard Way / 4 \\
                 Typesetting And Proportional Typefaces / 5 \\
                 Tabular Layout Using TROFF'S Tabs / 6 \\
                 Requirements For Tabular Layout / 8 \\
                 2. Getting Started Building Tables / 11 \\
                 Running TBL With TROFF / 14 \\
                 Running TBL With Other Preprocessors / 15 \\
                 Numerically Aligned Data / 16 \\
                 Centering the Table Within The Line Length / 17 \\
                 Basic Concepts Of Table Layout / 18 \\
                 Options Section / 20 \\
                 Format Specifications Section / 20 \\
                 Data Section / 20 \\
                 Multiple Sets Of Formats And Data / 21 \\
                 Elementary Practical Table Layout / 22 \\
                 Column Titles --- Multiple Format Specifications / 23
                 \\
                 Changing Point Size In A Column / 25 \\
                 Adding A Table Header --- Spanned Columns / 27 \\
                 Enclosing The Table In A Box / 28 \\
                 Drawing A Rule Across The Table / 29 \\
                 Multiple Format And Data Sections / 30 \\
                 Notes On Multiple Format And Data Sections / 34 \\
                 Limitations Of The Table Change Command / 34 \\
                 Troubleshooting / 35 \\
                 Forgetting The TS Line / 36 \\
                 Forgetting The TE Line / 37 \\
                 Missing Semicolon After Options / 37 \\
                 Missing Period After Format Specification / 38 \\
                 Forgetting The T & Line / 40 \\
                 House Styles For Tabular Layout / 41 \\
                 Tables Don't Have To Be Tables / 43 \\
                 Summary / 43 \\
                 3. Describing Column Formats / 45 \\
                 Left-Adjusted Columns / 48 \\
                 Right-Adjusted Columns / 49 \\
                 Centered Columns / 52 \\
                 Numerically Aligned Columns / 54 \\
                 Locating The Numerical Alignment Point / 55 \\
                 Overriding The Numerical Alignment Point / 57 \\
                 Notes On Numerical Alignment / 59 \\
                 Numerical And Alphabetic Columns Don't Mix / 63 \\
                 Vertically Spanned Numerical Columns / 63 \\
                 Alphabetic Columns / 63 \\
                 Notes On Alphabetic Columns / 66 \\
                 Alphabetic Columns And Vertical Spanning / 66 \\
                 Short Horizontal Rules In Alphabetic Columns / 67 \\
                 Alphabetic Columns Can't Span Horizontally / 67 \\
                 Alphabetic And Numerical Columns Don't Mix / 67 \\
                 Horizontally Spanned Columns / 68 \\
                 Horizontal Spanning Not Allowed In First Column / 68
                 \\
                 Alphabetic And Numerical Columns Don't Span
                 Horizontally / 69 \\
                 Quirks of Spanned Columns / 70 \\
                 Vertically Spanned Columns / 72 \\
                 Notes On Vertical Spanning / 75 \\
                 Vertically Spanned Alphabetic Columns Don't Work / 75
                 \\
                 Horizontal Rules / 77 \\
                 Vertical Rules / 80 \\
                 Notes On Vertical Rules / 82 \\
                 Notes On Column Formats / 83 \\
                 Limitations Of The Implementation / 83 \\
                 Standard Settings / 83 \\
                 Comments In The Table Header / 84 \\
                 Matters Of Style / 85 \\
                 Summary / 97 \\
                 4. Arranging Data In Your Table / 89 \\
                 Entering Regular Textual Data / 89 \\
                 Continuation Lines / 90 \\
                 Excess Columns Of Data Are Discarded / 91 \\
                 Do Not Use Tab Characters In Data Fields / 92 \\
                 TROFF Constructs In Table Data / 92 \\
                 TROFF Requests Beginning With Period / 93 \\
                 TROFF Requests Not Counted As Data / 94 \\
                 Alternate TROFF Request Character / 95 \\
                 TROFF Comment Strings In Table Data / 96 \\
                 TROFF Strings Or Number Registers In Table Data / 96
                 \\
                 TROFF In-Line Escape Sequences / 98 \\
                 TROFF Transparent Throughput Indicator / 99 \\
                 Blank Lines In Table Data / 99 \\
                 Horizontal Rules Across The Table / 101 \\
                 Problems Entering Rules / 102 \\
                 Horizontal Rules Across A Column / 102 \\
                 Short Horizontal Rules Across A Column / 106 \\
                 Short Horizontal Rules Don't Work In Alphabetic Columns
                 / 109 \\
                 Repeated Characters Across A Column / 109 \\
                 Font And Size Specifications Have No Effect / 112 \\
                 Repeated Characters Must Be Only Item In Column / 113
                 \\
                 Repeated Characters Don't Span Horizontally / 113 \\
                 Leaders In Table Data / 114 \\
                 Fonts And Sizes Restrictions Of Leaders / 119 \\
                 Leaders --- Not With Right-Adjusted Columns / 121 \\
                 Leaders Can't Appear Before Data In Column / 123 \\
                 Data In Column Must Be Wide Enough / 123 \\
                 Last Words On Leaders / 124 \\
                 Vertically Spanned Rows / 125 \\
                 Notes About Vertical Spanning Marker / 127 \\
                 Problems With Vertical Spanning / 128 \\
                 Blocks Of Text In Tables / 131 \\
                 How TBL Processes Text Blocks / 133 \\
                 Too Many Text Block Diversions / 135 \\
                 Forgetting The T{ Line / 135 \\
                 Forgetting The T} Line / 136 \\
                 Extra Space After T { / 136 \\
                 Extra Space After T} / 137 \\
                 Vertically Spanning Data With Text Blocks / 137 \\
                 Vertically Spanning Text Blocks With Text Blocks / 140
                 \\
                 Text Blocks Longer Than A Page / 142 \\
                 Notes On Length Of Table / 144 \\
                 When Tables Are Too Wide / 145 \\
                 Summary / 147 \\
                 5. Optional Modifiers For Format Specifications / 149
                 \\
                 Font Of Column / 150 \\
                 Limitations On Number Of Fonts / 153 \\
                 Notes On Font Specifications / 155 \\
                 Syntactical Notes On Font Specifications / 157 \\
                 Point Size Of Column / 158 \\
                 Notes on Specifying Point Size / 163 \\
                 Problems With Changing Point Size / 164 \\
                 Limitations 0n Changing Point Size / 167 \\
                 Width Of Column / 168 \\
                 Specifying Width Of Column In TROFF Units / 170 \\
                 Problems Specifying Width Of Column / 171 \\
                 Vertical Spacing For Column / 171 \\
                 Vertical Spacing Specification Too Large / 174 \\
                 Space Between Columns / 175 \\
                 Equal Width Columns / 179 \\
                 Using e And w Modifiers Together / 181 \\
                 Top Of Vertical Span / 181 \\/ 181 \\
                 Bottom Of Vertical Span --- Not Implemented / 184 \\
                 Zero-Width Columns / 184 \\
                 Notes On Zero-Width Columns / 187 \\
                 Limitations Of Zero-Width Columns / 187 \\
                 Staggered Columns / 187 \\
                 Notes On Staggered Columns / 189 \\
                 Notes On The Format Specification Modifiers / 189 \\
                 Summary / 190 \\
                 6. Options Affecting The Entire Table / 191 \\
                 Center Table / 192 \\
                 Expand Table To Width Of Line / 192 \\
                 Notes On The expand Option / 194 \\
                 Draw Box Around Table / 195 \\
                 Draw Double Box Around Table / 196 \\
                 Draw Boxes Around All Items In Table / 197 \\
                 Limitations Of The allbox Option / 198 \\
                 Specify Tab Character / 198 \\
                 Choices For Tab Characters / 199 \\
                 Specify Thickness Of Rules / 200 \\
                 Notes About Boxed Tables / 202 \\
                 Specify Equation Delimiters / 202 \\
                 Notes On Option Specifications / 204 \\
                 Summary / 205 \\
                 7. TBL With Other Document Processors / 207 \\
                 Equations Inside Tables / 207 \\
                 Pictures Inside Tables / 211 \\
                 Equations And Pictures Inside Tables / 213 \\
                 Equations Inside Pictures Inside Tables / 215 \\
                 Tables Inside Tables / 216 \\
                 Tables Inside Pictures / 220 \\
                 Dealing With Sourced Files / 223 \\
                 TBL With NROFF / 225 \\
                 Order Of Running Preprocessors / 227 \\
                 Summary / 228 \\
                 8. TBL With Macro Packages / 229 \\
                 .TS And .TE Macros / 229 \\
                 Keeping A Table On One Page / 230 \\
                 Keeps In The -ms Macro Package / 231 \\
                 Keeps In The -me Macro Package / 231 \\
                 Displays In The -mm Macro Package / 232 \\
                 Tables And Footnotes / 232 \\
                 Footnotes Specific To Tables / 234 \\
                 Footnotes Using Macro Packages / 238 \\
                 Notes On Automatically Numbered Footnotes / 241 \\
                 Tables In Footnotes / 242 \\
                 Multi-Page Tables / 243 \\
                 Table Headers With .TH / 245 \\
                 Forgetting The .TH Line / 246 \\
                 Notes On Multi-Page Tables / 248 \\
                 Table Titles With .TB / 249 \\
                 Tables In Multiple Columns / 249 \\
                 Macros In Tables / 251 \\
                 Tables And The .TC Macro / 252 \\
                 Summary / 252 \\
                 A. Typographical Terminology / 253 \\
                 Summary Of Special Characters / 255 \\
                 Glossary Of Typographic Terminology / 256 \\
                 B. TBL Reference Summary / 257 \\
                 Table Layout Requests And Macros / 257 \\
                 Column Format Specifications / 258 \\
                 Format Specification Modifiers / 259 \\
                 Data Specifications / 260 \\
                 Options Affecting Entire Table / 261 \\
                 Summary Of Horizontal Rules And Other Effects / 262 \\
                 Summary Of Repeated Characters / 263 \\
                 C. Further Reading And Resources / 265 \\
                 Sources Of Documentor's Workbench Software / 266 \\
                 Index / 267",
}

@Book{McGrath:1998:PSS,
  author =       "Sean McGrath",
  title =        "{ParseMe.1st}: {SGML} for Software Developers",
  publisher =    pub-PHPTR,
  address =      pub-PHPTR:adr,
  pages =        "xxiii + 341",
  month =        jan,
  year =         "1998",
  ISBN =         "0-13-488967-3",
  ISBN-13 =      "978-0-13-488967-2",
  LCCN =         "QA76.76.H94M388 1998",
  bibdate =      "Mon May 24 06:38:24 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$33.75",
  acknowledgement = ack-nhfb,
  keywords =     "SGML (document markup language)",
  xxprice =      "US\$55.00",
}

@Book{McGrayne:2011:TWH,
  author =       "Sharon Bertsch McGrayne",
  title =        "The theory that would not die: how {Bayes}' rule
                 cracked the {Enigma} code, hunted down {Russian}
                 submarines, and emerged triumphant from two centuries
                 of controversy",
  publisher =    pub-YALE,
  address =      pub-YALE:adr,
  pages =        "xiii + 320",
  year =         "2011",
  ISBN =         "0-300-16969-8",
  ISBN-13 =      "978-0-300-16969-0",
  LCCN =         "QA279.5 .M415 2011",
  bibdate =      "Wed May 11 14:42:54 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/chance.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "Bayes' rule appears to be a straightforward, one-line
                 theorem: by updating our initial beliefs with objective
                 new information, we get a new and improved belief. To
                 its adherents, it is an elegant statement about
                 learning from experience. To its opponents, it is
                 subjectivity run amok. In the first-ever account of
                 Bayes' rule for general readers, Sharon Bertsch
                 McGrayne explores this controversial theorem and the
                 human obsessions surrounding it. She traces its
                 discovery by an amateur mathematician in the 1740s
                 through its development into roughly its modern form by
                 French scientist Pierre Simon Laplace. She reveals why
                 respected statisticians rendered it professionally
                 taboo for 150 years --- at the same time that
                 practitioners relied on it to solve crises involving
                 great uncertainty and scanty information, even breaking
                 Germany's Enigma code during World War II, and explains
                 how the advent of off-the-shelf computer technology in
                 the 1980s proved to be a game-changer. Today, Bayes'
                 rule is used everywhere from DNA de-coding to Homeland
                 Security. Drawing on primary source material and
                 interviews with statisticians and other scientists,
                 \booktitle{The Theory That Would Not Die} is the
                 riveting account of how a seemingly simple theorem
                 ignited one of the greatest controversies of all
                 time.",
  acknowledgement = ack-nhfb,
  remark =       "This book has important comments on the battles among
                 Sir Ronald Fisher, Jerzy Neyman, Egon Pearson, and Karl
                 Pearson, supplementing the extensive discussion of
                 those conflicts in \cite{Ziliak:2008:CSS}.",
  subject =      "Bayesian statistical decision theory; history; science
                 / history; mathematics / history and philosophy",
  tableofcontents = "Part 1. Enlightenment and the anti-Bayesian
                 reaction \\
                 Causes in the air \\
                 The man who did everything \\
                 Many doubts, few defenders \\
                 Part 2. Second World War era \\
                 Bayes goes to war \\
                 Dead and buried again \\
                 Part 3. The glorious revival \\
                 Arthur Bailey \\
                 From tool to theology \\
                 Jerome Cornfield, lung cancer, and heart attacks \\
                 There's always a first time \\
                 46,656 varieties \\
                 Part 4. To prove its worth \\
                 Business decisions \\
                 Who wrote The Federalist? \\
                 The cold warrior \\
                 Three Mile Island \\
                 The Navy searches \\
                 Part 5. Victory \\
                 Eureka! \\
                 Rosetta stones \\
                 Appendixes \\
                 Dr. Fisher's casebook \\
                 Applying Baye's Rule to mammograms and breast cancer",
}

@Book{McKechnie:1979:WNT,
  editor =       "Jean L. McKechnie",
  title =        "{Webster}'s new twentieth century dictionary of the
                 {English} language, unabridged: Based upon the broad
                 foundations laid down by {Noah Webster}",
  publisher =    "W. Collins",
  address =      "Cleveland, OH, USA",
  pages =        "2129 + xiv + 160",
  year =         "1979",
  ISBN =         "0-529-04852-3",
  ISBN-13 =      "978-0-529-04852-3",
  LCCN =         "PE1625 W375 1979",
  bibdate =      "Sat Dec 24 11:53:05 MST 2005",
  bibsource =    "Amazon;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  category =     "Reference: Dictionaries \& Thesauruses: General",
  dateentered =  "2005-12-23",
  DEWEY =        "423",
  idnumber =     "529",
  keywords =     "English language --- Dictionaries",
  pubdate =      "1979",
}

@Book{McKeown:1982:MC,
  author =       "G. P. McKeown and V. J. Rayward-Smith",
  title =        "Mathematics for Computing",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "428",
  year =         "1982",
  ISBN =         "0-470-27268-6 (paperback)",
  ISBN-13 =      "978-0-470-27268-8 (paperback)",
  LCCN =         "QA39.2 .M42 1982",
  bibdate =      "Wed Dec 15 10:39:04 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{McKusick:1996:DIO,
  author =       "Marshall Kirk McKusick and Keith Bostic and Michael J.
                 Karels and John S. Quarterman",
  title =        "The Design and Implementation of the {4.4BSD}
                 Operating System",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xxvi + 580",
  year =         "1996",
  ISBN =         "0-201-54979-4",
  ISBN-13 =      "978-0-201-54979-9",
  LCCN =         "QA76.76.O63D4743 1996",
  bibdate =      "Wed Aug 21 17:23:30 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  price =        "US\$44.95",
  URL =          "http://wiki.tuhs.org/doku.php?id=publications:4.4bsd_design",
  abstract =     "This book describes the design and implementation of
                 the BSD operating system --- previously known as the
                 Berkeley version of UNIX. Today, BSD is found in nearly
                 every variant of UNIX, and is widely used for Internet
                 services and firewalls, timesharing, and
                 multiprocessing systems. Readers involved in technical
                 and sales support can learn the capabilities and
                 limitations of the system; applications developers can
                 learn effectively and efficiently how to interface to
                 the system; systems programmers can learn how to
                 maintain, tune, and extend the system. Written from the
                 unique perspective of the system's architects, this
                 book delivers the most comprehensive, up-to-date, and
                 authoritative technical information on the internal
                 structure of the latest BSD system.",
  acknowledgement = ack-nhfb,
  tableofcontents = "History and goals \\
                 Design overview of 4.4BSD \\
                 Kernel services \\
                 Process management \\
                 Memory management \\
                 I/O system overview \\
                 Local filesystems \\
                 Local filestones \\
                 The network filesystem \\
                 Terminal handling \\
                 Interprocess communication \\
                 Network communication \\
                 Network protocols \\
                 System startup",
}

@Book{McKusick:2005:DIF,
  author =       "Marshall Kirk McKusick and George V. Neville-Neil",
  title =        "The Design and Implementation of the {FreeBSD}
                 Operating System",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xxviii + 683",
  year =         "2005",
  ISBN =         "0-201-70245-2 (hardcover)",
  ISBN-13 =      "978-0-201-70245-3 (hardcover)",
  LCCN =         "QA76.76.O63 M398745 2005",
  bibdate =      "Fri Jul 09 07:45:56 2004",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.mckusick.com/FreeBSDbook.html",
  abstract =     "As in earlier Addison-Wesley books on the UNIX-based
                 BSD operating system, Kirk McKusick and George
                 Neville-Neil deliver here the most comprehensive,
                 up-to-date, and authoritative technical information on
                 the internal structure of open source FreeBSD. Readers
                 involved in technical and sales support can learn the
                 capabilities and limitations of the system;
                 applications developers can learn effectively and
                 efficiently how to interface to the system; system
                 administrators can learn how to maintain, tune, and
                 configure the system; and systems programmers can learn
                 how to extend, enhance, and interface to the system.
                 The authors provide a concise overview of FreeBSD's
                 design and implementation. Then, while explaining key
                 design decisions, they detail the concepts, data
                 structures, and algorithms used in implementing the
                 systems facilities. As a result, readers can use this
                 book as both a practical reference and an in-depth
                 study of a contemporary, portable, open source
                 operating system. This book: Details the many
                 performance improvements in the virtual memory system
                 Describes the new symmetric multiprocessor support
                 Includes new sections on threads and their scheduling
                 Introduces the new jail facility to ease the hosting of
                 multiple domains Updates information on networking and
                 interprocess communication Already widely used for
                 Internet services and firewalls, high-availability
                 servers, and general timesharing systems, the lean
                 quality of FreeBSD also suits the growing area of
                 embedded systems. Unlike Linux, FreeBSD does not
                 require users to publicize any changes they make to the
                 source code.",
  acknowledgement = ack-nhfb,
  subject =      "FreeBSD; Free computer software; Operating systems
                 (Computers)",
  tableofcontents = "1: History and goals \\
                 2: Design overview of FreeBSD \\
                 3: Kernel services \\
                 4: Process management \\
                 5: Memory management \\
                 6: I/O system overview \\
                 7: Devices \\
                 8: Local filesystems \\
                 9: network filesystem \\
                 10: Terminal handling \\
                 11: Interprocess communication \\
                 12: Network communication \\
                 13: Network protocols \\
                 14: Startup and shutdown",
}

@Book{McKusick:2015:DIF,
  author =       "Marshall Kirk McKusick and George V. Neville-Neil and
                 Robert N. M. Watson",
  title =        "The Design and Implementation of the {FreeBSD}
                 Operating System",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Second",
  pages =        "xxx + 886",
  year =         "2015",
  ISBN =         "0-201-70245-2 (hardcover), 0-321-96897-2 (hardcover),
                 0-321-68005-7, 0-13-376180-0, 0-13-376183-5",
  ISBN-13 =      "978-0-201-70245-3 (hardcover), 978-0-321-96897-5
                 (hardcover), 978-0-321-68005-1, 978-0-13-376180-1,
                 978-0-13-376183-2",
  LCCN =         "QA76.774.F74 M35 2015",
  bibdate =      "Wed Oct 12 16:31:51 MDT 2016",
  bibsource =    "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",
  abstract =     "This book contains comprehensive, up-to-date, and
                 authoritative technical information on the internal
                 structure of the FreeBSD open-source operating system.
                 Coverage includes the capabilities of the system; how
                 to effectively and efficiently interface to the system;
                 how to maintain, tune, and configure the operating
                 system; and how to extend and enhance the system. The
                 authors provide a concise overview of FreeBSD's design
                 and implementation. Then, while explaining key design
                 decisions, they detail the concepts, data structures,
                 and algorithms used in implementing the systems
                 facilities. As a result, this book can be used as an
                 operating systems textbook, a practical reference, or
                 an in-depth study of a contemporary, portable,
                 open-source operating system.",
  acknowledgement = ack-nhfb,
  subject =      "FreeBSD; Free computer software; Operating systems
                 (Computers)",
  tableofcontents = "Preface / xxi About the Authors / xxix \\
                 Part I: Overview / 1 \\
                 Chapter 1: History and Goals / 3 \\
                 1.1 History of the UNIX System / 3 \\
                 1.2 BSD and Other Systems / 7 \\
                 1.3 The Transition of BSD to Open Source / 9 \\
                 1.4 The FreeBSD Development Model / 14 \\
                 References / 17 \\
                 Chapter 2: Design Overview of FreeBSD / 21 \\
                 2.1 FreeBSD Facilities and the Kernel / 21 \\
                 2.2 Kernel Organization / 23 \\
                 2.3 Kernel Services / 26 \\
                 2.4 Process Management / 26 \\
                 2.5 Security / 29 \\
                 2.6 Memory Management / 36 \\
                 2.7 I/O System Overview / 39 \\
                 2.8 Devices / 44 \\
                 2.9 The Fast Filesystem / 45 \\
                 2.10 The Zettabyte Filesystem / 49 \\
                 2.11 The Network Filesystem / 50 \\
                 2.12 Interprocess Communication / 50 \\
                 2.13 Network-Layer Protocols / 51 \\
                 2.14 Transport-Layer Protocols / 52 \\
                 2.15 System Startup and Shutdown / 52 \\
                 Exercises / 54 \\
                 References / 54 \\
                 Chapter 3: Kernel Services / 57 \\
                 3.1 Kernel Organization / 57 \\
                 3.2 System Calls / 62 \\
                 3.3 Traps and Interrupts / 64 \\
                 3.4 Clock Interrupts / 65 \\
                 3.5 Memory-Management Services / 69 \\
                 3.6 Timing Services / 73 \\
                 3.7 Resource Services / 75 \\
                 3.8 Kernel Tracing Facilities / 77 \\
                 Exercises / 84 \\
                 References / 85 \\
                 Part II: Processes / 87 \\
                 Chapter 4: Process Management / 89 \\
                 4.1 Introduction to Process Management / 89 \\
                 4.2 Process State / 92 \\
                 4.3 Context Switching / 99 \\
                 4.4 Thread Scheduling / 114 \\
                 4.5 Process Creation / 126 \\
                 4.6 Process Termination / 128 \\
                 4.7 Signals / 129 \\
                 4.8 Process Groups and Sessions / 136 \\
                 4.9 Process Debugging / 142 \\
                 Exercises / 144 \\
                 References / 146 \\
                 Chapter 5: Security / 147 \\
                 5.1 Operating-System Security / 148 \\
                 5.2 Security Model / 149 \\
                 5.3 Process Credentials / 151 \\
                 5.4 Users and Groups / 154 \\
                 5.5 Privilege Model / 157 \\
                 5.6 Interprocess Access Control / 159 \\
                 5.7 Discretionary Access Control / 161 \\
                 5.8 Capsicum Capability Model / 174 \\
                 5.9 Jails / 180 \\
                 5.10 Mandatory Access-Control Framework / 184 \\
                 5.11 Security Event Auditing / 200 \\
                 5.12 Cryptographic Services / 206 \\
                 5.13 GELI Full-Disk Encryption / 212 \\
                 Exercises / 217 \\
                 References / 217 \\
                 Chapter 6: Memory Management / 221 \\
                 6.1 Terminology / 221 \\
                 6.2 Overview of the FreeBSD Virtual-Memory System / 227
                 \\
                 6.3 Kernel Memory Management / 230 \\
                 6.4 Per-Process Resources / 244 \\
                 6.5 Shared Memory / 250 \\
                 6.6 Creation of a New Process / 258 \\
                 6.7 Execution of a File / 262 \\
                 6.8 Process Manipulation of Its Address Space / 263 \\
                 6.9 Termination of a Process / 266 \\
                 6.10 The Pager Interface / 267 \\
                 6.11 Paging / 276 \\
                 6.12 Page Replacement / 289 \\
                 6.13 Portability / 298 \\
                 Exercises / 308 \\
                 References / 310 \\
                 Part III: I/O System / 313 \\
                 Chapter 7: I/O System Overview / 315 \\
                 7.1 Descriptor Management and Services / 316 \\
                 7.2 Local Interprocess Communication / 333 \\
                 7.3 The Virtual-Filesystem Interface / 339 \\
                 7.4 Filesystem-Independent Services / 344 \\
                 7.5 Stackable Filesystems / 352 \\
                 Exercises / 358 \\
                 References / 359 \\
                 Chapter 8: Devices / 361 \\
                 8.1 Device Overview / 361 \\
                 8.2 I/O Mapping from User to Device / 367 \\
                 8.3 Character Devices / 370 \\
                 8.4 Disk Devices / 374 \\
                 8.5 Network Devices / 378 \\
                 8.6 Terminal Handling / 382 \\
                 8.7 The GEOM Layer / 391 \\
                 8.8 The CAM Layer / 399 \\
                 8.9 Device Configuration / 402 \\
                 8.10 Device Virtualization / 414 \\
                 Exercises / 428 \\
                 References / 429 \\
                 Chapter 9: The Fast Filesystem / 431 \\
                 9.1 Hierarchical Filesystem Management / 431 \\
                 9.2 Structure of an Inode / 433 \\
                 9.3 Naming / 443 \\
                 9.4 Quotas / 451 \\
                 9.5 File Locking / 454 \\
                 9.6 Soft Updates / 459 \\
                 9.7 Filesystem Snapshots / 480 \\
                 9.8 Journaled Soft Updates / 487 \\
                 9.9 The Local Filestore / 496 \\
                 9.10 The Berkeley Fast Filesystem / 501 \\
                 Exercises / 517 \\
                 References / 519 \\
                 Chapter 10: The Zettabyte Filesystem / 523 \\
                 10.1 Introduction / 523 \\
                 10.2 ZFS Organization / 527 \\
                 10.3 ZFS Structure / 532 \\
                 10.4 ZFS Operation / 535 \\
                 10.5 ZFS Design Tradeoffs / 547 \\
                 Exercises / 549 \\
                 References / 549 \\
                 Chapter 11: The Network Filesystem / 551 \\
                 11.1 Overview / 551 \\
                 11.2 Structure and Operation / 553 \\
                 11.3 NFS Evolution / 567 \\
                 Exercises / 586 \\
                 References / 587 \\
                 Part IV: Interprocess Communication / 591 \\
                 Chapter 12: Interprocess Communication / 593 \\
                 12.1 Interprocess-Communication Model / 593 \\
                 12.2 Implementation Structure and Overview / 599 \\
                 12.3 Memory Management / 601 \\
                 12.4 IPC Data Structures / 606 \\
                 12.5 Connection Setup / 612 \\
                 12.6 Data Transfer / 615 \\
                 12.7 Socket Shutdown / 620 \\
                 12.8 Network-Communication Protocol Internal Structure
                 / 621 \\
                 12.9 Socket-to-Protocol Interface / 626 \\
                 12.10 Protocol-to-Protocol Interface / 631 \\
                 12.11 Protocol-to-Network Interface / 634 \\
                 12.12 Buffering and Flow Control / 643 \\
                 12.13 Network Virtualization / 644 \\
                 Exercises / 646 \\
                 References / 648 \\
                 Chapter 13: Network-Layer Protocols / 649 \\
                 13.1 Internet Protocol Version 4 / 650 \\
                 13.2 Internet Control Message Protocols (ICMP) / 657
                 \\
                 13.3 Internet Protocol Version 6 / 659 \\
                 13.4 Internet Protocols Code Structure / 670 \\
                 13.5 Routing / 675 \\
                 13.6 Raw Sockets / 686 \\
                 13.7 Security / 688 \\
                 13.8 Packet-Processing Frameworks / 700 \\
                 Exercises / 715 \\
                 References / 717 \\
                 Chapter 14: Transport-Layer Protocols / 721 \\
                 14.1 Internet Ports and Associations / 721 \\
                 14.2 User Datagram Protocol (UDP) / 723 \\
                 14.3 Transmission Control Protocol (TCP) / 725 \\
                 14.4 TCP Algorithms / 732 \\
                 14.5 TCP Input Processing / 741 \\
                 14.6 TCP Output Processing / 745 \\
                 14.7 Stream Control Transmission Protocol (SCTP) / 761
                 \\
                 Exercises / 768 \\
                 References / 770 \\
                 Part V: System Operation / 773 \\
                 Chapter 15: System Startup and Shutdown / 775 \\
                 15.1 Firmware and BIOSes / 776 \\
                 15.2 Boot Loaders / 777 \\
                 15.3 Kernel Boot / 782 \\
                 15.4 User-Level Initialization / 798 \\
                 15.5 System Operation / 800 \\
                 Exercises / 805 \\
                 References / 806 \\
                 Glossary / 807 \\
                 Index / 847",
}

@Book{McLeish:1991:SN,
  author =       "John McLeish",
  title =        "The Story of Numbers: How mathematics has shaped
                 civilization",
  publisher =    pub-FAWCETT,
  address =      pub-FAWCETT:adr,
  pages =        "266 + 8",
  year =         "1991",
  ISBN =         "0-449-90938-7 (paperback)",
  ISBN-13 =      "978-0-449-90938-6 (paperback)",
  LCCN =         "QA21.M38 1991",
  bibdate =      "Wed Aug 20 16:38:47 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$14.95",
  abstract =     "Explores the history of mathematics, discussing the
                 number systems of various cultures which are
                 representative of central themes and issues, and
                 looking at some of the individuals who are responsible
                 for the advancement of mathematics.",
  acknowledgement = ack-nhfb,
  remark =       "Originally published under the title ``Number'' in
                 Great Britain: Bloomsbury Pub., 1991, and in the United
                 States by Ballantine Books in 1992.",
  tableofcontents = "The language of number \\
                 The Amerindians and number \\
                 Sumeria and Babylon \\
                 Ancient Egypt \\
                 Ancient China \\
                 Ancient Greek fantasies about number \\
                 Ancient Israel \\
                 The Indian love-affair with number \\
                 The Maya \\
                 The Arabs: renaissance of number and science \\
                 Francis Bacon and new directions \\
                 John Napier: the rationalisation of arithmetic \\
                 The Newtonian revolution: the marriage of craftsmanship
                 and scholarship \\
                 Babbage, the great unknown \\
                 Boole and Boolean logic \\
                 Machines which (or who?) think \\
                 The electronic computer \\
                 The nature of scientific change",
}

@InCollection{McManus:color-printing,
  author =       "Paul A. McMannis",
  editor =       "Robert C. Durbeck and Sol Sherr",
  booktitle =    "Output Hardcopy Devices",
  title =        "Color Printing",
  chapter =      "17",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "441--462",
  year =         "1988",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{McPhee:1974:CBE,
  author =       "John A. McPhee",
  title =        "The Curve of Binding Energy",
  publisher =    pub-FARRAR,
  address =      pub-FARRAR:adr,
  pages =        "232",
  year =         "1974",
  ISBN =         "0-374-13373-5, 0-374-51598-0 (paperback)",
  ISBN-13 =      "978-0-374-13373-3, 978-0-374-51598-0 (paperback)",
  LCCN =         "UF767 .M215 1974",
  bibdate =      "Thu May 25 12:39:39 MDT 2006",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/d/dyson-freeman-j.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/bios/hol059/74001226.html;
                 http://www.loc.gov/catdir/description/hol054/74001226.html",
  abstract =     "Theodore Taylor was one of the most brilliant
                 engineers of the nuclear age, but in his later years he
                 became concerned with the possibility of an individual
                 being able to construct a weapon of mass destruction on
                 their own. McPhee tours American nuclear institutions
                 with Taylor and shows us how close we are to terrorist
                 attacks employing homemade nuclear weaponry.",
  acknowledgement = ack-nhfb,
  remark =       "Originally appeared in the New Yorker (10 December
                 1953). See pages 172--173 for Freeman Dyson's comments
                 on the special abilities of Ted Taylor.",
  subject =      "Atomic bomb; Nuclear industry; Security measures;
                 Taylor, Theodore B.",
  subject-dates = "1925--",
}

@Book{McPhee:1998:AFW,
  author =       "John A. McPhee",
  title =        "Annals of the Former World",
  publisher =    "Farrar, Straus and Giroux",
  address =      "New York, NY, USA",
  pages =        "696",
  year =         "1998",
  ISBN =         "0-374-10520-0, 0-374-51873-4 (paperback)",
  ISBN-13 =      "978-0-374-10520-4, 978-0-374-51873-8 (paperback)",
  LCCN =         "QE77 .M38 1998",
  bibdate =      "Sun Oct 25 08:44:41 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$35.00",
  abstract =     "Twenty years ago, when John McPhee began his journeys
                 back and forth across the United States, he planned to
                 describe a cross-section of North America at about the
                 fortieth parallel and, in the process, come to an
                 understanding not only of the science but of the style
                 of the geologists he traveled with. Like the terrain it
                 covers, Annals of the Former World tells a many-layered
                 tale, and the reader may choose one of many paths
                 through it, guided by twenty-five new maps and the
                 `Narrative Table of Contents' (an essay outlining the
                 history and structure of the project). Read
                 sequentially, the book is an organic succession of set
                 pieces, flashbacks, biographical sketches, and
                 histories of the human and lithic kind; approached
                 systematically, it can be a North American geology
                 primer, an exploration of plate tectonics, or a study
                 of geologic time and the development of the time
                 scale.",
  acknowledgement = ack-nhfb,
  remark =       "TUGboat editor Barbara Beeton <bnb@math.ams.org> says
                 of this book: ``it's a geologic journey across the
                 u.s., through the eyes of several professional
                 geologists with specialties in the areas they cover,
                 and written by the person whose writing style i most
                 admire, and wish i had the talent to emulate. if you
                 know anyone with the slightest interest in how the
                 rocks in the united states are put together, i
                 recommend it highly.''.",
  tableofcontents = "Basin and range \\
                 In suspect terrain \\
                 Rising from the plains \\
                 Assembling California \\
                 Crossing the craton",
}

@Book{McWhorter:2008:OMB,
  author =       "John McWhorter",
  title =        "Our magnificent bastard tongue: the untold history of
                 {English}",
  publisher =    "Gotham Books",
  address =      "New York, NY, USA",
  pages =        "xxiii + 230",
  year =         "2008",
  ISBN =         "1-59240-395-6",
  ISBN-13 =      "978-1-59240-395-0",
  LCCN =         "PE1075 .M597 2008",
  bibdate =      "Fri Jan 8 15:35:23 MST 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 melvyl.cdlib.org:210/CDL90",
  abstract =     "Why do we say ``I am reading a catalog'' instead of
                 ``I read a catalog''? Why do we say ``do'' at all? Is
                 the way we speak a reflection of our cultural values?
                 Delving into these provocative topics and more, author
                 McWhorter distills hundreds of years of lore into one
                 lively history. Covering the little-known Celtic and
                 Welsh influences on English, the impact of the Viking
                 raids and the Norman Conquest, and the Germanic
                 invasions that started it all during the fifth century
                 AD, and drawing on genetic and linguistic research as
                 well as a cache of trivia about the origins of English
                 words and syntax patterns, McWhorter ultimately
                 demonstrates the arbitrary, maddening nature of
                 English---and its ironic simplicity, due to its role as
                 a streamlined lingua franca during the early formation
                 of Britain. This is the book that language aficionados
                 have been waiting for.",
  acknowledgement = ack-nhfb,
  subject =      "English language; history; etymology; foreign
                 elements; foreign words and phrases; languages in
                 contact",
  tableofcontents = "We speak a miscegenated grammar \\
                 A lesson from the Celtic impact \\
                 We speak a battered grammar \\
                 Does our grammar channel our thought? \\
                 Skeletons in the closet",
}

@Book{Mecklenburg:2005:MPG,
  author =       "Robert Mecklenburg",
  title =        "Managing Projects with {GNU} Make",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  edition =      "Third",
  pages =        "xviii + 280",
  year =         "2005",
  ISBN =         "0-596-00610-1 (paperback)",
  ISBN-13 =      "978-0-596-00610-5 (paperback)",
  LCCN =         "QA76.76.U84 O73 2005",
  bibdate =      "Sun Dec 26 08:57:19 2004",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$29.95",
  abstract =     "The utility simply known as make is one of the most
                 enduring features of both Unix and other operating
                 systems. First invented in the 1970s, make still turns
                 up to this day as the central engine in most
                 programming projects; it even builds the Linux kernel.
                 In the third edition of the classic Managing Projects
                 with GNU make, readers will learn why this utility
                 continues to hold its top position in project build
                 software, despite many younger competitors. The premise
                 behind make is simple: after you change source files
                 and want to rebuild your program or other output files,
                 make checks timestamp \ldots{}",
  acknowledgement = ack-nhfb,
  tableofcontents = "Foreword \\
                 Preface \\
                 Part I. Basic Concepts \\
                 1. How to Write a Simple Makefile \\
                 Targets and Prerequisites \\
                 Dependency Checking \\
                 Minimizing Rebuilds \\
                 Invoking make \\
                 Basic Makefile Syntax \\
                 2. Rules \\
                 Explicit Rules \\
                 Variables \\
                 Finding Files with VPATH and vpath \\
                 Pattern Rules \\
                 The Implicit Rules Database \\
                 Special Targets \\
                 Automatic Dependency Generation \\
                 Managing Libraries \\
                 3. Variables and Macros \\
                 What Variables Are Used For \\
                 Variable Types \\
                 Macros \\
                 When Variables Are Expanded Target- and
                 Pattern-Specific Variables \\
                 Where Variables Come From \\
                 Conditional and include Processing \\
                 Standard make Variables \\
                 4. Functions \\
                 User-Defined Functions \\
                 Built-in Functions \\
                 Advanced User-Defined Functions \\
                 5. Commands \\
                 Parsing Commands \\
                 Which Shell to Use \\
                 Empty Commands \\
                 Command Environment \\
                 Evaluating Commands \\
                 Command-Line Limits \\
                 Part II. Advanced and Specialized Topics \\
                 6. Managing Large Projects \\
                 Recursive make \\
                 Nonrecursive make \\
                 Components of Large Systems \\
                 Filesystem Layout \\
                 Automating Builds and Testing \\
                 7. Portable Makefiles \\
                 Portability Issues \\
                 Cygwin \\
                 Managing Programs and Files \\
                 Working with Nonportable Tools \\
                 Automake \\
                 8. C and C++ \\
                 Separating Source and Binary \\
                 Read-Only Source \\
                 Dependency Generation \\
                 Supporting Multiple Binary Trees \\
                 Partial Source Trees \\
                 Reference Builds, Libraries, and Installers \\
                 9. Java \\
                 Alternatives to make \\
                 A Generic Java Makefile \\
                 Compiling Java \\
                 Managing Jars \\
                 Reference Trees and Third-Party Jars \\
                 Enterprise JavaBeans \\
                 10. Improving the Performance of make \\
                 Benchmarking \\
                 Identifying and Handling Bottlenecks \\
                 Parallel make \\
                 Distributed make \\
                 11. Example Makefiles \\
                 The Book Makefile \\
                 The Linux Kernel Makefile \\
                 12. Debugging Makefiles \\
                 Debugging Features of make \\
                 Writing Code for Debugging \\
                 Common Error Messages \\
                 Part III. Appendixes \\
                 A. Running make \\
                 B. The Outer Limits \\
                 C. GNU Free Documentation License \\
                 GNU Project \\
                 Free Software Foundation (FSF) \\
                 Index",
}

@Book{Mersini-Houghton:2022:BBBc,
  author =       "Laura Mersini-Houghton",
  title =        "Before the Big Bang: the Origin of the Universe and
                 What Lies Beyond",
  publisher =    "Mariner Books",
  address =      "Boston, MA, USA",
  pages =        "xxi + 216",
  year =         "2022",
  ISBN =         "1-328-55711-1 (hardcover)",
  ISBN-13 =      "978-1-328-55711-7 (hardcover)",
  LCCN =         "QB981 .M477 2022",
  bibdate =      "Mon Nov 21 06:11:18 MST 2022",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "One of the world's leading experts on the multiverse
                 and the origins of the universe presents a
                 revolutionary new account of the events leading up to
                 the Big Bang.",
  acknowledgement = ack-nhfb,
  subject =      "Cosmology; Big bang theory; Multiverse; SCIENCE /
                 Space Science / Cosmology; SCIENCE / Physics /
                 Astrophysics; Big bang theory; Cosmology; Multiverse",
  tableofcontents = "Prologue: My Albanian Universe / xi \\
                 1: Is our universe special? / 1 \\
                 2: How did our universe start? / 17 \\
                 3: A quantum leap / 35\\
                 4: Fine-tuning / 61 \\
                 5: Are we alone? / 79 \\
                 6: Eleven dimensions / 95 \\
                 7: First wave / 113 \\
                 8: Into the Multiverse / 125 \\
                 9: The origin of our universe / 139 \\
                 10: Fingerprints of other universes / 171 \\
                 11: Infinity and eternity / 183 \\
                 Epilogue: a place to dream / 193 \\
                 Acknowledgments / 207 \\
                 Index / 210",
}

@Book{Merz:1991:TBP,
  author =       "Thomas Merz",
  title =        "{Terminal Buch, \POSTSCRIPT{} Fonts und
                 Programmiertechnik}",
  publisher =    pub-OLDENBOURG,
  address =      pub-OLDENBOURG:adr,
  pages =        "213",
  year =         "1991",
  ISBN =         "3-486-21674-0",
  ISBN-13 =      "978-3-486-21674-5",
  LCCN =         "????",
  bibdate =      "Tue Mar 10 09:48:04 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "DM 78,00",
  acknowledgement = ack-nhfb,
}

@Book{Merz:1997:AIW,
  author =       "Thomas Merz",
  title =        "{Mit Acrobat ins World Wide Web: Effiziente Erstellung
                 von PDF-Dateien und ihre Einbindung ins Web}",
  publisher =    pub-DPUNKT-VERLAG,
  address =      pub-DPUNKT-VERLAG:adr,
  pages =        "x + 225",
  year =         "1997",
  ISBN =         "3-9804943-1-4",
  ISBN-13 =      "978-3-9804943-1-1",
  LCCN =         "????",
  bibdate =      "Sun May 02 07:51:52 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Includes CD-ROM. English translation available as
                 \cite{Merz:1998:WPA}.",
  price =        "DM 69,00; ATS 504,00; CHF 61,00",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

@Book{Merz:1997:PAP,
  author =       "Thomas Merz",
  title =        "{\POSTSCRIPT} and Acrobat\slash {PDF}: applications,
                 troubleshooting, and cross-platform publishing",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xiii + 418",
  year =         "1997",
  ISBN =         "3-540w 0854-0",
  ISBN-13 =      "978-3-540-60854-7",
  LCCN =         "QA76.73.P67M4713 1997",
  bibdate =      "Wed Aug 20 16:39:12 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$69.50",
  acknowledgement = ack-nhfb,
  alttitle =     "{{\POSTSCRIPT}- und Acrobat-Bibel. English: PostScript
                 and Acrobat/PDF}",
  keywords =     "Adobe Acrobat; Electronic publishing; PostScript
                 (Computer program language)",
  searchkey =    "ti:PostScript or ti:adobe illustrator",
}

@Book{Merz:1998:WPA,
  author =       "Thomas Merz",
  title =        "{Web} Publishing with {Acrobat}\slash {PDF}",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xi + 234",
  year =         "1998",
  ISBN =         "3-540-63762-1",
  ISBN-13 =      "978-3-540-63762-2",
  LCCN =         "TK5105.888.M47 1998",
  bibdate =      "Thu May 28 07:24:34 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/postscri.bib",
  note =         "Includes CD-ROM. Revised and extended English
                 translation of the original German edition,
                 \cite{Merz:1997:AIW}.",
  URL =          "http://www.pdflib.com/pdfmark/index.html",
  abstract =     "Although the World Wide Web is enjoying enormous
                 growth rates, many Web publishers have discovered that
                 HTML is not up to the requirements of modern corporate
                 communication. For them, Adobe Acrobat offers a wealth
                 of design possibilities. The close integration of
                 Acrobat in the World Wide Web unites the structural
                 advantages of HTML with the comprehensive layout
                 possibilities of Portable Document Format (PDF). On the
                 basis of practical examples and numerous tricks, this
                 book describes how to produce PDF documents
                 efficiently. It also covers the new Acrobat Forms
                 extension which allows JavaScript to be used within PDF
                 and thus opens a whole new range of dynamic
                 applications. Numerous tips on integrating Acrobat into
                 CGI, JavaScript, VBScript, Active Server Pages, search
                 engines, and so on make the book a mine of information
                 for all designers and administrators of Web sites.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: HTML and PDF \\
                 2: PDF in the Browser \\
                 3: Planning PDF Documents \\
                 4: Creating PDF Files \\
                 5: PDF Support in Applications \\
                 6: pdfmark Primer \\
                 7: PDF Forms \\
                 8: PDF in HTML Pages \\
                 9: PDF on the Web Server \\
                 10: Form Data Processing \\
                 11: Full Text Retrieval and Search Engines \\
                 12: Dynamic PDF \\
                 A: Contents of the CD-ROM \\
                 B: PDF-related Web Resources",
}

@Book{Messiah:1999:QM,
  author =       "Albert Messiah",
  title =        "Quantum Mechanics",
  publisher =    pub-DOVER,
  address =      pub-DOVER:adr,
  pages =        "xxi + 1136",
  year =         "1999",
  ISBN =         "0-486-40924-4 (paperback)",
  ISBN-13 =      "978-0-486-40924-5 (paperback)",
  LCCN =         "QC174.12 .M4813 1999",
  bibdate =      "Tue Sep 21 14:11:34 MDT 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/description/dover032/99055362.html;
                 http://www.loc.gov/catdir/toc/dover031/99055362.html",
  acknowledgement = ack-nhfb,
  remark =       "Translation of: M{\'e}canique quantique. Previously
                 published as a two-volume work in English: Amsterdam:
                 North-Holland Pub. Co.; New York: Interscience
                 Publishers, 1961--1962.",
  subject =      "Quantum theory",
  tableofcontents = "The Formalism and Its Interpretation \\
                 The Origins of the Quantum Theory \\
                 Introduction / 3 \\
                 The end of the Classical Period / 4 \\
                 Classical Theoretical Physics \\
                 Progress in the knowledge of microscopic phenomena and
                 the appearance of quanta in physics \\
                 Light Quanta or Photons / 11 \\
                 The photoelectric effect \\
                 The Compton effect \\
                 Light quanta and interference phenomena \\
                 Conclusions \\
                 Quantization of Material Systems / 21 \\
                 Atomic spectroscopy and difficulties of Rutherford's
                 classical model \\
                 Quantization of atomic energy levels \\
                 Other examples of quantization: space quantization \\
                 Correspondence Principle and the Old Quantum Theory /
                 27 \\
                 Inadequacy of classical corpuscular theory \\
                 Correspondence principle \\
                 Application of the correspondence principle to the
                 calculation of the Rydberg constant \\
                 Lagrange's and Hamilton's forms of the equations of
                 classical mechanics \\
                 Bohr--Sommerfeld quantization rules \\
                 Successes and limitations of the Old Quantum Theory \\
                 Conclusions \\
                 Matter Waves and the Schr{\"o}dinger Equation \\
                 Historical survey and general plan of the succeeding
                 chapters / 45 \\
                 Matter Waves / 49 \\
                 Introduction \\
                 Free wave packet \\
                 Phase velocity and group velocity \\
                 Wave packet in a slowly varying field \\
                 Quantization of atomic energy levels \\
                 Diffraction of matter waves \\
                 Corpuscular structure of matter \\
                 Universal character of the wave-corpuscle duality \\
                 The Schr{\"o}dinger Equation / 59 \\
                 Conservation law of the number of particles of matter
                 \\
                 Necessity for a wave equation and conditions imposed
                 upon this equation \\
                 The operator concept \\
                 Wave equation of a free particle \\
                 Particle in a scalar potential \\
                 Charged particle in an electromagnetic field \\
                 General rule for forming the Schr{\"o}dinger equation
                 by correspondence \\
                 The Time-Independent Schr{\"o}dinger Equation \\
                 Search for stationary solutions \\
                 General properties of the equation \\
                 Nature of the energy spectrum \\
                 One-Dimensional Quantized Systems \\
                 Introduction \\
                 Square Potentials \\
                 General remarks \\
                 Potential step \\
                 Reflection and transmission of waves \\
                 Infinitely high potential barrier \\
                 Infinitely deep square potential well \\
                 Discrete spectrum \\
                 Study of a finite square well \\
                 Resonances \\
                 Penetration of a square potential barrier \\
                 The `tunnel' effect \\
                 General Properties of the One-Dimensional
                 Schr{\"o}dinger Equation \\
                 Property of the Wronskian \\
                 Asymptotic behavior of the solutions \\
                 Nature of the eigenvalue spectrum \\
                 Unbound states: reflection and transmission of waves
                 \\
                 Number of nodes of bound states \\
                 Orthogonality relations \\
                 Remark on parity \\
                 Statistical Interpretation of the Wave--Corpuscle \\
                 Duality and the Uncertainty Relations \\
                 Introduction \\
                 Statistical Interpretation of the Wave Functions of
                 Wave Mechanics \\
                 Probabilities of the results of measurement of the
                 position and the momentum of a particle \\
                 Conservation in time of the norm \\
                 Concept of current \\
                 Mean values of functions of r or of p \\
                 Generalization to systems of several particles
                 Heisenberg's Uncertainty Relations \\
                 Position-momentum uncertainty relations of a quantized
                 particle \\
                 Precise statement of the position-momentum uncertainty
                 relations \\
                 Generalization: uncertainty relations between conjugate
                 variables \\
                 Time-energy uncertainty relation \\
                 Uncertainty relations for photons / 71 p. 77 p. 78 / 98
                 / 115 p. 116 / 129 \\
                 Uncertainty Relations and the Measurement Process \\
                 Uncontrollable disturbance during the operation of
                 measurement \\
                 Position measurements \\
                 Momentum measurements \\
                 Description of Phenomena in Quantum Theory \\
                 Complementarity and Causality Problems raised by the
                 statistical interpretation \\
                 Description of microscopic phenomena and
                 complementarity \\
                 Complementary variables Compatible variables \\
                 Wave-corpuscle duality and complementarity \\
                 Complementarity and causality \\
                 Development of the Formalism of Wave Mechanics and Its
                 Interpretation \\
                 Introduction \\
                 Hermitean Operators and Physical Quantities \\
                 Wave-function space Definition of mean values \\
                 Absence of fluctuation and the eigenvalue problem \\
                 Study of the Discrete Spectrum Eigenvalues and
                 eigenfunctions of a Hermitean operator \\
                 Expansion of a wave function in a series of orthonormal
                 eigenfunctions \\
                 Statistical distribution of the results of measurement
                 of a quantity associated with an operator having a
                 complete set of eigenfunctions with finite norm \\
                 Statistics of Measurement in the General Case \\
                 Difficulties of the continuous spectrum \\
                 Introduction of the Dirac [delta]-functions \\
                 Expansion in a series of eigenfunctions in the general
                 case \\
                 Closure relation \\
                 Statistical distribution of the results of measurement
                 in the general case \\
                 Other ways of treating the continuous spectrum \\
                 Comments and examples \\
                 Determination of the Wave Function \\
                 Measuring process and `filtering' of the wave packet
                 \\
                 Ideal measurements \\
                 Commuting observables and compatible variables \\
                 Complete sets of commuting observables \\
                 Pure states and mixtures \\
                 Commutator Algebra and Its Applications \\
                 Commutator algebra and properties of basic commutators
                 \\
                 Commutation relations of angular momentum \\
                 Time dependence of the statistical distribution \\
                 Constants of the motion \\
                 Examples of constants of the motion / 139 p. 149 / 162
                 p. 163 p. 171 p. 179 / 196 p. 206 \\
                 Energy Parity \\
                 Classical Approximation and the WKB Method \\
                 The Classical Limit of Wave Mechanics \\
                 General remarks \\
                 Ehrenfest's theorem \\
                 Motion and spreading of wave packets \\
                 Classical limit of the Schr{\"o}dinger equation \\
                 Application to Coulomb scattering \\
                 The Rutherford formula \\
                 The WKB Method Principle of the method \\
                 One-dimensional WKB solutions \\
                 Conditions for the validity of the WKB approximation
                 \\
                 Turning points and connection formulae \\
                 Penetration of a potential barrier \\
                 Energy levels of a potential well \\
                 General Formalism of the Quantum Theory \\
                 (A) Mathematical Framework \\
                 Superposition principle and representation of dynamical
                 states by vectors \\
                 Vectors and Operators \\
                 Vector space \\
                 `Ket' vectors Dual space `Bra' vectors \\
                 Scalar product \\
                 Linear operators \\
                 Tensor product of two vector spaces \\
                 Hermitean Operators, Projectors, and Observables \\
                 Adjoint operators and conjugation relations \\
                 Hermitean (or self-adjoint) operators, positive
                 definite Hermitean operators, unitary operators \\
                 Eigenvalue problem and observables \\
                 Projectors (Projection operators) \\
                 Projector algebra \\
                 Observables possessing an entirely discrete spectrum
                 \\
                 Observables in the general case \\
                 Generalized closure relation \\
                 Functions of an observable \\
                 Operators which commute with an observable \\
                 Commuting observables \\
                 Representation Theory \\
                 General remarks on finite matrices / 214 p. 231 p. 243
                 p. 245 p. 254 / 273 \\
                 Square matrices \\
                 Extension to infinite matrices \\
                 Representation of vectors and operators by matrices \\
                 Matrix transformations \\
                 Change of representation \\
                 Unitary transformations of operators and vectors \\
                 General Formalism (B) \\
                 Description of Physical Phenomena \\
                 Introduction \\
                 Dynamical States and Physical Quantities \\
                 Definition of probabilities \\
                 Postulates concerning measurement \\
                 Observables of a quantized system and their commutation
                 relations \\
                 Heisenberg's uncertainty relations \\
                 Definition of the dynamical states and construction of
                 the space and one-dimensional quantum system having a
                 classical analogue \\
                 Construction of the and-space of a system by tensor
                 product of simpler spaces \\
                 The Equations of Motion Evolution operator and the
                 Schr{\"o}dinger equation \\
                 Schr{\"o}dinger `representation' \\
                 Heisenberg `representation' \\
                 Heisenberg `representation' and correspondence
                 principle \\
                 Constants of the motion \\
                 Equations of motion for the mean values \\
                 Time-energy uncertainty relation \\
                 Intermediate representations \\
                 Various representations of the theory \\
                 Definition of a representation \\
                 Wave mechanics \\
                 Momentum representation ({p}-representation) \\
                 An example: motion of a free wave packet \\
                 Other representations \\
                 Representations in which the energy is diagonal \\
                 Quantum Statistics \\
                 Incompletely known systems and statistical mixtures \\
                 The density operator \\
                 Evolution in time of a statistical mixture \\
                 Characteristic properties of the density operator \\
                 Pure states \\
                 Classical and quantum statistics \\
                 Simple Systems \\
                 Solution of the Schr{\"o}dinger Equation by Separation
                 of Variables \\
                 Central Potential \\
                 Introduction Particle in a Central Potential \\
                 General Treatment / 294 p. 296 / 310 / 323 p. 331 / 343
                 p. 344 \\
                 Expression of the Hamiltonian in spherical polar
                 coordinates \\
                 Separation of the angular variables \\
                 Spherical harmonics \\
                 The radial equation \\
                 Eigensolutions of the radial equation \\
                 Nature of the spectrum \\
                 Conclusions \\
                 Central Square-Well Potential \\
                 Free Particle \\
                 Spherical Bessel functions \\
                 Free particle \\
                 Plane waves and free spherical waves \\
                 Expansion of a plane wave in spherical harmonics \\
                 Study of a spherical square well \\
                 Two-body Problems \\
                 Separation of the Center-of-Mass \\
                 Motion Separation of the center-of-mass motion in
                 classical mechanics \\
                 Separation of the center-of-mass motion of a quantized
                 two-particle system \\
                 Extension to systems of more than two particles \\
                 Scattering Problems \\
                 Central Potential and Phase-Shift Method \\
                 Introduction \\
                 Cross Sections and Scattering Amplitudes \\
                 Definition of cross sections \\
                 Stationary wave of scattering \\
                 Representation of the scattering phenomenon by a bundle
                 of wave packets \\
                 Scattering of a wave packet by a potential \\
                 Calculation of cross sections \\
                 Collision of two particles \\
                 Laboratory system and center-of-mass system \\
                 Scattering by a Central Potential \\
                 Phase Shifts Decomposition into partial waves \\
                 Phase-shift method \\
                 Semiclassical representation of the collision \\
                 Impact parameters \\
                 Potential of Finite Range Relation between phase shift
                 and logarithmic derivative \\
                 Behavior of the phase shift at low energies \\
                 Partial waves of higher order \\
                 Convergence of the series \\
                 Scattering by a hard sphere \\
                 Scattering Resonances \\
                 Scattering by a deep square well \\
                 Study of a scattering resonance / 355 p. 361 p. 369 p.
                 369 / 385 p. 389 p. 396 \\
                 Metastable states \\
                 Observation of the lifetime of metastable states \\
                 Various Formulae and Properties \\
                 Integral representations of phase shifts \\
                 Dependence upon the potential \\
                 Sign of the phase shifts \\
                 The Born approximation \\
                 Effective range theory \\
                 The Bethe formula \\
                 The Coulomb Interaction \\
                 Introduction \\
                 The Hydrogen Atom \\
                 Schr{\"o}dinger equation of the hydrogen atom \\
                 Order of magnitude of the binding energy of the ground
                 state \\
                 Solution of the Schr{\"o}dinger equation in spherical
                 coordinates \\
                 Energy spectrum \\
                 Degeneracy \\
                 The eigenfunctions of the bound states \\
                 Coulomb Scattering \\
                 The Coulomb scattering wave \\
                 The Rutherford formula \\
                 Decomposition into partial waves \\
                 Expansion of the wave $\psi_c$ in spherical harmonics
                 \\
                 Modifications of the Coulomb potential by a short-range
                 interaction \\
                 The Harmonic Oscillator \\
                 Introduction \\
                 Eigenstates and Eigenvectors of the Hamiltonian \\
                 The eigenvalue problem \\
                 Introduction of the operators a, a and N \\
                 Spectrum and basis of N The {N} representation \\
                 Creation and destruction operators \\
                 {Q} representation \\
                 Hermite polynomials \\
                 Applications and Various Properties \\
                 Generating function for the eigenfunctions $u_n(Q)$ \\
                 Integration of the Heisenberg equations \\
                 Classical and quantized oscillator \\
                 Motion of the minimum wave packet and classical limit
                 \\
                 Harmonic oscillators in thermodynamic equilibrium \\
                 Isotropic Harmonic Oscillators in Several Dimensions
                 \\
                 General treatment of the isotropic oscillator in $p$
                 dimensions \\
                 Two-dimensional isotropic oscillator / 404 / 411 p. 412
                 p. 421 / 432 p. 433 / 441 p. 451 \\
                 Three-dimensional isotropic oscillator \\
                 Distributions, [delta]-'Function' and Fourier
                 Transformation \\
                 Special Functions and Associated Formulae \\
                 Symmetries and Invariance \\
                 Angular Momentum in Quantum Mechanics \\
                 Introduction \\
                 Eigenvalues and eigenfunctions of angular momentum \\
                 Definition of angular momentum \\
                 Characteristic algebraic relations \\
                 Spectrum of $J^2$ and $J_z$ \\
                 Eigenvectors of $J^2$ and $J_z$ \\
                 Construction of the invariant subspaces \\
                 E(j) Standard representation \\
                 $J^2$ \\
                 $J_z$ \\
                 Conclusion \\
                 Orbital angular momentum and the spherical harmonics
                 \\
                 The spectrum of l[superscript 2] and l[subscript z] \\
                 Definition and construction of the spherical harmonics
                 \\
                 Angular momentum and rotations \\
                 Definition of rotation \\
                 Euler angles \\
                 Rotation of a physical system \\
                 Rotation operator \\
                 Rotation of observables \\
                 Angular momentum and infinitesimal rotations \\
                 Construction of the operator R ([alpha] [beta] [gamma])
                 \\
                 Rotation through an angle 2[pi] and half-integral
                 angular momenta \\
                 Irreducible invariant subspaces \\
                 Rotation matrices R[superscript (j)] \\
                 Rotational invariance and conservation of angular
                 momentum \\
                 Rotational degeneracy \\
                 Spin T \\
                 he hypothesis of electron spin \\
                 Spin 1/2 and the Pauli matrices \\
                 Observables and wave functions of a spin 1/2 particle
                 \\
                 Spinor fields \\
                 Vector fields and particles of spin 1 \\
                 Spindependent interactions in atoms \\
                 Spin-dependent nucleon-nucleon interactions \\
                 Addition of angular momenta \\
                 The addition problem \\
                 Addition theorem for two angular momenta \\
                 Applications and examples \\
                 Eigenvectors of the total angular momentum / 462 p. 479
                 p. 507 p. 508 / 519 p. 523 / 540 / 555 \\
                 Clebsch--Gordon coefficients \\
                 Application: two-nucleon system \\
                 Addition of three or more angular momenta \\
                 Racah coefficients \\
                 `3sj' symbols \\
                 Irreducible tensor operators \\
                 Representation of scalar operators \\
                 Irreducible tensor operators \\
                 Definition \\
                 Representation of irreducible tensor operators \\
                 Wigner--Eckhart theorem \\
                 Applications \\
                 Systems of Identical Particles \\
                 Pauli Exclusion Principle \\
                 Identical particles in quantum theory \\
                 Symmetrization postulate \\
                 Similar particles and the symmetrical representation
                 \\
                 Permutation operators \\
                 Algebra of permutation operators \\
                 Symmetrizers and antisymmetrizers \\
                 Identical particles and the symmetrization postulate
                 Bosons and Bose-Einstein statistics \\
                 Fermions and Fermi-Dirac statistics \\
                 Exclusion principle \\
                 It is always necessary to symmetrize the wave-function
                 \\
                 Applications \\
                 Collision of two spinless identical particles \\
                 Collision of two protons \\
                 Statistics of atomic nuclei \\
                 Complex atoms \\
                 Central field approximation \\
                 The Thomas-Fermi model of the atom \\
                 Nucleon systems and isotopic spin \\
                 Utility of isotopic spin \\
                 Charge independence \\
                 Invariance and Conservation Theorems \\
                 Time Reversal \\
                 Introduction \\
                 Mathematical complements \\
                 Antilinear operators \\
                 Three useful theorems \\
                 Antilinear operators in Hilbert space \\
                 Antilinear transformations \\
                 Antilinear operators and representations \\
                 Transformations and groups of transformations / 569 /
                 582 p. 586 / 603 / 632 p. 633 p. 643 \\
                 Transformations of the dynamical variables and
                 dynamical states of a system \\
                 Groups of transformations \\
                 Groups of transformation operators \\
                 Continuous groups and infinitesimal transformations \\
                 Translations \\
                 Rotations \\
                 Finite groups \\
                 Reflections \\
                 Invariance of the equations of motion and conservation
                 laws \\
                 Invariant observables \\
                 Symmetry of the Hamiltonian and conservation laws \\
                 Invariance properties and the evolution of dynamical
                 states \\
                 Symmetries of the Stark and Zeeman effects \\
                 Time reversal and the principle of microreversibility
                 \\
                 Time translation and conservation of energy \\
                 Time reversal in classical mechanics and in quantum
                 mechanics \\
                 The time-reversal operation Spinless particle \\
                 General definition of time reversal \\
                 Time reversal and complex conjugation \\
                 Principle of microreversibility \\
                 Consequence: Kramers degeneracy \\
                 Real rotation-invariant Hamiltonian Methods of
                 Approximation \\
                 Stationary Perturbations \\
                 General introduction to Part Four \\
                 Perturbation of a non-degenerate level \\
                 Expansion in powers of the perturbation \\
                 First-order perturbations Ground state of the helium
                 atom \\
                 Coulomb energy of atomic nuclei \\
                 Higher-order corrections \\
                 Stark effect for a rigid rotator \\
                 Perturbation of a degenerate level Elementary theory
                 \\
                 Atomic levels in the absence of spin-orbit forces \\
                 Spin-orbit forces \\
                 LS and jj coupling \\
                 The atom in LS coupling \\
                 Splitting due to spin-orbital coupling \\
                 The Zeeman and Paschen--Back effects / 655 p. 664 / 685
                 p. 686 p. 698 \\
                 Symmetry of H and removal of degeneracy \\
                 Quasi-degeneracy \\
                 Explicit forms for the perturbation expansion in all
                 orders \\
                 The Hamiltonian H and its resolvent G(z) \\
                 Expansion of G(z), P and HP into power series in V \\
                 Calculation of eigenvalues and eigenstates \\
                 Approximate Solutions of the Time-Dependent
                 Schr{\"o}dinger Equation \\
                 Change of `representation' and perturbation treatment
                 of a part of the Hamiltonian \\
                 Time dependent perturbation theory \\
                 Definition and perturbation calculation of transition
                 probabilities \\
                 Semi-classical theory of Coulomb excitation of nuclei
                 \\
                 Case when V is independent of time \\
                 Conservation of unperturbed energy \\
                 Application to the calculation of cross-sections in the
                 Born approximation \\
                 Periodic perturbation \\
                 Resonances \\
                 Sudden or Adiabatic Change of the Hamiltonian \\
                 The problem and the results \\
                 Rapid passage and the sudden approximation \\
                 Sudden reversal of a magnetic field \\
                 Adiabatic passage \\
                 Generalities \\
                 Trivial case `Rotating axis representation' \\
                 Proof of the adiabatic theorem \\
                 Adiabatic approximation \\
                 Adiabatic reversal of a magnetic field \\
                 The Variational Method and Associated Problems \\
                 The Ritz variational method \\
                 Variational Method for Bound States \\
                 Variational form of the eigenvalue problem \\
                 Variational calculation of discrete levels \\
                 A simple example: the hydrogen atom \\
                 Discussion \\
                 Application to the calculation of excited levels \\
                 Ground state of the helium atom \\
                 The Hartree and Fock--Dirac Atoms \\
                 The self-consistent field method \\
                 Calculation of E[Phi] \\
                 The Fock--Dirac equations \\
                 Discussion The Hartree equations / 712 p. 722 p. 724 /
                 739 / 762 p. 763 / 773 \\
                 The Structure of Molecules \\
                 Generalities \\
                 Separation of the electronic and nuclear motions \\
                 Motion of the electrons in the presence of fixed nuclei
                 \\
                 The adiabatic approximation Hamiltonian for the nuclei
                 in the adiabatic approximation \\
                 The Born--Oppenheimer method \\
                 Notions on diatomic molecules \\
                 Collision Theory \\
                 Introduction \\
                 Free Wave Green's Function and the Born Approximation
                 \\
                 Integral representations of the scattering amplitude
                 \\
                 Cross sections and the T matrix \\
                 Microreversibility \\
                 The Born approximation \\
                 Integral equation for scattering \\
                 The Born expansion \\
                 Validity criterion for the Born approximation \\
                 Elastic scattering of electrons by an atom \\
                 Central potential \\
                 Calculation of phase shifts \\
                 Green's function as an operator \\
                 Relation to the resolvent of H[subscript 0] \\
                 Generalization to Distorted Waves \\
                 Generalized Born approximation \\
                 Generalization of the Born expansion \\
                 Green's functions for distorted waves \\
                 Applications \\
                 Definition and formal properties of T \\
                 Note on the 1/4 potentials \\
                 Complex Collisions and the Born Approximation \\
                 Generalities \\
                 Cross sections \\
                 Channels \\
                 Calculation of cross sections \\
                 T matrices \\
                 Integral representations of the transition amplitude
                 \\
                 The Born approximation and its generalizations \\
                 Scattering of fast electrons by an atom \\
                 Coulomb excitation of nuclei \\
                 Green's functions and integral equations for stationary
                 scattering waves / 781 / 801 p. 802 / 822 p. 832 \\
                 Scattering of a particle by two scattering centers \\
                 Simple scattering \\
                 Interference \\
                 Multiple scattering \\
                 Variational Calculations of Transition Amplitudes \\
                 Stationary expressions for the phase shifts \\
                 The variational calculation of phase shifts \\
                 Discussion \\
                 Extension to complex collisions \\
                 General Properties of the Transition Matrix \\
                 Conservation of flux \\
                 Unitarity of the S matrix \\
                 The Bohr--Peierls--Placzek relation (optical theorem)
                 \\
                 Microreversibility \\
                 Invariance properties of the T matrix \\
                 Elements of Relativistic Quantum Mechanics \\
                 The Dirac Equation \\
                 General \\
                 Introduction \\
                 Relativistic quantum mechanics \\
                 Notation, various conventions and definitions \\
                 The Lorentz group \\
                 Classical relativistic dynamics \\
                 The Dirac and Klein--Gordon Equations \\
                 The Klein--Gordon equation \\
                 The Dirac equation \\
                 Construction of the space E[superscript (s)] \\
                 Dirac representation \\
                 Covariant form of the Dirac equation \\
                 Adjoint equation \\
                 Definition of the current \\
                 Invariance Properties of the Dirac Equation \\
                 Properties of the Dirac matrices \\
                 Invariance of the form of the Dirac equation in an
                 orthochronous change of referential / 856 p. 863 / 875
                 p. 884 / 896 \\
                 Transformation of the proper group \\
                 Spatial reflection and the orthochronous group \\
                 Construction of covariant quantities \\
                 A second formulation of the invariance of form:
                 transformation of states \\
                 Invariance of the law of motion \\
                 Transformation operators \\
                 Momentum, angular momentum, parity \\
                 Conservation laws and constants of the motion \\
                 Time reversal and charge conjugation \\
                 Gauge invariance \\
                 Interpretation of the Operators and Simple Solutions
                 \\
                 The Dirac equation and the correspondence principle \\
                 Dynamical variables of a Dirac particle \\
                 The free electron \\
                 Plane waves \\
                 Construction of the plane waves by a Lorentz
                 transformation \\
                 Central potential \\
                 Free spherical waves \\
                 The hydrogen atom \\
                 Non-Relativistic Limit of the Dirac Equation \\
                 Large and small components \\
                 The Pauli theory as the non-relativistic limit of the
                 Dirac theory \\
                 Application: hyperfine structure and dipole--dipole
                 coupling \\
                 Higher-order corrections and the Foldy--Wouthuysen
                 transformation \\
                 FW transformation for a free particle \\
                 FW transformation for a particle in a field \\
                 Electron in a central electrostatic potential \\
                 Discussions and conclusions \\
                 Negative Energy Solutions and Positron Theory \\
                 Properties of charge conjugate solutions \\
                 Abnormal behavior of the negative energy solutions \\
                 Reinterpretation of the negative energy states \\
                 Theory of `holes' and positrons \\
                 Difficulties with the `hole' theory \\
                 Field Quantization \\
                 Radiation Theory \\
                 Introduction \\
                 Quantization of a Real Scalar Field \\
                 Classical free field \\
                 Normal vibrations \\
                 Quantization of the free field \\
                 Lagrangian of the field \\
                 Momentum conjugate to [Phi](r) \\
                 Complex basis functions \\
                 Plane waves \\
                 Definition of the momentum \\
                 Spherical waves \\
                 Definition of the angular momentum \\
                 Space and time reflections \\
                 Coupling With an Atomic System / 919 p. 933 p. 949 p.
                 959 p. 960 / 979 \\
                 Coupling to a system of particles \\
                 Weak coupling and perturbation treatment \\
                 Level shifts \\
                 Emission of a corpuscle \\
                 Quantum theory of decaying states \\
                 Line width \\
                 Elastic scattering \\
                 Dispersion formula \\
                 Resonance scattering \\
                 Formation of a metastable state \\
                 Absorption of a corpuscle (photo-electric effect) \\
                 Radiative capture \\
                 Classical Theory of Electromagnetic Radiation / 1009
                 \\
                 The equations of the classical Maxwell--Lorentz theory
                 \\
                 Symmetries and conservation laws of the classical
                 theory \\
                 Self-energy and classical radius of the electron \\
                 Electromagnetic potential \\
                 Choice of the gauge \\
                 Longitudinal and transverse parts of a vector field \\
                 Elimination of the lopgitudinal field \\
                 Energy, momentum, angular momentum \\
                 Hamiltonian for free radiation \\
                 Hamiltonian for radiation coupled to a set of particles
                 \\
                 Quantum Theory of Radiation / 1029 \\
                 Quantization of free radiation \\
                 Photons \\
                 Plane waves \\
                 Radiation momentum \\
                 Polarization \\
                 Multipole expansion \\
                 Photons of determined angular momentum and parity \\
                 Coupling with an atomic system \\
                 Emission of a photon by an atom \\
                 Dipole emission \\
                 Low energy Compton scattering \\
                 The Thomson formula \\
                 Vector Addition Coefficients and Rotation Matrices /
                 1053 \\
                 Elements of Group Theory / 1079 \\
                 General Index / 1125",
}

@Book{Metcalf:1982:FO,
  author =       "Michael Metcalf",
  title =        "{Fortran} Optimization",
  volume =       "17",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "xii + 242",
  year =         "1982",
  ISBN =         "0-12-492480-8",
  ISBN-13 =      "978-0-12-492480-2",
  LCCN =         "QA76.73.F25 M48 1982",
  bibdate =      "Wed Dec 15 10:39:08 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "{A. P. I. C.} Studies in Data Processing",
  acknowledgement = ack-nhfb,
}

@Book{Metcalf:1990:FE,
  author =       "Michael Metcalf and John Ker Reid",
  title =        "{Fortran 90} Explained",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  pages =        "xiv + 294",
  year =         "1990",
  ISBN =         "0-19-853772-7 (paperback)",
  ISBN-13 =      "978-0-19-853772-4 (paperback)",
  LCCN =         "QA76.73.F28 M48 1990",
  bibdate =      "Sun May 02 07:52:28 1999",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
                 https://www.math.utah.edu/pub/tex/bib/fortran3.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See \cite{ANSI:ftn92}.",
  price =        "US\$22.45",
  abstract =     "The success of Fortran as the predominant programming
                 language in the field of scientific and numerical
                 computing is due, in part, to the steady evolution of
                 the language. Following the publication of the first
                 two standards of 1966 and 1978, the technical committee
                 responsible for their development, X3J3, has worked in
                 conjunction with an ISO committee to develop a new
                 standard suitable for use in the 1990s. This new
                 standard, Fortran 90, contains the new features
                 required for large scale computing on modern
                 supercomputers, but still retains all the familiar
                 features that have made the language so popular. This
                 book is a complete and thorough description of the new
                 language, providing a comprehensive guide to all its
                 features. Its authors are both members of X3J3 and have
                 many years of experience in the use of Fortran. The
                 book is intended for new and existing Fortran users,
                 and for all those involved in any aspect of scientific
                 and numerical computing.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  tableofcontents = "1: Whither Fortran? \\
                 2: Language Elements \\
                 3: Expressions and Assignments \\
                 4: Control Statements \\
                 5: Program Units and Procedures \\
                 6: Array Features \\
                 7: Specification Statements \\
                 8: Intrinsic Procedures \\
                 9: Data Transfer \\
                 10: Operations on External Files \\
                 11: Deprecated Features",
}

@Book{Metcalf:F8E87,
  author =       "Michael Metcalf and John Reid",
  title =        "{Fortran 8x} Explained",
  publisher =    pub-CLARENDON,
  address =      pub-CLARENDON:adr,
  pages =        "xiv + 262",
  year =         "1987",
  ISBN =         "0-19-853751-4 (hardcover), 0-19-853731-X (paperback)",
  ISBN-13 =      "978-0-19-853751-9 (hardcover), 978-0-19-853731-1
                 (paperback)",
  LCCN =         "QA76.73.F26 M48 1987",
  bibdate =      "Sun May 02 07:52:19 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See also \cite{ANSI:ftn8x,ANSI:ftn9x}.",
  acknowledgement = ack-nhfb,
}

@Book{Metropolis:1986:FS,
  author =       "N. Metropolis and D. H. Sharp and W. J. Worlton and K.
                 R. Ames",
  title =        "Frontiers of Supercomputing",
  publisher =    pub-U-CALIFORNIA-PRESS,
  address =      pub-U-CALIFORNIA-PRESS:adr,
  pages =        "xxiv + 388",
  year =         "1986",
  ISBN =         "0-520-05190-4",
  ISBN-13 =      "978-0-520-05190-4",
  LCCN =         "QA76.5 .F76 1983",
  bibdate =      "Wed Dec 15 10:39:09 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Miano:1999:CIF,
  author =       "John Miano",
  title =        "The Programmer's Guide to Compressed Image Files:
                 {JPEG}, {PNG}, {GIF}, {XBM}, {BMP}",
  publisher =    pub-AW-LONGMAN,
  address =      pub-AW-LONGMAN:adr,
  pages =        "xi + 264",
  year =         "1999",
  ISBN =         "0-201-60443-4 (paperback), 0-201-61657-2 (CD-ROM)",
  ISBN-13 =      "978-0-201-60443-6 (paperback), 978-0-201-61657-6
                 (CD-ROM)",
  LCCN =         "TA1637.M53 1999",
  bibdate =      "Tue Jun 06 09:20:42 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$44.95",
  series =       "SIGGRAPH series",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Image processing; Computer programs; Data compression
                 (Computer science); Computer programming; File
                 organization (Computer science)",
  tableofcontents = "Windows BMP \\
                 XBM \\
                 Introduction to JPEG \\
                 JPEG File Format \\
                 JPEG Human Coding \\
                 The Discrete Cosine Transform \\
                 Decoding Sequential-Mode JPEG Images \\
                 Creating Sequential JPEG Files \\
                 Optimizing the DCT \\
                 Progressive JPEG \\
                 GIF \\
                 PNG \\
                 Decompressing PNG Image Data \\
                 Creating PNG Files",
  xxtitle =      "Compressed image file formats: {JPEG}, {PNG}, {GIF},
                 {XBM}, {BMP}",
}

@Book{Michelin:1989:MAG,
  author =       "{Michelin}",
  title =        "{Michelin Allemagne Germany (Michelin Maps)}",
  publisher =    "Michelin Travel Publications",
  address =      "Paris, France",
  pages =        "1",
  year =         "1989",
  ISBN =         "2-06-700984-2",
  ISBN-13 =      "978-2-06-700984-4",
  LCCN =         "G6081.P2 1989 .P6",
  bibdate =      "Sat Dec 24 15:53:15 MST 2005",
  bibsource =    "Amazon;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  bookformat =   "Map",
  category =     "Nonfiction; Foreign Language Nonfiction; German",
  idnumber =     "550",
  keywords =     "Roads --- Germany --- Maps",
}

@Book{Michelin:2005:MET,
  author =       "{Michelin}",
  title =        "{Michelin Europe} Tourist \& Motoring Atlas",
  publisher =    "Michelin Travel Publications",
  address =      "Paris, France",
  pages =        "228",
  year =         "2005",
  ISBN =         "2-06-711224-4 (paperback)",
  ISBN-13 =      "978-2-06-711224-7 (paperback)",
  LCCN =         "G1797.21.P2 E876 2005",
  bibdate =      "Sat Dec 24 15:53:15 MST 2005",
  bibsource =    "Amazon;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Atlas Seriews",
  acknowledgement = ack-nhfb,
  bookformat =   "Spiral-bound",
  category =     "Reference; Atlases \& Maps; World",
  idnumber =     "552",
}

@Book{Microsoft:2012:MMS,
  author =       "{Microsoft}",
  title =        "{Microsoft} Manual of Style: Your Everyday Guide to
                 Usage, Terminology, and Style for Professional
                 Technical Communications",
  publisher =    pub-MICROSOFT,
  address =      pub-MICROSOFT:adr,
  edition =      "Fourth",
  pages =        "xxiv + 438",
  year =         "2012",
  ISBN =         "0-7356-4871-9 (paperback)",
  ISBN-13 =      "978-0-7356-4871-5 (paperback)",
  LCCN =         "T11 .M467 2012",
  bibdate =      "Fri Apr 13 10:13:22 MDT 2012",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "technical writing",
  tableofcontents = "Foreword \\
                 Introduction to the Fourth Edition \\
                 Part 1: General Topics \\
                 1: Microsoft style and voice \\
                 Principles of Microsoft style \\
                 Bias-free communication \\
                 Anthropomorphism \\
                 Parallelism \\
                 2: Content for the web \\
                 Make the right content choices \\
                 Text for the web \\
                 Video content for the web \\
                 Blogs \\
                 Community-provided content \\
                 Evaluate your content \\
                 Help users find your content \\
                 International considerations for web content \\
                 Accessibility considerations for web content \\
                 Legal considerations for web content \\
                 3: Content for a worldwide audience \\
                 Global English syntax \\
                 Machine translation syntax \\
                 Terminology and word choice \\
                 Technical terms \\
                 Jargon \\
                 Latin and other non-English words \\
                 Global art \\
                 Examples and scenarios \\
                 International currency \\
                 Time and place \\
                 Names and contact information \\
                 Fonts \\
                 Web, software, and HTML issues \\
                 Legal issues with worldwide content \\
                 Additional globalization resources \\
                 4: Accessible content \\
                 Accessibility guidelines and requirements \\
                 Accessible webpages \\
                 Accessible writing \\
                 Accessible graphics and design \\
                 Acceptable terminology \\
                 5: The user interface \\
                 Windows user interface \\
                 Windows Phone user interface \\
                 User interface elements \\
                 Ribbons, menus, and toolbars \\
                 Webpage controls, dialog boxes, and property sheets \\
                 Backstage view \\
                 Control Panel \\
                 Messages \\
                 Other user interface elements \\
                 Modes of interaction \\
                 Mouse terminology \\
                 Key names \\
                 Content for multiple platforms \\
                 User interface text \\
                 User interface formatting \\
                 6: Procedures and technical content \\
                 Procedures \\
                 Document conventions \\
                 Cloud computing style \\
                 Reference documentation \\
                 Code examples \\
                 Security \\
                 Command syntax \\
                 File names and extensions \\
                 Version identifiers \\
                 Out-of-band release terminology \\
                 Protocols \\
                 XML tag, element, and attribute formatting \\
                 HTML tag, element, and attribute formatting \\
                 Readme files and release notes \\
                 7: Practical issues of style \\
                 Capitalization \\
                 Titles and headings \\
                 Microsoft in product and service names \\
                 Lists \\
                 Tables \\
                 Cross-references \\
                 Notes and tips \\
                 Numbers \\
                 Dates \\
                 Phone numbers \\
                 Time zones \\
                 Measurements and units of measure \\
                 URLs, addresses \\
                 Names of special characters \\
                 Art, captions, and callouts \\
                 Bibliographies and citations \\
                 Page layout \\
                 8: Grammar \\
                 Verbs and verb forms \\
                 Agreement \\
                 Voice \\
                 Mood \\
                 Nouns \\
                 Words ending in -ing \\
                 Prepositions \\
                 Prefixes \\
                 Dangling and misplaced modifiers \\
                 9: Punctuation \\
                 Periods \\
                 Commas \\
                 Apostrophes \\
                 Colons \\
                 Semicolons \\
                 Quotation marks \\
                 Parentheses \\
                 Hyphens, hyphenation \\
                 Dashes \\
                 Ellipses \\
                 Slash mark \\
                 Formatting punctuation \\
                 10: Indexes and keywords \\
                 Indexes \\
                 Keywords and online index entries \\
                 11: Acronyms and other abbreviations \\
                 How to use acronyms and other abbreviations \\
                 Table of acronyms and other abbreviations \\
                 How to use abbreviations of measurements \\
                 Table of abbreviations of measurements \\
                 Process for adopting new acronyms or abbreviations",
}

@Book{Midtdal:1968:SSPa,
  editor =       "John Midtdal and Knut Thalberg and Harald Wergeland",
  title =        "Selected Scientific Papers of {Egil A. Hylleraas}",
  volume =       "1",
  publisher =    "NTH-Trykk",
  address =      "Trondheim, Norway",
  pages =        "viii + 445",
  year =         "1968",
  LCCN =         "Q143.H98 A25 1968",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Midtdal:1968:SSPb,
  editor =       "John Midtdal and Knut Thalberg and Harald Wergeland",
  title =        "Selected Scientific Papers of {Egil A. Hylleraas}",
  volume =       "2",
  publisher =    "NTH-Trykk",
  address =      "Trondheim, Norway",
  pages =        "526",
  year =         "1968",
  LCCN =         "Q143.H98 A25 1968",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Milenkovic:1987:OS,
  author =       "Milan Milenkovi{\'c}",
  title =        "Operating Systems",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "xix + 568",
  year =         "1987",
  ISBN =         "0-07-041920-5",
  ISBN-13 =      "978-0-07-041920-9",
  LCCN =         "QA76.76.O63 M53 1987",
  bibdate =      "Wed Dec 15 10:39:10 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$38.95",
  acknowledgement = ack-nhfb,
}

@Book{Miller:1984:ENS,
  author =       "Webb Miller",
  title =        "The Engineering of Numerical Software",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "viii + 167",
  year =         "1984",
  ISBN =         "0-13-279043-2",
  ISBN-13 =      "978-0-13-279043-7",
  LCCN =         "QA297.M527 1984",
  bibdate =      "Wed Dec 15 10:39:11 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,
  subject =      "Numerical analysis; Computer programs; Computer
                 programs; Matematica Da Computa{\c{c}}ao; Analise
                 Numerica; Programa{\c{c}}ao Matematica;
                 Programmierung",
  tableofcontents = "Introduction \\
                 Floating-point arithmetic \\
                 Computation of the sine function \\
                 Linear equations \\
                 Solving a nonlinear equation \\
                 Integration",
}

@Book{Miller:1990:OLU,
  author =       "John David Miller",
  title =        "An {OPEN LOOK} at {UNIX}",
  publisher =    pub-MT,
  address =      pub-MT:adr,
  pages =        "482",
  year =         "1990",
  ISBN =         "1-55851-057-5",
  ISBN-13 =      "978-1-55851-057-9",
  LCCN =         "QA76.76.U84 M55 1990",
  bibdate =      "Wed Dec 15 10:39:11 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Miller:1992:TTI,
  author =       "Mark A. Miller",
  title =        "Troubleshooting {TCP\slash IP}: Analyzing the
                 Protocols of the {Internet}",
  publisher =    pub-MT,
  address =      pub-MT:adr,
  pages =        "588",
  year =         "1992",
  ISBN =         "1-55851-268-3, 3-88229-025-0, 0-13-953167-X",
  ISBN-13 =      "978-1-55851-268-9, 978-3-88229-025-7,
                 978-0-13-953167-5",
  LCCN =         "TK5105.5 .M52 1992",
  bibdate =      "Wed Dec 15 11:07:37 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/internet.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$44.95",
  acknowledgement = ack-nhfb,
  tableofcontents = "Why This Book Is For You / 1 \\
                 Using TCP/IP and the Internet Protocols / 3 \\
                 Supporting TCP/IP and the Internet Protocols / 21 \\
                 Troubleshooting the Network Interface Connection / 57
                 \\
                 Troubleshooting the Internetwork Connection / 121 \\
                 Troubleshooting the Host-to-Host Connection / 205 \\
                 Troubleshooting the Process/Application Connection /
                 275 \\
                 Managing the Internet / 365 \\
                 Migrating TCP/IP Internets to OSI / 409 \\
                 Appendix A: Addresses of Standards Organizations / 423
                 \\
                 Appendix B: Acronyms / 425 \\
                 Appendix C: Selected Manufacturers of TCP/IP-Related
                 Internetworking Products / 437 \\
                 Appendix D: Obtaining Internet Information / 465 \\
                 Appendix E: Ethernet Protocol Types / 471 \\
                 Appendix F: Link Service Access Point (SAP) Addresses /
                 477 \\
                 Appendix G: Internet Parameters / 479 \\
                 Appendix H: RFC Index / 521 \\
                 Trademarks / 575 \\
                 Index / 579",
}

@Book{Miller:2000:ASP,
  author =       "Russ Miller and Laurence Boxer",
  title =        "Algorithms Sequential and Parallel: a Unified
                 Approach",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xii + 330",
  year =         "2000",
  ISBN =         "0-13-086373-4",
  ISBN-13 =      "978-0-13-086373-7",
  LCCN =         "QA76.9.A43 M55 2000",
  bibdate =      "Fri Jul 07 07:07:41 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://www.prenhall.com/books/esm_0130863734.html",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  tableofcontents = "1. Asymptotic Analysis / 2 \\
                 Notation and Terminology / 4 \\
                 Asymptotic Notation / 6 \\
                 Asymptotic Relationships / 9 \\
                 Asymptotic Analysis and Limits / 9 \\
                 Summations and Integrals / 12 \\
                 Rules for Analysis of Algorithms / 17 \\
                 Binsort / 21 \\
                 Limitations of Asymptotic Analysis / 22 \\
                 Mathematical Induction / 30 \\
                 Induction Examples / 31 \\
                 Recursion / 33 \\
                 Binary Search / 35 \\
                 Merging and Mergesort / 39 \\
                 3. Master Method / 48 \\
                 Proof of the Master Theorem (Optional) / 51 \\
                 4. Combinational Circuits / 62 \\
                 5. Models Of Computation / 74 \\
                 Examples: Simple Algorithms / 81 \\
                 Fundamental Terminology / 88 \\
                 Interconnection Networks / 89 \\
                 Processor Organizations / 90 \\
                 Additional Terminology / 113 \\
                 6. Matrix Operations / 120 \\
                 Matrix Multiplication / 122 \\
                 Gaussian Elimination / 127 \\
                 7. Parallel Prefix / 134 \\
                 Application: Maximum Sum Subsequence / 143 \\
                 Array Packing / 146 \\
                 Interval (Segment) Broadcasting / 148 \\
                 (Simple) Point Domination Query / 150 \\
                 Computing Overlapping Line Segments / 151 \\
                 8. Pointer Jumping / 156 \\
                 List Ranking / 158 \\
                 Linked List Parallel Prefix / 160 \\
                 9. Divide-And-Conquer / 164 \\
                 MergeSort (Revisited) / 166 \\
                 Selection / 165 \\
                 QuickSort (Partition Sort) / 174 \\
                 HyperQuickSort / 188 \\
                 Bitonic Sort (Revisited) / 189 \\
                 Concurrent Read/Write / 194 \\
                 10. Computational Geometry / 200 \\
                 Convex Hull / 201 \\
                 Graham's Scan / 203 \\
                 Divide-and-Conquer Solution / 208 \\
                 Smallest Enclosing Box / 216 \\
                 All-Nearest Neighbor Problem / 218 \\
                 Architecture-Independent Algorithm Development / 219
                 \\
                 Line Intersection Problems / 220 \\
                 Overlapping Line Segments / 221 \\
                 11. Image Processing / 230 \\
                 Preliminaries / 231 \\
                 Component Labeling / 233 \\
                 Convex Hull / 237 \\
                 Distance Problems / 239 \\
                 Hausdorff-Metric for Digital Images / 244 \\
                 12. Graph Algorithms / 250 \\
                 Terminology / 253 \\
                 Representations / 256 \\
                 Fundamental Algorithms / 258 \\
                 Connected Component Labeling / 273 \\
                 Minimum-Cost Spanning Trees / 277 \\
                 Shortest-Path Problems / 284 \\
                 13. Numerical Problems / 294 \\
                 Primality / 296 \\
                 Greatest Common Divisor / 298 \\
                 Integral Powers / 299 \\
                 Evaluating a Polynomial / 301 \\
                 Approximation by Taylor Series / 302 \\
                 Trapezoidal Integration / 305",
}

@Book{Miller:2010:JPP,
  author =       "Arthur I. Miller",
  title =        "137: {Jung}, {Pauli}, and the Pursuit of a Scientific
                 Obsession",
  publisher =    pub-NORTON,
  address =      pub-NORTON:adr,
  pages =        "xxiii + 336",
  year =         "2010",
  ISBN =         "0-393-33864-9",
  ISBN-13 =      "978-0-393-33864-5",
  LCCN =         "QC16.P37 M55 2010",
  bibdate =      "Wed Jul 28 17:24:04 MDT 2010",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/h/heisenberg-werner.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/p/pauli-wolfgang.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "The question of whether there is a number at the root
                 of the universe, a primal number that everything in the
                 world hinges on, has exercised many great minds of the
                 twentieth century, among them the groundbreaking
                 physicist Wolfgang Pauli and the famous psychoanalyst
                 Carl Jung. Their obsession with the power of certain
                 numbers --- including 137, which describes the atom's
                 fine-structure constant and has great Kabalistic
                 significance --- led them to develop an unlikely
                 friendship and to embark on a joint mystical quest
                 reaching deep into medieval alchemy, dream
                 interpretation and the Chinese Book of Changes. ``137''
                 explores the profound intersection of modern science
                 with the occult but above all it is the tale of an
                 extraordinary, fruitful friendship between two of the
                 greatest thinkers of our times.",
  acknowledgement = ack-nhfb,
  subject =      "Pauli, Wolfgang; Jung, C. G; (Carl Gustav);
                 numerology; symbolism of numbers; physics; philosophy",
  subject-dates = "Wolfgang Pauli (1900--1958); Carl Jung (1875--1961)",
  tableofcontents = "Acknowledgments / ix \\
                 Prologue / xv \\
                 1: Dangerously Famous / 3 \\
                 2: Early Successes, Early Failures / 18 \\
                 3: The Philosopher's Stone / 44 \\
                 4: Dr. Jekyll and Mr. Hyde / 51 \\
                 5: Intermezzo --- Three versus Four: Alchemy,
                 Mysticism, and the Dawn of Modern Science / 64 \\
                 6: Pauli, Heisenberg, and the Great Quantum
                 Breakthrough / 89 \\
                 7: Mephistopheles / 107 \\
                 8: The Dark Hunting Ground of the Mind / 124 \\
                 9: Mandalas / 138 \\
                 10: The Superior Man Sets His Life in Order / 158 \\
                 11: Synchronicity / 183 \\
                 12: Dreams of Primal Numbers / 208 \\
                 13: Second Intermezzo --- Road to Yesterday / 227 \\
                 14: Through the Looking Glass / 233 \\
                 15: The Mysterious Number 137 / 247 \\
                 Epilogue: The Legacy of Pauli and Jung / 273 \\
                 Notes / 277 \\
                 Bibliography / 311 \\
                 Illustration Credits / 321 \\
                 Index / 325",
}

@Book{Miller:2015:BLT,
  editor =       "Steven J. Miller",
  title =        "{Benford's Law}: theory and applications",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "xxvi + 438",
  year =         "2015",
  ISBN =         "0-691-14761-2 (hardcover), 1-4008-6659-6 (e-book)",
  ISBN-13 =      "978-0-691-14761-1 (hardcover), 978-1-4008-6659-5
                 (e-book)",
  LCCN =         "QA273.6 .B46 2015",
  bibdate =      "Tue Nov 17 09:41:52 MST 2015",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/statpapers.bib",
  URL =          "http://press.princeton.edu/titles/10527.html",
  acknowledgement = ack-nhfb,
  subject =      "Distribution (Probability theory); Probability
                 measures; MATHEMATICS / Applied; MATHEMATICS /
                 Probability and Statistics / General; Distribution
                 (Probability theory); Probability measures.",
  tableofcontents = "Foreword / xiii \\
                 Preface / xvii \\
                 Notation / xxiii \\
                 Part I. General Theory I: Basis of Benford's Law / 1
                 \\
                 Chapter 1. A Quick Introduction to Benford's Law / 3
                 \\
                 Chapter 2. A Short Introduction to the Mathematical
                 Theory of Benford's Law / 23 \\
                 Chapter 3. Fourier Analysis and Benford's Law / 68 \\
                 Part II. General Theory II: Distributions and Rates of
                 Convergence / 107 \\
                 Chapter 4. Benford's Law Geometry / 109 \\
                 Chapter 5. Explicit Error Bounds via Total Variation /
                 119 \\
                 Chapter 6. L{\'e}vy Processes and Benford's Law / 135
                 \\
                 Part III. Applications I: Accounting and Vote Fraud /
                 175 \\
                 Chapter 7. Benford's Law as a Bridge between Statistics
                 and Accounting / 177 \\
                 Chapter 8. Detecting Fraud and Errors Using Benford's
                 Law / 191 \\
                 Chapter 9. Can Vote Counts Digits and Benford's Law
                 Diagnose Elections? Chapter 10. Complementing Benford's
                 Law for Small N: A Local Bootstrap Bootstrap Model /
                 227 \\
                 Part IV. Applications II: Economics / 233 \\
                 Chapter 11. Measuring the Quality of European
                 Statistics / 235 \\
                 Chapter 12. Benford's Law and Fraud in Economic
                 Research / 244 \\
                 Chapter 13. Testing for Strategic Manipulation of
                 Economic and Financial Data / 257 \\
                 Part V. Applications III: Sciences / 265 \\
                 Chapter 14. Psychology and Benford's Law / 267 \\
                 Chapter 15. Managing Risk in Numbers Games: Benford's
                 Law and the Small-Number Phenomenon / 276 \\
                 Chapter 16. Benford's Law in the Natural Sciences / 290
                 \\
                 Chapter 17. Generalizing Benford's Law: A Reexamination
                 of Falsified Clinical Data / 304 \\
                 Part VI. Applications IV: Images / 317 \\
                 Chapter 18. Partial Volume Modeling of Medical Imaging
                 Systems Using the Benford Distribution / 319 \\
                 Chapter 19. Application of Benford's Law to Images /
                 338 \\
                 Part VII. Exercises / 371 \\
                 Chapter 20. Exercises / 373 \\
                 Phenomenon / 399 \\
                 Distribution / 401 \\
                 Bibliography / 402 \\
                 Index / 433",
}

@Book{Milner:2016:PHG,
  author =       "Greg Milner",
  title =        "Pinpoint: how {GPS} is changing technology, culture,
                 and our minds",
  publisher =    pub-NORTON,
  address =      pub-NORTON:adr,
  pages =        "xx + 316",
  year =         "2016",
  ISBN =         "0-393-08912-6 (hardcover)",
  ISBN-13 =      "978-0-393-08912-7 (hardcover)",
  LCCN =         "G109.5 .M55 2016",
  bibdate =      "Thu Sep 22 08:39:38 MDT 2016",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "\booktitle{Pinpoint} tells the story of GPS, a
                 scientific marvel that enables almost all modern
                 technology --- but is changing us in profound ways.
                 Your Global Positioning System guides you across town;
                 it also helps land planes, and anticipates earthquakes.
                 Milner takes us on a fascinating tour of a hidden
                 system that touches almost every aspect of our modern
                 life, and shows how it has created new forms of human
                 behavior. But the potential misuse of GPS data by
                 government and corporations raise disturbing questions
                 about ethics and privacy. GPS satisfies the scientific
                 urge toward precision --- but may be altering the very
                 nature of human cognition.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Global Positioning System; Social aspects; Global
                 positioning system; Technische Innovation;
                 Wirtschaftssoziologie",
  tableofcontents = "Introduction: The whisper from space \\
                 Part I: Calculating Route \\
                 1. Tupaia goes home \\
                 2. The when and the where \\
                 3. Global reach, global power \\
                 4. Ranging the perfect beet \\
                 Part II: You Have Arrived \\
                 5. Death by GPS \\
                 6. The hornet's nest \\
                 7. Better living through tracking \\
                 8. Return from mid-ice \\
                 9. Tied together (40.74375 N 73.9835 W) \\
                 Epilogue: Direction home \\
                 Notes \\
                 Acknowledgments \\
                 Index",
}

@Book{Mitchell:2011:CGT,
  author =       "Melanie Mitchell",
  title =        "Complexity: a Guided Tour",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  pages =        "xvi + 349",
  year =         "2011",
  ISBN =         "0-19-979810-9 (paperback)",
  ISBN-13 =      "978-0-19-979810-0 (paperback)",
  LCCN =         "Q175.32 C65 M58 2011",
  bibdate =      "Wed Dec 7 07:33:58 MST 2011",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  remark =       "Originally published: 2009.",
  tableofcontents = "Part One: Background and History \\
                 One: What Is Complexity? \\
                 Two: Dynamics, Chaos, and Prediction \\
                 Three: Information \\
                 Four: Computation \\
                 Five: Evolution \\
                 Six: Genetics, Simplified \\
                 Seven: Defining and Measuring Complexity \\
                 Part Two: Life and Evolution in Computers \\
                 Eight: Self-Reproducing Computer Programs \\
                 Nine: Genetic Algorithms \\
                 Part Three: Computation Writ Large \\
                 Ten: Cellular Automata, Life, and the Universe \\
                 Eleven: Computing with Particles \\
                 Twelve: Information Processing in Living Systems \\
                 Thirteen: How to Make Analogies (if You Are a Computer)
                 \\
                 Fourteen: Prospects of Computer Modeling \\
                 Part Four: Network Thinking \\
                 Fifteen: The Science of Networks \\
                 Sixteen: Applying Network Science to Real-World
                 Networks \\
                 Seventeen: The Mystery of Scaling \\
                 Eighteen: Evolution, Complexified \\
                 Part Five: Conclusion \\
                 Nineteen: The Past and Future of the Sciences of
                 Complexity",
}

@Book{Mitchell:2018:SME,
  author =       "Alanna Mitchell",
  title =        "The Spinning Magnet: the Electromagnetic Force That
                 Created the Modern World --- and Could Destroy It",
  publisher =    "Dutton",
  address =      "New York, NY, USa",
  pages =        "ix + 323",
  year =         "2018",
  ISBN =         "1-101-98516-X (hardcover), 1-101-98518-6 (e-book)",
  ISBN-13 =      "978-1-101-98516-8 (hardcover), 978-1-101-98518-2
                 (e-book)",
  LCCN =         "QC760 .M5425 2018",
  bibdate =      "Sat Dec 22 16:20:35 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "A cataclysmic planetary phenomenon is gathering force
                 deep within the Earth. The magnetic North Pole will
                 eventually trade places with the South Pole. Satellite
                 evidence suggests to some scientists that the move has
                 already begun, but most still think it won't happen for
                 many decades. All agree that it has happened many times
                 before and will happen again. But this time it will be
                 different. It will be a very bad day for modern
                 civilization.",
  acknowledgement = ack-nhfb,
  subject =      "Electromagnetism; Magnetic fields; Geomagnetism; Solar
                 radiation; Health aspects; Science; Physics; History;
                 Earth Sciences; Geology; Mantle of the Earth; Earth
                 (planet); Mantle",
  tableofcontents = "Preface: Playing with the universe / 1 \\
                 Part I. Magnet \\
                 1: The beginnings of things / 11 \\
                 2: The unpaired spinning electron / 17 \\
                 3: Parking in the shadow of magnetism's forgotten man /
                 27 \\
                 4: Into whose embrace iron leaps / 35 \\
                 5: Revolutions on paper / 47 \\
                 6: The Earth's magnetic soul / 53 \\
                 7: Voyage into the underworld / 63 \\
                 8: The greatest scientific undertaking the world had
                 ever seen / 71 \\
                 9: The rock that turned the world upside down / 85 \\
                 Part II. Current \\
                 10: Experiment in Copenhagen / 95 \\
                 11: A very intimate relationship / 101 \\
                 12: Jars full of lightning / 107 \\
                 13: The apothecary's son / 117 \\
                 14: The bookbinder's apprentice / 133 \\
                 15: Magnets making currents / 139 \\
                 16: The lines that fill the air / 147 \\
                 Part III. Core \\
                 17: The contorting gyre / 155 \\
                 18: Shocks inside the Earth / 165 \\
                 19: Pharaohs, fairies, and a tar-paper shack / 175 \\
                 20: Zebra skins under the sea / 185 \\
                 21: At the outer edge of the dynamo / 195 \\
                 22: Anomaly to the South / 203 \\
                 23: The worst physics movie ever / 213 \\
                 24: The great hazardous spinning sphere of sodium / 221
                 \\
                 Part IV. Switch \\
                 25: Looking up / 231 \\
                 26: Horrors the lights foretold / 239 \\
                 27: Lethal patches / 249 \\
                 28: The cost of catastrophe / 257 \\
                 29: Trout noses and pigeon beaks / 263 \\
                 30: A suit of stiff black crayon / 269 \\
                 Notes / 279 \\
                 Selected Bibliography / 301 \\
                 Acknowledgments / 307 \\
                 Index / 311",
}

@Book{Mitchell:32B86,
  author =       "H. J. Mitchell",
  title =        "32-Bit Microprocessors",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "248",
  year =         "1986",
  ISBN =         "0-07-042585-X",
  ISBN-13 =      "978-0-07-042585-9",
  LCCN =         "QA76.5 .A135 1986",
  bibdate =      "Wed Dec 15 10:39:13 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$39.95",
  acknowledgement = ack-nhfb,
}

@Book{Mithen:2006:SNO,
  author =       "Steven J. Mithen",
  title =        "The singing {Neanderthals}: the origins of music,
                 language, mind, and body",
  publisher =    pub-HARVARD,
  address =      pub-HARVARD:adr,
  pages =        "ix + 374",
  year =         "2006",
  ISBN =         "0-674-02192-4",
  ISBN-13 =      "978-0-674-02192-1",
  LCCN =         "ML3800 .M73 2006",
  bibdate =      "Thu May 25 12:24:26 MDT 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/toc/ecip062/2005030187.html",
  acknowledgement = ack-nhfb,
  subject =      "Music; Origin; Psychological aspects; Human
                 evolution",
  tableofcontents = "The need for an evolutionary history of music \\
                 The present. More than cheesecake?: the similarities
                 and differences between music and language \\
                 Music without language: the brain, aphasia, and musical
                 savants \\
                 Language without music: acquired and congenital amusia
                 \\
                 The modularity of music and language: music processing
                 within the brain \\
                 Talking and singing to baby: brain maturation, language
                 learning, and perfect pitch \\
                 Music hath charms and can heal: music, emotion,
                 medicine, and intelligence \\
                 The past. Grunts, barks and gestures: communication by
                 monkeys and apes \\
                 Songs on the savannah: the origin of `hmmmm'
                 communication \\
                 Getting into rhythm: the evolution of bipedalism and
                 dance \\
                 Imitating nature: communication about the natural world
                 \\
                 Singing for sex: is music a product of sexual
                 selection? \\
                 The demands of parenthood: human life history and
                 emotional development \\
                 Making music together: the significance of cooperation
                 and social bonding \\
                 Neanderthals in love: `hmmmmm' communication by homo
                 neanderthalensis \\
                 The origin of language: the origin of homo sapiens and
                 the segmentation of `hmmmmm' \\
                 A mystery explained, but not diminished: modern human
                 dispersal, communicating with the Gods, and the
                 remnants of `hmmmmm'.",
}

@Book{Mittelbach:2004:LC,
  author =       "Frank Mittelbach and Michel Goossens and Johannes
                 Braams and David Carlisle and Chris Rowley and
                 Christine Detig and Joachim Schrod",
  title =        "The {\LaTeX} Companion",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Second",
  pages =        "xxvii + 1090",
  year =         "2004",
  ISBN =         "0-201-36299-6 (paperback), 0-321-51443-2 (hardcover)",
  ISBN-13 =      "978-0-201-36299-2 (paperback), 978-0-321-51443-1
                 (hardcover)",
  LCCN =         "Z253.4.L38 G66 2004",
  bibdate =      "Thu May 20 13:23:24 2004",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  price =        "US\$59.99, CAN\$86.99",
  series =       "Tools and Techniques for Computer Typesetting",
  abstract =     "Written by the core LaTeX developers and maintainers,
                 this essential reference contains more than 900
                 self-contained ready-to-run examples that can
                 immediately be reused by readers.",
  acknowledgement = ack-nhfb,
  remark =       "Authors listed as: Frank Mittelbach and Michel
                 Goossens with Johannes Braams, David Carlisle, and
                 Chris Rowley, and with contributions by Christine Detig
                 and Joachim Schrod.",
  tableofcontents = "1: Introduction \\
                 2: structure of a \LaTeX{} document \\
                 3: Basic formatting tools \\
                 4: layout of the page \\
                 5: Tabular material \\
                 6: Mastering floats \\
                 7: Fonts and encodings \\
                 8: Higher mathematics \\
                 9: \LaTeX{} in a multilingual environment \\
                 10: Graphics generation and manipulation \\
                 11: Index generation \\
                 12: Managing citations \\
                 13: Bibliography generation \\
                 14: \LaTeX{} package documentation tools \\
                 A: \LaTeX{} overview for preamble, package, and class
                 writers \\
                 B: Tracing and resolving problems \\
                 C: \LaTeX{} software and user group information \\
                 D: TLC2 \TeX{} CD",
}

@Book{Mittelbach:2023:LCPa,
  author =       "Frank Mittelbach and Ulrike Fischer and Joseph
                 Wright",
  title =        "The {LaTeX} Companion: {Part I}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Third",
  pages =        "xxviii + 947",
  year =         "2023",
  ISBN =         "0-13-465894-9 (Part I) (hardcover), 0-13-465959-7
                 (Part I) (PDF), 0-13-465960-0 (Part I) (e-pub),
                 0-13-816648-0-X (Part I + II)",
  ISBN-13 =      "978-0-13-465894-0 (Part I) (hardcover),
                 978-0-13-465959-6 (Part I) (PDF), 978-0-13-465960-2
                 (Part I) (e-pub), 0-13-816648-0-X (Part I + II)",
  LCCN =         "Z253.4.L38 M58 2023",
  bibdate =      "Wed May 8 07:01:23 MDT 2024",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/font.bib;
                 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",
  series =       "Tools and techniques for computer typesetting",
  abstract =     "\booktitle{The LaTeX Companion, Part I}, Third
                 Edition, is a revision of the long-essential resource
                 for anyone using LaTeX to create high-quality printed
                 documents. This completely updated edition brings you
                 all the latest information about LaTeX and the vast
                 range of add-on packages now available --- over 200 are
                 covered! Full of new tips and tricks for using LaTeX in
                 both traditional and modern typesetting, this book will
                 also show you how to customize layout features to your
                 own needs --- from phrases and paragraphs to headings,
                 lists, and pages.",
  acknowledgement = ack-nhfb,
  remark =       "Previous edition \cite{Mittelbach:2004:LC}.",
  subject =      "LaTeX (Computer file); Computerized typesetting;
                 Composition automatique (Industries graphiques);
                 computerized composition (pre-print process);
                 Computerized typesetting.",
}

@Book{Mittelbach:2023:LCPb,
  author =       "Frank Mittelbach and Ulrike Fischer and Javier Bezos
                 and Johannes Braams and Joseph Wright",
  title =        "The {LaTeX} Companion: {Part II}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Third",
  pages =        "xxxviii + 970",
  year =         "2023",
  ISBN =         "0-201-36300-3 (Part II) (hardcover), 0-13-816657-9
                 (Part II) (PDF), 0-13-816652-8 (Part II) (ePub)",
  ISBN-13 =      "978-0-201-36300-5 (Part II) (hardcover),
                 978-0-13-816657-1 (Part II) (PDF), 978-0-13-816652-6
                 (Part II) (ePub)",
  LCCN =         "Z253.4.L38 M58 2023",
  bibdate =      "Wed May 8 07:01:23 MDT 2024",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/font.bib;
                 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",
  series =       "Tools and techniques for computer typesetting",
  acknowledgement = ack-nhfb,
  remark =       "Previous edition \cite{Mittelbach:2004:LC}.",
  subject =      "LaTeX (Computer file); Computerized typesetting;
                 Composition automatique (Industries graphiques);
                 computerized composition (pre-print process);
                 Computerized typesetting.",
}

@Misc{MKS:awk,
  author =       "{Mortice Kern Systems, Inc.}",
  title =        "{MKSAWK}",
  year =         "1987",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/gnu.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "35 King Street North, Waterloo, Ontario, Canada, Tel:
                 (519) 884-2251. See also \cite{Aho:1988:APL}.",
  acknowledgement = ack-nhfb,
}

@Misc{MKS:yacc,
  author =       "{Mortice Kern Systems, Inc.}",
  title =        "{MKS LEX \& YACC}",
  year =         "1987",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "35 King Street North, Waterloo, Ontario, Canada, Tel:
                 (519) 884-2251.",
  acknowledgement = ack-nhfb,
}

@Book{MLA:2009:MHW,
  author =       "{Modern Language Association}",
  title =        "{MLA} Handbook for Writers of Research Papers",
  publisher =    pub-MLAA,
  address =      pub-MLAA:adr,
  edition =      "Seventh",
  pages =        "xxi + 292",
  year =         "2009",
  ISBN =         "1-60329-024-9 (paperback) 1-60329-025-7 (large
                 print)",
  ISBN-13 =      "978-1-60329-024-1 (paperback) 978-1-60329-025-8 (large
                 print)",
  LCCN =         "LB2369 .G53 2009; LB2369 .M25 2009",
  bibdate =      "Fri Jan 08 15:39:23 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 melvyl.cdlib.org:210/CDL90",
  acknowledgement = ack-nhfb,
  subject =      "report writing; handbooks, manuals, etc; research",
  tableofcontents = "Foreword / Rosemary G. Feal \\
                 Preface / David B. Nicholls \\
                 Note on the Web component \\
                 1. Research and writing \\
                 1.1. The research paper as a form of exploration \\
                 1.2. The research paper as a from of communication \\
                 1.3. Selecting a topic \\
                 1.4. Conducting research \\
                 1.5. Compiling a working bibliography \\
                 1.6. Evaluating sources \\
                 1.7. Taking notes \\
                 1.8. Outlining \\
                 1.9. Writing drafts \\
                 1.10. Language and style \\
                 2. Plagiarism and academic integrity \\
                 2.1. Definition of plagiarism \\
                 2.2. Consequence of plagiarism \\
                 2.3. Information sharing today \\
                 2.4. Unintentional plagiarism \\
                 2.5. Forms of plagiarism \\
                 2.6. When documentation is not needed \\
                 2.7. Related issues \\
                 2.8. Summing up \\
                 3. The mechanics of writing \\
                 3.1. Spelling \\
                 3.2. Punctuation \\
                 3.3. Italics \\
                 3.4. Names of persons \\
                 3.5. Numbers \\
                 3.6. Titles of works in the research paper \\
                 3.7. Quotations \\
                 3.8. Capitalization and personal names in languages \\
                 4. The format of the research paper \\
                 4.1. Margins \\
                 4.2. Text formatting \\
                 4.3. Heading and title \\
                 4.4. Page numbers \\
                 4.5. Tables and illustrations \\
                 4.6. Paper and printing \\
                 4.7. Corrections and insertions \\
                 4.8. Binding \\
                 4.9. Electronic submission \\
                 5. Documentation: preparing the list of works cited \\
                 5.1. Documenting sources \\
                 5.2. MLA style \\
                 5.3. The list of works cited \\
                 5.4. Citing periodical print publications \\
                 5.5. Citing nonperiodical print publications \\
                 5.6. Citing Web publications \\
                 5.7. Citing additional common sources \\
                 5.8. A work in more than one publication medium \\
                 6. Documentation: citing sources in the text \\
                 6.1. Parenthetical documentation and the list of works
                 cited \\
                 6.2. Information required in parenthetical
                 documentation \\
                 6.3. Readability \\
                 6.4. Sample references \\
                 6.5. Using notes with parenthetical documentation \\
                 7. Abbreviations \\
                 7.1. Introduction \\
                 7.2. Time designations \\
                 7.3. Geographic names \\
                 7.4. Common scholarly abbreviations and reference words
                 \\
                 7.5. Publishers' names \\
                 7.6. Symbols and abbreviations used in proofreading and
                 correction \\
                 7.7. Titles of works \\
                 Appendix A. Guides to writing \\
                 A.1. Introduction \\
                 A.2. Dictionaries of usage \\
                 A.3. Guides to nondiscriminatory language \\
                 A.4. Books on style \\
                 Appendix B. Specialized style manuals \\
                 Index",
}

@Book{Mlodinow:2001:EWS,
  author =       "Leonard Mlodinow",
  title =        "{Euclid}'s Window: the Story of Geometry from Parallel
                 Lines to Hyperspace",
  publisher =    "Free Press",
  address =      "New York, NY, USA",
  pages =        "xii + 306",
  year =         "2001",
  ISBN =         "0-684-86523-8, 0-684-86524-6 (paperback),
                 0-7139-9634-X",
  ISBN-13 =      "978-0-684-86523-2, 978-0-684-86524-9 (paperback),
                 978-0-7139-9634-0",
  LCCN =         "QA443.5.M56 2001",
  bibdate =      "Tue Jul 10 16:47:11 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Physicist/writer Mlodinow leads us on a journey
                 through five revolutions in geometry, from the Greek
                 concept of parallel lines to the latest notions of
                 hyperspace. Here is a new alternative history of math
                 revealing how simple questions anyone might ask about
                 space have been the hidden engine of the highest
                 achievements in science and technology. The journey
                 goes from Pythagoras through Gauss and Einstein and
                 into the midst of a new revolution in which scientists
                 are recognizing that all the varied and wondrous forces
                 of nature can be understood through geometry --- a
                 weird new geometry of extra, twisted dimensions, in
                 which space and time, matter and energy, are all
                 intertwined and revealed as consequences of a deep,
                 underlying structure of the universe. This book, a
                 blend of rigorous, authoritative investigation and
                 accessible, good-humored storytelling, makes an
                 original argument asserting the primacy of geometry.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  tableofcontents = "Part 1: The story of Euclid \\
                 The first revolution \\
                 The geometry of taxation \\
                 Among the seven sages \\
                 The secret society \\
                 Euclid's manifesto \\
                 A beautiful woman, a library, and the end of
                 civilization \\
                 Part 2: The story of Descartes \\
                 The revolution in place \\
                 The origin of latitude and longitude \\
                 The legacy of the rotten Romans \\
                 The discreet charm of the graph \\
                 A soldier's story \\
                 Iced by the Snow Queen \\
                 Part 3: The story of Gauss \\
                 The curved space revolution \\
                 The trouble with Ptolemy \\
                 A Napoleonic hero \\
                 The fall of the fifth postulate \\
                 Lost in hyperbolic space \\
                 Some insects called the human race \\
                 A tale of two aliens \\
                 After 2,000 years, a face-lift \\
                 Part 4: The story of Einstein \\
                 Revolution at the speed of light \\
                 Relativity's other Albert \\
                 The stuff of space \\
                 Probationary technical expert, third class \\
                 A relatively Euclidean approach \\
                 Einstein's apple \\
                 From inspiration to perspiration \\
                 Blue hair triumphs \\
                 Part 5: The story of Witten \\
                 The weird revolution \\
                 Ten things I hate about your theory \\
                 The necessary uncertainty of being \\
                 Clash of the Titans \\
                 A message in a Kaluza--Klein bottle \\
                 The birth of strings \\
                 Particles, schmarticles \\
                 The trouble with strings \\
                 The theory formerly known as strings",
}

@Book{Momjian:2001:PIC,
  author =       "Bruce Momjian",
  title =        "{PostgreSQL}: Introduction and Concepts",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xxviii + 462",
  year =         "2001",
  ISBN =         "0-201-70331-9 (paperback)",
  ISBN-13 =      "978-0-201-70331-3 (paperback)",
  LCCN =         "QA76.9.D3 M647 2001",
  bibdate =      "Sat Mar 9 13:37:45 MST 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/sqlbooks.bib",
  URL =          "http://www.addison-wesley.de/projector/projector.asp?page=bookdetails&isbn=3827318599;
                 http://www.ca.postgresql.org/docs/awbook.html;
                 http://www.pearsoned.co.jp/washo/db/wa_db27-j.html",
  acknowledgement = ack-nhfb,
  keywords =     "database management; PostgreSQL",
  tableofcontents = "History of PostgreSQL \\
                 University of California at Berkeley \\
                 Development Leaves Berkeley \\
                 PostgreSQL Global Development Team \\
                 Open Source Software \\
                 Issuing Database Commands \\
                 Starting a Database Session \\
                 Controlling a Session \\
                 Getting Help \\
                 Exiting a Session \\
                 Basic SQL Commands \\
                 Relational Databases \\
                 Creating Tables \\
                 Adding Data with Insert \\
                 Viewing Data with Select \\
                 Selecting Specific Rows with Where \\
                 Removing Data with Delete \\
                 Modifying Data with Update \\
                 Sorting Data with Order By \\
                 Destroying Tables \\
                 Customizing Queries \\
                 Data Types \\
                 Quotes Inside Text \\
                 Using Null Values \\
                 Controlling Default Values \\
                 Column Labels \\
                 And/Or Usage \\
                 Range of Values \\
                 Like Comparison \\
                 Regular Expressions \\
                 Case Clause \\
                 Distinct Rows \\
                 Functions and Operators \\
                 Set, Show, and Reset \\
                 SQL Aggregates \\
                 Aggregates \\
                 Using Group By \\
                 Using Having \\
                 Query Tips \\
                 Joining Tables \\
                 Table and Column References \\
                 Joined Tables \\
                 Creating Joined Tables \\
                 Performing Joins \\
                 Three- and Four-Table Joins \\
                 Additional Join Possibilities \\
                 Choosing a Join Key \\
                 One-to-Many Joins \\
                 Unjoined Tables \\
                 Table Aliases and Self-joins \\
                 Non-equijoins \\
                 Ordering Multiple Parts \\
                 Primary and Foreign Keys \\
                 Numbering Rows \\
                 Object Identification Numbers (OIDs) \\
                 Object Identification Number Limitations \\
                 Sequences \\
                 Creating Sequences \\
                 Using Sequences to Number Rows \\
                 Serial Column Type \\
                 Manually Numbering Rows \\
                 Combining Selects",
}

@Book{Monagan:1996:MVP,
  author =       "M. B. Monagan and K. O. Geddes and K. M. Heal and G.
                 Labahn and S. Vorkoetter",
  title =        "{Maple V} Programming Guide",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xii + 379",
  year =         "1996",
  ISBN =         "0-387-94537-7, 0-387-94576-8",
  ISBN-13 =      "978-0-387-94537-8, 978-0-387-94576-7",
  LCCN =         "QA76.95.M363 199",
  MRclass =      "68W30, 68-01, 68N15",
  bibdate =      "Sat Mar 09 09:19:45 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/maple-extract.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "With the editorial assistance of J. S. Devitt, M. L.
                 Hansen, D. Redfern, and K. M. Rickard.",
  price =        "US\$34.00",
  acknowledgement = ack-nhfb,
  tableofcontents = "Introduction / 1 \\
                 Getting Started with Maple / 7 \\
                 Calculus / 27 \\
                 Linear Algebra / 59 \\
                 Solving Equations / 95 \\
                 Polynomials and Common Transforms / 131 \\
                 Geometry / 171 \\
                 Combinatorics and Graph Theory / 196 \\
                 Number Theory / 229 \\
                 Statistics / 257 \\
                 Standard Functions and Constants / 284 \\
                 Expression Manipulation / 315 \\
                 Plotting / 334 \\
                 Programming and System Commands / 375 \\
                 Miscellaneous / 431 \\
                 Index / 477",
}

@Book{Monagan:2003:MAP,
  author =       "M. B. Monagan and K. O. Geddes and K. M. Heal and G.
                 Labahn and S. M. Vorkoetter and J. McCarron and P.
                 DeMarco",
  title =        "{Maple 9} Advanced Programming Guide",
  publisher =    pub-MAPLESOFT,
  address =      pub-MAPLESOFT:adr,
  pages =        "x + 443",
  year =         "2003",
  ISBN =         "1-894511-44-1",
  ISBN-13 =      "978-1-894511-44-5",
  LCCN =         "QA76.95 M364 2003",
  bibdate =      "Sat Dec 24 15:53:15 MST 2005",
  bibsource =    "BIBSYS;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  idnumber =     "538",
}

@Book{Monagan:2003:MIP,
  author =       "M. B. Monagan and K. O. Geddes and K. M. Heal and G.
                 Labahn and S. M. Vorkoetter and J. McCarron and P.
                 DeMarco",
  title =        "{Maple 9} Introductory Programming Guide",
  publisher =    pub-MAPLESOFT,
  address =      pub-MAPLESOFT:adr,
  pages =        "x + 388",
  year =         "2003",
  ISBN =         "1-894511-43-3",
  ISBN-13 =      "978-1-894511-43-8",
  LCCN =         "QA76.95 .M363 2003",
  bibdate =      "Sat Nov 08 07:24:18 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  idnumber =     "539",
}

@Book{Monk:2013:ROL,
  author =       "Ray Monk",
  title =        "{Robert Oppenheimer}: a Life Inside the Center",
  publisher =    pub-DOUBLEDAY,
  address =      pub-DOUBLEDAY:adr,
  pages =        "xvi + 825 + 32",
  year =         "2013",
  ISBN =         "0-385-50407-1 (hardback)",
  ISBN-13 =      "978-0-385-50407-2 (hardback)",
  LCCN =         "QC16.O62 M66 2013",
  bibdate =      "Sun May 26 09:15:36 2013",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/o/oppenheimer-j-robert.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "Revered biographer Ray Monk solves the enigma of
                 Robert Oppenheimer's life and personality and
                 brilliantly illuminates his contribution to the
                 revolution in twentieth-century physics. In Robert
                 Oppenheimer, Ray Monk delves into the rich and complex
                 intellectual life of America's most fascinating and
                 elusive scientist, the father of the atomic bomb. As a
                 young professor at Berkeley, the wealthy, cultured
                 Oppenheimer finally came into his own as a physicist
                 and also began a period of support for Communist
                 activities. At the high point of his life, he was
                 chosen to lead the Manhattan Project and develop the
                 deadliest weapon on earth: the atomic bomb. Upon its
                 creation, Oppenheimer feared he had brought mankind to
                 the precipice of self-annihilation and refused to help
                 create the far more powerful hydrogen bomb, bringing
                 the wrath of McCarthyite suspicion upon him. In the
                 course of famously dramatic public hearings, he was
                 stripped of his security clearance. Drawing on original
                 research and interviews, Monk traces the wide range of
                 influences on Oppenheimer's development --- his
                 Jewishness, his social isolation at Harvard, his love
                 of Sanskrit, his radical politics. This definitive
                 portrait finally solves the enigma of the
                 extraordinary, charming, tortured man whose beautiful
                 mind fundamentally reshaped the world",
  acknowledgement = ack-nhfb,
  remark =       "Reprint of \cite{Monk:2012:ICL}.",
  tableofcontents = "Part 1: 1904--1926 \\
                 1. ``Amerika, du hast es besser'': Oppenheimer's German
                 Jewish background \\
                 2. Childhood \\
                 3. First love: New Mexico \\
                 4. Harvard \\
                 5. Cambridge \\
                 Part 2: 1926--1941 \\
                 6. G{\"o}ttingen \\
                 7. Postdoctoral fellow \\
                 8. An {\em American} School of Theoretical Physics \\
                 9. Unstable cores \\
                 10. Fission \\
                 Part 3: 1941--1945 \\
                 11. In on the secret \\
                 12. Los Alamos 1: Security \\
                 13. Los Alamos 2: Implosion \\
                 14. Los Alamos 3: Heavy with misgiving \\
                 Part 4: 1945--1967 \\
                 15. The insider scientist \\
                 16. The booming years \\
                 17. Massive retaliation \\
                 18. {\em Falsus in uno} \\
                 19. An open book? \\
                 Notes \\
                 Bibliography \\
                 Index",
}

@Book{Moore:2016:RGT,
  author =       "Kate Moore",
  title =        "The Radium Girls: They Paid with Their Lives, Their
                 Final Fight Was for Justice",
  publisher =    pub-SIMON-SCHUSTER,
  address =      pub-SIMON-SCHUSTER:adr,
  pages =        "xiii + 465",
  year =         "2016",
  ISBN =         "1-4711-4757-6 (paperback), 1-4711-5387-8 (hardcover),
                 1-4711-5389-4 (e-book), 1-4926-4937-6 (e-book)",
  ISBN-13 =      "978-1-4711-4757-9 (paperback), 978-1-4711-5387-7
                 (hardcover), 978-1-4711-5389-1 (e-book),
                 978-1-4926-4937-3 (e-book)",
  LCCN =         "HD6067.2.U6 M66 2016",
  bibdate =      "Tue Nov 20 10:28:53 MST 2018",
  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 =     "Ordinary women in 1920s America. All they wanted was
                 the chance to shine. Be careful what you wish for. `The
                 first thing we asked was, ``Does this stuff hurt you?''
                 And they said, ``No.'' The company said that it wasn't
                 dangerous, that we didn't need to be afraid.' 1917. As
                 a war raged across the world, young American women
                 flocked to work, painting watches, clocks and military
                 dials with a special luminous substance made from
                 radium. It was a fun job, lucrative and glamorous ---
                 the girls themselves shone brightly in the dark,
                 covered head to toe in the dust from the paint. They
                 were the radium girls. As the years passed, the women
                 began to suffer from mysterious and crippling
                 illnesses. The very thing that had made them feel alive
                 --- their work --- was in fact slowly killing them:
                 they had been poisoned by the radium paint. Yet their
                 employers denied all responsibility. And so, in the
                 face of unimaginable suffering --- in the face of death
                 --- these courageous women refused to accept their fate
                 quietly, and instead became determined to fight for
                 justice. Drawing on previously unpublished sources ---
                 including diaries, letters and court transcripts, as
                 well as original interviews with the women's relatives
                 --- \booktitle{The Radium Girls} is an intimate
                 narrative account of an unforgettable true story. It is
                 the powerful tale of a group of ordinary women from the
                 Roaring Twenties, who themselves learned how to roar.",
  acknowledgement = ack-nhfb,
  subject =      "Watch dial painters; Diseases; United States; History;
                 Radium paint; Toxicology; Consumers' leagues;
                 Industrial hygiene; 20th century; World War,
                 1914--1918; Women; War work",
  tableofcontents = "List of key characters / xiii \\
                 Prologue / xvii \\
                 Part One: Knowledge / 1 \\
                 Part Two: Power / 145 \\
                 Part Three: Justice / 281 \\
                 Epilogue / 378 \\
                 Postscript / 398 \\
                 Author's Note / 401 \\
                 Acknowledgments / 406 \\
                 Reading Group Guide / 410 \\
                 Picture Acknowledgments / 412 \\
                 Abbreviations / 414 \\
                 Notes / 416 \\
                 Select Bibliography / 462 \\
                 Index / 468 \\
                 About the Author / 478",
}

@TechReport{More:minpack,
  author =       "Jorge J. Mor{\'e} and Burton S. Garbow and Kenneth E.
                 Hillstrom",
  title =        "User Guide for {MINPACK-1}",
  number =       "ANL-80-74",
  institution =  pub-ANL,
  address =      pub-ANL:adr,
  month =        aug,
  year =         "1980",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Morgan:1984:BAR,
  author =       "Christopher L. Morgan",
  title =        "Bluebook of Assembly Routines for the {IBM PC} and
                 {XT}",
  publisher =    pub-PLUME-WAITE,
  address =      pub-PLUME-WAITE:adr,
  pages =        "x + 244",
  year =         "1984",
  ISBN =         "0-452-25498-1",
  ISBN-13 =      "978-0-452-25498-5",
  LCCN =         "QA76.8.I2594 M64 1984",
  bibdate =      "Sun May 02 07:52:50 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "A handbook collection of many assembly language
                 routines for the IBM PC. The graphics algorithms,
                 particular line-drawing, could be substantially speeded
                 up. See \cite{Lafore:1984:ALP}.",
  acknowledgement = ack-nhfb,
}

@Book{Morgan:2007:LHE,
  author =       "Michael Hamilton Morgan",
  title =        "Lost history: the enduring legacy of {Muslim}
                 scientists, thinkers, and artists",
  publisher =    "National Geographic",
  address =      "Washington, DC, USA",
  pages =        "xviii + 301",
  year =         "2007",
  ISBN =         "1-4262-0092-7 (hardcover)",
  ISBN-13 =      "978-1-4262-0092-2 (hardcover)",
  LCCN =         "DS36.85 .M75 2007",
  bibdate =      "Tue Jul 3 16:03:34 MDT 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "Author Morgan reveals how early Muslim advancements in
                 science and culture lay the cornerstones of the
                 European Renaissance, the Enlightenment, and modern
                 Western society. As he chronicles the Golden Ages of
                 Islam, beginning in 570 a.d. with the birth of
                 Muhammad, and resonating today, he introduces scholars
                 like Ibn Al-Haytham, Ibn Sina, Al-Tusi, Al-Khwarizmi,
                 and Omar Khayyam---empirical thinkers who
                 revolutionized the mathematics, astronomy, and medicine
                 of their time and paved the way for Newton, Copernicus,
                 and many others. And he reminds us that inspired
                 leaders from Muhammad to Suleiman the Magnificent
                 championed religious tolerance, encouraged intellectual
                 inquiry, and sponsored brilliant artistic,
                 architectural, and literary works. For anyone seeking
                 to understand the major role played by the early Muslim
                 world in influencing modern society, this book provides
                 new insight not only into Islam's historic achievements
                 but also the ancient resentments that fuel today's
                 bitter conflicts.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  remark =       "Foreword by His Majesty King Abdullah II of Jordan.",
  subject =      "Civilization, Islamic; Civilization, Western; Islamic
                 influences; Muslim scientists; Muslim artists;
                 Renaissance",
  tableofcontents = "Introduction \\
                 Rome's children \\
                 Lost cities of genius \\
                 God in the numeral \\
                 Star patterns \\
                 Inventors and scientists \\
                 Healers and hospitals \\
                 Vision, voice, citadel \\
                 Enlightened leadership \\
                 Epilogue \\
                 Glossary",
}

@Book{Morgan:808682,
  author =       "Christopher L. Morgan and Mitchell Waite",
  title =        "8086\slash 8088 16-Bit Microprocessor Primer",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "ix + 355",
  year =         "1982",
  ISBN =         "0-07-043109-4",
  ISBN-13 =      "978-0-07-043109-6",
  LCCN =         "QA76.8.I292 M66 1982",
  bibdate =      "Wed Dec 15 10:39:13 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "A general book on the 8086 and 8088 with shorter
                 treatments of the 8087, 8089, 80186, and 80286, and
                 support chips. Nothing specific to the IBM PC.",
  acknowledgement = ack-nhfb,
}

@Book{Morris:1983:CME,
  author =       "John Ll. Morris",
  title =        "Computational Methods in Elementary Numerical
                 Analysis",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xii + 410",
  year =         "1983",
  ISBN =         "0-471-10419-1 (hardcover), 0-471-10420-5 (paperback)",
  ISBN-13 =      "978-0-471-10419-3 (hardcover), 978-0-471-10420-9
                 (paperback)",
  LCCN =         "555 M67 1983",
  bibdate =      "Wed Dec 15 10:39:21 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$56.00 (hardcover), US\$30.95 (paperback)",
  acknowledgement = ack-nhfb,
}

@Book{Morris:2001:TR,
  author =       "Edmund Morris",
  title =        "{Theodore Rex}",
  publisher =    "Modern Library",
  address =      "New York, NY, USA",
  pages =        "x + 772",
  year =         "2001",
  ISBN =         "0-394-55509-0, 0-8129-6600-7 (paperback),
                 0-9654069-7-X, 1-58836-093-8 (e-book)",
  ISBN-13 =      "978-0-394-55509-6, 978-0-8129-6600-8 (paperback),
                 978-0-9654069-7-0, 978-1-58836-093-9 (e-book)",
  LCCN =         "E757 .M885 2001",
  bibdate =      "Mon Dec 9 06:44:54 MST 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://catdir.loc.gov/catdir/bios/random053/2001019366.html;
                 http://catdir.loc.gov/catdir/description/random0411/2001019366.html;
                 http://catdir.loc.gov/catdir/samples/random044/2001019366.html",
  abstract =     "Theodore Rex is the story `never fully told before' of
                 Theodore Roosevelt's two world-changing terms as
                 President of the United States. A hundred years before
                 the catastrophe of September 11, 2001, ``TR'' succeeded
                 to power in the aftermath of an act of terrorism.
                 Youngest of all our chief executives, he rallied a
                 stricken nation with his superhuman energy, charm, and
                 political skills. He proceeded to combat the problems
                 of race and labor relations and trust control while
                 making the Panama Canal possible and winning the Nobel
                 Peace Prize. But his most historic achievement remains
                 his creation of a national conservation policy, and his
                 monument millions of acres of protected parks and
                 forest. Theodore Rex ends with TR leaving office, still
                 only fifty years old, his future reputation secure as
                 one of our greatest presidents.",
  acknowledgement = ack-nhfb,
  remark =       "Sequel to \booktitle{The Rise of Theodore
                 Roosevelt}.",
  subject =      "Roosevelt, Theodore, 1858--1919; Presidents; United
                 States; Biography; Presidents",
  tableofcontents = "Prologue: 14--16 September 1901 / 3 (40) \\
                 The First Administration, 1901--1904 \\
                 The Shadow of the Crown / 43 (9) \\
                 The Most Damnable Outrage / 52 (7) \\
                 One Vast, Smoothly Running Machine / 59 (11) \\
                 A Message from the President / 70 (11) \\
                 Turn of a Rising Tide / 81 (14) \\
                 Two Pilots Aboard, and Rocks Ahead / 95 (13) \\
                 Genius, Force, Originality / 108 (12) \\
                 The Good Old Summertime / 120 (12) \\
                 No Power or Duty / 132 (12) \\
                 The Catastrophe Now Impending / 144 (11) \\
                 A Very Big and Entirely New Thing / 155 (15) \\
                 Not a Cloud on the Horizon / 170 (13) \\
                 The Big Stick / 183 (10) \\
                 A Condition, Not a Theory / 193 (21) \\
                 The Black Crystal / 214 (22) \\
                 White Man Black and Black Man White / 236 (14) \\
                 No Color of Right / 250 (20) \\
                 The Most Just and Proper Revolution / 270 (25) \\
                 The Imagination of the Wicked / 295 (12) \\
                 Intrigue and Striving and Change / 307 (16) \\
                 The Wire That Ran Around the World / 323 (16) \\
                 The Most Absurd Political Campaign of Our Time / 339
                 (36) \\
                 Interlude / 365 (10) \\
                 The Second Administration, 1905--1909 \\
                 Many Budding Things / 375 (11) \\
                 The Best Herder of Emperors Since Napoleon / 386 (29)
                 \\
                 Mere Force of Events / 415 (14) \\
                 The Treason of the Senate / 429 (20) \\
                 Blood Through Marble / 449 (27) \\
                 The Clouds That Are Gathering / 476 (16) \\
                 Such a Fleet and Such a Day / 492 (12) \\
                 Moral Overstrain / 504 (17) \\
                 The Residuary Legatee / 521 (18) \\
                 One Long Lovely Crackling Row / 539 (11) \\
                 Epilogue: 4 March 1909 / 550 (7) \\
                 Acknowledgments / 557 (2) \\
                 Archives / 559 (4) \\
                 Select Bibliography / 563 (10) \\
                 Notes / 573 (168) \\
                 Illustration Credits / 741 (2) \\
                 Index / 743",
}

@Book{Morse:80286,
  author =       "Stephen P. Morse and Douglas J. Albert",
  title =        "The 80286 Architecture",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xiii + 279",
  year =         "1986",
  ISBN =         "0-471-83185-9",
  ISBN-13 =      "978-0-471-83185-3",
  LCCN =         "QA76.8.I2927 M67 1986",
  bibdate =      "Wed Dec 15 10:39:24 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Morse is the chief architect of the Intel 8086. See
                 also \cite{Intel:286-prm}.",
  acknowledgement = ack-nhfb,
}

@Book{Mortenson:1985:GM,
  author =       "Michael E. Mortenson",
  title =        "Geometric Modeling",
  publisher =    pub-WILEY-INTERSCIENCE,
  address =      pub-WILEY-INTERSCIENCE:adr,
  pages =        "xvi + 763",
  year =         "1985",
  ISBN =         "0-471-88279-8",
  ISBN-13 =      "978-0-471-88279-4",
  LCCN =         "QA447 .M62 1985",
  bibdate =      "Wed Dec 15 10:39:52 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Moshier:1989:MPM,
  author =       "Stephen L. B. Moshier",
  title =        "Methods and Programs for Mathematical Functions",
  publisher =    pub-ELLIS-HORWOOD,
  address =      pub-ELLIS-HORWOOD:adr,
  pages =        "vii + 415",
  year =         "1989",
  ISBN =         "0-7458-0289-3",
  ISBN-13 =      "978-0-7458-0289-3",
  LCCN =         "QA331 .M84 1989",
  MRclass =      "*65D20, 26-04, 33-04, 65-02, 65C99",
  bibdate =      "Thu Sep 01 10:33:40 1994",
  bibsource =    "ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip;
                 https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\pounds 48.00",
  URL =          "http://www.moshier.net/;
                 http://www.netlib.org/cephes",
  ZMnumber =     "0701.65011",
  acknowledgement = ack-nj,
  shorttableofcontents = "Preface / vii \\
                 1: Floating Point Arithmetic / 1 \\
                 2: Approximation Methods / 75 \\
                 3: Software Notes / 129 \\
                 4: Elementary Functions / 143 \\
                 5: Probability Distributions and Related Functions /
                 201 6: Bessel Functions / 263 \\
                 7: Other Special Functions / 333 \\
                 Bibliography / 411 \\
                 Index / 413",
  tableofcontents = "Preface / vii \\
                 1: Floating Point Arithmetic / 1 \\
                 1.1 Numeric Data Structures / 1 \\
                 1.2 Rounding / 5 \\
                 1.3 Addition and Subtraction / 6 \\
                 1.4 Multiplication / 7 \\
                 1.4.1 Long Multiplication in Binary Radix / 8 \\
                 1.4.2 Multiplication in Word Integer Radix / 8 \\
                 1.4.3 Fast Multiplication / 9 \\
                 1.5 Division / 10 \\
                 1.5.1 Long Division / 10 \\
                 1.5.2 Division by Taylor Series / 11 \\
                 1.5.3 Newton--Raphson Division / 11 \\
                 1.6 C Language / 12 \\
                 1.7 An Extended Double Arithmetic: ieee.c / 13 \\
                 1.8 Binary - Decimal Conversion / 46 \\
                 1.8.1 etoasc.c / 47 \\
                 1.8.2 asctoe.c / 54 \\
                 1.9 Analysis of Error / 58 \\
                 1.9.1 Roundoff and Cancellation / 58 \\
                 1.9.2 Error Propagation / 60 \\
                 1.9.3 Error as a Random Variable / 61 \\
                 1.9.4 Order of Summation / 62 \\
                 1.10 Complex Arithmetic / 62 \\
                 1.10.1 cmplx.c / 64 \\
                 1.10.2 Absolute Value: cabs.c / 67 \\
                 1.11 Rational Arithmetic / 69 \\
                 1.11.1 euclid.c / 70 \\
                 2: Approximation Methods / 75 \\
                 2.1 Power Series / 75 \\
                 2.2 Chebyshev Expansions / 76 \\
                 2.2.1 chbevl.c / 79 \\
                 2.3 Pad{\'e} Approximations / 80 \\
                 2.4 Least Maximum Approximations / 82 \\
                 2.4.1 Best Polynomial Approximations / 82 \\
                 2.4.2 Best Rational Approximations / 85 \\
                 2.4.3 Special Rational Forms / 87 \\
                 2.5 A Program to Find Best Approximations: remes.c / 88
                 \\
                 2.6 Forms of Approximation / 111 \\
                 2.7 Asymptotic Expansions / 113 \\
                 2.8 Continued Fractions / 114 \\
                 2.8.1 Continued Fractions from Recurrences / 115 \\
                 2.8.2 Recurrences from Differential Equations / 116 \\
                 2.8.3 Computing Continued Fractions / 117 \\
                 2.9 Polynomials / 117 \\
                 2.9.1 polevl.c / 118 \\
                 2.10 Newton--Raphson Iterations / 119 \\
                 2.10.1 Division / 120 \\
                 2.10.2 Exponent Separation / 121 \\
                 2.10.3 Square Root / 122 \\
                 2.10.4 sqrt.c / 123 \\
                 2.10.5 Longhand Square Root / 124 \\
                 2.10.6 esqrt.c / 124 \\
                 2.10.7 Cube Root / 126 \\
                 2.10.8 cbrt.c / 127 \\
                 3: Software Notes / 129 \\
                 3.1 Design Strategy / 129 \\
                 3.2 Testing / 131 \\
                 3.3 System Utilities / 132 \\
                 3.3.1 mconf.h / 132 \\
                 3.3.2 mtherr.c / 134 \\
                 3.3.3 const.c / 136 \\
                 3.4 Arithmetic Utilities / 137 \\
                 3.4.1 efloor.c / 138 \\
                 3.4.2 efrexp.c / 140 \\
                 3.4.3 eldexp.c / 140 \\
                 4: Elementary Functions / 143 \\
                 4.1 $e^x$ / 143 \\
                 4.1.1 exp.c / 145 \\
                 4.2 $\ln x$ / 147 \\
                 4.2.1 log.c / 149 \\
                 4.3 Argument Transformation for Circular Functions /
                 152 \\
                 4.4 Sine and cosine / 153 \\
                 4.4.1 sin.c / 154 \\
                 4.4.2 cos.c / 156 \\
                 4.5 Tangent and Cotangent / 157 \\
                 4.5.1 tan.c / 158 \\
                 4.6 Complex Circular Functions / 161 \\
                 4.7 $\sin^{-1} x $ / 162 \\
                 4.7.1 asin.c / 163 \\
                 4.8 $\cos^{-1} x $ / 165 \\
                 4.8.1 acos.c / 165 \\
                 4.9 $\tan^{-1} x$ / 166 \\
                 4.9.1 atan.c / 168 \\
                 4.9.2 atan2.c / 169 \\
                 4.10 Complex Inverse Circular Functions / 170 \\
                 4.11 $\sinh x$ / 170 \\
                 4.11.1 sinh.c / 171 \\
                 4.12 $\cosh x$ / 172 \\
                 4.12.1 cosh.c / 173 \\
                 4.13 $\tanh x$ / 173 \\
                 4.13.1 tanh.c / 174 \\
                 4.14 $\sinh^{-1} x $ / 175 \\
                 4.14.1 asinh.c / 176 \\
                 4.15 $\cosh^{-1} x $ / 177 \\
                 4.15.1 acosh.c / 178 \\
                 4.16 $\tanh^{-1} x$ / 179 \\
                 4.16.1 atanh.c / 180 \\
                 4.17 Power Function / 181 \\
                 4.17.1 Real Exponent / 182 \\
                 4.17.2 pow.c / 182 \\
                 4.17.3 Integer Exponent / 189 \\
                 4.17.4 powi.c / 190 \\
                 4.18 Testing / 192 \\
                 4.19 Single Precision Polynomial Approximations / 193
                 \\
                 4.19.1 $\cos x$ / 193 \\
                 4.19.2 $\cosh^{-1} x $ / 193 \\
                 4.19.3 $\exp x$ / 196 \\
                 4.19.4 $\ln x$ / 196 \\
                 4.19.5 $\sin x$ / 197 \\
                 4.19.6 $\sin^{-1} x $ / 197 \\
                 4.19.7 Square Root / 197 \\
                 4.19.8 $\tan x$ / 198 \\
                 4.19.9 $\tan^{-1} x$ / 198 \\
                 4.19.10 $\tanh x$ / 199 \\
                 4.19.11 $tanh^{-1} x$ / 199 \\
                 5: Probability Distributions and Related Functions /
                 201 \\
                 5.1 $n!$ / 202 \\
                 5.1.1 fac.c / 204 \\
                 5.2 $\Gamma(x)$ / 206 \\
                 5.2.1 gamma.c / 210 \\
                 5.2.2 lgam.c / 214 \\
                 5.3 Incomplete Gamma Integral / 217 \\
                 5.3.1 igamc.c / 218 \\
                 5.3.2 igam.c / 220 \\
                 5.3.3 Functional Inverse of Incomplete Gamma Integral /
                 221 \\
                 5.3.4 igami.c / 221 \\
                 5.4 Gamma Distribution / 222 \\
                 5.4.1 gdtr c / 222 \\
                 5.4.2 gdtrc.c / 223 \\
                 5.5 $\chi^2$ Distribution / 223 \\
                 5.5.1 chdtrc.c / 224 \\
                 5.5.2 chdtr.c / 224 \\
                 5.5.3 chdtrl.c / 224 \\
                 5.6 Poisson Distribution / 225 \\
                 5.6.1 pdtrc.c / 225 \\
                 5.6.2 pdtr.c / 226 \\
                 5.6.3 pdtri.c / 226 \\
                 5.7 Beta Function / 227 \\
                 5.7.1 beta.c / 227 \\
                 5.8 Incomplete Beta Integral / 229 \\
                 5.8.1 ibet.c / 231 \\
                 5.8.2 Functional Inverse of Incomplete Beta Integral /
                 238 \\
                 5.9 Beta Distribution / 241 \\
                 5.9.1 btdtr.c / 241 \\
                 5.10 Binomial Distribution / 241 \\
                 5.10.1 bdtrc.c / 242 \\
                 5.10.2 bdtr.c / 243 \\
                 5.10.3 bdtri.c / 244 \\
                 5.11 Negative Binomial Distribution / 244 \\
                 5.11.1 nbdtr.c / 245 \\
                 5.11.2 nbdtrc.c / 245 \\
                 5.12 F Distribution / 246 \\
                 5.12.1 fdtrc.c / 247 \\
                 5.12.2 fdtr.c / 247 \\
                 5.12.3 fdtrci.c / 248 \\
                 5.13 Student's $t$ distribution / 249 \\
                 5.13.1 stdtr.c / 250 \\
                 5.14 Gaussian Distribution / 252 \\
                 5.14.1 ndtr.c / 254 \\
                 5.14.2 erfc.c / 256 \\
                 5.14.3 erf.c / 257 \\
                 5.14.4 Functional Inverse of Gaussian Distribution /
                 258 \\
                 5.14.5 ndtri.c / 259 \\
                 6: Bessel Functions / 263 \\
                 6.1 $J_0(x)$ / 263 \\
                 6.1.1 jO.c / 265 \\
                 6.2 $Y_0(x)$ / 268 \\
                 6.2.1 yO.c / 269 \\
                 6.3 Modulus and Phase / 270 \\
                 6.4 $J_1(x)$ / 271 \\
                 6.4.1 jl.c / 272 \\
                 6.5 $Y_1(x)$ / 275 \\
                 6.5.1 yl.c / 275 \\
                 6.6 $J_n(x)$ / 276 \\
                 6.1 $I_0(x)$ / 277 \\
                 6.7.1 i0.c / 278 \\
                 6.8 $I_1(x)$ / 281 \\
                 6.8.1 i1.c / 283 \\
                 6.9 $I_\nu(x)$ / 285 \\
                 6.9.1 iv.c / 286 \\
                 6.10 $K_0(x)$ / 287 \\
                 6.10.1 kO.c / 287 \\
                 6.11 $K_1(x)$ / 291 \\
                 6.11.1 kl.c / 291 \\
                 6.12 $K_n(x)$ / 294 \\
                 6.12.1 kn.c / 295 \\
                 6.13 $J_\nu(x)$ / 299 \\
                 6.13.1 jv.c / 301 \\
                 6.14 Airy Functions / 315 \\
                 6.14.1 airy.c / 322 \\
                 6.15 $Y_n(x)$ / 328 \\
                 6.15.1 yn.c / 329 \\
                 6.16 Testing / 330 \\
                 7: Other Special Functions / 333 \\
                 7.1 Hypergeometric Functions / 333 \\
                 7.1.1 $_2F_1$ / 334 \\
                 7.1.2 hyp2fi.c / 335 \\
                 7.1.3 $_1F_1$ / 341 \\
                 7.1.4 hyplfi.c / 342 \\
                 7.1.5 $_2F_0$ / 346 \\
                 7.1.6 hyp2ffi.c / 346 \\
                 7.2 Struve Functions / 348 \\
                 7.2.1 hypl1f2.c / 348 \\
                 7.2.2 hyp3f0.c / 349 \\
                 7.2.3 yv.c / 351 \\
                 7.2.4 struve.c / 351 \\
                 7.3 $\psi(x)$ / 352 \\
                 7.3.1 psi.c / 354 \\
                 7.4 Exponential Integral / 355 \\
                 7.4.1 en.c / 356 \\
                 7.5 Sine and Cosine Integrals / 360 \\
                 7.5.1 sici.c / 362 \\
                 7.5.2 Hyperbolic Sine and Cosine Integrals / 367 \\
                 7.5.3 shichi.c / 370 \\
                 7.6 Dilogarithm / 374 \\
                 7.6.1 spence.c / 375 \\
                 7.7 Dawson's Integral / 377 \\
                 7.7.1 dawsn.c / 378 \\
                 7.8 Fresnel Integrals / 381 \\
                 7.8.1 fresnl.c / 383 \\
                 7.9 Elliptic Functions / 387 \\
                 7.9.1 $K(m)$ / 387 \\
                 7.9.2 ellpk.c / 388 \\
                 7.9.3 $F(\phi|m)$ / 389 \\
                 7.9.4 ellik.c / 390 \\
                 7.9.5 $E(m)$ / 392 \\
                 7.9.6 ellpe.c / 392 \\
                 7.9.7 $E(\phi|m)$ / 393 \\
                 7.9.8 ellie.c / 394 \\
                 7.9.9 Jacobian Elliptic Functions / 396 \\
                 7.9.10 ellpj.c / 398 \\
                 7.10 Zeta Functions / 400 \\
                 7.10.1 hurwiz.c / 400 \\
                 7.10.2 Riemann Zeta Function / 402 \\
                 7.10.3 zetac.c / 405 \\
                 Bibliography / 411 \\
                 Index / 413",
}

@Book{Motorola:1985:MBM,
  author =       "Motorola",
  title =        "{MC68020} 32-Bit Microprocessor User's Manual",
  publisher =    pub-MOTOROLA,
  address =      pub-MOTOROLA:adr,
  edition =      "Second",
  year =         "1985",
  ISBN =         "0-13-566878-6",
  ISBN-13 =      "978-0-13-566878-8",
  LCCN =         "QA76.8.M6897 M37 1985",
  bibdate =      "Wed Jul 6 13:48:43 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Motorola:1985:MFP,
  author =       "Motorola",
  title =        "{MC68881} Floating-Point Coprocessor User's Manual",
  publisher =    pub-MOTOROLA,
  address =      pub-MOTOROLA:adr,
  edition =      "Second",
  year =         "1985",
  bibdate =      "Fri Sep 02 23:38:03 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nj,
}

@Book{Motorola:1989:MRM,
  author =       "Motorola",
  title =        "{MC88100} {RISC} Microprocessor User's Manual",
  publisher =    pub-MOTOROLA,
  address =      pub-MOTOROLA:adr,
  edition =      "Second",
  year =         "1989",
  ISBN =         "0-13-567090-X",
  ISBN-13 =      "978-0-13-567090-3",
  LCCN =         "QA76.8.M75 M3 1990",
  bibdate =      "Wed Jul 6 14:23:15 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/microchip.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Overview \\
                 Features \\
                 Introduction \\
                 Execution Units and Register File \\
                 Execution Model \\
                 Programming Model \\
                 Processor States \\
                 Reset State \\
                 Flow-Control Instructions \\
                 Register with 9-Bit Vector Table Index \\
                 Instruction Categories \\
                 Programming Tips \\
                 Instruction Set \\
                 Opcode Summary \\
                 Signal Description \\
                 Data Processor Bus Signals \\
                 Exceptions \\
                 Exception Overview \\
                 Exception Vectors and Vector Base Register (VBR) \\
                 Exception Priority \\
                 Exception Processing \\
                 Instruction Unit Exceptions \\
                 Integer Overflow Exception (Vector Offset \$48) \\
                 Memory Access Exceptions \\
                 FPU Exception Processing \\
                 FPU Exception Processing Registers \\
                 Timing Factors \\
                 Execution Example \\
                 Instruction Set Timing Summary \\
                 Applications Information \\
                 Cache Memory Management Units \\
                 Power and Ground Considerations \\
                 Master/Checker Operations \\
                 Synchronization Operations \\
                 Electrical Characteristics",
}

@Book{Muchnick:1997:ACD,
  author =       "Steven S. Muchnick",
  title =        "Advanced Compiler Design and Implementation",
  publisher =    pub-MORGAN-KAUFMANN,
  address =      pub-MORGAN-KAUFMANN:adrnew,
  pages =        "xxix + 856",
  year =         "1997",
  ISBN =         "1-55860-320-4",
  ISBN-13 =      "978-1-55860-320-2",
  LCCN =         "QA76.76.C65M8 1997",
  bibdate =      "Thu Sep 11 07:11:02 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$89.95",
  URL =          "http://www.loc.gov/catdir/description/els032/97013063.html;
                 http://www.loc.gov/catdir/toc/els032/97013063.html",
  abstract =     "This book takes on the challenges of contemporary
                 languages and architectures, and prepares the reader
                 for the new compiling problems that will inevitably
                 arise in the future. This comprehensive, up-to-date
                 work examines advanced issues in the design and
                 implementation of compilers for modern processors. for
                 professionals and graduate students, the book guides
                 readers in designing and implementing efficient.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Compilers (Computer programs); Systems programming
                 (Computer science)",
  tableofcontents = "Foreword / Susan Graham \\
                 1: Introduction to Advanced Topics \\
                 2: Informal Compiler Algorithm Notation (ICAN) \\
                 3: Symbol-Table Structure \\
                 4: Intermediate Representations \\
                 5: Run-Time Support \\
                 6: Producing Code Generators Automatically \\
                 7: Control-Flow Analysis \\
                 8: Data-Flow Analysis \\
                 9: Dependence Analysis and Dependence Graphs \\
                 10: Alias Analysis \\
                 11: Introduction to Optimization \\
                 12: Early Optimizations \\
                 13: Redundancy Elimination \\
                 14: Loop Optimizations \\
                 15: Procedure Optimizations \\
                 16: Register Allocation \\
                 17: Code Scheduling \\
                 18: Control-Flow and Low-Level Optimizations \\
                 19: Interprocedural Analysis and Optimization \\
                 20: Optimization for the Memory Hierarchy",
}

@Book{Mueller:2000:CAC,
  author =       "Silvia M. Mueller and Wolfgang J. Paul",
  title =        "Computer Architecture: Complexity and Correctness",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xiii + 553",
  year =         "2000",
  ISBN =         "3-540-67481-0",
  ISBN-13 =      "978-3-540-67481-8",
  LCCN =         "QA76.9.A73 M845 2000",
  bibdate =      "Mon Mar 05 18:45:52 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://www-wjp.cs.uni-sb.de/info/papers/#books",
  abstract =     "\booktitle{Computer Architecture: Complexity and
                 Correctness} develops, at the gate level, the complete
                 design of a pipelined RISC processor with delayed
                 branch, forwarding, hardware interlock, precise
                 maskable nested interrupts, caches, and a fully
                 IEEE-compliant floating point unit. In contrast to
                 other design approaches applied in practice and unlike
                 other textbooks available, the designs presented here
                 are modular, clean and complete up to the construction
                 of entire complex machines. The authors systematically
                 basing their approach on rigorous mathematical
                 formalisms allows for rigorous correctness proofs,
                 accurate hardware cost determination, and performance
                 evaluation as well as, generally speaking, for coverage
                 of a broad variety of relevant issues within a
                 reasonable number of pages. The book is written as a
                 text for classes on computer architecture and related
                 topics and will serve as source of reference for
                 professionals in hardware design. Numerous
                 illustrations, examples, exercises, and a subject index
                 support the reader in accessing the material
                 presented.",
  acknowledgement = ack-nhfb,
  keywords =     "DLX; IEEE 754; RISC",
  libnote =      "Not yet in my library.",
  remark =       "This book is about the design of the DLX (MIPS
                 derivative) processor, at the circuit level. As such,
                 it lacks the broad view of Hennessy \& Patterson's
                 books, but by considering actual gate implementation
                 costs, it is able to provide precise details of
                 implementation tradeoffs, in particular, on cache size
                 and design, and on why memory on chip is expensive (in
                 number of gates) [although the recent work by David
                 Patterson's group at UC/Berkeley on the Vector IRAM
                 processor is putting about 16MB RAM on chip, to make a
                 system-on-a-chip suitable for embedded devices, like
                 the 0.5B cell phones that will be manufactured in
                 2001].\par

                 The book includes mathematical correctness proofs of
                 all circuits, and automated verification of these
                 proofs is in progress.\par

                 From p. 10: ``\ldots{} All C programs associated with
                 the designs in this book are accessible at the our web
                 site.'' [see the URL field in this entry].\par

                 Chapter 7 ``IEEE Floating Point Standard and Theory of
                 Rounding'' has a good survey of the IEEE 754 Standard,
                 and its implications at the hardware level.\par

                 Chapter 8 ``Floating Point Algorithms and Data Paths'',
                 and Chapter 9 ``Pipelined DLX Machine with
                 Floating-Point Core'', examine the hardware
                 implementation of IEEE 754 arithmetic.\par

                 Chapter 9 makes very brief mention of the design issues
                 for fast interval arithmetic.",
  tableofcontents = "1: Introduction \\
                 2: Basics \\
                 2.1: Hardware Model \\
                 2.2: Number Representations and Basic Circuits \\
                 2.3: Basic Circuits \\
                 2.4: Arithmetic Circuits \\
                 2.5: Multipliers \\
                 2.6: Control Automata \\
                 3: A Sequential DLX Design \\
                 3.1: Instruction Set Architecture \\
                 3.2: High Level Data Paths \\
                 3.3: Environments \\
                 3.4: Sequential Control \\
                 3.5: Hardware Cost and Cycle Time \\
                 4: Basic Pipelining \\
                 4.1: Delayed Branch and Delayed PC \\
                 4.2: Prepared Sequential Machines \\
                 4.3: Pipelining as a Transformation \\
                 4.4: Result Forwarding \\
                 4.5: Hardware Interlock \\
                 4.6: Cost Performance Analysis \\
                 5: Interrupt Handling \\
                 5.1: Attempting a Rigorous Treatment of Interrupts \\
                 5.2: Extended Instruction Set Architecture",
}

@Book{Mueller:2000:URP,
  author =       "Scott Mueller",
  title =        "Upgrading and Repairing {PCs}",
  publisher =    pub-QUE,
  address =      pub-QUE:adr,
  edition =      "Twelfth",
  pages =        "xvi + 1628",
  year =         "2000",
  ISBN =         "0-7897-2303-4",
  ISBN-13 =      "978-0-7897-2303-1",
  LCCN =         "TK7887 .M84 2001",
  bibdate =      "Wed May 16 14:52:17 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Includes CD-ROM.",
  price =        "US\$49.99",
  abstract =     "Discusses how to maintain or enhance all PC-compatible
                 systems and explains system assessment, hardware
                 installation, and troubleshooting.",
  acknowledgement = ack-nhfb,
  annote =       "This book has excellent coverage of many aspects of
                 personal computers and peripheral products.",
  tableofcontents = "UpgradingPCs.com \\
                 1. Personal Computer Background \\
                 Computer History \\
                 Before Personal Computers \\
                 Modern Computers \\
                 Personal Computer History \\
                 The IBM Personal Computer \\
                 The PC Industry 19 Years Later \\
                 2. PC Components, Features, and System Design \\
                 What Is a PC? \\
                 System Types \\
                 System Components \\
                 Sources of Information \\
                 Manuals (Documentation) \\
                 Magazines \\
                 Seminars \\
                 Machines \\
                 3. Microprocessor Types and Specifications \\
                 Pre-PC Microprocessor History \\
                 Processor Specifications \\
                 SMM (Power Management) \\
                 Superscalar Execution \\
                 MMX Technology \\
                 SSE (Streaming SIMD Extensions) \\
                 3DNow and Enhanced 3DNow \\
                 Dynamic Execution \\
                 Dual Independent Bus (DIB) Architecture \\
                 Processor Manufacturing \\
                 PGA Chip Packaging \\
                 Single Edge Contact (SEC) and Single Edge Processor
                 (SEP) Packaging \\
                 Processor Sockets and Slots \\
                 Zero Insertion Force (ZIF) Sockets \\
                 Processor Slots \\
                 CPU Operating Voltages \\
                 Heat and Cooling Problems \\
                 Math Coprocessors (Floating-Point Units) \\
                 Processor Bugs \\
                 Processor Update Feature \\
                 Processor Codenames \\
                 Intel-Compatible Processors (AMD and Cyrix) \\
                 P1 (086) First-Generation Processors \\
                 P2 (286) Second-Generation Processors \\
                 P3 (386) Third-Generation Processors \\
                 P4 (486) Fourth-Generation Processors \\
                 P5 (586) Fifth-Generation Processors \\
                 Pseudo Fifth-Generation Processors \\
                 Intel P6 (686) Sixth-Generation Processors \\
                 Other Sixth-Generation Processors \\
                 Itanium (P7/Merced) Seventh-Generation Processors \\
                 Processor Upgrades \\
                 Processor Troubleshooting Techniques \\
                 4. Motherboards and Buses \\
                 Motherboard Form Factors \\
                 Motherboard Components \\
                 Processor Sockets/Slots \\
                 Chipsets \\
                 Chipset Evolution \\
                 Intel Chipsets \\
                 AMD Athlon/Duron Chipsets \\
                 North/South Bridge Architecture \\
                 Fifth-Generation (P5 Pentium Class) Chipsets \\
                 Sixth-Generation (P6 Pentium Pro/Pentium II/III Class)
                 Chipsets \\
                 Super I/O Chips \\
                 System Bus Functions and Features \\
                 The Need for Expansion Slots \\
                 Types of I/O Buses \\
                 System Resources \\
                 Resolving Resource Conflicts \\
                 Knowing What to Look For (Selection Criteria) \\
                 5. BIOS \\
                 BIOS Hardware/Software \\
                 Motherboard BIOS \\
                 Upgrading the BIOS \\
                 CMOS Setting Specifications \\
                 Year 2000 BIOS Issues \\
                 Plug-and-Play BIOS \\
                 BIOS Error Messages \\
                 6. Memory \\
                 ROM \\
                 DRAM \\
                 Cache Memory: SRAM \\
                 RAM Memory Speeds \\
                 New DRAM Memory Technologies \\
                 Physical RAM Memory \\
                 Installing RAM Upgrades \\
                 Troubleshooting Memory \\
                 The System Logical Memory Layout \\
                 7. The IDE Interface \\
                 An Overview of the IDE Interface \\
                 Precursors to IDE \\
                 The IDE Interface \\
                 ATA IDE \\
                 ATA Standards \\
                 ATA Features \\
                 8. The SCSI Interface \\
                 Small Computer System Interface (SCSI) \\
                 ANSI SCSI Standards \\
                 SCSI-1 \\
                 SCSI-2 \\
                 SCSI-3 \\
                 SCSI Cables and Connectors \\
                 SCSI Cable and Connector Pinouts \\
                 SCSI Drive Configuration \\
                 Plug-and-Play (PnP) SCSI \\
                 SCSI Configuration Troubleshooting \\
                 SCSI Versus IDE \\
                 9. Magnetic Storage Principles \\
                 History of Magnetic Storage \\
                 How Magnetic Fields Are Used to Store Data \\
                 Read/Write Head Designs \\
                 Head Sliders \\
                 Data Encoding Schemes \\
                 Encoding Scheme Comparisons \\
                 PRML (Partial-Response, Maximum-Likelihood) Decoders
                 \\
                 Capacity Measurements \\
                 Areal Density \\
                 10. Hard Disk Storage \\
                 Definition of a Hard Disk \\
                 Hard Drive Advancements \\
                 Hard Disk Drive Operation \\
                 Basic Hard Disk Drive Components \\
                 Hard Disk Features \\
                 11. Floppy Disk Storage \\
                 Floppy Disk Drives \\
                 Drive Components \\
                 Disk Physical Specifications and Operation \\
                 Types of Floppy Disk Drives \\
                 Analyzing Floppy Disk Construction \\
                 Drive-Installation Procedures \\
                 Troubleshooting Floppy Drives \\
                 Repairing Floppy Disk Drives \\
                 12. High-Capacity Removable Storage \\
                 Why Use Removable-Media Drives? \\
                 Types of Removable Media Drives \\
                 Overview of Removable Magnetic Storage Devices \\
                 Other High-Capacity ``Beyond Floppy'' Drive Options \\
                 Proprietary Removable-Media Drives \\
                 Hard-Disk Sized Removable Media Drives \\
                 ``Orphan'' Removable-Media Drives \\
                 Removable Drive Letter Assignments \\
                 Comparing Price and Performance \\
                 Magneto-Optical Drives \\
                 Flash Card and Digital ``Film'' \\
                 Tape Drives \\
                 Choosing the Best High-Performance Backup Technology
                 \\
                 Tape Drive Installation \\
                 Tape Drive Backup Software \\
                 Tape Drive Troubleshooting \\
                 Tape Retensioning \\
                 13. Optical Storage \\
                 What Is a CD-ROM? \\
                 What Types of Drives Are Available? \\
                 CD-ROM Disc and Drive Formats \\
                 Writable CD-ROM Drives \\
                 DVD (Digital Versatile Disc) \\
                 DVD Speed \\
                 Drive Compatibility \\
                 The MultiRead Specifications \\
                 Adding a DVD Drive to Your System \\
                 CD-ROM Software on Your PC \\
                 Loading CD-ROM Drivers \\
                 Creating a Bootable Disk with CD-ROM Support \\
                 Making a Bootable CD-ROM for Emergencies \\
                 Caring for Optical Media \\
                 Troubleshooting Optical Drives \\
                 14. Physical Drive Installation and Configuration \\
                 Hard Disk Installation Procedures \\
                 Hard Drive Physical Installation \\
                 Step by Step \\
                 Replacing an Existing Drive \\
                 Hard Disk Drive Troubleshooting and Repair \\
                 Installing an Optical Drive \\
                 Floppy Drive Installation Procedures \\
                 15. Video Hardware \\
                 Video Display Technologies \\
                 CRT Monitors \\
                 LCD Displays \\
                 Flat-Panel LCD Displays \\
                 All-in-One Desktop PCs \\
                 Monitor Selection Criteria \\
                 Caring for Your Monitor \\
                 Video Display Adapters \\
                 The Video BIOS \\
                 Video Cards for Multimedia \\
                 3D Graphics Accelerators \\
                 Upgrading or Replacing Your Video Card \\
                 Adapter and Display Troubleshooting \\
                 16. Serial, Parallel, and Other I/O Interfaces \\
                 Introduction to Input/Output Ports \\
                 Serial Ports \\
                 High-Speed Serial Ports (ESP and Super ESP) \\
                 Serial Port Configuration \\
                 Testing Serial Ports \\
                 Parallel Ports \\
                 IEEE 1284 Parallel Port Standard \\
                 Upgrading to EPP/ECP Parallel Ports \\
                 Parallel Port Configuration \\
                 Linking Systems with Parallel Ports \\
                 Parallel to SCSI Converters \\
                 Testing Parallel Ports \\
                 USB and 1394 (i. Link) FireWire \\
                 Serial and Parallel Port Replacements \\
                 17. Input Devices \\
                 Keyboards \\
                 Keyboard Technology \\
                 Keyboard Troubleshooting and Repair \\
                 Keyboard Recommendation \\
                 Pointing Devices \\
                 Running Windows Without a Mouse \\
                 18. Internet Connectivity \\
                 Relating Internet and LAN Connectivity \\
                 Asynchronous Modems \\
                 Modem Standards \\
                 Integrated Services Digital Network (ISDN) \\
                 Leased Lines \\
                 CATV Networks \\
                 DirecPC \\
                 Internet Connectivity via Satellite \\
                 DSL (Digital Subscriber Line) \\
                 Comparing High-Speed Internet Access \\
                 Sharing Your Modem Connection \\
                 Modem Troubleshooting \\
                 19. Local Area Networking \\
                 What Is a Network? \\
                 Types of Networks \\
                 Client/Server Versus Peer Networks \\
                 Requirements for a Network \\
                 Ethernet Versus Token-Ring \\
                 Hardware Elements of Your Network \\
                 Network Cable Installations \\
                 Wireless Ethernet \\
                 Network Protocols \\
                 Choosing What You Need \\
                 Other Home Networking Solutions \\
                 Putting Your Network Together \\
                 Direct Cable Connections \\
                 Troubleshooting Network Software Setup \\
                 Troubleshooting Networks in Use \\
                 Troubleshooting TCP/IP \\
                 Troubleshooting Direct Cable Connections \\
                 20. Audio Hardware \\
                 Development of PC Audio Adapters \\
                 Current Uses for Audio Adapters \\
                 Digitized Sound Files \\
                 Audio Adapter Concepts and Terms \\
                 Audio Adapter Features \\
                 Choosing an Audio Adapter \\
                 Audio Adapter Installation (Overview) \\
                 Troubleshooting Sound Card Problems \\
                 Speakers \\
                 Microphones \\
                 21. Power Supply and Chassis/Case \\
                 Considering the Importance of the Power Supply \\
                 Power Supply Function and Operation \\
                 Power Supply Form Factors \\
                 Power Supply Connectors \\
                 Power Supply Loading \\
                 Power Supply Ratings \\
                 Power Supply Specifications \\
                 Power Supply Certifications \\
                 Power-Use Calculations \\
                 Power Off When Not in Use \\
                 Power Management \\
                 Power Supply Troubleshooting \\
                 Repairing the Power Supply \\
                 Obtaining Replacement Units \\
                 Custom Cases \\
                 Using Power-Protection Systems \\
                 RTC/NVRAM Batteries (CMOS Chips) \\
                 22. Printers and Scanners \\
                 The Evolution of Printing and Scanning Technology \\
                 Printer Technology \\
                 How Printers Operate \\
                 Color Printing \\
                 Choosing a Printer Type \\
                 Installing Printer Support",
}

@Book{Mui:1992:XWS,
  author =       "Linda Mui and Eric Pearce",
  title =        "{X Window System} Administrator's Guide for {X11}
                 Release 4 and Release 5",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xxiv + 346",
  year =         "1992",
  ISBN =         "0-937175-83-8 (paperback), 1-56592-052-X (with CD
                 ROM)",
  ISBN-13 =      "978-0-937175-83-5 (paperback), 978-1-56592-052-1 (with
                 CD ROM)",
  LCCN =         "QA76.76.W56 D44 v.8 1992",
  bibdate =      "Sat Nov 13 11:49:33 1993",
  bibsource =    "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;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  note =         "Contains CD ROM with X11R4 and X11R5 source code, plus
                 compiled versions for Sun 3 SunOS 4.1.1, Sun 4 SunOS
                 4.1.1, DECstation ULTRIX 4.2, and IBM RS/6000 AIX
                 3.2.",
  price =        "US\$29.95 (without CD ROM), US\$59.95 (with CD ROM)",
  URL =          "http://www.oreilly.com/catalog/9780937175835;
                 http://www.oreilly.com/catalog/v8",
  acknowledgement = ack-nhfb,
  tableofcontents = "Preface / xix \\
                 How to Use this Book / xix \\
                 Assumptions / xxi \\
                 Related Documents / xxi \\
                 Font Conventions Used in This Book / xxii \\
                 We'd Like to Hear From You / xxiii \\
                 Bulk Sales Information / xxiii \\
                 Acknowledgments / xxiii \\
                 1: An Introduction to X Administration / 3 \\
                 1.1 The Design of X11 / 3 \\
                 1.1.1 Display Servers / 4 \\
                 1.1.2 Clients and Resources / 6 \\
                 1.1.3 Toolkits and GUIs / 7 \\
                 1.2 X Administration / 8 \\
                 1.2.1 Installing X / 8 \\
                 1.2.2 Supporting Users / 9 \\
                 1.2.3 Maintaining Software / 9 \\
                 1.2.4 Maintaining Multiple Machines / 10 \\
                 1.2.5 A `Philosophy' of X Administration / 10 \\
                 2: The X User Environment / 13 \\
                 2.1 The Configured X Session / 13 \\
                 2.1.1 The Twilight Zone / 16 \\
                 2.2 Components of the X Environment / 18 \\
                 2.2.1 Window Managers / 18 \\
                 2.2.2 Customizing Clients / 20 \\
                 2.2.2.1 The -fn Command-line Option / 20 \\
                 2.2.2.2 The -geometry Command-line Option / 20 \\
                 2.2.2.3 Specifying Colors / 23 \\
                 2.2.2.4 Using Resources / 24 \\
                 2.2.3 The Startup Script / 25 \\
                 2.2.3.1 The Foreground Process / 26 \\
                 2.3 The Shell Environment / 27 \\
                 2.3.1 Setting the DISPLAY Variable / 27 \\
                 2.3.1.1 Complications with Display Names / 28 \\
                 2.3.2 Redefining the Search Path / 29 \\
                 2.3.2.1 Setting the Search Path for OpenWindows Support
                 / 30 \\
                 2.3.2.2 Setting the Search Path for Mixed Environments
                 / 30 \\
                 2.3.3 xterm Issues / 31 \\
                 2.3.3.1 xterm and Terminal Emulation / 31 \\
                 2.3.3.2 The resize Client / 31 \\
                 2.3.3.3 xterm and the Login Shell (C Shell) / 33 \\
                 2.3.4 Starting Remote Clients / 34 \\
                 2.3.4.1 Starting a Remote Client with rsh / 35 \\
                 2.4 Startup Methods / 37 \\
                 2.4.1 xinit and startx / 38 \\
                 2.4.2 Differences Between .xinitrc and .xsession / 39
                 \\
                 2.5 Related Documentation / 39 \\
                 3: The X Display Manager / 43 \\
                 3.1 xdm Concepts / 44 \\
                 3.2 xdm Configuration Files / 46 \\
                 3.3 xdm the Easy Way / 48 \\
                 3.4 Troubleshooting xdm / 49 \\
                 3.5 Customizing xdm / 51 \\
                 3.5.1 The Master Configuration File (xdm-config) / 51
                 \\
                 3.5.2 Listing X Servers (the Xservers File) / 53 \\
                 3.5.2.1 Xservers Syntax / 53 \\
                 3.5.3 xdm Host Access Control: the Xaccess File (R5
                 Only) / 55 \\
                 3.5.3.1 Direct and Broadcast Access / 56 \\
                 3.5.3.2 Indirect Access and the Chooser / 57 \\
                 3.5.3.3 Using Macros / 59 \\
                 3.5.3.4 Advantages and Disadvantages of the Chooser /
                 59 \\
                 3.5.4 The Xresources File / 60 \\
                 3.5.4.1 Configuring the Login Box / 60 \\
                 3.5.4.2 The xconsole Client / 62 \\
                 3.5.5 Starting Up Individual X Sessions (the Xsession
                 File) / 63 \\
                 3.5.5.1 No Home Directory? (R5) / 64 \\
                 3.5.6 Display Classes / 65 \\
                 3.6 Testing Your xdm Setup / 66 \\
                 3.6.1 Resetting the Keyboard / 67 \\
                 3.6.2 Restarting xdm Using xdm-pid (R4 and Later) / 68
                 \\
                 3.6.3 Rereading xdm Configuration Files (R3) / 68 \\
                 3.7 Permanent Installation of xdm / 69 \\
                 3.8 Related Documentation / 70 \\
                 4: Security / 73 \\
                 4.1 Host-based Access Control / 74 \\
                 4.1.1 The /etc/Xn.hosts File / 74 \\
                 4.1.2 The xhost Client / 75 \\
                 4.1.3 Problems with Host-based Access Control / 76 \\
                 4.2 Access Control with MIT-MAGIC-COOKIE-1 / 77 \\
                 4.2.1 Using MIT-MAGIC-COOKIE-1 with xdm / 78 \\
                 4.2.2 The xauth Program / 79 \\
                 4.2.3 Using MIT-MAGIC-COOKIE-1 with xinit / 81 \\
                 4.2.4 xauth vs. xhost / 82 \\
                 4.3 The XDM-AUTHORIZATION-1 Mechanism (R5) / 83 \\
                 4.4 The SUN-DES-1 Mechanism (R5) / 84 \\
                 4.4.1 Public Key Encryption / 85 \\
                 4.4.2 Prerequisites for Using SUN-DES-1 / 86 \\
                 4.4.3 Using SUN-DES-1 with xdm / 88 \\
                 4.4.4 Using SUN-DES-1 with xinit / 89 \\
                 4.4.5 Adding Another User with SUN-DES-1 / 91 \\
                 4.4.6 xterm and SUN-DES-1 / 92 \\
                 4.4.7 Troubleshooting SUN-DES-1 / 92 \\
                 4.5 xterm and Secure Keyboard / 93 \\
                 4.6 Other Security Issues / 94 \\
                 4.6.1 The Console xterm (R4 and Earlier) / 94 \\
                 4.6.2 The Console and xdm (R5) / 95 \\
                 4.6.3 Hanging the Server Remotely (R3) / 96 \\
                 4.6.4 Reading the Framebuffer (Sun Workstations) / 96
                 \\
                 4.6.5 Removing Files in /tmp / 97 \\
                 4.6.6 The Network Design / 97 \\
                 4.7 Related Documentation / 98 \\
                 5: Font Management / 101 \\
                 5.1 Fonts on the X Window System / 101 \\
                 5.1.1 xlsfonts / 103 \\
                 5.1.2 xfd / 103 \\
                 5.1.3 xfontsel / 104 \\
                 5.1.4 The Font Path / 105 \\
                 5.1.5 The Font Directory File / 106 \\
                 5.1.6 The fonts.scale File (R5 only) / 107 \\
                 5.1.7 Wildcards / 108 \\
                 5.1.8 Aliases / 108 \\
                 5.1.8.1 The FILE\_NAMES\_ALIAS Alias / 109 \\
                 5.2 All About Fonts / 110 \\
                 5.2.1 Bitmap Versus Outline Fonts / 110 \\
                 5.2.2 Font Formats / 111 \\
                 5.2.3 Format Conversion Tools / 112 \\
                 5.3 Adding New Fonts / 114 \\
                 5.3.1 Adding a Single Font / 114 \\
                 5.3.2 Adding Multiple Fonts / 115 \\
                 5.3.2.1 Multiple Font Example / 116 \\
                 5.3.3 Problems with Running Vendor-specific Clients /
                 117 \\
                 5.3.4 DECWindows Examples / 118 \\
                 5.3.4.1 Aliasing / 119 \\
                 5.3.4.2 DECWindows Conversion / 120 \\
                 5.3.5 AIXWindows Example / 121 \\
                 5.3.6 OpenWindows Example / 123 \\
                 5.3.6.1 Aliasing / 124 \\
                 5.3.6.2 OpenWindows Conversion / 125 \\
                 5.3.6.3 Converting from XI 1/NeWS to PCF or SNF / 125
                 \\
                 5.3.6.4 More Conversions / 126 \\
                 5.4 Providing Fonts Over the Network / 127 \\
                 5.5 The R5 Font Server / 127 \\
                 5.5.1 The Configuration File / 128 \\
                 5.5.2 Installing the Font Server / 130 \\
                 5.5.2.1 Testing By Hand / 131 \\
                 5.5.2.2 Changing BSD Boot Files / 131 \\
                 5.5.2.3 Changing System V Boot Files / 132 \\
                 5.5.2.4 Changing AIX Boot Files / 133 \\
                 5.5.3 Font Server Name Syntax / 133 \\
                 5.5.4 Debugging the Font Server / 134 \\
                 5.5.5 Font Server Clients / 135 \\
                 5.5.6 The Font Path and the Font Server / 136 \\
                 5.5.7 Hostname Aliases / 138 \\
                 5.5.8 A Font Server Example / 138 \\
                 5.6 Related Documentation / 140 \\
                 6: Color / 143 \\
                 6.1 Color Specification in Release 4 and Earlier / 144
                 \\
                 6.1.1 RGB Color Names / 144 \\
                 6.1.2 Numeric Color Values / 145 \\
                 6.1.3 Adding Your Own Color Names (RGB) / 146 \\
                 6.1.4 Fixing a Corrupted Color Database / 147 \\
                 6.2 Color Specification in Release 5 (Xcms) / 147 \\
                 6.2.1 Xcms Color Names / 148 \\
                 6.2.2 Adding Your Own Color Names in Xcms / 150 \\
                 6.2.3 Xcms Database Example / 151 \\
                 6.2.4 Device Profiles / 152 \\
                 6.3 Related Documentation / 153 \\
                 7: X Terminals / 157 \\
                 7.1 Buying an X Terminal: What's What / 157 \\
                 7.1.1 Monitors / 157 \\
                 7.1.1.1 Screen Size / 158 \\
                 7.1.1.2 Resolution / 158 \\
                 7.1.1.3 Depth / 159 \\
                 7.1.1.4 Refresh Rate / 159 \\
                 7.1.2 Keyboard and Mouse / 159 \\
                 7.1.3 X Server Software / 160 \\
                 7.1.4 Special Features / 161 \\
                 7.1.5 Memory Configuration / 161 \\
                 7.1.6 Network Interface / 162 \\
                 7.2 X Terminal Setup / 163 \\
                 7.3 Network Setup / 164 \\
                 7.3.1 Getting the IP Address Using RARP / 165 \\
                 7.3.2 Getting Information Using BOOTP / 165 \\
                 7.3.3 Trivial File Transfer Protocol (TFTP) / 167 \\
                 7.3.4 Setting Up the Network on the X Terminal / 168
                 \\
                 7.3.5 Debugging Hints / 168 \\
                 7.3.5.1 Error Messages / 169 \\
                 7.3.5.2 Updating the arp Table / 169 \\
                 7.3.5.3 Name Server Problems / 169 \\
                 7.4 Fonts on X Terminals / 170 \\
                 7.4.1 Font Formats / 170 \\
                 7.4.2 The Font Server (R5) / 171 \\
                 7.4.3 Choosing TFTP or NFS for Font Access / 171 \\
                 7.4.3.1 Reading Fonts Using TFTP / 171 \\
                 7.4.3.2 Reading Fonts Using NFS / 172 \\
                 7.5 Configuring for the X Display Manager / 173 \\
                 7.5.1 Configuring the X Terminal for xdm / 173 \\
                 7.5.2 Configuring an R5 Host / 174 \\
                 7.5.3 Configuring an R4 Host / 174 \\
                 7.5.4 Configuring xdm Without XDMCP / 174 \\
                 7.5.5 Setting Up Server Access Control / 175 \\
                 7.6 Remote Configuration of X Terminals / 175 \\
                 7.6.1 Remote Configuration on NCD Terminals / 176 \\
                 7.6.2 Remote Configuration on Visual Terminals / 177
                 \\
                 7.6.3 Remote Configuration on Tektronix Terminals / 178
                 \\
                 7.7 Reconfiguring the Host / 178 \\
                 7.7.1 Increasing the Number of Processes / 178 \\
                 7.7.2 Increasing the Number of Pseudo-ttys / 179 \\
                 7.7.3 Increasing the Amount of Swap Space / 180 \\
                 7.7.3.1 Swapping to a File / 180 \\
                 7.7.3.2 Swapping to a Disk / 180 \\
                 7.8 Related Documentation / 181 \\
                 8: Building the X Window System / 185 \\
                 8.1 Installation Issues / 185 \\
                 8.1.1 Should You Use MIT Source? / 185 \\
                 8.1.2 Types of Vendor-supplied X Distributions / 186
                 \\
                 8.1.2.1 X from Your OS Vendor / 187 \\
                 8.1.2.2 X from a Third Party / 187 \\
                 8.1.3 X Source Code from MIT / 188 \\
                 8.1.4 Complete or Client-only Distribution? / 189 \\
                 8.1.5 Installing Multiple X Releases / 189 \\
                 8.2 Source Preparation / 191 \\
                 8.2.1 Do You Have Enough Disk Space? / 191 \\
                 8.2.2 Is Your Platform Supported? / 192 \\
                 8.2.3 Applying OS Patches / 194 \\
                 8.2.4 Applying X Patches / 194 \\
                 8.2.5 Creating a Link Tree (Optional) / 196 \\
                 8.3 Simplest Case Build / 197 \\
                 8.4 Host Problems / 198 \\
                 8.4.1 Disk Space / 198 \\
                 8.4.1.1 Changing the tmp Directory Using TMPDIR (Ultrix
                 and HP-UX) / 199 \\
                 8.4.1.2 Changing the tmp Directory Using -temp (SunOS)
                 / 200 \\
                 8.4.2 Shared Library Installation (SunOS) / 200 \\
                 8.4.3 NFS Installation / 201 \\
                 8.4.3.1 NFS Installation Without Root Access / 201 \\
                 8.4.3.2 Installation Over the Network (rdist) / 203 \\
                 8.4.4 Installing the termcap or terminfo Definition for
                 xterm / 203 \\
                 8.5 Simple Configuration / 204 \\
                 8.5.1 Configuration Parameters / 205 \\
                 8.5.1.1 site.def / 205 \\
                 8.5.1.2 The ProjectRoot Flag / 207 \\
                 8.5.1.3 The Platform Configuration File (platform.cf) /
                 208 \\
                 8.5.2 Configuration Example 1 / 210 \\
                 8.5.3 Configuration Example 2 / 211 \\
                 8.5.4 Configuration Example 3 / 212 \\
                 8.5.5 Configuration Example 4 / 212 \\
                 8.5.6 Configuration Example 5 / 213 \\
                 8.5.7 Other Build Flags / 213 \\
                 8.5.7.1 xterm Build Flags / 214 \\
                 8.6 Building Programs After X Is Installed / 214 \\
                 8.6.1 xmkmf / 214 \\
                 8.6.2 Include Files / 215 \\
                 8.6.3 Libraries / 216 \\
                 8.7 More About imake / 216 \\
                 8.7.1 The make Program / 216 \\
                 8.7.2 The Preprocessor / 217 \\
                 8.7.3 Imake Syntax / 219 \\
                 8.7.3.1 Comments in imake / 219 \\
                 8.7.3.2 Multi-line Macros (<at><at>) / 220 \\
                 8.7.3.3 Concatenating Macros / 221 \\
                 8.7.3.4 Dealing with Tabs / 222 \\
                 8.7.4 imake Configuration Files / 222 \\
                 8.7.4.1 A Quick Tour of Files Used by imake / 223 \\
                 8.7.5 Using imake to Build X11 / 224 \\
                 8.8 Porting Hints / 226 \\
                 8.8.1 Undefined Symbols or Functions / 226 \\
                 8.8.1.1 Missing Header Files / 226 \\
                 8.8.1.2 Missing Function Definitions / 226 \\
                 8.8.2 Searching for Preprocessor Symbols / 228 \\
                 8.9 Related Documentation / 230 \\
                 Appendix A: Useful Things to Know / 233 \\
                 A.1 The comp.windows.x Newsgroup / 233 \\
                 A.2 How to ftp a File / 234 \\
                 A.2.1 Getting Files Using ftpmail / 235 \\
                 A.2.2 BITFTP / 237 \\
                 A.3 The xstuff Mail Archive Server / 237 \\
                 A.4 Unpacking Files / 238 \\
                 A.5 Making a Filesystem Available via NFS / 239 \\
                 A.6 How to Add a Host / 239 \\
                 A.6.1 Adding a Host to/etc/hosts / 239 \\
                 A.6.2 Adding a Host Using NIS / 240 \\
                 A.6.3 Adding a Host Using DNS / 240 \\
                 A.7 Adding an Ethernet Address / 242 \\
                 A.8 Printing Documentation in the MIT X Distribution /
                 242 \\
                 A.9 Converting a Number Into Hexadecimal and Back / 243
                 \\
                 A.10 Configuring a Sun as an X terminal / 243 \\
                 A.11 Using More than One Frame Buffer Under SunOS / 244
                 \\
                 Appendix B: Compiling: Public Domain Software / 247 \\
                 B.1 Finding the Sources / 247 \\
                 B.1.1 Using an Archie Server / 248 \\
                 B.1.2 Get the FAQ / 250 \\
                 B.1.3 The Usual Suspects / 250 \\
                 B.2 An Example: xarchie / 251 \\
                 B.2.1 Getting the xarchie Sources / 251 \\
                 B.2.2 Untarring the Sources / 252 \\
                 B.2.3 Editing the Imakefile / 254 \\
                 B.2.4 Compiling the Source / 255 \\
                 B.3 Using Patches / 259 \\
                 B.4 Another Example: xkeycaps / 264 \\
                 B.5 Related Documentation / 268 \\
                 Appendix C: X on Non-UNIX Platforms / 271 \\
                 C.1 X on DOS-based PCs / 272 \\
                 C.1.1 Requirements for PC X Servers / 272 \\
                 C.1.2 Installing and Configuring PC X Servers / 273 \\
                 C.1.3 Problems Particular to PC X Servers / 274 \\
                 C.2 X on Macintosh Computers / 275 \\
                 C.2.1 Macintosh-based X Servers / 275 \\
                 C.2.2 MacTCP and the Communications Toolbox / 276 \\
                 C.3 X on NeXT Computers / 277 \\
                 Appendix D: Resources and Keysym Mappings / 281 \\
                 D.1 Using Resources / 281 \\
                 D.1.1 Resource Definition Syntax / 281 \\
                 D.1.1.1 Loose and Tight Bindings / 282 \\
                 D.1.1.2 The -name Command-line Option / 283 \\
                 D.1.1.3 xterm Versus XTerm / 283 \\
                 D.1.2 Where Resources Are Defined / 285 \\
                 D.1.3 Advantages of xrdb / 287 \\
                 D.1.4 Translation Tables / 288 \\
                 D.2 Defining Keys and Button Presses With xmodmap / 290
                 \\
                 D.2.1 Using xev to Learn Keysym Mappings / 292 \\
                 D.3 Related Documentation / 293 \\
                 Appendix E: The Components of X Products / 297 \\
                 E.1 MIT X11 Release 5 / 298 \\
                 E.2 OSF/Motif / 299 \\
                 E.3 Sun Open Windows / 300 \\
                 E.4 DECWindows / 301 \\
                 E.5 AIXWindows / 302 \\
                 E.6 Silicon Graphics / 302 \\
                 E.7 A Guide to X11 Libraries / 303 \\
                 Appendix F: Getting X11 / 307 \\
                 F.1 Where Can I Get X11R5? / 307 \\
                 F.2 Where Can I Get Patches to X11R5? / 311 \\
                 F.3 Where Can I Get X11R4? / 311 \\
                 Appendix G: Error Messages / 315 \\
                 G.1 X Errors / 315 \\
                 G.2 UNIX Errors / 318 \\
                 G.3 Compilation Errors / 320",
}

@Book{Muir:1960:TTD,
  author =       "{Sir} Thomas Muir",
  title =        "A Treatise on the Theory of Determinants",
  publisher =    pub-DOVER,
  address =      pub-DOVER:adr,
  pages =        "766",
  year =         "1960",
  LCCN =         "QA191 .M85 1960",
  bibdate =      "Fri Jul 22 08:34:06 1994",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/subjects/matrix-analysis-2ed.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Corrected printing of the 1933 edition, revised and
                 enlarged by William H. Metzler.",
  acknowledgement = ack-nhfb,
  author-dates = "1844--1934",
}

@Book{Muller:1997:EFA,
  author =       "Jean-Michel Muller",
  title =        "Elementary Functions: Algorithms and Implementation",
  publisher =    pub-BIRKHAUSER,
  address =      pub-BIRKHAUSER:adr,
  pages =        "xv + 204",
  year =         "1997",
  ISBN =         "0-8176-3990-X",
  ISBN-13 =      "978-0-8176-3990-7",
  LCCN =         "QA331.M866 1997",
  bibdate =      "Fri Jul 25 12:00:55 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cordic.bib;
                 https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/maple-extract.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$59.95",
  URL =          "http://www.birkhauser.com/cgi-win/ISBN/0-8176-3990-X;
                 http://www.ens-lyon.fr/~jmmuller/book_functions.html",
  abstract =     "The elementary functions (sine, cosine, tan,
                 exponentials, and logarithms) are the most commonly
                 used mathematical functions in science and engineering.
                 Computing these functions quickly and accurately is a
                 major goal in computer arithmetic. This new book gives
                 the concepts and background necessary to understand and
                 build algorithms for computing these functions,
                 presenting and structuring the algorithms
                 (hardware-oriented as well as software-oriented), and
                 discusses issues related to the accurate floating-point
                 implementation. The purpose is not to give ``cookbook
                 recipes'' that allow one to implement some given
                 function, but to provide the reader with the knowledge
                 that is necessary to build, or adapt, algorithms to
                 their specific computing environment. The book provides
                 an up-to-date presentation of the information needed to
                 understand and accurately use mathematical functions
                 and algorithms in computational work and design.
                 Graduates, professionals and researchers in scientific
                 computing, software engineering and computer
                 engineering will find the book a useful reference and
                 resource.",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "1: Introduction \\
                 2: Computer arithmetic \\
                 I: Algorithms based on polynomial approximation and/or
                 table lookup \\
                 3: Polynomial approximations \\
                 4: Table-based methods \\
                 II: Shift-and-Add algorithms \\
                 5: Shift-and-Add algorithms 6: The CORDIC algorithm \\
                 7: Other shift-and-add algorithms \\
                 III: Range reduction, final rounding and exceptions \\
                 8: Range reduction \\
                 9: Final rounding \\
                 10: Miscellaneous",
  tableofcontents = "1 Introduction / 1 \\
                 2 Computer Arithmetic / 9 \\
                 2.1 Floating-Point Arithmetic / 9 \\
                 2.1.1 Floating-point formats / 9 \\
                 2.1.2 Rounding modes / 10 \\
                 2.1.3 Subnormal numbers and exceptions / 12 \\
                 2.1.4 ULPs / 13 \\
                 2.1.5 Testing your computational environment / 13 \\
                 2.2 Redundant Number Systems / 13 \\
                 2.2.1 Signed-digit number systems / 14 \\
                 2.2.2 Radix-2 redundant number systems / 15 \\
                 I Algorithms Based on Polynomial Approximation and/or
                 Table Lookup / 19 \\
                 3 Polynomial Approximations / 21 \\
                 3.1 Least Squares Polynomial Approximations / 22 \\
                 3.1.1 Legendre polynomials / 23 \\
                 3.1.2 Chebyshev polynomials / 23 \\
                 3.1.3 Jacobi polynomials / 23 \\
                 3.2 Least Maximum Approximations / 24 \\
                 3.3 Speed of Convergence / 31 \\
                 3.4 Rational Approximations / 34 \\
                 3.5 Actual Computation / 38 \\
                 3.6 Example: the Cyrix FasMath Processor / 41 \\
                 3.7 Algorithms and Architectures / 43 \\
                 3.7.1 The E-Method / 45 \\
                 3.7.2 Estrin's Method / 47 \\
                 3.8 Miscellaneous / 47 \\
                 4 Table-Based Methods / 51 \\
                 4.1 Introduction / 51 \\
                 4.2 Table-Driven Algorithms / 53 \\
                 4.2.1 Tang's algorithm for $\exp(x)$ in IEEE
                 floating-point arithmetic / 55 \\
                 4.2.2 $\ln(x)$ on $[1,2]$ / 57 \\
                 4.2.3 $\sin(x)$ on $[0,\pi/4]$ / 58 \\
                 4.3 Gal's Accurate Tables Method / 58 \\
                 4.4 Methods Requiring Specialized Hardware / 62 \\
                 4.4.1 Wong and Goto, logarithm / 62 \\
                 4.4.2 Wong and Goto, exponential / 65 \\
                 II Shift-and-Add Algorithms / 69 \\
                 5 Shift-and-Add algorithms / 71 \\
                 5.1 The Restoring and Nonrestoring Algorithms / 73 \\
                 5.2 Simple Algorithms for Exponentials and Logarithms /
                 77 \\
                 5.2.1 The restoring algorithm for exponentials / 77 \\
                 5.2.2 The restoring algorithm for logarithms / 79 \\
                 5.3 Faster Algorithms / 81 \\
                 5.3.1 Faster computation of exponentials / 81 \\
                 5.3.2 Faster computation of logarithms / 87 \\
                 5.4 Baker's Predictive Algorithm / 90 \\
                 5.5 Bibliographic notes / 98 \\
                 6 The CORDIC Algorithm / 101 \\
                 6.1 Introduction / 101 \\
                 6.2 The Conventional Iteration / 101 \\
                 6.3 Scale Factor Compensation / 107 \\
                 6.4 CORDIC With Redundant Number Systems / 109 \\
                 6.4.1 Signed-digit implementation / 111 \\
                 6.4.2 Carry-save implementation / 111 \\
                 6.4.3 The variable scale factor problem / 112 \\
                 6.5 The Double Rotation Method / 112 \\
                 6.6 Branching CORDIC / 115 \\
                 6.7 Differential CORDIC / 118 \\
                 6.8 Computation of $\cos^{-1}$ and $\sin^{-1}$ / 122
                 \\
                 6.9 Variations on CORDIC / 124 \\
                 7 Other Shift-and-Add Algorithms / 127 \\
                 7.1 High-Radix Algorithms / 127 \\
                 7.1.1 Ercegovac's radix-16 algorithms / 127 \\
                 7.2 The BKM Algorithm / 131 \\
                 7.2.1 The BKM iteration / 133 \\
                 7.2.2 Computation of the exponential function (E-mode)
                 / 133 \\
                 7.2.3 Computation of the logarithm function (L-mode) /
                 137 \\
                 7.2.4 Application to the computation of elementary
                 functions / 138 \\
                 III Range Reduction, Final Rounding and Exceptions /
                 141 \\
                 8 Range Reduction / 143 \\
                 8.1 Introduction / 143 \\
                 8.2 Cody and Waite's Method for Range Reduction / 148
                 \\
                 8.3 Worst Cases for Range Reduction / 149 \\
                 8.3.1 A few basic notions on continued fractions / 149
                 \\
                 8.3.2 Finding worst cases using continued fractions /
                 151 \\
                 8.4 The Payne and Hanek Algorithm / 154 \\
                 8.5 The Modular Algorithm / 158 \\
                 8.5.1 Fixed-point reduction / 158 \\
                 8.5.2 Floating-point reduction / 161 \\
                 8.5.3 Architectures for Modular Reduction / 161 \\
                 9 Final Rounding / 163 \\
                 9.1 Introduction / 163 \\
                 9.2 Monotonicity / 164 \\
                 9.3 Exact Rounding: Presentation of the Problem / 165
                 \\
                 9.4 Some Experiments / 168 \\
                 9.5 A ``Probabilistic'' Approach / 168 \\
                 9.6 Upper Bounds on $m$ / 171 \\
                 9.6.1 Frequency of failures / 173 \\
                 9.6.2 Computing with one million bits / 173 \\
                 10 Miscellaneous / 175 \\
                 10.1 Exceptions / 175 \\
                 10.1.1 NaNs / 176 \\
                 10.1.2 Exact results / 177 \\
                 10.2 Notes on $x^y$ / 178 \\
                 10.3 Multiple Precision / 180",
}

@Book{Muller:2006:EFA,
  author =       "Jean-Michel Muller",
  booktitle =    "Elementary Functions: Algorithms and Implementation",
  title =        "Elementary Functions: Algorithms and Implementation",
  publisher =    pub-BIRKHAUSER,
  address =      pub-BIRKHAUSER:adr,
  edition =      "Second",
  pages =        "xxii + 266",
  year =         "2006",
  ISBN =         "0-8176-4372-9",
  ISBN-13 =      "978-0-8176-4372-0",
  LCCN =         "QA331 .M866 2006",
  bibdate =      "Fri Jul 25 12:00:55 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cordic.bib;
                 https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/maple-extract.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  price =        "US\$59.95",
  URL =          "http://perso.ens-lyon.fr/jean-michel.muller/SecondEdition.html;
                 http://www.springer.com/sgw/cda/frontpage/0,,4-40109-22-72377986-0,00.html",
  acknowledgement = ack-nhfb,
  subject =      "Functions; Data processing; Algorithms",
  tableofcontents = "Preface to the second edition \\
                 Preface to the first edition \\
                 Introduction / 1--7 \\
                 Some basic things about computer arithmetic / 9--24 \\
                 Part I. Algorithms based on polynomial approximation
                 and/or table lookup, multiple-precision evaluation of
                 functions / 25--25 \\
                 Polynomial or rational approximations / 27--66 \\
                 Table-based methods / 67--87 \\
                 Multiple-precision evaluation of functions / 89--100
                 \\
                 Part II. Shift-and-add algorithms / 101--101 \\
                 Introduction to shift-and-add algorithms / 103--131 \\
                 The CORDIC algorithm / 133--156 \\
                 Some other shift-and-add algorithms / 157--169 \\
                 Part III. Range reduction, final rounding and
                 exceptions / 171--171 \\
                 Range reduction / 173--191 \\
                 Final rounding / 193--216 \\
                 Miscellaneous / 217--223 \\
                 Examples of implementation / 225--232 \\
                 Bibliography / 233--259 \\
                 Index / 261--265",
}

@Book{Muller:2006:SVP,
  author =       "Al Muller and Andy Jones and David E. Williams and
                 Stephen Beaver and David A. Payne and Jeremy Pries and
                 David E. Hart",
  title =        "Scripting {VMware} Power Tools: Automating Virtual
                 Infrastructure Administration",
  publisher =    pub-SYNGRESS,
  address =      pub-SYNGRESS:adr,
  pages =        "xviii + 398",
  year =         "2006",
  ISBN =         "1-59749-059-8",
  ISBN-13 =      "978-1-59749-059-7",
  LCCN =         "QA76.76.O63 S385 2006eb",
  bibdate =      "Sat Oct 14 17:53:01 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 http://www.oreilly.com/catalog/1597490598/",
  abstract =     "\booktitle{Scripting VMware Power Tools} shows readers
                 scripting techniques using both ESX and Linux commands
                 to automate administrative tasks of ESX Server. It
                 covers VMware ESX Server native tools and discusses in
                 detail the different scripting APIs and how they can be
                 used to provide some very useful, practical, and
                 time-saving tools to manage a virtual infrastructure.
                 From virtual server provisioning to backups, and
                 everything in between, this book is a one-stop shop for
                 virtual tools.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Scripted installation \\
                 2: An introduction to ESX native tools and how to use
                 them \\
                 3: Scripting and programming for the virtual
                 infrastructure \\
                 4: Building a VM \\
                 5: Modifying VMs \\
                 6: Instant disk: how to P2V for free \\
                 7: Scripting hot backups and recovery for virtual
                 machines \\
                 8: Other cool tools and tricks \\
                 Appendix A: All scripts and program source",
}

@Book{Muller:2010:HFP,
  author =       "Jean-Michel Muller and Nicolas Brisebarre and Florent
                 de Dinechin and Claude-Pierre Jeannerod and Vincent
                 Lef{\`e}vre and Guillaume Melquiond and Nathalie Revol
                 and Damien Stehl{\'e} and Serge Torres",
  title =        "Handbook of Floating-Point Arithmetic",
  publisher =    pub-BIRKHAUSER-BOSTON,
  address =      pub-BIRKHAUSER-BOSTON:adr,
  pages =        "xxiii + 572",
  year =         "2010",
  DOI =          "https://doi.org/10.1007/978-0-8176-4705-6",
  ISBN =         "0-8176-4704-X (hardcover), 0-8176-4705-8 (e-book)",
  ISBN-13 =      "978-0-8176-4704-9 (hardcover), 978-0-8176-4705-6
                 (e-book)",
  LCCN =         "QA76.9.C62 H36 2010",
  MRnumber =     "MR2568265",
  bibdate =      "Thu Jan 27 16:18:58 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cordic.bib;
                 https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/mathcw.bib",
  price =        "US\$90 (est.)",
  acknowledgement = ack-nhfb,
  tableofcontents = "Preface \\
                 List of Figures \\
                 List of Tables \\
                 I Introduction, Basic Definitions, and Standards \\
                 1 Introduction \\
                 2 Definitions and Basic Notions \\
                 3 Floating-Point Formats and Environment \\
                 II Cleverly Using Floating-Point Arithmetic \\
                 4 Basic Properties and Algorithms \\
                 5 The Fused Multiply-Add Instruction \\
                 6 Enhanced Floating-Point Sums, Dot Products, and
                 Polynomial Values \\
                 7 Languages and Compilers \\
                 III Implementing Floating-Point Operators \\
                 8 Algorithms for the Five Basic Operations \\
                 9 Hardware Implementation of Floating-Point Arithmetic
                 \\
                 10 Software Implementation of Floating-Point
                 Arithmetic",
}

@Book{Muller:2016:EFA,
  author =       "Jean-Michel Muller",
  title =        "Elementary Functions: Algorithms and Implementation",
  publisher =    pub-BIRKHAUSER-BOSTON,
  address =      pub-BIRKHAUSER-BOSTON:adr,
  edition =      "Third",
  pages =        "xxv + 283",
  year =         "2016",
  DOI =          "https://doi.org/10.1007/978-1-4899-7983-4",
  ISBN =         "1-4899-7981-6 (print), 1-4899-7983-2 (e-book)",
  ISBN-13 =      "978-1-4899-7981-0 (print), 978-1-4899-7983-4
                 (e-book)",
  LCCN =         "QA331 .M866 2016",
  bibdate =      "Sun Dec 04 15:12:36 2016",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cordic.bib;
                 https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/maple-extract.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/mathcw.bib;
                 https://www.math.utah.edu/pub/tex/bib/numana2010.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "This textbook presents the concepts and tools
                 necessary to understand, build, and implement
                 algorithms for computing elementary functions (e.g.,
                 logarithms, exponentials, and the trigonometric
                 functions). Both hardware- and software-oriented
                 algorithms are included, along with issues related to
                 accurate floating-point implementation. This third
                 edition has been updated and expanded to incorporate
                 the most recent advances in the field, new elementary
                 function algorithms, and function software. After a
                 preliminary chapter that briefly introduces some
                 fundamental concepts of computer arithmetic, such as
                 floating-point arithmetic and redundant number systems,
                 the text is divided into three main parts. Part I
                 considers the computation of elementary functions using
                 algorithms based on polynomial or rational
                 approximations and using table-based methods; the final
                 chapter in this section deals with basic principles of
                 multiple-precision arithmetic. Part II is devoted to a
                 presentation of shift-and-add algorithms
                 (hardware-oriented algorithms that use additions and
                 shifts only). Issues related to accuracy, including
                 range reduction, preservation of monotonicity, and
                 correct rounding, as well as some examples of
                 implementation are explored in Part III. Numerous
                 examples of command lines and full programs are
                 provided throughout for various software packages,
                 including Maple, Sollya, and Gappa. New to this edition
                 are an in-depth overview of the IEEE-754-2008 standard
                 for floating-point arithmetic; a section on using
                 double- and triple-word numbers; a presentation of new
                 tools for designing accurate function software; and a
                 section on the Toom--Cook family of multiplication
                 algorithms. The techniques presented in this book will
                 be of interest to implementors of elementary function
                 libraries or circuits and programmers of numerical
                 applications. Additionally, graduate and advanced
                 undergraduate students, professionals, and researchers
                 in scientific computing, numerical analysis, software
                 engineering, and computer engineering will find this a
                 useful reference and resource.",
  acknowledgement = ack-nhfb,
  subject =      "Functions; Data processing; Algorithms",
  tableofcontents = "Introduction \\
                 Introduction to Computer Arithmetic \\
                 Part I: Algorithms Based on Polynomial Approximation
                 and/or Table Lookup, Multiple-Precision Evaluation of
                 Functions \\
                 The Classical Theory of Polynomial or Rational
                 Approximations \\
                 Polynomial Approximations with Special Constraints \\
                 Polynomial Evaluation \\
                 Table-Based Methods \\
                 Multiple-Precision Evaluation of Functions \\
                 Part II: Shift-and-Add Algorithms \\
                 Introduction to Shift-and-Add Algorithms \\
                 The CORDIC Algorithm \\
                 Some Other Shift-and-Add Algorithms \\
                 Part III: Range Reduction, Final Rounding, and
                 Exceptions \\
                 Range Reduction \\
                 Final Rounding \\
                 Miscellaneous \\
                 Examples of Implementation \\
                 References \\
                 Index",
}

@Book{Muller:2018:HFP,
  author =       "Jean-Michel Muller and Nicolas Brunie and Florent de
                 Dinechin and Claude-Pierre Jeannerod and Mioara Joldes
                 and Vincent Lef{\`e}vre and Guillaume Melquiond and
                 Nathalie Revol and Serge Torres",
  title =        "Handbook of Floating-Point Arithmetic",
  publisher =    pub-BIRKHAUSER,
  address =      pub-BIRKHAUSER:adr,
  edition =      "Second",
  pages =        "xxv + 627",
  year =         "2018",
  DOI =          "https://doi.org/10.1007/978-3-319-76526-6",
  ISBN =         "3-319-76525-6, 3-319-76526-4 (e-book)",
  ISBN-13 =      "978-3-319-76525-9, 978-3-319-76526-6 (e-book)",
  LCCN =         "QA76.9.C62",
  bibdate =      "Fri Jun 1 06:59:01 MDT 2018",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/cordic.bib;
                 https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "This handbook aims to provide a complete overview of
                 modern floating-point arithmetic. This includes a
                 detailed treatment of the current (IEEE-754) and next
                 (preliminarily called IEEE-754R) standards for
                 floating-point arithmetic.",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "Introduction / 3--14 \\
                 Definitions and Basic Notions / 15--45 \\
                 Floating-Point Formats and Environment / 47--93 \\
                 Basic Properties and Algorithms / 97--162 \\
                 Enhanced Floating-Point Sums, Dot Products, and
                 Polynomial Values / 163--192 \\
                 Languages and Compilers / 193--230 \\
                 Algorithms for the Basic Operations / 233--266 \\
                 Hardware Implementation of Floating-Point Arithmetic /
                 267--320 \\
                 Software Implementation of Floating-Point Arithmetic /
                 321--374 \\
                 Evaluating Floating-Point Elementary Functions /
                 375--433 \\
                 Complex Numbers / 437--452 \\
                 Interval Arithmetic / 453--477 \\
                 Verifying Floating-Point Algorithms / 479--511 \\
                 Extending the Precision / 513--552",
  subject =      "Floating-point arithmetic; Handbooks, manuals, etc;
                 Computer arithmetic; COMPUTERS / Computer Literacy;
                 COMPUTERS / Computer Science; COMPUTERS / Data
                 Processing; COMPUTERS / Hardware / General; COMPUTERS /
                 Information Technology; COMPUTERS / Machine Theory;
                 COMPUTERS / Reference.",
  tableofcontents = "Intro \\
                 Contents \\
                 List of Figures \\
                 List of Tables \\
                 Preface \\
                 I Introduction, Basic Definitions, and Standards \\
                 1 Introduction \\
                 1.1 Some History \\
                 1.2 Desirable Properties \\
                 1.3 Some Strange Behaviors \\
                 1.3.1 Some famous bugs \\
                 1.3.2 Difficult problems \\
                 1.3.2.1 A sequence that seems to converge to a wrong
                 limit \\
                 1.3.2.2 The Chaotic Bank Society \\
                 1.3.2.3 Rump's example \\
                 2 Definitions and Basic Notions \\
                 2.1 Floating-Point Numbers \\
                 2.1.1 Main definitions \\
                 2.1.2 Normalized representations, normal and subnormal
                 numbers \\
                 2.1.3 A note on underflow \\
                 2.1.4 Special floating-point data \\
                 2.2 Rounding \\
                 2.2.1 Rounding functions \\
                 2.2.2 Useful properties \\
                 2.3 Tools for Manipulating Floating-Point Errors \\
                 2.3.1 Relative error due to rounding \\
                 2.3.2 The ulp function \\
                 2.3.3 Link between errors in ulps and relative errors
                 \\
                 2.3.3.1 Converting from errors in ulps to relative
                 errors \\
                 2.3.3.2 Converting from relative errors to errors in
                 ulps \\
                 2.3.3.3 Loss of information during these conversions
                 \\
                 2.3.4 An example: iterated products \\
                 2.4 The Fused Multiply-Add (FMA) Instruction \\
                 2.5 Exceptions \\
                 2.6 Lost and Preserved Properties of Real Arithmetic
                 \\
                 2.7 Note on the Choice of the Radix \\
                 2.7.1 Representation errors \\
                 2.7.2 A case for radix 10 \\
                 2.8 Reproducibility \\
                 3 Floating-Point Formats and Environment \\
                 3.1 The IEEE 754-2008 Standard \\
                 3.1.1 Formats \\
                 3.1.1.1 Binary interchange format encodings \\
                 3.1.1.2 Decimal interchange format encodings \\
                 3.1.1.3 Larger formats \\
                 3.1.1.4 Extended and extendable precisions \\
                 3.1.1.5 Little-endian, big-endian \\
                 3.1.2 Attributes and rounding \\
                 3.1.2.1 Rounding direction attributes \\
                 3.1.2.2 Alternate exception-handling attributes \\
                 3.1.2.3 Preferred width attributes \\
                 3.1.2.4 Value-changing optimization attributes \\
                 3.1.2.5 Reproducibility attributes \\
                 3.1.3 Operations specified by the standard \\
                 3.1.3.1 Arithmetic operations and square root \\
                 3.1.3.2 Remainders \\
                 3.1.3.3 Preferred exponent for arithmetic operations in
                 the decimal format \\
                 3.1.3.4 scaleB and logB \\
                 3.1.3.5 Miscellaneous \\
                 3.1.4 Comparisons \\
                 3.1.5 Conversions to/from string representations \\
                 3.1.6 Default exception handling \\
                 3.1.6.1 Invalid operation \\
                 3.1.6.2 Division by zero \\
                 3.1.6.3 Overflow \\
                 3.1.6.4 Underflow \\
                 3.1.6.5 Inexact \\
                 3.1.7 Special values \\
                 3.1.7.1 NaN: Not a Number \\
                 3.1.7.2 Arithmetic of infinities and zeros \\
                 3.1.8 Recommended functions \\
                 3.2 On the Possible Hidden Use of a Higher Internal
                 Precision \\
                 3.3 Revision of the IEEE 754-2008 Standard \\
                 3.4 Floating-Point Hardware in Current Processors \\
                 3.4.1 The common hardware denominator \\
                 3.4.2 Fused multiply-add \\
                 3.4.3 Extended precision and 128-bit formats \\
                 3.4.4 Rounding and precision control \\
                 3.4.5 SIMD instructions \\
                 3.4.6 Binary16 (half-precision) support \\
                 3.4.7 Decimal arithmetic \\
                 3.4.8 The legacy x87 processor \\
                 3.5 Floating-Point Hardware in Recent Graphics
                 Processing Units \\
                 3.6 IEEE Support in Programming Languages \\
                 3.7 Checking the Environment \\
                 3.7.1 MACHAR \\
                 3.7.2 Paranoia \\
                 \ldots{} \\
                 Basic Properties and Algorithms \\
                 Enhanced Floating-Point Sums, Dot Products, and
                 Polynomial Values \\
                 Languages and Compilers \\
                 Algorithms for the Basic Operations \\
                 Hardware Implementation of Floating-Point Arithmetic
                 \\
                 Software Implementation of Floating-Point Arithmetic
                 \\
                 Evaluating Floating-Point Elementary Functions \\
                 Complex Numbers \\
                 Interval Arithmetic \\
                 Verifying Floating-Point Algorithms \\
                 Extending the Precision",
}

@Book{Mundy:2017:CGU,
  author =       "Liza Mundy",
  title =        "Code Girls: the Untold Story of the {American} Women
                 Code Breakers of {World War II}",
  publisher =    "Hachette Books",
  address =      "New York, NY, USA",
  pages =        "xiv + 416",
  year =         "2017",
  ISBN =         "0-316-35253-5 (hardcover), 0-316-43989-4 (large
                 print), 1-4789-2270-2 (audio book), 1-4789-2271-0
                 (audio download), 0-316-35255-1 (e-book)",
  ISBN-13 =      "978-0-316-35253-6 (hardcover), 978-0-316-43989-3
                 (large print), 978-1-4789-2270-4 (audio book),
                 978-1-4789-2271-1 (audio download), 978-0-316-35255-0
                 (e-book)",
  LCCN =         "D810.C88 M86 2017",
  bibdate =      "Sat Dec 23 09:01:41 MST 2017",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "Recruited by the U.S. Army and Navy from small towns
                 and elite colleges, more than ten thousand women served
                 as codebreakers during World War II. While their
                 brothers and boyfriends took up arms, these women moved
                 to Washington and learned the meticulous work of
                 code-breaking. Their efforts shortened the war, saved
                 countless lives, and gave them access to careers
                 previously denied to them. A strict vow of secrecy
                 nearly erased their efforts from history; now, through
                 dazzling research and interviews with surviving code
                 girls, bestselling author Liza Mundy brings to life
                 this riveting and vital story of American courage,
                 service, and scientific accomplishment.",
  acknowledgement = ack-nhfb,
  author-dates = "1960--",
  subject =      "World War, 1939-1945; Cryptography; Participation,
                 Female; Cryptographers; United States; History; 20th
                 century",
  tableofcontents = "Introduction: ``Your country needs you, young
                 ladies'' \\
                 Part I. ``In the event of total war women will be
                 needed'' \\
                 Twenty-eight acres of girls \\
                 ``This is a man's size job, but I seem to be getting
                 away with it'' \\
                 The most difficult problem \\
                 ``So many girls in one place'' \\
                 Part II. ``Over all this vast expanse of waters Japan
                 was supreme'' \\
                 ``It was heart-rending'' \\
                 ``Q for communications'' \\
                 The forlorn shoe \\
                 ``Hell's half-acre'' \\
                 ``It was only human to complain'' \\
                 Pencil-pushing mamas sink the shipping of Japan \\
                 Part III. The tide turns \\
                 Sugar camp \\
                 ``All my love, Jim'' \\
                 ``Enemy landing at the mouth of the Seine'' \\
                 Teedy \\
                 The surrender message \\
                 Good-bye to Crow \\
                 Epilogue: The mitten",
}

@Book{Murray:1977:CWW,
  author =       "K. M. Elisabeth (Katherine Maud Elisabeth) Murray",
  title =        "Caught in the Web of Words: {James A. H. Murray} and
                 the {Oxford English} Dictionary",
  publisher =    pub-YALE,
  address =      pub-YALE:adr,
  pages =        "386",
  year =         "1977",
  ISBN =         "0-300-02131-3, 0-300-06310-5 (paperback)",
  ISBN-13 =      "978-0-300-02131-8, 978-0-300-06310-3 (paperback)",
  LCCN =         "PE64.M8 M78",
  bibdate =      "Wed Jan 11 07:01:10 MST 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  price =        "US\$15.00",
  acknowledgement = ack-nhfb,
  author-dates = "1909--1998",
  libnote =      "Not in my library.",
  subject =      "Murray, James Augustus Henry; Sir; English language;
                 Lexicography; History; 19th century; New English
                 dictionary on historical principles; Encyclopedias and
                 dictionaries; History and criticism; Lexicographers;
                 Great Britain; Biography; Oxford English dictionary",
  subject-dates = "1837--1915",
  tableofcontents = "Illustrations \\
                 Preface \\
                 Acknowledgements \\
                 Prologue / 1 \\
                 `Round O and Crooked S': The Formative Years / 3 \\
                 The Great Learning Period: Schoolmaster and Citizen /
                 27 \\
                 The Discovery of Anglo-Saxon / 45 \\
                 New Life in London / 60 \\
                 Furnivall's Henchman / 87 \\
                 Mill Hill: The Arcadian Years / 101 \\
                 The Web is Spun: Abortive Negotiations with Macmillan /
                 133 \\
                 The Fly is Caught: Negotiations with the Delegates of
                 the Oxford University Press / 148 \\
                 `Sundry Shocks and Serious Jars': The Raw Materials for
                 the Dictionary / 171 \\
                 Hoc Unum Facio: Solving the Technical Problems / 189
                 \\
                 The Triple Nightmare: Space, Time, and Money / 205 \\
                 Editor and Publisher: Confrontation with Benjamin
                 Jowett / 215 \\
                 The B{\^e}te Noire of the Press / 246 \\
                 Shearing Samson's Locks: The Pace of Production Must Be
                 Increased / 262 \\
                 `Not the Least of the Glories of the University of
                 Oxford' / 280 \\
                 The Sands Run Out / 303 \\
                 `The Dic and the Little Dics': The Man and His Family /
                 314 \\
                 Appendix I / 342 \\
                 Appendix II / 346 \\
                 Abbreviations Used in Notes / 351 \\
                 Notes / 355 \\
                 Index / 378",
}

@Book{Musciano:1996:HDG,
  author =       "Chuck Musciano and Bill Kennedy",
  title =        "{HTML}: The Definitive Guide",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xx + 385",
  year =         "1996",
  ISBN =         "1-56592-175-5",
  ISBN-13 =      "978-1-56592-175-7",
  LCCN =         "QA76.76.H94 M87 199",
  bibdate =      "Mon Sep 23 15:25:12 1996",
  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",
  price =        "US\$29.95, CDN\$42.95",
  URL =          "http://www.oreilly.com/catalog/9781565921757",
  abstract =     "Help to create tables, use Netscape's frames to
                 coordinate sets of documents, design and build
                 interactive forms, insert Java applets and other
                 multimedia elements, create dynamic documents with
                 server-push and client-pull, create documents that look
                 good on a variety of browsers.",
  acknowledgement = ack-nhfb,
  keywords =     "HTML (document markup language) --- handbooks,
                 manuals, etc; hypertext systems",
  tableofcontents = "1: HTML and the World Wide Web \\
                 2: HTML quick start \\
                 3: Anatomy of an HTML document \\
                 4: Text basics \\
                 5: Rules, images, and multimedia \\
                 6: Links and webs \\
                 7: Formatted lists \\
                 8: Forms \\
                 9: Tables \\
                 10: Frames \\
                 Netscape dynamic documents \\
                 Tips, tricks, and hacks \\
                 A: HTML grammar \\
                 B: HTML tag quick reference \\
                 C: The HTML DTD \\
                 D: Character entities \\
                 E: Color name and values",
}

@Book{Myers:1979:AST,
  author =       "Glenford J. Myers",
  title =        "The Art of Software Testing",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xi + 177",
  year =         "1979",
  ISBN =         "0-471-04328-1",
  ISBN-13 =      "978-0-471-04328-7",
  LCCN =         "QA76.6 .M888 1979",
  bibdate =      "Wed Dec 15 10:39:56 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Business Data Processing, Editors: Richard G. Canning
                 and J. Daniel Cougar",
  acknowledgement = ack-nhfb,
  tableofcontents = "A Self-Assessment Test \\
                 The Psychology and Economics of Program Testing \\
                 Program Inspections, Walkthroughs, and Reviews \\
                 Test-Case Design \\
                 Module Testing \\
                 Higher-Order Testing \\
                 Debugging \\
                 Test Tools and Other Techniques \\
                 Index",
}

@Book{Myers:1988:MA,
  author =       "Glenford J. Myers and David L. Budde",
  title =        "The 80960 Microprocessor Architecture",
  publisher =    pub-WILEY-INTERSCIENCE,
  address =      pub-WILEY-INTERSCIENCE:adr,
  pages =        "xiii + 255",
  year =         "1988",
  ISBN =         "0-471-61857-8",
  ISBN-13 =      "978-0-471-61857-7",
  LCCN =         "QA76.8.I29284 M941 1988",
  bibdate =      "Wed Dec 15 10:39:54 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/microchip.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Overview \\
                 The Core Architecture \\
                 The Numerics Architecture \\
                 The Protected Architecture \\
                 Bus and External Signals \\
                 The Implementation \\
                 Design Methodology 80960 \\
                 Performance \\
                 Instruction Summary \\
                 Index",
}

@Book{NAE:1993:MT,
  author =       "{National Academy of Engineers}",
  title =        "Memorial tributes",
  volume =       "6",
  publisher =    "National Academy Press",
  address =      "Washington, DC, USA",
  year =         "1993",
  ISBN =         "0-309-04847-8 (hardcover), 0-585-14955-0 (e-book)",
  ISBN-13 =      "978-0-309-04847-7 (hardcover), 978-0-585-14955-4
                 (e-book)",
  LCCN =         "TA139 .N34 1993",
  bibdate =      "Thu Sep 7 07:17:38 MDT 2023",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "https://nap.nationalacademies.org/",
  acknowledgement = ack-nhfb,
  tableofcontents = "Foreword / / xi \\
                 John Bardeen / Nick Holonyak, Jr. / 3 \\
                 Harry F. Barr / Robert A. Frosch / 13 \\
                 Gilbert Y. Chin / Jack H. Wernick / 19 \\
                 James Wallace Daily / Donald R. F. Harleman / 23 \\
                 John Frank Elliott / Morris Cohen / 27 \\
                 Karl L. Fetters / Robert D. Pehlke / 31 \\
                 James C. Fletcher / Dale D. Myers / 35 \\
                 Jacob M. Geist / P. L. Thibaut Brian / 41 \\
                 Milton Harris / Alfred E. Brown / 47 \\
                 Fred L. Hartley / John R. Kiely / 51 \\
                 Richard Hazen / Daniel A. Okun / 57 \\
                 Edward H. Heinemann / Donald Douglas, Jr. and Harry
                 Gann / 63 \\
                 Frederic A. L. Holloway / J. F. Mathis / 67 \\
                 Marshall G. Holloway / Raemer E. Schreiber / 73 \\
                 Grace Murray Hopper / Gordon R. Nagler / 79 \\
                 Richard Ralston Hough / S. R Willcoxon / 85 \\
                 Robert I. Jaffee / John Stringer / 89 \\
                 Clarence L. `Kelly' Johnson / Daniel M. Tellep / 93 \\
                 Edward Conrad Jordan / George W. Swenson, Jr. / 97 \\
                 John Fisher Kennedy / Vito A. Vanoni and Norman H.
                 Brooks / 103 \\
                 Augustus B. Kinzel / Walker L. Cisler and Harvey A.
                 Wagner / 111 \\
                 Philip S. Klebanoff / G. E. Mattingly and L. P. Purtell
                 / 115 \\
                 Alan G. Loofbourrow / Rupert L. Atkin / 119 \\
                 Gerald T. McCarthy / Wilson V. Binger / 123 \\
                 James R. Melcher / Thomas H. Lee and Markus Zahn / 127
                 \\
                 Frank R. Milliken / Nathaniel Arbiter / 133 \\
                 Kiyoshi Muto / Joseph Penzien and George W. Housner /
                 139 \\
                 Jack N. Nielsen / Dean R. Chapman / 145 \\
                 Zenji Nishiyama / M. Meshii and Morris Fine / 149 \\
                 Robert N. Noyce / Gordon E. Moore / 155 \\
                 Thomas O. Paine / Edward E. Hood, Jr. / 161 \\
                 Alan J. Perlis / Fernando J. Corbat{\'o} / 167 \\
                 Milton S. Plesset / Theodore Y. Wu / 173 \\
                 Robert F. Rocheleau / Edwin A. Gee / 177 \\
                 Louis Harry Roddis, Jr. / John W. Simpson / 181 \\
                 Kenneth A. Roe / Robert Plunkett / 185 \\
                 L. Eugene Root / Robert E. Burgess / 191 \\
                 Albert Rose / Paul K Weimer / 197 \\
                 Dominick J. Sanchini / George W. Jeffs / 203 \\
                 Sidney Eugene Scisson / Clarence E. Larson / 207 \\
                 Wilbur S. Smith / Donald S. Berry / 211 \\
                 Robert C. Sprague / Robert C. Duncan / 217 \\
                 Arthur C. Stern / Merril Eisenbud / 221 \\
                 C. Guy Suits / Walter L. Robb / 225 \\
                 Itiro Tani / Yasuo Mori / 229 \\
                 Eugene B. Waggoner / William W. Moore / 233 \\
                 Aubrey J. Wagner / W. F. Willis / 239 \\
                 An Wang / Leo L. Beranek / 245 \\
                 Gabriel Otto Wessenauer / Roland A. Kampmeier / 251 \\
                 Sakae Yagi / Hoyt C. Hottel / 255 \\
                 Appendix \\
                 Acknowledgments for the Photographs",
}

@Book{Nagar:1997:WNF,
  author =       "Rajeev Nagar",
  title =        "{Windows NT} File System Internals: a Developer's
                 Guide",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xviii + 774",
  year =         "1997",
  ISBN =         "1-56592-249-2",
  ISBN-13 =      "978-1-56592-249-5",
  LCCN =         "QA76.76.O63 N34 1997",
  bibdate =      "Mon Apr 18 14:52:59 MDT 2005",
  bibsource =    "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\$49.95",
  URL =          "http://www.ora.com/catalog/wininternals/;
                 http://www.oreilly.com/catalog/9781565922495;
                 http://www.oreilly.com/catalog/wininternals",
  acknowledgement = ack-nhfb,
  remark =       "Building NT file system drivers--cover. Windows
                 NT/Programming--back cover.",
  subject =      "Microsoft Windows NT; Operating systems (Computers);
                 File organization (Computer science)",
}

@Book{Nahin:1998:ITS,
  author =       "Paul J. Nahin",
  title =        "An Imaginary Tale: the Story of $ \sqrt {-1} $ [the
                 Square Root of Minus One]",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "xvi + 257",
  year =         "1998",
  ISBN =         "0-691-02795-1",
  ISBN-13 =      "978-0-691-02795-1",
  LCCN =         "QA255 .N34 1998",
  bibdate =      "Sat Jun 28 14:13:29 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Today complex numbers have such widespread practical
                 use, from electrical engineering to aeronautics, that
                 few people would expect the story behind their
                 derivation to be filled with adventure and enigma. In
                 this book, the author tells the 2000 year old history
                 of one of mathematics' most elusive numbers, the square
                 root of minus one, also known as $i$, re-creating the
                 baffling mathematical problems that conjured it up and
                 the colorful characters who tried to solve them. In
                 1878, when two brothers stole a mathematical papyrus
                 from the ancient Egyptian burial site in the Valley of
                 Kings, they led scholars to the earliest known
                 occurrence of the square root of a negative number. The
                 papyrus offered a specific numerical example of how to
                 calculate the volume of a truncated square pyramid,
                 which implied the need for $i$. In the first century,
                 the mathematician-engineer Heron of Alexandria
                 encountered $i$ in a separate project, but fudged the
                 arithmetic. Medieval mathematicians stumbled upon the
                 concept while grappling with the meaning of negative
                 numbers, but dismissed their square roots as nonsense.
                 By the time of Descartes, a theoretical use for these
                 elusive square roots, now called ``imaginary numbers'',
                 was suspected, but efforts to solve them led to
                 intense, bitter debates. The notorious $i$ finally won
                 acceptance and was put to use in complex analysis and
                 theoretical physics in Napoleonic times. Addressing
                 readers with both a general and scholarly interest in
                 mathematics, the author weaves into this narrative
                 entertaining historical facts, mathematical
                 discussions, and the application of complex numbers and
                 functions to important problems, such as Kepler's laws
                 of planetary motion and ac electrical circuits. This
                 book can be read as an engaging history, almost a
                 biography, of one of the most evasive and pervasive
                 ``numbers'' in all of mathematics.",
  acknowledgement = ack-nhfb,
  annote =       "This is a lovely book that complements the stories of
                 $0$ \cite{Kaplan:1999:NNH}, $e$ \cite{Maor:1994:SN}, $
                 \gamma $ \cite{Havil:2003:GEE}, $ \infty $
                 \cite{Clegg:2003:BHI}, $ \phi $
                 \cite{Herz-Fischler:1987:MHD,Herz-Fischler:1998:MHG,Livio:2002:GRS},
                 and $ \pi $ \cite{Beckmann:1993:HP}. Recall the famous
                 identity $ e^{i \pi } + 1 = 0$ that connects the
                 fundamental numbers of mathematics and computers.",
  libnote =      "Not in my library.",
  tableofcontents = "1: Puzzles of imaginary numbers \\
                 2: First try at understanding the geometry of (the
                 square root of minus one) \\
                 3: Puzzles start to clear \\
                 4: Using complex numbers \\
                 5: More uses of complex numbers \\
                 6: Wizard mathematics \\
                 7: Nineteenth Century, Cauchy, and the beginning of
                 complex function theory \\
                 Appendix A: The Fundamental Theorem of Algebra \\
                 Appendix B: The Complex Roots of a Transcendental
                 Equation \\
                 Appendix C: $\sqrt{-1}^{\sqrt{-1}}$ to 135 Decimal
                 Places, and How It Was Computed \\
                 Appendix D: Solving Clausen's Puzzle \\
                 Appendix E: Deriving the Differential Equation for the
                 Phase-Shift Oscillator \\
                 Appendix F: The Value of the Gamma Function on the
                 Critical Line \\
                 Notes \\
                 Name Index \\
                 Subject Index \\
                 Acknowledgments",
}

@Book{Nahin:2006:DEF,
  author =       "Paul J. Nahin",
  title =        "{Dr. Euler}'s fabulous formula: cures many
                 mathematical ills",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "xx + 380",
  year =         "2006",
  ISBN =         "0-691-11822-1 (hardcover)",
  ISBN-13 =      "978-0-691-11822-2 (hardcover)",
  LCCN =         "QA255 .N339 2006",
  bibdate =      "Fri Nov 17 12:25:54 MST 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0654/2005056550-d.html",
  abstract =     "Presents the story of the formula $ 0 = e^{i \pi } + 1
                 $ long regarded as the gold standard for mathematical
                 beauty. This book shows why it still lies at the heart
                 of complex number theory. It discusses many
                 sophisticated applications of complex numbers in pure
                 and applied mathematics, and to electronic
                 technology.",
  acknowledgement = ack-nhfb,
  subject =      "Numbers, Complex; Euler's numbers; Mathematics;
                 History; $e^{i\pi} + 1 = 0$",
  tableofcontents = "Complex numbers \\
                 Vector trips \\
                 The irrationality of $\pi^2$ \\
                 Fourier series \\
                 Fourier integrals \\
                 Electronics and the square root of $-1$ \\
                 Euler: the man and the mathematical physicist",
}

@Article{Naiman:grey-scale,
  author =       "Avi Naiman and Alain Fournier",
  title =        "Rectangular Convolution for Fast Filtering of
                 Characters",
  journal =      j-SIGGRAPH,
  volume =       "21",
  number =       "4",
  pages =        "233--242",
  month =        jul,
  year =         "1987",
  bibdate =      "Sun May 2 07:53:03 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See \cite{Kajiya:grey-scale}.",
  acknowledgement = ack-nhfb,
  personalnote = "See e-mail from Alan Broder (\path|ajb@mitre.arpa|
                 14-Oct-1988) regarding TeX DVI display on grey-scale
                 devices.",
}

@Book{Nakajima:1992:CDT,
  author =       "Heitaro Nakajima and Hiroshi Ogawa",
  title =        "Compact Disc Technology",
  publisher =    pub-OHMSHA # " and " # pub-IOS,
  address =      pub-OHMSHA:adr # " and " # pub-IOS:adr,
  pages =        "x + 232",
  year =         "1992",
  ISBN =         "4-274-03347-3 (Ohmsha, Ltd), 90-5199-066-9 (IOS
                 Press)",
  ISBN-13 =      "978-4-274-03347-6 (Ohmsha, Ltd), 978-90-5199-066-9
                 (IOS Press)",
  LCCN =         "TK7882.C56 N3613 1992",
  bibdate =      "Sun Jul 10 20:23:06 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Translated by Charles Aschmann.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
}

@Book{Nakanishi:1962:IAS,
  author =       "Koji Nakanishi",
  title =        "Infrared Absorption Spectroscopy: Practical",
  publisher =    "Holden-Day, Inc. and Nankodo Company Limited",
  address =      "San Francisco, CA, USA and Tokyo, Japan",
  pages =        "ix + 233",
  year =         "1962",
  LCCN =         "QD95 .N36 1962",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Neider:1993:OPG,
  author =       "Jackie Neider and Tom Davis and Mason Woo",
  title =        "{OpenGL} Programming Guide: The Official Guide to
                 Learning {OpenGL}, Release 1",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xiii + 516",
  year =         "1993",
  ISBN =         "0-201-63274-8",
  ISBN-13 =      "978-0-201-63274-3",
  LCCN =         "T385.N435 1993",
  bibdate =      "Tue Mar 1 13:14:39 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "The source code examples are available at
                 \path=ftp://sgigate.sgi.com/pub/opengl/opengl.tar.Z=.
                 An HTML version of the book is available at
                 \path=http://arctic.eng.iastate.edu:88/SGI_Developer/OpenGL_PG/=
                 and \path=http://fly.cc.fer.hr/~unreal/index.html=.",
  price =        "US\$34.95",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "1: Introduction to OpenGL \\
                 2: Drawing Geometric Objects \\
                 3: Viewing \\
                 4: Display Lists \\
                 5: Color \\
                 6: Lighting \\
                 7: Blending, Antialiasing, and Fog \\
                 8: Drawing Pixels, Bitmaps, Fonts, and Images \\
                 9: Texture Mapping \\
                 10: The Framebuffer \\
                 11: Evaluators and NURBS \\
                 12: Selection and Feedback \\
                 13: Now That You Know \\
                 A: Order of Operations \\
                 B: OpenGL State Variables \\
                 C: The OpenGL Utility Library \\
                 D: The OpenGL Extension to the X Window System \\
                 E: The OpenGL Programming Guide Auxiliary Library \\
                 F: Calculating Normal Vectors \\
                 G: Homogeneous Coordinates and Transformation Matrices
                 \\
                 H: Programming Tips \\
                 I: OpenGL Invariance",
}

@Book{Nelson:1991:SPM,
  editor =       "Greg Nelson",
  title =        "Systems Programming with {Modula-3}",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "ix + 267",
  year =         "1991",
  ISBN =         "0-13-590464-1 (paperback)",
  ISBN-13 =      "978-0-13-590464-0 (paperback)",
  LCCN =         "QA76.66 .S87 1991",
  bibdate =      "Wed Dec 15 10:40:00 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "A description of the Modula 3 programming language by
                 the committee that designed it, with an entertaining
                 appendix on how various design decisions were made.
                 Section 3.4 describes three floating-point interfaces
                 that provide parameters of the underlying
                 floating-point system, access primitives, and exception
                 handling.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
}

@Book{Nemeth:1989:USA,
  author =       "Evi Nemeth and Garth Snyder and Scott Seebass",
  title =        "{UNIX} System Administration Handbook",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xxx + 593",
  year =         "1989",
  ISBN =         "0-13-933441-6",
  ISBN-13 =      "978-0-13-933441-2",
  LCCN =         "QA76.76.O63 N45 1989",
  bibdate =      "Wed Dec 15 10:40:01 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Foreword / xxvi \\
                 Foreword to the Second Edition / xxvii \\
                 Foreword to the First Edition / xxix \\
                 Preface / xxxi \\
                 Acknowledgments / xxxiv \\
                 Basic Administration \\
                 Where to Start / 1 \\
                 Suggested background / 2 \\
                 The sordid history of UNIX / 2 \\
                 Example UNIX systems / 3 \\
                 Notation and typographical conventions / 4 \\
                 How to use your manuals / 5 \\
                 Essential tasks of the system administrator / 8 \\
                 How to find files on the Internet / 9 \\
                 System administration under duress / 10 \\
                 Recommended reading / 11 \\
                 Booting and Shutting Down / 12 \\
                 Bootstrapping / 12 \\
                 Booting PCs / 16 \\
                 Booting in single-user mode / 22 \\
                 Startup scripts / 24 \\
                 Rebooting and shutting down / 33 \\
                 Rootly Powers / 37 \\
                 Ownership of files and processes / 37 \\
                 The superuser / 39 \\
                 Choosing a root password / 39 \\
                 Becoming root / 40 \\
                 Other pseudo-users / 44 \\
                 Controlling Processes / 45 \\
                 Components of a process / 45 \\
                 The life cycle of a process / 47 \\
                 Signals / 48 \\
                 kill: send signals / 51 \\
                 Process states / 51 \\
                 nice and renice: influence scheduling priority / 52 \\
                 ps: monitor processes / 53 \\
                 top: monitor processes even better / 57 \\
                 Runaway processes / 57 \\
                 The Filesystem / 60 \\
                 Pathnames / 61 \\
                 Mounting and unmounting filesystems / 62 \\
                 The organization of the file tree / 64 \\
                 File types / 66 \\
                 File attributes / 69 \\
                 Adding New Users / 76 \\
                 The /etc/passwd file / 76 \\
                 The FreeBSD /etc/master.passwd file / 81 \\
                 The FreeBSD /etc/login.conf file / 82 \\
                 The Solaris and Red Hat /etc/shadow file / 82 \\
                 The /etc/group file / 84 \\
                 Adding users / 85 \\
                 Removing users / 90 \\
                 Disabling logins / 90 \\
                 Vendor-supplied account management utilities / 91 \\
                 Serial Devices / 93 \\
                 Serial standards / 93 \\
                 Alternative connectors / 97 \\
                 Hard and soft carrier / 101 \\
                 Hardware flow control / 102 \\
                 Cable length / 102 \\
                 Serial device files / 103 \\
                 Software configuration for serial devices / 103 \\
                 Configuration of hardwired terminals / 104 \\
                 Special characters and the terminal driver / 110 \\
                 stty: set terminal options / 111 \\
                 test: set options automatically / 112 \\
                 How to unwedge a terminal / 112 \\
                 Modems / 113 \\
                 Debugging a serial line / 115 \\
                 Other common I/O ports / 116 \\
                 Adding a Disk / 118 \\
                 Disk interfaces / 118 \\
                 Disk geometry / 126 \\
                 An overview of the disk installation procedure / 128
                 \\
                 fsck: check and repair filesystems / 136 \\
                 Vendor specifics / 138 \\
                 Periodic Processes / 157 \\
                 cron: schedule commands / 157 \\
                 The format of crontab files / 158 \\
                 Crontab management / 160 \\
                 Some common uses for cron / 160 \\
                 Vendor specifics / 162 \\
                 Backups / 164 \\
                 Motherhood and apple pie / 165 \\
                 Backup devices and media / 169 \\
                 Setting up an incremental backup regime / 175 \\
                 Restoring from dumps / 180 \\
                 Dumping and restoring for upgrades / 184 \\
                 Using other archiving programs / 184 \\
                 Using multiple files on a single tape / 186 \\
                 Amanda / 187 \\
                 Commercial backup products / 202 \\
                 Recommended reading / 203 \\
                 Syslog and Log Files / 204 \\
                 Logging policies / 204 \\
                 Finding log files / 207 \\
                 Files NOT to manage / 208 \\
                 Vendor specifics / 209 \\
                 Syslog: the system event logger / 210 \\
                 Condensing log files to useful information / 222 \\
                 Drivers and the Kernel / 224 \\
                 Kernel types / 225 \\
                 Why configure the kernel? / 226 \\
                 Configuring a Solaris kernel / 226 \\
                 Building an HP-UX kernel / 229 \\
                 Configuring a Linux kernel / 231 \\
                 Building a FreeBSD kernel / 233 \\
                 Creating a BSD configuration file / 237 \\
                 Adding device drivers / 246 \\
                 Device files / 252 \\
                 Naming conventions for devices / 252 \\
                 Loadable kernel modules / 253 \\
                 Recommended reading / 257 \\
                 Networking \\
                 TCP/IP Networking / 261 \\
                 TCP/IP and the Internet / 262 \\
                 Networking road map / 265 \\
                 Packets and encapsulation / 266 \\
                 IP addresses: the gory details / 271 \\
                 Routing / 283 \\
                 ARP: The address resolution protocol / 285 \\
                 DHCP: the Dynamic Host Configuration Protocol / 287 \\
                 PPP: the Point-to-Point Protocol / 291 \\
                 Security issues / 295 \\
                 Addition of machines to a network / 298 \\
                 Vendor-specific network configuration / 306 \\
                 Solaris network configuration / 307 \\
                 HP-UX network configuration / 315 \\
                 Network configuration for Red Hat / 322 \\
                 Network configuration for FreeBSD / 330 \\
                 Recommended reading / 340 \\
                 Routing / 342 \\
                 Packet forwarding: a closer look / 343 \\
                 Routing daemons and routing protocols / 345 \\
                 Protocols on parade / 349 \\
                 routed: RIP yourself a new hole / 351 \\
                 gated: a better routing daemon / 352 \\
                 Vendor specifics / 366 \\
                 Routing strategy selection criteria / 367 \\
                 Cisco routers / 368 \\
                 Recommended reading / 371 \\
                 Network Hardware / 372 \\
                 LAN, WAN, or MAN? / 372 \\
                 Ethernet: the common LAN / 373 \\
                 FDDI: the disappointing and expensive LAN / 380 \\
                 ATM: the promised (but sorely defeated) LAN / 381 \\
                 Frame relay: the sacrificial WAN / 382 \\
                 ISDN: the indigenous WAN / 383 \\
                 DSL: the people's WAN / 383 \\
                 Where is the network going? / 384 \\
                 Network testing and debugging / 385 \\
                 Building wiring / 386 \\
                 Network design issues / 387 \\
                 Management issues / 389 \\
                 Recommended vendors / 390 \\
                 Recommended reading / 391 \\
                 The Domain Name System / 392 \\
                 DNS for the impatient: adding a new machine / 392 \\
                 The history of DNS / 394 \\
                 Who needs DNS? / 395 \\
                 What's new in DNS / 396 \\
                 The DNS namespace / 397 \\
                 The BIND software / 402 \\
                 How DNS works / 407 \\
                 BIND client issues / 410 \\
                 BIND server configuration / 414 \\
                 BIND configuration examples / 429 \\
                 The DNS database / 436 \\
                 Updating zone files / 457 \\
                 Security issues / 460 \\
                 Testing and debugging / 469 \\
                 Loose ends / 479 \\
                 Vendor specifics / 481 \\
                 Recommended reading / 485 \\
                 The Network File System / 488 \\
                 General information about NFS / 488 \\
                 Server-side NFS / 493 \\
                 Client-side NFS / 500 \\
                 nfsstat: dump NFS statistics / 503 \\
                 Dedicated NFS file servers / 503 \\
                 Automatic mounting / 504 \\
                 automount: the original automounter / 505 \\
                 amd: a more sophisticated automounter / 509 \\
                 Recommended reading / 512 \\
                 Sharing System Files / 513 \\
                 What to share / 514 \\
                 Copying files around / 515 \\
                 NIS: the Network Information Service / 521 \\
                 NIS+: son of NIS / 530 \\
                 LDAP: the Lightweight Directory Access Protocol / 532
                 \\
                 Electronic Mail / 535 \\
                 Mail systems / 537 \\
                 The anatomy of a mail message / 541 \\
                 Mail philosophy / 546 \\
                 Mail aliases / 550 \\
                 sendmail: ringmaster of the electronic mail circus /
                 562 \\
                 sendmail configuration / 570 \\
                 Basic sendmail configuration primitives / 573 \\
                 Fancier sendmail configuration primitives / 577 \\
                 Configuration file examples / 588 \\
                 Spam-related features in sendmail / 595 \\
                 Security and sendmail / 607 \\
                 sendmail statistics, testing, and debugging / 614 \\
                 The Postfix mail system / 618 \\
                 Recommended reading / 623 \\
                 Network Management and Debugging / 625 \\
                 Troubleshooting a network / 626 \\
                 ping: check to see if a host is alive / 627 \\
                 traceroute: trace IP packets / 629 \\
                 netstat: get tons o' network statistics / 631 \\
                 Packet sniffers / 636 \\
                 Network management protocols / 639 \\
                 SNMP: the Simple Network Management Protocol / 640 \\
                 SNMP agents / 642 \\
                 Network management applications / 646 \\
                 Recommended reading / 649 \\
                 Security / 651 \\
                 Seven common-sense rules of security / 652 \\
                 How security is compromised / 653 \\
                 Security problems in the /etc/passwd file / 655 \\
                 Setuid programs / 658 \\
                 Important file permissions / 659 \\
                 Miscellaneous security issues / 660 \\
                 Security power tools / 663 \\
                 Cryptographic security tools / 669 \\
                 Firewalls / 675 \\
                 Sources of security information / 678 \\
                 What to do when your site has been attacked / 680 \\
                 Recommended reading / 682 \\
                 Web Hosting and Internet Servers / 684 \\
                 Web hosting / 684 \\
                 Web hosting basics / 685 \\
                 HTTP server installation / 688 \\
                 Virtual interfaces / 691 \\
                 Caching and proxy servers / 694 \\
                 Anonymous FTP server setup / 696 \\
                 Usenet news / 698 \\
                 Bunch O'Stuff \\
                 Printing / 703 \\
                 Mini-glossary of printing terms / 704 \\
                 Types of printers / 705 \\
                 BSD printing / 707 \\
                 System V printing / 719 \\
                 Adding a printer / 728 \\
                 LPRng / 735 \\
                 Debugging printing problems / 739 \\
                 Common printing software / 740 \\
                 Printer philosophy / 741 \\
                 Maintenance and Environment / 744 \\
                 Maintenance basics / 744 \\
                 Maintenance contracts / 745 \\
                 Board-handling lore / 746 \\
                 Monitors / 747 \\
                 Memory modules / 747 \\
                 Preventive maintenance / 748 \\
                 Environment / 749 \\
                 Power / 751 \\
                 Racks / 752 \\
                 Tools / 753 \\
                 Performance Analysis / 754 \\
                 What you can do to improve performance / 755 \\
                 Factors that affect performance / 756 \\
                 System performance checkup / 757 \\
                 Help! My system just got really slow! / 766 \\
                 Recommended reading / 768 \\
                 Cooperating with Windows / 769 \\
                 File and print sharing / 769 \\
                 Secure terminal emulation with SSH / 773 \\
                 X Windows emulators / 774 \\
                 PC mail clients / 775 \\
                 PC backups / 775 \\
                 Dual booting / 776 \\
                 Running Windows applications under UNIX / 776 \\
                 PC hardware tips / 776 \\
                 Policy and Politics / 778 \\
                 Policy and procedure / 779 \\
                 Legal issues / 787 \\
                 Sysadmin surveys / 793 \\
                 Scope of service / 795 \\
                 Trouble-reporting systems / 796 \\
                 Managing management / 797 \\
                 Hiring, firing, and training / 797 \\
                 War stories and ethics / 800 \\
                 Localization and upgrades / 805 \\
                 Local documentation / 809 \\
                 Procurement / 811 \\
                 Decommissioning hardware / 812 \\
                 Software patents / 813 \\
                 Organizations, conferences, and other resources / 814
                 \\
                 Standards / 817 \\
                 Sample documents / 819 \\
                 Recommended reading / 820 \\
                 Daemons / 821 \\
                 init: the primordial process / 822 \\
                 cron: schedule commands / 823 \\
                 inetd: manage daemons / 823 \\
                 System daemons / 827 \\
                 Printing daemons / 828 \\
                 NFS daemons / 828 \\
                 NIS daemons / 829 \\
                 Internet daemons / 830 \\
                 Time synchronization daemons / 833 \\
                 Booting and configuration daemons / 834 \\
                 Colophon / 836 \\
                 Index / 837",
}

@Book{Nemeth:2001:USA,
  author =       "Evi Nemeth and Garth Snyder and Scott Seebass and
                 Trent R. Hein and Adam Boggs and Rob Braun and Ned
                 McClain and Dan Crawl and Lynda McGinley and Todd
                 Miller",
  title =        "{UNIX} System Administration Handbook",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  edition =      "Third",
  pages =        "xxxv + 853",
  year =         "2001",
  ISBN =         "0-13-020601-6",
  ISBN-13 =      "978-0-13-020601-5",
  LCCN =         "QA76.76.O63 N45 2001",
  bibdate =      "Wed Jan 17 18:10:43 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  price =        "US\$68.00",
  URL =          "http://www.phptr.com/ptrbooks/ptr_0130206016.html",
  abstract =     "Now covers Red Hat Linux! Written by Evi Nemeth, Garth
                 Snyder, Scott Seebass, and Trent R. Hein with Adam
                 Boggs, Rob Braun, Ned McClain, Dan Crawl, Lynda
                 McGinley, and Todd Miller ``This is not a nice, neat
                 book for a nice, clean world. It's a nasty book for a
                 nasty world. This is a book for the rest of us.'' ---
                 Eric Allman and Marshall Kirk McKusick``I am pleased to
                 welcome Linux to the \booktitle{UNIX System
                 Administration Handbook}!'' --- Linus Torvalds,
                 Transmeta``This book is most welcome!'' --- Dennis
                 Ritchie, AT\&T Bell Laboratories This new edition of
                 the world's most comprehensive guide to UNIX system
                 administration is an ideal tutorial for those new to
                 administration and an invaluable reference for
                 experienced professionals. The third edition has been
                 expanded to include ``direct from the frontlines''
                 coverage of Red Hat Linux. \booktitle{UNIX System
                 Administration Handbook} describes every aspect of
                 system administration-from basic topics to UNIX
                 esoterica-and provides explicit coverage of four
                 popular UNIX systems: This book stresses a practical
                 approach to system administration. It's packed with war
                 stories and pragmatic advice, not just theory and
                 watered-down restatements of the manuals. Difficult
                 subjects such as sendmail, kernel building, and DNS
                 configuration are tackled head-on. Examples are
                 provided for all four versions of UNIX and are drawn
                 from real-life systems-warts and all. ``This book is
                 where I turn first when I have system administration
                 questions. It is truly a wonderful resource and always
                 within reach of my terminal.'' --- W. Richard Stevens,
                 author of numerous books on UNIX and TCP/IP``This is a
                 comprehensive guide to the care and feeding of UNIX
                 systems. The authors present the facts along with
                 seasoned advice and numerous real-world examples. Their
                 perspective on the variations among systems is valuable
                 for anyone who runs a heterogeneous computing
                 facility.'' --- Pat Parseghian, Transmeta ``We noticed
                 your book on the staff recommendations shelf at our
                 local bookstore: `Very clear, a masterful
                 interpretation of the subject.' We were most impressed,
                 until we noticed that the same staff member had also
                 recommended Aunt Bea's Mayberry Cookbook.'' --- Shannon
                 Bloomstran, history teacher.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Basic administration \\
                 Where to start \\
                 Booting and shutting down \\
                 Rootly powers \\
                 Controlling processes \\
                 The filesystem \\
                 Adding new users \\
                 Serial devices \\
                 Adding a disk \\
                 Periodic processes \\
                 Backups \\
                 Syslog and log files \\
                 Drivers and the kernel \\
                 Networking \\
                 TCP/IP networking \\
                 Routing \\
                 Network hardware \\
                 The domain name system \\
                 The network file system \\
                 Sharing system files \\
                 Electronic mail \\
                 Network management and debugging \\
                 Security \\
                 Web hosting and internet servers \\
                 Bunch O'stuff \\
                 Printing \\
                 Maintenance and environment \\
                 Performance analysis \\
                 Cooperating with windows \\
                 Policy and politics \\
                 Daemons",
}

@Book{Nemeth:2002:LAH,
  author =       "Evi Nemeth and Garth Snyder and Trent Hein",
  title =        "{Linux} Administration Handbook",
  publisher =    pub-PHPTR,
  address =      pub-PHPTR:adr,
  pages =        "xxxi + 890",
  year =         "2002",
  ISBN =         "0-13-008466-2 (paperback)",
  ISBN-13 =      "978-0-13-008466-8 (paperback)",
  LCCN =         "QA76.76.O63 N448 2002",
  bibdate =      "Wed May 01 06:44:16 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/linux.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  price =        "US\$49.99",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Where to Start \\
                 2: Booting and Shutting Down \\
                 3: Rootly Powers \\
                 4: Controlling Processes \\
                 5: The Filesystem \\
                 6: Adding New Users \\
                 7: Serial Devices \\
                 8: Adding a Disk \\
                 9: Periodic Processes \\
                 10: Backups \\
                 11: Syslog and Log Files \\
                 12: Drivers and the Kernel \\
                 13: TCP/IP Networking \\
                 14: Routing \\
                 15: Network Hardware \\
                 16: The Domain Name System \\
                 17: The Network File System \\
                 18: Sharing System Files \\
                 19: Electronic Mail \\
                 20: Network Management and Debugging \\
                 21: Security \\
                 22: Web Hosting and Internet Servers \\
                 23: Software Installation and Localization \\
                 24: Printing",
}

@Book{Nemeth:2010:ULS,
  author =       "Evi Nemeth and Garth Snyder and Trent R. Hein and Ben
                 Whaley",
  title =        "{UNIX} and {Linux} System Administration Handbook",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  edition =      "Fourth",
  pages =        "xlvii + 1279",
  year =         "2010",
  ISBN =         "0-13-148005-7",
  ISBN-13 =      "978-0-13-148005-6",
  LCCN =         "QA76.76.O63 N45 2010",
  bibdate =      "Mon Sep 27 11:07:42 MDT 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  remark =       "Revised edition of \cite{Nemeth:2001:USA}.",
  subject =      "Operating systems (Computers); UNIX (Computer file);
                 Linux",
  tableofcontents = "Where to start \\
                 Scripting and the shell \\
                 Booting and shutting down \\
                 Access control and rootly powers \\
                 Controlling processes \\
                 The filesystem \\
                 Adding new users \\
                 Storage \\
                 Periodic processes \\
                 Backups \\
                 Syslog and log files \\
                 Software installation and management \\
                 Drivers and the kernal \\
                 TCP/IP networking \\
                 Routing \\
                 Network hardware \\
                 DNS: The domain name system \\
                 The network file system \\
                 Sharing system files \\
                 Electronic mail \\
                 Network management and debugging \\
                 Security \\
                 Web hosting \\
                 Virtualization \\
                 The X window system \\
                 Printing \\
                 Data center basics \\
                 Green IT \\
                 Performance analysis \\
                 Cooperating with windows \\
                 Serial devices and terminals \\
                 Management, policy, and politics",
}

@Article{Ness:tv-guide,
  author =       "David Ness",
  title =        "The Use of {\TeX{}} in a Commercial Environment",
  journal =      j-TEXNIQUES,
  volume =       "5",
  pages =        "115--123",
  month =        aug,
  year =         "1987",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Proceedings of the Eighth Annual Meeting of the \TeX{}
                 Users Group",
  acknowledgement = ack-nhfb,
}

@Book{Nevala-Lee:2025:CPJ,
  author =       "Alec Nevala-Lee",
  title =        "Collisions: a Physicist's Journey from {Hiroshima} to
                 the Death of the Dinosaurs",
  publisher =    pub-NORTON,
  address =      pub-NORTON:adr,
  pages =        "viii + 338",
  year =         "2025",
  ISBN =         "1-324-07510-4 (hardcover), 1-324-07511-2 (ePub
                 ebook)",
  ISBN-13 =      "978-1-324-07510-3 (hardcover), 978-1-324-07511-0 (ePub
                 ebook)",
  LCCN =         "QC16.A48 N48 2025",
  bibdate =      "Sat Dec 13 15:28:13 MST 2025",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/o/oppenheimer-j-robert.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "To his admirers, Luis W. Alvarez was the most
                 accomplished, inventive, and versatile experimental
                 physicist of his generation. During World War II, he
                 achieved major breakthroughs in radar, played a key
                 role in the Manhattan Project, and served as the lead
                 scientific observer at the bombing of Hiroshima. In the
                 decades that followed, he revolutionized particle
                 physics with the hydrogen bubble chamber, developed an
                 innovative X-ray method to search for hidden chambers
                 in the Pyramid of Chephren, and shot melons at a rifle
                 range to test his controversial theory about the
                 Kennedy assassination. At the very end of his life, he
                 collaborated with his son to demonstrate that an
                 asteroid impact was responsible for the extinction of
                 the dinosaurs, igniting a furious debate that raged for
                 years after his death. Alvarez was also a combative and
                 relentlessly ambitious figure --- widely feared by his
                 students and associates --- who testified as a
                 government witness at the security hearing that
                 destroyed the public career of his friend and colleague
                 J. Robert Oppenheimer. In the first comprehensive
                 biography of Alvarez, Alec Nevala-Lee vividly recounts
                 one of the most compelling untold stories in modern
                 science, a narrative overflowing with ideas, lessons,
                 and anecdotes that will fascinate anyone with an
                 interest in how genius and creativity collide with the
                 problems of an increasingly challenging world.",
  acknowledgement = ack-nhfb,
  subject =      "Alvarez, Luis W.; Inventors; United States; Biography;
                 Nobel Prize winners; Physicists; Scientists; College
                 teachers; Inventeurs; Biographies; Professeurs
                 (Enseignement sup{\'e}rieur); {\'E}tats-Unis;
                 Physiciens; Scientifiques; Inventors; Nobel Prize
                 winners; Physicists; Scientists; United States",
  subject-dates = "1911--1988",
  tableofcontents = "Prologue / 1 \\
                 Part I. Experiments 1911--1943 \\
                 1: Looking for trouble 1911--1936 / 15 \\
                 2: Coming of age in Berkeley 1936--1939 / 38 \\
                 3: Under the hood 1939--1943 / 62 \\
                 Part II. Technically sweet 1943--1963 \\
                 4: The firebreak 1943--1945 / 91 \\
                 5: Star chamber 1945--1954 / 125 \\
                 6: Bubble chamber 1950--1963 / 157 \\
                 Part III. The catastrophist 1963--1988 \\
                 7: Monumental 1963--1970 / 191 \\
                 8: Hold everything 1969--1982 / 219 \\
                 9: Nemesis 1976--1988 / 247 \\
                 Epilogue / 261 \\
                 Acknowledgments / 297 \\
                 Notes / 299 \\
                 Bibliography / 323 \\
                 Index / 327",
}

@Book{Newitz:2014:SAR,
  author =       "Annalee Newitz",
  title =        "Scatter, Adapt, and Remember: How Humans Will Survive
                 a Mass Extinction",
  publisher =    pub-ANCHOR-BOOKS,
  address =      pub-ANCHOR-BOOKS:adr,
  pages =        "305",
  year =         "2014",
  ISBN =         "0-307-94942-7",
  ISBN-13 =      "978-0-307-94942-4",
  LCCN =         "GF86 .N485 2014",
  bibdate =      "Tue Jun 03 10:49:02 2014",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "In its 4.5 billion-year history, life on Earth has
                 been almost erased at least half a dozen times:
                 shattered by asteroid impacts, entombed in ice,
                 smothered by methane, and torn apart by unfathomably
                 powerful megavolcanoes. And we know that another global
                 disaster is eventually headed our way. Can we survive
                 it? How? In this brilliantly speculative work of
                 popular science, Annalee Newitz, editor of io9.com,
                 explains that although global disaster is all but
                 inevitable, our chances of long-term species survival
                 are better than ever. Scatter, Adapt, and Remember
                 explores how scientific breakthroughs today will help
                 us avoid disasters tomorrow, from simulating tsunamis
                 or studying central Turkey's ancient underground
                 cities, to cultivating cyanobacteria for ``living
                 cities'' or designing space elevators to make space
                 colonies cost-effective. Readers of this book will be
                 equipped scientifically, intellectually, and
                 emotionally to face whatever our future holds.",
  acknowledgement = ack-nhfb,
  author-dates = "1969--",
  libnote =      "Not in my library.",
  subject =      "Survival; Extinction (Biology); Mass extinctions",
  tableofcontents = "Introduction: Are we all going to die? \\
                 Part 1. A history of mass extinctions \\
                 The apocalypse that brought us to life \\
                 Two ways to go extinct \\
                 The great dying \\
                 What really happened to the dinosaurs \\
                 Is a mass extinction going on right now? \\
                 Part 2. We almost didn't make it \\
                 The African bottleneck \\
                 Meeting the Neanderthals \\
                 Great plagues \\
                 The hungry generations \\
                 Part 3. Lessons from survivors \\
                 Scatter: footprints of the diaspora \\
                 Adapt: meet the toughest microbes in the world \\
                 Remember: swim south \\
                 Pragmatic optimism, or stories of survival \\
                 Part 4. How to build a death-proof city \\
                 The mutating metropolis \\
                 Disaster science \\
                 Using math to stop a pandemic \\
                 Cities that hide \\
                 Every surface a farm \\
                 Part 5. The million-year view \\
                 Terraforming Earth \\
                 Not in our planetary backyard \\
                 Take a ride on the space elevator \\
                 Your body is optional \\
                 On Titan's beach",
}

@Book{Newman:1973:PIC,
  author =       "William M. Newman and Robert F. Sproull",
  title =        "Principles of Interactive Computer Graphics",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "xxviii + 607",
  year =         "1973",
  ISBN =         "0-07-046337-9",
  ISBN-13 =      "978-0-07-046337-0",
  LCCN =         "T385 .N48",
  bibdate =      "Wed Dec 15 10:40:01 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "McGraw-Hill Computer Science Series, Editors: Richard
                 W. Hamming and Edward A. Feigenbaum",
  acknowledgement = ack-nhfb,
}

@Book{Newman:1979:PIC,
  author =       "William M. Newman and Robert F. Sproull",
  title =        "Principles of Interactive Computer Graphics",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  edition =      "Second",
  pages =        "xvi + 541",
  year =         "1979",
  ISBN =         "0-07-046338-7",
  ISBN-13 =      "978-0-07-046338-7",
  LCCN =         "T385 .N48 1979",
  bibdate =      "Wed Dec 15 11:09:22 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Basic concepts \\
                 Graphics packages \\
                 Interactive graphics \\
                 Raster graphics \\
                 Three-dimensional graphics \\
                 Graphic systems \\
                 Vectors and matrices \\
                 Homogeneous coordinate techniques",
}

@Book{Newton:2007:CCH,
  author =       "Roger G. Newton",
  title =        "From clockwork to crapshoot: a history of physics",
  publisher =    pub-BELKNAP,
  address =      pub-BELKNAP:adr,
  pages =        "viii + 340",
  year =         "2007",
  ISBN =         "0-674-02337-4 (paperback)",
  ISBN-13 =      "978-0-674-02337-6 (paperback)",
  LCCN =         "QC7 .N398 2007",
  bibdate =      "Tue Sep 21 14:18:56 MDT 2010",
  bibsource =    "aubrey.tamu.edu:7090/voyager;
                 fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/physperspect.bib",
  abstract =     "Science is about 6,000 years old, while physics
                 emerged as a distinct branch some 2,500 years ago. As
                 scientists discovered virtually countless facts about
                 the world during this great span of time, the manner in
                 which they explained the underlying structure of that
                 world underwent a philosophical evolution. From
                 Clockwork to Crapshoot provides the perspective needed
                 to understand contemporary developments in physics in
                 relation to philosophical traditions as far back as
                 ancient Greece.",
  acknowledgement = ack-nhfb,
  subject =      "Physics; History",
  tableofcontents = "Prologue \\
                 Beginnings \\
                 The Greek miracle \\
                 Science in the Middle Ages \\
                 The first revolution \\
                 Newton's legacy \\
                 New physics \\
                 Relativity \\
                 Statistical physics \\
                 Probability \\
                 The quantum revolution \\
                 Fields, nuclei, and stars \\
                 The properties of matter \\
                 The constituents of the universe \\
                 Epilogue",
}

@Book{Nguyen:2008:GG,
  editor =       "Hubert Nguyen",
  title =        "{GPU} gems 3",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "l + 942",
  year =         "2008",
  ISBN =         "0-321-51526-9",
  ISBN-13 =      "978-0-321-51526-1",
  LCCN =         "T385 .G6882 2008",
  bibdate =      "Mon Apr 5 18:03:24 MDT 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/toc/ecip0720/2007023985.html",
  abstract =     "This volume of the best-selling series provides a
                 snapshot of the latest Graphics Processing Unit (GPU)
                 programming techniques. The programmability of modern
                 GPUs allows developers to use this awesome processing
                 power for non-graphics applications, such as physics
                 simulation, financial analysis, and even virus
                 detection - particularly with the CUDA architecture.
                 Graphics remains the leading application for GPUs, and
                 readers will find that the latest algorithms create
                 ultra-realistic characters, better lighting, and
                 post-rendering compositing effects.",
  acknowledgement = ack-nhfb,
  keywords =     "nVidia",
  libnote =      "Not yet in my library.",
  subject =      "Computer graphics; Real-time programming",
  tableofcontents = "1. Generating complex procedural terrains using the
                 GPU / Ryan Geiss \\
                 2. Animated crowd rendering / Bryan Dudash \\
                 3. DirectX 10 blend shapes: breaking the limits /
                 Tristan Lorach \\
                 4. Next-generation speedtree rendering / Alexander
                 Kharlamov, Iain Cantlay and Yury Stepanenko \\
                 5. Generic adaptive mesh refinement / Tamy Boubekeur
                 and Christophe Schlick \\
                 6. GPU-generated procedural wind animations for trees /
                 Renaldas Zioma \\
                 7. Point-based visualization of metaballs on a GPU /
                 Kees van Kooten, Gino van den Bergen and Alex Telea \\
                 8. Summed-area variance shadow maps / Andrew Lauritzen
                 \\
                 9. Interactive cinematic relighting with global
                 illumination / Fabio Pellacini, Milos Hasan and Kavita
                 Bala \\
                 10. Parallel-split shadow maps on programmable GPUs /
                 Fan Zhang, Hanqiu Sun and Oskari Nyman \\
                 11. Efficient and robust shadow volumes using
                 hierarchical occlusion culling and geometry shaders /
                 Martin Stich, Carsten Wachter and Alexander Keller \\
                 12. High-quality ambient occlusion / Jared Hoberock and
                 Yuntao Jia \\
                 13. Volumetric light scattering as a post-process /
                 Kenny Mitchell \\
                 14. Advanced techniques for realistic real-time skin
                 rendering / Eugene d'Eon and David Luebke \\
                 15. Playable universal capture / George Borshukov,
                 Jefferson Montgomery and John Hable \\
                 16. Vegetation procedural animation and shading in
                 Crysis / Tiago Sousa \\
                 17. Robust multiple specular reflections and
                 refractions / Tamas Umenhoffer, Gustavo Patow and
                 Laszlo Szirmay-Kalos \\
                 18. Relaxed cone stepping for relief mapping / Fabio
                 Policarpo and Manuel M. Ollveira \\
                 19. Deferred shading in Tabula Rasa / Rusty Koonce \\
                 20. GPU-based importance sampling / Mark Colbert and
                 Jaroslav Krivdnek \\
                 21. True impostors / Eric Risser \\
                 22. Baking normal maps on the GPU / Diogo Teixeira \\
                 23. High-speed, off-screen particles / Iain Cantlay \\
                 24. The importance of being linear / Larry Gritz and
                 Eugene d'Eon \\
                 25. Rendering vector art on the GPU / Charles Loop and
                 Jim Blinn \\
                 26. Object detection by color: using the GPU for
                 real-time video image processing / Ralph Brunner, Frank
                 Doepke and Bunny Laden \\
                 27. Motion blur as a post-processing effect / Gilberto
                 Rosado \\
                 28. Practical post-process depth of field / Earl
                 Hammon, Jr. \\
                 29. Real-time rigid body simulation on GPUs / Takahiro
                 Harada \\
                 30. Real-time simulation and rendering of 3D fluids /
                 Keenan Crane, Ignacio Llamas and Sarah Tariq \\
                 31. Fast N-body simulation with CUDA / Lars Nyland,
                 Mark Harris and Jan Prins \\
                 32. Broad-phase collision detection with CUDA / Scott
                 Le Grand \\
                 33. LCP algorithms for collision detection using CUDA /
                 Peter Kipfer \\
                 34. Signed distance fields using single-pass GPU scan
                 conversion of tetrahedra / Kenny Erleben and Henrik
                 Dohlmann \\
                 35. Fast virus signature matching on the GPU /
                 Elizabeth Seamans and Thomas Alexander \\
                 36. AES encryption and decryption on the GPU / Takeshi
                 Yamanouchi \\
                 37. Efficient random number generation and application
                 using CUDA / Lee Howes and David Thomas \\
                 38. Imaging earth's subsurface using CUDA / Bernard
                 Deschizeaux and Jean-Yves Blanc \\
                 39. Parallel prefix sum (Scan) with CUDA / Mark Harris,
                 Shubhabrata Sengupta and John D. Owens \\
                 40. Incremental computation of the Gaussian / Ken
                 Turkowski \\
                 41. Using the geometry shader for compact and
                 variable-length GPU feedback / Franck Diard",
}

@Book{Nichols:1987:RTP,
  author =       "{Major General} Kenneth D. (Kenneth David) Nichols",
  title =        "The road to {Trinity}: a personal account of how
                 {America}'s nuclear policies were made",
  publisher =    "Morrow",
  address =      "New York, NY, USA",
  pages =        "401",
  year =         "1987",
  ISBN =         "0-688-06910-X",
  ISBN-13 =      "978-0-688-06910-0",
  LCCN =         "QC774.N45 A3 1987",
  bibdate =      "Fri Aug 8 15:40:26 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/o/oppenheimer-j-robert.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/t/teller-edward.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  author-dates = "1907--2001",
  remark-01 =    "General Nichols was military second-in-command of the
                 Manhattan Project, reporting directly to Major General
                 Leslie R. Groves. General Nichols was the military head
                 of the Clinton Engineer Works that became the town of
                 Oak Ridge, TN, and later, the site of Oak Ridge
                 National Laboratory. This autobiography provides a nice
                 companion to that of General Groves
                 \cite{Groves:1962:NIC}, providing a view of the
                 military side of the Manhattan Project, and postwar
                 developments in nuclear energy and nuclear weapons, as
                 well as the Oppenheimer security hearings in 1954,
                 where Nichols was on the review board.",
  remark-02 =    "From the Manhattan Project site map on page 18, in
                 Utah, there was Project Alberta in Wendover, and
                 Vanadium Corporation in Monticello.",
  remark-03 =    "From page 34: ``Ultimately, over 90 percent of the
                 costs of the Manhattan Project went into building the
                 plants and producing the fissionable materials, and
                 less than 10 percent was applied to the development and
                 production of the weapons.''",
  remark-04 =    "From page 40: ``On August 11, 1942, [General James]
                 Marshall presented to Colonel Groves a draft of a
                 general order forming the new district. They decided to
                 call it the Manhattan Engineer District (MED), since we
                 had our main office in Manhattan, New York City. Giving
                 the project that name would focus attention away from
                 the actual site of the plants. The chief of engineers
                 issued Order No. 33 on August 13, 1942, setting up an
                 engineer district without territorial limits, to be
                 known as the Manhattan Engineer District, to supervise
                 projects assigned to it by the chief of engineers.''",
  remark-05 =    "From page 42: ``Copper was required for electric
                 windings to form the large electromagnets [for isotope
                 separation]. \ldots{} the full-scale plant to be built
                 in Tennessee would need five thousand tons of the
                 metal. Copper was in desperately short supply because
                 of the demands of the war industries. For the
                 electromagnetic process, however, silver could
                 substitute at the ratio of eleven to ten. \ldots{}
                 ultimately used to transfer 14,700 tons of silver [from
                 the U.S. Treasury to the Manhattan Project].''",
  remark-06 =    "From page 47: ``Our best source [of uranium], the
                 Shinkolobwe mine [in the Belgian Congo in Africa],
                 represented a freak occurrence in nature. It contained
                 a tremendously rich lode of uranium pitchblende.
                 Nothing like it has ever again been found. The ore
                 already in the United States contained 65 percent
                 U-308, while the pitchblende aboveground in the Congo
                 amounted to a thousand tons of 65 percent ore, and the
                 waste piles of ore contained two thousand tons of 20
                 percent U-308. To illustrate the uniqueness of
                 Sengier's stockpile, after the war the MED and the AEC
                 consider ore containing three tenths of 1 percent as a
                 good find. Without Sengier's foresight in stockpiling
                 ore in the United States and aboveground in Africa, we
                 simply would not have had the amounts of uranium needed
                 to justify building the large separation plants and the
                 plutonium reactors.'' The quote says U-308, but that is
                 incorrect: it is U-238, which is 99.284 percent of
                 naturally occurring uranium.",
  remark-07 =    "From page 71: ``Although they [the MED survey team]
                 examined several sites, probably no better location
                 existed anywhere than the Hanford area in Washington
                 [state], on the Columbia River. Matthias reported this
                 to [General Leslie] Groves on December 31 [1942].''",
  remark-08 =    "From page 72 on the choice of J. Robert Oppenheimer as
                 the scientific head of the Manhattan Project:
                 ``Oppenheimer had not won a Nobel Prize, which
                 contributed to the scientific prestige of the other
                 project scientific leaders --- [Ernest O.] Lawrence,
                 [Enrico] Fermi, [Harold] Urey, and [Arthur H.]
                 Compton.''",
  remark-09 =    "From page 87: ``Although I do not like to single out
                 one individual, [Ernest O.] Lawrence, without doubt,
                 was more responsible than anyone else for our success
                 in producing the U-235 necessary for the Hiroshima
                 weapon. He provided inspiration for the whole team.''",
  remark-10 =    "From page 146: ``When the [Clinton Engineer Works]
                 plant was finally completed, we were using at Oak Ridge
                 almost one seventh of the electric power being
                 generated in the United States.''",
  remark-11 =    "From pages 156--157: ``At our peak of construction [of
                 Oak Ridge], the construction labor force totaled
                 seventy-five thousand. Our operating force started its
                 growth later and peaked just after the end of the war,
                 with a total of fifty thousand workers. The combined
                 employment peak was eighty thousand.'' [Other sources
                 report that about 140,000 people worked in the
                 Manhattan Project overall.]",
  remark-12 =    "From page 174: ``Redundancy was at the heart of the
                 Manhattan Project. Each of the uranium processes we
                 built at the CEW [Clinton Engineer Works] served as a
                 backup for the others. In fact, all the CEW U-235
                 enrichment plants were backups for the plutonium effort
                 at Hanford or vice versa.''",
  remark-13 =    "From page 174: ``Ultimately, the Manhattan Project
                 received allocations of about \$2.4 billion. Actual
                 expenditures to October 1, 1945, total \$1.845 billion.
                 By the time the Atomic Energy Commission assumed
                 control on January 1, 1947, we had spent \$2.191
                 billion. Under today's [1982--1986, when the book was
                 written] conditions, it would be difficult if not
                 impossible to accomplish the Manhattan Project in four
                 times the time, and the cost would be at least thirty
                 times more.'' [From the US consumer price index, \$1
                 (1950) is equivalent to between \$6.38 (producer
                 prices) and \$9.04 (consumer prices). In 1998, a B1-B
                 bomber cost \$283 million.]",
  remark-14 =    "From footnote on page 202: ``William L. Laurence, a
                 science reporter for the \booktitle{New York Times},
                 had worked with us for several months prior to
                 Hiroshima. He was fully indoctrinated with the need for
                 secrecy, and then he reviewed our work and visited our
                 installation. He was at Alamogordo and Tinian. He
                 prepared the news releases and statements to be made in
                 Washington [DC], Oak Ridge, Hanford, and various other
                 locations. He did a superior job, and I have never
                 heard any implications that he violated secrecy. It was
                 a fine example of military and press cooperation.''.
                 From the Wikipedia article on WLL: ``William Leonard
                 Laurence (March 7, 188-- March 19, 1977) was a Jewish
                 Lithuanian-born American journalist known for his
                 science journalism writing of the 1940s and 1950s while
                 working for The New York Times. He won two Pulitzer
                 Prizes and, as the official historian of the Manhattan
                 Project, was the only journalist to witness the Trinity
                 test and the atomic bombing of Nagasaki. He is credited
                 with coining the iconic term `Atomic Age' which became
                 popular in the 1950s.''",
  remark-15 =    "From pages 217--218: ``The ethics of the use of the
                 atomic bomb had been raised by U.S. newspapermen in
                 Tokyo, but many Japanese told the [post-bombing] survey
                 team they could not understand why the question should
                 have been raised at all: Their own forces would have
                 used it without the slightest qualm if they had had it
                 themselves.''",
  subject =      "Nichols, Kenneth D; (Kenneth David); atomic bomb;
                 United States; history; physicists; biography",
  tableofcontents = "Introduction / 7 \\
                 1 Early Experiences / 25 \\
                 2 The Curtain Rises, 1942 / 31 \\
                 3 Struggle for Priority, 1942 / 41 \\
                 4 Takeoff and Landing in the New World, 1942 / 55 \\
                 5 Organizing for Construction, 1943 / 77 \\
                 6 Getting Along with Groves / 99 \\
                 7 New Responsibilities, 1943 / 111 \\
                 8 Construction: The Specter of Delay, 1943--45 / 127
                 \\
                 9 People, Places, and Things / 151 \\
                 10 Road to Trinity, 1944--45 / 169 \\
                 11 Three Weeks One Summer, 1945 / 191 \\
                 12 Transition: War to Peace, 1945--46 / 215 \\
                 13 Interlude, 1947 / 249 \\
                 14 The Era of Atomic Scarcity, 1948--53 / 257 \\
                 15 Washington Merry-go-round, 1953--55 / 299 \\
                 16 Monitoring the Fate of Nuclear Power, 1955--86 / 339
                 \\
                 Acknowledgments / 383 \\
                 Bibliography / 385 \\
                 Abridged Index / 389",
}

@Book{Nichols:2003:ECD,
  author =       "Peter Nichols",
  title =        "{Evolution}'s Captain: the Dark Fate of the Man Who
                 Sailed {Charles Darwin} Around the World",
  publisher =    pub-HARPERCOLLINS,
  address =      pub-HARPERCOLLINS:adr,
  pages =        "336",
  year =         "2003",
  ISBN =         "0-06-008877-X (hardcover), 0-06-008878-8 (paperback)",
  ISBN-13 =      "978-0-06-008877-4 (hardcover), 978-0-06-008878-1
                 (paperback)",
  LCCN =         "F2936 .N53 2003",
  bibdate =      "Thu Apr 20 07:24:23 MDT 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 sirsi.library.utoronto.ca:2200/UNICORN",
  abstract =     "When HMS Beagle's first captain committed suicide in
                 the bleak waters of Tierra del Fuego in 1828, he was
                 replaced by a young naval officer of a new mould.
                 Robert FitzRoy was the most brilliant and scientific
                 sea captain of his age. He used the Beagle, a survey
                 vessel, as a laboratory for the new field of the
                 natural sciences. But his plan to bring four savages'
                 home to England to civilize them as Christian
                 gentlefolk backfired when scandal loomed over their
                 sexual misbehaviour at the Walthamstow Infants School.
                 FitzRoy needed to get them out of England fast, and
                 thus was born the second, and most famous voyage of the
                 Beagle. FitzRoy feared the loneliness of another long
                 voyage --- with madness in his own family, he was
                 haunted by the fate of his predecessor --- so for
                 company he took with him a young amateur naturalist,
                 Charles Darwin. Like FitzRoy, Darwin believed, at the
                 beginning of the voyage, in the absolute word of the
                 Bible. The two men spent five years circling the globe
                 together, but by the end of their voyage, they had
                 reached startlingly different conclusions about the
                 origins of the natural world. In naval terms, the
                 voyage was a stunning scientific success. But FitzRoy,
                 a passionate Christian, was horrified by Darwin's
                 heretical theories. As these began to influence the
                 profoundest levels of religious and scientific thinking
                 in the nineteenth century, FitzRoy's knowledge that he
                 had provided the young naturalist with the vehicle for
                 his sacrilegious ideas propelled him down an
                 irrevocable path to suicide.",
  acknowledgement = ack-nhfb,
  subject =      "Fitzroy, Robert; Darwin, Charles; Tierra del Fuego
                 (Argentina and Chile); Description and travel;
                 Magellan, Strait of (Chile and Argentina)",
  subject-dates = "Charles Darwin (1805--1865); Robert Fitzroy
                 (1809--1882)",
}

@Book{Nielson:1997:SVO,
  author =       "Gregory M. Nielson and Hans Hagen and Heinrich
                 M{\"u}ller",
  title =        "Scientific Visualization: Overviews, Methodologies,
                 and Techniques",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "xiii + 577",
  year =         "1997",
  ISBN =         "0-8186-7777-5",
  ISBN-13 =      "978-0-8186-7777-9",
  LCCN =         "Q175.N438 1997",
  bibdate =      "Wed Jan 27 06:33:19 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "IEEE catalog number BP07777.",
  price =        "US\$79.00",
  abstract =     "Presents the state of the art in scientific
                 visualization techniques both as an overview for the
                 inquiring scientist and as a basic foundation for
                 developers. The emphasis has been to present the
                 extensive detail necessary for the reader to
                 reconstruct the techniques and algorithms in the book.
                 The book is organized in three sections: Overviews and
                 Surveys, Frameworks and Methodologies, and Techniques
                 and Algorithms.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  tableofcontents = "Overviews and surveys \\
                 30 years of multidimensional multivariate visualization
                 \\
                 Immersive investigation of scientific data \\
                 Survey of grid generation methodologies and scientific
                 visualization efforts \\
                 An environment for computational steering \\
                 Scientific visualization of large-scale unsteady fluid
                 flows \\
                 Frameworks and methodologies \\
                 Integrated volume rendering and data analysis in
                 wavelet space \\
                 An approach to intelligent design of color
                 visualizations \\
                 Engineering perceptually effective visualizations for
                 abstract data \\
                 Studies in comparative visualization of flow features
                 \\
                 Toward a systematic analysis for designing
                 visualizations \\
                 Controlled interpolation for scientific visualization",
}

@Book{Nisan:2021:ECS,
  author =       "Noam Nisan and Shimon Schocken",
  title =        "The Elements of Computing Systems Building a Modern
                 Computer from First Principles",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  edition =      "Second",
  pages =        "xv + 325",
  year =         "2021",
  ISBN =         "0-262-53980-2 (paperback), 0-262-36100-0",
  ISBN-13 =      "978-0-262-53980-7 (paperback), 978-0-262-36100-2",
  LCCN =         "TK7888.3",
  bibdate =      "Mon Aug 21 14:51:26 MDT 2023",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "https://mitpress.mit.edu/search-result-list/?keyword=978-0-262-53980-7",
  abstract =     "A new and extensively revised edition of a popular
                 textbook used in universities, coding boot camps,
                 hacker clubs, and online courses. The best way to
                 understand how computers work is to build one from
                 scratch, and this textbook leads learners through
                 twelve chapters and projects that gradually build the
                 hardware platform and software hierarchy for a simple
                 but powerful computer system. In the process, learners
                 gain hands-on knowledge of hardware, architecture,
                 operating systems, programming languages, compilers,
                 data structures and algorithms, and software
                 engineering. Using this constructive approach, the book
                 introduces learners to a significant body of computer
                 science knowledge and demonstrates how theoretical and
                 applied techniques taught in other computer science
                 courses fit into the overall picture. The outcome of
                 these efforts is known as Nand to Tetris: a journey
                 that starts with the most elementary logic gate, called
                 Nand, and ends, twelve projects later, with a
                 general-purpose computer system capable of running
                 Tetris.",
  acknowledgement = ack-nhfb,
  author-dates = "1961--",
  libnote =      "Not in my library.",
  subject =      "Electronic digital computers; computers;
                 Programmierung; Datenverarbeitung;
                 Computerarchitektur",
  tableofcontents = "Preface \\
                 I. Hardware \\
                 1: Boolean logic \\
                 2: Boolean arithmetic \\
                 3: Memory \\
                 4: Machine language \\
                 5: Computer architecture \\
                 6: Assembler \\
                 II. Software \\
                 7: Virtual machine I: processing \\
                 8: Virtual machine II: control \\
                 9: High-level language \\
                 10: Compiler I: syntax analysis \\
                 11: Compiler II: code generation \\
                 12: Operating system \\
                 13: More fun to go \\
                 Appendices \\
                 1: Boolean function synthesis \\
                 2: Hardware description language \\
                 3: Test description language \\
                 4: The hack chip set \\
                 5: The hack character set \\
                 6: the Jack OS API",
}

@Book{NISO:1991:EMP,
  author =       "National Information Standards Organization",
  title =        "Electronic Manuscript Preparation and Markup: American
                 National Standard for Electronic Manuscript Preparation
                 and Markup",
  publisher =    pub-TRANSACTION,
  address =      pub-TRANSACTION:adr,
  pages =        "xv + 167",
  year =         "1991",
  ISBN =         "0-88738-945-7",
  ISBN-13 =      "978-0-88738-945-0",
  LCCN =         "Z286.E43 E428 1991",
  bibdate =      "Thu Jun 23 16:40:14 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ansistd.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/sgml.bib;
                 https://www.math.utah.edu/pub/tex/bib/standard.bib",
  note =         "ANSI/NISO Z39.59-1988. Approved December 1, 1988, by
                 American National Standards Institute. Developed by The
                 National Information Standards Organization.",
  abstract =     "This standard is an application of the Standard
                 Generalized Markup Language [SGML], ISO 8879. This
                 standard specifies the syntax of generic tags and
                 provides predefined tags for commonly occurring
                 manuscript elements applicable to a wide variety of
                 manuscript preparation and markup applications.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

@Book{Nocedal:2006:NO,
  author =       "Jorge Nocedal and Stephen J. Wright",
  title =        "Numerical Optimization",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Second",
  pages =        "xxii + 664",
  year =         "2006",
  DOI =          "https://doi.org/10.1007/978-0-387-40065-5",
  ISBN =         "0-387-30303-0 (hardcover)",
  ISBN-13 =      "978-0-387-30303-1 (hardcover)",
  LCCN =         "QA402.5 .N62 2006",
  bibdate =      "Mon May 5 12:41:59 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/numana2000.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Springer series in operations research",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0818/2006923897-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0818/2006923897-t.html",
  abstract =     "\booktitle{Numerical Optimization} presents a
                 comprehensive and up-to-date description of the most
                 effective methods in continuous optimization. It
                 responds to the growing interest in optimization in
                 engineering, science, and business by focusing on the
                 methods that are best suited to practical problems. For
                 this new edition the book has been thoroughly updated
                 throughout. There are new chapters on nonlinear
                 interior methods and derivative-free methods for
                 optimization, both of which are used widely in practice
                 and the focus of much current research. Because of the
                 emphasis on practical methods, as well as the extensive
                 illustrations and exercises, the book is accessible to
                 a wide audience. It can be used as a graduate text in
                 engineering, operations research, mathematics, computer
                 science, and business. It also serves as a handbook for
                 researchers and practitioners in the field. The authors
                 have strived to produce a text that is pleasant to
                 read, informative, and rigorous - one that reveals both
                 the beautiful nature of the discipline and its
                 practical side.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Mathematical optimization",
  tableofcontents = "Preface \\
                 Preface to the Second Edition \\
                 1: Introduction \\
                 2: Fundamentals of Unconstrained Optimization \\
                 3: Line Search Methods \\
                 4: Trust-Region Methods \\
                 5: Conjugate Gradient Methods \\
                 6: Quasi-Newton Methods \\
                 7: Large-Scale Unconstrained Optimization \\
                 8: Calculating Derivatives \\
                 9: Derivative-Free Optimization \\
                 10: Least-Squares Problems \\
                 11: Nonlinear Equations \\
                 12: Theory of Constrained Optimization \\
                 13: Linear Programming: The Simplex Method \\
                 14: Linear Programming: Interior-Point Methods \\
                 15: Fundamentals of Algorithms for Nonlinear
                 Constrained Optimization \\
                 16: Quadratic Programming \\
                 17: Penalty and Augmented Lagrangian Methods \\
                 18: Sequential Quadratic Programming \\
                 19: Interior-Point Methods for Nonlinear Programming
                 \\
                 A: Background Material \\
                 B: A Regularization Procedure \\
                 References \\
                 Index",
}

@Book{Norton:1982:IIP,
  author =       "Peter Norton",
  title =        "Inside the {IBM PC}. Access to Advanced Features and
                 Programming",
  publisher =    pub-BRADY,
  address =      pub-BRADY:adr,
  pages =        "xi + 262",
  year =         "1982",
  ISBN =         "0-89303-556-4",
  ISBN-13 =      "978-0-89303-556-3",
  LCCN =         "QA76.8.I2594 N67 1983",
  bibdate =      "Wed Dec 15 10:40:04 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "An excellent treatment of the IBM PC.",
  acknowledgement = ack-nhfb,
}

@Book{Norton:1985:PGI,
  author =       "Peter Norton",
  title =        "Programmer's Guide to the {IBM PC}",
  publisher =    pub-MICROSOFT,
  address =      pub-MICROSOFT:adr,
  pages =        "xii + 426",
  year =         "1985",
  ISBN =         "0-914845-46-2",
  ISBN-13 =      "978-0-914845-46-1",
  LCCN =         "QA76.8.I2594 N68 1985",
  bibdate =      "Wed Jul 6 14:06:05 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "An excellent treatment of the programming IBM PC.
                 Strongly recommended for all serious users of the PC.",
  price =        "US\$19.95",
  abstract =     "Anatomy of the PC \\
                 The ins and outs \\
                 The ROM software \\
                 Video basics \\
                 Disk basics \\
                 Keyboard basics \\
                 Sound generation \\
                 ROM-BIOS basics \\
                 ROM-BIOS video services \\
                 ROM-BIOS diskette services \\
                 ROM-BIOS keyboard services \\
                 ROM-BIOS service summary \\
                 DOS basics \\
                 DOS interrupts \\
                 Universal DOS functions \\
                 DOS service summary \\
                 Programming language",
  acknowledgement = ack-nhfb,
}

@Book{Norton:1994:PNC,
  author =       "Peter Norton",
  title =        "{Peter Norton}'s complete guide to {DOS 6.22}",
  publisher =    pub-SAMS,
  address =      pub-SAMS:adr,
  pages =        "xlvi + 1150",
  year =         "1994",
  ISBN =         "0-672-30614-X",
  ISBN-13 =      "978-0-672-30614-3",
  LCCN =         "QA76.76.O63N6779 1994",
  bibdate =      "Fri Aug 21 12:55:48 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$29.99 (CAN \$39.99)",
  acknowledgement = ack-nhfb,
}

@Book{Nye:1988:XPM,
  author =       "Adrian Nye",
  title =        "{Xlib} Programming Manual for Version 11",
  volume =       "1",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xxxiii + 615",
  year =         "1988",
  ISBN =         "0-937175-26-9, 0-937175-89-7",
  ISBN-13 =      "978-0-937175-26-2, 978-0-937175-89-7",
  LCCN =         "QA76.76.W56 D44 v.1 1988",
  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/texgraph.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  URL =          "http://www.oreilly.com/catalog/9780937175262",
  acknowledgement = ack-nhfb,
}

@Book{Nye:1988:XRM,
  author =       "Adrian Nye",
  title =        "{Xlib} Reference Manual for Version 11",
  volume =       "2",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xiv + 701",
  year =         "1988",
  ISBN =         "0-937175-27-7",
  ISBN-13 =      "978-0-937175-27-9",
  LCCN =         "QA76.76.W56 D44 v.2 1988",
  bibdate =      "Wed Dec 15 10:40:05 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Nye:1990:XPR,
  author =       "Adrian Nye",
  title =        "{X} Protocol Reference Manual",
  volume =       "0",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  edition =      "Second",
  pages =        "xv + 483",
  year =         "1990",
  ISBN =         "0-937175-50-1",
  ISBN-13 =      "978-0-937175-50-7",
  LCCN =         "QA76.76.W56 X215 1990",
  bibdate =      "Fri Dec 10 13:42:12 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

@Book{Nye:1990:XTI,
  author =       "Adrian Nye and Tim O'Reilly",
  title =        "{X} Toolkit Intrinsics Programming Manual",
  volume =       "4",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xxxi + 543",
  year =         "1990",
  ISBN =         "0-937175-34-X",
  ISBN-13 =      "978-0-937175-34-7",
  LCCN =         "QA76.9.W56 N94 1990",
  bibdate =      "Wed Dec 15 19:46:34 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Nye:1990:XTIb,
  author =       "Adrian Nye and Tim O'Reilly",
  title =        "{X} Toolkit Intrinsics Reference Manual: {OSF}\slash
                 {Motif} 1.1 Edition for {X11}, Release 4",
  volume =       "4",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  edition =      "Second",
  pages =        "xxxi + 632",
  month =        dec,
  year =         "1990",
  ISBN =         "0-937175-62-5 (vol. 4), 0-937175-66-8 (set)",
  ISBN-13 =      "978-0-937175-62-0 (vol. 4), 978-0-937175-66-8 (set)",
  LCCN =         "QA76.9.W56N94 1990",
  bibdate =      "Mon Nov 20 10:48:16 1995",
  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/9780937175620",
  abstract =     "Introduction to the X Window System \\
                 Introduction to the X Toolkit and Motif \\
                 More techniques for using widgets \\
                 An example application \\
                 More about Motif \\
                 Inside a widget \\
                 Basic Widget methods \\
                 Events, translations, and accelerators \\
                 More input techniques \\
                 Resource management and type conversion \\
                 Interclient communications \\
                 Geometry management \\
                 Menus, gadgets, and cascaded popups \\
                 Miscellaneous toolkit programming techniques \\
                 Athena, OPEN LOOK, and Motif \\
                 Specifying fonts and colors \\
                 Naming conventions \\
                 Release notes \\
                 The xbitmap application \\
                 Sources of additional information",
  acknowledgement = ack-nhfb,
}

@Book{Nye:1992:XPR,
  author =       "Adrian Nye",
  title =        "{X} Protocol Reference Manual",
  volume =       "0",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  edition =      "Third",
  year =         "1992",
  ISBN =         "1-56592-008-2",
  ISBN-13 =      "978-1-56592-008-8",
  LCCN =         "QA76.76.W56 X215 1990",
  bibdate =      "Fri Dec 10 13:42:12 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/9781565920088",
  acknowledgement = ack-nhfb,
  tableofcontents = "Preface / xvii \\
                 About This Manual / xvii \\
                 Summary of Contents / xvii \\
                 How to Use This Manual / xix \\
                 Assumptions / xix \\
                 Font Conventions Used in This Manual / xix \\
                 Related Documents / xx \\
                 Request for Comments / xx \\
                 Bulk Sales Information / xxi \\
                 Acknowledgments / xxi \\
                 Part One: Introduction to the X Protocol / 3 \\
                 1.1 The Server and Client / 4 \\
                 1.2 The X Protocol / 7 \\
                 1.2.1 Message Types / 8 \\
                 1.2.2 Division of Responsibilities / 9 \\
                 1.3 A Sample Session / 11 \\
                 1.3.1 Opening the Connection / 13 \\
                 1.3.2 Creating a Window / 19 \\
                 1.3.2.1 Selecting Events / 22 \\
                 1.3.3 A Request with Reply / 22 \\
                 1.3.4 Creating a Graphics Context / 25 \\
                 1.3.5 Mapping a Window / 25 \\
                 1.3.6 The Expose Event / 26 \\
                 1.3.7 Drawing a Graphic / 27 \\
                 1.3.8 Closing the Connection / 28 \\
                 1.3.9 Errors / 29 \\
                 1.4 Implementing the X Protocol / 31 \\
                 1.4.1 Client Library Implementation / 31 \\
                 1.4.2 Server Implementation / 33 \\
                 1.4.3 Reducing Network Traffic / 34 \\
                 1.4.4 Implementation on Multi-threaded Architectures /
                 34 \\
                 1.4.5 Security / 35 \\
                 1.4.6 Inter-client Communication / 35 \\
                 1.5 Future Directions / 36 \\
                 Part Two: Protocol Request and Event Reference / 37 \\
                 Introduction / 39 \\
                 Connection Setup / 50 \\
                 AllocColor / 59 \\
                 AllocColorCells / 61 \\
                 AllocColorPlanes / 63 \\
                 AllocNamedColor / 65 \\
                 AllowEvents / 67 \\
                 Bell / 70 \\
                 ButtonPress / 71 \\
                 ButtonRelease / 72 \\
                 ChangeActivePointerGrab / 73 \\
                 ChangeGC / 74 \\
                 ChangeHosts / 75 \\
                 ChangeKeyboardControl / 77 \\
                 ChangeKeyboardMapping / 80 \\
                 ChangePointerControl / 82 \\
                 ChangeProperty / 83 \\
                 ChangeSaveSet / 85 \\
                 ChangeWindowAttributes / 86 \\
                 CirculateNotify / 88 \\
                 CirculateRequest / 89 \\
                 Circulate Window / 89 \\
                 ClearArea / 90 \\
                 ClientMessage / 91 \\
                 CloseFont / 92 \\
                 ColormapNotify / 93 \\
                 ConfigureNotify / 94 \\
                 ConfigureRequest / 95 \\
                 ConfigureWindow / 97 \\
                 ConvertSelection / 101 \\
                 CopyArea / 102 \\
                 CopyColormapAndFree / 104 \\
                 CopyGC / 105 \\
                 CopyPlane / 106 \\
                 CreateColormap / 108 \\
                 CreateCursor / 109 \\
                 CreateGC / 111 \\
                 CreateGlyphCursor / 120 \\
                 CreateNotify / 122 \\
                 CreatePixmap / 123 \\
                 CreateWindow / 124 \\
                 DeleteProperty / 130 \\
                 DestroyNotify / 131 \\
                 DestroySubwindows / 132 \\
                 DestroyWindow / 133 \\
                 Expose / 136 \\
                 FillPoly / 138 \\
                 Focusln / 140 \\
                 FocusOut / 141 \\
                 ForceScreenSaver / 145 \\
                 FreeColormap / 146 \\
                 FreeColors / 147 \\
                 FreeCursor / 148 \\
                 FreeGC / 149 \\
                 FreePixmap / 150 \\
                 GetAtomName / 151 \\
                 GetFontPath / 152 \\
                 GetGeometry / 153 \\
                 GetImage / 155 \\
                 GetInputFocus / 157 \\
                 GetKeyboardControl / 158 \\
                 GetKeyboardMapping / 160 \\
                 GetModifierMapping / 162 \\
                 GetMotionEvents / 163 \\
                 GetPointerControl / 165 \\
                 GetPointerMapping / 166 \\
                 GetProperty / 167 \\
                 GetScreenSaver / 169 \\
                 GetSelectionOwner / 170 \\
                 GetWindowAttributes / 171 \\
                 GrabButton / 173 \\
                 GrabKey / 175 \\
                 GrabKeyboard / 177 \\
                 GrabPointer / 179 \\
                 GrabServer / 182 \\
                 GraphicsExpose / 183 \\
                 GravityNotify / 184 \\
                 ImageText16 / 185 \\
                 ImageText8 / 186 \\
                 InstallColormap / 188 \\
                 InternAtom / 189 \\
                 KeymapNotify / 191 \\
                 KeyPress / 192 \\
                 KeyRelease / 193 \\
                 KillClient / 194 \\
                 LeaveNotify / 195 \\
                 ListExtensions / 198 \\
                 ListFonts / 199 \\
                 ListFontsWithlnfo / 201 \\
                 ListHosts / 204 \\
                 ListlnstalledColormaps / 205 \\
                 ListProperties / 206 \\
                 LookupColor / 207 \\
                 MapNotify / 209 \\
                 MappingNotify / 210 \\
                 MapRequest / 211 \\
                 MapSubwindows / 212 \\
                 MapWindow / 213 \\
                 MotionNotify / 214 \\
                 NoExpose / 216 \\
                 NoOperation / 217 \\
                 OpenFont / 218 \\
                 PolyArc / 219 \\
                 PolyFillArc / 221 \\
                 PolyFillRectangle / 222 \\
                 PolyLine / 223 \\
                 PolyPoint / 224 \\
                 PolyRectangle / 225 \\
                 PolySegment / 226 \\
                 PolyText16 / 228 \\
                 PolyText8 / 230 \\
                 PropertyNotify / 232 \\
                 Putimage / 233 \\
                 QueryBestSize / 235 \\
                 QueryColors / 237 \\
                 QueryExtension / 239 \\
                 QueryFont / 241 \\
                 Query Key map / 245 \\
                 QueryPointer / 246 \\
                 QueryTextExtents / 248 \\
                 Query Tree / 249 \\
                 RecoIorCursor / 250 \\
                 ReparentNotify / 251 \\
                 ReparentWindow / 252 \\
                 ResizeRequest / 253 \\
                 RotateProperties / 254 \\
                 SelectionClear / 255 \\
                 SelectionNotify / 256 \\
                 SelectionRequest / 257 \\
                 SendEvent / 258 \\
                 SetAccessControl / 260 \\
                 SetClipRectangles / 261 \\
                 SetCloseDownMode / 263 \\
                 SetDashes / 264 \\
                 SetFontPath / 265 \\
                 SetlnputFocus / 266 \\
                 SetModifierMapping / 268 \\
                 SetPointerMapping / 270 \\
                 SetScreenSaver / 272 \\
                 SetSelectionOwner / 274 \\
                 StoreColors / 275 \\
                 StoreNamedColor / 277 \\
                 TranslateCoordinates / 278 \\
                 UngrabButton / 280 \\
                 UngrabKey / 281 \\
                 UngrabKeyboard / 282 \\
                 UngrabPointer / 283 \\
                 UngrabServer / 284 \\
                 UninstallColormap / 285 \\
                 UnmapNotify / 286 \\
                 UnmapSubwindows / 287 \\
                 UnmapWindow / 288 \\
                 VisibilityNotify / 289 \\
                 WarpPointer / 291 \\
                 Part Three: Appendices / 295 \\
                 Appendix A: Connection Close / 295 \\
                 Appendix B: Keysyms / 297 \\
                 X Protocol X11, Release 3 / 297 \\
                 Appendix C: Errors / 321 \\
                 Encoding / 323 \\
                 Appendix D: Predefined Atoms / 329 \\
                 Encoding / 330 \\
                 Appendix E: Keyboards and Pointers / 331 \\
                 Keyboards / 331 \\
                 Pointers / 332 \\
                 Encoding / 333 \\
                 Keyboards / 333 \\
                 Pointers / 333 \\
                 Appendix F: Flow Control and Concurrency / 335 \\
                 Appendix G: Request Group Summary / 337 \\
                 Group Listing with Brief Description / 337 \\
                 Colors and Colormaps / 337 \\
                 Cursors / 338 \\
                 Drawing Graphics / 338 \\
                 Events / 339 \\
                 Fonts and Text / 339 \\
                 The Graphics Context / 340 \\
                 Images / 340 \\
                 Inter-client Communication / 340 \\
                 Keyboard and Pointer / 341 \\
                 Security / 342 \\
                 Window Characteristics / 342 \\
                 Window Manipulation by the Client / 342 \\
                 Window Manipulation by the Window Manager / 343 \\
                 Miscellaneous / 343 \\
                 Appendix H: Alphabetical Listing of Requests / 345 \\
                 Appendix I: Xlib Functions to Protocol Requests and
                 Vice Versa / 351 \\
                 Appendix J: Protocol Requests by Opcode / 363 \\
                 Appendix K: Events Briefly Described / 365 \\
                 Appendix L: Inter-Client Communication Conventions
                 Manual / 369 \\
                 L.1 Introduction / 369 \\
                 L.1.1 Evolution of the Conventions / 370 \\
                 L.1.2 Atoms / 370 \\
                 L.1.2.1 What Are Atoms? / 370 \\
                 L.1.2.2 Predefined Atoms / 371 \\
                 L.1.2.3 Naming Conventions / 371 \\
                 L.1.2.4 Semantics / 371 \\
                 L.1.2.5 Name Spaces / 372 \\
                 L.2 Peer-to-Peer Communication by Means of Selections /
                 372 \\
                 L.2.1 Acquiring Selection Ownership / 373 \\
                 L.2.2 Responsibilities of the Selection Owner / 374 \\
                 L.2.3 Giving Up Selection Ownership / 376 \\
                 L.2.3.1 Voluntarily Giving Up Selection Ownership / 376
                 \\
                 L.2.3.2 Forcibly Giving Up Selection Ownership / 376
                 \\
                 L.2.4 Requesting a Selection / 377 \\
                 L.2.5 Large Data Transfers / 378 \\
                 L.2.6 Use of Selection Atoms / 379 \\
                 L.2.6.1 Selection Atoms / 379 \\
                 L.2.6.2 Target Atoms / 381 \\
                 L.2.6.3 Selection Targets with Side Effects / 383 \\
                 L.2.7 Use of Selection Properties / 384 \\
                 L.2.7.1 TEXT Properties / 385 \\
                 L.2.7.2 INCR Properties / 385 \\
                 L.2.7.3 DRAWABLE Properties / 386 \\
                 L.2.7.4 SPAN Properties / 387 \\
                 L.3 Peer-to-Peer Communication by Means of Cut Buffers
                 / 387 \\
                 L.4 Client to Window Manager Communication / 388 \\
                 L.4.1 Client's Actions / 388 \\
                 L.4.1.1 Creating a Top-level Window / 389 \\
                 L.4.1.2 Client Properties / 389 \\
                 L.4.1.3 Window Manager Properties / 396 \\
                 L.4.1.4 Changing Window State / 397 \\
                 L.4.1.5 Configuring the Window / 399 \\
                 L.4.1.6 Changing Window Attributes / 400 \\
                 L.4.1.7 Input Focus / 401 \\
                 L.4.1.8 Colormaps / 403 \\
                 L.4.1.9 Icons / 405 \\
                 L.4.1.10 Pop-up Windows / 406 \\
                 L.4.1.11 Window Groups / 407 \\
                 L.4.2 Client Responses to Window Manager Actions / 407
                 \\
                 L.4.2.1 Reparenting / 407 \\
                 L.4.2.2 Redirection of Operations / 408 \\
                 L.4.2.3 Window Move / 409 \\
                 L.4.2.4 Window Resize / 410 \\
                 L.4.2.5 Iconify and Deiconify / 410 \\
                 L.4.2.6 Colormap Change / 410 \\
                 L.4.2.7 Input Focus / 410 \\
                 L.4.2.8 ClientMessage Events / 411 \\
                 L.4.2.9 Redirecting Requests / 412 \\
                 L.4.3 Summary of Window Manager Property Types / 412
                 \\
                 L.5 Client to Session Manager Communication / 413 \\
                 L.5.1 Client Actions / 413 \\
                 L.5.1.1 Properties / 413 \\
                 L.5.1.2 Termination / 415 \\
                 L.5.2 Client Responses to Session Manager Actions / 415
                 \\
                 L.5.2.1 Saving Client State / 416 \\
                 L.5.2.2 Window Deletion / 417 \\
                 L.5.3 Summary of Session Manager Property Types / 417
                 \\
                 L.6 Manipulation of Shared Resources / 418 \\
                 L.6.1 The Input Focus / 418 \\
                 L.6.2 The Pointer / 418 \\
                 L.6.3 Grabs / 419 \\
                 L.6.4 Colormaps / 420 \\
                 L.6.5 The Keyboard Mapping / 421 \\
                 L.6.6 The Modifier Mapping / 422 \\
                 L.7 Device Color Characterization / 423 \\
                 L.7.1 XYZ RGB Conversion Matrices / 424 \\
                 L.7.2 Intensity RGB value Conversion / 425 \\
                 L.8 Compatibility with Earlier Drafts / 427 \\
                 L.8.1 The R2 Draft / 427 \\
                 L.8.2 The July 27,1988 Draft / 428 \\
                 L.8.3 The Public Review Drafts / 429 \\
                 L.9 Suggested Protocol Revisions / 429 \\
                 Appendix M: Compound Text Encoding / 433 \\
                 M.1 Overview / 433 \\
                 M.2 Values / 433 \\
                 M.3 Control Characters / 434 \\
                 M.4 Standard Character Set Encodings / 435 \\
                 M.5 Approved Standard Encodings / 436 \\
                 M.6 Non-Standard Character Set Encodings / 437 \\
                 M.7 Directionality / 438 \\
                 M.8 Resources / 438 \\
                 M.9 Font Names / 439 \\
                 M.10 Extensions / 439 \\
                 M.11 Errors / 440 \\
                 Appendix N: X Logical Font Description Conventions,
                 Release 5 / 441 \\
                 N.1 Introduction / 441 \\
                 N.2 Requirements and Goals / 442 \\
                 N.2.1 Provide Unique and Descriptive Font Names / 442
                 \\
                 N.2.2 Support Multiple Font Vendors and Character Sets
                 / 442 \\
                 N.2.3 Support Scalable Fonts / 443 \\
                 N.2.4 Be Independent of X Server and Operating or File
                 System Implementations / 443 \\
                 N.2.5 Support Arbitrarily Complex Font Matching and
                 Substitution / 443 \\
                 N.2.6 Be Extensible / 443 \\
                 N.3 X Logical Font Description / 443 \\
                 N.3.1 FontName / 444 \\
                 N.3.1.1 FontName Syntax / 444 \\
                 N.3.1.2 FontName Field Definitions / 445 \\
                 N.3.1.3 Examples / 451 \\
                 N.3.2 FontProperties / 452 \\
                 N.3.2.1 FOUNDRY / 453 \\
                 N.3.2.2 FAMILY\_NAME / 453 \\
                 N.3.2.3 WEIGHT\\_NAME / 453 \\
                 N.3.2.4 SLANT / 453 \\
                 N.3.2.5 SETWIDTH\_NAME / 454 \\
                 N.3.2.6 ADD\_STYLE\_NAME / 454 \\
                 N.3.2.7 PIXEL\_SIZE / 454 \\
                 N.3.2.8 POINT\_SIZE / 455 \\
                 N.3.2.9 RESOLUTION\_X / 455 \\
                 N.3.2.10 RESOLUTION\_Y / 455 \\
                 N.3.2.11 SPACING / 455 \\
                 N.3.2.12 AVERAGE\_WIDTH / 455 \\
                 N.3.2.13 CHARSET\_REGISTRY / 456 \\
                 N.3.2.14 CHARSET\_ENCODING / 456 \\
                 N.3.2.15 MIN\_SPACE / 456 \\
                 N.3.2.16 NORM\_SPACE / 456 \\
                 N.3.2.17 MAX\_SPACE / 457 \\
                 N.3.2.18 END\_SPACE / 457 \\
                 N.3.2.19 AVG\_CAPITAL\_WIDTH / 457 \\
                 N.3.2.20 AVG\_LOWERCASE\_WIDTH / 457 \\
                 N.3.2.21 QUAD\_WIDTH / 458 \\
                 N.3.2.22 FIGURE\_WIDTH / 458 \\
                 N.3.2.23 SUPERSCRIPT\_X / 458 \\
                 N.3.2.24 SUPERSCRIPT\_Y / 459 \\
                 N.3.2.25 SUBSCRIPT\_X / 459 \\
                 N.3.2.26 SUBSCRIPT\_Y / 459 \\
                 N.3.2.27 SUPERSCRIPT\_SIZE / 460 \\
                 N.3.2.28 SUBSCRIPT\_SIZE / 460 \\
                 N.3.2.29 SMALL\_CAP\_SIZE / 460 \\
                 N.3.2.30 UNDERLINE\_POSITION / 461 \\
                 N.3.2.31 UNDERLINE\_THICKNESS / 461 \\
                 N.3.2.32 STRIKEOUT\_ASCENT / 461 \\
                 N.3.2.33 STRIKEOUT\_DESCENT / 462 \\
                 N.3.2.34 ITALIC\_ANGLE / 462 \\
                 N.3.2.35 CAP\_HEIGHT / 462 \\
                 N.3.2.36 X\_HEIGHT / 463 \\
                 N.3.2.37 RELATIVE\_SETWIDTH / 463 \\
                 N.3.2.38 RELATIVE\_WEIGHT / 464 \\
                 N.3.2.39 WEIGHT / 464 \\
                 N.3.2.40 RESOLUTION / 465 \\
                 N.3.2.41 FACE\_NAME / 465 \\
                 N.3.2.42 COPYRIGHT / 465 \\
                 N.3.2.43 NOTICE / 465 \\
                 N.3.2.44 DESTINATION / 466 \\
                 N.3.3 Built-in Font Property Atoms / 466 \\
                 N.4 Scalable Fonts / 467 \\
                 N.5 Affected Elements of Xlib and the X Protocol / 469
                 \\
                 N.6 BDF Conformance / 469 \\
                 N.6.1 XLFD Conformance Requirements / 469 \\
                 N.6.2 FONT\_ASCENT, FONT\_DESCENT, and DEFAULT\_CHAR / 470
                 \\
                 N.6.2.1 FONT\_ASCENT / 470 \\
                 N.6.2.2 FONT\_DESCENT / 470 \\
                 N.6.2.3 DEFAULT\_CHAR / 471 \\
                 Appendix O: Bitmap Distribution Format / 473 \\
                 File Format / 473 \\
                 Metric Information / 475 \\
                 An Example File / 477 \\
                 Glossary / 479 \\
                 Index / 489",
}

@Book{Nye:1992:XTI,
  author =       "Adrian Nye and Tim O'Reilly",
  title =        "{X} Toolkit Intrinsics Programming Manual: Motif
                 Edition",
  volume =       "4M",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  edition =      "Second",
  pages =        "xxxviii + 674",
  month =        aug,
  year =         "1992",
  ISBN =         "1-56592-013-9",
  ISBN-13 =      "978-1-56592-013-2",
  LCCN =         "QA76.76.W56 N928 1992",
  bibdate =      "Thu Dec 16 09:46:22 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/ora.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

@Book{Nye:1993:XTI,
  author =       "Adrian Nye and Tim O'Reilly",
  title =        "{X Toolkit Intrinsics} Programming Manual",
  volume =       "4",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  edition =      "Third",
  pages =        "xxxvi + 567",
  month =        apr,
  year =         "1993",
  ISBN =         "1-56592-003-1",
  ISBN-13 =      "978-1-56592-003-3",
  LCCN =         "QA76.76.W56 N945 1993",
  bibdate =      "Thu Dec 16 09:46:22 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/9781565920033",
  abstract =     "Volume 4 is a complete guide to programming with the X
                 Toolkit Intrinsics, the library of C language routines
                 that facilitates the design of user interfaces with
                 reusable components called widgets. It provides
                 concepts and examples that show how to use the various
                 X Toolkit routines. The first few chapters are devoted
                 to using widgets; the remainder of the book covers the
                 more complex task of writing new widgets. Volume 4 is
                 available in two editions. The Standard Edition uses
                 Athena widgets in examples for X11 Release 5 to
                 demonstrate how to use existing widgets, while still
                 providing a good introduction to programming with any
                 widget set based on Xt. Volume 4 includes:Introduction
                 to the X Window System. Building applications with
                 widgets. Constructing a bitmap editor with widgets. An
                 overview of each widget in the widget set. Basic widget
                 methods. Events, translations, and accelerators. Event
                 handlers, timeouts, and work procedures. Resource
                 management and type conversion. Selections and window
                 manager interaction. Geometry management. Menus,
                 gadgets, and cascaded pop-ups. Miscellaneous
                 techniques.Comparison of Athena, OSF/Motif, and AT and
                 T OPEN LOOK widgets. This book is designed to be used
                 with Volume 5,X Toolkit Intrinsics Reference Manual,
                 which provides reference pages for each of the Xt
                 functions, the widget classes defined by Xt, and the
                 Athena widget set.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "1: Introduction to the X Window System \\
                 2: Introduction to the X Toolkit \\
                 3: More techniques for using widgets \\
                 4: An example application \\
                 5: The Athena Widget set \\
                 6: Inside a widget \\
                 7: Basic widget methods \\
                 8: Events, translations, and accelerators \\
                 9: More input techniques \\
                 10: Resource management and type conversion \\
                 11: Interclient communications \\
                 12: Geometry management \\
                 13: Menus gadgets, and cascaded popups \\
                 14: Miscellaneous toolkit programming techniques \\
                 Appendix A: Athena, OPEN LOOK, and Motif \\
                 Appendix B: Specifying Fonts and Colors \\
                 Appendix C: Naming Conventions \\
                 Appendix D: Release Notes \\
                 Appendix E: The xbitmap Application \\
                 Appendix F: Sources of Additional Information",
}

@Book{Nystrom:2021:CI,
  author =       "Robert Nystrom",
  title =        "Crafting Interpreters",
  publisher =    "Genever Benning",
  address =      "????",
  pages =        "vii + 626",
  year =         "2021",
  ISBN =         "0-9905829-3-0",
  ISBN-13 =      "978-0-9905829-3-9",
  LCCN =         "????",
  bibdate =      "Wed Dec 15 15:48:20 MST 2021",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  remark =       "Despite using them every day, most software engineers
                 know little about how programming languages are
                 designed and implemented. For many, their only
                 experience with that corner of computer science was a
                 terrifying ``compilers'' class that they suffered
                 through in undergrad and tried to blot from their
                 memory as soon as they had scribbled their last NFA to
                 DFA conversion to the final exam. The fearsome
                 reputation belies a field that rich with useful
                 techniques and not difficult as some of its
                 practitioners might have you believe. A better
                 understanding of how programming languages are built
                 will make you a stronger software engineer and teach
                 you concepts and data structures you'll use the rest of
                 your coding day. You might have fun. This book teaches
                 you everything you need know to implement a
                 full-featured, efficient scripting language. You'll
                 learn both high-level concepts around parsing and
                 semantics and gritty details like bytecode
                 representation and garbage collection. Your brain will
                 light up with new ideas, and your hands will get dirty
                 and calloused. Starting from main (), you will build a
                 language that features rich syntax, dynamic typing,
                 garbage collection, lexical scope, first-class
                 functions, closures, classes, and inheritance.All
                 packed into a few thousand lines of clean, fast code
                 that you thoroughly understand because you wrote each
                 one yourself.",
  subject =      "Programmation; Langages de programmation",
  tableofcontents = "Part I \\
                 Welcome \\
                 Introduction \\
                 A map of the territory \\
                 The Lox language \\
                 Part II \\
                 A tree-walk interpreter \\
                 Scanning \\
                 Representing code \\
                 Parsing expressions \\
                 Evaluating expressions \\
                 Statements and state \\
                 Control flow \\
                 Functions \\
                 Resolving and binding \\
                 Classes \\
                 Inheritance \\
                 Part III \\
                 A bytecode virtual machine \\
                 Chunks of bytecode \\
                 A virtual machine \\
                 Scanning on demand \\
                 Compiling expressions \\
                 Types of values \\
                 Strings \\
                 Hash tables \\
                 Global variables \\
                 Local variables \\
                 Jumping back and forth \\
                 Calls and functions \\
                 Closures \\
                 Garbage collection \\
                 Classes and instances \\
                 Methods and initializers \\
                 Superclasses \\
                 Optimization",
}

@Book{Oakley:1949:AG,
  author =       "C. O. Oakley",
  title =        "Analytic Geometry",
  publisher =    pub-BARNES-NOBLE,
  address =      pub-BARNES-NOBLE:adr,
  year =         "1949",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "College Outline Series",
  acknowledgement = ack-nhfb,
}

@Book{Oakley:1958:AGP,
  author =       "C. O. Oakley",
  title =        "Analytic Geometry Problems with Solutions",
  publisher =    pub-BARNES-NOBLE,
  address =      pub-BARNES-NOBLE:adr,
  year =         "1958",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "College Outline Series",
  acknowledgement = ack-nhfb,
}

@Book{Ogletree:1999:URN,
  author =       "Terry William Ogletree",
  title =        "Upgrading and Repairing Networks",
  publisher =    pub-QUE,
  address =      pub-QUE:adr,
  pages =        "xxi + 979",
  year =         "1999",
  ISBN =         "0-7897-2034-5, 0-585-34490-6 (e-book)",
  ISBN-13 =      "978-0-7897-2034-4, 978-0-585-34490-4 (e-book)",
  LCCN =         "TK5105.5 .O344 1999",
  bibdate =      "Wed May 16 14:58:17 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Includes CD-ROM.",
  price =        "US\$49.99",
  acknowledgement = ack-nhfb,
  annote =       "This book has excellent coverage of many aspects of
                 network hardware and software.",
}

@Book{Ohanian:2008:EMH,
  author =       "Hans C. Ohanian",
  title =        "{Einstein}'s Mistakes: the Human Failings of Genius",
  publisher =    pub-NORTON,
  address =      pub-NORTON:adr,
  pages =        "xix + 394",
  year =         "2008",
  ISBN =         "0-393-06293-7",
  ISBN-13 =      "978-0-393-06293-9",
  LCCN =         "QC7 .O33 2008",
  bibdate =      "Thu Aug 21 17:35:23 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Physics; History; Philosophy; Science; Einstein,
                 Albert",
  subject-dates = "Albert Einstein (1879--1955)",
  tableofcontents = "Chronology of Einstein's mistakes \\
                 I will resign the game \\
                 A lovely time in Berne \\
                 And yet it moves \\
                 If I have seen farther \\
                 A storm broke loose in my mind \\
                 Motions of inanimate, small, suspended bodies \\
                 What is the light quantum? \\
                 The argument is jolly and beguiling \\
                 Suddenly I had an idea \\
                 The theory is of incomparable beauty \\
                 The world is a madhouse \\
                 Does God play dice? \\
                 The graveyard of disappointed hopes \\
                 Post-mortem",
}

@Book{Olver:1974:ASF,
  author =       "F. W. J. Olver",
  title =        "Asymptotics and Special Functions",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "xvi + 572",
  year =         "1974",
  ISBN =         "0-12-525850-X",
  ISBN-13 =      "978-0-12-525850-0",
  LCCN =         "QA351 .O481 1974",
  bibdate =      "Wed Dec 15 10:40:06 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "Preface / xv \\
                 1: Introduction to Asymptotic Analysis \\
                 2: Introduction to Special Functions \\
                 3: Integrals of a Real Variable \\
                 4: Contour Integrals \\
                 5: Differential Equations with Regular Singularities;
                 Hypergeometric and Legendre Functions \\
                 6: The Liouville--Green Approximation \\
                 7: Differential Equations with Irregular Singularities;
                 Bessel and Confluent Hypergeometric Functions \\
                 8: Sums and Sequences \\
                 9: Integrals: Further Methods \\
                 10: Differential Equations with a Parameter: Expansions
                 in Elementary Functions \\
                 11: Differential Equations with a Parameter: Turning
                 Points \\
                 12: Differential Equations with a Parameter: Simple
                 Poles and Other Transition Points \\
                 13: Connection Formulas for Solutions of Differential
                 Equations \\
                 14: Estimation of Remainder Terms \\
                 Answers to Exercises / 545 \\
                 References / 548 \\
                 Index of Symbols / 561 \\
                 General Index / 563",
  subject =      "Functions, Special; Asymptotic expansions;
                 Differential equations; Numerical solutions; Fonctions
                 sp{\'e}ciales; D{\'e}veloppements asymptotiques;
                 {\'E}quations diff{\'e}rentielles; Solutions
                 num{\'e}riques; Asymptotic expansions; Numerical
                 solutions; Functions, Special; Reeksontwikkelingen;
                 Asymptotisch gedrag; Differentiaalvergelijkingen;
                 Asymptotik; Asymptotische Entwicklung;
                 Differentialgleichung; Numerisches Verfahren; Spezielle
                 Funktion.",
  tableofcontents = "Preface / xv \\
                 1: Introduction to Asymptotic Analysis / 1 \\
                 1 Origin of Asymptotic Expansions / 4 \\
                 2 The Symbols $\sim$, $o$, and $0$ / 6 \\
                 3 The Symbols $\sim$, $o$, and $O$ (continued) / 8 \\
                 4 Integration and Differentiation of Asymptotic and
                 Order Relations / 11 \\
                 5 Asymptotic Solution of Transcendental Equations: Real
                 Variables / 14 \\
                 6 Asymptotic Solution of Transcendental Equations:
                 Complex Variables / 16 \\
                 7 Definition and Fundamental Properties of Asymptotic
                 Expansions / 19 \\
                 8 Operations with Asymptotic Expansions / 22 \\
                 9 Functions Having Prescribed Asymptotic Expansions /
                 24 \\
                 10 Generalizations of Poincar{\'e}'s Definition / 27
                 \\
                 11 Error Analysis; Variational Operator Historical
                 Notes and Additional References / 29 \\
                 2: Introduction to Special Functions \\
                 1 The Gamma Function / 31 \\
                 2 The Psi Function / 39 \\
                 3 Exponential, Logarithmic, Sine, and Cosine Integrals
                 / 40 \\
                 4 Error Functions, Dawson's Integral, and Fresnel
                 Integrals / 43 \\
                 5 Incomplete Gamma Functions / 45 \\
                 6 Orthogonal Polynomials / 46 \\
                 7 The Classical Orthogonal Polynomials / 48 \\
                 8 The Airy Integral / 53 \\
                 9 The Bessel Function $J_\nu(z)$ / 55 \\
                 1O The Modified Bessel Function $I_\nu(z)$ / 60 \\
                 11 The Zeta Function / 61 \\
                 Historical Notes and Additional References / 64 \\
                 3: Integrals of a Real Variable \\
                 1 Integration by Parts / 66 \\
                 2 Laplace Integrals / 67 \\
                 3 Watson's Lemma / 71 \\
                 4 The Riemann--Lebesgue Lemma / 73 \\
                 5 Fourier Integrals / 75 \\
                 6 Examples; Cases of Failure / 76 \\
                 7 Laplace's Method / 80 \\
                 8 Asymptotic Expansions by Laplace's Method; Gamma
                 Function of Large Argument / 85 \\
                 9 Error Bounds for Watson's Lemma and Laplace's Method
                 / 89 \\
                 10 Examples / 92 \\
                 11 The Method of Stationary Phase / 96 \\
                 12 Preliminary Lemmas / 98 \\
                 13 Asymptotic Nature of the Stationary Phase
                 Approximation / 100 \\
                 14 Asymptotic Expansions by the Method of Stationary
                 Phase / 104 \\
                 Historical Notes and Additional References / 104 \\
                 4: Contour Integrals \\
                 1 Laplace Integrals with a Complex Parameter / 106 \\
                 2 Incomplete Gamma Functions of Complex Argument / 109
                 \\
                 3 Watson's Lemma / 112 \\
                 4 Airy Integral of Complex Argument; Compound
                 Asymptotic Expansions / 116 \\
                 5 Ratio of Two Gamma Functions; Watson's Lemma for Loop
                 Integrals / 118 \\
                 6 Laplace's Method for Contour Integrals / 121 \\
                 7 Saddle Points / 125 \\
                 8 Examples / 127 \\
                 9 Bessel Functions of Large Argument and Order / 130
                 \\
                 10 Error Bounds for Laplace's Method; the Method of
                 Steepest Descents / 135 \\
                 Historical Notes and Additional References / 137 \\
                 5: Differential Equations with Regular Singularities;
                 Hypergeometric and Legendre Functions \\
                 Existence Theorems for Linear Differential Equations:
                 Real Variables / 139 \\
                 2 Equations Containing a Real or Complex Parameter /
                 143 \\
                 3 Existence Theorems for Linear Differential Equations:
                 Complex Variables / 145 \\
                 4 Classification of Singularities; Nature of the
                 Solutions in the Neighborhood of a Regular Singularity
                 / 148 \\
                 5 Second Solution When the Exponents Differ by an
                 Integer or Zero / 150 \\
                 6 Large Values of the Independent Variable / 153 \\
                 7 Numerically Satisfactory Solutions / 154 \\
                 8 The Hypergeometric Equation / 156 \\
                 9 The Hypergeometric Function / 159 \\
                 10 Other Solutions of the Hypergeometric Equation / 163
                 \\
                 11 Generalized Hypergeometric Functions / 168 \\
                 12 The Associated Legendre Equation / 169 \\
                 13 Legendre Functions of General Degree and Order / 174
                 \\
                 14 Legendre Functions of Integer Degree and Order / 180
                 \\
                 15 Ferrers Functions / 185 \\
                 Historical Notes and Additional References / 189 \\
                 6: The Liouville--Green Approximation \\
                 1 The Liouville Transformation / 190 \\
                 2 Error Bounds: Real Variables / 193 \\
                 3 Asymptotic Properties with Respect to the Independent
                 Variable / 197 \\
                 4 Convergence of ${\cal V}(F)$ at a Singularity / 200
                 \\
                 5 Asymptotic Properties with Respect to Parameters /
                 203 \\
                 6 Example: Parabolic Cylinder Functions of Large Order
                 / 206 \\
                 7 A Special Extension / 208 \\
                 8 Zeros / 211 \\
                 9 Eigenvalue Problems / 214 \\
                 10 Theorems on Singular Integral Equations / 217 \\
                 11 Error Bounds: Complex Variables / 220 \\
                 12 Asymptotic Properties for Complex Variables / 223
                 \\
                 13 Choice of Progressive Paths / 224 \\
                 Historical Notes and Additional References / 228 \\
                 7: Differential Equations with Irregular Singularities;
                 Bessel \\
                 and Confluent Hypergeometric Functions \\
                 1 Formal Series Solutions / 229 \\
                 2 Asymptotic Nature of the Formal Series / 232 \\
                 3 Equations Containing a Parameter / 236 \\
                 4 Hankel Functions; Stokes' Phenomenon / 237 \\
                 5 The Function $Y_\nu(z)$ / 241 \\
                 6 Zeros of $J_\nu(z)$ / 244 \\
                 7 Zeros of $Y_\nu(z)$ and Other Cylinder Functions /
                 248 \\
                 8 Modified Bessel Functions / 250 \\
                 9 Confluent Hypergeometric Equation / 254 \\
                 10 Asymptotic Solutions of the Confluent Hypergeometric
                 \\
                 Equation '/ 256 \\
                 11 Whittaker Functions / 260 \\
                 12 Error Bounds for the Asymptotic Solutions in the
                 General Case / 262 \\
                 13 Error Bounds for Hankel's Expansions / 266 \\
                 14 Inhomogeneous Equations / 270 \\
                 15 Struve's Equation / 274 \\
                 Historical Notes and Additional References / 277 \\
                 8: Sums and Sequences \\
                 1 The Euler--Maclaurin Formula and Bernoulli's
                 Polynomials / 279 \\
                 2 Applications / 284 \\
                 3 Contour Integral for the Remainder Term / 289 \\
                 4 Stirling's Series for In r(z) / 293 \\
                 5 Summation by Parts / 295 \\
                 6 Barnes' Integral for the Hypergeometric Function /
                 299 \\
                 7 Further Examples / 302 \\
                 8 Asymptotic Expansions of Entire Functions / 307 \\
                 9 Coefficients in a Power-Series Expansion; Method of
                 Darboux / 309 \\
                 10 Examples / 311 \\
                 11 Inverse Laplace Transforms; Haar's Method / 315 \\
                 Historical Notes and Additional References / 321 \\
                 9: Integrals: Further Methods \\
                 1 Logarithmic Singularities / 322 \\
                 2 Generalizations of Laplace's Method / 325 \\
                 3 Example from Combinatoric Theory / 329 \\
                 4 Generalizations of Laplace's Method (continued) / 331
                 \\
                 5 Examples / 334 \\
                 6 More General Kernels / 336 \\
                 7 Nicholson's Integral for J;(z) + Y;(z) / 340 \\
                 8 Oscillatory Kernels / 342 \\
                 9 Bleistein's Method / 344 \\
                 10 Example / 346 \\
                 11 The Method of Chester, Friedman, and Ursell / 351
                 \\
                 12 Anger Functions of Large Order / 352 \\
                 13 Extension of the Region of Validity / 358 \\
                 Historical Notes and Additional References / 361 \\
                 10: Differential Equations with a Parameter: Expansions
                 in Elementary Functions \\
                 1 Classification and Preliminary Transformations / 362
                 \\
                 2 Case I: Formal Series Solutions / 364 \\
                 3 Error Bounds for the Formal Solutions / 366 \\
                 4 Behavior of the Coefficients at a Singularity / 368
                 \\
                 5 Behavior of the Coefficients at a Singularity
                 (continued) / 369 \\
                 6 Asymptotic Properties with Respect to the Parameter /
                 371 \\
                 7 Modified Bessel Functions of Large Order / 374 \\
                 8 Extensions of the Regions of Validity for the
                 Expansions of the Modified Bessel Functions / 378 \\
                 9 More General Forms of Differential Equation / 382 \\
                 10 Inhomogeneous Equations / 386 \\
                 11 Example: An Inhomogeneous Form of the Modified
                 Bessel Equation / 388 \\
                 Historical Notes and Additional References / 391 \\
                 11: Differential Equations with a Parameter: Turning
                 Points \\
                 1 Airy Functions of Real Argument / 392 \\
                 2 Auxiliary Functions for Real Variables / 394 \\
                 3 The First Approximation / 397 \\
                 4 Asymptotic Properties of the Approximation; Whittaker
                 Functions with $m$ Large / 401 \\
                 5 Real Zeros of the Airy Functions / 403 \\
                 6 Zeros of the First Approximation / 405 \\
                 7 Higher Approximations / 408 \\
                 8 Airy Functions of Complex Argument / 413 \\
                 9 Asymptotic Approximations for Complex Variables / 416
                 \\
                 10 Bessel Functions of Large Order / 419 \\
                 11 More General Form of Differential Equation / 426 \\
                 12 Inhomogeneous Equations / 429 \\
                 Historical Notes and Additional References / 433 \\
                 12: Differential Equations with a Parameter: Simple
                 Poles and Other Transition Points \\
                 1 Bessel Functions and Modified Bessel Functions of
                 Real Order and Argument / 435 \\
                 2 Case III: Formal Series Solutions / 438 \\
                 3 Error Bounds: Positive C / 440 \\
                 4 Error Bounds: Negative C / 443 \\
                 5 Asymptotic Properties of the Expansions / 447 \\
                 6 Determination of Phase Shift / 449 \\
                 7 Zeros / 451 \\
                 8 Auxiliary Functions for Complex Arguments / 453 \\
                 9 Error Bounds: Complex u and C / 457 \\
                 10 Asymptotic Properties for Complex Variables / 460
                 \\
                 11 Behavior of the Coefficients at Infinity / 462 \\
                 12 Legendre Functions of Large Degree: Real Arguments /
                 463 \\
                 13 Legendre Functions of Large Degree: Complex
                 Arguments / 470 \\
                 14 Other Types of Transition Points / 474 \\
                 Historical Notes and Additional References / 478 \\
                 13: Connection Formulas for Solutions of Differential
                 Equations \\
                 1 Introduction / 480 \\
                 2 Connection Formulas at a Singularity / 480 \\
                 3 Differential Equations with a Parameter / 482 \\
                 4 Connection Formula for Case III / 483 \\
                 5 Application to Simple Poles / 487 \\
                 6 Example: The Associated Legendre Equation / 490 \\
                 7 The Gans--Jeffreys Formulas: Real-Variable Method /
                 491 \\
                 8 Two Turning Points / 494 \\
                 9 Bound States / 497 \\
                 10 Wave Penetration through a Barrier. I / 501 \\
                 11 Fundamental Connection Formula for a Simple Turning
                 Point in the Complex Plane / 503 \\
                 12 Example: Airy's Equation / 507 \\
                 13 Choice of Progressive Paths / 508 \\
                 14 The Gans--Jeffreys Formulas: Complex-Variable Method
                 / 510 \\
                 15 Wave Penetration through a Barrier. II / 513 \\
                 Historical Notes and Additional References / 516 \\
                 14: Estimation of Remainder Terms \\
                 1 Numerical Use of Asymptotic Approximations / 519 \\
                 2 Converging Factors / 522 \\
                 3 Exponential Integral / 523 \\
                 4 Exponential Integral (continued) / 527 \\
                 5 Confluent Hypergeometric Function / 531 \\
                 6 Euler's Transformation / 536 \\
                 7 Application to Asymptotic Expansions / 540 \\
                 Historical Notes and Additional References / 543 \\
                 Answers to Exercises / 545 \\
                 References / 548 \\
                 Index of Symbols / 561 \\
                 General Index / 563",
}

@Book{Omondi:1994:CAS,
  author =       "Amos R. Omondi",
  title =        "Computer Arithmetic Systems: Algorithms, Architecture,
                 and Implementation",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xvi + 520",
  year =         "1994",
  ISBN =         "0-13-334301-4",
  ISBN-13 =      "978-0-13-334301-4",
  LCCN =         "QA76.9.C62 O46 1994",
  bibdate =      "Sat Dec 09 11:57:03 1995",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$40.00",
  acknowledgement = ack-nhfb,
  tableofcontents = "Preface \\
                 Preliminary notes \\
                 Fixed-point number systems / 3 \\
                 Fixed-point addition and subtraction / 13 \\
                 Fixed-point multiplication / 119 \\
                 Fixed-point division / 192 \\
                 Floating-point number systems and arithmetic / 293 \\
                 Basic floating-point operations: implementation / 345
                 \\
                 Elementary functions / 371 \\
                 Unconventional number systems and arithmetic / 439 \\
                 Bibliography / 469 \\
                 Appendix A: Pipelining / 489 \\
                 Appendix B: Design of shifters / 505 \\
                 Index / 514",
}

@Book{ONeil:2016:WMD,
  author =       "Cathy O'Neil",
  title =        "Weapons of math destruction: how big data increases
                 inequality and threatens democracy",
  publisher =    "Crown",
  address =      "New York, NY, USA",
  pages =        "x + 259",
  year =         "2016",
  ISBN =         "0-553-41881-5 (hardcover), 0-553-41883-1 (softcover),
                 0-553-41882-3 (e-book), 0-451-49733-3 (international
                 edition)",
  ISBN-13 =      "978-0-553-41881-1 (hardcover), 978-0-553-41883-5
                 (softcover), 978-0-553-41882-8 (e-book),
                 978-0-451-49733-8 (international edition)",
  LCCN =         "QA76.9.B45 O64 2016",
  bibdate =      "Mon Mar 20 18:07:07 MDT 2017",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "A former Wall Street quant sounds an alarm on the
                 mathematical models that pervade modern life - and
                 threaten to rip apart our social fabric We live in the
                 age of the algorithm. Increasingly, the decisions that
                 affect our lives - where we go to school, whether we
                 get a loan, how much we pay for insurance - are being
                 made not by humans, but by mathematical models. In
                 theory, this should lead to greater fairness: everyone
                 is judged according to the same rules, and bias is
                 eliminated. And yet, as Cathy O'Neil reveals in this
                 urgent and necessary book, the opposite is true. The
                 models being used today are opaque, unregulated, and
                 incontestable, even when they're wrong. Most troubling,
                 they reinforce discrimination. Tracing the arc of a
                 person's life, O'Neil exposes the black box models that
                 shape our future, both as individuals and as a society.
                 These ``weapons of math destruction'' score teachers
                 and students, sort CVs, grant or deny loans, evaluate
                 workers, target voters, and monitor our health. O'Neil
                 calls on modellers to take more responsibility for
                 their algorithms and on policy makers to regulate their
                 use. But in the end, it's up to us to become more savvy
                 about the models that govern our lives. This important
                 book empowers us to ask the tough questions, uncover
                 the truth, and demand change.",
  acknowledgement = ack-nhfb,
  subject =      "Big data; Social aspects; United States; Political
                 aspects; Social indicators; Mathematical models; Moral
                 and ethical aspects; Democracy; Social conditions; 21st
                 century",
  tableofcontents = "Bomb parts: What is a model? \\
                 Shell shocked: My journey of disillusionment \\
                 Arms race: Going to college \\
                 Propaganda machine: Online advertising \\
                 Civilian casualties: Justice in the age of big data \\
                 Ineligible to serve: Getting a job \\
                 Sweating bullets: On the job \\
                 Collateral damage: Landing credit \\
                 No safe zone: Getting insurance \\
                 The targeted citizen: Civic life",
}

@Misc{ONW:awk,
  author =       "{OpenNetwork}",
  title =        "{The Berkeley Utilities}",
  year =         "1991",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "215 Berkeley Place, Brooklyn, NY 11217, USA, Tel:
                 (718) 398-3838.",
  acknowledgement = ack-nhfb,
  altnote =      "See ad on p. 108 of April 1991 UNIX Review.",
}

@Book{OQuinn:1999:PND,
  author =       "Donnie O'Quinn",
  title =        "{Photoshop} in a Nutshell: a Desktop Quick Reference",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  edition =      "Second",
  pages =        "xxvi + 632",
  year =         "1999",
  ISBN =         "1-56592-565-3 (paperback)",
  ISBN-13 =      "978-1-56592-565-6 (paperback)",
  LCCN =         "T385 .O68 1999",
  bibdate =      "Thu Apr 15 06:47:52 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Covers Adobe Photoshop version 5.0.",
  price =        "US\$24.95",
  URL =          "http://www.oreilly.com/catalog/photonut2/",
  acknowledgement = ack-nhfb,
  tableofcontents = "Part I: Tools \\
                 Part II: Menus \\
                 Part III: Palettes",
}

@Book{Oram:1991:MPM,
  author =       "Andrew Oram and Steve Talbott",
  title =        "Managing Projects with Make",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  edition =      "Second",
  pages =        "xiv + 136",
  year =         "1991",
  ISBN =         "0-937175-90-0",
  ISBN-13 =      "978-0-937175-90-3",
  LCCN =         "QA76.76.O63 T35 199",
  bibdate =      "Wed Dec 15 10:49:41 1993",
  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/ora.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  URL =          "http://www.oreilly.com/catalog/9780937175903;
                 http://www.oreilly.com/catalog/make2",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  shorttableofcontents = "Preface \\
                 1: How to write a simple Makefile \\
                 2: Macros \\
                 3: Suffix rules \\
                 4: Commands \\
                 5: Project management \\
                 6: Command-line usage and special targets \\
                 7: Troubleshooting \\
                 Appendix A: Quick reference \\
                 Appendix B: Popular extensions \\
                 Appendix C: Features that differ between variants of
                 make \\
                 Index",
  tableofcontents = "Preface / ix \\
                 The Value of make / x \\
                 Lessons from make / xi \\
                 Variants / xi \\
                 Scope of This Book / xii \\
                 Getting Automated Tests / xiii \\
                 FTP / xiii \\
                 FTPMAIL / xiv \\
                 BITFTP / xv \\
                 UUCP / xvi \\
                 Conventions Used in This Handbook / xvi \\
                 Acknowledgments / xvii \\
                 1: How to Write a Simple Makefile / 1 \\
                 The Description File / 2 \\
                 Dependency Checking / 3 \\
                 Minimizing Rebuilds / 4 \\
                 Invoking make / 5 \\
                 Basic Rules of Syntax / 7 \\
                 2: Macros / 9 \\
                 Syntax Rules / 10 \\
                 Internally Defined Macros / 12 \\
                 Macro Definitions on the Command Line / 13 \\
                 Shell Variables / 13 \\
                 Priority of Macro Assignments / 14 \\
                 Relying on Environment Variables for Defaults / 16 \\
                 Macro String Substitution / 18 \\
                 Internal Macros for Prerequisites and Targets / 19 \\
                 3: Suffix Rules / 23 \\
                 What is a Suffix Rule? / 24 \\
                 Command Options / 26 \\
                 Internal Macros / 27 \\
                 Commands Supported by Default Suffix Rules / 28 \\
                 Fortran and Pascal / 28 \\
                 SCCS and RCS / 29 \\
                 Libraries (Archives) / 33 \\
                 Using Parentheses for Library Modules / 35 \\
                 A Library Example / 36 \\
                 Maintaining Libraries / 37 \\
                 The Double Colon / 37 \\
                 lex and yacc / 38 \\
                 The Null Suffix / 39 \\
                 How to Display Defaults / 39 \\
                 Generating the Display / 40 \\
                 What the Display Means / 40 \\
                 Writing Your Own Suffix Rules / 48 \\
                 A Sample Collection of Suffix Rules / 49 \\
                 Nullifying Rules / 54 \\
                 Conflicts With Default Suffixes / 56 \\
                 4: Commands / 57 \\
                 Filename Pattern Matching / 58 \\
                 Effects of Newlines on Commands / 59 \\
                 Errors and Exit Status / 61 \\
                 Which Shell? / 64 \\
                 5: Project Management / 67 \\
                 Dummy Targets / 68 \\
                 Recursive make on Directories / 70 \\
                 General Tips on Recursive make / 72 \\
                 Other Techniques for Multiple Directories / 74 \\
                 Directories in Internal Macros / 74 \\
                 Viewpath (VPATH Macro) / 75 \\
                 Compiler Options and \#ifdef directives / 78 \\
                 Forcing Remakes / 80 \\
                 Maintaining Multiple Variants Through Explicit Targets
                 / 83 \\
                 Maintaining Multiple Variants in Different Directories
                 / 83 \\
                 Maintaining Variants Through Suffix Rules / 85 \\
                 Header Files / 85 \\
                 Global Definitions (include Statement) / 88 \\
                 Distributed Files and NFS Issues / 89 \\
                 6: Command-line Usage and Special Targets / 93 \\
                 Description Filenames / 94 \\
                 Status Information and Debugging / 94 \\
                 Errors and File Deletion / 96 \\
                 The MAKEFLAGS Macro / 96 \\
                 Miscellaneous Features Affecting Defaults / 97 \\
                 7: Troubleshooting / 99 \\
                 Debugging a Build (-d Option) / 99 \\
                 Syntax Errors / 101 \\
                 Don't Know How to Make / 101 \\
                 Target Up to Date / 102 \\
                 Command Not Found, or Cannot Load / 103 \\
                 Syntax Errors in Multi-line Commands / 105 \\
                 Inconsistent Lines, or Too Many Lines / 106 \\
                 Unrecognized Macros / 107 \\
                 Default Rules Ignored / 108 \\
                 Appendix A: Quick Reference / 109 \\
                 Command Line / 109 \\
                 Description File Lines / 110 \\
                 Macros / 112 \\
                 Internal Macros / 112 \\
                 Macro Modifiers / 113 \\
                 Macro String Substitution / 113 \\
                 Macros with Special Handling / 113 \\
                 Special Target Names / 113 \\
                 Appendix B: Popular Extensions / 115 \\
                 mk and nmake / 116 \\
                 GNU make / 118 \\
                 make / 119 \\
                 makedepend / 122 \\
                 shape / 123 \\
                 Parallel and Distributed Implementations / 125 \\
                 Appendix C: Features That Differ Between Variants of
                 make / 127 \\
                 Background / 128 \\
                 List of Differences / 128 \\
                 Tests You Can Run / 130 \\
                 Macro String Substitution / 130 \\
                 File and Directory Macros / 130 \\
                 Target Name as \$\$<at> on Dependency Lines / 130 \\
                 Parenthesis Syntax for Libraries / 131 \\
                 Single-suffix Rules and .sh Rules / 132 \\
                 Default Shell / 133 \\
                 MAKE and MAKEFLAGS Macros / 134 \\
                 include Statement / 134 \\
                 VPATH / 134 \\
                 Index / 137",
}

@Book{Orchin:1971:SOS,
  author =       "Milton Orchin and H. H. Jaff{\'e}",
  title =        "Symmetry, Orbitals, and Spectra ({S.O.S}.)",
  publisher =    pub-WILEY-INTERSCIENCE,
  address =      pub-WILEY-INTERSCIENCE:adr,
  pages =        "xiii + 396",
  year =         "1971",
  ISBN =         "0-471-65550-3",
  ISBN-13 =      "978-0-471-65550-3",
  LCCN =         "QD461.O73",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{OReilly:1988:MUU,
  author =       "Tim O'Reilly and Grace Todino",
  title =        "Managing {UUCP} and {Usenet}",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xvi + 256",
  month =        mar,
  year =         "1988",
  ISBN =         "0-937175-09-9",
  ISBN-13 =      "978-0-937175-09-5",
  LCCN =         "QA76.8.U65 O64 1988",
  bibdate =      "Wed Dec 15 10:40:12 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/ora.bib",
  URL =          "http://www.oreilly.com/catalog/9780937175095",
  acknowledgement = ack-nhfb,
}

@Book{OReilly:1988:XWS,
  author =       "Tim O'Reilly and Valerie Quercia and Linda Lamb",
  title =        "{X} Window System User's Guide for Version 11",
  volume =       "3",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xviii + 344",
  year =         "1988",
  ISBN =         "0-937175-29-3",
  ISBN-13 =      "978-0-937175-29-3",
  LCCN =         "QA76.76.W56 D44 v.3 1988",
  bibdate =      "Wed Jul 6 14:07:05 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{OReilly:1990:XTI,
  author =       "Tim O'Reilly",
  title =        "{X Toolkit Intrinsics} Reference Manual",
  volume =       "5",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xii + 543",
  year =         "1990",
  ISBN =         "0-937175-35-8",
  ISBN-13 =      "978-0-937175-35-4",
  LCCN =         "QA76.76.W56 D44 v.5 1990",
  bibdate =      "Wed Jul 6 13:50:20 1994",
  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://proquest.safaribooksonline.com/9780937175354",
  acknowledgement = ack-nhfb,
}

@Book{OReilly:2008:HI,
  author =       "Terence O'Reilly",
  title =        "{Hitler's Irishmen}",
  publisher =    "Mercier Press",
  address =      "Cork, Ireland",
  pages =        "320",
  year =         "2008",
  ISBN =         "1-85635-589-6",
  ISBN-13 =      "978-1-85635-589-6",
  LCCN =         "D763.I73 O74 2008",
  bibdate =      "Mon Oct 26 18:09:07 MDT 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Brady, James; Stringer, Frank; World War, 1939--1945;
                 Collaborationists; Great Britain; Biography; Traitors;
                 Ireland; Prisoners of war; Germany",
  subject-dates = "1920--; 1920--",
  tableofcontents = "Guernsey \\
                 Friesack \\
                 The SS \\
                 Jagdverband mitte \\
                 Aftermath",
}

@Book{Organick:1972:MSE,
  author =       "Elliott I. Organick",
  title =        "The Multics System: An Examination of Its Structure",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "xvii + 392",
  year =         "1972",
  ISBN =         "0-262-15012-3",
  ISBN-13 =      "978-0-262-15012-5",
  LCCN =         "QA76.5 O73",
  bibdate =      "Sat Feb 5 18:29:13 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

@Book{Organick:1973:CSO,
  author =       "Elliott I. Organick",
  title =        "Computer System Organization: The {B5700\slash B6700}
                 Series",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "ix + 132",
  year =         "1973",
  ISBN =         "0-12-528250-8",
  ISBN-13 =      "978-0-12-528250-5",
  LCCN =         "",
  bibdate =      "Wed Jan 03 11:42:22 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Preface / vii \\
                 1: An Overview / 1 \\
                 2: Block-Structured Processes and the B6700 Job / 9 \\
                 3: Basic Data Structures for B6700 Algorithms / 16 \\
                 4: Tasking / 37 \\
                 5: Stack Structure and Stack Ownership / 56 \\
                 6: Software Interrupts / 63 \\
                 7: On Storage Control Strategie / 77 \\
                 8: The B6700: Pros and Cons / 82 \\
                 9: Some Hardware Details of Procedure Entry and Return
                 and Tasking / J. G. Cleary / 93 \\
                 Bibliography / 121 \\
                 Index / 126",
}

@Book{Organick:1983:PVI,
  author =       "Elliott I. Organick",
  title =        "A Programmer's View of the Intel 432 System",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "xiii + 418",
  year =         "1983",
  ISBN =         "0-07-047719-1",
  ISBN-13 =      "978-0-07-047719-3",
  LCCN =         "QA76.8.I267 O73 1983",
  bibdate =      "Sat Jan 29 22:36:47 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$29.95",
  acknowledgement = ack-nhfb,
}

@Book{Osborne:1979:RWN,
  author =       "Adam Osborne",
  title =        "Running Wild: The Next Industrial Revolution",
  publisher =    pub-OSBORNE-MCGRAW-HILL,
  address =      pub-OSBORNE-MCGRAW-HILL:adr,
  pages =        "x + 181",
  year =         "1979",
  ISBN =         "0-931988-28-4",
  ISBN-13 =      "978-0-931988-28-8",
  LCCN =         "QA76.9.C66 .O8",
  bibdate =      "Wed Aug 10 09:51:35 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Introduction / vii \\
                 1: Roots / 1 \\
                 2: The Fortunes of War / 27 \\
                 3: Computer Intelligence? / 39 \\
                 4: The Blue Collar Robot / 51 \\
                 5: The White Collar Future / 71 \\
                 6: Industry, Evolution, and Revolution / 103 \\
                 7: Powerful Tools or Powerful Weapons / 127 \\
                 8: Silicon --- The Shape of Things to Come / 143 \\
                 Appendix A: A Worm's-Eye View of Microelectronics / 149
                 \\
                 Appendix B: Glossary / 167 \\
                 Appendix C: A List of Companies / 171 \\
                 References / 179",
}

@Book{OSF:1991:AES,
  author =       "{Open Software Foundation}",
  title =        "Application Environment Specification {(AES)} User
                 Environment Volume, Revision {B}",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xii + 1084 + 12",
  year =         "1991",
  ISBN =         "0-13-043530-9",
  ISBN-13 =      "978-0-13-043530-9",
  LCCN =         "QA76.76.I57A665 1991",
  bibdate =      "Wed Dec 15 10:40:13 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{OSF:1991:OMPa,
  author =       "{Open Software Foundation}",
  title =        "{OSF\slash Motif} Programmer's Guide, Revision 1.1",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  year =         "1991",
  ISBN =         "0-13-640673-4",
  ISBN-13 =      "978-0-13-640673-0",
  LCCN =         "QA76.76.W56 O69 1991",
  bibdate =      "Wed Dec 15 10:40:18 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Introduction to the OSF/Motif Toolkit \\
                 Widgets, gadjets, and convenience functions \\
                 Using motif widgets in programs \\
                 Shell widgets \\
                 Dialog widgets and functions \\
                 Menus \\
                 Specialized widgets \\
                 Additional functionality \\
                 Keyboard interface \\
                 Introduction to the OSF/Motif window manager \\
                 Understanding the principles of window management \\
                 Communicating between MWM and clients: MWM properties
                 \\
                 Managing windows with MWM \\
                 Managing menus, mouse button, and keyboards bindings
                 \\
                 Working with icons \\
                 Quick reference tables \\
                 Introduction to the user interface language \\
                 Language syntax \\
                 UIL module structire \\
                 Using the UIL compiler \\
                 MOtif resource manager functions \\
                 Creating user interfaces with UIL and MRM \\
                 The widget meta-language facility",
}

@Book{OSF:1991:OMPb,
  author =       "{Open Software Foundation}",
  title =        "{OSF\slash Motif} Programmer's Reference, Revision
                 1.1",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xii + 1212 + 15",
  year =         "1991",
  ISBN =         "0-13-640681-5",
  ISBN-13 =      "978-0-13-640681-5",
  LCCN =         "QA76.76.W56 O7 1991",
  bibdate =      "Wed Dec 15 10:40:19 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "This is the reference manual for OSF/Motif commands
                 and functions. It contains toolkit, window manager, and
                 user interface language commands and functions. This
                 document is written for programmers who want to write
                 applications using Motif interfaces to use as a
                 reference.",
  acknowledgement = ack-nhfb,
}

@Book{OSF:1991:OMS,
  author =       "{Open Software Foundation}",
  title =        "{OSF\slash Motif} Style Guide",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  year =         "1991",
  ISBN =         "0-13-640616-5",
  ISBN-13 =      "978-0-13-640616-7",
  LCCN =         "QA76.76.W56 O833 1991",
  bibdate =      "Wed Dec 15 10:40:31 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "User interface design principles \\
                 Input and navigation models \\
                 Selection and component activation \\
                 Application design principles \\
                 Window manager design principles \\
                 Designing for international markets \\
                 Controls, groups and models reference pages \\
                 Common bindings for virtual buttons and keys",
}

@Book{Osgood:1965:M,
  author =       "William Fogg Osgood",
  title =        "Mechanics",
  publisher =    pub-DOVER,
  address =      pub-DOVER:adr,
  pages =        "xiii + 495",
  year =         "1965",
  LCCN =         "QA807.O8 1965",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Reprint of the original 1937 edition.",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{OShea:2007:PCS,
  author =       "Donal O'Shea",
  title =        "The {Poincar{\'e}} conjecture: in search of the shape
                 of the universe",
  publisher =    pub-WALKER,
  address =      pub-WALKER:adr,
  pages =        "ix + 293",
  year =         "2007",
  ISBN =         "0-8027-1532-X",
  ISBN-13 =      "978-0-8027-1532-6",
  LCCN =         "QA612 .O83 2007",
  bibdate =      "Fri Apr 13 16:39:37 MDT 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 melvyl.cdlib.org:210/CDL90",
  price =        "US\$26.95",
  abstract =     "Conceived in 1904, the Poincar{\'e} conjecture, a
                 puzzle that speaks to the possible shape of the
                 universe and lies at the heart of modern topology and
                 geometry, has resisted attempts by generations of
                 mathematicians to prove or to disprove it. Despite a
                 million-dollar prize for a solution, Russian
                 mathematician Grigory Perelman, posted his solution on
                 the Internet instead of publishing it in a
                 peer-reviewed journal. This book ``tells the story of
                 the fascinating personalities, institutions, and
                 scholarship behind the centuries of mathematics that
                 have led to Perelman's dramatic proof.'' The author
                 also chronicles dramatic events at the 2006
                 International Congress of Mathematicians in Madrid,
                 where Perelman was awarded a Fields Medal for his
                 solution, which he declined.",
  acknowledgement = ack-nhfb,
  subject =      "Poincar{\'e}, Henri; Perelman, Grigori; Algebraic
                 topology; Mathematics; Awards; History;
                 Mathematicians",
  subject-dates = "1854--1912",
  tableofcontents = "Cambridge, April 2003 \\
                 The shape of the earth \\
                 Possible worlds \\
                 The shape of the universe \\
                 Euclid's geometry \\
                 The non-Euclideans \\
                 Bernhard Riemann's probationary lecture \\
                 Riemann's legacy \\
                 Klein and Poincar{\'e} \\
                 Poincar{\'e}'s topological papers \\
                 The great savants \\
                 The conjecture takes hold \\
                 Higher dimensions \\
                 A solution in the new millennium \\
                 Madrid, August 2006.",
}

@Book{Overton:2001:NCI,
  author =       "Michael L. Overton",
  title =        "Numerical Computing with {IEEE} Floating Point
                 Arithmetic, Including One Theorem, One Rule of Thumb,
                 and One Hundred and One Exercises",
  publisher =    pub-SIAM,
  address =      pub-SIAM:adr,
  pages =        "xiv + 104",
  year =         "2001",
  ISBN =         "0-89871-482-6 (hardcover), 0-89871-571-7 (paperback),
                 0-89871-807-4 (ebook)",
  ISBN-13 =      "978-0-89871-482-1 (hardcover), 978-0-89871-571-2
                 (print), 978-0-89871-807-2 (e-book)",
  LCCN =         "QA76.9.M35 O94 2001",
  MRclass =      "65-02 (65G30 68M07 68N99)",
  MRnumber =     "MR1828597 (2003b:65002)",
  MRreviewer =   "Jesse L. Barlow",
  bibdate =      "Fri Apr 27 16:50:46 2001",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg-2ed.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/numana2000.bib",
  price =        "US\$40.00",
  URL =          "http://www.cs.nyu.edu/cs/faculty/overton/book/;
                 http://www.siam.org/catalog/mcc07/ot76.htm",
  abstract =     "Are you familiar with the IEEE floating point
                 arithmetic standard? Would you like to understand it
                 better? This book gives a broad overview of numerical
                 computing, in a historical context, with a special
                 focus on the IEEE standard for binary floating point
                 arithmetic. Key ideas are developed step by step,
                 taking the reader from floating point representation,
                 correctly rounded arithmetic, and the IEEE philosophy
                 on exceptions, to an understanding of the crucial
                 concepts of conditioning and stability, explained in a
                 simple yet rigorous context. It gives technical details
                 that are not readily available elsewhere and includes
                 challenging exercises that go beyond the topics covered
                 in the text. Numerical Computing with IEEE Floating
                 Point Arithmetic provides an easily accessible yet
                 detailed discussion of IEEE Std 754-1985, arguably the
                 most important standard in the computer industry. The
                 result of an unprecedented cooperation between academic
                 computer scientists and the cutting edge of industry,
                 it is supported by virtually every modern computer.
                 Other topics include the floating point architecture of
                 the Intel microprocessors and a discussion of
                 programming language support for the standard.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Introduction \\
                 2: The real numbers \\
                 3: Computer representation of numbers \\
                 4: IEEE floating point representation \\
                 5: Rounding \\
                 6: Correctly rounded floating point operations \\
                 7: Exceptions \\
                 8: The Intel microprocessors \\
                 9: Programming languages \\
                 10: Floating point in C \\
                 11: Cancellation \\
                 12: Conditioning of problems \\
                 13: Stability of algorithms \\
                 14: Conclusion",
}

@Book{Overton:2025:NCI,
  author =       "Michael L. Overton",
  title =        "Numerical Computing with {IEEE} Floating Point
                 Arithmetic: Including One Theorem, One Rule of Thumb,
                 and One Hundred and Six Exercises",
  publisher =    pub-SIAM,
  address =      pub-SIAM:adr,
  edition =      "Second",
  pages =        "xx + 126",
  year =         "2025",
  DOI =          "https://doi.org/10.1137/1.9781611978414",
  ISBN =         "1-61197-840-8 (print), 1-61197-841-6 (e-book)",
  ISBN-13 =      "978-1-61197-840-7 (print), 978-1-61197-841-4
                 (e-book)",
  LCCN =         "QA297",
  bibdate =      "Thu Jul 03 08:34:40 2025",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "https://bookstore.siam.org/OT205;
                 https://epubs.siam.org/doi/10.1137/1.9781611978414",
  acknowledgement = ack-nhfb,
  tableofcontents = "Preface / ix \\
                 Acknowledgments / xi \\
                 1 Introduction / 1 \\
                 2 The Real Numbers / 5 \\
                 3 Computer Representation of Numbers / 9 \\
                 4 IEEE Floating Point Representation / 17 \\
                 5 Rounding / 27 \\
                 6 Correctly Rounded Floating Point Operations / 35 \\
                 7 Exceptions / 45 \\
                 8 Floating Point Microprocessors / 53 \\
                 9 Programming Languages / 57 \\
                 10 Floating Point in C / 63 \\
                 11 Cancellation / 75 \\
                 12 Conditioning of Problems / 81 \\
                 13 Stability of Algorithms / 87 \\
                 14 Higher Precision Computations / 99 \\
                 15 Lower Precision Computations / 103 \\
                 16 Conclusion / 111 \\
                 A Letter from Professor Donald E. Knuth / 113 \\
                 Bibliography / 117 \\
                 Index / 125",
}

@Book{Paabo:2014:NMS,
  author =       "Svante P{\"a}{\"a}bo",
  title =        "{Neanderthal} man: in search of lost genomes",
  publisher =    pub-BASIC-BOOKS,
  address =      pub-BASIC-BOOKS:adr,
  pages =        "ix + 275",
  year =         "2014",
  ISBN =         "0-465-02083-6 (hardcover), 0-465-05495-1,
                 0-465-08068-5 (e-book)",
  ISBN-13 =      "978-0-465-02083-6 (hardcover), 978-0-465-05495-4,
                 978-0-465-08068-7 (e-book)",
  LCCN =         "GN285 .P33 2014",
  bibdate =      "Wed Apr 1 18:20:07 MDT 2015",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "What can we learn from the genes of our closest
                 evolutionary relatives? \booktitle{Neanderthal Man}
                 tells the story of geneticist Svante P{\"a}{\"a}bo's
                 mission to answer that question, beginning with the
                 study of DNA in Egyptian mummies in the early 1980s and
                 culminating in his sequencing of the Neanderthal genome
                 in 2009. From P{\"a}{\"a}bo, we learn how Neanderthal
                 genes offer a unique window into the lives of our
                 hominin relatives and may hold the key to unlocking the
                 mystery of why humans survived while Neanderthals went
                 extinct. Drawing on genetic and fossil clues,
                 P{\"a}{\"a}bo explores what is known about the origin
                 of modern humans and their relationship to the
                 Neanderthals and describes the fierce debate
                 surrounding the nature of the two species'
                 interactions. A riveting story about a visionary
                 researcher and the nature of scientific inquiry,
                 \booktitle{Neanderthal Man} offers rich insight into
                 the fundamental question of who we are.",
  acknowledgement = ack-nhfb,
  subject =      "Neanderthals; Human population genetics; Genome
                 analysis; SCIENCE / Life Sciences / Evolution; SCIENCE
                 / Life Sciences / Genetics and Genomics; BIOGRAPHY and
                 AUTOBIOGRAPHY / Science and Technology; genetics; Base
                 Sequence; Biological Evolution; Genome, Human; Human
                 Genome Project; Neandertaler; Populationsgenetik.",
  tableofcontents = "Neanderthal ex machina \\
                 Mummies and molecules \\
                 Amplifying the past \\
                 Dinosaurs in the lab \\
                 Human frustrations \\
                 A Croatian connection \\
                 A new home \\
                 Multiregional controversies \\
                 Nuclear tests \\
                 Going nuclear \\
                 Starting the genome project \\
                 Hard bones \\
                 The devil in the details \\
                 Mapping the genome \\
                 From bones to genome \\
                 Gene flow? \\
                 First insights \\
                 Gene flow! \\
                 The replacement crowd \\
                 Human essence? \\
                 Publishing the genome \\
                 A very unusual finger \\
                 A Neanderthal relative",
}

@Book{Packel:1994:ACM,
  author =       "Ed Packel and Stan Wagon",
  title =        "Animating Calculus: Mathematica Notebooks for the
                 Laboratory",
  publisher =    pub-W-H-FREEMAN,
  address =      pub-W-H-FREEMAN:adr,
  pages =        "xii + 289",
  year =         "1994",
  ISBN =         "0-7167-2428-6",
  ISBN-13 =      "978-0-7167-2428-5",
  LCCN =         "QA303.5.D37P33 1994",
  bibdate =      "Sat Mar 5 12:29:34 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Padfield:1990:HFS,
  author =       "Peter Padfield",
  title =        "{Himmler}: a Full-scale Biography of One of {Hitler}'s
                 Most Ruthless Executioners",
  publisher =    "MJF Books",
  address =      "New York, NY, USA",
  pages =        "xiv + 656 + 16",
  year =         "1990",
  ISBN =         "1-56731-118-0",
  ISBN-13 =      "978-1-56731-118-1",
  LCCN =         "D247.H46 P33 1996",
  bibdate =      "Mon Oct 26 18:35:47 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Background \\
                 Youth \\
                 Revolutionary \\
                 Reichsf{\"u}hrer-SS \\
                 Night of the Long Knives \\
                 Chief of the German Police \\
                 Expansion \\
                 War \\
                 Racial warrior \\
                 Endl{\"o}sung \\
                 Factory murder \\
                 The Herrenmensch \\
                 Chief of Intelligence \\
                 The plot against Hitler \\
                 Most powerful man in the Reich \\
                 Fall from grace \\
                 The end",
}

@Book{Paeth:1995:GGV,
  editor =       "Alan W. Paeth",
  title =        "Graphics Gems {V}",
  volume =       "5",
  publisher =    pub-AP-PROFESSIONAL,
  address =      pub-AP-PROFESSIONAL:adr,
  pages =        "xx + 438",
  year =         "1995",
  ISBN =         "0-12-543455-3, 0-12-543457-X",
  ISBN-13 =      "978-0-12-543455-3, 978-0-12-543457-7",
  LCCN =         "T385 .G6935 1995b",
  bibdate =      "Mon Aug 24 17:06:31 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Graphics Gems",
  abstract =     "\booktitle{Graphics Gems V} is the newest volume in
                 \booktitle{The Graphics Gems Series}. It is intended to
                 provide the graphics community with a set of practical
                 tools for implementing new ideas and techniques, and to
                 offer working solutions to real programming problems.
                 These tools are written by a wide variety of graphics
                 programmers from industry, academia, and research. The
                 books in the series have become essential, time-saving
                 tools for many programmers. Key Features: * Latest
                 collection of graphics tips in \booktitle{The Graphics
                 Gems Series} written by the leading programmers in the
                 field; * Contains over 50 new gems displaying some of
                 the most recent and innovative techniques in graphics
                 programming; * Includes gems covering ellipses,
                 splines, B{\'e}zier curves, and ray tracing.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "Polygons and Polyhedra \\
                 Geometry \\
                 Transformations \\
                 Curves and Surfaces \\
                 Ray Tracing \\
                 Shading \\
                 Frame Buffer Techniques \\
                 Image Processing \\
                 Graphic Design \\
                 Utilities",
}

@TechReport{Page:1998:PCR,
  author =       "Lawrence Page and Sergey Brin and Rajeev Motwani and
                 Terry Winograd",
  title =        "The {PageRank} Citation Ranking: Bringing Order to the
                 Web",
  institution =  "Stanford Digital Library Technologies Project,
                 Stanford University",
  address =      "Stanford, CA, USA",
  pages =        "17",
  day =          "11",
  month =        nov,
  year =         "1998",
  bibdate =      "Thu Oct 24 15:13:54 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://dbpubs.stanford.edu/pub/1999-66",
  abstract =     "The importance of a Web page is an inherently
                 subjective matter, which depends on the readers
                 interests, knowledge and attitudes. But there is still
                 much that can be said objectively about the relative
                 importance of Web pages. This paper describes PageRank,
                 a mathod for rating Web pages objectively and
                 mechanically, effectively measuring the human interest
                 and attention devoted to them. We compare PageRank to
                 an idealized random Web surfer. We show how to
                 efficiently compute PageRank for large numbers of
                 pages. And, we show how to apply PageRank to search and
                 to user navigation.",
  acknowledgement = ack-nhfb,
  annote =       "This is the Google search algorithm.",
}

@Book{Page:2007:DHP,
  author =       "Scott E. Page",
  title =        "The difference: how the power of diversity creates
                 better groups, firms, schools, and societies",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "xxiv + 424",
  year =         "2007",
  ISBN =         "0-691-13854-0, 1-4008-3028-1 (e-book)",
  ISBN-13 =      "978-0-691-13854-1, 978-1-4008-3028-2 (e-book)",
  LCCN =         "HF5549.5.M5 P34 2007eb",
  bibdate =      "Sat Sep 15 11:25:59 MDT 2018",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Diversity in the workplace; Multiculturalism;
                 Diversiteit; Multiculturele samenlevingen;
                 Groepsdynamica; Arbeids- en organisatiepsychologie;
                 Probleemoplossing",
  tableofcontents = "Preface / xiii \\
                 Acknowledgments / xix \\
                 Prologure / xxv \\
                 Introduction: Unpacking our differences \\
                 Part 1. Unpacking the toolbox \\
                 1: Diverse perspectives \\
                 2: Heuristics \\
                 3: Interpretations \\
                 4: Predictive models \\
                 5: Measuring sticks and toolboxes \\
                 Part 2. Diversity's benefits: Building from tools. 6:
                 Diversity and problem solving \\
                 7: Models of information aggregation \\
                 8: Diversity and prediction \\
                 Part 3. Diverse values: A conflict of interests. 9:
                 Diverse preferences \\
                 10: Preference aggregation \\
                 11: Interacting toolboxes and preferences \\
                 Part 4. The pudding: Does diversity generate benefits?.
                 12: The causes of cognitive diversity \\
                 13: The empirical evidence \\
                 Part 5. Going on the offensive. A fertile logic \\
                 Epilogue: The Ketchup Questions \\
                 Notes \\
                 Index",
}

@Book{Pagels:1982:CCQ,
  author =       "Heinz R. Pagels",
  title =        "The Cosmic Code: Quantum Physics as the Language of
                 Nature",
  publisher =    pub-SIMON-SCHUSTER,
  address =      pub-SIMON-SCHUSTER:adr,
  pages =        "370 + 8",
  year =         "1982",
  ISBN =         "0-671-24802-2",
  ISBN-13 =      "978-0-671-24802-4",
  LCCN =         "QC174.13 .P33 1982",
  bibdate =      "Mon Jan 19 20:06:11 MST 2015",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/h/heisenberg-werner.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/s/schroedinger-erwin.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  author-dates = "1939--",
  libnote =      "Not in my library.",
  subject =      "Quantum theory; Particles (Nuclear physics); Science;
                 Philosophy",
  tableofcontents = "The last classical physicist \\
                 Inventing general relativity \\
                 The first quantum physicists \\
                 Heisenberg on Helgoland \\
                 Uncertainty and complementarity \\
                 Randomness \\
                 The invisible hand \\
                 Statistical mechanics \\
                 Making waves \\
                 Schr{\"o}dinger's cat \\
                 A quantum mechanical fairy tale \\
                 Bell's inequality \\
                 The reality marketplace \\
                 The matter microscopes \\
                 Beginning the voyage: molecules, atoms, and nuclei \\
                 The riddle of the hadrons \\
                 Quarks \\
                 Leptons \\
                 Gluons \\
                 Fields, particles, and reality \\
                 Being and nothingness \\
                 Identity and difference \\
                 The gauge field theory revolution \\
                 Proton decay \\
                 The quantum and the cosmos \\
                 Laying down the law \\
                 The cosmic code",
}

@Book{Pagels:1983:CCQ,
  author =       "Heinz R. Pagels",
  title =        "The Cosmic Code: Quantum Physics as the Language of
                 Nature",
  publisher =    "Bantam Books",
  address =      "Toronto, ON, Canada",
  pages =        "xiv + 333",
  year =         "1983",
  ISBN =         "0-553-23128-6, 0-553-24625-9",
  ISBN-13 =      "978-0-553-23128-1, 978-0-553-24625-4",
  LCCN =         "QC174.13 .P33 1983",
  bibdate =      "Sat Dec 1 16:21:16 MST 2018",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "A Bantam new age book",
  acknowledgement = ack-nhfb,
  author-dates = "1939--",
  libnote =      "Not in my library.",
  subject =      "Quantum theory; Particles (Nuclear physics); Science;
                 Philosophy; Particles (Nuclear physics); Quantum
                 theory; Philosophy.",
}

@Book{Pagels:1988:DRC,
  author =       "Heinz R. Pagels",
  title =        "The Dreams of Reason: The Computer and the Rise of the
                 Sciences of Complexity",
  publisher =    pub-SIMON-SCHUSTER,
  address =      pub-SIMON-SCHUSTER:adr,
  pages =        "352",
  year =         "1988",
  ISBN =         "0-671-62708-2",
  ISBN-13 =      "978-0-671-62708-9",
  LCCN =         "QA76.9.C66 P34 1988",
  bibdate =      "Wed Dec 15 10:40:37 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Explains the new developments and the scientific
                 impact of the computer as an instrument of the new
                 sciences of complexity.",
  acknowledgement = ack-nhfb,
}

@Book{Pagels:2011:CCQ,
  author =       "Heinz R. Pagels",
  title =        "The cosmic code: quantum physics as the language of
                 nature",
  publisher =    pub-DOVER,
  address =      pub-DOVER:adr,
  edition =      "{Dover}",
  pages =        "370",
  year =         "2011",
  ISBN =         "0-486-48506-4 (paperback)",
  ISBN-13 =      "978-0-486-48506-5 (paperback)",
  LCCN =         "QC174.13 .P33 2011",
  bibdate =      "Mon Jan 19 20:06:11 MST 2015",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "This is one of the most important books on quantum
                 mechanics ever written for lay readers, in which an
                 eminent physicist and successful science writer, Heinz
                 Pagels, discusses and explains the core concepts of
                 physics without resorting to complicated mathematics.
                 [From a New York Times Book Review of the 1982 edition:
                 Can be read by anyone. I heartily recommend it! ----
                 Quantum physics as the language of nature].",
  acknowledgement = ack-nhfb,
  author-dates = "1939--",
  libnote =      "Not in my library.",
  remark =       "Originally published \cite{Pagels:1982:CCQ}.",
  subject =      "Quantum theory; Particles (Nuclear physics); Science;
                 Philosophy; SCIENCE / Physics.",
  tableofcontents = "The last classical physicist \\
                 Inventing general relativity \\
                 The first quantum physicists \\
                 Heisenberg on Helgoland \\
                 Uncertainty and complementarity \\
                 Randomness \\
                 The invisible hand \\
                 Statistical mechanics \\
                 Making waves \\
                 Schr{\"o}dinger's cat \\
                 A quantum mechanical fairy tale \\
                 Bell's inequality \\
                 The reality marketplace \\
                 The matter microscopes \\
                 Beginning the voyage: molecules, atoms, and nuclei \\
                 The riddle of the hadrons \\
                 Quarks \\
                 Leptons \\
                 Gluons \\
                 Fields, particles, and reality \\
                 Being and nothingness \\
                 Identity and difference \\
                 The gauge field theory revolution \\
                 Proton decay \\
                 The quantum and the cosmos \\
                 Laying down the law \\
                 The cosmic code",
}

@Book{Pais:1991:NBT,
  author =       "Abraham Pais",
  title =        "{Niels Bohr}'s times: in physics, philosophy, and
                 polity",
  publisher =    pub-CLARENDON,
  address =      pub-CLARENDON:adr,
  pages =        "xvii + 565",
  year =         "1991",
  ISBN =         "0-19-852048-4 (paperback), 0-19-852049-2",
  ISBN-13 =      "978-0-19-852048-1 (paperback), 978-0-19-852049-8",
  LCCN =         "QC773 .P35 1991",
  bibdate =      "Fri Oct 27 14:20:50 MDT 2006",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/bohr-niels.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/h/heisenberg-werner.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  price =        "US\$35.00",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0635/90027248-d.html",
  acknowledgement = ack-nhfb,
  subject =      "Nuclear physics; History; Bohr, Niels Henrik David",
  subject-dates = "1885--1962",
  tableofcontents = "1. A Dane for all seasons \\
                 2. `In Denmark I was born\ldots{}' \\
                 3. Boyhood \\
                 4. Toward the twentieth century: from ancient optics to
                 relativity theory \\
                 5. {\em Natura facit saltum\/}: the roots of quantum
                 physics \\
                 6. Student days \\
                 7. In which Bohr goes to England for postdoctoral
                 research \\
                 8. Bohr, father of the atom \\
                 9. How Bohr secured his permanent base of operations
                 \\
                 10. `It was the spring of hope, it was the winter of
                 despair' \\
                 11. Bohr and Einstein \\
                 12. `A modern Viking who comes on a great errand' \\
                 13. `Then the whole picture changes completely': the
                 discovery of quantum mechanics \\
                 14. The Spirit of Copenhagen \\
                 15. Looking into the atomic nucleus \\
                 16. Toward the edge of physics in the Bohr style, and a
                 bit beyond \\
                 17. How Bohr orchestrated experimental progress in the
                 1930s, in physics and in biology \\
                 18. Of sad events and of major journeys \\
                 19. `We are suspended in language' \\
                 20. Fission \\
                 21. Bohr, pioneer of `glasnost' \\
                 22. In which Bohr moves full stream into his later
                 years \\
                 23. Epilog \\
                 Appendix \\
                 Index of names \\
                 Index of subjects",
}

@Book{Pais:1994:ELH,
  author =       "Abraham Pais",
  title =        "{Einstein} lived here: essays for the layman",
  publisher =    pub-CLARENDON,
  address =      pub-CLARENDON:adr,
  pages =        "xvi + 282",
  year =         "1994",
  ISBN =         "0-19-853994-0",
  ISBN-13 =      "978-0-19-853994-0",
  LCCN =         "QC16.E5 P25 1994",
  bibdate =      "Thu Oct 26 13:56:26 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  price =        "US\$22.42",
  abstract =     "Few people have understood what Einstein has said,
                 thought, and done, but many are hungry to know more
                 about him. This companion volume to Abraham Pais's
                 Subtle is the Lord. enlarges on the way Einstein was
                 perceived by the world at large. His becoming the
                 scientist of greatest renown ever is largely the result
                 of attention by the media, as the author has documented
                 by delving in newspaper and magazine archives, from
                 1902 to the present. We also learn of his views on
                 religion and on philosophy, his marital problems, and
                 his contacts with personalities ranging from John D.
                 Rockefeller to Charlie Chaplin to Freud to Ghandi.
                 Interviews with Einstein, as well as reports on brief
                 comments and longer addresses by him, help to convey
                 his vivid style of expression as well as his great
                 talent at formulation. He wrote and spoke about
                 pacifism, supranationalism, civil liberties, and the
                 rights and obligation of Jews and Arabs to live
                 together harmoniously in the Middle East. Subjects he
                 was interested in ranged from capital punishment to
                 vegetarianism. These essays were written from the
                 author's special perspective: he is a physicist and he
                 knew Einstein personally for several years. His style
                 is accessible and nonmathematical. This book provides
                 essential information about Einstein the human being
                 which will fascinate and inform both the specialist and
                 the layman.",
  acknowledgement = ack-nhfb,
  remark =       "One chapter describes how Einstein got the 1921 Nobel
                 Prize in Physics, and why it was for the photoelectric
                 effect (1905), and not for either Special (1905) or
                 General (1916) Relativity, or for the explanation of
                 Brownian motion (1905). Einstein had been nominated for
                 the Nobel Prize almost yearly since 1910, and he and
                 Niels Bohr were informed of their prizes on the same
                 day in late 1922 (Bohr's was for 1922). However,
                 Einstein was then traveling in Japan, and did not get
                 the news until later.",
  subject =      "Einstein, Albert; Physics; History; Physicists;
                 Biography",
  subject-dates = "1879--1955",
  tableofcontents = "1. In the shadow of Albert Einstein \\
                 2. Reflections on Bohr and Einstein \\
                 3. De Broglie, Einstein, and the birth of the matter
                 wave concept \\
                 4. Einstein, Newton, and success \\
                 5. A minibriefing on relativity for the layman \\
                 6. How Einstein got the Nobel Prize \\
                 7. Helen Dukas, in memoriam \\
                 8. Samples from Die Komische Mappe \\
                 9. The Indian connection: Tagore and Gandhi \\
                 10. Einstein on religion and philosophy \\
                 11. Einstein and the Press \\
                 Onomasticon \\
                 Subject index",
}

@Book{Palais:2009:DEM,
  author =       "Richard S. Palais and Robert A. Palais",
  title =        "Differential Equations, Mechanics, and Computation",
  volume =       "51",
  publisher =    pub-AMS,
  address =      pub-AMS:adr,
  pages =        "xiii + 313",
  year =         "2009",
  ISBN =         "0-8218-2138-5",
  ISBN-13 =      "978-0-8218-2138-1",
  LCCN =         "QA371.P34 2009",
  bibdate =      "Mon Nov 30 17:58:16 2009",
  bibsource =    "catalog.lib.byu.edu:2200;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Student mathematical library; IAS/Park City
                 mathematical subseries",
  acknowledgement = ack-nhfb,
  subject =      "Evolution equations; Differential equations, Linear;
                 Numerical solutions; Differential equations;
                 Mechanics",
  tableofcontents = "Introduction \\
                 1: Differential equations and their solutions \\
                 2: Linear differential equations \\
                 3: Second-order ODE and calculus of variations \\
                 4: Newtonian mechanics \\
                 5: Numerical methods \\
                 Appendix A: Linear algebra and analysis \\
                 Appendix B: The magic of iteration \\
                 Appendix C: Vector fields as differential operators \\
                 Appendix D: Coordinate systems and canonical forms \\
                 Appendix E: Parametrized curves and arclength \\
                 Appendix F: Smoothness with respect to inital
                 conditions \\
                 Appendix G: Canonical form for linear operators \\
                 Appendix H: Runge-Kutta methods \\
                 Appendix I: Multistep methods \\
                 Appendix J: Iterative interpolation and its error",
}

@Book{Palmer:2004:SAO,
  author =       "Brandon Palmer and Jose Nazario",
  title =        "Secure Architectures with {OpenBSD}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xix + 519",
  year =         "2004",
  ISBN =         "0-321-19366-0 (paperback)",
  ISBN-13 =      "978-0-321-19366-7 (paperback)",
  LCCN =         "QA76.76.O63 P335 2004",
  bibdate =      "Fri Apr 29 07:07:06 MDT 2005",
  bibsource =    "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 =          "ftp://uiarchive.cso.uiuc.edu/pub/etext/gutenberg/;
                 http://www.loc.gov/catdir/toc/ecip0413/2004001163.html",
  abstract =     "\booktitle{Secure Architectures with OpenBSD} is the
                 insider's guide to building secure systems using
                 OpenBSD. Written by Brandon Palmer and Jose Nazario,
                 this book is a how-to for system and network
                 administrators who need to move to a more secure
                 operating system and a reference for seasoned OpenBSD
                 users who want to fully exploit every feature of the
                 system.",
  acknowledgement = ack-nhfb,
  subject =      "OpenBSD (Electronic resource); Operating systems
                 (Computers); Computer security; Computer architecture",
  tableofcontents = "1: Introduction \\
                 I: Getting started \\
                 2: Overview of OpenBSD \\
                 3: Installation \\
                 4: Basic use \\
                 5: Basic default services \\
                 6: Online help resources \\
                 7: X window system \\
                 II: System configuration and administration \\
                 8: User administration \\
                 9: Networking \\
                 10: Inetd \\
                 11: Other installed services \\
                 12: Precompiled third-party software: packages \\
                 13: The Ports Tree: third-party software from source",
}

@Book{Palmer:8087,
  author =       "John F. Palmer and Stephen P. Morse",
  title =        "The 8087 Primer",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "viii + 182",
  year =         "1984",
  ISBN =         "0-471-87569-4",
  ISBN-13 =      "978-0-471-87569-7",
  LCCN =         "QA76.8.I2923 P34 1984",
  bibdate =      "Wed Dec 15 10:40:38 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Excellent coverage of the 8087 numeric coprocessor by
                 the chief architects of the Intel 8087 (Palmer) and
                 8086 (Morse). Contains many candid statements about
                 design decisions in these processors. A must for
                 serious assembly language coding of the 8087 and 80287
                 chips. See also \cite{Intel:286-prm}.",
  acknowledgement = ack-nhfb,
}

@Book{Papagianni:2013:NRH,
  author =       "Dimitra Papagianni and Michael A. Morse",
  title =        "The {Neanderthals} rediscovered: how modern science is
                 rewriting their story",
  publisher =    "Thames and Hudson Oxbow Books",
  address =      "London, UK",
  pages =        "208 + 16",
  year =         "2013",
  ISBN =         "0-500-05177-1 (hardcover)",
  ISBN-13 =      "978-0-500-05177-1 (hardcover)",
  LCCN =         "????",
  bibdate =      "Wed Aug 09 06:20:42 2017",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "For too long the Neanderthals have been seen as
                 dim-witted evolutionary dead-enders who looked and
                 behaved completely differently from us, but in recent
                 years their story has been transformed thanks to new
                 discoveries and advances in scientific techniques. In a
                 compelling narrative one that has not previously been
                 told in a way that encompasses the entire dramatic arc
                 from evolution to expansion to extinction this book
                 takes a fresh and engaging look at the whole story of
                 the Neanderthals, setting out all the evidence,
                 redressing the balance and arriving at a fairer
                 assessment of a species that was closely related to us
                 and in so doing addresses what it is to be human.",
  acknowledgement = ack-nhfb,
  subject =      "Neanderthals; Human evolution; Fossil hominids; Human
                 remains (Archaeology); Antiquities, Prehistoric;
                 Antiquities, Prehistoric; Fossil hominids; Human
                 evolution; Human remains (Archaeology); Neanderthals.",
  tableofcontents = "Preface / 6 \\
                 1: A long underestimated type of human / 11 \\
                 2: The first Europeans: 1 million to 600,000 years ago
                 / 24 \\
                 3: Defeating the cold: 600,000 to 250,000 years ago /
                 48 \\
                 4: Meet the Neanderthals: 250,000 to 130,000 years ago
                 / 73 \\
                 5: An end to isolation: 130,000 to 60,000 years ago /
                 103 \\
                 6: Endgame: 60,000 to 25,000 years ago / 133 \\
                 Still with us? / 180 \\
                 Bibliography / 200 \\
                 Sources of illustrations / 205 \\
                 Index / 205",
}

@Book{Parhami:2000:CAA,
  author =       "Behrooz Parhami",
  title =        "Computer Arithmetic: Algorithms and Hardware Designs",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  pages =        "xx + 490",
  year =         "2000",
  ISBN =         "0-19-512583-5 (hardcover), 3-540-04907-X (print),
                 3-540-36246-0 (e-book)",
  ISBN-13 =      "978-0-19-512583-2 (hardcover), 978-3-540-04907-4
                 (print), 978-3-540-36246-3 (e-book)",
  LCCN =         "QA76.9.C62P37 1999",
  bibdate =      "Sat Jun 17 12:26:40 2000",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg-2ed.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$85.00",
  abstract =     "The field of digital computer architecture has grown
                 explosively in the past two decades. Through a steady
                 stream of experimental research, tool-building efforts,
                 and theoretical studies, the design of an
                 instruction-set architecture has been transformed into
                 one of the most quantitative branches of computer
                 technology. However, this explosive growth has led to
                 unprecedented hardware complexity and almost
                 intolerable development costs. The challenge faxing
                 current and future computer designers is to institute
                 simplicity where we now have complexity; to use
                 fundamental theories being developed in this area to
                 gain performance and ease-of-use benefits from simpler
                 circuits; to understand the interplay between
                 technological capabilities/limitations and sound
                 architectural decisions. Computer arithmetic plays a
                 key role in the computer designers' quest for
                 user-friendliness, compactness, simplicity, high
                 performance, low cost, and low power. Parhami's
                 Computer Architecture emphasizes both the underlying
                 theory and actual hardware designs. and links computer
                 arithmetic to other subfields of computing. It is the
                 first computer arithmetic book to cover all topics
                 important for a balanced and complete view of the
                 field. IT will be accompanied by an instructor's
                 manual, with problem solutions and enlarged versions of
                 the figures/charts, suitable for reproduction as
                 transparencies. This is a textbook for senior/graduate
                 level courses in departments of computer science and
                 electrical and computer engineering. The course is
                 commonly called Computer Arithmetic. Students wishing
                 to enroll will usually have taken courses in computer
                 organization and advanced digital design before
                 enrolling. Computer Arithmetic is a sub-field of
                 digital computer organization. It deals with the
                 hardware realization of arithmetic functions to support
                 various computer architectures, as well as arithmetic
                 algorithms for firmware or software implementations. A
                 major thrust of digital computer arithmetic is the
                 design of hardware algorithms and circuits to enhance
                 the speed of numeric operations. Thus much of what is
                 presented in this book complements the architectural
                 and algorithmic speedup techniques studied in the
                 context of high performance computer architecture and
                 parallel processing.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Part I: Number Representation \\
                 1: Numbers and Arithmetic \\
                 2: Representing Signed Numbers \\
                 3: Redundant Number Systems \\
                 4: Residue Number Systems \\
                 Part II: Addition/Subtraction \\
                 5: Basic Addition and Counting \\
                 6: Carry-Lookahead Adders \\
                 7: Variations in Fast Adders \\
                 8: Multioperand Addition \\
                 Part III: Multiplication \\
                 9: Basic Multiplication Schemes \\
                 10: High-Radix Multipliers \\
                 11: Tree and Array Multipliers \\
                 12: Variations in Multipliers \\
                 Part IV: Division \\
                 13: Basic Division Schemes \\
                 14: High-Radix Dividers \\
                 15: Variations in Dividers \\
                 16: Division by Convergence \\
                 Part V: Real Arithmetic \\
                 17: Floating-Point Representations \\
                 18: Floating-Point Operations \\
                 19: Errors and Error Control",
}

@Book{Parker:2003:BEH,
  author =       "Andrew Parker",
  title =        "In the blink of an eye: how vision sparked the big
                 bang of evolution",
  publisher =    "Basic Books",
  address =      "New York, NY, USA",
  pages =        "xvi + 316",
  year =         "2003",
  ISBN =         "0-465-05438-2 (paperback)",
  ISBN-13 =      "978-0-465-05438-1 (paperback)",
  LCCN =         "QE770 .P37 2004",
  bibdate =      "Wed Mar 8 10:50:19 MST 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 melvyl.cdlib.org:210/CDL90",
  acknowledgement = ack-nhfb,
  subject =      "Invertebrates, Fossil; Paleontology; Cambrian; Burgess
                 Shale (B.C.); Evolution (Biology)",
  tableofcontents = "Evolution's big bang\\
                 The virtual life of fossils\\
                 The infusion of light\\
                 When darkness descends\\
                 Light, time and evolution\\
                 Colour in the Cambrian?\\
                 The making of a sense\\
                 The killer instinct\\
                 The solution\\
                 End of story?",
}

@InCollection{Parker:printer-fonts,
  author =       "Mike Parker",
  editor =       "Robert C. Durbeck and Sol Sherr",
  booktitle =    "Output Hardcopy Devices",
  title =        "Printer Fonts",
  chapter =      "19",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "497--516",
  year =         "1988",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Parkinson:1980:PL,
  author =       "Cyril Northcote Parkinson",
  title =        "Parkinson, the Law",
  publisher =    pub-HOUGHTON-MIFFLIN,
  address =      pub-HOUGHTON-MIFFLIN:adr,
  pages =        "207",
  year =         "1980",
  ISBN =         "0-395-29131-3",
  ISBN-13 =      "978-0-395-29131-3",
  LCCN =         "PN6231.M2 P297 1980",
  bibdate =      "Wed Jan 12 14:59:06 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$8.95",
  acknowledgement = ack-nhfb,
}

@Book{Parlett:1980:SEP,
  author =       "Beresford N. Parlett",
  title =        "The Symmetric Eigenvalue Problem",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xix + 348",
  year =         "1980",
  ISBN =         "0-13-880047-2",
  ISBN-13 =      "978-0-13-880047-5",
  LCCN =         "QA188 .P3",
  MRclass =      "65F15 (15A18)",
  MRnumber =     "MR570116 (81j:65063)",
  MRreviewer =   "Robert Todd Gregory",
  bibdate =      "Fri Nov 11 06:36:51 MST 2005",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/p/parlett-beresford-n.bib;
                 https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
                 https://www.math.utah.edu/pub/bibnet/subjects/matrix-analysis-2ed.bib;
                 https://www.math.utah.edu/pub/tex/bib/all_brec.bib;
                 https://www.math.utah.edu/pub/tex/bib/gvl.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Prentice-Hall Series in Computational Mathematics",
  series =       "Series in Computational Mathematics",
  ZMnumber =     "0431.65017",
  acknowledgement = ack-nhfb,
  classmath =    "*65F15 Eigenvalues (numerical linear algebra) 15A18
                 Eigenvalues of matrices, etc. 15A57 Other types of
                 matrices 15-02 Research monographs (linear algebra)
                 65-02 Research monographs (numerical analysis) 15A23
                 Factorization of matrices 65F25 Orthogonalization
                 (numerical linear algebra)",
  keywords =     "bandmatrices; bounds for eigenvalues; eigenvalues;
                 generalized eigenvalue problem; Krylov sequences;
                 localization of eigenvalues; orthogonal
                 transformations; tridiagonal matrices; vector
                 iteration",
  shorttableofcontents = "Notation: Inside Front Cover \\
                 Preface / xii \\
                 Introduction / xv \\
                 1: Basic Facts about Self-Adjoint Matrices / 1 \\
                 2: Tasks, Obstacles, and Aids / 17 \\
                 3: Counting Eigenvalues / 38 \\
                 4: Simple Vector Iterations / 58 \\
                 5: Deflation / 81 \\
                 6: Useful Orthogonal Matrices (Tools of the Trade) / 87
                 \\
                 7: Tridiagonal Form / 111 \\
                 8: The $QL$ and $QR$ Algorithms / 139 \\
                 9: Jacobi Methods / 174 \\
                 10: Eigenvalue Bounds / 185 \\
                 11: Approximations from a Subspace / 209 \\
                 12: Krylov Subspaces / 235 \\
                 13: Lanczos Algorithms / 257 \\
                 14: Subspace Iteration / 288 \\
                 15: The General Linear Eigenvalue Problem / 302 \\
                 A Appendix: Rank One and Elementary Matrices / 329 \\
                 B: Appendix: Chebyshev Polynomials / 331 \\
                 References / 334 \\
                 Annotated Bibliography / 341 \\
                 Author and Subject Index / 345",
  tableofcontents = "Notation: Inside Front Cover \\
                 Preface / xii \\
                 Introduction / xv \\
                 1: Basic Facts about Self-Adjoint Matrices / 1 \\
                 1-1 Introduction / 1 \\
                 1-2 Euclidean Space / 1 \\
                 1-3 Eigenvalues / 5 \\
                 l-4 Self-Adjoint Matrices / 6 \\
                 1-5 Quadratic Forms / 10 \\
                 1-6 Matrix Norms / 13 \\
                 1-7 The Generalized Eigenvalue Problem / 16 \\
                 2: Tasks, Obstacles, and Aids / 17 \\
                 2-1 What is Small? What is Large? / 17 \\
                 2-2 Tasks / 19 \\
                 2-3 Conflicting Requirements / 20 \\
                 2-4 Finite Precision Arithmetic / 23 \\
                 2-5 Cancellation / 25 \\
                 2-6 Inner Product Analysis / 29 \\
                 2-7 Can Small Eigenvalues Be Found with Low Relative
                 Error? / 33 \\
                 2-8 Available Programs / 34 \\
                 2-9 Representative Timings / 36 \\
                 2-10 Alternative Computer Architecture / 37 \\
                 3: Counting Eigenvalues / 38 \\
                 3-1 Triangular Factorization / 38 \\
                 3-2 Error Analysis of Triangular Factorization / 43 \\
                 3-3 Slicing the Spectrum / 46 \\
                 3-4 Relation to Sturm Sequences / 52 \\
                 3-5 Bisection and Secant Methods / 53 \\
                 3-6 Hidden Eigenvalues / 55 \\
                 3-7 The Characteristic Polynomial / 57 \\
                 4: Simple Vector Iterations / 58 \\
                 4-1 Eigenvectors of Rank One Matrices / 58 \\
                 4-2 Direct and Inverse Iteration / 59 \\
                 4-3 Advantages of an Ill Conditioned System / 65 \\
                 4-4 Convergence and Orthogonality / 68 \\
                 4-5 Simple Error Bounds / 69 \\
                 4-6 The Rayleigh Quotient Iteration / 70 \\
                 4-7 Local Convergence / 72 \\
                 4-8 Monotonic Residuals / 75 \\
                 *4-9 Global Convergence / 76 \\
                 5: Deflation / 81 \\
                 5-1 Deflation by Subtraction / 81 \\
                 5-2 Deflation by Restriction / 84 \\
                 5-3 Deflation by Similarity Transformations / 85 \\
                 6: Useful Orthogonal Matrices (Tools of the Trade) / 87
                 \\
                 6-1 Orthogonals are Important / 87 \\
                 6-2 Permutations / 88 \\
                 6-3 Reflections (or Symmetries) / 90 \\
                 6-4 Plane Rotations / 92 \\
                 6-5 Error Propagation in a Sequence of Orthogonal
                 Congruences / 94 \\
                 6-6 Backward Error Analysis / 97 \\
                 6-7 The $QR$ Factorization and Gram--Schmidt / 98 \\
                 *6-8 Fast Scaled Rotations / 100 \\
                 *6-9 Orthogonalization in the Face of Roundoff / 105
                 \\
                 7: Tridiagonal Form / 111 \\
                 7-1 Introduction / 111 \\
                 7-2 Uniqueness of Reduction / 112 \\
                 7-3 Minimizing Characteristics / 114 \\
                 7-4 Explicit Reduction of a Full Matrix / 117 \\
                 7-5 Reduction of a Banded Matrix / 120 \\
                 7-6 Irrelevant Instability / 122 \\
                 7-7 Eigenvalues are Simple / 124 \\
                 7-8 Orthogonal Polynomials / 125 \\
                 7-9 Eigenvectors of T / 127 \\
                 7-10 Sturm Sequences / 131 \\
                 7-11 When to Neglect an Off-Diagonal Element / 133 \\
                 7-12 Inverse Eigenvalue Problems / 136 \\
                 8: The $QL$ and $QR$ Algorithms / 139 \\
                 8-1 Introduction / 139 \\
                 8-2 The $QL$ Transformation / 140 \\
                 8-3 Preservation of Bandwidth / 141 \\
                 8-4 Relation between $QL$ and $QR$ / 142 \\
                 8-5 $QL$, the Power Method, and Inverse Iteration / 144
                 \\
                 8-6 Convergence of the Basic $QL$ Algorithm / 145 \\
                 8-7 The Rayleigh Quotient Shift / 146 \\
                 8-8 The Off-Diagonal Elements / 148 \\
                 8-9 Residual Bounds Using Wilkinson's Shift / 149 \\
                 8-10 Tridiagonal $QL$ Always Converges / 151 \\
                 8-11 Asymptotic Convergence Rates / 154 \\
                 8-12 Tridiagonal $QL$ with Explicit Shift / 157 \\
                 8-13 Chasing the Bulge / 159 \\
                 8-14 Shifts for all Seasons / 162 \\
                 8-15 Casting Out Square Roots / 164 \\
                 8-16 $QL$ for Banded Matrices / 170 \\
                 9: Jacobi Methods / 174 \\
                 9-1 Rotation in the Plane / 174 \\
                 9-2 Jacobi Rotations / 176 \\
                 9-3 Convergence / 178 \\
                 9-4 Various Strategies / 180 \\
                 9-5 Ultimate Quadratic Convergence / 181 \\
                 9-6 Assessment of Jacobi Methods / 183 \\
                 10: Eigenvalue Bounds / 185 \\
                 10-1 Cauchy's Interlace Theorem / 186 \\
                 10-2 The Minimax Characterization / 188 \\
                 10-3 The Monotonicity Theorem / 191 \\
                 10-4 The Residual Interlace Theorem / 194 \\
                 10-5 Lehmann's Optimal Intervals / 198 \\
                 10-6 Use of Bounds on the Missing Submatrix / 203 \\
                 10-7 Use of Gaps in A's Spectrum / 206 \\
                 11: Approximations from a Subspace / 209 \\
                 11-1 Subspaces and Their Representation / 209 \\
                 11-2 Invariant Subspaces / 211 \\
                 11-3 The Rayleigh--Ritz Procedure / 213 \\
                 11-4 Optimality / 215 \\
                 11-5 Residual Bounds on Clustered Ritz Values / 218 \\
                 11-6 No Residual Bounds on Ritz Vectors / 221 \\
                 11-7 Gaps in the Spectrum / 221 \\
                 11-8 Condensing the Residual / 225 \\
                 *11-9 A Priori Bounds for Interior Ritz Approximations
                 / 226 \\
                 *11-10 Nonorthogonal Bases / 229 \\
                 *11-11 An Extension Theorem / 231 \\
                 12: Krylov Subspaces / 235 \\
                 12-1 Introduction / 235 \\
                 12-2 Basic Properties / 237 \\
                 12-3 Representation by Polynomials / 239 \\
                 12-4 The Error Bounds of Kaniel and Saad / 242 \\
                 12-5 Comparison with the Power Method / 250 \\
                 12-6 Partial Reduction to Tridiagonal Form / 252 \\
                 13: Lanczos Algorithms / 257 \\
                 13-1 Krylov + Rayleigh--Ritz = Lanczos / 257 \\
                 13-2 Assessing Accuracy / 260 \\
                 13-3 The Effects of Finite Precision Arithmetic / 262
                 \\
                 13-4 Paige's Theorem / 264 \\
                 13-5 An Alternative Formula for 13 1 / 268 \\
                 13-6 Convergence=> Loss of Orthogonality / 270 \\
                 13-7 Maintaining Orthogonality / 272 \\
                 *13-8 Selective Orthogonalization / 275 \\
                 13-9 Analysis of Selective Orthogonalization / 279 \\
                 *13-10 Band (or Block) Lanczos / 284 \\
                 14: Subspace Iteration / 288 \\
                 14-1 Introduction / 288 \\
                 14-2 Implementations / 289 \\
                 14-3 Improvements / 293 \\
                 *14-4 Convergence / 296 \\
                 14-5 Sectioning / 299 \\
                 15: The General Linear Eigenvalue Problem / 302 \\
                 15-1 Introduction / 302 \\
                 15-2 Symmetry is Not Enough / 303 \\
                 15-3 Simultaneous Diagonalization of Two Quadratic
                 Forms / 306 \\
                 15-4 Explicit Reduction to Standard Form / 309 \\
                 *15-5 The Fix--Heiberger Reduction / 311 \\
                 15-6 The $QZ$ Algorithm / 314 \\
                 15-7 Jacobi Generalized / 315 \\
                 15-8 Implicit Reduction to Standard Form / 316 \\
                 15-9 Simple Vector Iterations / 317 \\
                 15-10 Rayleigh Ritz Approximations / 321 \\
                 15-11 Lanczos Algorithms / 323 \\
                 15-12 Subspace Iteration / 325 \\
                 15-13 Practical Considerations / 327 \\
                 A Appendix: Rank One and Elementary Matrices / 329 \\
                 B: Appendix: Chebyshev Polynomials / 331 \\
                 References / 334 \\
                 Annotated Bibliography / 341 \\
                 Author and Subject Index / 345",
}

@Book{Parlett:1998:SEP,
  author =       "Beresford N. Parlett",
  title =        "The Symmetric Eigenvalue Problem",
  volume =       "20",
  publisher =    pub-SIAM,
  address =      pub-SIAM:adr,
  pages =        "xxiv + 398",
  year =         "1998",
  DOI =          "https://doi.org/10.1137/1.9781611971163",
  ISBN =         "0-89871-402-8 (paperback), 1-61197-116-0 (e-book)",
  ISBN-13 =      "978-0-89871-402-9 (paperback), 978-1-61197-116-3
                 (e-book)",
  LCCN =         "QA188 .P37 1998",
  MRclass =      "65F15 (15A18)",
  MRnumber =     "MR1490034 (99c:65072)",
  MRreviewer =   "F. Szidarovszky",
  bibdate =      "Fri Nov 21 06:49:56 2014",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/p/parlett-beresford-n.bib;
                 https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg-2ed.bib;
                 https://www.math.utah.edu/pub/bibnet/subjects/han-wri-mat-sci-2ed.bib;
                 https://www.math.utah.edu/pub/bibnet/subjects/matrix-analysis-2ed.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Corrected reprint \cite{Parlett:1980:SEP}.",
  series =       "Classics in Applied Mathematics",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0708/97040623-d.html",
  ZMnumber =     "0885.65039",
  abstract =     "According to Parlett, ``Vibrations are everywhere, and
                 so too are the eigenvalues associated with them. As
                 mathematical models invade more and more disciplines,
                 we can anticipate a demand for eigenvalue calculations
                 in an ever richer variety of contexts''. Anyone who
                 performs these calculations will welcome the reprinting
                 of Parlett's book (originally published in 1980). In
                 this unabridged, amended version, Parlett covers
                 aspects of the problem that are not easily found
                 elsewhere. The chapter titles convey the scope of the
                 material succinctly. The aim of the book is to present
                 mathematical knowledge that is needed in order to
                 understand the art of computing eigenvalues of real
                 symmetric matrices, either all of them or only a few.
                 The author explains why the selected information really
                 matters and he is not shy about making judgments. The
                 commentary is lively but the proofs are terse. The
                 first nine chapters are based on a matrix on which it
                 is possible to make similarity transformations
                 explicitly. The only source of error is inexact
                 arithmetic. The last five chapters turn to large sparse
                 matrices and the task of making approximations and
                 judging them.",
  acknowledgement = ack-nhfb,
  acknowledgement = ack-njh # " and " # ack-nhfb # " and " # ack-rah,
  classmath =    "*65F15 Eigenvalues (numerical linear algebra) 15A18
                 Eigenvalues of matrices, etc. 15A23 Factorization of
                 matrices 15A57 Other types of matrices 15-02 Research
                 monographs (linear algebra) 65-02 Research monographs
                 (numerical analysis) 65F25 Orthogonalization (numerical
                 linear algebra)",
  keywords =     "bandmatrices; bounds for eigenvalues; eigenvalues;
                 generalized eigenvalue problem; Krylov sequences;
                 localization of eigenvalues; orthogonal
                 transformations; tridiagonal matrices; vector
                 iteration",
  libnote =      "Not yet in my library.",
  remark =       "Unabridged, corrected republication of the original
                 edition (1980; Zbl 0431.65017)",
  tableofcontents = "Convergence theory for the Rayleigh quotient
                 iteration \\
                 Eigenvectors of tridiagonals \\
                 Convergence theory, simpler than Wilkinson's, for
                 Wilkinson's shift strategy in $Q L$ and $Q R$ \\
                 New proofs and sharper results for error bounds \\
                 Optimal properties of Rayleigh--Ritz approximations \\
                 Approximation theory from Krylov subspaces, Paige's
                 theorem for noisy Lanczos algorithms, and
                 semiorthogonality among Lanczos vectors \\
                 Four flavors of subspace iteration",
}

@Proceedings{Parter:1984:LSS,
  editor =       "Seymour V. Parter",
  booktitle =    "{Large-scale scientific computation: proceedings of a
                 conference conducted by the Mathematics Research Center
                 the University of Wisconsin, Madison, May 17--19,
                 1983}",
  title =        "{Large-scale scientific computation: proceedings of a
                 conference conducted by the Mathematics Research Center
                 the University of Wisconsin, Madison, May 17--19,
                 1983}",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "ix + 326",
  year =         "1984",
  ISBN =         "0-12-546080-5",
  ISBN-13 =      "978-0-12-546080-4",
  LCCN =         "QA911 .L32 1984",
  bibdate =      "Wed Dec 15 10:40:39 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Senior Contributors / vii \\
                 Preface / ix \\
                 Multigrid Semi-Implicit Hydrodynamics Revisited / Joel
                 E. Dendy, Jr. / 1 \\
                 Numerical by Solution of Large Nonlinear Boundary Value
                 Problems by Quadratic Minimization Techniques / Roland
                 Glowinski and Patrick LeTallec / 23 \\
                 Future Directions in Large Scale Scientific Computing /
                 James M. Hyman / 51 \\
                 Recent Mathematical and Computational Developments in
                 Numerical Weather Prediction / Akira Kasahara / 85 \\
                 Systolic Algorithms / H. T. Kung / 127 \\
                 An Approach to Fluid Mechanics Calculations on Serial
                 and Parallel Computer Architectures / Dennis R. Liles,
                 John H. Mahaffy, and Paul T. Giguere / 141 \\
                 Acceleration of Convergence of Navier--Stokes
                 Calculations / R. W. MacCormack / 161 \\
                 Error Analysis and Difference Equations on Curvilinear
                 Coordinate Systems / C. Wayne Mastin / 195 \\
                 Numerical Aerodynamic Simulation (NAS) / V. L.
                 Peterson, W. F. Ballhaus, Jr., and F. R. Bailey / 215
                 \\
                 Algebraic Mesh Generation for Large Scale
                 Viscous-Compressible Aerodynamic Simulation / Robert E.
                 Smith / 237 \\
                 Software for the Spectral Analysis of Scalar and Vector
                 Functions on the Sphere / Paul N. Swarztrauber / 271
                 \\
                 Design, Development, and Use of the Finite Element
                 Machine / Loyce Adams and Robert G. Voigt / 301 \\
                 Index / / 323",
}

@Book{Pasachoff:2019:CAN,
  author =       "Jay M. Pasachoff and Alexei V. Filippenko",
  title =        "The Cosmos: Astronomy in the New Millennium",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  edition =      "Fifth",
  pages =        "????",
  year =         "2019",
  ISBN =         "1-108-43138-0",
  ISBN-13 =      "978-1-108-43138-5",
  LCCN =         "QB43.3 .P37 2019",
  bibdate =      "Sat Mar 9 19:02:23 MST 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://thecosmos5.com",
  abstract =     "The fifth edition of \booktitle{The Cosmos: Astronomy
                 in the New Millennium} provides you with the
                 fundamentals of astronomical knowledge that have been
                 built up over decades, with an expanded discussion of
                 the incredible advances that are now taking place in
                 this fast-paced field, such as New Horizons' flyby of
                 Pluto, exoplanets, `dark matter', and the direct
                 detection of gravitational waves by the Laser
                 Interferometer Gravitational-Wave Observatory (LIGO).
                 Written in a clear and easily understandable style,
                 this textbook has been thoroughly revised to include
                 updated data and figures, new images from recent space
                 missions and telescopes, the latest discoveries on
                 supernovae, and new observations of the region around
                 the four-million-solar-mass black hole at the center of
                 our Milky Way Galaxy. A rich array of teaching and
                 learning resources is available at
                 http://thecosmos5.com. The website is regularly updated
                 to include the latest discoveries and photographs in
                 the field.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Astronomy",
  tableofcontents = "A grand tour of the heavens \\
                 Light, matter, and energy: powering the universe \\
                 Light and telescopes: extending our senses \\
                 Observing the stars and planets: clockwork of the
                 universe \\
                 Gravitation and motion: the early history of astronomy
                 \\
                 The terrestrial planets: earth, moon, and their
                 relatives \\
                 The jovian planets: windswept giants \\
                 Pluto, comets, and space debris \\
                 Our solar system and others \\
                 Our star: the sun \\
                 Stars: distant suns \\
                 How the stars shine: cosmic furnaces \\
                 The death of stars: recycling \\
                 Black holes: the end of space and time \\
                 The milky way: our home in the universe \\
                 A universe of galaxies \\
                 Quasars and active galaxies \\
                 Cosmology: the birth and life of the cosmos \\
                 In the beginning \\
                 Life in the universe",
}

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

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

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

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

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

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

@Book{Patterson:2012:COD,
  author =       "David A. Patterson and John L. Hennessy",
  title =        "Computer organization and design: the hardware\slash
                 software interface",
  publisher =    pub-MORGAN-KAUFMANN-ELSEVIER,
  address =      pub-MORGAN-KAUFMANN-ELSEVIER:adr,
  edition =      "Fourth (revised)",
  pages =        "xxv + 703",
  year =         "2012",
  ISBN =         "0-12-374750-3 (paperback)",
  ISBN-13 =      "978-0-12-374750-1 (paperback)",
  LCCN =         "QA76.9.C643 H46 2012",
  bibdate =      "Wed Feb 15 07:46:17 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  note =         "With contributions by Perry Alexander, Peter J.
                 Ashenden, Javier Bruguera, Jichuan Chang, Matthew
                 Farrens, David Kaeli, Nicole Kaiyan, David Kirk, James
                 R. Larus, Jacob Leverich, Kevin Lim, John Nickolls,
                 John Oliver, Milos Prvulovic, and Parta Ranganthan.",
  series =       "The Morgan Kaufmann series in computer architecture
                 and design",
  abstract =     "Presents the fundamentals of hardware technologies,
                 assembly language, computer arithmetic, pipelining,
                 memory hierarchies and I/O.",
  acknowledgement = ack-nhfb,
  subject =      "Computer organization; Computer engineering; Computer
                 interfaces",
  tableofcontents = "1: Computer Abstractions and Technology \\
                 2: Instructions: Language of the Computer \\
                 3: Arithmetic for Computers \\
                 4: The Processor \\
                 5: Large and Fast: Exploiting Memory Hierarchy \\
                 6: Storage and Other I/O Topics \\
                 7: Multicores, Multiprocessors, and Clusters \\
                 A: Graphics and Computing GPUs \\
                 B: Assemblers, Linkes, and the SPIM Simulator \\
                 C: The Basics of Logic Design \\
                 D: Mapping Control to Hardware \\
                 E: A Survey of RISC Architectures for Desktop, Server,
                 and Embedded Computers",
}

@Book{Patterson:2017:RVR,
  author =       "David Patterson and Andrew Waterman",
  title =        "The {RISC-V} Reader: An Open Architecture Atlas",
  publisher =    "Strawberry Canyon",
  address =      "San Francisco, CA, USA",
  pages =        "xiv + 180",
  year =         "2017",
  ISBN =         "0-9992491-1-8",
  ISBN-13 =      "978-0-9992491-1-6",
  LCCN =         "QA76.9.A73 P388 2017",
  bibdate =      "Mon Nov 18 18:47:27 MST 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "RISC-V Reference Card / i \\
                 List of Figures / ix \\
                 Preface / xii \\
                 1 Why RISC-V? / 2 \\
                 2 RV32I: RISC-V Base Integer ISA / 14 \\
                 3 RISC-V Assembly Language / 32 \\
                 4 RV32M: Multiply and Divide / / 44 \\
                 5 RV32FD: Single/Double Floating Point / 48 \\
                 6 RV32A: Atomic / / 60 \\
                 7 RV32C: Compressed Instructions / 64 \\
                 8 RV32V: Vector / 72 \\
                 9 RV64: 64-bit Address Instructions / / 86 \\
                 10 RV32/64 Privileged Architecture / 100 \\
                 11 Future RISC-V Optional Extensions / 118 \\
                 Appendix A: RISC-V Instruction Listings / 120 \\
                 Appendix B: Transliteration from RISC-V / 168 \\
                 Index / 174",
  tableofcontents = "List of Figures / x \\
                 Preface / xii \\
                 1 Why RISC-V? / 2 \\
                 1.1 Introduction / 2 \\
                 1.2 Modular vs. Incremental ISAs / 4 \\
                 1.3 ISA Design 101 / 5 \\
                 1.4 An Overview of this Book / 10 \\
                 1.5 Concluding Remarks / 11 \\
                 1.6 To Learn More / 12 \\
                 2 RV32I: RISC-V Base Integer ISA / 14 \\
                 2.1 Introduction / 14 \\
                 2.2 RV32I Instruction formats / 14 \\
                 2.3 RV32I Registers / 18 \\
                 2.4 RV32I Integer Computation. / 18 \\
                 2.5 RV32I Loads and Stores / 20 \\
                 2.6 RV32I Conditional Branch / 21 \\
                 2.7 RV32I Unconditional Jump / 22 \\
                 2.8 RV32I Miscellaneous / 23 \\
                 2.9 Comparing RV32I, ARM-32, MIPS-32, and x86-32 / 23
                 \\
                 2.10 Concluding Remarks / 24 \\
                 2.11 To Learn More / 26 \\
                 3 RISC-V Assembly Language / 32 \\
                 3.1 Introduction / 32 \\
                 3.2 Calling convention / 32 \\
                 3.3 Assembly / 35 \\
                 3.4 Linker / 40 \\
                 3.5 Static vs. Dynamic Linking / 41 \\
                 3.6 Loader / 42 \\
                 3.7 Concluding Remarks / 42 \\
                 3.8 To Learn More / 42 \\
                 4 RV32M: Multiply and Divide / 44 \\
                 4.1 Introduction / 44 \\
                 4.2 Concluding Remarks / 46 \\
                 4.3 To Learn More / 46 \\
                 5 RV32FD: Single/Double Floating Point / 48 \\
                 5.1 Introduction / 48 \\
                 5.2 Floating-Point Registers / 48 \\
                 5.3 Floating-Point Loads, Stores, and Arithmetic / 49
                 \\
                 5.4 Floating-Point Moves and Converts / 53 \\
                 5.5 Miscellaneous Floating-Point Instructions / 53 \\
                 5.6 Comparing RV32FD, ARM-32, MIPS-32, and x86-32 using
                 DAXPY / 55 \\
                 5.7 Concluding Remarks / 55 \\
                 5.8 To Learn More / 56 \\
                 6 RV32A: Atomic / 60 \\
                 6.1 Introduction / 60 \\
                 6.2 Concluding Remarks / 62 \\
                 6.3 To Learn More / 62 \\
                 7 RV32C: Compressed Instructions / 64 \\
                 7 1 Introduction / 64 \\
                 7.2 Comparing RV32GC, Thumb-2, microMIPS, and x86-32 /
                 66 \\
                 7.3 Concluding Remarks / 66 \\
                 7.4 To Learn More / 67 \\
                 8. RV32V: Vector / 72 \\
                 8.1 Introduction / 72 \\
                 8.2 Vector Computation Instructions / 73 \\
                 8.3 Vector Registers and Dynamic Typing / 74 \\
                 8.4 Vector Loads and Stores / 75 \\
                 8.5 Parallelism During Vector Execution / 76 \\
                 8.6 Conditional Execution of Vector Operations / 76 \\
                 8.7 Miscellaneous Vector Instructions / 77 \\
                 8.8 Vector Example: DAXPY in RV32V / 78 \\
                 8.9 Comparing RV32V, MIPS-32 MSA SIMD, and x86-32 AVX
                 SIMD / 79 \\
                 8.10 Concluding Remarks / 81 \\
                 8.11 To Learn More / 82 \\
                 9 RV64: 64-bit Address Instructions / 86 \\
                 9.1 Introduction / 86 \\
                 9.2 Comparison to Other 64-bit ISAs using Insertion
                 Sort / 90 \\
                 9.3 Program size / 92 \\
                 9.4 Concluding Remarks / 93 \\
                 9.5 To Learn More / 93 \\
                 10 RV32/64 Privileged Architecture / 100 \\
                 10.1 Introduction / 100 \\
                 10.2 Machine Mode for Simple Embedded Systems. / 101
                 \\
                 10.3 Machine-Mode Exception Handling / 103 \\
                 10.4 User Mode and Process Isolation in Embedded
                 Systems / 106 \\
                 10.5 Supervisor Mode for Modern Operating Systems / 108
                 \\
                 10.6 Page-Based Virtual Memory / 111 \\
                 10.7 Identification and Performance CSRs / 114 \\
                 10.8 Concluding Remarks / 115 \\
                 10.9 To Learn More / 117 \\
                 11 Future RISC-V Optional Extensions / 118 \\
                 11.1 ``B'' Standard Extension for Bit Manipulation /
                 118 \\
                 11.2 ``E'' Standard Extension for Embedded / 118 \\
                 11.3 ``H'' Privileged Architecture Extension for
                 Hypervisor Support / 118 \\
                 11.4 ``J'' Standard Extension for Dynamically
                 Translated Languages / 118 \\
                 11.5 ``L'' Standard Extension for Decimal
                 Floating-Point / 118 \\
                 11.6 ``N'' Standard Extension for User-Level Interrupts
                 / 119 \\
                 11.7 ``P'' Standard Extension for Packed-SIMD
                 Instructions / 119 \\
                 11.8 ``Q'' Standard Extension for Quad-Precision
                 Floating-Point / 119 \\
                 11.9 Concluding Remarks / 119 \\
                 A RISC-V Instruction Listings / 120 \\
                 B Transliteration from RISC-V / 168 \\
                 B.1 Introduction / 168 \\
                 B.2 Comparing RV32I, ARM-32, and x86-32 using Tree Sum
                 / 170 \\
                 B.3 Conclusion / 171 \\
                 Index / 174",
}

@Book{Patterson:2018:COD,
  author =       "David A. Patterson and John L. Hennessy",
  title =        "Computer Organization and Design: the
                 Hardware--Software Interface",
  publisher =    pub-MORGAN-KAUFMANN-ELSEVIER,
  address =      pub-MORGAN-KAUFMANN-ELSEVIER:adr,
  edition =      "{RISC-V}",
  pages =        "xxiv + 565 + 86 + i + 22",
  year =         "2018",
  ISBN =         "0-12-812275-7, 0-12-812276-5 (e-book)",
  ISBN-13 =      "978-0-12-812275-4, 978-0-12-812276-1 (e-book)",
  LCCN =         "QA76.9.C643 P37 2018",
  bibdate =      "Tue Dec 3 16:32:58 MST 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  shorttableofcontents = "1. Computer Abstractions and Technology \\
                 2. Instructions: Language of the Computer \\
                 3. Arithmetic for Computers \\
                 4. The RISC-V Processor \\
                 5. Large and Fast: Exploiting Memory Hierarchy \\
                 6. Parallel Processors from Client to Cloud \\
                 A. The Basics of Logic Design \\
                 B. Graphics and Computing GPUs \\
                 C. Mapping Control to Hardware \\
                 D. A Survey of RISC Architectures",
  subject =      "Computer organization; System design; Data processing;
                 Computer architecture; Interfaces (Inform{\'a}tica);
                 Ordenadores; Dise{\"a}no y construcci{\'o}n",
}

@Article{Patterson:raid,
  author =       "D. A. Patterson and P. Chen and G. Gibson and R. H.
                 Katz",
  title =        "Introduction to Redundant Arrays of Inexpensive
                 Disks",
  journal =      j-COMPCON-SPRING89,
  year =         "1989",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "IEEE Computer Society Press",
  acknowledgement = ack-nhfb,
}

@Book{Paul:1989:CMC,
  author =       "Kevin Paul",
  title =        "Chairing a meeting with confidence: an easy guide to
                 rules and procedure",
  publisher =    "Self-Counsel Press",
  address =      "North Vancouver, BC, Canada",
  pages =        "xi + 80",
  year =         "1989",
  ISBN =         "0-88908-858-6",
  ISBN-13 =      "978-0-88908-858-0",
  LCCN =         "AS6 .P36 1989",
  bibdate =      "Sat Dec 24 15:07:38 MST 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Self-Counsel reference series",
  acknowledgement = ack-nhfb,
  idnumber =     "514",
  subject =      "Meetings; Handbooks, manuals, etc; Parliamentary
                 practice",
}

@Book{Pauling:1935:IQM,
  author =       "Linus Pauling and E. Bright {Wilson, Jr.}",
  title =        "Introduction to Quantum Mechanics: With Applications
                 to Chemistry",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "xi + 468",
  year =         "1935",
  LCCN =         "QC174.1 .P34",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/p/pauli-wolfgang.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/s/schroedinger-erwin.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/s/slater-john-clarke.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Reprinted by Dover, 1985.",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "Preface \\
                 I: Survey of Classical Mechanics \\
                 II: The Old Quantum Theory \\
                 III: The Schr{\"o}dinger Wave Equation With the IV: The
                 Wave Equation for a System of Point Particles V: The
                 Hydrogen Atom \\
                 VI: Perturbation Theory \\
                 VII: The Variation Method and Other Approximate Methods
                 VIII: The Spinning Electron and the Pauli Exclusion IX:
                 Many-Electron Atoms \\
                 X: The Rotation and Vibration of Molecules \\
                 XI: Perturbation Theory Involving the Time, the XII:
                 The Structure of Simple Molecules \\
                 XIII: The Structure of Complex Molecules \\
                 XIV: Miscellaneous Applications of Quantum Mechanics
                 XV: General Theory of Quantum Mechanics \\
                 Appendices \\
                 Index",
  tableofcontents = "Preface / iii \\
                 I: Survey of Classical Mechanics \\
                 1. Newton's Equations of Motion in the Lagrangian Form
                 / 2 \\
                 1a. The Three-dimensional Isotropic Harmonic Oscillator
                 / 4 \\
                 1b. Generalized Coordinates / 6 \\
                 1e. The Invariance of the Equations of Motion in the
                 Lagrangian Form / 7 \\
                 1d. An Example: The Isotropic Harmonic Oscillator in
                 Polar Coordinates / 9 \\
                 1e. The Conservation of Angular Momentum / 11 \\
                 2. The Equations of Motion in the Hamiltonian Form / 14
                 \\
                 2a. Generalized Momenta / 14 \\
                 2b. The Hamiltonian Function and Equations / 16 \\
                 2c. The Hamiltonian Function and the Energy / 16 \\
                 2d. A General Example / 17 \\
                 3. The Emission and Absorption of Radiation / 21 \\
                 4. Summary of Chapter I / 23 \\
                 II: The Old Quantum Theory \\
                 5. The Origin of the Old Quantum Theory / 25 \\
                 5a. The Postulates of Bohr / 26 \\
                 5b. The Wilson--Sommerfeld Rules of Quantization / 28
                 \\
                 5c. Selection Rules. The Correspondence Principle / 29
                 \\
                 6. The Quantization of Simple Systems / 30 \\
                 6a. The Harmonic Oscillator. Degenerate States / 30 \\
                 6b. The Rigid Rotator / 31 \\
                 6c. The Oscillating and Rotating Diatomic Molecule / 32
                 \\
                 6d. The Particle in a Box / 33 \\
                 6e. Diffraction by a Crystal Lattice / 34 \\
                 7. The Hydrogen Atom / 36 \\
                 7 a. Solution of the Equations of Motion / 36 \\
                 7b. Application of the Quantum Rules. The Energy Levels
                 / 39 \\
                 7 c. Description of the Orbits / 43 \\
                 7d. Spatial Quantization / 45 \\
                 8. The Decline of the Old Quantum Theory / 47 \\
                 III: The Schr{\"o}dinger Wave Equation With the
                 Harmonic Oscillator as an Example \\
                 9. The Schr{\"o}dinger Wave Equation / 50 \\
                 9a. The Wave Equation Including the Time / 53 \\
                 9b. The Amplitude Equation / 56 \\
                 9c. Wave Functions. Discrete and Continuous Sets of
                 Characteristic Energy Values / 58 \\
                 9d. The Complex Conjugate Wave Function $\Psi^\ast(x,
                 t)$ / 63 \\
                 10. The Physical Interpretation of the Wave Functions /
                 63 \\
                 10a. $\Psi^\ast(x, t) \Psi(x, t)$ as a Probability
                 Distribution Function / 63 \\
                 10b. Stationary States / 64 \\
                 10c. Further Physical Interpretation. Average Values of
                 Dynamical Quantities / 65 \\
                 11. The Harmonic Oscillator in Wave Mechanics / 67 \\
                 11a. Solution of the Wave Equation / 67 \\
                 11b. The Wave Functions for the Harmonic Oscillator and
                 their Physical Interpretation / 73 \\
                 11c. Mathematical Properties of the Harmonic Oscillator
                 Wave Functions / 77 \\
                 IV: The Wave Equation for a System of Point Particles
                 in Three Dimensions \\
                 12. The Wave Equation for a System of Point Particles /
                 84 \\
                 12a. The Wave Equation Including the Time / 85 \\
                 12b. The Amplitude Equation / 86 \\
                 12c. The Complex Conjugate Wave Function $\Psi^\ast(x_1
                 \cdots z_N, t)$ / 88 \\
                 12d. The Physical Interpretation of the Wave Functions
                 / 88 \\
                 13. The Free Particle / 90 \\
                 14. The Particle in a Box / 95 \\
                 15. The Three-dimensional Harmonic Oscillator in
                 Cartesian Coordinates / 100 \\
                 16. Curvilinear Coordinates / 103 \\
                 17. The Three-dimensional Harmonic Oscillator in
                 Cylindrical Coordinates / 105 \\
                 V: The Hydrogen Atom \\
                 18. The Solution of the Wave Equation by the Polynomial
                 Method and the Determination of the Energy Levels / 113
                 \\
                 18a. The Separation of the Wave Equation. The
                 Translational Motion / 113 \\
                 18b. The Solution of the $\phi$ Equation / 117 \\
                 18c. The Solution of the $\theta$ Equation / 118 \\
                 18d. The Solution of the $r$ Equation / 121 \\
                 18e. The Energy Levels / 124 \\
                 19. Legendre Functions and Surface Harmonics / 125 \\
                 19a. The Legend re Functions or Legendre Polynomials /
                 126 \\
                 19b. The Associated Legendre Functions / 127 \\
                 20. The Laguerre Polynomials and Associated Laguerre
                 Functions / 129 \\
                 20a. The Laguerre Polynomials / 129 \\
                 20b. The Associated Laguerre Polynomials and Functions
                 / 131 \\
                 21. The Wave Functions for the Hydrogen Atom / 132 \\
                 21a. Hydrogen-like Wave Functions / 132 \\
                 21b. The Normal State of the Hydrogen Atom / 139 \\
                 21c. Discussion of the Hydrogen-like Radial Wave
                 Functions / 142 \\
                 21d. Discussion of the Dependence of the Wave Functions
                 on the Angles $\theta$ and $\phi$ / 146 \\
                 VI: Perturbation Theory \\
                 22. Expansions in Series of Orthogonal Functions / 151
                 \\
                 23. First-order Perturbation Theory for a
                 Non-degenerate Level / 156 \\
                 23a. A Simple Example: The Perturbed Harmonic
                 Oscillator / 160 \\
                 23b. An Example: The Normal Helium Atom / 162 \\
                 24. First-order Perturbation Theory for a Degenerate
                 Level / 165 \\
                 24a. An Example: Application of a Perturbation to a
                 Hydrogen Atom / 172 \\
                 25. Second-order Perturbation Theory / 176 \\
                 25a. An Example: The Stark Effect of the Plane Rotator
                 / 177 \\
                 VII: The Variation Method and Other Approximate Methods
                 \\
                 26. The Variation Method / 180 \\
                 26a. The Variational Integral and its Properties / 180
                 \\
                 26b. An Example: The Normal State of the Helium Atom /
                 184 \\
                 26c. Application of the Variation Method to Other
                 States / 186 \\
                 26d. Linear Variation Functions / 186 \\
                 26e. A More General Variation Method / 189 \\
                 27. Other Approximate Methods / 191 \\
                 27a. A Generalized Perturbation Theory / 191 \\
                 27b. The Wentzel--Kramers--Brillouin Method / 198 \\
                 27c. Numerical Integration / 201 \\
                 27d. Approximation by the Use of Difference Equations /
                 202 \\
                 27e. An Approximate Second-order Perturbation Treatment
                 / 204 \\
                 VIII: The Spinning Electron and the Pauli Exclusion
                 Principle, with a Discussion of the Helium Atom \\
                 28. The Spinning Electron / 207 \\
                 29. The Helium Atom. The Pauli Exclusion Principle /
                 210 \\
                 29a. The Configurations ls2s and ls2p / 210 \\
                 29b. The Consideration of Electron Spin. The Pauli
                 Exclusion Principle / 214 \\
                 29c. The Accurate Treatment of the Normal Helium Atom /
                 221 \\
                 29d. Excited States of the Helium Atom / 225 \\
                 29e. The Polarizability of the Normal Helium Atom / 226
                 \\
                 IX: Many-Electron Atoms \\
                 30 Slater's Treatment of Complex Atoms / 230 \\
                 30a. Exchange Degeneracy / 230 \\
                 30b. Spatial Degeneracy / 233 \\
                 30c. Factorization and Solution of the Secular Equation
                 / 235 \\
                 30d. Evaluation of Integrals / 239 \\
                 30e. Empirical Evaluation of Integrals. Applications /
                 244 \\
                 31. Variation Treatments for Simple Atoms / 246 \\
                 31a. The Lithium Atom and Three- electron Ions / 247
                 \\
                 31b. Variation Treatments of Other Atoms / 249 \\
                 32. The Method of the Self-consistent Field / 250 \\
                 32a. Principle of the Method / 250 \\
                 32b. Relation of the Self-consistent Field Method to
                 the Variation Principle / 252 \\
                 32c. Results of the Self-consistent Field Method / 254
                 \\
                 33. Other Methods for Many-electron Atoms / 256 \\
                 33a. Semi-empirical Sets of Screening Constants / 256
                 \\
                 33b. The Thomas--Fermi Statistical Atom / 257 \\
                 X: The Rotation and Vibration of Molecules \\
                 34. The Separation of Electronic and Nuclear Motion /
                 259 \\
                 35. The Rotation and Vibration of Diatomic Molecules /
                 263 \\
                 35a. The Separation of Variables and Solution of the
                 Angular Equations / 264 \\
                 35b. The Nature of the Electronic Energy Function / 266
                 \\
                 35c. A Simple Potential Function for Diatomic Molecules
                 / 267 \\
                 35d. A More Accurate Treatment. The Morse Function /
                 271 \\
                 36. The Rotation of Polyatomic Molecules / 275 \\
                 36a. The Rotation of Symmetrical-top Molecules / 275
                 \\
                 36b. The Rotation of Unsymmetrical-top Molecules / 280
                 \\
                 37. The Vibration of Polyatomic Molecules / 282 \\
                 37a. Normal Coordinates in Classical Mechanics / 282
                 \\
                 37b. Normal Coordinates in Quantum Mechanics / 288 \\
                 38. The Rotation of Molecules in Crystals / 290 \\
                 XI: Perturbation Theory Involving the Time, the
                 Emission and Absorption of Radiation, and the Resonance
                 Phenomenon \\
                 39. The Treatment of a Time-dependent Perturbation by
                 the Method of Variation of Constants / 294 \\
                 39a. A Simple Example / 296 \\
                 40. The Emission and Absorption of Radiation / 299 \\
                 40a. The Einstein Transition Probabilities / 299 \\
                 40b. The Calculation of the Einstein Transition
                 Probabilities by Perturbation Theory / 302 \\
                 40c. Selection Rules and Intensities for the Harmonic
                 Oscillator / 306 \\
                 40d. Selection Rules and Intensities for
                 Surface-harmonic Wave Functions / 306 \\
                 40e. Selection Rules and Intensities for the Diatomic
                 Molecule. The Franck--Condon Principle / 309 \\
                 40f. Selection Rules and Intensities for the Hydrogen
                 Atom / 312 \\
                 40g. Even and Odd Electronic States and their Selection
                 Rules / 313 \\
                 41. The Resonance Phenomenon / 314 \\
                 41a. Resonance in Classical Mechanics / 315 \\
                 41b. Resonance in Quantum Mechanics / 318 \\
                 41c. A Further Discussion of Resonance / 322 \\
                 XII: The Structure of Simple Molecules \\
                 42. The Hydrogen Molecule-ion / 327 \\
                 42a. A Very Simple Discussion / 327 \\
                 42b. Other Simple Variation Treatments / 331 \\
                 42c. The Separation and Solution of the Wave Equation /
                 333 \\
                 42d. Excited States of the Hydrogen Molecule-ion / 340
                 \\
                 43. The Hydrogen Molecule / 340 \\
                 43a. The Treatment of Heitler and London / 340 \\
                 43b. Other Simple Variation Treatments / 345 \\
                 43c. The Treatment of James and Coolidge / 349 \\
                 43d. Comparison with Experiment / 351 \\
                 43e. Excited States of the Hydrogen Molecule / 353 \\
                 43f. Oscillation and Rotation of the Molecule. Ortho
                 and Para Hydrogen / 355 \\
                 44. The Helium Molecule-ion He$_2^+$ and the
                 Interaction of Two Normal Helium Atoms / 358 \\
                 44a. The Helium Molecule-ion He$_2^+$ / 358 \\
                 44b. The Interaction of Two Normal Helium Atoms / 361
                 \\
                 46. The One-electron Bond, the Electron-pair Bond, and
                 the Three-electron Bond / 362 \\
                 XIII: The Structure of Complex Molecules \\
                 46. Slater's Treatment of Complex Molecules / 366 \\
                 46a. Approximate Wave Functions for the System of Three
                 Hydrogen Atoms / 368 \\
                 46b. Factoring the Secular Equation / 369 \\
                 46c. Reduction of Integrals / 370 \\
                 46d. Limiting Cases for the System of Three Hydrogen
                 Atoms / 372 \\
                 46e. Generalization of the Method of Valence-bond Wave
                 Functions / 374 \\
                 46f. Resonance among Two or More Valence-bond
                 Structures / 377 \\
                 46g. The Meaning of Chemical Valence Formulas / 380 \\
                 46h. The Method of Molecular Orbitals / 381 \\
                 XIV: Miscellaneous Applications of Quantum Mechanics
                 \\
                 47. Van der Waals Forces / 383 \\
                 47a. Van der Waals Forces for Hydrogen Atoms / 384 \\
                 47b. Van der Waals Forces for Helium / 387 \\
                 47c. The Estimation of Van der Waals Forces from
                 Molecular Polarizabilities / 387 \\
                 48. The Symmetry Properties of Molecular Wave Functions
                 / 388 \\
                 48a. Even and Odd Electronic Wave Functions. Selection
                 Rules / 390 \\
                 48b. The Nuclear Symmetry Character of the Electronic
                 Wave Function / 391 \\
                 48c. Summary of Results Regarding Symmetrical Diatomic
                 Molecules / 394 \\
                 49. Statistical Quantum Mechanics. Systems in
                 Thermodynamic Equilibrium / 395 \\
                 49a. The Fundamental Theorem of Statistical Quantum
                 Mechanics / 396 \\
                 49b. A Simple Application / 397 \\
                 49c. The Boltzmann Distribution Law / 399 \\
                 49d. Fermi--Dirac and Bose--Einstein Statistics / 402
                 \\
                 49e. The Rotational and Vibrational Energy of Molecules
                 / 406 \\
                 49f. The Dielectric Constant of a Diatomic Dipole Gas /
                 408 \\
                 50. The Energy of Activation of Chemical Reactions /
                 412 \\
                 XV: General Theory of Quantum Mechanics \\
                 51. Matrix Mechanics / 416 \\
                 51a. Matrices and their Relation to Wave Functions. The
                 Rules of Matrix Algebra / 417 \\
                 51b. Diagonal Matrices and Their Physical
                 Interpretation / 421 \\
                 52. The Properties of Angular Momentum / 425 \\
                 53. The Uncertainty Principle / 428 \\
                 54. Transformation Theory / 432 \\
                 Appendices \\
                 I. Values of Physical Constants / 439 \\
                 II. Proof that the Orbit of a Particle Moving in a
                 Central Field Lies in a Plane / 440 \\
                 III. Proof of Orthogonality of Wave Functions
                 Corresponding to Different Energy Levels / 441 \\
                 IV. Orthogonal Curvilinear Coordinate Systems / 443 \\
                 V. The Evaluation of the Mutual Electrostatic Energy of
                 Two Spherically Symmetrical Distributions of
                 Electricity with Exponential Density Funct ions / 446
                 \\
                 VI. Normalization of the Associated Legendre Functions
                 / 448 \\
                 VII. Normalization of the Associated Laguerre Functions
                 / 451 \\
                 VIII. The Greek Alphabet / 453 \\
                 Index / 455",
}

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

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

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

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

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

@Misc{pc-sales88,
  key =          "PCS",
  year =         "1988",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Trade journal advertisement sales volume estimates.",
  acknowledgement = ack-nhfb,
}

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

                 Part 6. The voice of the species\par

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

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

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

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

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

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

                 Part 6. The voice of the species\par

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

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

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

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

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

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

@Book{Pitzer:1953:QC,
  author =       "Kenneth S. (Kenneth Sanborn) Pitzer",
  title =        "Quantum Chemistry",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "x + 529",
  year =         "1953",
  LCCN =         "QC174.1 .P49",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

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

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

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

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

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

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

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

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

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

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

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

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

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

@Book{Press:1992:NRF,
  author =       "William H. Press and Saul A. Teukolsky and William T.
                 Vetterling and Brian P. Flannery",
  title =        "Numerical Recipes in {FORTRAN}: The Art of
                 Scientific Computing",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  edition =      "Second",
  pages =        "xxvi + 963",
  day =          "1",
  month =        oct,
  year =         "1992",
  ISBN =         "0-521-43064-X (book), 0-521-43721-0 (example book)
                 0-521-43717-2 (diskette), 0-521-43719-9 (diskette),
                 0-521-43716-4 (diskette)",
  ISBN-13 =      "978-0-521-43064-7 (book), 978-0-521-43721-9 (example
                 book) 978-0-521-43717-2 (diskette), 978-0-521-43719-6
                 (diskette), 978-0-521-43716-5 (diskette)",
  LCCN =         "QA76.73.C15 N865 1992",
  MRclass =      "65-00 (62-04 65-04)",
  MRnumber =     "93i:65001a",
  bibdate =      "Wed Apr 11 06:18:56 2012",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg-2ed.bib;
                 https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
                 https://www.math.utah.edu/pub/tex/bib/fortran3.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/numana1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "Includes MacIntosh disk.",
  price =        "US\$39.95; US\$54.95",
  acknowledgement = ack-nhfb,
  hardcover =    "yes",
  keywords =     "FORTRAN (Computer program language); Fortran (computer
                 program language); numerical analysis -- computer
                 programs; Numerical analysis --- Computer programs;
                 science -- mathematics -- computer programs; Science
                 --- Mathematics --- Computer programs",
  shorttableofcontents = "Preface to the Second Edition / xi \\
                 Preface to the First Edition / xiv \\
                 Legal Matters / xvi \\
                 Computer Programs by Chapter and Section / xix \\
                 1 Preliminaries / 1 \\
                 2 Solution of Linear Algebraic Equations / 22 \\
                 3 Interpolation and Extrapolation / 99 \\
                 4 Integration of Functions / 123 \\
                 5 Evaluation of Functions / 159 \\
                 6 Special Functions / 205 \\
                 7 Random Numbers / 266 \\
                 8 Sorting / 320 \\
                 9 Root Finding and Nonlinear Sets of Equations / 340 10
                 Minimization or Maximization of Functions / 387 \\
                 11 Eigensystems / 449 \\
                 12 Fast Fourier Transform / 490 \\
                 13 Fourier and Spectral Applications / 530 \\
                 14 Statistical Description of Data / 603 \\
                 15 Modeling of Data / 650 \\
                 16 Integration of Ordinary Differential Equations / 701
                 17 Two Point Boundary Value Problems / 745 \\
                 18 Integral Equations and Inverse Theory / 779 \\
                 19 Partial Differential Equations / 818 \\
                 20 Less-Numerical Algorithms / 881 \\
                 References / 916 \\
                 Index of Programs and Dependencies / 920 \\
                 General Index / 934",
  tableofcontents = "Preface to the Second Edition / xi \\
                 Preface to the First Edition / xiv \\
                 Legal Matters / xvi \\
                 Computer Programs by Chapter and Section / xix \\
                 1 Preliminaries / 1 \\
                 1.0 Introduction / 1 \\
                 1.1 Program Organization and Control Structures / 5 \\
                 1.2 Error, Accuracy, and Stability / 18 \\
                 \\
                 2 Solution of Linear Algebraic Equations / 22 \\
                 2.0 Introduction / 22 \\
                 2.1 Gauss--Jordan Elimination / 27 \\
                 2.2 Gaussian Elimination with Backsubstitution / 33 \\
                 2.3 LU Decomposition and Its Applications / 34 \\
                 2.4 Tridiagonal and Band Diagonal Systems of Equations
                 / 42 \\
                 2.5 Iterative Improvement of a Solution to Linear
                 Equations / 47 \\
                 2.6 Singular Value Decomposition / 51 \\
                 2.7 Sparse Linear Systems / 63 \\
                 2.8 Vandermonde Matrices and Toeplitz Matrices / 82 \\
                 2.9 Cholesky Decomposition / 89 \\
                 2.10 $ Q R $ Decomposition / 91 \\
                 2.11 Is Matrix Inversion an N3 Process? / 95 \\
                 \\
                 3 Interpolation and Extrapolation / 99 \\
                 3.0 Introduction / 99 \\
                 3.1 Polynomial Interpolation and Extrapolation / 102
                 \\
                 3.2 Rational Function Interpolation and Extrapolation /
                 104 \\
                 3.3 Cubic Spline Interpolation / 107 \\
                 3.4 How to Search an Ordered Table / 110 \\
                 3.5 Coefficients of the Interpolating Polynomial / 113
                 \\
                 3.6 Interpolation in Two or More Dimensions / 116 \\
                 \\
                 4 Integration of Functions / 123 \\
                 4.0 Introduction / 123 \\
                 4.1 Classical Formulas for Equally Spaced Abscissas /
                 124 \\
                 4.2 Elementary Algorithms / 130 \\
                 4.3 Romberg Integration / 134 \\
                 4.4 Improper Integrals / 135 \\
                 4.5 Gaussian Quadratures and Orthogonal Polynomials /
                 140 \\
                 4.6 Multidimensional Integrals / 155 \\
                 \\
                 5 Evaluation of Functions / 159 \\
                 5.0 Introduction / 159 \\
                 5.1 Series and Their Convergence / 159 \\
                 5.2 Evaluation of Continued Fractions / 163 \\
                 5.3 Polynomials and Rational Functions / 167 \\
                 5.4 Complex Arithmetic / 171 \\
                 5.5 Recurrence Relations and Clenshaw's Recurrence
                 Formula / 172 \\
                 5.6 Quadratic and Cubic Equations / 178 \\
                 5.7 Numerical Derivatives / 180 \\
                 5.8 Chebyshev Approximation / 184 \\
                 5.9 Derivatives or Integrals of a
                 Chebyshev-approximated Function / 189 \\
                 5.10 Polynomial Approximation from Chebyshev
                 Coefficients / 191 \\
                 5.11 Economization of Power Series / 192 \\
                 5.12 Pad{\'e} Approximants / 194 \\
                 5.13 Rational Chebyshev Approximation / 197 \\
                 5.14 Evaluation of Functions by Path Integration / 201
                 \\
                 \\
                 6 Special Functions / 205 \\
                 6.0 Introduction / 205 \\
                 6.1 Gamma Function, Beta Function, Factorials, Binomial
                 Coefficients / 206 \\
                 6.2 Incomplete Gamma Function, Error Function,
                 Chi-Square Probability Function, Cumulative Poisson
                 Function / 209 \\
                 6.3 Exponential Integrals / 215 \\
                 6.4 Incomplete Beta Function, Student's Distribution,
                 F-Distribution, Cumulative Binomial Distribution / 219
                 \\
                 6.5 Bessel Functions of Integer Order / 223 \\
                 6.6 Modified Bessel Functions of Integer Order / 229
                 \\
                 6.7 Bessel Functions of Fractional Order, Airy
                 Functions, Spherical Bessel Functions / 234 \\
                 6.8 Spherical Harmonics / 246 \\
                 6.9 Fresnel Integrals, Cosine and Sine Integrals / 248
                 \\
                 6.10 Dawson's Integral / 252 \\
                 6.11 Elliptic Integrals and Jacobian Elliptic Functions
                 / 254 \\
                 6.12 Hypergeometric Functions / 263 \\
                 \\
                 7 Random Numbers / 266 \\
                 7.0 Introduction / 266 \\
                 7.1 Uniform Deviates / 267 \\
                 7.2 Transformation Method: Exponential and Normal
                 Deviates / 277 \\
                 7.3 Rejection Method: Gamma, Poisson, Binomial Deviates
                 / 281 \\
                 7.4 Generation of Random Bits / 287 \\
                 7.5 Random Sequences Based on Data Encryption / 290 \\
                 7.6 Simple Monte Carlo Integration / 295 \\
                 7.7 Quasi- (that is, Sub-) Random Sequences / 299 \\
                 7.8 Adaptive and Recursive Monte Carlo Methods / 306
                 \\
                 \\
                 8 Sorting / 320 \\
                 8.0 Introduction / 320 \\
                 8.1 Straight Insertion and Shell's Method / 321 \\
                 8.2 Quicksort / 323 \\
                 8.3 Heapsort / 327 \\
                 8.4 Indexing and Ranking / 329 \\
                 8.5 Selecting the $M$th Largest / 333 \\
                 8.6 Determination of Equivalence Classes / 337 \\
                 \\
                 9 Root Finding and Nonlinear Sets of Equations / 340
                 \\
                 9.0 Introduction / 340 \\
                 9.1 Bracketing and Bisection / 343 \\
                 9.2 Secant Method, False Position Method, and Ridders'
                 Method / 347 \\
                 9.3 Van Wijngaarden--Dekker--Brent Method / 352 \\
                 9.4 Newton--Raphson Method Using Derivative / 355 \\
                 9.5 Roots of Polynomials / 362 \\
                 9.6 Newton--Raphson Method for Nonlinear Systems of
                 Equations / 372 \\
                 9.7 Globally Convergent Methods for Nonlinear Systems
                 of Equations / 376 \\
                 \\
                 10 Minimization or Maximization of Functions / 387 \\
                 10.0 Introduction / 387 \\
                 10.1 Golden Section Search in One Dimension / 390 \\
                 10.2 Parabolic Interpolation and Brent's Method in One
                 Dimension / 395 \\
                 10.3 One-Dimensional Search with First Derivatives /
                 399 \\
                 10.4 Downhill Simplex Method in Multidimensions / 402
                 \\
                 10.5 Direction Set (Powell's) Methods in
                 Multidimensions / 406 \\
                 10.6 Conjugate Gradient Methods in Multidimensions /
                 413 \\
                 10.7 Variable Metric Methods in Multidimensions / 418
                 \\
                 10.8 Linear Programming and the Simplex Method / 423
                 \\
                 10.9 Simulated Annealing Methods / 436 \\
                 \\
                 11 Eigensystems / 449 \\
                 11.0 Introduction / 449 \\
                 11.1 Jacobi Transformations of a Symmetric Matrix / 456
                 \\
                 11.2 Reduction of a Symmetric Matrix to Tridiagonal
                 Form: Givens and Householder Reductions / 462 \\
                 11.3 Eigenvalues and Eigenvectors of a Tridiagonal
                 Matrix / 469 \\
                 11.4 Hermitian Matrices / 475 \\
                 11.5 Reduction of a General Matrix to Hessenberg Form /
                 476 \\
                 11.6 The $ Q R $ Algorithm for Real Hessenberg Matrices
                 / 480 \\
                 11.7 Improving Eigenvalues and/or Finding Eigenvectors
                 by Inverse Iteration / 487 \\
                 \\
                 12 Fast Fourier Transform / 490 \\
                 12.0 Introduction / 490 \\
                 12.1 Fourier Transform of Discretely Sampled Data / 494
                 \\
                 12.2 Fast Fourier Transform (FFT) / 498 \\
                 12.3 FFT of Real Functions, Sine and Cosine Transforms
                 / 504 \\
                 12.4 FFT in Two or More Dimensions / 515 \\
                 12.5 Fourier Transforms of Real Data in Two and Three
                 Dimensions / 519 \\
                 12.6 External Storage or Memory-Local FFTs / 525 \\
                 \\
                 13 Fourier and Spectral Applications / 530 \\
                 13.0 Introduction / 530 \\
                 13.1 Convolution and Deconvolution Using the FFf / 531
                 \\
                 13.2 Correlation and Autocorrelation Using the FFT /
                 538 \\
                 13.3 Optimal (Wiener) Filtering with the FFf / 539 \\
                 13.4 Power Spectrum Estimation Using the FFT / 542 \\
                 13.5 Digital Filtering in the Time Domain / 551 \\
                 13.6 Linear Prediction and Linear Predictive Coding /
                 557 \\
                 13.7 Power Spectrum Estimation by the Maximum Entropy
                 (All Poles) Method / 565 \\
                 13.8 Spectral Analysis of Unevenly Sampled Data / 569
                 \\
                 13.9 Computing Fourier Integrals Using the FFT / 577
                 \\
                 13.10 Wavelet Transforms / 584 \\
                 13.11 Numerical Use of the Sampling Theorem / 600 \\
                 \\
                 14 Statistical Description of Data / 603 \\
                 14.0 Introduction / 603 \\
                 14.1 Moments of a Distribution: Mean, Variance,
                 Skewness, and So Forth / 604 \\
                 14.2 Do Two Distributions Have the Same Means or
                 Variances? / 609 \\
                 14.3 Are Two Distributions Different? / 614 \\
                 14.4 Contingency Table Analysis of Two Distributions /
                 622 \\
                 14.5 Linear Correlation / 630 \\
                 14.6 Nonparametric or Rank Correlation / 633 \\
                 14.7 Do Two-Dimensional Distributions Differ? / 640 \\
                 14.8 Savitzky--Golay Smoothing Filters / 644 \\
                 \\
                 15 Modeling of Data / 650 \\
                 15.0 Introduction / 650 \\
                 15.1 Least Squares as a Maximum Likelihood Estimator /
                 651 \\
                 15.2 Fitting Data to a Straight Line / 655 \\
                 15.3 Straight-Line Data with Errors in Both Coordinates
                 / 660 \\
                 15.4 General Linear Least Squares / 665 \\
                 15.5 Nonlinear Models / 675 \\
                 \\
                 15.6 Confidence Limits on Estimated Model Parameters /
                 684 \\
                 15.7 Robust Estimation / 694 \\
                 \\
                 16 Integration of Ordinary Differential Equations / 701
                 \\
                 16.0 Introduction / 701 \\
                 16.1 Runge--Kutta Method / 704 \\
                 16.2 Adaptive Stepsize Control for Runge--Kutta / 708
                 \\
                 16.3 Modified Midpoint Method / 716 \\
                 16.4 Richardson Extrapolation and the Bulirsch--Stoer
                 Method / 718 \\
                 16.5 Second-Order Conservative Equations / 726 \\
                 16.6 Stiff Sets of Equations / 727 \\
                 16.7 Multistep, Multivalue, and Predictor--Corrector
                 Methods / 740 \\
                 \\
                 17 Two Point Boundary Value Problems / 745 \\
                 17.0 Introduction / 745 \\
                 17.1 The Shooting Method / 749 \\
                 17.2 Shooting to a Fitting Point / 751 \\
                 17.3 Relaxation Methods / 753 \\
                 17.4 A Worked Example: Spheroidal Harmonics / 764 \\
                 17.5 Automated Allocation of Mesh Points / 774 \\
                 17.6 Handling Internal Boundary Conditions or Singular
                 Points / 775 \\
                 \\
                 18 Integral Equations and Inverse Theory / 779 \\
                 18.0 Introduction / 779 \\
                 18.1 Fredholm Equations of the Second Kind / 782 \\
                 18.2 Volterra Equations / 786 \\
                 18.3 Integral Equations with Singular Kernels / 788 \\
                 18.4 Inverse Problems and the Use of A Priori
                 Information / 795 \\
                 18.5 Linear Regularization Methods / 799 \\
                 18.6 Backus--Gilbert Method / 806 \\
                 18.7 Maximum Entropy Image Restoration / 809 \\
                 \\
                 19 Partial Differential Equations / 818 \\
                 19.0 Introduction / 818 \\
                 19.1 Flux-Conservative Initial Value Problems / 825 \\
                 19.2 Diffusive Initial Value Problems / 838 \\
                 19.3 Initial Value Problems in Multidimensions / 844
                 \\
                 19.4 Fourier and Cyclic Reduction Methods for Boundary
                 Value Problems / 848 \\
                 19.5 Relaxation Methods for Boundary Value Problems /
                 854 \\
                 19.6 Multigrid Methods for Boundary Value Problems /
                 862 \\
                 \\
                 20 Less-Numerical Algorithms / 881 \\
                 20.0 Introduction / 881 \\
                 20.1 Diagnosing Machine Parameters / 881 \\
                 20.2 Gray Codes ' / 886 \\
                 \\
                 20.3 Cyclic Redundancy and Other Checksums / 888 \\
                 20.4 Huffman Coding and Compression of Data / 896 \\
                 20.5 Arithmetic Coding / 902 \\
                 20.6 Arithmetic at Arbitrary Precision / 906 \\
                 \\
                 References / 916 \\
                 \\
                 Index of Programs and Dependencies / 920 \\
                 \\
                 General Index / 934",
}

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

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

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

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

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

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

@Book{Pryor:1966:IFR,
  author =       "William A. Pryor",
  title =        "Introduction to Free Radical Chemistry",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xvii + 110",
  year =         "1966",
  LCCN =         "QD255 .P77",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Pyle:1981:APL,
  author =       "I. C. Pyle",
  title =        "The {Ada} Programming Language",
  publisher =    pub-PHI,
  address =      pub-PHI:adr,
  pages =        "x + 293",
  year =         "1981",
  ISBN =         "0-13-003921-7",
  ISBN-13 =      "978-0-13-003921-7",
  LCCN =         "QA76.73.A35 P94",
  bibdate =      "Wed Dec 15 10:40:53 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$14.95",
  acknowledgement = ack-nhfb,
}

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

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

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

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

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

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

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

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

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

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

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

@Book{Rabinowitz:1990:PC,
  author =       "Henry Rabinowitz and Chaim Schaap",
  title =        "Portable {C}",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xi + 269",
  year =         "1990",
  ISBN =         "0-13-685967-4",
  ISBN-13 =      "978-0-13-685967-3",
  LCCN =         "QA 76.73 C15 R33 1990",
  bibdate =      "Wed Dec 15 10:41:06 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Rabinowitz:2009:MSS,
  editor =       "Harold Rabinowitz and Suzanne Vogel",
  title =        "The manual of scientific style: a guide for authors,
                 editors, and researchers",
  publisher =    "Academic Press/Elsevier",
  address =      "Amsterdam, The Netherlands",
  pages =        "xii + 968",
  year =         "2009",
  ISBN =         "0-12-373980-2",
  ISBN-13 =      "978-0-12-373980-3",
  LCCN =         "T11 .M36 2009",
  bibdate =      "Sat Jun 13 08:18:57 MDT 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0912/2009278258-d.html",
  abstract =     "Much like the \booktitle{Chicago Manual of Style},
                 \booktitle{The Manual of Scientific Style} addresses
                 all stylistic matters in the relevant disciplines of
                 physical and biological science, medicine, health, and
                 technology. It presents consistent guidelines for text,
                 data, and graphics, providing a comprehensive and
                 authoritative style manual that can be used by the
                 professional scientist, science editor, general editor,
                 science writer, and researcher.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  remark =       "Errata slip inserted.",
  subject =      "Technical writing; Handbooks, manuals, etc",
  tableofcontents = "Part I: Elements of Scientific Style \\
                 1: Elements of Science Writing \\
                 2: Preparing the Manuscript \\
                 3: Elements of Style and Usage \\
                 4: Citations and References \\
                 5: Copyright and Permissions \\
                 Part II: Style and Usage for Specific Disciplines \\
                 6: Style and Usage for Mathematics \\
                 7: Style and Usage for Physics \\
                 8: Style and Usage for Astronomy \\
                 9: Style and Usage for Chemistry \\
                 10: Style and Usage for Organic Chemistry \\
                 11: Style and Usage for Earth Science and Environmental
                 Science \\
                 12: Style and Usage for Life Science \\
                 13: Style and Usage for Medical Science \\
                 Part 3: Appendices \\
                 Appendix A: Tables and Conventions for Mathematics \\
                 Appendix B: Tables and Conventions for Physics \\
                 Appendix C: Tables and Conventions for Astronomy \\
                 Appendix D: Tables and Conventions for Chemistry \\
                 Appendix E: Tables and Conventions for Organic
                 Chemistry \\
                 Appendix F: Tables and Conventions for Earth Science
                 and Environmental Science \\
                 Appendix G: Tables and Conventions for Life Science \\
                 Appendix H: Tables and Conventions for Medical Science
                 \\
                 Appendix I: Further Reading and Resources",
}

@Book{Rago:1993:USV,
  author =       "Steven A. Rago",
  title =        "{UNIX System V} network programming",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xv + 784",
  year =         "1993",
  ISBN =         "0-201-56318-5",
  ISBN-13 =      "978-0-201-56318-4",
  LCCN =         "92-45276, QA76.76.O63 R34 1993",
  bibdate =      "Tue Sep 21 11:32:00 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  price =        "US\$45.50",
  acknowledgement = ack-nhfb,
  tableofcontents = "Part I: Background material \\
                 1: Introduction to networks \\
                 2: UNIX programming \\
                 Part 2: User-level network programming \\
                 3: STREAMS \\
                 4: The transport layer interface \\
                 5: Selecting networks and addresses \\
                 6: The network listener facility \\
                 7: Sockets \\
                 8: Remote procedure calls \\
                 Part 3: Kernel-level network programming \\
                 9: The STREAMS subsystem \\
                 10: STREAMS drivers \\
                 11: STREAMS modules \\
                 12: STREAMS multiplexors \\
                 Part 4: Design project \\
                 13: Design project: implementing SLIP \\
                 Bibliography \\
                 Index",
}

@TechReport{Rajchman:1942:REP,
  author =       "J. A. Rajchman and G. A. Morton and A. W. Vance",
  title =        "Report on Electronic Predictors for Anti-Aircraft Fire
                 Control",
  institution =  "Research Laboratories, R. C. A. Manufacturing Company,
                 Inc.",
  address =      "Camden, NJ, USA",
  month =        apr,
  year =         "1942",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Reprinted in \cite[\S 7.4]{Randell:1982:ODC}.",
  acknowledgement = ack-nhfb,
}

@Article{Ramabadran:crc-tutorial,
  author =       "Tenkasi V. Ramabadran and Sunil S. Gaitonde",
  title =        "A Tutorial on {CRC} Computations",
  journal =      j-IEEE-MICRO,
  volume =       "8",
  number =       "4",
  pages =        "62--75",
  month =        jul # "\slash " # aug,
  year =         "1988",
  DOI =          "https://doi.org/10.1109/40.7773",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Raman:1997:AUI,
  author =       "T. V. Raman",
  title =        "Auditory User Interfaces: Toward the Speaking
                 Computer",
  publisher =    pub-KLUWER,
  address =      pub-KLUWER:adr,
  pages =        "xxi + 142",
  year =         "1997",
  ISBN =         "0-7923-9984-6",
  ISBN-13 =      "978-0-7923-9984-1",
  LCCN =         "QA76.9.U83 R36 1997",
  bibdate =      "Tue Nov 18 17:06:28 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "1. Speech-Enabled Applications \\
                 2. Nuts and Bolts of Auditory Interfaces \\
                 3. The Audio Desktop \\
                 4. Concrete Implementation of an Audio Desktop \\
                 5. Speech-Enabling the WWW",
}

@Book{Ramondino:1969:NWS,
  editor =       "Salvatore Ramondino",
  title =        "The new world {Spanish--English} and
                 {English--Spanish} dictionary",
  publisher =    "Signet",
  address =      "New York, NY, USA",
  pages =        "xviii + 1226",
  year =         "1969",
  ISBN =         "0-451-15994-2",
  ISBN-13 =      "978-0-451-15994-6",
  LCCN =         "PC4640 .N4 1968",
  bibdate =      "Sat Dec 24 15:13:50 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Special section on Spanish pronunciation,
                 accentuation, punctuation and division of syllables in
                 Spanish.",
  acknowledgement = ack-nhfb,
  idnumber =     "517",
  remark =       "Cover title: El new world diccionario
                 espa{\"a}nol/ingl{\'e}s, ingl{\'e}s/espa{\"a}nol = The
                 new world Spanish/English, English/Spanish
                 dictionary.",
  subject =      "Dictionaries; English; English language; Spanish;
                 Spanish language",
}

@Article{Ramsey:spiderweb,
  author =       "Norman Ramsey",
  title =        "Weaving a Language-Independent {{\WEB}}",
  journal =      j-CACM,
  volume =       "32",
  number =       "9",
  pages =        "1051--1055",
  month =        sep,
  year =         "1989",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Rand-McNally:1991:RMR,
  author =       "{Rand McNally}",
  title =        "{Rand McNally} road atlas: {United States}, {Canada},
                 {Mexico}",
  publisher =    "Rand McNally",
  address =      "Skokie, IL, USA",
  pages =        "264",
  year =         "1991",
  ISBN =         "0-528-80500-2",
  ISBN-13 =      "978-0-528-80500-4",
  LCCN =         "G1201.P2 R35 1991",
  bibdate =      "Sat Dec 24 16:16:53 MST 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  subject =      "Roads; United States; Canada; Mexico; Maps",
}

@Book{Rand-McNally:2001:RAL,
  author =       "{Rand McNally}",
  title =        "The road atlas, large scale: {United States}",
  publisher =    "Rand McNally",
  address =      "Skokie, IL, USA",
  pages =        "264",
  year =         "2001",
  ISBN =         "0-528-84310-9",
  ISBN-13 =      "978-0-528-84310-5",
  LCCN =         "G1201.P2 R349 2001",
  bibdate =      "Sat Dec 24 16:16:53 MST 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Roads; United States; Maps",
}

@Article{Randell:1977:CGC,
  author =       "B. Randell",
  title =        "{Colossus}: Godfather of the Computer",
  journal =      j-NEW-SCIENTIST,
  volume =       "73",
  number =       "1038",
  pages =        "346--348",
  day =          "10",
  month =        feb,
  year =         "1977",
  CODEN =        "NWSCAL",
  ISSN =         "0262-4079, 0028-6664",
  bibdate =      "Wed Oct 13 11:51:16 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Reprinted in \cite[\S 7.5]{Randell:1982:ODC}.",
  acknowledgement = ack-nhfb,
}

@Book{Rankin:1989:CGS,
  author =       "John R. Rankin",
  title =        "Computer Graphics Software Construction",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xvi + 544",
  year =         "1989",
  ISBN =         "0-13-162793-7 (hardcover)",
  ISBN-13 =      "978-0-13-162793-2 (hardcover)",
  LCCN =         "T385 .R364 1988",
  bibdate =      "Wed Dec 15 10:41:09 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Rao:2001:TDC,
  editor =       "K. Ramamohan (Kamisetty Ramamohan) Rao and P. C. (Pat
                 C.) Yip",
  title =        "The Transform and Data Compression Handbook",
  publisher =    pub-CRC,
  address =      pub-CRC:adr,
  pages =        "xix + 388",
  year =         "2001",
  DOI =          "https://doi.org/10.1201/9781315220529",
  ISBN =         "0-8493-3692-9, 1-315-22052-0, 1-351-82772-3,
                 1-4200-3738-2 (e-book)",
  ISBN-13 =      "978-0-8493-3692-8, 978-1-315-22052-9,
                 978-1-351-82772-0, 978-1-4200-3738-8 (e-book)",
  LCCN =         "TK5105 .T72 2001",
  bibdate =      "Mon Jan 28 15:19:07 MST 2013",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Electrical engineering and signal processing series",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0646/00057149-d.html",
  abstract =     "\booktitle{The Transform and Data Compression
                 Handbook} serves as a handbook for a wide range of
                 researchers and engineers. The authors describe various
                 discrete transforms and their applications in different
                 disciplines. They cover techniques, such as adaptive
                 quantization and entropy coding, that result in
                 significant reduction in bit rates when applied to the
                 transform coefficients. With presentations of the ideas
                 and concepts, as well as descriptions of the
                 algorithms, the authors provide insight into the
                 applications and their limitations. Data compression is
                 an essential step towards the efficient storage and
                 transmission of information. \booktitle{The Transform
                 and Data Compression Handbook} provides information
                 regarding different discrete transforms and
                 demonstrates their power and practicality in data
                 compression.",
  acknowledgement = ack-nhfb,
  subject =      "Data transmission systems; Handbooks, manuals, etc;
                 Data compression (Telecommunication)",
  tableofcontents = "1. Karhunen--Loeve Transform \\
                 2. The Discrete Fourier Transform \\
                 3. Comparametric Transforms for Transmitting Eye Tap
                 Video with Picture Transfer Protocol (PTP) \\
                 4. Discrete Cosine and Sine Transforms \\
                 5. Lapped Transforms for Image Compression \\
                 6. Wavelet-Based Image Compression \\
                 7. Fractal-Based Image and Video Compression \\
                 8. Compression of Wavelet Transform Coefficients",
}

@Book{Raymond:2004:AUP,
  author =       "Eric Steven Raymond",
  title =        "The Art of {UNIX} Programming",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xxxii + 525",
  year =         "2004",
  ISBN =         "0-13-124085-4, 0-13-142901-9",
  ISBN-13 =      "978-0-13-124085-8, 978-0-13-142901-7",
  LCCN =         "QA76.76.O63 R395 2003",
  bibdate =      "Mon Oct 20 09:40:25 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  price =        "US\$39.99, CAN\$60.99",
  abstract =     "This book brings together for the first time the
                 philosophy, design patterns, tools, culture, and
                 traditions that make Unix home to the world's best and
                 most innovative software, and shows how these are
                 carried forward in Linux and today's open source
                 movement.",
  acknowledgement = ack-nhfb,
  annote =       "With guest contributions from Ken Arnold, Steven M.
                 Bellovin, Stuart Feldman, Jim Gettys, Steve Johnson,
                 Brian Kernighan, David Korn, Mike Lesk, Doug McIlroy,
                 Marshall Kirk McKusick, Keith Packard, Henry Spencer,
                 and Ken Thompson.",
  tableofcontents = "I. Context \\
                 1. Philosophy: Philosophy Matters \\
                 2. History: A Tale of Two Cultures \\
                 3. Contrasts: Comparing the Unix Philosophy with Others
                 \\
                 II. Design \\
                 4. Modularity: Keeping It Clean, Keeping It Simple \\
                 5. Textuality: Good Protocols Make Good Practice \\
                 6. Transparency: Let There Be Light \\
                 7. Multiprogramming: Separating Processes to Separate
                 Function \\
                 8. Minilanguages: Finding a Notation That Sings \\
                 9. Generation: Pushing the Specification Level Upwards
                 \\
                 10. Configuration: Starting on the Right Foot \\
                 11. Interfaces: User-Interface Design Patterns in the
                 Unix Environment \\
                 12. Optimization \\
                 13. Complexity: As Simple As Possible, but No Simpler
                 \\
                 III. Implementation \\
                 14. Languages: To C or Not To C? \\
                 15. Tools: The Tactics of Development \\
                 16. Reuse: On Not Reinventing the Wheel \\
                 IV. Community \\
                 17. Portability: Software Portability and Keeping Up
                 Standards \\
                 18. Documentation: Explaining Your Code to a
                 Web-Centric World \\
                 19. Open Source: Programming in the New Unix Community
                 \\
                 20. Futures: Dangers and Opportunities \\
                 D. Rootless Root: The Unix Koans of Master Foo",
}

@Book{Rayna:1987:RSA,
  author =       "Gerhard Rayna",
  title =        "{REDUCE}: Software for Algebraic Computation",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "ix + 329",
  year =         "1987",
  ISBN =         "0-387-96598-X (New York), 3-540-96598-X (Berlin)",
  ISBN-13 =      "978-0-387-96598-7 (New York), 978-3-540-96598-5
                 (Berlin)",
  LCCN =         "QA155.7.E4 R39 1987",
  bibdate =      "Wed Dec 15 10:41:10 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Redfern:1993:MH,
  author =       "Darren Redfern",
  title =        "The {Maple} Handbook",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "497",
  year =         "1993",
  ISBN =         "0-387-94054-5 (New York), 3-540-94054-5 (Berlin)",
  ISBN-13 =      "978-0-387-94054-0 (New York), 978-3-540-94054-8
                 (Berlin)",
  LCCN =         "QA76.95 .R43 1993",
  bibdate =      "Fri Apr 1 17:21:27 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/maple-extract.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "FF 181,00",
  acknowledgement = ack-nhfb,
  tableofcontents = "Introduction / 1 \\
                 Getting Started with Maple / 9 \\
                 Calculus / 33 \\
                 Linear Algebra / 67 \\
                 Solving Equations / 109 \\
                 Polynomials and Common Transformations / 141 \\
                 Geometry / 183 \\
                 Combinatorics and Graph Theory / 225 \\
                 Number Theory / 257 \\
                 Standard Functions and Constants / 293 \\
                 Expression Manipulation / 323 \\
                 Plotting / 343 \\
                 Programming and System Commands / 371 \\
                 Miscellaneous / 417 \\
                 Index / 481",
}

@Book{Redfern:1996:MH,
  author =       "Darren Redfern",
  title =        "The {Maple} Handbook: {Maple V} Release 4",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "495",
  year =         "1996",
  ISBN =         "0-387-94538-5, 0-387-94622-5",
  ISBN-13 =      "978-0-387-94538-5, 978-0-387-94622-1",
  LCCN =         "QA76.95.R43 1996",
  MRclass =      "68W30, 68-00, 68N15, 68NXX",
  bibdate =      "Sat Mar 09 09:15:22 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/maple-extract.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$29.00",
  abstract =     "\booktitle{The Maple Handbook} is an essential
                 reference tool for all users of the Maple system. It
                 provides a complete listing of every command in the
                 Maple language, categorized into logical categories
                 (e.g., calculus, algebra, programming, etc.) and
                 explained in the context of those categories. If a
                 Maple command has different purposes in different
                 categories, it is included more than once as
                 appropriate. A short introductory tutorial starts the
                 \booktitle{Handbook}, and each category begins with a
                 brief introduction to the related subject area. The
                 \booktitle{Handbook} is well referenced, with an
                 alphabetical index of commands, and pointers to
                 appropriate sections of the official Maple
                 documentation (Springer-Verlag). This new approach to
                 reference materials for Maple enhances the material
                 found in Maple's on-line help files and provides a much
                 more organized, intuitive resource for all users of the
                 Maple system. The \booktitle{Handbook} improves the
                 efficiency of Maple users by supplying them with the
                 information they need --- at their fingertips. This new
                 edition covers the Maple V Release 4 symbolic
                 computation language.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Getting Started with Maple \\
                 Calculus \\
                 Linear Algebra \\
                 Solving Equations \\
                 Polynomials and Common Transforms \\
                 Geometry \\
                 Combinatorics and Graph Theory \\
                 Number Theory \\
                 Statistics \\
                 Standard Functions and Constants \\
                 Expression Manipulation \\
                 Plotting \\
                 Programming and System Commands \\
                 Miscellaneous",
}

@Book{Reed:2009:NEP,
  author =       "Thomas C. Reed and Danny B. Stillman",
  title =        "The Nuclear Express: a Political History of the Bomb
                 and Its Proliferation",
  publisher =    "Zenith Press",
  address =      "Minneapolis, MN",
  pages =        "viii + 392",
  year =         "2009",
  ISBN =         "0-7603-3502-8",
  ISBN-13 =      "978-0-7603-3502-4",
  LCCN =         "U264 .R44 2009",
  bibdate =      "Tue Dec 9 08:50:38 MST 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "nuclear weapons; history",
  tableofcontents = "Big news: fission releases neutrons! \\
                 Los Alamos: a first, but not the last \\
                 The raids on Japan \\
                 The U.S.S.R. and the United Kingdom: unintended
                 partners \\
                 First attempts at controls \\
                 France and Israel: the apprentices \\
                 China breaks the European cartel \\
                 Nuclear maturity comes to the little three \\
                 Struggling with the barn door \\
                 Changes of state in the Mideast and South Asia \\
                 South Africa \\
                 The Soviet Union \\
                 The once-nuclear Soviet republics \\
                 China's decade of nuclear transparency \\
                 The Fakirs: India, Pakistan, and North Korea \\
                 Fingerprints \\
                 Star and crescent rising \\
                 George's-Antoine Kurtz is alive and well \\
                 Why?",
}

@Book{Reed:2014:HSM,
  author =       "Bruce Cameron Reed",
  title =        "The history and science of the {Manhattan Project}",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xvi + 451",
  year =         "2014",
  DOI =          "https://doi.org/10.1007/978-3-642-40297-5",
  ISBN =         "3-642-40296-8 (hardcover), 3-642-40297-6 (e-book)",
  ISBN-13 =      "978-3-642-40296-8 (hardcover), 978-3-642-40297-5
                 (e-book)",
  ISSN =         "2192-4791",
  LCCN =         "QC702.7.H42; QC770-798; QC773.A1;
                 QC793.5.H32-793.5.H329",
  bibdate =      "Sat Mar 14 11:28:07 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",
  series =       "Undergraduate Lecture Notes in Physics",
  abstract =     "The development of atomic bombs under the auspices of
                 the U. S. Army's Manhattan Project during World War II
                 is considered to be the outstanding news story of the
                 twentieth century. In this book, a physicist and expert
                 on the history of the Project presents a comprehensive
                 overview of this momentous achievement. The first three
                 chapters cover the history of nuclear physics from the
                 discovery of radioactivity to the discovery of fission,
                 and would be ideal for instructors of a sophomore-level
                 Modern Physics course. Student-level exercises at the
                 ends of the chapters are accompanied by answers.
                 Chapter 7 covers the physics of first-generation
                 fission weapons at a similar level, again accompanied
                 by exercises and answers. For the interested layman and
                 for non-science students and instructors, the book
                 includes extensive qualitative material on the history,
                 organization, implementation, and results of the
                 Manhattan Project and the Hiroshima and Nagasaki
                 bombing missions. The reader also learns about the
                 legacy of the Project as reflected in the current world
                 stockpiles of nuclear weapons.",
  acknowledgement = ack-nhfb,
  subject =      "Physique nucl{\'e}aire; Histoire; Armes
                 nucl{\'e}aires; {\'E}tats-Unis",
  tableofcontents = "Introduction and Overview \\
                 A Short History of Nuclear Physics to the Mid-1930s \\
                 The Discovery and Interpretation of Nuclear Fission \\
                 Organizing the Manhattan Project, 1939--1943 \\
                 Oak Ridge, CP-1, and the Clinton Engineer Works \\
                 The Hanford Engineer Works \\
                 Los Alamos, Trinity, and Tinian \\
                 Hiroshima and Nagasaki \\
                 The Legacy of Manhattan \\
                 Glossary",
}

@Book{Reed:2014:PMP,
  author =       "Bruce Cameron Reed",
  title =        "The physics of the {Manhattan Project}",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Third",
  pages =        "xvii + 222",
  year =         "2014",
  DOI =          "https://doi.org/10.1007/978-3-662-43533-5",
  ISBN =         "3-662-43532-2 (hardcover), 3-662-43533-0 (e-book)",
  ISBN-13 =      "978-3-662-43532-8 (hardcover), 978-3-662-43533-5
                 (e-book)",
  LCCN =         "QC790 .R44 2015",
  bibdate =      "Sat Mar 14 11:20:07 MDT 2015",
  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;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "The development of nuclear weapons during the
                 Manhattan Project is one of the most significant
                 scientific events of the twentieth century. This
                 revised and updated 3rd edition explores the challenges
                 that faced the scientists and engineers of the
                 Manhattan Project. It gives a clear introduction to
                 fission weapons at the level of an upper-year
                 undergraduate physics student by examining the details
                 of nuclear reactions, their energy release, analytic
                 and numerical models of the fission process, how
                 critical masses can be estimated, how fissile materials
                 are produced, and what factors complicate bomb design.
                 An extensive list of references and a number of
                 exercises for self-study are included. Links are given
                 to several freely-available spreadsheets which users
                 can use to run many of the calculations for
                 themselves.",
  acknowledgement = ack-nhfb,
  subject =      "Atomenergi; Atomfysik; Kerneenergi; Atombomber;
                 Fissionsteknik; Atomv{\aa}ben; Naturvidenskab",
  tableofcontents = "1 Energy Release in Nuclear Reactions, Neutrons,
                 Fission, and Characteristics of Fission / 1 \\
                 1.1 Notational Conventions for Mass Excess and
                 $Q$-Values / 1 \\
                 1.2 Rutherford and the Energy Release in Radium Decay /
                 3 \\
                 1.3 Rutherford's First Artificial Nuclear Transmutation
                 / 5 \\
                 1.4 Discovery of the Neutron / 6 \\
                 1.5 Artificially-Induced Radioactivity and the Path to
                 Fission / 14 \\
                 1.6 Energy Release in Fission / 19 \\
                 1.7 The Bohr--Wheeler Theory of Fission: The $Z^2 / A$
                 Limit Against Spontaneous Fission / 20 \\
                 1.8 Energy Spectrum of Fission Neutrons / 26 \\
                 1.9 Leaping the Fission Barrier / 29 \\
                 1.10 A Semi-Empirical Look at the Fission Barrier / 34
                 \\
                 1.11 A Numerical Model of the Fission Process / 38 \\
                 1.11.1 Volume and Surface Areas; Volume Conservation /
                 40 \\
                 1.11.2 Surface and Coulomb Energies / 43 \\
                 1.11.3 Results / 45 \\
                 References / 47 \\
                 2 Critical Mass and Efficiency / 49 \\
                 2.1 Neutron Mean Free Path / 50 \\
                 2.2 Critical Mass: Diffusion Theory / 55 \\
                 2.3 Effect of Tamper / 63 \\
                 2.4 Estimating Bomb Efficiency: Analytic / 69 \\
                 2.5 Estimating Bomb Efficiency: Numerical / 81 \\
                 2.5.1 A Simulation of the Hiroshima Little Boy Bomb /
                 83 \\
                 2.6 Another Look at Untamped Criticality: Just One
                 Number / 86 \\
                 2.7 Critical Mass of a Cylindrical Core (Optional) / 89
                 \\
                 References / 96 \\
                 3 Producing Fissile Material / 97 \\
                 3.1 Reactor Criticality / 97 \\
                 3.2 Neutron Thermalization / 101 \\
                 3.3 Plutonium Production / 104 \\
                 3.4 Electromagnetic Separation of Isotopes / 107 \\
                 3.5 Gaseous (Barrier) Diffusion / 113 \\
                 References / 119 \\
                 4 Complicating Factors / 121 \\
                 4.1 Boron Contamination in Graphite / 121 \\
                 4.2 Spontaneous Fission of $^{240}$Pu, Predetonation,
                 and Implosion / 124 \\
                 4.2.1 Little Boy Predetonation Probability / 128 \\
                 4.2.2 Fat Man Predetonation Probability / 129 \\
                 4.3 Predetonation Yield / 132 \\
                 4.4 Tolerable Limits for Light-Element Impurities / 139
                 \\
                 References / 143 \\
                 5 Miscellaneous Calculations / 145 \\
                 5.1 How Warm Is It? / 145 \\
                 5.2 Brightness of the Trinity Explosion / 146 \\
                 5.3 A Model for Trace Isotope Production in a Reactor /
                 151 \\
                 References / 156 \\
                 6 Appendices / 157 \\
                 6.1 Appendix A: Selected $A$-Values and Fission
                 Barriers / 157 \\
                 6.2 Appendix B: Densities, Cross-Sections, Secondary
                 Neutron Numbers, and Spontaneous-Fission Half-Lives /
                 158 \\
                 6.2.1 Thermal Neutrons (0.0253 eV) / 158 \\
                 6.2.2 Fast Neutrons (2 MeV) / 158 \\
                 6.3 Appendix C: Energy and Momentum Conservation in a
                 Two-Body Collision / 159 \\
                 6.4 Appendix D: Energy and Momentum Conservation in a
                 Two-Body Collision That Produces a Gamma-Ray / 162 \\
                 6.5 Appendix E: Formal Derivation of the Bohr--Wheeler
                 Spontaneous Fission Limit / 164 \\
                 6.5.1 Introduction / 164 \\
                 6.5.2 Nuclear Surface Profile and Volume / 165 \\
                 6.5.3 The Area Integral / 170 \\
                 6.5.4 The Coulomb Integral and the SF Limit / 171 \\
                 6.6 Appendix F: Average Neutron Escape Probability from
                 Within a Sphere / 179 \\
                 6.7 Appendix G: The Neutron Diffusion Equation / 184
                 \\
                 6.8 Appendix H: Exercises and Answers / 192 \\
                 6.9 Appendix I: Glossary of Symbols / 203 \\
                 6.10 Appendix J: Further Reading / 209 \\
                 6.10.1 General Works / 209 \\
                 6.10.2 Biographical and Autobiographical Works / 211
                 \\
                 6.10.3 Technical Works / 213 \\
                 6.10.4 Websites / 215 \\
                 6.11 Appendix K: Useful Constants and Rest Masses / 217
                 \\
                 References / 217 \\
                 Index / 219",
}

@Book{Reed:2020:MPS,
  author =       "Bruce Cameron Reed",
  title =        "{Manhattan Project}: The Story of the Century",
  publisher =    "Springer International Publishing",
  address =      "Cham, Switzerland",
  pages =        "xiv + 553",
  year =         "2020",
  DOI =          "https://doi.org/10.1007/978-3-030-45734-1",
  ISBN =         "3-030-45733-8 (hardcover), 3-030-45734-6 (e-book)",
  ISBN-13 =      "978-3-030-45733-4 (hardcover), 978-3-030-45734-1
                 (e-book)",
  LCCN =         "QC773.3.U5 R4436 2020",
  bibdate =      "Fri Jan 14 07:28:55 MST 2022",
  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://www.springerlink.com/content/978-3-030-45734-1",
  abstract =     "The Manhattan Project, the United States Army's
                 program to develop and deploy nuclear weapons in World
                 War II, was a pivotal event in human history. While
                 thousands of articles and books have been published on
                 various aspects of the Project, this is the first
                 comprehensive single-volume history prepared by a
                 specialist for curious readers without a scientific
                 background. The author presents a wide-ranging survey
                 that not only tells the story of how the project was
                 organized and carried out, but also introduces the
                 leading personalities involved and gives qualitative
                 but accurate descriptions of the underlying science and
                 the engineering challenges. The technical points are
                 illustrated by reader-friendly graphics.",
  acknowledgement = ack-nhfb,
  subject =      "Nuclear physics; Physics; Nuclear chemistry; ionen;
                 stralingschemie; fysica; atoomfysica",
  tableofcontents = "Prologue / vii--x \\
                 Contents / xi--xiv \\
                 The big picture: a survey of the Manhattan Project /
                 1--13 \\
                 From atoms to nuclei: an inward journey / 15--52 \\
                 Fission / 53--90 \\
                 Organizing: coordinating government and army support
                 1939--1943 / 91--147 \\
                 Piles and secret cities / 149--169 \\
                 U, Pu, CEW and HEW: securing fissile material /
                 171--226 \\
                 Los Alamos, {\em Trinity\/} and Tinian / \\
                 The German nuclear program: the Third Reich and atomic
                 energy / 321--359 \\
                 Hiroshima and Nagasaki / 361--425 \\
                 Epilogue / 427--435 \\
                 Brief biographies / 437--447 \\
                 Chronology / 449--460 \\
                 Sources / 461--495 \\
                 Glossary / 497--505 \\
                 Bibliography / 507--525 \\
                 Index / 527--553",
}

@Book{Rees:2000:JSN,
  author =       "Martin J. Rees",
  title =        "Just six numbers: the deep forces that shape the
                 universe",
  publisher =    pub-BASIC-BOOKS,
  address =      pub-BASIC-BOOKS:adr,
  pages =        "xi + 195",
  year =         "2000",
  ISBN =         "0-465-03673-2",
  ISBN-13 =      "978-0-465-03673-8",
  LCCN =         "QB 981 R434 2000",
  bibdate =      "Wed Oct 8 15:29:26 MDT 2008",
  bibsource =    "es33.uits.indiana.edu:2200/unicorn;
                 https://www.math.utah.edu/pub/bibnet/authors/f/fermi-enrico.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  remark =       "First published in 1999 in Great Britain by Weidenfeld
                 and Nicholson.",
  subject =      "cosmology; big bang theory",
  tableofcontents = "The cosmos and the microworld \\
                 Our cosmic habitat I: planets, stars and life \\
                 The large number $N$: gravity in the cosmos \\
                 Stars, the periodic table, and $E$ \\
                 Our cosmic habitat II: beyond our galaxy \\
                 The fine-tuned expansion: dark matter and [omega] \\
                 The number $\Lambda$: is cosmic expansion slowing or
                 speeding? \\
                 Primordial `ripples': the number $Q$ \\
                 Our cosmic habitat III: what lies beyond our horizon?
                 \\
                 Three dimensions (and more) \\
                 Coincidence, providence, or multiverse?",
}

@Book{Rees:2018:FPH,
  author =       "Martin Rees",
  title =        "On the Future Prospects for Humanity",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "viii + 256",
  year =         "2018",
  ISBN =         "0-691-17944-1",
  ISBN-13 =      "978-0-691-17944-5",
  LCCN =         "????",
  bibdate =      "Sat Dec 22 15:38:23 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "Preface / Vii \\
                 Introduction / 1 \\
                 1 Deep in the Anthropocene / 11 \\
                 2 Humanity's Future on Earth / 61 \\
                 3 Humanity in a Cosmic Perspective / 120 \\
                 4 The Limits and Future of Science / 165 \\
                 5 Conclusions / 201 \\
                 Notes / 229 \\
                 Index / 237",
  tableofcontents = "Preface / vii \\
                 Introduction / 1 (10) \\
                 1 Deep In The Anthropocene / 11 (50) \\
                 1.1 Perils and Prospects / 11 (6) \\
                 1.2 Nuclear Threats / 17 (4) \\
                 1.3 Eco-Threats and Tipping Points / 21 (10) \\
                 1.4 Staying within Planetary Boundaries / 31 (6) \\
                 1.5 Climate Change / 37 (7) \\
                 1.6 Clean Energy --- and a `Plan B'? / 44 (17) \\
                 2 Humanity's Future On Earth / 61 (59) \\
                 2.1 Biotech / 61 (22) \\
                 2.2 Cybertechnology, Robotics, and AI / 83 (7) \\
                 2.3 What about Our Jobs? / 90 (12) \\
                 2.4 Human-Level Intelligence? / 102 (6) \\
                 2.5 Truly Existential Risks? / 108 (12) \\
                 3 Humanity In A Cosmic Perspective / 120 (45) \\
                 3.1 The Earth in a Cosmic Context / 120 (9) \\
                 3.2 Beyond Our Solar System / 129 (8) \\
                 3.3 Spaceflight --- Manned and Unmanned / 137 (13) \\
                 3.4 Towards a Post-Human Era? / 150 (4) \\
                 3.5 Alien Intelligence? / 154 (11) \\
                 4 The Limits And Future Of Science / 165 (36) \\
                 4.1 From the Simple to the Complex / 165 (5) \\
                 4.2 Making Sense of Our Complex World / 170 (7) \\
                 4.3 How Far Does Physical Reality Extend? / 177 (12)
                 \\
                 4.4 Will Science `Hit the Buffers'? / 189 (5) \\
                 4.5 What about God? / 194 (7) \\
                 5 Conclusions / 201 (28) \\
                 5.1 Doing Science / 201 (12) \\
                 5.2 Science in Society / 213 (8) \\
                 5.3 Shared Hopes and Fears / 221 (8) \\
                 Notes / 229 (8) \\
                 Index / 237",
}

@Book{Reeves:2008:FNF,
  author =       "Richard Reeves",
  title =        "A Force of Nature: the Frontier Genius of {Ernest
                 Rutherford}",
  publisher =    pub-NORTON,
  address =      pub-NORTON:adr,
  pages =        "207",
  year =         "2008",
  ISBN =         "0-393-05750-X (hardcover), 0-393-33369-8 (paperback)",
  ISBN-13 =      "978-0-393-05750-8 (hardcover), 978-0-393-33369-5
                 (paperback)",
  LCCN =         "QC16.R8 R44 2008",
  bibdate =      "Sun Dec 27 07:59:40 MST 2015",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/r/rutherford-ernest.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Great discoveries",
  abstract =     "Born in colonial New Zealand, fifteen mountain miles
                 away from the nearest town, Ernest Rutherford grew up
                 on the frontier --- a different world from Cambridge,
                 to which he won a scholarship at the age of
                 twenty-four. His work overseas revolutionized modern
                 physics. Among his discoveries were the orbital
                 structure of the atom and the concept of the
                 half-life`` of radioactive materials, which led to a
                 massive reevaluation of the age of the Earth,
                 previously judged to be just 100 million years old.
                 Rutherford and the young men working under him were the
                 first to split the atom, unlocking tremendous forces
                 --- forces, as Rutherford himself predicted, that would
                 bring us the atomic bomb.'' ``Rutherford, awarded a
                 Nobel Prize and made Baron Rutherford by the Queen, was
                 also a great humanist and teacher, coming to the aid of
                 colleagues caught in the Nazi and Soviet regimes. Under
                 his rigorous and boisterous direction, a new generation
                 of remarkable physicists emerged from the famous
                 Cavendish Laboratory. In Richard Reeves's hands,
                 Rutherford comes alive, a ruddy, genial man and a
                 pivotal figure in scientific history.",
  acknowledgement = ack-nhfb,
  author-dates = "1936--",
  remark-01 =    "From page 66: ``\ldots{} often Rutherford said to his
                 researchers: `Don't let me catch anyone talking about
                 the Universe in my department.'\,''",
  remark-02 =    "From page 67: ``The cost to produce a gram [of radium]
                 --- this was 1907 --- was estimated at more than a
                 hundred thousand dollars, which would make a pound [of
                 radium] work 450 million dollars.''",
  remark-03 =    "Reeves mentions a Rutherford paper in the London
                 Scientific Weekly on 4 November 1907, but I can find no
                 record of that journal in major library catalogs or in
                 Web searches. Did Reeves mean \booktitle{Nature}? The
                 only entry above from that journal near that date is
                 Rutherford:1907:ORb, on the origin of radium.",
  remark-04 =    "From page 73: ``[Rutherford's] 7680-pound Nobel
                 [Prize] award.''. That amount was about 15 times his
                 annual salary at McGill.",
  remark-05 =    "From page 99: ``In three reports [to the [British]
                 Admiralty], he [Rutherford] drew up the `map' of
                 underwater warfare which has remained unchanged to the
                 present day. What Rutherford said about
                 submarine-hunting in 1915 remains true in the
                 1980s.''",
  remark-06 =    "From page 101: ``Papers and testimonials of the period
                 [1914--1918] credit Rutherford as the inventor of ASDIC
                 [Anti-Submarine Detection Investigation Committee],
                 which he demonstrated on a seven-week trip to the
                 United States after the Americans entered the war in
                 1917.'' Earlier on that page, Reeves states that the
                 Americans renamed ASDIC `sonar' [sound navigation and
                 ranging] in World War II. The claim of Rutherford's
                 role in the invention of sonar appears to be
                 controversial: see \cite{Katzir:2012:WKP}.",
  remark-07 =    "From page 106: ``At forty-nine, he [Rutherford in
                 Manchester] was already the highest-paid professor in
                 England.'' Cambridge matched that salary, and made him
                 a Fellow of Trinity College.",
  remark-08 =    "From page 112: ``Only years after Rutherford's death,
                 in fact, did Chadwick, who had been in charge of the
                 budget (and budget problems) at Cavendish, learn that
                 the family that owned the Orient Steam Navigation
                 Company had offered to supply Rutherford with any funds
                 he needed, if he asked. But he never did.'' [Rutherford
                 was notoriously parsimonious in handling research
                 funds, and seldom sought outside support for such
                 monies.]",
  remark-09 =    "From page 118: ``One of his [Rutherford's]
                 achievements was restocking the university libraries of
                 Belgium, which had been destroyed in the war [WW I].
                 Another was working out a scheme to reopen and
                 refinance the Vienna Institute, officially still an
                 `enemy institution', by persuading the British Royal
                 Academy to pay the Austrians for the radium supplied to
                 British laboratories before the war.'' [Unlike many
                 others, Rutherford did not wish to sever contacts with
                 German friends and colleagues after the war's end on 11
                 November 1918.]",
  remark-10 =    "Page 119 comments on the toll of public
                 responsibilities on Rutherford's research: ``In 1925,
                 the year he was elected to a five-year term as
                 president of the Royal Society, Rutherford agreed to
                 twenty separate appearances around England --- and
                 turned down sixty more. He produced only one paper
                 longer than a page that year. He wrote none in 1926,
                 and none in 1928.''",
  remark-11 =    "From page 153: ``In those years [World War I], [Hans]
                 Geiger named his third son Ernest after `The Prof'
                 [Rutherford].'' [Geiger served in the German military
                 in that war, but remained friendly with Rutherford.]",
  remark-12 =    "From page 157: ``There was, however, one German
                 scientist whom Rutherford would not personally help, or
                 even meet: Fritz Haber. \ldots{} He did not wish to
                 have any contact with the man who invented chemical
                 warfare with the help of poison gas.''",
  remark-13 =    "From page 169: ``Lord Rutherford's total estate, it
                 turned out, was almost exactly seven thousand pounds
                 sterling, a bit less than the amount he had received
                 for winning the Nobel Prize in 1908. He had never
                 applied for a patent for any of his discoveries.'' A
                 footnote on that page reports that the
                 Rutherford--Bragg patent was applied for by the
                 Admiralty, and at Rutherford's request, was voided
                 after the war [WW I].",
  remark-14 =    "From page 175: ``Hans Geiger (who was almost certainly
                 a proud Nazi, a member of the National Socialist
                 Party), \ldots{}",
  subject =      "Rutherford, Ernest; Physicists; England; Biography;
                 New Zealand; Science; History; 20th century; Nuclear
                 fission; Radioactivity Physicists; Science",
  subject-dates = "Ernest Rutherford (1871--1937)",
}

@Book{Reich:2009:PFH,
  author =       "Eugenie Samuel Reich",
  title =        "Plastic Fantastic: How the Biggest Fraud in Physics
                 Shook the Scientific World",
  publisher =    "Palgrave Macmillan",
  address =      "New York, NY, USA",
  pages =        "266",
  year =         "2009",
  ISBN =         "0-230-22467-9",
  ISBN-13 =      "978-0-230-22467-4",
  LCCN =         "QC16.S26456 R45 2009",
  bibdate =      "Mon Aug 10 17:28:09 MDT 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 melvyl.cdlib.org:210/CDL90",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0903/2008051801-b.html;
                 http://www.loc.gov/catdir/enhancements/fy0903/2008051801-d.html",
  abstract =     "This work presents an investigation of a scientific
                 discovery that was revealed to be fraudulent by a
                 journalist with a unique insight into the case. Schon's
                 discovery of a plastic that worked as a superconductor
                 was noted as a scientific triumph before revelations
                 that his discoveries were fake.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  remark =       "This book tells the story of cooked books in research
                 at AT\&T Bell Laboratories.",
  subject =      "Sch{\"o}n, Jan Hendrik; physicists; Germany;
                 biography; fraud in science",
  subject-dates = "1970--",
  tableofcontents = "Into the woods \\
                 Hendrik \\
                 A slave to publication \\
                 Greater expectations \\
                 Not ready to be a product \\
                 Journals with ``special status'' \\
                 Scientists astray \\
                 Plastic fantastic \\
                 The Nanotechnology Department \\
                 The fraud taboo \\
                 Game over",
}

@Book{Reid:1988:PLP,
  author =       "Glenn C. Reid",
  title =        "{PostScript} Language Program Design",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xii + 224",
  year =         "1988",
  ISBN =         "0-201-14396-8",
  ISBN-13 =      "978-0-201-14396-6",
  LCCN =         "QA76.73.P67 R45 1988",
  bibdate =      "Sat Aug 27 10:53:25 1994n",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/postscri.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib;
                 https://www.math.utah.edu/pub/tex/bib/texgraph.bib",
  price =        "US\$22.95",
  URL =          "http://www.rightbrain.com/rightbrain.shtml",
  acknowledgement = ack-nhfb,
  keywords =     "PostScript (computer program language)",
  tableofcontents = "Preface / ix \\
                 The PostScript Language: Overview / 1 \\
                 Introduction / 1 \\
                 The Language Model / 2 \\
                 Dictionaries and Data Structures / 4 \\
                 Stacks / 4 \\
                 Built-In PostScript Language Operators / 5 \\
                 The Imaging Model / 5 \\
                 Coordinate Systems / 6 \\
                 Paths and Paint / 7 \\
                 Fonts / 7 \\
                 Electronic Publishing and Printing / 7 \\
                 Program Design Guidelines / 9 \\
                 The Execution Model / 11 \\
                 Introduction / 11 \\
                 The Printing Job Model / 11 \\
                 The Operand Stack / 13 \\
                 Objects in the PostScript Language / 13 \\
                 The Stack as a Data Structure / 15 \\
                 The Dictionary Stack / 16 \\
                 Dictionary Objects / 17 \\
                 Using the Dictionary Stack / 18 \\
                 Operators and Name Lookup / 19 \\
                 The Bind Operator / 21 \\
                 The Interpreter and the Scanner / 23 \\
                 Recognition of Objects / 24 \\
                 Procedures / 25 \\
                 Very Large Procedure Bodies / 29 \\
                 The Execution Stack / 32 \\
                 The Server Loop / 34 \\
                 The Imaging Model / 37 \\
                 Introduction / 37 \\
                 Applying the Metaphor / 38 \\
                 Construction of Paths / 40 \\
                 The Graphics State and Paths / 40 \\
                 Painting Operations / 42 \\
                 What Happens to the Current Path? / 43 \\
                 Procedures for Constructing Paths / 44 \\
                 Rectangles / 44 \\
                 Circles and Arcs / 46 \\
                 Arrowheads / 46 \\
                 Text Operations / 49 \\
                 Character Widths / 51 \\
                 Clipping / 53 \\
                 Complexity and Performance / 53 \\
                 Rasterization / 54 \\
                 Save and Restore / 54 \\
                 The Font Cache / 55 \\
                 Emulators and Translators / 57 \\
                 Introduction / 57 \\
                 Emulating Another Printer / 58 \\
                 The stringwidth Operator / 61 \\
                 Text Justification in an Emulator / 62 \\
                 Translating Existing File Formats / 68 \\
                 Units / 68 \\
                 Fonts / 69 \\
                 Font Differences / 69 \\
                 Using the Imaging Model / 71 \\
                 Preserving High-Level Information / 72 \\
                 Rendering / 72 \\
                 Optimizing Translator Output / 72 \\
                 Computation and Decision-Making / 73 \\
                 Designing the Page and the Program / 77 \\
                 Introduction / 77 \\
                 Page Layout Considerations / 77 \\
                 Page Nesting and Independence / 78 \\
                 Producing PostScript Language Output / 79 \\
                 Round-Off and Coordinate Systems / 80 \\
                 Efficiency / 81 \\
                 Data Transmission Overhead / 82 \\
                 Computation / 83 \\
                 Interpretation Time / 85 \\
                 Program Structure / 87 \\
                 Introduction / 87 \\
                 The Prologue and Script Model / 87 \\
                 Modularity and Page Structure / 89 \\
                 Ground State / 90 \\
                 The Operand Stack / 92 \\
                 Functional and Graphic Independence / 92 \\
                 Save and Restore / 93 \\
                 Page Elements and Their Properties / 94 \\
                 Document Structuring Conventions / 96 \\
                 The Mechanics of Setting Text / 99 \\
                 Introduction / 99 \\
                 Character Widths / 100 \\
                 Margins and Justification / 102 \\
                 Justification / 104 \\
                 Handling Different Fonts / 106 \\
                 Leading and Point Size / 108 \\
                 Kerning and Ligatures / 109 \\
                 Encoding and Character Sets / 114 \\
                 Composite Characters and Accents / 117 \\
                 Non-Roman Fonts / 117 \\
                 Character Widths and Origins / 118 \\
                 Scanned Images and Halftones / 123 \\
                 Introduction / 123 \\
                 The Image Operator / 123 \\
                 How It Works / 124 \\
                 The Image Matrix / 124 \\
                 Data Acquisition Procedures / 126 \\
                 Small Amounts of Data / 127 \\
                 Large Amounts of Data / 127 \\
                 A Common Error and Its Cause / 129 \\
                 Synthetic Data / 129 \\
                 Data Compression / 131 \\
                 Halftone Screens / 131 \\
                 Halftoning in the PostScript Language / 132 \\
                 Changing the Halftone Screen / 132 \\
                 The Spot Function / 134 \\
                 Complex Graphic Problem-Solving / 137 \\
                 Introduction / 137 \\
                 Pattern Fills / 137 \\
                 Logos, Grids, Forms, and Special Fonts / 143 \\
                 Grids / 146 \\
                 Transformation Matrices / 149 \\
                 Inverted Coordinate Systems / 151 \\
                 Color and Color Separations / 151 \\
                 Color Separations / 152 \\
                 Spot Color / 154 \\
                 File Interchange Standards / 157 \\
                 Introduction / 157 \\
                 Conforming Documents / 157 \\
                 Handling Printer-Specific Features / 158 \\
                 Specifying Paper Sizes / 159 \\
                 Printer Queries / 162 \\
                 Conditional Execution / 163 \\
                 Font Availability / 164 \\
                 Putting it All Together / 165 \\
                 Merging Files from Different Sources / 167 \\
                 Introduction / 167 \\
                 Using Existing Context / 168 \\
                 Error Recovery / 169 \\
                 Handling showpage / 170 \\
                 Screen Representations / 171 \\
                 Writing a Print Spooler / 173 \\
                 Introduction / 173 \\
                 Printer Management / 174 \\
                 Communications / 174 \\
                 Messages / 175 \\
                 Using exitserver / 176 \\
                 Managing Files and Fonts / 178 \\
                 DocumentFonts / 178 \\
                 IncludeFont / 179 \\
                 BeginFont, EndFont / 180 \\
                 Determining What Fonts Are Available / 181 \\
                 Handling Resource Shortages / 182 \\
                 Printer Description Files / 183 \\
                 Memory and File Resource Management / 185 \\
                 Memory Structure / 185 \\
                 Memory Allocation / 186 \\
                 Save and Restore / 187 \\
                 Save Objects / 187 \\
                 The invalidrestore Error / 188 \\
                 Downloadable Font Programs / 190 \\
                 Packed Arrays / 190 \\
                 Raster Memory / 191 \\
                 File Systems and Disk Management / 192 \\
                 PostScript Language File Operations / 192 \\
                 The Standard Input Stream / 193 \\
                 Error Handling / 197 \\
                 Introduction / 197 \\
                 Strategies / 197 \\
                 Non-Standard Operators / 197 \\
                 Implementation Limits Exceeded / 198 \\
                 The Stopped Operator / 199 \\
                 The Error Handling Mechanism / 203 \\
                 Redefining Error Procedures / 204 \\
                 Handling Error Messages / 206 \\
                 Debugging Techniques / 207 \\
                 Introduction / 207 \\
                 Establishing Two-Way Communication / 207 \\
                 Serial Communications / 208 \\
                 Parallel Communications / 209 \\
                 Packet Network Communications / 209 \\
                 Understanding PostScript Language Errors / 209 \\
                 Error: undefined / 210 \\
                 Error: typecheck / 211 \\
                 Redefining Built-In Operators / 212 \\
                 Stack Traces / 214 \\
                 Interactive Techniques / 214 \\
                 Coordinate System Transformations / 215 \\
                 Debugging Messages / 216 \\
                 Error Handler / 217 \\
                 Index / 221",
}

@Book{Reid:1990:TP,
  author =       "Glenn C. Reid",
  title =        "Thinking in {\POSTSCRIPT}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xiii + 221",
  year =         "1990",
  ISBN =         "0-201-52372-8",
  ISBN-13 =      "978-0-201-52372-0",
  LCCN =         "QA76.73.P67 R46 1990",
  bibdate =      "Wed Mar 12 06:02:21 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$22.95, CDN\$29.95",
  URL =          "http://www.rightbrain.com/download/books/ThinkingInPostScript.pdf;
                 http://www.rightbrain.com/pages/books.html;
                 http://www.rightbrain.com/rightbrain.shtml",
  acknowledgement = ack-bkph,
  keywords =     "PostScript (Computer program language); Programming
                 languages",
}

@Book{Reid:2003:SSE,
  author =       "Jason Reid",
  title =        "Secure Shell in the Enterprise",
  publisher =    pub-SUN-MICROSYSTEMS-PRESS,
  address =      pub-SUN-MICROSYSTEMS-PRESS:adr,
  pages =        "xxiii + 198",
  year =         "2003",
  ISBN =         "0-13-142900-0 (paperback)",
  ISBN-13 =      "978-0-13-142900-0 (paperback)",
  LCCN =         "QA76.76.O63 R448 2003",
  bibdate =      "Wed Jan 21 05:22:59 2004",
  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/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  price =        "US\$39.00",
  series =       "Sun blueprints",
  acknowledgement = ack-nhfb,
  idnumber =     "537",
  subject =      "Solaris (Computer file); Operating systems
                 (Computers); UNIX Shells; Computer networks; Security
                 measures",
  tableofcontents = "Acknowledgements / iii \\
                 Preface / xix \\
                 Introducing the Secure Protocols / 1 \\
                 Security History and Protocols / 1 \\
                 Secure Protocols / 2 \\
                 Authentication / 2 \\
                 Integrity / 4 \\
                 Confidentiality / 5 \\
                 Cryptographic Protocols / 5 \\
                 Security Policy / 8 \\
                 Tools / 9 \\
                 Kerberos / 9 \\
                 IPsec / 11 \\
                 Virtual Private Networks / 11 \\
                 Secure Shell / 12 \\
                 Determining Which Tool to Use / 13 \\
                 Tool Decision Example A / 14 \\
                 Tool Decision Example B / 14 \\
                 Secure Shell Choices / 15 \\
                 Solaris Secure Shell Software / 15 \\
                 OpenSSH / 15 \\
                 Noncommercial Implementations / 15 \\
                 Commercial Variants / 16 \\
                 Determining Which Secure Shell Software to Use / 17 \\
                 Secure Shell Software Decision Example A / 17 \\
                 Secure Shell Software Decision Example B / 17 \\
                 Consequences / 18 \\
                 Building OpenSSH / 19 \\
                 Components / 19 \\
                 Before Building OpenSSH / 20 \\
                 Static Versus Dynamic Libraries / 20 \\
                 Install Versus Build Location / 21 \\
                 About $PATH / 21 \\
                 Checking MD5 Hashes and GNU Privacy Guard Signatures /
                 21 \\
                 Component Descriptions / 21 \\
                 Solaris OE Build Machine / 22 \\
                 Solaris OE Release / 22 \\
                 Metaclusters / 22 \\
                 Gzip / 23 \\
                 Compilers / 23 \\
                 Perl / 24 \\
                 Zlib / 24 \\
                 To Build Zlib / 24 \\
                 Entropy Sources / 26 \\
                 OpenSSH Internal Entropy Collection / 27 \\
                 Kernel-Level Random Number Generators / 28 \\
                 AND Irand / 28 \\
                 SUNWski / 28 \\
                 Entropy-Gathering Daemon / 28 \\
                 Pseudorandom Number Generator Daemon / 29 \\
                 Recommendations / 29 \\
                 Building PRNGD Software / 29 \\
                 To Build PRNGD With the Forte C Compiler / 29 \\
                 To Build PRNGD With the GNU C Compiler / 30 \\
                 Manually Installing PRNGD / 30 \\
                 To Install PRNGD / 31 \\
                 Running PRNGD / 32 \\
                 To Start the PRNGD Manually / 32 \\
                 To Stop the PRNGD Manually / 32 \\
                 Testing the Entropy Source / 32 \\
                 Checking /dev/random / 32 \\
                 Checking PRNGD / 33 \\
                 TCP Wrappers / 33 \\
                 Building TCP Wrappers / 34 \\
                 To Build TCP Wrappers / 34 \\
                 To Install TCP Wrappers / 34 \\
                 OpenSSL / 35 \\
                 To Build and Test OpenSSL / 36 \\
                 To Install OpenSSL / 36 \\
                 OpenSSH / 37 \\
                 Configuring OpenSSH / 37 \\
                 To Obtain the List of Arguments in the configure Script
                 / 37 \\
                 To Configure OpenSSH / 39 \\
                 Building OpenSSH / 40 \\
                 To Build OpenSSH / 40 \\
                 Configuring the Secure Shell / 41 \\
                 Configuration Details / 41 \\
                 Mechanics of Configuration Files / 42 \\
                 Recommendations / 43 \\
                 Server Recommendations / 43 \\
                 Protocol Support / 43 \\
                 Network Access / 43 \\
                 Keep-Alives / 44 \\
                 Data Compression / 44 \\
                 Privilege Separation / 45 \\
                 Login Grace Time / 45 \\
                 Password and Public Key Authentication / 45 \\
                 Superuser (root) Logins / 46 \\
                 Banners, Mail, and Message-of-the-Day / 46 \\
                 Connection and X11 Forwarding / 46 \\
                 User Access Control Lists / 47 \\
                 User File Permissions / 48 \\
                 UseLogin Keyword / 48 \\
                 Legacy Support / 49 \\
                 Client Recommendations / 49 \\
                 Host Option Assignment / 49 \\
                 Data Compression / 50 \\
                 Keep-Alives / 50 \\
                 Protocol Support / 50 \\
                 rlogin and rsh / 50 \\
                 Server Identity / 51 \\
                 User Identity / 51 \\
                 Deploying Secure Shell / 53 \\
                 OpenSSH Deployment / 53 \\
                 OpenSSH Packaging / 54 \\
                 To Generate the OBSDssh Package / 54 \\
                 MD5 Hashes / 55 \\
                 To Generate the OpenSSH Package MD5 Hash / 55 \\
                 Solaris Security Toolkit / 55 \\
                 Solaris Secure Shell Software Deployment / 56 \\
                 Custom Configuration File Distribution / 57 \\
                 Solaris Fingerprint Database / 58 \\
                 Integrating Secure Shell / 59 \\
                 Secure Shell Scripts / 59 \\
                 rsh(1) Versus ssh(1) / 60 \\
                 rcp(1) Versus scp(1) / 60 \\
                 telnet(1) Versus ssh(1) / 61 \\
                 Automated Logins / 62 \\
                 Host Keys / 63 \\
                 Proxies / 64 \\
                 Role-Based Access Control / 65 \\
                 To Use RBAC to Restrict a User to Only Copying Files /
                 66 \\
                 Port Forwarding / 68 \\
                 To Secure WebNFS Mounts With Port Forwarding / 69 \\
                 Insecure Service Disablement / 70 \\
                 To Disable Insecure Services / 70 \\
                 Managing Keys and Identities / 71 \\
                 Host Keys / 71 \\
                 User Identities / 73 \\
                 To Create an Identity / 74 \\
                 To Register an Identity / 75 \\
                 To Revoke an Identity / 75 \\
                 Agents / 75 \\
                 Common Desktop Environment Support / 77 \\
                 Removing Agents / 78 \\
                 Agent Risks / 79 \\
                 Auditing / 81 \\
                 Auditing Overview and Basic Procedures / 81 \\
                 To Configure Auditing to Audit a Systemwide Event / 82
                 \\
                 To Configure Auditing to Audit Commands Run by a
                 Particular User / 83 \\
                 To Enable Auditing / 83 \\
                 To Audit the System / 84 \\
                 To Audit a User / 84 \\
                 To Disable Auditing / 85 \\
                 OpenSSH / 86 \\
                 cron(1M) / 86 \\
                 Patching / 87 \\
                 Logging / 87 \\
                 To Enable Secure Shell Logging / 88 \\
                 Measuring Performance / 91 \\
                 Bandwidth Performance / 91 \\
                 Interactive Sessions / 92 \\
                 File Transfers / 92 \\
                 Symmetric Cipher Performance / 93 \\
                 Identity Generation / 94 \\
                 Performance Problems / 97 \\
                 Slow Connections / 97 \\
                 Slow Client Startup / 97 \\
                 Slow Server Startup / 98 \\
                 Sizing / 98 \\
                 Examining Case Studies / 101 \\
                 A Simple Virtual Private Network / 101 \\
                 To Set Up the Destination Side / 102 \\
                 To Set Up the Originating Side / 102 \\
                 To Initiate the Link / 102 \\
                 Linking Networks Through a Bastion Host / 103 \\
                 To Set Up the Destination Side / 104 \\
                 To Set Up the Originating Side / 104 \\
                 Resolving Problems and Finding Solutions / 105 \\
                 Problems / 105 \\
                 Server Does Not Produce Log File Output / 105 \\
                 Public Key Authentication Is Not Working / 106 \\
                 Trusted Host Authentication Is Not Working / 106 \\
                 X Forwarding Is Not Working / 106 \\
                 Wildcards and Shell Variables Fail on the scp(1)
                 Command Line / 107 \\
                 Superuser (root) Is Unable to Log In / 107 \\
                 Startup Performance Is Slow / 107 \\
                 Protocol 1 Clients Are Unable to Connect to Solaris
                 Secure Shell Systems / 108 \\
                 Privilege Separation Does Not Work in the Solaris
                 Secure Shell Software / 108 \\
                 cron(1M) Is Broken / 108 \\
                 Message-of-the-Day Is Displayed Twice / 109 \\
                 Problem Reports / 109 \\
                 OpenSSH / 109 \\
                 Solaris Secure Shell Software / 109 \\
                 Patches / 109 \\
                 OpenSSH / 110 \\
                 Solaris Secure Shell Software / 110 \\
                 Solutions / 110 \\
                 Debugging a Secure Shell Connection / 110 \\
                 Understanding Differences in OpenSSH and Solaris Secure
                 Shell Software / 111 \\
                 Integrating Solaris Secure Shell and SEAM (Kerberos) /
                 111 \\
                 Forcing Remote X11 Users to Use Secure Shell Sessions /
                 111 \\
                 Determining the Server Version String / 111 \\
                 Altering the Server Version String / 112 \\
                 CERT Advisory CA-2002-18 / 112 \\
                 Secure Shell Usage / 113 \\
                 Client Usage / 113 \\
                 Connecting to a Host / 114 \\
                 Executing a Command on a Remote Host / 114 \\
                 Copying a File / 114 \\
                 Using Identity Keys / 115 \\
                 Generating an Identity / 115 \\
                 Registering an Identity / 116 \\
                 Using the Identity / 116 \\
                 Using Agents / 116 \\
                 Setting Up Agents / 117 \\
                 Loading Agents / 117 \\
                 Listing Agent Identities / 117 \\
                 Removing Agent Identities / 118 \\
                 Stopping the Agent / 118 \\
                 Forwarding Ports / 118 \\
                 Setting Up Local Forwarding / 119 \\
                 Setting Up Remote Forwarding / 120 \\
                 Enabling X Forwarding / 120 \\
                 Checking the $DISPLAY Variable / 121 \\
                 Using Proxies / 121 \\
                 Locating Client Configuration Files / 121 \\
                 Server Usage / 122 \\
                 Starting the Server / 122 \\
                 Stopping the Server / 122 \\
                 Locating Server Configuration Files / 123 \\
                 Generating New Server Host Keys / 124 \\
                 Supporting TCP Wrappers / 124 \\
                 Server Configuration Options / 127 \\
                 Client Configuration Options / 143 \\
                 Performance Test Methodology / 155 \\
                 Bandwidth Performance / 155 \\
                 Identity Generation / 156 \\
                 Symmetric Cipher Performance / 157 \\
                 Scripts and Configuration Files / 159 \\
                 Init Script / 159 \\
                 Automatic Installation / 159 \\
                 Manual Installation / 159 \\
                 To Manually Install the init Script / 160 \\
                 Contact / 160 \\
                 Init Script Sample / 161 \\
                 Code Example for Packaging Script / 166 \\
                 Usage / 167 \\
                 Contact / 167 \\
                 Packaging Script Sample / 168 \\
                 Code Example for PRNGD Sanity Check / 174 \\
                 Server Configuration Files / 176 \\
                 DMZ-Bastion Host Server / 176 \\
                 Legacy Support / 177 \\
                 Workstation Server / 178 \\
                 Client Configurations / 179 \\
                 Remote Worker Configuration File / 179 \\
                 Workstation Configuration File / 180 \\
                 Resources / 181 \\
                 Solaris Secure Shell Software Documentation / 181 \\
                 OpenSSH Documentation / 182 \\
                 Software / 182 \\
                 Bibliography / 185 \\
                 Sun BluePrints OnLine Articles / 185 \\
                 External Articles / 186 \\
                 Books / 187 \\
                 Bug Reports / 189 \\
                 FAQs / 189 \\
                 Man Pages / 189 \\
                 Presentations / 190 \\
                 Security Information / 190 \\
                 Index / 191",
}

@Book{Reid:2006:ZIW,
  author =       "Constance Reid",
  title =        "From Zero to Infinity: What Makes Numbers
                 Interesting",
  publisher =    pub-A-K-PETERS,
  address =      pub-A-K-PETERS:adr,
  edition =      "Fifth",
  pages =        "xvii + 188",
  year =         "2006",
  ISBN =         "1-56881-273-6",
  ISBN-13 =      "978-1-56881-273-1",
  LCCN =         "QA93 .R42 2006",
  bibdate =      "Fri Dec 23 07:07:08 MST 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 prodorbis.library.yale.edu:7090/voyager;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "numerals; number theory",
  tableofcontents = "Acknowledgements \\
                 Author's Note \\
                 Zero \\
                 One \\
                 Two \\
                 Three \\
                 Four \\
                 Five \\
                 Six \\
                 Seven \\
                 Eight \\
                 Nine \\
                 Euler's Number \\
                 Aleph Zero",
}

@Book{Reingold:2002:CCM,
  author =       "Edward M. Reingold and Nachum Dershowitz",
  title =        "Calendrical Calculations: The Millenium Edition",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xxxii + 422",
  year =         "2002",
  ISBN =         "0-521-77752-6 (paperback), 0-521-77167-6 (hardcover)",
  ISBN-13 =      "978-0-521-77752-0 (paperback), 978-0-521-77167-2
                 (hardcover)",
  LCCN =         "CE12 .R45 2001",
  bibdate =      "Fri Mar 14 07:32:10 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$38.00 (paperback), US\$100.00 (hardcover)",
  URL =          "http://emr.cs.iit.edu/home/reingold/calendar-book/second-edition/",
  abstract =     "\booktitle{Calendrical Calculations} makes accurate
                 calendrical algorithms readily available for computer
                 use with LISP and Java code for all the algorithms
                 included on CD, and updates available on the Web. It
                 gives a description of fourteen calendars and how they
                 relate to one another: the present civil calendar
                 (Gregorian), the recent ISO commercial calendar, the
                 old civil calendar (Julian), the Coptic and Ethiopic
                 calendars, the Islamic (Moslem) calendar; the Baha'i,
                 the Hebrew (Jewish) calendar, the Mayan calendars, the
                 French Revolutionary calendar, the Chinese calendar,
                 and both the old (mean) and new (true) Hindu (Indian)
                 calendars.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  tableofcontents = "1: Introduction \\
                 Part 1. Arithmetical calendars \\
                 2: The Gregorian calendar \\
                 3: The Julian calendar \\
                 4: The Coptic and Ethiopic calendars \\
                 5: The ISO calendar \\
                 6: The Islamic calendar \\
                 7: The Hebrew calendar \\
                 8: The ecclesiastical calendars \\
                 9: The old Hindu calendars \\
                 10: The Mayan calendars \\
                 11: The Balinese Pawukon calendar \\
                 Part 2. Astronomical calendars \\
                 12: Time and astronomy \\
                 13: The Persian calendar \\
                 14: The Bah{\'a}{\thorn}{\'i} calendar \\
                 15: The French Revolutionary calendar \\
                 16: The Chinese calendar \\
                 17: The modern Hindu calendars \\
                 Coda \\
                 Appendix A: Function, parameter, and constant types \\
                 Appendix B: Lisp implementation \\
                 Appendix C: Sample data",
}

@Book{Reingold:2002:CT,
  author =       "Edward M. Reingold and Nachum Dershowitz",
  title =        "Calendrical Tabulations: 1900--2200",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xxx + 606",
  year =         "2002",
  ISBN =         "0-521-78253-8 (hardcover)",
  ISBN-13 =      "978-0-521-78253-1 (hardcover)",
  LCCN =         "CE12 .R46 2002",
  bibdate =      "Tue Apr 02 15:08:23 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$120",
  abstract =     "The momentous task of assembling such a comprehensive
                 and accurate collection of calendars could only have
                 been achieved by the authors of the definitive work on
                 calendar algorithms, Calendrical Calculations. Using
                 the algorithms from that book, Professors Reingold and
                 Dershowitz have achieved the near-impossible task of
                 simultaneously displaying the date on fifteen different
                 calendars over a three-hundred-year period. Represented
                 here are the Gregorian, ISO, Hebrew, Chinese, Coptic,
                 Ethiopic, Persian, Hindu lunar, Hindu solar, and
                 Islamic calendars; another five are easily obtained
                 from the tables with minimal arithmetic (JD, R.D.,
                 Julian, arithmetical Persian, and arithmetical
                 Islamic). The tables also include phases of the moon,
                 dates of solstices and equinoxes, and religious and
                 other special holidays for all the calendars shown.
                 This set of beautifully produced tables will be of use
                 for centuries by anyone with an interest in calendars
                 and the societies that produce them. It should also
                 prove an invaluable reference tool for astronomers and
                 genealogists.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  tableofcontents = "Preface / ix \\
                 Reading the Tables / xiii \\
                 References / xxix \\
                 Calendars, 1900-2200 / 1 \\
                 Warnings / 605",
}

@Book{Reischauer:1988:JTC,
  author =       "Edwin O. Reischauer",
  title =        "The {Japanese} Today: Change and Continuity",
  publisher =    pub-BELKNAP,
  address =      pub-BELKNAP:adr,
  pages =        "viii + 426",
  year =         "1988",
  ISBN =         "0-674-47181-4",
  ISBN-13 =      "978-0-674-47181-8",
  LCCN =         "DS806.R35 1988",
  bibdate =      "Mon Dec 04 07:43:29 1995",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/ora.bib",
  price =        "US\$39.95",
  abstract =     "Describes the trends that have affected Japan's modern
                 development and contemporary Japanese issues.",
  acknowledgement = ack-nhfb,
  annote =       "The author was born and raised in Japan, and was the
                 U.S. Ambassador to Japan during the 1960s and 1970s.
                 See also \cite{Lunde:UJI93,Unger:FGF87}.",
  libnote =      "Not in my library.",
  shorttableofcontents = "The setting \\
                 Historical background \\
                 Society \\
                 Government and politics \\
                 Business \\
                 Japan and the world",
  tableofcontents = "The Setting \\
                 The Land \\
                 Agriculture and Natural Resources \\
                 Isolation \\
                 Historical Background \\
                 Early Japan \\
                 Feudalism \\
                 Centralized Feudalism \\
                 The Meiji Restoration \\
                 The Constitutional System \\
                 The Militarist Reaction \\
                 The Occupation Reforms \\
                 Post-Occupation Japan \\
                 Society \\
                 Diversity and Change \\
                 The Group \\
                 Relativism \\
                 Hierarchy \\
                 The Individual \\
                 Women 18. Education \\
                 Religion \\
                 Mass Culture \\
                 Government and Politics \\
                 The Political Heritage \\
                 The Emperor \\
                 The Diet \\
                 Other Organs of Government \\
                 Elections \\
                 Political Parties \\
                 The Decision-Making Process \\
                 Issues \\
                 Political Style \\
                 Business \\
                 The Premodern Background \\
                 The Prewar Economy \\
                 The Postwar Economy \\
                 The Employment System \\
                 Business Organization \\
                 Japan and the World \\
                 The Prewar Record \\
                 Neutrality versus Alignment \\
                 Trade and Economic Dependence \\
                 Language \\
                 Uniqueness and Internationalism \\
                 Japan Today \\
                 Suggested Reading \\
                 Index",
}

@TechReport{Renner:textyl,
  author =       "John S. Renner",
  title =        "{\TeX}tyl: a line-drawing interface for {\TeX}",
  number =       "OSU-CISRC-4\slash 87-TR9",
  institution =  "Department of Computer Science, Ohio State
                 University",
  month =        mar,
  year =         "1987",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Resag:2018:FHP,
  author =       "J{\"o}rg Resag",
  title =        "{Feynman} and His Physics: The Life and Science of an
                 Extraordinary Man",
  publisher =    "Springer International Publishing",
  address =      "Cham, Switzerland",
  pages =        "xii + 319",
  year =         "2018",
  DOI =          "https://doi.org/10.1007/978-3-319-96836-0",
  ISBN =         "3-319-96835-1 (print), 3-319-96836-X (e-book),
                 3-319-96837-8",
  ISBN-13 =      "978-3-319-96835-3 (print), 978-3-319-96836-0 (e-book),
                 978-3-319-96837-7",
  ISSN =         "2365-0613 (print), 2365-0621 (electronic)",
  ISSN-L =       "2365-0621",
  LCCN =         "QC16.F49 R4713 2018",
  bibdate =      "Fri May 29 08:37:51 MDT 2020",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/f/feynman-richard-p.bib;
                 https://www.math.utah.edu/pub/tex/bib/contempphys.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Springer Biographies",
  abstract =     "This book takes the reader on a journey through the
                 life of Richard Feynman and describes, in non-technical
                 terms, his revolutionary contributions to modern
                 physics. Feynman was an unconventional thinker who
                 always tried to get to the bottom of things. In doing
                 so, he developed an intuitive view that made him one of
                 the greatest teachers of physics. The author captures
                 this development and explains it in the context of the
                 zeitgeist of modern physics: What revolutionary ideas
                 did Feynman have, what contribution did he make to the
                 development of quantum mechanics and quantum field
                 theory, how can Feynman's methods be understood? Be
                 enchanted by this book and understand the physics of
                 the genius whose 100th birthday was celebrated in
                 2018.",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "Adolescent years and the principle of least
                 action \\
                 Princeton, Path Integrals, and the Manhattan Project
                 \\
                 Feynman's Path to Quantum Electrodynamics \\
                 California, super cold helium, and the weak interaction
                 \\
                 From researcher to teacher and Nobel Prize winner \\
                 Quarks, computers, and the Challenger disaster \\
                 Glossary \\
                 Sources and Literature",
  subject =      "Sciences; {\'E}tude et enseignement; Astrophysique",
  subject-dates = "Richard P. Feynman (1918--1988)",
  tableofcontents = "1 Adolescent Years and the Principle of Least
                 Action / 1 \\
                 1.1 Childhood, High School and MIT / 3 \\
                 1.2 Light Saves as Much Time as It Can: Fermat's
                 Principle / 24 \\
                 1.3 Mechanics Seen in a Different Way: The Principle of
                 Least Action / 34 \\
                 2 Princeton, Path Integrals, and the Manhattan Project
                 / 43 \\
                 2.1 Feynman in Princeton / 43 \\
                 2.2 Electrodynamics Without Fields / 48 \\
                 2.3 The Action in Quantum Mechanics / 64 \\
                 2.4 Radioactivity and the Manhattan Project / 72 \\
                 3 Feynman's Path to Quantum Electrodynamics / 91 \\
                 3.1 Going to Cornell / 91 \\
                 3.2 The Masterpiece: Feynman Diagrams and Antiparticles
                 / 103 \\
                 3.3 Lamb Shift, Magnetic Moment and Renormalization /
                 121 \\
                 3.4 Schwinger, Tomonaga, and Dyson / 137 \\
                 4 California, Super-Cold Helium, and the Weak
                 Interaction / 151 \\
                 4.1 Brazil and the Move to Caltech / 151 \\
                 4.2 Physics at Low Temperatures / 161 \\
                 4.3 Right and Left: The Violation of Mirror Symmetry /
                 182 \\
                 5 From Researcher to Teacher and Nobel Prizewinner /
                 205 \\
                 5.1 Marriage, Family, and the Nobel Prize / 206 \\
                 5.2 Nanotechnology: There's Plenty of Room at the
                 Bottom / 209 \\
                 5.3 \booktitle{The Feynman Lectures} / 219 \\
                 5.4 Gravity and Quantum Theory / 235 \\
                 6 Quarks, Computers, and the Challenger Disaster / 249
                 \\
                 6.1 Symmetries and Quarks / 250 \\
                 6.2 Computers / 267 \\
                 6.3 The Last Years and the Challenger Disaster / 286
                 \\
                 6.4 Feynman's Legacy / 298 \\
                 Glossary / 305 Sources and Literature / 315",
}

@Book{Resnick:1977:PPO,
  author =       "Robert Resnick and David Halliday",
  title =        "Physics, Part One",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  edition =      "Third",
  pages =        "xi + 564 + A44",
  year =         "1977",
  ISBN =         "0-471-71716-9",
  ISBN-13 =      "978-0-471-71716-4",
  LCCN =         "QC21.2.R47 1977",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Rhodes:1986:MAB,
  author =       "Richard Rhodes",
  title =        "The Making of the Atomic Bomb",
  publisher =    pub-SIMON-SCHUSTER,
  address =      pub-SIMON-SCHUSTER:adr,
  pages =        "886 + 42",
  year =         "1986",
  ISBN =         "0-671-44133-7 (paperback), 0-671-65719-4 (hardcover)",
  ISBN-13 =      "978-0-671-44133-3 (paperback), 978-0-671-65719-2
                 (hardcover)",
  LCCN =         "QC773 .R46 1986",
  bibdate =      "Sun Dec 18 11:40:19 MST 2005",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/f/fermi-enrico.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/h/heisenberg-werner.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/t/teller-edward.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 melvyl.cdlib.org:210/CDL90",
  acknowledgement = ack-nhfb,
  remark =       "From page 374: ``In the midst of experiment Fermi
                 found time to theorize. He and Teller had lunch at the
                 University Club one pleasant day in September.
                 Afterward, walking back to Pupin --- `out of the blue,'
                 Teller says --- Fermi wondered aloud if an atomic bomb
                 might serve to heat a mass of deuterium sufficiently to
                 begin thermonuclear fusion. Such a mechanism, a bomb
                 fusing hydrogen to helium, should be three orders of
                 magnitude as energetic as a fission bomb and far
                 cheaper in terms of equivalent explosive force. For
                 Fermi the idea was a throwaway. Teller found it a
                 surpassing challenge and took it to heart.''",
  subject =      "Atomic bomb; History",
  tableofcontents = "Moonshine \\
                 Atoms and void \\
                 Tvi \\
                 The long grave already dug \\
                 Men from Mars \\
                 Machines \\
                 Exodus \\
                 Stirring and digging \\
                 An extensive burst \\
                 Neutrons \\
                 Cross sections \\
                 A communication from Britain \\
                 The New World \\
                 Physics and desert country \\
                 Different animals \\
                 Revelations \\
                 The evils of this time \\
                 Trinity \\
                 Tongues of fire",
}

@Book{Rhodes:1995:DSM,
  author =       "Richard Rhodes",
  title =        "Dark Sun: The Making of the Hydrogen Bomb",
  publisher =    pub-SIMON-SCHUSTER,
  address =      pub-SIMON-SCHUSTER:adr,
  pages =        "731 + 32",
  year =         "1995",
  ISBN =         "0-684-80400-X, 0-684-82414-0 (paperback)",
  ISBN-13 =      "978-0-684-80400-2, 978-0-684-82414-7 (paperback)",
  LCCN =         "UG1282.A8 R46 1995",
  bibdate =      "Fri Oct 21 16:02:50 MDT 2005",
  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",
  series =       "Sloan technology series",
  acknowledgement = ack-nhfb,
  subject =      "Hydrogen bomb; History",
  tableofcontents = "Preface to the Sloan Technology Series / 13 \\
                 Prologue: Deliveries / 17 \\
                 Part One \\
                 A Choice Between Worlds \\
                 1. `A Smell of Nuclear Powder' / 27 \\
                 2. Diffusion / 49 \\
                 3. `Material of Immense Value' / 66 \\
                 4. A Russian Connection / 83 \\
                 5. `Super Lend-Lease' / 94 \\
                 6. Rendezvous / 103 \\
                 7. `Mass Production' / 121 \\
                 8. Explosions / 146 \\
                 9. `Provide the Bomb' / 165 \\
                 10. A Pretty Good Description / 180 \\
                 Part Two \\
                 New Weapons Added to the Arsenals \\
                 11. Transitions / 201 \\
                 12. Peculiar Sovereignties / 224 \\
                 13. Changing History / 244 \\
                 14. F-l / 264 \\
                 15. Modus Vivendi / 285 \\
                 16. Sailing Near the Wind / 302 \\
                 17. Getting Down to Business / 324 \\
                 18. `This Buck Rogers Universe' / 345 \\
                 19. First Lightning / 364 \\
                 20. `Gung-ho for the Super' / 382 \\
                 Part Three \\
                 Scorpions in a Bottle \\
                 21. Fresh Horrors / 411 \\
                 22. Lessons of Limited War / 438 \\
                 23. Hydrodynamic Lenses and Radiation Mirrors / 455 \\
                 24. Mike / 482 \\
                 25. Powers of Retaliation / 513 \\
                 26. In the Matter of J. Robert Oppenheimer / 530 \\
                 27. Scorpions in a Bottle / 560 \\
                 Epilogue: `The Gradual Removal of Prejudices' / 577 \\
                 Acknowledgments / 589 \\
                 Notes / 591 \\
                 Glossary of Names / 671 \\
                 Bibliography / 689 \\
                 Index / 705",
}

@Book{Rhodes:2015:HGC,
  author =       "Richard Rhodes",
  title =        "Hell and Good Company: the {Spanish Civil War} and the
                 World It Made",
  publisher =    pub-SIMON-SCHUSTER,
  address =      pub-SIMON-SCHUSTER:adr,
  pages =        "xviii + 302 + 16",
  year =         "2015",
  ISBN =         "1-4516-9621-3 (hardcover), 1-4516-9623-X (e-book)",
  ISBN-13 =      "978-1-4516-9621-9 (hardcover), 978-1-4516-9623-3
                 (e-book)",
  LCCN =         "DP269 .R457 2015",
  bibdate =      "Wed Jun 3 08:52:58 MDT 2015",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "Pulitzer Prize-winning and bestselling author Richard
                 Rhodes relates the remarkable story of the Spanish
                 Civil War through the eyes of the reporters, writers,
                 artists, doctors, and nurses who witnessed it. The
                 Spanish Civil War (1936--1939) inspired and haunted an
                 extraordinary number of exceptional artists and
                 writers, including Pablo Picasso, Joan Miro, Martha
                 Gellhorn, Ernest Hemingway, George Orwell, and John Dos
                 Passos. The idealism of the cause --- defending
                 democracy from fascism at a time when Europe was
                 darkening toward another world war --- and the
                 brutality of the conflict drew from them some of their
                 best work: Guernica, For Whom the Bell Tolls, Homage to
                 Catalonia, The Spanish Earth. The war spurred
                 breakthroughs in military and medical technology as
                 well. New aircraft, new weapons, new tactics and
                 strategy all emerged in the intense Spanish conflict.
                 Indiscriminate destruction raining from the sky became
                 a dreaded reality for the first time. Progress also
                 arose from the horror: the doctors and nurses who
                 volunteered to serve with the Spanish defenders devised
                 major advances in battlefield surgery and front-line
                 blood transfusion. In those ways, and in many others,
                 the Spanish Civil War served as a test bed for World
                 War II, and for the entire twentieth century.",
  acknowledgement = ack-nhfb,
  author-dates = "1937--",
  libnote =      "Not yet in my library.",
  subject =      "Spain; History; Civil War, 1936--1939",
  tableofcontents = "Preface / xv \\
                 Part One: The overthrown past \\
                 1: News arrives of the deaths of others / 3 \\
                 2: Today the burning city lights itself / 19 \\
                 3: The hero's red flag is laid across his eyes / 34 \\
                 4: Bombs falling like black pears / 50 \\
                 Part Two: Dream and lie of Franco \\
                 5: Fandangos of shivering owls / 67 \\
                 6: A valley in Spain called Jarama / 85 \\
                 7: The old homestead / 102 \\
                 8: Not everybody's daily life / 125 \\
                 9: A sea of suffering and death / 143 \\
                 10: Cuckoo idealists / 162 \\
                 11: Heads down and hope / 180 \\
                 Part Three: The thing that is trying to ruin the world
                 \\
                 12: Only the Devil knows / 203 \\
                 13: History to the defeated / 218 \\
                 Epilogue: The fall of the curtain / 235 \\
                 Acknowledgments / 241 \\
                 Notes / 243 \\
                 Bibliography / 265 \\
                 Index / 287 \\
                 Credits / 301",
}

@Book{Ribenboim:1996:NBP,
  author =       "Paulo Ribenboim",
  title =        "The New Book of Prime Number Records",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Third",
  pages =        "xxiv + 541",
  year =         "1996",
  DOI =          "https://doi.org/10.1007/978-1-4612-0759-7",
  ISBN =         "0-387-94457-5 (hardcover)",
  ISBN-13 =      "978-0-387-94457-9 (hardcover)",
  LCCN =         "QA246 .R47 1996",
  bibdate =      "Thu Dec 24 14:28:24 MST 2009",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/mathcw.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  remark =       "Revised edition of ``The Book of Prime Number
                 Records'', second edition 1989.",
  shorttableofcontents = "Preface / ix \\
                 Guiding the Reader / xv \\
                 Index of Notations / xvii \\
                 Introduction / 1 \\
                 1: How Many Prime Numbers Are There? / 3 \\
                 2: How to Recognize Whether a Natural Number Is a Prime
                 / 19 \\
                 3: Are There Functions Defining Prime Numbers? / 179
                 \\
                 4: How Are the Prime Numbers Distributed? / 233 \\
                 5: Which Special Kinds of Primes Have Been Considered?
                 / 323 \\
                 6: Heuristic and Probabilistic Results about Prime
                 Numbers / 371 \\
                 Conclusion / 427 \\
                 Bibliography / 433 \\
                 The Pages That Couldn't Wait / 509 \\
                 Primes up to 10,000 / 513 \\
                 Index of Tables / 517 \\
                 Index of Names / 519 \\
                 Subject Index / 535",
  subject =      "numbers, prime",
  tableofcontents = "Preface / ix \\
                 Guiding the Reader / xv \\
                 Index of Notations / xvii \\
                 \\
                 Introduction / 1 \\
                 \\
                 1: How Many Prime Numbers Are There? / 3 \\
                 I. Euclid's Proof / 3 \\
                 II. Goldbach Did It Too! / 4 \\
                 III. Euler's Proof / 6 \\
                 IV. Thue's Proof / 7 \\
                 V. Three Forgotten Proofs / 8 \\
                 A. Perott's Proof / 8 \\
                 B. Aurie's Proof / 9 \\
                 C. M{\'e}trod's Proof / 9 \\
                 VI. Washington's Proof / 9 \\
                 VII. F{\"u}rstenberg's Proof / 10 \\
                 VIII. Euclidean Sequences / 11 \\
                 IX. Generation of Infinite Sequences of Pairwise
                 Relatively Prime Integers / 17 \\
                 \\
                 2: How to Recognize Whether a Natural Number Is a Prime
                 / 19 \\
                 I. The Sieve of Eratosthenes / 20 \\
                 II. Some Fundamental Theorems on Congruences / 21 \\
                 A. Fermat's Little Theorem and Primitive Roots Modulo a
                 Prime / 22 \\
                 B. The Theorem of Wilson / 25 \\
                 C. The Properties of Giuga, Wolstenholme, and Mann and
                 Shanks / 28 \\
                 D. The Power of a Prime Dividing a Factorial / 30 \\
                 E. The Chinese Remainder Theorem / 33 \\
                 F. Euler's Function / 34 \\
                 G. Sequences of Binomials / 42 \\
                 H. Quadratic Residues / 46 \\
                 III. Classical Primality Tests Based on Congruences /
                 48 \\
                 IV. Lucas Sequences / 53 \\
                 V. Primality Tests Based on Lucas Sequences / 74 \\
                 VI. Fermat Numbers / 83 \\
                 VII. Mersenne Numbers / 90 \\
                 VIII. Pseudoprimes / 103 \\
                 A. Pseudoprimes in Base 2 (psp) / 105 \\
                 B. Pseudoprimes in Base $a$ (psp($a$)) / 108 \\
                 C. Euler Pseudoprimes in Base $a$ (epsp($a$)) / 112 \\
                 D. Strong Pseudoprimes in Base $a$ (spsp($a$)) / 113
                 \\
                 E. Somer Pseudoprimes / 117 \\
                 IX. Carmichael Numbers / 118 \\
                 X. Lucas Pseudoprimes / 126 \\
                 A. Fibonacci Pseudoprimes / 127 \\
                 B. Lucas Pseudoprimes (lpsp($P, Q$)) / 129 \\
                 C. Euler--Lucas Pseudoprimes (elpsp($P, Q$)) and Strong
                 Lucas Pseudoprimes (slpsp($P, Q$)) / 130 \\
                 D. Somer--Lucas Pseudoprimes / 131 \\
                 E. Carmichael--Lucas Numbers / 132 \\
                 XI. Primality Testing and Large Primes / 135 \\
                 A. The Cost of Testing / 136 \\
                 B. More Primality Tests / 139 \\
                 C. Primality Certification / 153 \\
                 D. Fast Generation of Large Primes / 156 \\
                 E. Titanic Primes / 157 \\
                 F. Curious Primes / 159 \\
                 XII. Factorization and Public Key Cryptography / 162
                 \\
                 A. Factorization of Large Composite Integers / 163 \\
                 B. Public Key Cryptography / 172 \\
                 \\
                 3: Are There Functions Defining Prime Numbers? / 179
                 \\
                 I. Functions Satisfying Condition (a) / 179 \\
                 II. Functions Satisfying Condition (b) / 186 \\
                 III. Functions Satisfying Condition (c) / 187 \\
                 IV. Prime-Producing Polynomials / 196 \\
                 A. Surveying the Problems / 196 \\
                 B. Polynomials with Many Initial Prime Absolute Values
                 / 197 \\
                 C. The Prime-Producing Polynomials Races / 203 \\
                 D. Primes of the Form $m^2 + 1$ / 206 \\
                 \\
                 4: How Are the Prime Numbers Distributed? / 233 \\
                 I. The Growth of $\pi(x)$ / 214 \\
                 A. History Unfolding / 215 \\
                 B. Sums Involving the M{\"o}bius Function / 229 \\
                 C. Tables of Primes / 233 \\
                 D. The Exact Value of $\pi(x)$ and Comparison with
                 $x/(\log x)$, $Li(x)$, and $R(x)$ / 235 \\
                 E. The Nontrivial Zeros of $\zeta(s)$ / 239 \\
                 F. Zero-Free Regions for $\zeta(s)$ and the Error Term
                 in the Prime Number Theorem / 243 \\
                 G. The Growth of $\zeta(s)$ / 245 \\
                 H. Some Properties of $\pi(x)$ / 247 \\
                 II. The $n$th Prime and Gaps / 248 \\
                 A. The nth Prime / 248 \\
                 B. Gaps Between Primes / 250 \\
                 Interlude / 258 \\
                 III. Twin Primes / 259 \\
                 Addendum on $k$-Tuples of Primes / 265 \\
                 IV. Primes in Arithmetic Progression / 265 \\
                 A. There Are Infinitely Many! / 265 \\
                 B. The Smallest Prime in an Arithmetic Progression /
                 277 \\
                 C. Strings of Primes in Arithmetic Progression / 284
                 \\
                 V. Primes in Special Sequences / 288 \\
                 VI. Goldbach's Famous Conjecture / 291 \\
                 VII. The Waring--Goldbach Problem / 299 \\
                 A. Waring's Problem / 300 \\
                 B. The Waring--Goldbach Problem / 310 \\
                 VIII. The Distribution of Pseudoprimes, Carmichael
                 Numbers, and Values of Euler's Function / 311 \\
                 A. Distribution of Pseudoprimes / 314 \\
                 B. Distribution of Carmichael Numbers / 317 \\
                 C. Distribution of Lucas Pseudoprimes / 318 \\
                 D. Distribution of Elliptic Pseudoprimes / 319 \\
                 E. Distribution of Values of Euler's Function \\
                 5: Which Special Kinds of Primes Have Been Considered?
                 / 323 \\
                 I. Regular Primes / 323 \\
                 II. Sophie Germain Primes / 329 \\
                 III. Wieferich Primes / 333 \\
                 IV. Wilson Primes / 346 \\
                 V. Repunits and Similar Numbers / 350 \\
                 VI. Primes with Given Initial and Final Digits / 355
                 \\
                 VII. Numbers $k \times 2^n \pm 1$ / 355 \\
                 VIII. Primes and Second-Order Linear Recurrence
                 Sequences / 361 \\
                 IX. The NSW Primes / 367 \\
                 \\
                 6: Heuristic and Probabilistic Results about Prime
                 Numbers / 371 \\
                 I. Prime Values of Linear Polynomials / 372 \\
                 II. Prime Values of Polynomials of Arbitrary Degree /
                 386 \\
                 Ill. Polynomials with Many Successive Composite Values
                 / 400 \\
                 IV. Partitio Numerorum / 403 \\
                 V. Some Probabilistic Estimates / 411 \\
                 A. Distribution of Mersenne Primes / 411 \\
                 B. The $\log \log$ Philosophy / 413 \\
                 VI. The Density of the Set of Regular Primes / 414 \\
                 Conclusion / 427 \\
                 Bibliography / 433 \\
                 The Pages That Couldn't Wait / 509 \\
                 Primes up to 10,000 / 513 \\
                 Index of Tables / 517 \\
                 Index of Names / 519 \\
                 Subject Index / 535",
  xxURL =        "http://www.loc.gov/catdir/enhancements/fy0814/95005441-d.html",
}

@Book{Rice:1981:MCM,
  author =       "John R. Rice",
  title =        "Matrix Computations and Mathematical Software",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "xii + 248",
  year =         "1981",
  ISBN =         "0-07-052145-X",
  ISBN-13 =      "978-0-07-052145-2",
  LCCN =         "QA188 .R52",
  bibdate =      "Wed Dec 15 18:10:56 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/r/rice-john-r.bib;
                 https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
                 https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/beebe.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "McGraw-Hill Computer Science Series",
  acknowledgement = ack-nhfb,
  mynote =       "Much text and ideas in common with
                 \cite{Rice:1983:NMSa}.",
  remark =       "Russian translation, Moscow, (1984), 264 pages.",
  tableofcontents = "Linear algebra background \\
                 Types and sources of matrix computational problems \\
                 Type of matrix that arise \\
                 Gauss elimination and $L U$ factorization \\
                 Mathematical software objectives \\
                 Mathematical software performance evaluation \\
                 How do you know you have right answers? \\
                 Conditioning and backward error analysis \\
                 Iterative methods \\
                 Linear least squares and regression \\
                 Projects \\
                 Standard linear algebra software",
}

@Book{Rice:1983:NMS,
  author =       "John R. Rice",
  title =        "Numerical Methods, Software, and Analysis",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "xii + 483",
  year =         "1983",
  ISBN =         "0-07-052208-1",
  ISBN-13 =      "978-0-07-052208-4",
  LCCN =         "QA297 .R49 1983",
  bibdate =      "Wed Dec 15 10:41:12 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/r/rice-john-r.bib;
                 https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/beebe.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$19.95",
  acknowledgement = ack-nhfb,
  tableofcontents = "Mathematics and computer science background \\
                 Numerical software \\
                 Errors, round-off, and stability \\
                 Models and formulas for numerical computations \\
                 Interpolation \\
                 Matrices and linear equations \\
                 Differentiation and integration \\
                 Nonlinear equations \\
                 Ordinary differential equations \\
                 Partial differential equations \\
                 Approximation of functions and data \\
                 Software practice, costs, and engineering \\
                 Software performance evaluation \\
                 The validation of numerical computations \\
                 Protran",
}

@Book{Richelson:2006:SBA,
  author =       "Jeffrey Richelson",
  title =        "Spying on the bomb: {American} nuclear intelligence
                 from {Nazi Germany} to {Iran} and {North Korea}",
  publisher =    pub-NORTON,
  address =      pub-NORTON:adr,
  pages =        "702",
  year =         "2006",
  ISBN =         "0-393-05383-0 (hardcover)",
  ISBN-13 =      "978-0-393-05383-8 (hardcover)",
  LCCN =         "UB271.U5 R53 2006",
  bibdate =      "Wed Oct 5 18:00:05 MDT 2016",
  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 =     "A global history of U.S. nuclear espionage from its
                 World War II origins to today's threats from rogue
                 states. Since 1952 the nuclear club has grown to at
                 least eight nations, while others are making serious
                 attempts to join. Each chapter chronologically focuses
                 on the nuclear activities of one or more countries,
                 intermingling what the United States believed was
                 happening with accounts of what actually occurred in
                 each country's laboratories, test sites, and
                 decision-making councils. Intelligence scholar
                 Richelson weaves recently declassified documents into
                 his interviews with the scientists and spies involved
                 in the nuclear espionage, revealing new information
                 about U.S. intelligence work on the Soviet/Russian,
                 French, Chinese, Indian, Israeli, and South African
                 nuclear programs; on the attempts to solve the
                 mysterious Vela Incident; and on current efforts to
                 uncover nuclear secrets of Iran and North Korea.
                 Includes spy satellite photographs never before
                 extracted from the National Archives.",
  acknowledgement = ack-nhfb,
  subject =      "Espionage, American; Nuclear weapons information;
                 Nuclear weapons; Research; Nuclear arms control; United
                 States",
  tableofcontents = "List of Maps / 9 \\
                 Preface / 11 \\
                 1. A Terrifying Prospect: Nazi Germany / 17 \\
                 2. Lightning Strikes: The Soviet Union 1945--1953 / 62
                 \\
                 3. The View from Above: The Soviet Union 1954--1961 /
                 105 \\
                 4. Mao's Explosive Thoughts: The People's Republic of
                 China through 1968 / 137 \\
                 5. An Elated General, A Smiling Buddha: France and
                 India through 1974 / 195 \\
                 6. ``Pariahs'': Israel, South Africa, and Taiwan
                 through the 1970s / 236 \\
                 7. The Double Flash: The Vela Incident: September 1979
                 / 283 \\
                 8. Rogues: Iraq, North Korea, Libya, and Pakistan
                 through 1991 / 317 \\
                 9. ``Pariahs'' Revisited: Israel, South Africa, and
                 Taiwan in the 1980s and early 1990s / 360 \\
                 10. Big Bangs: French and Chinese testing; suspected
                 Russian testing / 401 \\
                 11. Pokhran Surprise: Indian and Pakistani tests in May
                 1998 / 417 \\
                 12. Inspectors and Spies: Iraq from the end of the Gulf
                 War through December 1998 / 447 \\
                 13. Flawed Intelligence: Iraq, 1999--2004 / 470 \\
                 14. Trouble Waiting to Happen: Iran and North Korea,
                 from the 1990s to today / 503 \\
                 Abbreviations and Acronyms / 545 \\
                 Acknowledgments / 549 \\
                 Notes / 551 \\
                 Index / 673",
}

@Book{Riehm:2011:TTM,
  author =       "Elaine McKinnon Riehm and Frances Hoffman",
  title =        "Turbulent Times in Mathematics: the Life of {J. C.
                 Fields} and the History of the {Fields Medal}",
  publisher =    pub-AMS,
  address =      pub-AMS:adr,
  pages =        "xii + 257 + 16",
  year =         "2011",
  ISBN =         "0-8218-6914-0",
  ISBN-13 =      "978-0-8218-6914-7",
  LCCN =         "QA29.F54 R53 2011",
  MRclass =      "01-XX, 01A05, 01A55, 01A60, 01A70, 01A73, 01A99,
                 97-02, 97A30, 97A80, 97A40",
  bibdate =      "Sat Apr 1 14:58:59 MDT 2017",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  author-dates = "1936--",
  libnote =      "Not in my library.",
  subject =      "Fields, John Charles; Mathematicians; Canada;
                 Biography; Fields Prizes; History and biography;
                 History and biography -- History of mathematics and
                 mathematicians -- General histories, source books;
                 History and biography -- History of mathematics and
                 mathematicians -- 19th century; History and biography
                 -- History of mathematics and mathematicians -- 20th
                 century; History and biography -- History of
                 mathematics and mathematicians -- Biographies,
                 obituaries, personalia, bibliographies; History and
                 biography -- History of mathematics and mathematicians
                 -- Universities; History and biography -- History of
                 mathematics and mathematicians -- Miscellaneous topics;
                 Mathematics education -- Research exposition
                 (monographs, survey articles); Mathematics education --
                 General, mathematics and education -- History of
                 mathematics and mathematics education; Mathematics
                 education -- General, mathematics and education --
                 Popularization of mathematics; Mathematics education --
                 General, mathematics and education -- Mathematics and
                 society.",
  subject-dates = "1863--1932",
  tableofcontents = "1: Childhood of John Charles Fields \\
                 2: Toronto and Baltimore \\
                 3: Post-doctoral years in Europe, 1892--1900 \\
                 4: Return to Canada \\
                 5: Fields and research \\
                 6: Mathematics before 1914: The golden years \\
                 7: Science responds to war \\
                 8: The politics of avoidance \\
                 9: International Mathematical Congress, Toronto 1924
                 \\
                 10: ``Sub-turbulent politics'': Pincherle and Bologna
                 \\
                 11: The Fields Medal \\
                 12: Late years \\
                 Appendix I. Publications of J. C. Fields \\
                 Appendix II. Fields Medallists, 1936--2010 \\
                 Appendix III. Fields' colleagues and friends",
}

@Book{Rifkin:1988:UES,
  author =       "Glenn Rifkin and George Harrar",
  title =        "The ultimate entrepreneur: the story of {Ken Olsen}
                 and {Digital Equipment Corporation}",
  publisher =    "Contemporary Books",
  address =      "Chicago, IL, USA",
  pages =        "xii + 332",
  year =         "1988",
  ISBN =         "0-8092-4559-0",
  ISBN-13 =      "978-0-8092-4559-8",
  LCCN =         "HD9696.C62 O487 1988",
  bibdate =      "Thu Aug 29 14:51:52 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Olsen, Kenneth H; Industrialists; united States;
                 Biography; Computer industry; History",
}

@Book{Rifkin:1990:UES,
  author =       "Glenn Rifkin and George Harrar",
  title =        "The ultimate entrepreneur: the story of {Ken Olsen}
                 and {Digital Equipment Corporation}",
  publisher =    pub-PRIMA,
  address =      pub-PRIMA:adr,
  edition =      "Updated",
  pages =        "xii + 336",
  year =         "1990",
  ISBN =         "1-55958-022-4",
  ISBN-13 =      "978-1-55958-022-9",
  LCCN =         "HD9696.C62 O487 1990",
  bibdate =      "Thu Aug 29 14:51:52 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  price =        "US\$10.95",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Olsen, Kenneth H; Industrialists; United States;
                 Biography; Computer industry; History",
}

@Book{Rigden:2005:ESG,
  author =       "John S. Rigden",
  title =        "{Einstein 1905}: the standard of greatness",
  publisher =    pub-HARVARD,
  address =      pub-HARVARD:adr,
  pages =        "ix + 173",
  year =         "2005",
  ISBN =         "0-674-02104-5 (paperback), 0-674-04275-1 (e-book)",
  ISBN-13 =      "978-0-674-02104-4 (paperback), 978-0-674-04275-9
                 (e-book)",
  LCCN =         "QC16.E5 R54 2005",
  bibdate =      "Wed Sep 28 05:26:25 MDT 2005",
  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 =     "For Albert Einstein, 1905 was a remarkable year. It
                 was also a miraculous year for the history and future
                 of science. In six short months, from March through
                 September of that year, Einstein published five papers
                 that would transform our understanding of nature. This
                 unparalleled period is the subject of John Rigden's
                 book, which explains what distinguishes 1905 from all
                 other years in the annals of science and elevates
                 Einstein above all other scientists of the twentieth
                 century.",
  acknowledgement = ack-nhfb,
  subject =      "Einstein, Albert; Influence; Physicists; Intellectual
                 life; Quantum theory",
  subject-dates = "1879--1955",
  tableofcontents = "The standard of greatness: why Einstein? \\
                 The revolutionary quantum paper \\
                 Molecular dimensions \\
                 ``Seeing'' atoms \\
                 The merger of space and time \\
                 The most famous equation \\
                 Beyond 1905",
}

@Book{Rimmer:1993:BMG,
  author =       "Steve Rimmer",
  title =        "Bit-Mapped Graphics",
  publisher =    pub-WINDCREST,
  address =      pub-WINDCREST:adr,
  edition =      "Second",
  pages =        "ix + 484",
  year =         "1993",
  ISBN =         "0-8306-4209-9 (hardcover), 0-8306-4208-0 (paperback)",
  ISBN-13 =      "978-0-8306-4209-0 (hardcover), 978-0-8306-4208-3
                 (paperback)",
  LCCN =         "T385 .R55 1993",
  bibdate =      "Sat Feb 26 13:45:45 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Explains the TIFF (Tag Image File Format) and includes
                 sample code in C.",
  price =        "US\$26.95 (paperback), US\$38.95 (hardcover)",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

@Book{Ringholz:2002:UFS,
  author =       "Raye Carleson Ringholz",
  title =        "Uranium Frenzy: Saga of the Nuclear West",
  publisher =    "Utah State University Press",
  address =      "Logan, UT, USA",
  edition =      "Revised and expanded",
  pages =        "xiii + 344",
  year =         "2002",
  ISBN =         "0-87421-432-7 (paperback)",
  ISBN-13 =      "978-0-87421-432-1 (paperback)",
  LCCN =         "HD9539.U72 U5366 2002",
  bibdate =      "Sun Jan 18 18:13:01 MST 2015",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0809/2002009421-d.html;
                 http://www.loc.gov/catdir/toc/fy033/2002009421.html",
  acknowledgement = ack-nhfb,
  subject =      "Uranium industry; Four Corners Region; History",
  tableofcontents = "The siren call \\
                 The European experience \\
                 The dawn's early light \\
                 Deadly daughters \\
                 Bonanza at Big Indian \\
                 Uranium frenzy \\
                 Dirty Harry \\
                 The burden of proof \\
                 The future of America \\
                 The colossus of cash \\
                 Success and subpoenas \\
                 The bubble bursts \\
                 Leetso the monster that kills \\
                 The American experience \\
                 Senator Steen \\
                 A widow fights back \\
                 Full circle \\
                 A standard is set \\
                 Compassionate compensation \\
                 Aftermath",
}

@Book{Riordan:1997:CFB,
  author =       "Michael Riordan and Lillian Hoddeson",
  title =        "Crystal Fire: the Birth of the Information Age",
  publisher =    pub-NORTON,
  address =      pub-NORTON:adr,
  pages =        "x + 352",
  year =         "1997",
  ISBN =         "0-393-04124-7 (hardcover)",
  ISBN-13 =      "978-0-393-04124-8 (hardcover)",
  LCCN =         "TK7809 .R56 1997",
  bibdate =      "Sat Dec 15 10:13:36 MST 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "It is hard to imagine any device more crucial to
                 modern life than the microchip and the transistor from
                 which it sprang. Every waking hour people of the world
                 take their vast benefits for granted --- in cellular
                 phones, ATMs, wrist watches, calculators, computers,
                 automobiles, radios, televisions, fax machines,
                 copiers, stoplights, and thousands of other electronic
                 devices. Without a doubt, the transistor is the most
                 important artifact of the twentieth century and the
                 ``nerve cell'' of our electronic age.
                 \booktitle{Crystal Fire} recounts the story of the
                 transistor team at Bell Labs headed up by William
                 Shockley who shared the Nobel Prize with John Bardeen
                 and Walter Brattain. While his colleagues went on to
                 other research, Shockley grew increasingly obsessed
                 with the new gadget. Eventually he formed his own firm
                 the first semiconductor company in what would become
                 Silicon Valley, spawning hundreds of other businesses
                 and a multi-billion-dollar industry. Above all,
                 \booktitle{Crystal Fire} is a tale of the human factors
                 in technology --- the pride and jealousies coupled with
                 scientific and economic aspiration that led to the
                 creation of modern microelectronics and ignited the
                 greatest technological explosion in history.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "electronics; history; transistors",
  subject =      "Bardeen, John; Transistor; Brattain, Walter H.;
                 Shockley, William; Electronics; History; Transistors;
                 {\'E}lectronique; Histoire; Electronics; Transistors;
                 Transistoren; Halfgeleiders; Micro-elektronica;
                 Erfindung; Geschichte; Transistor; eletr{\^o}nica
                 (hist{\'o}ria)",
  tableofcontents = "Dawn of an age \\
                 Born with the century \\
                 The revolution within \\
                 Industrial strength science \\
                 The physics of dirt \\
                 The fourth column \\
                 Point of entry \\
                 Minority views \\
                 The daughter of invention \\
                 Spreading the flames \\
                 California dreaming \\
                 The monolithic idea",
}

@Article{Ritchie:time-sharing74,
  author =       "Dennis W. Ritchie and Ken Thompson",
  title =        "The {UNIX} Time-Sharing System",
  journal =      j-CACM,
  volume =       "17",
  number =       "7",
  pages =        "365--375",
  month =        jul,
  year =         "1974",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{Ritchie:time-sharing79,
  author =       "Dennis W. Ritchie and Ken Thompson",
  booktitle =    "{UNIX} Programmer's Manual",
  title =        "The {UNIX} Time-Sharing System",
  volume =       "2",
  publisher =    pub-HRW,
  address =      pub-HRW:adr,
  pages =        "20--35",
  year =         "1979",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Roads:1987:FCM,
  editor =       "Curtis Roads and John Strawn",
  title =        "Foundations of Computer Music",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "xiii + 712",
  year =         "1987",
  ISBN =         "0-262-18114-2",
  ISBN-13 =      "978-0-262-18114-3",
  LCCN =         "ML1092 .F7 1985",
  bibdate =      "Wed Dec 15 10:41:13 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Robbins:1996:EAP,
  author =       "Arnold Robbins",
  title =        "Effective {AWK} Programming: a User's Guide for {GNU
                 AWK}",
  publisher =    pub-SSC,
  address =      pub-SSC:adr,
  pages =        "viii + 322",
  year =         "1996",
  ISBN =         "0-916151-88-3",
  ISBN-13 =      "978-0-916151-88-1",
  LCCN =         "QA76.73.A95 R63 1996",
  bibdate =      "Wed Nov 13 15:05:01 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/gnu.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$27.00",
  URL =          "http://www.ssc.com/ssc/eap/",
  acknowledgement = ack-nhfb,
}

@Book{Robbins:1996:PUP,
  author =       "Kay A. Robbins and Steven Robbins",
  title =        "Practical {UNIX} Programming: a Guide to Concurrency,
                 Communication, and Multithreading",
  publisher =    pub-PHPTR,
  address =      pub-PHPTR:adr,
  pages =        "xiv + 658",
  year =         "1996",
  ISBN =         "0-13-443706-3",
  ISBN-13 =      "978-0-13-443706-4",
  LCCN =         "QA76.76.O63 R615 1996",
  bibdate =      "Tue May 25 07:14:38 MDT 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "Learn how to use communication, concurrency, and
                 multithreading in realistic applications. Learn the
                 difficult art of testing concurrent programs. Practical
                 UNIX Programming even offers simplified libraries you
                 can use in your own network communication applications.
                 In a world of networks, multiprocessor systems, and
                 client-server applications, the techniques covered here
                 have become critical to UNIX software development. This
                 book won't just help you master those techniques, it
                 will serve as an excellent reference for years to
                 come.",
  acknowledgement = ack-nhfb,
  keywords =     "microcomputers -- programming; UNIX (computer file)",
  libnote =      "Not in my library.",
  tableofcontents = "I. Fundamentals \\
                 1. What Is Concurrency? \\
                 2. Programs and Processes \\
                 3. Files \\
                 4. Project: The Token Ring \\
                 II. Asynchronous Events \\
                 5. Signals \\
                 6. Project: Timers \\
                 7. Project: Cracking Shells \\
                 III. Concurrency \\
                 8. Critical Sections and Semaphores \\
                 9. POSIX Threads \\
                 10. Thread Synchronization \\
                 11. Project: The Not Too Parallel Virtual Machine \\
                 IV. Communication \\
                 12. Client-Server Communication \\
                 13. Project: Internet Radio \\
                 14. Remote Procedure Calls \\
                 15. Project: Tuple Space \\
                 A UNIX Fundamentals \\
                 B UICI Implementation",
}

@Book{Robbins:1997:EAP,
  author =       "Arnold Robbins",
  title =        "Effective {AWK} Programming",
  publisher =    pub-SSC,
  address =      pub-SSC:adr,
  edition =      "Second",
  pages =        "x + 322",
  year =         "1997",
  ISBN =         "1-57831-000-8",
  ISBN-13 =      "978-1-57831-000-5",
  LCCN =         "QA76.73.A95 R63 1997",
  bibdate =      "Thu Feb 18 13:49:27 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$27.00",
  URL =          "http://www.ssc.com/ssc/eap/",
  acknowledgement = ack-nhfb,
}

@Book{Robbins:1999:UND,
  author =       "Arnold Robbins",
  title =        "{UNIX} in a Nutshell: a Desktop Quick Reference for
                 {SVR4} and {Solaris 7}",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  edition =      "Third",
  pages =        "xvi + 598",
  year =         "1999",
  ISBN =         "1-56592-427-4 (paperback)",
  ISBN-13 =      "978-1-56592-427-7 (paperback)",
  LCCN =         "QA76.76.O63 R623 1999",
  bibdate =      "Wed Nov 17 09:10:28 1999",
  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;
                 http://www.oreilly.com/catalog/",
  price =        "US\$24.95",
  URL =          "http://www.oreilly.com/catalog/unixnut3",
  abstract =     "\booktitle{Unix in a Nutshell} includes thorough
                 coverage of Unix System V Release 4 and Solaris 7.
                 Author Arnold Robbins has added the latest information
                 about: sixty new Unix commands; shell syntax (sh, csh,
                 and the 1988 and 1993 versions of ksh); regular
                 expressions; vi and ex commands, as well as newly
                 updated Emacs information; sed and awk commands; troff
                 and related commands and macros, with a new section on
                 refer; make, RCS (Version 5.7), and SCCS commands; and
                 obsolete commands. In addition, there is a new Unix
                 bibliography to guide the reader to further reading
                 about the Unix environment. If you currently use Unix
                 SVR4, or if you're a Solaris user, you'll want this
                 book.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Part I: Commands and Shells \\
                 1: Introduction \\
                 2: Unix Commands \\
                 3: The Unix Shell: An Overview \\
                 4: The Bourne Shell and Korn Shell \\
                 5: The C Shell \\
                 Part II: Text Editing and Processing \\
                 6: Pattern Matching \\
                 7: The Emacs Editor \\
                 8: The vi Editor \\
                 9: The ex Editor \\
                 10: The sed Editor \\
                 11: The awk Programming Language \\
                 Part III: Text Formatting \\
                 12: nroff and troff \\
                 13: mm Macros \\
                 14: ms Macros \\
                 15: me Macros \\
                 16: man Macros \\
                 17: troff Preprocessors \\
                 Part IV: Software Development \\
                 18: The Source Code Control System \\
                 19: The Revision Control System \\
                 20: The make Utility \\
                 Appendix A: ASCII Character Set \\
                 Appendix B: Obsolete Commands",
}

@Book{Robbins:2001:EAP,
  author =       "Arnold Robbins",
  title =        "Effective {AWK} Programming",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  edition =      "Third",
  pages =        "xxiv + 421",
  year =         "2001",
  ISBN =         "0-596-00070-7 (paperback), 0-596-80537-3 (e-book)",
  ISBN-13 =      "978-0-596-00070-7 (paperback), 978-0-596-80537-1
                 (e-book)",
  LCCN =         "QA76.73.A95 R63 2001",
  bibdate =      "Fri Sep 28 14:47:35 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/css.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/ora.bib",
  price =        "US\$39.95",
  URL =          "http://www.oreilly.com/catalog/awkprog3/",
  abstract =     "\booktitle{Effective awk Programming}, 3rd Edition,
                 focuses entirely on awk, exploring it in the greatest
                 depth of the three awk titles we carry. It's an
                 excellent companion piece to the more broadly focused
                 second edition. This book provides complete coverage of
                 the gawk 3.1 language as well as the most up-to-date
                 coverage of the POSIX standard for awk available
                 anywhere. Author Arnold Robbins clearly distinguishes
                 standard awk features from GNU awk (gawk)-specific
                 features, shines light into many of the ``dark
                 corners'' of the language (areas to watch out for when
                 programming), and devotes two full chapters to example
                 programs. A brand new chapter is devoted to TCP/IP
                 networking with gawk. He includes a summary of how the
                 awk language evolved.",
  acknowledgement = ack-nhfb,
  tableofcontents = "I: The awk Language and gawk \\
                 1: Getting Started with awk \\
                 2: Regular Expressions \\
                 3: Reading Input Files \\
                 4: Printing Output \\
                 5: Expressions \\
                 6: Patterns, Actions, and Variables \\
                 7: Arrays in awk \\
                 8: Functions \\
                 9: Internationalization with gawk \\
                 10: Advanced Features of gawk \\
                 11: Running awk and gawk \\
                 II: Using awk and gawk \\
                 12: A Library of awk Functions \\
                 13: Practical awk Programs \\
                 14: Internetworking with gawk \\
                 Appendix A: The Evolution of the awk Language",
}

@Book{Robbins:2003:USP,
  author =       "Kay A. Robbins and Steven Robbins",
  title =        "{UNIX} Systems Programming: Communication,
                 Concurrency, and Threads",
  publisher =    pub-PHPTR,
  address =      pub-PHPTR:adr,
  edition =      "Second",
  pages =        "xvii + 893",
  year =         "2003",
  ISBN =         "0-13-042411-0 (hardcover)",
  ISBN-13 =      "978-0-13-042411-2 (hardcover)",
  LCCN =         "QA76.76.O63 R6215 2003",
  bibdate =      "Wed Aug 20 21:08:15 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "This second edition of ``\booktitle{Unix Systems
                 Programming}'' shows how to design complex software to
                 help get the best from the UNIX operating system.",
  acknowledgement = ack-nhfb,
  annote =       "See \cite{Robbins:1996:PUP} for first edition.",
  keywords =     "operating systems (computers); UNIX (computer file)",
  tableofcontents = "I: Fundamentals \\
                 1: Technology's Impact on Programs \\
                 2: Programs, Processes and Threads \\
                 3: Processes in UNIX \\
                 4: Unix I/O \\
                 5: Files and Directories \\
                 6: UNIX Special Files \\
                 7: Project: The Token Ring \\
                 II: Asynchronous Events \\
                 8: Signals \\
                 9: Times and Timers \\
                 10: Project: Virtual Timers \\
                 11: Project: Cracking Shells \\
                 III: Concurrency \\
                 12: POSIX Threads \\
                 13: Thread Synchronization \\
                 14: Critical Sections and Semaphores \\
                 15: POSIX IPC \\
                 16: Project: Producer Consumer Synchronization \\
                 17: Project: The Not Too Parallel Virtual Machine \\
                 IV: Communication \\
                 18: Connection-Oriented Communication \\
                 19: Project: WWW Redirection \\
                 20: Connectionless Communication and Multicast \\
                 21: Project: Internet Radio \\
                 22: Project: Server Performance \\
                 Appendix A: UNIX Fundamentals \\
                 Appendix B: Restart Library \\
                 Appendix C: UICI Implementation \\
                 Appendix D: Logging Functions \\
                 Appendix E: POSIX Extensions",
}

@Book{Robbins:2004:LPE,
  author =       "Arnold Robbins",
  title =        "{Linux} Programming by Example: The Fundamentals",
  publisher =    pub-PHPTR,
  address =      pub-PHPTR:adr,
  pages =        "xxxii + 687",
  year =         "2004",
  ISBN =         "0-13-142964-7",
  ISBN-13 =      "978-0-13-142964-2",
  LCCN =         "QA76.76.O63 R568 2004",
  bibdate =      "Tue May 18 14:39:49 2004",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/linux.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  price =        "US\$39.99, CAN\$57.99",
  abstract =     "This book teaches Linux programming in the most
                 effective way possible: by showing and explaining
                 well-written programs. Drawing from both V7 Unix and
                 GNU source code, Arnold Robbins focuses on the
                 fundamental system call APIs at the core of any
                 significant program, presenting examples from programs
                 that Linux/Unix users already use every day. Gradually,
                 one step at a time, Robbins teaches both high-level
                 principles and under the hood techniques. Along the
                 way, he carefully addresses real world issues like
                 performance, portability, and robustness.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Part I: Files and users \\
                 1: Introduction \\
                 2: Arguments, options, and the environment \\
                 3: User-level memory management \\
                 4: Files and file I/O \\
                 5: Directories and file metadata \\
                 6: General library interfaces \\
                 part 1 \\
                 7: Putting it all together: {\tt ls} \\
                 8: Filesystems and directory walks \\
                 Part II: Processes, IPC, and internationalization \\
                 9: Process management and pipes \\
                 10: Signals \\
                 11: Permissions and user and group ID numbers \\
                 12: General library interfaces \\
                 part 2 \\
                 13: Internationalization and localization \\
                 14: Extended interfaces \\
                 Part III: Debugging and final project \\
                 15: Debugging \\
                 16: project that ties everything together \\
                 Part IV: Appendixes \\
                 Appendix A: Teach yourself programming in ten years \\
                 Appendix B: Caldera ancient UNIX license \\
                 Appendix C: GNU general public license",
}

@Book{Robbins:2005:CSS,
  author =       "Arnold Robbins and Nelson H. F. Beebe",
  title =        "Classic Shell Scripting",
  publisher =    pub-ORA-MEDIA,
  address =      pub-ORA-MEDIA:adr,
  pages =        "xxii + 534",
  year =         "2005",
  ISBN =         "0-596-00595-4, 0-596-51744-0 (e-book), 0-596-55526-1
                 (e-book)",
  ISBN-13 =      "978-0-596-00595-5, 978-0-596-51744-1 (e-book),
                 978-0-596-55526-9 (e-book)",
  LCCN =         "QA76.76.O63 R633 2005",
  bibdate =      "Tue Jul 12 16:13:16 2005",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/beebe-nelson-h-f.bib;
                 https://www.math.utah.edu/pub/tex/bib/css.bib;
                 https://www.math.utah.edu/pub/tex/bib/linux.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/mathcw.bib;
                 https://www.math.utah.edu/pub/tex/bib/ora.bib;
                 https://www.math.utah.edu/pub/tex/bib/spell.bib;
                 https://www.math.utah.edu/pub/tex/bib/string-matching.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib;
                 https://www.math.utah.edu/pub/tex/bib/utah-math-dept-books.bib",
  note =         "Also available in Chinese \cite{Robbins:2008:SJB},
                 French \cite{Robbins:2005:ISS}, German
                 \cite{Robbins:2006:KSP}, Japanese
                 \cite{Robbins:2006:SSS}, and Polish
                 \cite{Robbins:2006:PSP} translations.",
  URL =          "http://www.oreilly.com/catalog/shellsrptg/",
  acknowledgement = ack-nhfb,
  ORCID-numbers = "Beebe, Nelson H. F./0000-0001-7281-4263",
  tableofcontents = "Foreword / ix \\
                 Preface / xi \\
                 1 Background / 1 \\
                 1.1 Unix History / 1 \\
                 1.2 Software Tools Principles / 4 \\
                 1.3 Summary / 6 \\
                 2 Getting Started / 8 \\
                 2.1 Scripting Languages Versus Compiled Languages / 8
                 \\
                 2.2 Why Use a Shell Script? / 9 \\
                 2.3 A Simple Script / 9 \\
                 2.4 Self-Contained Scripts: The \#! First Line / 10 \\
                 2.5 Basic Shell Constructs / 12 \\
                 2.6 Accessing Shell Script Arguments / 23 \\
                 2.7 Simple Execution Tracing / 24 \\
                 2.8 Internationalization and Localization / 25 \\
                 2.9 Summary / 28 \\
                 3 Searching and Substitutions / 30 \\
                 3.1 Searching for Text / 30 \\
                 3.2 Regular Expressions / 31 \\
                 3.3 Working with Fields / 56 \\
                 3.4 Summary / 65 \\
                 4 Text Processing Tools / 67 \\
                 4.1 Sorting Text / 67 \\
                 4.2 Removing Duplicates / 75 \\
                 4.3 Reformatting Paragraphs / 76 \\
                 4.4 Counting Lines, Words, and Characters / 77 \\
                 4.5 Printing / 78 \\
                 4.6 Extracting the First and Last Lines / 83 \\
                 4.7 Summary / 86 \\
                 5 Pipelines Can Do Amazing Things / 87 \\
                 5.1 Extracting Data from Structured Text Files / 87 \\
                 5.2 Structured Data for the Web / 94 \\
                 5.3 Cheating at Word Puzzles / 100 \\
                 5.4 Word Lists / 102 \\
                 5.5 Tag Lists / 105 \\
                 5.6 Summary / 107 \\
                 6 Variables, Making Decisions, and Repeating Actions /
                 109 \\
                 6.1 Variables and Arithmetic / 109 \\
                 6.2 Exit Statuses / 120 \\
                 6.3 The case Statement / 129 \\
                 6.4 Looping / 130 \\
                 6.5 Functions / 135 \\
                 6.6 Summary / 138 \\
                 7 Input and Output, Files, and Command Evaluation / 140
                 \\
                 7.1 Standard Input, Output, and Error / 140 \\
                 7.2 Reading Lines with read / 140 \\
                 7.3 More About Redirections / 143 \\
                 7.4 The Full Story on printf / 147 \\
                 7.5 Tilde Expansion and Wildcards / 152 \\
                 7.6 Command Substitution / 155 \\
                 7.7 Quoting / 161 \\
                 7.8 Evaluation Order and eval / 162 \\
                 7.9 Built-in Commands / 168 \\
                 7.10 Summary / 175 \\
                 8 Production Scripts / 177 \\
                 8.1 Path Searching / 177 \\
                 8.2 Automating Software Builds / 192 \\
                 8.3 Summary / 222 \\
                 9 Enough awk to Be Dangerous / 223 \\
                 9.1 The awk Command Line / 224 \\
                 9.2 The awk Programming Model / 225 \\
                 9.3 Program Elements / 226 \\
                 9.4 Records and Fields / 236 \\
                 9.5 Patterns and Actions / 238 \\
                 9.6 One-Line Programs in awk / 240 \\
                 9.7 Statements / 244 \\
                 9.8 User-Defined Functions / 252 \\
                 9.9 String Functions / 255 \\
                 9.10 Numeric Functions / 264 \\
                 9.11 Summary / 266 \\
                 10 Working with Files / 267 \\
                 10.1 Listing Files / 267 \\
                 10.2 Updating Modification Times with touch / 273 \\
                 10.3 Creating and Using Temporary Files / 274 \\
                 10.4 Finding Files / 279 \\
                 10.5 Running Commands: xargs / 293 \\
                 10.6 Filesystem Space Information / 295 \\
                 10.7 Comparing Files / 299 \\
                 10.8 Summary / 307 \\
                 11 Extend Example: Merging User Databases / 308 \\
                 11.1 The Problem / 308 \\
                 11.2 The Password Files / 309 \\
                 11.3 Merging Password Files / 310 \\
                 11.4 Changing File Ownership / 317 \\
                 11.5 Other Real-World Issues / 321 \\
                 11.6 Summary / 323 \\
                 12 Spellchecking / 325 \\
                 12.1 The spell Program / 325 \\
                 12.2 The Original Unix Spellchecking Prototype / 326
                 \\
                 12.3 Improving ispell and aspell / 327 \\
                 12.4 A Spellchecker in awk / 331 \\
                 12.5 Summary / 350 \\
                 13 Processes / 352 \\
                 13.1 Process Creation / 353 \\
                 13.2 Process Listing / 354 \\
                 13.3 Process Control and Deletion / 360 \\
                 13.4 Process System-Call Tracing / 368 \\
                 13.5 Process Accounting / 372 \\
                 13.6 Delayed Scheduling of Processes / 373 \\
                 13.7 The /proc Filesystem / 378 \\
                 13.8 Summary / 379 \\
                 14 Shell Portability Issues and Extensions / 381 \\
                 14.1 Gotchas / 381 \\
                 14.2 The bash shopt Command / 385 \\
                 14.3 Common Extensions / 389 \\
                 14.4 Download Information / 402 \\
                 14.5 Other Extended Bourne-Style Shells / 405 \\
                 14.6 Shell Versions / 405 \\
                 14.7 Shell Initialization and Termination / 406 \\
                 14.8 Summary / 412 \\
                 15 Secure Shell Scripts: Getting Started / 413 \\
                 15.1 Tips for Secure Shell Scripts / 413 \\
                 15.2 Restricted Shell / 416 \\
                 15.3 Trojan Horses / 418 \\
                 15.4 Setuid Shell Scripts: A Bad Idea / 419 \\
                 15.5 ksh93 and Privileged Mode / 21 \\
                 15.6 Summary / 422 \\
                 A Writing Manual Pages / 423 \\
                 B Files and Filesystems / 437 \\
                 C Important Unix Commands / 473 \\
                 Bibliography / 478 \\
                 Glossary / 484 \\
                 Index / 509",
}

@Book{Robbins:2005:GPG,
  author =       "Arnold Robbins",
  title =        "{GDB} Pocket Guide",
  publisher =    pub-ORA-MEDIA,
  address =      pub-ORA-MEDIA:adr,
  pages =        "v + 69",
  year =         "2005",
  ISBN =         "0-596-10027-2 (paperback), 0-596-52866-3 (e-book),
                 0-596-55335-8 (e-book)",
  ISBN-13 =      "978-0-596-10027-8 (paperback), 978-0-596-52866-9
                 (e-book), 978-0-596-55335-7 (e-book)",
  LCCN =         "QA76.9.D43 R63 2005",
  bibdate =      "Thu May 19 14:28:52 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 prodorbis.library.yale.edu:7090/voyager",
  price =        "US\$9.95, CAN\$13.95",
  abstract =     "In the open source and free software worlds, GDB, or
                 the GNU Debugger, is the standard debugger. It ships
                 with all BSD and GNU/Linux systems, and compiles and
                 works `out of the box' on just about every other kind
                 of commercial Unix system. (It even works on Microsoft
                 Windows systems!) Despite GDB's popularity, until now
                 there hasn't been a brief guide or a quick reference to
                 its many features. The GDB Pocket Reference fills this
                 gap. It's designed so that you can look up features
                 quickly and effectively. If you aren't a fluent user of
                 GDB, the GDB Pocket Reference will show you what this
                 debugger is capable of doing. If you are fluent, this
                 book will keep the information you need right at your
                 fingertips - without cluttering up either your physical
                 or virtual desktop.'",
  acknowledgement = ack-nhfb,
  tableofcontents = "Command-line syntax \\
                 Initialization files \\
                 GDB expressions \\
                 The GDB text user interface \\
                 Group listing of GDB commands \\
                 Summary of set and show commands \\
                 Summary of the info command \\
                 Alphabetical summary of GDB commands",
}

@Book{Robbins:2005:ISS,
  author =       "Arnold Robbins and Nelson H. F. Beebe",
  title =        "Introduction aux scripts shell",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xxii + 558",
  year =         "2005",
  ISBN =         "2-84177-375-2",
  ISBN-13 =      "978-2-84177-375-6",
  LCCN =         "????",
  bibdate =      "Mon Feb 27 11:35:14 MST 2006",
  bibsource =    "carmin.sudoc.abes.fr:210/ABES-Z39-PUBLIC;
                 https://www.math.utah.edu/pub/bibnet/authors/b/beebe-nelson-h-f.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib;
                 https://www.math.utah.edu/pub/tex/bib/utah-math-dept-books.bib",
  note =         "French translation of \cite{Robbins:2005:CSS} by Eric
                 Jacoboni.",
  URL =          "http://www.silicon.fr/getarticle.asp?id=14015",
  acknowledgement = ack-nhfb,
  language =     "French",
  ORCID-numbers = "Beebe, Nelson H. F./0000-0001-7281-4263",
  tableofcontents = "Fondements \\
                 Recherches et substitutions \\
                 Outils pour traiter le texte \\
                 De la puissance des pipes \\
                 Variables, structures conditionnelles et boucles \\
                 Entr{\'e}es, sorties, fichiers et {\'e}valuation des
                 commandes \\
                 Scripts en production \\
                 Pr{\'e}sentation de awk \\
                 Les fichiers \\
                 Fusionner des bases de donn{\'e}es utilisateurs \\
                 V{\'e}rification orthographique \\
                 Processus \\
                 Portabilit{\'e} du shell et extensions \\
                 Introduction aux scripts shell s{\'e}curis{\'e}s",
}

@Book{Robbins:2005:UN,
  author =       "Arnold Robbins",
  title =        "{Unix} in a Nutshell",
  publisher =    pub-ORA-MEDIA,
  address =      pub-ORA-MEDIA:adr,
  edition =      "Fourth",
  pages =        "xviii + 885",
  year =         "2005",
  ISBN =         "0-596-10029-9 (paperback), 0-596-52948-1 (e-book),
                 1-4493-9114-1 (e-book)",
  ISBN-13 =      "978-0-596-10029-2 (paperback), 978-0-596-52948-2
                 (e-book), 978-1-4493-9114-0 (e-book)",
  LCCN =         "QA76.76.O63 R63 2005",
  bibdate =      "Mon Nov 21 12:08:47 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$34.95, CAN\$48.95, UK\pounds 24.95",
  URL =          "http://www.oreilly.com/catalog/unixnut4/index.html",
  acknowledgement = ack-nhfb,
  tableofcontents = "Introduction \\
                 Unix commands \\
                 The Unix shell: an overview \\
                 The Bash and Korn shells \\
                 tcsh: an extended C shell \\
                 Package management \\
                 Pattern matching \\
                 The Emacs editor \\
                 The vi, ex, and vim editors \\
                 The sed editor \\
                 The awk programming language \\
                 Source code management: an overview \\
                 The revision control system \\
                 The concurrent versions system \\
                 The subversion version control system \\
                 The GNU make utility \\
                 The GDB debugger \\
                 Writing manual pages",
}

@Book{Robbins:2006:KSP,
  author =       "Arnold Robbins and Nelson H. F. Beebe",
  title =        "{Klassische Shell-Programmierung: [automatisieren Sie
                 Ihre Unix\slash Linux-Tasks]}. ({German}) [{Classic}
                 Shell Scripting: [automating your Unix\slash Linux
                 jobs]]",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xxiii + 572",
  year =         "2006",
  ISBN =         "3-89721-441-5",
  ISBN-13 =      "978-3-89721-441-5",
  LCCN =         "QA76.76.O63 R563 2005",
  bibdate =      "Tue Dec 23 09:41:24 MST 2008",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/beebe-nelson-h-f.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/utah-math-dept-books.bib;
                 z3950.gbv.de:20011/gvk",
  note =         "German translation of \cite{Robbins:2005:CSS} by
                 Kathrin Lichtenberg.",
  price =        "EUR 44.00; EUR 45.65 (AT)",
  URL =          "http://www.gbv.de/dms/hebis-darmstadt/toc/17645067X.pdf",
  acknowledgement = ack-nhfb,
  language =     "German",
  ORCID-numbers = "Beebe, Nelson H. F./0000-0001-7281-4263",
  subject =      "SHELL <Programmiersprache>; Skript <Programm>; UNIX",
  tableofcontents = "Vorwort / ix \\
                 Einf{\"u}hrung / xi \\
                 1 Hintergrund / 1 \\
                 1.1 Unix-Geschichte / 1 \\
                 1.2 Prinzipien f{\"u}r Software-Werkzeuge / 4 \\
                 1.3 Zusammenfassung / 7 \\
                 2 Zum Einstieg / 8 \\
                 2.1 Skriptsprachen im Vergleich mit kompilierten
                 Sprachen / 8 \\
                 2.2 Wozu ein Shell-Skript einsetzen? / 9 \\
                 2.3 Ein einfaches Skript / 9 \\
                 2.4 Eigenst{\"a}ndige Skripten: #! in der ersten Zeile
                 / 10 \\
                 2.5 Grundlegende Shell-Konstrukte / 13 \\
                 2.6 Auf Shell-Skript-Argumente zugreifen / 24 \\
                 2.7 Einfache {\"U}berwachung der Ausf{\"u}hrung / 26
                 \\
                 2.8 Internationalisierung und Lokalisierung / 26 \\
                 2.9 Zusammenfassung / 30 \\
                 3 Suchen und Ersetzen / 32 \\
                 3.1 Nach Text suchen / 32 \\
                 3.2 Regul{\"a}re Ausdr{\"u}cke / 35 \\
                 3.3 Mit Feldern arbeiten / 60 \\
                 3.4 Zusammenfassung / 69 \\
                 4 Werkzeuge zur Textverarbeitung / 71 \\
                 4.1 Text sortieren / 71 \\
                 4.2 Duplikate l{\"o}schen / 80 \\
                 4.3 Abs{\"a}tze umformatieren / 81 \\
                 4.4 Zeilen, W{\"o}rter und Zeichen z{\"a}hlen / 82 \\
                 4.5 Drucken / 83 \\
                 4.6 Die erste und die letzte Zeile extrahieren / 88 \\
                 4.7 Zusammenfassung / 91 \\
                 5 Mit Pipelines erstaunliches leisten / 92 \\
                 5.1 Daten aus strukturierten Textdateien extrahieren /
                 92 \\
                 5.2 Strukturierte Daten f{\"u}r das Web / 100 \\
                 5.3 Beim Kreuzwortr{\"a}tsel schummeln / 106 \\
                 5.4 Wortlisten / 108 \\
                 5.5 Tag-Listen / 111 \\
                 5.6 Zusammenfassung / 114 \\
                 6 Variablen, Entscheidungen treffen und Aktionen
                 wiederholen / 116 \\
                 6.1 Variablen und Arithmetik / 116 \\
                 6.2 Exit-Status / 128 \\
                 6.3 Die case-Anweisung / 137 \\
                 6.4 Schleifen / 138 \\
                 6.5 Funktionen / 144 \\
                 6.6 Zusammenfassung / 147 \\
                 7 Eingabe und Ausgabe, Dateien und Befehlsauswertung /
                 149 \\
                 7.1 Standardeingabe, Standardausgabe und
                 Standardfehlerausgabe / 149 \\
                 7.2 Zeilen lesen mit read / 150 \\
                 7.3 Mehr {\"u}ber Umleitungen / 152 \\
                 7.4 Die vollst{\"a}ndige Geschichte von printf / 157
                 \\
                 7.5 Tilde-Erweiterung und Wildcards / 162 \\
                 7.6 Befehlsersetzung / 166 \\
                 7.7 Quotierung / 172 \\
                 7.8 Auswertungsreihenfolge und eval / 173 \\
                 7.9 Integrierte Befehle / 179 \\
                 7.10 Zusammenfassung / 187 \\
                 8 Produktionsskripten / 189 \\
                 8.1 Pfadsuche / 189 \\
                 8.2 Software-Builds automatisieren / 205 \\
                 8.3 Zusammenfassung / 236 \\
                 awk bis zum Abwinken / 237 \\
                 9.1 Die awk-Kommandozeile / 238 \\
                 9.2 Das awk-Programmiermodell / 239 \\
                 9.3 Programm-Elemente / 240 \\
                 9.4 Datens{\"a}tze und Felder / 251 \\
                 9.5 Muster und Aktionen / 254 \\
                 9.6 Einzeilige Programme in awk / 256 \\
                 9.7 Anweisungen / 259 \\
                 9.8 Benutzerdefinierte Funktionen / 269 \\
                 9.9 Stringfunktionen / 272 \\
                 9.10 Numerische Funktionen / 281 \\
                 9.11 Zusammenfassung / 283 \\
                 10 Arbeiten mit Dateien / 284 \\
                 10.1 Dateien auflisten / 284 \\
                 10.2 {\"A}nderungsdaten mit touch aktualisieren / 290
                 \\
                 10.3 Tempor{\"a}re Dateien erzeugen und verwenden / 292
                 \\
                 10.4 Dateien suchen / 297 \\
                 10.5 Befehle ausf{\"u}hren: xargs / 313 \\
                 10.6 Informationen {\"u}ber den Speicherplatz im
                 Dateisystem / 314 \\
                 10.7 Dateien vergleichen / 319 \\
                 10.8 Zusammenfassung / 327 \\
                 11 Ein ausf{\"u}hrliches Beispiel: Das
                 Zusammenf{\"u}hren von Benutzerdatenbanken / 329 \\
                 11.1 Das Problem / 329 \\
                 11.2 Die Passwortdateien / 330 \\
                 11.3 Zusammenf{\"u}hren von Passwortdateien / 331 \\
                 11.4 {\"A}ndern der Datei-Eigent{\"u}merschaft / 339
                 \\
                 11.5 Andere Probleme aus dem wirklichen Leben / 343 \\
                 11.6 Zusammenfassung / 345 \\
                 12 Rechtschreibpr{\"u}fung / 347 \\
                 12.1 Das Programm spell / 347 \\
                 12.2 Der Original-Unix-Prototyp zur
                 Rechtschreibpr{\"u}fung / 348 \\
                 12.3 Verbesserungen mit ispell und aspell / 350 \\
                 12.4 Eine Rechtschreibpr{\"u}fung in awk / 353 \\
                 12.5 Zusammenfassung / 374 \\
                 13 Prozesse / 375 \\
                 13.1 Prozesserzeugung / 376 \\
                 13.2 Prozessauflistung / 377 \\
                 13.3 Prozesssteuerung und -l{\"o}schung / 384 \\
                 13.4 Verfolgung von Systemaufrufen / 391 \\
                 13.5 Prozess-Accounting / 396 \\
                 13.6 Verz{\"o}gerte Ausf{\"u}hrung von Prozessen / 397
                 \\
                 13.7 Das /proc-Dateisystem / 403 \\
                 13.8 Zusammenfassung / 404 \\
                 14 Fragen der Shell-Portabilit{\"a}t und Erweiterungen
                 / 406 \\
                 14.1 Stolpersteine / 406 \\
                 14.2 Der bash-Befehl shopt / 410 \\
                 14.3 Gebr{\"a}uchliche Erweiterungen / 414 \\
                 14.4 Download-Informationen / 428 \\
                 14.5 Andere erweiterte Shells im Bourne-Stil / 431 \\
                 14.6 Shell-Versionen / 431 \\
                 14.7 Shell-Initialisierung und -Beendigung / 432 \\
                 14.8 Zusammenfassung / 438 \\
                 15 Sichere Shell-Skripten: Ein Einstieg / 440 \\
                 15.1 Tipps f{\"u}r sichere Shell-Skripten / 440 \\
                 15.2 Eingeschr{\"a}nkte Shell / 443 \\
                 15.3 Trojanische Pferde / 445 \\
                 15.4 Setuid bei Shell-Skripten: Eine schlechte Idee /
                 446 \\
                 15.5 ksh93 und privilegierter Modus / 448 \\
                 15.6 Zusammenfassung / 449 \\
                 A Manpages schreiben / 451 \\
                 B Dateien und Dateisysteme / 466 \\
                 C Wichtige Unix-Befehle / 505 \\
                 Bibliografie / 511 \\
                 Glossar / 517 \\
                 Index / 545",
}

@Book{Robbins:2006:PSP,
  author =       "Arnold Robbins and Nelson H. F. Beebe",
  title =        "Programowanie skrypt{\'o}w pow{\l}oki",
  publisher =    "Helion",
  address =      "Gliwice, Poland",
  pages =        "557 + 2",
  year =         "2006",
  ISBN =         "83-246-0131-7",
  ISBN-13 =      "978-83-246-0131-8",
  LCCN =         "????",
  bibdate =      "Mon Feb 27 11:35:14 MST 2006",
  bibsource =    "alpha.bn.org.pl:210/INNOPAC;
                 https://www.math.utah.edu/pub/bibnet/authors/b/beebe-nelson-h-f.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib;
                 https://www.math.utah.edu/pub/tex/bib/utah-math-dept-books.bib",
  note =         "Polish translation of \cite{Robbins:2005:CSS} by
                 Przemys{\l}aw Szeremiota.",
  URL =          "http://www.empik.com/b/o/19/f1/19f16b85e0d75ae1d3a1e7062569fbb0.jpg;
                 http://www.empik.com/programowanie-skryptow-powloki-ksiazka,360529,p",
  acknowledgement = ack-nhfb,
  language =     "Polish",
  ORCID-numbers = "Beebe, Nelson H. F./0000-0001-7281-4263",
}

@Book{Robbins:2006:SSS,
  author =       "Arnold Robbins and Nelson H. F. Beebe",
  title =        "Sh{\=o}kai shieru sukuriputo",
  publisher =    "Orair{\=\i} Japan",
  address =      "T{\=o}ky{\=o}, Japan",
  pages =        "345",
  year =         "2006",
  ISBN =         "4-87311-267-2",
  ISBN-13 =      "978-4-87311-267-1",
  LCCN =         "????",
  bibdate =      "Fri May 1 11:47:10 MDT 2015",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/b/beebe-nelson-h-f.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib;
                 https://www.math.utah.edu/pub/tex/bib/utah-math-dept-books.bib",
  note =         "Japanese translation of \cite{Robbins:2005:CSS} by Aoi
                 Hy{\=u}ga.",
  acknowledgement = ack-nhfb,
  language =     "Japanese",
  ORCID-numbers = "Beebe, Nelson H. F./0000-0001-7281-4263",
}

@Book{Robbins:2008:SJB,
  author =       "Arnold Robbins and Nelson H. F. Beebe",
  title =        "{Shell} Jiao Ben Xue Xi Zhi Nan = {Shell} Script Study
                 Guide",
  publisher =    pub-ORA-MEDIA,
  address =      pub-ORA-MEDIA:adr,
  pages =        "vi + 494",
  year =         "2008",
  ISBN =         "7-111-25504-6",
  ISBN-13 =      "978-7-111-25504-8",
  LCCN =         "????",
  bibdate =      "Mon Oct 04 10:50:45 2010",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/beebe-nelson-h-f.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib;
                 https://www.math.utah.edu/pub/tex/bib/utah-math-dept-books.bib",
  note =         "Simplified Chinese translation of
                 \cite{Robbins:2005:CSS}.",
  price =        "79.00 renminbi",
  acknowledgement = ack-nhfb,
  language =     "Mandarin Chinese",
  ORCID-numbers = "Beebe, Nelson H. F./0000-0001-7281-4263",
}

@Book{Robert:1989:RRO,
  author =       "{Major Henry} M. Robert",
  title =        "{Robert}'s Rules of Order",
  publisher =    pub-BERKLEY-BOOKS,
  address =      pub-BERKLEY-BOOKS:adr,
  year =         "1989",
  ISBN =         "0-425-11690-5",
  ISBN-13 =      "978-0-425-11690-6",
  LCCN =         "JF515 .R692 1989",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Roberts:1959:NMR,
  author =       "John D. Roberts",
  title =        "Nuclear Magnetic Resonance: Applications to Organic
                 Chemistry",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "viii + 118",
  year =         "1959",
  LCCN =         "QD591 .R6 1959",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Roberts:1964:BPO,
  author =       "John D. Roberts and Marjorie C. Caserio",
  title =        "Basic Principles of Organic Chemistry",
  publisher =    pub-BENJAMIN,
  address =      pub-BENJAMIN:adr,
  pages =        "xxv + 1315",
  year =         "1964",
  LCCN =         "QD251 .R58",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Second printing, with corrections, March 5, 1965.",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Roberts:1964:SBP,
  author =       "John D. Roberts and Marjorie C. Caserio",
  title =        "Supplement for Basic Principles of Organic Chemistry",
  publisher =    pub-BENJAMIN,
  address =      pub-BENJAMIN:adr,
  pages =        "435",
  year =         "1964",
  LCCN =         "QD 251 R54b",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Second printing, with corrections, September 6,
                 1965.",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Roberts:1992:UDG,
  author =       "Ralph Roberts and Mark Boyd",
  title =        "{UNIX} Desktop Guide to {Emacs}",
  publisher =    pub-HAYDEN,
  address =      pub-HAYDEN:adr,
  pages =        "xxiii + 504",
  year =         "1992",
  ISBN =         "0-672-30171-7",
  ISBN-13 =      "978-0-672-30171-1",
  LCCN =         "QA76.76.T49 R62 1992",
  bibdate =      "Sun Mar 6 17:32:25 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  price =        "US\$27.95",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
}

@Book{Robertson:1968:RC,
  author =       "H. P. Robertson and Thomas W. Noonan",
  title =        "{Relativity} and Cosmology",
  publisher =    "W. B. Saunders Company",
  address =      "Philadelphia, PA, USA",
  pages =        "xxxiii + 456",
  year =         "1968",
  LCCN =         "QC6 .R635",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  remark =       "Based on Robertson's notes for his relativity course
                 at Caltech from 1949 to 1961. Robertson died in an
                 automobile accident, and the book was created
                 posthumously from his class notes by his last graduate
                 student, Noonan.",
  tableofcontents = "Euclidean space \\
                 Classical electromagnetism \\
                 The Lorentz transformation \\
                 Electromagnetism in special relativity \\
                 Matter \\
                 Special-relativistic gravitation theories \\
                 Differential geometry \\
                 Riemannian geometry \\
                 General relativity \\
                 Selected topics in general relativity \\
                 Inertial frames \\
                 Equations of motion \\
                 Automorphisms \\
                 Foundations of cosmology \\
                 Observable quantities \\
                 Special cosmological models \\
                 General-relativistic cosmology \\
                 Cosmological observations",
}

@Book{Robinson:1991:NDC,
  author =       "Sinclair Robinson and Donald Smith",
  title =        "{NTC}'s Dictionary of {Canadian French} ({NTC}'s
                 Language Definition)",
  publisher =    "NTC/Contemporary Publishing Company",
  address =      "Lincolnwood, IL, USA",
  pages =        "300",
  year =         "1991",
  ISBN =         "0-8442-1486-8",
  ISBN-13 =      "978-0-8442-1486-3",
  LCCN =         "PC3637 .R58 1991",
  bibdate =      "Sat Dec 24 11:53:05 MST 2005",
  bibsource =    "Amazon;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  bookformat =   "Hardcover",
  category =     "Reference: Dictionaries \& Thesauruses: English
                 (British)",
  comments =     "This guide to contemporary French vocabulary offers a
                 complete word list, with a full range of formal and
                 informal language encountered in French-speaking
                 countries today, as well as many technical, scientific,
                 and business terms. --- Abundant entries, including
                 clear indication of colloquial and slang terms, are
                 illustrated with contextual examples. Students grasp
                 shades of meaning. --- Clear pronunciation keys using
                 the International Phonetic Alphabet. Help students
                 pronounce new words with confidence.---This text refers
                 to the Hardcover edition.",
  dateentered =  "2005-12-19",
  DEWEY =        "447/.9714/03 21",
  dimensions =   "1.0 x 6.2 x 9.2 inches",
  idnumber =     "499",
  keywords =     "French language --- Canada --- Conversation and,
                 phrase books --- English, French language --- Canada
                 --- Glossaries,, vocabularies, etc, Canadianisms,
                 French",
  value =        "US\$37.70",
}

@Book{Robinson:2005:EHY,
  author =       "Andrew Robinson",
  title =        "{Einstein}: a hundred years of {Relativity}",
  publisher =    "Harry N. Abrams",
  address =      "New York, NY, USA",
  pages =        "256",
  year =         "2005",
  ISBN =         "0-8109-5923-2 (hardcover)",
  ISBN-13 =      "978-0-8109-5923-1 (hardcover)",
  LCCN =         "QC16.E5 R63 2005",
  bibdate =      "Mon Nov 21 06:42:07 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "ftp://uiarchive.cso.uiuc.edu/pub/etext/gutenberg/;
                 http://www.loc.gov/catdir/toc/ecip059/2005006593.html",
  acknowledgement = ack-nhfb,
  remark =       "With contributions by Philip Anderson.",
  subject =      "Einstein, Albert; Physicists; Biography; General
                 Relativity (physics); Physics; History; 20th century",
  subject-dates = "Albert Einstein (1879--1955)",
  tableofcontents = "The world of physics before Einstein \\
                 Autobiographical notes / by Albert Einstein \\
                 The Making of a physicist \\
                 A brief history of Relativity / by Stephen Hawking \\
                 The miraculous year, 1905 \\
                 General Relativity \\
                 Varying $c$: vodka without alcohol? / by Jo{\"a}ao
                 Magueijo \\
                 Arguing about quantum theory \\
                 The search for a theory of everything \\
                 Einstein's search for unification / by Steven Weinberg
                 \\
                 Physics since Einstein \\
                 Einstein's scientific legacy / by Philip Anderson \\
                 The most famous man in the world \\
                 Personal and family life \\
                 Einstein's love letters / by Robert Schulmann \\
                 Einstein and music / by Philip Glass \\
                 Germany, war and pacifism \\
                 America \\
                 Zionism, the Holocaust and Israel \\
                 Einstein on religion, Judaism and Zionism / by Max
                 Jammer \\
                 Nuclear saint and demon \\
                 Einstein's quest for global peace / by Joseph Rotblat
                 \\
                 The end of an era \\
                 Einstein's last interview / by I. Bernard Cohen \\
                 Einstein's enduring magic \\
                 Einstein: twentieth-century icon / by Arthur C.
                 Clarke.",
}

@Book{Robson:2009:OHH,
  editor =       "Eleanor Robson and Jacqueline A. Stedall",
  title =        "The {Oxford} Handbook of the History of Mathematics",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  pages =        "vii + 918",
  year =         "2009",
  ISBN =         "0-19-921312-7",
  ISBN-13 =      "978-0-19-921312-2",
  LCCN =         "QA21 .O94 2009",
  bibdate =      "Mon Feb 7 15:37:15 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Oxford handbooks",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0907/2008031793-b.html;
                 http://www.loc.gov/catdir/enhancements/fy0907/2008031793-d.html;
                 http://www.loc.gov/catdir/toc/ecip0823/2008031793.html",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "mathematics; history; handbooks, manuals, etc",
  tableofcontents = "Introduction \\
                 GEOGRAPHIES AND CULTURES \\
                 1. Global \\
                 What was mathematics in the ancient world? Greek and
                 Chinese perspectives / G. E. R. Lloyd \\
                 Mathematics and authority: a case study in and Old and
                 New World accounting / Gary Urton \\
                 Heavenly learning, statecraft, and scholarship: the
                 Jesuits and their mathematics in China / Catherine Jami
                 \\
                 The internationalization of mathematics in a world of
                 nations, 1800-1960 / Karen Hunger Parshall \\
                 2. Regional \\
                 The two cultures of mathematics in ancient Greece /
                 Markus Asper \\
                 Tracing mathematical networks in seventeenth-century
                 England / Jacqueline Stedall \\
                 Mathematics and mathematics education in traditional
                 Vietnam / Alexei Volkov \\
                 A Balkan trilogy: mathematics in the Balkans before
                 World War I / Snezana Lawrence \\
                 3. Local \\
                 Mathematics education in an Old Babylonian scribal
                 school / Eleanor Robson \\
                 The archaeology of mathematics in an ancient Greek city
                 / David Gilman Romano \\
                 Engineering the Neapolitan state / Massimo Mazzotti \\
                 Observatory mathematics in the nineteenth century /
                 David Aubin. PEOPLE AND PRACTICES \\
                 4. Lives \\
                 Patronage of the mathematical sciences in Islamic
                 societies / Sonja Brentjes \\
                 John Aubrey and the `Lives of our English mathematical
                 writers' / Kate Bennett \\
                 Introducing mathematics, building an empire: Russia
                 under Peter I / Irina Gouz evitch and Dmitri Gouz
                 evitch \\
                 Human computers in eighteenth and nineteenth-century
                 Britain / Mary Croarken \\
                 5. Practices \\
                 Mixing, building, and feeding: mathematics and
                 technology in ancient Egypt / Corinna Rossi \\
                 Siyaq: numerical notation and numeracy in the
                 Persianate world / Brian Spooner and William Hanaway
                 \\
                 Learning arithmetic: textbooks and their users in
                 England 1500-1900 / John Denniss \\
                 Algorithms and automation: the production of
                 mathematics and textiles / Carrie Brezine \\
                 6. Presentation \\
                 The cognitive and cultural foundations of numbers /
                 Stephen Chrisomalis \\
                 Sanskrit mathematical verse / Kim Plofker \\
                 Antiquity, nobility, and utility: picturing the Early
                 Modern mathematical sciences / Volker R. Remmert \\
                 Writing the ultimate mathematical textbook: Nicolas
                 Bourbaki's {\'E}l{\'e}ments de math{\'e}matique / Leo
                 Corry. INTERACTIONS AND INTERPRETATIONS \\
                 7. Intellectual \\
                 People and numbers in early imperial China /
                 Christopher Cullen \\
                 Mathematics in fourteenth-century theology / Mark
                 Thakkar \\
                 Mathematics, music, and experiment in late
                 seventeenth-century England / Benjamin Wardhaugh \\
                 Modernism in mathematics / Jeremy Gray \\
                 8. Mathematical \\
                 The transmission of the Elements to the Latin West:
                 three case studies / Sabine Rommevaux \\
                 `Gigantic implements of war': images of Newton as a
                 mathematician / Niccolo Guicciardini \\
                 From cascades to calculus: Rolle's theorem / June
                 Barrow-Green \\
                 Abstraction and application: new contexts, new
                 interpretations in twentieth-century mathematics /
                 Tinne Hoff Kjeldsen \\
                 9. Historical \\
                 Traditions and myths in the historiography of Egyptian
                 mathematics / Annette Imhausen \\
                 Reading ancient Greek mathematics / Ken Saito \\
                 Number, shape, and the nature of space: thinking
                 through Islamic art / Carol Bier \\
                 The historiography and history of mathematics in the
                 Third Reich / Reinhard Siegmund-Schultze.",
}

@Book{Rochkind:1985:AUP,
  author =       "Marc J. Rochkind",
  title =        "Advanced {UNIX} Programming",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xv + 265",
  year =         "1985",
  ISBN =         "0-13-011818-4 (hardcover), 0-13-011800-1 (paperback)",
  ISBN-13 =      "978-0-13-011818-9 (hardcover), 978-0-13-011800-4
                 (paperback)",
  LCCN =         "QA76.76.O63 R63 1985",
  bibdate =      "Wed Dec 15 10:41:14 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$32.95 (hardcover), US\$24.95 (paperback)",
  abstract =     "This book covers how to program UNIX clearly and
                 systematically at the system call level while providing
                 the seasoned programmer with practical advice for using
                 I/O on files and terminals, multitasking, signals and
                 system administration.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Fundamental concepts \\
                 Basic file I/O \\
                 Advanced file I/O \\
                 Terminal I/O \\
                 Processes \\
                 Basic interprocess communication \\
                 Advanced interprocess communication \\
                 Signals \\
                 Miscellaneous system calls \\
                 Appendices. System V process attributes \\
                 Standard subroutines",
}

@Book{Rochkind:2004:AUP,
  author =       "Marc J. Rochkind",
  title =        "Advanced {UNIX} Programming",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Second",
  pages =        "xiii + 719",
  year =         "2004",
  ISBN =         "0-13-141154-3",
  ISBN-13 =      "978-0-13-141154-8",
  LCCN =         "QA76.76.O63 R63 2004",
  bibdate =      "Wed Jul 07 10:41:05 2004",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$44.99",
  URL =          "http://www.aw-bc.com/catalog/academic/product/0,1144,0131411543,00.html",
  abstract =     "The long-awaited revision to one of the foundation
                 titles in UNIX programming covers the latest POSIX
                 standards, updated for Linux, FreeBSD, and Mac OS X.
                 Includes a wide range of examples, including a Web
                 browser, a Web server, a keystroke recorder/player and
                 a real shell. Rochkind is regarded as one of the
                 pioneers in UNIX programming, and this book is a true
                 classic.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1. Fundamental concepts \\
                 2. Basic File I/0 \\
                 3. Advanced file I/0 \\
                 4. Terminal I/0 \\
                 5. Processes and threads \\
                 6. Basic interprocess communication \\
                 7. Advanced interprocess communication \\
                 8. Networking and sockets \\
                 9. Signals and timers \\
                 Appendix A. Process attributes \\
                 Appendix B. Ux: a C++ wrapper for standard Unix
                 functions \\
                 Appendix C. Jtux: a Java/Jython interface to standard
                 UNIX functions \\
                 Appendix D. alphabetical and categorical function
                 lists",
}

@Book{Rockmore:2006:SRH,
  author =       "Daniel N. (Daniel Nahum) Rockmore",
  title =        "Stalking the {Riemann} hypothesis: the quest to find
                 the hidden law of prime numbers",
  publisher =    pub-VINTAGE,
  address =      pub-VINTAGE:adr,
  pages =        "x + 292",
  year =         "2006",
  ISBN =         "0-375-72772-8 (paperback)",
  ISBN-13 =      "978-0-375-72772-6 (paperback)",
  LCCN =         "QA246 .R63 2006",
  bibdate =      "Thu Feb 14 13:08:07 MST 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 melvyl.cdlib.org:210/CDL90",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Riemann, Bernhard; numbers, prime; number theory;
                 Riemann hypothesis",
  subject-dates = "1826--1866",
  tableofcontents = "Prologue --- it all begins with zero \\
                 The god-given natural numbers \\
                 The shape of the primes \\
                 Primal cartographers \\
                 Shoulders to stand upon \\
                 Riemann and his ``very likely'' hypothesis \\
                 A Dutch red herring \\
                 A prime number theorem, after all\\
                 and more \\
                 Good, but not good enough \\
                 First steps \\
                 A chance meeting of two minds \\
                 God created the natural numbers\\
                 but, in a billiard hall? \\
                 Making order out of (quantum) chaos \\
                 God may not play dice, but what about cards? \\
                 The millennium meeting",
}

@Book{Rodale:1978:SF,
  author =       "J. I. Rodale and Laurence Urdang and Nancy LaRoche",
  title =        "The Synonym Finder",
  publisher =    "Rodale Press",
  address =      "Emmaus, PA",
  pages =        "1361",
  year =         "1978",
  ISBN =         "0-87857-236-8",
  ISBN-13 =      "978-0-87857-236-6",
  LCCN =         "PE1591.R64 1978",
  bibdate =      "Mon Apr 26 09:58:04 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Completely revised by Laurence Urdang and Nancy
                 LaRoche.",
  acknowledgement = ack-nhfb,
  idnumber =     "522",
}

@Book{Rodgers:1990:UDM,
  author =       "Ulka Rodgers",
  title =        "{UNIX} Database Management Systems",
  publisher =    pub-YOURDON,
  address =      pub-YOURDON:adr,
  pages =        "xiv + 338",
  year =         "1990",
  ISBN =         "0-13-945593-0",
  ISBN-13 =      "978-0-13-945593-3",
  LCCN =         "QA76.9.D3 R65 1990",
  bibdate =      "Wed Dec 15 10:41:20 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Rogers:1976:MEC,
  author =       "David F. Rogers and J. Alan Adams",
  title =        "Mathematical Elements for Computer Graphics",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "xv + 239",
  year =         "1976",
  ISBN =         "0-07-053527-2 (paperback), 0-07-053530-2",
  ISBN-13 =      "978-0-07-053527-5 (paperback), 978-0-07-053530-5",
  LCCN =         "T385 .R6 1976",
  bibdate =      "Wed Dec 15 10:41:22 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Introduction to Computer Graphics \\
                 Two-Dimensional Transformations \\
                 Three-Dimensional Transformations \\
                 Plane Curves \\
                 Space Curves \\
                 Surface Description and Generation \\
                 Appendixes \\
                 Computer Graphics Software \\
                 Matrix Algebra Pseudocode \\
                 B-Spline Surface File Format \\
                 Problems Programming \\
                 Projects Algorithms",
}

@Book{Rogers:1985:PEC,
  author =       "David F. Rogers",
  title =        "Procedural Elements for Computer Graphics",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "xiii + 433",
  year =         "1985",
  ISBN =         "0-07-053534-5",
  ISBN-13 =      "978-0-07-053534-3",
  LCCN =         "T385 .R631 1985",
  bibdate =      "Wed Dec 15 10:41:22 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$19.95",
  acknowledgement = ack-nhfb,
}

@Book{Rogers:1987:TCG,
  editor =       "David F. Rogers and Rae A. Earnshaw",
  title =        "Techniques for Computer Graphics",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "viii + 512",
  year =         "1987",
  ISBN =         "0-387-96492-4, 3-540-96492-4",
  ISBN-13 =      "978-0-387-96492-8, 978-3-540-96492-6",
  LCCN =         "T385 .T43 1986",
  bibdate =      "Wed Dec 15 10:41:24 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$50.00",
  acknowledgement = ack-nhfb,
}

@Book{Rogers:2001:INH,
  author =       "David F. Rogers",
  title =        "An Introduction to {NURBS}: with Historical
                 Perspective",
  publisher =    pub-MORGAN-KAUFMANN,
  address =      pub-MORGAN-KAUFMANN:adr,
  pages =        "xvii + 324",
  year =         "2001",
  ISBN =         "1-55860-669-6 (hardcover), 0-08-050920-7 (e-book),
                 1-281-03529-7",
  ISBN-13 =      "978-1-55860-669-2 (hardcover), 978-0-08-050920-4
                 (e-book), 978-1-281-03529-5",
  LCCN =         "QA224.R64 2001",
  bibdate =      "Tue Jul 23 18:54:06 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$49.95",
  abstract =     "NURBS (Non-uniform Rational B-Splines) are the
                 computer graphics industry standard for curve and
                 surface description. They are now incorporated into all
                 standard computer-aided design and drafting programs
                 (for instance, Autocad). They are also extensively used
                 in all aspects of computer graphics including much of
                 the modeling used for special effects in film and
                 animation, consumer products, robot control, and
                 automobile and aircraft design. So, the topic is
                 particularly important at this time because NURBS are
                 really at the peak of interest as applied to computer
                 graphics and CAD of all kind.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  tableofcontents = "1: Curve and Surface Representation \\
                 2: B{\'e}zier Curves \\
                 3: B-spline Curves \\
                 4: Rational B-spline Curves \\
                 5: B{\'e}zier Surfaces \\
                 6: B-spline Surfaces \\
                 7: Rational B-spline Surfaces \\
                 Appendices \\
                 Curve and surface representation \\
                 References \\
                 Index \\
                 About the Author",
}

@Book{Rogers:2011:EE,
  author =       "Alan R. Rogers",
  title =        "The Evidence for Evolution",
  publisher =    pub-U-CHICAGO,
  address =      pub-U-CHICAGO:adr,
  pages =        "120",
  year =         "2011",
  ISBN =         "0-226-72380-1 (hardcover), 0-226-72382-8 (paperback)",
  ISBN-13 =      "978-0-226-72380-8 (hardcover), 978-0-226-72382-2
                 (paperback)",
  LCCN =         "QH361 .R64 2011",
  bibdate =      "Wed Dec 26 09:14:19 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Evolution (Biology); Human evolution; Creationism",
  tableofcontents = "Darwin's mockingbird \\
                 Do species change? \\
                 Does evolution make big changes? \\
                 Can evolution explain design? \\
                 Peaks and valleys \\
                 Islands in the 21st century \\
                 Has there been enough time? \\
                 Did humans evolve? \\
                 Are we still evolving? \\
                 Conclusions",
}

@Book{Roget:1990:RTE,
  author =       "Peter Mark Roget and Samuel Romilly Roget",
  title =        "{Roget}'s thesaurus of {English} words and phrases",
  publisher =    "Portland House",
  address =      "New York, NY, USA",
  pages =        "xxv + 800",
  year =         "1990",
  ISBN =         "0-517-03552-9",
  ISBN-13 =      "978-0-517-03552-8",
  LCCN =         "PE1591 .R7 1990",
  bibdate =      "Tue Aug 20 08:02:00 MDT 2013",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  price =        "US\$9.99",
  acknowledgement = ack-nhfb,
  author-dates = "1779--1869",
  libnote =      "Not in my library.",
  remark =       "Classic American edition was originally revised and
                 enlarged by Samuel Romilly Roget. Reprint of 1933
                 original from New York: Grosset and Dunlap.",
  subject =      "English language; Synonyms and antonyms",
}

@Book{Rohl:1984:RP,
  author =       "J. S. (Jeffrey Soden) Rohl",
  title =        "Recursion via {Pascal}",
  volume =       "19",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "x + 191",
  year =         "1984",
  DOI =          "https://doi.org/10.1017/CBO9781139171793",
  ISBN =         "0-521-26329-8 (hardcover), 0-521-26934-2 (paperback)",
  ISBN-13 =      "978-0-521-26329-0 (hardcover), 978-0-521-26934-6
                 (paperback)",
  LCCN =         "QA76.73.P2 R634 1984",
  bibdate =      "Wed Dec 15 10:41:25 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Cambridge Computer Science Texts, Editors: E. S. Page
                 and C. M. Reeves and D. E. Conway",
  abstract =     "This book is devoted to recursion in programming, the
                 technique by which the solution to a problem is
                 expressed partly in terms of the solution to a simpler
                 version of the same problem. Ultimately the solution to
                 the simplest version must be given explicitly. In
                 functional programming, recursion has received its full
                 due since it is quite often the only repetitive
                 construct. However, the programming language used here
                 is Pascal and the examples have been chosen
                 accordingly. It makes an interesting contrast with the
                 use of recursion in functional and logic programming.
                 The early chapters consider simple linear recursion
                 using examples such as finding the highest common
                 factor of a pair of numbers, and processing linked
                 lists. Subsequent chapters move up through binary
                 recursion, with examples which include the Towers of
                 Hanoi problem and symbolic differentiation, to general
                 recursion. The book contains well over 100 examples.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Preface \\
                 Introduction to recursion \\
                 Recursion with linked-linear lists \\
                 Recursion with binary trees \\
                 Binary recursion without trees \\
                 Double recursion, mutual recursion, recursive calls \\
                 Recursion with $n$-ary trees and graphs \\
                 Simulating nested loops \\
                 The elimination of recursion \\
                 Further reading and references \\
                 Index of procedures",
}

@Book{Rohl:2014:KWI,
  author =       "John C. G. R{\"o}hl",
  title =        "{Kaiser Wilhelm II}, 1859--1941: a concise life",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xxii + 240",
  year =         "2014",
  ISBN =         "1-107-07225-5 (hardcover), 1-107-42077-6 (paperback),
                 1-139-68039-0 (e-book)",
  ISBN-13 =      "978-1-107-07225-1 (hardcover), 978-1-107-42077-9
                 (paperback), 978-1-139-68039-4 (e-book)",
  LCCN =         "DD229 .R6412413 2014",
  bibdate =      "Thu Nov 11 18:07:28 MST 2021",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Translation from the German original by Sheila {De
                 Bellaigue}.",
  abstract =     "Kaiser Wilhelm II (1859--1941) is one of the most
                 fascinating figures in European history, ruling
                 Imperial Germany from his accession in 1888 to his
                 enforced abdication in 1918 at the end of the First
                 World War. In one slim volume, John R{\"o}hl offers
                 readers a concise and accessible survey of his
                 monumental three-volume biography of the Kaiser and his
                 reign. The book sheds new light on Wilhelm's troubled
                 youth, his involvement in social and political scandals
                 and his growing thirst for glory, which, combined with
                 his overwhelming nationalism and passion for the navy
                 provided the impetus for a breathtaking long-term goal:
                 the transformation of the German Reich into one of the
                 foremost powers in the world. The volume examines the
                 crucial role played by Wilhelm as Germany's Supreme War
                 Lord in the policies that led to war in 1914. It
                 concludes by describing the rabid anti-Semitism he
                 developed in exile and his efforts to persuade Hitler
                 to restore him to the throne.",
  acknowledgement = ack-nhfb,
  subject =      "Hitler, Adolf; William; II; German Emperor; Family;
                 Hitler, Adolf,; German Emperor,; War; Sovereignty;
                 World War, 1914--1918; Campaigns; Exile (Punishment);
                 Antisemitism; Inheritance and succession; Monarchy;
                 Courts and courtiers; Heads of state; Europe;
                 Biography; Kings, queens, rulers, etc; Antisemitism.;
                 Courts and courtiers.; Exile (Punishment); Families.;
                 Heads of state.; Inheritance and succession.; Kings and
                 rulers.; Military campaigns.; Monarchy.; Sovereignty.;
                 War.; Tangier (Morocco); Bosnia and Herzegovina;
                 History, Military; History; Germany; Kings and rulers;
                 William II, 1888--1918; Morocco; Tangier",
  subject-dates = "1889--1945 (Adolf Hitler); 1859--1941 (Kaiser
                 Wilhelm)",
  tableofcontents = "Overview: Wilhelm the last, a German trauma / xx
                 \\
                 Part I: 1859--1888: the tormented Prussian prince \\
                 1: The 'soul murder' of an heir to the throne / 3 \\
                 2: Ambivalent motherhood / 10 \\
                 3: A daring educational experiment / 14 \\
                 4: The conflict between the Prince of Prussia and his
                 parents / 22 \\
                 5: 1888: the year of the three Kaisers / 34 \\
                 Part II: 1888--1909: the anachronistic autocrat \\
                 6: Divine right without end / 41 \\
                 7: Bismarck's fall from power (1889--1890) / 44 \\
                 8: The establishment of the Kaiser's personal monarchy
                 (1890--1897) / 53 \\
                 9: The Chancellor as courtier: the corrupt B{\"u}low
                 system (1897--1909) / 63 \\
                 Part III: 1896--1908: the egregious expansionist \\
                 10: The challenge to Europe: Weltmachtpolitik and the
                 battlefleet / 73 \\
                 11: The Russo-Japanese War and the meeting of the
                 emperors on Bj{\"o}rk{\"o} (1904--1905) / 83 \\
                 12: War in the west? The landing in Tangier and the
                 fiasco of Algeciras (1905--1906) / 86 \\
                 13: The intensification of the Anglo-German conflict /
                 93 \\
                 Part IV: 1906--1909: the scandal-ridden sovereign \\
                 14: The Eulenburg affair (1906--1909) / 103 \\
                 15: B{\"u}low's betrayal of the Kaiser: the Daily
                 Telegraph crisis (1908--1909) / 110 \\
                 16: From B{\"u}low to Bethmann Hollweg: the Chancellor
                 merry-go-round (1909) / 116 \\
                 Part V: 1908--1914: the bellicose supreme war lord \\
                 17: The Bosnian annexation crisis (1908--1909) / 121
                 \\
                 18: The 'leap of the Panther' to Agadir (1911) / 125
                 \\
                 19: The battlefleet and the growing risk of war with
                 Britain (1911--1912) / 129 \\
                 20: Doomed to failure: the Haldane Mission (1912) / 132
                 \\
                 21: Turmoil in the Balkans and a first decision for war
                 (November 1912) / 135 \\
                 22: War postponed: the 'war council' of 8 December 1912
                 / 139 \\
                 23: The postponed war draws nearer (1913--1914) / 143
                 \\
                 24: The Kaiser in the July crisis of 1914 / 149 \\
                 Part VI: 1914--1918: the champion of God's Germanic
                 cause \\
                 25: The Kaiser's war aims / 167 \\
                 26: The impotence of the Supreme War Lord at war / 172
                 \\
                 27: Downfall: the collapse of the Hohenzollern monarchy
                 / 174 \\
                 Part VII: 1918--1941: the vengeful exile \\
                 28: A new life in Amerongen and Doorn / 181 \\
                 29:The rabid anti-Semite in exile / 185 \\
                 30: The Kaiser and Hitler / 188 \\
                 Notes / 195 \\
                 Index / 230",
}

@Book{Rosbottom:2014:WPW,
  author =       "Ronald C. Rosbottom",
  title =        "When {Paris} went dark: the {City of Light} under
                 {German} Occupation, 1940--1944",
  publisher =    "Little, Brown and Company",
  address =      "New York, NY, USA",
  pages =        "xxxii + 447",
  year =         "2014",
  ISBN =         "0-316-21743-3 (paperback), 0-316-21744-1 (hardcover)",
  ISBN-13 =      "978-0-316-21743-9 (paperback), 978-0-316-21744-6
                 (hardcover)",
  LCCN =         "D762.P3 R67 2014",
  bibdate =      "Sat Oct 23 16:29:18 MDT 2021",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Describes what life was like in Paris after June 1940,
                 when the Nazis occupied France, juxtaposing the eerie
                 sense of normalcy felt by many Parisians with the
                 passion of the strong resistance movement that rose
                 around Charles de Gaulle. On June 14, 1940, German
                 tanks entered a silent and nearly deserted Paris. Eight
                 days later, France accepted a humiliating defeat and
                 foreign occupation. Subsequently, an eerie sense of
                 normalcy settled over the City of Light. Many Parisians
                 keenly adapted themselves to the situation-even allied
                 themselves with their Nazi overlords. At the same time,
                 amidst this darkening gloom of German ruthlessness,
                 shortages, and curfews, a resistance arose. Parisians
                 of all stripes, Jews, immigrants, adolescents,
                 communists, rightists, cultural icons such as Colette,
                 de Beauvoir, Camus and Sartre, as well as police
                 officers, teachers, students, and store owners-rallied
                 around a little known French military officer, Charles
                 de Gaulle. When Paris Went Dark evokes with stunning
                 precision the detail of daily life in a city under
                 occupation, and the brave people who fought against the
                 darkness. Relying on a range of resources--memoirs,
                 diaries, letters, archives, interviews, personal
                 histories, fliers and posters, fiction, photographs,
                 film and historical studies, Rosbottom has forged a
                 groundbreaking book that will forever influence how we
                 understand those dark years in the City of Light.",
  acknowledgement = ack-nhfb,
  author-dates = "1942--",
  subject =      "World War, 1939--1945; Paris (France.);
                 Stra{\ss}enbeleuchtung; Weltkrieg; 1939-1945; Tyska
                 ockupationen av Frankrike 1940--1945.; France; History;
                 German occupation, 1940--1945; Paris (France);
                 1940--1944; Paris; Frankrike; 1940--1945, German
                 occupation",
  tableofcontents = "Chronology of the Occupation of Paris \\
                 Major personalities \\
                 Introduction \\
                 Faux Paris \\
                 Sequestering Medusa \\
                 Paris was different \\
                 A nation disintegrates \\
                 Preludes \\
                 Three traumas \\
                 Waiting for Hitler \\
                 ``They'' arrive, and are surprised \\
                 One who stayed, one who left \\
                 ``They'' settle in \\
                 Hitler's own tour \\
                 The F{\"u}hrer's urbanophobia \\
                 Minuet (1940-1941) \\
                 How do you occupy a city? \\
                 For some, Paris was a bubble \\
                 Dancing the minuet \\
                 Correct, but still Nazis \\
                 ``To bed, to bed!'' \\
                 An execution in Paris \\
                 City without a face: the occupier's lament \\
                 Paris had already welcomed the Nazis--before the
                 occupation \\
                 The occupiers are surprised, too \\
                 A dreamer in exile \\
                 Sexually occupied \\
                 A ``better'' German \\
                 Recollected solitude \\
                 Narrowed lives \\
                 Narrowing and boredom \\
                 The apartment \\
                 A crowded M{\'e}tro \\
                 The informer \\
                 The queue \\
                 Dilemmas of resistance \\
                 Quoi faire? \\
                 Resistant Paris \\
                 B{\'e}b{\'e}s terroristes \\
                 The red poster \\
                 A female resistance \\
                 Who got the credit? \\
                 The most narrowed lives: the hunt for Jews \\
                 Being Jewish in Paris \\
                 Three girls on the move \\
                 A gold star \\
                 The big roundup \\
                 How much longer? (1942-1944) \\
                 ``You can come over now!'' \\
                 The plague \\
                 Observers from the palace \\
                 Signs of defeat \\
                 Liberation: a whodunit \\
                 Is Paris worth a detour? \\
                 The beast of Sevastopol arrives \\
                 ``Tous aux barricades!'' \\
                 Why do Americans smile so much? \\
                 Whodunit? \\
                 Angry aftermath: back on Paris time \\
                 Rediscovering purity \\
                 ``Kill all the bastards!'' \\
                 The return of lost souls \\
                 Is Paris still occupied? \\
                 De Gaulle creates a script \\
                 Stumbling through memory \\
                 Should we blame Paris? \\
                 ``The landscape of our confusions'' \\
                 Appendix. De Gaulle's speech on the Liberation of
                 Paris",
}

@Book{Rosbottom:2019:SCY,
  author =       "Ronald Rosbottom",
  title =        "Sudden Courage: Youth in {France} Confront the
                 {Germans}, 1940--1945",
  publisher =    "HarperCollins Publishers",
  address =      "New York, NY, USA",
  pages =        "xiv + 320 + 16",
  year =         "2019",
  ISBN =         "0-06-247002-7 (hardcover), 0-06-247005-1 (e-book)",
  ISBN-13 =      "978-0-06-247002-7 (hardcover), 978-0-06-247005-8
                 (e-book)",
  LCCN =         "D802.F8 R593 2019",
  bibdate =      "Mon Dec 9 07:23:29 MST 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Map of Divided France / x \\
                 A Selective Chronology / xi \\
                 Introduction / 1 \\
                 1: ``Present!'' / 17 \\
                 2: Coming of age in the 1930s / 33 \\
                 3: What the hell happened? / 59 \\
                 4: A blind resistance / 75 \\
                 5: Life as a J3 during the dark years / 109 \\
                 6: Sudden courage / 165 \\
                 7: Resisting the Resistance / 211 \\
                 8: Does resistance have a gender? / 241 \\
                 Conclusion / 273 \\
                 Acknowledgments / 287 \\
                 Bibliography / 291 \\
                 Notes / 305 \\
                 Index / 313",
}

@Book{Rose:1991:SB,
  author =       "Marshall T. Rose",
  title =        "The Simple Book",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xxix + 347",
  year =         "1991",
  ISBN =         "0-13-812611-9",
  ISBN-13 =      "978-0-13-812611-7",
  LCCN =         "TK5105.5.R68 1991",
  bibdate =      "Wed Dec 15 10:41:26 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
}

@Book{Rosen:2010:MPI,
  author =       "William Rosen",
  title =        "The most powerful idea in the world: a story of steam,
                 industry, and invention",
  publisher =    pub-RANDOM-HOUSE,
  address =      pub-RANDOM-HOUSE:adr,
  pages =        "xxv + 370",
  year =         "2010",
  ISBN =         "1-4000-6705-7",
  ISBN-13 =      "978-1-4000-6705-3",
  LCCN =         "TJ461 .R67 2010",
  bibdate =      "Tue Sep 21 14:11:13 MDT 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  price =        "US\$28.00",
  acknowledgement = ack-nhfb,
  subject =      "steam-engines; history; inventions; industrial
                 revolution; Great Britain",
  tableofcontents = "Rocket \\
                 Changes in the atmosphere \\
                 A great company of men \\
                 The first and true inventor \\
                 A very great quantity of heat \\
                 Science in his hands \\
                 The whole thing was arranged in my mind \\
                 Master of them all \\
                 A field that is endless \\
                 Quite splendid with a file \\
                 To give England the power of cotton \\
                 Wealth of nations \\
                 Strong steam \\
                 The fuel of interest",
}

@Book{Rosenberg:2005:STW,
  author =       "Barry J. Rosenberg",
  title =        "Spring Into Technical Writing: for Engineers and
                 Scientists",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xxi + 318",
  year =         "2005",
  ISBN =         "0-13-149863-0 (paperback)",
  ISBN-13 =      "978-0-13-149863-1 (paperback)",
  LCCN =         "T11 .R663 2005",
  bibdate =      "Tue Jul 19 16:55:46 MDT 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 http://www.unixreview.com/documents/s=9823/ur0507i/ur0507i.html;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Technical writing",
  tableofcontents = "Preface \\
                 I. Planning to Write \\
                 1. The Quest \\
                 Technical Writing Theorems \\
                 Technical Writing Can Be Creative \\
                 Tell 'Em The Value of Technical Communication to You
                 \\
                 Comparing Technical Writing to Engineering and Science
                 \\
                 2. Audience \\
                 General Education Level Experience and Expertise \\
                 Breadth of Audience \\
                 Native Language \\
                 Native Culture \\
                 Audience Motivation \\
                 Medium and the Message \\
                 Becoming the Audience Summary of Audience \\
                 3. Documentation Plans \\
                 Document Specifications (Doc Specs) \\
                 Doc Specs:Sample \\
                 Summary of Documentation Specifications \\
                 II. Writing: General Principles \\
                 4. Words \\
                 Sample Documentation Project Plans \\
                 Documentation Project Plan \\
                 He, She, and They Pronouns: You Pronouns: It and They
                 \\
                 Fluffy Phrases \\
                 Commonly Confused Words \\
                 Summary of Words \\
                 5. Sentences \\
                 Jargon Consistency \\
                 Verbs Adjectives and Adverbs \\
                 Pronouns \\
                 Active Voice and Passive Voice \\
                 Active Voice Is Better \\
                 When Is Passive Voice Okay? \\
                 Short = Sweet \\
                 Causes of Long Sentences \\
                 One Sentence = One Thought \\
                 Parenthetical Clauses \\
                 Summary of \ldots{}",
}

@Book{Rosenblatt:1993:LKS,
  author =       "Bill Rosenblatt",
  title =        "Learning the {Korn} Shell",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xxii + 338",
  month =        jun,
  year =         "1993",
  ISBN =         "1-56592-054-6",
  ISBN-13 =      "978-1-56592-054-5",
  LCCN =         "QA76.73.K67 R68 1993",
  bibdate =      "Mon Jan 3 17:43:25 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$27.95",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

@Book{Rosenblatt:2002:LKS,
  author =       "Bill Rosenblatt and Arnold Robbins",
  title =        "Learning the {Korn} Shell",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  edition =      "Second",
  pages =        "xviii + 412",
  year =         "2002",
  ISBN =         "0-596-00195-9 (paperback), 1-4493-7127-2 (e-book),
                 1-4493-7128-0 (e-book)",
  ISBN-13 =      "978-0-596-00195-7 (paperback), 978-1-4493-7127-2
                 (e-book), 978-1-4493-7128-9 (e-book)",
  LCCN =         "QA76.73.K67 R68 2002",
  bibdate =      "Sat Sep 11 09:55:20 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/css.bib;
                 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\$34.95",
  abstract =     "The Korn shell is an interactive command and scripting
                 language for accessing Unix\? and other computer
                 systems. As a complete and high-level programming
                 language in itself, it's been a favorite since it was
                 developed in the mid 1980s by David G. Korn at AT\&T
                 Bell Laboratories. Knowing how to use it is an
                 essential skill for serious Unix users.
                 \booktitle{Learning the Korn Shell} shows you how to
                 use the Korn shell as a user interface and as a
                 programming environment. Writing applications is often
                 easier and quicker with Korn than with other high-level
                 languages. Because of this, the Korn shell is the most
                 often used shell in commercial environments and among
                 inexperienced users. There are two other widely used
                 shells, the Bourne shell and the C shell. The Korn
                 shell, or ksh has the best features of both, plus many
                 new features of its own. ksh can do much to enhance
                 productivity and the quality of a user's work, both in
                 interacting with the system, and in programming. The
                 new version, ksh93 has the functionality of other
                 scripting languages such as awk, icon, Perl, rexx, and
                 tcl. \booktitle{Learning the Korn Shell} is the key to
                 gaining control of the Korn shell and becoming adept at
                 using it as an interactive command and scripting
                 language. Prior programming experience is not required
                 in order to understand the chapters on basic shell
                 programming. Readers will learn how to write many
                 applications more easily and quickly than with other
                 high-level languages. In addition, readers will also
                 learn about Unix utilities and the way the Unix
                 operating system works in general. The authors maintain
                 that you shouldn't have to be an internals expert to
                 use and program the shell effectively. The second
                 edition covers all the features of the current version
                 of the Korn shell, including many new features not in
                 earlier versions of ksh93, making it the most
                 up-to-date reference available on the Korn shell. It
                 compares the current version of the Korn shell to
                 several other Bourne-compatible shells, including
                 several Unix emulation environments for MS-DOS and
                 Windows. In addition, it describes how to download and
                 build ksh93 from source code. A solid offering for many
                 years, this newly revised title inherits a long
                 tradition of trust among computer professionals who
                 want to learn or refine an essential skill.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1. Korn Shell Basics \\
                 2. Command-Line Editing \\
                 3. Customizing Your Environment \\
                 4. Basic Shell Programming \\
                 5. Flow Control \\
                 6. Command-Line Options and Typed Variables \\
                 7. Input/Output and Command-Line Processing \\
                 8. Process Handling \\
                 9. Debugging Shell Programs \\
                 10. Korn Shell Administration \\
                 A. Related Shells \\
                 B. Reference Information \\
                 C. Building ksh from Source Code \\
                 D. AT\&T Source Code License Agreement",
}

@Book{Rosenblum:2011:QEP,
  author =       "Bruce Rosenblum and Fred Kuttner",
  title =        "Quantum Enigma: Physics Encounters Consciousness",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  edition =      "Second",
  pages =        "x + 287",
  year =         "2011",
  ISBN =         "0-19-975381-4 (paperback)",
  ISBN-13 =      "978-0-19-975381-9 (paperback)",
  LCCN =         "QC174.13 .R67 2011",
  bibdate =      "Fri Jul 22 15:58:07 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Quantum theory; Science; Philosophy",
  tableofcontents = "Einstein called it ``spooky'': and I wish I had
                 known \\
                 The visit to Neg Ahne Poc: a quantum parable \\
                 Our Newtonian worldview: a universal law of motion \\
                 All the rest of classical physics hello quantum
                 mechanics \\
                 How the quantum was forced on physics \\
                 Schr{\"o}dinger's equation: the new universal law of
                 motion \\
                 The 2-slit experiment \\
                 Our skeleton in the closet \\
                 One-third of our economy \\
                 Wonderful, wonderful Copenhagen \\
                 Schr{\"o}dinger's controversial cat \\
                 Seeking a real world: EPR \\
                 Spooky actions: Bell's theorem \\
                 Experimental metaphysics \\
                 What's going on? \\
                 The mystery of consciousness \\
                 The mystery meets the enigma \\
                 Consciousness and the quantum cosmos",
}

@TechReport{Rost:pex,
  author =       "Randi J. Rost",
  title =        "{PEX} Introduction and Overview",
  number =       "Version 3.20",
  institution =  "Digital Equipment Corporation, Workstation Systems
                 Engineering",
  month =        apr,
  year =         "1988",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "This document is present in the X Window System
                 Version 11 Release 3 in the file
                 \path|X11/X11/doc/extensions/pex/doc/intro/doc.ms|.",
  acknowledgement = ack-nhfb,
}

@Book{Roth:1988:RWP,
  editor =       "Stephen E. Roth",
  title =        "Real World {PostScript}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xiv + 383",
  year =         "1988",
  ISBN =         "0-201-06663-7",
  ISBN-13 =      "978-0-201-06663-0",
  LCCN =         "Z286.D47 R4 1988",
  bibdate =      "Wed Dec 15 18:12:59 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Rovelli:2021:HMS,
  author =       "Carlo Rovelli",
  title =        "{Helgoland}: Making Sense of the Quantum Revolution",
  publisher =    "Riverhead Books",
  address =      "New York, NY, USA",
  pages =        "xviii + 235",
  year =         "2021",
  ISBN =         "0-593-32888-4 (hardcover), 0-593-32890-6 (e-book)",
  ISBN-13 =      "978-0-593-32888-0 (hardcover), 978-0-593-32890-3
                 (e-book)",
  LCCN =         "QC173.96 .R6813 2021",
  bibdate =      "Sun Apr 25 16:35:31 MDT 2021",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/h/heisenberg-werner.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Translation to English by Erica Segre and Simon
                 Carnell.",
  abstract =     "One of the world's most renowned theoretical
                 physicists, Carlo Rovelli has entranced millions of
                 readers with his singular perspective on the cosmos. In
                 Helgoland, Rovelli examines the enduring enigma of
                 quantum theory. The quantum world Rovelli describes is
                 as beautiful as it is unnerving. Helgoland is a
                 treeless island in the North Sea where the 21-year-old
                 Werner Heisenberg first developed quantum theory,
                 setting off a century of scientific revolution. Full of
                 alarming ideas (ghost waves, distant objects that seem
                 to be magically connected, cats that appear both dead
                 and alive), quantum physics has led to countless
                 discoveries and technological advancements. Today our
                 understanding of the world is based on this theory, yet
                 it is still profoundly mysterious. As scientists and
                 philosophers continue to fiercly debate the theory's
                 meaning, Rovelli argues that its most unsettling
                 contradictions can be explained by seeing the world as
                 fundamentally made of relationships, not substances. We
                 and everything around us exist only in our interactions
                 with one another. This bold idea suggests new
                 directions for understanding the structure of reality
                 and even the nature of consciousness. Rovelli makes
                 learning about quantum mechanics an almost psychedelic
                 experience. Shifting our perspective once again, he
                 takes us on a riveting journey through the universe so
                 we can better understand our place in it.",
  acknowledgement = ack-nhfb,
  author-dates = "1956--",
  remark =       "Originally published in Italian under the title
                 Helgoland by Adelphi Edizioni, Milan in 2020
                 \cite{Rovelli:2020:H}.",
  subject =      "Science / Physics.",
  subject-dates = "Werner Heisenberg (1901--1976)",
  tableofcontents = "Looking into the Abyss / xiii \\
                 Part One \\
                 I. Strangely Beautiful Interior \\
                 The Absurd Idea of the Young Heisenberg: Observables /
                 3 \\
                 The Misleading $\psi$ of Erwin Schr{\"o}dinger:
                 Probability / 20 \\
                 The Granularity of the World: Quanta / 30 \\
                 Part Two \\
                 II. A Curious Bestiary of Extreme Ideas \\
                 Superpositions / 41 \\
                 Taking $\psi$ Seriously: Many Worlds, Hidden Variables
                 and Physical Collapses / 54 \\
                 Accepting Indeterminacy / 65 \\
                 III. Is It Possible That Something Is Real in Relation
                 to You But Not in Relation to Me? \\
                 There Was a Time When the World Seemed Simple / 71 \\
                 Relations / 74 \\
                 The Rarefied and Subtle World of Quanta / 82 \\
                 IV. The Web of Relations that Weaves Reality \\
                 Entanglement / 89 \\
                 The Dance for Three That Weaves the Relations of the
                 World / 97 \\
                 Information / 100 \\
                 Part Three \\
                 V. The Unambiguous Description of an Object Includes
                 the Objects to Which It Manifests Itself \\
                 Aleksandr Bogdanov and Vladimir Lenin / 117 \\
                 Naturalism without Substance: Contextuality / 135 \\
                 Without Foundation? N{\=a}g{\=a}juna / 142 \\
                 VI. For Nature It Is a Problem Already Solved \\
                 Simple Matter? / 159 \\
                 What Does ``Meaning'' Mean? / 166 \\
                 The World Seen from Within / 179 \\
                 VII. But Is it Really Possible? \\
                 Acknowledgments / 205 \\
                 Notes / 207 \\
                 Illustration Credits / 223 \\
                 Index / 225",
}

@Article{Rowen:IEEE-MICRO-8-3-53,
  author =       "Chris Rowen and Mark Johnson and Paul Ries",
  title =        "The {MIPS R3010} Floating-Point Coprocessor",
  journal =      j-IEEE-MICRO,
  volume =       "8",
  number =       "3",
  pages =        "53--62",
  month =        may # "\slash " # jun,
  year =         "1988",
  DOI =          "https://doi.org/10.1109/40.540",
  bibdate =      "Wed Sep 14 21:51:25 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Rubinstein:1988:DTI,
  author =       "Richard Rubinstein",
  title =        "Digital Typography: An Introduction to Type and
                 Composition for Computer System Design",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xi + 340",
  year =         "1988",
  ISBN =         "0-201-17633-5",
  ISBN-13 =      "978-0-201-17633-9",
  LCCN =         "Z253.3 .R8 1988",
  bibdate =      "Wed Dec 15 10:41:28 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Ruckert:2015:MSS,
  author =       "Martin Ruckert",
  title =        "The {MMIX} supplement: supplement to {{\booktitle{The
                 Art of Computer Programming, volumes 1, 2, 3}} by
                 Donald E. Knuth}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xxi + 193",
  year =         "2015",
  ISBN =         "0-13-399231-4 (paperback), 0-13-399289-6",
  ISBN-13 =      "978-0-13-399231-1 (paperback), 978-0-13-399289-2",
  LCCN =         "QA76.6 .K64 2005 Suppl. 1",
  bibdate =      "Wed Feb 4 10:19:23 MST 2015",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/hash.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/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/string-matching.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://mmix.cs.hm.edu/",
  abstract =     "In the first edition of Volume 1 of The Art of
                 Computer Programming, Donald E. Knuth introduced the
                 MIX computer and its machine language: a teaching tool
                 that powerfully illuminated the inner workings of the
                 algorithms he documents. Later, with the publication of
                 his Fascicle 1, Knuth introduced MMIX: a modern, 64-bit
                 RISC replacement to the now-obsolete MIX. Now, with
                 Knuth's guidance and approval, Martin Ruckert has
                 rewritten all MIX example programs from Knuth's Volumes
                 1--3 for MMIX, thus completing this MMIX update to the
                 original classic.\par

                 From Donald E. Knuth's Foreword:\par

                 ``I am thrilled to see the present book by Martin
                 Ruckert: It is jam-packed with goodies from which an
                 extraordinary amount can be learned. Martin has not
                 merely transcribed my early programs for MIX and recast
                 them in a modern idiom. He has penetrated to their
                 essence and rendered them anew with elegance and good
                 taste. His carefully checked code represents a
                 significant contribution to the art of pedagogy as well
                 as to the art of programming.''",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "MMIX (Computer architecture); Assembly languages
                 (Electronic computers); Microcomputers; Programming",
  tableofcontents = "Foreword / iii \\
                 Preface / v \\
                 Style Guide / viii \\
                 Programming Techniques / xii \\
                 Basic Concepts / 1 \\
                 Applications to Permutations / 1 \\
                 Input and Output / 8 \\
                 Information Structures / 15 \\
                 Introduction / 15 \\
                 Sequential Allocation / 17 \\
                 Linked Allocation / 18 \\
                 Circular Lists / 25 \\
                 Doubly Linked Lists / 27 \\
                 Arrays and Orthogonal Lists / 36 \\
                 Traversing Binary Trees / 37 \\
                 Binary Tree Representation of Trees / 39 \\
                 Other Representations of Trees / 43 \\
                 Lists and Garbage Collection / 44 \\
                 Dynamic Storage Allocation / 45 \\
                 Random Numbers / 48 \\
                 Choice of modulus / 48 \\
                 Potency / 49 \\
                 Other Methods / 50 \\
                 Numerical Distributions / 51 \\
                 Summary / 52 \\
                 Arithmetic / 53 \\
                 Positional Number Systems / 53 \\
                 Single-Precision Calculations / 53 \\
                 Accuracy of Floating Point Arithmetic / 58 \\
                 Double-Precision Calculations / 58 \\
                 The Classical Algorithms / 62 \\
                 Radix Conversion / 68 \\
                 The Greatest Common Divisor / 70 \\
                 Analysis of Euclid's Algorithm / 71 \\
                 Factoring into Primes / 72 \\
                 Evaluation of Powers / 72 \\
                 Evaluation of Polynomials / 73 \\
                 Sorting / 74 \\
                 Internal Sorting / 74 \\
                 Sorting by Insertion / 76 \\
                 Sorting by Exchanging / 81 \\
                 Sorting by Selection / 87 \\
                 Sorting by Merging / 89 \\
                 Sorting by Distribution / 93 \\
                 Minimum-Comparison Sorting / 94 \\
                 Summary, History and Bibliography / 95 \\
                 Searching / 97 \\
                 Sequential Searching / 97 \\
                 Searching an Ordered Table / 99 \\
                 Binary Tree Searching / 102 \\
                 Balanced Trees / 103 \\
                 Digital Searching / 106 \\
                 Hashing / 108 \\
                 Answers to Exercises / 117 \\
                 The MMIX Assembly Language / 117 \\
                 Applications to Permutations / 120 \\
                 Input and Output / 120 \\
                 Introduction / 122 \\
                 Sequential Allocation / 123 \\
                 Linked Allocation / 124 \\
                 Circular Lists / 128 \\
                 Doubly Linked Lists / 130 \\
                 Arrays and Orthogonal Lists / 132 \\
                 Traversing Binary Trees / 134 \\
                 Binary Tree Representation of Trees / 136 \\
                 Lists and Garbage Collection / 139 \\
                 Dynamic Storage Allocation / 140 \\
                 Choice of modulus / 147 \\
                 Potency / 148 \\
                 Other Methods / 148 \\
                 Numerical Distributions / 149 \\
                 Summary / 150 \\
                 Positional Number Systems / 150 \\
                 Single-Precision Calculations / 151 \\
                 Accuracy of Floating Point Arithmetic / 152 \\
                 Double-Precision Calculations / 153 \\
                 The Classical Algorithms / 156 \\
                 Radix Conversion / 158 \\
                 The Greatest Common Divisor / 160 \\
                 Analysis of Euclid's Algorithm / 160 \\
                 Evaluation of Powers / 161 \\
                 Evaluation of Polynomials / 161 \\
                 Sorting / 162 \\
                 Internal Sorting / 162 \\
                 Sorting by Insertion / 165 \\
                 Sorting by Exchanging / 169 \\
                 Sorting by Selection / 174 \\
                 Sorting by Distribution / 179 \\
                 Minimum-Comparison Sorting / 180 \\
                 Summary, History, and Bibliography / 183 \\
                 Sequential Searching / 183 \\
                 Searching an Ordered Table / 184 \\
                 Binary Tree Searching / 185 \\
                 Balanced Trees / 185 \\
                 Digital Searching / 186 \\
                 Hashing / 186 \\
                 Acknowledgements / 188 \\
                 Index / 189",
}

@Book{Rudman:2007:HMH,
  author =       "Peter Strom Rudman",
  title =        "How mathematics happened: the first 50,000 years",
  publisher =    "Prometheus Books",
  address =      "Amherst, NY, USA",
  pages =        "314",
  year =         "2007",
  ISBN =         "1-59102-477-3",
  ISBN-13 =      "978-1-59102-477-4",
  LCCN =         "QA22 .R86 2007",
  bibdate =      "Fri Nov 9 19:50:37 MST 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/toc/ecip0615/2006020255.html",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "mathematics, ancient; mathematics, Babylonian;
                 mathematics, Egypt; history; metrology",
  tableofcontents = "List of figures \\
                 List of tables \\
                 Preface \\
                 1: Introduction \\
                 1.1: Mathematical Darwinism \\
                 1.2: The replacement concept \\
                 1.3: Number systems \\
                 2: The birth of arithmetic \\
                 2.1: Pattern recognition evolves into counting \\
                 2.2: Counting in hunter-gatherer cultures \\
                 3: Pebble counting evolves into written numbers \\
                 3.1: Herder-farmer and urban cultures in the valley of
                 the Nile \\
                 3.2: Herder-farmer and urban cultures by the waters of
                 Babylon \\
                 3.3: In the jungles of the Maya \\
                 4: Mathematics in the valley of the Nile \\
                 4.1: Egyptian multiplication \\
                 4.2: Egyptian fractions \\
                 4.3: Egyptian algebra \\
                 4.4: Pyramidiots \\
                 5: Mathematics by the waters of Babylon \\
                 5.1: Babylonian multiplication \\
                 5.2: Babylonian fractions \\
                 5.3: Plimpton 322, the enigma \\
                 5.4: Babylonian algebra \\
                 5.5: Babylonian calculation of square root of 2 \\
                 6: Mathematics attains maturity: rigorous proof \\
                 6.1: Pythagoras \\
                 6.2: Eratosthenes \\
                 6.3: Hippasus \\
                 7: We learn history to be able to repeat it \\
                 7.1: Teaching mathematics in ancient Greece and how we
                 should but do not \\
                 Appendix: Answers to fun questions \\
                 Notes and references \\
                 Index",
}

@Book{Ruelle:2007:MB,
  author =       "David Ruelle",
  title =        "The Mathematician's Brain: a Personal Tour Through the
                 Essentials of Mathematics and Some of the Great Minds
                 Behind Them",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "ix + 160",
  year =         "2007",
  ISBN =         "0-691-12982-7",
  ISBN-13 =      "978-0-691-12982-2",
  LCCN =         "QA8.4 .R84 2007",
  bibdate =      "Thu Nov 15 16:07:15 MST 2007",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 prodorbis.library.yale.edu:7090/voyager;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0726/2006049700-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0731/2006049700-t.html;
                 http://www.loc.gov/catdir/enhancements/fy0734/2006049700-b.html",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "Mathematics; Philosophy; Mathematicians; Psychology",
  tableofcontents = "Scientific Thinking \\
                 What Is Mathematics? \\
                 The Erlangen Program \\
                 Mathematics and Ideologies \\
                 The Unity of Mathematics \\
                 A Glimpse into Algebraic Geometry and Arithmetic \\
                 A Trip to Nancy with Alexander Grothendieck \\
                 Structures \\
                 The Computer and the Brain \\
                 Mathematical Texts \\
                 Honors \\
                 Infinity: The Smoke Screen of the Gods \\
                 Foundations \\
                 Structures and Concept Creation \\
                 Turing's Apple \\
                 Mathematical Invention: Psychology and Aesthetics \\
                 The Circle Theorem and an Infinite-Dimensional
                 Labyrinth \\
                 Mistake! \\
                 The Smile of Mona Lisa \\
                 Tinkering and the Construction of Mathematical Theories
                 \\
                 The Strategy of Mathematical Invention \\
                 Mathematical Physics and Emergent Behavior \\
                 The Beauty of Mathematics",
}

@Article{Ryder:pfort,
  author =       "Barbara G. Ryder",
  title =        "The {PFORT} Verifier",
  journal =      j-SPE,
  volume =       "4",
  pages =        "359--377",
  year =         "1974",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Saari:2001:CEM,
  author =       "Donald G. Saari",
  title =        "Chaotic Elections!: a Mathematician Looks at Voting",
  publisher =    pub-AMS,
  address =      pub-AMS:adr,
  pages =        "xiii + 159",
  year =         "2001",
  ISBN =         "0-8218-2847-9 (paperback)",
  ISBN-13 =      "978-0-8218-2847-2 (paperback)",
  LCCN =         "JF1001 .S227 2001",
  bibdate =      "Wed Apr 23 15:57:02 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "What does the 2000 U.S. Presidential Election have in
                 common with selecting a textbook for a calculus course
                 in your department? Was Ralph Nader? influence on the
                 election of George W. Bush greater than the now-famous
                 chads? In \booktitle{Chaotic Elections!}, Don Saari
                 analyzes these questions, placing them in the larger
                 context of voting systems in general. His analysis
                 shows that the fundamental problems with the 2000
                 presidential election are not with the courts, recounts
                 or defective ballots, but are caused by the very way
                 Americans vote for president.\par

                 This expository book shows how mathematics can help to
                 identify and characterize a disturbingly large number
                 of paradoxical situations that result from the choice
                 of a voting procedure. Moreover, rather than being able
                 to dismiss them as anomalies, the likelihood of a
                 dubious election result is surprisingly large. These
                 consequences indicate that election outcomes-whether
                 for president, the site of the next Olympics, the chair
                 of a university department, or a prize winner-can
                 differ from what the voters really wanted. They show
                 that by using an inadequate voting procedure, we can,
                 inadvertently, choose badly. To add to the
                 difficulties, it turns out that the mathematical
                 structures of voting admit several strategic
                 opportunities, which are described.\par

                 Finally, mathematics also helps identify positive
                 results: By using mathematical symmetries, we can
                 identify what the phrase ``what the voters really
                 want'' might mean and obtain a unique voting method
                 that satisfies these conditions.

                 Saari's book should be required reading for anyone who
                 wants to understand not only what happened in the
                 presidential election of 2000, but also how we can
                 avoid similar problems from appearing anytime any group
                 is making a choice using a voting procedure. Reading
                 this book requires little more than high school
                 mathematics and an interest in how the apparently
                 simple situation of voting can lead to surprising
                 paradoxes.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  tableofcontents = "Preface / 1 \\
                 1: A Mess of an Election / 4 \\
                 1. Electoral College / 4 \\
                 2. Other procedures / 17 \\
                 2: Voter Preferences, or the Procedure? / 33 \\
                 1. Some examples / 34 \\
                 2. Representation triangle and profiles / 40 \\
                 3. Procedure lines and elections / 45 \\
                 4. Approval or Cumulative voting? / 53 \\
                 5. More candidates --- toward Lincoln's election / 60
                 \\
                 3: Chaotic Election Outcomes / 69 \\
                 1. Deanna had to withdraw / 70 \\
                 2. General results / 72 \\
                 3. Consequences / 79 \\
                 4. Chaotic notions for chaotic results / 84 \\
                 4: How to Be Strategic / 91 \\
                 1. Choice of a procedure / 92 \\
                 2. Strategic voting / 94 \\
                 3. Debate and selecting amendments / 100 \\
                 4. Any relief? / 102 \\
                 5. Changing the outcome / 103 \\
                 5: What Do the Voters Want? / 109 \\
                 l. Breaking ties and cycles / 110 \\
                 2. Reversal effects / 123 \\
                 3. A profile coordinate system / 129 \\
                 6: Other Procedures; Other Assumptions / 137 \\
                 1. Beyond voting; other aggregation methods / 138 \\
                 2. Apportioning congressional seats on a torus / 143
                 \\
                 3. Other procedures, and other assumptions / 148 \\
                 4. Concluding comment / 152 \\
                 Bibliography / 153 \\
                 Index / 157",
}

@Book{Sabbagh:2003:RHG,
  author =       "Karl Sabbagh",
  title =        "The {Riemann} Hypothesis: the Greatest Unsolved
                 Problem in Mathematics",
  publisher =    "Farrar, Straus and Giroux",
  address =      "New York, NY, USA",
  pages =        "viii + 340",
  year =         "2003",
  ISBN =         "0-374-25007-3, 0-374-52935-3",
  ISBN-13 =      "978-0-374-25007-2, 978-0-374-52935-2",
  LCCN =         "QA241 .S23 2003",
  bibdate =      "Fri Oct 17 10:08:21 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Originally published in 2002 as {\em Dr. Riemann's
                 zeroes} by Grove Atlantic, London, UK.",
  price =        "US\$25.00",
  abstract =     "In \booktitle{The Riemann Hypothesis}, acclaimed
                 author Karl Sabbagh interviews some of the world-class
                 mathematicians who spend their lives working on the
                 hypothesis --- many paying particular attention to
                 ``Riemann's zeros,'' a series of points that are
                 believed to lie in a straight line, though no one can
                 prove it --- and whose approaches to meeting the
                 challenges thrown up by the hypothesis are as diverse
                 as their personalities.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Prime Time \\
                 2: ``Gorgeous stuff'' \\
                 3: New Numbers for Old \\
                 4: Indian Summer \\
                 5: ``Very probably'' \\
                 6: Proofs and Refutations \\
                 7: The Bieberbach Conjecture \\
                 8: In Search of Zeros \\
                 9: The Princeton Tea Party \\
                 10: A Driven Man \\
                 11: The Physics of Mathematics \\
                 12: A Laudable Aim \\
                 13: ``No simple matter'' \\
                 14: Taking a Critical Line \\
                 15: Abstract Delights \\
                 16: Discovered or Invented? \\
                 17: ``What's it all about?'' \\
                 Toolkits \\
                 1: Logarithms and Exponents \\
                 2: Equations \\
                 3: Infinite Series \\
                 4: The Euler Identity \\
                 5: Graphs in Math \\
                 6: Matrices and Eigenvalues \\
                 Appendex: De Branges's Proof",
}

@Book{Sakurai:2017:MQM,
  author =       "J. J. (Jun John) Sakurai and Jim Napolitano",
  title =        "Modern Quantum Mechanics",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  edition =      "Second",
  pages =        "xviii + 550",
  year =         "2017",
  ISBN =         "1-108-42241-1 (hardcover)",
  ISBN-13 =      "978-1-108-42241-3 (hardcover)",
  LCCN =         "QC174.12 .S25 2017",
  bibdate =      "Mon Mar 11 06:54:54 MDT 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  author-dates = "1933--1982",
  libnote =      "Not in my library.",
  remark =       "This book was previously published by Pearson
                 Education, Inc. 1994, 2011. Reissued by Cambridge
                 University Press 2017.",
  subject =      "Quanta, Teor{\'i}a de los; Quantum theory",
  tableofcontents = "Fundamental concepts \\
                 Quantum dynamics \\
                 Theory of angular momentum \\
                 Symmetry in quantum mechanics \\
                 Approximation methods \\
                 Scattering theory \\
                 Identical particles \\
                 Relativistic quantum mechanics \\
                 Electromagnetic units \\
                 Brief summary of elementary solutions to
                 Shr{\"o}dinger's wave equation \\
                 Proof of the angular-momentum addition rule given by
                 equation (3.8.38)",
}

@Book{Salomon:1995:AT,
  author =       "David Salomon",
  title =        "The Advanced {\TeX}book",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xx + 490",
  year =         "1995",
  ISBN =         "0-387-94556-3",
  ISBN-13 =      "978-0-387-94556-9",
  LCCN =         "Z253.4.T47 S25 1995",
  bibdate =      "Fri Sep 10 09:26:14 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$39.95",
  URL =          "http://www.booksbydavidsalomon.com/;
                 http://www.ecs.csun.edu/~dxs/tatb.advertis/tatbAd.html",
  abstract =     "Why is TeX so hard to use? Because it is in essence a
                 programming language and so it is best viewed from this
                 perspective. In this book, the author presents a
                 complete course in TeX which will be suitable for users
                 of TeX who want to advance beyond the basics. The
                 initial chapters introduce the essential workings of
                 TeX, including a detailed discussion of boxes and glue.
                 Later chapters cover a wide range of advanced topics
                 such as: macros, conditionals, tokens, leaders, file
                 I/O, the line- and page-break algorithms, and output
                 routines. Throughout, numerous examples are given and
                 exercises (with answers) provide a means for readers to
                 test their understanding of the material. As a result,
                 no serious user of TeX will want to be without this
                 text.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Introduction \\
                 2: Advanced Introduction \\
                 3: Boxes and Glue \\
                 4: Paragraphs \\
                 5: Macros \\
                 6: Conditionals \\
                 7: Examples of Macros \\
                 8: Tokens and File I/O \\
                 9: Multipass Jobs \\
                 10: Special Topics \\
                 11: Leaders \\
                 12: Tables \\
                 13: Advanced Math \\
                 14: Line and Page Breaks \\
                 15: Handling Errors \\
                 16: Output Routines \\
                 17: OTR Techniques: I \\
                 18: OTR Techniques: II \\
                 19: Insertions \\
                 20: Example Format \\
                 References \\
                 A: Answers to Exercises",
}

@Book{Salomon:1998:DCC,
  author =       "David Salomon",
  title =        "Data Compression: The Complete Reference",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xx + 427",
  year =         "1998",
  ISBN =         "0-387-98280-9",
  ISBN-13 =      "978-0-387-98280-9",
  LCCN =         "QA76.9.D33S25 1997",
  bibdate =      "Fri Sep 10 09:21:56 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$39.95",
  URL =          "http://www.booksbydavidsalomon.com/;
                 http://www.ecs.csun.edu/~dxs/DCadvertis/DcompAd.html",
  abstract =     "Data compression is one of the most important
                 techniques in computing engineering. From archiving
                 data to CD-ROMs and from coding theory to image
                 analysis, many facets of computing make use of data
                 compression in one form or another. This book is
                 intended to provide an overview of the many different
                 types of compression: it includes a taxonomy, an
                 analysis of the most common systems of compression,
                 discussion of their relative benefits and
                 disadvantages, and their most common usages. Readers
                 are presupposed to have a basic understanding of
                 computer science: essentially the storage of data in
                 bytes and bits and computing terminology, but otherwise
                 this book is self-contained. The book divides naturally
                 into four main parts based on the main branches of data
                 compression: run length encoding, statistical methods,
                 dictionary-based methods, and lossy image compression
                 (where in contrast to the other techniques, information
                 in the data may be lossed but an acceptable standard of
                 image quality retained). Detailed descriptions of many
                 of the most well-known compression techniques are
                 covered including: Zip, BinHex, Huffman coding, GIF and
                 many others.",
  acknowledgement = ack-nhfb,
  subject =      "Data compression (Computer science)",
  tableofcontents = "Preface \\
                 1: Basic Techniques \\
                 2: Statistical Methods \\
                 3: Dictionary Methods \\
                 4: Image Compression \\
                 5: Other Methods \\
                 A: ASCII Code \\
                 B: Bibliography \\
                 C: Curves That Fill Space \\
                 D: Determinants and Matrices \\
                 E: Error Correcting Codes \\
                 F: Fourier Transform \\
                 G: Group 4 Codes Summary \\
                 H: Hashing \\
                 I: Interpolating Polynomials \\
                 Answers to Exercises \\
                 Glossary \\
                 Index",
}

@Book{Salomon:1999:CGG,
  author =       "David Salomon",
  title =        "Computer Graphics and Geometric Modeling",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xviii + 851",
  year =         "1999",
  ISBN =         "0-387-98682-0",
  ISBN-13 =      "978-0-387-98682-1",
  LCCN =         "T385 S243 1999",
  bibdate =      "Sat Jan 26 12:46:16 MST 2013",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://www.booksbydavidsalomon.com/;
                 http://www.ecs.csun.edu/~dxs/CGGMadvertis/CGad.html",
  abstract =     "This is a book for those interested in understanding
                 how graphics programs work and how present-day computer
                 graphics can generate realistic-looking curves,
                 surfaces, and solid objects. The book emphasizes the
                 mathematics behind computer graphics, and most of the
                 required mathematics is included in an appendix. With
                 its numerous illustrative examples and (solved)
                 exercises, the book makes a splendid text for a
                 two-semester course in computer graphics for advanced
                 undergraduate or graduate students. It also serves as a
                 fine reference for professionals in the computer
                 graphics field.",
  acknowledgement = ack-ds # " and " # ack-nhfb,
  rawdata-1 =    "Salomon, David (1999) {\it Computer Graphics and
                 Geometric Modeling}, New York, Springer.",
  rawdata-2 =    "Salomon, David (1999) {\it Computer Graphics and
                 Geometric Modeling}, New York, Springer-Verlag.",
  tableofcontents = "1: First Principles \\
                 2: Scan-Converting Methods \\
                 3: Transformations and Projections \\
                 4: Curves \\
                 5: Surfaces \\
                 6: Rendering \\
                 7: Color \\
                 8: Computer Animation \\
                 9: Image Compression \\
                 10: Short Topics \\
                 Appendix: Mathematical Topics",
}

@Book{Salomon:2000:DCC,
  author =       "David Salomon",
  title =        "Data Compression: The Complete Reference",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Second",
  pages =        "xvi + 823",
  year =         "2000",
  ISBN =         "0-387-95045-1",
  ISBN-13 =      "978-0-387-95045-7",
  LCCN =         "QA76.9.D33 S25 2000",
  bibdate =      "Mon Oct 16 05:47:11 2000",
  bibsource =    "clio-db.cc.columbia.edu:7090/Voyager;
                 https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$39.95",
  URL =          "http://www.booksbydavidsalomon.com/;
                 http://www.ecs.csun.edu/~dxs/DCadvertis/Dcomp2Ad.html",
  abstract =     "This new edition of Data Compression provides a
                 comprehensive reference for the many different types
                 and methods of compression. Included are a detailed and
                 helpful taxonomy, a description of most common methods,
                 and discussions on the use and comparative benefits of
                 methods and descriptions of ``how to'' use them. The
                 presentation is organized into the main branches of the
                 field of data compression: run length encoding,
                 statistical methods, dictionary-based methods, image
                 compression, audio compression, and video
                 compression.\par

                 The book provides an invaluable reference and guide for
                 all computer scientists, computer engineers, electrical
                 engineers, signal/image processing engineers, and other
                 scientists needing a comprehensive compilation for a
                 broad range of compression methods.",
  acknowledgement = ack-ds # " and " # ack-nhfb,
  rawdata =      "Salomon, David (2000) {\it Data Compression: The
                 Complete Reference}, New York, Springer-Verlag.",
  subject =      "Data compression (Computer science)",
  tableofcontents = "1. Basic Techniques \\
                 2. Statistical Methods \\
                 3. Dictionary Methods \\
                 4. Image Compression \\
                 5. Wavelet Methods \\
                 6. Video Compression \\
                 7. Audio Compression \\
                 8. Other Methods \\
                 Joining the Data Compression Community",
}

@Book{Salomon:2002:GDC,
  author =       "David Salomon",
  title =        "A Guide to Data Compression Methods",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xii + 295",
  year =         "2002",
  ISBN =         "0-387-95260-8 (paperback)",
  ISBN-13 =      "978-0-387-95260-4 (paperback)",
  LCCN =         "QA76.9.D33 S28 2001",
  bibdate =      "Tue Mar 12 16:09:14 2002",
  bibsource =    "clas.caltech.edu:210/INNOPAC;
                 https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://www.booksbydavidsalomon.com/",
  acknowledgement = ack-nhfb,
  tableofcontents = "1. Statistical Methods \\
                 1. Entropy \\
                 2. Variable-Size Codes \\
                 3. Decoding \\
                 4. Huffman Coding \\
                 5. Adaptive Huffman Coding \\
                 6. Facsimile Compression \\
                 7. Arithmetic Coding \\
                 8. Adaptive Arithmetic Coding \\
                 2. Dictionary Methods \\
                 1. LZ77 (Sliding Window) \\
                 2. LZSS \\
                 3. LZ78 \\
                 4. LZW \\
                 5. Summary \\
                 3. Image Compression \\
                 1. Introduction \\
                 2. Image Types \\
                 3. Approaches to Image Compression \\
                 4. Intuitive Methods \\
                 5. Image Transforms \\
                 6. Progressive Image Compression \\
                 7. JPEG \\
                 8. JPEG-LS \\
                 4. Wavelet Methods \\
                 1. Averaging and Differencing \\
                 2. The Haar Transform \\
                 3. Subband Transforms \\
                 4. Filter Banks \\
                 5. Deriving the Filter Coefficients \\
                 6. The DWT \\
                 7. Examples \\
                 8. The Daubechies Wavelets \\
                 9. SPIHT \\
                 5. Video Compression \\
                 1. Basic Principles \\
                 2. Suboptimal Search Methods \\
                 6. Audio Compression \\
                 1. Sound \\
                 2. Digital Audio \\
                 3. The Human Auditory System \\
                 4. Conventional Methods \\
                 5. MPEG-1 Audio Layers \\
                 Joining the Data Compression Community \\
                 App. of Algorithms",
}

@Book{Salomon:2003:DPS,
  author =       "David Salomon",
  title =        "Data Privacy and Security",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xiv + 465",
  year =         "2003",
  ISBN =         "0-387-00311-8",
  ISBN-13 =      "978-0-387-00311-5",
  LCCN =         "QA76.9.A25 S265 2003",
  bibdate =      "Mon Jun 16 18:35:35 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook2.bib",
  price =        "US\$59.95",
  URL =          "http://www.booksbydavidsalomon.com/",
  abstract =     "This integrated volume focuses on keeping data secure
                 and private and covers classical cryptography, modern
                 cryptography, and steganography. Each topic is
                 presented and explained by describing various methods,
                 techniques, and algorithms. Moreover, there are
                 numerous helpful examples to reinforce the reader's
                 understanding and expertise with these techniques and
                 methodologies.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Part I: Data Encryption \\
                 1: Monoalphabetic Substitution Ciphers \\
                 2: Transposition Ciphers \\
                 3: Polyalphabetic Substitution Ciphers \\
                 4: Random Numbers \\
                 5: The Enigma \\
                 6: Stream Ciphers \\
                 7: Block Ciphers \\
                 8: Public-Key Cryptography \\
                 9: Quantum Cryptography \\
                 Part II: Data Hiding \\
                 10: Data Hiding in Text \\
                 11: Data Hiding in Images \\
                 12: Data Hiding: Other Methods \\
                 Part III: Essential Resources \\
                 Appendix A: Convolution \\
                 Appendix B: Hashing \\
                 Appendix C: Cyclic Redundancy Codes \\
                 Appendix D: Galois Fields",
}

@Book{Salomon:2004:DCC,
  author =       "David Salomon",
  title =        "Data Compression: The Complete Reference",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Third",
  pages =        "xx + 898",
  year =         "2004",
  ISBN =         "0-387-40697-2",
  ISBN-13 =      "978-0-387-40697-8",
  LCCN =         "QA76.9.D33 S25 2004",
  bibdate =      "Wed Apr 28 13:21:19 2004",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook2.bib",
  URL =          "http://www.booksbydavidsalomon.com/;
                 http://www.ecs.csun.edu/~dsalomon/DC3advertis/DComp3Ad.html",
  abstract =     "This substantially enhanced reference is an essential
                 resource and companion for all computer scientists,
                 computer electrical, and signal image processing
                 engineers, and scientists needing a comprehensive
                 compilation of compression methods. It requires only a
                 minimum of mathematics and is well suited to
                 nonspecialists and general readers.",
  acknowledgement = ack-ds # " and " # ack-nhfb,
  tableofcontents = "1. Basic techniques \\
                 1.1 Intuitive compression \\
                 1.2 Run-length encoding \\
                 1.3 RLE text compression \\
                 1.4 RLE image compression \\
                 1.5 Move-to-front coding \\
                 1.6 Scalar quantization \\
                 2. Statistical methods \\
                 2.1 Information theory concepts \\
                 2.2 Variable-size codes \\
                 2.3 Prefix codes \\
                 2.4 The Golomb code \\
                 2.5 The Kraft--MacMillan inequality \\
                 2.6 The counting argument \\
                 2.7 Shannon--Fano coding \\
                 2.8 Huffman coding \\
                 2.9 Adaptive Huffman coding \\
                 2.10 MNP5 \\
                 2.11 MNP7 \\
                 2.12 Reliability \\
                 2.13 Facsimile compression \\
                 2.14 Arithmetic coding \\
                 2.16 The QM coder \\
                 2.17 Text compression \\
                 2.18 PPM \\
                 2.19 Context-tree weighting \\
                 3. Dictionary methods \\
                 3.1 String compression \\
                 3.2 Simple dictionary compression \\
                 3.3 LZ77 (sliding window) \\
                 3.4 LZSS \\
                 3.5 Repetition times \\
                 3.6 QIC-122 \\
                 3.7 LZX \\
                 3.8 File differencing: VCDIFF \\
                 3.9 LZ78 \\
                 3.10 LZFG \\
                 3.11 LZRW1 \\
                 3.12 LZRW4 \\
                 3.13 LZW \\
                 3.14 LZMW \\
                 3.15 LZAP \\
                 3.16 LZY \\
                 3.17 LZP \\
                 3.18 Repetition finder \\
                 3.19 UNIX compression \\
                 3.20 GIF images \\
                 3.21 The V.42vis protocol \\
                 3.22 Various LZ applications \\
                 3.23 Deflate: Zip and Gzip \\
                 3.24 PNG \\
                 3.25 XML compression: XMill \\
                 3.26 EXE compressors \\
                 3.27 CRC \\
                 3.28 Summary \\
                 3.29 Data compression patents \\
                 3.30 A unification \\
                 4. Image compression \\
                 4.1 Introduction \\
                 4.2 Approaches to image compression \\
                 4.3 Intuitive methods \\
                 4.4 Image transforms \\
                 4.5 Orthogonal transforms \\
                 4.6 The discrete cosine transform \\
                 4.7 Test images \\
                 4.8 JPEG \\
                 4.9 JPEG-LS \\
                 4.10 Progressive image compression \\
                 4.11 JBIG \\
                 4.12 JBIG2 \\
                 4.13 Simple images: EIDAC \\
                 4.14 Vector quantization \\
                 4.15 Adaptive vector quantization \\
                 4.16 Block matching \\
                 4.17 Block truncation coding \\
                 4.18 Context-based methods \\
                 4.19 FELICS \\
                 4.20 Progressive FELICS \\
                 4.21 MLP \\
                 4.22 Adaptive Golomb \\
                 4.23 PPPM \\
                 4.24 CALIC \\
                 4.25 Differential lossless compression \\
                 4.26 DPCM \\
                 4.27 Context-tree weighting \\
                 4.28 Block decomposition \\
                 4.29 Binary tree predictive coding \\
                 4.30 Quadtrees \\
                 4.31 Quadrisection \\
                 4.32 Space-filling curves \\
                 4.33 Hilbert scan and VQ \\
                 4.34 Finite automata methods \\
                 4.35 Iterated function systems \\
                 4.36 Cell encoding \\
                 5. Wavelet methods \\
                 5.1 Fourier transform \\
                 5.2 The frequency domain \\
                 5.3 The uncertainty principle \\
                 5.4 Fourier image compression \\
                 5.5 The CWT and its inverse \\
                 5.6 The Haar transform \\
                 5.7 Filter banks \\
                 5.8 The DWT \\
                 5.9 Multiresolution decomposition \\
                 5.10 Various image decompositions \\
                 5.11 The lifting scheme \\
                 5.12 The IWT \\
                 5.13 The Laplacian pyramid \\
                 5.14 SPIHT \\
                 5.15 CREW \\
                 5.16 EZW \\
                 5.17 DjVu \\
                 5.18 WSQ, fingerprint compression \\
                 5.19 JPEG 2000 \\
                 6. Video compression \\
                 6.1 Analog video \\
                 6.2 Composite and components video \\
                 6.3 Digital video \\
                 6.4 Video compression \\
                 6.5 MPEG \\
                 6.6 MPEG-4 \\
                 6.7 H.261 \\
                 7. Audio compression \\
                 7.1 Sound \\
                 7.2 Digital audio \\
                 7.3 The human auditory system \\
                 7.4 $\mu$-law and A-law companding \\
                 7.5 ADPCM audio compression \\
                 7.6 MLP audio \\
                 7.7 Speech compression \\
                 7.8 Shorten \\
                 7.9 MPEG-1 audio layers \\
                 8. Other methods \\
                 8.1 The Burrows--Wheeler method \\
                 8.2 Symbol ranking \\
                 8.3 ACB \\
                 8.4 Sort-based context similarity \\
                 8.5 Sparse strings \\
                 8.6 Word-based text compression \\
                 8.7 Textual image compression \\
                 8.8 Dynamic Markov coding \\
                 8.9 FHM curve compression \\
                 8.10 Sequitur \\
                 8.11 Triangle mesh compression: Edgebreaker \\
                 8.12 SCSU: Unicode compression \\
                 Bibliography \\
                 Glossary \\
                 Joining the Data Compression Community \\
                 Index",
}

@Book{Salomon:2005:CDC,
  author =       "David Salomon",
  title =        "Coding for Data and Computer Communications",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xv + 548",
  year =         "2005",
  ISBN =         "0-387-21245-0",
  ISBN-13 =      "978-0-387-21245-6",
  LCCN =         "TK5102.94 .S35 2005",
  bibdate =      "Mon Apr 25 16:21:05 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.DavidSalomon.name/Codes/Codes.html;
                 http://www.ecs.csun.edu/~dsalomon/",
  acknowledgement = ack-nhfb,
  subject =      "Telecommunication systems; Coding theory;
                 Cryptography",
  tableofcontents = "Preface vii \\
                 \\
                 Part I: Channel Coding 1 \\
                 \\
                 1 Error-Control Codes 3 \\
                 2 Check Digits for Error Detection 35 \\
                 \\
                 Part II: Source Codes 59 \\
                 \\
                 3 Statistical Methods 67 \\
                 4 Dictionary Methods 111 \\
                 5 Image Compression 133 \\
                 \\
                 Part III: Secure Codes 197 \\
                 \\
                 6 Basic Concepts 199 \\
                 7 Monoalphabetic Substitution Ciphers 213 \\
                 8 Transposition Ciphers 227 \\
                 9 Polyalphabetic Substitution Ciphers 243 \\
                 10 Stream Ciphers 269 \\
                 11 Block Ciphers 289 \\
                 12 Public-Key Cryptography 311 \\
                 13 Data Hiding 341 \\
                 14 Data Hiding in Images 365 \\
                 15 Data Hiding: Other Methods 417 \\
                 \\
                 Part IV: Essential Resources 445 \\
                 \\
                 Appendixes \\
                 \\
                 A Symmetry Groups 447 \\
                 B Galois Fields 451 \\
                 B.1 Field Definitions and Operations 451 \\
                 B.2 Polynomial Arithmetic 459 \\
                 C Cyclic Redundancy Codes 461 \\
                 D Projects 465 \\
                 \\
                 Answers to Exercises 471 \\
                 \\
                 Glossary 503 \\
                 \\
                 Bibliography 523 \\
                 \\
                 Index 533",
}

@Book{Salomon:2005:FCS,
  author =       "David Salomon",
  title =        "Foundations of Computer Security",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xxi + 368",
  year =         "2005",
  DOI =          "https://doi.org/10.1007/1-84628-341-8",
  ISBN =         "1-84628-193-8 (hardcover), 1-84628-341-8",
  ISBN-13 =      "978-1-84628-193-8 (hardcover), 978-1-84628-341-3",
  LCCN =         "QA76.9.A25 S2656 2005",
  bibdate =      "Sat Jan 7 09:42:09 MST 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.springer.com/sgw/cda/frontpage/0,11855,4-40007-22-65173048-0,00.html;
                 http://www.springer.com/sgw/cda/pageitems/document/cda_downloaddocument/0,11855,0-0-45-166687-p65173048,00.pdf;
                 http://www.springer.com/sgw/cda/pageitems/document/cda_downloaddocument/0,11855,0-0-45-166688-p65173048,00.pdf;
                 http://www.springer.com/sgw/cda/pageitems/document/cda_downloaddocument/0,11855,0-0-45-166689-p65173048,00.pdf",
  acknowledgement = ack-nhfb,
  keywords =     "authentication; computer security; cryptography;
                 encryption; firewalls; identity theft; malware;
                 physical security; spyware; trojan horses; viruses;
                 worms",
  publishersummary = "Anyone with a computer has heard of viruses, had
                 to deal with several, and has been struggling with
                 spam, spyware, and disk crashes. This book is intended
                 as a starting point for those familiar with basic
                 concepts of computers and computations and who would
                 like to extend their knowledge into the realm of
                 computer and network security. Its comprehensive
                 treatment of all the major areas of computer security
                 aims to give readers a complete foundation in the field
                 of Computer Security. Exercises are given throughout
                 the book and are intended to strengthening the reader?s
                 knowledge --- answers are also provided.\par

                 Written in a clear, easy to understand style, aimed
                 towards advanced undergraduates and non-experts who
                 want to know about the security problems confronting
                 them everyday. The technical level of the book is low
                 and requires no mathematics, and only a basic concept
                 of computers and computations. Foundations of Computer
                 Security will be an invaluable tool for students and
                 professionals alike.",
  tableofcontents = "Physical Security \\
                 Viruses \\
                 Worms \\
                 Trojan Horses \\
                 Examples of Malware \\
                 Prevention and Defenses \\
                 Network Security \\
                 Authentication \\
                 Spyware \\
                 Identity Theft \\
                 Privacy and Trust \\
                 Elements of Cryptography",
}

@Book{Salomon:2006:CSC,
  author =       "David Salomon",
  title =        "Curves and Surfaces for Computer Graphics",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xvi + 460",
  year =         "2006",
  ISBN =         "0-387-24196-5, 0-387-28452-4 (e-book)",
  ISBN-13 =      "978-0-387-24196-8, 978-0-387-28452-1 (e-book)",
  LCCN =         "T385 .S2434 2005",
  bibdate =      "Sat Jan 26 12:46:16 MST 2013",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook2.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-ds # " and " # ack-nhfb,
  rawdata =      "Salomon, David (2006) {\it Curves and Surfaces for
                 Computer Graphics}, New York, Springer.",
  subject =      "Computer graphics; Mathematical models",
  tableofcontents = "1. Basic theory \\
                 2. Linear interpolation \\
                 3. Polynomial interpolation \\
                 4. Hermite interpolation \\
                 5. Spline interpolation \\
                 6. B{\'e}zier approximation \\
                 7. B-spline approximation \\
                 8. Subdivision methods \\
                 9. Sweep surfaces \\
                 A. Conic sections \\
                 B. Approximate circles \\
                 C. Graphics gallery \\
                 D. Mathematica notes",
}

@Book{Salomon:2006:TPC,
  author =       "David Salomon",
  title =        "Transformations and Projections in Computer Graphics",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xiv + 288",
  year =         "2006",
  ISBN =         "1-84628-392-2",
  ISBN-13 =      "978-1-84628-392-5",
  LCCN =         "T385 .S2439 2006",
  bibdate =      "Fri Aug 25 14:38:27 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook2.bib;
                 prodorbis.library.yale.edu:7090/voyager;
                 z3950.loc.gov:7090/Voyager",
  price =        "US\$59.95",
  abstract =     "Computer graphics are part of everyone's lives via
                 feature films, advertisements, computers, PDAs, mobile
                 phones, and more. This book introduces perspective and
                 discusses the mathematics of perspective. It also
                 discusses nonlinear projections in depth, including the
                 fisheye, panorama, and map projections used to enhance
                 digital images.",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "1. Transformations \\
                 2. Parallel projections \\
                 3. Perspective projection \\
                 4. Nonlinear projections \\
                 A. Vector products \\
                 B. Quaternions \\
                 C. Color figures",
  tableofcontents = "1: Transformations \\
                 Introduction \\
                 Two-Dimensional Transformations \\
                 Three-Dimensional Coordinate Systems \\
                 Three-Dimensional Transformations \\
                 Transforming the Coordinate System \\
                 2: Parallel Projections \\
                 Orthographic Projections \\
                 Axonometric Projections \\
                 Oblique Projections \\
                 3: Perspective Projection \\
                 One Two Three \ldots{} Infinity \\
                 History of Perspective \\
                 Perspective in Curved Objects \\
                 The Mathematics of Perspective \\
                 General Perspective \\
                 Transforming The Object \\
                 Viewer At An Arbitrary Location \\
                 Coordinate-Free Approach \\
                 The Viewing Volume \\
                 Stereoscopic Images \\
                 Creating a Stereoscopic Image \\
                 Viewing a Stereoscopic Image \\
                 4: Nonlinear Projections \\
                 False Perspective \\
                 Fisheye Projection \\
                 Circle Inversion \\
                 Panoramic Projections \\
                 Cylindrical Panoramic Projection \\
                 Spherical Panoramic Projection \\
                 Cubic Panoramic Projection \\
                 Six-Point Perspective \\
                 Other Panoramic Projections \\
                 Panoramic Cameras \\
                 Telescopic Projection \\
                 Microscopic Projection \\
                 Anamorphosis \\
                 Map Projections \\
                 A. Vector products \\
                 B. Quaternions \\
                 C. Color figures",
}

@Book{Salomon:2007:DCC,
  author =       "David Salomon",
  title =        "Data Compression: The Complete Reference",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Fourth",
  pages =        "xxv + 1092",
  year =         "2007",
  ISBN =         "1-84628-602-6",
  ISBN-13 =      "978-1-84628-602-5",
  LCCN =         "QA76.9.D33 S25 2007",
  bibdate =      "Tue Jan 23 14:16:11 MST 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 prodorbis.library.yale.edu:7090/voyager;
                 z3950.loc.gov:7090/Voyager",
  note =         "With contributions by Giovanni Motta and David
                 Bryant.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Front Matter \\
                 Introduction \\
                 Basic Techniques \\
                 Statistical Methods \\
                 Dictionary Methods \\
                 Image Compression \\
                 Wavelet Methods \\
                 Video Compression \\
                 Audio Compression \\
                 Other Methods \\
                 Back Matter",
}

@Book{Salomon:2007:VLC,
  author =       "David Salomon",
  title =        "Variable-length Codes for Data Compression",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xii + 191",
  year =         "2007",
  ISBN =         "1-84628-958-0",
  ISBN-13 =      "978-1-84628-958-3",
  LCCN =         "QA76.9.D33 S25 2007",
  bibdate =      "Wed Oct 17 14:22:23 MDT 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 prodorbis.library.yale.edu:7090/voyager;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  tableofcontents = "1. Basic Codes \\
                 1.1. Codes, Fixed- and Variable-Length \\
                 1.2. Prefix Codes \\
                 1.3. VLCs, Entropy, and Redundancy \\
                 1.4. Universal Codes \\
                 1.5. Kraft-McMillan Inequality \\
                 1.6. Tunstall Code \\
                 1.7. Schalkwijk's Coding \\
                 1.8. Tjalkens--Willems V-to-B Coding \\
                 1.9. Phased-In Codes \\
                 1.10. Redundancy Feedback (RF) Coding \\
                 1.11. Recursive Phased-In Codes \\
                 1.12. Self-Delimiting Codes \\
                 1.13. Huffman Coding \\
                 2. Advanced Codes \\
                 2.1. VLCs for Integers \\
                 2.2. Start-Step-Stop Codes \\
                 2.3. Start/Stop Codes \\
                 2.4. Elias Codes \\
                 2.5. Levenstein Code \\
                 2.6. Even--Rodeh Code \\
                 2.7. Punctured Elias Codes \\
                 2.8. Other Prefix Codes \\
                 2.9. Ternary Comma Code \\
                 2.10. Location Based Encoding (LBE) \\
                 2.11. Stout Codes \\
                 2.12. Boldi--Vigna ([zeta]) Codes \\
                 2.13. Yamamoto's Recursive Code \\
                 2.14. VLCs and Search Trees \\
                 2.15. Taboo Codes \\
                 2.16. Wang's Flag Code \\
                 2.17. Yamamoto Flag Code \\
                 2.18. Number Bases \\
                 2.19. Fibonacci Code \\
                 2.20. Generalized Fibonacci Codes \\
                 2.21. Goldbach Codes \\
                 2.22. Additive Codes \\
                 2.23. Golomb Code \\
                 2.24. Rice Codes \\
                 2.25. Subexponential Code \\
                 2.26. Codes Ending with ``1'' \\
                 3. Robust Codes \\
                 3.1. Codes For Error Control \\
                 3.2. Free Distance \\
                 3.3. Synchronous Prefix Codes \\
                 3.4. Resynchronizing Huffman Codes \\
                 3.5. Bidirectional Codes \\
                 3.6. Symmetric Codes \\
                 3.7. VLEC Codes \\
                 Summary and Unification \\
                 Bibliography \\
                 Index",
}

@Book{Salomon:2008:CID,
  author =       "David Salomon",
  title =        "A Concise Introduction to Data Compression",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xiii + 310",
  year =         "2008",
  ISBN =         "1-84800-071-5 (paperback)",
  ISBN-13 =      "978-1-84800-071-1 (paperback)",
  LCCN =         "QA76.9.D33 S34 2008",
  bibdate =      "Thu Feb 21 12:37:12 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.gbv.de:20011/gvk; z3950.loc.gov:7090/Voyager",
  price =        "EUR 32",
  series =       "Undergraduate topics in computer science",
  abstract =     "Compressing data is an option naturally selected when
                 faced with problems of high costs or restricted space.
                 Written by a renowned expert in the field, this book
                 offers readers a succinct, reader-friendly foundation
                 to the chief approaches, methods and techniques
                 currently employed in the field of data compression.
                 Part I presents the basic approaches to data
                 compression and describes a few popular techniques and
                 methods commonly used to compress data. The reader
                 discovers essential concepts, such as variable-length
                 and prefix codes, statistical distributions and
                 run-length encoding. Part II then concentrates on
                 advanced techniques, such as arithmetic coding,
                 orthogonal transforms, subband transforms and the
                 Burrows--Wheeler transform.",
  acknowledgement = ack-nhfb,
  subject =      "computer science; data structures (computer science);
                 data structures; cryptology and information theory;
                 data compression (computer science)",
  tableofcontents = "Pt. I. Basic Concepts \\
                 1. Approaches to Compression \\
                 2. Huffman Coding \\
                 3. Dictionary Methods \\
                 Pt. II. Advanced Techniques \\
                 4. Arithmetic Coding \\
                 5. Image Compression \\
                 6. Audio Compression \\
                 7. Other Methods",
}

@Book{Salomon:2011:CGM,
  author =       "David Salomon",
  title =        "The Computer Graphics Manual",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xxiii + 1--727 + 5 + xxiii + 1--6 + 731--1503 + 5",
  year =         "2011",
  DOI =          "https://doi.org/10.1007/978-0-85729-886-7",
  ISBN =         "0-85729-885-2 (print), 0-85729-886-0 (e-book)",
  ISBN-13 =      "978-0-85729-885-0 (print), 978-0-85729-886-7
                 (e-book)",
  ISSN =         "1868-0941 (print), 1868-095X (electronic)",
  LCCN =         "T385 .S25 2011",
  bibdate =      "Fri Oct 28 16:59:37 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  tableofcontents = "Part I: Basic Techniques \\
                 Historical Notes \\
                 Raster Graphics \\
                 Scan Conversion \\
                 Part II: Transformations and Projections \\
                 Transformations \\
                 Parallel Projections \\
                 Perspective Projection \\
                 Nonlinear Projections \\
                 Part III: Curves and Surfaces \\
                 Basic Theory \\
                 Linear Interpolation \\
                 Polynomial Interpolation \\
                 Hermite Interpolation \\
                 Spline Interpolation \\
                 B{\'e}zier Approximation \\
                 B-Spline Approximation \\
                 Subdivision Methods \\
                 Sweep Surfaces \\
                 Part IV: Advanced Techniques \\
                 Rendering \\
                 Visible Surface Determination \\
                 Computer Animation \\
                 Graphics Standards \\
                 Color \\
                 Fractals \\
                 Part V: Image Compression \\
                 Compression Techniques \\
                 Transforms and JPEG \\
                 The Wavelet Transform \\
                 Part VI: Graphics Devices \\
                 Graphics Devices \\
                 Part VII: Appendixes",
}

@Book{Salthouse:1972:PGC,
  author =       "J. A. Salthouse and M. J. Ware",
  title =        "Point group character tables and related data",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "v + 88",
  year =         "1972",
  ISBN =         "0-521-08139-4",
  ISBN-13 =      "978-0-521-08139-9",
  LCCN =         "QD911 .S25 1972",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Salus:1994:QCU,
  author =       "Peter H. Salus",
  title =        "A Quarter Century of {UNIX}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xii + 256",
  year =         "1994",
  ISBN =         "0-201-54777-5",
  ISBN-13 =      "978-0-201-54777-1",
  LCCN =         "QA76.76.O63 S342 1994",
  bibdate =      "Thu Nov 14 06:38:30 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  URL =          "http://wiki.tuhs.org/doku.php?id=publications:quarter_century_of_unix",
  abstract =     "UNIX is a software system that is simple, elegant,
                 portable, and powerful. It grew in popularity without
                 the benefit of a large marketing organization.
                 Programmers kept using it; big companies kept fighting
                 it. After a decade, it was clear that the users had
                 won. \booktitle{A Quarter Century of UNIX} is the first
                 book to explain this incredible success, using the
                 words of its creators, developers and users to
                 illustrate how the sociology of a technical group can
                 overwhelm the intent of multi-billion-dollar
                 corporations. In preparing to write this book, Peter
                 Salus interviewed over 100 of these key figures and
                 gathered relevant information from Australia to
                 Austria. This is the book that turns UNIX folklore into
                 UNIX history. Features: provides the first documented
                 history of the development of the UNIX operating
                 system, includes interviews with over 100 key figures
                 in the UNIX community, contains classic photos and
                 illustrations, and explains why UNIX succeeded.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Acknowledgments \\
                 Preface \\
                 Introduction Part I. Genesis \\
                 0: Prelude to space \\
                 1: Summer 1969--Fall 1970 \\
                 2: Calculating and computing \\
                 3: Operating systems \\
                 4: Project MAC: CTSS and Multics \\
                 Part II. Birth of a system \\
                 5: The PDP-11 \\
                 6: First edition, 1971 \\
                 7: C and pipes: 1971-1973 \\
                 8: The first paper -1973 \\
                 9: The law --- part I \\
                 Status 1974 \\
                 Part III. What makes UNIX Unix? 10: The users \\
                 11: Why Unix? \\
                 12: Style and tools \\
                 13: PWB and MERT \\
                 14: Utilities \\
                 Part IV. Unix spreads and blossoms \\
                 15: The users --- part II \\
                 16: Berkeley Unix: part I \\
                 17: Version 7 \\
                 18: Berkeley Unix: part II \\
                 19: Commercial Unix \\
                 20: DEC \\
                 21: The law --- part II \\
                 Part V. The Unix industry \\
                 22: /usr/group \\
                 23: Sun and JAWS \\
                 24: Standards \\
                 Part VI. The currents of change \\
                 25: Duelling Unixes \\
                 26: Offspring systems \\
                 27: OSF and UI \\
                 28: Berkeley Unix: after the VAX \\
                 29: The law --- part III \\
                 Finale \\
                 Finale: What Made it Work? \\
                 Further Reading \\
                 Who's Who and What's What \\
                 Index",
}

@Book{Sander:2012:MHA,
  author =       "Richard Henry Sander and Stuart Taylor",
  title =        "Mismatch: How Affirmative Action Hurts Students It's
                 Intended to Help, and Why Universities Won't Admit It",
  publisher =    pub-BASIC-BOOKS,
  address =      pub-BASIC-BOOKS:adr,
  year =         "2012",
  ISBN =         "0-465-02996-5 (hardcover), 0-465-03001-7 (e-book)",
  ISBN-13 =      "978-0-465-02996-9 (hardcover), 978-0-465-03001-9
                 (e-book)",
  LCCN =         "LC213.52 .S26 2012",
  bibdate =      "Sat Sep 15 11:31:46 MDT 2018",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Affirmative action programs in education; United
                 States; Discrimination in education; Universities and
                 colleges; Admission; Educational equalization;
                 Minorities; Education (Higher); Democratizaci{\'o}n de
                 la ense{\"a}nanza; Estados Unidos; Programas de
                 acci{\'o}n positiva; Integraci{\'o}n escolar;
                 Universidades; Administraci{\'o}n; Minor{\'i}as;
                 Educaci{\'o}n; Affirmative action programs in
                 education.; Discrimination in education.; Educational
                 equalization.; Education (Higher); Admission.",
  tableofcontents = "The idea of mismatch and why it matters \\
                 A primer on affirmative action \\
                 The discovery of the mismatch effect \\
                 Law school mismatch \\
                 The debate on law school mismatch \\
                 The breadth of mismatch \\
                 Proposition 209: the high road and the low road \\
                 The warming effect \\
                 Mismatch and the swelling ranks of graduates \\
                 The hydra of preferences: the evasion of prop 209 at
                 the University of California \\
                 Why academics avoid honest debate about affirmative
                 action \\
                 Media, politics, and the accountability void \\
                 The supreme court: rewarding opacity \\
                 The George Mason affair \\
                 Transparency and the California Bar affair \\
                 Class, race, and the targeting of preferences \\
                 Closing the test score gap: better parenting and K-12
                 education",
}

@Book{Sanders:2010:CEI,
  author =       "Jason Sanders and Edward Kandrot",
  title =        "{CUDA} by Example: an Introduction to General-purpose
                 {GPU} Programming",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xix + 290",
  year =         "2010",
  ISBN =         "0-13-138768-5",
  ISBN-13 =      "978-0-13-138768-3",
  LCCN =         "QA76.76.A65",
  bibdate =      "Wed Jul 28 23:24:12 MDT 2010",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/d/dongarra-jack-j.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/pvm.bib;
                 https://www.math.utah.edu/pub/tex/bib/scpe.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib;
                 z3950.gbv.de:20011/gvk",
  abstract =     "CUDA is a computing architecture designed to
                 facilitate the development of parallel programs. This
                 book shows programmers how to employ this new
                 technology. Each area of CUDA development is introduced
                 through working examples. After a concise introduction
                 to the CUDA platform and architecture, as well as a
                 quick-start guide to CUDA C, the book details the
                 techniques and trade-offs associated with each key CUDA
                 feature.",
  acknowledgement = ack-nhfb,
  keywords =     "CUDA; GPU",
  subject =      "application software; development; computer
                 architecture; parallel programming (computer science)",
  tableofcontents = "Why CUDA? why now? \\
                 Getting started \\
                 Introduction to CUDA C \\
                 Parallel programming in CUDA C \\
                 Thread cooperation \\
                 Constant memory and events \\
                 Texture memory \\
                 Graphics interoperability \\
                 Atomics \\
                 Streams \\
                 CUDA C on multiple GPUs \\
                 The final countdown \\
                 Appendix A: Advanced atomics",
}

@Book{Sandifer:2007:EML,
  author =       "Charles Edward Sandifer",
  title =        "The Early Mathematics of {Leonhard Euler}",
  volume =       "1",
  publisher =    pub-MAA,
  address =      pub-MAA:adr,
  pages =        "xix + 391",
  year =         "2007",
  ISBN =         "0-88385-559-3",
  ISBN-13 =      "978-0-88385-559-1",
  LCCN =         "QA29.E8 S26 2007",
  bibdate =      "Mon Aug 10 17:49:32 MDT 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Spectrum series; MAA tercentenary Euler celebration",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0743/2006933948-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0743/2006933948-t.html",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Euler, Leonhard; Mathematics; History; 18th century",
  subject-dates = "1707--1783",
  tableofcontents = "Preface \\
                 Interlude: 1725--1727 \\
                 Construction of isochronal curves in any kind of
                 resistant \\
                 Method of finding reciprocal algebraic trajectories \\
                 Interlude 1728 \\
                 Solution to problems of reciprocal trajectories \\
                 A new method of reducing innumerable differential
                 equations of the second degree to equations of the
                 first degree \\
                 Interlude 1729--1731 \\
                 On transcendental progressions, or those for which the
                 general term cannot be given algebraically \\
                 On the shortest curve on a surface that joins any two
                 given points \\
                 On the summation of innumerably many progressions \\
                 Interlude 1732 \\
                 General methods for summing progressions \\
                 Observations on theorems that Fermat and others have
                 looked at about prime numbers \\
                 An account of the solution of isoperimetric problems in
                 the broadest sense \\
                 Interlude 1733 \\
                 Construction of differential equations which do not
                 admit separation of variables \\
                 Example of the solution of a differential equation
                 without separation of variables \\
                 On the solution of problems of Diophantus about integer
                 numbers \\
                 Inferences on the forms of roots of equations and of
                 their orders \\
                 Solution of the differential equation $a x^n dx = dy +
                 y^2 dx$ \\
                 Interlude 1734 \\
                 On curves of fastest descent in a resistant medium \\
                 Observations on harmonic progressions \\
                 On an infinity of curves of a given kind, or a method
                 of finding equations for an infinity of curves of a
                 given kind \\
                 Additions to the dissertation on infinitely many curves
                 of a given kind \\
                 Investigation of two curves, the abscissas of which are
                 corresponding arcs and the sum of which is algebraic
                 \\
                 Interlude 1735 \\
                 On sums of series of reciprocals \\
                 A universal method for finding sums which approximate
                 convergent series \\
                 Finding the sum of a series from a given general term
                 \\
                 On the solution of equations from the motion of pulling
                 and other equations pertaining to the method of inverse
                 tangents \\
                 Solution of a problem requiring the rectification of an
                 ellipse \\
                 Solution of a problem relating to the geometry of
                 position \\
                 Interlude 1736 \\
                 Proof of some theorems about looking at prime numbers
                 \\
                 Further universal methods for summing series \\
                 A new and easy way of finding curves enjoying
                 properties of maximum or minimum \\
                 Interlude 1737 \\
                 On the solution of equations \\
                 An essay on continued fractions \\
                 Various observations about infinite series \\
                 Solution to a geometric problem about lunes formed by
                 circles \\
                 Interlude 1738 \\
                 On rectifiable algebraic curves and algebraic
                 reciprocal trajectories \\
                 On various ways of closely approximating numbers for
                 the quadrature of the circle \\
                 On differential equations which sometimes can be
                 integrated \\
                 Proofs of some theorems of arithmetic \\
                 Solution of some problems that were posed by the
                 celebrated Daniel Bernoulli \\
                 Interlude 1739 \\
                 On products arising from infinitely many factors \\
                 Observations on continued fractions \\
                 Consideration of some progressions appropriate for
                 finding the quadrature of the circle \\
                 An easy method for computing sines and tangents of
                 angles both natural and artificial \\
                 Investigation of curves which produce evolutes that are
                 similar to themselves \\
                 Considerations about certain series \\
                 Interlude 1740 \\
                 Solution of problems in arithmetic of finding a number,
                 which, when divided by given numbers leaves given
                 remainders \\
                 On the extraction of roots of irrational quantities \\
                 Interlude 1741 \\
                 Proof of the sum of this series $1 + 1/4 + 1/9 + 1/16 +
                 1/25 + 1/ 36 +$ etc \\
                 Several analytic observations on combinations \\
                 On the utility of higher mathematics",
}

@Book{Sandorfy:1964:ESQ,
  author =       "C. (Camille) Sandorfy",
  title =        "Electronic Spectra and Quantum Chemistry",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xiii + 385",
  year =         "1964",
  LCCN =         "QD95 .S218 1959",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Originally published in French as {\em Les Spectres
                 Electroniques en Chimie Theorique}, 1959.",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Sargent:1984:IPC,
  author =       "Murray {Sargent III} and Richard L. Schoemaker",
  title =        "The {IBM} Personal Computer from the Inside Out",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xii + 483",
  year =         "1984",
  ISBN =         "0-201-06896-6",
  ISBN-13 =      "978-0-201-06896-2",
  LCCN =         "QA76.8.I2594 S27 1984",
  bibdate =      "Wed Dec 15 10:41:29 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "A strongly hardware-oriented, but very readable,
                 treatment of the IBM PC. Contains three chapters on the
                 8088 and assembly language programming, with the
                 remainder of the book devoted to descriptions of
                 hardware, keyboard and video display, external devices,
                 and data communications.",
  abstract =     "Introduction to a super micro \\
                 Introduction to assembly language \\
                 Assembly language programming \\
                 Advanced assembly language techniques \\
                 Introduction to digital circuitry \\
                 The inner workings \\
                 Interrupts: real-time clock, typing ahead \\
                 Keyboard and video display \\
                 Controlling/monitoring devices \\
                 Data communications \\
                 The bigger picture \\
                 Building your own interfaces",
  acknowledgement = ack-nhfb,
}

@Book{Sayood:1996:IDC,
  author =       "Khalid Sayood",
  title =        "Introduction to Data Compression",
  publisher =    pub-MORGAN-KAUFMANN,
  address =      pub-MORGAN-KAUFMANN:adrnew,
  pages =        "xviii + 475",
  year =         "1996",
  ISBN =         "1-55860-346-8",
  ISBN-13 =      "978-1-55860-346-2",
  LCCN =         "TK5102.92 .S39 1996",
  MRclass =      "94A29, 94-01",
  bibdate =      "Tue Feb 12 17:47:29 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "1: Introduction \\
                 2: Mathematical Preliminaries \\
                 3: Huffman Coding \\
                 4: Arithmetic Coding \\
                 5: Dictionary Techniques \\
                 6: Lossless Image Compression \\
                 7: Mathematical Preliminaries \\
                 8: Scalar Quantization \\
                 9: Vector Quantization \\
                 10: Differential Encoding \\
                 11: Subband Coding \\
                 12: Transform Coding \\
                 13: Analysis/Synthesis Schemes \\
                 14: Video Compression \\
                 A: Probability and Random Processes \\
                 B: A Brief Review of Matrix Concepts \\
                 C: Codes for Facsimile Encoding \\
                 D: The Root Lattices",
  xxpages =      "xx + 636",
}

@Book{Sayood:2000:IDC,
  author =       "Khalid Sayood",
  title =        "Introduction to Data Compression",
  publisher =    pub-MORGAN-KAUFMANN,
  address =      pub-MORGAN-KAUFMANN:adrnew,
  edition =      "Second",
  pages =        "xx + 636",
  year =         "2000",
  ISBN =         "1-55860-558-4",
  ISBN-13 =      "978-1-55860-558-9",
  LCCN =         "TK5102.92 .S39 2000",
  bibdate =      "Mon Jan 28 06:42:20 MST 2013",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  price =        "US\$69.95",
  URL =          "http://www.mkp.com/books_catalog/catalog.asp?ISBN=1-55860-558-4",
  abstract =     "This book provides an extensive introduction to the
                 theory underlying today's compression techniques with
                 detailed instruction for their application. The
                 coverage has been significantly updated to reflect the
                 state of the art in data compression, including both
                 new algorithms and older methods for which new uses are
                 being found. And the downloadable software gives you
                 the opportunity to see firsthand how various algorithms
                 work, to choose and implement appropriate techniques in
                 your own applications, and to build your own
                 algorithms.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "1: Introduction \\
                 2: Mathematical Preliminaries for Lossless Compression
                 \\
                 3: Huffman Coding \\
                 4: Arithmetic Coding \\
                 5: Dictionary Techniques \\
                 6: Predictive Coding \\
                 7: Mathematical Preliminaries for Lossy Coding \\
                 8: Scalar Quantization \\
                 9: Vector Quantization \\
                 10: Differential Encoding \\
                 11: Mathematical Preliminaries for Transforms,
                 Subbands, and Wavelets \\
                 12: Transform Coding \\
                 13: Subband Coding \\
                 14: Wavelet-Based Compression \\
                 15: Analysis/Synthesis Schemes \\
                 16: Video Compression \\
                 A: Probability and Random Processes \\
                 B: A Brief Review of Matrix Concepts \\
                 C: The Root Lattices",
}

@Book{Sayood:2005:IDC,
  author =       "Khalid Sayood",
  title =        "Introduction to Data Compression",
  publisher =    pub-ELSEVIER,
  address =      pub-ELSEVIER:adr,
  edition =      "Third",
  pages =        "xxii + 680",
  year =         "2005",
  ISBN =         "0-12-620862-X (hardcover), 0-08-050925-8 (e-book)",
  ISBN-13 =      "978-0-12-620862-7 (hardcover), 978-0-08-050925-9
                 (e-book)",
  LCCN =         "TK5102.92 .S39 2005",
  bibdate =      "Wed Oct 26 16:49:48 MDT 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "Data compression (Telecommunication); Coding theory",
  tableofcontents = "1: Introduction \\
                 2: Lossless Compression \\
                 3: Huffman Coding \\
                 4: Arithmetic Coding \\
                 5: Dictionary Techniques \\
                 6: Context Based Compression \\
                 7: Lossless Image Compression \\
                 8: Lossy Coding \\
                 9: Scalar Quantization \\
                 10: Vector Quantization \\
                 11: Differential Encoding \\
                 12: Transforms, Subbands, and Wavelets \\
                 13: Transform Coding \\
                 14: Subband Coding \\
                 15: Wavelet-Based Compression \\
                 16: Audio Coding \\
                 17: Analysis/Synthesis and Analysis by Synthesis
                 Schemes \\
                 18: Video Compression \\
                 Appendix A: Probability and Random Processes \\
                 Appendix B: A Brief Review of Matrix Concepts \\
                 Appendix C: The Root Lattices \\
                 Bibliography",
}

@Book{Scanlon:1984:ALP,
  author =       "Leo J. Scanlon",
  title =        "8086\slash 88 Assembly Language Programming",
  publisher =    pub-BRADY,
  address =      pub-BRADY:adr,
  pages =        "ix + 213",
  year =         "1984",
  ISBN =         "0-89303-424-X",
  ISBN-13 =      "978-0-89303-424-5",
  LCCN =         "QA76.8.I292 S29 1984",
  bibdate =      "Wed Dec 15 18:14:57 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "A rather short treatment of assembly language
                 programming for the 8088 and 8086, with a short chapter
                 on the 8087. Nothing specific to the IBM PC, and not
                 detailed enough for a beginner. Two related books
                 \cite{Bradley:1984:ALP,Lafore:1984:ALP} contain much
                 more detail.",
  acknowledgement = ack-nhfb,
}

@Book{Schachter:1983:CIG,
  editor =       "Bruce J. Schachter",
  title =        "Computer Image Generation",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xx + 236",
  year =         "1983",
  ISBN =         "0-471-87287-3",
  ISBN-13 =      "978-0-471-87287-0",
  LCCN =         "T385 .C5934 1983",
  bibdate =      "Wed Dec 15 10:41:31 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$29.95",
  acknowledgement = ack-nhfb,
}

@Book{Schechter:1998:MBO,
  author =       "Bruce Schechter",
  title =        "My Brain is Open: the Mathematical Journeys of {Paul
                 Erd{\H{o}}s}",
  publisher =    pub-SIMON-SCHUSTER,
  address =      pub-SIMON-SCHUSTER:adr,
  pages =        "224",
  year =         "1998",
  ISBN =         "0-684-84635-7",
  ISBN-13 =      "978-0-684-84635-4",
  LCCN =         "QA29.E86 S34 1998",
  bibdate =      "Mon Mar 06 08:50:51 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$13.00",
  abstract =     "Physicist and science writer Bruce Schechter's
                 biography of legendary Hungarian mathematician Paul
                 Erd{\H{o}}s is an engaging portrait, warm and intimate,
                 bringing this strange, happy man to life. Here, we get
                 to see Erd{\H{o}}s's brief childhood transform quickly
                 into a carefree adolescence of solving difficult math
                 problems with his circle of brilliant friends ---
                 uniquely encouraged by a country that valued the
                 contributions of mathematics in a way that has never
                 been equaled. Fleeing the Holocaust, Erd{\H{o}}s never
                 settled down, instead traveling from place to place,
                 showing up on the doorsteps of other mathematicians
                 with his few possessions and an open mind. During his
                 career, Erd{\H{o}}s published more papers than any
                 other mathematician in history. Most of the papers were
                 collaborations.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Proof \\
                 The happy end problem \\
                 Erd{\H{o}}s and the fate of western civilization \\
                 The joy of sets \\
                 Six degrees of collaboration",
}

@Book{Scheifler:1988:XWS,
  author =       "Robert W. Scheifler and James Gettys and Ron Newman",
  title =        "{X Window System}: {C} Library and Protocol
                 Reference",
  publisher =    pub-DP,
  address =      pub-DP:adr,
  pages =        "xxix + 701",
  year =         "1988",
  ISBN =         "1-55558-012-2",
  ISBN-13 =      "978-1-55558-012-4",
  LCCN =         "QA76.76.W56 S34 1988",
  bibdate =      "Wed Dec 15 10:41:32 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Scheifler:1989:XPR,
  author =       "Robert W. Scheifler",
  title =        "{X} Protocol Reference Manual",
  volume =       "0",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xv + 398",
  year =         "1989",
  ISBN =         "0-937175-40-4",
  ISBN-13 =      "978-0-937175-40-8",
  LCCN =         "QA76.76.W56 X5 1989",
  bibdate =      "Wed Jul 6 14:53:46 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Scheinerman:2011:MN,
  author =       "Edward R. Scheinerman",
  title =        "Mathematical notation",
  publisher =    "CreateSpace",
  address =      "USA",
  pages =        "viii + 84",
  year =         "2011",
  ISBN =         "1-4662-3052-5",
  ISBN-13 =      "978-1-4662-3052-1",
  LCCN =         "QA41 .S34 2011",
  bibdate =      "Tue Aug 4 09:33:21 MDT 2020",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  acknowledgement = ack-nhfb,
  remark =       "Includes chart on pages 69--72 of common LaTeX
                 mathematical symbol names.",
  subject =      "Mathematical notation",
  tableofcontents = "Preface / vii \\
                 How to use this Guide / vii \\
                 How not to use this Guide / viii \\
                 Acknowledgments / viii \\
                 Chapter 1. Letters / 1 \\
                 1. The Latin alphabet / 1 \\
                 2. The Greek alphabet / 2 \\
                 3. Decorations / 2 \\
                 4. Traditional uses / 3 \\
                 Chapter 2. Collections / 5 \\
                 1. Sets / 5 \\
                 2. Lists / 8 \\
                 3. Big sums, products, and so on / 8 \\
                 Chapter 3. Logic / 11 \\
                 1. Boolean operations and proof symbols / 11 \\
                 2. Quantifiers / 12 \\
                 Chapter 4. Numbers / 13 \\
                 1. Real numbers / 13 \\
                 2. Subsets of the reals / 15 \\
                 3. ``Famous'' real numbers / 16 \\
                 4. Complex numbers / 17 \\
                 5. Basic operations / 18 \\
                 6. Other number systems / 18 \\
                 7. To infinity and beyond / 19 \\
                 Chapter 5. Geometry / 21 \\
                 1. Fundamentals / 21 \\
                 2. Coordinates / 22 \\
                 3. Differential geometry / 23 \\
                 Chapter 6. Functions / 25 \\
                 1. Fundamentals / 25 \\
                 2. Standard functions / 27 \\
                 3. Classes of functions / 33 \\
                 4. Polynomials, power series, and rational functions /
                 34 \\
                 5. Miscellany / 35 \\
                 Chapter 7. Linear Algebra / 39 \\
                 1. Vectors / 39 \\
                 2. Matrices / 41 \\
                 3. Tensors / 47 \\
                 Chapter 8. Calculus / 49 \\
                 1. Limits / 49 \\
                 2. Derivatives (single independent variable, scalar- or
                 vector-valued) / 49 \\
                 3. Derivatives (multiple independent variables,
                 scalar-valued) / 50 \\
                 4. Derivatives (multiple independent variables,
                 vector-valued) / 52 \\
                 5. Integration / 54 \\
                 6. Convolution and transforms / 55 \\
                 Chapter 9. Probability and Statistics / 57 \\
                 1. Probability / 57 \\
                 2. Statistics / 61 \\
                 Chapter 10. Approximation / 63 \\
                 1. Approximate equality of numbers / 63 \\
                 2. Asymptotic relations / 63 \\
                 3. Big-oh notation and its relatives / 64 \\
                 Bibliography / 67 \\
                 Chart / 69 \\
                 Alphabetical Notation Index / 73 \\
                 Greek Notation Index / 77 \\
                 Topic Index / 79",
}

@Book{Schendel:1984:INM,
  author =       "U. Schendel",
  title =        "Introduction to Numerical Methods for Parallel
                 Computers",
  publisher =    pub-ELLIS-HORWOOD,
  address =      pub-ELLIS-HORWOOD:adr,
  pages =        "151",
  year =         "1984",
  ISBN =         "0-470-20091-X, 0-85312-597-X",
  ISBN-13 =      "978-0-470-20091-9, 978-0-85312-597-6",
  LCCN =         "QA297 .S3813 1984",
  bibdate =      "Wed Dec 15 10:41:33 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "UK\pounds 15.00",
  series =       "Ellis Horwood Series in Mathematics and its
                 Applications, Editor: G. M. Bell",
  acknowledgement = ack-nhfb,
}

@Book{Schengili-Roberts:2000:CC,
  author =       "Keith Schengili-Roberts",
  title =        "Core {CSS}",
  publisher =    pub-PHPTR,
  address =      pub-PHPTR:adr,
  pages =        "xxxvii + 635 + 4",
  year =         "2000",
  ISBN =         "0-13-083456-4 (paperback)",
  ISBN-13 =      "978-0-13-083456-0 (paperback)",
  LCCN =         "TK5105.888. S32 2000",
  bibdate =      "Mon Oct 26 18:00:35 MDT 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/sgml2000.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Prentice Hall PTR core series",
  acknowledgement = ack-nhfb,
  subject =      "Cascading Style Sheets; Web sites; design; computer
                 graphics; Web publishing",
  tableofcontents = "Acknowledgments / xxix \\
                 Preface / xxxi \\
                 Who You Are / xxxii \\
                 How This Book Is Organized / xxxiii \\
                 Conventions Used in This Book / xxxv \\
                 Further Information / xxxv \\
                 Additional Material / xxxvi \\
                 Feedback / xxxvii \\
                 The Birth of CSS / 2 \\
                 The World Wide Web Consortium Introduces Cascading
                 Style Sheets / 5 \\
                 XHTML, CSS2 and CSS3 / 7 \\
                 Re-emergence of the Browser Wars? / 10 \\
                 (X)Html and Its Relationship to CSS / 14 \\
                 Adding Cascading Style Sheets to Web Pages / 17 \\
                 The <style> Element / 18 \\
                 The <span> and <div> Elements / 21 \\
                 The <link> Element / 24 \\
                 Browser Adoption of CSS / 28 \\
                 Internet Explorer 3.x / 30 \\
                 Internet Explorer 4.x / 31 \\
                 Internet Explorer 4.5 (Macintosh) and 5.x (Windows and
                 Macintosh) / 32 \\
                 Internet Explorer 5.5 / 34 \\
                 Internet Explorer 6.0 / 35 \\
                 Opera 3.5 / 37 \\
                 Opera 4.x--6.x / 38 \\
                 Netscape Navigator 4.x / 39 \\
                 Mozilla and Netscape Navigator 6.x and 7.x / 40 \\
                 Other Browsers / 47 \\
                 Implementation of Basic CSS Concepts / 52 \\
                 Grouping / 53 \\
                 Inheritance / 56 \\
                 Class and id as Selectors / 58 \\
                 Contextual Selectors / 62 \\
                 Comments / 66 \\
                 CSS2 Selectors / 67 \\
                 CSS3 Selectors / 76 \\
                 The Cascade / 82 \\
                 Cascading Order / 83 \\
                 Important / 88 \\
                 Cascade-Order Sources / 90 \\
                 CSS Units / 94 \\
                 Length Units / 95 \\
                 Percentage Units / 101 \\
                 URLs / 103 \\
                 Strings / 106 \\
                 Time Units / 108 \\
                 Angle Units / 108 \\
                 Frequency Units / 110 \\
                 Pseudo-Classes and Pseudo-Elements / 112 \\
                 Anchor Pseudo-Element / 114 \\
                 First-line Pseudo-Element / 117 \\
                 First-letter Pseudo-Element / 119 \\
                 Lang Pseudo-Class / 122 \\
                 Left, right and first Pseudo-Classes / 123 \\
                 Focus and hover Pseudo-Classes / 123 \\
                 First-child Pseudo-Class / 125 \\
                 Pseudo-Elements in Selectors and Combining Multiple
                 Pseudo-Elements / 128 \\
                 Media Types and Media Queries / 130 \\
                 Browser Compatibility / 134 \\
                 Media Queries / 135 \\
                 Width and height Media Queries / 136 \\
                 Device-width and device-height Media Queries / 136 \\
                 Device-aspect-ratio Media Query / 137 \\
                 Color Media Query / 137 \\
                 Color-index Media Query / 138 \\
                 Monochrome Media Query / 138 \\
                 Resolution Media Query / 139 \\
                 Scan Media Query / 139 \\
                 Grid Media Query / 140 \\
                 Font Properties / 142 \\
                 Font-family Property / 144 \\
                 Font-size Property / 150 \\
                 Font-style Property / 158 \\
                 Font-variant Property / 160 \\
                 Font-weight Property / 162 \\
                 Font Property / 167 \\
                 Font-stretch Property / 170 \\
                 Font-size-adjust Property / 173 \\
                 The <at>font-face Pseudo-Element / 175 \\
                 CSS3 Font Decoration Properties / 182 \\
                 Text Properties / 186 \\
                 Letter-spacing Property / 187 \\
                 Word-spacing Property / 190 \\
                 Line-height Property / 193 \\
                 Vertical-align Property / 196 \\
                 Text-align Property / 198 \\
                 Text-decoration Property / 201 \\
                 Text-indent Property / 204 \\
                 Text-transform Property / 207 \\
                 Text-shadow Property / 209 \\
                 Glyph-orientation-horizontal and
                 glyph-orientation-vertical Properties / 211 \\
                 Text-script Property / 214 \\
                 Min-font-size and max-font-size Properties / 215 \\
                 Text-justify-trim Property / 216 \\
                 Line-break Property / 216 \\
                 Word-break-cjk Property / 216 \\
                 Word-break-inside Property / 217 \\
                 Word-break Property / 217 \\
                 Wrap-option Property / 218 \\
                 Linefeed-treatment Property / 219 \\
                 White-space-treatment Property / 219 \\
                 All-space-treatment Property / 220 \\
                 White-space Property / 220 \\
                 Text-overflow-mode Property / 222 \\
                 Text-overflow-ellipsis Property / 222 \\
                 Text-overflow Property / 223 \\
                 Kerning-mode Property / 223 \\
                 Kerning-pair-threshold Property / 224 \\
                 Punctuation-trim Property / 224 \\
                 Text-line-through Set of Properties / 225 \\
                 Text-overline Set of Properties / 228 \\
                 Text-underline Set of Properties / 232 \\
                 Text-blink Property / 236 \\
                 Text Property Extensions / 238 \\
                 Internet Explorer Text-Formatting CSS Extensions / 239
                 \\
                 Layout-flow Property / 239 \\
                 Writing-mode Property / 244 \\
                 Layout-grid Sub-Family of Properties / 247 \\
                 Text-autospace Property / 258 \\
                 Text-justify Property / 261 \\
                 Text-kashida-space Property / 264 \\
                 Text-underline-position Property / 266 \\
                 Word-break Property / 268 \\
                 Text-align-last Property / 271 \\
                 Box Properties / 274 \\
                 Border-`style' Properties / 276 \\
                 Border-style Property / 277 \\
                 Border-color Property / 280 \\
                 Border-width Property / 283 \\
                 Border-bottom Property / 286 \\
                 Border-left Property / 289 \\
                 Border-right Property / 292 \\
                 Border-top Property / 294 \\
                 Border-bottom-width Property / 297 \\
                 Border-left-width Property / 299 \\
                 Border-right-width Property / 302 \\
                 Border-top-width Property / 304 \\
                 Border Property / 307 \\
                 Border-radius Set of Properties / 310 \\
                 Border-image Set of Properties / 312 \\
                 Border-fit Set of Properties / 314 \\
                 Border-image-transform Set of Properties / 317 \\
                 Border-break Property / 319 \\
                 Box-shadow Property / 319 \\
                 Clear Property / 321 \\
                 Clear-after Property / 324 \\
                 Float Property / 325 \\
                 Float-displace Property / 331 \\
                 Indent-edge-reset Property / 332 \\
                 Height Property / 332 \\
                 Width Property / 335 \\
                 Padding-bottom Property / 337 \\
                 Padding-left Property / 339 \\
                 Padding-right Property / 341 \\
                 Padding-top Property / 343 \\
                 Padding Property / 345 \\
                 Margin-bottom Property / 349 \\
                 Margin-left Property / 352 \\
                 Margin-right Property / 354 \\
                 Margin-top Property / 357 \\
                 Margin Property / 360 \\
                 Min-width, max-width, min-height and max-height
                 Properties / 362 \\
                 Fit and fit-position Properties / 363 \\
                 Marquee Properties / 365 \\
                 Color / 368 \\
                 Color Property / 370 \\
                 Gamma Correction under CSS3 / 375 \\
                 Opacity Property / 376 \\
                 Rendering-intent Property / 377 \\
                 Color-profile Property / 378 \\
                 Color-profile / 379 \\
                 XII Color Keywords / 379 \\
                 Background Properties / 386 \\
                 Background-color Property / 387 \\
                 Background-image Property / 391 \\
                 Background-repeat Property / 394 \\
                 Background-attachment Property / 397 \\
                 Background-position Property / 401 \\
                 Background Property / 407 \\
                 Background-position-x and background-position-y
                 Properties / 410 \\
                 CSS3 Properties / 415 \\
                 Background-clip Property / 415 \\
                 Background-origin / 416 \\
                 Background-size / 418 \\
                 Background-quantity / 419 \\
                 Background-spacing / 420 \\
                 Classification Properties and Generated/Automatic
                 Content / 422 \\
                 White-space Property / 423 \\
                 List-style-type Property / 426 \\
                 List-style-image Property / 435 \\
                 List-style-position Property / 437 \\
                 List-style Property / 440 \\
                 The content Property plus the before and after
                 Pseudo-Elements / 443 \\
                 Quotes Property / 446 \\
                 Counter-increment and counter-reset Properties / 449
                 \\
                 Marker-offset Property / 452 \\
                 Visual Formatting and Detailed Visual Formatting / 456
                 \\
                 Display Property / 457 \\
                 Positioning Properties: position, top, left, right and
                 bottom / 465 \\
                 Z-index Property / 473 \\
                 Direction and unicode-bidi Properties / 476 \\
                 Min-width, max-width, min-height and max-height
                 Properties / 479 \\
                 Visual Effects / 486 \\
                 Overflow Property / 487 \\
                 Overflow-x and overflow-y Properties / 490 \\
                 Clip Property / 492 \\
                 Visibility Property / 495 \\
                 Zoom Property / 500 \\
                 Ime-mode Property / 503 \\
                 Paged Media / 506 \\
                 Size Property / 507 \\
                 Marks Property / 510 \\
                 Page-Break Properties / 512 \\
                 Page Property / 515 \\
                 Windows and orphans Properties / 517 \\
                 Tables / 520 \\
                 Caption-side Property / 521 \\
                 Table-layout Property / 524 \\
                 Border-collapse, border-spacing and empty-cells / 527
                 \\
                 Speak-header Property / 536 \\
                 Table-like Layout Using CSS / 537 \\
                 User Interface / 542 \\
                 Cursor Property / 544 \\
                 Outline Sub-Family of Properties / 549 \\
                 Outline-width Property / 550 \\
                 Outline-style Property / 553 \\
                 Outline-color Property / 554 \\
                 Outline Property / 556 \\
                 Accelerator Property / 557 \\
                 CSS3 Properties / 559 \\
                 Resizer Property / 559 \\
                 Key-equivalent Property / 560 \\
                 Tab-index Property / 561 \\
                 User-input Property / 562 \\
                 User-modify Property / 562 \\
                 User-select Property / 563 \\
                 User-focus, user-focus-key and user-focus-pointer
                 Properties / 564 \\
                 Toggle-group and group-reset Properties / 564 \\
                 Mozilla User-Interface-Related Extensions / 565 \\
                 CSS3 Additions to Existing User-Interface Properties /
                 567 \\
                 Aural Cascading Style Sheets / 568 \\
                 Speak Property / 570 \\
                 Volume Property / 571 \\
                 Pause Sub-Set of Properties / 573 \\
                 Cue Sub-Set of Properties / 576 \\
                 Play-during Property / 577 \\
                 zimuth Property / 579 \\
                 Elevation Property / 582 \\
                 Speech-rate Property / 584 \\
                 Voice-family Property / 586 \\
                 Pitch Property / 587 \\
                 Pitch-range Property / 589 \\
                 Stress Property / 590 \\
                 Richness Property / 591 \\
                 Speech Sub-Group of Properties / 592 \\
                 Ruby / 596 \\
                 What Is Ruby? / 597 \\
                 The <ruby> Tag Set / 598 \\
                 Ruby-align Property / 602 \\
                 Ruby-overhang Property / 605 \\
                 Ruby-position Property / 608 \\
                 Multi-Column Layout / 612 \\
                 Introduction / 613 \\
                 Column-count Property / 616 \\
                 Column-width Property / 616 \\
                 Column-gap Property / 617 \\
                 Column-width-policy Property / 617 \\
                 Column-space-distribution Property / 618 \\
                 Column Rule Properties / 620 \\
                 Column-span Property / 622 \\
                 Scrollbars / 624 \\
                 The Parts of a Scrollbar / 625 \\
                 Scrollbar Properties / 626 \\
                 Browser Compatibility / 634 \\
                 Filters and Transitions / 636 \\
                 Visual Filters in Internet Explorer / 637 \\
                 Static Filters / 638 \\
                 Transition Filter Overview / 672 \\
                 CSS1 and CSS2 Compatibility Charts / 692 \\
                 Alphabetical Listing of CSS Properties and Values / 706
                 \\
                 Accelerator / 707 \\
                 Azimuth / 708 \\
                 Background / 709 \\
                 Background-attachment / 710",
}

@Book{Schewe:2013:MGP,
  author =       "Phillip F. Schewe",
  title =        "Maverick Genius: the Pioneering Odyssey of {Freeman
                 Dyson}",
  publisher =    "Thomas Dunn Books, St. Martin's Press",
  address =      "New York, NY, USA",
  pages =        "x + 339",
  year =         "2013",
  ISBN =         "0-312-64235-0 (hardcover), 1-250-02101-4 (e-book)",
  ISBN-13 =      "978-0-312-64235-8 (hardcover), 978-1-250-02101-4
                 (e-book)",
  LCCN =         "QC16.D95 S34 2013",
  bibdate =      "Mon Aug 19 15:29:10 MDT 2013",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/d/dyson-freeman-j.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "Freeman Dyson has been influential in many fields over
                 his long and legendary career, including quantum
                 physics, national defense, space, and religion. In this
                 definitive biography, author Phillip F. Schewe examines
                 the life of one of the most innovative thinkers of our
                 time, whose accomplishments include: Designing a
                 nuclear rocket ship, {\em The Orion}, for NASA; Helping
                 write the \booktitle{Nuclear Test Ban Treaty};
                 Consulting for Stanley Kubrick on the film
                 \booktitle{2001: A Space Odyssey}; Winning the coveted
                 million dollar \booktitle{Templeton Prize for Progress
                 in Religion}. A colleague of Albert Einstein at
                 Princeton and friends with leading thinkers including
                 Robert Oppenheimer, George F. Kennan, and Richard
                 Feynman, Freeman Dyson is a larger-than-life figure in
                 the world of science, and he has recently made
                 headlines for his controversial views on global
                 warming. Written with the cooperation of Dyson's
                 children, entrepreneur Esther Dyson (an early investor
                 in Flickr, Google, and Orbitz, who has often been
                 called `The First Lady of the Internet') and tech
                 writer George Dyson, this is the first complete
                 biography of the man who changed the way we think about
                 science today.",
  acknowledgement = ack-nhfb,
  remark =       "This is claimed to be the first biography of Freeman
                 Dyson.",
  subject =      "Dyson, Freeman J; Physicists; United States;
                 Biography; Mathematicians; Biography and Autobiography
                 / Science and Technology",
  tableofcontents = "Introduction \\
                 Killing time: Dyson bombs Berlin (1923--1945) \\
                 Life is a blur: Dyson as mathematician (1945--1947) \\
                 Ecumenical councils: Dyson as seminarian (1947--1948)
                 \\
                 The secret signature of things: Dyson as artist
                 (1948--1949) \\
                 Recessional: Dyson as professor (1949--1953) \\
                 Nuclear opera: Dyson and the Cold War (1954--1956) \\
                 Intrinsically safe: Dyson as engineer (1956--1957) \\
                 Space traveler's manifesto: Dyson as rocketeer
                 (1957--1959) \\
                 Civilized behavior: Dyson searches for extraterrestrial
                 intelligence (early 1960s) \\
                 Nuclear manifesto: Dyson as diplomat (early 1960s) \\
                 On the Oregon Trail: Dyson as Pentagon consultant
                 (1960s--1970s) \\
                 Success in life: Dyson as astronomer (mid 1960s to mid
                 1970s) \\
                 Science and sublime: Dyson as essayist (1976--1985) \\
                 Nuclear slavery: Dyson as abolitionist (1980s) \\
                 The arc of life: Dyson as biologist (1980s and 1990s)
                 \\
                 God and man at Princeton: Dyson as preacher
                 (1985--2000) \\
                 Splintering the species: Dyson as heretic (1990--2010)
                 \\
                 Long-term thinking: Dyson as storyteller (recent
                 years)",
}

@Book{Schildt:1990:AAC,
  author =       "Herbert Schildt",
  title =        "The Annotated {ANSI C} Standard: {American National
                 Standard for Programming Languages: C}",
  publisher =    pub-OSBORNE-MCGRAW-HILL,
  address =      pub-OSBORNE-MCGRAW-HILL:adr,
  pages =        "xvi + 219",
  year =         "1990",
  ISBN =         "0-07-881952-0",
  ISBN-13 =      "978-0-07-881952-0",
  LCCN =         "QA76.73.C15S356 1990",
  bibdate =      "Mon Dec 27 09:38:20 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ansistd.bib;
                 https://www.math.utah.edu/pub/tex/bib/cccuj.bib;
                 https://www.math.utah.edu/pub/tex/bib/isostd.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/standard.bib",
  price =        "US\$39.95",
  acknowledgement = ack-nhfb,
  keywords =     "C (Computer program language); Programming languages;
                 Programming languages (Electronic computers) ---
                 Standards; Standards.",
  remark =       "Contains the full text of the ANSI/ISO Standard for
                 the C programming language, which is commonly called
                 the ANSI C Standard. \ldots{} To make the text of the
                 standard more generally accessible and easier to
                 understand, I have provided explanations, comments, and
                 examples on the pages that face the pages of the
                 standard.",
  tableofcontents = "Acknowledgments \\
                 Introduction \\
                 Scope / 1 \\
                 Normative references / 1 \\
                 Definitions and conventions / 2 \\
                 Compliance / 3 \\
                 Environment / 5 \\
                 Language / 18 \\
                 Library / 96 \\
                 Annex A: Bibliography / 177 \\
                 Annex B: Language syntax summary / 178 \\
                 Annex C: Sequence points / 189 \\
                 Annex D: Library summary / 190 \\
                 Annex E: Implementation limits / 196 \\
                 Annex F: Common warnings / 198 \\
                 Annex G: Portability issues / 199 \\
                 Index / 210",
}

@Book{Schneier:1994:ACP,
  author =       "Bruce Schneier",
  title =        "Applied Cryptography: Protocols, Algorithms, and
                 Source Code in {C}",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xviii + 618",
  year =         "1994",
  ISBN =         "0-471-59756-2 (paperback)",
  ISBN-13 =      "978-0-471-59756-8 (paperback)",
  LCCN =         "QA76.9.A25S35 1993",
  bibdate =      "Sun Dec 04 13:11:37 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$44.95",
  abstract =     "The explosive growth of public and private computer
                 networks has resulted in a tremendous increase in the
                 volume of sensitive and valuable data that is routinely
                 stored and transmitted digitally. From computer
                 messages speeding through global networks to vast sums
                 of money transferred electronically, the greatest
                 challenge in this new `digital world' is keeping this
                 information out of the hands of unauthorized users who
                 prey on vulnerable computer systems. In
                 \booktitle{Applied Cryptography}, data security expert
                 Bruce Schneier details how programmers can use
                 cryptography --- the technique of enciphering and
                 deciphering messages --- to maintain the privacy of
                 computer data. Covering the latest developments in
                 practical cryptographic techniques, the book shows
                 programmers who design computer applications, networks,
                 and storage systems how security can be built into the
                 computer software and systems we use every day. Along
                 with more than 100 pages of actual C source code of
                 working cryptographic algorithms, this practical
                 handbook explains data encryption protocols and
                 techniques currently in use and likely to be used in
                 the future; offers numerous present-day applications
                 from secure correspondence to anonymous messaging;
                 includes numerous source code fragments and shows how
                 to incorporate them into larger programs; and discusses
                 related issues like patents, export law, and legal
                 rulings.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Foreword / Whitfield Diffie \\
                 1. Foundations \\
                 Part 1. Cryptographic Protocols \\
                 2. Protocol Building Blocks \\
                 3. Basic Protocols \\
                 4. Intermediate Protocols \\
                 5. Advanced Protocols \\
                 6. Esoteric Protocols \\
                 Part 2. Cryptographic Techniques \\
                 7. Keys \\
                 8. Using Algorithms \\
                 Part 3. Cryptographic Algorithms \\
                 9. Mathematical Background \\
                 10. Data Encryption Standard (DES) \\
                 11. Other Block Algorithms \\
                 12. Public-Key Algorithms \\
                 13. More Public-Key Algorithms \\
                 14. One-Way Hash Functions \\
                 15. Random Sequence Generators and Stream Ciphers \\
                 16. Special Algorithms for Protocols \\
                 Part 4. The Real World \\
                 17. Example Implementations \\
                 18. Politics \\
                 Part 5. Source Code \\
                 VIGENERE, BEAUFORD, VARIANT BEAUFORD \\
                 ENIGMA \\
                 DES \\
                 LUCIFER \\
                 NEWDES \\
                 FEAL-8 \\
                 FEAL-NX \\
                 REDOC III \\
                 LOKI 91 \\
                 IDEA \\
                 N-HASH \\
                 MD5 \\
                 SECURE HASH ALGORITHM \\
                 SECRET SHARING",
}

@Book{Schneier:1996:ACP,
  author =       "Bruce Schneier",
  title =        "Applied Cryptography: Protocols, Algorithms, and
                 Source Code in {C}",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  edition =      "Second",
  pages =        "xxiii + 758",
  year =         "1996",
  ISBN =         "0-471-12845-7 (hardcover), 0-471-11709-9 (paperback)",
  ISBN-13 =      "978-0-471-12845-8 (hardcover), 978-0-471-11709-4
                 (paperback)",
  LCCN =         "QA76.9.A25 S35 1996",
  MRclass =      "94A60, 94-01",
  bibdate =      "Tue Oct 20 17:50:50 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Foreword / Whitfield Diffie \\
                 1: Foundations \\
                 2: Protocol Building Blocks \\
                 3: Basic Protocols \\
                 4: Intermediate Protocols \\
                 5: Advanced Protocols \\
                 6: Esoteric Protocols \\
                 7: Key Length \\
                 8: Key Management \\
                 9: Algorithm Types and Modes \\
                 10: Using Algorithms \\
                 11: Mathematical Background \\
                 12: Data Encryption Standard (DES) \\
                 13: Other Block Ciphers \\
                 14: Still Other Block Ciphers \\
                 15: Combining Block Ciphers \\
                 16: Pseudo-Random-Sequence Generators and Stream
                 Ciphers \\
                 17: Other Stream Ciphers and Real Random-Sequence
                 Generators \\
                 18: One-Way Hash Functions \\
                 19: Public-Key Algorithms \\
                 20: Public-Key Digital Signature Algorithms \\
                 21: Identification Schemes \\
                 22: Key-Exchange Algorithms \\
                 23: Special Algorithms for Protocols \\
                 24: Example Implementations \\
                 25: Politics \\
                 Afterword / Matt Blaze",
}

@Book{Schneier:2000:SLD,
  author =       "Bruce Schneier",
  title =        "Secrets and Lies: Digital Security in a Networked
                 World",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xv + 412",
  year =         "2000",
  DOI =          "https://doi.org/10.1002/9781119183631",
  ISBN =         "0-471-25311-1",
  ISBN-13 =      "978-0-471-25311-2",
  LCCN =         "QA76.9.A25 S352 2000",
  bibdate =      "Wed Sep 20 16:28:33 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$29.99",
  abstract =     "Information security expert Bruce Schneier explains
                 what everyone in business needs to know about security
                 in order to survive and be competitive. Pragmatic,
                 interesting, and humorous, Schneier exposes the digital
                 world and the realities of our networked society. He
                 examines the entire system, from the reasons for
                 technical insecurities to the minds behind malicious
                 attacks. You'll be guided through the security war
                 zone, and learn how to understand and arm yourself
                 against the threats of our connected world.
                 \booktitle{Secrets and Lies} offers the expert guidance
                 you'll need to make the right choices about securing
                 your digital self.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Introduction \\
                 Part 1: The landscape \\
                 2: Digital threats \\
                 3: Attacks \\
                 4: Adversaries \\
                 5: Security needs \\
                 Part 2: Technologies \\
                 6: Cryptography \\
                 7: Cryptography in context \\
                 8: Computer security \\
                 9: Identification and authentication \\
                 10: Networked-computer security \\
                 11: Network security \\
                 12: Network defenses \\
                 13: Software reliability \\
                 14: Secure hardware \\
                 15: Certificates and credentials \\
                 16: Security tricks \\
                 17: The human factor \\
                 Part 3: Strategies \\
                 18: Vulnerabilities and the vulnerability landscape \\
                 19: Threat modeling and risk assessment \\
                 20: Security policies and countermeasures \\
                 21: Attack trees \\
                 22: Product testing and verification \\
                 23: The future of products \\
                 24: Security processes \\
                 25: Conclusion \\
                 Afterword \\
                 Resources \\
                 Index",
}

@Book{Schneier:2003:BFT,
  author =       "Bruce Schneier",
  title =        "Beyond Fear: Thinking Sensibly About Security in an
                 Uncertain World",
  publisher =    "Copernicus Books",
  address =      "New York, NY, USA",
  pages =        "viii + 295",
  year =         "2003",
  ISBN =         "0-387-02620-7 (hardcover), 0-387-21712-6 (e-book)",
  ISBN-13 =      "978-0-387-02620-6 (hardcover), 978-0-387-21712-3
                 (e-book)",
  LCCN =         "HV6432 .S36 2003",
  bibdate =      "Thu Aug 21 08:38:41 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Many of us, especially since 9/11, have become
                 personally concerned about issues of security, and this
                 is no surprise. Security is near the top of government
                 and corporate agendas around the globe.
                 Security-related stories appear on the front page
                 everyday. How well though, do any of us truly
                 understand what achieving real security involves? In
                 \booktitle{Beyond Fear}, Bruce Schneier invites us to
                 take a critical look at not just the threats to our
                 security, but the ways in which we're encouraged to
                 think about security by law enforcement agencies,
                 businesses of all shapes and sizes, and our national
                 governments and militaries. Schneier believes we all
                 can and should be better security consumers, and that
                 the trade-offs we make in the name of security --- in
                 terms of cash outlays, taxes, inconvenience, and
                 diminished freedoms --- should be part of an ongoing
                 negotiation in our personal, professional, and civic
                 lives, and the subject of an open and informed national
                 discussion. With a well-deserved reputation for
                 original and sometimes iconoclastic thought, Schneier
                 has a lot to say that is provocative,
                 counter-intuitive, and just plain good sense. He
                 explains in detail, for example, why we need to design
                 security systems that don't just work well, but fail
                 well, and why secrecy on the part of government often
                 undermines security. He also believes, for instance,
                 that national ID cards are an exceptionally bad idea:
                 technically unsound, and even destructive of security.
                 And, contrary to a lot of current nay-sayers, he thinks
                 online shopping is fundamentally safe, and that many of
                 the new airline security measure (though by no means
                 all) are actually quite effective. A skeptic of much
                 that's promised by highly touted technologies like
                 biometrics, Schneier is also a refreshingly positive,
                 problem-solving force in the often self-dramatizing and
                 fear-mongering world of security pundits. Schneier
                 helps the reader to understand the issues at stake, and
                 how to best come to one's own conclusions, including
                 the vast infrastructure we already have in place, and
                 the vaster systems--some useful, others useless or
                 worse--that we're being asked to submit to and pay for.
                 Bruce Schneier is the author of seven books, including
                 \booktitle{Applied Cryptography} (which Wired called
                 ``the one book the National Security Agency wanted
                 never to be published'') and \booktitle{Secrets and
                 Lies} (described in Fortune as ``startlingly lively
                 \ldots{} [a] jewel box of little surprises you can
                 actually use.''). He is also Founder and Chief
                 Technology Officer of Counterpane Internet Security,
                 Inc., and publishes Crypto-Gram, one of the most widely
                 read newsletters in the field of online security.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: All security involves trade-offs \\
                 2: Security trade-offs are subjective \\
                 3: Security trade-offs depend on power and agenda \\
                 4: Systems and how they fail \\
                 5: Knowing the attackers \\
                 6: Attackers never change their tunes, just their
                 instruments \\
                 7: Technology creates security imbalances \\
                 8: Security is a weakest-link problem \\
                 9: Brittleness makes for bad security \\
                 10: Security revolves around people \\
                 11: Detection works where prevention fails \\
                 12: Detection is useless without response \\
                 13: Identification, authentication, and authorization
                 \\
                 14: All countermeasures have some value \\
                 15: Fighting terrorism \\
                 16: Negotiating for security \\
                 17: Security demystified",
}

@Book{Schneier:2012:LOE,
  author =       "Bruce Schneier",
  title =        "Liars and outliers: enabling the trust that society
                 needs to thrive",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xiv + 366",
  year =         "2012",
  ISBN =         "1-118-14330-2 (hardcover)",
  ISBN-13 =      "978-1-118-14330-8 (hardcover)",
  LCCN =         "BJ1500.T78 S35 2012",
  bibdate =      "Thu Jun 7 16:31:21 MDT 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "Schneier argues that society requires trust in order
                 to function, describes how society creates and
                 maintains that trust through societal pressures, and
                 discusses what happens when those pressures fail.",
  acknowledgement = ack-nhfb,
  subject =      "trust; social aspects; truthfulness and falsehood;
                 social interaction; social stability; social aspects;
                 interpersonal relations; sociology",
  tableofcontents = "Overview \\
                 Part I. The science of trust. A natural history of
                 security \\
                 The evolution of cooperation \\
                 A social history of trust \\
                 Societal dilemmas \\
                 Part II. A model of trust. Societal pressures \\
                 Moral pressures \\
                 Reputational pressures \\
                 Institutional pressures \\
                 Security systems \\
                 Part III. The real world. Competing interests \\
                 Organizations \\
                 Corporations \\
                 Institutions \\
                 Part IV. Conclusions. How societal pressures fail \\
                 Technological advances \\
                 The future",
}

@Book{Schofield:1989:OFPa,
  author =       "Clive F. (Clive F.) Schofield",
  title =        "Optimising {Fortran} programs",
  publisher =    pub-ELLIS-HORWOOD # " and " # pub-HALSTED,
  address =      pub-ELLIS-HORWOOD:adr # " and " # pub-HALSTED:adr,
  pages =        "x + 309",
  month =        jul,
  year =         "1989",
  ISBN =         "0-7458-0654-6, 0-470-21533-X (Halsted Press)",
  ISBN-13 =      "978-0-7458-0654-9, 978-0-470-21533-3 (Halsted Press)",
  LCCN =         "QA76.73.F25 S334 1989 WITHDRAWN",
  bibdate =      "Sun Sep 28 10:42:07 MDT 1997",
  bibsource =    "http://www.amazon.com/exec/obidos/ISBN=047021533X/wholesaleproductA/;
                 http://www.amazon.com/exec/obidos/ISBN=0745806546/wholesaleproductA/;
                 http://www.cbooks.com/;
                 https://www.math.utah.edu/pub/tex/bib/fortran2.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Cover title: Optimizing Fortran programs. Includes
                 index. Bibliography: p. [293]-296.",
  price =        "US\$40.95, US\$74.95",
  series =       "Ellis Horwood series in computers and their
                 applications",
  URL =          "http://www.cbooks.com/sqlnut/SP/search/gtsumt?source=&isbn=047021533X",
  acknowledgement = ack-nhfb,
  keywords =     "Computer systems --- Programming languages: Fortran
                 language; Fortran (computer program language);
                 {Fortran} (Computer program language)",
  libnote =      "Not in my library.",
}

@Book{Scholze-Stubenrecht:1997:ODG,
  editor =       "W. Scholze-Stubenrecht and J. B. Sykes and {the
                 Dudenredaktion} and {the German Section of the Oxford
                 University Press Dictionary Department}",
  title =        "The {Oxford--Duden German} Dictionary:
                 {German--English\slash English--German}",
  publisher =    pub-CLARENDON,
  address =      pub-CLARENDON:adr,
  pages =        "1712",
  year =         "1997",
  ISBN =         "0-19-860130-1, 0-19-860132-8",
  ISBN-13 =      "978-0-19-860130-2, 978-0-19-860132-6",
  LCCN =         "PF3640.O94 1997",
  bibdate =      "Sun Dec 28 22:38:30 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$39.95",
  acknowledgement = ack-nhfb,
  idnumber =     "500",
  keywords =     "German language --- Dictionaries --- English, English
                 language --- Dictionaries --- German",
}

@Book{Schonfeld:2003:JH,
  author =       "Roger C. Schonfeld",
  title =        "{JSTOR}: a history",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "xxxiv + 412",
  year =         "2003",
  ISBN =         "0-691-11531-1",
  ISBN-13 =      "978-0-691-11531-3",
  LCCN =         "PN4836 .S36 2003",
  bibdate =      "Mon Sep 14 11:35:15 MDT 2015",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/description/prin031/2002035907.html;
                 http://www.loc.gov/catdir/enhancements/fy0654/2002035907-b.html;
                 http://www.loc.gov/catdir/samples/prin031/2002035907.html",
  acknowledgement = ack-nhfb,
  author-dates = "1977--",
  libnote =      "Not in my library.",
  subject =      "JSTOR (Computer file); Periodicals; Databases",
  tableofcontents = "List of Illustrations / vii \\
                 Foreword / Hal Varian / xi \\
                 A Note on Publication / William G. Bowen / xiii \\
                 Introduction / xv \\
                 Acknowledgments / xxi \\
                 List of Abbreviations / xxv \\
                 A JSTOR Time Line / xxvii \\
                 1: The Idea at Denison, the Project at Mellon: December
                 1993--January 1994 / 1 \\
                 2: In Search of a Partner, but Beginning Alone:
                 February--May 1994 / 17 \\
                 3: Securing an Institutional Partner: The University of
                 Michigan: April--August 1994 / 46 \\
                 4: The Pilot Project: September 1994--April 1995 / 69
                 \\
                 5: Evolving Organizational Decisions and Independence:
                 February--December 1995 / 95 \\
                 6: Defining a Mission in Partnership with Publishers:
                 September 1995--August 1996 / 119 \\
                 7: Operational Changes at Michigan: September
                 1995--August 1996 / 149 \\
                 8: Developing a Business Plan: January--December 1996 /
                 166 \\
                 9: A More Thoroughly Professionalized Operation:
                 September 1996--December 1997 / 198 \\
                 10: Public Availability and Library Participation:
                 September 1996--December 1997 / 230 \\
                 11: Developing Two New Collections: May 1997--December
                 1999 / 264 \\
                 12: Increasing Availability and Participation: January
                 1998--December 1999 / 281 \\
                 13: Completing Arts and Sciences I and Strategizing for
                 the Future: July 1998--December 1999 / 301 \\
                 14: Challenges and Opportunities of Growth: January
                 2000--December 2001 / 318 \\
                 Conclusion: A Self-Sustaining Organization / 355 \\
                 Epilogue: Lessons Learned / 374 \\
                 App. List of Journals / 387 \\
                 Bibliography / 393 \\
                 Index / 405",
}

@Book{Schoonover:1992:GEU,
  author =       "Michael A. Schoonover and John S. Bowie and William R.
                 Arnold",
  title =        "{GNU Emacs}: {UNIX} Text Editing and Programming",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xxvii + 609",
  year =         "1992",
  ISBN =         "0-201-56345-2",
  ISBN-13 =      "978-0-201-56345-0",
  LCCN =         "QA76.76.T49S36",
  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",
  series =       "Hewlett-Packard Press series",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "Preface \\
                 Part 1: Text editing in Emacs \\
                 1: A quick tour of Emacs \\
                 2: Basic editing commands \\
                 3: More efficient editing \\
                 4: Advanced editing \\
                 Part 2: Programming in Emacs \\
                 5: Program development in Emacs \\
                 6: Editing in C mode \\
                 7: Editing in FORTRAN mode \\
                 8: Editing in Lisp modes \\
                 Part 3: Additional Emacs features \\
                 9: Getting online help \\
                 10: Using Emacs for electronic mail \\
                 11: Managing files and buffers \\
                 12: Miscellaneous Emacs features \\
                 Part 4: Customizing and administering Emacs \\
                 13: Customizing the Emacs environment \\
                 14: Administering Emacs \\
                 A: Editing in Pascal mode \\
                 B: Emacs-Lisp Programming \\
                 C: Switching from vi to Emacs \\
                 D: Emacs command reference \\
                 Index",
  subject =      "Text editors (Computer programs); GNU Emacs; UNIX
                 (Computer file)",
  tableofcontents = "Preface \\
                 Text Editing In Emacs \\
                 A Quick Tour of Emacs \\
                 Starting Emacs \\
                 Exiting Emacs \\
                 Understanding the Emacs Screen \\
                 Tying Text \\
                 Typing Commands \\
                 Using a Basic Set of Editing Commands \\
                 Getting Online Help \\
                 Using Emacs to Process Electronic Mail \\
                 Using Emacs to Manage Files \\
                 Changing Emacs' Behavior with Variables \\
                 Basic Editing Commands \\
                 Visiting a File \\
                 Saving a Buffer \\
                 Listing Buffers \\
                 Switching to a Different Buffer \\
                 Killing A Buffer \\
                 Setting the Mode for a Buffer \\
                 Moving the Cursor \\
                 Using Line Numbers \\
                 Deleting Text \\
                 Undoing Mistakes \\
                 Using Regions \\
                 Searching for Text \\
                 Searching and Replacing Text \\
                 Overwriting Text \\
                 More Efficient Editing \\
                 Running a Command Multiple Times \\
                 Modifying Command Behavior with Arguments \\
                 Inserting Control Characters into a Buffer \\
                 Working with Words, Sentences, and Paragraphs \\
                 Working with Pages \\
                 Working with Blank Lines \\
                 Getting Cursor, Line, and Page Information \\
                 Transposing Text \\
                 Filling Text \\
                 Indenting Text \\
                 Changing Letter Case \\
                 Searching and Replacing Text \\
                 Narrowing a Buffer \\
                 Moving the Cursor to Previous Marks (the Mark Ring) \\
                 Using the Kill Ring \\
                 Completing Long Command Names \\
                 Completing File Names \\
                 Using Abbreviations (Text Expansions) \\
                 Using Macros for Repeated Editing Tasks \\
                 Scrolling Windows \\
                 Wording with Multiple Windows \\
                 Printing a Buffer \\
                 Listing a Directory \\
                 Advanced Editing \\
                 Changing Emacs' Behavior with Commands \\
                 Changing Emacs' Behavior with Command-Line Arguments
                 \\
                 Searching for Regular Expressions (Regexps) \\
                 Searching and Replacing Regexps \\
                 Editing Outlines \\
                 Manipulating Buffers \\
                 Advanced File Operations \\
                 Managing Auto-Saving \\
                 Managing Emacs Backup Files \\
                 Reverting a Buffer to Its Original Contents \\
                 Preventing Simultaneous Editing \\
                 Advanced Window Operations \\
                 Editing Your Responses in the Minibuffer \\
                 Sorting Test \\
                 Using Rectangles \\
                 Using Registers \\
                 Programming In Emacs \\
                 Program Development in Emacs \\
                 Supported Editing Modes \\
                 Using Fundamental and Text Mode Commands in Programming
                 Modes \\
                 Moving by Function \\
                 Marking Functions \\
                 Indenting Programs Commenting Programs \\
                 Matching Parentheses, Braces, and Brackets \\
                 Forcing Balanced Parentheses \\
                 Selectively Displaying Program Lines \\
                 Getting Documentation on System Commands and Routines
                 \\
                 Editing Across Multiple Files with Tag Tables \\
                 Keeping Track of Changes to source with a ChangeLog \\
                 Compiling Programs \\
                 Sexp Commands (Advanced Usage) \\
                 Editing in C Mode \\
                 Invoking C Mode \\
                 Assumptions About C Source \\
                 Moving Among Functions \\
                 Marking Functions \\
                 Indenting Programs \\
                 Commenting Programs \\
                 Working with Sexps and Lists (Advanced Usage) \\
                 Customizing Indentation (Advanced Usage) \\
                 Customizing Commenting (Advanced Usage) \\
                 Editing in FORTRAN Mode \\
                 Invoking FORTRAN Mode \\
                 Assumptions About FORTRAN Source \\
                 Moving Among Subprograms and Statements \\
                 Marking Subprograms \\
                 Indenting Programs \\
                 Labeling Lines \\
                 Commenting Programs \\
                 Using FORTRAN Keyword Abbreviations \\
                 Working with Sexps and Lists (Advanced Usage) \\
                 What Are Sexps and Lists in FORTRAN Mode? \\
                 Customizing Indentation (Advanced Usage) \\
                 Customizing Commenting (Advanced Usage) \\
                 Editing in Lisp Modes \\
                 Lisp Major Modes \\
                 Assumptions About Lisp Source \\
                 Moving Among Defuns \\
                 Moving Among Sexps and Lists \\
                 List and Sexp Motion Commands \\
                 Marking Text \\
                 Transposing Sexps \\
                 Killing Sexps \\
                 Indenting Programs \\
                 Commenting Programs \\
                 Evaluating Lisp Code \\
                 Customizing Indentation (Advanced Usage) \\
                 Customizing Commenting (Advanced Usage) \\
                 Additional Emacs Features \\
                 Getting Online Help \\
                 Running Help Commands \\
                 Getting Instructions for Using Help \\
                 Getting Command Information \\
                 Using Emacs for Electronic Mail \\
                 The RMAIL Facility and Other UNIX Mail Facilities \\
                 Reading Mail Messages \\
                 Exiting from the RMAIL Buffer Moving Around Your Mail
                 Messages \\
                 Saving Messages to Files \\
                 Removing Messages \\
                 Getting New Mail \\
                 Using a Mail Summary to Scan Messages \\
                 Composing and Sending Messages \\
                 Using Mode Line Status Messages (Labels) \\
                 Using Multiple Mailbox Files \\
                 Reading Digest Messages \\
                 Associating UNIX Mailbox Files with RMAIL Mailbox Files
                 (Advanced Usage) \\
                 Managing Files and Buffers \\
                 Using the Dired Facility to Manage Files \\
                 Managing Multiple Buffers with Buffer-Menus \\
                 Miscellaneous Emacs Features \\
                 Checking Your Spelling \\
                 Rerunning Commands from the Command History \\
                 Recovering Files After System Crashes \\
                 Using UNIX Commands in Emacs \\
                 Running a UNIX Shell in an Emacs Buffer \\
                 Nroff Major Mode \\
                 TeX Modes: LaTeX and Plain TeX \\
                 Picture Mode \\
                 Doctor Mode \\
                 Customizing And Administering Emacs \\
                 Customizing the Emacs Environment \\
                 Using a .emacs Start-Up File \\
                 Using Variables to Change Emacs' Behavior \\
                 Changing Command Key Bindings \\
                 Forcing Confirmation for a Function \\
                 More About Variable (Advanced Usage) \\
                 More About Key Bindings (Advanced Usage) \\
                 Examples of .emacs Customizations \\
                 Administering Emacs \\
                 Finding Emacs and identifying Its Parts \\
                 Using New (or Notes) to Get Emacs Information \\
                 Installing Emacs \\
                 Editing in Pascal Mode \\
                 Obtaining a Pascal Mode \\
                 Enabling Pascal Mode \\
                 Assumptions About Pascal Source \\
                 Moving the Cursor \\
                 Indenting Programs \\
                 Commands That Build Pascal Constructs \\
                 Creating a New Program \\
                 Commenting Programs \\
                 Working with Sexps and Lists (Advanced Usage) \\
                 Customizing Indentation \\
                 Customizing Commenting (Advanced Usage) \\
                 Summary \\
                 Emacs-Lisp Programming \\
                 An Overview of Emacs-Lisp Programming \\
                 Getting Documentation on Emacs-Lisp Defuns and
                 Variables \\
                 Evaluating Lisp Code \\
                 Loading Emacs-Lisp Libraries \\
                 Compiling Emacs-Lisp Code \\
                 Debugging Emacs-Lisp Code (Advanced Usage) \\
                 Converting Mocklisp to Emacs-Lisp (for Mocklisp Users)
                 \\
                 Summary \\
                 Switching from vi to Emacs \\
                 The vi Emulation Mode in Emacs \\
                 Starting the Editor \\
                 Saving Text and Exiting \\
                 Line Number Information Commands \\
                 Inserting Text \\
                 Undoing Commands \\
                 Repeating Commands \\
                 Rerunning Previous Commands \\
                 Moving the Cursor \\
                 Deleting Text \\
                 Using Marks \\
                 Searching for Text Search and Replace Text \\
                 Indenting Text \\
                 Copying and Moving Blocks of Text \\
                 Changing (Overwriting) Text \\
                 Scrolling Text \\
                 Using Shell Commands \\
                 Using Macros \\
                 Using Abbreviations \\
                 Miscellaneous Commands \\
                 Emacs Command Reference \\
                 Abbreviations \\
                 Buffers \\
                 Buffer-Menu \\
                 Case Conversion \\
                 C Mode \\
                 Compilation \\
                 Cursor Motion \\
                 Debugger (Emacs-Lisp) \\
                 Deletion and Killing \\
                 Dired \\
                 Display Management \\
                 Editor Emulation (EDT, vi, Gosling Emacs) \\
                 Emacs-Lisp Programming \\
                 Exiting \\
                 files \\
                 Filling \\
                 FORTRAN Mode \\
                 Help \\
                 Indentation \\
                 Key Bindings \\
                 Killing and Yanking (Moving and Copying) \\
                 Lisp Modes \\
                 Location and Date/Time \\
                 Macros \\
                 Mail \\
                 Minibuffer Editing \\
                 Modes \\
                 Nroff Mode \\
                 Numeric Prefix \\
                 Outline Editing \\
                 Pages \\
                 Paragraphs \\
                 Picture Mode \\
                 Printing \\
                 Rectangles \\
                 Regions \\
                 Registers \\
                 Searching \\
                 Searching and Replacing \\
                 Sentences \\
                 Sexps and Lists (Balanced Expressions) \\
                 Shells \\
                 Sorting \\
                 Spell-Checking \\
                 Tags \\
                 TeX Mode \\
                 Transposing \\
                 Undo \\
                 Variables \\
                 Windows \\
                 Words \\
                 Index",
}

@Book{Schreiner:1985:ICC,
  author =       "Axel T. Schreiner and H. George {Friedman, Jr.}",
  title =        "Introduction to Compiler Construction Under {UNIX}",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "viii + 194",
  year =         "1985",
  ISBN =         "0-13-474396-2",
  ISBN-13 =      "978-0-13-474396-7",
  LCCN =         "QA76.76.C65 S37 1985",
  bibdate =      "Wed Dec 15 18:20:18 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "ftp://ftp.cs.uiuc.edu/pub/faculty/friedman/tar",
  acknowledgement = ack-nhfb,
  tableofcontents = "Language definition \\
                 Word recognition \\
                 Language recognition \\
                 Error recovery \\
                 Semantic restrictions \\
                 Memory allocation \\
                 Code generation \\
                 A load-and-go system \\
                 Sample C compiler listing",
}

@Book{Schroeder:1991:FCP,
  author =       "Manfred Schroeder",
  title =        "Fractals, Chaos, Power Laws",
  publisher =    pub-W-H-FREEMAN,
  address =      pub-W-H-FREEMAN:adr,
  pages =        "xviii + 429",
  year =         "1991",
  ISBN =         "0-671-74217-5, 0-7167-2136-8, 0-7167-2357-3",
  ISBN-13 =      "978-0-671-74217-1, 978-0-7167-2136-9,
                 978-0-7167-2357-8",
  LCCN =         "QD921 .S3 1990",
  bibdate =      "Wed Dec 15 10:41:35 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/h/heisenberg-werner.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/s/shannon-claude-elwood.bib;
                 https://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
                 https://www.math.utah.edu/pub/tex/bib/fibquart.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/pi.bib",
  abstract =     "Reveals the extraordinary dimensions of new
                 mathematical insights about the nature of physical
                 reality; explores the powerful applications of these
                 symmetry concepts in physics, chemistry, music, and the
                 visual arts. Includes such areas as deterministic chaos
                 and strange attractors, iterated mappings, nonlinear
                 dynamics, Cayley trees, cellular automata, random
                 fractals and related topics.",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "Introduction \\
                 Similarity and dissimilarity \\
                 Self-similarity --- discrete, continuous, strict, and
                 otherwise \\
                 Power laws: endless sources of self-similarity \\
                 Noises: white, pink, brown, and black \\
                 Brownian motion, gambling losses, and intergalactic
                 voids: random fractals par excellence \\
                 Cantor sets: self-similarity and arithmetic dust \\
                 Fractals in higher dimensions and a digital sundial \\
                 Multifractals: intimately intertwined fractals \\
                 Some practical fractals and their measurement \\
                 Iteration, strange mappings, and a billion digits for
                 $\pi$ \\
                 A self-similar sequence, the logistic parabola, and
                 symbolic dynamics \\
                 A forbidden symmetry, Fibonacci's rabbits, and a new
                 state of matter \\
                 Periodic and quasiperiodic structures in space --- the
                 route to spatial chaos \\
                 Percolation: from forest fires to epidemics \\
                 Phase transitions and renormalization \\
                 Cellular automata",
  tableofcontents = "Preface / xiii \\
                 1: Introduction / 1 \\
                 Einstein, Pythagoras, and Simple Similarity / 3 \\
                 A Self-Similar Array of Self-Preserving Queens / 4 \\
                 A Self-Similar Snowflake / 7 \\
                 A New Dimension for Fractals / 9 \\
                 A Self-Similar Tiling and a ``Non-Euclidean'' Paradox /
                 13 \\
                 At the Gates of Cantor's Paradise / 15 \\
                 The Sierpinski Gasket / 17 \\
                 Sir Pinski's Game and Deterministic Chaos / 20 \\
                 Three Bodies Cause Chaos / 25 \\
                 Strange Attractors, Their Basins, and a Chaos Game 2 /
                 7 \\
                 Percolating Random Fractals / 30 \\
                 Power Laws: from Alvarez to Zipf / 33 \\
                 Newton's Iteration and How to Abolish Two-Nation
                 Boundaries / 38 \\
                 Could Minkowski Hear the Shape of a Drum? / 40 \\
                 Discrete Self-Similarity: Creases and Center Folds / 45
                 \\
                 Golden and Silver Means and Hyperbolic Chaos / 49 \\
                 Winning at Fibonacci Nim / 53 \\
                 Self-Similar Sequences from Square Lattices / 55 \\
                 John Horton Conway's ``Death Bet'' / 57 \\
                 2: Similarity and Dissimilarity / 61 \\
                 More Than One Scale / 61 \\
                 To Scale or Not to Scale: A Bit of Biology and
                 Astrophysics / 63 \\
                 Similarity in Physics: Some Astounding Consequences /
                 66 \\
                 Similarity in Concert Halls, Microwaves, and
                 Hydrodynamics / 68 \\
                 Scaling in Psychology / 70 \\
                 Acousticians, Alchemy, and Concert Halls / 72 \\
                 Preference and Dissimilarity: Concert Halls Revisited /
                 74 \\
                 3: Self-Similarity --- Discrete, Continuous, Strict,
                 and Otherwise / 81 \\
                 The Logarithmic Spiral, Cutting Knives, and Wideband
                 Antennas / 89 \\
                 Some Simple Cases of Self-Similarity / 93 \\
                 Weierstrass Functions and a Musical Paradox / 96 \\
                 More Self-Similarity in Music: The Tempered Scales of
                 Bach / 99 \\
                 The Excellent Relations between the Primes 3, 5, and 7
                 / 102 \\
                 4: Power Laws: Endless Sources of Self-Similarity / 103
                 \\
                 The Sizes of Cities and Meteorites / 103 \\
                 A Fifth Force of Attraction / 105 \\
                 Free of Natural Scales / 107 \\
                 Bach Composing on All Scales / 107 \\
                 Birkhoff's Aesthetic Theory / 109 \\
                 Heisenberg's Hyperbolic Uncertainty Principle / 112 \\
                 Fractional Exponents / 115 \\
                 The Peculiar Distribution of the First Digit / 116 \\
                 The Diameter Exponents of Trees, Rivers, Arteries, and
                 Lungs / 117 \\
                 5: Noises: White, Pink, Brown, and Black / 121 \\
                 Pink Noise / 122 \\
                 Self-Similar Trends on the Stock Market / 126 \\
                 Black Noises and Nile Floods / 129 \\
                 Warning: World Warming / 131 \\
                 Fractional Integration: A Modem Tool / 131 \\
                 Brownian Mountains / 133 \\
                 Radon Transform and Computer Tomography / 134 \\
                 Fresh and Tired Mountains / 135 \\
                 6: Brownian Motion, Gambling Losses, and Intergalactic
                 Voids: Random Fractals Par Excellence / 139 \\
                 The Brownian Beast Tamed / 140 \\
                 Brownian Motion as a Fractal / 141 \\
                 How Many Molecules? / 143 \\
                 The Spectrum of Brownian Motion / 144 \\
                 The Gambler's Ruin, Random Walks, and Information
                 Theory / 145 \\
                 Counterintuition Runs Rampant in Random Runs / 146 \\
                 More Food for Fair Thought / 147 \\
                 The St. Petersburg Paradox / 148 \\
                 Shannon's Outguessing Machine / 149 \\
                 The Classical Mechanics of Roulette and Shannon's
                 Channel Capacity / 150 \\
                 The Clustering of Poverty and Galaxies / 152 \\
                 Levy Flights through the Universe / 155 \\
                 Paradoxes from Probabilistic Power Laws / 155 \\
                 Invariant Distributions: Gauss, Cauchy, and Beyond /
                 157 \\
                 7: Cantor Sets: Self-Similarity and Arithmetic Dust /
                 161 \\
                 A Comer of Cantor's Paradise / 161 \\
                 Cantor Sets as Invariant Sets / 165 \\
                 Symbolic Dynamics and Deterministic Chaos / 166 \\
                 Devil's Staircases and a Pinball Machine / 167 \\
                 Mode Locking in Swings and Clocks / 171 \\
                 The Frustrated Manhattan Pedestrian / 172 \\
                 Arnold Tongues 17 / 4 \\
                 8: Fractals in Higher Dimensions and a Digital Sundial
                 / 177 \\
                 Cartesian Products of Cantor Sets / 177 \\
                 A Leaky Gasket, Soft Sponges, and Swiss Cheeses / 178
                 \\
                 A Cantor-Set Sundial / 181 \\
                 Fat Fractals / 183 \\
                 9: Multifractals: Intimately Intertwined Fractals / 187
                 \\
                 The Distributions of People and Ore / 187 \\
                 Self-Affine Fractals without Holes / 190 \\
                 The Multifractal Spectrum: Turbulence and
                 Diffusion-Limited Aggregation / 193 \\
                 Viscous Fingering / 199 \\
                 Multifractals on Fractals / 200 \\
                 Fractal Dimensions from Generalized Entropies / 203 \\
                 The Relation between the Multifractal Spectrum
                 $f(\alpha)$ and the Mass Exponents $(q)$ / 205 \\
                 Strange Attractors as Multifractals / 206 \\
                 A Greedy Algorithm for Unfavorable Odds / 207 \\
                 10: Some Practical Fractals and Their Measurement / 211
                 \\
                 Dimensions from Box Counting / 213 \\
                 The Mass Dimension / 215 \\
                 The Correlation Dimension / 220 \\
                 Infinitely Many Dimensions / 220 \\
                 The Determination of Fractal Dimensions from Time
                 Series / 223 \\
                 Abstract Concrete / 224 \\
                 Fractal Interfaces Enforce Fractional Frequency
                 Exponents / 225 \\
                 The Fractal Dimensions of Fracture Surfaces / 230 \\
                 The Fractal Shapes of Clouds and Rain Areas / 231 \\
                 Cluster Agglomeration / 232 \\
                 Diffraction from Fractals / 233 \\
                 11: Iteration, Strange Mappings, and a Billion Digits
                 for Pi / 237 \\
                 Looking for Zeros and Encountering Chaos / 239 \\
                 The Strange Sets of Julia / 243 \\
                 A Multifractal Julia Set / 245 \\
                 The Beauty of Broken Linear Relationships / 249 \\
                 The Baker's Transformation and Digital Musical Chairs /
                 251 \\
                 Arnol'd's Cat Map / 253 \\
                 A Billion Digits for $\pi$ / 257 \\
                 Bushes and Flowers from Iterations / 259 \\
                 12: A Self-Similar Sequence, the Logistic Parabola, and
                 Symbolic Dynamics / 263 \\
                 Self-Similarity from the Integers / 264 \\
                 The Logistic Parabola and Period Doubling / 268 \\
                 Self-Similarity in the Logistic Parabola / 272 \\
                 The Scaling of the Growth Parameter / 274 \\
                 Self-Similar Symbolic Dynamics / 277 \\
                 Periodic Windows Embedded in Chaos / 279 \\
                 The Parenting of New Orbits / 282 \\
                 The Calculation of the Growth Parameters for Different
                 Orbits / 286 \\
                 Tangent Bifurcations, Intermittency, and I/f Noise /
                 289 \\
                 A Case of Complete Chaos / 291 \\
                 The Mandelbrot Set / 295 \\
                 The Julia Sets of the Complex Quadratic Map / 297 \\
                 13: A Forbidden Symmetry, Fibonacci's Rabbits, and a
                 New State of Matter / 301 \\
                 The Forbidden Fivefold Symmetry / 301 \\
                 Long-Range Order from Neighborly Interactions / 304 \\
                 Generation of the Rabbit Sequence from the Fibonacci
                 Number System / 307 \\
                 The Self-Similar Spectrum of the Rabbit Sequence / 308
                 \\
                 Self-Similarity in the Rabbit Sequence / 310 \\
                 A One-Dimensional Quasiperiodic Lattice / 310 \\
                 Self-Similarity from Projections / 311 \\
                 More Forbidden Symmetries / 315 \\
                 14: Periodic and Quasiperiodic Structures in Space ---
                 The route to Spatial Chaos / 319 \\
                 Periodicity and Quasiperiodicity in Space / 320 \\
                 The Devil's Staircase for Ising Spins / 321 \\
                 Quasiperiodic Spatial Distributions / 322 \\
                 Beatty Sequence Spins / 325 \\
                 The Scaling Laws for Quasiperiodic Spins / 329 \\
                 Self-Similar Winding Numbers / 330 \\
                 Circle Maps and Arnold Tongues / 331 \\
                 Mediants, Farey Sequences, and the Farey Tree / 334 \\
                 The Golden-Mean Route to Chaos / 340 \\
                 15: Percolation: From Forest Fires to Epidemics / 345
                 \\
                 Critical Conflagration on a Square Lattice / 346 \\
                 Universality / 350 \\
                 The Critical Density / 353 \\
                 The Fractal Perimeters of Percolation / 353 \\
                 Finite-Size Scaling / 354 \\
                 16: Phase Transitions and Renormalization / 357 \\
                 A First-Order Markov Process / 357 \\
                 Self-Similar and Non-Self-Similar Markov Processes /
                 358 \\
                 The Scaling of Markov Output's / 360 \\
                 Renormalization and Hierarchical Lattices / 362 \\
                 The Percolation Threshold of the Bethe Lattice / 363
                 \\
                 A Simple Renormalization / 367 \\
                 17: Cellular Automata / 371 \\
                 The Game of Life / 373 \\
                 Cellular Growth and Decay / 375 \\
                 Biological Pattern Formation / 382 \\
                 Self-Similarity from a Cellular Automaton / 383 \\
                 A Catalytic Converter as a Cellular Automaton / 386 \\
                 Pascal's Triangle Modulo $N$ / 387 \\
                 Bak's Self-Organized Critical Sandpiles / 389 \\
                 Appendix / 391 \\
                 References / 395 \\
                 Author Index / 411 \\
                 Subject Index / 417",
}

@Book{Schroeder:1998:VT,
  author =       "William J. Schroeder and Kenneth M. Martin and William
                 E. Lorensen",
  title =        "The Visualization Toolkit",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  edition =      "Second",
  pages =        "xx + 645",
  year =         "1998",
  ISBN =         "0-13-954694-4",
  ISBN-13 =      "978-0-13-954694-5",
  LCCN =         "QA76.64.S36 1997",
  bibdate =      "Mon Apr 13 10:46:55 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "With special contributors Lisa Sobierajski Avila, Rick
                 Avila, and C. Charles Law. Includes CD-ROM with
                 vtk-2.0. The most recent release is available on the
                 World-Wide Web at
                 \path=http://www.kitware.com/vtk.html=.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  tableofcontents = "Introduction \\
                 Object-oriented design \\
                 Computer graphics primer \\
                 The visualization pipeline \\
                 Basic data representation \\
                 Fundamental algorithms \\
                 Advanced computer graphics \\
                 Color plates \\
                 Advanced data representation \\
                 Advanced algorithms \\
                 Image processing \\
                 Interpreters and Tcl/Tk \\
                 Visualization on the web \\
                 Applications \\
                 Appendix A: Software guide \\
                 Appendix B: CD-ROM organization \\
                 Glossary",
}

@Book{Schwarz:1988:ET,
  author =       "Norbert Schwarz",
  title =        "Einf{\"u}hrung in {\TeX{}}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Second",
  pages =        "272",
  year =         "1988",
  ISBN =         "3-925118-97-7",
  ISBN-13 =      "978-3-925118-97-5",
  bibdate =      "Wed Dec 15 18:20:05 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "DM 68",
  acknowledgement = ack-nhfb,
}

@Book{Schweber:2008:EOM,
  author =       "S. S. (Silvan S.) Schweber",
  title =        "{Einstein} and {Oppenheimer}: the meaning of genius",
  publisher =    pub-HARVARD,
  address =      pub-HARVARD:adr,
  pages =        "xiv + 412",
  year =         "2008",
  ISBN =         "0-674-02828-7",
  ISBN-13 =      "978-0-674-02828-9",
  LCCN =         "QC16.E5 S3285 2008",
  bibdate =      "Thu Sep 18 21:33:15 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/o/oppenheimer-j-robert.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/toc/ecip082/2007043108.html",
  acknowledgement = ack-nhfb,
  subject =      "Einstein, Albert; Oppenheimer, J. Robert; physicists;
                 intellectual Life; 20th Century; psychology; science;
                 history",
  subject-dates = "1879--1955; 1904--1967",
  tableofcontents = "Albert Einstein and nuclear weapons \\
                 Albert Einstein and the founding of Brandeis University
                 \\
                 J. Robert Oppenheimer: proteus unbound \\
                 J. Robert Oppenheimer and American pragmatism \\
                 Einstein, Oppenheimer, and the extension of physics \\
                 Einstein, Oppenheimer, and the meaning of community",
}

@Book{Schweber:2012:NFM,
  author =       "S. S. (Silvan S.) Schweber",
  title =        "Nuclear forces: the making of the physicist {Hans
                 Bethe}",
  publisher =    pub-HARVARD,
  address =      pub-HARVARD:adr,
  pages =        "viii + 579 + 12",
  year =         "2012",
  ISBN =         "0-674-06587-5 (hardcover)",
  ISBN-13 =      "978-0-674-06587-1 (hardcover)",
  LCCN =         "QC774.B4 S39 2012",
  bibdate =      "Mon Nov 19 13:35:16 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/bethe-hans.bib;
                 https://www.math.utah.edu/pub/tex/bib/bjhs2010.bib;
                 https://www.math.utah.edu/pub/tex/bib/hsns.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 jenson.stanford.edu:2210/unicorn;
                 library.ox.ac.uk:210/ADVANCE",
  price =        "\pounds 25.95",
  acknowledgement = ack-nhfb,
  subject =      "Bethe, Hans A; (Hans Albrecht); Nuclear physicists;
                 Biography",
  subject-dates = "1906--2005",
  tableofcontents = "Growing Up \\
                 Maturing \\
                 Becoming Bethe \\
                 Beyond the Doctorate: 1928--1933 \\
                 England, 1933--1935 \\
                 Hilde Levi \\
                 Cornell University \\
                 The Happy Thirties \\
                 Rose Ewald Bethe \\
                 Conclusion: Past and Future \\
                 Appendix A: The Bethe Family Genealogy \\
                 Appendix B: Courses Taken at Frankfurt University \\
                 Appendix C: A Brief History of the Genesis of Quantum
                 Mechanics \\
                 Appendix D: Courses Taken at Munich University \\
                 Appendix E: Bethe's Doctoral Thesis \\
                 Appendix F: The Habilitationsschrift Defense",
}

@Book{Schwichtenberg:2015:PS,
  author =       "Jakob Schwichtenberg",
  title =        "Physics from Symmetry",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xix + 279",
  year =         "2015",
  ISBN =         "3-319-19200-0, 3-319-66631-2 (e-book)",
  ISBN-13 =      "978-3-319-19200-0, 978-3-319-66631-0 (e-book)",
  LCCN =         "QC174.17.S9 S4 2015eb",
  bibdate =      "Wed Jan 27 13:21:23 MST 2021",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Undergraduate lecture notes in physics",
  abstract =     "This is a textbook that derives the fundamental
                 theories of physics from symmetry. It starts by
                 introducing, in a completely self-contained way, all
                 mathematical tools needed to use symmetry ideas in
                 physics. Thereafter, these tools are put into action
                 and by using symmetry constraints, the fundamental
                 equations of Quantum Mechanics, Quantum Field Theory,
                 Electromagnetism, and Classical Mechanics are derived.
                 As a result, the reader is able to understand the basic
                 assumptions behind, and the connections between the
                 modern theories of physics. The book concludes with
                 first applications of the previously derived
                 equations.",
  acknowledgement = ack-nhfb,
  subject =      "Symmetry (Physics); Symmetrie; Physik",
  tableofcontents = "Special Relativity \\
                 Lie group theory \\
                 The framework \\
                 Measuring nature \\
                 Free theory \\
                 Interaction theory \\
                 Quantum mechanics \\
                 Quantum field theory \\
                 Classical mechanics \\
                 Electrodynamics \\
                 Gravity \\
                 Closing Words \\
                 Appendices \\
                 Vector calculus \\
                 Calculus \\
                 Linear algebra \\
                 Additional mathematical notions",
}

@Book{Schwinger:2015:AM,
  author =       "Julian Schwinger",
  title =        "On Angular Momentum",
  publisher =    pub-DOVER,
  address =      pub-DOVER:adr,
  pages =        "51",
  year =         "2015",
  ISBN =         "0-486-78810-5 (paperback)",
  ISBN-13 =      "978-0-486-78810-4 (paperback)",
  LCCN =         "QC793.3.A5 S39 2015",
  bibdate =      "Sat Apr 7 18:17:43 MDT 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy1503/2014036399-b.html;
                 http://www.loc.gov/catdir/enhancements/fy1503/2014036399-d.html",
  abstract =     "A concise treatment of angular momentum by an
                 important American physicist, this major work was first
                 published under the auspices of the United States
                 Atomic Energy Commission in 1952 and is finally
                 available to a general audience of students and
                 professionals in the field. Advanced undergraduates and
                 graduate students of physics will particularly benefit
                 from its teachings. One of the most prominent American
                 physicists of the twentieth century, Julian Schwinger
                 (1918--94) taught at Harvard, MIT, and UCLA, among
                 other institutions. In addition to his many other
                 awards, Schwinger, jointly with Richard Feynman and
                 Shinichiro Tomonaga, received the Nobel Prize in
                 Physics in 1965 for his work in quantum
                 electrodynamics.",
  acknowledgement = ack-nhfb,
  author-dates = "1918--1994",
  libnote =      "Not in my library.",
  remark =       "Originally published: Oak Ridge, Tenn.: U.S. Atomic
                 Energy Commission. Distributed by Technical Information
                 Service, 1952. (U.S. Atomic Energy Commission report;
                 NYO 3071).",
  subject =      "Angular momentum (Nuclear physics); Dynamics of a
                 particle",
  tableofcontents = "1. Introduction \\
                 2. Rotations \\
                 3. Addition of two angular momenta \\
                 4. Three and four angular momenta \\
                 5. Tensor operators",
}

@Book{Scott:1982:IIC,
  author =       "Joan E. Scott",
  title =        "Introduction to Interactive Computer Graphics",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xi + 255",
  year =         "1982",
  ISBN =         "0-471-05773-8 (hardcover), 0-471-86623-7 (paperback)",
  ISBN-13 =      "978-0-471-05773-4 (hardcover), 978-0-471-86623-7
                 (paperback)",
  LCCN =         "T385.S36",
  bibdate =      "Wed Dec 15 10:41:36 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Scott:2000:PLP,
  author =       "Michael Lee Scott",
  title =        "Programming Language Pragmatics",
  publisher =    pub-MORGAN-KAUFMANN,
  address =      pub-MORGAN-KAUFMANN:adrsf,
  pages =        "xxi + 856",
  year =         "2000",
  ISBN =         "1-55860-578-9 (paperback), 1-55860-442-1 (hardcover)",
  ISBN-13 =      "978-1-55860-578-7 (paperback), 978-1-55860-442-1
                 (hardcover)",
  LCCN =         "QA76.7 .S38 2000",
  bibdate =      "Fri Sep 5 13:01:33 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/description/els033/99047125.html;
                 http://www.loc.gov/catdir/toc/els033/99047125.html",
  abstract =     "\booktitle{Programming Language Pragmatics} addresses
                 the fundamental principles at work in the most
                 important contemporary languages, highlights the
                 critical relationship between language design and
                 language implementation, and devotes special attention
                 to issues of importance to the expert programmer.
                 Thanks to its rigorous but accessible teaching style,
                 you'll emerge better prepared to choose the best
                 language for particular projects, to make more
                 effective use of languages you already know, and to
                 learn new languages quickly and completely.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Programming languages (Electronic computers)",
  tableofcontents = "1: Introduction \\
                 2: Programming Language Syntax \\
                 3: Names, Scopes, and Bindings \\
                 4: Semantic Analysis \\
                 5: Assembly-Level Computer Architecture \\
                 6: Control Flow \\
                 7: Data Types \\
                 8: Subroutines and Control Abstraction \\
                 9: Building a Runnable Program \\
                 10: Data Abstraction and Object Orientation \\
                 11: Nonimperative Programming Models: Functional and
                 Logic Languages \\
                 12: Concurrency \\
                 13: Code Improvement \\
                 Appendix A: Programming Languages Mentioned \\
                 Appendix B: Language Design and Language
                 Implementation",
}

@Book{Scott:2006:PLP,
  author =       "Michael Lee Scott",
  title =        "Programming Language Pragmatics",
  publisher =    pub-MORGAN-KAUFMANN,
  address =      pub-MORGAN-KAUFMANN:adrsf,
  edition =      "Second",
  pages =        "xxxi + 875",
  year =         "2006",
  ISBN =         "0-12-633951-1",
  ISBN-13 =      "978-0-12-633951-2",
  LCCN =         "QA76.7 .S38 2006",
  bibdate =      "Fri Sep 5 12:53:37 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0632/2006272697-d.html",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Programming languages (Electronic computers)",
  tableofcontents = "Part I. Foundations \\
                 1: Introduction \\
                 2: Programming language syntax \\
                 3: Names, scopes, and bindings \\
                 4: Semantic analysis \\
                 5: Target machine architecture \\
                 Part II. Core issues in language design \\
                 6: Control flow \\
                 7: Data types \\
                 8: Subroutines and control abstraction \\
                 9: Data abstraction and object orientation \\
                 Part III. Alternative programming models \\
                 10: Functional languages \\
                 11: Logic languages \\
                 12: Concurrency \\
                 13: Scripting languages \\
                 Part IV. A closer look at implementation \\
                 14: Building a runnable program \\
                 15: Code improvement \\
                 A: Programming languages mentioned \\
                 B: Language design and language implementation",
}

@Book{Seacord:2005:SCC,
  author =       "Robert C. Seacord",
  title =        "Secure coding in {C} and {C++}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xxiv + 341",
  year =         "2005",
  ISBN =         "0-321-33572-4 (paperback)",
  ISBN-13 =      "978-0-321-33572-2 (paperback)",
  LCCN =         "QA76.9.A25 S368 2005",
  bibdate =      "Thu Aug 31 10:52:01 MDT 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.cert.org/books/secure-coding/;
                 http://www.loc.gov/catdir/toc/ecip0513/2005015012.html",
  acknowledgement = ack-nhfb,
  subject =      "Computer security; C (Computer program language); C++
                 (Computer program language)",
  tableofcontents = "Contents \\
                 Preface ix \\
                 1 Running with Scissors 1 \\
                 1.1 Gauging the Threat 4 \\
                 1.2 Security Concepts 9 \\
                 1.3 C and C++ 14 \\
                 1.4 Development Platforms 17 \\
                 1.5 Summary 21 \\
                 1.6 For Further Reading 21 \\
                 2 Strings 23 \\
                 2.1 String Characteristics 23 \\
                 2.2 Common String Manipulation Errors 24 \\
                 2.3 String Vulnerabilities 30 \\
                 2.4 Process Memory Organization 33 \\
                 2.5 Stack Smashing 37 \\
                 2.6 Code Injection 42 \\
                 2.7 Arc Injection 45 \\
                 2.8 Mitigation Strategies 48 \\
                 2.9 Notable Vulnerabilities 66 \\
                 2.10 Summary 68 \\
                 2.11 For Further Reading 70 \\
                 3 Pointer Subterfuge 71 \\
                 3.1 Data Locations 72 \\
                 3.2 Function Pointers 73 \\
                 3.3 Data Pointers 74 \\
                 3.4 Modifying the Instruction Pointer 75 \\
                 3.5 Global Offset Table 76 \\
                 3.6 The .dtors Section 78 \\
                 3.7 Virtual Pointers 80 \\
                 3.8 The atexit() and on\_exit() Functions 82 \\
                 3.9 The longjmp() Function 84 \\
                 3.10 Exception Handling 85 \\
                 3.11 Mitigation Strategies 89 \\
                 3.12 Summary 89 \\
                 3.13 For Further Reading 90 \\
                 4 Dynamic Memory Management 91 \\
                 4.1 Dynamic Memory Management 92 \\
                 4.2 Common Dynamic Memory Management Errors 94 \\
                 4.3 Doug Lea's Memory Allocator 100 \\
                 4.4 RtlHeap 113 \\
                 4.5 Mitigation Strategies 129 \\
                 4.6 Notable Vulnerabilities 138 \\
                 4.7 Summary 140 \\
                 4.8 For Further Reading 141 \\
                 5 Integer Security 143 \\
                 5.1 Integers 144 \\
                 5.2 Integer Conversions 151 \\
                 5.3 Integer Error Conditions 156 \\
                 5.4 Integer Operations 159 \\
                 5.5 Vulnerabilities 172 \\
                 5.6 Non-Exceptional Integer Logic Errors 177 \\
                 5.7 Mitigation Strategies 178 \\
                 5.8 Notable Vulnerabilities 187 \\
                 5.9 Summary 190 \\
                 5.10 For Further Reading 191 \\
                 6 Formatted Output 193 \\
                 6.1 Variadic Functions 194 \\
                 6.2 Formatted Output Functions 198 \\
                 6.3 Exploiting Formatted Output Functions 203 \\
                 6.4 Stack Randomization 214 \\
                 6.5 Mitigation Strategies 220 \\
                 6.6 Notable Vulnerabilities 230 \\
                 6.7 Summary 231 \\
                 6.8 For Further Reading 233 \\
                 7 File I/O 235 \\
                 7.1 Concurrency 235 \\
                 7.2 Time of Check, Time of Use 238 \\
                 7.3 Files as Locks and File Locking 240 \\
                 7.4 File System Exploits 242 \\
                 7.5 Mitigation Strategies 249 \\
                 7.6 Summary 259 \\
                 8 Recommended Practices 261 \\
                 8.1 Secure Software Development Principles 263 \\
                 8.2 Systems Quality Requirements Engineering 267 \\
                 8.3 Threat Modeling 269 \\
                 8.4 Use/Misuse Cases 270 \\
                 8.5 Architecture and Design 271 \\
                 8.6 Off-the-Shelf Software 273 \\
                 8.7 Compiler Checks 275 \\
                 8.8 Input Validation 275 \\
                 8.9 Data Sanitization 277 \\
                 8.10 Static Analysis 280 \\
                 8.11 Quality Assurance 283 \\
                 8.12 Memory Permissions 286 \\
                 8.13 Defense in Depth 288 \\
                 8.14 TSP-Secure 289 \\
                 8.15 Summary 292 \\
                 8.16 Further Reading 292",
}

@Book{Seacord:2020:EC,
  author =       "Robert Seacord",
  title =        "Effective {C}",
  publisher =    pub-NO-STARCH,
  address =      pub-NO-STARCH:adr,
  pages =        "xxviii + 240",
  year =         "2020",
  ISBN =         "1-71850-104-8 (paperback), 1-0981-2567-3 (e-book)",
  ISBN-13 =      "978-1-71850-104-1 (paperback), 978-1-0981-2567-7
                 (e-book)",
  LCCN =         "QA76.73.C15 .S433 2020",
  bibdate =      "Tue Feb 27 10:34:57 MST 2024",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "https://nostarch.com/download/samples/EffectiveC_ToC_sample.pdf;
                 https://nostarch.com/Effective_C",
  abstract =     "The world runs on code written in the C programming
                 language, yet most schools begin the curriculum with
                 Python or Java. Effective C bridges this gap and brings
                 C into the modern era-covering the modern C17 Standard
                 as well as potential C2x features. With the aid of this
                 instant classic, you'll soon be writing professional,
                 portable, and secure C programs to power robust systems
                 and solve real-world problems. Robert C. Seacord
                 introduces C and the C Standard Library while
                 addressing best practices, common errors, and open
                 debates in the C community. Developed together with
                 other C Standards committee experts, Effective C will
                 teach you how to debug, test, and analyze C programs.
                 You'll benefit from Seacord's concise explanations of C
                 language constructs and behaviors, and from his 40
                 years of coding experience. You'll learn: * how to
                 identify and handle undefined behavior in a C program *
                 the range and representations of integers and
                 floating-point values; * how dynamic memory allocation
                 works and how to use nonstandard functions; * how to
                 use character encodings and types; * how to perform I/O
                 with terminals and filesystems using C Standard streams
                 and POSIX file descriptors; * how to understand the C
                 compiler's translation phases and the role of the
                 preprocessor; * how to test, debug, and analyze C
                 programs. Effective C will teach you how to write
                 professional, secure, and portable C code that will
                 stand the test of time and help strengthen the
                 foundation of the computing world.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  tableofcontents = "Introduction \\
                 1: Getting Started \\
                 2: Objects, Functions, and Types \\
                 3: Arithmetic Types \\
                 4: Expressions and Operators \\
                 5: Control Flow \\
                 6: Dynamically Allocated Memory \\
                 7: Characters and Strings \\
                 8: Input/Output \\
                 9: Preprocessor \\
                 10: Program Structure \\
                 11: Debugging, Testing, and Analysis \\
                 Index",
}

@Book{Searfoss:1994:JKC,
  author =       "Glenn Searfoss",
  title =        "{JIS-Kanji} Character Recognition: Featuring the
                 {Gaiji} method",
  publisher =    pub-VAN-NOSTRAND-REINHOLD,
  address =      pub-VAN-NOSTRAND-REINHOLD:adr,
  pages =        "xxii + 419",
  year =         "1994",
  ISBN =         "0-442-01813-4",
  ISBN-13 =      "978-0-442-01813-9",
  LCCN =         "TA1640 .S43 1994",
  MRclass =      "*68U15, 68-01, 68T10",
  bibdate =      "Wed Aug 10 10:57:45 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$49.95",
  ZMnumber =     "0821.68126",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "Introduction \\
                 About This Book \\
                 Applications \\
                 Book Organization \\
                 Trademarks and Copyrights \\
                 Understanding Kanji: A Background in Form, Function,
                 and Utility / 1 \\
                 JIS-Kanji Standards and Specifications / 15 \\
                 JIS-Kanji Character Encoding Methods / 25 \\
                 JIS-Kanji Character Identification Methods / 39 \\
                 The Gaiji Method / 55 \\
                 The Gaiji Method Character Recognition Charts / 69 \\
                 International Trade, Investment Education, and
                 Professional Organizations / 219 \\
                 JIS-Kanji Product Listings / 239 \\
                 Included Software / 259 \\
                 Glossary of Terms / 359 \\
                 Appendix A: Tables and Charts / 371 \\
                 Appendix B: JIS x 0208-1990 Standard Character Chart
                 with 8-Bit Hexadecimal and Ward-Point Code Ranges / 383
                 \\
                 Bibliography / 405 \\
                 Index / 415",
}

@Book{Sedgewick:1983:A,
  author =       "Robert Sedgewick",
  title =        "Algorithms",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "viii + 551",
  year =         "1983",
  ISBN =         "0-201-06672-6",
  ISBN-13 =      "978-0-201-06672-2",
  LCCN =         "QA76.6 .S435 1983",
  bibdate =      "Wed Dec 15 18:23:21 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Introduction \\
                 1. Preview \\
                 Mathematical Algorithms \\
                 2. Arithmetic \\
                 3. Random numbers \\
                 4. Polynomials \\
                 5. Gaussian Elimination \\
                 6. Curve fitting \\
                 7. Integration \\
                 Sorting \\
                 8. Elementary sorting methods \\
                 9. Quicksort \\
                 10. Radix sorting \\
                 11. Priority Queues \\
                 12. Selection and merging \\
                 13. External sorting \\
                 Searching \\
                 14. Elementary searching methods \\
                 15. Balanced trees \\
                 16. Hashing \\
                 17. Radix searching \\
                 18. External searching \\
                 String Processing \\
                 19. String searching \\
                 20. Pattern matching \\
                 21. Parsing \\
                 22. File compression \\
                 23. Cryptology \\
                 Geometric Algorithms \\
                 24. Elementary geometric methods \\
                 25. Finding the convex hull \\
                 26. Range searching \\
                 27. Geometric intersection \\
                 28. Closest point problems \\
                 Graph Algorithms \\
                 29. Elementary graph algorithms \\
                 30. Connectivity \\
                 31. Weighted graphs \\
                 32. Directed graphs \\
                 33. Network flow \\
                 34. Matching \\
                 Advanced Topics \\
                 35. Algorithm machines \\
                 36. The Fast Fourier Transform \\
                 37. Dynamic programming \\
                 38. Linear programming \\
                 39. Exhaustive search \\
                 40. NP-complete problems",
}

@Book{Sedgewick:1988:A,
  author =       "Robert Sedgewick",
  title =        "Algorithms",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Second",
  pages =        "xii + 657",
  year =         "1988",
  ISBN =         "0-201-06673-4",
  ISBN-13 =      "978-0-201-06673-9",
  LCCN =         "QA76.6 .S435 1988",
  MRclass =      "68-01, 68N01, 68P05, 68P10, 68Q25, 68W10, 68W99",
  bibdate =      "Wed Dec 15 10:41:37 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg-2ed.bib;
                 https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
                 https://www.math.utah.edu/pub/tex/bib/hash.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook2.bib",
  price =        "US\$34.95",
  ZMnumber =     "0717.68005",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  remark =       prep-tex,
}

@Book{Sedgewick:1990:AC,
  author =       "Robert Sedgewick",
  title =        "Algorithms in {C}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xii + 657",
  year =         "1990",
  ISBN =         "0-201-51425-7",
  ISBN-13 =      "978-0-201-51425-4",
  LCCN =         "QA76.73.C15 S43 1990",
  bibdate =      "Wed Dec 15 10:41:38 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Fundamentals \\
                 1. Introduction \\
                 2. C \\
                 3. Elementary data structures \\
                 4. Trees \\
                 5. Recursion \\
                 6. Analysis of algorithms \\
                 7. Implementation of algorithms \\
                 Sorting algorithms \\
                 8. Elementary sorting methods \\
                 9. Quicksort \\
                 10. Radix sorting \\
                 11. Priority queues \\
                 12. Mergesort \\
                 13. External sorting \\
                 Searching algorithms \\
                 14. Elementary searching methods \\
                 15. Balanced trees \\
                 16. Hashing \\
                 17. Radix searching \\
                 18. External searching \\
                 String processing \\
                 19. String searching \\
                 20. Pattern matching \\
                 21. Parsing \\
                 22. File compression \\
                 23. Cryptology \\
                 Geometry algorithms \\
                 24. Elementary geometric methods \\
                 25. Finding the convex hull \\
                 26. Range searching \\
                 27. Geometric intersection \\
                 28. Closet-point problems \\
                 Graph algorithms \\
                 29. Elementary graph algorithms \\
                 30. Connectivity \\
                 31. Weighted graphs \\
                 32. Directed graphs \\
                 33. Network flow \\
                 34. Matching \\
                 Mathematical algorithms \\
                 35. Random numbers \\
                 36. Arithmetic \\
                 37. Gaussian elimination \\
                 38. Curve fitting \\
                 39. Integration \\
                 Advanced topics \\
                 40. Parallel algorithms \\
                 41. The Fast Fourier Transform \\
                 42. Dynamic programming \\
                 43. Linear programming \\
                 44. Exhaustive search \\
                 45. NP-complete problems \\
                 Index",
}

@Book{Sedgewick:1992:AC,
  author =       "Robert Sedgewick",
  title =        "Algorithms in {C++}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xiv + 656",
  year =         "1992",
  ISBN =         "0-201-36118-3, 0-201-51059-6",
  ISBN-13 =      "978-0-201-36118-6, 978-0-201-51059-1",
  LCCN =         "QA76.73.C153 S38 1992",
  MRclass =      "68N15, 68-01, 68-04, 68P10, 68W10, 68W15, 68N15",
  bibdate =      "Mon Jan 3 12:10:05 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/hash.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/numana1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
  ZMnumber =     "0826.68025",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "Fundamentals \\
                 1: Introduction \\
                 Algorithms \\
                 Outline of Topics \\
                 2: C++ (and C) \\
                 Example: Euclid's Algorithm \\
                 Types of Data \\
                 Input/Output \\
                 Concluding Remarks \\
                 3: Elementary Data Structures \\
                 Arrays \\
                 Linked Lists \\
                 Storage Allocation \\
                 Pushdown Stacks \\
                 Queues \\
                 Linked List Implementation of Stacks \\
                 Abstract and Concrete Data Types \\
                 4: Trees \\
                 Glossary \\
                 Properties \\
                 Representing Binary Trees \\
                 Representing Forests \\
                 Traversing Trees \\
                 5: Recursion \\
                 Recurrences \\
                 Divide-and-Conquer \\
                 Recursive Tree Traversal \\
                 Removing Recursion \\
                 Perspective \\
                 6: Analysis of Algorithms \\
                 Framework \\
                 Classification of Algorithms \\
                 Computational Complexity \\
                 Average-Case Analysis \\
                 Approximate and Asymptotic Results \\
                 Basic Recurrences \\
                 Perspective \\
                 7: Implementation of Algorithms \\
                 Selecting an Algorithm \\
                 Empirical Analysis \\
                 Program Optimization \\
                 Algorithms and Systems \\
                 Sorting Algorithms \\
                 8: Elementary Sorting Methods \\
                 Rules of the Game \\
                 Selection Sort \\
                 Insertion Sort \\
                 Digression: Bubble Sort \\
                 Performance Characteristics of Elementary Sorts \\
                 Sorting Files with Large Records \\
                 Shellsort \\
                 Distribution Counting \\
                 9: Quicksort \\
                 The Basic Algorithm \\
                 Performance Characteristics of Quicksort \\
                 Removing Recursion \\
                 Small Subfiles \\
                 Median-of-Three Partitioning \\
                 Selection \\
                 10: Radix Sorting \\
                 Bits \\
                 Radix Exchange Sort \\
                 Straight Radix Sort \\
                 Performance Characteristics of Radix Sorts \\
                 A Linear Sort \\
                 11: Priority Queues \\
                 Elementary Implementations \\
                 Heap Data Structure \\
                 Algorithms on Heaps \\
                 Heapsort \\
                 Indirect Heaps \\
                 Advanced Implementations \\
                 12: Mergesort \\
                 Merging \\
                 Mergesort \\
                 List Mergesort \\
                 Bottom-Up Mergesort \\
                 Performance Characteristics \\
                 Optimized Implementations \\
                 Recursion Revisited \\
                 13: External Sorting \\
                 Sort-Merge \\
                 Balanced Multiway Merging \\
                 Replacement Selection \\
                 Practical Considerations \\
                 Polyphase Merging \\
                 An Easier Way \\
                 Searching Algorithms \\
                 14: Elementary Searching Methods \\
                 Sequential Searching \\
                 Binary Search \\
                 Binary Tree Search \\
                 Deletion \\
                 Indirect Binary Search Trees \\
                 15: Balanced Trees \\
                 Top-Down 2-3-4 Trees \\
                 Red-Black Trees \\
                 Other Algorithms \\
                 16: Hashing \\
                 Hash Functions \\
                 Separate Chaining \\
                 Linear Probing \\
                 Double Hashing \\
                 Perspective \\
                 17: Radix Searching \\
                 Digital Search Trees \\
                 Radix Search Tries \\
                 Multiway Radix Searching \\
                 Patricia \\
                 18: External Searching \\
                 Indexed Sequential Access \\
                 B-Trees \\
                 Extendible Hashing \\
                 Virtual Memory \\
                 String Processing \\
                 19: String Searching \\
                 A Short History \\
                 Brute-Force Algorithm \\
                 Knuth--Morris--Pratt Algorithm \\
                 Boyer--Moore Algorithm \\
                 Rabin--Karp Algorithm \\
                 Multiple Searches \\
                 20: Pattern Matching \\
                 Describing Patterns \\
                 Pattern Matching Machines \\
                 Representing the Machine \\
                 Simulating the Machine \\
                 21: Parsing \\
                 Context-Free Grammars \\
                 Top-Down Parsing \\
                 Bottom-Up Parsing \\
                 Compilers \\
                 Compiler-Compilers \\
                 22: File Compression \\
                 Run-Length Encoding \\
                 Variable-Length Encoding \\
                 Building the Huffman Code \\
                 Implementation \\
                 23: Cryptology \\
                 Rules of the Game \\
                 Simple Methods \\
                 Encryption/Decryption Machines \\
                 Public-Key Cryptosystems \\
                 Geometric Algorithms \\
                 24: Elementary Geometric Methods \\
                 Points, Lines, and Polygons \\
                 Line Segment Intersection \\
                 Simple Closed Path \\
                 Inclusion in a Polygon \\
                 Perspective \\
                 25: Finding the Convex Hull \\
                 Rules of the Game \\
                 Package-Wrapping \\
                 The Graham Scan \\
                 Interior Elimination \\
                 Performance Issues \\
                 26: Range Searching \\
                 Elementary Methods \\
                 Grid Method \\
                 Two-Dimensional Trees \\
                 Multidimensional Range Searching \\
                 27: Geometric Intersection \\
                 Horizontal and Vertical Lines \\
                 Implementation \\
                 General Line Intersection \\
                 28: Closest-Point Problems \\
                 Closest-Pair Problem \\
                 Voronoi Diagrams \\
                 Graph Algorithms \\
                 29: Elementary Graph Algorithms \\
                 Glossary \\
                 Representation \\
                 Depth-First Search \\
                 Nonrecursive Depth-First Search \\
                 Breadth-First Search \\
                 Mazes \\
                 Perspective \\
                 30: Connectivity \\
                 Connected Components \\
                 Biconnectivity \\
                 Union-Find Algorithms \\
                 31: Weighted Graphs \\
                 Minimum Spanning Tree \\
                 Priority-First Search \\
                 Kruskal's Method \\
                 Shortest Path \\
                 Minimum Spanning Tree and Shortest Paths in Dense
                 Graphs \\
                 Geometric Problems \\
                 32: Directed Graphs \\
                 Depth-First Search \\
                 Transitive Closure \\
                 All Shortest Paths \\
                 Topological Sorting \\
                 Strongly Connected Components \\
                 33: Network Flow \\
                 The Network Flow Problem \\
                 Ford--Fulkerson Method \\
                 Network Searching \\
                 34: Matching \\
                 Bipartite Graphs \\
                 Stable Marriage Problem \\
                 Advanced Algorithms \\
                 Mathematical Algorithms \\
                 35: Random Numbers \\
                 Applications \\
                 Linear Congruential Method \\
                 Additive Congruential Method \\
                 Testing Randomness \\
                 Implementation Notes \\
                 36: Arithmetic \\
                 Polynomial Arithmetic \\
                 Polynomial Evaluation and Interpolation \\
                 Polynomial Multiplication \\
                 Arithmetic Operations with Large Integers \\
                 Matrix Arithmetic \\
                 37: Gaussian Elimination \\
                 A Simple Example \\
                 Outline of the Method \\
                 Variations and Extensions \\
                 38: Curve Fitting \\
                 Polynomial Interpolation \\
                 Spline Interpolation \\
                 Method of Least Squares \\
                 39: Integration \\
                 Symbolic Integration \\
                 Simple Quadrature Methods \\
                 Compound Methods \\
                 Adaptive Quadrature \\
                 Advanced Topics \\
                 40: Parallel Algorithms \\
                 General Approaches \\
                 Perfect Shuffles \\
                 Systolic Arrays \\
                 Perspective \\
                 41: The Fast Fourier Transform \\
                 Evaluate, Multiply, Interpolate \\
                 Complex Roots of Unity \\
                 Evaluation at the Roots of Unity \\
                 Interpolation at the Roots of Unity \\
                 Implementation \\
                 42: Dynamic Programming \\
                 Knapsack Problem \\
                 Matrix Chain Product \\
                 Optimal Binary Search Trees \\
                 Time and Space Requirements \\
                 43: Linear Programming \\
                 Linear Programs \\
                 Geometric Interpretation \\
                 The Simplex Method \\
                 Implementation \\
                 44: Exhaustive Search \\
                 Exhaustive Search in Graphs \\
                 Backtracking \\
                 Digression: Permutation Generation \\
                 Approximation Algorithms \\
                 45: NP-Complete Problems \\
                 Deterministic and Nondeterministic Polynomial-Time
                 Algorithms \\
                 NP-Completeness \\
                 Cook's Theorem \\
                 Some NP-Complete Problems",
}

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

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

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

@Book{Sedgewick:2011:A,
  author =       "Robert Sedgewick and Kevin Daniel Wayne",
  title =        "Algorithms",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Fourth",
  pages =        "xii + 955",
  year =         "2011",
  ISBN =         "0-13-276257-9, 0-321-57351-X (hardcover),
                 6-6130-0155-4 (e-book)",
  ISBN-13 =      "978-0-13-276257-1, 978-0-321-57351-3 (hardcover),
                 978-6-6130-0155-9 (e-book)",
  LCCN =         "QA76.9.A43 S429 2011",
  bibdate =      "Sat Nov 30 16:59:04 MST 2013",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "https://www.pearson.com/en-us/subject-catalog/p/algorithms/P200000000597/9780137459575",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "1: Fundamentals \\
                 2: Sorting \\
                 3: Searching \\
                 4: Graphs \\
                 5: Strings \\
                 Context",
  subject =      "Computer algorithms; Textbooks",
  tableofcontents = "Preface / ix \\
                 1: Fundamentals / 3 \\
                 1.1 Programming Model / 8 \\
                 1.2 Data Abstraction / 64 \\
                 1.3 Queues, Stacks, and Bags / 120 \\
                 1.4 Analysis of Algorithms / 172 \\
                 1.5 Case Study: Union-Find / 216 \\
                 \\
                 2: Sorting / 243 \\
                 2.1 Elementary Sorts / 244 \\
                 2.2 Mergesort / 270 \\
                 2.3 Quicksort / 288 \\
                 2.4 Priority Queues / 308 \\
                 2.5 Applications / 336 \\
                 \\
                 3: Searching / 361 \\
                 3.1 Symbol Tables / 362 \\
                 3.2 Binary Search Trees / 385 \\
                 3.3 Balanced Search Trees / 424 \\
                 3.4 Hash Tables / 458 \\
                 3.5 Applications / 486 \\
                 \\
                 4: Graphs / 515 \\
                 4.1 Undirected graphs / 518 \\
                 4.2 Directed graphs / 566 \\
                 4.3 Minimum Spanning Trees / 604 \\
                 4.4 Shortest Paths / 638 \\
                 \\
                 5: Strings / 695 \\
                 5.1 String Sorts / 702 \\
                 5.2 Tries / 730 \\
                 5.3 Substring Search / 758 \\
                 5.4 Regular Expressions / 788 \\
                 5.5 Data Compression / 810 \\
                 \\
                 Context / 853 \\
                 Event-Driven Simulation / 856 \\
                 B-Trees / 866 \\
                 Suffix Arrays / 875 \\
                 Network Flow / 886 \\
                 Reductions / 903 \\
                 Intractability / 910 \\
                 Index / 933 \\
                 Algorithms and Clients / 954",
}

@Book{Sedgewick:2016:A,
  author =       "Robert Sedgewick and Kevin Daniel Wayne",
  title =        "Algorithms",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Fourth deluxe",
  pages =        "xiii + 955",
  year =         "2016",
  ISBN =         "0-13-438468-7 (paperback)",
  ISBN-13 =      "978-0-13-438468-9 (paperback),",
  LCCN =         "QA76.9.A43 S429 2016",
  bibdate =      "Sat Feb 15 15:02:41 MST 2025",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  remark =       "This is the deluxe version of the fourth edition
                 \cite{Sedgewick:2011:A}, with access to a 24-part video
                 lecture series. ISBNs of German edition (2014):
                 3-86894-184-3, 978-3-86894-184-5.",
  shorttableofcontents = "Fundamentals \\
                 Sorting \\
                 Searching \\
                 Graphs \\
                 Strings \\
                 Context",
}

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

@Book{Shoemaker:1962:EPC,
  author =       "David P. Shoemaker and Carl W. Garland",
  title =        "Experiments in Physical Chemistry",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "ix + 471",
  year =         "1962",
  LCCN =         "QD457 .S56",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Shore:1968:PAS,
  author =       "Bruce W. Shore and Donald H. Menzel",
  title =        "Principles of Atomic Spectra",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xiv + 538",
  year =         "1968",
  LCCN =         "QC454 .S47",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

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

@Book{Shriner:1964:SIO,
  author =       "Ralph L. Shriner and Reynold C. Fuson and David Y.
                 Curtin",
  title =        "The Systematic Identification of Organic Compounds:
                 {A} Laboratory Manual",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  edition =      "Fifth",
  pages =        "ix + 458",
  year =         "1964",
  LCCN =         "QD261 .S5 1964",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

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

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

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

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

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

@Article{SIGGRAPH:core77,
  author =       "{ACM\slash SIGGRAPH}",
  title =        "Status Report of the {Graphic Standards Planning}
                 {Committee} of {ACM\slash SIGGRAPH}",
  journal =      j-SIGGRAPH,
  volume =       "11",
  number =       "3",
  year =         "1977",
  bibdate =      "Sat Oct 28 08:26:45 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Article{SIGGRAPH:core79,
  author =       "{ACM\slash SIGGRAPH}",
  title =        "Status Report of the {Graphic Standards Planning}
                 {Committee} of {ACM\slash SIGGRAPH}",
  journal =      j-SIGGRAPH,
  volume =       "13",
  number =       "3",
  month =        aug,
  year =         "1979",
  bibdate =      "Sat Oct 28 08:26:48 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

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

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

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

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

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

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

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

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

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

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

@Book{Sites:1992:AAR,
  author =       "Richard L. Sites",
  title =        "{Alpha} Architecture Reference Manual",
  publisher =    pub-DP # " and " # pub-PH,
  year =         "1992",
  ISBN =         "1-55558-098-X (DP), 0-13-033663-7 (PH)",
  ISBN-13 =      "978-1-55558-098-8 (DP), 978-0-13-033663-7 (PH)",
  LCCN =         "QA76.9.A73 A46 1992",
  bibdate =      "Fri May 13 17:23:12 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$35.00",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

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

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

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

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

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

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

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

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

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

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

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

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

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

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

@Book{Smith:1990:LPV,
  author =       "Ross Smith",
  title =        "Learning {PostScript}: {A} Visual Approach",
  publisher =    pub-PEACHPIT,
  address =      pub-PEACHPIT:adr,
  year =         "1990",
  ISBN =         "0-938151-12-6",
  ISBN-13 =      "978-0-938151-12-8",
  LCCN =         "QA76.73.P67 S55 1990",
  bibdate =      "Sat Aug 27 10:55:20 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

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

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

@Book{Smith:1998:SXC,
  author =       "Michael Smith",
  title =        "{Station X}: The Codebreakers of {Bletchley Park}",
  publisher =    "Channel 4 Books",
  address =      "London, UK",
  pages =        "184",
  year =         "1998",
  ISBN =         "0-7522-7148-2",
  ISBN-13 =      "978-0-7522-7148-4",
  LCCN =         "D810.C88 S66 2000",
  bibdate =      "Thu Sep 21 06:40:24 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "UK\pounds 5.99",
  acknowledgement = ack-nhfb,
}

@Book{Smith:2005:VMV,
  author =       "James E. (James Edward) Smith and Ravi Nair",
  title =        "Virtual Machines: Versatile Platforms for Systems and
                 Processes",
  publisher =    pub-MORGAN-KAUFMANN,
  address =      pub-MORGAN-KAUFMANN:adrsf,
  pages =        "xxii + 638",
  year =         "2005",
  ISBN =         "1-55860-910-5 (hardcover), 0-08-052540-7 (e-book),
                 1-4933-0376-7",
  ISBN-13 =      "978-1-55860-910-5 (hardcover), 978-0-08-052540-2
                 (e-book), 978-1-4933-0376-2",
  LCCN =         "QA76.9.V5 S54 2005",
  bibdate =      "Thu Jul 21 08:04:00 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://books.elsevier.com/us/bookscat/search/details.asp?country=United+States&community=mk&imprint=Morgan+Kaufmann&isbn=1558609105",
  abstract =     "Virtual Machine technology applies the concept of
                 virtualization to an entire machine, circumventing real
                 machine compatibility constraints and hardware resource
                 constraints to enable a higher degree of software
                 portability and flexibility. Virtual machines are
                 rapidly becoming an essential element in computer
                 system design. They provide system security,
                 flexibility, cross-platform compatibility, reliability,
                 and resource efficiency. Designed to solve problems in
                 combining and using major computer system components,
                 virtual machine technologies play a key role in many
                 disciplines, including operating systems, programming
                 languages, and computer architecture. For example, at
                 the process level, virtualizing technologies support
                 dynamic program translation and platform-independent
                 network computing. At the system level, they support
                 multiple operating system environments on the same
                 hardware platform and in servers. Historically,
                 individual virtual machine techniques have been
                 developed within the specific disciplines that employ
                 them (in some cases they aren't even referred to as
                 virtual machines), making it difficult to see their
                 common underlying relationships in a cohesive way. In
                 this text, Smith and Nair take a new approach by
                 examining virtual machines as a unified discipline.
                 Pulling together cross-cutting technologies allows
                 virtual machine implementations to be studied and
                 engineered in a well-structured manner. Topics include
                 instruction set emulation, dynamic program translation
                 and optimization, high level virtual machines
                 (including Java and CLI), and system virtual machines
                 for both single-user systems and servers. Examines
                 virtual machine technologies across the disciplines
                 that use them. Operating systems, programming languages
                 and computer architecture. Defining a new and unified
                 discipline. Reviewed by principle researchers at
                 Microsoft, HP, and by other industry research groups.
                 Written by two authors who combine several decades of
                 expertise in computer system research and development,
                 both in academia and industry.",
  acknowledgement = ack-nhfb,
  subject =      "Virtual computer systems; Computer architecture;
                 System design",
  tableofcontents = "Introduction to virtual machines \\
                 Emulation: interpretation and binary translation \\
                 Process virtual machines \\
                 Dynamic binary optimization \\
                 High-level language virtual machine architecture \\
                 High-level language virtual machine implementation \\
                 Codesigned virtual machines \\
                 System virtual machines \\
                 Multiprocessor virtualization \\
                 Emerging applications",
}

@Book{Smith:2014:SDF,
  author =       "Gary Smith",
  title =        "Standard deviations: flawed assumptions tortured data
                 and other ways to lie with statistics",
  publisher =    "Duckworth Overlook",
  address =      "London, UK",
  year =         "2014",
  ISBN =         "1-4683-1102-6, 0-7156-4974-4 (e-book)",
  ISBN-13 =      "978-1-4683-1102-0, 978-0-7156-4974-9 (e-book)",
  LCCN =         "QA279 .S638 2014",
  bibdate =      "Fri Sep 2 07:22:41 MDT 2016",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://public.eblib.com/choice/publicfullrecord.aspx?p=2029045",
  abstract =     "Did you know that having a messy room will make you
                 racist? Or that human beings possess the ability to
                 postpone death until after important ceremonial
                 occasions? Or that people live three to five years
                 longer if they have positive initials, like ACE? All of
                 these `facts' have been argued with a straight face by
                 researchers and backed up with reams of data and
                 convincing statistics. As Nobel Prize-winning economist
                 Ronald Coase once cynically observed, `If you torture
                 data long enough, it will confess.' Lying with
                 statistics is a time-honoured con.",
  acknowledgement = ack-nhfb,
  author-dates = "1945--",
  subject =      "Statistics; Standard deviations; MATHEMATICS /
                 Applied; MATHEMATICS / Probability and Statistics /
                 General; Standard deviations; Statistics; Donn{\'e}es
                 statistiques; M{\'e}thodes statistiques.",
  tableofcontents = "Introduction \\
                 1. Patterns, Patterns, Patterns \\
                 2. Garbage In, Gospel Out \\
                 3. Apples and Prunes \\
                 4. Oops! \\
                 5. Graphical Gaffes \\
                 6. Common Nonsense \\
                 7. Confound It! \\
                 8. When You're Hot, You're Not \\
                 9. Regression \\
                 10. Even Steven \\
                 11. The Texas Sharpshooter \\
                 12. The Ultimate Procrastination \\
                 13. Serious Omissions \\
                 14. Flimsy Theories and Rotten Data \\
                 15. Don't Confuse Me With Facts \\
                 16. Data Without Theory \\
                 17. Betting the Bank \\
                 18. Theory Without Data \\
                 19. When to Be Persuaded and When to Be Skeptical",
}

@Book{Smith:2019:WCS,
  author =       "Michael Smith",
  booktitle =    "{WWII} Codebreakers and Spies",
  title =        "{WWII} Codebreakers and Spies",
  publisher =    "Andre Deutsch",
  address =      "London, UK",
  pages =        "160",
  year =         "2019",
  ISBN =         "0-233-00602-8 (hardcover)",
  ISBN-13 =      "978-0-233-00602-4 (hardcover)",
  LCCN =         "D810.S7",
  bibdate =      "Tue Dec 2 10:36:16 MST 2025",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/g/good-i-j.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Codebreakers and Spies tells the astonishing story of
                 how Britain's intelligence operatives, experts and
                 special operations teams contributed to the Allies'
                 victory in the Second World War. The work of the
                 Bletchley Park codebreakers in breaking the German
                 Enigma cipher is estimated to have cut the length of
                 the war by around two years, saving countless lives,
                 while the Double Cross system, in which German secret
                 agents were ``turned'' by the British to feed their
                 Nazi agent-runners with false information, ensured the
                 success of the D-Day landings. Codebreakers and Spies
                 not only reveals new details about these remarkable
                 operations but also tells the compelling story of how
                 MI6 turned the disaster of lost networks across Europe
                 into triumph. The stories range from extraordinarily
                 courageous to bizarre, with desperation driving the
                 intelligence services to recruit astrologers and even a
                 stage magician to help retrieve intelligence and allied
                 aircrew from of Nazi-occupied Europe. Intelligence
                 historian Michael Smith thrillingly recounts the daring
                 and often moving lives of the heroes and heroines who
                 risked their lives for victory.",
  acknowledgement = ack-nhfb,
  remark =       "Previous edition of 2011 was titled
                 \booktitle{Britain's secret war}.",
  subject =      "World War, 1939--1945; Secret service; Great Britain;
                 Military intelligence; Electronic intelligence;
                 Cryptography; Intelligence service; History; Espionage,
                 British; 20th century; Guerre mondiale, 1939--1945;
                 Service secret; Grande-Bretagne; Renseignement
                 {\'e}lectronique; Cryptographie; Espionnage
                 britannique; Histoire; 20e si{\`e}cle; Cryptography;
                 Electronic intelligence; Espionage, British;
                 Intelligence service; Military intelligence; Secret
                 service; Bletchley Park (Milton Keynes, England);
                 England; Milton Keynes; Bletchley Park; Great Britain",
  tableofcontents = "MI6: what it was and where it started from / 6 \\
                 The codebreakers of Bletchley Park / 14 \\
                 MI5 and the Second World War / 20 \\
                 SOE / 24 \\
                 Naval intelligence / 28 \\
                 Military intelligence / 38 \\
                 Air intelligence / 42 \\
                 The exiles, MI6's intelligence allies / 48 \\
                 SOE operations in Western and Central Europe / 52 \\
                 Intelligence in occupied Europe / 58 \\
                 The Hess ``sting'' / 64 \\
                 Intelligence in North Africa / 72 \\
                 Churchill's obsession with intelligence / 80 \\
                 Intelligence in the Middle East and Balkans / 86 \\
                 SOE in the Middle East and Balkans / 90 \\
                 Working with the Americans / 94 \\
                 Battle of the Atlantic / 98 \\
                 Women in the secret war / 104 \\
                 MI9 escape and evasion / 110 \\
                 The double cross system / 114 \\
                 Intelligence in the Far East / 120 \\
                 SOE in the Far East / 126 \\
                 Special forces in the Second World War / 130 \\
                 Intelligence for D-Day / 134 \\
                 Operation Fortitude South --- The D-Day deception /140
                 \\
                 German intelligence --- how it fared / 148 \\
                 Preparing for ``the next war'' / 154 \\
                 Index / 158 \\
                 Picture credits / 160",
}

@Book{Smolin:2007:TPR,
  author =       "Lee Smolin",
  title =        "The Trouble with Physics: the Rise of String Theory,
                 the Fall of a Science, and What Comes Next",
  publisher =    "Mariner Books",
  address =      "Boston, MA, USA",
  pages =        "xxiii + 392",
  year =         "2007",
  ISBN =         "0-618-91868-X (paperback)",
  ISBN-13 =      "978-0-618-91868-3 (paperback)",
  LCCN =         "QC6 .S6535 2007",
  bibdate =      "Tue Sep 1 16:19:39 MDT 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 melvyl.cdlib.org:210/CDL90",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0634/2006007235-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0737/2006007235-b.html;
                 http://www.loc.gov/catdir/toc/ecip069/2006007235.html",
  acknowledgement = ack-nhfb,
  remark =       "Originally published: Boston: Houghton Mifflin, 2006",
  subject =      "Physics; Methodology; History; 20th century; String
                 models",
  tableofcontents = "The five great problems in theoretical physics \\
                 The beauty myth \\
                 The world as geometry \\
                 Unification becomes a science \\
                 From unification to superunification \\
                 Quantum gravity: the fork in the road \\
                 Preparing for a revolution \\
                 The first superstring revolution \\
                 Revolution number two \\
                 A theory of anything \\
                 The anthropic solution \\
                 What string theory explains \\
                 Surprises from the real world \\
                 Building on Einstein \\
                 Physics after string theory \\
                 How do you fight sociology? \\
                 What is science? \\
                 Seers and craftspeople \\
                 How science really works \\
                 What we can do for science",
}

@Book{Smolin:2013:TRC,
  author =       "Lee Smolin",
  title =        "Time Reborn: From the Crisis in Physics to the Future
                 of the Universe",
  publisher =    "Mariner Books",
  address =      "Boston, MA, USA",
  pages =        "xxxi + 319",
  year =         "2014",
  ISBN =         "0-544-24559-8",
  ISBN-13 =      "978-0-544-24559-4",
  LCCN =         "QB991.Q36 S66 2014",
  bibdate =      "Sun Jan 18 18:16:42 MST 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",
  abstract =     "From one of our foremost thinkers and public
                 intellectuals, a radical new view of the nature of time
                 and the cosmos. What is time? This deceptively simple
                 question is the single most important problem facing
                 science as we probe more deeply into the fundamentals
                 of the universe. All of the mysteries physicists and
                 cosmologists face --- from the Big Bang to the future
                 of the universe, from the puzzles of quantum physics to
                 the unification of forces and particles --- come down
                 to the nature of time. The fact that time is real may
                 seem obvious. You experience it passing every day when
                 you watch clocks tick, bread toast, and children grow.
                 But most physicists, from Newton to Einstein to today's
                 quantum theorists, have seen things differently. The
                 scientific case for time being an illusion is
                 formidable. That is why the consequences of adopting
                 the view that time is real are revolutionary. Lee
                 Smolin, author of the controversial bestseller
                 \booktitle{The Trouble with Physics}, argues that a
                 limited notion of time is holding physics back. It's
                 time for a major revolution in scientific thought. The
                 reality of time could be the key to the next big
                 breakthrough in theoretical physics. What if the laws
                 of physics themselves were not timeless? What if they
                 could evolve? \booktitle{Time Reborn} offers a radical
                 new approach to cosmology that embraces the reality of
                 time and opens up a whole new universe of
                 possibilities. There are few ideas that, like our
                 notion of time, shape our thinking about literally
                 everything, with huge implications for physics and
                 beyond --- from climate change to the economic crisis.
                 Smolin explains in lively and lucid prose how the true
                 nature of time impacts our world.",
  acknowledgement = ack-nhfb,
  author-dates = "1955--",
  subject =      "Quantum cosmology; Space and time; Quantum field
                 theory; Quantum cosmology; Quantum field theory; Space
                 and time.",
  tableofcontents = "Preface \\
                 Introduction \\
                 Part 1. Weight: the expulsion of time \\
                 1: Falling \\
                 2: The disappearance of time \\
                 3: A game of catch \\
                 4: Doing physics in a box \\
                 5: The expulsion of novelty and surprise \\
                 6: Relativity and timelessness \\
                 7: Quantum cosmology and the end of time \\
                 Part 2. Light: time reborn \\
                 Interlude: Einstein's discontent \\
                 8: The cosmological fallacy \\
                 9: The cosmological challenge \\
                 10: Principles for a new cosmology \\
                 11: The evolution of laws \\
                 12: Quantum mechanics and the liberation of the atom
                 \\
                 13: The battle between relativity and the quantum \\
                 14: Time reborn from relativity \\
                 15: The emergence of space \\
                 16: The life and death of the universe \\
                 17: Time reborn from heat and light \\
                 18: Infinite space or infinite time? \\
                 19: The future of time \\
                 Epilogue: Thinking in time \\
                 Notes \\
                 Bibliography \\
                 Acknowledgments \\
                 Index",
}

@Book{Snow:1992:TB,
  author =       "Wynter Snow",
  title =        "{\TeX{}} for the Beginner",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xii + 377 + 23",
  year =         "1992",
  ISBN =         "0-201-54799-6",
  ISBN-13 =      "978-0-201-54799-3",
  LCCN =         "Z253.4.T47 S64 1992",
  bibdate =      "Wed Dec 15 10:41:46 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Snyder:1982:MPU,
  author =       "John P. Snyder",
  title =        "Map Projections Used by the {U.S. Geological Survey}",
  publisher =    pub-USGPO,
  address =      pub-USGPO:adr,
  edition =      "Second",
  pages =        "xiii + 313",
  year =         "1982",
  LCCN =         "QE75 .B9",
  bibdate =      "Wed Dec 15 18:27:32 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Geological Survey Bulletin 1532",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Sobel:1995:LTS,
  author =       "Dava Sobel",
  title =        "Longitude: the True Story of a Lone Genius Who Solved
                 the Greatest Scientific Problem of His Time",
  publisher =    pub-WALKER,
  address =      pub-WALKER:adr,
  pages =        "viii + 184",
  year =         "1995",
  ISBN =         "0-8027-1312-2",
  ISBN-13 =      "978-0-8027-1312-4",
  LCCN =         "QB225 .S64 1995",
  bibdate =      "Thu Jan 06 10:39:28 2000",
  bibsource =    "http://www.walkerbooks.com/;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "A biography of John Harrison, 1693--1776.",
  price =        "US\$19.00",
  abstract =     "The story of mariners' centuries-long search for ways
                 of determining longitude that tells not only of the
                 scientific advances but of the perseverance, pettiness,
                 politics, and interesting anecdotes involved. Longitude
                 is the dramatic human story of an epic scientific
                 quest, and of John Harrison's forty-year obsession with
                 building his perfect timekeeper, known today as the
                 chronometer. Full of heroism and chicanery, brilliance
                 and the absurd, it is also a fascinating brief history
                 of astronomy, navigation, and clockmaking. Through Dava
                 Sobel's consummate skill, Longitude will open a new
                 window on our world for all who read it.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject-dates = "John Harrison (1693--1776)",
  tableofcontents = "Acknowledgments \\
                 1: Imaginary Lines \\
                 2: The Sea Before Time \\
                 3: Adrift in a Clockwork Universe \\
                 4: Time in a Bottle \\
                 5: Powder of Sympathy \\
                 6: The Prize \\
                 7: Cogmaker's Journal \\
                 8: The Grasshopper Goes to Sea \\
                 9: Hands on Heaven's Clock \\
                 10: The Diamond Timekeeper \\
                 11: Trial by Fire and Water \\
                 12: A Tale of Two Portraits \\
                 13: The Second Voyage of Captain James Cook \\
                 14: The Mass Production of Genius \\
                 15: In the Meridian Courtyard \\
                 Sources \\
                 Index",
}

@Book{Sobel:1998:IL,
  author =       "Dava Sobel and William J. H. Andrewes",
  title =        "The Illustrated Longitude",
  publisher =    pub-WALKER,
  address =      pub-WALKER:adr,
  pages =        "216",
  year =         "1998",
  ISBN =         "0-8027-1344-0",
  ISBN-13 =      "978-0-8027-1344-5",
  LCCN =         "QB 225 S67 1998",
  bibdate =      "Mon Mar 20 17:27:41 2000",
  bibsource =    "http://www.walkerbooks.com/;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$33.00",
  abstract =     "This fully illustrated edition of the international
                 best-seller \booktitle{Longitude} recounts in words and
                 images the epic quest to solve the greatest scientific
                 problem of the eighteenth and three prior centuries:
                 determining how a captain could pinpoint his ship's
                 location at sea. All too often, voyages ended in
                 disaster when crew and cargo were either lost at sea or
                 destroyed upon the rocks of an unexpected landfall.
                 Thousands of lives and the fortunes of nations hung on
                 a resolution. Governments established prizes for anyone
                 whose method or device proved successful. The
                 scientific establishment, certain that a celestial
                 answer would be found, invested untold effort in this
                 pursuit. By contrast, John Harrison built the
                 unimaginable: a clock that told perfect time at sea,
                 known today as the chronometer. Harrison's trials and
                 tribulations during his forty-year quest to win the
                 prize are the culmination of this remarkable story.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "Imaginary lines \\
                 Sea before time \\
                 Adrift in a clockwork universe \\
                 Time in a bottle \\
                 Powder of sympathy \\
                 Prize \\
                 Cogmaker's journal \\
                 Grasshopper goes to sea \\
                 Hands on heaven's clock \\
                 Diamond timekeeper \\
                 Trial by fire and water \\
                 Tale of two portraits \\
                 Second voyage of Captain James Cook \\
                 Mass production of genius \\
                 In the meridian courtyard",
}

@Book{Sobel:2012:MPH,
  author =       "Dava Sobel",
  title =        "A more perfect heaven: how {Copernicus} revolutionized
                 the cosmos",
  publisher =    pub-WALKER,
  address =      pub-WALKER:adr,
  pages =        "xiv + 273",
  year =         "2012",
  ISBN =         "0-8027-7894-1",
  ISBN-13 =      "978-0-8027-7894-9",
  LCCN =         "QB501 .S75 2012",
  bibdate =      "Sat May 18 19:09:05 MDT 2013",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Traces the story of the reclusive sixteenth-century
                 cleric who introduced the revolutionary idea that the
                 Earth orbits the sun, describing the dangerous forces
                 and complicated personalities that marked the
                 publication of Copernicus's findings.",
  acknowledgement = ack-nhfb,
  subject =      "Copernicus, Nicolaus; Influence; De revolutionibus
                 orbium caelestium; Astronomy; Solar system",
  subject-dates = "1473--1543; 1473--1543.",
  tableofcontents = "Part 1. Prelude. Moral, rustic, and amorous
                 epistles \\
                 The brief sketch \\
                 Leases of abandoned farmsteads \\
                 On the method of minting money \\
                 The letter against Werner \\
                 The bread tariff \\
                 Part 2. Interplay. ``And the sun stood still'': act I
                 \\
                 ``And the sun stood still'': act II \\
                 Part 3. Aftermath. The first account \\
                 On the revolutions of the heavenly spheres \\
                 The Basel edition \\
                 Epitome of Copernican astronomy \\
                 Dialogue concerning the two chief systems of the world,
                 Ptolemaic and Copernican \\
                 An annotated census of Copernicus' De revolutionibus
                 \\
                 Thanksgiving",
}

@Book{Sobel:2024:EMC,
  author =       "Dava Sobel",
  title =        "The elements of {Marie Curie}: how the glow of radium
                 lit a path for women in science",
  publisher =    "Atlantic Monthly Press",
  address =      "New York, NY, USA",
  pages =        "xiii + 318 + 8",
  year =         "2024",
  ISBN =         "0-8021-6382-3 (hardcover), 0-8021-6586-9 (paperback),
                 0-8021-6383-1 (e-book)",
  ISBN-13 =      "978-0-8021-6382-0 (hardcover), 978-0-8021-6586-2
                 (paperback), 978-0-8021-6383-7 (e-book)",
  LCCN =         "QD22.C8 S66 2024",
  bibdate =      "Thu Apr 24 08:29:46 MDT 2025",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "``The acclaimed Pulitzer Prize finalist and \#1 New
                 York Times bestselling author of Galileo's Daughter
                 crafts a luminous chronicle of the most famous woman in
                 the history of science, and the untold story of the
                 many remarkable young women trained in her laboratory
                 who were launched into stellar scientific careers of
                 their own. ''Even now, nearly a century after her
                 death, Marie Curie remains the only female scientist
                 most people can name,`` writes Dava Sobel at the
                 opening of her shining portrait of the sole Nobel
                 laureate decorated in two separate fields of
                 science--Physics in 1903 with her husband Pierre and
                 Chemistry by herself in 1911. And yet, Sobel makes
                 clear, as brilliant as she was in the laboratory, Marie
                 Curie was equally memorable outside it. Grieving
                 Pierre's untimely death in 1906, she took his place as
                 professor of physics at the Sorbonne; devotedly raised
                 two brilliant daughters; drove a van she outfitted with
                 X-ray equipment to the front lines of World War I;
                 befriended Albert Einstein and other luminaries of
                 twentieth-century physics; won support from two US
                 presidents; and inspired generations of young women the
                 world over to pursue science as a way of life. As Sobel
                 did so memorably in her portrait of Galileo through the
                 prism of his daughter, she approaches Marie Curie from
                 a unique angle, narrating her remarkable life of
                 discovery and fame alongside the women who became her
                 legacy--from France's Marguerite Perey, who discovered
                 the element francium, and Norway's Ellen Gleditsch, to
                 Mme. Curie's elder daughter, Ir{\'e}ne, winner of the
                 1935 Nobel Prize in Chemistry. For decades the only
                 woman in the room at international scientific
                 gatherings that probed new theories about the interior
                 of the atom, Marie Curie traveled far and wide, despite
                 constant illness, to share the secrets of
                 radioactivity, a term she coined. Her two triumphant
                 tours of the United States won her admirers for her
                 modesty even as she was mobbed at every stop; her
                 daughters, in {\`E}ve's later recollection,
                 ''discovered all at once what the retiring woman with
                 whom they had always lived meant to the world.`` With
                 the consummate skill that made bestsellers of Longitude
                 and Galileo's Daughter, and the appreciation for women
                 in science at the heart of her most recent The Glass
                 Universe, Dava Sobel has crafted a radiant biography
                 and a masterpiece of storytelling, illuminating the
                 life and enduring influence of one of the most
                 consequential figures of our time''",
  acknowledgement = ack-nhfb,
  subject =      "Curie, Marie; Friends and associates; Chemists;
                 France; Biography; Women chemists; Physicists; Women
                 physicists; Mentoring in science; History; 20th
                 century; Femmes chimistes; Biographies; Physiciennes;
                 Mentorat dans les sciences; Histoire; 20e si{\'e}cle;
                 Chemists; Women chemists; Physicists; Women physicists;
                 Mentoring in science; Friends and associates; France",
  subject-dates = "Marie Curie (1867--1934)",
  tableofcontents = "Preface \\
                 Formula for an icon: Marie Curie (1867--1934) \\
                 Part one: School of physics and chemistry, 42 Rue
                 Lhomond, Paris \\
                 Manya (hydrogen) \\
                 Marie (iron) \\
                 Madame Curie (tungsten and molybdenum) \\
                 Pierre (uranium) \\
                 Andr{\'e} (actinium) \\
                 Eug{\'e}nie (radiotellurium) \\
                 Part two: Sorbonne Annex, 12 Rue Cuvier \\
                 Harriet (emanation) \\
                 Ellen (copper and lithium) \\
                 Lucie (helium) \\
                 Sybil (thorium) \\
                 Eva (radium) \\
                 Jadwiga and Ir{\`e}n (gold) \\
                 Hertha (carbon) \\
                 Suzanne (platinum and iridium) \\
                 Maurice (ionium) \\
                 Part three: The radium institute: Curie laboratory, 1
                 Rue Pierre-Curie \\
                 Ir{\`e}ne (lead) \\
                 Marthe (chlorine) \\
                 Madeleine (radioneon) \\
                 L{\'e}onie (oxygen) \\
                 Missy (silver) \\
                 Catherine (mesothorium) \\
                 Fr{\'e}d{\'e}ric (radon) \\
                 Part four: Large-scale production facility, Arcueil \\
                 Alicja (polonium) \\
                 {\'E}liane (polonium bis) \\
                 Angele (bismuth) \\
                 Isabelle and Antonia (thallium) \\
                 Branca (boron) \\
                 Willy (beryllium) \\
                 Marie-Henriette, Marietta, et al. (aluminum) \\
                 {\`E}ve (radiophosphorus) \\
                 Epilogue. Marguerite (francium)",
}

@Book{SoftQuad:1991:SP,
  author =       "{SoftQuad, Inc.}",
  title =        "The {SGML} Primer",
  publisher =    "SoftQuad, Inc.",
  address =      "Toronto, Ontario, Canada",
  pages =        "36",
  year =         "1991",
  LCCN =         "QA76.73.S44 S45 1991",
  bibdate =      "Thu Jun 23 16:25:29 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  xxISBN =       "none",
}

@Book{Sokolnikoff:1966:MPM,
  author =       "I. S. Sokolnikoff and R. M. Redheffer",
  title =        "Mathematics of Physics and Modern Engineering",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  edition =      "Second",
  pages =        "xi + 752",
  year =         "1966",
  ISBN =         "0-07-059625-5, 0-07-085745-8 (student edition)",
  ISBN-13 =      "978-0-07-059625-2, 978-0-07-085745-2 (student
                 edition)",
  LCCN =         "QA401 .S6 1966",
  bibdate =      "Wed Dec 15 10:41:47 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Preface to the second edition / v \\
                 From the preface to the first edition / vii \\
                 To the instructor / ix \\
                 1: Infinite series / 1 \\
                 2: Nonlinear differential equations / 87 \\
                 3: Linear differential equations and Laplace transform
                 / 165 \\
                 4: Algebra and geometry of vectors; matrices / 257 \\
                 5: Functions of several variables / 311 \\
                 6: Field theory / 379 \\
                 7: Partial differential equations / 435 \\
                 8: Complex variable / 527 \\
                 9: Probability / 595 \\
                 10: Numerical analysis / 649 \\
                 Appendix A: Determinants / 702 \\
                 Appendix B: Comparison of the Riemann and Lebesgue
                 integrals / 716 \\
                 Appendix C: Table of normal distribution / 720 \\
                 Answers / 721 \\
                 Table of Laplace transforms / inside back cover \\
                 Index / 743",
}

@Book{Sokolov:1966:QM,
  author =       "A. A. (Arsenii Aleksandrovich) Sokolov and Y. M.
                 (IUrii Mikhailovich) Loskutov and I. M. (Igor'
                 Mikhailovich) Ternov",
  title =        "Quantum Mechanics",
  publisher =    pub-HRW,
  address =      pub-HRW:adr,
  pages =        "xix + 537",
  year =         "1966",
  LCCN =         "QC174.1 .S633",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Translated by {\em Scripta Technica, Inc.} from the
                 original 1962 Russian edition, {\em Kvantovaya
                 Mekhanika}.",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Soni:2017:MPH,
  author =       "Jimmy Soni and Rob Goodman",
  title =        "A mind at play: how {Claude Shannon} invented the
                 information age",
  publisher =    pub-SIMON-SCHUSTER,
  address =      pub-SIMON-SCHUSTER:adr,
  pages =        "xv + 366",
  year =         "2017",
  ISBN =         "1-4767-6668-1 (hardcover), 1-4767-6669-X (paperback),
                 1-4767-6670-3 (e-book)",
  ISBN-13 =      "978-1-4767-6668-3 (hardcover), 978-1-4767-6669-0
                 (paperback), 978-1-4767-6670-6 (e-book)",
  LCCN =         "QA29.S423 S66 2017",
  bibdate =      "Mon Apr 17 13:41:18 MDT 2017",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/s/shannon-claude-elwood.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  subject =      "Shannon, Claude Elwood; Mathematicians; United States;
                 Biography; Electrical engineers; Information theory",
  subject-dates = "Claude Elwood Shannon (1916--2001)",
  tableofcontents = "Introduction / xi \\
                 Part 1 \\
                 1: Gaylord / 3 \\
                 2: Ann Arbor / 13 \\
                 3: The room-sized brain / 21 \\
                 4: MIT / 32 \\
                 5: A decidedly unconventional type of youngster / 45
                 \\
                 6: Cold Spring Harbor / 50 \\
                 7: The labs / 61 \\
                 8: Princeton / 74 \\
                 9: Fire control / 83 \\
                 10: A six-day workweek / 91 \\
                 11: The unspeakable system / 96 \\
                 12: Turing / 103 \\
                 13: Manhattan / 110 \\
                 Part 2 \\
                 14: The utter dark / 119 \\
                 15: From intelligence to information / 125 \\
                 16: The bomb / 138 \\
                 17: Building a bandwagon / 165 \\
                 18: Mathematical intentions, honorable and otherwise /
                 170 \\
                 19: Wiener / 175 \\
                 20: A transformative year / 181 \\
                 21: TMI / 186 \\
                 22: ``We urgently need the assistance of Dr. Claude E.
                 Shannon'' / 193 \\
                 23: The man-machines / 199 \\
                 24: The game of kings / 210 \\
                 25: Constructive dissatisfaction / 217 \\
                 Part 3 \\
                 26: Professor Shannon / 223 \\
                 27: Inside information / 238 \\
                 28: A gadgeteer's paradise / 243 \\
                 29: Peculiar motions / 247 \\
                 30: Kyoto / 257 \\
                 31: The illness / 268 \\
                 32: Aftershocks / 273 \\
                 Acknowledgments / 286 \\
                 Notes / 289 \\
                 Bibliography / 329 \\
                 Illustration Credits / 347 \\
                 Index / 349",
}

@Book{Southwick:1999:HNI,
  author =       "Karen Southwick",
  title =        "High Noon: the Inside Story of {Scott McNealy} and the
                 Rise of {Sun Microsystems}",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xiii + 242",
  year =         "1999",
  ISBN =         "0-471-29713-5 (hardcover)",
  ISBN-13 =      "978-0-471-29713-0 (hardcover)",
  LCCN =         "QA76.2.M37 S68 1999",
  bibdate =      "Tue Jul 25 18:23:19 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$25.90",
  abstract =     "In 1982, a little upstart named Sun was making waves
                 in the high-tech industry with its groundbreaking
                 workstation technology, even as early competitors
                 dismissed the company as not worth losing sleep over.
                 Since then, Sun Microsystems has become a formidable
                 presence in the industry, making its own rules and
                 taking no prisoners, and is currently poised to reach
                 the highest point of its ascendancy --- the challenge
                 of Microsoft's dominance over the future of computing.
                 The driving force behind this once fledgling company is
                 a man who has been described as brash, unconventional,
                 ambitious, forward-looking, and sometimes even his own
                 worst enemy. Scott McNealy turned Sun into the
                 multibillion-dollar success it is today --- a developer
                 of innovative software like Java that is
                 revolutionizing the computing landscape.
                 \booktitle{High Noon} is the inside story of Sun's rise
                 to power, from its shaky start in Silicon Valley
                 through its transformation under the aggressive and
                 inspirational leadership of McNealy. Karen Southwick
                 reveals the behind-the-scenes maneuverings of McNealy
                 and Sun, with candid interviews from the key players
                 and insights into the inner workings of the high-tech
                 industry. This book examines how scrappy underdog Sun
                 overcame its larger and supposedly tougher competitors,
                 combining hard work, tenacity, and talented people to
                 build a more innovative and flexible company. You'll
                 learn how McNealy moved Sun up the industry food chain,
                 challenging more established companies like
                 Hewlett-Packard and Digital Equipment by expanding
                 Sun's product line and refocusing the business.
                 \booktitle{High Noon} expertly chronicles McNealy's
                 triumphant history with Sun, from his early days as
                 vice president of manufacturing to a CEO known for
                 shooting straight from the hip without regard for the
                 consequences. You'll discover how ``Javaman'' --- As
                 Fortune magazine dubbed McNealy --- prompted Sun to.
                 Take risks that ultimately allowed it to survive,
                 thrive, and dominate --- making Microsoft stand up and
                 take notice. And you'll see how Sun's looming showdown
                 with this industry giant promises wide-reaching
                 implications for businesses and consumers alike. Among
                 \booktitle{High Noon}'s revelations: A new perspective
                 on how the complex, contradictory McNealy shaped his
                 company and fashioned its strategy Insight into central
                 issues facing the high-tech industry, such as network
                 computers and the future of the Internet An insider
                 view of the maneuverings of industry powerhouses,
                 including Microsoft, Oracle, Netscape, IBM, and Intel
                 Both entertaining and instructive, \booktitle{High
                 Noon} offers valuable lessons for taking charge of your
                 destiny and succeeding in a fast-paced, unpredictable,
                 and even hostile environment. Advance Praise for Karen
                 Southwick's \booktitle{High Noon} ``\booktitle{High
                 Noon} captures the electricity and drama of one of the
                 most important high-tech sagas of our time. Rich with
                 insight as well as previously undisclosed stories.''
                 Jim Moore, Founder, GeoPartners Research, Inc. Author
                 of The Death of Competition ``\booktitle{High Noon}
                 reveals the inside story of one of the companies
                 Microsoft fears most, Sun Microsystems. Southwick uses
                 her keen insight to tell the story of how four
                 twenty-somethings created a company that has grown from
                 a small seller of scientific computers to one of the
                 most dominant high-tech firms in the world.'' --- Eric
                 Nee, Editor, Fortune ``Scott McNealy is one of the most
                 complex, fascinating individuals in high tech. Karen
                 Southwick captures the contrarian spirit of Sun
                 Microsystems and the intriguing personalities that run
                 it.'' --- Howard Anderson, President, The Yankee Group
                 ``\booktitle{High Noon} takes us on a straight path to
                 the future.'' --- Dr. Eric Schmidt, Chairman and CEO,
                 Novell, Inc. ``\booktitle{High Noon} illustrates how a
                 company can succeed in the technology industry through
                 a delicate balance between drive, talent, and timing.''
                 Carol Bartz, Chairman and CEO, Autodesk.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Introduction: Sun Goes to Washington \\
                 Beginnings \\
                 In the Driver's Seat \\
                 Tooting Its Own Horn \\
                 On Top of the World \\
                 Hard Times \\
                 Kick Butt and Have Fun \\
                 What Is Java, Anyway? \\
                 Java Boils Over \\
                 At War with the Evil Empire \\
                 The War Escalates \\
                 Changing the Rules (Again). The Millennial Sun \\
                 Chapter Notes \\
                 Acknowledgments \\
                 Index",
}

@Book{SPARC:1992:SAM,
  author =       "{SPARC International, Inc.}",
  title =        "The {SPARC} Architecture Manual: {Version} 8",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xxix + 316",
  year =         "1992",
  ISBN =         "0-13-825001-4 (paperback)",
  ISBN-13 =      "978-0-13-825001-0 (paperback)",
  LCCN =         "QA76.9.A73 S647 1992",
  bibdate =      "Thu Dec 16 09:12:32 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/microchip.bib",
  URL =          "http://www.sparc.org/standards/V8.pdf",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Introduction \\
                 2: Overview \\
                 3: Data formats \\
                 4: Registers \\
                 5: Instructions \\
                 6: Memory model \\
                 7: Traps \\
                 Appendixes \\
                 A: Suggested assembly language syntax \\
                 B: Instruction definitions \\
                 C: ISP descriptions \\
                 D: Software considerations \\
                 E: Example integer multiplication and division routines
                 \\
                 F: Opcodes and condition codes \\
                 G: SPARC ABI software considerations \\
                 H: SPARC reference MMU architecture \\
                 I: Suggested ASI assignments for SPARC systems \\
                 J: Programming with the memory model \\
                 K: Formal specification of the memory model \\
                 L: Implementation characteristics \\
                 M: Instruction set summary \\
                 N: SPARC IEEE 754 implementation recommendations",
}

@Misc{Spencer:regexp,
  author =       "Henry Spencer",
  title =        "Regular expression pattern matching software",
  howpublished = "Usenet \path|mod.sources| and \path|net.sources|
                 archives",
  month =        nov,
  year =         "1985",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Spivak:1986:JTG,
  author =       "Michael D. Spivak",
  title =        "The Joy of {\TeX}: {A} Gourmet Guide to Typesetting
                 with the {\AMSTEX} macro package",
  publisher =    pub-AMS,
  address =      pub-AMS:adr,
  pages =        "xviii + 290",
  year =         "1986",
  ISBN =         "0-8218-2999-8",
  ISBN-13 =      "978-0-8218-2999-8",
  LCCN =         "Z253.4.T47 S6731 1986",
  bibdate =      "Wed Dec 15 10:41:57 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Spivak:1989:LS,
  author =       "Michael D. Spivak",
  title =        "{L\AMSTEX}, The Synthesis",
  publisher =    pub-TEXPLORATORS,
  address =      pub-TEXPLORATORS:adr,
  pages =        "viii + 289",
  year =         "1989",
  bibdate =      "Wed Jul 6 14:58:58 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Spivak:1990:JTG,
  author =       "Michael D. Spivak",
  title =        "The Joy of {\TeX}: a Gourmet Guide to Typesetting with
                 the {\AmSTeX} macro package",
  publisher =    pub-AMS,
  address =      pub-AMS:adr,
  edition =      "Second revised",
  pages =        "xxii + 309",
  year =         "1990",
  ISBN =         "0-8218-2997-1",
  ISBN-13 =      "978-0-8218-2997-4",
  LCCN =         "Z253.4.T47 S6731 1990",
  bibdate =      "Wed Jul 6 13:55:42 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",
  price =        "US\$40.00",
  URL =          "https://ctan.org/pkg/joy-of-tex",
  ZMnumber =     "0867.68117",
  abstract =     "Designed to simplify the input of mathematical
                 material in particular and to format the output
                 according to any of various preset style
                 specifications.",
  acknowledgement = ack-nhfb,
  remark =       "A PDF file of the book is available for noncommercial
                 use at the CTAN URL.",
  tableofcontents = "Preface / ix \\
                 Acknowledgments / xi, xiii \\
                 Personal Pronoun Pronouncement / xv \\
                 Introduction. On Advanced Typesetting / xvii \\
                 Part 1. Starters / 1 \\
                 0. Getting Acquainted; A Key Chapter / 3 \\
                 Keys available on the keyboard \\
                 1. Learning \TeX{}'s Lingo / 6 \\
                 Ordinary text and control sequences \\
                 2. Printers Do It With All Types / 15 \\
                 Changing fonts \\
                 3. Your First \TeX{} Experience / 20 \\
                 Running a file through \TeX{} \\
                 4. \TeX{}'s Erroneous Zones / 27 \\
                 Error messages, and how to respond to them \\
                 5. Spaces That Separate,Ties That Bind / 32 \\
                 Subtleties of spacing and line breaking \\
                 6. Doing It With {\'E}lan / 34 \\
                 Special symbols and accents \\
                 Part 2. Main Courses / 47 \\
                 7. \TeX{}'s Brand Of Mathematics / 43 \\
                 Mathematical formulas in text \\
                 8. Lousy Breaks? Try An Artful Display / 53 \\
                 Displayed formulas \\
                 9. The 2nd Level Of Complexity / 58 \\
                 Superscripts and subscripts \\
                 10. Our Problems Mount / 66 \\
                 Fractions, binomial coefficients, etc. \\
                 11. Benefitting From \TeX{}'s Largess / 72 \\
                 $\sum$, $\int$ and other ``large operators'' \\
                 12. Creating Your Own Space / 77 \\
                 Controlling spacing in mathematical formulas \\
                 13. Fascinating Things That Expand By Themselves / 79
                 \\
                 Delimiters and other variable size symbols \\
                 14. A Roman Orgy / 88 \\
                 Roman type in formulas \\
                 15. Keeping Them In Line / 97 \\
                 Numbering formulas and aligning equations in a display
                 \\
                 16. Too Much Of A Good Thing / 103 \\
                 Breaking formulas that are too long \\
                 17. Sophisticated Positions / 108 \\
                 Matrices \\
                 Part 3. Sauces \& Pickles / 113 \\
                 18. Practicing Self Control / 115 \\
                 Defining new control sequences \\
                 19. EX-Rated Features / 129 \\
                 A dictionary of special \TeX{}niques \\
                 Appendices / 191 \\
                 A. The AMS Preprint Style / 193 \\
                 B. Answers To All The Exercises / 210 \\
                 C. Bibliographies / 260 \\
                 D. Comparison With `plain' \TeX{} / 265 \\
                 E. Deficient Keyboards / 269 \\
                 F. Esoteric Symbols / 270 \\
                 G. Further Fonts / 274 \\
                 H. {\TeX{} Users} / 281 \\
                 I. Help / 282 \\
                 Index / 283",
}

@Book{Sproull:1985:DPD,
  author =       "Robert F. Sproull and W. R. Sutherland and Michael K.
                 Ullner",
  title =        "Device-Independent Graphics: with examples from {IBM}
                 personal computers",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "xii + 546",
  year =         "1985",
  ISBN =         "0-07-060504-1",
  ISBN-13 =      "978-0-07-060504-6",
  LCCN =         "T385.S67 1985",
  bibdate =      "Wed Dec 15 10:41:58 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$29.95",
  acknowledgement = ack-nhfb,
  tableofcontents = "Computer graphics \\
                 Interactive computer graphics \\
                 Graphics hardware \\
                 Graphics software \\
                 The graphical kernel system \\
                 Using the graphical kernel system \\
                 Getting started with GKS \\
                 An interactive drawing program \\
                 Extending the application \\
                 Using the drawing \\
                 A review of application design \\
                 Geometry \\
                 A geometry primer \\
                 Transformations \\
                 Modeling \\
                 Three-dimensional graphics \\
                 Shaded perspective pictures \\
                 Raster graphics \\
                 Programming the IBM professional graphics controller
                 \\
                 Raster images \\
                 Raster techniques \\
                 Lessons learned \\
                 Using graphics standards \\
                 Appendices \\
                 Index",
}

@Book{Sridhar:1996:BPC,
  author =       "M. A. Sridhar",
  title =        "Building Portable {C++} Applications with {YACL}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xix + 569",
  year =         "1996",
  ISBN =         "0-201-83276-3",
  ISBN-13 =      "978-0-201-83276-1",
  LCCN =         "QA76.73.C153S699 1966",
  MRclass =      "68N15",
  bibdate =      "Wed Apr 03 10:18:47 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Source code for Yet Another Class Library available
                 from
                 \path=ftp://ftp.cs.sc.edu/pub/yacl/yacl0150.tar.gz=.",
  abstract =     "Here is the first book on a general purpose
                 programming library that can be ported to multiple
                 platforms with little effort. Portability is a serious
                 challenge for C++. YACL is an application-centered
                 class library toolkit of GUI and general purpose
                 classes that makes portability a natural spin-off while
                 providing high-level abstractions. Applications that
                 are coded to use YACL's classes will run on any of the
                 supported platforms with merely a recompilation.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  tableofcontents = "1: Introduction \\
                 I: The Base Classes \\
                 2: Basic Concepts and Overview \\
                 3: Protocol for All Objects \\
                 4: Elementary Data Types \\
                 5: Container Classes \\
                 6: The B-tree and Related Classes \\
                 7: Data Storage and Database Classes \\
                 8: Object Input/Output and Persistence \\
                 9: Designing New Classes \\
                 10: Error Handling \\
                 II: The Graphic User Interface Classes \\
                 11: Basic GUI Concepts \\
                 12: The Visual Object \\
                 13: Composite Visual Objects \\
                 14: Data Display Classes \\
                 15: Menus \\
                 16: Graphics and Drawing \\
                 17: Implementation and Platform Specifics \\
                 III: YACL Reference Manual",
}

@Book{Stachel:1998:EMY,
  editor =       "John Stachel",
  title =        "{Einstein}'s miraculous year: five papers that changed
                 the face of physics",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "xv + 198",
  year =         "1998",
  ISBN =         "0-691-05938-1",
  ISBN-13 =      "978-0-691-05938-9",
  LCCN =         "QC7 .E52 1998",
  bibdate =      "Mon Mar 06 08:44:17 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "With the assistance of Trevor Lipscombe, Alice
                 Calaprice, and Sam Elworthy, and with a foreword by
                 Roger Penrose.",
  price =        "US\$19.95",
  acknowledgement = ack-nhfb,
  tableofcontents = "Foreword by Roger Penrose / vii \\
                 Introduction to the Centenary Edition / xv \\
                 Publisher's preface / lxiii \\
                 Corrigenda / lxiv \\
                 Introduction by John Stachel / 3 \\
                 Part 1: Einstein's dissertation on the determination of
                 Molecular Dimensions / 29 \\
                 Paper 1: A new determinations of Molecular Dimensions /
                 45 \\
                 Part 2: Einstein on Brownian motion / 71 \\
                 Paper 2: On the motion of small particles suspended in
                 liquids at rest required by the Molecular--Kinetic
                 Theory of Heat / 85 \\
                 Part 3: Einstein on the Theory of Relativity / 99 \\
                 Paper 3: On the electrodynamics of moving bodies / 123
                 \\
                 Paper 4: Does the inertia of a body depend on its
                 energy content? / 161 \\
                 Part 4: Einstein's early work on the Quantum Hypothesis
                 / 165 \\
                 Paper 5: On a heuristic point of view concerning the
                 production and transformation of light / 177",
}

@Book{Stallings:1990:RIS,
  editor =       "William Stallings",
  title =        "Reduced Instruction Set Computers",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  edition =      "Second",
  pages =        "ix + 433",
  year =         "1990",
  ISBN =         "0-8186-8943-9 (hardcover), 0-8186-5943-2
                 (microfiche)",
  ISBN-13 =      "978-0-8186-8943-7 (hardcover), 978-0-8186-5943-0
                 (microfiche)",
  LCCN =         "QA76.5 .T876 1990",
  bibdate =      "Wed Aug 10 11:53:49 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$54.50",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "Understanding execution behavior of software
                 systems / J. C. Browne \\
                 The nature of general-purpose computations / M.
                 Katevenis \\
                 Empirical evaluation of some features of instruction
                 set processor architectures / A. Lunde \\
                 Implications of structured programming for machine
                 architecture / A. S. Tanenbaum \\
                 Reduced instruction set computer architecture / W.
                 Stallings \\
                 RISC: back to the future / C. G. Bell \\
                 Register allocation via coloring / G. J. Chaitin [and
                 others] \\
                 Register allocation by priority-based coloring / F.
                 Chow and J. Hennessy \\
                 Strategies for managing the register file in RISC / Y.
                 Tamir and C. H. Sequin \\
                 Analyzing multiple register sets / C. Y. Hitchcock III
                 and H. M. Brinkley \\
                 Sprunt Compilers for the new generation of
                 Hewlett-Packard computers / D. S. Coutant, C. L.
                 Hammond, and J. W. Kelly \\
                 Compiling for RT PC ROMP / M. E. Hopkins \\
                 Optimizing compilers for SPARC / S. S. Muchnick \\
                 A perspective on the 801-reduced instruction set
                 computer / M. E. Hopkins \\
                 The IBM RT PC ROMP processor and memory management unit
                 architecture / R. O. Simpson and P. D. Hester \\
                 R2000 processor overview / G. Kane \\
                 Precision architecture / R. B. Lee \\
                 Architectural tradeoffs in the design of MIPS-X / P.
                 Chow and M. Horowitz \\
                 The CLIPPER processor: instruction set architecture and
                 implementation / W. Hollingsworth, H. Sachs, and A. J.
                 Smith \\
                 A survey of RISC processors and computers of the
                 mid-1980s / C. E. Gimarc and V. M. Milutinovi{\'c} \\
                 Where there's RISC, there's opportunity / A. Allison
                 \\
                 MIPS, Dhrystones and other tales / O. Serlin \\
                 Re-evaluation of the RISC I / J. L. Heath \\
                 RISC watch / D. A. Patterson \\
                 The effect of instruction set complexity on program
                 size and memory performance / J. W. Davidson and R. A.
                 Vaughan \\
                 Toward simpler, faster computers / P. Wallich \\
                 Applications determine the choice of RISC or CISC / R.
                 Wilson \\
                 Computers, complexity, and controversy / R. P. Colwell
                 [and others] \\
                 Response to ``Computers, complexity, and controversy''
                 / D. Patterson and J. Hennessy \\
                 More controversy about ``Computers, complexity, and
                 controversy'' / R. P. Colwell [and others] \\
                 And now a case for more complex instruction sets / M.
                 J. Flynn, C. L. Mitchell, and J. M. Mulder",
}

@Book{Stallings:2010:COA,
  author =       "William Stallings",
  title =        "Computer organization and architecture: designing for
                 performance",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  edition =      "Eighth",
  pages =        "xviii + 774",
  year =         "2010",
  ISBN =         "0-13-607373-5",
  ISBN-13 =      "978-0-13-607373-4",
  LCCN =         "QA76.9.C643 S73 2010",
  bibdate =      "Thu Sep 9 14:43:32 MDT 2010",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Computer organization; Computer architecture",
  tableofcontents = "Part 1. Overview \\
                 Part 2. computer system \\
                 Part 3. central processing unit \\
                 Part 4. control unit \\
                 Part 5. Parallel organization",
}

@TechReport{Stallman:gcc,
  author =       "Richard M. Stallman",
  title =        "Using and Porting {GNU CC}",
  institution =  pub-FSF,
  address =      pub-FSF:adr,
  year =         "1988",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Electronic mail: \path|rms@prep.ai.mit.edu|. Software
                 also available via ANONYMOUS FTP to
                 \path|prep.ai.mit.edu|.",
  acknowledgement = ack-nhfb,
}

@Book{Standage:1998:VIR,
  author =       "Tom Standage",
  title =        "The {Victorian Internet}: the Remarkable Story of the
                 Telegraph and the Nineteenth Century's On-line
                 Pioneers",
  publisher =    pub-WALKER,
  address =      pub-WALKER:adr,
  pages =        "ix + 227",
  year =         "1998",
  ISBN =         "0-8027-1342-4",
  ISBN-13 =      "978-0-8027-1342-1",
  LCCN =         "HE7631 .S677 1998",
  bibdate =      "Mon Dec 06 16:28:12 1999",
  bibsource =    "http://www.walkerbooks.com/;
                 https://www.math.utah.edu/pub/tex/bib/internet.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$12.00, CAN\$17.00",
  abstract =     "For thousands of years people had communicated across
                 distances only as quickly as the fastest ship or horse
                 could travel. Generations of innovators tried to
                 develop speedier messaging devices. Then, in the
                 mid-1800s, a few extraordinary pioneers at last
                 succeeded. Their invention --- the telegraph ---
                 nullified distance and shrank the world quicker and
                 further than ever before, or since. This book tells the
                 story of the telegraph's creation and remarkable
                 impact, and of the visionaries, oddballs, and
                 eccentrics who pioneered it. By 1865 telegraph cables
                 spanned continents and oceans, revolutionizing the ways
                 countries dealt with one another, giving rise to
                 creative business practices and new forms of crime.
                 Romances blossomed over the wires. The benefits of the
                 network were hyped by advocates and dismissed by
                 skeptics. Government regulators tried and failed to
                 control the new medium. And attitudes toward everything
                 from news gathering to war had to be completely
                 rethought.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: The Mother of All Networks \\
                 2: Strange, Fierce Fire \\
                 3: Electric Skeptics \\
                 4: The Thrill Electric \\
                 5: Wiring the World \\
                 6: Steam-Powered Messages \\
                 7: Codes, Hackers, and Cheats \\
                 8: Love over the Wires \\
                 9: War and Peace in the Global Village \\
                 10: Information Overload \\
                 11: Decline and Fall \\
                 12: The Legacy of the Telegraph",
}

@Book{Stannard:1999:NWM,
  author =       "Russell Stannard",
  title =        "The New World of {Mr. Tompkins}: {George Gamow}'s
                 Classic {Mr. Tompkins} in Paperback",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xii + 258",
  year =         "1999",
  ISBN =         "0-521-63009-6 (hardcover), 0-521-63992-1 (paperback),
                 0-511-00800-7 (e-book), 0-511-58169-6 (e-book)",
  ISBN-13 =      "978-0-521-63009-2 (hardcover), 978-0-521-63992-7
                 (paperback), 978-0-511-00800-9 (e-book),
                 978-0-511-58169-4 (e-book)",
  LCCN =         "QC71.S775 1999",
  bibdate =      "Sat Jun 17 12:48:34 2000",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/g/gamow-george.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$24.99",
  URL =          "http://www.loc.gov/catdir/description/cam029/98050379.html;
                 http://www.loc.gov/catdir/enhancements/fy0732/98050379-b.html;
                 http://www.loc.gov/catdir/toc/cam021/98050379.html",
  abstract =     "The layman is introduced to modern physics when a
                 personable bank clerk, interested in scientific
                 matters, has fantastic adventures.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "Physics",
  tableofcontents = "Gamow's Preface to \booktitle{Mr Tompkins in
                 Paperback} \\
                 City Speed Limit \\
                 The Professor's Lecture on Relativity which Caused Mr
                 Tompkins's Dream \\
                 Mr Tompkins takes a Holiday \\
                 The Notes of the Professor's Lecture on Curved Space
                 \\
                 Mr Tompkins Visits a Closed Universe \\
                 Cosmic Opera \\
                 Black Holes, Heat Death, and Blow Torch \\
                 Quantum Snooker \\
                 The Quantum Safari \\
                 Maxwell's Demon \\
                 The Merry Tribe of Electrons \\
                 The Remainder of the Previous Lecture through which Mr
                 Tompkins Dozed \\
                 Inside the Nucleus \\
                 The Woodcarver \\
                 Holes in Nothing \\
                 Visiting the `Atom Smasher' \\
                 The Professor's Last Lecture",
}

@Article{Stansifer:SIGPLAN-27-12-61,
  author =       "Ryan Stansifer",
  title =        "The Calculation of {Easter}",
  journal =      j-SIGPLAN,
  volume =       "27",
  number =       "12",
  pages =        "61--65",
  month =        dec,
  year =         "1992",
  bibdate =      "Wed Dec 30 12:05:19 1992",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{StDenis:2006:BMH,
  author =       "Tom {St Denis} and Greg Rose",
  title =        "{BigNum} Math: Implementing Cryptographic Multiple
                 Precision Arithmetic",
  publisher =    pub-SYNGRESS,
  address =      pub-SYNGRESS:adr,
  pages =        "xviii + 296",
  year =         "2006",
  ISBN =         "1-59749-112-8",
  ISBN-13 =      "978-1-59749-112-9",
  LCCN =         "QA402.5 2006",
  bibdate =      "Fri Jun 12 07:26:51 MDT 2009",
  bibsource =    "clas.caltech.edu:210/INNOPAC;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.bibsys.no:2100/BIBSYS",
  URL =          "http://www.oreilly.com/catalog/1597491128/index.html",
  acknowledgement = ack-nhfb,
  keywords =     "Karatsuba multiplication; modular exponentiation;
                 Montgomery reduction",
  tableofcontents = "Introduction \\
                 Multiple Precision Arithmetic \\
                 Exercises \\
                 Portability and Stability \\
                 Getting Started \\
                 Maintenance Algorithms \\
                 Basic Operations \\
                 Sign Manipulation \\
                 Basic Arithmetic \\
                 Multiplication and Squaring \\
                 The Multipliers \\
                 Multiplication \\
                 Modular Reduction \\
                 Basics of Modular Reduction \\
                 Exponentiation \\
                 Exponentiation Basics \\
                 Higher Level Algorithms \\
                 Number Theoretic Algorithms",
}

@Book{Steele:1984:CLL,
  author =       "Guy L. {Steele Jr.}",
  title =        "{Common Lisp}: The Language",
  publisher =    pub-DP,
  address =      pub-DP:adr,
  pages =        "xii + 465",
  year =         "1984",
  ISBN =         "0-13-152851-3, 0-932376-41-X (paperback)",
  ISBN-13 =      "978-0-13-152851-2, 978-0-932376-41-1 (paperback)",
  LCCN =         "QA76.73.L23 S73 1984",
  bibdate =      "Sun Jul 10 01:10:15 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/common-lisp.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "With contributions by Scott E. Fahlman and Richard P.
                 Gabriel and David A. Moon and Daniel L. Weinreb. See
                 also \cite{Tatar:1987:PGC}.",
  price =        "US\$22.00",
  acknowledgement = ack-nhfb,
  subject =      "COMMON LISP (Computer program language); Common Lisp
                 (Langage de programmation); COMMON LISP (Computer
                 program language); LISP",
  tableofcontents = "Data types \\
                 Scope and extent \\
                 Type specifiers \\
                 Program structure \\
                 Predicates \\
                 Control structure \\
                 Macros \\
                 Declarations \\
                 Symbols \\
                 Packages \\
                 Numbers \\
                 Characters \\
                 Sequences \\
                 Lists \\
                 Hash tables \\
                 Arrays \\
                 Strings \\
                 Structures \\
                 Evaluator \\
                 Streams \\
                 Input/output \\
                 File system interface \\
                 Errors \\
                 Miscellaneous features",
}

@Book{Steele:1990:CLL,
  author =       "Guy L. {Steele Jr.}",
  title =        "{Common Lisp}: The Language",
  publisher =    pub-DP,
  address =      pub-DP:adr,
  edition =      "Second",
  pages =        "xxiii + 1029",
  year =         "1990",
  ISBN =         "1-55558-041-6 (paperback), 1-55558-042-4 (hardcover),
                 0-08-050226-1 (e-book), 0-13-152414-3 (Prentice-Hall)",
  ISBN-13 =      "978-1-55558-041-4 (paperback), 978-1-55558-042-1
                 (hardcover), 978-0-08-050226-7 (e-book),
                 978-0-13-152414-9 (Prentice-Hall)",
  LCCN =         "QA76.73.L23 S73 1990",
  bibdate =      "Thu May 16 16:38:35 2002",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/subjects/case-based-reasoning.bib;
                 https://www.math.utah.edu/pub/tex/bib/common-lisp.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook2.bib",
  note =         "With contributions by Scott E. Fahlman and others, and
                 with contributions to the second edition by Daniel G.
                 Bobrow and others. See also
                 \cite{Steele:1984:CLL,Tatar:1987:PGC}.",
  abstract =     "In this greatly expanded edition of the defacto
                 standard, you'll learn about the nearly 200 changes
                 already made since original publication --- and find
                 out about gray areas likely to be revised later.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  remark =       "Camera-ready copy for this book was created by the
                 author (using {\TeX}, {\LaTeX}, and {\TeX} macros
                 written by the author), proofed on an Apple LaserWriter
                 II, and printed on a Linotron 300 at Advanced Computer
                 Graphics. The text of the first edition was converted
                 from Scribe format to {\TeX} format by a throwaway
                 program written in Common Lisp. The diagrams in chapter
                 12 were generated automatically as PostScript code (by
                 a program written in Common Lisp) and integrated into
                 the text by Textures, an implementation of {\TeX} by
                 Blue Sky Research for the Apple Macintosh computer. No
                 manual paste-up of any kind was required. The body type
                 is 10-point Times Roman. Chapter titles are in ITC Eras
                 Demi; running heads are in ITC Eras Book. The monospace
                 typeface used for program code in both displays and
                 running text is 8.5-point Letter Gothic Bold, somewhat
                 modified by the author through {\TeX} macros for
                 improved legibility. The accent grave, accent acute,
                 circumflex, and tilde characters are in 10-point Letter
                 Gothic Bold and adjusted vertically to match the height
                 of the 8.5-point characters. The hyphen was replaced by
                 an en dash. The equals sign is constructed of two em
                 dashes, one raised and one lowered, the better to match
                 the other relational characters. The sharp sign is
                 overstruck with two hyphens, one raised and one
                 lowered, to eliminate the vertical gap. Special
                 mathematical characters such as square-root signs are
                 in Computer Modern Math. The typefaces used in this
                 book were digitized by Adobe Systems Incorporated,
                 except for Computer Modern Math, which was designed by
                 Donald E. Knuth.",
  tableofcontents = "Preface (Second Edition) \\
                 Acknowledgments (Second Edition) \\
                 Acknowledgments (First Edition) \\
                 1: Introduction \\
                 1.1. Purpose \\
                 1.2. Notational Conventions \\
                 2: Data Types \\
                 2.1. Numbers \\
                 2.2. Characters \\
                 2.3. Symbols \\
                 2.4. Lists and Conses \\
                 2.5. Arrays \\
                 2.6. Hash Tables \\
                 2.7. Readtables \\
                 2.8. Packages \\
                 2.9. Pathnames \\
                 2.10. Streams \\
                 2.11. Random-States \\
                 2.12. Structures \\
                 2.13. Functions \\
                 2.14. Unreadable Data Objects \\
                 2.15. Overlap, Inclusion, and Disjointness of Types \\
                 3: Scope and Extent \\
                 4: Type Specifiers \\
                 4.1. Type Specifier Symbols \\
                 4.2. Type Specifier Lists \\
                 4.3. Predicating Type Specifiers \\
                 4.4. Type Specifiers That Combine \\
                 4.5. Type Specifiers That Specialize \\
                 4.6. Type Specifiers That Abbreviate \\
                 4.7. Defining New Type Specifiers \\
                 4.8. Type Conversion Function \\
                 4.9. Determining the Type of an Object \\
                 4.10. Type Upgrading \\
                 5: Program Structure \\
                 5.1. Forms \\
                 5.2. Functions \\
                 5.3. Top-Level Forms \\
                 6: Predicates \\
                 6.1. Logical Values \\
                 6.2. Data Type Predicates \\
                 6.3. Equality Predicates \\
                 6.4. Logical Operators \\
                 7: Control Structure \\
                 7.1. Constants and Variables \\
                 7.2. Generalized Variables \\
                 7.3. Function Invocation \\
                 7.4. Simple Sequencing \\
                 7.5. Establishing New Variable Bindings \\
                 7.6. Conditionals \\
                 7.7. Blocks and Exits \\
                 7.8. Iteration \\
                 7.9. Structure Traversal and Side Effects \\
                 7.10. Multiple Values \\
                 7.11. Dynamic Non-Local Exits \\
                 8: Macros \\
                 8.1. Macro Definition \\
                 8.2. Macro Expansion \\
                 8.3. Destructuring \\
                 8.4. Compiler Macros \\
                 8.5. Environments \\
                 9: Declarations \\
                 9.1. Declaration Syntax \\
                 9.2. Declaration Specifiers \\
                 9.3. Type Declaration for Forms \\
                 10: Symbols \\
                 10.1. The Property List \\
                 10.2. The Print Name \\
                 10.3. Creating Symbols \\
                 11: Packages \\
                 11.1. Consistency Rules \\
                 11.2. Package Names \\
                 11.3. Translating Strings to Symbols \\
                 11.4. Exporting and Importing Symbols \\
                 11.5. Name Conflicts \\
                 11.6. Built-in Packages \\
                 11.7. Package System Functions and Variables \\
                 11.8. Modules \\
                 11.9. An Example \\
                 12: Numbers \\
                 12.1. Precision, Contagion, and Coercion \\
                 12.2. Predicates on Numbers \\
                 12.3. Comparisons on Numbers \\
                 12.4. Arithmetic Operations \\
                 12.5. Irrational and Transcendental Functions \\
                 12.6. Type Conversions and Component Extractions on
                 Numbers \\
                 12.7. Logical Operations on Numbers \\
                 12.8. Byte Manipulation Functions \\
                 12.9. Random Numbers \\
                 12.10. Implementation Parameters \\
                 13: Characters \\
                 13.1. Character Attributes \\
                 13.2. Predicates on Characters \\
                 13.3. Character Construction and Selection \\
                 13.4. Character Conversions \\
                 13.5. Character Control-Bit Functions \\
                 14: Sequences \\
                 14.1. Simple Sequence Functions \\
                 14.2. Concatenating, Mapping, and Reducing Sequences
                 \\
                 14.3. Modifying Sequences \\
                 14.4. Searching Sequences for Items \\
                 14.5. Sorting and Merging \\
                 15: Lists \\
                 15.1. Conses \\
                 15.2. Lists",
}

@Article{Steele:floating-point-output,
  author =       "Guy L. {Steele Jr.} and Jon L. White",
  title =        "How to Print Floating-Point Numbers Accurately",
  journal =      j-SIGPLAN,
  volume =       "25",
  number =       "6",
  pages =        "112--126",
  month =        jun,
  year =         "1990",
  bibdate =      "Sun May 2 07:54:06 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See also input algorithm in
                 \cite{Clinger:floating-point-input}, and
                 \cite{Knuth:1990:SPW}. In electronic mail dated Wed, 27
                 Jun 90 11:55:36 EDT, Guy Steele reported that an
                 intrepid pre-SIGPLAN 90 conference implementation of
                 what is stated in the paper revealed 3 mistakes:
                 \begin{itemize} \item[1.] Table~5 (page
                 124):\par\noindent insert {\tt k <-- 0} after
                 assertion, and also delete {\tt k <-- 0} from Table~6.
                 \item[2.] Table~9 (page 125):\par\noindent
                 \begin{tabular}{ll} for & {\tt -1:USER!({"}{"});} \\
                 substitute & {\tt -1:USER!({"}0{"});}
                 \end{tabular}\par\noindent and delete the comment.
                 \item[3.] Table~10 (page 125):\par\noindent
                 \begin{tabular}{ll} for & {\tt fill(-k, "0")}\\
                 substitute & {\tt fill(-k-1, "0")} \end{tabular}
                 \end{itemize}
                 \def\EatBibTeXPeriod#1{\ifx#1.\else#1\fi}\EatBibTeXPeriod",
  acknowledgement = ack-nhfb,
}

@Book{Stephen:1994:SSA,
  author =       "Graham A. Stephen",
  title =        "String Searching Algorithms",
  volume =       "3",
  publisher =    pub-WORLD-SCI,
  address =      pub-WORLD-SCI:adr,
  pages =        "xii + 243",
  year =         "1994",
  ISBN =         "981-02-1829-X (hardcover)",
  ISBN-13 =      "978-981-02-1829-4 (hardcover)",
  LCCN =         "QA76.9.A43 S73 1994",
  bibdate =      "Sat Jul 14 17:06:23 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
  series =       "Lecture notes series on computing",
  abstract =     "String searching is a subject of both theoretical and
                 practical interest in computer science. This book
                 presents a bibliographic overview of the field and an
                 anthology of detailed descriptions of the principal
                 algorithms available. The aim is twofold: on the one
                 hand, to provide an easy-to-read comparison of the
                 available techniques in each area, and on the other, to
                 furnish the reader with a reference to in-depth
                 descriptions of the major algorithms. Topics covered
                 include methods for finding exact and approximate
                 string matches, calculating `edit' distances between
                 strings, finding common \ldots{}",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "1: Introduction \\
                 2: String Matching \\
                 3: String Distance and Common Sequences \\
                 4: Suffix Trees \\
                 5: Approximate String Matching \\
                 6: Repeated Substrings \\
                 A: Asymptotic Notation \\
                 B: String Symbology",
}

@Book{Stern:1991:MNN,
  author =       "Hal Stern",
  title =        "Managing {NFS} and {NIS}",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xxiv + 410",
  year =         "1991",
  ISBN =         "0-937175-75-7",
  ISBN-13 =      "978-0-937175-75-0",
  LCCN =         "TK5105.5 .S74 1991",
  bibdate =      "Wed Dec 15 10:42:43 1993",
  bibsource =    "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;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  URL =          "http://www.oreilly.com/catalog/9780937175750;
                 http://www.oreilly.com/catalog/nfs",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "1: Networking Fundamentals \\
                 2: Network Information Service Operation \\
                 3: System Management using NIS \\
                 4: Building Applications with NIS \\
                 5: System Administration Using the Network Filesystem
                 \\
                 6: Network File System Design and Operation \\
                 7: Diskless Clients \\
                 8: Network Security \\
                 9: Centralizing Mail Services with NFS and NIS \\
                 10: Diagnostic and Administrative Tools \\
                 11: Debugging Network Problems \\
                 12: Performance Analysis and Tuning \\
                 13 The Automounter \\
                 14: PC/NFS \\
                 A: Transmission Line Theory \\
                 B: IP Packet Routing \\
                 C: NFS Problem Diagnosis",
  tableofcontents = "Preface / ix \\
                 Networking Fundamentals / 1 \\
                 Networking overview / 2 \\
                 Physical and data link layers / 4 \\
                 Network layer / 5 \\
                 Transport layer / 12 \\
                 The session and presentation layers / 14 \\
                 Introduction to Directory Services / 20 \\
                 Purpose of directory services / 20 \\
                 Brief survey of common directory services / 22 \\
                 Name service switch / 27 \\
                 Which directory service to use / 27 \\
                 Network Information Service Operation / 28 \\
                 Masters, slaves, and clients / 29 \\
                 Basics of NIS management / 32 \\
                 Files managed under NIS / 40 \\
                 Trace of a key match / 54 \\
                 System Management Using NIS / 57 \\
                 NIS network design / 57 \\
                 Managing map files / 60 \\
                 Advanced NIS server administration / 68 \\
                 Managing multiple domains / 71 \\
                 Living with Multiple Directory Servers / 74 \\
                 Domain name servers / 74 \\
                 Implementation / 77 \\
                 Fully qualified and unqualified hostnames / 79 \\
                 Centralized versus distributed management / 81 \\
                 Migrating from NIS to DNS for host naming / 82 \\
                 What next? / 83 \\
                 System Administration Using the Network File System /
                 84 \\
                 Setting up NFS / 85 \\
                 Exporting filesystems / 86 \\
                 Mounting filesystems / 92 \\
                 Symbolic links / 105 \\
                 Replication / 108 \\
                 Naming schemes / 113 \\
                 Network File System Design and Operation / 118 \\
                 Virtual filesystems and virtual nodes / 119 \\
                 NFS protocol and implementation / 120 \\
                 NFS components / 130 \\
                 Caching / 136 \\
                 File locking / 142 \\
                 NFS futures / 144 \\
                 Diskless Clients / 147 \\
                 NFS support for diskless clients / 148 \\
                 Setting up a diskless client / 149 \\
                 Diskless client boot process / 152 \\
                 Managing client swap space / 157 \\
                 Changing a client's name / 159 \\
                 Troubleshooting / 160 \\
                 Configuration options / 165 \\
                 Brief introduction to JumpStart administration / 168
                 \\
                 Client/server ratios / 169 \\
                 The Automounter / 171 \\
                 Automounter maps / 173 \\
                 Invocation and the master map / 182 \\
                 Integration with NIS / 187 \\
                 Key and variable substitutions / 190 \\
                 Advanced map tricks / 194 \\
                 Side effects / 204 \\
                 PC/NFS Clients / 206 \\
                 PC/NFS today / 206 \\
                 Limitations of PC/NFS / 208 \\
                 Configuring PC/NFS / 211 \\
                 Common PC/NFS usage issues / 212 \\
                 Printer services / 214 \\
                 File Locking / 216 \\
                 What is file locking? / 216 \\
                 NFS and file locking / 219 \\
                 Troubleshooting locking problems / 221 \\
                 Network Security / 226 \\
                 User-oriented network security / 226 \\
                 How secure are NIS and NFS? / 233 \\
                 Password and NIS security / 234 \\
                 NFS security / 238 \\
                 Stronger security for NFS / 253 \\
                 Viruses / 279 \\
                 Network Diagnostic and Administrative Tools / 281 \\
                 Broadcast addresses / 283 \\
                 MAC and IP layer tools / 285 \\
                 Remote procedure call tools / 305 \\
                 NIS tools / 315 \\
                 Network analyzers / 323 \\
                 NFS Diagnostic Tools / 336 \\
                 NFS administration tools / 336 \\
                 NFS statistics / 340 \\
                 Snoop / 349 \\
                 Publicly available diagnostics / 353 \\
                 Version 2 and Version 3 differences / 360 \\
                 NFS server logging / 361 \\
                 Time synchronization / 376 \\
                 Debugging Network Problems / 379 \\
                 Duplicate ARP replies / 379 \\
                 Renegade NIS server / 381 \\
                 Boot parameter confusion / 383 \\
                 Incorrect directory content caching / 384 \\
                 Incorrect mount point permissions / 389 \\
                 Asynchronous NFS error messages / 391 \\
                 Server-Side Performance Tuning / 395 \\
                 Characterization of NFS behavior / 396 \\
                 Measuring performance / 397 \\
                 Benchmarking / 400 \\
                 Identifying NFS performance bottlenecks / 401 \\
                 Server tuning / 405 \\
                 Network Performance Analysis / 417 \\
                 Network congestion and network interfaces / 417 \\
                 Network partitioning hardware / 420 \\
                 Network infrastructure / 422 \\
                 Impact of partitioning / 424 \\
                 Protocol filtering / 426 \\
                 Client-Side Performance Tuning / 428 \\
                 Slow server compensation / 428 \\
                 Soft mount issues / 434 \\
                 Adjusting for network reliability problems / 436 \\
                 NFS over wide-area networks / 438 \\
                 NFS async thread tuning / 439 \\
                 Attribute caching / 442 \\
                 Mount point constructions / 444 \\
                 Stale filehandles / 445 \\
                 IP Packet Routing / 449 \\
                 NFS Problem Diagnosis / 456 \\
                 Tunable Parameters / 460 \\
                 Index / 467",
  walts-review = "A practical, detailed handbook for those responsible
                 for managing NFS/NIS installations. The subject is
                 covered in depth. The reader is assumed to have a good
                 working knowledge of UNIX system administration. The
                 book is based on the SunOS 4.1 version of the software,
                 but the author has made a decent attempt to address
                 other versions.",
}

@Book{Stern:1999:EGW,
  author =       "Fritz Richard Stern",
  title =        "{Einstein}'s {German} world",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "ix + 335",
  year =         "1999",
  ISBN =         "0-691-05939-x",
  ISBN-13 =      "978-0-691-05939-6",
  LCCN =         "DD239 .S74 1999",
  bibdate =      "Sat Jun 15 13:10:03 MDT 2013",
  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/nuncius.bib;
                 library.ox.ac.uk:210/ADVANCE; z3950.gbv.de:20011/gvk;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.gbv.de/dms/bowker/toc/9780691059396.pdf;
                 http://www.loc.gov/catdir/description/prin021/99020128.htm;
                 http://www.loc.gov/catdir/description/prin021/99020128.html;
                 http://www.loc.gov/catdir/toc/prin032/99020128.htm;
                 http://www.loc.gov/catdir/toc/prin032/99020128.html",
  abstract =     "In Einstein's German World, the eminent historian
                 Fritz Stern explores the ambiguous promise of Germany
                 before Hitler, as well as its horrifying decline into
                 moral nihilism under Nazi rule, and aspects of its
                 remarkable recovery since World War II. He does so by
                 blending history and biography in a sequence of finely
                 drawn studies of Germany's great scientists and of
                 German-Jewish relations before and during Hitler's
                 regime.\par

                 Stern's central chapter traces the complex friendship
                 of Albert Einstein and the Nobel Prize-winning chemist
                 Fritz Haber, contrasting their responses to German life
                 and to their Jewish heritage. Other chapters, also
                 based on new archival sources, consider the turbulent
                 and interrelated careers of the physicist Max Planck,
                 an austere and powerful figure who helped to make
                 Berlin a happy, productive place for Einstein and other
                 legendary scientists; of Paul Ehrlich, the founder of
                 chemotherapy; of Walther Rathenau, the German-Jewish
                 industrialist and statesman tragically assassinated in
                 1922; and of Chaim Weizmann, chemist, Zionist, and
                 first president of Israel, whose close relations with
                 his German colleagues is here for the first time
                 recounted.",
  acknowledgement = ack-nhfb,
  remark =       "The author is Fritz Haber's godson, and Haber was a
                 close friend of Einstein in their Berlin years.",
  subject =      "Einstein, Albert; Brain drain; Germany; History; 20th
                 century; Political persecution; Technology transfer;
                 Antisemitism; Jewish scientists; Intellectual life",
  subject-dates = "1879--1955",
  tableofcontents = "Part One: The Promise of German Life \\
                 1. Paul Ehrlich: the founder of chemotherapy \\
                 2. Max Planck and the trials of his times \\
                 3. Together and apart: Fritz Haber and Albert Einstein
                 \\
                 4. Walther Rathenau and the vision of modernity \\
                 Part Two: The Great War and Consequent Terrors \\
                 5. Historians and the Great War: private experience and
                 public explication \\
                 6. Chaim Weizmann and liberal nationalism \\
                 7. Freedom and its discontents: the travails of the new
                 Germany \\
                 8. Past distorted: the Goldhagen controversy \\
                 9. Lost homelands: German--Polish reconciliation \\
                 Notes \\
                 Acknowledgments \\
                 Index",
}

@Book{Stern:2001:EGW,
  author =       "Fritz Richard Stern",
  title =        "{Einstein}'s {German} world",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "ix + 335",
  year =         "2001",
  ISBN =         "0-691-07458-5 (paperback)",
  ISBN-13 =      "978-0-691-07458-0 (paperback)",
  LCCN =         "DD239 .S74 2001",
  bibdate =      "Wed Mar 13 07:05:00 2013",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/description/prin021/99020128.htm;
                 http://www.loc.gov/catdir/toc/prin032/99020128.htm",
  abstract =     "In Einstein's German World, the eminent historian
                 Fritz Stern explores the ambiguous promise of Germany
                 before Hitler, as well as its horrifying decline into
                 moral nihilism under Nazi rule, and aspects of its
                 remarkable recovery since World War II. He does so by
                 blending history and biography in a sequence of finely
                 drawn studies of Germany's great scientists and of
                 German-Jewish relations before and during Hitler's
                 regime.\par

                 Stern's central chapter traces the complex friendship
                 of Albert Einstein and the Nobel Prize-winning chemist
                 Fritz Haber, contrasting their responses to German life
                 and to their Jewish heritage. Other chapters, also
                 based on new archival sources, consider the turbulent
                 and interrelated careers of the physicist Max Planck,
                 an austere and powerful figure who helped to make
                 Berlin a happy, productive place for Einstein and other
                 legendary scientists; of Paul Ehrlich, the founder of
                 chemotherapy; of Walther Rathenau, the German-Jewish
                 industrialist and statesman tragically assassinated in
                 1922; and of Chaim Weizmann, chemist, Zionist, and
                 first president of Israel, whose close relations with
                 his German colleagues is here for the first time
                 recounted.",
  acknowledgement = ack-nhfb,
  subject =      "Germany; Intellectual life; 20th century; Brain drain;
                 History; Political persecution; Technology transfer;
                 Antisemitism; Einstein, Albert; Jewish scientists",
  subject-dates = "1879--1955",
  tableofcontents = "Part One: The Promise of German Life \\
                 1. Paul Ehrlich: the founder of chemotherapy \\
                 2. Max Planck and the trials of his times \\
                 3. Together and apart: Fritz Haber and Albert Einstein
                 \\
                 4. Walther Rathenau and the vision of modernity \\
                 Part Two: The Great War and Consequent Terrors \\
                 5. Historians and the Great War: private experience and
                 public explication \\
                 6. Chaim Weizmann and liberal nationalism \\
                 7. Freedom and its discontents: the travails of the new
                 Germany \\
                 8. Past distorted: the Goldhagen controversy \\
                 9. Lost homelands: German-Polish reconciliation \\
                 Notes \\
                 Acknowledgments \\
                 Index",
}

@Book{Stevens:1990:UNP,
  author =       "W. Richard Stevens",
  title =        "{UNIX} Network Programming",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xi + 772",
  year =         "1990",
  ISBN =         "0-13-949876-1",
  ISBN-13 =      "978-0-13-949876-3",
  LCCN =         "QA76.76.O63 S755 1990",
  bibdate =      "Wed Dec 15 10:42:44 1993",
  bibsource =    "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/unix.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Introduction \\
                 The UNIX model \\
                 Interprocess communication \\
                 A network primer \\
                 Communication protocols \\
                 Berkeley sockets \\
                 System V transport layer interface \\
                 Library routines \\
                 Security \\
                 Time and date routines \\
                 Ping routines \\
                 Trivial file transfer program \\
                 Line printer spools \\
                 Remote command execution \\
                 Remote login \\
                 Remote tape drive access \\
                 Performance \\
                 Remote Procedure Calls \\
                 Appendices",
}

@Book{Stevens:1992:APU,
  author =       "W. Richard Stevens",
  title =        "Advanced Programming in the {UNIX} Environment",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xviii + 744",
  year =         "1992",
  ISBN =         "0-201-56317-7",
  ISBN-13 =      "978-0-201-56317-7",
  LCCN =         "QA76.76.O63 S754 1992",
  bibdate =      "Sat Apr 27 07:12:16 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/postscri.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  note =         "{\em Highly recommended}. A going-to-be classic on how
                 programs work under {UNIX} \ldots{} The source codes
                 and errata list are obtainable by anonymous {\tt ftp}
                 from \path|ftp.uu.net| (in \path|/published/books|).",
  price =        "US\$52.25",
  acknowledgement = ack-nhfb,
  tableofcontents = "Preface \\
                 1: Introduction \\
                 2: Unix standardization and implementations \\
                 3: File I/O \\
                 4: Files and directories \\
                 5: Standard I/O library \\
                 6: System data files and information \\
                 7: The environment of a Unix process \\
                 8: Process control \\
                 9: Process relationships \\
                 10: Signals \\
                 11: Terminal I/O \\
                 12: Advanced I/O \\
                 13: Daemon processes \\
                 14: Interprocess communication \\
                 15: Advanced interprocess communication \\
                 16: A database library \\
                 17: Communicating with a PostScript printer \\
                 18: A modern dialer \\
                 19: Pseudo terminals \\
                 Appendix A: Function prototypes \\
                 Appendix B: Miscellaneous source code \\
                 Appendix C: Solutions to selected exercises \\
                 Bibliography \\
                 Index",
}

@Book{Stevens:1994:TII,
  author =       "W. Richard Stevens",
  title =        "{TCP\slash IP} Illustrated, Volume 1: The Protocols",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xix + 576",
  year =         "1994",
  ISBN =         "0-201-63346-9",
  ISBN-13 =      "978-0-201-63346-7",
  LCCN =         "TK5105.55 .S74 1994",
  bibdate =      "Tue Jul 25 18:19:54 2000",
  bibsource =    "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/unix.bib",
  price =        "US\$65.95",
  series =       "Addison-Wesley Professional Computing Series",
  acknowledgement = ack-nhfb,
  tableofcontents = "Introduction \\
                 Layering \\
                 TCP/IP Layering \\
                 Internet Addresses \\
                 The Domain Name System \\
                 Encapsulation \\
                 Demultiplexing \\
                 Client-Server Model \\
                 Port Numbers \\
                 Standardization Process \\
                 RFCs \\
                 Standard, Simple Services \\
                 The Internet \\
                 Implementations \\
                 Application Programming Interfaces \\
                 Test Network \\
                 Summary \\
                 Link Layer \\
                 Introduction \\
                 Ethernet and IEEE 802 Encapsulation \\
                 Trailer Encapsulation \\
                 SLIP: Serial Line IP \\
                 Compressed SLIP \\
                 PPP: Point-to-Point Protocol \\
                 Loopback Interface \\
                 MTU \\
                 Path MTU \\
                 Serial Line Throughput Calculations \\
                 Summary \\
                 IP: Internet Protocol \\
                 Introduction \\
                 IP Header \\
                 IP Routing \\
                 Subnet Addressing \\
                 Subnet Mask \\
                 Special Case IP Addresses \\
                 A Subnet Example \\
                 ifconfig Command \\
                 netstat Command \\
                 IP Futures \\
                 Summary \\
                 ARP: Address Resolution Protocol \\
                 Introduction \\
                 An Example \\
                 ARP Cache \\
                 ARP Packet Format \\
                 ARP Examples \\
                 Proxy ARP \\
                 Gratuitous ARP \\
                 arp Command \\
                 Summary \\
                 RARP: Reverse Address Resolution Protocol \\
                 Introduction \\
                 RARP Packet Format \\
                 RARP Examples \\
                 RARP Server Design \\
                 Summary \\
                 ICMP: Internet Control Message Protocol \\
                 Introduction \\
                 ICMP Message Types \\
                 ICMP Address Mask Request and Reply \\
                 ICMP Timestamp Request and Reply \\
                 ICMP Port Unreachable Error \\
                 4.4BSD Processing of ICMP Messages \\
                 Summary \\
                 Ping Program \\
                 Introduction \\
                 Ping Program \\
                 IP Record Route Option \\
                 IP Timestamp Option \\
                 Summary \\
                 Traceroute Program \\
                 Introduction \\
                 Traceroute Program Operation \\
                 LAN Output \\
                 WAN Output \\
                 IP Source Routing Option \\
                 Summary \\
                 IP Routing \\
                 Introduction \\
                 Routing Principles \\
                 CMP Host and Network Unreachable Errors \\
                 To Forward or Not to Forward \\
                 ICMP Redirect Errors \\
                 ICMP Router Discovery Messages \\
                 Summary \\
                 Dynamic Routing Protocols \\
                 Introduction \\
                 Dynamic Routing \\
                 Unix Routing Daemons \\
                 RIP: Routing Information Protocol \\
                 RIP Version 2 \\
                 OSPF: Open Shortest Path First \\
                 BGP: Border Gateway Protocol \\
                 CIDR: Classless Interdomain Routing \\
                 Summary \\
                 UDP: User Datagram Protocol \\
                 Introduction \\
                 UDP Header \\
                 UDP Checksum \\
                 A Simple Example \\
                 IP Fragmentation \\
                 ICMP Unreachable Error (Fragmentation Required) \\
                 Determining the Path MTU Using Traceroute \\
                 Path MTU Discovery with UDP \\
                 Interaction Between UDP and ARP \\
                 Maximum UDP Datagram Size \\
                 ICMP Source Quench Error \\
                 UDP Server Design \\
                 Summary \\
                 Broadcasting and Multicasting \\
                 Introduction \\
                 Broadcasting \\
                 Broadcasting Examples \\
                 Multicasting \\
                 Summary \\
                 IGMP: Internet Group Management Protocol",
}

@Book{Stevens:1996:TII,
  author =       "W. Richard Stevens",
  title =        "{TCP\slash IP} Illustrated, Volume 3: {TCP} for
                 Transactions, {HTTP}, {NNTP}, and the {UNIX Domain
                 Protocols}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xix + 328",
  year =         "1996",
  ISBN =         "0-201-63495-3",
  ISBN-13 =      "978-0-201-63495-2",
  LCCN =         "TK5105.55.S74 1994",
  MRclass =      "68M10, 68-01, 68N25",
  bibdate =      "Mon Sep 23 09:00:31 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/internet.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$41.47",
  series =       "Addison-Wesley Professional Computing Series",
  abstract =     "The \booktitle{TCP/IP Illustrated} books are praised
                 for their highly effective visual approach to the
                 essential TCP/IP topics facing today's networking
                 professionals. The word `illustrated' distinguishes
                 these books from the rest. By forcing conditions to
                 occur, and then displaying the results,
                 \booktitle{TCP/IP Illustrated} gives readers a much
                 greater understanding of the concepts than words alone
                 can provide. The books are noted for their diagrams and
                 clear and readable writing style, and include
                 unparalleled TCP/IP material needed by any networking
                 professional.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Volume One \\
                 1: Introduction \\
                 2: Link Layer \\
                 3: IP: Internet Protocol \\
                 4: ARP: Address Resolution Protocol \\
                 5: RARP: Reverse Address Resolution Protocol \\
                 6: ICMP: Internet Control Message Protocol \\
                 7: Ping Program \\
                 8: Traceroute Program \\
                 9: IP Routing \\
                 10: Dynamic Routing Protocols \\
                 11: UDP: User Datagram Protocol \\
                 12: Broadcasting and Multicasting \\
                 13: IGMP: Internet Group Management Protocol \\
                 14: DNS: The Domain Name System \\
                 15: TFTP: Trivial File Transfer Protocol \\
                 16: BOOTP: Bootstrap Protocol \\
                 17: TCP: Transmission Control Protocol \\
                 18: TCP Connection Establishment and Termination \\
                 19: TCP Interactive Data Flow \\
                 20: TCP Bulk Data Flow \\
                 21: TCP Timeout and Retransmission \\
                 22: TCP Persist Timer \\
                 23: TCP Keepalive Timer \\
                 24: TCP Futures and Performance \\
                 25: SNMP: Simple Network Management Protocol \\
                 26: Telnet and Rlogin: Remote Login \\
                 27: FTP: File Transfer Protocol \\
                 28: SMTP: Simple Mail Transfer Protocol \\
                 29: NFS: Network File System \\
                 30: Other TCP/IP Applications \\
                 Volume Two: The implementation \\
                 Volume Three: TCP for transactions, HTTP, NNTP, and the
                 UNIX domain protocols",
}

@Book{Stevens:1998:UNP,
  author =       "W. Richard Stevens",
  title =        "{UNIX} Network Programming: Networking {APIs}: Sockets
                 and {XTI}",
  volume =       "1",
  publisher =    pub-PHPTR,
  address =      pub-PHPTR:adr,
  edition =      "Second",
  pages =        "xx + 1009",
  year =         "1998",
  ISBN =         "0-13-490012-X",
  ISBN-13 =      "978-0-13-490012-4",
  LCCN =         "QA76.76.O63S755 1998",
  bibdate =      "Tue Dec 13 05:45:21 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/internet.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$59.00",
  URL =          "http://www.phptr.com/ptrbooks/ptr_013490012X.html",
  acknowledgement = ack-nhfb,
}

@Book{Stevens:1999:UNP,
  author =       "W. Richard Stevens",
  title =        "{UNIX} Network Programming, Interprocess
                 Communications",
  volume =       "2",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  edition =      "Second",
  pages =        "xvii + 558",
  year =         "1999",
  ISBN =         "0-13-081081-9 (hardcover)",
  ISBN-13 =      "978-0-13-081081-6 (hardcover)",
  LCCN =         "QA76.76.O63S755 1998",
  bibdate =      "Tue Dec 13 05:45:50 2005",
  bibsource =    "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/unix.bib",
  price =        "US\$54.00",
  URL =          "http://www.phptr.com/ptrbooks/ptr_0130810819.html",
  abstract =     "Well-implemented interprocess communications (IPC) are
                 key to the performance of virtually every non-trivial
                 UNIX program. In \booktitle{UNIX Network Programming},
                 Volume 2, Second Edition, legendary UNIX expert W.
                 Richard Stevens presents a comprehensive guide to every
                 form of IPC, including message passing,
                 synchronization, shared memory, and Remote Procedure
                 Calls (RPC). Stevens begins with a basic introduction
                 to IPC and the problems it is intended to solve.
                 Step-by-step you'll learn how to maximize both System V
                 IPC and the new POSIX standards, which offer dramatic
                 improvements in convenience and performance.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Introduction \\
                 Message passing \\
                 Synchronization \\
                 Shared memory \\
                 Remote procedure calls",
}

@Book{Stevens:2004:UNP,
  author =       "W. Richard Stevens and Bill Fenner and Andrew M.
                 Rudoff",
  title =        "{UNIX} Network Programming: The Sockets Networking
                 {API}",
  volume =       "1",
  publisher =    pub-PHPTR,
  address =      pub-PHPTR:adr,
  edition =      "Third",
  pages =        "xxiii + 991",
  year =         "2004",
  ISBN =         "0-13-141155-1 (hardcover)",
  ISBN-13 =      "978-0-13-141155-5 (hardcover)",
  LCCN =         "QA76.76 .O63 S75 2004",
  bibdate =      "Wed Dec 31 13:49:08 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  price =        "US\$69.99",
  abstract =     "Building on the legendary work of W. Richard Stevens,
                 this edition has been fully updated by two leading
                 network programming experts to address today's most
                 crucial standards, implementations, and techniques. New
                 topics include: --- POSIX Single UNIX Specification
                 Version 3 --- IPv6 APIs (including updated guidance on
                 IPv6/IPv4 interoperability) --- The new SCTP transport
                 protocol --- IPsec-based Key Management Sockets ---
                 FreeBSD 4.8/5.1, Red Hat Linux 9.x, Solaris 9, AIX 5.x,
                 HP-UX, and Mac OS X implementations --- New network
                 program debugging techniques --- Source Specific
                 Multicast API, the key enabler for widespread IP
                 multicast deployment. The authors also update and
                 extend Stevens' definitive coverage of these crucial
                 UNIX networking standards and techniques: --- TCP and
                 UDP transport Sockets: elementary, advanced, routed,
                 and raw --- I/O: multiplexing, advanced functions,
                 nonblocking, and signal-driven --- Daemons and inetd
                 UNIX domain protocols ioctl operations --- Broadcasting
                 and multicasting Threads --- Streams --- Design: TCP
                 iterative, concurrent, preforked, and prethreaded
                 servers. Since 1990, network programmers have turned to
                 one source for the insights and techniques they need:
                 W. Richard Stevens' UNIX Network Programming. Now,
                 there's an edition specifically designed for today's
                 challenges and tomorrow's.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1. Introduction \\
                 2. The Transport Layer: TCP, UDP, and SCTP \\
                 3. Sockets Introduction \\
                 4. Elementary TCP Sockets \\
                 5. TCP Client/Server Example \\
                 6. I/O Multiplexing: The select and poll Functions \\
                 7. Socket options \\
                 8. Elementary UDP Sockets \\
                 9. Elementary SCTP Sockets \\
                 10. SCTP Client/Server Example \\
                 11. Name and Address Conversions \\
                 12. IPv4 and IPv6 Interoperability \\
                 13. Daemon Processes and the inetd Superserver \\
                 14. Advanced I/O Functions \\
                 15. Unix Domain Protocols \\
                 16. Nonblocking I/O \\
                 17. IOCtl Operations \\
                 18. Routing Sockets \\
                 19. Key Management Sockets \\
                 20. Broadcasting \\
                 21. Multicasting \\
                 22. Advanced UDP Sockets \\
                 23. Advanced SCTP Sockets \\
                 24. Out-of-Band Data \\
                 25. Signal-Driven I/O \\
                 26. Threads \\
                 27. IP Options \\
                 28. Raw Sockets \\
                 29. Datalink Access \\
                 30. Client/Server Design Alternatives \\
                 31. Streams \\
                 Volume 1: The sockets networking API \\
                 Volume 2: Interprocess communications",
}

@Book{Stevens:2005:APU,
  author =       "W. Richard Stevens and Stephen A. Rago",
  title =        "Advanced Programming in the {Unix} Environment",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Second",
  pages =        "xxviii + 927",
  year =         "2005",
  ISBN =         "0-201-43307-9 (hardcover), 0-321-52594-9",
  ISBN-13 =      "978-0-201-43307-4 (hardcover), 978-0-321-52594-9",
  LCCN =         "QA76.76.O63 S754 2005",
  bibdate =      "Tue Jul 19 14:11:18 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "ftp://uiarchive.cso.uiuc.edu/pub/etext/gutenberg/;
                 http://www.aw-bc.com/catalog/academic/product/0,1144,0201433079,00.html;
                 http://www.loc.gov/catdir/toc/ecip059/2005007943.html",
  abstract =     "Stephen Rago's update is a long overdue benefit to the
                 community of professionals using the versatile family
                 of UNIX and UNIX-like operating environments. It
                 removes obsolescence and includes newer developments.
                 It also thoroughly updates the context of all topics,
                 examples, and applications to recent releases of
                 popular implementations of UNIX and UNIX-like
                 environments. And yet, it does all this while retaining
                 the style and taste of the original classic. --- Mukesh
                 Kacker, cofounder and former CTO of Pronto Networks,
                 Inc. One of the essential classics of UNIX programming.
                 --- Eric S. Raymond, author of \booktitle{The Art of
                 UNIX Programming} This is the definitive reference book
                 for any serious or professional UNIX systems
                 programmer. Rago has updated and extended the classic
                 Stevens text while keeping true to the original. The
                 APIs are illuminated by clear examples of their use. He
                 also mentions many of the pitfalls to look out for when
                 programming across different UNIX system
                 implementations and points out how to avoid these
                 pitfalls using relevant standards such as POSIX 1003.1,
                 2004 edition and the Single UNIX Specification, Version
                 3. --- Andrew Josey, Director, Certification, The Open
                 Group, and Chair of the POSIX 1003.1 Working Group
                 \booktitle{Advanced Programming in the UNIX
                 Environment}, Second Edition, is an essential reference
                 for anyone writing programs for a UNIX system. It's the
                 first book I turn to when I want to understand or
                 re-learn any of the various system interfaces. Stephen
                 Rago has successfully revised this book to incorporate
                 newer operating systems such as GNU/Linux and Apple's
                 OS X while keeping true to the first edition in terms
                 of both readability and usefulness. It will always have
                 a place right next to my computer. --- Dr. Benjamin
                 Kuperman, Swarthmore College Praise for the First
                 Edition \booktitle{Advanced Programming in the UNIX
                 Environment} is a must-have for any serious C
                 programmer who works under UNIX. Its depth,
                 thoroughness, and clarity of explana-tion are
                 unmatched. --- UniForum Monthly Numerous readers
                 recommended \booktitle{Advanced Programming in the UNIX
                 Environment} by W. Richard Stevens (Addison-Wesley),
                 and I'm glad they did; I hadn't even heard of this
                 book, and it's been out since 1992. I just got my hands
                 on a copy, and the first few chapters have been
                 fascinating. -- Open Systems Today A much more readable
                 and detailed treatment of UNIX internals can be found
                 in \booktitle{Advanced Programming in the UNIX
                 Environment} by W. Richard Stevens (Addison-Wesley).
                 This book includes lots of realistic examples, and I
                 find it quite helpful when I have systems programming
                 tasks to do. --- RS/Magazine This is the definitive
                 reference book for any serious or professional UNIX
                 systems programmer. Rago has updated and extended the
                 original Stevens classic while keeping true to the
                 original. --- Andrew Josey, Director, Certification,
                 The Open Group, and Chair of the POSIX 1003.1 Working
                 Group. For over a decade, serious C programmers have
                 relied on one book for practical, in-depth knowledge of
                 the programming interfaces that drive the UNIX and
                 Linux kernels: W. Richard Stevens' \booktitle{Advanced
                 Programming in the UNIX Environment}. Now, Stevens'
                 colleague Stephen Rago has thoroughly updated this
                 classic to reflect the latest technical advances and
                 add support for today's leading UNIX and Linux
                 platforms. Rago carefully retains the spirit and
                 approach that made this book a classic. Building on
                 Stevens' work, he begins with basic topics such as
                 files, directories, and processes, carefully laying the
                 groundwork for understanding more advanced techniques,
                 such as signal handling and terminal I/O. Substantial
                 new material includes chapters on threads and
                 multithreaded programming, using the socket interface
                 to drive interprocess communication (IPC), and
                 extensive coverage of the interfaces added to the
                 latest version of the POSIX.1 standard. Nearly all
                 examples have been tested on four of today's most
                 widely used UNIX/Linux platforms: FreeBSD 5.2.1; the
                 Linux 2.4.22 kernel; Solaris 9; and Darwin 7.4.0, the
                 FreeBSD/Mach hybrid underlying Apple's Mac OS X 10.3.
                 As in the first edition, you'll learn through example,
                 including more than 10,000 lines of downloadable, ANSI
                 C source code. More than 400 system calls and functions
                 are demonstrated with concise, complete programs that
                 clearly illustrate their usage, arguments, and return
                 values. To tie together what you've learned, the book
                 presents several chapter-length case studies, each
                 fully updated for contemporary environments.
                 \booktitle{Advanced Programming in the UNIX
                 Environment} has helped a generation of programmers
                 write code with exceptional power, performance, and
                 reliability. Now updated for today's UNIX/Linux
                 systems, this second edition will be even more
                 indispensable.",
  acknowledgement = ack-nhfb,
  subject =      "Operating systems (Computers); UNIX (Computer file)",
  tableofcontents = "1. UNIX system overview \\
                 2. UNIX standardization and implementations \\
                 3. File I/O \\
                 4. Files and directories \\
                 5. Standard I/O library \\
                 6. System data files and information \\
                 7. Process environment \\
                 8. Process control \\
                 9. Process relationships \\
                 10. Signals \\
                 11. Threads \\
                 12. Thread control \\
                 13. Daemon processes \\
                 14. Advanced I/O \\
                 15. Interprocess communication \\
                 16. Network IPC: sockets \\
                 17. Advanced IPC \\
                 18. Terminal I/O \\
                 19. Pseudo terminals \\
                 20. A database library \\
                 21. Communicating with a network printer \\
                 Appendix A. Function prototypes \\
                 Appendix B. Miscellaneous source code \\
                 Appendix C. Solutions to selected exercises",
}

@Article{Stevenson:COMPUTER-14-3-51,
  author =       "David Stevenson",
  title =        "A Proposed Standard for Binary Floating-Point
                 Arithmetic",
  journal =      j-COMPUTER,
  volume =       "14",
  number =       "3",
  pages =        "51--62",
  month =        mar,
  year =         "1981",
  bibdate =      "Sun May 2 07:54:17 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See \cite{IEEE:p754}.",
  acknowledgement = ack-nhfb,
}

@Book{Stewart:1973:IMC,
  author =       "G. W. (Gilbert W.) Stewart",
  title =        "Introduction to Matrix Computations",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "xiii + 441",
  year =         "1973",
  ISBN =         "0-12-670350-7",
  ISBN-13 =      "978-0-12-670350-4",
  LCCN =         "QA188 .S71 1973",
  MRclass =      "65FXX",
  MRnumber =     "0458818 (56 \#17018)",
  MRreviewer =   "James H. Wilkinson",
  bibdate =      "Sun Nov 23 10:56:10 MST 2014",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/s/stewart-gilbert-w.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/bibnet/subjects/han-wri-mat-sci-2ed.bib;
                 https://www.math.utah.edu/pub/bibnet/subjects/matrix-analysis-2ed.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Computer Science and Applied Mathematics, Editor:
                 Werner Rheinboldt",
  URL =          "http://catalog.hathitrust.org/api/volumes/oclc/658076.html;
                 http://catdir.loc.gov/catdir/description/els031/72082636.html;
                 http://catdir.loc.gov/catdir/toc/els031/72082636.html;
                 http://www.gbv.de/dms/hbz/toc/ht000832348.pdf;
                 http://www.loc.gov/catdir/description/els031/72082636.html;
                 http://www.loc.gov/catdir/toc/els031/72082636.htmlQ",
  acknowledgement = ack-njh # " and " # ack-nhfb # " and " # ack-rah,
  GWS-number =   "B1",
  subject =      "Matrices; Data processing",
  tableofcontents = "Preface / ix \\
                 Acknowledgments / xiii \\
                 1. Preliminaries \\
                 \\
                 1. The Space $R^n$ / 2 \\
                 2. Linear Independence, Subspaces, and Bases / 9 \\
                 3. Matrices / 20 \\
                 4. Operations with Matrices / 29 \\
                 5. Linear Transformations and Matrices / 46 \\
                 6. Linear Equations and Inverses / 54 \\
                 7. A Matrix Reduction and Some Consequences / 63 \\
                 \\
                 2. Practicalities \\
                 \\
                 1. Errors, Arithmetic, and Stability / 69 \\
                 2. An Informal Language / 83 \\
                 3. Coding Matrix Operations / 93 \\
                 3. The Direct Solution of Linear Systems \\
                 \\
                 1. Triangular Matrices and Systems / 106 \\
                 2. Gaussian Elimination / 113 \\
                 3. Triangular Decomposition / 131 \\
                 4. The Solution of Linear Systems / 144 \\
                 5. The Effects of Rounding Error / 148 \\
                 \\
                 4. Norms, Limits, and Condition Numbers \\
                 \\
                 1. Norms and Limits / 161 \\
                 2. Matrix Norms / 173 \\
                 3. Inverses of Perturbed Matrices / 184 \\
                 4. The Accuracy of Solutions of Linear Systems / 192
                 \\
                 5. Iterative Refinement of Approximate Solutions of
                 Linear Systems / 200 \\
                 \\
                 5. The Linear Least Squares Problem \\
                 1. Orthogonality / 209 \\
                 2. The Linear Least Squares Problem / 217 \\
                 3. Orthogonal Triangularization / 230 \\
                 4. The Iterative Refinement of Least Squares Solutions
                 / 245 \\
                 \\
                 6. Eigenvalues and Eigenvectors \\
                 \\
                 1. The Space $\mathbb{C}^n$ / 251 \\
                 2. Eigenvalues and Eigenvectors / 262 \\
                 3. Reduction of Matrices by Similarity Transformations
                 / 275 \\
                 4. The Sensitivity of Eigenvalues and Eigenvectors /
                 289 \\
                 5. Hermitian Matrices / 307 \\
                 6. The Singular Value Decomposition / 317 \\
                 \\
                 7. The $QR$ Algorithm \\
                 \\
                 1. Reduction to Hessenberg and Tridiagonal Forms / 328
                 \\
                 2. The Power and Inverse Power Methods / 340 \\
                 3. The Explicitly Shifted $QR$ Algorithm / 351 \\
                 4. The Implicitly Shifted $QR$ Algorithm / 368 \\
                 5. Computing Singular Values and Vectors / 381 \\
                 6. The Generalized Eigenvalue Problem $A - \lambda B$ /
                 387 \\
                 \\
                 Appendix 1. The Greek Alphabet and Latin Notational
                 Correspondents / 395 \\
                 \\
                 Appendix 2. Determinants / 396 \\
                 Appendix 3. Rounding-Error Analysis of Solution of
                 Triangular Systems and of Gaussian Elimination / 405
                 \\
                 \\
                 Appendix 4. Of Things Not Treated / 413 \\
                 Bibliography / 417 \\
                 Index of Notation / 425 \\
                 Index of Algorithms / 427 \\
                 Index / 429",
}

@Book{Stewart:2016:CCH,
  author =       "Ian Stewart",
  title =        "Calculating the Cosmos: How Mathematics Unveils the
                 Universe",
  publisher =    pub-BASIC-BOOKS,
  address =      pub-BASIC-BOOKS:adr,
  pages =        "346 + 8",
  year =         "2016",
  ISBN =         "1-5416-1725-8 (paperback)",
  ISBN-13 =      "978-1-5416-1725-4 (paperback)",
  LCCN =         "QB981 .S82 2018",
  bibdate =      "Wed Jan 2 08:15:04 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",
  abstract =     "In \booktitle{Calculating the Cosmos}, Ian Stewart
                 presents an exhilarating guide to the cosmos, from our
                 solar system to the entire universe. He describes the
                 architecture of space and time, dark matter and dark
                 energy, how galaxies form, why stars implode, how
                 everything began, and how it's all going to end. He
                 considers parallel universes, the fine-tuning of the
                 cosmos for life, what forms extraterrestrial life might
                 take, and the likelihood of life on Earth being snuffed
                 out by an asteroid. Beginning with the Babylonian
                 integration of mathematics into the study of astronomy
                 and cosmology, Stewart traces the evolution of our
                 understanding of the cosmos: How Kepler's laws of
                 planetary motion led Newton to formulate his theory of
                 gravity. How, two centuries later, tiny irregularities
                 in the motion of Mars inspired Einstein to devise his
                 general theory of relativity. How, eighty years ago,
                 the discovery that the universe is expanding led to the
                 development of the Big Bang theory of its origins. How
                 single-point origin and expansion led cosmologists to
                 theorize new components of the universe, such as
                 inflation, dark matter, and dark energy. But does
                 inflation explain the structure of today's universe?
                 Does dark matter actually exist? Could a scientific
                 revolution that will challenge the long-held scientific
                 orthodoxy and once again transform our understanding of
                 the universe be on the way? In an exciting and engaging
                 style, \booktitle{Calculating the Cosmos} is a
                 mathematical quest through the intricate realms of
                 astronomy and cosmology.",
  acknowledgement = ack-nhfb,
  author-dates = "1945--",
  subject =      "Cosmology; Mathematics; Astronomy; Mathematics",
  tableofcontents = "Prologue / \\
                 1: Attraction at a distance / 11 \\
                 2: Collapse of the solar nebula / 27 \\
                 3: Inconstant Moon / 50 \\
                 4: The clockwork cosmos / 54 \\
                 5: Celestial police / 70 \\
                 6: The planet that swallowed its children / 84 \\
                 7: Cosimo's stars / 96 \\
                 8: Off on a comet / 106 \\
                 9: Chaos in the cosmos / 119 \\
                 10: The interplanetary superhighway / 117 \\
                 11: Great balls of fire / 150 \\
                 12: Great sky river / 172 \\
                 13: Alien worlds / 187 \\
                 14: Dark stars / 207 \\
                 15: Skeins and voids / 226 \\
                 16: The cosmic egg / 241 \\
                 17: The big blow-up / 251 \\
                 18: The dark side / 262 \\
                 19: Outside the universe / 277 \\
                 Epilogue / 295 \\
                 Units and Jargon / 299 \\
                 Notes and References / 304 \\
                 Picture Credits / 321 \\
                 Index / 323",
}

@TechReport{Stibitz:1940:C,
  author =       "G. R. Stibitz",
  title =        "Computer",
  type =         "Unpublished memorandum",
  institution =  "Bell Telephone Laboratories",
  address =      "New York, NY, USA",
  year =         "1940",
  bibdate =      "Wed Oct 13 11:30:38 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Reprinted in \cite[\S 6.1]{Randell:1982:ODC}.",
  acknowledgement = ack-nhfb,
}

@Book{Stiddard:1975:ELS,
  author =       "M. H. B. Stiddard",
  title =        "The Elementary Language of Solid State Physics",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "xii + 188",
  year =         "1975",
  ISBN =         "0-12-671050-3",
  ISBN-13 =      "978-0-12-671050-2",
  LCCN =         "QC176.S783",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Stokes:2007:IMI,
  author =       "Jon Stokes",
  title =        "Inside the Machine: an Illustrated Introduction to
                 Microprocessors and Computer Architecture",
  publisher =    pub-NO-STARCH,
  address =      pub-NO-STARCH:adr,
  pages =        "xx + 292",
  year =         "2007",
  ISBN =         "1-59327-104-2",
  ISBN-13 =      "978-1-59327-104-6",
  LCCN =         "TK7895.M5 S76 2007",
  bibdate =      "Mon May 5 13:05:48 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 melvyl.cdlib.org:210/CDL90",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0715/2005037262-d.html;
                 http://www.loc.gov/catdir/toc/ecip065/2005037262.html",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Computer architecture; Microprocessors; Design and
                 construction",
  tableofcontents = "Basic computing concepts \\
                 The mechanics of program execution \\
                 Pipelined execution \\
                 Superscalar execution \\
                 The Intel Pentium and Pentium Pro \\
                 PowerPC processors: 600 series, 700 series, and 7400
                 \\
                 Intel's Pentium 4 vs Motorola's G4e: approaches and
                 design philosophies \\
                 Intel's Pentium 4 vs Motorola's G4e: the back end \\
                 64-bit computing and x86-64 \\
                 The G5: IBM's Power PC 970 \\
                 Understanding caching and performance \\
                 Intel's Pentium M, Core Duo, and Core Duo 2",
}

@Book{Stoll:1989:CET,
  author =       "Clifford Stoll",
  title =        "The Cuckoo's Egg: Tracking a Spy Through the Maze of
                 Computer Espionage",
  publisher =    pub-DOUBLEDAY,
  address =      pub-DOUBLEDAY:adr,
  pages =        "vi + 326",
  year =         "1989",
  ISBN =         "0-385-24946-2, 0-307-81942-6 (e-book), 0-7434-1145-5,
                 0-7434-1146-3, 1-299-04734-3",
  ISBN-13 =      "978-0-385-24946-1, 978-0-307-81942-0 (e-book),
                 978-0-7434-1145-5, 978-0-7434-1146-2,
                 978-1-299-04734-1",
  LCCN =         "UB271.R92 H477 1989; UB271.R92 H4771 1989; UB271.R92
                 S47 1989",
  bibdate =      "Thu Apr 1 15:18:18 MDT 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography.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/unix.bib;
                 melvyl.cdlib.org:210/CDL90",
  price =        "US\$18.95",
  URL =          "http://vxer.org/lib/pdf/The%20Cuckoo%27s%20Egg.pdf",
  abstract =     "This is the true story of how a systems manager at
                 Lawrence Berkeley Lab singlehandedly tracked down and
                 helped capture a computer hacker who had been breaking
                 into U.S. computer systems and stealing sensitive
                 military and security information.",
  acknowledgement = ack-nhfb,
  remark =       "A fascinating real story on computer espionage. A good
                 alternative to this is \cite{Hafner:1991:COH}.",
  subject =      "Stoll, Clifford; Hess, Marcus; espionage, Soviet;
                 United States; Germany; Hannover; defense information,
                 classified; databases; computer crimes",
}

@Book{Stoll:1999:HTH,
  author =       "Clifford Stoll",
  title =        "High Tech Heretic: Why Computers Don't Belong in the
                 Classroom and Other Reflections by a Computer
                 Contrarian",
  publisher =    pub-DOUBLEDAY,
  address =      pub-DOUBLEDAY:adr,
  pages =        "xv + 221",
  year =         "1999",
  ISBN =         "0-385-48975-7",
  ISBN-13 =      "978-0-385-48975-1",
  LCCN =         "LB1028.5 .S77 1999",
  bibdate =      "Thu Sep 21 10:07:03 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/internet.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$24.95",
  abstract =     "Argues that students are missing out on learning
                 fundamental skills because of the emphasis on becoming
                 computer literate.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "Why computers don't belong in the classroom \\
                 A literate Luddite? \\
                 Makes learning fun \\
                 The hidden price of computers \\
                 Loony for laptops \\
                 Multimedia comics \\
                 CRTs for tots \\
                 A question of balance \\
                 Calculating against calculators \\
                 Education by e-mail \\
                 Cyberschool \\
                 The computer contrarian \\
                 Arrogance of the techies \\
                 Software guinea pigs \\
                 The tyranny of the ugly computer \\
                 ``Information is power'' \\
                 Help! I'm stuck at a help desk! \\
                 The connected library \\
                 Planned obsolescence \\
                 New uses for your old computer \\
                 The plague of PowerPoint \\
                 Junk food and the Internet: the economics of
                 information \\
                 Rule number two \\
                 Isolated by the Internet \\
                 All truth",
}

@Book{Stone:2013:EQQ,
  author =       "A. Douglas Stone",
  title =        "{Einstein} and the quantum: the quest of the valiant
                 {Swabian}",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "x + 332",
  year =         "2013",
  ISBN =         "0-691-13968-7 (hardcover), 1-4008-4834-2 (e-book),
                 1-299-87423-1 (e-book)",
  ISBN-13 =      "978-0-691-13968-5 (hardcover)",
  LCCN =         "QC16.E5 S76 2013",
  bibdate =      "Mon Nov 4 09:49:38 MST 2013",
  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://www.npr.org/2013/11/01/242356997/einsteins-real-breakthrough-quantum-theory",
  abstract =     "\booktitle{Einstein and the Quantum} reveals for the
                 first time the full significance of Albert Einstein's
                 contributions to quantum theory. Einstein famously
                 rejected quantum mechanics, observing that God does not
                 play dice. But, in fact, he thought more about the
                 nature of atoms, molecules, and the emission and
                 absorption of light --- the core of what we now know as
                 quantum theory --- than he did about relativity. A
                 compelling blend of physics, biography, and the history
                 of science, \booktitle{Einstein and the Quantum} shares
                 the untold story of how Einstein --- not Max Planck or
                 Niels Bohr --- was the driving force behind early
                 quantum theory. It paints a vivid portrait of the
                 iconic physicist as he grappled with the apparently
                 contradictory nature of the atomic world, in which its
                 invisible constituents defy the categories of classical
                 physics, behaving simultaneously as both particle and
                 wave. And it demonstrates how Einstein's later work on
                 the emission and absorption of light, and on atomic
                 gases, led directly to Erwin Schr{\"o}dinger's
                 breakthrough to the modern form of quantum mechanics.
                 The book sheds light on why Einstein ultimately
                 renounced his own brilliant work on quantum theory, due
                 to his deep belief in science as something objective
                 and eternal. A book unlike any other, Einstein and the
                 Quantum offers a completely new perspective on the
                 scientific achievements of the greatest intellect of
                 the twentieth century, showing how Einstein's
                 contributions to the development of quantum theory are
                 more significant, perhaps, than even his legendary work
                 on relativity.",
  acknowledgement = ack-nhfb,
  subject =      "Einstein, Albert; Physicists; Biography; Quantum
                 theory; Science; History; SCIENCE / Physics; SCIENCE /
                 Quantum Theory; BIOGRAPHY and AUTOBIOGRAPHY / Science
                 and Technology; SCIENCE / History.",
  subject-dates = "1879--1955",
  tableofcontents = "Acknowledgments / ix \\
                 Introduction: A Hundred Times More Than Relativity
                 Theory / 1 \\
                 1: `An Act of Desperation' / 5 \\
                 2: The Impudent Swabian / 15 \\
                 3: The Gypsy Life / 21 \\
                 4: Two Pillars of Wisdom / 26 \\
                 5: The Perfect Instruments of the Creator / 36 \\
                 6: More Heat Than Light / 44 \\
                 7: Difficult Counting / 51 \\
                 8: Those Fabulous Molecules / 62 \\
                 9: Tripping the Light Heuristic / 70 \\
                 10: Entertaining the Contradiction / 80 \\
                 11: Stalking the Planck / 86 \\
                 12: Calamity Jeans / 94 \\
                 13: Frozen Vibrations / 103 \\
                 14: Planck's Nobel Nightmare / 111 \\
                 15: Joining the Union / 122 \\
                 16: Creative Fusion / 129 \\
                 17: The Importance of Being Nernst / 141 \\
                 18: Lamenting the Ruins / 149 \\
                 19: A Cosmic Interlude / 160 \\
                 20: Bohr's Atomic Sonata / 168 \\
                 21: Relying on Chance / 181 \\
                 22: Chaotic Ghosts / 193 \\
                 23: Fifteen Million Minutes of Fame / 204 \\
                 24: The Indian Comet / 215 \\
                 25: Quantum Dice / 228 \\
                 26: The Royal Marriage: $ E = m c^2 = h \nu $ / 241 \\
                 27: The Viennese Polymath / 254 \\
                 28: Confusion and Then Uncertainty / 268 \\
                 29: {\em Nicht diese T{\"o}ne} [Not these tones] / 279
                 \\
                 Appendix 1: The Physicists / 287 \\
                 Appendix 2: The Three Thermal Radiation Laws / 291 \\
                 Notes / 295 \\
                 References / 319 \\
                 Index / 325",
}

@Book{Strang:1986:PC,
  author =       "John Strang",
  title =        "Programming with {\tt curses}",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "76",
  year =         "1986",
  ISBN =         "0-937175-02-1",
  ISBN-13 =      "978-0-937175-02-6",
  LCCN =         "QA76.73.C15S78 1991",
  bibdate =      "Sat Oct 15 13:10:42 1994",
  bibsource =    "ftp://ftp.ora.com/pub/products/catalogs/book.catalog;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$12.95",
  URL =          "http://www.oreilly.com/catalog/curses",
  acknowledgement = ack-nhfb,
  tableofcontents = "Understanding windows \\
                 Terminal independence \\
                 The curses library \\
                 Sample program \\
                 Quick reference",
}

@Book{Strang:1986:RWT,
  author =       "John Strang",
  title =        "Reading and Writing {TERMCAP} Entries",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "73",
  year =         "1986",
  bibdate =      "Wed Dec 15 18:30:24 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Strang:1988:TT,
  author =       "John Strang and Linda Mui and Tim O'Reilly",
  title =        "{\tt termcap} \& {\tt terminfo}",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  edition =      "Third",
  pages =        "xv + 253",
  month =        apr,
  year =         "1988",
  ISBN =         "0-937175-22-6",
  ISBN-13 =      "978-0-937175-22-4",
  LCCN =         "QA76.76.O63 S765 1990; QA76.8.U65 S79 1988",
  bibdate =      "Tue Sep 13 11:59:48 MDT 1994",
  bibsource =    "ftp://ftp.ora.com/pub/products/catalogs/book.catalog;
                 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\$21.95",
  URL =          "http://www.oreilly.com/catalog/9780937175224;
                 http://www.oreilly.com/catalog/term",
  abstract =     "For UNIX system administrators and programmers. This
                 handbook provides information on writing and debugging
                 terminal descriptions, as well as terminal
                 initialization, for the two UNIX terminal databases.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Preface \\
                 What This Book Contains / xii \\
                 Typographic Conventions / xiv \\
                 Acknowledgements / xv \\
                 Tutorial \\
                 Introduction \\
                 The Coming of Termcap / 3 \\
                 The Coming of Terminfo / 6 \\
                 What Termcap and Terminfo Do and Don't Control / 8 \\
                 Reading Termcap and Terminfo Entries Where the Database
                 is Stored / 11 \\
                 Reading a Simple Entry / 14 \\
                 Complete Sample Termcap Entries / 20 \\
                 Complete Sample Terminfo Entries / 24 \\
                 More Termcap and Terminfo Syntax Terminal Naming
                 Conventions / 31 \\
                 Padding / 33 \\
                 Encoding Run Time Arguments / 37 \\
                 Termcap, Terminfo and the Shell Environment Variables /
                 46 \\
                 Default Terminal Type Specification / 48 \\
                 Setting TERM with tset / 50 \\
                 Initializing the Terminal with tset / 55 \\
                 Initializing the Terminal with tput / 56 \\
                 Using Terminfo Capabilities in Shell Programs / 57 \\
                 Writing Termcap and Terminfo Entries Strategies for
                 Obtaining Terminal Descriptions / 60 \\
                 Modifying an Entry / 63 \\
                 Creating an Entry From Scratch / 65 \\
                 Writing the Entry / 70 \\
                 Testing the New Entry / 73 \\
                 Installing a Finished Entry / 76 \\
                 Converting Between Termcap and Terminfo Converting From
                 Termcap to Terminfo: \\
                 captoinfo / 80 \\
                 Converting From Terminfo to Termcap: infocmp / 81 \\
                 Some Problems When Translating / 83 \\
                 Other Uses of infocmp / 84 \\
                 Comparing Termcap Entries 86 \\
                 Capability Reference \\
                 Introduction to the Capabilities Syntax Used in Part 2
                 / 92 \\
                 How to Read the Reference / 93 \\
                 Screen Dimensions and Cursor Movement Screen Dimensions
                 / 96 \\
                 Local Cursor Movement / 97 \\
                 Parameterized Local Cursor Movement / 100 \\
                 Absolute Cursor Movement / 101 \\
                 Scrolling / 104 \\
                 Miscellaneous Local Movements / 107 \\
                 Status Lines / 109 \\
                 Editing the Screen Adding to the Screen / 112 \\
                 Deleting From the Screen / 114 \\
                 Insert Mode / 118 \\
                 Initialization and Reset Termcap Initialization and
                 Reset / 123 \\
                 Terminfo Initialization and Reset / 125 \\
                 Program Initialization / 127 \\
                 Setting and Using Tabs / 129 \\
                 Margins / 132 \\
                 Special Effects Standout Mode / 134 \\
                 Underlining / 137 \\
                 Miscellaneous Highlight Modes and Alternate Character
                 Sets / 139 \\
                 Bells / 143 \\
                 Cursor Intensity / 144 \\
                 Special Keys Special Function Keys / 147 \\
                 Extended Function Key Definitions / 149 \\
                 Programmable Function Keys / 150 \\
                 Keypad Keys / 153 \\
                 Other Special Keyboard Keys / 155 \\
                 Extended Special Key Descriptions / 158 \\
                 Extended Special Key Descriptions (cont'd) / 159 \\
                 Non-Standard Control Characters / 161 \\
                 Padding and XON/XOFF Padding Capabilities / 163 \\
                 XON/XOFF Flow Control / 165 \\
                 Special Terminals Glitch Capabilities / 168 \\
                 Hardcopy Terminals / 172 \\
                 Terminals With Local Printers / 174 \\
                 Line Graphics / 176 \\
                 Meta Modes / 178 \\
                 Equivalent Terminals Equivalent Terminal / 180 \\
                 Disabling Capabilities / 181 \\
                 Miscellaneous Miscellaneous / 184 \\
                 Miscellaneous (obsolete) 189 \\
                 Appendices \\
                 Capabilities Used by vi / 193 \\
                 Accessing Termcap From a C Program: The Termcap Library
                 / 197 \\
                 Test Program / 201 \\
                 Accessing Terminfo From C Program: The Terminfo
                 Routines / 205 \\
                 Test Program / 209 \\
                 Capability Variable Names / 211 \\
                 List of Capabilities / 215 \\
                 Index / 235",
  xxpages =      "xv + 248",
}

@Book{Streitweiser:1961:MOT,
  author =       "Andrew {Streitweiser, Jr.}",
  title =        "Molecular Orbital Theory for Organic Chemists",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xvii + 489",
  year =         "1961",
  LCCN =         "QD255 .S77 1961",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Stringer:2013:LSH,
  author =       "Chris Stringer",
  title =        "Lone survivors: how we came to be the only humans on
                 earth",
  publisher =    "St. Martin's Griffin",
  address =      "New York, NY, USA",
  pages =        "xii + 320",
  year =         "2013",
  ISBN =         "1-250-02330-0, 1-4299-7344-7 (e-book)",
  ISBN-13 =      "978-1-250-02330-8, 978-1-4299-7344-1 (e-book)",
  LCCN =         "GN281 .S8746 2013",
  bibdate =      "Wed Oct 14 09:13:54 MDT 2015",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Outlines a reassessment of human evolution that draws
                 on recent fossil findings and challenges current
                 theories to say that humans coexisted and competed
                 across the African continent while exchanging genes,
                 tools, and behaviors.",
  acknowledgement = ack-nhfb,
  author-dates = "1947--",
  libnote =      "Not yet in my library.",
  remark =       "Originally published: The origin of our species.
                 London: Allen Lane, c2011.",
  subject =      "Human beings; Origin; Human evolution; Origin; Human
                 evolution; SCIENCE / Life Sciences / Evolution.",
  tableofcontents = "The big questions \\
                 Unlocking the past \\
                 What lies beneath \\
                 Finding the way forward \\
                 Behaving in a modern way: mind reading and symbols \\
                 Behaving in a modern way: technology and lifeways \\
                 Genes and DNA \\
                 Making a modern human \\
                 The past and future evolution of our species",
}

@Book{Stripp:1995:CBF,
  author =       "Alan Stripp",
  title =        "Code Breaker in the {Far East}",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  edition =      "Second",
  pages =        "xiv + 204",
  year =         "1995",
  ISBN =         "0-19-280386-7 (paperback), 0-19-285316-3",
  ISBN-13 =      "978-0-19-280386-3 (paperback), 978-0-19-285316-5",
  LCCN =         "D810.C88 S76 1989",
  bibdate =      "Thu Mar 24 03:53:54 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "\booktitle{Codebreaker in the Far East} is the first
                 book to describe how Bletchley Park and its Indian and
                 Far Eastern outposts broke a series of Japanese codes
                 and cipher systems of dazzling variety and complexity.
                 Their achievements made a major contribution to the
                 Allied victory in Burma, and probably helped to shorten
                 and win the war, perhaps by two or three years. Alan
                 Stripp gives his first-hand account of the excitement
                 of reading the enemy's mind, of working against the
                 clock, hampered by one of the world's most daunting
                 languages and the knowledge that they were facing an
                 unyielding and resourceful enemy who had never known
                 defeat.",
  acknowledgement = ack-nhfb,
  subject =      "Stripp, Alan; World War, 1939--1945; Cryptography;
                 World War, 1939--1945; Personal narratives, English;
                 World War, 1939--1945; Campaigns; Burma",
  subject-dates = "1924--",
  tableofcontents = "Introduction / Christopher Andrew \\
                 Tours of Duty \\
                 Cambridge, Bedford and Yorkshire \\
                 Bletchley Park \\
                 Marching Orders \\
                 Delhi \\
                 Naini Tal, Agra and Abbottabad \\
                 Bangalore, Singapore and Cambridge \\
                 Japanese Puzzles \\
                 Japanese Codes and Ciphers: what were they like? \\
                 What did they tell us? \\
                 How were they sent? \\
                 How were they intercepted? \\
                 How were they broken? \\
                 What is so special about signals intelligence? \\
                 Loose ends \\
                 Traffic analysis \\
                 The index \\
                 Interrogation \\
                 Japanese cryptographic security \\
                 The Japanese as codebreakers \\
                 The Japanese language \\
                 The Chinese Telegraphic Code \\
                 Japanese language courses \\
                 Cover-names \\
                 A Tangled Web \\
                 Clandestine Groups and their Signals \\
                 General Slim and Signals Intelligence \\
                 Phuket Island \\
                 Deception in the Burma Campaign",
}

@Book{Strogatz:2019:IPH,
  author =       "Steven Strogatz",
  title =        "Infinite Powers: How Calculus Reveals the Secrets of
                 the Universe",
  publisher =    "Houghton Mifflin Harcourt",
  address =      "Boston, MA, USA",
  pages =        "xxiii + 360",
  year =         "2019",
  ISBN =         "0-358-29928-4 (paperback), 1-328-87998-4 (hardcover),
                 1-328-88001-X (e-book)",
  ISBN-13 =      "978-0-358-29928-8 (paperback), 978-1-328-87998-1
                 (hardcover), 978-1-328-88001-7 (e-book)",
  LCCN =         "QA303.2 .S78 2019",
  bibdate =      "Sat Nov 19 08:56:35 MST 2022",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "This is the captivating story of mathematics' greatest
                 ever idea: calculus. Without it, there would be no
                 computers, no microwave ovens, no GPS, and no space
                 travel. But before it gave modern man almost infinite
                 powers, calculus was behind centuries of controversy,
                 competition, and even death. Taking us on a thrilling
                 journey through three millennia, professor Steven
                 Strogatz charts the development of this seminal
                 achievement from the days of Aristotle to today's
                 million-dollar reward that awaits whoever cracks
                 Reimann's hypothesis. Filled with idiosyncratic
                 characters from Pythagoras to Euler, Infinite Powers is
                 a compelling human drama that reveals the legacy of
                 calculus on nearly every aspect of modern civilization,
                 including science, politics, ethics, philosophy, and
                 much besides.",
  acknowledgement = ack-nhfb,
  subject =      "Archimedes; Archimedes; Archimedes; Calculus; History;
                 Differential calculus; Calcul infinit{\'e}simal;
                 Histoire; Calcul diff{\'e}rentiel; calculus; Calculus;
                 Differential calculus; Calculus; History; Differential
                 calculus",
  tableofcontents = "Introduction / vii \\
                 1: Infinity / 1 \\
                 2: The man who harnessed infinity / 27 \\
                 3: Discovering the laws of motion / 59 \\
                 4: The dawn of differential calculus / 89 \\
                 5: The crossroads / 123 \\
                 6: The vocabulary of change / 141 \\
                 7: The secret fountain / 167 \\
                 8: Fictions of the mind / 199 \\
                 9: The logical universe / 227 \\
                 10: Making waves / 249 \\
                 11: The future of calculus / 271\\
                 Conclusion / 295 \\
                 Acknowledgments / 303 \\
                 Illustration Credits / 307 \\
                 Notes / 309 \\
                 Bibliography / 333 \\
                 Index / 345",
}

@Book{Stroud:1974:NQS,
  author =       "A. H. Stroud",
  title =        "Numerical Quadrature and Solution of Ordinary
                 Differential Equations: a Textbook for a Beginning
                 Course in Numerical Analysis: Graduate Texts in
                 Mathematics",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xi + 338",
  year =         "1974",
  DOI =          "https://doi.org/10.1007/978-1-4612-6390-6",
  ISBN =         "0-387-90100-0",
  ISBN-13 =      "978-0-387-90100-8",
  LCCN =         "QA1 .A647 vol. 10",
  bibdate =      "Sat Dec 24 15:53:15 MST 2005",
  bibsource =    "Amazon;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Applied Mathematical Sciences Series",
  abstract =     "This is a textbook for a one semester course on
                 numerical analysis for senior undergraduate or
                 beginning graduate students with no previous knowledge
                 of the subject. The prerequisites are calculus, some
                 knowledge of ordinary differential equations, and
                 knowledge of computer programming using Fortran.
                 Normally this should be half of a two semester course,
                 the other semester covering numerical solution of
                 linear systems, inversion of matrices and roots of
                 polynomials. Neither semester should be a prerequisite
                 for the other. This would prepare the student for
                 advanced topics on numerical analysis such as partial
                 differential equations. We are philosophically opposed
                 to a one semester surveyor ``numerical methods'' course
                 which covers all of the above mentioned topics, plus
                 perhaps others, in one semester. We believe the student
                 in such a course does not learn enough about anyone
                 topic to develop an appreciation for it. For reference
                 Chapter I contains statements of results from other
                 branches of mathematics needed for the numerical
                 analysis. The instructor may have to review some of
                 these results. Chapter 2 contains basic results about
                 interpolation. We spend only about one week of a
                 semester on interpolation and divide the remainder of
                 the semester between quadrature and differential
                 equations. Most of the sections not marked with an *
                 can be covered in one semester. The sections marked
                 with an * are included as a guide for further study.",
  acknowledgement = ack-nhfb,
  category =     "Professional \& Technical; Professional Science;
                 Mathematics; Applied; Differential Equations",
  dateentered =  "2005-12-23",
  DEWEY =        "510/.8 s 515/.352",
  dimensions =   "26 cm.",
  idnumber =     "540",
  keywords =     "Differential equations --- Numerical solutions,
                 Numerical integration",
  libnote =      "Not in my library.",
  subject =      "Mathematics; Mathematics; Mathematics; Physical
                 Sciences and Mathematics; Mathematical Theory",
  tableofcontents = "1 Background Information \\
                 1.1 Significant figures and round-off error \\
                 1.2 Computers and floating-point arithmetic \\
                 1.3 Complex numbers \\
                 1.4 Inequalities for numbers \\
                 1.5 Convergence of a sequence of numbers \\
                 1.6 Polynomials and their roots \\
                 1.7 Systems of linear equations \\
                 1.8 The Vandermonde matrix \\
                 1.9 Continuous functions; piecewise continuous
                 functions \\
                 1.10 Mean value theorem and Rolle's theorem \\
                 1.11 Convergence of a sequence of functions \\
                 1.12 The chain rule for derivatives \\
                 1.13 Definite integrals and Riemann sums \\
                 1.14 Linear transformation of one interval onto another
                 \\
                 1.15 Change of variables in an integral \\
                 1.16 Mean value theorem for integrals \\
                 1.17 Inequalities for integrals \\
                 1.18 The class of functions $W^m[M_m; a, b]$ \\
                 1.19 The function $(x - t)_+^k$ \\
                 1.20 Taylor's formula with integral form of remainder
                 \\
                 1.21 Taylor's formula with usual form of remainder \\
                 1.22 Taylor's formula for functions of two variables
                 \\
                 1.23 Difference equations \\
                 1.24 Linear difference equations with constant
                 coefficients \\
                 1.25 Linear functional \\
                 1.26 Tri-diagonal linear systems \\
                 References for Chapter 1 \\
                 2 Interpolation \\
                 2.1 Existence of interpolating polynomials \\
                 2.2 Construction of the interpolating polynomial by
                 solution of a linear system \\
                 2.3 One form for the error in the interpolation \\
                 2.4 Convergence of a sequence of interpolations \\
                 2.5 The Weierstrass approximation theorem \\
                 2.6 Iterated interpolation \\
                 2.7 Peano estimates for the error in interpolation \\
                 2.8 Interpolation by rational functions \\
                 2.9 Interpolation by cubic spline functions \\
                 2.10 Additional reading \\
                 References for Chapter 2 \\
                 3 Quadrature \\
                 3.1 Introductory remarks and definitions \\
                 3.2 Existence of formulas exact for polynomials \\
                 3.3 Newton--Cotes formulas and their properties \\
                 3.4 Linear transformations of formulas \\
                 3.5 Repeated trapezoidal formula; repeated midpoint
                 formula; repeated Simpson's formula \\
                 3.6 Introduction to Gauss formulas \\
                 3.7 Orthogonal polynomials and their zeros \\
                 3.8 Existence of Gauss formulas \\
                 3.9 Convergence of a sequence of Gauss formulas for a
                 continuous integrand \\
                 3.10 Introduction to Romberg formulas \\
                 3.11 Romberg formulas and their properties \\
                 3.12 Peano error estimates for quadrature formulas \\
                 3.13 Gauss--Legendre formulas are Riemann sums \\
                 3.14 The merits of Gauss--Legendre formulas \\
                 3.15 Formulas exact for trigonometric polynomials \\
                 3.16 Numerical integration by rational extrapolation
                 \\
                 3.17 Numerical integration by cubic splines \\
                 3.18 Additional reading \\
                 References for Chapter 3 \\
                 4 Initial Value Problems for Ordinary Differential
                 Equations \\
                 4.1 Introduction \\
                 4.2 Taylor's series methods \\
                 4.3 Convergence of Taylor's series methods \\
                 4.4 Runge--Kutta methods \\
                 4.5 Derivation of Runge--Kutta methods \\
                 4.6 The need for automatic choice of stepsize; the
                 earth-moon-spaceship problem \\
                 4.7 Runge--Kutta methods with automatic choice of
                 stepsize; methods of Zonneveld \\
                 4.8 Explicit multistep methods or predictor methods \\
                 4.9 Implicit multistep methods or corrector methods \\
                 4.10 Practical use of corrector methods;
                 predictor-corrector methods \\
                 4.11 Stability of multistep methods for $y' = \lambda
                 y$ \\
                 4.12 Stability of multistep methods for general
                 equations \\
                 4.13 A method based on the midpoint formula and
                 rational extrapolation \\
                 4.14 Additional reading \\
                 References for Chapter 4 \\
                 Appendix A Tables of Orthogonal Polynomials \\
                 Appendix B Tables of Peano Error Constants for Various
                 Quadrature Formulas \\
                 Appendix C Tables of Quadrature Formulas \\
                 Index of Symbols",
}

@Book{Stroustrup:1986:CPL,
  author =       "Bjarne Stroustrup",
  title =        "The {C++} Programming Language",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "viii + 327",
  year =         "1986",
  ISBN =         "0-201-12078-X",
  ISBN-13 =      "978-0-201-12078-3",
  LCCN =         "QA76.73.C153 S77 1986",
  bibdate =      "Wed Dec 15 18:34:06 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  email =        "\path|bs@alice.uucp|",
  tableofcontents = "A tour of C++ \\
                 Declarations and constants \\
                 Expressions and statements \\
                 Functions and files \\
                 Classes \\
                 Operator Overloading \\
                 Derived classes \\
                 Streams",
}

@Book{Stroustrup:1991:CPL,
  author =       "Bjarne Stroustrup",
  title =        "The {C++} Programming Language",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Second",
  pages =        "xi + 669",
  year =         "1991",
  ISBN =         "0-201-53992-6",
  ISBN-13 =      "978-0-201-53992-9",
  LCCN =         "QA76.73.C15 S79 1991",
  bibdate =      "Wed Dec 15 10:42:50 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cccuj.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  email =        "\path|bs@alice.uucp|",
  tableofcontents = "Notes to the reader \\
                 A tour of C++ \\
                 Declarations and constants \\
                 Expressions and statements \\
                 Functions and files \\
                 Classes \\
                 Derived classes \\
                 Operator overloading \\
                 Templates \\
                 Exception handling \\
                 Streams \\
                 Design and development \\
                 Design and C++ \\
                 Design of libraries \\
                 Reference manual \\
                 ANSI/ISO resolutions",
}

@Book{Stroustrup:1994:DEC,
  author =       "Bjarne Stroustrup",
  title =        "The Design and Evolution of {C++}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "x + 461",
  year =         "1994",
  ISBN =         "0-201-54330-3",
  ISBN-13 =      "978-0-201-54330-8",
  LCCN =         "QA76.73.C153S79 1994",
  bibdate =      "Wed May 25 13:58:32 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$26.96",
  acknowledgement = ack-nhfb,
  tableofcontents = "The Prehistory of C++ \\
                 C with Classes \\
                 The Birth of C++ \\
                 C++ Language Design Rules \\
                 Chronology 1985--1993 \\
                 Standardization \\
                 Interest and Use \\
                 Libraries \\
                 Looking Ahead \\
                 Memory Management \\
                 Overloading \\
                 Multiple Inheritance \\
                 Class Concept Refinements \\
                 Casting \\
                 Templates \\
                 Exception Handling \\
                 Namespaces \\
                 The C Preprocessor",
}

@Book{Stroustrup:1997:CPL,
  author =       "Bjarne Stroustrup",
  title =        "The {C++} Programming Language",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Third",
  pages =        "x + 910",
  year =         "1997",
  ISBN =         "0-201-70073-5, 0-201-88954-4 (paperback)",
  ISBN-13 =      "978-0-201-70073-2, 978-0-201-88954-3 (paperback)",
  LCCN =         "QA76.73.C153 S77 1997",
  bibdate =      "Fri Jun 26 07:30:14 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See also companion book \cite{Vandevoorde:1999:CSC}.",
  abstract =     "This is a complete rewrite of the most widely read and
                 most trusted book on C++. Based on the ANSI/ISO C++
                 final draft, this book covers the C++ language, its
                 standard library, and key design techniques as an
                 integrated whole. The C++ Programming Language provides
                 comprehensive coverage of C++ language features and
                 standard library components. With this third edition,
                 Stroustrup makes C++ even more accessible to those new
                 to the language while adding information and techniques
                 that even expert C++ programmers will find
                 invaluable.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Notes to the Reader \\
                 2: A Tour of C++ \\
                 3: A Tour of the Standard Library \\
                 4: Types and Declarations \\
                 5: Pointers, Arrays, and Structures \\
                 6: Expressions and Statements \\
                 7: Functions \\
                 8: Namespaces and Exceptions \\
                 9: Source Files and Programs \\
                 10: Classes \\
                 11: Operator Overloading \\
                 12: Derived Classes \\
                 13: Templates \\
                 14: Exception Handling \\
                 15: Class Hierarchies \\
                 16: Library Organization and Containers \\
                 17: Standard Containers \\
                 18: Algorithms and Function Objects \\
                 19: Iterators and Allocators \\
                 20: Strings \\
                 21: Streams \\
                 22: Numerics \\
                 23: Development and Design \\
                 24: Design and Programming \\
                 25: Roles of Cases \\
                 Appendix A: The C++ Grammar \\
                 Appendix B: Compatibility \\
                 Appendix C: Technicalities",
}

@Book{Stroustrup:2013:CPL,
  author =       "Bjarne Stroustrup",
  title =        "The {C++} programming language",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Fourth",
  pages =        "xiv + 1346",
  year =         "2013",
  ISBN =         "0-321-56384-0 (paperback), 0-321-95832-2 (hardcover),
                 0-13-352283-0 (e-book)",
  ISBN-13 =      "978-0-321-56384-2 (paperback), 978-0-321-95832-7
                 (hardcover), 978-0-13-352283-9 (e-book)",
  LCCN =         "QA76.73.C153 S77 2013",
  bibdate =      "Mon Sep 6 13:47:44 MDT 2021",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "The new C++11 standard allows programmers to express
                 ideas more clearly, simply, and directly, and to write
                 faster, more efficient code. Bjarne Stroustrup, the
                 designer and original implementer of C++, has
                 reorganized, extended, and completely rewritten his
                 definitive reference and tutorial for programmers who
                 want to use C++ most effectively. The C++ Programming
                 Language, Fourth Edition, delivers meticulous, richly
                 explained, and integrated coverage of the entire
                 language-its facilities, abstraction mechanisms,
                 standard libraries, and key design techniques.
                 Throughout, Stroustrup presents concise, ``pure C++11''
                 examples, which have been carefully crafted to clarify
                 both usage and program design. To promote deeper
                 understanding, the author provides extensive
                 cross-references, both within the book and to the ISO
                 standard. New C++11 coverage includes Support for
                 concurrency Regular expressions, resource management
                 pointers, random numbers, and improved containers
                 General and uniform initialization, simplified
                 for-statements, move semantics, and Unicode support
                 Lambdas, general constant expressions, control over
                 class defaults, variadic templates, template aliases,
                 and user-defined literals Compatibility issues Topics
                 addressed in this comprehensive book include Basic
                 facilities: type, object, scope, storage, computation
                 fundamentals, and more Modularity, as supported by
                 namespaces, source files, and exception handling C++
                 abstraction, including classes, class hierarchies, and
                 templates in support of a synthesis of traditional
                 programming, object-oriented programming, and generic
                 programming Standard Library: containers, algorithms,
                 iterators, utilities, strings, stream I/O, locales,
                 numerics, and more The C++ basic memory model, in depth
                 This fourth edition makes C++11 thoroughly accessible
                 to programmers moving from C++98 or other languages,
                 while introducing insights and techniques that even
                 cutting-edge C++11 programmers will find indispensable.
                 This book features an enhanced, layflat binding, which
                 allows the book to stay open more easily when placed on
                 a flat surface. This special binding method ---
                 noticeable by a small space inside the spine also
                 increases durability.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "C++ (Computer program language); Computer programming;
                 C++ (Langage de programmation); Programmation
                 (Informatique); C++ (Computer program language);
                 Computer programming.",
  tableofcontents = "Part I: Introductory Material \\
                 1. Notes to the Reader \\
                 2. A Tour of C++: The Basics \\
                 3. A Tour of C++: Abstraction Mechanisms \\
                 4. A Tour of C++: Containers and Algorithms \\
                 5. A Tour of C++: Concurrency and Utilities \\
                 Part II: Basic Facilities \\
                 6. Types and Declarations \\
                 7. Pointers, Arrays, and References \\
                 8. Structures, Unions, and Enumerations \\
                 9. Statements \\
                 10. Expressions \\
                 11. Select Operations \\
                 12. Functions \\
                 13. Exception Handling \\
                 14. Namespaces \\
                 15. Source Files and Programs \\
                 Part III: Abstraction Mechanisms \\
                 16. Classes \\
                 17. Construction, Cleanup, Copy, and Move \\
                 18. Overloading \\
                 19. Special Operators \\
                 20. Derived Classes \\
                 21. Class Hierarchies \\
                 22. Run-Time Type Information \\
                 23. Templates \\
                 24. Generic Programming \\
                 25. Specialization \\
                 26. Instantiation \\
                 27. Templates and Hierarchies \\
                 28. Metaprogramming \\
                 29. A Matrix Design \\
                 Part IV: The Standard Library \\
                 30. Standard Library Summary \\
                 31. STL Containers \\
                 32. STL Algorithms \\
                 33. STL Iterators \\
                 34. Memory and Resources \\
                 35. Utilities \\
                 36. Strings \\
                 37. Regular Expressions \\
                 38. I/O Streams \\
                 39. Locales \\
                 40. Numerics \\
                 41. Concurrency \\
                 42. Threads and Tasks \\
                 43. The C Standard Library \\
                 44. Compatibility",
}

@Book{Strunk:1979:ES,
  author =       "William {Strunk Jr.} and E. B. White",
  title =        "The Elements of Style",
  publisher =    pub-MACMILLAN,
  address =      pub-MACMILLAN:adr,
  edition =      "Third",
  pages =        "xvii + 85",
  year =         "1979",
  ISBN =         "0-02-418230-3 (hardcover), 0-02-418220-6 (paperback)",
  ISBN-13 =      "978-0-02-418230-2 (hardcover), 978-0-02-418220-3
                 (paperback)",
  LCCN =         "PE1408 .S77 1979",
  bibdate =      "Wed Dec 15 10:42:54 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Whether you write letters, term papers, or novels,
                 this famous manual can help you communicate more
                 effectively.",
  acknowledgement = ack-nhfb,
  idnumber =     "511",
  keywords =     "English language --- Rhetoric, English language ---
                 Style, Report writing",
  tableofcontents = "Elementary rules of usage \\
                 Elementary principles of composition \\
                 A few matters of form \\
                 Words and expressions commonly misused \\
                 An approach to style",
}

@Book{Strunk:1999:ES,
  author =       "William {Strunk Jr.} and E. B. White",
  title =        "The Elements of Style",
  publisher =    pub-ALLYN-BACON,
  address =      pub-ALLYN-BACON:adr,
  edition =      "Fourth",
  pages =        "xviii + 105",
  year =         "1999",
  ISBN =         "0-205-30902-X (paperback), 0-205-31342-6 (hardcover)",
  ISBN-13 =      "978-0-205-30902-3 (paperback), 978-0-205-31342-6
                 (hardcover)",
  LCCN =         "PE1408 .S772 2000",
  bibdate =      "Wed Dec 15 10:42:54 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$7.95",
  abstract =     "Offers advice on improving writing skills and
                 promoting a style marked by simplicity, orderliness,
                 and sincerity.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  shorttableofcontents = "Elementary rules of usage \\
                 Elementary principles of composition \\
                 A few matters of form \\
                 Words and expressions commonly misused \\
                 A approach to style",
  tableofcontents = "Foreword \\
                 Introduction \\
                 I: Elementary Rules of Usage \\
                 1: Form the Possessive Singular of Nouns by Adding s.
                 2: In a Series of Three or More Terms with a Single
                 Conjunction, Use a Comma after Each Term except the
                 Last \\
                 3: Enclose Parenthetic Expressions between Commas \\
                 4: Place a Comma before a Conjunction Introducing an
                 Independent Clause \\
                 5: Do Not Join Independent Clauses with a Comma \\
                 6: Do Not Break Sentences in Two \\
                 7: Use a Colon after an Independent Clause to Introduce
                 a List of Particulars, an Appositive, an Amplification,
                 or an Illustrative Question \\
                 8: Use a Dash to Set Off an Abrupt Break or
                 Interruption and to Announce a Long Appositive or
                 Summary \\
                 9: The Number of the Subject Determines the Number of
                 the Verb \\
                 10: Use the Proper Case of Pronoun \\
                 11: A Participial Phrase at the Beginning of the
                 Sentence Must Refer to the Grammatical Subject \\
                 II: Elementary Principles of Composition \\
                 12: Choose a Suitable Design and Hold to It \\
                 13: Make the Paragraph the unit of Composition \\
                 14: Use the Active Voice \\
                 15: Put Statements in Positive Form \\
                 16: Use Definite, Specific, Concrete Language \\
                 17: Omit Needless Words \\
                 18: Avoid a Succession of Loose Sentences \\
                 19: Express Coordinate Ideas in Similar Form \\
                 20: Keep Related Words Together \\
                 21: In Summaries, Keep to One Tense \\
                 22: Place the Emphatic Words of a Sentence at the End
                 \\
                 III: A Few Matters of Form \\
                 IV: Words and Expressions Commonly Misused \\
                 V: An Approach to Style (with a list of reminders). 1:
                 Place Yourself in the Background \\
                 2: Write in a Way That Comes Naturally \\
                 3: Work From a Suitable Style \\
                 4: Write with Nouns and Verbs \\
                 5: Revise and Rewrite \\
                 6: Do Not Overwrite \\
                 7: Do Not Overstate \\
                 8: Avoid the Use of Qualifiers \\
                 9: Do Not Affect a Breezy Manner \\
                 10: Use Orthodox Spelling \\
                 11: Do Not Explain Too Much \\
                 12: Do Not Construct Awkward Adverbs \\
                 13: Make Sure the Reader Knows Who is Speaking \\
                 14: Avoid Fancy Words \\
                 15: Do Not Use Dialect Unless Your Ear Is Good \\
                 16: Be Clear \\
                 17: Do Not Inject Opinion \\
                 18: Use Figures of Speech Sparingly \\
                 19: Do Not Take Shortcuts at the Cost of Clarity \\
                 20: Avoid Foreign Languages \\
                 21: Prefer the Standard to the Offbeat \\
                 Afterword \\
                 Glossary",
}

@Book{Strunk:2005:ES,
  author =       "William {Strunk, Jr.} and E. B. (Elwyn Brooks) White
                 and Maira Kalman",
  title =        "The Elements of Style",
  publisher =    pub-PENGUIN,
  address =      pub-PENGUIN:adr,
  edition =      "Fourth",
  pages =        "xvii + 147",
  year =         "2005",
  ISBN =         "0-14-311272-4 (paperback), 1-59420-069-6 (hardcover)",
  ISBN-13 =      "978-0-14-311272-3 (paperback), 978-1-59420-069-4
                 (hardcover)",
  LCCN =         "PE1408 .S772 2005",
  bibdate =      "Wed Nov 2 05:01:03 MST 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.penguinputnam.com/nf/Book/BookDisplay/0,,0_1594200696,00.html",
  abstract =     "An enhanced edition of the classic writing manual
                 features humorous art by a popular children's book
                 illustrator and New Yorker cover artist, in a volume
                 that provides visual and whimsical embellishments to
                 the original instructive text.",
  acknowledgement = ack-nhfb,
  author-dates = "1869--1946",
  libnote =      "Not yet in my library.",
  subject =      "English language; Rhetoric; English language; Style;
                 Report writing",
  tableofcontents = "Elementary Rules of Usage \\
                 Elementary Principles of Composition \\
                 A Few Matters of Form \\
                 Words and Expressions Commonly Misused \\
                 An Approach to Style (with a List of Reminders) \\
                 Spelling (from the first edition)",
}

@Book{Stuart:1984:WAE,
  author =       "Ann Stuart",
  title =        "Writing and Analyzing Effective Computer
                 Documentation",
  publisher =    pub-HRW,
  address =      pub-HRW:adr,
  pages =        "x + 271",
  year =         "1984",
  ISBN =         "0-03-063892-5",
  ISBN-13 =      "978-0-03-063892-3",
  LCCN =         "QA76.9.D6 S78 1984",
  bibdate =      "Wed Dec 15 10:43:02 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Stuewer:2018:AIN,
  author =       "Roger H. Stuewer",
  title =        "The Age of Innocence: Nuclear Physics Between the
                 {First} and {Second World Wars}",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  pages =        "xv + 484",
  year =         "2018",
  ISBN =         "0-19-186658-X, 0-19-882787-3 (hardback), 0-19-256290-8
                 (e-book)",
  ISBN-13 =      "978-0-19-186658-6, 978-0-19-882787-0 (hardback),
                 978-0-19-256290-6 (e-book)",
  LCCN =         "QC773 .S78 2018",
  bibdate =      "Sat Apr 6 07:28:02 MDT 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/b/bethe-hans.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/b/bohr-niels.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/d/dirac-p-a-m.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/f/fermi-enrico.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/f/frisch-otto.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/g/gamow-george.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/m/meitner-lise.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/p/peierls-rudolf.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/r/rutherford-ernest.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/s/schroedinger-erwin.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/w/wigner-eugene.bib;
                 https://www.math.utah.edu/pub/tex/bib/contempphys.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "This history of nuclear physics sets the experimental
                 innovations and theoretical breakthroughs in the field
                 in the period between the two World Wars within the
                 contexts of the lives and personalities of the
                 physicists who made them and the physical,
                 intellectual, and political environments of the
                 countries and institutions in which they worked.",
  acknowledgement = ack-nhfb,
  brieftableofcontents = "Cambridge and the Cavendish \\
                 European and nuclear disintegration \\
                 Vienna and the Institute for Radium Research \\
                 The Cambridge--Vienna controversy \\
                 The quantum-mechanical nucleus \\
                 Nuclear electrons and nuclear structure \\
                 New Particles \\
                 New Machines \\
                 Nuclear physicists at the crossroads \\
                 Exiles and immigrants \\
                 Artificial radioactivity \\
                 Beta decay redux, slow neutrons, Bohr and his realm \\
                 New theories of nuclear reactions \\
                 The plague spreads to Austria and Italy \\
                 The new world",
  subject =      "Nuclear physics; History; Nuclear physics.",
  tableofcontents = "1. Cambridge and the Cavendish / 1 \\
                 Thomson / 1 \\
                 Rutherford / 7 \\
                 The Fourth Cavendish Professor / 12 \\
                 Rutherford Reigns Supreme / 15 \\
                 Notes / 19 \\
                 2. European and Nuclear Disintegration / 22 \\
                 The Great War / 22 \\
                 Mobilization / 22 \\
                 The Manifesto of the Ninety-Three / 24 \\
                 The Horror of the War / 26 \\
                 Armistice and Aftermath / 27 \\
                 The Human Cost of the War / 28 \\
                 Rutherford's Discovery of Artificial Nuclear
                 Disintegration / 29 \\
                 Chadwick / 35 \\
                 Rutherford's Satellite Model of the Nucleus / 39 \\
                 Notes / 42 \\
                 3. Vienna and the Institute for Radium Research / 44
                 \\
                 Vienna / 44 \\
                 The Great Inflation / 46 \\
                 Meyer / 48 \\
                 The Institute for Radium Research / 50 \\
                 Meyer as Director / 56 \\
                 Notes / 58 \\
                 4. The Cambridge--Vienna Controversy / 61 \\
                 Challenge from Vienna / 61 \\
                 Stalemate / 67 \\
                 Rutherford's Satellite Model and Natural Radioactivity
                 / 72 \\
                 Private Expose / 75 \\
                 Aftermath / 79 \\
                 Notes / 81 \\
                 5. The Quantum-Mechanical Nucleus / 85 \\
                 Quantum Mechanics / 85 \\
                 Physics in Leningrad / 85 \\
                 Gamow / 91 \\
                 Alpha Decay / 96 \\
                 Simultaneous Discovery / 101 \\
                 Cambridge and Copenhagen / 105 \\
                 Return to Leningrad / 109 \\
                 Notes / 110 \\
                 6. Nuclear Electrons and Nuclear Structure / 114 \\
                 Nuclear Electrons / 114 \\
                 Contradictions / 116 \\
                 Gamow's Liquid-Drop Model / 119 \\
                 Bothe / 126 \\
                 Marie Curie and the Institut du Radium / 131 \\
                 Frederic Joliot and Irene Curie / 136 \\
                 The Rome Conference / 140 \\
                 Notes / 143 \\
                 7. New Particles / 148 \\
                 Urey and the Deuteron / 148 \\
                 Chadwick and the Neutron / 155 \\
                 Anderson and the Positron / 166 \\
                 Dirac / 170 \\
                 Blackett / 172 \\
                 Notes / 178 \\
                 8. New Machines / 183 \\
                 Cockcroft / 183 \\
                 Walton / 186 \\
                 Cockcroft--Walton Accelerator / 190 \\
                 Lawrence and Tove / 199 \\
                 Cyclotron / 203 \\
                 Five Nobel Prizes in Physics / 211 \\
                 Notes / 211 \\
                 9. Nuclear Physicists at the Crossroads / 216 \\
                 Refugees / 216 \\
                 British Response / 217 \\
                 American Response / 221 \\
                 The Neutron: Compound or Elementary? / 224 \\
                 The Seventh Solvay Conference / 228 \\
                 Nuclear Questions / 232 \\
                 Aftermath / 234 \\
                 Fermi's Theory of Beta Decay / 234 \\
                 The Demise of Lawrence's Low-Mass Neutron / 237 \\
                 The Neutron: An Unstable Elementary Particle / 240 \\
                 Notes / 242 \\
                 10. Exiles and Immigrants / 248 \\
                 Nazi Dogma Denounced and Defended / 248 \\
                 Illustrious Immigrants / 252 \\
                 Gamow / 253 \\
                 Schr{\"o}dinger / 254 \\
                 Goldhaber and Scharff Goldhaber / 254 \\
                 Elsasser / 256 \\
                 Peierls / 261 \\
                 Frisch / 263 \\
                 Bloch / 266 \\
                 Bethe / 268 \\
                 Welcome to America / 273 \\
                 Notes / 273 \\
                 11. Artificial Radioactivity / 278 \\
                 Curie and Joliot / 278 \\
                 Discovery / 279 \\
                 Reception / 282 \\
                 Fermi / 284 \\
                 Discovery / 297 \\
                 Reception / 302 \\
                 Death of Marie Curie / 303 \\
                 Notes / 305 \\
                 12. Beta Decay Redux, Slow Neutrons, Bohr and his Realm
                 / 310 \\
                 Travels / 310 \\
                 The London--Cambridge Conference / 311 \\
                 Rutherford / 311 \\
                 Beck, Sitte, and Beta Decay / 312 \\
                 Artificial Radioactivity and Other Fields / 316 \\
                 Discovery of Slow Neutrons / 317 \\
                 Serendipity / 321 \\
                 Bohr and the Bohr Institute / 322 \\
                 Franck, Hevesy, and Exodus / 328 \\
                 Notes / 332 \\
                 13. New Theories of Nuclear Reactions / 335 \\
                 The Compound Nucleus / 335 \\
                 Trip Around the World / 338 \\
                 Breit / 340 \\
                 Wigner / 344 \\
                 Nucleus+ Neutron Resonances / 349 \\
                 Death of Corbino / 350 \\
                 Death of Rutherford / 350 \\
                 Notes / 358 \\
                 14. The Plague Spreads to Austria and Italy / 361 \\
                 Anschluss / 361 \\
                 Illustrious Austrian--Hungarian Exiles / 362 \\
                 Schr{\"o}dinger / 362 \\
                 Meyer / 364 \\
                 Blau / 366 \\
                 Rona / 368 \\
                 Meitner / 370 \\
                 Illustrious Italian Exiles / 376 \\
                 Rossi / 376 \\
                 Segre / 380 \\
                 Fermi / 384 \\
                 Notes / 389 \\
                 15. The New World / 393 \\
                 Nuclear Fission / 393 \\
                 Discovery / 394 \\
                 Interpretation / 396 \\
                 Bohr and Fermi in America / 402 \\
                 Notes / 407 \\
                 Archives / 411 \\
                 Oral History Interviews / 412 \\
                 Websites / 413 \\
                 Journal Abbreviations / 415 \\
                 Bibliography / 418 \\
                 Name Index / 455 \\
                 Subject Index / 465",
}

@Book{Summerfield:2009:PPC,
  author =       "Mark Summerfield",
  title =        "Programming in {Python 3}: a complete introduction to
                 the {Python} language",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xiv + 525",
  year =         "2009",
  ISBN =         "0-13-712929-7 (paperback)",
  ISBN-13 =      "978-0-13-712929-4 (paperback)",
  LCCN =         "QA76.73.P98 S86 2009",
  bibdate =      "Thu Apr 16 08:04:00 MDT 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/python.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Developer's library",
  acknowledgement = ack-nhfb,
  subject =      "Python (Computer program language); Object-oriented
                 programming (Computer science)",
  tableofcontents = "Introduction / 1 \\
                 1: Rapid Introduction to Procedural Programming / 7 \\
                 Creating and Running Python Programs / 7 \\
                 Python's ``Beautiful Heart'' / 12 \\
                 Example / 36 \\
                 Summary / 42 \\
                 Exercises / 44 \\
                 2:Data Types / 47 \\
                 Identifiers and Keywords / 47 \\
                 Integral Types / 50 \\
                 Floating-Point Types / 54 \\
                 Strings / 61 \\
                 Examples / 88 \\
                 Summary / 95 \\
                 Exercises / 97 \\
                 3: Collection Data Types / 99 \\
                 Sequence Types / 9 \\
                 Set Types / 112 \\
                 Mapping Types / 117 \\
                 Iterating and Copying Collections / 127 \\
                 Examples / 138 \\
                 Summary / 146 \\
                 Exercises / 147 \\
                 4: Control Structures and Functions / 149 \\
                 Control Structures / 149 \\
                 Exception Handling / 153 \\
                 Custom Functions / 161 \\
                 Example: make\_html\_skeleton.py / 175 \\
                 Summary / 181 \\
                 Exercise / 182 \\
                 5: Modules / 185 \\
                 Modules and Packages / 185 \\
                 Overview of Python's Standard Library / 20 \\
                 Summary / 219 \\
                 Exercise / 220 \\
                 6: Object-Oriented Programming / 223 \\
                 The Object-Oriented Approach / 224 \\
                 Custom Classes / 228 \\
                 Custom Collection Classes / 25 \\
                 Summary / 272 \\
                 Exercises / 274 \\
                 7: File Handling / 277 \\
                 Writing and Reading Binary Data / 282 \\
                 Writing and Parsing Text Files / 294 \\
                 Writing and Parsing XML Files / 302 \\
                 Random Access Binary Files / 313 \\
                 Summary / 326 \\
                 Exercises / 327 \\
                 8: Advanced Programming Techniques / 329 \\
                 Further Procedural Programming / 330 \\
                 Further Object-Oriented Programming / 353 \\
                 Functional-Style Programming / 384 \\
                 Example: Valid.py / 388 \\
                 Summary / 390 \\
                 Exercises / 392 \\
                 9: Processes and Threading / 395 \\
                 Delegating Work to Processes / 396 \\
                 Delegating Work to Threads / 400 \\
                 Summary / 409 \\
                 Exercises / 410 \\
                 10: Networking / 413 \\
                 Creating a TCP Client / 414 \\
                 Creating a TCP Server / 420 \\
                 Summary / 427 \\
                 Exercises / 427 \\
                 11: Database Programming / 431 \\
                 DBM Databases / 432 \\
                 SQL Databases / 436 \\
                 Summary / 443 \\
                 Exercise / 444 \\
                 12: Regular Expressions / 445 \\
                 Python's Regular Expression Language / 446 \\
                 The Regular Expression Module / 455 \\
                 Summary / 464 \\
                 Exercises / 465 \\
                 13: Introduction to GUI Programming \\
                 Dialog-Style Programs \\
                 Main-Window-Style Programs \\
                 Summary \\
                 Exercises \\
                 Epilogue \\
                 About the Author \\
                 Production \\
                 Index",
}

@Book{Sun:1997:JEC,
  author =       "{Sun Microsystems}",
  title =        "{Java} Enterprise Computing: Enabling Breakaway
                 Business Strategies",
  publisher =    pub-SUN,
  address =      pub-SUN:adr,
  pages =        "xvii + 202",
  year =         "1997",
  bibdate =      "Sat Apr 27 07:16:19 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
  xxLCCN =       "none",
}

@Manual{Sun:SPARC,
  key =          "{Sun Microsystems}",
  title =        "The {SPARC} Architecture Manual",
  organization = pub-SUN,
  address =      pub-SUN:adr,
  edition =      "Part No: 800-1399-07",
  month =        aug # " 8",
  year =         "1987",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Article{Sunday:string-search,
  author =       "Daniel M. Sunday",
  title =        "A Very Fast Substring Search Algorithm",
  journal =      j-CACM,
  volume =       "33",
  number =       "8",
  pages =        "132--142",
  month =        aug,
  year =         "1990",
  bibdate =      "Sun May 2 07:54:35 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See also
                 \cite{Boyer:string-search,Knuth:string-search,Baeza-Yates:j-CACM-35-10-74}.",
  acknowledgement = ack-nhfb,
}

@Book{Suri:2007:CAM,
  author =       "Gaurav Suri and Hartosh Singh Bal",
  title =        "A Certain Ambiguity: a Mathematical Novel",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "viii + 281",
  year =         "2007",
  ISBN =         "0-691-12709-3 (hardcover)",
  ISBN-13 =      "978-0-691-12709-5 (hardcover)",
  LCCN =         "QA99 .S87 2007",
  bibdate =      "Thu Nov 15 15:55:34 MST 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 prodorbis.library.yale.edu:7090/voyager;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0726/2007009495-b.html;
                 http://www.loc.gov/catdir/enhancements/fy0726/2007009495-d.html",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "mathematics; miscellanea; fiction",
}

@Book{Susskind:2008:BHW,
  author =       "Leonard Susskind",
  title =        "The Black Hole War: My Battle with {Stephen Hawking}
                 to Make the World Safe for Quantum Mechanics",
  publisher =    pub-LITTLE-BROWN,
  address =      pub-LITTLE-BROWN:adr,
  pages =        "viii + 470",
  year =         "2008",
  ISBN =         "0-316-01640-3",
  ISBN-13 =      "978-0-316-01640-7",
  LCCN =         "QC174.12 .S896 2008",
  bibdate =      "Tue Dec 9 15:54:49 MST 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0804/2007048355-b.html;
                 http://www.loc.gov/catdir/enhancements/fy0804/2007048355-d.html",
  abstract =     "A mind-bending book about modern physics, quantum
                 mechanics, the fate of stars and the deep mysteries of
                 black holes. What happens when something is sucked into
                 a black hole? Does it disappear? Three decades ago, a
                 young physicist named Stephen Hawking claimed it
                 did---and in doing so put at risk everything we know
                 about physics and the fundamental laws of the universe.
                 Most scientists didn't recognize the import of
                 Hawking's claims, but Leonard Susskind and Gerard
                 t'Hooft realized the threat, and responded with a
                 counterattack that changed the course of physics. This
                 is the story of their united effort to reconcile
                 Hawking's revolutionary theories with their own sense
                 of reality---effort that would eventually result in
                 Hawking admitting he was wrong, paying up, and Susskind
                 and t'Hooft realizing that our world is a hologram
                 projected from the outer boundaries of space.",
  acknowledgement = ack-nhfb,
  subject =      "quantum theory; general relativity (physics); black
                 holes (astronomy); space and time; Hawking, S. W;
                 (Stephen W.)",
  tableofcontents = "Part 1. The gathering storm \\
                 The first shot \\
                 The dark star \\
                 Not your grandfather's geometry \\
                 ``Einstein, don't tell God what to do'' \\
                 Planck invents a better yardstick \\
                 In a Broadway bar \\
                 Energy and entropy \\
                 Wheeler's boys, or how much information can you stuff
                 in a black hole? \\
                 Black light \\
                 Part 2. Surprise attack \\
                 How Stephen lost his bits and didn't know where to find
                 them \\
                 The Dutch resistance \\
                 Who cares? \\
                 Stalemate \\
                 Skirmish at Aspen \\
                 Part 3. Counterattack \\
                 The Battle of Santa Barbara \\
                 Wait! Reverse the rewiring \\
                 Ahab in Cambridge \\
                 The world as a hologram \\
                 Part 4. Closing the ring \\
                 Weapon of mass deduction \\
                 Alice's airplane, or the last visible propeller \\
                 Counting black holes \\
                 South America wins the war \\
                 Nuclear physics? You're kidding! \\
                 Humility",
}

@Book{Swartz:1965:FP,
  author =       "Clifford E. Swartz",
  title =        "The Fundamental Particles",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "viii + 152",
  year =         "1965",
  LCCN =         "QC721.S982",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Sweetman:1999:SMR,
  author =       "Dominic Sweetman",
  title =        "See {MIPS} Run",
  publisher =    pub-MORGAN-KAUFMANN,
  address =      pub-MORGAN-KAUFMANN:adr,
  pages =        "xviii + 488",
  year =         "1999",
  ISBN =         "1-55860-410-3 (paperback)",
  ISBN-13 =      "978-1-55860-410-0 (paperback)",
  LCCN =         "QA76.9.A73 S88 1999",
  bibdate =      "Thu Jun 20 10:21:55 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$52.95, UK\pounds 35.95",
  abstract =     "The versatile offspring of an extended family of
                 multiple chip companies, today's MIPS chips are
                 everywhere. They power everything from video games,
                 network routers, laser printers, and set-top boxes, to
                 high-performance workstations. This book brings
                 together this extraordinary proliferation of form and
                 functionality, offering embedded systems programmers
                 and designers unique, eminently practical insights into
                 MIPS. It covers how MIPS started, the principles at the
                 root of the RISC revolution, the full details of the
                 MIPS instruction set, and how these details together
                 constitute a full operating system ready to be put to
                 work in hundreds of ways.",
  acknowledgement = ack-nhfb,
  keywords =     "Embedded computer systems --- Programming; MIPS
                 (Computer architecture); RISC microprocessors",
  libnote =      "Not yet in my library.",
  tableofcontents = "1: RISCs and MIPS \\
                 2: MIPS Architecture \\
                 3: Coprocessor 0: MIPS Processor Control \\
                 4: Caches for MIPS \\
                 5: Exceptions, Interrupts, and Initialization \\
                 6: Memory Management and the TLB \\
                 7: Floating-Point Support \\
                 8: Complete Guide to the MIPS Instruction Set \\
                 9: Assembler Language Programming \\
                 10: C Programming on MIPS \\
                 11: Portability Considerations and C Code \\
                 12: Software Examples \\
                 Appendix A: Instruction Timing and Optimization \\
                 Appendix B: Assembler Language Syntax \\
                 Appendix C: Object Code \\
                 Appendix D: Evolving MIPS \\
                 MIPS Glossary",
}

@Book{Sweetman:2007:SMR,
  author =       "Dominic Sweetman",
  title =        "See {MIPS} Run",
  publisher =    pub-MORGAN-KAUFMANN,
  address =      pub-MORGAN-KAUFMANN:adr,
  edition =      "Second",
  pages =        "xix + 492",
  year =         "2007",
  ISBN =         "0-12-088421-6",
  ISBN-13 =      "978-0-12-088421-6",
  LCCN =         "QA76.9.A73 S88 2007",
  bibdate =      "Thu Jun 20 10:21:55 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/linux.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/multithreading.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  keywords =     "Embedded computer systems --- Programming; MIPS
                 (Computer architecture); RISC microprocessors",
  libnote =      "Not yet in my library.",
  tableofcontents = "1: RISCs and MIPS architectures / 1 \\
                 2: MIPS architecture / 29 \\
                 3: Coprocessor 0: MIPS processor control / 53 \\
                 4: How caches work on MIPS processors / 79 \\
                 5: Exceptions, interrupts, and initialization / 105 \\
                 6: Low-level memory management and the TLB / 131 \\
                 7: Floating-point support / 151 \\
                 8: Complete guide to the MIPS instruction set / 183 \\
                 9: Reading MIPS assembly language / 263 \\
                 10: Porting software to the MIPS architecture / 279 \\
                 11: MIPS software standards (ABIs) / 311 \\
                 12: Debugging MIPS designs - debug and profiling
                 features / 339 \\
                 13: GNU/Linux from eight miles high / 363 \\
                 14: How hardware and software work together / 371 \\
                 15: MIPS specific issues in the Linux kernel / 399 \\
                 16: Linux application code, PIC, and libraries / 409
                 \\
                 Appendix A: MIPS multithreading / 415 \\
                 Appendix B: Other optional extensions to the MIPS
                 instruction set",
}

@Book{Swinton:2019:ATM,
  author =       "Jonathan Swinton",
  title =        "{Alan Turing's Manchester}",
  publisher =    "Infang Publishing",
  address =      "Manchester, UK",
  pages =        "204",
  year =         "2019",
  ISBN =         "0-9931789-2-8 (paperback), 0-9931789-3-6 (e-book)",
  ISBN-13 =      "978-0-9931789-2-4 (paperback), 978-0-9931789-3-1
                 (e-book)",
  LCCN =         "????",
  bibdate =      "Mon Jul 27 18:29:01 MDT 2020",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  remark =       "Heavily illustrated in color, with pages on thin
                 cardstock.",
  subject =      "Turing, Alan Mathison; Matem{\`a}tics; Gran
                 Bretanya.",
  subject-dates = "1912--1954",
  tableofcontents = "Preface / 7 \\
                 Turing before Manchester / 9 \\
                 Manchester before Turing / 13 \\
                 Industrial Dismal / 21 \\
                 The Manchester Mindscape / 31 \\
                 Why Manchester? / 53 \\
                 The /////// at the Window / 62 \\
                 Manchester By the Sea / 73 \\
                 Is a Mathematician a Human? / 79 \\
                 The Festival of Manchester / 97 \\
                 Atoms and Whimsy / 101 \\
                 Is a Mathematician a Man? / 115 \\
                 On Growth and on Form / 127 \\
                 Playing, Learning and Working / 145 \\
                 Oxford Road Show / 151 \\
                 The Course of the Bee / 163 \\
                 Appendix: Turing's Biomathematics / 172 \\
                 Acknowledgements and Notes / 174",
}

@Book{Sykes:1994:NOG,
  editor =       "Christopher Sykes",
  title =        "No Ordinary Genius: The Illustrated {Richard
                 Feynman}",
  publisher =    pub-NORTON,
  address =      pub-NORTON:adr,
  pages =        "272",
  year =         "1994",
  ISBN =         "0-297-81469-9, 0-393-31393-X (paperback),
                 0-393-03621-9",
  ISBN-13 =      "978-0-297-81469-6, 978-0-393-31393-2 (paperback),
                 978-0-393-03621-3",
  LCCN =         "QC16.F49 A3 1994",
  bibdate =      "Sat Mar 08 20:39:55 1997",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/f/feynman-richard-p.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$19.95, CDN\$25.99",
  abstract =     "If Richard Feynman had not existed it would not be
                 possible to create him. The most extraordinary
                 scientist of his time, a unique combination of dazzling
                 intellect and touching simplicity, Feynman had a
                 passion for physics that was merely the Nobel
                 Prize-winning part of an immense love of life and
                 everything it could offer. He was hugely irreverent and
                 always completely honest --- with himself, with his
                 colleagues, and with nature. ``People say to me, `Are
                 you looking for the ultimate laws of physics?' No, I'm
                 not. I'm just looking to find out more about the world,
                 and if it turns out there is a simple ultimate law that
                 explains everything, so be it. That would be very nice
                 to discover. If it turns out it's like an onion with
                 millions of layers, and we're sick and tired of looking
                 at layers, then that's the way it is. My interest in
                 science is to simply find out more about the world, and
                 the more I find out the better it is. I like to find
                 out.''. This intimate, moving, and funny book traces
                 Feynman's remarkable adventures inside and outside
                 science, in words and in more than one hundred
                 photographs, many of them supplied by his family and
                 close friends. The words are often his own and those of
                 family, friends, and colleagues such as his sister,
                 Joan Feynman; his children, Carl and Michelle; Freeman
                 Dyson, Hans Bethe, Daniel Hillis, Marvin Minsky, and
                 John Archibald Wheeler. It gives vivid insight into the
                 mind of a great creative scientist at work and at play,
                 and it challenges the popular myth of the scientist as
                 a cold reductionist dedicated to stripping romance and
                 mystery from the natural world. Feynman's enthusiasm is
                 wonderfully infectious. It shines forth in these
                 photographs and in his tales --- how he learned science
                 from his father and the Encyclopedia Britannica,
                 working at Los Alamos on the first atomic bomb,
                 reflecting on the marvels of electromagnetism,
                 unraveling the mysteries of liquid helium, probing the
                 causes of the Challenger space shuttle disaster, or
                 simply trying to find a way through Russian bureaucracy
                 to visit the mysterious central Asian country of Tannu
                 Tuva. Feynman's story will fascinate nonscientists who
                 would like to share something of the joys of scientific
                 discovery, and it will delight those scientists who use
                 Feynman's work but who never had a chance to meet
                 him.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Preface / 9 \\
                 A Note on Contributors / 13 \\
                 1: The Pleasure of Finding Things Out / 17 \\
                 2: Love and the Bomb / 41 \\
                 3: How to Win a Nobel Prize / 65 \\
                 4: Topless Bars and Other Ways to Have Fun / 89 \\
                 5: Imagine! / 125 \\
                 6: Doing the Physics / 143 \\
                 7: Crazy Ideas: Tiny Writing and Huge Computers / 163
                 \\
                 8: Challenger / 191 \\
                 9: The Quest for Tannu Tuva / 221 \\
                 10: Dying / 239 \\
                 Notes / 257 \\
                 A Feynman Bibliography / 263 \\
                 Illustration Credits / 265 \\
                 Index / 267",
}

@Book{Sykes:2007:SVC,
  author =       "Bryan Sykes",
  title =        "{Saxons}, {Vikings} and {Celts}: the Genetic Roots of
                 {Britain} and {Ireland}",
  publisher =    pub-NORTON,
  address =      pub-NORTON:adr,
  pages =        "xvii + 306 + 16",
  year =         "2007",
  ISBN =         "0-393-33075-3 (paperback)",
  ISBN-13 =      "978-0-393-33075-5 (paperback)",
  LCCN =         "GN290.G7 S95 2007",
  bibdate =      "Thu Aug 21 18:00:44 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 library.tcd.ie:210/advance",
  price =        "US\$16.95",
  abstract =     "A study based on a decade-long DNA survey traces the
                 genetic makeup of British Islanders and their
                 descendants, ranging from prehistoric times to the
                 genetic heritage of Americans of British descent.",
  acknowledgement = ack-nhfb,
  subject =      "human population genetics; Great Britain",
  tableofcontents = "Acknowledgements \\
                 List of Illustration \\
                 North American Preface \\
                 Maps \\
                 Prologue \\
                 1: Twelve Thousand Years of Solitude \\
                 2: Who Do We think We Are? \\
                 3: The Resurgent Celts \\
                 4: The Skull Snatchers \\
                 5: The Blood Bankers \\
                 6: The Silent Messengers \\
                 7: The Nature of the Evidence \\
                 8: Ireland \\
                 9: The DNA of Ireland \\
                 10: Scotland \\
                 11: The Picts \\
                 12: The DNA of Scotland \\
                 13: Wales \\
                 14: The DNA of Wales \\
                 15: England \\
                 16: Saxons, Danes, Vikings, and Normans \\
                 14: The DNA of England \\
                 18: The Blood of the Isles \\
                 Appendix \\
                 Index",
}

@Book{Syropoulos:2003:DTU,
  author =       "Apostolos Syropoulos and Antonis Tsolomitis and Nick
                 Sofroniou",
  title =        "Digital typography using {\LaTeX}",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xxix + 510",
  year =         "2003",
  ISBN =         "0-387-95217-9 (paperback), 0-387-22436-X (e-book)",
  ISBN-13 =      "978-0-387-95217-8 (paperback), 978-0-387-22436-7
                 (e-book)",
  LCCN =         "Z253.4.L38 S97 2003",
  bibdate =      "Thu Mar 13 18:17:25 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  abstract =     "The purpose of the book is to introduce new users to
                 the use of the TeX system, in particular document
                 preparation using LaTeX. It seeks to avoid the pitfalls
                 of having to search through several advanced books on
                 the subject, by collecting together the more frequently
                 required tools and presenting these in a single
                 accessible volume. It will also describe the recent
                 developments in multilingual typesetting using TeX that
                 now make it straightforward for users to prepare
                 documents in their own language and alphabet, giving
                 the book a global readership. The main presentation
                 will be independent of any particular type of computer
                 hardware, though a section will contain details of some
                 of the more popular versions of TeX for each type of
                 machine and details of where they can be downloaded on
                 the Internet from, or purchased at low cost on a
                 convenient compact disk. Topics and features:
                 multi-lingual uses of LaTeX; discussion of hardware
                 implementations; use and misuse of particular LaTeX
                 commands; some treatment of graphics; inclusion of
                 exercises with solutions; discussion of common errors;
                 inclusion of many examples.",
  acknowledgement = ack-nhfb,
  annote =       "Seems to have been published in Europe with same ISBN,
                 but different page count (370) and title:
                 \booktitle{From \LaTeX{} to $ \Lambda $: An
                 Introduction to Digital Typography}.",
  keywords =     "Lambda; Omega; Unicode",
  tableofcontents = "Foreword / Yannis Haralambous \\
                 1: Introduction \\
                 2: The File Structure \\
                 3: Fonts and Their Use \\
                 4: Lists and Catalogs \\
                 5: Typesetting Mathematics \\
                 6: More on the Core \\
                 7: Miscellaneous Packages \\
                 8: Bibliography and Index \\
                 9: Graphics \\
                 10: Multilingual Typesetting \\
                 11: To Err Is Human \\
                 12: Installing New Type \\
                 Appendix A: Using dvips \\
                 Appendix B: Visual Editing \\
                 Appendix C: Typesetting XML \\
                 Appendix D: Web Publishing \\
                 Appendix E: New Features Introduced to $\Omega$ 1.23
                 \\
                 Appendix F: Solutions to All Exercises",
}

@Book{Szasz:1984:DSR,
  author =       "Ferenc Morton Szasz",
  title =        "The day the sun rose twice: the story of the {Trinity
                 Site} nuclear explosion, {July 16, 1945}",
  publisher =    "University of New Mexico Press",
  address =      "Albuquerque, NM, USA",
  pages =        "xi + 233",
  year =         "1984",
  ISBN =         "0-8263-0768-X (paperback), 0-8263-0767-1",
  ISBN-13 =      "978-0-8263-0768-2 (paperback), 978-0-8263-0767-5",
  LCCN =         "QC773.A1 S93 1995; QC773.A1 S93 1984",
  bibdate =      "Thu Mar 29 19:10:05 MDT 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 melvyl.cdlib.org:210/CDL90",
  acknowledgement = ack-nhfb,
  subject =      "Atomic bomb; New Mexico; Los Alamos; History; Los
                 Alamos, NM; description and travel",
  tableofcontents = "Origins of Los Alamos \\
                 Construction and naming of Trinity \\
                 Theoretical considerations \\
                 Question of Weather \\
                 Blast \\
                 Aftermath I: Fallout \\
                 Aftermath II: Cattle, film, and people \\
                 International legacy \\
                 Local legacy - Epilogue \\
                 Notes \\
                 Bibliography \\
                 Index",
}

@Book{Tabak:1987:RIS,
  author =       "Daniel Tabak",
  title =        "Reduced Instruction Set Computer: {RISC}:
                 Architecture",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xiv + 161",
  year =         "1987",
  ISBN =         "0-471-91302-2",
  ISBN-13 =      "978-0-471-91302-3",
  LCCN =         "QA76.9.A73 T29 1987",
  bibdate =      "Wed Aug 10 12:59:28 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

@Book{Tabak:1990:RS,
  author =       "Daniel Tabak",
  title =        "{RISC} Systems",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xii + 300",
  year =         "1990",
  ISBN =         "0-471-92694-9 (Wiley), 0-86380-100-5 (Research Studies
                 Press)",
  ISBN-13 =      "978-0-471-92694-8 (Wiley), 978-0-86380-100-6 (Research
                 Studies Press)",
  LCCN =         "QA76.9.A73.T294 1990",
  bibdate =      "Wed Aug 10 11:51:06 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$49.95",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

@Book{Talbott:1986:MPM,
  author =       "Steve Talbott",
  title =        "Managing Projects with Make",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  year =         "1986",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Talbott:1988:MPM,
  author =       "Steve Talbott",
  title =        "Managing Projects with Make",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  edition =      "Second",
  pages =        "77",
  year =         "1988",
  ISBN =         "0-937175-04-8",
  ISBN-13 =      "978-0-937175-04-0",
  LCCN =         "QA76.8.U65 T34 1988",
  bibdate =      "Wed Dec 15 10:49:30 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/ora.bib",
  URL =          "http://www.oreilly.com/catalog/9780937175040",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

@Book{Taleb:2001:FRH,
  author =       "Nassim Taleb",
  title =        "Fooled by Randomness: the Hidden Role of Chance in the
                 Markets and in Life",
  publisher =    "Texere",
  address =      "New York, NY, USA",
  pages =        "xix + 203",
  year =         "2001",
  ISBN =         "1-58799-071-7 (hardcover), 1-58799-184-5 (paperback)",
  ISBN-13 =      "978-1-58799-071-7 (hardcover), 978-1-58799-184-4
                 (paperback)",
  LCCN =         "HG4521 .T35 2001; Hg4521 .T34 2001",
  bibdate =      "Sat Nov 5 12:01:08 MST 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 melvyl.cdlib.org:210/CDL90",
  abstract =     "Discusses the roles of probability, luck, and risk in
                 the markets and in life, examining how and why the
                 attempt to determine cause and effect is continually
                 hampered by random occurrences and our emotional
                 responses to them.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "Investments; Chance; Random variables",
  tableofcontents = "Mosques in the Clouds \\
                 Solon's Warning \\
                 Skewness, Asymmetry, Induction \\
                 If You're So Rich Why Aren't You So Smart? \\
                 Nero Tulip \\
                 Hit by Lightning \\
                 Temporary Sanity \\
                 Modus Operandi \\
                 No Work Ethics \\
                 There Are Always Secrets \\
                 John the High-Yield Trader \\
                 An Overpaid Hick \\
                 The Red-Hot Summer \\
                 Serotonin and Randomness \\
                 Your Dentist Is Rich, Very Rich \\
                 A Bizarre Accounting Method \\
                 Alternative History \\
                 Russian Roulette \\
                 An Even More Vicious Roulette \\
                 Smooth Peer Relations \\
                 Salvation Via Aeroflot \\
                 Solon Visits Regine's Night Club \\
                 George Will Is No Solon: On Counterintuitive Truths \\
                 Humiliated in Debates \\
                 Risk Managers \\
                 A Mathematical Meditation on History \\
                 Europlayboy Mathematics \\
                 The Tools \\
                 Monte Carlo Mathematics \\
                 Fun in My Attic \\
                 Making History \\
                 Zorglubs Crowding the Attic \\
                 Denigration of History \\
                 The Stove Is Hot \\
                 My Solon \\
                 Distilled Thinking on Your PalmPilot \\
                 Breaking News \\
                 Shiller Redux \\
                 Gerontocracy \\
                 Philostratus in Monte Carlo: On the Difference Between
                 Noise and Information \\
                 Randomness, Nonsense, and the Scientific Intellectual
                 \\
                 Randomness and the Verb \\
                 Reverse Turing Test \\
                 The Father of All Pseudothinkers \\
                 Monte Carlo Poetry \\
                 Survival of the Least Fit \\
                 Can Evolution Be Fooled by Randomness? \\
                 Carlos the Emerging Markets Wizard \\
                 The Good Years \\
                 Averaging Down \\
                 Lines in the Sand \\
                 John the High-Yield Trader \\
                 The Quant Who Knew Computers and Equations \\
                 The Traits They Shared",
}

@Book{Tamhane:2000:SDA,
  author =       "Ajit C. Tamhane and Dorothy D. Dunlop",
  title =        "Statistics and Data Analysis: from Elementary to
                 Intermediate",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xiv + 722",
  year =         "2000",
  ISBN =         "0-13-744426-5 (hardcover)",
  ISBN-13 =      "978-0-13-744426-7 (hardcover)",
  LCCN =         "QA276 .T25 2000",
  bibdate =      "Mon Oct 26 17:55:01 MDT 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "Disk contains: data sets for all exercises as ASCII,
                 MINITAB, and Microsoft Excel files.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Introduction \\
                 Review of probability \\
                 Collecting data \\
                 Summarizing and exploring data \\
                 Sampling distributions of statistics \\
                 Basic concepts of inference \\
                 Inferences for single samples \\
                 Inferences for two samples \\
                 Inferences for proportions and count data \\
                 Simple linear regression and correlation \\
                 Multiple linear regression \\
                 Analysis of single factor experiments \\
                 Analysis of multifactor experiments \\
                 Nonparametric statistical methods \\
                 Likelihood, Bayesian, and decision theory methods",
}

@Book{Tanenbaum:1987:OSD,
  author =       "Andrew S. Tanenbaum",
  title =        "Operating Systems: Design and Implementation",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xvi + 719",
  year =         "1987",
  ISBN =         "0-13-637406-9",
  ISBN-13 =      "978-0-13-637406-0",
  LCCN =         "QA76.76.O63 T36 1987",
  bibdate =      "Wed Dec 15 10:57:25 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$34.95",
  acknowledgement = ack-nhfb,
}

@Book{Tanenbaum:1988:CN,
  author =       "Andrew S. Tanenbaum",
  title =        "Computer Networks",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  edition =      "Second",
  pages =        "xv + 658",
  year =         "1988",
  ISBN =         "0-13-162959-X",
  ISBN-13 =      "978-0-13-162959-2",
  LCCN =         "TK5105.5 .T36 1988",
  bibdate =      "Wed Dec 15 10:56:26 1993",
  bibsource =    "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/unix.bib",
  abstract =     "Presents a balanced view of business --- the
                 strengths, weaknesses, successes, failures, problems
                 and challenges. Gives students a solid understanding
                 for more advanced courses.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  shorttableofcontents = "Preface / 1 \\
                 1: Introduction / 1 \\
                 2: The physical layer / 77 \\
                 3: The medium access sublayer / 175 \\
                 4: The data link layer / 243 \\
                 5: The network layer / 339 \\
                 6: The transport layer / 479 \\
                 7: The application layer / 577 \\
                 8: Network Security / \\
                 9: Reading list and bibliography / 767 \\
                 Appendix: queueing theory / \\
                 Index / 795",
  tableofcontents = "Preface \\
                 1: Introduction \\
                 Uses of Computer Networks \\
                 Network Hardware \\
                 Network Software \\
                 Reference Models \\
                 Example Networks \\
                 Network Standardization \\
                 Metric Units \\
                 Outline of the Rest of the Book \\
                 Summary \\
                 2: The Physical Layer \\
                 The Theoretical Basis For Data Communication \\
                 Guided Transmission Media \\
                 Wireless Transmission \\
                 Communication Satellites \\
                 The Public Switched Telephone Network \\
                 The Mobile Telephone System \\
                 Cable Television \\
                 Summary \\
                 3: The Data Link Layer \\
                 Data Link Layer Design Issues \\
                 Error Detection and Correction \\
                 Elementary Data Link Protocols \\
                 Sliding Window Protocols \\
                 Protocol Verification \\
                 Example Data Link Protocols \\
                 Summary \\
                 4: The Medium Access Control Sublayer \\
                 The Channel Allocation Problem \\
                 Multiple Access Protocols \\
                 Ethernet \\
                 Wireless LANs \\
                 Broadband Wireless \\
                 Bluetooth \\
                 Data Link Layer Switching \\
                 Summary \\
                 5: The Network Layer \\
                 Network Layer Design Issues \\
                 Routing Algorithms \\
                 Congestion Control Algorithms \\
                 Quality of Service \\
                 Internetworking \\
                 The Network Layer in the Internet \\
                 Summary \\
                 6: The Transport Layer \\
                 The Transport Service \\
                 Elements of Transport Protocols \\
                 A Simple Transport Protocol \\
                 The Internet Transport Protocols: UDP \\
                 The Internet Transport Protocols: TCP \\
                 Performance Issues \\
                 Summary \\
                 7: The Application Layer \\
                 DNS --- The Domain NameSystem \\
                 Electronic Mail \\
                 The World Wide Web \\
                 Multimedia \\
                 Summary \\
                 8: Network Security \\
                 Cryptography \\
                 Symmetric-Key Algorithms \\
                 Public-Key Algorithms \\
                 Digital Signatures \\
                 Management of Public Keys \\
                 Communication Security \\
                 Authentication Protocols \\
                 E-Mail Security \\
                 Web Security \\
                 Social Issues \\
                 Summary \\
                 9: Reading List and Bibliography \\
                 Suggestions For Further Reading \\
                 Alphabetical Bibliography \\
                 Index",
}

@Book{Tanenbaum:1992:MOS,
  author =       "Andrew S. Tanenbaum",
  title =        "Modern Operating Systems",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xx + 728",
  year =         "1992",
  ISBN =         "0-13-098310-1, 0-13-588187-0, 0-13-595752-4
                 (paperback)",
  ISBN-13 =      "978-0-13-098310-7, 978-0-13-588187-3,
                 978-0-13-595752-3 (paperback)",
  LCCN =         "QA76.76.O63 T359 1992",
  bibdate =      "Wed Dec 15 10:57:22 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/linux.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  ZMnumber =     "0801.68001",
  acknowledgement = ack-nhfb,
  tableofcontents = "Preface \\
                 Introduction / 1 \\
                 Processes and Threads / 71 \\
                 Deadlocks / 159 \\
                 Memory Management / 189 \\
                 Input/Output / 269 \\
                 File Systems / 379 \\
                 Multimedia Operating Systems / 453 \\
                 Multiple Processor Systems / 503 \\
                 Security / 583 \\
                 Case Study 1: Unix and Linux / 671 \\
                 Case Study 2: Windows 2000 / 763 \\
                 Operating System Design / 855 \\
                 Reading List and Bibliography / 901 \\
                 Index / 935",
}

@Book{Tanenbaum:1996:CN,
  author =       "Andrew S. Tanenbaum",
  title =        "Computer Networks",
  publisher =    pub-PHPTR,
  address =      pub-PHPTR:adr,
  edition =      "Third",
  pages =        "xvii + 814",
  year =         "1996",
  ISBN =         "0-13-349945-6",
  ISBN-13 =      "978-0-13-349945-2",
  LCCN =         "TK5105.5.T36 1996",
  bibdate =      "Wed Apr 24 18:29:07 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/internet.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$77.85",
  abstract =     "This classic reference for students, and anyone who
                 wants to know more about connectivity, has been totally
                 rewritten to reflect the networks of the 1990s and
                 beyond.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Introduction \\
                 2: Physical Layer \\
                 3: Data Link Layer \\
                 4: Medium Access Sublayer \\
                 5: Network Layer \\
                 6: Transport Layer \\
                 7: Application Layer \\
                 8: Reading List and Bibliography",
}

@Book{Tanenbaum:1997:OSD,
  author =       "Andrew S. Tanenbaum and Albert S. Woodhull",
  title =        "Operating Systems: Design and Implementation",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  edition =      "Second",
  pages =        "xvii + 939",
  year =         "1997",
  ISBN =         "0-13-638677-6",
  ISBN-13 =      "978-0-13-638677-3",
  LCCN =         "QA76.76.O63T36 1997",
  bibdate =      "Wed Dec 31 08:29:24 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/minix.bib",
  note =         "Includes CD-ROM.",
  price =        "US\$62.00",
  abstract =     "The Second Edition of this best-selling introductory
                 operating systems text is the only textbook that
                 successfully balances theory and practice. The authors
                 accomplish this important goal by first covering all
                 the fundamental operating systems concepts such as
                 processes, interprocess communication, input/output,
                 virtual memory, file systems, and security. These
                 principles are then illustrated through the use of a
                 small, but real, UNIX-like operating system called
                 MINIX that allows students to test their knowledge in
                 hands-on system design projects. Each book includes a
                 CD-ROM that contains the full MINIX source code and two
                 simulators for running MINIX on various computers.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "1: Introduction \\
                 2: Processes \\
                 3: Input/Output \\
                 4: Memory Management \\
                 5: File Systems \\
                 6: Reading List and Bibliography \\
                 Appendix A: MINIX Source Code Listing \\
                 Appendix B: Index to Files \\
                 Appendix C: Index to Symbols",
}

@Book{Tanenbaum:2008:MOS,
  author =       "Andrew S. Tanenbaum",
  title =        "Modern Operating Systems",
  publisher =    pub-PEARSON-PH,
  address =      pub-PEARSON-PH:adr,
  edition =      "Third",
  pages =        "xxvii + 1076",
  year =         "2008",
  ISBN =         "0-13-600663-9",
  ISBN-13 =      "978-0-13-600663-3",
  LCCN =         "QA76.76.O63 T359 2008",
  bibdate =      "Tue Apr 14 14:24:21 MDT 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/linux.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "Operating systems (Computers)",
  tableofcontents = "Introduction \\
                 Processes and threads \\
                 Memory management \\
                 File systems \\
                 Input/output \\
                 Deadlocks \\
                 Multimedia operating systems \\
                 Multiple processors systems \\
                 Security \\
                 Case study 1: Linux \\
                 Case study 2: Windows Vista \\
                 Case study 3: Symbian OS \\
                 Operating system design \\
                 Reading list and bibliography",
}

@PhdThesis{Tang:1993:TSS,
  author =       "Yuanhua Tang",
  title =        "Theoretical Studies on Second Messenger Dynamics",
  type =         "{Ph.D.} Thesis",
  school =       "Mathematics Department, University of Utah",
  address =      "Salt Lake City, UT, USA",
  pages =        "ix + 263",
  month =        dec,
  year =         "1993",
  bibdate =      "Sat Apr 27 07:20:37 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Tapscott:1996:DEP,
  author =       "Don Tapscott",
  title =        "The Digital Economy: Promise and Peril in the Age of
                 Networked Intelligence",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "xviii + 342",
  year =         "1996",
  ISBN =         "0-07-062200-0 (hardcover), 0-07-063342-8 (paperback),
                 0-07-137117-6 (e-book)",
  ISBN-13 =      "978-0-07-062200-5 (hardcover), 978-0-07-063342-1
                 (paperback), 978-0-07-137117-9 (e-book)",
  LCCN =         "HC79.I55 T368 1996",
  bibdate =      "Mon Jan 12 14:32:54 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$24.95",
  abstract =     "In this eagerly awaited follow-up to his best-selling
                 \booktitle{Paradigm Shift}, global IT expert Don
                 Tapscott answers the one question that burns on the
                 mind of every forward-looking executive and manager:
                 What does the new technology mean to me and my
                 business? In clear, jargon-free English, using actual
                 examples of leading-edge organizations who are
                 successfully riding the new IT wave, Don Tapscott
                 reveals how the new technology and business strategies
                 are transforming not only business processes but also
                 the way products and services are created and marketed,
                 the structure and goals of the enterprise, the dynamics
                 of competition, and all the rules for business success.
                 But the remarkable journey doesn't end there.
                 \booktitle{The Digital Economy} also takes you to the
                 epicenter of a new convergence of computing,
                 telecommunications, and entertainment. From Wal-Mart's
                 electronically linked purchasing systems to Sun
                 Microsystem's desktop university to Chase Manhattan
                 Bank's consumer video kiosks, and beyond, it discloses
                 how results-hungry organizations are moving past simple
                 reengineering to the complete IT-enabled transformation
                 of the corporation. \booktitle{The Digital Economy}
                 also tackles the dark side of the information highway
                 --- the first frank, balanced, and comprehensive look
                 at the perils of the revolution underway for every
                 business, society, and individual. With this book
                 Tapscott opens an international debate on the role of
                 business in the transition to the new economy and a new
                 society based on fairness, justice, and democracy.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "Introduction: the age of networked intelligence \\
                 Twelve themes of the new economy \\
                 The internetworked business \\
                 The new technology: say you want a revolution \\
                 The internetworked business at work \\
                 Internetworked government \\
                 Have network will travel \\
                 Learning in the digital economy \\
                 The new media industry \\
                 Leadership for the internetworked business \\
                 Privacy in the digital economy \\
                 The new responsibilities of business",
}

@Book{Tatar:1987:PGC,
  author =       "Deborah G. Tatar",
  title =        "A Programmer's Guide to {Common LISP}",
  publisher =    pub-DP,
  address =      pub-DP:adr,
  pages =        "x + 327",
  year =         "1987",
  ISBN =         "0-932376-87-8",
  ISBN-13 =      "978-0-932376-87-9",
  LCCN =         "QA76.73.C28 T38 1987",
  bibdate =      "Sun Jul 10 01:10:33 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See also \cite{Steele:1984:CLL}.",
  acknowledgement = ack-nhfb,
}

@Book{Taubes:1993:BSS,
  author =       "Gary Taubes",
  title =        "Bad science: the short life and weird times of cold
                 fusion",
  publisher =    pub-RANDOM-HOUSE,
  address =      pub-RANDOM-HOUSE:adr,
  pages =        "xxi + 503",
  year =         "1993",
  ISBN =         "0-394-58456-2",
  ISBN-13 =      "978-0-394-58456-0",
  LCCN =         "QC791.775.C64 T38 1993",
  bibdate =      "Fri Aug 8 06:50:27 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  price =        "US\$25.00 (Canada US\$32.50)",
  abstract =     "At 1:00 P.M., on March 23, 1989, two obscure
                 scientists at the University of Utah announced that
                 they had discovered salvation in a test tube - cold
                 nuclear fusion. The technology promised sale, cheap,
                 limitless energy, and the press played it as the
                 scientific breakthrough of the century. It would become
                 instead a fiasco of epidemic proportions, an
                 unforgettable morality tale in the scientific method:
                 what happens when reason is perverted by hope and
                 greed. Gary Taubes's Bad Science is the vivid,
                 dramatic, and definitive story of the astonishing quest
                 for cold fusion, from its premature birth in a Utah
                 turf war to its lingering and surreal death in a
                 laboratory in College Station, Texas. It is the story
                 of good scientists and bad, of heroes and charlatans,
                 and of a race in which thousands of researchers spent
                 tens of millions of dollars to prove or disprove the
                 existence of a canard. Drawing from interviews with
                 over 260 scientists, administrators, and journalists,
                 Taubes dissects the cold fusion episode with wit and
                 clarity, tracing the untold inside story of scientific
                 research gone awry and academic politics out of
                 control: from the devout physicist and his Department
                 of Energy funding agent who set the wheels of the
                 fiasco in motion, to the University of Utah president
                 whose sole dream was to turn his institution into an
                 intellectual powerhouse. Taubes unveils the darker side
                 of science, where politics, ambition, and misguided
                 obsession can corrupt its ethics and its purpose. Bad
                 Science is essential reading for anyone who wants to
                 understand how science functions and what can happen
                 when the scientific method is jettisoned in the pursuit
                 of wealth and glory. As a story of morality,
                 philosophy, and pathology, it is destined to become a
                 classic of science journalism.",
  acknowledgement = ack-nhfb,
  subject =      "Cold fusion; Koude kernfusie; Onderzoek; Bedrog;
                 Forschung; Geschichte; Kernfusion",
  tableofcontents = "Author's note \\
                 Prologue: The press conference \\
                 The meltdown \\
                 The competition \\
                 Autumn 1988 \\
                 January and February 1989 \\
                 February 26 to March 15, 1989 \\
                 March 16 to March 23, 1989: the wager \\
                 March 23 and 24, 1989: afterthought \\
                 A collective derangement of minds \\
                 The tail of the distribution \\
                 Epilogue",
}

@Book{Tausworthe:1977:SDCa,
  author =       "Robert C. Tausworthe",
  title =        "Standardized Development of Computer Software. {Part
                 I}. {Methods}",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xiii + 379",
  year =         "1977",
  ISBN =         "0-13-842195-1",
  ISBN-13 =      "978-0-13-842195-3",
  LCCN =         "QA76.6 T39 1977",
  bibdate =      "Wed Dec 15 10:57:27 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Tausworthe:1979:SDCb,
  author =       "Robert C. Tausworthe",
  title =        "Standardized Development of Computer Software. {Part
                 II}. {Standards}",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "x + 548",
  year =         "1979",
  ISBN =         "0-13-842203-6",
  ISBN-13 =      "978-0-13-842203-5",
  LCCN =         "QA76.6.T39 1976",
  bibdate =      "Wed Dec 15 10:58:23 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@TechReport{Tausworthe:methods,
  author =       "Robert C. Tausworthe",
  title =        "Standardized Development of Computer Software, Part
                 {I}. Methods",
  number =       "SP43-29",
  institution =  pub-JPL,
  address =      pub-JPL:adr,
  month =        jul,
  year =         "1976",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "379 pages.",
  acknowledgement = ack-nhfb,
}

@Book{Taylor:1925:TPCa,
  editor =       "Hugh S. (Hugh Stott) Taylor",
  title =        "A Treatise on Physical Chemistry: a Co-operative
                 Effort by a Group of Physical Chemists",
  volume =       "1",
  publisher =    pub-VAN-NOSTRAND-REINHOLD,
  address =      pub-VAN-NOSTRAND-REINHOLD:adr,
  pages =        "xi + 603 + 18 + 41",
  year =         "1925",
  LCCN =         "QD 453 T21t 1925",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Taylor:1925:TPCb,
  editor =       "Hugh S. Taylor",
  title =        "A Treatise on Physical Chemistry: a Co-operative
                 Effort by a Group of Physical Chemists",
  volume =       "2",
  publisher =    pub-VAN-NOSTRAND-REINHOLD,
  address =      pub-VAN-NOSTRAND-REINHOLD:adr,
  pages =        "ix + 701--1359 + 18 + 41",
  year =         "1925",
  LCCN =         "QD 453 T21t 1925",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Taylor:1963:IM,
  author =       "Edwin F. Taylor",
  title =        "Introductory Mechanics",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xvii + 423",
  year =         "1963",
  LCCN =         "QC127 .T3",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Taylor:1992:XOO,
  author =       "Colin B. Taylor",
  title =        "{X/Open} and open systems",
  volume =       "1",
  publisher =    pub-X-OPEN,
  address =      pub-X-OPEN:adr,
  pages =        "x + 118",
  year =         "1992",
  ISBN =         "1-872630-55-3",
  ISBN-13 =      "978-1-872630-55-7",
  LCCN =         "????",
  bibdate =      "Thu Sep 19 09:39:52 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "{X/Open} in action",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

@Article{Taylor:1995:RTP,
  author =       "Richard Taylor and Andrew Wiles",
  title =        "Ring-theoretic properties of certain {Hecke}
                 algebras",
  journal =      j-ANN-MATH,
  volume =       "142",
  pages =        "553--572",
  year =         "1995",
  bibdate =      "Sun May 02 07:55:01 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "This paper is a companion to \cite{Wiles:1995:MEC},
                 providing the remedy for the flaw in Wiles' 1993 proof
                 of Fermat's Last Theorem. See also
                 \cite{Singh:1997:FEE}.",
  acknowledgement = ack-nhfb,
}

@Book{Tedlow:2003:WDF,
  author =       "Richard S. Tedlow",
  title =        "The {Watson} Dynasty: the Fiery Reign and Troubled
                 Legacy of {IBM}'s Founding Father and Son",
  publisher =    "HarperBusiness",
  address =      "New York, NY, USA",
  pages =        "x + 340",
  year =         "2003",
  ISBN =         "0-06-001405-9",
  ISBN-13 =      "978-0-06-001405-6",
  LCCN =         "HD9696.2.U64 I258 2003",
  bibdate =      "Mon Apr 23 08:22:04 MDT 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/description/hc042/2003051145.html;
                 http://www.loc.gov/catdir/toc/fy045/2003051145.html",
  abstract =     "Traces the story of the father-and-son team at the
                 head of IBM, noting how their vision and frequent
                 conflicts with one another shaped the company, from its
                 rise to a prestigious blue-chip firm to its significant
                 losses in the 1980s and 1990s.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "Family-owned business enterprises; United States; Case
                 studies; Fathers and sons; Executives; Biography;
                 Watson, Thomas John; Watson, Thomas J.; International
                 Business Machines Corporation, history",
  subject-dates = "1874--1956; 1914--",
  tableofcontents = "Defining moments \\
                 The early years of the ``man of men'' \\
                 Watson and national cash \\
                 Crime and punishment \\
                 High water and hell \\
                 Down and out \\
                 Terrible Tommy Watson \\
                 Thomas J. Watson Sr. in 1893 and Thomas J. Watson Jr.
                 in 1933 \\
                 The searing insight \\
                 The Watson way \\
                 The big payoff \\
                 High time to grow up \\
                 Watson at war \\
                 Father, son, and Charley Kirk \\
                 God damn you, old man! \\
                 Siblings: a brief introduction \\
                 Awakening the electronic brain \\
                 Death of a salesman \\
                 On his own \\
                 The new Thomas Watson's new IBM \\
                 Threats from without and from within \\
                 The system/360 \\
                 The destruction of Dick Watson \\
                 Denouement for Dick and for Jane \\
                 Denouement for Tom \\
                 Denouement for IBM",
}

@Book{Tedlow:2006:AGL,
  author =       "Richard S. Tedlow",
  title =        "{Andy Grove}: the life and times of an {American}",
  publisher =    "Portfolio",
  address =      "New York, NY, USA",
  pages =        "xxii + 568 + 16",
  year =         "2006",
  ISBN =         "1-59184-139-9",
  ISBN-13 =      "978-1-59184-139-5",
  LCCN =         "HD9696.S44 T588 2006",
  bibdate =      "Mon Apr 23 08:18:31 MDT 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  remark =       "Grove is a co-founder of Intel Corporation.",
  subject =      "Grove, Andrew S; Chief executive officers; United
                 States; Biography",
  tableofcontents = "Preface: The trip you are about to take \\
                 Introduction \\
                 1: Andy Grove returns to Hungary \\
                 2: The Grove family, Hungary, and the early years of
                 World War II \\
                 3: Coming of age in Stalinist Hungary \\
                 4: Andy Grove in America \\
                 5. ``A hotheaded 30-year-old running around like a
                 drunken rat,'' or Andy Grove comes to the Valley of the
                 Heart's Delight \\
                 6: Off and limping \\
                 7: Orchestrated brilliance \\
                 8: The long and winding road \\
                 9: Andy Grove in 1986: at work and at home \\
                 10: The Valley of Death \\
                 11: The PC is it \\
                 12: Awesome Intel \\
                 13: Intel inside \\
                 14: We almost killed the company \\
                 15: Cultivating the creosote bush \\
                 16: That championship season \\
                 17: The buck stopped there: Bill Gates and Andy Grove
                 \\
                 18: Wintel \\
                 19: The Pentium launch: Intel meets the Internet \\
                 20: Life is what happens while you're making other
                 plans \\
                 21: The Darwinian device \\
                 22: What are you paranoid about these days? \\
                 23: The year of decision \\
                 24: Frozen in silicon \\
                 25: Andy Grove, ex-CEO \\
                 26: In think that experiment has been run \\
                 26: I think that experiment has been run \\
                 27: Andy and the Board \\
                 28: The bubble bursts \\
                 29: Outside Intel \\
                 30: Still swimming \\
                 Acknowledgments \\
                 Notes \\
                 Bibliography \\
                 Index",
}

@Book{Temple:1991:GCY,
  author =       "Robert K. G. Temple",
  title =        "The Genius of {China}: 3,000 Years of Science,
                 Discovery, and Invention",
  publisher =    "Prion",
  address =      "London, UK",
  pages =        "248",
  year =         "1991",
  ISBN =         "1-85375-078-6, 1-85375-292-4 (paperback)",
  ISBN-13 =      "978-1-85375-078-6, 978-1-85375-292-6 (paperback)",
  LCCN =         "M92.D00752; 02.E04877; 99.E01411",
  bibdate =      "Fri Apr 13 16:38:39 MDT 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 library.ox.ac.uk:210/ADVANCE",
  acknowledgement = ack-nhfb,
  remark =       "Originally published: New York: Simon and Schuster,
                 1986. Reprinted 1999 and 2002 under same ISBN.",
  subject =      "Science; China; History; Science and civilization;
                 Technology; Civilization",
}

@Book{Tenenbaum:1981:DSU,
  author =       "Aaron M. Tenenbaum and Moshe J. Augenstein",
  title =        "Data Structures Using {Pascal}",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xiv + 545",
  year =         "1981",
  ISBN =         "0-13-196501-8",
  ISBN-13 =      "978-0-13-196501-0",
  LCCN =         "QA76.9.D35 T46",
  bibdate =      "Wed Dec 15 10:58:37 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Prentice-Hall Software Series, Editor: Brian W.
                 Kernighan",
  acknowledgement = ack-nhfb,
  tableofcontents = "Information and meaning \\
                 The stack \\
                 Recursion \\
                 Queues and list \\
                 Pascal list processing \\
                 Graphs and their applications \\
                 Sorting \\
                 Searching \\
                 Scalar types in Pascal \\
                 Using one-dimensional arrays \\
                 Packed arrays \\
                 Arrays parameters \\
                 Value and variable parameters \\
                 Records in Pascal \\
                 Arrays of records \\
                 Scope identifiers \\
                 The with statement \\
                 Efficiency of record access \\
                 Packed records \\
                 Files of records",
}

@Book{Tent:2006:PMC,
  author =       "M. B. W. (Margaret B. W.) Tent",
  title =        "The {Prince of Mathematics}: {Carl Friedrich Gauss}",
  publisher =    pub-A-K-PETERS,
  address =      pub-A-K-PETERS:adr,
  pages =        "xviii + 245",
  year =         "2006",
  ISBN =         "1-56881-261-2",
  ISBN-13 =      "978-1-56881-261-8",
  LCCN =         "QA29.G3 T46 2006",
  bibdate =      "Fri Dec 23 07:07:08 MST 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Gauss, Carl Friedrich; Mathematicians; Germany;
                 Biography; Astronomers; Germany; Biography;
                 Cartographers; Germany; Biography",
  subject-dates = "1777--1855",
  tableofcontents = "Foreword \\
                 Preface \\
                 Acknowledgements \\
                 1: Child prodigy (1777--1788) \\
                 Counting \\
                 Sums \\
                 The Duke of Braunschweig \\
                 The schoolroom \\
                 Arithmetic \\
                 Early mathematics \\
                 2: The Duke's prot{\'e}g{\'e} (1788--1798) \\
                 Royal patronage \\
                 Gymnasium: high school \\
                 Independent study of mathematics \\
                 The regular 17-gon \\
                 Mathematical journal \\
                 Number theory \\
                 3: Gifted astronomer, father of a young family
                 (1798--1814) \\
                 Carl Friedrich Gauss, PhD \\
                 The planetoid Ceres \\
                 A wife and a child \\
                 The Duke and St. Petersburg \\
                 Professor of astronomy \\
                 Tragedy \\
                 Marriage to Minna Waldeck \\
                 The trip to Munich \\
                 The new observatory \\
                 Gauss' mother \\
                 4: Surveyor of Hannover, father of a growing family
                 (1815--1832) \\
                 Surveying \\
                 Summers on the road \\
                 Trouble with Eugen \\
                 5: Magnetic professor, prince of mathematics
                 (1833--1855) \\
                 Non-Euclidean geometry \\
                 Magnetism \\
                 The G{\"o}ttingen Seven \\
                 Looking back \\
                 Index",
}

@Book{Tent:2009:LEB,
  author =       "M. B. W. (Margaret B. W.) Tent",
  title =        "{Leonhard Euler} and the {Bernoullis}: mathematicians
                 from {Basel}",
  publisher =    pub-A-K-PETERS,
  address =      pub-A-K-PETERS:adr,
  pages =        "xix + 276",
  year =         "2009",
  ISBN =         "1-56881-464-X",
  ISBN-13 =      "978-1-56881-464-3",
  LCCN =         "QA28 .T46 2009",
  bibdate =      "Sat Apr 1 15:01:05 MDT 2017",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "In the 17th century, the small but culturally and
                 intellectually eminent city of Basel was the home of
                 one of the most prominent mathematical families of all
                 time, the Bernoullis, and their friend, protege, and
                 master Leonhard Euler. The author chronicles their
                 lives and achievements at a time when modern analysis
                 and its applications to physics burst on the scene and
                 created a methodological framework for modern science.
                 Written for young adults, this book conveys the
                 excitement of a scientific culture that impacts our
                 life to this day and will serve as an inspiration to
                 gifted young people to devote their lives to scientific
                 pursuits.",
  acknowledgement = ack-nhfb,
  author-dates = "1944--",
  libnote =      "Not in my library.",
  subject =      "Bernoulli, Jakob; Euler, Leonhard; Bernoulli family;
                 Bernoulli (Famille); Bernoulli family; Bernoulli,
                 Jakob; Euler, Leonhard; Euler, Leonhard; Bernoulli,
                 Jacques; Bernoulli; famille; Mathematicians;
                 Switzerland; Basel; Biography; Mathematics; History;
                 17th century; 18th century; Math{\'e}maticiens; Suisse;
                 B{\^a}le; Biographies; Math{\'e}matiques; Histoire; 17e
                 si{\`e}cle; 18e si{\`e}cle; Mathematicians;
                 Mathematics",
  subject-dates = "1654--1705; 1707--1783",
  tableofcontents = "1: Bernoulli's as Huguenots \\
                 2: Bernoulli Family in Frankfurt and Then Basel \\
                 3: Jacob Makes His First Steps in the Study of
                 Mathematics \\
                 4: His Little Brother Johann ``Helps'' Jacob with
                 Mathematics \\
                 5: Having Completed His Studies in Philosophy and
                 Theology, Jacob Moves On \\
                 6: Jacob Travels to Geneva and Meets Elizabeth
                 Waldkirch and Her Family \\
                 7: Jacob Teaches Elizabeth Waldkirch to Read and Write
                 Numbers and Words \\
                 8: Sundials, and Tutoring in France \\
                 9: Jacob Meets with Mathematicians in Paris \\
                 10: Jacob Travels to Holland and England \\
                 11: Jacob Settles into Life in Basel to Lecture and
                 Learn \\
                 12: Leibniz's Calculus vs. Newton's Fluxions \\
                 13: Johann Bernoulli Grows Up \\
                 14: Two Curves Studied by the Bernoullis: The Isochrone
                 and the Catenary \\
                 15: More Mathematical Challenges from the Bernoullis
                 \\
                 16: Jacob Bernoulli's Mathematics \\
                 17: Johann Bernoulli Returns to Basel with His Family
                 \\
                 18: Johann Bernoulli's Son Daniel Grows Up \\
                 19: Daniel Bernoulli, the Paris Prize, and the
                 Longitude Problem \\
                 20: Leonhard Euler \\
                 21: Leonhard Euler's Early Education \\
                 22: Leonhard Euler Goes to the Latin School in Basel
                 and Then on to the University \\
                 23: Daniel and Nicolaus Bernoulli Receive a Call to the
                 Academy at St. Petersburg \\
                 24: Academy of Sciences at St. Petersburg \\
                 25: Euler Begins His Career and Moves to St. Petersburg
                 \\
                 26: Daniel Bernoulli and Leonhard Euler: An Active
                 Scientific Partnership \\
                 27: St. Petersburg Paradox \\
                 28: Euler's Early Work in St. Petersburg \\
                 29: Daniel Returns to Basel, and Leonhard Euler Becomes
                 Professor of Mathematics at St. Petersburg \\
                 30: Daniel Bernoulli: A Famous Scholar \\
                 31: Leonhard Euler: Admired Professor at St. Petersburg
                 \\
                 32: Euler Becomes Blind in His Right Eye \\
                 33: St. Petersburg Loses Euler to Frederick the Great
                 of Prussia \\
                 34: Eulers Arrive at the Court of Frederick the Great
                 in Berlin \\
                 35: Euler's Scientific Work in Berlin \\
                 36: Euler's Work in Number Theory \\
                 37: Magic Squares \\
                 38: Catherine the Great Invites Euler to Return to St.
                 Petersburg \\
                 39: Basel Clan",
}

@Book{Teska:2007:PSM,
  author =       "Kirk Teska",
  title =        "Patent savvy for managers: spot and protect valuable
                 innovations in your company",
  publisher =    "Nolo Press",
  address =      "Berkeley, CA, USA",
  pages =        "278",
  year =         "2007",
  ISBN =         "1-4133-0694-2 (paperback)",
  ISBN-13 =      "978-1-4133-0694-1 (paperback)",
  LCCN =         "KF3114 .T37 2007",
  bibdate =      "Thu Oct 15 09:10:00 MDT 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/toc/ecip0714/2007013012.html",
  acknowledgement = ack-nhfb,
  subject =      "Patent laws and legislation; United States; Popular
                 works; Patents",
  tableofcontents = "No guarantees\ldots{} and other patent principles
                 \\
                 Does four include three? Case studies you can
                 understand \\
                 Anything under the sun (made by man): what's patentable
                 \\
                 The claim game: how to read a patent \\
                 What to do when your candy bar melts: capturing patents
                 \\
                 The long and winding road to ``Patent Pending'' \\
                 The good shepherd: patent prosecution and management
                 \\
                 The worldwide patent party \\
                 Live and let die: the exhausting effects of patent
                 litigation \\
                 Caveat emptor: buying and licensing patents",
}

@Book{Thatcher:1971:NWE,
  editor =       "Virginia Sarah Thatcher and Alexander McQueen",
  title =        "The New {Webster} Encyclopedic Dictionary of the
                 {English} Language",
  publisher =    "Consolidated Book Publishers",
  address =      "Chicago, IL, USA",
  pages =        "xx + 972 + 424",
  year =         "1971",
  ISBN =         "0-8326-0021-0",
  ISBN-13 =      "978-0-8326-0021-0",
  LCCN =         "PE1625 .N54 1974",
  bibdate =      "Sat Dec 24 15:34:54 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  remark =       "Twelve encyclopedic supplements: Synonyms and
                 antonyms.--Popular quotations.--Classical
                 mythology.--Foreign words and phrases.--Students' and
                 authors' manual.--Secretaries guide.--Business law for
                 layman.--Business and finance.--Names and their
                 meanings.--The story of America in pictures.--Color
                 appendices; Flags of the world.--Presidents of the
                 United States.",
  subject =      "English language; Dictionaries; Encyclopedias and
                 dictionaries",
}

@Book{Thoman:2008:MMG,
  author =       "Peter Thoman",
  title =        "Multigrid methods on {GPUs}: high performance {GPGPU}
                 solvers for partial differential equations",
  publisher =    "VDM Verlag Dr. M{\"u}ller",
  address =      "Saarbr{\"u}cken, Germany",
  pages =        "viii + 61",
  year =         "2008",
  ISBN =         "3-8364-9970-3",
  ISBN-13 =      "978-3-8364-9970-5",
  LCCN =         "QA297 .T45 2008",
  bibdate =      "Mon Apr 5 18:39:01 MDT 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.libris.kb.se:210/libr",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  xxpages =      "312",
}

@Book{Thomas:1982:UGU,
  author =       "Rebecca Thomas and Jean Yates",
  title =        "A User Guide to the {UNIX} System",
  publisher =    pub-OSBORNE-MCGRAW-HILL,
  address =      pub-OSBORNE-MCGRAW-HILL:adr,
  pages =        "xi + 508",
  year =         "1982",
  ISBN =         "0-931988-71-3",
  ISBN-13 =      "978-0-931988-71-4",
  LCCN =         "QA76.8.U65 T45 1982",
  bibdate =      "Wed Dec 15 10:58:50 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Thomas:2001:PRP,
  author =       "David Thomas and Andrew Hunt",
  title =        "Programming {Ruby}: The Pragmatic Programmer's Guide",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xxxii + 564",
  year =         "2001",
  ISBN =         "0-201-71089-7 (paperback)",
  ISBN-13 =      "978-0-201-71089-2 (paperback)",
  LCCN =         "QA76.64 .T494 2001",
  bibdate =      "Fri Feb 02 09:00:36 2001",
  bibsource =    "http://www.ruby-lang.org/en/;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$42.95",
  URL =          "http://cseng.aw.com/book/0,3828,0201710897,00.html;
                 http://cseng.aw.com/catalog/isbn/0,3837,0+0-201-71089-7,00.html",
  abstract =     "Ruby is a true object-oriented programming language
                 that makes the craft of programming easier. Ruby is a
                 transparent language: It doesn't obscure your program
                 behind unnecessary syntax or reams of extra support
                 code. Guided by the Principle of Least Surprise, Ruby
                 embodies the values of consistency and simplicity of
                 expression. It's more than a programming language: It's
                 a concise way of expressing ideas. Ruby supports
                 natural intelligence --- yours. \booktitle{Programming
                 Ruby: The Pragmatic Programmer's Guide} is your
                 complete Ruby resource. It provides a tutorial and
                 overview of Ruby version 1.6; a detailed description of
                 the language's structure, syntax, and operation; a
                 guide to building applications with Ruby; and a
                 comprehensive library reference.'",
  acknowledgement = ack-nhfb,
  keywords =     "Object-oriented programming (computer science); Ruby
                 (computer program language)",
  libnote =      "Not yet in my library.",
  tableofcontents = "Facets of ruby \\
                 Ruby new \\
                 Classes, objects, and variables \\
                 Containers, blocks, and iterators \\
                 Standard types \\
                 More about methods \\
                 Expressions \\
                 Exceptions, catch, and throw \\
                 Modules \\
                 Basic input and output \\
                 Threads and processes \\
                 When trouble strikes \\
                 Ruby in its setting \\
                 Ruby and its worlds \\
                 Ruby and the web \\
                 Ruby Tk \\
                 Ruby and Microsoft Windows \\
                 Extending ruby \\
                 Ruby Crystallized \\
                 Ruby language \\
                 Classes and objects \\
                 Locking ruby in the safe \\
                 Reflections, object space, and distributed Ruby \\
                 Ruby library reference \\
                 Built-in classes \\
                 Built-in modules \\
                 Standard libraru \\
                 Object-oriented design libraries \\
                 Network and web libraries \\
                 Microsoft Windows support",
}

@Book{Thompson:1981:MA,
  author =       "Morris M. Thompson",
  title =        "Maps for {America}",
  publisher =    pub-USGPO,
  address =      pub-USGPO:adr,
  pages =        "xiv + 265",
  year =         "1981",
  LCCN =         "GA405 .T46 1981",
  bibdate =      "Wed Dec 15 18:36:25 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$11.00",
  acknowledgement = ack-nhfb,
}

@Book{Thompson:1997:ACMb,
  author =       "William J. (William Jackson) Thompson",
  title =        "Atlas for computing mathematical functions: an
                 illustrated guide for practitioners with programs in
                 {Fortran 90} and {Mathematica}",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xiv + 888",
  year =         "1997",
  ISBN =         "0-471-18171-4 (cloth)",
  ISBN-13 =      "978-0-471-18171-2 (cloth)",
  LCCN =         "QA331.T386 1997",
  bibdate =      "Fri May 21 07:11:19 MDT 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Includes CD-ROM.",
  acknowledgement = ack-nhfb,
  annote =       "A Wiley-Interscience publication. System requirements
                 for accompanying computer disc: Windows; Macintosh
                 compatible.",
  keywords =     "FORTRAN (Computer program language); Functions --
                 Computer programs; Mathematica (Computer program
                 language); Science -- Mathematics -- Computer
                 programs",
  tableofcontents = "The Atlas of Functions \\
                 The Computer Interface \\
                 THE FUNCTIONS \\
                 Introduction to the Functions \\
                 A Visual Tour of the Atlas \\
                 Computing Strategies \\
                 Elementary Transcendental Functions \\
                 Exponential Integrals and Related Functions \\
                 Gamma and Beta Functions \\
                 Combinatorial Functions \\
                 Number Theory Functions \\
                 Probability Distributions \\
                 Error Function, Frensel and Dawson Integrals \\
                 Orthogonal Polynomials \\
                 Legendre Functions \\
                 Spheroidal Wave Functions \\
                 Bessel Functions \\
                 Struve, Anger, and Weber Functions \\
                 Hypergeometric Functions and Coulomb Wave Functions \\
                 Elliptic Integrals and Elliptic Functions \\
                 Parabolic Cylinder Functions \\
                 Miscellaneous Functions for Science and Engineering \\
                 THE COMPUTER INTERFACE \\
                 The Mathematica Notebooks \\
                 The Fortran Driver Programs \\
                 Appendix \\
                 Indexes",
}

@Book{Thompson:2000:PHN,
  author =       "Robert Bruce Thompson and Barbara Fritchman Thompson",
  title =        "{PC} Hardware in a Nutshell",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xxi + 501",
  month =        oct,
  year =         "2000",
  ISBN =         "1-56592-599-8",
  ISBN-13 =      "978-1-56592-599-1",
  LCCN =         "TK7887.5 .T48 2000",
  bibdate =      "Thu Apr 12 11:06:32 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/ora.bib",
  price =        "US\$29.95",
  abstract =     "\booktitle{PC Hardware in a Nutshell} is a guide to
                 buying, building, upgrading, and repairing Intel-based
                 PCs, presented in O'Reilly's concise ``In a Nutshell''
                 Format.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Fundamentals \\
                 Working on PCs \\
                 Motherboards \\
                 Processors \\
                 Memory \\
                 Floppy disk drives \\
                 Floppy disk drive replacements \\
                 Removable hard disk drives \\
                 Tape drives \\
                 CD-ROM drives \\
                 CD-R and CD-RW drives \\
                 DVD drives \\
                 Hard disk interfaces \\
                 Hard disk drives \\
                 Video adapters \\
                 Monitors \\
                 Sound cards \\
                 Speakers and headphones \\
                 Keyboards \\
                 Mice and trackballs \\
                 Game controllers \\
                 Cases \\
                 Power supplies \\
                 Backup power supplies \\
                 Designing a PC \\
                 Building a PC",
}

@Article{Thompson:trusting-trust,
  author =       "Ken Thompson",
  title =        "Reflections on Trusting Trust",
  journal =      j-CACM,
  volume =       "27",
  number =       "8",
  pages =        "761--763",
  month =        aug,
  year =         "1984",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Thomson:2008:LMG,
  author =       "Keith Stewart Thomson",
  title =        "The legacy of the {Mastodon}: the golden age of
                 fossils in {America}",
  publisher =    pub-YALE,
  address =      pub-YALE:adr,
  pages =        "xvii + 386 + 16",
  year =         "2008",
  ISBN =         "0-300-11704-3",
  ISBN-13 =      "978-0-300-11704-2",
  LCCN =         "QE882.P8 T46 2008",
  bibdate =      "Thu Apr 15 06:40:49 MDT 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 library.ox.ac.uk:210/ADVANCE",
  acknowledgement = ack-nhfb,
  subject =      "mastodons; North America; mammoths; mammals, fossil;
                 paleontology; United States; history; 18th Century;
                 19th Century",
  tableofcontents = "Part one: The Jeffersonians \\
                 Fossil hunters on the frontier \\
                 Big Bone Lick \\
                 Franklin, Jefferson, and the incognitum \\
                 Jefferson's ``great-claw'' and a world about to change
                 \\
                 The first American dinosaurs: an eighteenth-century
                 mystery story \\
                 Fossils and show business: Mr. Peale's Mastodon \\
                 Part two: Fossils and geology \\
                 Fossils and extinction: dangerous ideas \\
                 Mary Anning's world \\
                 An American natural science \\
                 An American geology \\
                 Bad lands: no time for ideas \\
                 Dr. Leidy's dinosaur \\
                 Ferdinand Vandiveer Hayden \\
                 Part three: Giant Saurians and horned mammals \\
                 Kansas and a new regime \\
                 Entry of the gladiators \\
                 Riding the rails \\
                 The first Yale college expedition \\
                 The competition begins \\
                 Buffalo land: who was Professor Paleozoic? \\
                 1872: the year of conflict \\
                 The case of the great horned mammals \\
                 Going separate ways \\
                 Two into four won't go \\
                 To the Black Hills \\
                 To the Judith River \\
                 Part four: Toward the twentieth century \\
                 The rise of dinosaurs \\
                 The good, the bad, and the ugly \\
                 Going public \\
                 1890: the end of the beginning \\
                 Appendixes \\
                 The geological column \\
                 Leidy on evolution \\
                 Cope on evolution",
}

@Book{tHooft:2014:TPT,
  author =       "Gerard {'t Hooft} and S. (Stefan) Vandoren and Steven
                 Weinberg",
  title =        "Time in Powers of Ten: Natural Phenomena and Their
                 Timescales",
  publisher =    pub-WORLD-SCI,
  address =      pub-WORLD-SCI:adr,
  pages =        "xviii + 212",
  year =         "2014",
  ISBN =         "981-4489-80-8 (hardcover), 981-4489-81-6 (paperback)",
  ISBN-13 =      "978-981-4489-80-5 (hardcover), 978-981-4489-81-2
                 (paperback)",
  LCCN =         "QB981 .H72 2014",
  bibdate =      "Wed Oct 15 14:50:26 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.worldscientific.com/action/doSearch?AllField=981-4489-80-8",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  remark =       "With a foreword by Steven Weinberg. Translation by
                 Saskia Eisberg-'t Hooft of Dutch original
                 \booktitle{Tijd in machten van tien:
                 natuurverschijnselen en hun tijdschalen}. Diemen: Veen
                 Magazines, 2011.",
  subject =      "science; miscellanea; time; time",
  tableofcontents = "Front Matter / i--xviii \\
                 1: $10^{0}$ = 1: 1 second / 1--5 \\
                 2: $10^{1}$ = 10: 10 seconds / 6--9 \\
                 3: $10^{2}$ = 100: 100 seconds = 1 minute, 40 seconds /
                 10--14 \\
                 4: $10^{3}$ = 1,000: 1,000 seconds = 16 minutes, 40
                 seconds / 15--18 \\
                 5: $10^{4}$ = 10,000: 10,000 seconds = 2.78 hours /
                 19--23 \\
                 6: $10^{5}$ = 100,000: $10^{5}$ seconds = 1.16 days =
                 27.78 hours / 24--27 \\
                 7: $10^{6}$ = 1,000,000 = 1 million: $10^{6}$ seconds =
                 11.57 days = 1.65 weeks / 28--31 \\
                 8: $10^{6.41}$ = 2,592,000: $10^{6.41}$ seconds = 30
                 days = 1 month / 32--36 \\
                 9: $10^{7}$ = 10 million: $10^{7}$ seconds = 115.74
                 days = 3.86 months / 37--40 \\
                 10: $10^{8}$ = 100 million: $10^{8}$ seconds = 3.17
                 years / 41--44 \\
                 11: $10^{9}$ = 1 billion: $10^{9}$ seconds = 31.7 years
                 / 45--49 \\
                 12: $10^{10}$ = 10 billion: $10^{10}$ seconds = 317
                 years / 50--55 \\
                 13: $10^{11}$ = 100 billion: $10^{11}$ seconds = 3,171
                 years / 56--59 \\
                 14: $10^{12}$ = 1 trillion: $10^{12}$ seconds = 31,710
                 years / 60--63 \\
                 15: $10^{13}$ = 10 trillion: $10^{13}$ seconds =
                 317,098 years / 64--67 \\
                 16: $10^{14}$ = 100 trillion: $10^{14}$ seconds = 3.17
                 million years / 68--71 \\
                 17: $10^{15}$ = 1 quadrillion: $10^{15}$ seconds = 31.7
                 million years / 72--75 \\
                 18: $10^{16}$ = 10 quadrillion: $10^{16}$ seconds = 317
                 million years / 76--78 \\
                 19: $10^{17}$ = 100 quadrillion: $10^{17}$ seconds =
                 3.17 billion years / 79--84 \\
                 20: The Large Timescales: $10^{18}$ seconds = 31.7
                 billion years / 85--91 \\
                 21: The Dark Eternities: $10^{32}$ seconds: to infinity
                 and beyond / 92--101 \\
                 22: Small Timescales: $10^{-44}$ to $10^{-26}$ seconds
                 / 102--111 \\
                 23: $10^{-25}$: $10^{-25}$ seconds / 112--113 \\
                 24: $10^{-24}$: $10^{-24}$ seconds = 1 yoctosecond /
                 114--116 \\
                 25: $10^{-23}$: $10^{-23}$ seconds = 10 yoctoseconds /
                 117--118 \\
                 26: $10^{-22}$: $10^{-22}$ seconds = 100 yoctoseconds /
                 119 \\
                 27: $10^{-21}$: $10^{-21}$ seconds = 1 zeptosecond /
                 120--121 \\
                 28: $10^{-20}$: $10^{-20}$ seconds = 10 zeptoseconds /
                 122--123 \\
                 29: $10^{-19}$: $10^{-19}$ seconds = 100 zeptoseconds /
                 124--126 \\
                 30: $10^{-18}$: $10^{-18}$ seconds = 1 attosecond /
                 127--128 \\
                 31: $10^{-17}$: $10^{-17}$ seconds = 10 attoseconds /
                 129--130 \\
                 32: $10^{-16}$: $10^{-16}$ seconds = 100 attoseconds /
                 131--133 \\
                 33: $10^{-15}$: $10^{-15}$ seconds = 1 femtosecond /
                 134--135 \\
                 34: $10^{-14}$: $10^{-14}$ seconds = 10 femtoseconds /
                 136--137 \\
                 35: $10^{-13}$: $10^{-13}$ seconds = 100 femtoseconds /
                 138--140 \\
                 36: $10^{-12}$: $10^{-12}$ seconds = 1 picosecond /
                 141--143 \\
                 37: $10^{-11}$: $10^{-11}$ seconds = 10 picoseconds /
                 144--146 \\
                 38: $10^{-10}$: $10^{-10}$ seconds = 100 picoseconds /
                 147--150 \\
                 39: $10^{-9}$: $10^{-9}$ seconds = 1 nanosecond /
                 151--152 \\
                 40: $10^{-8}$: $10^{-8}$ seconds = 10 nanoseconds /
                 153--155 \\
                 41: $10^{-7}$: $10^{-7}$ seconds = 100 nanoseconds /
                 156--157 \\
                 42: $10^{-6}$: $10^{-6}$ seconds = 1 microsecond /
                 158--161 \\
                 43: $10^{-5}$: $10^{-5}$ seconds = 10 microseconds /
                 162--165 \\
                 44: $10^{-4}$: $10^{-4}$ seconds = 100 microseconds =
                 0.0001 seconds / 166--168 \\
                 45: $10^{-3}$: $10^{-3}$ seconds = 1 millisecond =
                 0.001 seconds / 169--172 \\
                 46: $10^{-2}$: $10^{-2}$ seconds = 10 milliseconds =
                 0.01 seconds / 173--175 \\
                 47: $10^{-1}$: $10^{-1}$ seconds = 100 milliseconds =
                 0.1 seconds / 176--179 \\
                 48: $10^{0}$: $10^{0}$ seconds = 1 second / 180--183
                 \\
                 Back Matter / 185--212",
}

@Book{Thulstrup:1980:ALM,
  author =       "Erik Waaben Thulstrup",
  title =        "Aspects of the Linear and Magnetic Circular Dichroism
                 of Planar Organic Molecules",
  volume =       "14",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "vi + 100",
  year =         "1980",
  ISBN =         "0-387-09754-6",
  ISBN-13 =      "978-0-387-09754-1",
  LCCN =         "QD476 .T45",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Lecture Notes in Chemistry",
  acknowledgement = ack-nhfb,
}

@Book{Tinkham:1964:GTQ,
  author =       "Michael Tinkham",
  title =        "Group Theory and Quantum Mechanics",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "xii + 340",
  year =         "1964",
  LCCN =         "QC174.5 .T589 1964",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/w/wigner-eugene.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Preface / v \\
                 Introduction / 1 \\
                 1-1 The Nature of the Problem / 1 \\
                 1-2 The Role of Symmetry / 3 \\
                 2 Abstract Group Theory / 6 \\
                 2-1 Definitions and Nomenclature / 6 \\
                 2-2 Illustrative Examples / 7 \\
                 2-3 Rearrangement Theorem / 8 \\
                 2-4 Cyclic Groups / 9 \\
                 2-5 Subgroups and Cosets / 9 \\
                 2-6 Example Groups of Finite Order / 10 \\
                 2-7 Conjugate Elements and Class Structure / 12 \\
                 2-8 Normal Divisors and Factor Groups / 13 \\
                 2-9 Class Multiplication / 15 \\
                 Exercises / 16 \\
                 References / 17 \\
                 3 Theory of Group Representations / 18 \\
                 3-1 Definitions / 18 \\
                 3-2 Proof of the Orthogonality Theorem / 20 \\
                 3-3 The Character of a Representation / 25 \\
                 3-4 Construction of Character Tables / 28 \\
                 3-5 Decomposition of Reducible Representations / 29 \\
                 3-6 Application of Representation Theory in Quantum
                 Mechanics / 31 \\
                 3-7 Illustrative Representations of Abelian Groups / 37
                 \\
                 3-8 Basis Functions for Irreducible Representations /
                 39 \\
                 3-9 Direct-product Groups / 43 \\
                 3-10 Direct-product Representations within a Group / 46
                 \\
                 Exercises / 47 \\
                 References / 48 \\
                 4 Physical Applications of Group Theory / 50 \\
                 4-1 Crystal-symmetry Operators / 51 \\
                 4-2 The Crystallographic Point Groups / 54 \\
                 4-3 Irreducible Representations of the Point Groups /
                 62 \\
                 4-4 Elementary Representations of the Three-dimensional
                 Rotation Group / 65 \\
                 4-5 Crystal-field Splitting of Atomic Energy Levels /
                 67 \\
                 4-6 Intermediate Crystal-field-splitting Case / 69 \\
                 4-7 Weak-crystal-field Case and Crystal Double Groups /
                 75 \\
                 4-8 Introduction of Spin Effects in the Medium-field
                 Case / 78 \\
                 4-9 Group-theoretical Matrix-element Theorems / 80 \\
                 4-10 Selection Rules and Parity / 82 \\
                 4-11 Directed Valence / 87 \\
                 4-12 Application of Group Theory to Directed Valence /
                 89 \\
                 Exercises / 92 \\
                 References / 93 \\
                 5 Full Rotation Group and Angular Momentum / 94 \\
                 5-1 Rotational Transformation Properties and Angular
                 Momentum / 94 \\
                 5-2 Continuous Groups / 98 \\
                 5-3 Representation of Rotations through Eulerian Angles
                 / 101 \\
                 5-4 Homomorphism with the Unitary Group / 103 \\
                 5-5 Representations of the Unitary Group / 106 \\
                 5-6 Representation of the Rotation Group by
                 Representations of the Unitary Group / 109 \\
                 5-7 Application of the Rotation-representation Matrices
                 / 111 \\
                 5-8 Vector Model for Addition of Angular Momenta / 115
                 \\
                 5-9 The Wigner or Clebsch--Gordan Coefficients / 117
                 \\
                 5-10 Notation, Tabulations, and Symmetry Properties of
                 the Wigner Coefficients / 121 \\
                 5-11 Tensor Operators / 124 \\
                 5-12 The Wigner--Eckart Theorem / 131 \\
                 5-13 The Racah Coefficients / 133 \\
                 5-14 Application of Racah Coefficients / 137 \\
                 5-15 The Rotation--Inversion Group / 139 \\
                 5-16 Time-reversal Symmetry / 141 \\
                 5-17 More General Invariances / 147 \\
                 Exercises / 151 \\
                 References / 153 \\
                 6 Quantum Mechanics of Atoms / 154 \\
                 6-1 Review of Elementary Atomic Structure and
                 Nomenclature / 155 \\
                 6-2 The Hamiltonian / 157 \\
                 6-3 Approximate Eigenfunctions / 157 \\
                 6-4 Calculation of Matrix Elements between
                 Determinantal Wavefunctions / 162 \\
                 6-5 Hartree--Fock Method / 167 \\
                 6-6 Calculation of L-S-term Energies / 170 \\
                 6-7 Evaluation of Matrix Elements of the Energy / 173
                 \\
                 6-8 Eigenfunctions and Angular-momentum Operations /
                 178 \\
                 6-9 Calculation of Fine Structure / 181 \\
                 6-10 Zeeman Effect / 188 \\
                 6-11 Magnetic Hyperfine Structure / 193 \\
                 6-12 Electric Hyperfine Structure / 201 \\
                 Exercises / 206 \\
                 References / 208 \\
                 7 Molecular Quantum Mechanics / 210 \\
                 7-1 Born--Oppenheimer Approximation / 210 \\
                 7-2 Simple Electronic Eigenfunctions / 213 \\
                 7-3 Irreducible Representations for Linear Molecules /
                 216 \\
                 7-4 The Hydrogen Molecule / 219 \\
                 7-5 Molecular Orbitals / 220 \\
                 7-6 Heitler--London Method / 223 \\
                 7-7 Orthogonal Atomic Orbitals / 226 \\
                 7-8 Group Theory and Molecular Orbitals / 227 \\
                 7-9 Selection Rules for Electronic Transitions / 233
                 \\
                 7-10 Vibration of Diatomic Molecules / 234 \\
                 7-11 Normal Modes in Polyatomic Molecules / 238 \\
                 7-12 Group Theory and Normal Modes / 242 \\
                 7-13 Selection Rules for Vibrational Transitions / 248
                 \\
                 7-14 Molecular Rotation / 250 \\
                 7-15 Effect of Nuclear Statistics on Molecular Rotation
                 / 252 \\
                 7-16 Asymmetric Rotor / 255 \\
                 7-17 Vibration--Rotation Interaction / 257 \\
                 7-18 Rotation--Electronic Coupling / 260 \\
                 Exercises / 264 \\
                 References / 266 \\
                 8 Solid-state Theory / 267 \\
                 8-1 Symmetry Properties in Solids / 267 \\
                 8-2 The Reciprocal Lattice and Brillouin Zones / 270
                 \\
                 8-3 Form of Energy-band Wavefunctions / 275 \\
                 8-4 Crystal Symmetry and the Group of the $k$ Vector /
                 279 \\
                 8-5 Pictorial Consideration of Eigenfunctions / 281 \\
                 8-6 Formal Consideration of Degeneracy and
                 Compatibility / 284 \\
                 8-7 Group Theory and the Plane-wave Approximation / 290
                 \\
                 8-8 Connection between Tight- and Loose-binding
                 Approximations / 293 \\
                 8-9 Spin-orbit Coupling in Band Theory / 295 \\
                 8-10 Time Reversal in Band Theory / 297 \\
                 8-11 Magnetic Crystal Groups / 299 \\
                 8-12 Symmetries of Magnetic Structures / 303 \\
                 8-13 The Landau Theory of Second-order Phase
                 Transitions / 309 \\
                 8-14 Irreducible Representations of Magnetic Groups /
                 311 \\
                 Exercises / 313 \\
                 References / 315 \\
                 Appendix A Review of Vectors, Vector Spaces, and
                 Matrices / 317 \\
                 B Character Tables for Point-symmetry Groups / 323 \\
                 C Tables of $c^k$ and $a^k$ Coefficients for $s$, $p$,
                 and $d$ Electrons / 331 \\
                 Index / 335",
  xxISBN =       "none",
}

@Book{Tipler:1976:P,
  author =       "Paul A. Tipler",
  title =        "Physics",
  publisher =    "Worth Publishers, Inc.",
  address =      "New York, NY, USA",
  pages =        "xxvi + 1026",
  year =         "1976",
  ISBN =         "0-87901-041-X",
  ISBN-13 =      "978-0-87901-041-6",
  LCCN =         "QC21.2.T548",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Todino:1987:UUU,
  author =       "Grace Todino",
  title =        "Using {UUCP} and Usenet",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xv + 194",
  month =        jul,
  year =         "1987",
  ISBN =         "0-937175-10-2",
  ISBN-13 =      "978-0-937175-10-1",
  LCCN =         "QA 76.76 O63 T63 1991",
  bibdate =      "Wed Dec 15 10:58:52 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Todino:1993:LUO,
  author =       "Grace Todino and John Strang and Jerry Peek",
  title =        "Learning the {UNIX} Operating System",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xv + 92",
  month =        aug,
  year =         "1993",
  ISBN =         "1-56592-060-0",
  ISBN-13 =      "978-1-56592-060-6",
  LCCN =         "QA76.76.O63 T62 1994",
  bibdate =      "Mon Jan 3 17:39:58 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$9.95",
  series =       "A Nutshell handbook",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0915/94242752-b.html;
                 http://www.loc.gov/catdir/enhancements/fy0915/94242752-d.html;
                 http://www.loc.gov/catdir/enhancements/fy1113/94242752-t.html",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "UNIX (Computer file); Operating systems (Computers)",
}

@Book{Tolstov:1962:FS,
  author =       "Georgi P. Tolstov",
  title =        "{Fourier} Series",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "336",
  year =         "1962",
  LCCN =         "QA404 .T573",
  bibdate =      "Wed Dec 15 18:37:08 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Tondo:1989:CAB,
  author =       "Clovis L. Tondo and Scott E. Gimpel",
  title =        "The {C} Answer Book: Solutions to the Exercises in
                 {The C Programming Language}",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  edition =      "Second",
  pages =        "208",
  year =         "1989",
  ISBN =         "0-13-109653-2",
  ISBN-13 =      "978-0-13-109653-0",
  LCCN =         "QA76.73 C15 T66 1989",
  bibdate =      "Tue Sep 28 18:53:19 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  note =         "This book contains answers to the problems in
                 \cite{Kernighan:1988:CPL}.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
}

@Article{TorresyQuevedo:1915:EAS,
  author =       "L. {Torres y Quevedo}",
  title =        "Essais sur l'automatique. Sa definition. {{\'E}}tendue
                 th{\'e}orique de ses applications ({French}) [{Essays}
                 on automation. {Its} definition. {Theoretical} extent
                 of its applications]",
  journal =      j-REV-GEN-SCI-PURES-APPL,
  volume =       "??",
  number =       "??",
  pages =        "601--611",
  day =          "15",
  month =        nov,
  year =         "1915",
  ISSN =         "0370-7431",
  bibdate =      "Wed Oct 13 11:15:08 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Reprinted in \cite[\S 2.5]{Randell:1982:ODC}.
                 Translated by Mr. R. Basu.",
  acknowledgement = ack-nhfb,
  language =     "French",
}

@Book{Toy:1986:CHS,
  author =       "Wing N. Toy and Benjamin Zee",
  title =        "Computer Hardware\slash Software Architecture",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xviii + 446",
  year =         "1986",
  ISBN =         "0-13-163502-6",
  ISBN-13 =      "978-0-13-163502-9",
  LCCN =         "QA76.9A73 T68 1986",
  bibdate =      "Thu Oct 5 08:34:03 MDT 2023",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "https://archive.org/details/computerhardware0000toyw",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  remark =       "Recommended on the TUHS (The Unix Heritage Society)
                 mailing list on 05 October 2023.",
  subject =      "Computer architecture; Ordinateurs; Architecture",
  tableofcontents = "1: Overview of computer structure / 1 \\
                 2: Concepts of high-level languages / 52 \\
                 [remaining contents not yet identified]",
}

@Book{Trefethen:2000:SMM,
  author =       "Lloyd N. Trefethen",
  title =        "Spectral Methods in {MATLAB}",
  publisher =    pub-SIAM,
  address =      pub-SIAM:adr,
  pages =        "xvi + 165",
  year =         "2000",
  ISBN =         "0-89871-465-6 (paperback), 0-89871-959-3 (e-book)",
  ISBN-13 =      "978-0-89871-465-4 (paperback), 978-0-89871-959-8
                 (e-book)",
  LCCN =         "QA377 .T65 2000",
  MRclass =      "65-01 (65-04)",
  MRnumber =     "MR1776072 (2001c:65001)",
  bibdate =      "Tue Jan 23 09:04:41 2001",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/t/trefethen-lloyd-n.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/matlab.bib;
                 https://www.math.utah.edu/pub/tex/bib/numana2000.bib",
  series =       "Software, environments, tools",
  abstract =     "This is the only book on spectral methods built around
                 MATLAB programs. Along with finite differences and
                 finite elements, spectral methods are one of the three
                 main technologies for solving partial differential
                 equations on computers. Since spectral methods involve
                 significant linear algebra and graphics they are very
                 suitable for the high level programming of MATLAB. This
                 hands-on introduction is built around forty short and
                 powerful MATLAB programs, which the reader can download
                 from the World Wide Web. This book presents the key
                 ideas along with many figures, examples, and short,
                 elegant MATLAB programs for readers to adapt to their
                 own needs. It covers ODE and PDE boundary value
                 problems, eigenvalues and pseudospectra, linear and
                 nonlinear waves, and numerical quadrature.",
  acknowledgement = ack-njh,
  keywords =     "differential equations, partial --- numerical
                 solutions --- data processing; Matlab; spectral theory
                 (mathematics)",
  tableofcontents = "Preface \\
                 Acknowledgments \\
                 A note on the MATLAB programs \\
                 1. Differentiation matrices \\
                 2. Unbounded grids: The semidiscrete Fourier transform
                 \\
                 3. Periodic grids --- The DFT and FFT \\
                 4. Smoothness and spectral accuracy \\
                 5. Polynomial interpolation and clustered grids \\
                 6. Chebyshev differentiation matrices \\
                 7. Boundary value problems \\
                 8. Chebyshev series and the FFT \\
                 9. Eigenvalues and pseudospectra \\
                 10. Time-stepping and stability regions \\
                 11. Polar coordinates \\
                 12. Integrals and quadrature formulas \\
                 13. More about boundary conditions \\
                 14. Fourth-order problems \\
                 Afterword \\
                 Bibliography \\
                 Index",
}

@Book{Treiman:1999:OQ,
  author =       "Sam B. (Sam Bard) Treiman",
  title =        "The Odd Quantum",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "viii + 262",
  year =         "1999",
  ISBN =         "0-691-00926-0 (hardcover), 0-691-10300-3 (paperback),
                 1-4008-0810-3 (e-book), 1-4008-1368-9 (e-book),
                 1-4008-2309-9 (e-book)",
  ISBN-13 =      "978-0-691-00926-1 (hardcover), 978-0-691-10300-6
                 (paperback), 978-1-4008-0810-6 (e-book),
                 978-1-4008-1368-1 (e-book), 978-1-4008-2309-3
                 (e-book)",
  LCCN =         "QC 174.12.T73 1999",
  bibdate =      "Wed Nov 26 05:43:10 2003",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/bohr-niels.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/d/debroglie-louis.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/p/pauli-wolfgang.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/r/rutherford-ernest.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/s/schroedinger-erwin.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "This is a concise but comprehensive account of quantum
                 mechanics written by a respected physicist for popular
                 science readers. --- Sam Treiman makes quantum
                 mechanics accessible to nonspecialists, combining
                 mastery of the material with clear, elegant prose and
                 infectious enthusiasm as he conveys the substance,
                 methods, and profound oddities of the field.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Newton's law, gravity, energy, electromagnetism,
                 special relativity \\
                 Electromagnetic waves, blackbody radiation, early
                 spectroscopy, the Rutherford atom, Bohr's quantum
                 model, De Broglie's matter waves \\
                 The two-slit experiment Schr{\"o}dinger's wave
                 equation, probabilistic interpretation, a brief survey
                 of the rules, commuting observables, the uncertainty
                 principle, momentum, the operator concept, angular
                 momentum, aspects of energy \\
                 The free particle, particle in a box, the harmonic
                 oscillator, central potentials generally, the
                 one-electron atom, the infinite solenoid, decay
                 processes \\
                 Symmetry, antisymmetry rules, the Pauli principle, the
                 Fermi gas, atoms, more on identical Bosons \\
                 Particles in collision, particles in decay,
                 accelerators, patterns and regularities, basic
                 ingredients, summary \\
                 Free fields, free particles, interactions, Feynman
                 diagrams, virtual particles, the standard model in
                 diagrams",
}

@Book{Trimmer:1998:EMS,
  author =       "Joseph F. Trimmer",
  title =        "The essentials of {MLA} style: a guide to
                 documentation for writers of research papers, with an
                 appendix on {APA} style",
  publisher =    pub-HOUGHTON-MIFFLIN,
  address =      pub-HOUGHTON-MIFFLIN:adr,
  edition =      "Fifth",
  pages =        "70",
  year =         "1998",
  ISBN =         "0-395-88316-4",
  ISBN-13 =      "978-0-395-88316-7",
  LCCN =         "PN147 .T75 1998",
  bibdate =      "Mon Mar 10 05:43:45 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

@Book{Trimmer:1999:GMD,
  author =       "Joseph F. Trimmer",
  title =        "A Guide to {MLA} Documentation: with an Appendix on
                 {APA} Style",
  publisher =    pub-HOUGHTON-MIFFLIN,
  address =      pub-HOUGHTON-MIFFLIN:adr,
  pages =        "iii + 50",
  year =         "1999",
  ISBN =         "0-395-93851-1 (paperback)",
  ISBN-13 =      "978-0-395-93851-5 (paperback)",
  LCCN =         "PN147 .T75 1999",
  bibdate =      "Thu May 16 14:22:57 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

@Book{Trott:2006:MGN,
  author =       "Michael Trott",
  title =        "The {Mathematica} Guidebook for Numerics",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xxxv + 1208",
  year =         "2006",
  ISBN =         "0-387-95011-7",
  ISBN-13 =      "978-0-387-95011-2",
  LCCN =         "QA76.95 .T773 2006",
  bibdate =      "Wed Oct 4 11:03:45 MDT 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/mathematica.bib",
  note =         "Includes DVD-ROM.",
  abstract =     "Introduces the reader to Mathematica's various
                 approximate numbers, their arithmetic and the common
                 numerical analysis operations such as numerical
                 integration, root-finding, equation solving,
                 minimization, and differential equation solving. This
                 resource is useful for practitioners, professionals,
                 and researchers.",
  acknowledgement = ack-nhfb,
  keywords =     "Mathematica (computer file); mathematics -- data
                 processing.",
  tableofcontents = "1: Numerical computations \\
                 1.0: Remarks \\
                 1.1: Approximate numbers \\
                 1.2: Fitting and interpolating functions \\
                 1.3: Compiled programs \\
                 1.4: Linear algebra \\
                 1.5: Fourier transforms \\
                 1.6: Numerical functions and their options \\
                 1.7: Sums and products \\
                 1.8: Integration \\
                 1.9: Solution of equations \\
                 1.10: Minimization \\
                 1.11: Solution of differential equations \\
                 1.12: Two applications \\
                 2: Computations with exact numbers \\
                 2.0: Remarks \\
                 2.1: Divisors and multiples \\
                 2.2: Number theory functions \\
                 2.3: Combinatorial functions \\
                 2.4: Euler, Bernoulli, and Fibonacci numbers \\
                 Exercises \\
                 Solutions \\
                 References \\
                 Index",
}

@Book{Trott:2006:MGS,
  author =       "Michael Trott",
  title =        "The {Mathematica} Guidebook for Symbolics",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xxxviii + 1453",
  year =         "2006",
  ISBN =         "0-387-95020-6",
  ISBN-13 =      "978-0-387-95020-4",
  LCCN =         "QA76.73.M29 T765 2006",
  bibdate =      "Wed Oct 4 11:03:45 MDT 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/mathematica.bib",
  note =         "Includes CD-ROM.",
  acknowledgement = ack-nhfb,
  keywords =     "Mathematica (computer file); mathematics -- data
                 processing.",
  tableofcontents = "Introduction and Orientation \\
                 I. Symbolic computations: Remarks \\
                 Manipulation of polynomials \\
                 Manipulations of rational functions of polynomials \\
                 Manipulations of trigonometric expressions \\
                 Systems of linear and nonlinear equations \\
                 Classical analysis \\
                 Differential equations \\
                 Integral transforms and generalized functions \\
                 Three applications \\
                 Overview \\
                 II Classical orthogonal polynomials: Remarks \\
                 General properties of orthogonal polynomials \\
                 Hermite polynomials \\
                 Jacobi polynomials \\
                 Gegenbauer polynomials \\
                 Laguerre polynomials \\
                 Legendre polynomials \\
                 Chebyshev polynomials $T$ \\
                 Chebyshev polynomials $U$ \\
                 Relationships among the orthogonal polynomials \\
                 Overview \\
                 III Classical special functions: Remarks/Introduction
                 \\
                 Gamma, beta, and polygamma functions \\
                 Error functions and Fresnel integrals \\
                 Sine, cosine, exponential, and logarithmic integral
                 functions \\
                 Bessel and airy functions \\
                 Legendre functions \\
                 Hypergeometric functions \\
                 Elliptic integrals \\
                 Elliptic functions \\
                 ProductLog function \\
                 Mathieu functions \\
                 Additional special functions \\
                 Solution of quintics with hypergeometric functions \\
                 Overview \\
                 Index",
}

@Book{Troutwine:2018:HCR,
  author =       "Brian L. Troutwine",
  title =        "Hands-on Concurrency with {Rust}: Confidently Build
                 Memory-safe, Parallel, and Efficient Software in
                 {Rust}",
  publisher =    pub-PACKT,
  address =      pub-PACKT:adr,
  pages =        "v + 449",
  year =         "2018",
  ISBN =         "1-78839-997-8 (paperback), 1-78847-835-5",
  ISBN-13 =      "978-1-78839-997-5 (paperback), 978-1-78847-835-9",
  LCCN =         "QA76.76.A65",
  bibdate =      "Tue Dec 10 05:53:29 MST 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/multithreading.bib",
  URL =          "http://proquest.safaribooksonline.com/?fpi=9781788399975",
  abstract =     "Get to grips with modern software demands by learning
                 the effective uses of Rust's powerful memory safety.Key
                 Features Learn and improve the sequential performance
                 characteristics of your software Understand the use of
                 operating system processes in a high-scale concurrent
                 system Learn of the various coordination methods
                 available in the Standard library. Most programming
                 languages can really complicate things, especially with
                 regard to unsafe memory access. The burden on you, the
                 programmer, lies across two domains: understanding the
                 modern machine and your language's pain-points. This
                 book will teach you to how to manage program
                 performance on modern machines and build fast,
                 memory-safe, and concurrent software in Rust. It starts
                 with the fundamentals of Rust and discusses machine
                 architecture concepts. You will be taken through ways
                 to measure and improve the performance of Rust code
                 systematically and how to write collections with
                 confidence. You will learn about the Sync and Send
                 traits applied to threads, and coordinate thread
                 execution with locks, atomic primitives,
                 data-parallelism, and more.The book will show you how
                 to efficiently embed Rust in C++ code and explore the
                 functionalities of various crates for multithreaded
                 applications. It explores implementations in depth. You
                 will know how a mutex works and build several yourself.
                 You will master radically different approaches that
                 exist in the ecosystem for structuring and managing
                 high-scale systems. By the end of the book, you will
                 feel comfortable with designing safe, consistent,
                 parallel, and high-performance applications in
                 Rust.What you will learn Probe your programs for
                 performance and accuracy issues Create your own
                 threading and multi-processing environment in Rust Use
                 coarse locks from Rust's Standard library Solve common
                 synchronization problems or avoid synchronization using
                 atomic programming Build lock-free/wait-free structures
                 in Rust and understand their implementations in the
                 crates ecosystem Leverage Rust's memory model and type
                 system to build safety properties into your parallel
                 programs Understand the new features of the Rust
                 programming language to ease the writing of parallel
                 programs. Who this book is for. This book is aimed at
                 software engineers with a basic understanding of Rust
                 who want to exploit the parallel and concurrent nature
                 of modern computing environments, safely.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Application software; Development; Computer
                 multitasking; Programming languages (Electronic
                 computers); Portable and handheld devices:
                 consumer/user guides; Mobile phones: consumer/user
                 guides; Parallel processing; Programming and scripting
                 languages: general; Computers; Programming; Parallel;
                 Hardware; Handheld Devices; Programming Languages; C;
                 Development; Computer multitasking; Programming
                 languages (Electronic computers)",
}

@Book{Truss:2003:ESL,
  author =       "Lynne Truss",
  title =        "Eats, Shoots \& Leaves: The Zero Tolerance Approach to
                 Punctuation",
  publisher =    "Gotham Books",
  address =      "New York, NY, USA",
  pages =        "xxvii + 209",
  year =         "2003",
  ISBN =         "1-59240-087-6, 1-59240-203-8 (paperback)",
  ISBN-13 =      "978-1-59240-087-4, 978-1-59240-203-8 (paperback)",
  LCCN =         "PE1450 .T75 2004",
  bibdate =      "Wed Oct 13 14:33:40 2004",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$17.50, CAN\$26.00",
  abstract =     "We all know the basics of punctuation. Or do we? A
                 look at most neighborhood signage tells a different
                 story. Through sloppy usage and low standards on the
                 internet, in email, and now text messages, we have made
                 proper punctuation an endangered species. In Eats,
                 Shoots and Leaves, former editor Lynne Truss dares to
                 say, in her delightfully urbane, witty, and very
                 English way, that it is time to look at our commas and
                 semicolons and see them as the wonderful and necessary
                 things they are. This is a book for people who love
                 punctuation and get upset when it is mishandled. From
                 the invention of the question mark in the time of
                 Charlemagne to George Orwell shunning the semicolon,
                 this lively history makes a powerful case for the
                 preservation of a system of printing conventions that
                 is much too subtle to be mucked about with.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Foreword / Frank McCourt \\
                 Publisher's note \\
                 Preface \\
                 Introduction: Seventh sense \\
                 Tractable apostrophe \\
                 That'll do, comma \\
                 Airs and graces \\
                 Cutting a dash \\
                 Little used punctuation mark \\
                 Merely conventional signs \\
                 Bibliography",
}

@Book{Trzeciak:1995:WMP,
  author =       "Jerzy Trzeciak",
  title =        "Writing Mathematical Papers in {English}: a Practical
                 Guide",
  publisher =    "European Mathematical Society Publishing House,
                 Seminar for Applied Mathematics",
  address =      "Z{\"u}rich, Switzerland",
  edition =      "Revised",
  pages =        "49",
  year =         "1995",
  DOI =          "https://doi.org/10.4171/014",
  ISBN =         "3-03719-014-0, 83-85694-02-1",
  ISBN-13 =      "978-3-03719-014-2, 978-83-85694-02-1",
  LCCN =         "QA42 .T79 1995",
  bibdate =      "Mon Oct 28 16:58:40 MDT 2013",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  URL =          "http://www.ems-ph.org/books/book.php?proj_nr=34",
  acknowledgement = ack-nhfb,
  subject =      "Mathematics; Authorship; Technical writing; Handbooks,
                 manuals, etc",
  tableofcontents = "Part A: Phrases Used in Mathematical Texts \\
                 Abstract and introduction / 4 \\
                 Definition / 6 \\
                 Notation / 7 \\
                 Property / 8 \\
                 Assumption, condition, convention / 10 \\
                 Theorem: general remarks / 12 \\
                 Theorem: introductory phrase / 13 \\
                 Theorem: formulation / 13 \\
                 Proof: beginning / 14 \\
                 Proof: arguments / 15 \\
                 Proof: consecutive steps / 16 \\
                 Proof: ``it is sufficient to'' / 17 \\
                 Proof: ``it is easily seen that'' / 18 \\
                 Proof: conclusion and remarks / 18 \\
                 References to the literature / 19 \\
                 Acknowledgments / 20 \\
                 How to shorten the paper / 20 \\
                 Editorial correspondence / 21 \\
                 Referee's report / 21 \\
                 Part B: Selected Problems of English Grammar \\
                 Indefinite article (a, an, ---) / 23 \\
                 Definite article (the) / 24 \\
                 Article omission / 25 \\
                 Infinitive / 27 \\
                 Ing-form / 29 \\
                 Passive voice / 31 \\
                 Quantifiers / 32 \\
                 Number, quantity, size / 34 \\
                 How to avoid repetition / 38 \\
                 Word order / 40 \\
                 Where to insert a comma / 44 \\
                 Hyphenation / 46 \\
                 Some typical errors / 46 Index / 49",
}

@Article{Tsuji:structured-fortran,
  author =       "Tatsui Tsuji and Katsumasa Watanabe",
  title =        "Structured {Fortran} Preprocessors Generating
                 Optimized Output",
  journal =      j-SPE,
  volume =       "18",
  number =       "5",
  pages =        "427--442",
  month =        may,
  year =         "1988",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Tucker:1977:PL,
  author =       "Allen B. {Tucker, Jr.}",
  title =        "Programming Languages",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "xv + 439",
  year =         "1977",
  ISBN =         "0-07-065415-8",
  ISBN-13 =      "978-0-07-065415-0",
  LCCN =         "QA76.7 T8 1977",
  bibdate =      "Wed Dec 15 10:58:52 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "McGraw-Hill Computer Science Series, Editor: Richard
                 W. Hamming and Edward A. Feigenbaum",
  acknowledgement = ack-nhfb,
  tableofcontents = "ALGOL \\
                 FORTRAN \\
                 COBOL \\
                 PL/I \\
                 RPG \\
                 SNOBOL \\
                 Comparative evaluation and conclusions",
}

@Book{Tufte:1983:VDQ,
  author =       "Edward R. Tufte",
  title =        "The Visual Display of Quantitative Information",
  publisher =    pub-GRAPHICS-PRESS,
  address =      pub-GRAPHICS-PRESS:adr,
  pages =        "197",
  year =         "1983",
  ISBN =         "0-9613921-0-X, 0-9613921-4-2",
  ISBN-13 =      "978-0-9613921-0-9, 978-0-9613921-4-7",
  LCCN =         "K27.S8 T84",
  bibdate =      "Wed Dec 15 10:58:53 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
                 https://www.math.utah.edu/pub/bibnet/subjects/han-wri-mat-sci-2ed.bib;
                 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",
  price =        "US\$34.00",
  abstract =     "The subject of this book is on statistical graphics,
                 charts, tables. It deals with the theory and practice
                 in the design of data graphics, and includes 250
                 illustrations of the best (and a few of the worst)
                 statistical graphics, with detailed analysis of how to
                 display data for precise, effective, quick analysis.
                 Also offered is information on the design of the
                 high-resolution displays, small multiples, editing and
                 improving graphics, and the data-ink ratio.
                 Time-series, relational graphics, data maps,
                 multivariate designs, as well as detection of graphical
                 deception: design variation vs. data variation, and
                 sources of deception are discussed. Information on
                 aesthetics and data graphical displays is included.",
  acknowledgement = ack-nhfb,
  author-dates = "1942--",
  subject =      "Statistics; Graphic methods; Charts, diagrams, etc.;
                 Statistical analysis; Statistique; M{\'e}thodes
                 graphiques; Tableaux, graphiques, etc.; Graphiques;
                 Statistique; Conception assist{\'e}e par ordinateur;
                 Statistics; Graphic methods; Kwantitatieve gegevens;
                 Grafische voorstellingen; Graphische Darstellung;
                 Statistik; Statistik; Estatistica Descritiva;
                 Matematica; Statistics --- Graphic methods; Graphische
                 Darstellung; Statistik",
  tableofcontents = "Graphical Practice \\
                 Graphical excellence / 13 \\
                 Graphical integrity / 53 \\
                 Sources of graphical integrity and sophistication / 79
                 \\
                 Theory of Data Graphics \\
                 Data-ink and graphical redesign / 91 \\
                 Chartjunk: vibrations, grids, and ducks / 107 \\
                 Data-ink maximization and graphical design / 123 \\
                 Multifunctioning graphical elements / 139 \\
                 Data density and small multiples / 161 \\
                 Aesthetics and technique in data graphical design / 177
                 \\
                 Epilogue: Designs for the Display of Information /
                 191",
}

@Book{Tufte:1990:EI,
  author =       "Edward R. Tufte",
  title =        "Envisioning Information",
  publisher =    pub-GRAPHICS-PRESS,
  address =      pub-GRAPHICS-PRESS:adr,
  pages =        "126",
  year =         "1990",
  LCCN =         "P93.5 .T84 1990",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$48.00",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Book{Tufte:1997:VEI,
  author =       "Edward R. Tufte",
  title =        "Visual Explanations: Images and Quantities, Evidence
                 and Narrative",
  publisher =    pub-GRAPHICS-PRESS,
  address =      pub-GRAPHICS-PRESS:adr,
  pages =        "156 + 2",
  year =         "1997",
  ISBN =         "0-9613921-2-6",
  ISBN-13 =      "978-0-9613921-2-3",
  LCCN =         "P93.5.T846 1997",
  bibdate =      "Thu Aug 07 13:39:07 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  price =        "US\$45.00",
  abstract =     "Tufte discusses design strategies for effectively
                 presenting information about change -- motion, process,
                 mechanism, cause and effect -- in print, in
                 presentations, and on the computer screen. The first
                 section of the book discusses the history behind our
                 current methods of depicting information, such as
                 graphs, pie charts, and topographic maps. The second
                 part of the book considers strategies that can be used
                 to arrange information in a more visually exciting way,
                 not only on the printed page but also on the video and
                 computer screen, and examines the design of computer
                 interfaces and Web sites, whose limited screen
                 resolution makes the presentation of text and graphics
                 particularly challenging.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Images and quantities \\
                 2: Visual and statistical thinking: displays of
                 evidence for making decisions \\
                 3: Explaining magic: pictorial instructions and
                 disinformation design \\
                 4: Small effective difference \\
                 5: Parallelism: repetition and change, comparison and
                 surprise \\
                 6: Multiples in space and time \\
                 7: Visual confections: juxtapositions from the ocean of
                 the streams of story",
}

@Book{Turabian:2007:MWR,
  editor =       "Kate L. Turabian",
  title =        "A manual for writers of research papers, theses, and
                 dissertations: {Chicago} style for students and
                 researchers",
  publisher =    pub-U-CHICAGO,
  address =      pub-U-CHICAGO:adr,
  edition =      "Seventh",
  pages =        "xviii + 466",
  year =         "2007",
  ISBN =         "0-226-82336-9 (cloth), 0-226-82337-7 (paperback)",
  ISBN-13 =      "978-0-226-82336-2 (cloth), 978-0-226-82337-9
                 (paperback)",
  LCCN =         "LB2369 .T8 2007; LB2369 .T87 2007",
  bibdate =      "Fri Jan 8 15:21:54 MST 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 melvyl.cdlib.org:210/CDL90",
  note =         "Revised by Wayne C. Booth, Gregory G. Colomb, Joseph
                 M. Williams, and the University of Chicago Press
                 editorial staff",
  series =       "Chicago guides to writing, editing, and publishing",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0707/2006025443-b;
                 http://www.loc.gov/catdir/enhancements/fy0707/2006025443-b.html;
                 http://www.loc.gov/catdir/enhancements/fy0707/2006025443-d;
                 http://www.loc.gov/catdir/enhancements/fy0707/2006025443-d.html;
                 http://www.loc.gov/catdir/toc/ecip0618/2006025443;
                 http://www.loc.gov/catdir/toc/ecip0618/2006025443.html",
  acknowledgement = ack-nhfb,
  subject =      "Dissertations, Academic; Handbooks, manuals, etc;
                 Academic writing; Writing; Handbooks, Dissertations,
                 Academic as Topic",
  tableofcontents = "A note to students \\
                 Preface \\
                 Acknowledgments \\
                 Part 1. Research and writing: from planning to
                 production / Wayne C. Booth, Gregory G. Colomb, and
                 Joseph M. Williams \\
                 Overview of part 1 \\
                 1. What research is and how researchers think about it
                 \\
                 1.1. How researchers think about their aims \\
                 1.2. Three kinds of questions that researchers ask \\
                 2. Moving from a topic to a question to a working
                 hypothesis \\
                 2.1. Find a question in your topic \\
                 2.2. Propose some working answers \\
                 2.3. Build a storyboard to plan and guide your work \\
                 2.4. Organize a writing support group \\
                 3. Finding useful sources \\
                 3.1. Understand the kinds of sources readers expect you
                 to use \\
                 3.2. Record your sources fully, accurately, and
                 appropriately \\
                 3.3. Search for sources systematically \\
                 3.4. Evaluate sources for relevance and reliability \\
                 3.5. Look beyond the usual kinds of references \\
                 4. Engaging sources \\
                 4.1. Read generously to understand, then critically to
                 engage and evaluate \\
                 4.2. Take notes systematically \\
                 4.3. Take useful notes \\
                 4.4. Write as you read \\
                 4.5. Review your progress \\
                 4.6. Manage moments of normal panic \\
                 5. Planning your argument \\
                 5.1. What a research argument is and is not \\
                 5.2. Build your argument around answers to readers'
                 questions \\
                 5.3. Turn your working hypothesis into a claim \\
                 5.4. Assemble the elements of your argument \\
                 5.5. Distinguish arguments based on evidence from
                 arguments based on warrants \\
                 5.6. Assemble an argument \\
                 6. Planning a first draft \\
                 6.1. Avoid unhelpful plans \\
                 6.2. Create a plan that meets your readers' needs \\
                 6.3. File away leftovers \\
                 7. Drafting your report \\
                 7.1. Draft in the way that feels most comfortable \\
                 7.2. Develop productive drafting habits \\
                 7.3. Use your key terms to keep yourself on track \\
                 7.4. Quote, paraphrase, and summarize appropriately \\
                 7.5. Integrate quotations into your text \\
                 7.6. Use footnotes and endnotes judiciously \\
                 7.7. Interpret complex or detailed evidence before you
                 offer it \\
                 7.8. Be open to surprises \\
                 7.9. Guard against inadvertent plagiarism \\
                 7.10. Guard against inappropriate assistance \\
                 7.11. Work through chronic procrastination and writer's
                 block \\
                 8. Presenting evidence in tables and figures \\
                 8.1. Choose verbal or visual representations \\
                 8.2. Choose the most effective graphic \\
                 8.3. Design tables and figures \\
                 8.4. Communicate data ethically \\
                 9. Revising your draft \\
                 9.1. Check your introduction, conclusion, and claim \\
                 9.2. Make sure the body of your report is coherent \\
                 9.3. Check your paragraphs \\
                 9.4. Let your draft cool, then paraphrase it \\
                 10. Writing your final introduction and conclusion \\
                 10.1. Draft your final introduction \\
                 10.2. Draft your final conclusion \\
                 10.3. Write your title last \\
                 11. Revising sentences \\
                 11.1. Focus on the first seven or eight words of a
                 sentence \\
                 11.2. Diagnose what you read \\
                 11.3. Choose the right word \\
                 11.4. Polish it off \\
                 11.5. Give it up and print it out \\
                 12. Learning from your returned paper \\
                 12.1. Find general principles in specific comments \\
                 12.2. Talk to your instructor \\
                 13. Presenting research in alternative forums \\
                 13.1. Plan your oral presentation \\
                 13.2. Design your presentation to be listened to \\
                 13.3. Plan your poster presentation \\
                 13.4. Plan your conference proposal \\
                 14. On the spirit of research \\
                 Part 2. Source citation \\
                 15. General introduction to citation practices \\
                 15.1. Reasons for citing your sources \\
                 15.2. The requirements of citation \\
                 15.3. Two citation styles \\
                 15.4. Citation of electronic sources \\
                 15.5. Preparation of citations \\
                 15.6. A word on citation software \\
                 16. Notes-bibliography style: the basic form \\
                 16.1. Basic patterns \\
                 16.2. Bibliographies \\
                 16.3. Notes \\
                 16.4. Short forms for notes \\
                 17. Notes-bibliography style: citing specific types of
                 sources \\
                 17.1. Books \\
                 17.2. Journal articles \\
                 17.3. Magazine articles \\
                 17.4. Newspaper articles \\
                 17.5. Additional types of published sources \\
                 17.6. Unpublished sources \\
                 17.7. Informally published electronic sources \\
                 17.8. Sources in the visual and performing arts \\
                 17.9. Public documents \\
                 17.10. One source quoted in another\\
                 18. Parenthetical citations-reference list style: the
                 basic form \\
                 18.1. Basic patterns \\
                 18.2. Reference lists \\
                 18.3. Parenthetical citations \\
                 19. Parenthetical citations-reference list style:
                 citing specific types of sources \\
                 19.1. Books \\
                 19.2. Journal articles \\
                 19.3. Magazine articles \\
                 19.4. Newspaper articles \\
                 19.5. Additional types of published sources \\
                 19.6. Unpublished sources \\
                 19.7. Informally published electronic sources \\
                 19.8. Sources in the visual and performing arts \\
                 19.9. Public documents \\
                 19.10. One source quoted in another \\
                 Part 3. Style \\
                 20. Spelling \\
                 20.1. Plurals \\
                 20.2. Possessives \\
                 20.3. Compounds and words formed with prefixes \\
                 20.4. Line breaks \\
                 21. Punctuation \\
                 21.1. Period \\
                 21.2. Comma \\
                 21.3. Semicolon \\
                 21.4. Colon \\
                 21.5. Question mark \\
                 21.6. Exclamation point \\
                 21.7. Hyphen and dashes \\
                 21.8. Parentheses and brackets \\
                 21.9. Slashes \\
                 21.10. Quotation marks \\
                 21.11. Multiple punctuation marks \\
                 22. Names, special terms, and titles of works \\
                 22.1. Names \\
                 22.2. Special terms \\
                 22.3. Titles of works \\
                 23. Numbers \\
                 23.1. Words or numerals? \\
                 23.2. Plurals and punctuation \\
                 23.3. Date systems \\
                 23.4. Numbers used outside the text \\
                 24. Abbreviations \\
                 24.1. General principles \\
                 24.2. Names and titles \\
                 24.3. Geographical terms \\
                 24.4. Time and dates \\
                 24.5. Units of measure \\
                 24.6. The Bible and other sacred works \\
                 24.7. Abbreviations in citations and other scholarly
                 contexts \\
                 25. Quotations \\
                 25.1. Quoting accurately and avoiding plagiarism \\
                 25.2. Incorporating quotations into your text \\
                 25.3. Modifying quotations \\
                 26. Tables and figures \\
                 26.1. General issues \\
                 26.2. Tables \\
                 26.3. Figures \\
                 Appendix: Paper format and submission \\
                 A.1. General format requirements \\
                 A.2. Format requirements for specific elements \\
                 A.3. Submission requirements \\
                 Bibliography \\
                 Authors \\
                 Index",
}

@Book{Turing:2018:XYZ,
  author =       "Dermot Turing",
  title =        "{X}, {Y} and {Z}: the Real Story of How {Enigma} Was
                 Broken",
  publisher =    "The History Press",
  address =      "Gloucestershire, UK",
  pages =        "319 + 1",
  year =         "2018",
  ISBN =         "0-7509-8782-0 (hardcover), 0-7509-8967-X (ePub)",
  ISBN-13 =      "978-0-7509-8782-0 (hardcover), 978-0-7509-8967-1
                 (ePub)",
  LCCN =         "D810.C88 T87 2018",
  bibdate =      "Fri Feb 4 16:28:59 MST 2022",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "X, Y and Z describes how French, British and Polish
                 secret services came together to unravel the Enigma
                 machine. It tells of how, under the very noses of the
                 Germans, Enigma code-breaking continued in Vichy
                 France. And how code-breakers from Poland continued
                 their work for Her Majesty's Secret Service, watching
                 the USSR's first steps of the Cold War. The people of
                 X, Y and Z were eccentric, colourful and caught up in
                 world events that they could watch not control. This is
                 their story \ldots{}.",
  acknowledgement = ack-nhfb,
  subject =      "Enigma (maszyna szyfruj{\'y}aca).; Wojna {\'y}swiatowa
                 (1939-1945); s{\'y}u{\'y}zby wywiadowcze; Wielka
                 Brytania; Enigma cipher system; World War, 1939-1945;
                 Military intelligence; Great Britain; Enigma cipher
                 system.; Military intelligence.",
  tableofcontents = "List of Maps \\
                 Foreword \\
                 Dramatis Personae \\
                 Timeline \\
                 Introduction \\
                 1 Nulle Part \\
                 2 Enter the King \\
                 3 Mighty Pens \\
                 4 The Scarlet Pimpernels \\
                 5 How They Brought the Good News from Ghent to Aix \\
                 6 Monstrous Pile \\
                 7 The Mirror Crack'd from Side to Side \\
                 8 Into Three Parts \\
                 9 A Mystery Inside an Enigma \\
                 10 Hide and Seek \\
                 11 The Last Play \\
                 Epilogue \\
                 Appendix \\
                 Notes \\
                 Abbreviations \\
                 Select Bibliography",
}

@Book{Turing:2020:CBP,
  author =       "Dermot Turing",
  title =        "The Codebreakers of {Bletchley Park}: the Secret
                 Intelligence Station That Helped Defeat the {Nazis}",
  publisher =    "Arcturus Publishing Limited",
  address =      "London, UK",
  pages =        "256",
  year =         "2020",
  ISBN =         "1-78950-621-2, 1-83857-650-9 (paperback)",
  ISBN-13 =      "978-1-78950-621-1, 978-1-83857-650-9 (paperback)",
  LCCN =         "????",
  bibdate =      "Fri Feb 4 16:16:43 MST 2022",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "With an introduction by Christopher M. Andrew.",
  abstract =     "At Bletchley Park, some of Britain's most talented
                 mathematicians, linguists, and intellectuals were
                 assembled to break Nazi codes. Kept secret for nearly
                 thirty years, we have now come to realise the crucial
                 role that these codebreakers played in the Allied
                 victory in World War II. Written by Dermot Turing, the
                 nephew of famous codebreaker Alan Turing, this
                 illustrated account provides unique insight into the
                 behind-the-scenes action at Bletchley Park. Discover
                 how brilliant and eccentric individuals such as Dilly
                 Knox, Alan Turing and Joan Clarke were recruited, the
                 social life that grew up around the park, and how they
                 dealt with the ever-present burden of secrecy.
                 Including a foreword by Professor Christopher Andrew of
                 Cambridge University, author of MI5's official history
                 The Secret World, this book brings to life the stories
                 of the men and women who toiled day and night to crack
                 the seemingly unbreakable Enigma code.",
  acknowledgement = ack-nhfb,
  subject =      "World War, 1939--1945; Secret service; Great Britain;
                 Electronic intelligence; England; Bletchley
                 (Buckinghamshire); Electronic intelligence.; Secret
                 service.",
}

@Book{Turnbull:1993:GM,
  author =       "Herbert Westren Turnbull",
  title =        "The Great Mathematicians",
  publisher =    pub-BARNES-NOBLE,
  address =      pub-BARNES-NOBLE:adr,
  pages =        "xi + 141",
  year =         "1993",
  ISBN =         "1-56619-157-2",
  ISBN-13 =      "978-1-56619-157-9",
  LCCN =         "QA28 .T8 1993",
  bibdate =      "Sat Apr 1 15:05:30 MDT 2017",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  author-dates = "1885--1961",
  libnote =      "Not in my library.",
  subject =      "Mathematicians; Biography; Mathematics; History;
                 Wiskundigen; Mathematicians; Mathematics",
  tableofcontents = "Early beginnings: Thales, Pythagoras and the
                 Pythagoreans \\
                 Eudoxus and the Athenian school \\
                 Alexandria: Euclid, Archimedes and Apollonius \\
                 The second Alexandrian school: Pappus and Diophantus
                 \\
                 The Renaissance: Napier and Kepler: the rise of
                 analysis \\
                 Descartes and Pascal: the early French geometers and
                 their contemporaries \\
                 Isaac Newton \\
                 The Bernoullis and Euler \\
                 Maclaurin and Lagrange \\
                 Gauss and Hamilton: the nineteenth century \\
                 More recent developments",
}

@Book{Tymms:1987:AI,
  author =       "W. R. Tymms and M. D. Wyatt",
  title =        "The Art of Illuminating",
  publisher =    pub-CHARTWELL,
  address =      pub-CHARTWELL:adr,
  pages =        "104",
  year =         "1987",
  ISBN =         "1-55521-198-4",
  ISBN-13 =      "978-1-55521-198-1",
  LCCN =         "ND3310 .T95 1987",
  bibdate =      "Wed Dec 15 10:58:55 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Ueberhuber:1997:NCM,
  author =       "Christoph W. Ueberhuber",
  title =        "Numerical Computation: Methods, Software, and
                 Analysis",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xvi + 474 (vol. 1), xvi + 495 (vol. 2)",
  year =         "1997",
  DOI =          "https://doi.org/10.1007/978-3-642-59118-1",
  ISBN =         "3-540-62058-3 (vol. 1: softcover), 3-540-62057-5 (vol.
                 2: softcover), 3-642-59118-3 (e-book)",
  ISBN-13 =      "978-3-540-62058-7 (vol. 1: softcover),
                 978-3-540-62057-0 (vol. 2: softcover),
                 978-3-642-59118-1 (e-book)",
  LCCN =         "QA297 .U2413 1997",
  bibdate =      "Thu Oct 28 15:17:48 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fortran3.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/numana1990.bib",
  price =        "US\$44.95 (vol. 1), US\$49.95 (vol. 2)",
  abstract =     "This book is the first part of a modern, two-volume
                 introduction to numerical computation, which strongly
                 emphasizes software aspects. It can serve as a textbook
                 for courses on numerical analysis, particularly for
                 engineers. The book can also be used as a reference
                 book and it includes an extensive bibliography. The
                 author is a well-known specialist in numerical analysis
                 who was involved in the creation of the software
                 package QUADPACK.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1 Scientific Modeling \\
                 1.1 Reality Versus Model \\
                 1.2 The Model Subject and the Model \\
                 1.3 The Model Subject and Reality \\
                 1.4 Model Building \\
                 2 Fundamental Principles of Numerical Methods \\
                 2.1 From Application Problems to their Numerical
                 Solution \\
                 2.2 Numerical Problems \\
                 2.3 Types of Errors in Numerics \\
                 2.4 The Condition of Mathematical Problems \\
                 2.5 The Condition of Application Problems \\
                 2.6 The Mathematical Elements of Condition Estimation
                 \\
                 2.7 Validation of Numerical Computations \\
                 3 Computers for Numerical Data Processing \\
                 3.1 Processors \\
                 3.2 Memory \\
                 3.3 Performance Quantification \\
                 3.4 Analytical Performance Assessment \\
                 3.5 Empirical Performance Assessment \\
                 4 Numerical Data and Numerical Operations \\
                 4.1 Mathematical Data \\
                 4.2 Numerical Data on Computers \\
                 4.3 Operations on Numerical Data \\
                 4.4 Number Systems on Computers \\
                 4.5 Structure of Floating-Point Systems \\
                 4.6 Standardization of Floating-Point Number Systems
                 \\
                 4.7 Arithmetics for Floating-Point Systems \\
                 4.8 Inquiry Functions and Manipulation of Numbers in
                 Fortran 90 \\
                 4.9 Operations with Algebraic Data \\
                 4.10 Operations with Arrays \\
                 4.11 Operations with Analytic Data \\
                 5 Numerical Algorithms \\
                 5.1 The Intuitive Notion of an Algorithm \\
                 5.2 Properties of Algorithms \\
                 5.3 Existence of Algorithms \\
                 5.4 Practical Solvability of Problems \\
                 5.5 Complexity of Algorithms \\
                 5.6 Representation of Algorithms \\
                 5.7 Influence of Rounding Errors on Numerical
                 Algorithms \\
                 5.8 Case Study: Floating-Point Summation \\
                 6 Numerical Programs \\
                 6.1 The Quality of Numerical Programs \\
                 6.2 Reasons for Poor Efficiency \\
                 6.3 The Measurement of Performance Indices \\
                 6.4 Performance Optimization \\
                 6.5 Architecture Independent Optimizations \\
                 6.6 Loop Optimizations \\
                 6.7 Blocked Memory Access \\
                 6.8 Case Study: Multiplication of Matrices \\
                 7 Available Numerical Software \\
                 7.1 The Cost of Software \\
                 7.2 Sources of Numerical Software \\
                 7.3 Software and the Internet \\
                 7.4 Interactive Multifunctional Systems \\
                 7.5 Problem Solving Environments \\
                 7.6 Case Study: Software for Elliptic PDEs \\
                 8 Using Approximation in Mathematical Model Building
                 \\
                 8.1 Analytic Models \\
                 8.2 Information and Data \\
                 8.3 Discrete Approximation \\
                 8.4 Function Approximation \\
                 8.5 Choosing a Model Function \\
                 8.6 Choice of the Distance Function \\
                 8.7 Transformation of the Problem \\
                 9 Interpolation \\
                 9.1 Interpolation Problems \\
                 9.2 Mathematical Foundations \\
                 9.3 Univariate Polynomial Interpolation \\
                 9.4 Univariate, Piecewise, Polynomial Interpolation \\
                 9.5 Polynomial Splines \\
                 9.6 B-Splines \\
                 9.7 Cubic Spline Interpolation \\
                 9.8 Splines Without Undesirable Oscillations \\
                 9.9 Multivariate Interpolation \\
                 9.10 Multivariate Polynomial Interpolation \\
                 9.11 Multivariate (Sub- ) Spline Interpolation \\
                 9.12 Related Problems and Methods \\
                 Glossary of Notation \\
                 Author Index",
}

@Book{Ulichney:1987:DH,
  author =       "Robert Ulichney",
  title =        "Digital Halftoning",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "xiv + 362",
  year =         "1987",
  ISBN =         "0-262-21009-6",
  ISBN-13 =      "978-0-262-21009-6",
  LCCN =         "T385 .U451 1987",
  bibdate =      "Wed Dec 15 10:58:55 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Unger:1987:FGF,
  author =       "J. Marshall Unger",
  title =        "The Fifth Generation Fallacy: Why Japan is Betting its
                 Future on Artificial Intelligence",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  pages =        "x + 230",
  year =         "1987",
  ISBN =         "0-19-504939-X",
  ISBN-13 =      "978-0-19-504939-8",
  LCCN =         "QA76.85 .U541 1987",
  bibdate =      "Sun May 02 07:55:17 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See \cite{Reischauer:1988:JTC}.",
  price =        "US\$19.95",
  acknowledgement = ack-nhfb,
}

@Book{Unicode:1991:USW,
  author =       "{The Unicode Consortium}",
  key =          "Uni91",
  title =        "The Unicode Standard: Worldwide Character Encoding.
                 Version 1.0. Volumes 1 and 2",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  year =         "1991",
  ISBN =         "0-201-56788-1 (paperback, vol. 1), 0-201-60845-6
                 (paperback, vol. 2)",
  ISBN-13 =      "978-0-201-56788-5 (paperback, vol. 1),
                 978-0-201-60845-8 (paperback, vol. 2)",
  LCCN =         "QA268 .U55 1991, Z103 .U6 1991",
  bibdate =      "Wed Jun 26 15:16:24 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/standard.bib;
                 https://www.math.utah.edu/pub/tex/bib/unicode.bib",
  price =        "US\$39.95 (paperback), US\$32.95 (hardcover)",
  abstract =     "The Unicode Standard is a new international standard
                 used to encode written characters for storage in
                 computer files or transmission over communication
                 lines. This book is the authorized description and
                 guide to this new standard. It is an essential
                 reference for computer programmers and software
                 developers who deal with multilingual text. Volume 1
                 covers alphabets in countries across Europe, Africa,
                 and the Indian subcontinent.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

@Book{Unicode:1996:USV,
  author =       "{The Unicode Consortium}",
  title =        "The {Unicode Standard}, Version 2.0",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "various",
  year =         "1996",
  ISBN =         "0-201-48345-9 (paperback), 0-201-96623-9 (CD-ROM)",
  ISBN-13 =      "978-0-201-48345-1",
  LCCN =         "QA268.U56 1996",
  MRclass =      "68U15, 68-00, 68U99",
  bibdate =      "Wed Sep 25 12:17:05 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unicode.bib",
  price =        "US\$54.95",
  acknowledgement = ack-nhfb,
  remark =       "NB: The ISBN 0-201-48345-9 is valid, but has been
                 allocated to two different books.",
  tableofcontents = "Unicode Consortium Members and Directors \\
                 1: Introduction \\
                 2: General Structure \\
                 3: Conformance \\
                 4: Character Properties \\
                 5: Implementation Guidelines \\
                 6: Character Block Descriptions \\
                 7: Code Charts \\
                 8: Han Radical-Stroke Index \\
                 A: Transformation Formats \\
                 B: Submitting New Characters \\
                 C: Relationship to ISO/IEC 10646 \\
                 D: Cumulative Changes \\
                 E: Han Unification History",
}

@Book{Unicode:2000:USV,
  author =       "{The Unicode Consortium}",
  title =        "The {Unicode Standard}, Version 3.0",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xxx + 1040",
  year =         "2000",
  ISBN =         "0-201-61633-5",
  ISBN-13 =      "978-0-201-61633-0",
  LCCN =         "QA268.U56 1996",
  bibdate =      "Mon Oct 15 18:01:08 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unicode.bib",
  note =         "Includes CD-ROM. The principal authors and editors of
                 \booktitle{The Unicode Standard, Version 3.0} are Joan
                 Aliprand, Julie Allen, Joe Becker, Mark Davis, Michael
                 Everson, Asmus Freytag, John Jenkins, Mike Ksar, Rick
                 McGowan, Lisa Moore, Michel Suignard, and Ken
                 Whistler.",
  price =        "US\$50.00",
  URL =          "http://www.unicode.org/book/;
                 http://www.unicode.org/unicode/standard/versions/",
  abstract =     "Detailed specifications for Unicode: structure,
                 conformance encoding forms, character properties,
                 semantics, equivalence, combining characters, logical
                 ordering, conversion, allocation, big/little endian
                 usage, Korean syllable formation, control characters,
                 case mappings, numeric values, mathematical properties,
                 writing directions (Arabic, Japanese, English, and so
                 on), character shaping (Arabic, Devanagari, Tamil, and
                 so on). Expanded implementation guidelines by experts
                 in global software design: normalization, sorting and
                 searching, case mapping, compression, language tagging,
                 boundaries (characters, words, lines, and sentences),
                 rendering of non-spacing marks, transcoding to other
                 character sets, handling unknown characters, surrogate
                 pairs, numbers, editing and selection, keyboard input,
                 and more.",
  acknowledgement = ack-nhfb,
  tableofcontents = "0.1: About the Unicode Standard / xxv \\
                 Concepts, Architecture, Conformance, and Guidelines /
                 xxv \\
                 Character Block Descriptions / xxvi \\
                 Unicode Character Database and Technical Reports /
                 xxvii \\
                 On the CD-ROM / xxvii \\
                 0.2: Notational Conventions / xxviii \\
                 Extended BNF / xxviii \\
                 Operators / xxix \\
                 Unicode Web Site / xxx \\
                 Unicode Anonymous FTP Site / xxx \\
                 Unicode Public Mailing List / xxx \\
                 How to Contact the Unicode Consortium / xxx \\
                 1.1: Coverage / 2 \\
                 Standards Coverage / 3 \\
                 New Characters / 3 \\
                 1.2: Design Basis / 3 \\
                 1.3: Text Handling / 4 \\
                 Interpreting Characters / 5 \\
                 Text Elements / 5 \\
                 1.4: Unicode Standard and ISO/IEC 10646 / 5 \\
                 1.5: Unicode Consortium / 6 \\
                 Unicode Technical Committee / 6 \\
                 2.1: Architectural Context / 9 \\
                 Basic Text Processes / 9 \\
                 Text Elements, Code Values, and Text Processes / / 10
                 \\
                 \\
                 Text Processes and Encoding / 11 \\
                 2.2: Unicode Design Principles / 12 \\
                 Sixteen-Bit Character Codes / 12 \\
                 Efficiency / 13 \\
                 Characters, Not Glyphs / 13 \\
                 Semantics / 15 \\
                 Plain Text / 15 \\
                 Logical Order / 16 \\
                 Unification / 17 \\
                 Dynamic Composition / 18 \\
                 Equivalent Sequence / 18 \\
                 Convertibility / 18 \\
                 2.3: Encoding Forms / 19 \\
                 UTF-16 / 19 \\
                 UTF-8 / 20 \\
                 Character Encoding Schemes / 21 \\
                 2.4: Unicode Allocation / 21 \\
                 Allocation Areas / 21 \\
                 Codespace Assignment for Graphic Characters / 23 \\
                 Nongraphic Characters, Reserved and Unassigned Codes /
                 23 \\
                 2.5: Writing Direction / 24 \\
                 2.6: Combining Characters / 24 \\
                 Sequence of Base Characters and Diacritics / 25 \\
                 Multiple Combining Characters / 25 \\
                 Multiple Base Characters / 27 \\
                 Spacing Clones of European Diacritical Marks / / 27 \\
                 \\
                 2.7: Special Character and Noncharacter Values / 28 \\
                 Byte Order Mark (BOM) / 28 \\
                 Special Noncharacter Values / 28 \\
                 Separators / 29 \\
                 Layout and Format Control Characters / 29 \\
                 Replacement Character / 29 \\
                 2.8: Controls and Control Sequences / 29 \\
                 Control Characters / 29 \\
                 Representing Control Sequences / 30 \\
                 2.9: Conforming to the Unicode Standard / 30 \\
                 Characters Not Used in a Subset / 32 \\
                 2.10: Referencing Versions of the Unicode Standard / /
                 32 \\
                 \\
                 3: Conformance / 37 \\
                 3.1: Conformance Requirements / 37 \\
                 Byte Ordering / 37 \\
                 Invalid Code Values / 38 \\
                 Interpretation / 38 \\
                 Modification / 39 \\
                 Transformations / 39 \\
                 Bidirectional Text / 39 \\
                 Unicode Technical Reports / 39 \\
                 3.2: Semantics / 40 \\
                 3.3: Characters and Coded Representations / 40 \\
                 3.4: Simple Properties / 42 \\
                 3.5: Combination / 43 \\
                 3.6: Decomposition / 44 \\
                 Compatibility Decomposition / 44 \\
                 Canonical Decomposition / 44 \\
                 3.7: Surrogates / 45 \\
                 3.8: Transformations / 45 \\
                 3.9: Special Character Properties / 47 \\
                 3.10: Canonical Ordering Behavior / 50 \\
                 Combining Classes / 51 \\
                 Canonical Ordering / 51 \\
                 Use with Collation / 52 \\
                 3.11: Conjoining Jamo Behavior / 52 \\
                 Syllable Boundaries / 53 \\
                 Standard Syllables / 53 \\
                 Hangul Syllable Composition / 54 \\
                 Hangul Syllable Decomposition / 55 \\
                 Hangul Syllable Names / 55 \\
                 3.12: Bidirectional Behavior / 55 \\
                 Directional Formatting Codes / 56 \\
                 Basic Display Algorithm / 57 \\
                 Definitions / 58 \\
                 Resolving Embedding Levels / 61 \\
                 Reordering Resolved Levels / 65 \\
                 Bidirectional Conformance / 67 \\
                 Implementation Notes / 68 \\
                 4: Character Properties / 73 \\
                 4.1: Case--Normative / 75 \\
                 4.2: Combining Classes--Normative / 75 \\
                 4.3: Directionality--Normative / 85 \\
                 4.4: Jamo Short Names--Normative / 86 \\
                 4.5: General Category--Normative in Part / 87 \\
                 4.6: Numeric Value--Normative / 89 \\
                 4.7: Mirrored--Normative / 97 \\
                 4.8: Unicode 1.0 Names / 101 \\
                 4.9: Mathematical Property / 101 \\
                 4.10: Letters and Other Useful Properties / 102 \\
                 5: Implementation Guidelines / 105 \\
                 5.1: Transcoding to Other Standards / 105 \\
                 Issues / 105 \\
                 Multistage Tables / 106 \\
                 7-Bit or 8-Bit Transmission / 107 \\
                 Mapping Table Resources / 107 \\
                 5.2: ANSI/ISO C wchar\_t / 107 \\
                 5.3: Unknown and Missing Characters / 108 \\
                 Unassigned- and Private Use Character Codes / 108 \\
                 Interpretable but Unrenderable Characters / 108 \\
                 Reassigned Characters / 109 \\
                 5.4: Handling Surrogate Pairs / 109 \\
                 5.5: Handling Numbers / 110 \\
                 5.6: Handling Properties / 111 \\
                 5.7: Normalization / 112 \\
                 5.8: Compression / 113 \\
                 5.9: Line Handling / 113 \\
                 5.10: Regular Expressions / 114 \\
                 5.11: Language Information in Plain Text / 114 \\
                 Requirements for Language Tagging / 114 \\
                 Working with Language Tags / 114 \\
                 Language Tags and Han Unification / 115 \\
                 5.12: Editing and Selection / 116 \\
                 Consistent Text Elements / 116 \\
                 5.13: Strategies for Handling Nonspacing Marks / / 117
                 \\
                 \\
                 Keyboard Input / 118 \\
                 Truncation / 119 \\
                 5.14: Rendering Nonspacing Marks / 120 \\
                 Positioning Methods / 122 \\
                 5.15: Locating Text Element Boundaries / 124 \\
                 Boundary Specification / 124 \\
                 Example Specifications / 126 \\
                 Grapheme Boundaries / 126 \\
                 Word Boundaries / 127 \\
                 Line Boundaries / 129 \\
                 Sentence Boundaries / 132 \\
                 Random Access / 133 \\
                 5.16: Identifiers / 133 \\
                 Syntactic Rule / 134 \\
                 5.17: Sorting and Searching / 135 \\
                 Culturally Expected Sorting / 135 \\
                 Unicode Character Equivalence / 136 \\
                 Similar Characters / 136 \\
                 Levels of Comparison / 137 \\
                 Ignorable Characters / 138 \\
                 Multiple Mappings / 138 \\
                 Collating Out-of-Scope Characters / 139 \\
                 Unmapped Characters / 139 \\
                 Parameterization / 140 \\
                 Optimizations / 140 \\
                 Searching / 140 \\
                 Sublinear Searching / 141 \\
                 5.18: Case Mappings / 141 \\
                 6: Punctuation / 147 \\
                 Punctuation: U+0020-U+00BF / 148 \\
                 General Punctuation: U+2000-U+206F / 149 \\
                 CJK Symbols and Punctuation: U+3000-U+303F / 155 \\
                 CJK Compatibility Forms: U+FE30-U+FE4F / 156 \\
                 Small Form Variants: U+FE50-U+FE6F / 156 \\
                 7: European Alphabetic Scripts / 159 \\
                 7.1: Latin / 160 \\
                 Letters of Basic Latin: U+0041-U+007A / 160 \\
                 Letters of the Latin-1 Supplement: U+00C0-U+00FF / /
                 161 \\
                 \\
                 Latin Extended-A: U+0100-U+017F / 161 \\
                 Latin Extended-B: U+0180-U+024F / 163 \\
                 IPA Extensions: U+0250-U+02AF / 164 \\
                 Latin Extended Additional: U+1E00-U+1EFF / 165 \\
                 Latin Ligatures: FB00-FB06 / 166 \\
                 Greek: U+0370-U+03FF / 167 \\
                 Greek Extended: U+1F00-U+1FFF / 169 \\
                 Cyrillic: U+0400-U+04FF / 171 \\
                 Armenian: U+0530-U+058F / 172 \\
                 Georgian: U+10A0-U+10FF / 173 \\
                 7.6: Runic / 174 \\
                 Runic: U+16A0-U+16F0 / 174 \\
                 Ogham: U+1680-U+169F / 176 \\
                 7.8: Modifier Letters / 177 \\
                 Spacing Modifer Letters: U+02B0-U+02FF / 177 \\
                 7.9: Combining Marks / 179 \\
                 Combining Diacritical Marks: U+0300-U+036F / 179 \\
                 Combining Marks for Symbols: U+20D0-U+20FF / 180 \\
                 Combining Half Marks: U+FE20-U+FE2F / 181 \\
                 8: Middle Eastern Scripts / 185 \\
                 Hebrew: U+0590-U+05FF / 186 \\
                 Alphabetic Presentation Forms: U+FB1D-U+FB4F / 188 \\
                 Arabic: U+0600-U+06FF / 189 \\
                 Cursive Joining / 192 \\
                 Ligatures / 194 \\
                 Arabic Presentation Forms-A: U+FB50-U+FDFF / 197 \\
                 Arabic Presentation Forms-B: U+FE70-U+FEFF / 197 \\
                 Syriac: U+0700-U+074F / 199 \\
                 Syriac Shaping / 203 \\
                 Syriac Cursive Joining / 203 \\
                 Ligatures / 205 \\
                 Thaana: U+0780-U+07BF / 206 \\
                 9: South and Southeast Asian Scripts / 209 \\
                 Devanagari: U+0900-U+097F / 211 \\
                 Bengali: U+0980-U+09FF / 224 \\
                 Gurmukhi: U+0A00-U+0A7F / 225 \\
                 Gujarati: U+0A80-U+0AFF / 226 \\
                 Oriya: U+0B00-U+0B7F / 227 \\
                 Tamil: U+0B80-U+0BFF / 228 \\
                 Telugu: U+0C00-U+0C7F / 233 \\
                 Kannada: U+0C80-U+0CFF / 234 \\
                 Malayalam: U+0D00-U+0D7F / 235 \\
                 Sinhala: U+0D80-U+0DFF / 236 \\
                 Thai: U+0E00-U+0E7F / 237 \\
                 Lao: U+0E80-U+0EFF / 239 \\
                 Tibetan: U+0F00-U+0FBF / 240 \\
                 9.14: Myanmar / 249 \\
                 Myanmar: U+1000-U+109F / 249 \\
                 9.15: Khmer / 251 \\
                 10: East Asian Scripts / 257 \\
                 10.1: Han / 258 \\
                 CJK Unified Ideographs / 258 \\
                 CJK Compatibility Ideographs: U+F900-U+FAFF / 267 \\
                 Kanbum: U+3190-U+319F / 267 \\
                 CJK and KangXi Radicals: U+2E80-U+2FD5 / 267 \\
                 Ideographic Description: U+2FF0-U+2FFB / 268 \\
                 Hiragana: U+3040-U+309F / 272 \\
                 Katakana: U+30A0-U+30FF / 273 \\
                 Halfwidth and Fullwidth Forms: U+FF00-U+FFEF / / 273
                 \\
                 \\
                 10.4: Hangul / 275 \\
                 Hangul Jamo:s U+1100-U+11FF / 275 \\
                 Hangul Compatibility Jamo: U+3130-U+318F / 275 \\
                 Hangul Syllables: U+AC00-U+D7A3 / 276 \\
                 Bopomofo: U+3100-U+312F / 278 \\
                 Yi: U+A000-U+A4CF / 280 \\
                 11: Additional Scripts / 283 \\
                 Ethiopic: U+1200-U+137F / 284 \\
                 Cherokee: U+13A0-U+13FF / 287 \\
                 Canadian Aboriginal Syllabics: U+1400-U+167F / 288 \\
                 Mongolian: U+1800-U+18AF / 289 \\
                 12: Symbols / 295 \\
                 Currency Symbols: U+20A0-U+20CF / 297 \\
                 Letterlike Symbols: U+2100-U+214F / 298 \\
                 Number Forms: U+2150-U+218F / 299 \\
                 Superscripts and Subscripts: U+2070-U+209F / / 299 \\
                 \\
                 12.4: Mathematical Operators / 300 \\
                 Arrows: U+2190-U+21FF / 301 \\
                 12.5: Technical Symbols / 302 \\
                 Control Pictures: U+2400-U+243F / 302 \\
                 Miscellaneous Technical: U+2300-U+23FF / 302 \\
                 Optical Character Recognition: U+2440-U+245F / / 303
                 \\
                 \\
                 12.6: Geometrical Symbols / 304 \\
                 Box Drawing: U+2500-U+257F / 304 \\
                 Block Elements: U+2580-U+259F / 304 \\
                 Geometric Shapes: U+25A0-U+25FF / 304 \\
                 Miscellaneous Symbols: U+2600-U+26FF / 305 \\
                 Dingbats: U+2700-U+27BF / 305 \\
                 12.8: Enclosed and Square / 307 \\
                 Enclosed Alphanumerics: U+2460-U+24FF / 307 \\
                 Enclosed CJK Letters and Months: U+3200-U+32FF / / 307
                 \\
                 \\
                 CJK Compatibility: U+3300-U+33FF / 307 \\
                 Braille: U+2800-U+28FF / 308 \\
                 13: Special Areas and Format Characters / 313 \\
                 C0 Control Codes: U+0000-U+001F / 314 \\
                 C1 Control Codes: U+0080-U+009F / 314 \\
                 Layout Controls / 315 \\
                 Deprecated Format Characters: U+206A-U+206F / 320 \\
                 Surrogates Area: U+D800-U+DFFF / 322 \\
                 Private Use Area: U+E000-U+F8FF / 323 \\
                 Specials: U+FEFF, U+FFF0-U+FFFF / 324 \\
                 14: Code Charts / 331 \\
                 14.1: Character Names List / 331 \\
                 Images in the Code Charts and Character Lists / / 332
                 \\
                 \\
                 Cross References / 333 \\
                 Case Form Mappings / 333 \\
                 Decompositions / 333 \\
                 Information About Languages / 334 \\
                 Reserved Characters / 334 \\
                 14.2: CJK Unified Ideographs / 335 \\
                 14.3: Hangul Syllables / 335 \\
                 15: Han Indices / 849 \\
                 15.1: Han Radical-Stroke Index / 849",
}

@Book{Unicode:2003:USV,
  author =       "{The Unicode Consortium}",
  title =        "The {Unicode Standard}, Version 4.0",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xxxviii + 1462",
  year =         "2003",
  ISBN =         "0-321-18578-1",
  ISBN-13 =      "978-0-321-18578-5",
  LCCN =         "QA268 .U545 2004",
  bibdate =      "Tue Oct 21 17:47:30 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Includes CD-ROM.",
  URL =          "http://www.unicode.org/versions/Unicode4.0.0/",
  abstract =     "\booktitle{The Unicode Standard} provides a unique
                 code number for every character in electronic text, no
                 matter what the platform, no matter what the
                 application, no matter what the language. It is
                 required for XML and is at the core of modern software
                 products. Unicode 4.0 contains 96,248 characters
                 covering languages of the world. \booktitle{The Unicode
                 Standard} contains extensive descriptions of each
                 writing system, as well as definitions of character
                 properties and detailed conformance requirements. It is
                 the complete and definitive user's guide for novices
                 and experts alike. This edition, \booktitle{The Unicode
                 Standard}, Version 4.0, adds 47,188 new characters for
                 minority and historic scripts, several sets of symbols,
                 and a very large collection of additional CJK [Chinese
                 Japanese Korean] ideographs. It provides updated
                 specifications covering structure, conformance,
                 character behavior and semantics, as well as
                 implementation guidelines, detailed discussions of
                 writing systems, comprehensive charts, and an extensive
                 glossary. The accompanying CD-ROM includes the text of
                 all the Unicode Standard Annexes and the entire Unicode
                 Character Database.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Unicode Consortium Members and Directors \\
                 1: Introduction \\
                 2: General Structure \\
                 3: Conformance \\
                 4: Character Properties \\
                 5: Implementation Guidelines \\
                 6: Writing Systems and Punctuation \\
                 7: European Alphabetic Scripts \\
                 8: Middle Eastern Scripts \\
                 9: South Asian Scripts \\
                 10: Southeast Asian Scripts \\
                 11: East Asian Scripts \\
                 12: Additional Modern Scripts \\
                 13: Archaic Scripts \\
                 14: Symbols \\
                 15: Special Areas and Format Characters \\
                 16: Code Charts \\
                 17: Han Radical-Stroke Index \\
                 A: Han Unification History \\
                 B: Abstracts of Unicode Technical Reports \\
                 C: Relationship to ISO/IEC 10646 \\
                 D: Changes from Unicode Version 3.0",
}

@Book{Unicode:2006:USV,
  author =       "{The Unicode Consortium}",
  title =        "The {Unicode Standard}, Version 5.0",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "l + 1417",
  year =         "2006",
  ISBN =         "0-321-48091-0 (hardcover)",
  ISBN-13 =      "978-0-321-48091-0 (hardcover)",
  LCCN =         "QA268 .U545 2007",
  bibdate =      "Thu Nov 30 18:54:46 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Includes CD-ROM.",
  URL =          "http://www.loc.gov/catdir/toc/ecip0617/2006023526.html;
                 http://www.unicode.org/versions/beta.html;
                 http://www.unicode.org/versions/Unicode5.0.0/",
  abstract =     "Not yet published, but a beta version is available.
                 The Web site says ``The Unicode Standard Version 5.0 is
                 planned for release in book form in the third quarter
                 of 2006, and supersedes all previous versions of the
                 Standard.''",
  acknowledgement = ack-nhfb,
  subject =      "Unicode (Computer character set)",
  tableofcontents = "\\
                 Acknowledgments \\
                 Unicode Consortium Members \\
                 Unicode Consortium Liaison Members \\
                 Unicode Consortium Board of Directors \\
                 Figures \\
                 Tables \\
                 Preface \\
                 Chapter 1: Introduction \\
                 1.1 Coverage \\
                 1.2 Design Goals \\
                 1.3 Text Handling \\
                 Chapter 2: General Structure \\
                 2.1 Architectural Context \\
                 2.2 Unicode Design Principles \\
                 2.3 Compatibility Characters \\
                 2.4 Code Points and Characters \\
                 2.5 Encoding Forms \\
                 2.6 Encoding Schemes \\
                 2.7 Unicode Strings \\
                 2.8 Unicode Allocation \\
                 2.9 Details of Allocation \\
                 2.10 Writing Direction \\
                 2.11 Combining Characters \\
                 2.12 Equivalent Sequences and Normalization \\
                 2.13 Special Characters and Noncharacters \\
                 2.14 Conforming to the Unicode Standard \\
                 Chapter 3: Conformance \\
                 3.1 Versions of the Unicode Standard \\
                 3.2 Conformance Requirements \\
                 3.3 Semantics \\
                 3.4 Characters and Encoding \\
                 3.5 Properties \\
                 3.6 Combination \\
                 3.7 Decomposition \\
                 3.8 Surrogates \\
                 3.9 Unicode Encoding Forms \\
                 3.10 Unicode Encoding Schemes \\
                 3.11 Canonical Ordering Behavior \\
                 3.12 Conjoining Jamo Behavior \\
                 3.13 Default Case Algorithms \\
                 Chapter 4: Character Properties \\
                 4.1 Unicode Character Database \\
                 4.2 Case; Normative \\
                 4.3 Combining Classes; Normative \\
                 4.4 Directionality; Normative \\
                 4.5 General Category; Normative \\
                 4.6 Numeric Value; Normative \\
                 4.7 Bidi Mirrored; Normative \\
                 4.8 Name; Normative \\
                 4.9 Unicode 1.0 Names \\
                 4.10 Letters, Alphabetic, and Ideographic \\
                 4.11 Properties Related to Text Boundaries \\
                 4.12 Characters with Unusual Properties \\
                 Chapter 5: Implementation Guidelines \\
                 5.1 Transcoding to Other Standards \\
                 5.2 Programming Languages and Data Types \\
                 5.3 Unknown and Missing Characters \\
                 5.4 Handling Surrogate Pairs in UTF-16 \\
                 5.5 Handling Numbers \\
                 5.6 Normalization \\
                 5.7 Compression \\
                 5.8 Newline Guidelines \\
                 5.9 Regular Expressions \\
                 5.10 Language Information in Plain Text \\
                 5.11 Editing and Selection \\
                 5.12 Strategies for Handling Nonspacing Marks \\
                 5.13 Rendering Nonspacing Marks \\
                 5.14 Locating Text Element Boundaries \\
                 5.15 Identifiers \\
                 5.16 Sorting and Searching \\
                 5.17 Binary Order \\
                 5.18 Case Mappings \\
                 5.19 Unicode Security \\
                 5.20 Default Ignorable Code Points \\
                 Chapter 6: Writing Systems and Punctuation \\
                 6.1 Writing Systems \\
                 6.2 General Punctuation \\
                 Chapter 7: European Alphabetic Scripts \\
                 7.1 Latin \\
                 7.2 Greek \\
                 7.3 Coptic \\
                 7.4 Cyrillic \\
                 7.5 Glagolitic \\
                 7.6 Armenian \\
                 7.7 Georgian \\
                 7.8 Modifier Letters \\
                 7.9 Combining Marks \\
                 Chapter 8: Middle Eastern Scripts \\
                 8.1 Hebrew \\
                 8.2 Arabic \\
                 8.3 Syriac \\
                 8.4 Thaana \\
                 Chapter 9: South Asian Scripts-I \\
                 9.1 Devanagari \\
                 9.2 Bengali \\
                 9.3 Gurmukhi \\
                 9.4 Gujarati \\
                 9.5 Oriya \\
                 9.6 Tamil \\
                 9.7 Telugu \\
                 9.8 Kannada \\
                 9.9 Malayalam \\
                 Chapter 10: South Asian Scripts-II \\
                 10.1 Sinhala \\
                 10.2 Tibetan \\
                 10.3 Phags-pa \\
                 10.4 Limbu \\
                 10.5 Syloti Nagri \\
                 10.6 Kharoshthi \\
                 Chapter 11: Southeast Asian Scripts \\
                 11.1 Thai \\
                 11.2 Lao \\
                 11.3 Myanmar \\
                 11.4 Khmer \\
                 11.5 Tai Le \\
                 11.6 New Tai Lue \\
                 11.7 Philippine Scripts \\
                 11.8 Buginese \\
                 11.9 Balinese \\
                 Chapter 12: East Asian Scripts \\
                 12.1 Han \\
                 12.2 Ideographic Description Characters \\
                 12.3 Bopomofo \\
                 12.4 Hiragana and Katakana \\
                 12.5 Halfwidth and Fullwidth Forms \\
                 12.6 Hangul \\
                 12.7 Yi \\
                 Chapter 13: Additional Modern Scripts \\
                 13.1 Ethiopic \\
                 13.2 Mongolian \\
                 13.3 Osmanya \\
                 13.4 Tifinagh \\
                 13.5 N'Ko \\
                 13.6 Cherokee \\
                 13.7 Canadian Aboriginal Syllabics \\
                 13.8 Deseret \\
                 13.9 Shavian \\
                 Chapter 14: Archaic Scripts \\
                 14.1 Ogham \\
                 14.2 Old Italic \\
                 14.3 Runic \\
                 14.4 Gothic \\
                 14.5 Linear B \\
                 14.6 Cypriot Syllabary \\
                 14.7 Phoenician \\
                 14.8 Ugaritic \\
                 14.9 Old Persian \\
                 14.10 Sumero-Akkadian \\
                 Chapter 15: Symbols \\
                 15.1 Currency Symbols \\
                 15.2 Letterlike Symbols \\
                 15.3 Number Forms \\
                 15.4 Mathematical Symbols \\
                 15.5 Invisible Mathematical Operators \\
                 15.6 Technical Symbols \\
                 15.7 Geometrical Symbols \\
                 15.8 Miscellaneous Symbols and Dingbats \\
                 15.9 Enclosed and Square \\
                 15.10 Braille \\
                 15.11 Western Musical Symbols \\
                 15.12 Byzantine Musical Symbols \\
                 15.13 Ancient Greek Musical Notation \\
                 Chapter 16: Special Areas and Format Characters \\
                 16.1 Control Codes \\
                 16.2 Layout Controls \\
                 16.3 Deprecated Format Characters \\
                 16.4 Variation Selectors \\
                 16.5 Private-Use Characters \\
                 16.6 Surrogates Area \\
                 16.7 Noncharacters \\
                 16.8 Specials \\
                 16.9 Tag Characters \\
                 Chapter 17: Code Charts \\
                 17.1 Character Names List \\
                 17.2 CJK Unified Ideographs \\
                 17.3 Hangul Syllables \\
                 Chapter 18: Han Radical-Stroke Index \\
                 Appendix A: Notational Conventions \\
                 Appendix B: Unicode Publications and Resources \\
                 B.1 The Unicode Consortium \\
                 B.2 Unicode Publications \\
                 B.3 Unicode Technical Standards \\
                 B.4 Unicode Technical Reports \\
                 B.5 Unicode Technical Notes \\
                 B.6 Other Unicode Online Resources \\
                 Appendix C: Relationship to ISO/IEC 10646 \\
                 C.1 History \\
                 C.2 Encoding Forms in ISO/IEC 10646 \\
                 C.3 UCS Transformation Formats \\
                 C.4 Synchronization of the Standards \\
                 C.5 Identification of Features for the Unicode Standard
                 \\
                 C.6 Character Names \\
                 C.7 Character Functional Specifications \\
                 Appendix D: Changes from Previous Versions \\
                 D.1 Improvements to the Standard \\
                 D.2 Versions of the Unicode Standard \\
                 D.3 Clause and Definition Numbering Changes \\
                 D.4 Changes from Version 4.1 to Version 5.0 \\
                 D.5 Changes from Version 4.0 to Version 4.1 \\
                 D.6 Changes from Unicode Version 3.2 to Version 4.0 \\
                 D.7 Changes from Unicode Version 3.1 to Version 3.2 \\
                 D.8 Changes from Unicode Version 3.0 to Version 3.1 \\
                 Appendix E: Han Unification History \\
                 E.1 Development of the URO \\
                 E.2 Ideographic Rapporteur Group \\
                 Appendix F: Unicode Encoding Stability Policies \\
                 F.1 Encoding Stability Policies for the Unicode
                 Standard \\
                 Appendix G: Glossary \\
                 Appendix R: References \\
                 R.1 Source Standards and Specifications \\
                 R.2 Source Dictionaries for Han Unification \\
                 R.3 Other Sources for the Unicode Standard \\
                 R.4 Selected Resources: Technical \\
                 R.5 Selected Resources: Scripts and Languages \\
                 Appendix I: Indices \\
                 I.1 Unicode Names Index \\
                 I.2 General Index \\
                 Appendix X: Annexes \\
                 UAX 9: The Bidirectional Algorithm \\
                 UAX 11: East Asian Width \\
                 UAX 14: Line Breaking Properties \\
                 UAX 15: Unicode Normalization Forms \\
                 UAX 24: Script Names \\
                 UAX 29: Text Boundaries \\
                 UAX 31: Identifier and Pattern Syntax \\
                 UAX 34: Unicode Named Character Sequences \\
                 UAX 41: Common References for Unicode Standard
                 Annexes",
}

@Book{Upstill:1990:RC,
  author =       "Steve Upstill",
  title =        "The {RenderMan} Companion",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xix + 475",
  year =         "1990",
  ISBN =         "0-201-50868-0",
  ISBN-13 =      "978-0-201-50868-0",
  LCCN =         "T385 .U67 1990",
  bibdate =      "Wed Dec 15 10:58:57 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "The Image-Rendering World \\
                 Getting Started \\
                 The Structure of a Render Man Program \\
                 Primitive Surfaces I: Quadratic Surfaces \\
                 Primitive Surfaces II: Polygons \\
                 Primitive Surfaces III: Parametric Surfaces \\
                 Geometric Transformations and Hierarchical Modeling \\
                 Viewing I: The Digital Camera \\
                 Viewing II: A Model of the Rendering Process \\
                 Procedural Models and Level of Detail \\
                 Lighting and Shading \\
                 Surface Mapping \\
                 The RenderMan Shading Language I: Introduction \\
                 The RenderMan Shading Language II: Description \\
                 The RenderMan Shading Language III: Tools \\
                 A Gallery of Shaders \\
                 Appendixes",
}

@Book{Urroz:2001:NSMa,
  author =       "Gilberto E. Urroz",
  title =        "Numerical and Statistical Methods with {SCILAB} for
                 Science and Engineering",
  volume =       "1",
  publisher =    "BookSurge Publishing",
  address =      "North Charleston, SC, USA",
  pages =        "xv + 563",
  year =         "2001",
  ISBN =         "1-58898-304-8",
  ISBN-13 =      "978-1-58898-304-6",
  LCCN =         "TA345 .U77 2001",
  bibdate =      "Sat Jun 13 10:49:17 MDT 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/numana2000.bib;
                 z3950.bibsys.no:2100/BIBSYS",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
}

@Book{Urroz:2001:NSMb,
  author =       "Gilberto E. Urroz",
  title =        "Numerical and statistical methods with {SCILAB} for
                 science and engineering",
  volume =       "2",
  publisher =    "Greatunpublished.com",
  address =      "Charleston, SC, USA",
  pages =        "xv + 486",
  year =         "2001",
  ISBN =         "1-58898-305-6",
  ISBN-13 =      "978-1-58898-305-3",
  LCCN =         "TA345 .U77 2001",
  bibdate =      "Wed Jan 9 14:11:42 MST 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/numana2000.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
}

@Book{Vahalia:1996:UI,
  author =       "Uresh Vahalia",
  title =        "{UNIX} Internals",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xxxiii + 601",
  year =         "1996",
  ISBN =         "0-13-101908-2",
  ISBN-13 =      "978-0-13-101908-9",
  LCCN =         "QA76.76.063V33 1996",
  MRclass =      "68N25, 68-01",
  bibdate =      "Mon Sep 23 08:50:16 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Introduction \\
                 Introduction \\
                 The Mandate For Change \\
                 Looking Back, Looking Forward \\
                 The Scope of This Book \\
                 References \\
                 2: The Process and the Kernel \\
                 Introduction \\
                 Mode, Space, and Context \\
                 The Process Abstraction \\
                 Executing In Kernel Mode \\
                 Synchronization \\
                 Process Scheduling \\
                 Signals \\
                 New Processes and Programs \\
                 Summary \\
                 Exercises \\
                 References \\
                 3: Threads and Lightweight Processes \\
                 Introduction \\
                 Fundamental Abstractions \\
                 Lightweight Process Design-Issues To Consider \\
                 User-Lever Threads Libraries \\
                 Scheduler Activations \\
                 Multithreading in Solaris and SVR4 \\
                 Threads In MACH \\
                 Digital UNIX \\
                 MACH 3.0 Continuations \\
                 Summary \\
                 Exercises \\
                 References \\
                 4: Signals and Session Management \\
                 Introduction \\
                 Signal Generation and Handling \\
                 Unreliable Signals \\
                 Reliable Signals \\
                 Signals in SVR4 \\
                 Signals Implementation \\
                 Exceptions \\
                 MACH Exception Handling \\
                 Process Groups and Terminal Management \\
                 The SVR4 Sessions Architecture \\
                 Summary \\
                 Exercises \\
                 References \\
                 5: Process Scheduling \\
                 Introduction \\
                 Clock Interrupt Handling \\
                 Scheduler Goals \\
                 Traditional UNIX Scheduling \\
                 The SVR4 Scheduler \\
                 SOLARIS 2.X Scheduling Enhancements \\
                 Scheduling in MACH \\
                 The Digital UNIX Real-Time Scheduler \\
                 Other Scheduling Implementations \\
                 Summary \\
                 Exercises \\
                 References \\
                 6: Interprocess Communications \\
                 Introduction \\
                 Universal IPC Facilities \\
                 System V IPC \\
                 Mach IPC \\
                 Messages \\
                 Ports \\
                 Message Passing \\
                 Port Operations \\
                 Extensibility \\
                 MACH 3.0 Enhancements \\
                 Discussion \\
                 Summary \\
                 Exercises \\
                 References \\
                 7: Synchronization and Multiprocessing \\
                 Introduction \\
                 Synchronization in Traditional UNIX Kernels \\
                 Multiprocessor Systems \\
                 Multiprocessor Synchronization Issues \\
                 Semaphores \\
                 Spin Locks \\
                 Condition Variables \\
                 Read-Write Locks \\
                 Reference Counts \\
                 Other Considerations \\
                 Case Studies \\
                 Summary \\
                 Exercises \\
                 References \\
                 8: File System Interface and Framework \\
                 Introduction \\
                 The User Interface to Files \\
                 File Systems \\
                 Special Files \\
                 File System Framework \\
                 The Vnode /VFS Architecture \\
                 Implementation Overview \\
                 File-System-Dependent Objects \\
                 Mounting a File System \\
                 Operations on Files \\
                 Analysis \\
                 Summary \\
                 Exercises \\
                 References \\
                 9: File System Implementations \\
                 Introduction \\
                 The System V File System (s5fs) \\
                 S5fs Kernel Organization \\
                 Analysis of S5fs \\
                 The Berkeley Fast File System \\
                 Hard Disk Structure \\
                 On-Disk Organization \\
                 FFS Functionality Enhancements \\
                 Analysis \\
                 Temporary File Systems \\
                 Special-Purpose File Systems \\
                 The Old Buffer Cache \\
                 Summary \\
                 Exercises \\
                 References \\
                 10: Distributed File Systems \\
                 Introduction \\
                 General Characteristics of Distributed File Systems \\
                 Network File System (NFS) \\
                 The Protocol Suite \\
                 NFS Implementation \\
                 UNIX Semantics \\
                 NFS Performance \\
                 Dedicated NFS Servers \\
                 NFS Security \\
                 NFS Version 3 \\
                 Remote File Sharing (RFS) \\
                 RFS Architecture \\
                 RFS Implementation \\
                 Client-Side Caching \\
                 The Andrew File System \\
                 AFS Implementation \\
                 AFS Shortcomings \\
                 The DCE Distributed File System (DCE DFS) \\
                 Summary \\
                 Exercises \\
                 References \\
                 11: Advanced File Systems \\
                 Introduction \\
                 Limitations of Traditional File Systems \\
                 File System Clustering (Sun-FFS) \\
                 The Journaling Approach \\
                 Log-Structured File Systems \\
                 The 4.4BSD Log-Structured File System \\
                 Metadata Logging \\
                 The Episode File System \\
                 Watchdogs \\
                 The 4.4BSD Portal File System \\
                 Stackable File System Layers \\
                 The 4.4BSD File System Interface \\
                 Summary \\
                 Exercises \\
                 References \\
                 12: Kernel Memory Allocation \\
                 Introduction \\
                 Functional Requirements \\
                 Resource Map Allocator \\
                 Simple Power-of-Two Free Lists \\
                 The McKusick-Karels Allocator \\
                 The Buddy System \\
                 The SVR4 Lazy Buddy Algorithm \\
                 The MACH-OSF /1 Zone Allocator \\
                 A Hierarchical Allocator for Multiprocessors \\
                 The Solaris 2.4 Slab Allocator \\
                 Summary \\
                 Exercises \\
                 References \\
                 13: Virtual Memory \\
                 Introduction \\
                 Demand Paging \\
                 Hardware Requirements \\
                 4: 3BSD \\
                 A Case Study \\
                 4: 3BSD Memory Management Operations \\
                 Analysis \\
                 Exercises \\
                 References \\
                 14: The SVR4 VM Architecture \\
                 Motivation \\
                 Memory-Mapped Files \\
                 VM Design Principles \\
                 Fundamental Abstractions \\
                 Segment Drivers \\
                 The Swap Layer \\
                 VM Operations \\
                 Interaction with the Vnode Subsystem \\
                 Virtual Swap Space in Solaris \\
                 Analysis \\
                 Performance Improvements \\
                 Summary \\
                 Exercises \\
                 References \\
                 15: More Memory Management Topics \\
                 Introduction \\
                 MACH Memory Management Design \\
                 Memory Sharing Facilities \\
                 Memory Objects and Pagers \\
                 External and Internal Pagers \\
                 Page Replacement \\
                 Analysis \\
                 Memory Management in 4.4BSD \\
                 Translation Lookaside Buffer (TLB) Consistency \\
                 TLB Shootdown in MACH \\
                 TLB Consistency in SVR4 and SVR4.2 UNIX \\
                 Other TLB Consistency Algorithms \\
                 Virtually Addressed Caches \\
                 Exercises \\
                 References \\
                 16: Device Drivers and I /O \\
                 Introduction \\
                 Overview \\
                 Device Driver Framework \\
                 The I /O Subsystem \\
                 The poll System Call \\
                 Block I /O \\
                 The DDI /DKI Specification \\
                 Newer SVR4 Releases \\
                 Future Directions \\
                 Summary \\
                 Exercises \\
                 References \\
                 17: Streams \\
                 Motivation \\
                 Overview \\
                 Messages and Queues \\
                 Stream I /O \\
                 Configuration and Setup \\
                 STREAMS ioctls \\
                 Memory Allocation \\
                 Multiplexing \\
                 FIFOs and Pipes \\
                 Networking Interfaces \\
                 Summary \\
                 Exercises \\
                 References",
}

@Book{vanCalmthout:2018:SGH,
  editor =       "Martijn van Calmthout and Michiel Horn",
  title =        "{Sam Goudsmit} and the hunt for {Hitler}'s atom bomb",
  publisher =    pub-PROMETHEUS-BOOKS,
  address =      pub-PROMETHEUS-BOOKS:adr,
  pages =        "243 + 14",
  year =         "2018",
  ISBN =         "1-63388-450-3 (hardcover), 1-63388-451-1 (e-book)",
  ISBN-13 =      "978-1-63388-450-2 (hardcover), 978-1-63388-451-9
                 (e-book)",
  LCCN =         "DS135.N6 G65613 2018",
  bibdate =      "Sat Apr 13 15:58:03 MDT 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/g/goudsmit-samuel-a.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/h/heisenberg-werner.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "The first biography in English of a leading Dutch
                 American physicist, who discovered the subatomic
                 property of ``spin'' and spearheaded the search for
                 Hitler's atom bomb as World War II came to an end.",
  acknowledgement = ack-nhfb,
  author-dates = "1961--",
  brieftableofcontents = "Prologue: A home stripped bare: The Hague,
                 September 1945 \\
                 Nothing to lose as yet: Leiden, September 1927 \\
                 Appeals and Zeeman's chair: Michigan, 1933--1940 \\
                 The shadow of war: Boston, 1941--1944 \\
                 Hitler's atom bomb: Paris, 1944 \\
                 Uranium and heavy water: Germany, 1944--1945 \\
                 The truth of Kistemaker: Amsterdam, 1960--1961 \\
                 Heisenberg's version: Cambridge, 1945--1973 \\
                 Sam's Cold War: Brookhaven, 1947--1978 \\
                 Under the spell of the scarab: Leiden--Nevada,
                 1925--1978",
  remark =       "English translation of \cite{vanCalmthout:2016:SGJ}.",
  subject =      "Goudsmit, Samuel A. (Samuel Abraham); Physicists;
                 Netherlands; Biography; Jews; Atomic bomb; Germany;
                 History; 20th century; Biography and Autobiography /
                 Science and Technology; Science / Physics / Nuclear;
                 Kernwaffe; Nationalsozialismus; Physiker; Niederlande",
  subject-dates = "Samuel Goudsmit (1902--1978)",
  tableofcontents = "Editor/Translator's Note / 11 \\
                 Preface / 13 \\
                 Prologue: A Home Stripped Bare: The Hague, September
                 1945 / 19 \\
                 1: Nothing to Lose as Yet: Leiden, September 1927 / 27
                 \\
                 2: Appeals and Zeeman's Chair: Michigan, 1933--1940 /
                 47 \\
                 3: The Shadow of War: Boston, 1941--1944 / 65 \\
                 4: Hider's Atom Bomb: Paris, 1944 / 77 \\
                 5: Uranium and Heavy Water: Germany, 1944--1945 / 101
                 \\
                 6: The Truth of Kistemaker: Amsterdam, 1960--1961 / 129
                 \\
                 7: Heisenberg's Version: Cambridge, 1945--1973 / 149
                 \\
                 8: Sam's Cold War: Brookhaven, 1947--1978 / 171 \\
                 9: Under the Spell of the Scarab: Leiden--Nevada,
                 1925--1978 / 205 \\
                 Bibliography / 235 \\
                 Index / 239",
}

@Book{Vandevoorde:1999:CSC,
  author =       "David Vandevoorde",
  title =        "{C++} solutions: companion to {The C++ Programming
                 Language, Third edition}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "vii + 292",
  year =         "1999",
  ISBN =         "0-201-30965-3 (paperback)",
  ISBN-13 =      "978-0-201-30965-2 (paperback)",
  LCCN =         "QA76.73.C153V36 1998",
  bibdate =      "Tue May 11 07:04:43 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See \cite{Stroustrup:1997:CPL}.",
  price =        "US\$29.95",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
}

@Book{vanHerwijnen:1990:PS,
  author =       "Eric {van Herwijnen}",
  title =        "Practical {SGML}",
  publisher =    pub-KLUWER,
  address =      pub-KLUWER:adr,
  pages =        "xviii + 307",
  year =         "1990",
  DOI =          "https://doi.org/10.1007/978-1-4613-0687-0",
  ISBN =         "0-7923-0635-X, 0-7923-9434-8",
  ISBN-13 =      "978-0-7923-0635-1, 978-0-7923-9434-1",
  LCCN =         "QA76.73.S44 V36 1990",
  bibdate =      "Mon Oct 26 07:31:07 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/sgml.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook2.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  price =        "UK\pounds24.90, US\$49.00",
  abstract =     "Many times there are subjects which demand further
                 explanations and guidance written about them. Such is
                 the case with SGML, the Standard Generalized Markup
                 Language; and ISO Standard published in October, 1986
                 under the number 8879. There have been many conferences
                 given on this topic, world-wide, as the interest in
                 SGML exists in Europe, the US, Australia and Japan.
                 This book is the first which contains information not
                 only on ISO 8879 itself, but many helpful hints and
                 ideas on developing SGML, applications and discussions
                 of the current software written to be conforming to the
                 ISO standard. This book is critical for any end-user
                 and application developer to understand the many issues
                 necessary to develop SGML implementations (software
                 selection is one of the topics discussed) and SGML
                 applications. A number of examples of the applications
                 of SGML in various situations are discussed and one can
                 expect that the book will stimulate further discussion
                 of these. This book is a practical guide to various
                 components of the language and the author's experience
                 in development and working with SGML in his position as
                 leader of the text processing section at CERN ensures
                 that the guidance is based on practical first-hand
                 experience at an installation with a large number of
                 end-users of very varied experience.",
  acknowledgement = ack-nhfb,
  tableofcontents = "I Getting Started with SGML 1 \\
                 1: Introduction \\
                 2: An SGML application \\
                 document type components \\
                 3: Creating an SGML application: method and basics \\
                 4: Creating an SGML application: examples and summary
                 \\
                 5: Managing SGML \\
                 II: Advanced SGML 97 \\
                 6: Creating an SGML application: advanced concepts \\
                 7: Advanced SGML constructs \\
                 8: Mathematics and Graphics \\
                 III: SGML implementations 165 \\
                 9: SGML implementations \\
                 10: Creating SGML documents \\
                 11: SGML and databases \\
                 12: The CALS initiative \\
                 13: SGML and EDI \\
                 Appendix A: Answers to the problems \\
                 A.1 Answers for Chapter 1 \\
                 A.2 Answers for Chapter 2 \\
                 A.3 Answers for Chapter 3 \\
                 A.4 Answers for Chapter 4 \\
                 A.5 Answers for Chapter 6 \\
                 A.6 Answers for Chapter 7 \\
                 A.7 Answers for Chapter 10 \\
                 Appendix B: Writing a book on SGML using SGML \\
                 B.1 Statistics \\
                 B.2 Document exchange \\
                 B.3 Bibliography for Appendix B \\
                 Appendix C: The Ericbook DTD \\
                 Appendix D: Some TeX entity definitions \\
                 Appendix E: How to read ISO 8879 \\
                 E.1 Structure of the SGML standard \\
                 E.2 Notation used in the SGML standard \\
                 E.3 Bibliography for Appendix E \\
                 Bibliography for Glossary",
}

@Book{vanHerwijnen:1994:PS,
  author =       "Eric {van Herwijnen}",
  title =        "Practical {SGML}",
  publisher =    pub-KLUWER,
  address =      pub-KLUWER:adr,
  edition =      "Second",
  pages =        "xx + 288",
  year =         "1994",
  ISBN =         "0-7923-9434-8",
  ISBN-13 =      "978-0-7923-9434-1",
  LCCN =         "QA76.73.S44 V36 1994",
  bibdate =      "Mon Oct 26 07:31:11 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/sgml.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Foreword \\
                 Preface to the second edition \\
                 Acknowledgments \\
                 Conventions and definitions \\
                 Introduction / 3 \\
                 A brief history of SGML / 17 \\
                 Components of an SGML system / 25 \\
                 Document type components / 31 \\
                 Creating SGML documents / 47 \\
                 How to keep up to date with SGML / 51 \\
                 Document analysis / 57 \\
                 Structure diagrams / 65 \\
                 Markup declarations / 73 \\
                 Element declarations / 81 \\
                 Attribute declarations / 89 \\
                 Entity declarations / 95 \\
                 Putting the DTD together / 105 \\
                 Some advice on DTDs / 111 \\
                 The SGML declaration / 121 \\
                 SGML features / 151 \\
                 Notation / 161 \\
                 Marked sections / 167 \\
                 Short references / 173 \\
                 Record boundaries and ambiguities / 181 \\
                 SGML and EDI / 191 \\
                 SGML and mathematics / 207 \\
                 Graphics and SGML / 217 \\
                 Other ISO text processing standards / 225 \\
                 A. Solutions to the exercises / 244 \\
                 B. The sgmls parser / 260 \\
                 C. The ISO 646: 1983 character set / 262 \\
                 D. How to read ISO 8879 / 263 \\
                 Glossary / 267 \\
                 Index / 281",
}

@Book{vanLeunen:1992:HS,
  author =       "Mary-Claire van Leunen",
  title =        "A handbook for scholars",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  edition =      "Revised",
  pages =        "xi + 348",
  year =         "1992",
  ISBN =         "0-394-40904-3 (hardcover), 0-394-73395-9 (paperback)",
  ISBN-13 =      "978-0-394-40904-7 (hardcover), 978-0-394-73395-1
                 (paperback)",
  LCCN =         "PN146 .V36 1992",
  bibdate =      "Tue Nov 21 07:44:41 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/typeset.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Academic writing; Handbooks, manuals, etc; Scholarly
                 publishing; Art d'{\'e}crire; Guides, manuels, etc;
                 Academic writing; Scholarly publishing;
                 Schrijfvaardigheid; Wetenschappelijke publicaties;
                 Authorship",
  tableofcontents = "The text \\
                 Citation: The new style of citation \\
                 Embedding citations \\
                 Brackets alone \\
                 Handling bracketed numbers \\
                 Pointing citations \\
                 Tense in citations \\
                 Citing authors \\
                 Citing works \\
                 Citing yourself \\
                 Irrelevant citation \\
                 Citations in draft \\
                 Quotation: A plea against quotation \\
                 A plea for quotation \\
                 Epigraphs \\
                 Quotation and citation \\
                 Inlaid versus displayed quotations \\
                 Punctuating quotations \\
                 Quoting format \\
                 Changes in quotations \\
                 Permission to quote \\
                 Other uses for quotation marks \\
                 Quotations in draft \\
                 The footnote: Fundamentals \\
                 Explanatory footnotes \\
                 The footnote aside \\
                 Footnotes in draft \\
                 Scholarly peculiarities: The abstract \\
                 Acknowledgments \\
                 Bad words \\
                 Bending over backwards \\
                 Capitalization \\
                 The cliche redivivus \\
                 Coherence \\
                 The colonated title \\
                 Conclusions \\
                 Emphasis \\
                 Equanimity \\
                 Hyperqualification \\
                 Initialisms and acronyms \\
                 Introductions \\
                 Inventing terms and notation \\
                 Inversion \\
                 A little Latin \\
                 Motivation \\
                 Nor \\
                 Paragraphing \\
                 Passivity \\
                 Personal fads \\
                 Respective \\
                 The waffle \\
                 Which-hunting \\
                 The reference \\
                 Panorama \\
                 Reference format: Style \\
                 I. Authors \\
                 II. Titles \\
                 III. Bibliographic information \\
                 IV. More bibliographic information \\
                 V. Annotation \\
                 Pinpointing \\
                 Needless information \\
                 Easy References: Books \\
                 Compilations \\
                 Collections \\
                 Editions with editors \\
                 Translations \\
                 Multivolume works \\
                 Journal articles \\
                 Reviews \\
                 Pamphlets \\
                 Works not yet published \\
                 Theses and dissertations \\
                 Secondary reference \\
                 Hard references: Archival sources \\
                 Author equals publishers \\
                 Conference proceedings \\
                 Correspondence \\
                 Court cases \\
                 Government documents \\
                 Microfilm and microfiche \\
                 Newspapers \\
                 Reference works \\
                 Shoes and ships and sealing wax \\
                 The reference list: Reference list versus bibliography
                 \\
                 Compound references \\
                 Special sections \\
                 Cross-reference \\
                 Alphabetical order \\
                 Chronological order \\
                 Order of mention \\
                 Last-minute changes \\
                 Compression \\
                 The finishing touch \\
                 Special schemes: Short names \\
                 White copy \\
                 Super-quick \\
                 Manuscript preparation: Final draft \\
                 Classroom copy \\
                 Examples of display layout \\
                 Classroom copy with footnotes \\
                 Page from a reference list \\
                 Photo-ready copy \\
                 Sample instruction sheet \\
                 Perfect copy \\
                 Galleys and page proofs \\
                 The end \\
                 Appendix 1: The Vita \\
                 Appendix 2: Federal documents of the United States",
}

@Book{VanLoan:1992:CFF,
  author =       "Charles F. {Van Loan}",
  title =        "Computational Frameworks for the {Fast Fourier
                 Transform}",
  publisher =    pub-SIAM,
  address =      pub-SIAM:adr,
  pages =        "xiii + 273",
  year =         "1992",
  DOI =          "https://doi.org/10.1137/1.9781611970999",
  ISBN =         "0-89871-285-8 (paperback), 1-61197-099-7 (e-book)",
  ISBN-13 =      "978-0-89871-285-8 (paperback), 978-1-61197-099-9
                 (e-book)",
  LCCN =         "QA403.5 .V35 1992",
  bibdate =      "Mon Oct 26 07:31:14 1998",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg-2ed.bib;
                 https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
                 https://www.math.utah.edu/pub/bibnet/subjects/han-wri-mat-sci-2ed.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/matlab.bib",
  series =       "Frontiers in applied mathematics",
  acknowledgement = ack-nhfb,
  subject =      "Fourier transformations",
  tableofcontents = "1: The Radix-2 Frameworks: Matrix Notation and
                 Algorithms \\
                 The FFT Idea \\
                 The Cooley--Tukey Factorization \\
                 Weight and Butterfly Computations \\
                 Bit Reversal and Transposition \\
                 The Cooley--Tukey Framework \\
                 The Stockham Autosort Frameworks \\
                 The Pease Framework \\
                 Decimation in Frequency and Inverse FFTs \\
                 2: General Radix Frameworks: The General Radix Ideas
                 \\
                 Index Reversal and Transposition \\
                 Mixed-Radix Factorizations \\
                 Radix-4 and Radix-8 Frameworks \\
                 The Split-Radix Frameworks \\
                 3: High Performance Frameworks: The Multiple DFT
                 Problem \\
                 Matrix Transposition \\
                 The Large Single-Vector FFT Problem \\
                 Multi-Dimensional FFT Problem \\
                 Distributed Memory FFTs \\
                 Shared Memory FFTs \\
                 4: Selected Topics: Prime Factor FFTs \\
                 Convolution \\
                 FFTs of Real Data \\
                 Cosine and Sine Transforms \\
                 Fast Poisson Solvers \\
                 Bibliography \\
                 Index",
}

@Book{vanWijngaarden:1976:RRA,
  editor =       "Adriaan van Wijngaarden and B. J. (Barry James)
                 Mailloux and J. E. L. (John E. L. (Edward Lancelot))
                 Peck and C. H. A. (Cornelis H. A.) Koster and M.
                 Sintzoff and C. H. Lindsey and Lambert G. L. Meertens
                 and R. G. Fisker",
  title =        "Revised Report on the Algorithmic Language {ALGOL
                 68}",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "236",
  year =         "1976",
  ISBN =         "0-387-07592-5, 3-540-07592-5",
  ISBN-13 =      "978-0-387-07592-1, 978-3-540-07592-9",
  LCCN =         "QA76.73.A24 R45 1976",
  bibdate =      "Sat Apr 27 15:52:06 MDT 2024",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Algol (Lenguaje de Programaci{\'o}n para
                 Computadores); Lenguajes de Programaci{\'o}n
                 (Computadores Electr{\'o}nicos)",
  tableofcontents = "Preliminary definitions \\
                 Fundamental constructions \\
                 Context dependence \\
                 Elaboration-independent constructions \\
                 Environment and examples",
}

@Book{VanWolferen:1989:EJP,
  author =       "Karel {Van Wolferen}",
  title =        "The enigma of {Japanese} power: people and politics in
                 a stateless nation",
  publisher =    pub-KNOPF,
  address =      pub-KNOPF:adr,
  pages =        "496",
  year =         "1989",
  ISBN =         "0-333-44321-7, 0-394-57796-5",
  ISBN-13 =      "978-0-333-44321-7, 978-0-394-57796-8",
  LCCN =         "JQ1681 .W6521 1989",
  bibdate =      "Mon Oct 26 07:31:18 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$24.95, UK\pounds 16.95",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

@Book{VanWyk:1988:DSC,
  author =       "Christopher J. {Van Wyk}",
  title =        "Data Structures in {C}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "x + 387",
  year =         "1988",
  ISBN =         "0-201-16116-8",
  ISBN-13 =      "978-0-201-16116-8",
  LCCN =         "QA76.73.C15 V36 1988",
  bibdate =      "Mon Oct 26 07:31:49 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  shorttableofcontents = "Part I: Fundamental Ideas \\
                 1: Charting Our Course / 3 \\
                 2: The Complexity of Algorithms / 25 \\
                 3: Pointers and Dynamic Storage / 49 \\
                 4: Stacks and Queues / 79 \\
                 5: Linked Lists / 101 \\
                 6: Memory Organization / 129 \\
                 Part II: Efficient Algorithms \\
                 7: Searching / 149 \\
                 8: Hashing / 177 \\
                 9: Sorted Lists / 193 \\
                 10: Priority Queues / 225 \\
                 11: Sorting / 249 \\
                 12: Applying Data Structures / 271 \\
                 Part III: Advanced Topics \\
                 13: Acyclic Graphs / 297 \\
                 14: Graphs / 313 \\
                 A: C for Programmers / 345 \\
                 B: Library Functions / 357 \\
                 C: Our Header File / 365 \\
                 D: Solutions to Selected Exercises / 367 \\
                 Index / 377",
  tableofcontents = "Preface / iii \\
                 Part I: Fundamental Ideas \\
                 1: Charting Our Course / 3 \\
                 1.1 Problem: Summarizing Data / 3 \\
                 1.2 Solution I / 5 \\
                 1.3 Solution II / 7 \\
                 1.4 Measuring Performance / 12 \\
                 1.5 Summary and Perspective / 20 \\
                 2: The Complexity of Algorithms / 25 \\
                 2.1 The Idea of An Algorithm / 25 \\
                 2.2 Algorithms For Exponentiation / 27 \\
                 2.3 Asymptotic Analysis / 35 \\
                 2.4 Implementation Considerations / 38 \\
                 2.5 Summary and Perspective / 41 \\
                 3: Pointers and Dynamic Storage / 49 \\
                 3.1 Variables and Pointers / 49 \\
                 3.2 Character Strings and Arrays / 56 \\
                 3.3 Typedefs and Structures / 66 \\
                 3.4 Dynamic Storage Allocation / 69 \\
                 3.5 Summary and Perspective / 72 \\
                 4: Stacks and Queues / 79 \\
                 4.1 Two Disciplines For Paying Bills / 79 \\
                 4.2 The Stack Data Type / 81 \\
                 4.3 The Queue Data Type / 84 \\
                 4.4 Example Applications / 89 \\
                 4.5 Summary and Perspective / 94 \\
                 5: Linked Lists / 101 \\
                 5.1 Lists / 101 \\
                 5.2 Application: Sets / 106 \\
                 5.3 Miscellaneous Tools For Linked Structures / 117 \\
                 5.4 Multiply Linked Structures / 123 \\
                 5.5 Summary and Perspective / 125 \\
                 6: Memory Organization / 129 \\
                 6.1 More About Memory / 129 \\
                 6.2 Variables and the Runtime Stack / 133 \\
                 6.3 A Simple Heap Management Scheme / 136 \\
                 6.4 Physical Memory Organization / 139 \\
                 6.5 Summary and Perspective / 142 \\
                 Part II: Efficient Algorithms \\
                 7: Searching / 149 \\
                 7.1 Aspects of Searching / 149 \\
                 7.2 Self-Organizing Linked Lists / 152 \\
                 7.3 Binary Search / 155 \\
                 7.4 Binary Trees / 159 \\
                 7.5 Binary Search Trees / 163 \\
                 7.6 Summary and Perspective / 170 \\
                 8: Hashing / 177 \\
                 8.1 Perfect Hashing / 177 \\
                 8.2 Collision Resolution Using A Probe Strategy / 179
                 \\
                 8.3 Collision Resolution Using Linked Lists / 185 \\
                 8.4 Summary and Perspective / 186 \\
                 9: Sorted Lists / 193 \\
                 9.1 AVL Trees / 194 \\
                 9.2 2,4 Trees / 200 \\
                 9.3 Implementation: Red--Black Trees / 205 \\
                 9.4 Further Topics / 218 \\
                 9.5 Summary and Perspective / 220 \\
                 10: Priority Queues / 225 \\
                 10.1 The Data Type Priority Queue / 226 \\
                 10.2 Heaps / 227 \\
                 10.3 Implementation of Heaps / 232 \\
                 10.4 Huffman Trees / 235 \\
                 10.5 Other Operations / 240 \\
                 10.6 Summary and Perspective / 243 \\
                 11: Sorting / 249 \\
                 11.1 Settings For Sorting / 249 \\
                 11.2 Two Simple Sorting Algorithms / 251 \\
                 11.3 Two Efficient Sorting Algorithms / 255 \\
                 11.4 Two Useful Sorting Ideas / 262 \\
                 11.5 Summary and Perspective / 265 \\
                 12: Applying Data Structures / 271 \\
                 12.1 Double-Entry Bookkeeping / 271 \\
                 12.2 Basic Solution / 277 \\
                 12.3 Solution I / 284 \\
                 12.4 Solution II / 287 \\
                 12.5 Summary and Perspective / 289 \\
                 Part III: Advanced Topics \\
                 13: Acyclic Graphs / 297 \\
                 13.1 Rooted Trees / 297 \\
                 13.2 Disjoint Sets / 300 \\
                 13.3 Topological Sorting / 306 \\
                 13.4 Summary and Perspective / 309 \\
                 14: Graphs / 313 \\
                 14.1 Terminology / 313 \\
                 14.2 Data Structures / 315 \\
                 14.3 Shortest Paths / 317 \\
                 14.4 Minimum Spanning Trees / 324 \\
                 14.5 Traversal Orders and Graph Connectivity / 329 \\
                 14.6 Summary and Perspective / 337 \\
                 Appendixes \\
                 A: C for Programmers / 345 \\
                 B: Library Functions / 357 \\
                 C: Our Header File / 365 \\
                 D: Solutions to Selected Exercises / 367 \\
                 Index / 377",
}

@Article{VanWyk:awk,
  author =       "Christopher J. {Van Wyk}",
  title =        "{AWK} as Glue for Programs",
  journal =      j-SPE,
  volume =       "16",
  number =       "4",
  pages =        "369--388",
  month =        apr,
  year =         "1986",
  bibdate =      "Mon Oct 26 07:31:34 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Article{VanWyk:ideal,
  author =       "Christopher J. {Van Wyk}",
  title =        "A High-Level Language for Specifying Pictures",
  journal =      j-TOG,
  volume =       "1",
  number =       "2",
  pages =        "163--182",
  month =        apr,
  year =         "1982",
  bibdate =      "Mon Oct 26 07:31:54 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Article{Viswanath:2000:RFS,
  author =       "Divakar Viswanath",
  title =        "Random {Fibonacci} sequences and the number $
                 1.13198824 \dots $",
  journal =      j-MATH-COMPUT,
  volume =       "69",
  number =       "231",
  pages =        "1131--1155",
  month =        jul,
  year =         "2000",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  bibdate =      "Wed Nov 1 11:50:05 MST 2000",
  bibsource =    "http://www.ams.org/mcom/2000-69-231;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://www.ams.org/journal-getitem?pii=S0025-5718-99-01145-X;
                 http://www.ams.org/mcom/2000-69-231/S0025-5718-99-01145-X/S0025-5718-99-01145-X.dvi;
                 http://www.ams.org/mcom/2000-69-231/S0025-5718-99-01145-X/S0025-5718-99-01145-X.pdf;
                 http://www.ams.org/mcom/2000-69-231/S0025-5718-99-01145-X/S0025-5718-99-01145-X.ps;
                 http://www.ams.org/mcom/2000-69-231/S0025-5718-99-01145-X/S0025-5718-99-01145-X.tex",
  acknowledgement = ack-nhfb,
  annote =       "This paper generalizes the Fibonacci sequence by
                 replacing the addition rule by a random choice of
                 addition or subtraction; the surprising result is that
                 the terms still grow exponentially, and the absolute
                 value of the $ n^{\mbox {th}} $ term obtained this way
                 approaches the $ n^{\mbox {th}} $ power of $ 1.13198824
                 \dots $, a new mathematical constant, for large $n$.",
}

@Book{vonLaue:2023:HP,
  author =       "Max von Laue and Vesselin Petkov and Ralph Oesper",
  title =        "History of Physics",
  publisher =    "Minkowski Institute Press",
  address =      "Montr{\'e}al, Qu{\'e}bec, Canada",
  pages =        "vi + 176",
  year =         "2023",
  ISBN =         "1-998902-01-3",
  ISBN-13 =      "978-1-998902-01-9, 978-1-998902-02-6",
  LCCN =         "????",
  bibdate =      "Tue Aug 22 17:22:14 MDT 2023",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "English translation of German original
                 \booktitle{Geschichte der Physik} (1946, 1950, 1957).",
  acknowledgement = ack-nhfb,
  author-dates = "Max von Laue (1879--1960); 1879--1960",
  libnote =      "Not yet in my library.",
  remark =       "TO DO: Find table of contents",
}

@TechReport{vonNeumann:1945:FDR,
  author =       "John von Neumann",
  title =        "First Draft of a Report on the {EDVAC}",
  institution =  "University of Pennsylvania",
  day =          "30",
  month =        jun,
  year =         "1945",
  bibdate =      "Mon Jun 06 19:17:03 2005",
  bibsource =    "ftp://ftp.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Ai/alife.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Reprinted in \cite[\S 8.2]{Randell:1982:ODC}.",
  acknowledgement = ack-nhfb,
  remark =       "This is the report that got von Neumann's name
                 associated with the serial, stored-program, general
                 purpose, digital architecture upon which 99.99\% of all
                 computers today are based.",
  xxnote =       "Report prepared for U.S. Army Ordinance Department
                 under Contract W-670-ORD-4926. Reprinted in
                 \cite[pp.~177--246]{Stern:1981:EUA},
                 \cite[pp.~399--413]{Randell:1982:ODC},
                 \cite{vonNeumann:1993:FDR}, and
                 \cite{Laplante:1996:GPC}.",
}

@Book{vonOstermann:1952:MFL,
  author =       "Georg F. {von Ostermann}",
  title =        "Manual of Foreign Languages for the Use of Printers
                 and Translators",
  publisher =    pub-USGPO,
  address =      pub-USGPO:adr,
  edition =      "Fourth",
  pages =        "xii + 347",
  year =         "1952",
  LCCN =         "Z253 .V94 1952",
  bibdate =      "Fri Jul 22 11:26:32 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  xxISBN =       "none",
}

@Book{Voss:2012:PL,
  author =       "Herbert Vo{\ss}",
  title =        "Presentations with {\LaTeX}: which package, which
                 command, which syntax?",
  publisher =    "Lehmanns Media",
  address =      "Berlin, Germany",
  pages =        "vi + 205",
  year =         "2012",
  ISBN =         "3-86541-496-6",
  ISBN-13 =      "978-3-86541-496-0",
  LCCN =         "????",
  bibdate =      "Tue May 14 11:52:57 MDT 2013",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  series =       "Dante",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Introduction / 3 \\
                 1.1 Some history / 3 \\
                 1.2 Typography and layout / 9 \\
                 1.3 Text placement and colours / 10 \\
                 2: {\tt powerdot} / 15 \\
                 2.1 Document structure / 16 \\
                 2.2 Parameters / 20 \\
                 2.3 Slides / 23 \\
                 2.4 Overlays / 25 \\
                 2.5 Navigation / 31 \\
                 2.6 Two-column mode / 32 \\
                 2.7 Verbatim mode / 34 \\
                 2.8 Videos and animations / 36 \\
                 2.9 Available space / 37 \\
                 2.10 Style file / 38 \\
                 2.11 Background picture / 43 \\
                 2.12 Bibliography / 44 \\
                 2.13 Notes / 46 \\
                 2.14 Default layouts for {\tt powerdot} / 47 \\
                 3: Creating custom layouts with {\tt powerdot} / 53 \\
                 3.1 Definition of a custom document class / 53 \\
                 3.2 Definition of a custom style file / 57 \\
                 3.3 Custom navigation and square logo / 59 \\
                 3.4 Further examples / 62 \\
                 4: {\tt beamer} / 65 \\
                 4.1 Document structure / 66 \\
                 4.2 The structure of a presentation / 71 \\
                 4.3 Setting parameters / 73 \\
                 4.4 The title page / 76 \\
                 4.5 Multiple use of slides / 77 \\
                 4.6 Overlays / 78 \\
                 4.7 Environments from standard \LaTeX{} / 88 \\
                 4.8 Navigation elements / 90 \\
                 4.9 Animations, sound and films / 91 \\
                 4.10 Slide transitions / 93 \\
                 4.11 Text boxes / 95 \\
                 4.12 Inserting a logo / 98 \\
                 4.13 Navigation structure / 100 \\
                 4.14 Multi-column mode / 103 \\
                 4.15 Hyperlinks / 104 \\
                 4.16 Lists / 107 \\
                 4.17 Text styles / 109 \\
                 4.18 Verbatim mode / 110 \\
                 4.19 Including figures / 112 \\
                 4.20 Templates - the heart of {\tt beamer} / 114 \\
                 4.21 Commands to insert material / 124 \\
                 4.22 Notes / 125 \\
                 4.23 Bibliography / 130 \\
                 4.24 Using two screens / 132 \\
                 4.25 Output mode / 134 \\
                 4.26 Tips and tricks / 136 \\
                 4.27 Default layouts for {\tt beamer} / 139 \\
                 5: Creating custom layouts with {\tt beamer} / 157 \\
                 5.1 Defining a custom document class / 158 \\
                 5.2 Definition of a custom theme / 162 \\
                 5.3 Additional examples / 165 \\
                 6: Colours / 169 \\
                 6.1 Colour definition / 171 \\
                 6.2 Colour specification / 174 \\
                 6.3 Use of predefined colours --- named colours / 175
                 \\
                 6.4 The background colour and colours in boxes / 179
                 \\
                 6.5 Determining colour values / 180 \\
                 7: Questions and answers / 181 \\
                 7.1 {\tt beamer} / 181 \\
                 7.2 {\tt powerdot} / 182 \\
                 7.3 \LaTeX{} --- General / 182 \\
                 7.4 Output format / 184 \\
                 7.5 PSTricks / 188 \\
                 Bibliography / 191 \\
                 Index of commands and concepts / 193 \\
                 People / 206",
}

@Book{Vulis:1992:MTA,
  author =       "Michael Vulis",
  title =        "Modern {\TeX} and its Applications",
  publisher =    pub-CRC,
  address =      pub-CRC:adr,
  pages =        "vii + 294",
  year =         "1992",
  ISBN =         "0-8493-4431-X",
  ISBN-13 =      "978-0-8493-4431-2",
  LCCN =         "Z253.4.T47V84 1993",
  bibdate =      "Wed Dec 15 19:53:27 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  price =        "US\$32.95",
  abstract =     "An essential new guide for \TeX{} users \TeX{} is a
                 powerful typesetting language and processing
                 environment developed by Professor Donald Knuth at
                 Stanford University in the early 1980s. Its
                 machine-independence has made it a defacto standard for
                 text processing with microcomputers throughout the
                 scientific and engineering communities. While there
                 have been several \TeX{}-based macro packages developed
                 over the years, Modern \TeX{} and its Applications
                 focuses on the original macro package designed by Knuth
                 upon which all other \TeX{} programs are based-Plain
                 \TeX{}. All of the basic topics for understanding the
                 \TeX{} user environment are covered, including fonts
                 and characters, formatting, math mode, macros, terminal
                 and file operations, tables, and foreign language
                 capabilities. A PC-compatible disk containing examples,
                 extra typefaces and even a ready-to-run restricted
                 version of \TeX{} is included with the book. Modern
                 \TeX{} and its Applications is an essential guide for
                 all scientists, engineers, technicians, and support
                 staff who prepare technical text and documents using a
                 version of \TeX{}.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Introduction \\
                 2: Fonts and Characters \\
                 3: Formatting \\
                 4: Math Mode \\
                 5: Variables, Dimensions, Glue \\
                 6: Macros \\
                 7: Input/Output and Extensions \\
                 8: Modes, Rules, Boxes \\
                 9: Tabulation and Tables \\
                 10: Font Rotation \\
                 11: Appendix \\
                 12: Index",
}

@Book{Wadleigh:2000:SOH,
  author =       "Kevin R. Wadleigh and Isom L. Crawford",
  title =        "Software Optimization for High Performance Computing:
                 Creating Faster Applications",
  publisher =    pub-PHPTR,
  address =      pub-PHPTR:adr,
  pages =        "xxxi + 377",
  year =         "2000",
  ISBN =         "0-13-017008-9",
  ISBN-13 =      "978-0-13-017008-8",
  LCCN =         "QA76.76.D47 W34 2000",
  bibdate =      "Mon Jul 23 17:56:54 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$45.00",
  URL =          "http://vig.prenhall.com/catalog/academic/product/1,4096,0130170089,00.html",
  abstract =     "Aimed at programmers who want to get high-performance
                 from the software they write, this text provides a
                 hands-on book for high-performance code and algorithm
                 optimization.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Introduction \\
                 2: Processors: The Core of High Performance Computing
                 \\
                 3: Data Storage \\
                 4: An Overview of Parallel Processing \\
                 5: How the Compiler Can Help and Hinder Performance \\
                 6: Predicting and Measuring Performance \\
                 7: Is High Performance Computing Language Dependent?
                 \\
                 8: Parallel Processing \\
                 An Algorithmic Approach \\
                 9: High Performance Libraries \\
                 10: Mathematical Kernels: The Building Blocks of High
                 Performance \\
                 11: Faster Solutions for Systems of Equations \\
                 12: High Performance Algorithms and Approaches for
                 Signal Processing",
}

@Book{Waldrop:2001:DMJ,
  author =       "M. Mitchell Waldrop",
  title =        "The Dream Machine: {J. C. R. Licklider} and the
                 Revolution That Made Computing Personal",
  publisher =    pub-VIKING,
  address =      pub-VIKING:adr,
  pages =        "502",
  year =         "2001",
  ISBN =         "0-670-89976-3",
  ISBN-13 =      "978-0-670-89976-0",
  LCCN =         "QA76.17 .W35 2001",
  bibdate =      "Wed Dec 2 16:12:53 MST 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "The Sloan technology series",
  URL =          "http://www.loc.gov/catdir/toc/fy031/2001017985.html",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "Licklider, J. C. R; Microcomputers; History",
  tableofcontents = "Prologue: Tracy's Dad / 1 \\
                 1: Missouri Boys / 7 \\
                 2: The Last Transition / 24 \\
                 3: New Kinds of People / 66 \\
                 4: The Freedom to Make Mistakes / 99 \\
                 5: The Tale of the Fig Tree and the Wasp / 142 \\
                 6: The Phenomena Surrounding Computers / 196 \\
                 7: The Intergalactic Network / 259 \\
                 8: Living in the Future / 333 \\
                 9: Lick's Kids / 411",
}

@Book{Walker:2003:SES,
  author =       "Gabrielle Walker",
  title =        "{Snowball Earth}: the Story of the Great Global
                 Catastrophe That Spawned Life as We Know It",
  publisher =    "Crown Publishers",
  address =      "New York, NY, USA",
  pages =        "xiii + 269",
  year =         "2003",
  ISBN =         "0-609-60973-4 (hardcover), 1-4000-5125-8",
  ISBN-13 =      "978-0-609-60973-6 (hardcover), 978-1-4000-5125-0",
  LCCN =         "QE507 .W35 2003",
  bibdate =      "Sat Jun 9 16:56:29 MDT 2018",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Did the Earth once undergo a super ice age, one that
                 froze the entire planet from the poles to the equator?
                 In \booktitle{Snowball Earth}, gifted writer Gabrielle
                 Walker has crafted an intriguing global adventure
                 story, following maverick scientist Paul Hoffman's
                 quest to prove a theory so audacious and profound that
                 it is shaking the world of earth sciences to its core.
                 In lyrical prose that brings each remote and alluring
                 locale vividly to life, Walker takes us on a thrilling
                 natural history expedition to witness firsthand the
                 supporting evidence Hoffman has pieced together. That
                 evidence, he argues, shows that 700 million years ago
                 the Earth did indeed freeze over completely, becoming a
                 giant ``snowball'', in the worst climatic catastrophe
                 in history. Even more startling is his assertion that,
                 instead of ending life on Earth, this global deep
                 freeze was the trigger for the Cambrian Explosion, the
                 hitherto unexplained moment in geological time when a
                 glorious profusion of complex life forms first emerged
                 from the primordial ooze. In a story full of
                 intellectual intrigue, we follow the irascible but
                 brilliant Hoffman and a supporting cast of intrepid
                 geologists as they scour the planet, uncovering clue
                 after surprising clue. We travel to a primeval lagoon
                 at Shark Bay in western Australia, where dolphins
                 cavort with swimmers every morning at seven and
                 ``living rocks'' sprout out of the water like broccoli
                 heads; to the desolate and forbidding ice fields of a
                 tiny Arctic archipelago seven hundred miles north of
                 Norway; to the surprising fossil beds that decorate
                 Newfoundland's foggy and windswept coastline; and on to
                 the superheated salt pans of California's Death Valley.
                 Through the contours of these rich and varied
                 landscapes Walker teaches us to read the traces of
                 geological time with expert eyes, and we marvel at the
                 stunning feats of resilience and renewal our remarkable
                 planet is capable of. \booktitle{Snowball Earth} is
                 science writing at its most gripping and
                 enlightening.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Snowball Earth (Geology); Paleoclimatology;
                 Proterozoic; Life; Origin; Origin; Paleoclimatology;
                 Proterozoic Geologic Period; Snowball Earth (Geology)",
  tableofcontents = "1: First Fumblings \\
                 2: The Sheltering Desert \\
                 3: In the Beginning \\
                 4: Magnetic Moments \\
                 5: Eureka \\
                 6: On the Road \\
                 7: Down Under \\
                 8: Snowbrawls \\
                 9: Creation \\
                 10: Ever Again \\
                 Epilogue \\
                 Notes and Suggestions for Further Reading \\
                 Index",
}

@Misc{Wall:perl,
  author =       "Larry Wall",
  title =        "perl: Practical Extraction and Report Language",
  howpublished = "Usenet \path|mod.sources| archives",
  year =         "1987",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Electronic mail:
                 \path|lwall@jpl-devvax.jpl.nasa.gov|.",
  acknowledgement = ack-nhfb,
}

@Book{Wallis:1982:PP,
  author =       "Peter J. L. Wallis",
  title =        "Portable Programming",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xiv + 141",
  year =         "1982",
  ISBN =         "0-470-27331-3",
  ISBN-13 =      "978-0-470-27331-9",
  LCCN =         "QA76.6.W329 1982",
  bibdate =      "Wed Dec 15 10:58:59 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Walsh:1975:MO,
  author =       "G. R. Walsh",
  title =        "Methods of Optimization",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "x + 200",
  year =         "1975",
  ISBN =         "0-471-91922-5 (hardcover), 0-471-91924-1 (paperback)",
  ISBN-13 =      "978-0-471-91922-3 (hardcover), 978-0-471-91924-7
                 (paperback)",
  LCCN =         "QA402.5 .W341",
  bibdate =      "Wed Dec 15 10:59:00 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "1: Introduction \\
                 2: Nonlinear programming \\
                 3: Search methods for unconstrainned optimization \\
                 4: Gradient methods for unconstrained optimization \\
                 5: Constrained optimization \\
                 6: Dynamic programming",
  tableofcontents = "1 Introduction / 1 \\
                 1.1 What is optimization? / 1 \\
                 1.2 Statement of the problem / 3 \\
                 1.3 Classical optimization / 6 \\
                 1.4 Classical treatment of inequality constraints / 16
                 \\
                 1.5 The Lagrangian function and duality / 20 \\
                 1.6 Convex and concave functions / 22 \\
                 Summary / 31 \\
                 Exercises / 31 \\
                 2 Nonlinear Programming / 35 \\
                 21 Introduction / 35 \\
                 2.2 Kuhn--Tucker necessary conditions / 35 \\
                 2.3 Saddle-point property of the Lagrangian function /
                 39 \\
                 2.4 The constraint qualification / 44 \\
                 2.5 Quadratic programming: Wolfe's algorithm / 51 \\
                 2.6 Further discussion of Wolfe's algorithm / 58 \\
                 2.7 Quadratic programming and duality / 60 \\
                 2.8 Griffith and Stewart's method / 64 \\
                 Summary / 70 \\
                 Exercises / 71 \\
                 3 Search Methods for Unconstrained Optimization / 74
                 \\
                 3.1 Introduction / 74 \\
                 3.2 Grid search / 75 \\
                 3.3 Hooke and Jeeves' method / 76 \\
                 3.4 Spendley, Hext and Himsworth's method / 79 \\
                 3.5 Nelder and Mead's method / 81 \\
                 3.6 Fibonacci search / 84 \\
                 3.7 Golden Section search / 91 \\
                 3.8 Powell's quadratic interpolation method / 93 \\
                 3.9 Davidon's cubic interpolation method / 97 \\
                 Summary / 102 \\
                 Exercises / 102 \\
                 4 Gradient Methods for Unconstrained Optimization / 105
                 \\
                 4.1 Introduction / 105 \\
                 4.2 Method of steepest descent / 106 \\
                 4.3 The Newton--Raphson method / 108 \\
                 4.4 The Davidon--Fletcher--Powell method / 110 \\
                 4.5 The complementary DFP formula / 117 \\
                 4.6 Conjugate directions / 120 \\
                 4.7 The Fletcher--Reeves method / 123 \\
                 4.8 Smith's method / 126 \\
                 4.9 Powell's method / 129 \\
                 4.10 Choice of method / 138 \\
                 Summary / 140 \\
                 Exercises / 140 \\
                 5 Constrained Optimization / 143 \\
                 5.1 Introduction / 143 \\
                 5.2 Hemstitching / 144 \\
                 5.3 The gradient projection method / 146 \\
                 5.4 Penalty functions / 148 \\
                 5.5 Sequential unconstrained minimization technique
                 (SUMT) / 150 \\
                 5.6 The DFP method with linear constraints / 155 \\
                 Summary / 160 \\
                 Exercises / 161 \\
                 6 Dynamic Programming / 164 \\
                 6.1 Introduction / 164 \\
                 6.2 The allocation problem / 165 \\
                 6.3 Oriented networks / 170 \\
                 6.4 Non-oriented networks / 173 \\
                 6.5 The farmer's problem / 177 \\
                 6.6 Scheduling problems / 181 \\
                 Summary / 184 \\
                 Exercises / 185 \\
                 References / 188 \\
                 Suggestions for Further Reading / 192 \\
                 Answers to Exercises / 193 \\
                 Index 197",
}

@Book{Walsh:1994:MTW,
  author =       "Norman Walsh",
  title =        "Making {\TeX} Work",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xxxvi + 483",
  year =         "1994",
  ISBN =         "1-56592-051-1",
  ISBN-13 =      "978-1-56592-051-4",
  LCCN =         "TK5105.875.I57 M36 1994; Z253.4.T47 W34 1994",
  bibdate =      "Thu May 12 08:24:59 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/css.bib;
                 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/texbook3.bib",
  note =         "Written specifically for database maintainers and
                 system administrators, this Unix-based technical guide
                 covers installing, setting up, and running Internet
                 applications such as gopher holes, FTP and telnet
                 sites, mailing lists, WAIS, and World Wide Web pages,
                 and other sites, as well as keeping them secure.",
  price =        "US\$29.95",
  URL =          "ftp://ftp.ora.com/pub/products/catalogs/book.catalog;
                 http://www.oreilly.com/catalog/9781565920514",
  abstract =     "TeX is a powerful tool for creating professional
                 quality typeset text and is unsurpassed at typesetting
                 mathematical equations, scientific text, and multiple
                 languages. Many books describe how you use TeX to
                 construct sentences, paragraphs, and chapters. Until
                 now, no book has described all the software that
                 actually lets you build, run, and use TeX to best
                 advantage on your platform. Because creating a TeX
                 document requires the use of many tools, this lack of
                 information is a serious problem for TeX users. TeX is
                 increasing in popularity, and the need for information
                 is becoming more critical. Many technical journals now
                 request that articles be submitted in TeX. TeX is also
                 playing an increasing role in the Standard Generalized
                 Markup Language (SGML) environment. TeX's portability
                 and flexibility -- not to mention the fact that it is
                 free -- are also making it the typesetting tool of
                 choice for interchange between hardware and software
                 platforms and for international exchange. Yet, despite
                 this growing interest in TeX, TeX users everywhere are
                 having to ``reinvent the wheel'' by wrestling with
                 TeX's many tools and files on their own. Making TeX
                 Workguides you through the maze of tools available in
                 the overall TeX system. Beyond the core TeX program
                 there are myriad drivers, macro packages, previewers,
                 printing programs, online documentation facilities,
                 graphics programs, and more. This book describes them
                 all. It covers:How to assemble the software you need to
                 build and install TeX on all common platforms: UNIX,
                 DOS, Macintosh, and VMS. How to get TeX and its
                 associated tools from public domain and commercial
                 sources (a complete buyer's guide). How to select and
                 use the tools that let you incorporate graphics into
                 your documents and create bibliographies, indices, and
                 other complex document elements. How to install and use
                 fonts to best advantage, including PostScript and
                 TrueType fonts and LaTeX's New Font Selection Scheme
                 (NFSS).",
  acknowledgement = ack-nhfb,
  keywords =     "Computer Communication Networks., internet (computer
                 network); Computer networks --- Management; computer
                 networks --- management; Internet (Computer network)",
  tableofcontents = "Gopher World Wide Web \\
                 Internet service concepts \\
                 Introduction to information services \\
                 Finger-, Inetd-, and Telnet-based services \\
                 Setting up an FTP archive \\
                 The WU archive FTP daemon \\
                 Maintaining an FTP archive \\
                 Creating an Internet database server with WAIS \\
                 Creating WAIS sources with waisindex \\
                 Gopher: introduction \\
                 Gopher: compiling the server \\
                 Gopher: managing the server \\
                 Gopher: preparing information \\
                 Gopher: linking services together \\
                 Gopher: incorporating databases \\
                 Gopher: Veronica and Jughead \\
                 Gopher+ forms and other new features \\
                 Introduction to the world wide web \\
                 Setting up a web server \\
                 Authoring for the web \\
                 Web: gateways and forms \\
                 Web: access control and security \\
                 Introduction to email services \\
                 Simple mailing lists \\
                 Automating mailing lists with majordomo \\
                 The majordomo list owner and moderator \\
                 Ftpmail \\
                 Firewalls and information services \\
                 Xinetd \\
                 Legal issues \\
                 Protecting intellectual property",
}

@Book{Walsh:1999:DDG,
  author =       "Norman Walsh and Leonard Muellner",
  title =        "{DocBook}: The Definitive Guide",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xii + 635",
  year =         "1999",
  ISBN =         "1-56592-580-7",
  ISBN-13 =      "978-1-56592-580-9",
  LCCN =         "QA76.76.H94 W35 1999",
  bibdate =      "Sat Oct 21 12:42:55 2000",
  bibsource =    "http://www.oreilly.com/catalog/;
                 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/sgml.bib",
  note =         "Includes CD-ROM.",
  price =        "US\$36.95",
  URL =          "http://www.oreilly.com/catalog/9781565925809;
                 http://www.oreilly.com/catalog/docbook",
  acknowledgement = ack-nhfb,
  keywords =     "SGML; XML",
  subject =      "SGML (Document markup language); XML (Document markup
                 language)",
}

@Book{Ward:1985:APT,
  author =       "Terry A. Ward",
  title =        "Applied Programming Techniques in {C}",
  publisher =    pub-SCOTT-FORESMAN,
  address =      pub-SCOTT-FORESMAN:adr,
  pages =        "xii + 349",
  year =         "1985",
  ISBN =         "0-673-18050-6",
  ISBN-13 =      "978-0-673-18050-6",
  LCCN =         "QA76.73.C15 W37 1985",
  bibdate =      "Wed Dec 15 10:59:01 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$19.95",
  acknowledgement = ack-nhfb,
}

@Book{Ward:2000:REW,
  author =       "Peter D. (Peter Douglas) Ward and Donald Brownlee",
  title =        "Rare earth: why complex life is uncommon in the
                 universe",
  publisher =    "Copernicus",
  address =      "New York, NY, USA",
  pages =        "xxxii + 335",
  year =         "2000",
  ISBN =         "0-387-95289-6 (paperback), 0-387-21848-3 (e-book)",
  ISBN-13 =      "978-0-387-95289-5 (paperback)",
  LCCN =         "QB54 .W336 2000",
  bibdate =      "Thu Mar 19 15:11:42 MDT 2015",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0817/2003043437-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0817/2003043437-t.html",
  acknowledgement = ack-nhfb,
  author-dates = "1949--",
  tableofcontents = "Cover \\
                 Table of Contents \\
                 Preface to the Paperback Edition \\
                 Preface to the First Edition \\
                 Introduction: The Astrobiology Revolution and the Rare
                 Earth Hypothesis \\
                 Dead Zones of the Universe \\
                 Rare Earth Factors \\
                 1: Why Life Might Be Widespread in the Universe \\
                 2: Habitable Zones of the Universe \\
                 3: Building a Habitable Earth \\
                 4: Life's First Appearance on Earth \\
                 5: How to Build Animals \\
                 6: Snowball Earth \\
                 7: The Enigma of the Cambrian Explosion \\
                 8: Mass Extinctions and the Rare Earth Hypothesis \\
                 9: The Surprising Importance of Plate Tectonics \\
                 10: The Moon, Jupiter, and Life on Earth \\
                 11: Testing the Rare Earth Hypotheses \\
                 12: Assessing the Odds \\
                 13: Messengers from the Stars \\
                 References \\
                 Index",
}

@Book{Ward:2008:UGS,
  author =       "Peter D. (Peter Douglas) Ward",
  title =        "Under a green sky: global warming, the mass
                 extinctions of the past, and what they can tell us
                 about our future",
  publisher =    "Smithsonian Books/Collins",
  address =      "New York, NY, USA",
  pages =        "xiv + 242",
  year =         "2008",
  ISBN =         "0-06-113792-8 (paperback)",
  ISBN-13 =      "978-0-06-113792-1",
  LCCN =         "QE721.2.E97 W384 2008",
  bibdate =      "Fri May 1 19:02:32 MDT 2015",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "More than 200 million years ago, a cataclysm known as
                 the Permian extinction destroyed nearly 97 percent of
                 all living things. Its origins have long been a puzzle.
                 Paleontologist Ward, fresh from helping prove that an
                 asteroid had killed the dinosaurs, turned to the
                 Permian problem, and he has come to a stunning
                 conclusion: that the near-total devastation at the end
                 of the Permian period was caused by rising levels of
                 carbon dioxide leading to climate change. The story of
                 the discovery makes for a globe-spanning adventure.
                 Here, Ward explains how the Permian extinction as well
                 as four others happened, and describes the freakish
                 oceans --- belching poisonous gas --- and sky ---
                 slightly green and always hazy --- that would have
                 attended them. Those ancient upheavals demonstrate that
                 the threat of climate change cannot be ignored, lest
                 the world's life today --- ourselves included --- face
                 the same dire fate.",
  acknowledgement = ack-nhfb,
  author-dates = "1949--",
  libnote =      "Not yet in my library.",
  subject =      "Extinction (Biology); Paleoclimatology; Global
                 warming; Extinct animals; Climate; Environmental
                 aspects; Extinction (Biology); Global warming;
                 Paleoclimatology.",
  tableofcontents = "Introduction: Going to Nevada \\
                 Welcome to the revolution! \\
                 The overlooked extinction \\
                 The mother of all extinctions \\
                 The misinterpreted extinction \\
                 A new paradigm for mass extinction \\
                 The driver of extinction \\
                 Bridging the deep and near past \\
                 The oncoming extinction of winter \\
                 Back to the Eocene \\
                 The new old world",
}

@Book{Warren:2003:HD,
  author =       "Henry S. Warren",
  title =        "Hacker's delight",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xiv + 306",
  year =         "2003",
  ISBN =         "0-201-91465-4",
  ISBN-13 =      "978-0-201-91465-8",
  LCCN =         "QA76.6 .W375 2003",
  bibdate =      "Tue Jan 03 18:20:34 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  note =         "While this book does not specifically address
                 computational aspects of floating-point arithmetic
                 (apart from the nine-page Chapter 15), it has extensive
                 coverage of, and clever algorithms for, integer
                 arithmetic operations that are fundamental for
                 implementing hardware floating-arithmetic and software
                 multiple-precision arithmetic.",
  URL =          "http://www.awprofessional.com/bookstore/product.asp?isbn=0201914654;
                 http://www.hackersdelight.org/;
                 http://www.hackersdelight.org/hackerTOC.pdf;
                 http://www.informit.com/content/images/chap3_0201914654/elementLinks/0201914654.pdf",
  acknowledgement = ack-nhfb,
  keywords =     "DEC PDP-10; division by constants; Gray code; Hilbert
                 curves; IEEE 754 floating-point arithmetic; integer
                 cube root; integer division; integer exponentiation;
                 integer logarithm; integer square root; prime numbers;
                 unusual number bases",
  remark =       "Foreword by Guy L. Steele, Jr., who begins ``When I
                 first got a summer job at MIT's Project MAC almost 30
                 years ago, I was delighted to be able to work with the
                 DEC PDP-10 computer, which was more fun to program in
                 assembly language than any other computer, bar none,
                 because of its rich yet tractable set of instructions
                 for performing bit tests, bit masking, field
                 manipulation, and operations on integers. Though the
                 PDP-10 has not been manufactured for quite some years,
                 there remains a thriving cult of enthusiasts who keep
                 old PDP-10 hardware running and who run old PDP-10
                 software---entire operating systems and their
                 applications---by using personal computers to simulate
                 the PDP-10 instruction set.''",
  subject =      "Computer programming; Computer hackers",
  tableofcontents = "Preface\par

                 1. Introduction\par

                 Notation\par

                 Instruction Set and Execution Time Model\par

                 2. Basis\par

                 Manipulating Rightmost Bits \\
                 Addition Combined with Logical Operations \\
                 Inequalities among Logical and Arithmetic Expressions
                 \\
                 Absolute Value Function \\
                 Sign Extension \\
                 Shift Right Signed from Unsigned \\
                 Sign Function \\
                 Three-Valued Compare \\
                 Transfer of Sign \\
                 Decoding a `Zero Means 2**n' Field \\
                 Comparison Predicates \\
                 Overflow Detection \\
                 Condition Code Result of Add, Subtract, and Multiply
                 \\
                 Rotate Shifts \\
                 Double-Length Add/Subtract \\
                 Double-Length Shifts \\
                 Multibyte Add, Subtract, Absolute Value \\
                 Doz, Max, Min \\
                 Exchanging Registers \\
                 Alternating among Two or More Values\par

                 3. Power-of-2 Boundaries\par

                 Rounding Up/Down to a Multiple of a Known Power of 2
                 \\
                 Rounding Up/Down to the Next Power of 2 \\
                 Detecting a Power-of-2 Boundary Crossing\par

                 4. Arithmetic Bounds\par

                 Checking Bounds of Integers \\
                 Propagating Bounds through Adds and Subtracts \\
                 Propagating Bounds through Logical Operations \\
                 Signed Bounds\par

                 5. Counting Bits\par

                 Counting 1-bits \\
                 Parity \\
                 Counting Leading 0's \\
                 Counting Trailing 0's\par

                 6. Searching Words\par

                 Find First 0-Byte \\
                 Find First String of 1-Bits of a Given Length\par

                 7. Rearranging Bits and Bytes\par

                 Reversing Bits and Bytes \\
                 Shuffling Bits \\
                 Transposing a Bit Matrix \\
                 Compress, or Generalized Extract \\
                 General Permutations, Sheep and Goats Operation \\
                 Rearrangements and Index Transformations\par

                 8. Multiplication\par

                 Multiword Multiplication \\
                 High-Order Half of 64-Bit Product \\
                 High-Order Product Signed from/to Unsigned \\
                 Multiplication by Constants\par

                 9. Integer Division\par

                 Preliminaries \\
                 Multiword Division \\
                 Unsigned Short Division from Signed Division \\
                 Unsigned Long Division\par

                 10. Integer Division by Constants\par

                 Signed Division by a Known Power of 2 \\
                 Signed Remainder from Division by a Known Power of 2
                 \\
                 Signed Division and Remainder by Non-powers of 2 \\
                 Signed Division by Divisors >= 2 \\
                 Signed Division by Divisors <= -2 \\
                 Incorporation into a Compiler \\
                 Miscellaneous Topics \\
                 Unsigned Division \\
                 Unsigned Division by Divisors >= 1 \\
                 Incorporation into a Compiler (Unsigned) \\
                 Miscellaneous Topics (Unsigned) \\
                 Applicability to Modulus and Floor Division \\
                 Similar Methods \\
                 Sample Magic Numbers \\
                 Exact Division by Constants \\
                 Test for Zero Remainder after Division by a
                 Constant\par

                 11. Some Elementary Functions\par

                 Integer Square Root \\
                 Integer Cube Root \\
                 Integer Exponentiation \\
                 Integer Logarithm\par

                 12. Unusual Bases for Number Systems\par

                 Base -2 \\
                 Base -1 + i \\
                 Other Bases \\
                 What is the Most Efficient Base?\par

                 13. Gray Code \\
                 Gray Code \\
                 Incrementing a Gray Coded Integer \\
                 Negabinary Gray Code \\
                 Brief History and Applications\par

                 14. Hilbert's Curve\par

                 A Recursive Algorithm for Generating the Hilbert Curve
                 \\
                 Coordinates from Distance along the Hilbert Curve \\
                 Distance from Coordinates on the Hilbert Curve \\
                 Incrementing the Coordinates on the Hilbert Curve \\
                 Non-recursive Generating Algorithms \\
                 Other Space-Filling Curves \\
                 Applications\par

                 15. Floating-Point\par

                 IEEE Format \\
                 Comparing Floating-Point Numbers Using Integer
                 Operations \\
                 The Distribution of Leading Digits \\
                 Table of Miscellaneous Values\par

                 16. Formulas for Primes\par

                 Introduction \\
                 Willans's Formulas \\
                 Wormell's Formula \\
                 Formulas for Other Difficult Functions\par

                 Appendix A. Arithmetic Tables for a 4-Bit
                 Machine\par

                 Appendix B. Newton's Method\par

                 Bibliography.",
}

@Book{Warren:2013:HD,
  author =       "Henry S. Warren",
  title =        "Hacker's Delight",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Second",
  pages =        "xvi + 494",
  year =         "2013",
  ISBN =         "0-321-84268-5 (hardcover)",
  ISBN-13 =      "978-0-321-84268-8 (hardcover)",
  LCCN =         "QA76.6 .W375 2013",
  bibdate =      "Mon Sep 23 11:53:48 MDT 2013",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/mathcw.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.pearsonhighered.com/educator/product/Hackers-Delight/9780321842688.page",
  acknowledgement = ack-nhfb,
  subject =      "Computer programming",
  tableofcontents = "Foreword / xiii \\
                 Preface / xv \\
                 Chapter 1: Introduction / 1 \\
                 1-1 Notation / 1 \\
                 1-2 Instruction Set and Execution Time Model / 5 \\
                 Chapter 2: Basics / 11 \\
                 2-1 Manipulating Rightmost Bits / 11 \\
                 2-2 Addition Combined with Logical Operations / 16 \\
                 2-3 Inequalities among Logical and Arithmetic
                 Expressions / 17 \\
                 2-4 Absolute Value Function / 18 \\
                 2-5 Average of Two Integers / 19 \\
                 2-6 Sign Extension / 19 \\
                 2-7 Shift Right Signed from Unsigned / 20 \\
                 2-8 Sign Function / 20 \\
                 2-9 Three-Valued Compare Function / 21 \\
                 2-10 Transfer of Sign Function / 22 \\
                 2-11 Decoding a Zero Means 2**n Field / 22 \\
                 2-12 Comparison Predicates / 23 \\
                 2-13 Overflow Detection / 28 \\
                 2-14 Condition Code Result of Add, Subtract, and
                 Multiply / 36 \\
                 2-15 Rotate Shifts / 37 \\
                 2-16 Double-Length Add/Subtract / 38 \\
                 2-17 Double-Length Shifts / 39 \\
                 2-18 Multibyte Add, Subtract, AbsoluteValue / 40 \\
                 2-19 Doz, Max, Min / 41 \\
                 2-20 Exchanging Registers / 45 \\
                 2-21 Alternating among Two or More Values / 48 \\
                 2-22 A Boolean Decomposition Formula / 51 \\
                 2-23 Implementing Instructions for all 16 Binary
                 Boolean Operations / 53 \\
                 Chapter 3: Power-of-2 Boundaries / 59 \\
                 3-1 Rounding Up/Down to a Multiple of a Known Power of
                 2 / 59 \\
                 3-2 Rounding Up/Down to the Next Power of 2 / 60 \\
                 3-3 Detecting a Power-of-2 Boundary Crossing / 63 \\
                 Chapter 4: Arithmetic Bounds / 67 \\
                 4-1 Checking Bounds of Integers / 67 \\
                 4-2 Propagating Bounds through Adds and Subtracts / 70
                 \\
                 4-3 Propagating Bounds through Logical Operations / 73
                 \\
                 Chapter 5: Counting Bits / 81 \\
                 5-1 Counting 1-Bits / 81 \\
                 5-2 Parity / 96 \\
                 5-3 Counting Leading 0's / 99 \\
                 5-4 Counting Trailing 0's / 107 \\
                 Chapter 6: Searching Words / 117 \\
                 6-1 Find First 0-Byte / 117 \\
                 6-2 Find First String of 1-Bits of a Given Length / 123
                 \\
                 6-3 Find Longest String of 1-Bits / 125 \\
                 6-4 Find Shortest String of 1-Bits / 126 \\
                 Chapter 7: Rearranging Bits And Bytes / 129 \\
                 7-1 Reversing Bits and Bytes / 129 \\
                 7-2 Shuffling Bits / 139 \\
                 7-3 Transposing a Bit Matrix / 141 \\
                 7-4 Compress, or GeneralizedExtract / 150 \\
                 7-5 Expand, or GeneralizedInsert / 156 \\
                 7-6 Hardware Algorithms for Compress and Expand / 157
                 \\
                 7-7 General Permutations, Sheep and Goats Operation /
                 161 \\
                 7-8 Rearrangements and Index Transformations / 165 \\
                 7-9 An LRU Algorithm / 166 \\
                 Chapter 8: Multiplication / 171 \\
                 8-1 Multiword Multiplication / 171 \\
                 8-2 High-Order Half of 64-Bit Product / 173 \\
                 8-3 High-Order Product Signed from/to Unsigned / 174
                 \\
                 8-4 Multiplication by Constants / 175 \\
                 Chapter 9: Integer Division / 181 \\
                 9-1 Preliminaries / 181 \\
                 9-2 Multiword Division / 184 \\
                 9-3 Unsigned Short Division from Signed Division / 189
                 \\
                 9-4 Unsigned Long Division / 192 \\
                 9-5 Doubleword Division from Long Division / 197 \\
                 Chapter 10: Integer Division by Constants / 205 \\
                 10-1 Signed Division by a Known Power of 2 / 205 \\
                 10-2 Signed Remainder from Division by a Known Power of
                 2 / 206 \\
                 10-3 Signed Division and Remainder by Non-Powers of 2 /
                 207 \\
                 10-4 Signed Division by Divisors 2 / 210 \\
                 10-5 Signed Division by Divisors 2 / 218 \\
                 10-6 Incorporation into a Compiler / 220 \\
                 10-7 Miscellaneous Topics / 223 \\
                 10-8 Unsigned Division / 227 \\
                 10-9 Unsigned Division by Divisors 1 / 230 \\
                 10-10 Incorporation into a Compiler (Unsigned) / 232
                 \\
                 10-11 Miscellaneous Topics (Unsigned) / 234 \\
                 10-12 Applicability to Modulus and Floor Division / 237
                 \\
                 10-13 Similar Methods / 237 \\
                 10-14 Sample Magic Numbers / 238 \\
                 10-15 Simple Code in Python / 240 \\
                 10-16 Exact Division by Constants / 240 \\
                 10-17 Test for Zero Remainder after Division by a
                 Constant / 248 \\
                 10-18 Methods Not Using Multiply High / 251 \\
                 10-19 Remainder by Summing Digits / 262 \\
                 10-20 Remainder by Multiplication and Shifting Right /
                 268 \\
                 10-21 Converting to Exact Division / 274 \\
                 10-22 A Timing Test / 276 \\
                 10-23 A Circuit for Dividing by 3 / 276 \\
                 Chapter 11: Some Elementary Functions / 279 \\
                 11-1 Integer Square Root / 279 \\
                 11-2 Integer Cube Root / 287 \\
                 11-3 Integer Exponentiation / 288 \\
                 11-4 Integer Logarithm / 291 \\
                 Chapter 12: Unusual Bases For Number Systems / 299 \\
                 12-1 Base 2 / 299 \\
                 12-2 Base 1 + i / 306 \\
                 12-3 Other Bases / 308 \\
                 12-4 What Is the Most Efficient Base? / 309 \\
                 Chapter 13: Gray Code / 311 \\
                 13-1 Gray Code / 311 \\
                 13-2 Incrementing a Gray-Coded Integer / 313 \\
                 13-3 Negabinary Gray Code / 315 \\
                 13-4 Brief History and Applications / 315 \\
                 Chapter 14: Cyclic Redundancy Check / 319 \\
                 14-1 Introduction / 319 \\
                 14-2 Theory / 320 \\
                 14-3 Practice / 323 \\
                 Chapter 15: Error-Correcting Codes / 331 \\
                 15-1 Introduction / 331 \\
                 15-2 The Hamming Code / 332 \\
                 15-3 Software for SEC-DED on 32 Information Bits / 337
                 \\
                 15-4 Error Correction Considered More Generally / 342
                 \\
                 Chapter 16: Hilbert's Curve / 355 \\
                 16-1 A Recursive Algorithm for Generating the Hilbert
                 Curve / 356 \\
                 16-2 Coordinates from Distance along the Hilbert Curve
                 / 358 \\
                 16-3 Distance from Coordinates on the Hilbert Curve /
                 366 \\
                 16-4 Incrementing the Coordinates on the Hilbert Curve
                 / 368 \\
                 16-5 Non-Recursive Generating Algorithms / 371 \\
                 16-6 Other Space-Filling Curves / 371 \\
                 16-7 Applications / 372 \\
                 Chapter 17: Floating-Point / 375 \\
                 17-1 IEEE Format / 375 \\
                 17-2 Floating-Point To/From Integer Conversions / 377
                 \\
                 17-3 Comparing Floating-Point Numbers Using Integer
                 Operations / 381 \\
                 17-4 An Approximate Reciprocal Square Root Routine /
                 383 \\
                 17-5 The Distribution of Leading Digits / 385 \\
                 17-6 Table of Miscellaneous Values / 387 \\
                 Chapter 18: Formulas for Primes / 391 \\
                 18-1 Introduction / 391 \\
                 18-2 Willans's Formulas / 393 \\
                 18-3 Wormell's Formula / 397 \\
                 18-4 Formulas for Other Difficult Functions / 398 \\
                 Answers to Exercises: / 405 \\
                 Appendix A: Arithmetic Tables for a 4-Bit Machine / 453
                 \\
                 Appendix B: Newton's Method / 457 \\
                 Appendix C: A Gallery of Graphs of Discrete Functions /
                 459 \\
                 C-1 Plots of Logical Operations on Integers / 459 \\
                 C-2 Plots of Addition, Subtraction, and Multiplication
                 / 461 \\
                 C-3 Plots of Functions Involving Division / 463 \\
                 C-4 Plots of the Compress, SAG, and Rotate Left
                 Functions / 464 \\
                 C-5 2D Plots of Some Unary Functions / 466 \\
                 Bibliography / 471 \\
                 Index / 481",
}

@Book{Warwick:2004:HEB,
  author =       "Andrew Warwick and Jed Z. Buchwald",
  title =        "Histories of the Electron: The Birth of Microphysics",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "xi + 513",
  year =         "2001",
  ISBN =         "0-262-02494-2 (hardcover), 0-262-52424-4 (paperback)",
  ISBN-13 =      "978-0-262-02494-5 (hardcover), 978-0-262-52424-7
                 (paperback)",
  LCCN =         "QC793.5.E62 H57 2004",
  bibdate =      "Mon Feb 12 08:14:32 MST 2018",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Dibner Institute studies in the history of science and
                 technology",
  URL =          "https://mitpress.mit.edu/books/histories-electron;
                 https://www.scribd.com/document/216554790/Histories-of-the-Electron-The-Birth-of-Microphysics",
  abstract =     "In the mid to late 1890s, J. J. Thomson and colleagues
                 at Cambridge's Cavendish Laboratory conducted
                 experiments on ``cathode rays'' (a form of radiation
                 produced within evacuated glass vessels subjected to
                 electric fields) --- the results of which some
                 historians later viewed as the ``discovery'' of the
                 electron. This book is both a biography of the electron
                 and a history of the microphysical world that it opened
                 up. The book is organized in four parts. The first
                 part, \booktitle{Corpuscles and Electrons}, considers
                 the varying accounts of Thomson's role in the
                 experimental production of the electron. The second
                 part, \booktitle{What Was the Newborn Electron Good
                 For?}, examines how scientists used the new entity in
                 physical and chemical investigations. The third part,
                 \booktitle{Electrons Applied and Appropriated},
                 explores the accommodation, or lack thereof, of the
                 electron in nuclear physics, chemistry, and electrical
                 science. It follows the electron's gradual progress
                 from cathode ray to ubiquitous subatomic particle and
                 eponymous entity in one of the world's most successful
                 industries --- electronics. The fourth part,
                 \booktitle{Philosophical Electrons}, considers the role
                 of the electron in issues of instrumentalism,
                 epistemology, and realism. The electron, it turns out,
                 can tell us a great deal about how science works.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Science; History",
  tableofcontents = "Introduction / Jed Z. Buchwald and Andrew Warwick
                 \\
                 I: Corpuscles and Electrons \\
                 1 J. J. Thomson and the Electron, 1897--1899 / George
                 E. Smith \\
                 2 Corpuscles to Electrons / Isobel Falconer \\
                 3 The Questionable Matter of Electricity: the Reception
                 of J. J. Thomson's ``Corpuscle'' Among Electrical
                 Theorists and Technologists / Graeme Gooday \\
                 4 Paul Villard, J. J. Thomson, and the Composition of
                 Cathode Rays / Benoit Lelong \\
                 II: What Was the Newborn Electron Good For? \\
                 5 The Zeeman Effect and the Discovery of the Electron /
                 Theodore Arabatzis \\
                 6 The Electron, the Protyle, and the Unity of Matter /
                 Helge Kragh \\
                 7 0. W. Richardson and the Electron Theory of Matter,
                 1901--1916 / Ole Knudsen \\
                 8 Electron Gas Theory of Metals: Free Electrons in Bulk
                 Matter / Walter Kaiser \\
                 III: Electrons Applied and Appropriated \\
                 9 The Electron and the Nucleus / Laurie M. Brown \\
                 10 The Electron, the Hole, and the Transistor / Lillian
                 Hoddeson and Michael Riordan \\
                 11 Remodeling A Classic: the Electron in Organic
                 Chemistry, 1900--1940 / Mary Jo Nye \\
                 12 The Physicists' Electron and Its Appropriation by
                 the Chemists / Kostas Gavroglu \\
                 IV: Philosophical Electrons \\
                 13 Who Really Discovered the Electron? / Peter
                 Achinstein \\
                 14 History and Metaphysics: On the Reality of Spin /
                 Margaret Morrison \\
                 15 What Should Philosophers of Science Learn From The
                 History of the Electron? / Jonathan Bain and John D.
                 Norton \\
                 16 The Role of Theory in the Use of Instruments; or,
                 How Much Do We Need to Know About Electrons. To Do
                 Science With an Electron Microscope? / Nicolas
                 Rasmussen and Alan Chalmers",
}

@Book{Watkins:2007:MEP,
  author =       "David S. Watkins",
  title =        "The Matrix Eigenvalue Problem: {GR} and {Krylov}
                 Subspace Methods",
  volume =       "101",
  publisher =    pub-SIAM,
  address =      pub-SIAM:adr,
  pages =        "x + 442",
  year =         "2007",
  ISBN =         "0-89871-641-1",
  ISBN-13 =      "978-0-89871-641-2",
  LCCN =         "QA193 .W38 2007",
  bibdate =      "Thu Nov 15 14:26:45 MST 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/numana2000.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Other titles in applied mathematics",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "Eigenvalues; Invariant subspaces; Matrices",
  tableofcontents = "Preface \\
                 1. Preliminary material \\
                 2. Basic theory of Eigensystems \\
                 3. Elimination \\
                 4. Iteration \\
                 5. Convergence \\
                 6. The generalized Eigenvalue problem \\
                 7. Inside the bulge \\
                 8. Product Eigenvalue problems \\
                 9. Krylov subspace methods \\
                 Bibliography \\
                 Index",
}

@Book{Watson:1990:FSC,
  author =       "Thomas J. {Watson Jr.}",
  title =        "Father Son \& Co.: My Life at {IBM} and Beyond",
  publisher =    pub-BANTAM,
  address =      pub-BANTAM:adr,
  pages =        "xi + 468 + 32",
  year =         "1990",
  ISBN =         "0-553-07011-8",
  ISBN-13 =      "978-0-553-07011-8",
  LCCN =         "HD9696.C64 I4887 1990",
  bibdate =      "Wed Dec 15 10:59:01 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/annhistcomput.bib;
                 https://www.math.utah.edu/pub/tex/bib/css.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Memoirs of IBM President Watson, the son of the
                 founder of IBM.",
  abstract =     "Tom Watson, Jr., shares how he took IBM, the company
                 founded by his father, through its spectacular growth
                 burst which made it the leader of the computer age.",
  acknowledgement = ack-nhfb,
  keywords =     "executives --- United States --- biography;
                 International Business Machines Corporation ---
                 history; Watson, Thomas J., 1914",
}

@Book{Watts:2000:OGD,
  author =       "Niki Watts",
  title =        "{Oxford} {Greek} Dictionary: {Greek--English},
                 {English--Greek}",
  publisher =    pub-BERKLEY-BOOKS,
  address =      pub-BERKLEY-BOOKS:adr,
  edition =      "{American}",
  pages =        "x + 470",
  year =         "2000",
  ISBN =         "0-425-17600-2",
  ISBN-13 =      "978-0-425-17600-9",
  LCCN =         "PA1139.E5 O94 2000",
  bibdate =      "Sat Dec 24 16:29:17 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Weart:2012:RNF,
  author =       "Spencer R. Weart",
  title =        "The rise of nuclear fear",
  publisher =    pub-HARVARD,
  address =      pub-HARVARD:adr,
  pages =        "ix + 367",
  year =         "2012",
  ISBN =         "0-674-05233-1",
  ISBN-13 =      "978-0-674-05233-8",
  LCCN =         "QC773 .W44 2012",
  bibdate =      "Wed Jun 11 16:19:34 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  author-dates = "1942--",
  subject =      "Nuclear energy; History; Psychological aspects;
                 Antinuclear movement; Radiation; Public opinion",
  tableofcontents = "Radioactive hopes \\
                 Radioactive fears \\
                 Radium: elixir or poison? \\
                 The secret, the master, and the monster \\
                 The destroyer of worlds \\
                 The news from Hiroshima \\
                 National defenses \\
                 Atoms for peace \\
                 Good and bad atoms \\
                 The new blasphemy \\
                 Death dust \\
                 The imagination of survival \\
                 The politics of survival \\
                 Seeking shelter \\
                 Fail/safe \\
                 Reactor promises and poisons \\
                 The debate explodes \\
                 Energy choices \\
                 Civilization or liberation? \\
                 Watersheds \\
                 The second nuclear age \\
                 Deconstructing nuclear weapons \\
                 Tyrants and terrorists \\
                 The modern arcanum \\
                 Artistic transmutations",
}

@Book{Weast:1985:CHC,
  editor =       "Robert C. Weast and William H. Beyer and Melvin J.
                 Astle",
  title =        "{CRC} Handbook of Chemistry and Physics",
  publisher =    pub-CRC,
  address =      pub-CRC:adr,
  edition =      "66th",
  pages =        "2384",
  year =         "1985",
  ISBN =         "0-8493-0466-0",
  ISBN-13 =      "978-0-8493-0466-8",
  LCCN =         "QD65 .C73 1985-86",
  bibdate =      "Sat Dec 24 11:53:05 MST 2005",
  bibsource =    "Amazon;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  bookformat =   "Hardcover",
  category =     "Professional \& Technical; Professional Science;
                 Chemistry; General \& Reference",
  idnumber =     "526",
  tableofcontents = "Mathematical tables \\
                 The elements and inorganic compounds \\
                 Organic compounds \\
                 General chemical \\
                 General physical constants \\
                 Miscellaneous",
}

@Book{Weaver:1994:SAM,
  author =       "David L. Weaver and Tom Germond",
  title =        "The {SPARC} Architecture Manual: Version 9",
  publisher =    pub-PHPTR,
  address =      pub-PHPTR:adr,
  pages =        "xxii + 357",
  year =         "1994",
  ISBN =         "0-13-099227-5",
  ISBN-13 =      "978-0-13-099227-7",
  LCCN =         "QA76.9.A73S648 1992",
  bibdate =      "Fri Jul 22 08:37:56 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 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/microchip.bib",
  price =        "US\$33.00",
  URL =          "http://www.sparc.org/standards/SPARCV9.pdf",
  abstract =     "SPARC (Scalable Processor Architecture) is the
                 industry's only openly defined and evolved RISC
                 architecture. Version 9 is the new 64-bit incarnation
                 of SPARC --- the most significant change since SPARC's
                 introduction in 1987! Unlike other RISC (Reduced
                 Instruction Set Computer) designs, SPARC specifies not
                 a hardware implementation (``chip''), but an open,
                 standard architecture belonging to the community of
                 SPARC vendors and users. The SPARC specification is
                 defined by the SPARC Architecture Committee, a
                 technical arm of the computer-maker consortium, SPARC
                 International. Version 9 provides 64-bit data and
                 addressing, support for fault tolerance, fast context
                 switching, support for advanced compiler optimizations,
                 efficient design for Superscalar processors, and a
                 clean structure for modern operating systems. The V9
                 architecture supplements, rather than replaces, the
                 32-bit Version 8 architecture. The non-privileged
                 features of Version 9 are upward-compatible from
                 Version 8, so 32-bit application software can execute
                 natively, without modification, on Version 9 systems no
                 special ``compatibility mode'' is required. Publication
                 of the Version 9 architecture marks a three-year
                 development effort by SPARC International member
                 companies from a broad cross-section of disciplines.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Introduction \\
                 Overview \\
                 Definitions \\
                 Architectural Overview \\
                 Data Formats \\
                 Registers \\
                 Instructions \\
                 Traps \\
                 Memory Models \\
                 (Normative) Instruction Definitions \\
                 (Normative) IEEE 754-1985 Requirements for SPARC-V9 \\
                 (Normative) SPARC-V9 Implementation Dependencies \\
                 (Normative) Formal Specification of the Memory Models
                 \\
                 (Informative) Opcode Maps \\
                 (Informative) SPARC-V9 MMU Requirements \\
                 (Informative) Suggested Assembly Language Syntax \\
                 (Informative) Software Considerations \\
                 (Informative) Extending the SPARC-V9 Architecture \\
                 (Informative) Programming With the Memory Models \\
                 (Informative) Changes from SPARC-V8 to SPARC-V9 \\
                 Bibliography \\
                 Index",
}

@Book{Weaver:2008:OIO,
  editor =       "David L. Weaver",
  title =        "{OpenSPARC} Internals: {OpenSPARC T1\slash T2} Chip
                 Multithreaded Throughput Computing",
  publisher =    "Lulu, Inc.",
  address =      "860 Aviation Parkway, Suite 300, Morrisville, NC
                 27560, USA",
  pages =        "xviii + 369",
  year =         "2008",
  ISBN =         "0-557-01974-5",
  ISBN-13 =      "978-0-557-01974-8",
  LCCN =         "????",
  bibdate =      "Tue Nov 11 14:49:47 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$20.00",
  URL =          "http://www.opensparc.net/publications/books/opensparc-internals.html",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  remark =       "From page 11: ``The UltraSPARC Architecture supports
                 32-bit and 64-bit integer and 32- bit, 64-bit, and
                 128-bit floating-point as its principal data types. The
                 32- bit and 64-bit floating-point types conform to IEEE
                 Std 754-1985. The 128-bit floating-point type conforms
                 to IEEE Std 1596.5-1992.'' There is no support for
                 128-bit integers, or for fused multiply-add (FMA)
                 instructions, or for hardware random-number
                 generators.",
  tableofcontents = "Preface / xiii \\
                 1 Introducing Chip Multithreaded (CMT) Processors / 1
                 \\
                 2 OpenSPARC Designs / 7 \\
                 3 Architecture Overview / 11 \\
                 4 OpenSPARC T1 and T2 Processor Implementations / 25
                 \\
                 5 OpenSPARC T2 Memory Subsystem --- A Deeper Look / 43
                 \\
                 6 OpenSPARC Processor Configuration / 65 \\
                 7 OpenSPARC Design Verification Methodology / 85 \\
                 8 Operating Systems for OpenSPARC T1 / 121 \\
                 9 Tools for Developers / 125 \\
                 10 System Simulation, Bringup, and Verification / 179
                 \\
                 11 OpenSPARC Extension and Modification --- Case Study
                 / 227 \\
                 A Overview: OpenSPARC T1/T2 Source Code and Environment
                 Setup / 239 \\
                 B Overview of OpenSPARC T1 Design / 249 \\
                 C Overview of OpenSPARC T2 Design / 267 \\
                 D OpenSPARC T1 Design Verification Suites / 303 \\
                 E OpenSPARC T2 Design Verification Suites / 315 \\
                 F OpenSPARC Resources / 321 \\
                 G OpenSPARC Terminology / 323 \\
                 Index / 347",
}

@Book{Wegner:1980:PAI,
  author =       "Peter Wegner",
  title =        "Programming with {Ada}: An Introduction by Means of
                 Graduated Examples",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xi + 211",
  year =         "1980",
  ISBN =         "0-13-730697-0",
  ISBN-13 =      "978-0-13-730697-8",
  LCCN =         "QA76.73.A35 W4 1980",
  bibdate =      "Wed Dec 15 10:59:02 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Weiner:2016:GGS,
  author =       "Eric Weiner",
  title =        "The geography of genius: a search for the world's most
                 creative places from ancient {Athens} to {Silicon
                 Valley}",
  publisher =    pub-SIMON-SCHUSTER,
  address =      pub-SIMON-SCHUSTER:adr,
  pages =        "353",
  year =         "2016",
  ISBN =         "1-4516-9165-3 (hardcover), 1-4516-9167-X (paperback),
                 1-4516-9168-8 (e-book)",
  ISBN-13 =      "978-1-4516-9165-8 (hardcover), 978-1-4516-9167-2
                 (paperback), 978-1-4516-9168-9 (e-book)",
  LCCN =         "BF412 .W395 2016",
  bibdate =      "Sat Sep 15 11:18:32 MDT 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  author-dates = "1963--",
  libnote =      "Not yet in my library.",
  subject =      "Genius; Miscellanea; Geography; Psychological aspects;
                 Cities and towns; Weiner, Eric; Travel; Voyages and
                 travels; HISTORY / World; SOCIAL SCIENCE / Anthropology
                 / Cultural; TRAVEL / Special Interest / General",
  subject-dates = "1963",
  tableofcontents = "Introduction: Adventures with the Galton Box / 1
                 \\
                 1: Genius is Simple: Athens / 13 \\
                 2: Genius is Nothing New: Hangzhou / 65 \\
                 3: Genius is Expensive: Florence / 97 \\
                 4: Genius is Practical: Edinburgh / 141 \\
                 5: Genius is Chaotic: Calcutta / 185 \\
                 6: Genius is Reactionary: Vienna Pitch Perfect / 217
                 \\
                 7: Genius is Caffeinated: Vienna on the Couch / 251 \\
                 8: Genius is Weak: Silicon Valley / 287 \\
                 Epilogue: Baking Bread and Hanging Ten / 321 \\
                 Acknowledgments / 327 \\
                 Select Bibliography / 329 \\
                 Index / 339",
}

@Book{Weintraub:2011:HOU,
  author =       "David A. (David Andrew) Weintraub",
  title =        "How Old Is the Universe?",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "370",
  year =         "2011",
  ISBN =         "0-691-14731-0 (hardcover)",
  ISBN-13 =      "978-0-691-14731-4 (hardcover)",
  LCCN =         "QB501 .W45 2011",
  bibdate =      "Wed Sep 12 18:01:04 MDT 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/physperspect.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Solar system; Age; Earth; Cosmology",
  tableofcontents = "Introduction: 13.7 billion years \\
                 pt. 1. The age of objects in our solar system \\
                 4004 BCE \\
                 Moon rocks and meteorites \\
                 Defying gravity \\
                 pt. 2. The ages of the oldest stars \\
                 Stepping out \\
                 Distances and light \\
                 All stars are not the same \\
                 Giant and dwarf stars \\
                 Reading a Hertzsprung-Russell (H-R) diagram \\
                 Mass \\
                 Star clusters \\
                 Mass matters \\
                 White dwarfs and the age of the universe \\
                 Ages of globular clusters and the age of the universe
                 \\
                 pt. 3. The age of the universe \\
                 Cepheids \\
                 An irregular system of globular clusters \\
                 The Milky Way demoted \\
                 The trouble with gravity \\
                 The expanding universe \\
                 The Hubble age of the universe \\
                 The accelerating universe \\
                 Dark matter \\
                 Exotic dark matter \\
                 Hot stuff \\
                 Two kinds of trouble \\
                 The WMAP map of the CMB and the age of the universe \\
                 A consistent answer",
}

@Book{Weiss:1994:PPP,
  author =       "Shlomo Weiss and James E. Smith",
  title =        "{Power} and {PowerPC}: Principles, Architecture,
                 Implementation",
  publisher =    pub-MORGAN-KAUFMANN,
  address =      pub-MORGAN-KAUFMANN:adr,
  pages =        "xvi + 408",
  year =         "1994",
  ISBN =         "1-55860-279-8",
  ISBN-13 =      "978-1-55860-279-3",
  LCCN =         "QA76.8.P67 W45 1994",
  bibdate =      "Wed Aug 10 10:06:55 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/microchip.bib",
  price =        "US\$54.95",
  acknowledgement = ack-nhfb,
  tableofcontents = "Foreword by Michael Slater \\
                 Preface \\
                 Modern Computer Design Concepts / 1 \\
                 POWER Architecture / 31 \\
                 POWER Implementation: Pipelines / 71 \\
                 POWER1 Implementation / 97 \\
                 POWER1 Implementation: Cache Memories / 115 \\
                 POWER2: The Next Generation / 135 \\
                 PowerPC Architecture / 173 \\
                 PowerPC 601 Implementation / 223 \\
                 PowerPC: Support for Multiprocessing / 253 \\
                 System Organization / 271 \\
                 PowerPC 601 and Alpha 21064 / 305 \\
                 App. A. IEEE 754 Floating-Point Standard / 333 \\
                 App. B. POWER Instruction Formats / 341 \\
                 App. C. POWER Instruction Set Sorted by Mnemonic / 349
                 \\
                 App. D. PowerPC Instruction Formats / 355 \\
                 App. E. PowerPC Instruction Set Sorted by Mnemonic /
                 365 \\
                 App. F. Cross Reference for Changed POWER Mnemonics /
                 377 \\
                 Bibliography / 383 \\
                 Index / 391",
}

@TechReport{Weitek:fp-chip,
  author =       "Weitek Corporation",
  title =        "{WTL} 1164\slash {WTL} 1165 64-bit {IEEE}
                 Floating-Point Multiplier\slash Divider and {ALU}",
  institution =  pub-WEITEK,
  address =      pub-WEITEK:adr,
  month =        jul,
  year =         "1986",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Weitz:2018:WGP,
  author =       "Eric D. Weitz",
  title =        "{Weimar Germany}: promise and tragedy",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  edition =      "{Weimar} Centennial",
  pages =        "xix + 474",
  year =         "2018",
  ISBN =         "0-691-18305-8 (paperback)",
  ISBN-13 =      "978-0-691-18305-3 (paperback)",
  LCCN =         "DD237 .W47 2018",
  bibdate =      "Sat Dec 22 16:09:21 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "Thoroughly up-to-date, skillfully written, and
                 strikingly illustrated, \booktitle{Weimar Germany}
                 brings to life an era of unmatched creativity in the
                 twentieth century --- one whose influence and
                 inspiration still resonate today. Eric Weitz has
                 written the authoritative history that this fascinating
                 and complex period deserves, and he illuminates the
                 uniquely progressive achievements and even greater
                 promise of the Weimar Republic. Weitz reveals how
                 Germans rose from the turbulence and defeat of World
                 War I and revolution to forge democratic institutions
                 and make Berlin a world capital of avant-garde art. He
                 explores the period's groundbreaking cultural
                 creativity, from architecture and theater, to the new
                 field of ``sexology'' --- and presents richly detailed
                 portraits of some of the Weimar's greatest figures.
                 \booktitle{Weimar Germany} also shows that beneath this
                 glossy veneer lay political turmoil that ultimately led
                 to the demise of the republic and the rise of the
                 radical Right. Yet for decades after, the Weimar period
                 continued to powerfully influence contemporary art,
                 urban design, and intellectual life --- from Tokyo to
                 Ankara, and Brasilia to New York. Featuring a new
                 preface, this comprehensive and compelling book
                 demonstrates why Weimar is an example of all that is
                 liberating and all that can go wrong in a democracy.",
  acknowledgement = ack-nhfb,
  remark =       "Update of 2007 original edition.",
  tableofcontents = "List of Illustrations / ix \\
                 Introduction / 1 \\
                 1: A Troubled Beginning / 7 \\
                 2: Walking the City / 41 \\
                 3: Political Worlds / 81 \\
                 4: A Turbulent Economy and an Anxious Society / 129 \\
                 5: Building a New Germany / 169 \\
                 6: Sound and Image / 207 \\
                 7: Culture and Mass Society / 251 \\
                 8: Bodies and Sex / 297 \\
                 9: Revolution and Counterrevolution from the Right /
                 331 \\
                 Conclusion / 361 \\
                 Notes / 369 \\
                 Bibliographic Essay / 401 \\
                 Acknowledgments / 407 \\
                 Index / 409",
}

@Book{Weitzman:1980:DMM,
  author =       "Cay Weitzman",
  title =        "Distributed Micro\slash Minicomputer Systems:
                 Structure, Implementations, and Application",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xii + 403",
  year =         "1980",
  ISBN =         "0-13-216481-7",
  ISBN-13 =      "978-0-13-216481-8",
  LCCN =         "QA76.9.D5 .W44 1980",
  bibdate =      "Wed Dec 15 10:59:03 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$22.50",
  acknowledgement = ack-nhfb,
  tableofcontents = "Multiminicomputer architecture \\
                 Multimicro- and minicomputer software \\
                 Off-the-shelf multiminicomputer hardware \\
                 Design based on process characterization \\
                 Application examples \\
                 Future trends \\
                 Data link control protocols \\
                 Sample problem solutions",
}

@Book{Wells:2005:PNM,
  author =       "D. G. (David G.) Wells",
  title =        "Prime Numbers: the Most Mysterious Figures in Math",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xv + 272",
  year =         "2005",
  ISBN =         "0-471-46234-9 (hardcover), 0-471-71892-0 (ebook)",
  ISBN-13 =      "978-0-471-46234-7 (hardcover), 978-0-471-71892-5
                 (e-book)",
  LCCN =         "QA246 .W35 2005",
  bibdate =      "Wed Feb 21 14:25:53 MST 2007",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/u/ulam-stanislaw-m.bib;
                 https://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0616/2004019974-b.html;
                 http://www.loc.gov/catdir/enhancements/fy0616/2004019974-d.html;
                 http://www.loc.gov/catdir/toc/ecip0422/2004019974.html",
  abstract =     "A fascinating journey into the mind-bending world of
                 prime numbers Cicadas of the genus Magicicada appear
                 once every 7, 13, or 17 years. Is it just a coincidence
                 that these are all prime numbers? How do twin primes
                 differ from cousin primes, and what on earth (or in the
                 mind of a mathematician) could be sexy about prime
                 numbers? What did Albert Wilansky find so fascinating
                 about his brother-in-law's phone number? Mathematicians
                 have been asking questions about prime numbers for more
                 than twenty-five centuries, and every answer seems to
                 generate a new rash of questions. In Prime Numbers: The
                 Most Mysterious Figures in Math, you'll meet the
                 world's most gifted mathematicians, from Pythagoras and
                 Euclid to Fermat, Gauss, and Erd{\H{o}}s, and you'll
                 discover a host of unique insights and inventive
                 conjectures that have both enlarged our understanding
                 and deepened the mystique of prime numbers. This
                 comprehensive, A-to-Z guide covers everything you ever
                 wanted to know-and much more that you never
                 suspected-about prime numbers, including: the unproven
                 Riemann hypothesis and the power of the zeta function,
                 the ``Primes is in P'' algorithm, the sieve of
                 Eratosthenes of Cyrene, Fermat and Fibonacci numbers,
                 the Great Internet Mersenne Prime Search, and much,
                 much more.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "Introduction \\
                 List of Entries \\
                 abc conjecture \\
                 abundant number \\
                 AKS algorithm for primality testing \\
                 aliquot sequences (sociable chains) \\
                 almost-primes \\
                 amicable numbers \\
                 amicable curiosities \\
                 Andrica's conjecture \\
                 arithmetic progressions, of primes \\
                 Aurifeuillian factorization \\
                 average prime \\
                 Bang's theorem \\
                 Bateman's conjecture \\
                 Beal's conjecture, and prize \\
                 Benford's law \\
                 Bernoulli numbers \\
                 Bernoulli number curiosities \\
                 Bertrand's postulate \\
                 Bonse's inequality \\
                 Brier numbers \\
                 Brocard's conjecture \\
                 Brun's constant \\
                 Buss's function \\
                 Carmichael numbers \\
                 Catalan's conjecture \\
                 Catalan's Mersenne conjecture \\
                 Champion numbers \\
                 Chinese remainder theorem \\
                 cicadas and prime periods \\
                 circle, prime \\
                 circular prime \\
                 Clay prizes, the \\
                 compositorial \\
                 concatenation of primes \\
                 conjectures \\
                 consecutive integer sequence \\
                 consecutive numbers \\
                 consecutive primes, sums of \\
                 Conway's prime-producing machine \\
                 cousin primes \\
                 Cullen primes \\
                 Cunningham project \\
                 Cunningham chains \\
                 decimals, recurring (periodic) \\
                 deficient number \\
                 deletable and truncatable primes \\
                 Demlo numbers \\
                 descriptive primes \\
                 Dickson's conjecture \\
                 digit properties \\
                 Diophantus (c.200: died 284) \\
                 Dirichlet's theorem and primes in arithmetic series \\
                 distributed computing \\
                 divisibility tests \\
                 divisors (factors) \\
                 economical numbers \\
                 Electronic Frontier Foundation \\
                 elliptic curve primality proving \\
                 emirp \\
                 Eratosthenes of Cyrene, the sieve of \\
                 Erd{\H{o}}s, Paul (1913--1996) \\
                 errors \\
                 Euclid \\
                 Unique factorisation \\
                 $\sqrt{2}$ is irrational \\
                 Euclid and the infinity of primes \\
                 Consecutive composite numbers \\
                 Primes of the form $4 n + 3$ \\
                 A recursive sequence \\
                 Euclid and the first perfect number \\
                 Euclidean algorithm \\
                 Euler, Leonhard (1707--1783) \\
                 Euler's convenient numbers \\
                 The Basel problem \\
                 Euler's constant \\
                 Euler and the reciprocals of the primes \\
                 Euler's phi [totient] function \\
                 Carmichael's totient function conjecture \\
                 Curiosities of $\phi(n)$ \\
                 Euler's quadratic \\
                 The Lucky Numbers of Euler \\
                 factorial \\
                 factors of factorials \\
                 factorial primes \\
                 factorial sums \\
                 factorials, double, triple, \ldots{} \\
                 factorization, methods of \\
                 factors of particular forms \\
                 Fermat's algorithm \\
                 Legendre's method \\
                 How difficult is it to factor large numbers? \\
                 quantum computation \\
                 Feit--Thompson conjecture \\
                 Fermat Pierre de (1607--1665) \\
                 Fermat's Little Theorem \\
                 Fermat quotient \\
                 Fermat and primes of the form $x^2 + y^2$ \\
                 Fermat's conjecture, Fermat numbers and Fermat primes
                 \\
                 Fermat factorisation, from $F_6$ to $F_{30}$ \\
                 Generalized Fermat numbers \\
                 Fermat's Last Theorem \\
                 The first case of Fermat's Last Theorem: \\
                 Wall--Sun--Sun primes \\
                 Fermat--Catalan equation and conjecture \\
                 Fibonacci numbers \\
                 divisibility properties \\
                 Fibonacci curiosities \\
                 {\'E}douard Lucas and the Fibonacci numbers \\
                 Fibonacci composite sequences \\
                 formulae for primes \\
                 Fortunate numbers and Fortune's conjecture \\
                 gaps between primes, and composite runs \\
                 Gauss Johann Carl Friedrich (1777--1855) \\
                 Gauss and the distribution of primes \\
                 Gaussian primes \\
                 Gauss's circle problem \\
                 Gilbreath conjecture \\
                 GIMPS = Great Internet Mersenne Primes Search \\
                 Giuga's conjecture \\
                 Giuga numbers \\
                 Goldbach's conjecture \\
                 good primes \\
                 graph, prime number \\
                 Grimm's problem \\
                 Hardy, G. H. (1877--1947) \\
                 Hardy--Littlewood conjectures \\
                 heuristic reasoning \\
                 Hilbert's 23 problems \\
                 home prime \\
                 hypothesis H \\
                 illegal prime \\
                 inconsummate number \\
                 induction jumping champion \\
                 $k$-tuples conjecture, prime \\
                 knots, prime and composite \\
                 Landau, Edmund (1877--1938) \\
                 left-truncatable prime \\
                 Legendre, A. M. (1752--1833) \\
                 Legendre's theorem (1808) \\
                 Lehmer, Derrick Norman (1867--1938) \\
                 Lehmer, Derrick Henry (1905--1991) \\
                 Linnik's constant \\
                 Liouville, Joseph (1809--1882) \\
                 Littlewood's theorem \\
                 the prime numbers race \\
                 Look and Say sequence \\
                 Lucas, {\'E}douard (1842--1891) \\
                 the Lucas sequence \\
                 primality testing \\
                 Lucas's game of calculation \\
                 the Lucas--Lehmer test \\
                 lucky numbers \\
                 the number of Lucky numbers and primes \\
                 `random' primes' \\
                 magic squares \\
                 Matijasevic and Hilbert's 10th problem \\
                 Mersenne numbers and Mersenne primes \\
                 Mersenne numbers \\
                 hunting for Mersenne primes \\
                 the coming of electronic computers \\
                 Mersenne prime conjectures \\
                 the New Mersenne Conjecture \\
                 how many Mersenne primes? \\
                 Eberhart's conjecture \\
                 factors of Mersenne Numbers \\
                 Lucas--Lehmer test for Mersenne primes \\
                 Mertens' theorem \\
                 Mertens' constant \\
                 Mill's theorem \\
                 Wright's theorem \\
                 mixed bag \\
                 multiplication, fast \\
                 Niven Numbers \\
                 odd numbers as $p + 2 a^2$ \\
                 Opperman's conjecture \\
                 palindromic primes \\
                 pandigital primes \\
                 Pascal's Triangle and the binomial coefficients \\
                 Pascal's triangle and Sierpinski's gasket \\
                 Pascal triangle curiosities \\
                 patents on prime numbers \\
                 P{\'e}pin's test for Fermat numbers \\
                 perfect numbers \\
                 odd perfect numbers \\
                 perfect, multiply \\
                 permutable primes \\
                 $o$, primes in the decimal expansion of \\
                 Pocklington's theorem \\
                 Polignac's conjectures \\
                 Polignac or obstinate numbers \\
                 powerful numbers \\
                 consecutive powerful numbers \\
                 primality testing \\
                 probabilistic methods \\
                 prime number graph \\
                 prime number theorem and the prime counting function
                 \\
                 history \\
                 elementary proof \\
                 record calculations \\
                 estimating $p(n)$ \\
                 calculating $p(n)$ \\
                 a curiosity \\
                 prime pretender \\
                 primitive prime factor \\
                 primitive roots \\
                 Artin's conjecture \\
                 a curiosity \\
                 primorial \\
                 primorial primes \\
                 Proth's Theorem \\
                 pseudoperfect numbers \\
                 bases and pseudpoprimes \\
                 pseudoprimes, strong \\
                 public key encryption \\
                 pyramid, prime \\
                 Pythagorean triangles, prime \\
                 quadratic residues \\
                 residual curiosities \\
                 polynomial congruences \\
                 quadratic reciprocity, law of \\
                 Euler's criterion \\
                 Ramanujan, Srinivasa (1887--1920) \\
                 Highly Composite Numbers \\
                 randomness, of primes \\
                 Von Sternach and a prime random walk \\
                 record primes \\
                 some records \\
                 repunits, prime \\
                 Rhonda numbers \\
                 Riemann hypothesis \\
                 Farey sequence and Riemann's Hypothesis \\
                 Riemann's hypothesis and $\sigma(n)$, the sum of
                 divisor function \\
                 squarefree and blue and red numbers \\
                 the Mertens conjecture \\
                 Riemann Hypothesis curiosities \\
                 Riesel number \\
                 right-truncatable prime \\
                 RSA algorithm \\
                 Martin Gardner's challenge \\
                 RSA Factoring Challenge, The New \\
                 Ruth--Aaron numbers \\
                 Scherk's conjecture \\
                 semi-primes \\
                 sexy primes \\
                 Shank's Conjecture \\
                 Siamese primes \\
                 Sierpinski numbers \\
                 Sierpinski strings \\
                 Sierpinski's quadratic \\
                 Sierpinski's $\phi(n)$ conjecture \\
                 Sloane's On-Line Encyclopedia of Integer Sequences \\
                 Smith numbers \\
                 Smith Brothers \\
                 smooth numbers \\
                 Sophie Germain primes \\
                 safe primes \\
                 square-free numbers \\
                 Stern prime \\
                 strong law of small numbers \\
                 triangular numbers \\
                 trivia \\
                 twin primes \\
                 twin curiosities \\
                 Ulam spiral \\
                 unitary divisors \\
                 unitary perfect \\
                 untouchable numbers \\
                 weird numbers \\
                 Wieferich primes \\
                 Wilson's theorem \\
                 twin primes \\
                 Wilson's quotient \\
                 Wilson primes \\
                 Wolstenholme's numbers, and theorems \\
                 more factors of Wolstenholme numbers \\
                 Woodall primes \\
                 zeta mysteries: the quantum connection \\
                 Appendix A: The First 500 Primes \\
                 Appendix B: Arithmetic Functions \\
                 Glossary \\
                 Bibliography \\
                 Index",
}

@Book{Wheatley:2021:SWP,
  author =       "Denys N. Wheatley",
  title =        "Scientific writing and publishing: a comprehensive
                 manual for authors",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xii + 200",
  year =         "2021",
  ISBN =         "1-108-79980-9 (paperback), 1-108-83520-1 (hardcover),
                 1-108-87991-8 (PDF e-book)",
  ISBN-13 =      "978-1-108-79980-5 (paperback), 978-1-108-83520-6
                 (hardcover), 978-1-108-87991-0 (PDF e-book)",
  LCCN =         "T11 .W4475 2021",
  bibdate =      "Tue Oct 12 08:43:25 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "This book is designed to help you write, improve,
                 submit, revise and publish high quality research
                 publications or reports. Papers are the final products
                 of your research, possibly relating to experiments or
                 investigations that might have taken several years to
                 complete. Published papers are crucial for helping you
                 to become an expert in your chosen field, communicate
                 to the world your important contributions to the
                 advancement of knowledge, get the necessary feedback to
                 improve your research plans, and establish your career.
                 Therefore we cannot emphasise enough the importance of
                 learning to write your articles effectively. Remarkably
                 few colleges, universities, companies, and other
                 organizations worldwide take the trouble to instruct
                 their students, research staff and others in
                 paper-writing. They seem to expect people to assimilate
                 the requisite skills by osmosis from their mentors (who
                 themselves often need training). This manual will
                 instruct you how to go about writing a research paper.
                 To keep it within reasonable bounds, it does not
                 include much information on how to write in good
                 idiomatic English (see A10). There is a wealth of books
                 on this matter, and a quick search online will lead you
                 to many. This is true not only regarding non-native
                 English speakers, as many native speakers often need
                 help, particular important in developing a personal
                 style, so necessary if papers are to be less
                 stereotyped in the presentation.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Technical writing; Report writing; Science publishing;
                 Science publishing.; Technical writing.",
  tableofcontents = "Preface: Writing and publishing a scientific paper:
                 an outline \\
                 General features of a scientific paper: structure and
                 format \\
                 The typical scientific paper: a published paper with
                 annotations \\
                 Results: presenting your findings \\
                 Discussion: the place to argue your case \\
                 Introduction: the first main section of a paper \\
                 Materials and methods \\
                 Abstract: the summary of the main findings \\
                 The ``smaller'' sections that complete a paper \\
                 Figures and tables \\
                 Presubmission \\
                 Submission of manuscripts \\
                 Peer-review: the crux of the problem in publishing
                 papers \\
                 The last stage of the editorial process: decisions,
                 revisions, and final editing \\
                 From acceptance to publication \\
                 Copyright \\
                 Ethics and scientific integrity",
}

@Book{Wheelan:2014:NSS,
  author =       "Charles J. Wheelan",
  title =        "Naked statistics: stripping the dread from the data",
  publisher =    pub-NORTON,
  address =      pub-NORTON:adr,
  pages =        "xviii + 282",
  year =         "2014",
  ISBN =         "0-393-34777-X (paperback), 0-393-07195-2 (hardcover)",
  ISBN-13 =      "978-0-393-34777-7 (paperback), 978-0-393-07195-5
                 (hardcover)",
  LCCN =         "QA276.W458 2014",
  bibdate =      "Wed Jun 11 16:15:25 MDT 2014",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Demystifies the study of statistics by stripping away
                 the technical details to examine the underlying
                 intuition essential for understanding statistical
                 concepts.",
  acknowledgement = ack-nhfb,
  subject =      "Statistics",
  tableofcontents = "What's the point? \\
                 Descriptive statistics: who was the best baseball
                 player of all time? \\
                 Deceptive description: ``he's got a great
                 personality!'' and other true but grossly misleading
                 statements \\
                 Correlation: how does Netflix know what movies I like?
                 \\
                 Basic probability: don't buy the extended warranty on
                 your \$99 printer \\
                 The Monty Hall problem \\
                 Problems with probability: how overconfident math geeks
                 nearly destroyed the global financial system \\
                 The importance of data: ``garbage in, garbage out'' \\
                 The central limit theorem: the Lebron James of
                 statistics \\
                 Inference: why my statistics professor thought I might
                 have cheated \\
                 Polling: how we know that 64 percent of Americans
                 support the death penalty (with a sampling error (plus
                 or minus) 3 percent) \\
                 Regression analysis: the miracle elixir \\
                 Common regression mistakes: the mandatory warning label
                 \\
                 Program evaluation: will going to Harvard change your
                 life? \\
                 Conclusion: five questions that statistics can help
                 answer \\
                 Appendix: Statistical software",
}

@Book{Whitaker:1996:EBQ,
  author =       "Andrew Whitaker",
  title =        "{Einstein}, {Bohr}, and the Quantum Dilemma",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xvii + 349",
  year =         "1996",
  ISBN =         "0-521-48220-8 (hardcover), 0-521-48428-6 (paperback)",
  ISBN-13 =      "978-0-521-48220-2 (hardcover), 978-0-521-48428-2
                 (paperback)",
  LCCN =         "QC174.12 .W48 1996",
  bibdate =      "Wed Dec 21 08:26:27 MST 2005",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/bohr-niels.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/d/debroglie-louis.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/h/heisenberg-werner.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/p/peierls-rudolf.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/s/schroedinger-erwin.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.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;
                 z3950.loc.gov:7090/Voyager",
  URL =          "ftp://uiarchive.cso.uiuc.edu/pub/etext/gutenberg/;
                 http://www.cambridge.org/uk/catalogue/catalogue.asp?isbn=0521484286;
                 http://www.loc.gov/catdir/description/cam027/95018270.html;
                 http://www.loc.gov/catdir/toc/cam021/95018270.html",
  acknowledgement = ack-nhfb,
  remark =       "From the publisher: ``The debate between Bohr and
                 Einstein, which raged in the 1920s and 1930s, but which
                 is still highly relevant today, involved the two
                 greatest physicists of the twentieth century, and
                 played a large part in Einstein, perhaps the most
                 famous scientist ever, going into effective scientific
                 exile. The debate concerned the quantum theory,
                 probably the most successful physical theory of all
                 time, and this book explores the details of the
                 conflict, as well as its significance for contemporary
                 views on the foundations of quantum theory. The author
                 gives sympathetic accounts of the views of both Bohr
                 and Einstein, and a thorough study of the argument
                 between them. The book also includes non-technical and
                 non-mathematical accounts of the development of quantum
                 theory and Relativity, and also the work of David Bohm
                 and John Bell in the 1950s and 1960s that restored
                 interest in Einstein's views. Also included is a full
                 account of the many current experimental and
                 theoretical developments on quantum theory.\par

                 * Complete, non-technical, description of the debate
                 between Bohr and Einstein.\par

                 * Readable account of the development and meaning of
                 quantum theory.\par

                 * Clear and comprehensive account of the current
                 conceptual and experimental developments.''",
  shorttableofcontents = "1. Bohr and Einstein: Einstein and Bohr \\
                 2. The peace before the quantum \\
                 3. A glance at Relativity \\
                 4. The slow rise of the quantum \\
                 5. Bohr: what does it all mean? \\
                 6. Einstein's negative views \\
                 7. Bohm, Bell and experimental philosophy \\
                 8. A round-up of recent developments \\
                 9. Bohr or Einstein? \\
                 References \\
                 Bibliography",
  subject =      "Quantum theory; Einstein, Albert; Bohr, Niels Henrik
                 David",
  subject-dates = "1879--1955; 1885--1962",
  tableofcontents = "Preface / xiii \\
                 Acknowledgements / xvi \\
                 1 Bohr and Einstein: Einstein and Bohr Albert Einstein
                 and relativity / 1 \\
                 Relativity and quantum theory / 1 \\
                 Albert Einstein: universal genius / 3 \\
                 Niels Bohr and quantum theory / 6 \\
                 The debate continues / 7 \\
                 / 10 \\
                 2 The peace before the quantum / 12 \\
                 Classical physics / 12 \\
                 Newton's inheritance / 15 \\
                 'Let Newton be' / 18 \\
                 Gravity on earth / 20 \\
                 More about motion / 21 \\
                 Planetary motions and gravity / 23 \\
                 The Newtonian Universe / 27 \\
                 A sketch of classical mechanics / 29 \\
                 The behaviour of waves / 36 \\
                 A sketch of electricity and magnetism / 43 \\
                 Light, from Newton to Maxwell / 48 \\
                 Heat and thermodynamics / 53 \\
                 Kinetic theory / 55 \\
                 Statistical mechanics / 59 \\
                 The chemical atom / 63 \\
                 Dividing the 'indivisible' / 66 \\
                 Conclusion / 72 \\
                 \\
                 3 A glance at relativity / 73 \\
                 The idea of relativity / 73 \\
                 Michelson and Morley; Fitzgerald and Lorentz / 78 \\
                 Relativity: the special theory / 82 \\
                 Relativity in mechanics / 85 \\
                 The background of general relativity / 87 \\
                 Einstein, relativity and quantum theory / 89 \\
                 \\
                 4 The slow rise of the quantum / 90 \\
                 Planck and the genesis of the quantum / 90 \\
                 Einstein and black body radiation / 98 \\
                 Einstein and thermal capacities / 101 \\
                 Bragg and X-rays / 104 \\
                 Quantum theory --- the first 13 years / 105 \\
                 The basis of atomic spectroscopy / 107 \\
                 The Bohr atom / 110 \\
                 The heyday of the old quantum theory / 116 \\
                 Einstein: spontaneous and stimulated emission / 120 \\
                 The correspondence principle / 121 \\
                 The Compton effect / 123 \\
                 De Broglie, Bose and Einstein / 125 \\
                 Spin, the exclusion principle and the Periodic Table /
                 129 \\
                 Heisenberg and matrix mechanics / 134 \\
                 Schr{\"o}dinger and his equation / 138 \\
                 Heisenberg and Schr{\"o}dinger: the debate / 143 \\
                 Uncertainty and indeterminacy / 147 \\
                 Symmetry and statistics / 153 \\
                 The scope of the quantum / 155 \\
                 Back to Bohr and Einstein / 158 \\
                 \\
                 5 Bohr: what does it all mean? / 159 \\
                 Wonderful news from Copenhagen / 159 \\
                 Bohr and hidden variables / 160 \\
                 Bohr's ideas --- static or evolving? / 162 \\
                 The problem --- as perceived by Bohr / 163 \\
                 Popular views of Bohr's approach / 165 \\
                 Complementarity --- the quantum postulate / 169 \\
                 The 'disturbance' trap / 172 \\
                 Complementarity --- the cut / 173 \\
                 Complementarity --- the use of classical concepts / 175
                 \\
                 Complementarity --- the heart of the argument / 176 \\
                 Wholeness / 178 \\
                 Complementarity --- the problems / 181 \\
                 Some comments on Bohr and complementarity / 184 \\
                 Complementarity in other fields / 189 \\
                 Von Neumann and the Princeton interpretation / 193 \\
                 Wave-function collapse / 195 \\
                 Von Neumann's impossibility proof / 199 \\
                 Wigner and consciousness / 200 \\
                 \\
                 Einstein's negative views / 202 \\
                 The 1927 Solvay congress / 202 \\
                 The Bohr--Einstein debate: round one / 205 \\
                 Einstein and ensembles / 210 \\
                 The difficulties with ensembles / 213 \\
                 The Bohr--Einstein debate: round two / 217 \\
                 Determinism, realism, locality / 219 \\
                 Completeness / 223 \\
                 The Bohr--Einstein debate: round three; EPR / 224 \\
                 Bohr on EPR / 228 \\
                 Schr{\"o}dinger's cat and Wigner's friend / 234 \\
                 Einstein's demands for a quantum theory / 236 \\
                 Einstein's ideas for a quantum theory / 239 \\
                 \\
                 Bohm, Bell and experimental philosophy / 244 \\
                 David Bohm: life and times / 244 \\
                 De Broglie and pilot waves / 246 \\
                 Bohm theory --- the minimalist approach / 246 \\
                 Bohm theory --- the quantum potential / 248 \\
                 Responses to Bohm / 250 \\
                 Bell and the de Broglie--Bohm theory / 253 \\
                 Bell and the impossibility proofs / 255 \\
                 Bell and non-locality / 258 \\
                 Experimental philosophy / 260 \\
                 What do the experiments mean? / 263 \\
                 Bohm: the later years / 266 \\
                 Development of the de Broglie--Bohm theory / 267 \\
                 The realist point of view / 270 \\
                 \\
                 8 A round-up of recent developments / 274 \\
                 Everett and relative states / 274 \\
                 De Witt and many worlds / 276 \\
                 Discussion of the many worlds interpretation / 280 \\
                 More about ensembles / 284 \\
                 Ensembles and measurement / 286 \\
                 Zurek and decoherence / 289 \\
                 Consistent or decoherent histories / 292 \\
                 The quantum state diffusion model / 297 \\
                 Peierls and the knowledge interpretation / 301 \\
                 Stochastic interpretations / 303 \\
                 Models of spontaneous collapse / 305 \\
                 The quantum Zeno effect / 308 \\
                 The neutron interferometer / 314 \\
                 Leggett and macroscopic quantum mechanics / 318 \\
                 \\
                 9 Bohr or Einstein? / 323 \\
                 \\
                 References / 328 \\
                 Additional bibliography / 337 \\
                 Index / 339",
}

@Book{White:1983:MG,
  author =       "Jan V. White",
  title =        "Mastering Graphics",
  publisher =    pub-BOWKER,
  address =      pub-BOWKER:adr,
  pages =        "xiii + 180",
  year =         "1983",
  ISBN =         "0-8352-1704-3",
  ISBN-13 =      "978-0-8352-1704-0",
  LCCN =         "Z253 .W47 1983",
  bibdate =      "Wed Dec 15 10:59:05 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

@Book{White:1988:GDE,
  author =       "Jan V. White",
  title =        "Graphic Design for the Electronic Age",
  publisher =    pub-WATSON-GUPTILL,
  address =      pub-WATSON-GUPTILL:adr,
  pages =        "xi + 211",
  year =         "1988",
  ISBN =         "0-8230-2121-1, 0-8230-2122-X (paperback)",
  ISBN-13 =      "978-0-8230-2121-5, 978-0-8230-2122-2 (paperback)",
  LCCN =         "Z286.D47 W5 1988",
  bibdate =      "Wed Dec 15 10:59:04 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  acknowledgement = ack-nhfb # " and " # ack-fm,
  annote =       "A very good book on typography and document design;
                 main topics are components of larger documents.",
  keywords =     "typography, layout, design",
}

@Book{White:1990:CEA,
  author =       "Jan V. White",
  title =        "Color for the Electronic Age",
  publisher =    pub-WATSON-GUPTILL,
  address =      pub-WATSON-GUPTILL:adr,
  pages =        "207",
  year =         "1990",
  ISBN =         "0-8230-0732-4",
  ISBN-13 =      "978-0-8230-0732-5",
  LCCN =         "Z 286 D47 W49 1990",
  bibdate =      "Wed Dec 15 10:59:04 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{White:1990:GP,
  author =       "Jan V. White",
  title =        "Great Pages",
  publisher =    pub-SERIF,
  address =      pub-SERIF:adr,
  pages =        "128",
  year =         "1990",
  ISBN =         "1-878567-01-2",
  ISBN-13 =      "978-1-878567-01-7",
  LCCN =         "Z286.D47 W5 1990",
  bibdate =      "Wed Dec 15 10:59:05 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{White:1994:IRS,
  editor =       "Steve White and John Reysa",
  title =        "{IBM RISC System\slash 6000} Technology: Volume {II}",
  publisher =    pub-IBM,
  address =      pub-IBM:adr,
  year =         "1994",
  bibdate =      "Fri Mar 18 10:25:19 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "A partial draft is available via anonymous ftp to
                 \path|ibminet.awdpa.ibm.com| in the PostScript file
                 \path|/pub/rs6kpapers/techbook.ps|.",
  acknowledgement = ack-nhfb,
}

@Book{White:1994:PPT,
  editor =       "Steve White and John Reysa",
  title =        "{PowerPC} and {Power2}: Technical Aspects of the New
                 {IBM RISC System\slash 6000}",
  publisher =    pub-IBM-REDBOOKS,
  address =      pub-IBM-REDBOOKS:adr,
  pages =        "x + 237",
  year =         "1994",
  bibdate =      "Fri Jan 05 07:16:07 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "IBM order number SA23-2737-00.",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
  xxLCCN =       "none",
}

@Book{Whitlam:1998:OPD,
  author =       "John Whitlam and Lia Correia Raitt",
  title =        "The {Oxford} {Portuguese} Dictionary:
                 {Portuguese--English}, {English--Portuguese}",
  publisher =    "Berkley Books",
  address =      "New York, NY, USA",
  pages =        "xxii + 436",
  year =         "1998",
  ISBN =         "0-425-16389-X",
  ISBN-13 =      "978-0-425-16389-4",
  LCCN =         "PC5333 .W55 1998",
  bibdate =      "Thu Jan 05 18:10:29 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$5.99",
  acknowledgement = ack-nhfb,
}

@Book{Wiederhold:1977:DD,
  author =       "Gio Wiederhold",
  title =        "Database Design",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "xiii + 658",
  year =         "1977",
  ISBN =         "0-07-070130-X, 0-07-085859-4",
  ISBN-13 =      "978-0-07-070130-4, 978-0-07-085859-6",
  LCCN =         "QA76.9.D3 W531",
  bibdate =      "Wed Dec 15 10:59:06 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "McGraw-Hill Computer Science Series, Editor: Richard
                 W. Hamming and Edward A. Feigenbaum",
  acknowledgement = ack-nhfb,
  subject =      "Database management; Data structures (Computer
                 science); File organization (Computer science); Data
                 structures (Computer science); Database management;
                 File organization (Computer science); Datenbank;
                 Design",
}

@Book{Wiederhold:1983:DD,
  author =       "Gio Wiederhold",
  title =        "Database Design",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  edition =      "Second",
  pages =        "xvi + 751",
  year =         "1983",
  ISBN =         "0-07-070132-6",
  ISBN-13 =      "978-0-07-070132-8",
  LCCN =         "QA76.9.D3 W531 1983",
  bibdate =      "Wed Dec 15 10:59:06 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$29.95",
  series =       "McGraw-Hill Computer Science Series, Editor: Richard
                 W. Hamming and Edward A. Feigenbaum",
  acknowledgement = ack-nhfb,
  tableofcontents = "Definitions and introduction \\
                 Hardware and its parameters \\
                 Basic file system organization \\
                 Hybrid file organizations \\
                 Overall file system evaluation \\
                 Techniques \\
                 Database structure \\
                 Schemas \\
                 Database implementation \\
                 Query languages \\
                 Methods to gain reliability \\
                 Protection of privacy \\
                 Integrity of databases \\
                 Coding \\
                 Data base operation and management \\
                 Index for alternate terminology \\
                 List of database systems \\
                 Symbols used",
}

@Book{Wiederhold:1983:FOD,
  author =       "Gio Wiederhold",
  title =        "File Organization for Database Design",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  year =         "1983",
  bibdate =      "Wed Dec 15 10:59:07 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "McGraw-Hill Computer Science Series, Editor: Richard
                 W. Hamming and Edward A. Feigenbaum",
  acknowledgement = ack-nhfb,
}

@Book{Wiederhold:1987:FOD,
  author =       "Gio Wiederhold",
  title =        "File Organization for Database Design",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  edition =      "Second",
  pages =        "xiv + 619",
  year =         "1987",
  ISBN =         "0-07-070133-4",
  ISBN-13 =      "978-0-07-070133-5",
  LCCN =         "QA76.9.F5 W53 1987",
  bibdate =      "Wed Jul 6 14:35:27 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$38.95",
  series =       "McGraw-Hill Computer Science Series, Editor: Richard
                 W. Hamming and Edward A. Feigenbaum",
  acknowledgement = ack-nhfb,
}

@Article{Wiles:1995:MEC,
  author =       "Andrew Wiles",
  title =        "Modular elliptic curves and {Fermat's Last Theorem}",
  journal =      j-ANN-MATH,
  volume =       "142",
  pages =        "443--551",
  year =         "1995",
  bibdate =      "Sun May 02 07:55:34 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "This paper contains the bulk of the author's proof of
                 the Taniyama-Shimura conjecture and Fermat's Last
                 Theorem. The companion paper \cite{Taylor:1995:RTP}
                 contains the solution to the flaw discovered in the
                 proof that Wiles announced on June 23, 1993, in
                 Cambridge, England. See also \cite{Singh:1997:FEE}.",
  acknowledgement = ack-nhfb,
}

@Book{Wilf:1986:AC,
  author =       "Herbert S. (Saul) Wilf",
  title =        "Algorithms and Complexity",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "vi + 231",
  year =         "1986",
  ISBN =         "0-13-021973-8 (hardcover), 0-13-022054-X (paperback)",
  ISBN-13 =      "978-0-13-021973-2 (hardcover), 978-0-13-022054-7
                 (paperback)",
  LCCN =         "QA63 .W55 1986",
  bibdate =      "Wed Dec 15 10:59:08 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Wilkes:1950:E,
  author =       "M. V. Wilkes and W. Renwick",
  booktitle =    "{Report of a Conference on High Speed Automatic
                 Calculating Machines, 22--25 June 1949}",
  title =        "The {EDSAC}",
  publisher =    "University Mathematical Laboratory",
  address =      "Cambridge, UK",
  pages =        "9--11",
  month =        jan,
  year =         "1950",
  bibdate =      "Wed Oct 13 12:00:41 2010",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/w/wilkes-maurice-v.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Reprinted in \cite[\S 8.5]{Randell:1982:ODC}.",
  acknowledgement = ack-nhfb,
  author-dates = "Sir Maurice Vincent Wilkes (26 June 1913--29 November
                 2010)",
}

@Book{Wilkes:1995:CP,
  author =       "M. V. Wilkes",
  title =        "Computing Perspectives",
  publisher =    pub-MORGAN-KAUFMANN,
  address =      pub-MORGAN-KAUFMANN:adr,
  pages =        "x + 207",
  year =         "1995",
  DOI =          "",
  ISBN =         "0-08-050268-7, 1-322-46561-4, 1-55860-317-4",
  ISBN-13 =      "978-0-08-050268-7, 978-1-322-46561-6,
                 978-1-55860-317-2",
  LCCN =         "QA76 .W5 1995; QA76.17 .C667 1995",
  MRclass =      "68-03 68-0168M01 68M99 68N99",
  bibdate =      "Sat Sep 07 14:59:00 2024",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/babbage-charles.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/w/wilkes-maurice-v.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  ZMnumber =     "0819.68004",
  acknowledgement = ack-nhfb,
  author-dates = "Sir Maurice Vincent Wilkes (26 June 1913--29 November
                 2010)",
  BM-number =    "41",
  RSBM-number =  "190",
  tableofcontents = "Preface \\
                 Part I: History \\
                 1: Charles Babbage --- The Great Uncle or Computing \\
                 The Difference Engine \\
                 The Analytical Engine \\
                 Babbage's Private Life and Personality \\
                 References \\
                 2: The Beginnings or Electronic Computers \\
                 Large-Scale Computing Machinery Before 1945 \\
                 The ENIAC \\
                 References \\
                 3: The Development or the Stored Program Computer \\
                 The Seminal Years \\
                 The Software Avalanche \\
                 References \\
                 Part II: Processor Technology and Workstations \\
                 4: Personal Computers and Workstations. The Reinvention
                 of the Computer From Personal Computers to Workstations
                 \\
                 References \\
                 5: The RISC Movement in Processor Architecture \\
                 Characterization of a RISC Computer \\
                 The RISC Vision \\
                 The RISC Achievement \\
                 References \\
                 6: Achievements and Challenges in VLSI Processor Design
                 \\
                 A Temporary Relaxation of Constraints \\
                 A Landmark Reached \\
                 Sending Signals Across Chip Boundaries \\
                 IBM RS6000 \\
                 Memory Bandwidth \\
                 Branch Prediction and Speculative Execution \\
                 Dual Processors \\
                 Continued Use of Mainframes \\
                 The Decline of ECL \\
                 References \\
                 7: It's All Software Now! Printed Circuit Boards Design
                 Rules for Silicon \\
                 High Performance Processors \\
                 Tools or Scaffolding? \\
                 The Place of Formal Theory \\
                 CAD/CAM \\
                 References \\
                 8: The Lure or Parallelism and Its Problems \\
                 Multiprocessors and Multicomputers \\
                 Data Flow \\
                 Achieving Speed by Parallelism \\
                 Not a Matter of Repeating a Success \\
                 When the Development of Parallel Programs Is Worthwhile
                 \\
                 The Importance of Fast Serial Performance \\
                 Outlook \\
                 References \\
                 Part III: Software \\
                 9: Software and the Programmer \\
                 Programmers and Software Engineers \\
                 Intellectual Stiffening. Engineering Schools and
                 Computer Studies \\
                 References \\
                 10: From FORTRAN and ALGOL to Object-Oriented Languages
                 \\
                 Programming Languages as a Scientific Study \\
                 Compatibility \\
                 References \\
                 11: Operating Systems in a Changing World \\
                 Lessons Learned and Experience Gained \\
                 Research Directions \\
                 References \\
                 12: Artificial Intelligence as the Year 2000 Approaches
                 \\
                 Expert Systems and Turing's Dream \\
                 The Brain: Digital or Analog? \\
                 References \\
                 13: Software and Industrial Research \\
                 A Switch to Software Research \\
                 Collaboration in Research \\
                 Part IV: Communications \\
                 14: Computer Networks and the Bandwidth Famine \\
                 Wide Area Networks \\
                 Local Area Networks \\
                 Current Developments \\
                 References \\
                 15: Email and Its Competitors \\
                 Fax \\
                 References \\
                 16: Light Amplifiers and Solitons \\
                 Submarine Cables \\
                 Nonlinearity as an Ally \\
                 Solitons in Optical Fibers \\
                 Higher Order Solitons \\
                 The Practical Outlook for Solitons \\
                 References \\
                 Part V: Computer Security \\
                 17: Computer Security in the Business World-
                 Time-Sharing Systems \\
                 The Nature of Information \\
                 References \\
                 18: Computer Security in the Business World-Distributed
                 Systems.",
  ZBmath =       "732224",
}

@Book{Will:1986:WER,
  author =       "Clifford M. Will",
  title =        "Was {Einstein} Right?: Putting {General Relativity} to
                 the Test",
  publisher =    pub-BASIC-BOOKS,
  address =      pub-BASIC-BOOKS:adr,
  pages =        "xii + 274 + 8",
  year =         "1986",
  ISBN =         "0-465-09088-5",
  ISBN-13 =      "978-0-465-09088-4",
  LCCN =         "QC173.6 .W55 1986",
  bibdate =      "Wed Dec 24 13:11:58 MST 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  price =        "US\$18.95",
  abstract =     "Looks at how scientists have tested Einstein's theory
                 during the past seventy years, and demonstrates how
                 this theory is crucial to understanding such features
                 of the universe as pulsars, quasars, and black holes.",
  acknowledgement = ack-nhfb,
  author-dates = "1946--",
  remark =       "This book discusses results of experiments made to
                 test the predictions of General Relativity.",
  subject =      "General relativity (Physics); Astrophysics",
  subject =      "General relativity (Physics); Astrophysics;
                 Relativit{\'e} g{\'e}n{\'e}rale (Physique);
                 Astrophysique; Allgemeine Relativit{\"a}tstheorie;
                 Test; Astrophysics; General relativity (Physics)",
  tableofcontents = "Renaissance of general relativity \\
                 Straight road to curved space-time \\
                 Gravitational red shift of light and clocks \\
                 Departure of light from the straight and narrow \\
                 Perihelion shift of Mercury: triumph or trouble? \\
                 Time delay of light: better late than never \\
                 Do the Earth and the moon fall the same? \\
                 Rise and fall of the Brans-Dicke theory \\
                 Is the gravitational constant constant? \\
                 Binary pulsar: gravity waves exist! \\
                 Frontiers of experimental relativity \\
                 Astronomy after the renaissance: is general relativity
                 useful?",
}

@Book{Willard:1965:IMA,
  author =       "Hobart H. Willard and Lynne L. {Merritt, Jr.} and John
                 A. Dean",
  title =        "Instrumental Methods of Analysis",
  publisher =    pub-VAN-NOSTRAND-REINHOLD,
  address =      pub-VAN-NOSTRAND-REINHOLD:adr,
  edition =      "Fourth",
  pages =        "xviii + 784",
  year =         "1965",
  LCCN =         "QD61 .W48 1965",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Article{Williams:1948:EDC,
  author =       "F. C. Williams and T. Kilburn",
  title =        "Electronic digital computers",
  journal =      j-NATURE,
  volume =       "162",
  number =       "4117",
  pages =        "487--487",
  day =          "25",
  month =        sep,
  year =         "1948",
  CODEN =        "NATUAS",
  DOI =          "https://doi.org/10.1038/162487a0",
  ISSN =         "0028-0836 (print), 1476-4687 (electronic)",
  ISSN-L =       "0028-0836",
  bibdate =      "Wed Oct 13 12:00:02 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Reprinted in \cite[\S 8.4]{Randell:1982:ODC}.",
  URL =          "http://www.nature.com/nature/journal/v162/n4117/pdf/162487a0.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Nature",
  journal-URL =  "http://www.nature.com/nature/archive/",
}

@Book{Williams:1997:HCT,
  author =       "Michael R. Williams",
  title =        "A History of Computing Technology",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "xi + 426",
  year =         "1997",
  ISBN =         "0-8186-7739-2 (hardcover)",
  ISBN-13 =      "978-0-8186-7739-7 (hardcover)",
  LCCN =         "QA76.17.W56 1997",
  bibdate =      "Wed Jan 27 06:33:19 1999",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/babbage-charles.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "IEEE catalog number BP07739.",
  price =        "US\$49.00",
  abstract =     "The book describes historical aspects of calculation
                 and concentrates on the physical devices used to aid
                 people in their attempts at automating the arithmetic
                 process. A History of Computing Technology highlights
                 the major advances in arithmetic from the beginning of
                 counting, through the three most important developments
                 in the subject: the invention of the zero, logarithms,
                 and the electronic computer. It provides you with an
                 understanding of how these ideas developed and why the
                 latest tools are in their current forms. In addition,
                 it tells many of the interesting stories about both the
                 machines and the scientists who produced them. It
                 focuses on the extraordinary accomplishments of those
                 computer pioneers whose work will stand as proof of
                 their genius and hard work.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  tableofcontents = "In the beginning \\
                 Early aids to calculation \\
                 Mechanical calculating machines \\
                 The Babbage machines \\
                 The analog animals \\
                 The mechanical monsters \\
                 The electronic revolution \\
                 The first stored program electronic computers \\
                 Later developments \\
                 Appendix \\
                 Index",
}

@Book{Wilson:1995:IF,
  author =       "Alistair Macintosh Wilson",
  title =        "The infinite in the finite",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  pages =        "524",
  year =         "1995",
  ISBN =         "0-19-853950-9",
  ISBN-13 =      "978-0-19-853950-6",
  LCCN =         "QA21 .W385 1995",
  bibdate =      "Tue Dec 11 18:24:32 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 jenson.stanford.edu:2210/unicorn",
  price =        "US\$37.50",
  URL =          "http://www.myilibrary.com?id=90331",
  acknowledgement = ack-nhfb,
  subject =      "Mathematics; History",
  tableofcontents = "1. Symphonies of stone \\
                 2. The pyramid builders \\
                 3. The Theban Mysteries \\
                 4. Babylon \\
                 5. The Middle Kingdom \\
                 6. The Achaeans \\
                 7. A World made of numbers \\
                 8. The thoughts of Zeus \\
                 9. The philosopher's criticism \\
                 10. The Elements of Euclid \\
                 11. An island interlude \\
                 12. Proportion \\
                 13. The Divine Archimedes \\
                 14. Apollonius the great geometer \\
                 15. The science of numbers \\
                 16. The School of Alexandria \\
                 17. The dark subcontinent of India \\
                 18. The contribution of Islam \\
                 Index",
}

@Book{Wilson:2002:FCS,
  author =       "Robin J. Wilson",
  title =        "Four Colors Suffice: How the Map Problem Was Solved",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "xii + 262",
  year =         "2002",
  ISBN =         "0-691-11533-8",
  ISBN-13 =      "978-0-691-11533-7",
  LCCN =         "QA612.19 .W56 2002",
  bibdate =      "Mon Apr 20 16:39:12 MDT 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0654/2002114311-d.html;
                 http://www.loc.gov/catdir/toc/prin051/2002114311.html",
  acknowledgement = ack-nhfb,
  remark =       "First published 2002 by Penguin Group, London.",
  subject =      "Four-Color Problem; history; mathematical
                 recreations",
  tableofcontents = "The four-colour problem \\
                 The problem is posed \\
                 Euler's famous formula \\
                 Cayley revives the problem \ldots{} \\
                 \ldots{} And Kempe solves it \\
                 A chapter of accidents \\
                 A bombshell from Durham \\
                 Crossing the Atlantic \\
                 A new dawn breaks \\
                 Success! \\
                 \ldots{} but is it a proof?",
}

@Book{Wilson:2015:MHE,
  author =       "Edward O. Wilson",
  title =        "The Meaning of Human Existence",
  publisher =    "Liveright Publishing Corporation",
  address =      "New York, NY, USA",
  pages =        "208 (est.)",
  year =         "2015",
  ISBN =         "1-63149-114-8 (paperback)",
  ISBN-13 =      "978-1-63149-114-6 (paperback)",
  LCCN =         "BD450 .W5225 2015",
  bibdate =      "Wed Dec 30 17:07:00 MST 2015",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  subject =      "Philosophical anthropology; Philosophical
                 anthropology.",
  tableofcontents = "I. The Reason We Exist \\
                 1. The meaning of meaning \\
                 2. Solving the riddle of the human species \\
                 3. Evolution and our inner conflict \\
                 II. The Unity of Knowledge \\
                 4. The new enlightenment \\
                 5. The all-importance of the humanities \\
                 6. The driving force of social evolution \\
                 III. Other Worlds \\
                 7. Humanity lost in a pheromone world \\
                 8. The superorganisms \\
                 9. Why microbes rule the galaxy \\
                 10. A portrait of E. T. \\
                 11. The collapse of biodiversity \\
                 IV. Idols of the Mind \\
                 12. Instinct \\
                 13. Religion \\
                 14. Free will \\
                 V. A Human Future \\
                 15. Alone and free in the universe \\
                 Appendix",
}

@Book{Winchester:1998:PMT,
  author =       "Simon Winchester",
  title =        "The Professor and the Madman: a Tale of Murder,
                 Insanity, and the Making of the {Oxford English}
                 Dictionary",
  publisher =    pub-HARPERCOLLINS,
  address =      pub-HARPERCOLLINS:adr,
  pages =        "xi + 242",
  year =         "1998",
  ISBN =         "0-06-017596-6, 0-06-083978-3 (paperback),
                 0-06-099486-X (paperback)",
  ISBN-13 =      "978-0-06-017596-2, 978-0-06-083978-9 (paperback),
                 978-0-06-099486-0 (paperback)",
  LCCN =         "PE1617.O94 W56 1998",
  bibdate =      "Sun Oct 25 07:54:49 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$23.00",
  abstract =     "The making of the Oxford English Dictionary was a
                 monumental 50 year task requiring thousands of
                 volunteers. One of the keenest volunteers was a W C
                 Minor who astonished everyone by refusing to come to
                 Oxford to receive his congratulations. In the end,
                 James Murray, the OED's editor, went to Crowthorne in
                 Berkshire to meet him. What he found was incredible ---
                 Minor was a millionaire American civil war surgeon
                 turned lunatic, imprisoned in Broadmoor Asylum for
                 murder and yet who dedicated his entire cell-bound life
                 to work on the English language.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subjects =     "Murray, James Augustus Henry, Sir, 1837--1915 ---
                 Friends and associates; Minor, William Chester; Oxford
                 English dictionary; New English dictionary on
                 historical principles; Psychiatric hospital patients
                 --- Great Britain --- Biography; Lexicographers ---
                 Great Britain --- Biography; English language ---
                 Lexicography; English language --- Etymology; United
                 States --- History --- Civil War, 1861--1865 ---
                 Veterans --- Biography",
  tableofcontents = "1: The dead of night in Lambeth Marsh \\
                 2: The man who taught Latin to cattle \\
                 3: The madness of war \\
                 4: Gathering Earth's daughters \\
                 5: The big dictionary conceived \\
                 6: The scholar in cell block two \\
                 7: Entering the lists \\
                 8: Annulated, art, brick-tea, buckwheat \\
                 9: The meeting of minds \\
                 10: The unkindest cut \\
                 11: Then only the monuments",
}

@Book{Winchester:2001:MCW,
  author =       "Simon Winchester",
  title =        "The Map That Changed the World: {William Smith} and
                 the Birth of Modern Geology",
  publisher =    pub-HARPERCOLLINS,
  address =      pub-HARPERCOLLINS:adr,
  pages =        "xix + 329",
  year =         "2001",
  ISBN =         "0-00-639422-1 (paperback), 0-06-019361-1 (hardcover),
                 0-14-028039-1 (paperback), 0-670-88407-3",
  ISBN-13 =      "978-0-00-639422-8 (paperback), 978-0-06-019361-4
                 (hardcover), 978-0-14-028039-5 (paperback),
                 978-0-670-88407-0",
  LCCN =         "QE22.S6 W55 2001",
  bibdate =      "Mon Aug 27 09:37:44 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$26.00",
  abstract =     "The fascinating story of William Smith, the orphaned
                 son of an English country blacksmith, who became
                 obsessed with creating the world's first geological map
                 and ultimately became the father of modern geology.
                 \booktitle{The Map That Changed the World} is, at its
                 foundation, a very human tale of endurance and
                 achievement, of one man's dedication in the face of
                 ruin and homelessness. The world's coal and oil
                 industry, its gold mining, its highway systems, and its
                 railroad routes were all derived entirely from the
                 creation of Smith's first map.; and with a keen eye and
                 thoughtful detail, Simon Winchester unfolds the
                 poignant sacrifice behind this world-changing
                 discovery.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1. Escape on the Northbound Stage \\
                 2. A Land Awakening from Sleep \\
                 3. The Mystery of the Chedworth Bun \\
                 4. The Duke and the Baronet's Widow \\
                 5. A Light in the Underworld \\
                 6. The Slicing of Somerset \\
                 7. The View from York Minster \\
                 8. Notes from the Swan \\
                 9. The Dictator in the Drawing Room \\
                 10. The Great Map Conceived \\
                 11. A Jurassic Interlude \\
                 12. The Map That Changed in World \\
                 13. An Ungentlemanly Act \\
                 14. The Sale of the Century \\
                 15. The Wrath of Leviathan \\
                 16. The Lost and Found Man \\
                 17. All Honor to the Doctor",
}

@Book{Winchester:2003:KDW,
  author =       "Simon Winchester",
  title =        "{Krakatoa}: the Day the World Exploded, {August 27,
                 1883}",
  publisher =    pub-HARPERCOLLINS,
  address =      pub-HARPERCOLLINS:adr,
  pages =        "xvi + 416",
  year =         "2003",
  ISBN =         "0-06-621285-5",
  ISBN-13 =      "978-0-06-621285-2",
  LCCN =         "QE523.K73 W56",
  bibdate =      "Fri Oct 24 15:21:52 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$25.95",
  abstract =     "[In this book, the author] examines the enduring and
                 world-changing effects of the catastrophic eruption off
                 the coast of Java of the earth's most dangerous volcano
                 --- Krakatoa. The legendary annihilation in 1883 of the
                 volcano-island of Krakatoa --- the name has since
                 become a byword for a cataclysmic disaster --- was
                 followed by an immense tsunami that killed nearly forty
                 thousand people. Beyond the purely physical horrors of
                 an event that has only very recently been properly
                 understood, the eruption changed the world in more ways
                 than could possibly be imagined. Dust swirled round die
                 planet for years, causing temperatures to plummet and
                 sunsets to turn vivid with lurid and unsettling
                 displays of light. The effects of the immense waves
                 were felt as far away as France. Barometers in Bogota
                 and Washington, D.C., went haywire. Bodies were washed
                 up in Zanzibar. The sound of the island's destruction
                 was heard in Australia and India and on islands
                 thousands of miles away. Most significant of all --- in
                 view of today's new political climate --- the eruption
                 helped to trigger in Java a wave of murderous
                 anti-Western militancy among fundamentalist Muslims:
                 one of the first outbreaks of Islamic-inspired killings
                 anywhere. [The author's] long experience in the world
                 wandering as well as his knowledge of history and
                 geology give us an entirely new perspective on this
                 fascinating and iconic event as he brings it telling
                 back to life.",
  acknowledgement = ack-nhfb,
  tableofcontents = "List of illustrations and maps \\
                 Prelude \\
                 1: ``An island with a pointed mountain'' \\
                 2: The crocodile in the canal \\
                 3: Close encounters on the Wallace Line \\
                 4: The moments when the mountain moved \\
                 5: The unchaining of the gates of Hell \\
                 6: A league from the last of the sun \\
                 7: The curious case of the terrified elephant \\
                 8: The paroxysm, the flood, and the crack of doom \\
                 9: Rebellion of a ruined people \\
                 10: The rising of the son \\
                 Epilogue: the place the world exploded \\
                 Recommendations for (and, in one case, against) further
                 reading and viewing \\
                 Acknowledgments, erkenningen, Terima Kasih \\
                 Index",
}

@Book{Winchester:2003:MES,
  author =       "Simon Winchester",
  title =        "The Meaning of Everything: The Story of the {Oxford
                 English Dictionary}",
  publisher =    pub-HARPERCOLLINS,
  address =      pub-HARPERCOLLINS:adr,
  pages =        "xxv + 260",
  year =         "2003",
  ISBN =         "0-19-860702-4",
  ISBN-13 =      "978-0-19-860702-1",
  LCCN =         "PE1617.O94 W565 2003",
  bibdate =      "Fri Oct 24 15:23:55 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$25.00",
  abstract =     "Writing with marvelous brio, Winchester first serves
                 up a lightning history of the English language --- so
                 vast, so sprawling, so wonderfully unwieldy --- And
                 pays homage to the great dictionary makers, from ``the
                 irredeemably famous'' Samuel Johnson to the ``short,
                 pale, smug and boastful'' schoolmaster from New
                 Hartford, Noah Webster. He then turns his unmatched
                 talent for story-telling to the making of this most
                 venerable of dictionaries. In this fast-paced
                 narrative, the reader will discover lively portraits of
                 such key figures as the brilliant but tubercular first
                 editor Herbert Coleridge (grandson of the poet), the
                 colorful, boisterous Frederick Furnivall (who left the
                 project in a shambles), and James Augustus Henry
                 Murray, who spent a half-century bringing the project
                 to fruition.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Acknowledgements \\
                 List of Illustrations \\
                 Prologue \\
                 i. Taking the Measure of It All \\
                 2. The Construction of the Pigeon-Holes \\
                 3. The General Officer Commanding \\
                 4. Battling with the Undertow \\
                 5. Pushing through the Untrodden Forest \\
                 6. So Heavily Goes the Chariot \\
                 7. The Hermit and the Murderer and Hereward Thimbleby
                 Price \\
                 8. From Take to Turn-down and then, Triumphal
                 Valediction \\
                 Epilogue: And Always Beginning Again \\
                 Bibliography and Further Reading \\
                 Index \\
                 Picture Acknowledgements",
}

@Book{Winchester:2005:CEW,
  author =       "Simon Winchester",
  title =        "A Crack in the Edge of the World: {America} and the
                 Great {California} Earthquake of 1906",
  publisher =    pub-HARPERCOLLINS,
  address =      pub-HARPERCOLLINS:adr,
  pages =        "xiv + 462",
  year =         "2005",
  ISBN =         "0-06-057199-3 (hardcover), 0-7394-6835-9 (paperback),
                 0-06-083628-8 (ARE), 1-59722-187-2 (large print)",
  ISBN-13 =      "978-0-06-057199-3 (hardcover), 978-0-7394-6835-7
                 (paperback), 978-0-06-083628-3 (ARE), 978-1-59722-187-0
                 (large print)",
  LCCN =         "F869.S357 W56 2005",
  bibdate =      "Tue Oct 11 05:00:46 MDT 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "An informative exploration of earthquakes places a
                 particular focus on the San Francisco disaster of 1906,
                 describing how it affected more than two hundred miles
                 of California, triggered a vast firestorm, and
                 destroyed the gold-rush capital.",
  acknowledgement = ack-nhfb,
  subject =      "San Francisco Earthquake, Calif., 1906; Earthquakes;
                 California; San Francisco; History; 20th century; San
                 Francisco (Calif.); History; 20th century",
  tableofcontents = "Chronicle: a year of living dangerously \\
                 The temporary city \\
                 Chronicle: such almost modern times \\
                 From plate to shining plate \\
                 Chronicle: the state of the golden state \\
                 How the west was made \\
                 The mischief maker \\
                 Chronicle: city of mint and smoke \\
                 Overture: the night before dark \\
                 The savage interruption \\
                 Ripples on the surface of the pond \\
                 Perspective: ice and fire \\
                 Appendix: on getting an earthquake's measure",
}

@Book{Winchester:2008:MWL,
  author =       "Simon Winchester",
  title =        "The Man Who Loved {China}: the Fantastic Story of the
                 Eccentric Scientist Who Unlocked the Mysteries of the
                 {Middle Kingdom}",
  publisher =    "Harper",
  address =      "New York, NY, USA",
  pages =        "xii + 316",
  year =         "2008",
  ISBN =         "0-06-088459-2",
  ISBN-13 =      "978-0-06-088459-8",
  LCCN =         "Q143.N44 W56 2008",
  bibdate =      "Thu Sep 18 21:37:27 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "The extraordinary story of Joseph Needham, the
                 brilliant Cambridge scientist who unlocked the most
                 closely held secrets of China---long the world's most
                 technologically advanced country. This married
                 Englishman, a freethinking intellectual, while working
                 at Cambridge University in 1937, fell in love with a
                 visiting Chinese student, with whom he began a lifelong
                 affair. He became fascinated with China, and embarked
                 on a series of extraordinary expeditions to the
                 farthest frontiers of this ancient empire. He searched
                 everywhere for evidence to bolster his conviction that
                 the Chinese were responsible for hundreds of mankind's
                 most familiar innovations---including printing, the
                 compass, explosives, suspension bridges, even toilet
                 paper---often centuries before the rest of the world.
                 His dangerous journeys took him across war-torn China
                 to far-flung outposts, consolidating his deep
                 admiration for the Chinese people. After the war,
                 Needham began writing what became a seventeen-volume
                 encyclopedia, Science and Civilisation in China.",
  acknowledgement = ack-nhfb,
  subject =      "Needham, Joseph; Scientists; Great Britain; Biography;
                 Science and civilisation in China; Science; China;
                 History",
  subject-dates = "1900--1995; 1900--1995.",
  tableofcontents = "1: The Barbarian and the Celestial / 19 \\
                 2: Bringing Fuel in Snowy Weather / 101 \\
                 3: The Discovering of China / 160 \\
                 4: The Rewards of Restlessness / 219 \\
                 5: The Making of His Masterpiece / 279 \\
                 6: Persona Non Grata: The Certain Fall from Grace / 331
                 \\
                 7: The Passage to the Gate / 361 \\
                 Appendix I: Chinese Inventions and Discoveries with
                 Dates of First Mention / 443 \\
                 Appendix II: States, Kingdoms, and Dynasties of China /
                 454",
}

@Book{Winchester:2011:AGS,
  author =       "Simon Winchester",
  title =        "{Atlantic}: Great Sea Battles, Heroic Discoveries,
                 Titanic Storms, and a Vast Ocean of a Million Stories",
  publisher =    "Harper Perennial",
  address =      "New York, NY, USA",
  pages =        "xii + 495 + 16",
  year =         "2011",
  ISBN =         "0-06-170258-7 (hardcover), 0-06-170262-5 (paperback)",
  ISBN-13 =      "978-0-06-170258-7 (hardcover), 978-0-06-170262-4
                 (paperback)",
  LCCN =         "GC481 .W56 2011",
  bibdate =      "Wed Dec 30 17:01:35 MST 2015",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Until a thousand years ago, no humans ventured into
                 the Atlantic or imagined traversing its vastness. But
                 once the first daring mariners successfully navigated
                 to far shores, whether it was the Vikings, the Irish,
                 the Chinese, Christopher Columbus in the north, or the
                 Portuguese and the Spanish in the south, the Atlantic
                 evolved in the world's growing consciousness of itself
                 as an enclosed body of water bounded by the Americas to
                 the West, and by Europe and Africa to the East. This
                 book is a biography of this immense space, of a sea
                 which has defined and determined so much about the
                 lives of the millions who live beside or near its tens
                 of thousands of miles of coast. The Atlantic has been
                 central to the ambitions of explorers, scientists and
                 warriors, and it continues to affect our character,
                 attitudes, and dreams. The author chronicles that
                 relationship, making the Atlantic come vividly alive.",
  acknowledgement = ack-nhfb,
  remark =       "Includes information about the author, a postscript
                 (``An ocean of memories''), and brief descriptions of
                 other books by Simon Winchester.",
  subject =      "Winchester, Simon; Travel; Winchester, Simon; Ocean
                 and civilization; Geography; Ocean and civilization;
                 Travel; Atlantic Ocean; Geography; History; Folklore;
                 Description and travel",
  tableofcontents = "Preface: The leaving of Liverpool \\
                 Prologue: The beginnings of its goings on \\
                 From the purple isles of Mogador \\
                 All the shoals and deeps within \\
                 Oh! the beauty and the might of it \\
                 Here the sea of pity lies \\
                 They that occupy their business on great waters \\
                 Change and decay all around the sea \\
                 The storm surge carries all before \\
                 Epilogue: Falls the shadow, fades the sea \\
                 A glossary of possibly unfamiliar terms",
}

@Book{Winchester:2014:MWU,
  author =       "Simon Winchester",
  title =        "The Men who United the States: {America}'s Explorers,
                 Inventors, Eccentrics, and Mavericks, and the Creation
                 of One Nation, Indivisible",
  publisher =    "Harper Perennial",
  address =      "New York, NY, USA",
  pages =        "xxv + 463",
  year =         "2014",
  ISBN =         "0-06-207961-1 (paperback)",
  ISBN-13 =      "978-0-06-207961-9 (paperback)",
  LCCN =         "E178 W759 2014",
  bibdate =      "Wed Dec 30 16:59:27 MST 2015",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Illuminates the men who toiled fearlessly to discover,
                 connect, and bond the citizenry and geography of the
                 U.S.A. from its beginnings and ponders whether the
                 historic work of uniting the States has succeeded, and
                 to what degree.",
  acknowledgement = ack-nhfb,
  remark =       "Comprend un index.",
  subject =      "Explorateurs; {\'E}tats-Unis; Inventeurs; Inventions;
                 Excentriques; Histoire; Biographies",
  tableofcontents = "The pure physics of union \\
                 Part I. When America's story was dominated by wood,
                 1785--1805: A view across the ridge \\
                 Drawing a line in the sand \\
                 Peering through the trees \\
                 The frontier and the thesis \\
                 The wood was become grass \\
                 Encounters with the Sioux \\
                 First lady of the plains \\
                 High plains rafters \\
                 Passing the gateway \\
                 Shoreline passage \\
                 Part II. When America's story went beneath the Earth,
                 1809--1901: The lasting benefit of harmony \\
                 The science that changed America \\
                 Drawing the colors of rocks \\
                 The wellspring of knowledge \\
                 The tapestry of underneath \\
                 Setting the lures \\
                 Off to see the elephant \\
                 The west, revealed \\
                 The singular first adventure of Kapurats \\
                 The men who gave us Yellowstone \\
                 Diamonds, sex, and race \\
                 Part III. When the American story traveled by water,
                 1803--1900: Journeys to the fall line \\
                 The streams beyond the hills \\
                 The pivot and the feather \\
                 The first big dig \\
                 The wedded waters of New York \\
                 The linkman cometh \\
                 That ol' man river \\
                 Part IV. When the American story was fanned by fire,
                 1811--1956: May the roads rise up \\
                 Rain, steam, and speed \\
                 The annihilation of the in-between \\
                 The immortal legacy of Crazy Judah \\
                 Colonel Eisenhower's epiphanic expedition \\
                 The colossus of roads \\
                 And then we looked up \\
                 The twelve-week crossing \\
                 Part V. When the American story was told through metal,
                 1835-tomorrow: To go, but not to move \\
                 The man who tamed the lightning \\
                 The signal power of human speech \\
                 With power for one and all \\
                 Lighting the corn, powering the prairie \\
                 The talk of the nation \\
                 Making money from air \\
                 Television: the irresistible force \\
                 The all of some knowledge",
}

@Book{Winchester:2015:PSC,
  author =       "Simon Winchester",
  title =        "{Pacific}: Silicon Chips and Surfboards, Coral Reefs
                 and Atom Bombs, Brutal Dictators, Fading Empires, and
                 the Coming Collision of the World's Superpowers",
  publisher =    pub-HARPERCOLLINS,
  address =      pub-HARPERCOLLINS:adr,
  pages =        "xiv + 492",
  year =         "2015",
  ISBN =         "0-06-231541-2 (hardcover), 0-06-231542-0 (softcover),
                 0-06-244073-X, 0-06-244687-8, 0-06-242163-8",
  ISBN-13 =      "978-0-06-231541-0 (hardcover), 978-0-06-231542-7
                 (softcover), 978-0-06-244073-0, 978-0-06-244687-9,
                 978-0-06-242163-0",
  LCCN =         "GC771 .W56 2015",
  bibdate =      "Wed Dec 30 16:56:54 MST 2015",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "The New York Times best-selling author of The Men Who
                 United the States traces the geological history of the
                 Pacific Ocean to assess its relationship with humans
                 and indelible role in the modern world. A colorful and
                 provocative exploration of the modern Pacific
                 Ocean--what it has been, and the grip it holds on our
                 future. Simon Winchester tackles this ``oceanic
                 behemoth of eye-watering complexity'' by focusing on
                 key moments since 1950 that speak to the greater trends
                 and larger truths about the ocean's significance to us
                 today. He leads us from the Bering Strait to Cape Horn,
                 the Yangtze River to the Panama Canal, and to the many
                 small islands in between. He recounts the atomic tests
                 on Bikini, which created a surreal landscape that must
                 still be left vacant. He takes us to the launch of
                 ``Gidget'' and her surfboards, which would forever
                 change how the world's youth views a rising wave.
                 Pacific also tells the story of the transistor radio
                 and how it sparked the digital revolution, from Japan
                 to Silicon Valley, altering the ocean's destiny.
                 Winchester includes tales of alarming discoveries on
                 the Great Barrier Reef and grand expeditions to
                 mysterious vents on the ocean's floor. He examines the
                 geopolitical shifts that shaped the ocean's vast land
                 areas and addresses the environmental degradation and
                 climate shifts that now threaten this majestic body of
                 water. Along the way, he looks at the political turmoil
                 in Australia, the relationship between the Koreas, and
                 recent confrontations that engaged China and the United
                 States. Calling upon Winchester's many journeys
                 throughout the Pacific and its surrounding areas, his
                 formidable historical understanding, and his singular
                 talent for storytelling, Pacific is a paean to this
                 magnificent sea of beauty and myth that has long
                 captured the imagination.",
  acknowledgement = ack-nhfb,
  subject =      "Winchester, Simon; Travel; Winchester, Simon; Ocean
                 and civilization; Geography; Ocean and civilization;
                 Travel; Pacific Ocean; Geography; History; Description
                 and travel",
  tableofcontents = "The great thermonuclear sea \\
                 Mr. Ibuka's radio revolution \\
                 The ecstasies of wave-riding \\
                 A dire and dangerous irritation \\
                 Farewell, all my friends and foes \\
                 Echoes of distant thunder \\
                 How goes the lucky country? \\
                 The fires in the deep \\
                 A fragile and uncertain sea \\
                 Of masters and commanders \\
                 Epilogue: the call of the running tide",
}

@Book{Winchester:2018:PHP,
  author =       "Simon Winchester",
  title =        "The Perfectionists: How Precision Engineers Created
                 the Modern World",
  publisher =    "Harper",
  address =      "New York, NY, USA",
  pages =        "xii + 395",
  year =         "2018",
  ISBN =         "0-06-265255-9 (hardcover)",
  ISBN-13 =      "978-0-06-265255-3 (hardcover)",
  LCCN =         "TA19 .W56 2018",
  bibdate =      "Wed Jan 2 08:01:14 MST 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "The revered New York Times bestselling author traces
                 the development of technology from the Industrial Age
                 to the Digital Age to explore the single component
                 crucial to advancement --- precision --- in a superb
                 history that is both an homage and a warning for our
                 future. Precision is so essential a component of modern
                 human life and existence that we seldom stop to think
                 about it. [This book] examines the relatively recent
                 development of the notion of precision --- the people
                 who developed it and the ways in which it has shaped
                 the modern world --- and the challenges posed and
                 losses risked by our veneration and pursuit of
                 increasingly precise tools and methods. The history of
                 precision as a concept and in practice begins in
                 England with its originators: John Wilkinson, Henry
                 Maudslay, Joseph Bramah, Jesse Ramsden, and Joseph
                 Whitworth. It was Thomas Jefferson who first exported
                 their discoveries to the fledgling United States,
                 setting the nation on its course to become a
                 manufacturing titan. At the dawn of the Industrial
                 Revolution, standards of measurement were established,
                 giving way to the development of machine tools ---
                 machines that make machines. Eventually, the
                 application of precision tools and methods in the
                 development of guns, glass, mirrors, lenses, and
                 cameras gave way to further advancements, including
                 gene splicing, microchips, and the Hadron Collider. The
                 fundamental questions at the heart of The
                 Perfectionists are these: Why is precision important?
                 What are the different tools we use to measure it? Who
                 has invented and perfected it? Has the pursuit of the
                 ultraprecise in so many facets of human life blinded us
                 to other things of equal value, such as an appreciation
                 for the age-old traditions of craftsmanship, art, and
                 high culture? Are we missing something that reflects
                 the world as it is, rather than the world as we think
                 we would wish it to be? And can the precise and the
                 natural coexist in society?",
  acknowledgement = ack-nhfb,
  subject =      "Engineering; History; Technological innovations;
                 Machine design; Metrology; Civilization; Modern;
                 Technology and Engineering; History; Technological
                 innovations; Engineering; Machine design; Metrology",
  tableofcontents = "List of illustrations / xi \\
                 Prologue / 1 \\
                 1: Stars, seconds, cylinders, and steam / 23 \\
                 2: Extremely flat and incredibly close / 53 \\
                 3: A gun in every home, a clock in every cabin / 81 \\
                 4: On the verge of a more perfect world / 107 \\
                 5: The irresistible lure of the highway / 129 \\
                 6: Precision and peril, six miles high / 173 \\
                 7: Through a looking glass, distinctly / 215 \\
                 8: Where am I, and what is the time? / 255 \\
                 9: Squeezing beyond boundaries / 275 \\
                 10: On the necessity for equipoise / 307 \\
                 Afterword: The measure of all things / 331 \\
                 Acknowledgments / 357 \\
                 A Glossary of Possibly Unfamiliar Terms / 361 \\
                 Bibliography / 369 \\
                 Index / 375",
}

@Book{Winchester:2025:BGH,
  author =       "Simon Winchester",
  title =        "The Breath of the Gods: the History and Future of the
                 Wind",
  publisher =    "Harper",
  address =      "New York, NY, USA",
  pages =        "xxii + 386",
  year =         "2025",
  ISBN =         "0-06-337445-5 (hardcover), 0-06-337447-1 (e-book)",
  ISBN-13 =      "978-0-06-337445-4 (hardcover), 978-0-06-337447-8
                 (e-book)",
  LCCN =         "QC931 .W563 2025",
  bibdate =      "Sat Dec 13 15:39:16 MST 2025",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "What is going on with our atmosphere? The headlines
                 are filled with news of devastating hurricanes,
                 murderous tornadoes, and cataclysmic fires affecting
                 large swaths of America. Gale force advisories are
                 issued on a regular basis by the National Weather
                 Service. In 2022, a report was released by atmospheric
                 scientists at the University of Northern Illinois,
                 warning that winds --- the force at the center of all
                 these dangerous natural events --- are expected to
                 steadily increase in the years ahead, strengthening in
                 power, speed, and frequency. While this prediction
                 worried the insurance industry, governmental leaders,
                 scientists, and conscientious citizens, one particular
                 segment of society received it with unbridled
                 enthusiasm. To the energy industry, rising wind
                 strength and speeds as an unalloyed boon for humankind
                 a vital source of clean and ''safe`` power. Between
                 these two poles --- wind as a malevolent force, and
                 wind as savior of our planet --- lies a world of
                 fascination, history, literature, science, poetry, and
                 engineering which Simon Winchester explores with the
                 curiosity and vigor that are the hallmarks of his
                 bestselling works. In The Breath of the Gods, he
                 explains how wind plays a part in our everyday lives,
                 from airplane or car travel to the ''natural
                 disasters`` that are becoming more frequent and
                 regular. Between these two poles --- wind as a
                 malevolent force, and wind as savior of our planet ---
                 lies a world of fascination, history, literature,
                 science, poetry, and engineering which Simon Winchester
                 explores with the curiosity and vigor that are the
                 hallmarks of his bestselling works. In The Breath of
                 the Gods, he explains how wind plays a part in our
                 everyday lives, from airplane or car travel to the
                 natural disasters`` that are becoming more frequent.",
  acknowledgement = ack-nhfb,
  subject =      "History; Technology; Histoire; Technologie; history
                 (discipline); History / World; History / Civilization;
                 Technology and Engineering / History",
  tableofcontents = "List of illustrations / xiii \\
                 Prelude: an unexpected occurence at ``The Windiest
                 Place in the World'' / xvii \\
                 Prologue: A feeling for the wind / 1 \\
                 1: Light airs, gentle breezes / 29 \\
                 2: Something in the air / 101 \\
                 3: Robust and working winds / 142 \\
                 4: The poetry of the approximate / 241 \\
                 5: Inclement winds / 269 \\
                 With gratitude / 359 \\
                 Glossary / 361 \\
                 Books I Consulted and Recommended Further Reading / 369
                 \\
                 Index / 373",
}

@Book{Winston:1996:J,
  author =       "Patrick Henry Winston and Sundar Narasimhan",
  title =        "On to {Java}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xi + 329",
  year =         "1996",
  ISBN =         "0-201-49826-X (paperback)",
  ISBN-13 =      "978-0-201-49826-4 (paperback)",
  LCCN =         "QA76.73.J38W56 1996",
  bibdate =      "Wed Aug 21 17:22:13 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/java.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$17.95",
  URL =          "http://www.aw.com/",
  acknowledgement = ack-nhfb,
  keywords =     "Java (Computer program language)",
}

@Book{Wirth:1976:ADS,
  author =       "Niklaus Wirth",
  title =        "Algorithms $+$ Data Structures $=$ Programs",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xvii + 366",
  year =         "1976",
  ISBN =         "0-13-022418-9",
  ISBN-13 =      "978-0-13-022418-7",
  LCCN =         "QA76.6 .W561",
  bibdate =      "Wed Dec 15 10:59:10 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Prentice-Hall Series in Automatic Computation",
  acknowledgement = ack-nhfb,
  subject =      "Computer programming; Data structures (Computer
                 science); Computer algorithms; Computers; Programmation
                 (Informatique); Algorithmes; Structures de donn{\'e}es
                 (Informatique); Computer algorithms; Computer
                 programming; Data structures (Computer science);
                 Programmeren (computers); Datastructuren; Algoritmen;
                 PASCAL; Algorithmus; Datenstruktur; PASCAL
                 (Programmiersprache); Programmiersprache;
                 Programmierung; Softwareentwicklung",
  tableofcontents = "Fundamental data structures \\
                 Sorting \\
                 Recursive algorithms \\
                 Dynamic information structures \\
                 Language structures and compilers",
}

@Book{Wirth:1983:PM,
  author =       "Niklaus Wirth",
  title =        "Programming in {Modula-2}",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Second",
  pages =        "176",
  year =         "1983",
  DOI =          "https://doi.org/10.1007/978-3-642-96757-3",
  ISBN =         "0-387-12206-0 (New York), 3-540-12206-0,
                 3-540-15078-1, 3-642-96757-4 (e-book), 3-642-96759-0
                 (print), 3-642-96880-5 (print)",
  ISBN-13 =      "978-0-387-12206-9 (New York), 978-3-540-12206-7,
                 978-3-540-15078-7, 978-3-642-96757-3 (e-book),
                 978-3-642-96759-7 (print), 978-3-642-96880-8 (print)",
  LCCN =         "QA76.73.M63 W5713 1983",
  bibdate =      "Wed Dec 15 10:59:11 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "This is the third corrected printing of a successful
                 book which first appeared in 1982. It is an
                 introduction to programming in general as well asa
                 manual for programming with the language Modula-2 in
                 particular.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Preface \\
                 1 \\
                 1. Introduction \\
                 2. A first example \\
                 3. A notation to describe the syntax of Modula \\
                 4. Representation of Modula programs \\
                 5. Statements and expressions \\
                 6. Control structures \\
                 7. Elementary data types \\
                 8. Constant and variable declarations \\
                 9. The data structure Array \\
                 2 \\
                 10. Procedures \\
                 11. The concept of locality \\
                 12. Parameters \\
                 13. Function procedures \\
                 14. Recursion \\
                 3 \\
                 15. Type declarations \\
                 16. Enumeration types \\
                 17. Subrange types \\
                 18. Set types \\
                 19. Record types \\
                 20. Records with variant parts \\
                 21. Dynamic data structures and pointers \\
                 22. Procedure types \\
                 4 \\
                 23. Modules \\
                 24. Definition and implementation parts \\
                 25. Program decomposition into modules \\
                 26. Local modules \\
                 27. Sequential input and output \\
                 28. Screen-oriented input and output \\
                 5 \\
                 29. Low-level facilities \\
                 30. Concurrent processes and coroutines \\
                 31. Device handling, concurrency, and interrupts \\
                 Report on the Programming Language Modula-2 \\
                 Appendix 1: The Syntax of Modula-2 \\
                 Appendix 2: Standard Utility Modules \\
                 Terminal \\
                 FileSystem \\
                 InOut \\
                 RealInOut \\
                 Windows \\
                 TextWindows \\
                 GraphicWindows \\
                 CursorMouse \\
                 Menu \\
                 Storage \\
                 MathLib0 \\
                 Appendix 3: The ASCII Character Set \\
                 Appendix 4",
}

@Book{Wirth:1986:ADS,
  author =       "Niklaus Wirth",
  title =        "Algorithms and Data Structures",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "288",
  year =         "1986",
  ISBN =         "0-13-021999-1, 0-13-022005-1",
  ISBN-13 =      "978-0-13-021999-2, 978-0-13-022005-9",
  LCCN =         "QA76.9.D35 W58 1986",
  bibdate =      "Wed Dec 15 10:59:10 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Fundamental data structures \\
                 Sorting \\
                 Recursive algorithms \\
                 Dynamic information structures \\
                 Key transformations (hashing)",
}

@InCollection{Wirth:1990:DLC,
  author =       "Niklaus Wirth",
  title =        "Drawing Lines, Circles, and Ellipses in a Raster",
  crossref =     "Feijen:1990:BOB",
  chapter =      "51",
  pages =        "428--434",
  year =         "1990",
  bibdate =      "Sun Mar 27 17:53:57 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "This paper rederives the Bresenham line and circle
                 drawing algorithms, and then extends the latter to
                 handle ellipses.",
  acknowledgement = ack-nhfb,
}

@Book{Wirth:1992:POD,
  author =       "Niklaus Wirth",
  title =        "{Project Oberon}: The Design of an Operating System
                 and Compiler",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xi + 548",
  year =         "1992",
  ISBN =         "0-201-54428-8",
  ISBN-13 =      "978-0-201-54428-2",
  LCCN =         "QA76.76.O63 W58 1992",
  bibdate =      "Wed Sep 29 18:54:37 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Preface \\
                 1: Historical background and motivation / 1 \\
                 2: Basic concepts and structure of the system / 7 \\
                 3: The tasking system / 26 \\
                 4: The display system / 52 \\
                 5: The text system / 98 \\
                 6: The module loader / 178 \\
                 7: The file system / 194 \\
                 8: Storage layout and management / 240 \\
                 9: Device drivers / 256 \\
                 10: The network / 277 \\
                 11: A dedicated file-distribution, mail, and printer
                 server / 289 \\
                 12: The compiler / 332 \\
                 13: A graphics editor / 456 \\
                 14: Building and maintenance tools / 526 \\
                 Index / 535",
}

@Book{Witten:1994:MGC,
  author =       "Ian H. Witten and Alistair Moffat and Timothy C.
                 Bell",
  title =        "Managing Gigabytes: Compressing and Indexing Documents
                 and Images",
  publisher =    pub-VAN-NOSTRAND-REINHOLD,
  address =      pub-VAN-NOSTRAND-REINHOLD:adr,
  pages =        "xiv + 429",
  year =         "1994",
  ISBN =         "0-442-01863-0",
  ISBN-13 =      "978-0-442-01863-4",
  LCCN =         "TA1637 .W58 1994",
  bibdate =      "Thu May 12 08:02:54 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 https://www.math.utah.edu/pub/tex/bib/hash.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "The software for full-text indexing described in this
                 book, and errata for the book, are available for
                 anonymous ftp from \path=munnari.oz.au= in the
                 directory \path=/pub/mg=.",
  price =        "US\$54.95",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Overview \\
                 2: Text Compression \\
                 3: Indexing \\
                 4: Querying \\
                 5: Index Construction \\
                 6: Image Compression \\
                 7: Textual Images \\
                 8: Mixed Text and Images \\
                 9: Implementation \\
                 10: The Information Explosion \\
                 A: Guide to the mg System",
}

@Book{Witten:1999:MGC,
  author =       "Ian H. Witten and Alistair Moffat and Timothy C.
                 Bell",
  title =        "Managing Gigabytes: Compressing and Indexing Documents
                 and Images",
  publisher =    pub-MORGAN-KAUFMANN,
  address =      pub-MORGAN-KAUFMANN:adr,
  edition =      "Second",
  pages =        "xxxi + 519",
  year =         "1999",
  ISBN =         "1-55860-570-3",
  ISBN-13 =      "978-1-55860-570-1",
  LCCN =         "TA1637 .W58 1994",
  bibdate =      "Thu May 12 08:02:54 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 https://www.math.utah.edu/pub/tex/bib/hash.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$54.95",
  URL =          "ftp://ftp.math.utah.edu/pub/mg/;
                 ftp://ftp.math.utah.edu/pub/mg/mg-1.3x/bibsearch-1.02.tar.gz;
                 ftp://munnari.oz.au:/pub/mg;
                 http://www.cs.mu.oz.au/mg/;
                 http://www.cs.mu.oz.au/~alistair/arith_coder/;
                 http://www.mkp.com/books_catalog/1-55860-570-3.asp;
                 https://www.math.utah.edu/pub/mg/;
                 https://www.math.utah.edu/pub/mg/mg-1.3x/bibsearch-1.02.tar.gz",
  abstract =     "In this fully updated second edition of the highly
                 acclaimed \booktitle{Managing Gigabytes}, authors
                 Witten, Moffat, and Bell continue to provide
                 unparalleled coverage of state-of-the-art techniques
                 for compressing and indexing data. Whatever your field,
                 if you work with large quantities of information, this
                 book is essential reading --- an authoritative
                 theoretical resource and a practical guide to meeting
                 the toughest storage and access challenges. It covers
                 the latest developments in compression and indexing and
                 their application on the Web and in digital libraries.
                 It also details dozens of powerful techniques supported
                 by mg, the authors' own system for compressing,
                 storing, and retrieving text, images, and textual
                 images. Mg's source code is freely available on the
                 Web.",
  acknowledgement = ack-ds # " and " # ack-nhfb,
  tableofcontents = "Overview \\
                 Text compression \\
                 Indexing \\
                 Querying \\
                 Index construction \\
                 Image compression \\
                 Textual images \\
                 Mixed text and images \\
                 Implementation \\
                 The information explosion \\
                 Guide to the MG system \\
                 Guide to the NZDL",
}

@Book{Woit:2006:EWF,
  author =       "Peter Woit",
  title =        "Not Even Wrong: the Failure of String Theory and the
                 Search for Unity in Physical Law",
  publisher =    pub-BASIC-BOOKS,
  address =      pub-BASIC-BOOKS:adr,
  pages =        "xix + 291",
  year =         "2006",
  ISBN =         "0-465-09275-6",
  ISBN-13 =      "978-0-465-09275-8",
  LCCN =         "QC794.6.S85 W65 2006",
  bibdate =      "Mon Jul 05 08:01:09 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  note =         "See critical review \cite{Bergman:2006:BRE}.",
  URL =          "http://www.loc.gov/catdir/toc/ecip0613/2006013933.html",
  acknowledgement = ack-nhfb,
  subject =      "string models; supersymmetry; quantum theory;
                 superstring theories; physical laws",
  tableofcontents = "Particle physics at the turn of the millennium \\
                 The instruments of production \\
                 Quantum theory \\
                 Quantum field theory \\
                 Gauge symmetry and Gauge theories \\
                 The standard model \\
                 Triumph of the standard model \\
                 Problems of the standard model \\
                 Beyond the standard model \\
                 New insights in quantum field theory and mathematics
                 \\
                 String theory: history \\
                 String theory and supersymmetry: an evaluation \\
                 On beauty and difficulty \\
                 Is superstring theory science? \\
                 The Bogdanov affair \\
                 The only game in town: the power and the glory of
                 string theory \\
                 The landscape of string theory \\
                 Other points of view",
}

@TechReport{Wolcott:hershey-fonts,
  author =       "Norman M. Wolcott and Joseph Hilsenrath",
  title =        "A Contribution to Computer Typesetting Techniques.
                 {Tables} of Coordinates for {Hershey}'s Repertoire of
                 Occidental Type Fonts and Graphics Symbols",
  number =       "PB-251 845",
  institution =  "U. S. National Bureau of Standards",
  month =        apr,
  year =         "1976",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "NBS Special Publication 424",
  acknowledgement = ack-nhfb,
}

@Book{Wolfram:1988:MSDa,
  author =       "Stephen Wolfram",
  title =        "{Mathematica}: a System for Doing Mathematics by
                 Computer",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xviii + 749",
  year =         "1988",
  ISBN =         "0-201-19334-5 (hardcover), 0-201-19330-2 (paperback),
                 0-201-51502-4, 0-201-51507-5 (paperback)",
  ISBN-13 =      "978-0-201-19334-3 (hardcover), 978-0-201-19330-5
                 (paperback), 978-0-201-51502-2, 978-0-201-51507-7
                 (paperback)",
  LCCN =         "QA76.95 .W65 1988",
  bibdate =      "Mon Aug 29 09:11:40 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/mathematica.bib",
  note =         "This book was prepared with \TeX{}, \LaTeX{}, and
                 \PS{}.",
  price =        "US\$24.95 (paperback), US\$39.95 (hardcover)",
  ZMnumber =     "0925.65002",
  abstract =     "Mathematica supports numerical, symbolic and graphical
                 computation. It can be used both as an interactive
                 problem-solving environment, and as a modern high-level
                 programming language. On many computer systems,
                 Mathematica also provides interactive documents which
                 mix text, animated graphics and sound with Mathematica
                 input.",
  acknowledgement = ack-bnb # " and " # ack-mz,
  keywords =     "algorithms; languages",
  review =       "ACM CR 8909-0619",
  shorttableofcontents = "Part 1. A practical introduction to
                 Mathematica \\
                 Part 2. Principles of Mathematica \\
                 Part 3. Advanced mathematics in Mathematica",
  subject =      "G.0 Mathematics of Computing, GENERAL \\ G.4
                 Mathematics of Computing, MATHEMATICAL SOFTWARE \\
                 I.1.3 Computing Methodologies, ALGEBRAIC MANIPULATION,
                 Languages and Systems",
}

@Book{Wolfram:1991:MSD,
  author =       "Stephen Wolfram",
  title =        "Mathematica: {A} System for Doing Mathematics by
                 Computer",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Second",
  pages =        "xxii + 961",
  year =         "1991",
  ISBN =         "0-201-51507-5",
  ISBN-13 =      "978-0-201-51507-7",
  LCCN =         "QA76.95 .W65 1991",
  bibdate =      "Wed Dec 15 10:59:12 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Wolfram:1992:MRG,
  author =       "Stephen Wolfram",
  title =        "{Mathematica} Reference Guide",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "305",
  year =         "1992",
  ISBN =         "0-201-51502-4, 0-201-51507-5 (paperback),
                 0-201-19330-2",
  ISBN-13 =      "978-0-201-51502-2, 978-0-201-51507-7 (paperback),
                 978-0-201-19330-5",
  LCCN =         "QA76.95 .W66 1992",
  bibdate =      "Mon Jan 3 12:25:34 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Wonneberger:1988:L,
  author =       "Reinhard Wonneberger",
  title =        "{\LaTeX}",
  publisher =    pub-AWV,
  address =      pub-AWV:adr,
  edition =      "Second",
  pages =        "xiv + 141",
  year =         "1988",
  ISBN =         "3-89319-152-6",
  ISBN-13 =      "978-3-89319-152-9",
  bibdate =      "Wed Jul 6 15:01:56 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  note =         "Reprinted in 1990 and 1991.",
  series =       "Addison-Wesley Kompaktf{\"u}hrer",
  acknowledgement = ack-nhfb,
}

@Misc{Wood:plj,
  author =       "Patrick {Wood, editor}",
  title =        "{{\POSTSCRIPT Language Journal}}",
  howpublished = "Pipeline Associates, Inc., P. O. Box 5763, Parsippany,
                 NJ 07054",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Worsley:1950:ED,
  author =       "B. H. Worsley",
  booktitle =    "Report of a Conference on High Speed Automatic
                 Calculating Machines, {22--25 June 1949}",
  title =        "The {EDSAC} demonstration",
  publisher =    "University Mathematical Laboratory",
  address =      "Cambridge, UK",
  pages =        "12--16",
  month =        jan,
  year =         "1950",
  bibdate =      "Wed Oct 13 11:39:09 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Reprinted in \cite[\S 8.6]{Randell:1982:ODC}.",
  acknowledgement = ack-nhfb,
}

@Book{Wright:1939:GSW,
  author =       "Ernest Vincent Wright",
  title =        "{Gadsby}; a story of over 50,000 words without using
                 the letter ``{E}''",
  publisher =    "Wetzel Publishing Co., Inc.",
  address =      "Los Angeles, CA, USA",
  pages =        "267",
  year =         "1939",
  bibdate =      "Wed Jun 17 15:37:16 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://gadsby.hypermart.net/",
  acknowledgement = ack-nhfb,
}

@Book{Wright:1995:TII,
  author =       "Gary Wright and W. Richard Stevens",
  title =        "{TCP\slash IP} Illustrated: Volume 2. The
                 Implementation",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xxii + 1174",
  year =         "1995",
  ISBN =         "0-201-63354-X",
  ISBN-13 =      "978-0-201-63354-2",
  LCCN =         "TK5105.55 .S74 1994",
  bibdate =      "Fri Dec 22 07:04:17 2000",
  bibsource =    "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/unix.bib",
  price =        "US\$52.75",
  acknowledgement = ack-nhfb,
}

@Book{Wu:1999:PEP,
  author =       "Xingfu Wu",
  title =        "Performance Evaluation, Prediction and Visualization
                 of Parallel Systems",
  volume =       "4",
  publisher =    pub-KLUWER,
  address =      pub-KLUWER:adr,
  pages =        "xxii + 319",
  year =         "1999",
  ISBN =         "0-7923-8462-8, 1-4613-7343-3, 1-4615-5147-1",
  ISBN-13 =      "978-0-7923-8462-5, 978-1-4613-7343-8,
                 978-1-4615-5147-8",
  LCCN =         "QA76.58.W8 1999",
  bibdate =      "Mon May 17 18:10:17 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$130",
  series =       "The Kluwer international series on Asian studies in
                 computer and information science",
  abstract =     "\booktitle{Performance Evaluation, Prediction and
                 Visualization in Parallel Systems} presents a
                 comprehensive and systematic discussion of theoretics,
                 methods, techniques and tools on performance
                 evaluation, prediction and visualization of parallel
                 systems. \booktitle{Performance Evaluation, Prediction
                 and Visualization in Parallel Systems} serves as an
                 excellent reference for researchers, and may be used as
                 a text for advanced courses on the topic.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  tableofcontents = "1: Introduction \\
                 2: Speedup \\
                 3: Scalability \\
                 4: Parallel Performance Measurement and Analysis \\
                 5: Parallel Performance Prediction \\
                 6: Parallel Performance Visualization \\
                 7: Parallel Performance Debugging \\
                 8: Performance Evaluation of Interconnection Networks
                 for Parallel Systems",
}

@Article{Wu:j-CACM-35-10-83,
  author =       "Sun Wu and Udi Manber",
  title =        "Fast Text Searching Allowing Errors",
  journal =      j-CACM,
  volume =       "35",
  number =       "10",
  pages =        "83--91",
  month =        oct,
  year =         "1992",
  bibdate =      "Sat Nov 7 11:31:19 1992",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "This algorithm in this paper is implemented in the
                 \path|agrep| program, publicly available via ANONYMOUS
                 FTP to \path|cs.arizona.edu| in the \path|agrep|
                 subdirectory. See also
                 \cite{Baeza-Yates:j-CACM-35-10-74}.",
  acknowledgement = ack-nhfb,
}

@Book{Wulf:2012:CVR,
  author =       "Andrea Wulf",
  title =        "Chasing {Venus}: the race to measure the heavens",
  publisher =    pub-KNOPF,
  address =      pub-KNOPF:adr,
  pages =        "xxvi + 304",
  year =         "2012",
  ISBN =         "0-307-70017-8 (hardcover), 0-307-95861-2 (e-book)",
  ISBN-13 =      "978-0-307-70017-9 (hardcover), 978-0-307-95861-7
                 (e-book)",
  LCCN =         "QB205.A2 W85 2012",
  bibdate =      "Mon Jun 18 14:33:26 MDT 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "The author of the highly acclaimed Founding Gardeners
                 now gives us an enlightening chronicle of the first
                 truly international scientific endeavor --- the
                 eighteenth-century quest to observe the transit of
                 Venus and measure the solar system. On June 6, 1761,
                 the world paused to observe a momentous occasion: the
                 first transit of Venus between the earth and the sun in
                 more than a century. Through that observation,
                 astronomers could calculate the size of the solar
                 system --- but only if the transit could be viewed at
                 the same time from many locations. Overcoming
                 incredible odds and political strife, astronomers from
                 Britain, France, Russia, Germany, Sweden, and the
                 American colonies set up observatories in remote
                 corners of the world only to have their efforts
                 thwarted by unpredictable weather and warring armies.
                 Fortunately, transits of Venus occur in pairs: eight
                 years later, the scientists were given a second chance
                 to get it right. Chasing Venus brings to life this
                 extraordinary endeavor: the personalities of
                 eighteenth-century astronomy, the collaborations,
                 discoveries, personal rivalries, volatile international
                 politics, and the race to be first to measure the
                 distances between the planets.\par

                 On June 6, 1761, the world paused to observe a
                 momentous occasion: the first transit of Venus between
                 the Earth and the sun in more than a century. Through
                 that observation, astronomers could calculate the size
                 of the solar system --- but only if the transit could
                 be viewed at the same time from many locations.
                 Overcoming incredible odds and political strife,
                 astronomers from Britain, France, Russia, Germany,
                 Sweden, and the American colonies set up observatories
                 in remote corners of the world only to have their
                 efforts thwarted by unpredictable weather and warring
                 armies. Fortunately, transits of Venus occur in pairs:
                 eight years later, the scientists were given a second
                 chance to get it right. Chasing Venus brings to life
                 this extraordinary endeavor: the personalities of
                 eighteenth-century astronomy, the collaborations,
                 discoveries, personal rivalries, volatile international
                 politics, and the race to be first to measure the
                 distances between the planets.",
  acknowledgement = ack-nhfb,
  remark =       "The Venus solar transit of Tuesday 5 June 2012 was
                 expected to be visible in Salt Lake City, which
                 normally enjoys clear skies during much of the year.
                 Alas, heavy clouds hung low in the valley on that
                 single day, obscuring the event. Only near sundown was
                 the final part of the six-hour transit partly visible
                 through the clouds, by which time, most observers
                 (including me) had given up.",
  subject =      "geodetic astronomy; history; 18th century; astronomy;
                 Venus (planet); transit",
  tableofcontents = "The gauntlet \\
                 Transit 1761. Call to action; The French are first;
                 Britain enters the race; To Siberia; Getting ready for
                 Venus; Day of transit, 6 June 1761; How far to the sun?
                 \\
                 Transit 1769. A second change; Russia enters the race;
                 The most daring voyage of all; Scandinavia, or, The
                 Land of the Midnight Sun; The North American continent;
                 Racing to the four corners of the globe; Day of
                 transit, 3 June 1769; After the transit \\
                 A new dawn \\
                 List of observers, 1761 \\
                 List of observers, 1769",
}

@TechReport{Xerox:color,
  author =       "Xerox Corporation",
  title =        "The {Xerox Color Encoding Standard}",
  number =       "XNSS 288811",
  institution =  "Xerox Systems Institute",
  month =        mar,
  year =         "1989",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{xopen:1989:XOS,
  author =       "{X/Open Company, Ltd.}",
  title =        "{X/Open} security guide: programming languages",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "x + 132",
  year =         "1989",
  ISBN =         "0-13-972142-8",
  ISBN-13 =      "978-0-13-972142-7",
  LCCN =         "QA76.9.A25X663 1989",
  bibdate =      "Thu Sep 19 09:12:51 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

@Book{xopen:1992:XOS,
  author =       "{X/Open Company, Ltd.}",
  title =        "{X/Open} systems and branded products: {XPG4}",
  publisher =    pub-X-OPEN,
  address =      pub-X-OPEN:adr,
  pages =        "various",
  year =         "1992",
  ISBN =         "1-872630-52-9",
  ISBN-13 =      "978-1-872630-52-6",
  LCCN =         "QA76.753.X2 X67 1992",
  bibdate =      "Thu Sep 19 09:38:12 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "Part 1. Overview \\
                 Part 2. Component definitions \\
                 Part 3. Profile definitions \\
                 Part 4. Guide to branding \\
                 Part 5. Trade mark licence agreement (TMLA) \\
                 Part 6. Conformance statement questionnaires (CSQs) \\
                 Part 7. XPG3, Branded products list, November 1992
                 [and] XPG4, Branded products list, November 1992 \\
                 Part 8. Publications price list, February 1993",
}

@Book{xopen:1993:XOC,
  author =       "{X/Open Company, Ltd.}",
  title =        "{X-Open CAE} specification: message store {API}
                 ({XMS})",
  publisher =    pub-X-OPEN,
  address =      pub-X-OPEN:adr,
  pages =        "xvi + 192",
  year =         "1993",
  ISBN =         "1-872630-83-9",
  ISBN-13 =      "978-1-872630-83-0",
  LCCN =         "????",
  bibdate =      "Thu Sep 19 09:18:19 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

@Book{xopen:1993:XOD,
  author =       "{X/Open Company, Ltd.}",
  title =        "{X/Open DCE}: remote procedure control",
  publisher =    pub-X-OPEN,
  address =      pub-X-OPEN:adr,
  pages =        "xxvi + 641",
  year =         "1993",
  ISBN =         "1-872630-95-2",
  ISBN-13 =      "978-1-872630-95-3",
  LCCN =         "????",
  bibdate =      "Thu Sep 19 09:34:12 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

@Book{xopen:1993:XOT,
  author =       "{X/Open Company, Ltd.}",
  title =        "{X/Open Transport Interface (XTI)}: version 2",
  publisher =    pub-X-OPEN,
  address =      pub-X-OPEN:adr,
  pages =        "xx + 244",
  year =         "1993",
  ISBN =         "1-872630-97-9",
  ISBN-13 =      "978-1-872630-97-7",
  LCCN =         "TK7887.5 .X2 1994",
  bibdate =      "Thu Sep 19 09:35:15 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

@Book{xopen:1994:XOF,
  author =       "{X/Open Company, Ltd.}",
  title =        "{X-Open} framework and models",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xii + 32",
  year =         "1994",
  ISBN =         "0-13-353442-1",
  ISBN-13 =      "978-0-13-353442-9",
  LCCN =         "QA76.9.D5 X67 1994",
  bibdate =      "Thu Sep 19 09:20:04 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

@Book{xopen:1994:XOG,
  author =       "{X/Open Company, Ltd.}",
  title =        "{X-Open} guide: internationalisation guide, version
                 2",
  publisher =    pub-X-OPEN,
  address =      pub-X-OPEN:adr,
  pages =        "xvi + 180",
  year =         "1994",
  ISBN =         "1-85912-002-4",
  ISBN-13 =      "978-1-85912-002-6",
  LCCN =         "QA76.76.C64 X195 1994",
  bibdate =      "Thu Sep 19 09:17:12 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "1: Introduction \\
                 2: Developing Internationalised Software \\
                 3: The Message System \\
                 4: Internationalisation Support Interfaces \\
                 5: Using Internationalised Software \\
                 6: Locale Utilities \\
                 Appendix A: Migration Issues \\
                 Appendix B: Example Locales",
}

@Book{xopen:1995:XOCa,
  author =       "{X/Open Company, Ltd.}",
  title =        "{X/Open Common Desktop Environment (XCDE)} /
                 Definitions and infrastructure",
  publisher =    pub-X-OPEN,
  address =      pub-X-OPEN:adr,
  pages =        "xxii + 506",
  year =         "1995",
  ISBN =         "1-85912-070-9",
  ISBN-13 =      "978-1-85912-070-5",
  LCCN =         "????",
  bibdate =      "Thu Sep 19 09:32:23 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

@Book{xopen:1995:XOCb,
  author =       "{X/Open Company, Ltd.}",
  title =        "{X/Open} curses: issue 4",
  publisher =    pub-X-OPEN,
  address =      pub-X-OPEN:adr,
  pages =        "xviii + 294",
  year =         "1995",
  ISBN =         "1-85912-077-6",
  ISBN-13 =      "978-1-85912-077-4",
  LCCN =         "????",
  bibdate =      "Thu Sep 19 09:36:25 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

@Book{xopen:XPG88-4,
  author =       "{X/Open Company, Ltd.}",
  title =        "{X\slash Open} Portability Guide, Programming
                 Languages",
  volume =       "4",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xiii + 198",
  year =         "1988",
  ISBN =         "0-13-685868-6",
  ISBN-13 =      "978-0-13-685868-3",
  LCCN =         "QA76.76.O63 X423 1988",
  bibdate =      "Thu Dec 16 08:02:25 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{xopen:XPG88-5,
  author =       "{X/Open Company, Ltd.}",
  title =        "{X\slash Open} Portability Guide, Data Management",
  volume =       "5",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xiii + 204",
  year =         "1988",
  ISBN =         "0-13-685876-7",
  ISBN-13 =      "978-0-13-685876-8",
  LCCN =         "QA76.76.O63 X423 1988",
  bibdate =      "Thu Dec 16 08:02:52 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{xopen:XPG88-6,
  author =       "{X/Open Company, Ltd.}",
  title =        "{X\slash Open} Portability Guide, Window Management",
  volume =       "6",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xiv + 338",
  year =         "1988",
  ISBN =         "0-13-685884-8",
  ISBN-13 =      "978-0-13-685884-3",
  LCCN =         "QA76.76.O63 X423 1988",
  bibdate =      "Thu Dec 16 08:03:33 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{xopen:XPG88-7,
  author =       "{X/Open Company, Ltd.}",
  title =        "{X\slash Open} Portability Guide, Networking
                 Services",
  volume =       "7",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xiii + 144",
  year =         "1988",
  ISBN =         "0-13-685892-9",
  ISBN-13 =      "978-0-13-685892-8",
  LCCN =         "QA76.76.O63 X423 1988",
  bibdate =      "Thu Dec 16 08:04:12 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{xopen:XPG89-1,
  author =       "{X/Open Company, Ltd.}",
  title =        "{X\slash Open} Portability Guide, {XSI} Commands and
                 Utilities",
  volume =       "1",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xii + 340",
  year =         "1989",
  ISBN =         "0-13-685835-X",
  ISBN-13 =      "978-0-13-685835-5",
  LCCN =         "QA76.76.O63 X423 1988",
  bibdate =      "Wed Dec 15 19:50:06 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{xopen:XPG89-2,
  author =       "{X/Open Company, Ltd.}",
  title =        "{X\slash Open} Portability Guide, {XSI} System
                 Interface and Headers",
  volume =       "2",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xx + 666",
  year =         "1989",
  ISBN =         "0-13-685843-0",
  ISBN-13 =      "978-0-13-685843-0",
  LCCN =         "QA76.76.O63 X423 1988",
  bibdate =      "Thu Dec 16 08:05:00 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{xopen:XPG89-3,
  author =       "{X/Open Company, Ltd.}",
  title =        "{X\slash Open} Portability Guide, Supplementary
                 Definitions",
  volume =       "3",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xiv + 172",
  year =         "1989",
  ISBN =         "0-13-685850-3",
  ISBN-13 =      "978-0-13-685850-8",
  LCCN =         "QA76.76.O63 X423 1988",
  bibdate =      "Thu Dec 16 08:01:40 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Yeung:1984:ALP,
  author =       "Bik Chung Yeung",
  title =        "8086\slash 8088 Assembly Language Programming",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xi + 265",
  year =         "1984",
  ISBN =         "0-471-90463-5",
  ISBN-13 =      "978-0-471-90463-2",
  LCCN =         "QA 76.8 I292 Y48 1984",
  bibdate =      "Wed Dec 15 10:59:12 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$23.88",
  acknowledgement = ack-nhfb,
}

@Book{Young:1971:ISL,
  author =       "David M. Young",
  title =        "Iterative Solution of Large Linear Systems",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "xxiv + 570",
  year =         "1971",
  ISBN =         "0-12-773050-8",
  ISBN-13 =      "978-0-12-773050-9",
  LCCN =         "QA195 .Y681 1971",
  MRclass =      "65F10",
  MRnumber =     "46 4698",
  MRreviewer =   "L. Fox",
  bibdate =      "Wed Dec 15 10:59:14 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/y/young-david-m.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Computer Science and Applied Mathematics, Editor:
                 Werner Rheinboldt",
  acknowledgement = ack-nhfb,
  tableofcontents = "Preface / xiii \\
                 Acknowledgments / xvii \\
                 Notation / xix \\
                 List of Fundamental Matrix Properties / xxi \\
                 List of Iterative Methods / xxiii \\
                 Introduction / 1 \\
                 The Model Problem / 2 \\
                 Supplementary Discussion / 6 \\
                 Exercises / 6 \\
                 Matrix Preliminaries / 7 \\
                 Review of Matrix Theory / 7 \\
                 Hermitian Matrices and Positive Definite Matrices / 18
                 \\
                 Vector Norms and Matrix Norms / 25 \\
                 Convergence of Sequences of Vectors and Matrices / 34
                 \\
                 Irreducibility and Weak Diagonal Dominance / 36 \\
                 Property $A$ / 41 \\
                 L-Matrices and Related Matrices / 42 \\
                 Illustrations / 48 \\
                 Supplementary Discussion / 53 \\
                 Exercises / 55 \\
                 Linear Stationary Iterative Methods / 63 \\
                 Introduction / 63 \\
                 Consistency, Reciprocal Consistency, and Complete
                 Consistency / 65 \\
                 Basic Linear Stationary Iterative Methods / 70 \\
                 Generation of Completely Consistent Methods / 75 \\
                 General Convergence Theorems / 77 \\
                 Alternative Convergence Conditions / 80 \\
                 Rates of Convergence / 84 \\
                 The Jordan Condition Number of a $2 \times 2$ Matrix /
                 89 \\
                 Supplementary Discussion / 94 \\
                 Exercises / 95 \\
                 Convergence of the Basic Iterative Methods / 106 \\
                 General Convergence Theorems / 106 \\
                 Irreducible Matrices with Weak Diagonal Dominance / 107
                 \\
                 Positive Definite Matrices / 108 \\
                 The SOR Method with Varying Relaxation Factors / 118
                 \\
                 L-Matrices and Related Matrices / 120 \\
                 Rates of Convergence of the J and GS Methods for the
                 Model Problem / 127 \\
                 Supplementary Discussion / 132 \\
                 Exercises / 133 \\
                 Eigenvalues of the SOR Method for Consistently Ordered
                 Matrices / 140 \\
                 Introduction / 140 \\
                 Block Tri-Diagonal Matrices / 141 \\
                 Consistently Ordered Matrices and Ordering Vectors /
                 144 \\
                 Property $A$ / 148 \\
                 Nonmigratory Permutations / 153 \\
                 Consistently Ordered Matrices Arising from Difference
                 Equations / 157 \\
                 A Computer Program for Testing for Property $A$ and
                 Consistent Ordering / 159 \\
                 Other Developments of the SOR Theory / 162 \\
                 Supplementary Discussion / 163 \\
                 Exercises / 163 \\
                 Determination of the Optimum Relaxation Factor / 169
                 \\
                 Virtual Spectral Radius / 170 \\
                 Analysis of the Case Where All Eigenvalues of B Are
                 Real / 171 \\
                 Rates of Convergence: Comparison with the Gauss--Seidel
                 Method / 188 \\
                 Analysis of the Case Where Some Eigenvalues of B Are
                 Complex / 191 \\
                 Practical Determination of $\omega_b$: General
                 Considerations / 200 \\
                 Iterative Methods of Choosing $\omega_b$ / 209 \\
                 An Upper Bound for $\mu$ / 211 \\
                 A Priori Determination of $\mu$: Exact Methods / 216
                 \\
                 A Priori Determination of $\mu$: Approximate Values /
                 222 \\
                 Numerical Results / 224 \\
                 Supplementary Discussion / 227 \\
                 Exercises / 228 \\
                 Norms of the SOR Method / 233 \\
                 The Jordan Canonical Form of ${\cal L}_\omega$ / 234
                 \\
                 Basic Eigenvalue Relation / 239 \\
                 Determination of $||{\cal L}_\omega||_{D^{1/2}}$ / 245
                 \\
                 Determination of $||{\cal L}^m_{\omega_b}||_{D^{1/2}}$
                 / 248 \\
                 Determination of $||{\cal L}_\omega||_{A^{1/2}}$ / 255
                 \\
                 Determination of $||{\cal L}^m_{\omega_b}||_{A^{1/2}}$
                 / 258 \\
                 Comparison of $||{\cal L}^m_{\omega_b}||_{D^{1/2}}$ and
                 $||{\cal L}^m_{\omega_b}||_{A^{1/2}}$ / 264 \\
                 Supplementary Discussion / 265 \\
                 Exercises / 266 \\
                 The Modified SOR Method: Fixed Parameters / 271 \\
                 Introduction / 271 \\
                 Eigenvalues of ${\cal L}_{\omega, \omega'}$ / 273 \\
                 Convergence and Spectral Radius / 277 \\
                 Determination of $||{\cal L}_{\omega,
                 \omega'}_{D^{1/2}}||$ / 283 \\
                 Determination of $||{\cal L}_{\omega,
                 \omega'}_{A^{1/2}}||$ / 288 \\
                 Supplementary Discussion / 291 \\
                 Exercises / 291 \\
                 Nonstationary Linear Iterative Methods / 295 \\
                 Consistency, Convergence, and Rates of Convergence /
                 295 \\
                 Periodic Nonstationary Methods / 300 \\
                 Chebyshev Polynomials / 301 \\
                 Supplementary Discussion / 304 \\
                 Exercises / 304 \\
                 The Modified SOR Method: Variable Parameters / 306 \\
                 Convergence of the MSOR Method / 307 \\
                 Optimum Choice of Relaxation Factors / 307 \\
                 Alternative Optimum Parameter Sets / 311 \\
                 Norms of the MSOR Method: Sheldon's Method / 315 \\
                 The Modified Sheldon Method / 319 \\
                 Cyclic Chebyshev Semi-Iterative Method / 321 \\
                 Comparison of Norms / 327 \\
                 Supplementary Discussion / 340 \\
                 Exercises / 341 \\
                 Semi-Iterative Methods / 344 \\
                 General Considerations / 345 \\
                 The Case Where G Has Real Eigenvalues / 347 \\
                 J, JOR, and RF Semi-Iterative Methods / 355 \\
                 Richardson's Method / 361 \\
                 Cyclic Chebyshev Semi-Iterative Method / 365 \\
                 GS Semi-Iterative Methods / 367 \\
                 SOR Semi-Iterative Methods / 374 \\
                 MSOR Semi-Iterative Methods / 376 \\
                 Comparison of Norms / 383 \\
                 Supplementary Discussion / 385 \\
                 Exercises / 386 \\
                 Extensions of the SOR Theory: Stieltjes Matrices / 391
                 \\
                 The Need for Some Restrictions on A / 391 \\
                 Stieltjes Matrices / 395 \\
                 Supplementary Discussion / 401 \\
                 Exercises / 401 \\
                 Generalized Consistently Ordered Matrices / 404 \\
                 Introduction / 404 \\
                 ${\rm CO}(q, r)$-Matrices, Property $A_{q,r}$, and
                 Ordering Vectors / 405 \\
                 Determination of the Optimum Relaxation Factor / 413
                 \\
                 Generalized Consistently Ordered Matrices / 418 \\
                 Relation between ${\rm GCO}(q, r)$-Matrices and ${\rm
                 CO}(q, r)$-Matrices / 419 \\
                 Computational Procedures: Canonical Forms / 422 \\
                 Relation to Other Work / 428 \\
                 Supplementary Discussion / 429 \\
                 Exercises / 430 \\
                 Group Iterative Methods / 434 \\
                 Construction of Group Iterative Methods / 435 \\
                 Solution of a Linear System with a Tri-Diagonal Matrix
                 / 441 \\
                 Convergence Analysis / 445 \\
                 Applications / 452 \\
                 Comparison of Point and Group Iterative Methods / 454
                 \\
                 Supplementary Discussion / 456 \\
                 Exercises / 457 \\
                 Symmetric SOR Method and Related Methods / 461 \\
                 Introduction / 461 \\
                 Convergence Analysis / 463 \\
                 Choice of Relaxation Factor / 464 \\
                 SSOR Semi-Iterative Methods: The Discrete Dirichlet
                 Problem / 471 \\
                 Group SSOR Methods / 474 \\
                 Unsymmetric SOR Method / 476 \\
                 Symmetric and Unsymmetric MSOR Methods / 478 \\
                 Supplementary Discussion / 480 \\
                 Exercises / 481 \\
                 Second-Degree Methods / 486 \\
                 Supplementary Discussion / 493 \\
                 Exercises / 493 \\
                 Alternating Direction Implicit Methods / 495 \\
                 Introduction: The Peaceman--Rachford Method / 495 \\
                 The Stationary Case: Consistency and Convergence / 498
                 \\
                 The Stationary Case: Choice of Parameters / 503 \\
                 The Commutative Case / 514 \\
                 Optimum Parameters / 518 \\
                 Good Parameters / 525 \\
                 The Helmholtz Equation in a Rectangle / 531 \\
                 Monotonicity / 534 \\
                 Necessary and Sufficient Conditions for the Commutative
                 Case / 535 \\
                 The Noncommutative Case / 545 \\
                 Supplementary Discussion / 547 \\
                 Exercises / 548 \\
                 Selection of Iterative Method / 553 \\
                 Bibliography / 556 \\
                 Index / 565",
}

@Book{Young:1983:IA,
  author =       "Stephen J. Young",
  title =        "An Introduction to {Ada}",
  publisher =    pub-ELLIS-HORWOOD,
  address =      pub-ELLIS-HORWOOD:adr,
  pages =        "400",
  year =         "1983",
  ISBN =         "0-85312-535-X",
  ISBN-13 =      "978-0-85312-535-8",
  LCCN =         "QA76.73.A35 Y68 1983",
  bibdate =      "Wed Dec 15 10:59:13 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "UK\pounds 25.00",
  series =       "Ellis Horwood Series in Computers and their
                 Applications, Editor: Brian Meek",
  acknowledgement = ack-nhfb,
}

@Book{Young:1989:XWS,
  author =       "Douglas A. Young",
  title =        "{X} Window Systems: Programming and Applications with
                 Xt",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "x + 468",
  year =         "1989",
  ISBN =         "0-13-972167-3",
  ISBN-13 =      "978-0-13-972167-0",
  LCCN =         "QA76.76 .W56 Y68 1989",
  bibdate =      "Tue Dec 14 23:50:39 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Young:1990:XWS,
  author =       "Douglas A. Young",
  title =        "{X} Window Systems: Programming and Applications with
                 Xt: {OSF}\slash Motif Edition",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "x + 533",
  year =         "1990",
  ISBN =         "0-13-497074-8",
  ISBN-13 =      "978-0-13-497074-5",
  LCCN =         "QA76.76 .W56 Y67 1990",
  bibdate =      "Tue Dec 14 23:50:15 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Young:1992:XWS,
  author =       "Douglas A. Young and John A. Pew",
  title =        "The {X Window System}: Programming and Applications
                 with {Xt}: {OPEN LOOK} Edition",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "vii + 589",
  year =         "1992",
  ISBN =         "0-13-982992-X (paperback)",
  ISBN-13 =      "978-0-13-982992-5 (paperback)",
  LCCN =         "QA76.76 .W56Y67 1992",
  bibdate =      "Tue Dec 14 23:48:23 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
}

@Book{Young:1997:VTH,
  author =       "David H. Young",
  title =        "The {Visual Tcl} handbook",
  publisher =    pub-PHPTR,
  address =      pub-PHPTR:adr,
  pages =        "xxx + 512",
  year =         "1997",
  ISBN =         "0-13-461674-X",
  ISBN-13 =      "978-0-13-461674-2",
  LCCN =         "QA76.9.U83Y68 1997",
  bibdate =      "Thu Aug 07 14:01:02 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$45.00",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "1: Modern scripting \\
                 2: A quick start \\
                 3: Run-time environment \\
                 4: Parsing Tcl commands \\
                 5: Tcl procedures \\
                 6: Data structures \\
                 7: Flow and development \\
                 8: Data access commands \\
                 9: Motif and visual Tcl \\
                 10: Visual Tcl concepts \\
                 11: Callbacks \\
                 12: Accessing resources \\
                 13: Geometry management \\
                 14: Dialogs \\
                 15: Labels and buttons \\
                 16: Selection dialogs \\
                 17: Scales \\
                 18: Text widget \\
                 19: Option menu and combo box \\
                 20: Lists and drawn lists",
}

@Book{Zachary:2014:SBR,
  author =       "G. Pascal Zachary",
  title =        "Showstopper!: the breakneck race to create {Windows
                 NT} and the next generation at {Microsoft}",
  publisher =    "Open Road Integrated Media, Inc.",
  address =      "New York, NY, USA",
  pages =        "328",
  year =         "2014",
  ISBN =         "1-4976-3883-6, 1-4804-9484-4 (e-book)",
  ISBN-13 =      "978-1-4976-3883-9, 978-1-4804-9484-8 (e-book)",
  LCCN =         "QA76.765 .Z334 2014",
  bibdate =      "Mon Feb 5 10:33:57 MST 2018",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Computer software; Development; History;
                 Development.",
  tableofcontents = "Introduction / 1 \\
                 1: Code Warrior / 7 \\
                 2: The King of Code / 26 \\
                 3: Tribes / 41 \\
                 4: Blind Alley / 67 \\
                 5: Growling Bears / 98 \\
                 6: Dog Food / 129 \\
                 7: Ship Mode / 157 \\
                 8: Death March / 191 \\
                 9: Bugged / 227 \\
                 10: Showstopper / 256 \\
                 Epilogue / 301 \\
                 A Note on Sources / 313 \\
                 Acknowledgments / 318 \\
                 New Afterword / 320",
}

@Book{Zapf:2007:ACT,
  author =       "Hermann Zapf",
  title =        "{Alphabetgeschichten: Eine Chronik technischer
                 Entwicklungen}. ({German}) [{Alphabet} Stories: A
                 Chronicle of technical developments]",
  publisher =    "Mergenthaler Edition, Linotype GmbH",
  address =      "Bad Homburg, Germany",
  pages =        "156",
  year =         "2007",
  ISBN =         "3-9810319-5-4",
  ISBN-13 =      "978-3-9810319-5-9",
  LCCN =         "????",
  bibdate =      "Fri Jul 27 18:00:30 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "29.00 EUR",
  acknowledgement = ack-nhfb,
  language =     "German",
  libnote =      "Not yet in my library.",
}

@Book{Zapf:2007:ASC,
  author =       "Hermann Zapf",
  title =        "Alphabet Stories: a Chronicle of Technical
                 Developments",
  publisher =    "Mergenthaler Edition, Linotype GmbH",
  address =      "Bad Homburg, Germany",
  pages =        "149",
  year =         "2007",
  ISBN =         "3-9810319-6-2",
  ISBN-13 =      "978-3-9810319-6-6",
  LCCN =         "Z250.A2",
  bibdate =      "Fri Jul 27 17:58:03 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Zhang:1996:CSF,
  author =       "Shanjie Zhang and Jianming Jin",
  title =        "Computation of Special Functions",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xxvi + 717",
  year =         "1996",
  ISBN =         "0-471-11963-6",
  ISBN-13 =      "978-0-471-11963-0",
  LCCN =         "QA351.C45 1996",
  bibdate =      "Wed Mar 22 14:39:04 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/mathcw.bib",
  price =        "US\$94.00",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "Preface / xi \\
                 Acknowledgments / xvii \\
                 List of Computer Programs / xix \\
                 1: Bernoulli and Euler Numbers / 1 \\
                 2: Orthogonal Polynomials / 12 \\
                 3: Gamma, Beta, and Psi Functions / 44 \\
                 4: Legendre Functions / 77 \\
                 5: Bessel Functions / 126 \\
                 6: Modified Bessel Functions / 202 \\
                 7: Integrals of Bessel Functions / 252 \\
                 8: Spherical Bessel Functions / 273 \\
                 9: Kelvin Functions / 307 \\
                 10: Airy Functions / 325 \\
                 11: Struve Functions / 341 \\
                 12: Hypergeometric and Confluent Hypergeometric / 366
                 \\
                 13: Parabolic Cylinder Functions / 425 \\
                 14: Mathieu Functions / 475 \\
                 15: Spheroidal Wave Functions / 536 \\
                 16: Error Function and Fresnel Integrals / 620 \\
                 17: Cosine and Sine Integrals / 644 \\
                 18: Elliptic Integrals and Jacobian Elliptic Functions
                 19: Exponential Integrals / 680 \\
                 20: Summary of Methods for Computing Special Functions
                 Appendix A: Derivation of Some Special Differential
                 Appendix B: Root-Finding Methods / 704 \\
                 Reference / 706 \\
                 Appendix C: About the Software / 707 \\
                 Index / 709 \\
                 Index of Computer Programs / 715",
  tableofcontents = "Preface / xi \\
                 Acknowledgments / xvii \\
                 List of Computer Programs / xix \\
                 1: Bernoulli and Euler Numbers / 1 \\
                 1.1 Bernoulli Numbers / 1 \\
                 1.2 Euler Numbers / 6 \\
                 1.3 Mathematical Table / 10 \\
                 References / 11 \\
                 2: Orthogonal Polynomials / 12 \\
                 2.1 Introduction / 12 \\
                 2.2 Chebyshev Polynomials / 13 \\
                 2.3 Laguerre Polynomials / 18 \\
                 2.4 Hermite Polynomials / 20 \\
                 2.5 Numerical Computation / 23 \\
                 2.6 Application in Numerical Integration / 27 \\
                 References / 43 \\
                 3: Gamma, Beta, and Psi Functions / 44 \\
                 3.1 Gamma Function / 44 \\
                 3.2 Beta Function / 53 \\
                 3.3 Psi Function / 55 \\
                 3.4 Incomplete Gamma Function / 61 \\
                 3.5 Incomplete Beta Function / 64 \\
                 3.6 Mathematical Tables / 66 \\
                 References and Further Reading / 76 \\
                 4: Legendre Functions / 77 \\
                 4.1 Introduction / 77 \\
                 4.2 Legendre Functions of the First Kind / 78 \\
                 4.3 Legendre Functions of the Second Kind / 83 \\
                 4.4 Associated Legendre Functions of the First Kind /
                 89 \\
                 4.5 Associated Legendre Functions of the Second Kind /
                 96 \\
                 4.6 Legendre Functions with an Arbitrary Degree / 104
                 \\
                 4.7 Mathematical Tables / 113 \\
                 References and Further Reading / 125 \\
                 5: Bessel Functions / 126 \\
                 5.1 Introduction / 126 \\
                 5.2 Computation of $J_0(x)$, $J_1(x)$, $Y_0(x)$, and
                 $Y_1(x)$ / 131 \\
                 5.3 Computation of $J_n(x)$ and $Y_n(x)$ with Real
                 Arguments / 140 \\
                 5.4 Computation of $Y_n(z)$ and$ Y_n(z)$ with Complex
                 Arguments / 149 \\
                 5.5 Computation of $J_\nu(z)$ and $J_\nu(z)$ with an
                 Arbitrary Order / 161 \\
                 5.6 Assessment of Validity and Accuracy of Computation
                 / 175 \\
                 5.7 Zeros of Bessel Functions / 180 \\
                 5.8 Lambda Functions / 182 \\
                 5.9 Mathematical Tables / 184 \\
                 References and Further Reading / 201 \\
                 6: Modified Bessel Functions / 202 \\
                 6.1 Introduction / 202 \\
                 6.2 Computation of $I_0(x)$, $I_1(x)$, $K_0(x)$, and
                 $K_1(x)$ / 207 \\
                 6.3 Computation of $I_n(x)$ and $K_n(x)$ with Real
                 Arguments / 213 \\
                 6.4 Computation of $I_n(z)$ and $K_n(z)$ with Complex
                 Arguments / 217 \\
                 6.5 Computation of $I_\nu(z)$ and $K_\nu(z)$ with an
                 Arbitrary Order / 225 \\
                 6.6 Computation of $H_\nu^{(1)}(z)$ and
                 $H_\nu^{(2)}(z)$ for Complex Arguments / 235 \\
                 6.7 Mathematical Tables / 239 \\
                 References and Further Reading / 251 \\
                 7: Integrals of Bessel Functions / 252 \\
                 7.1 Simple Integrals of Bessel Functions / 252 \\
                 7.2 Simple Integrals of Modified Bessel Functions / 261
                 \\
                 7.3 Curves and Tables / 268 \\
                 References / 272 \\
                 8: Spherical Bessel Functions / 273 \\
                 8.1 Spherical Bessel Functions / 273 \\
                 8.2 Riccati--Bessel Functions / 283 \\
                 8.3 Modified Spherical Bessel Functions / 286 \\
                 8.4 Mathematical Tables / 295 \\
                 References and Further Reading / 306 \\
                 9: Kelvin Functions / 307 \\
                 9.1 Introduction / 307 \\
                 9.2 Mathematical Properties / 311 \\
                 9.3 Asymptotic Expansions / 312 \\
                 9.4 Numerical Computation / 315 \\
                 9.5 Zeros of Kelvin Functions / 321 \\
                 9.6 Mathematical Tables / 321 \\
                 Reference / 324 \\
                 10: Airy Functions / 325 \\
                 10.1 Introduction / 325 \\
                 10.2 Numerical Computation / 329 \\
                 10.3 Mathematical Tables / 336 \\
                 References / 340 \\
                 11: Struve Functions / 341 \\
                 11.1 Struve Functions / 341 \\
                 11.2 Modified Struve Functions / 353 \\
                 11.3 Mathematical Tables / 362 \\
                 References / 365 \\
                 12: Hypergeometric and Confluent Hypergeometric
                 Functions / 366 \\
                 12.1 Definition of Hypergeometric Functions / 366 \\
                 12.2 Properties of Hypergeometric Functions / 368 \\
                 12.3 Linear Transformation Formulas / 369 \\
                 12.4 Recurrence Relations for Hypergeometric Functions
                 / 372 \\
                 12.5 Special Functions Expressed as Hypergeometric
                 Functions / 373 \\
                 12.6 Numerical Computation of Hypergeometric Functions
                 / 374 \\
                 12.7 Definition of Confluent Hypergeometric Functions /
                 385 \\
                 12.8 Properties of Confluent Hypergeometric Functions /
                 387 \\
                 12.9 Recurrence Relations for Confluent Hypergeometric
                 Functions / 389 \\
                 12.10 Special Functions Expressed as Confluent
                 Hypergeometric Functions / 394 \\
                 12.11 Definition of Whittaker Functions / 395 \\
                 12.12 Numerical Computation of Confluent Hypergeometric
                 Functions / 398 \\
                 12.13 Mathematical Tables / 411 \\
                 References and Further Reading / 424 \\
                 13: Parabolic Cylinder Functions / 425 \\
                 13.1 Introduction / 425 \\
                 13.2 Definitions of Parabolic Cylinder Functions / 428
                 \\
                 13.3 Basic Properties / 432 \\
                 13.4 Series and Asymptotic Expansions / 437 \\
                 13.5 Numerical Computation / 438 \\
                 13.6 Mathematical Tables / 455 \\
                 References and Further Reading / 474 \\
                 14: Mathieu Functions / 475 \\
                 14.1 Definition of Mathieu Functions / 475 \\
                 14.2 Determination of Expansion Coefficients and
                 Characteristic Values / 477 \\
                 14.3 Approximate Calculation of Characteristic Values /
                 482 \\
                 14.4 Expansion of Mathieu Functions When $|q| < 1$ /
                 485 \\
                 14.5 Properties of Mathieu Functions / 487 \\
                 14.6 Definition of Modified Mathieu Functions / 489 \\
                 14.7 Properties of Modified Mathieu Functions / 496 \\
                 14.8 Numerical Computation: Algorithms and Computer
                 Programs / 501 \\
                 14.9 Mathematical Tables / 520 \\
                 References and Further Reading / 535 \\
                 15: Spheroidal Wave Functions / 536 \\
                 15.1 Spheroidal Coordinate Systems / 536 \\
                 15.2 Wave Equation and Its Solution in Spheroidal
                 Coordinates / 540 \\
                 15.3 Definitions of Angular and Radial Prolate
                 Spheroidal Wave Functions / 542 \\
                 15.4 Determination of Characteristic Values and
                 Expansion Coefficients / 550 \\
                 15.5 Evaluation of Prolate Radial Wave Functions of the
                 Second Kind for Small $c \xi$ / 556 \\
                 15.6 Definitions of Angular and Radial Oblate
                 Spheroidal Wave Functions / 559 \\
                 15.7 Evaluation of Oblate Radial Wave Functions of the
                 Second Kind for Small $c \xi$ / 561 \\
                 15.8 Numerical Computation: Algorithms and Computer
                 Programs / 569 \\
                 15.9 Mathematical Tables / 594 \\
                 References / 619 \\
                 16: Error Function and Fresnel Integrals / 620 \\
                 16.1 Introduction to Error Function / 620 \\
                 16.2 Numerical Computation of Error Function / 621 \\
                 16.3 Gaussian Probability Integral / 624 \\
                 16.4 Introduction to Fresnel Integrals / 625 \\
                 16.5 Series and Asymptotic Expansions of Fresnel
                 Integrals / 629 \\
                 16.6 Numerical Computation of Fresnel Integrals / 630
                 \\
                 16.7 Zeros of Error Function and Fresnel Integrals /
                 635 \\
                 16.8 Mathematical Tables / 636 \\
                 References and Further Reading / 643 \\
                 17: Cosine and Sine Integrals / 644 \\
                 17.1 Introduction / 644 \\
                 17.2 Series and Asymptotic Expansions / 646 \\
                 17.3 Numerical Computation / 647 \\
                 17.4 Mathematical Table / 651 \\
                 References and Further Readings / 653 \\
                 18: Elliptic Integrals and Jacobian Elliptic Functions
                 / 654 \\
                 18.1 Introduction to Elliptic Integrals / 654 \\
                 18.2 Series Expansion of Elliptic Integrals / 659 \\
                 18.3 Numerical Computation of Elliptic Integrals / 661
                 \\
                 18.4 Introduction to Jacobian Elliptic Functions / 666
                 \\
                 18.5 Numerical Computation of Jacobian Elliptic
                 Functions / 670 \\
                 18.6 Mathematical Tables / 672 \\
                 References and Further Reading / 679 \\
                 19: Exponential Integrals / 680 \\
                 19.1 Introduction / 680 \\
                 19.2 Series, Asymptotic, and Continued Fraction
                 Expressions / 682 \\
                 19.3 Rational Approximations / 683 \\
                 19.4 Numerical Computation / 684 \\
                 19.5 Mathematical Tables / 688 \\
                 References / 693 \\
                 20: Summary of Methods for Computing Special Functions
                 / 694 \\
                 Appendix A: Derivation of Some Special Differential
                 Equations / 697 \\
                 A.1 Helmholtz Equation and Separation of Variables /
                 697 \\
                 A.2 Circular Cylindrical Coordinates / 698 \\
                 A.3 Elliptic Cylindrical Coordinates / 700 \\
                 A.4 Parabolic Cylindrical Coordinates / 700 \\
                 A.5 Spherical Coordinates / 701 \\
                 A.6 Prolate Spheroidal Coordinates / 701 \\
                 A.7 Oblate Spheroidal Coordinates / 702 \\
                 A.8 Parabolic Coordinates / 703 \\
                 References / 703 \\
                 Appendix B: Root-Finding Methods / 704 \\
                 B.1 Newton's Method / 704 \\
                 B.2 Modified Newton's Method / 706 \\
                 B.3 Secant Method / 706 \\
                 Reference / 706 \\
                 Appendix C: About the Software / 707 \\
                 Index / 709 \\
                 Index of Computer Programs / 715",
  xxauthor =     "Shan-chieh Chang and Shanjie Zhang and Jianming Jin",
  xxnote =       "There is online bookstore and library catalog
                 confusion over the authors of this book. The
                 publisher's Web page at
                 http://catalog.wiley.com/remsrch.cgi has Shan-jie Zhang
                 (Nanjing Univ., China) / Jianming Jin (Univ. of
                 Illinois at Urbana-Champaign), and a price of
                 US\$125.00. It looks like Shan-chieh Chang is merely a
                 different English transcription of Shanjie Zhang.
                 http://www.fatbrain.com/ lists this book for US\$99.95.
                 My copy of the book lists the authors as Shanjie Zhang
                 and Jianming Jin in four places.",
}

@Book{Ziliak:2008:CSS,
  author =       "Stephen Thomas Ziliak and Deirdre N. McCloskey",
  title =        "The Cult of Statistical Significance: How the Standard
                 Error Costs Us Jobs, Justice, and Lives",
  publisher =    pub-U-MICHIGAN,
  address =      pub-U-MICHIGAN:adr,
  pages =        "xxiii + 321",
  year =         "2008",
  ISBN =         "0-472-07007-X (cloth), 0-472-05007-9 (paperback)",
  ISBN-13 =      "978-0-472-07007-7 (cloth), 978-0-472-05007-9
                 (paperback)",
  LCCN =         "HB137 .Z55 2008",
  bibdate =      "Tue Dec 9 15:55:11 MST 2008",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/f/fisher-ronald-aylmer.bib;
                 https://www.math.utah.edu/pub/tex/bib/chance.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Economics, cognition, and society",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0809/2007035401-d.html",
  acknowledgement = ack-nhfb,
  remark =       "This book has important comments on the battles among
                 Sir Ronald Fisher, Jerzy Neyman, Egon Pearson, and Karl
                 Pearson, supplementing the discussion of those
                 conflicts in \cite{McGrayne:2011:TWH}.",
  subject =      "economics; statistical methods; statistics; social
                 aspects; statistical hypothesis testing",
  tableofcontents = "A significant problem \\
                 1. Dieting ``significance'' and the case of Vioxx \\
                 2. The sizeless stare of statistical significance \\
                 3. What the sizeless scientists say in defense \\
                 4. Better practice: [beta]-importance vs.
                 [alpha]-``significance'' \\
                 5. A lot can go wrong in the use of significance tests
                 in economics \\
                 6. A lot did go wrong in the American Economic Review
                 during the 1980s \\
                 7. Is economic practice improving? \\
                 8. How big is big in economics? \\
                 9. What the sizeless stare costs, economically speaking
                 \\
                 10. How economics stays that way: the textbooks and the
                 referees \\
                 11. The not-boring rise of significance in psychology
                 \\
                 12. Psychometrics lacks power \\
                 13. The psychology of psychological significance
                 testing \\
                 14. Medicine seeks a magic pill \\
                 15. Rothman's revolt \\
                 16. On drugs, disability, and death \\
                 17. Edgeworth's significance \\
                 18. ``Take $3 \sigma$ as definitely significant'':
                 Pearson's rule \\
                 19. Who sits on the egg of Calculus Canorus? not Karl
                 Pearson \\
                 20. Gosset: the fable of the bee \\
                 21. Fisher: the fable of the wasp \\
                 22. How the wasp stung the bee and took over some
                 sciences \\
                 23. Eighty years of trained incapacity: how such a
                 thing could happen \\
                 24. What to do \\
                 A reader's guide",
}

@Book{Zimmerman:2008:UMS,
  author =       "Robert Zimmerman",
  title =        "The universe in a mirror: the saga of the {Hubble
                 Telescope} and the visionaries who built it",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "xv + 295 + 16",
  year =         "2008",
  ISBN =         "0-691-14635-7",
  ISBN-13 =      "978-0-691-14635-5",
  LCCN =         "QB500.268",
  bibdate =      "Sat May 18 19:09:01 MDT 2013",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Reissued in 2010 with a new foreword.",
  abstract =     "The Hubble Space Telescope has transformed our
                 understanding of the universe, revealing new
                 information about its age and evolution, the life cycle
                 of stars, and the existence of black holes, among other
                 discoveries. This book tells the story of the Hubble
                 Space Telescope and the people responsible for it.",
  subject =      "Orbiting astronomical observatories; Space astronomy;
                 History; 20th century; Outer space; Exploration",
  tableofcontents = "Foggy vision \\
                 Slow start \\
                 Getting money \\
                 Building it \\
                 Saving it \\
                 ``New phenomena not yet imagined'' \\
                 Abandonment \\
                 The lure of the unknown",
}

@Book{Zimmermann:1995:OPU,
  author =       "Philip R. Zimmermann",
  title =        "The Official {PGP} User's Guide",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "xviii + 127",
  year =         "1995",
  ISBN =         "0-262-74017-6",
  ISBN-13 =      "978-0-262-74017-3",
  LCCN =         "TK5102.85 .Z56 1995",
  bibdate =      "Sat Jun 13 08:40:39 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/internet.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$14.95",
  URL =          "http://www-mitpress.mit.edu/mitp/recent-books/comp/pgp-user.html",
  abstract =     "\booktitle{The Official PGP User's Guide} is the
                 user's manual for PGP (Pretty Good Privacy) public-key
                 cryptography software, freely available over the
                 Internet, that has become the de facto standard for the
                 encryption of electronic mail and data. PGP and its
                 author, Philip Zimmermann, are the focus of national
                 and international debates concerning this new, powerful
                 ``envelope'' that allows individuals the same privacy
                 in communications as enjoyed by governments and large
                 corporations. Because cryptographic software is
                 considered munitions by the U.S. government, and is
                 thus subject to the same export restrictions as tanks
                 and submarines, the worldwide distribution of PGP over
                 the Internet has raised a host of issues that are
                 addressed in the ``User's Guide.'' In addition to
                 technical details, the ``User's Guide'' contains
                 valuable insights into the social engineering behind
                 the software engineering and into the legal, ethical,
                 and political issues that have surrounded PGP since its
                 initial release.",
  acknowledgement = ack-nhfb,
  keywords =     "Cryptography; Cryptology; Electronic mail systems ---
                 Security measures --- Data processing; PGP (Computer
                 file); processing; Telecommunication systems ---
                 Security measures --- Data",
  tableofcontents = "Foreword: A Pretty Bad Problem / John Perry Barlow
                 \\
                 1: Why Do You Need PGP? \\
                 2: How Public Key Cryptography Works \\
                 3: Installing PGP \\
                 4: Using PGP \\
                 5: Managing Keys \\
                 6: Advanced Topics \\
                 7: Beware of Snake Oil \\
                 8: Useful Details \\
                 9: Setting Configuration Parameters \\
                 10: A Peek under the Hood \\
                 11: Vulnerabilities \\
                 12: Legal Issues \\
                 13: Compatibility with Previous and Future Versions of
                 PGP \\
                 14: Sources of Information on PGP \\
                 Appendix: PGP Quick Reference",
}

@Book{Zlotnick:1991:PSP,
  author =       "Fred Zlotnick",
  title =        "The {POSIX.1} Standard: a Programmer's Guide",
  publisher =    pub-BENCUM,
  address =      pub-BENCUM:adr,
  pages =        "xi + 379",
  year =         "1991",
  ISBN =         "0-8053-9605-5",
  ISBN-13 =      "978-0-8053-9605-8",
  LCCN =         "QA76.76.063 Z57 1991",
  bibdate =      "Sat Nov 12 21:24:05 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "1: The POSIX Environment / 1 \\
                 2: Process and System Attributes / 29 \\
                 3: Files and Directories / 53 \\
                 4: Input and Output / 83 \\
                 5: Signals / 105 \\
                 6: Process Creation and Synchronization / 135 \\
                 7: Controlling Terminal Devices / 157 \\
                 8: ANSI C Standard Functions / 177 \\
                 9: Data Interchange Formats / 207 \\
                 10: Proposed Revisions to POSIX.1 / 227 \\
                 11: Related Standards / 241 \\
                 12: General C Portability Considerations / 263 \\
                 Appendices \\
                 A: POSIX.1 Functions / 277 \\
                 B: ANSI C Functions in POSIX.1 / 307 \\
                 C: Error Numbers / 331 \\
                 D: Headers and Their Contents / 337 \\
                 E: Signal-Safe Reentrant Functions / 347 \\
                 F: Access to Standards / 349 \\
                 References / 353 \\
                 Glossary / 355 \\
                 Index / 363",
  tableofcontents = "1: The POSIX Environment / 1 \\
                 1.1 Our Goal / 2 \\
                 1.1.1 Implementation Conformance / 2 \\
                 1.1.2 Application Conformance / 4 \\
                 1.1.3 Our Goal, Restated / 5 \\
                 1.2 The POSIX.1 Environment / 6 \\
                 1.3 Some Differences between UNIX and POSIX Systems / 8
                 \\
                 1.4 Configuration Options / 13 \\
                 1.5 Determining Configuration Values during Execution /
                 16 \\
                 1.6 Standard Types / 20 \\
                 1.7 Name-Space Pollution / 21 \\
                 1.8 Environment Strings / 25 \\
                 2: Process and System Attributes / 29 \\
                 2.1 Determining Current Process Attributes / 29 \\
                 2.1.1 BSD Job Control Concepts / 30 \\
                 2.1.2 System V Process Groups / 31 \\
                 2.1.3 POSIX Process Groups, Sessions, and Controlling
                 Terminals / 31 \\
                 2.2 Process User and Group IDs / 35 \\
                 2.2.1 Supplementary Group IDs / 38 \\
                 2.3 Who and Where Am I? / 39 \\
                 2.4 System Databases and Security / 42 \\
                 2.5 Current Working Directory / 45 \\
                 2.6 Environment Strings / 46 \\
                 2.7 Process Times / 49 \\
                 2.8 System Time / 49 \\
                 2.9 System Name / 50 \\
                 3: Files and Directories / 53 \\
                 3.1 Pathname Resolution / 54 \\
                 3.2 Determining File Characteristics / 55 \\
                 3.2.1 File Access Permission / 58 \\
                 3.3 File Descriptors and Open File Descriptions / 60
                 \\
                 3.4 Regular Files / 61 \\
                 3.5 Directories / 65 \\
                 3.6 Pipes / 67 \\
                 3.7 FIFO Special Files / 70 \\
                 3.8 Block and Character Special Files / 74 \\
                 3.9 Controlling File Attributes / 75 \\
                 3.10 Renaming Files / 79 \\
                 4: Input and Output / 83 \\
                 4.1 Controlling Open File Descriptions / 83 \\
                 4.2 Controlling File Descriptors / 87 \\
                 4.3 Reading Regular Files / 89 \\
                 4.4 Reading Special Files / 91 \\
                 4.5 Writing Regular Files / 92 \\
                 4.5.1 A Simple Example / 94 \\
                 4.5.2 I/O Synchronization / 94 \\
                 4.6 Writing Special Files / 97 \\
                 4.7 File Locking / 98 \\
                 4.7.1 File Locking and Deadlocks / 100 \\
                 5: Signals / 105 \\
                 5.1 Review of Signal Concepts and Implementation / 105
                 \\
                 5.1.1 The C Keyword volatile / 109 \\
                 5.2 The Unreliability of UNIX Signals / 110 \\
                 5.3 Signal Data Structures in POSIX.1 / 111 \\
                 5.4 Establishing Signal Actions in POSIX.1 / 114 \\
                 5.5 Blocking Signals / 116 \\
                 5.5.1 Actions for Blocked Signals / 117 \\
                 5.6 Special Considerations for Job Control Signals /
                 117 \\
                 5.7 Sending Signals / 119 \\
                 5.8 Scheduling and Waiting for Signals / 121 \\
                 5.9 Signals and Reentrancy / 124 \\
                 5.10 Signals and Non-Local Gotos / 126 \\
                 6: Process Creation and Synchronization / 135 \\
                 6.1 Process Creation / 135 \\
                 6.1.1 Handling fork() Failure / 140 \\
                 6.2 Program Execution / 143 \\
                 6.3 Synchronizing with Termination of a Child Process /
                 146 \\
                 6.3.1 Interpreting Child Status / 149 \\
                 6.3.2 Advantages of waitpid() over wait() / 151 \\
                 6.3.3 Interactions between wait() and SIGCHLD / 152 \\
                 6.4 Process Termination / 152 \\
                 7: Controlling Terminal Devices / 157 \\
                 7.1 Controlling Terminals / 157 \\
                 7.2 Input Processing / 158 \\
                 7.2.1 Special Characters / 159 \\
                 7.2.2 Canonical and Noncanonical Modes / 160 \\
                 7.3 The termios Data Structure / 162 \\
                 7.4 Controlling Terminal Attributes / 167 \\
                 7.4.1 Errors in Setting Terminal Attributes / 170 \\
                 7.5 Line Control / 172 \\
                 7.6 Terminal Access and Job Control / 173 \\
                 8: ANSI C Standard Functions / 177 \\
                 8.1 Prototypes and Headers / 178 \\
                 8.1.1 Headers in ANSI C and POSIX / 180 \\
                 8.2 Stream I/O / 182 \\
                 8.2.1 File Handles / 187 \\
                 8.2.2 Which Kind of I/O Should You Use? / 187 \\
                 8.3 Internationalization / 194 \\
                 8.3.1 Locale Categories / 195 \\
                 8.3.2 Using Locales / 197 \\
                 8.4 Time Functions / 198 \\
                 8.4.1 Time Zones and Daylight Savings Time / 199 \\
                 8.4.2 More about Time Functions / 201 \\
                 9: Data Interchange Formats / 207 \\
                 9.1 Packaging Applications / 208 \\
                 9.1.1 Packaging Source Files / 209 \\
                 9.1.2 Packaging Binary Executable Files / 211 \\
                 9.1.3 Packaging Data Files / 212 \\
                 9.1.4 Pathnames / 215 \\
                 9.2 Extended tar Format / 215 \\
                 9.2.1 Restoring Extended tar Archives / 221 \\
                 9.3 Extended cpio Format / 221 \\
                 9.3.1 Restoring Extended cpio Archives / 224 \\
                 9.4 Future Directions / 224 \\
                 1 O: Proposed Revisions to POSIX.1 / 227 \\
                 10.1 Proposed New Interfaces / 227 \\
                 10.1.1 Symbolic Links / 228 \\
                 10.1.2 Changing Attributes of Open Files / 231 \\
                 10.1.3 Clarification of getgroups() and Supplementary
                 Groups / 232 \\
                 10.1.4 Setting Effective User and Group IDs / 233 \\
                 10.1.5 Manipulating Environment Variables / 233 \\
                 10.1.6 Input and Output / 234 \\
                 10.1.7 Traversing File Trees / 235 \\
                 10.1.8 Message Catalogues and Internationalization /
                 236 \\
                 10.1.9 New Feature Test Macro / 238 \\
                 10.2 Proposed Language-Independent Interface / 238 \\
                 11: Related Standards / 241 \\
                 11.1 The POSIX.1 FIPS / 242 \\
                 11.1.1 Portable Application Programs and the POSIX.1
                 FIPS / 244 \\
                 11.2 The TCOS Project / 244 \\
                 11.3 Interactions with 1003.2 / 246 \\
                 11.3.1 Name-Spaces / 247 \\
                 11.4 Other POSIX Standards / 252 \\
                 11.4.1 The POSIX Guide: 1003.0 / 254 \\
                 11.4.2 Shell and Tools: 1003.2 / 254 \\
                 11.4.3 Verification of Conformance: 1003.3 / 255 \\
                 11.4.4 Real-Time Systems: 1003.4 / 256 \\
                 11.4.5 Other POSIX Committees / 258 \\
                 11.4.6 The 1201 Committee / 260 \\
                 11.5 The XI Open Portability Guide / 261 \\
                 12: General C Portability Considerations / 263 \\
                 12.1 What C Does Not Guarantee / 263 \\
                 12.1.1 Questions of Sign and Sign Extension / 263 \\
                 12.1.2 Pointers / 265 \\
                 12.1.3 Byte Order and Structure Alignment / 267 \\
                 12.1.4 Order of Evaluation / 269 \\
                 12.1.5 Integral Promotions / 269 \\
                 12.2 Types / 270 \\
                 12.3 Function Argument Promotions / 271 \\
                 12.4 ANSI C or Common Usage C? 2 / 72 \\
                 12.5 Verification / 273 \\
                 12.6 Relative Portability, or Practical Nonportability
                 / 273 \\
                 Appendix A: POSIX.1 Functions / 277 \\
                 Appendix B: ANSI C Functions in POSIX.1 / 307 \\
                 Appendix C: Error Numbers / 331 \\
                 Appendix D: Headers and Their Contents / 337 \\
                 Appendix E: Signal-Safe Reentrant Functions / 347 \\
                 Appendix F: Access to Standards / 349 \\
                 References / 353 \\
                 Glossary / 355 \\
                 Index / 363",
}

@Book{Zobel:1997:WCS,
  author =       "Justin Zobel",
  title =        "Writing for Computer Science: the Art of Effective
                 Communication",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xiii + 176",
  year =         "1997",
  ISBN =         "981-3083-22-0 (paperback)",
  ISBN-13 =      "978-981-3083-22-6 (paperback)",
  LCCN =         "T11 .Z62 199",
  bibdate =      "Wed Mar 14 08:59:15 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$21.95",
  abstract =     "\booktitle{Writing for Computer Science} is a
                 comprehensive guide to effective scientific
                 communication. This highly readable book considers in
                 detail all the important elements of technical
                 presentation: writing style; editing and organization;
                 construction of graphs, figures, and tables;
                 presentation of mathematics and algorithms; development
                 of hypotheses; conduct and presentation of experiments;
                 the process of refereeing; and preparation and delivery
                 of short talks. With many examples drawn from
                 computing, \booktitle{Writing for Computer Science} is
                 an invaluable reference for both graduate students and
                 experienced researchers writing in the computing and
                 mathematical sciences.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "Technical writing; Communication of technical
                 information; Databehandling; Forskningsformidling;
                 Rapportskrivning; Communication of technical
                 information; Technical writing",
  tableofcontents = "1: Designing an article \\
                 2: Writing style: general guidelines \\
                 3: Writing style: specifics \\
                 4: Punctuation \\
                 5: Mathematics \\
                 6: Graphs, figures, and tables \\
                 7: Algorithms \\
                 8: Hypotheses and experiments \\
                 9: Editing \\
                 10: Refereeing \\
                 11: Presentation of short talks",
}

@Book{Zoellner:2009:UWEb,
  author =       "Tom Zoellner",
  title =        "Uranium: War, Energy, and the Rock That Shaped the
                 World",
  publisher =    pub-PENGUIN,
  address =      pub-PENGUIN:adr,
  pages =        "xii + 354",
  year =         "2009",
  ISBN =         "0-14-311672-X (paperback)",
  ISBN-13 =      "978-0-14-311672-1 (paperback)",
  LCCN =         "QD181.U7 Z64 2009",
  bibdate =      "Mon Mar 08 23:48:56 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Uranium is a common element in the earth's crust, and
                 the only naturally occurring mineral with the power to
                 end all life on the planet. After World War II, it
                 reshaped the global order. Marie Curie gave us hope
                 that uranium would be a miracle panacea, but the
                 Manhattan Project gave us reason to believe that
                 civilization would end with apocalypse. Slave labor
                 camps in Africa and Eastern Europe were built around
                 mine shafts, and America would knowingly send more than
                 600 uranium miners to their graves in the name of
                 national security. Fortunes have been made from this
                 yellow dirt; massive energy grids have been run from
                 it. Fear of it panicked the American people into
                 supporting a questionable war with Iraq and its specter
                 threatens to create another conflict in Iran. Now, some
                 are hoping it can help avoid a global warming
                 catastrophe.",
  acknowledgement = ack-nhfb,
  subject =      "Uranium; History; Uranium.",
  tableofcontents = "Introduction \\
                 Scalding fruit \\
                 Beginnings \\
                 The bargain \\
                 Apocalypse \\
                 Two rushes \\
                 The rainbow serpent \\
                 Instability \\
                 Renaissance \\
                 Legacy",
}

@Book{Zubarev:1974:NST,
  author =       "D. N. Zubarev",
  title =        "Nonequilibrium Statistical Thermodynamics",
  publisher =    "Consultants Bureau",
  address =      "New York, NY, USA",
  pages =        "xix + 489",
  year =         "1974",
  ISBN =         "0-306-10895-X",
  ISBN-13 =      "978-0-306-10895-2",
  LCCN =         "QX311.5.Z813",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Translated from the 1971 Russian edition by P. J.
                 Shepherd. Edited by P. Gray and P. J. Shepherd.",
  series =       "Studies in Soviet Science",
  acknowledgement = ack-nhfb,
  subject =      "Nonequilibrium thermodynamics; Statistical
                 thermodynamics; Thermodynamique statistique;
                 Nonequilibrium thermodynamics; Statistical
                 thermodynamics; Irreversibler Prozess;
                 Nichtgleichgewicht; Nichtgleichgewichtsthermodynamik;
                 Statistische Mechanik; Statistische Thermodynamik;
                 Thermodynamik; Thermodynamica; Statistische mechanica;
                 Niet-evenwichtssystemen; Thermodynamique statistique",
  tableofcontents = "Equilibrium statistical thermodynamics of classical
                 systems \\
                 Equilibrium statistical thermodynamics of quantum
                 systems \\
                 Irreversible processes induced by mechanical
                 perturbations \\
                 The nonequilibrium statistical operator",
}

@Misc{Zuse:1936:VSD,
  author =       "K. Zuse",
  title =        "{Verfahren zur selbstt{\"a}tigen Durchf{\"u}hrung von
                 Rechnungen mit Hilfe von Rechenmaschinen}. ({German})
                 [{Procedure} for automatic execution of calculations by
                 calculating machines]",
  howpublished = "German patent application Z23624.",
  day =          "11",
  month =        apr,
  year =         "1936",
  bibdate =      "Wed Oct 13 11:22:03 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Reprinted in \cite[\S 4.1]{Randell:1982:ODC}.",
  acknowledgement = ack-nhfb,
  language =     "German",
}

@InCollection{Zuse:1962:ERE,
  author =       "K. Zuse",
  editor =       "W. Hoffman",
  booktitle =    "{Digitale Informationswandler}",
  title =        "{Entwicklungslinien einer Rechenger{\"a}te-Entwicklung
                 von der Mechanik zur Elektronik}. ({German}) [Lines of
                 development of computing equipment development from
                 mechanics to electronics]",
  publisher =    "Vieweg \& Sohn, GmbH",
  address =      "Braunschweig, West Germany",
  pages =        "508--532",
  year =         "1962",
  bibdate =      "Wed Oct 13 11:23:04 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Reprinted in \cite[\S 4.3]{Randell:1982:ODC}.
                 Translated by Mr. and Mrs. P. Jones.",
  acknowledgement = ack-nhfb,
  language =     "German",
}

@Book{Zwillinger:1992:HI,
  author =       "Daniel Zwillinger",
  title =        "Handbook of Integration",
  publisher =    pub-A-K-PETERS,
  address =      pub-A-K-PETERS:adr,
  pages =        "xv + 367",
  year =         "1992",
  ISBN =         "0-86720-293-9, 1-4398-6584-1 (e-book)",
  ISBN-13 =      "978-0-86720-293-9, 978-1-4398-6584-2 (e-book)",
  LCCN =         "QA299.3 .Z85 1992",
  MRclass =      "65D32, 26A42, 65-00, 65D30, 68W30, 28-01, 26-01",
  bibdate =      "Sat Dec 24 15:53:15 MST 2005",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/numana1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook2.bib",
  abstract =     "This book is a compilation of the most important and
                 widely applicable methods for evaluating and
                 approximating integrals. It is an indispensable time
                 saver for engineers and scientists needing to evaluate
                 integrals in their work.",
  acknowledgement = ack-nhfb,
  bookformat =   "Hardcover",
  category =     "Professional \& Technical; Professional Science;
                 Mathematics; Pure Mathematics; Calculus",
  DEWEY =        "515.43 20",
  idnumber =     "541",
  keywords =     "Numerical integration",
  libnote =      "Not in my library.",
  subject =      "Numerical integration",
  tableofcontents = "Preface \\
                 Introduction \\
                 How to Use This Book \\
                 Part I: Applications of Integration \\
                 1: Differential Equations: Integral Representations \\
                 2: Differential Equations: Integral Transforms \\
                 3: Extremal Problems \\
                 4: Function Representation \\
                 5: Geometric Applications \\
                 6: MIT Integration Bee \\
                 7: Probability \\
                 8: Summations: Combinatorial \\
                 9: Summations: Other \\
                 10: Zeros of Functions \\
                 11: Miscellaneous Applications \\
                 Part II: Concepts and Definitions \\
                 12: Definitions \\
                 13: Integral Definitions \\
                 14: Caveats \\
                 15: Changing Order of Integration \\
                 16: Convergence of Integrals \\
                 17: Exterior Calculus \\
                 18: Feynman Diagrams \\
                 19: Finite Part of Integrals \\
                 20: Fractional Integration \\
                 21: Liouville Theory \\
                 22: Mean Value Theorems \\
                 23: Path Integrals \\
                 24: Principal Value Integrals \\
                 25: Transforms: To a Finite Interval \\
                 26: Transforms: Multidimensional Integrals \\
                 27: Transforms: Miscellaneous \\
                 Part III: Exact Analytical Methods \\
                 28: Change of Variable \\
                 29: Computer Aided Solution \\
                 30: Contour Integration \\
                 31: Convolution Techniques \\
                 32: Differentiation and Integration \\
                 33: Dilogarithms \\
                 34: Elliptic Integrals \\
                 35: Frullanian Integrals \\
                 36: Functional Equations \\
                 37: Integration by Parts \\
                 38: Line and Surface Integrals \\
                 39: Look Up Technique \\
                 40: Special Integration Techniques \\
                 41: Stochastic Integration \\
                 42: Tables of Integrals \\
                 Part IV: Approximate Analytical Methods \\
                 43: Asymptotic Expansions \\
                 44: Asymptotic Expansions: Multiple Integrals \\
                 45: Continued Fractions \\
                 46: Integral Inequalities \\
                 47: Integration by Parts \\
                 48: Interval Analysis \\
                 49: Laplace's Method \\
                 50: Stationary Phase \\
                 51: Steepest Descent \\
                 52: Approximations: Miscellaneous \\
                 Part V: Numerical Methods: Concepts \\
                 53: Introduction to Numerical Methods \\
                 54: Numerical Definitions \\
                 55: Error Analysis \\
                 56: Romberg Integration / Richardson Extrapolation \\
                 57: Software Libraries: Introduction \\
                 58: Software Libraries: Taxonomy \\
                 59: Software Libraries: Excerpts from GAMS \\
                 60: Testing Quadrature Rules \\
                 61: Truncating an Infinite Interval \\
                 Part VI: Numerical Methods: Techniques \\
                 62: Adaptive Quadrature \\
                 63: Clenshaw--Curtis Rules \\
                 64: Compound Rules \\
                 65: Cubic Splines \\
                 66: Using Derivative Information \\
                 67: Gaussian Quadrature \\
                 68: Gaussian Quadrature: Generalized \\
                 69: Gaussian Quadrature: Kronrod's Extension \\
                 70: Lattice Rules \\
                 71: Monte Carlo Method \\
                 72: Number Theoretic Methods",
}

@Book{Albers:1985:MPP,
  editor =       "Donald J. Albers and Gerald L. Alexanderson",
  booktitle =    "Mathematical People: Profiles and Interviews",
  title =        "Mathematical People: Profiles and Interviews",
  publisher =    pub-BIRKHAUSER,
  address =      pub-BIRKHAUSER:adr,
  pages =        "xvi + 2 + 372",
  year =         "1985",
  ISBN =         "0-8176-3191-7, 3-7643-3191-7",
  ISBN-13 =      "978-0-8176-3191-8, 978-3-7643-3191-7",
  LCCN =         "QA28 .M37 1985",
  bibdate =      "Sun Mar 25 08:44:00 MDT 2018",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/t/taussky-todd-olga.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/u/ulam-stanislaw-m.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  remark =       "Published in cooperation with the Mathematical
                 Association of America.",
  subject =      "Mathematicians; Biography",
  tableofcontents = "Foreword / Ivan Iven \\
                 Introduction: Reflections on writing the history of
                 mathematics / Philip J. Davis \\
                 Garrett Birkhoff / G. L. Alexanderson and Carroll Wilde
                 \\
                 David Blackwell / Donald J. Albers \\
                 Shiing-Shen Chern / William Chinn and John Lewis \\
                 John Horton Conway / Richard K. Guy \\
                 H. S. M. Coxeter / Dave Logothetti \\
                 Persi Diaconis / Donald J. Albers \\
                 Paul Erd{\H{o}}s / G. L. Alexanderson \\
                 Martin Gardner / Peter Renz and Anthony Barcellos \\
                 Ronald L. Graham / Bruce Schecter \\
                 Paul R. Halmos / Donald J. Albers \\
                 Peter J. Hilton / Lynn A. Steen and G. L. Alexanderson
                 \\
                 John Kemeny / Lynn A. Steen \\
                 Morris Kline / G. L. Alexanderson \\
                 Donald Knuth / Donald J. Albers and Lynn A. Steen \\
                 Beno{\^\i}t Mandelbrot / Anthony Barcellos \\
                 Henry O. Pollak / Donald J. Albers and Michael J.
                 Thibodeaux \\
                 George P{\'o}lya / G. L. Alexanderson \\
                 Mina Rees / Rosamond Dana and Peter J. Hilton \\
                 Constance Reid / G. L. Alexanderson \\
                 Herbert Robbins / Warren Page \\
                 Raymond Smullyan / Ira Mothner \\
                 Olga Taussky-Todd / Autobiographical Essay / 321--352
                 \\
                 Albert W. Tucker / Stephen B. Maurer \\
                 Reminiscences of Solomon Lefschetz / Albert W. Tucker
                 \\
                 Stanis{\l}aw M. Ulam / Anthony Barcellos / 367--374",
}

@Book{Anderson:2011:MDN,
  author =       "P. W. (Philip W.) Anderson",
  booktitle =    "More and different: notes from a thoughtful
                 curmudgeon",
  title =        "More and different: notes from a thoughtful
                 curmudgeon",
  publisher =    pub-WORLD-SCI,
  address =      pub-WORLD-SCI:adr,
  pages =        "ix + 412",
  year =         "2011",
  ISBN =         "981-4350-12-5 (hardcover), 981-4350-13-3 (paperback)",
  ISBN-13 =      "978-981-4350-12-9 (hardcover), 978-981-4350-13-6
                 (paperback)",
  LCCN =         "Q171 .A527 2011",
  bibdate =      "Mon Jul 1 07:08:35 MDT 2013",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/s/slater-john-clarke.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/physperspect.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "Philip Anderson was educated at University High School
                 in Urbana, Illinois, at Harvard (BS 1943, PhD 1949),
                 and further educated at Bell Laboratories, where his
                 career (1949--1984) coincided with the greatest period
                 of that remarkable institution. Starting in 1967, he
                 shared his time with Cambridge University (until 1975)
                 and then with Princeton, where he continued full time
                 as Joseph Henry Professor until 1997. As an emeritus he
                 remains active in research, and at press time he was
                 involved in several scientific controversies about high
                 profile subjects, in which his point of view, though
                 unpopular at the moment, is likely to prevail
                 eventually. His colleagues have made him one of the two
                 physicists most often cited in the scientific
                 literature, for several decades. His work is
                 characterized by mathematical simplicity combined with
                 conceptual depth, and by profound respect for
                 experimental findings. He has explored areas outside
                 his main discipline, the quantum theory of condensed
                 matter (for which he won the 1977 Nobel Prize), on
                 several occasions: his paper on what is now called the
                 ``Anderson--Higgs mechanism'' was a main source for
                 Peter Higgs' elucidation of the boson; a crucial
                 insight led to work on the dynamics of neutron stars
                 (pulsars); and his concept of the spin glass led far
                 afield, to developments in practical computer
                 algorithms and neural nets, and eventually to his
                 involvement in the early years of the Santa Fe
                 Institute and his co-leadership with Kenneth Arrow of
                 two influential workshops on economics at that
                 institution. His writing career started with a
                 much-quoted article in Science titled \booktitle{More
                 is Different} in 1971; he was an occasional columnist
                 for Physics Today in the 1980s and 1990s. He was more
                 recently a reviewer of science and science-related
                 books for the Times (London) Higher Education
                 Supplement as well as an occasional contributor to
                 Science, Nature, and other journals.",
  acknowledgement = ack-nhfb,
  keywords =     "quantum physics; solid-state physics",
  subject =      "Science",
  tableofcontents = "Personal reminiscences \\
                 History \\
                 Philosophy and sociology \\
                 Science tactics and strategy \\
                 Genius \\
                 Science wars \\
                 Politics and science \\
                 Futurology \\
                 Complexity \\
                 Popularization attempts",
}

@Book{Anonymous:1996:BTF,
  author =       "Anonymous",
  booktitle =    "Behind tall fences: stories and experiences about {Los
                 Alamos} at its beginning",
  title =        "Behind tall fences: stories and experiences about {Los
                 Alamos} at its beginning",
  publisher =    pub-LOS-ALAMOS-HISTORICAL-SOCIETY,
  address =      pub-LOS-ALAMOS-HISTORICAL-SOCIETY:adr,
  pages =        "xiv + 210",
  year =         "1996",
  ISBN =         "0-941232-91-3",
  ISBN-13 =      "978-0-941232-91-3",
  LCCN =         "QC773.3.U5 B43 1996",
  bibdate =      "Sun Mar 1 11:29:59 MST 2015",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/m/metropolis-nicholas.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/o/oppenheimer-j-robert.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Atomic bomb; United States; History; New Mexico; Los
                 Alamos; Atomic bomb.",
  tableofcontents = "Prelude to Los Alamos \\
                 Hugh T. Richards / Some 1942 Fast-Neutron Measurements
                 at Rice and Minnesota / 1 \\
                 Joseph L. McKibben / Contribution of the Two Van de
                 Graaff Accelerators Built at the University of
                 Wisconsin to the Los Alamos Project / 5 \\
                 Alfred O. Hanson / Instrumental Developments and
                 Fast-Neutron Fission Studies at Wisconsin During the
                 Pre-Bomb Period, 1940--1943 / 16 \\
                 L. D. P. King / Early Measurements at Purdue of Some
                 Fusion Reaction Cross Sections / 32 \\
                 Robert Serber / Theoretical Studies at Berkeley / 53
                 \\
                 Recollections \\
                 L. D. P. King / The Development of Nuclear Explosives
                 and Frontier Days at Los Alamos / 57 \\
                 Nicholas C. Metropolis / Random Reminiscences / 69 \\
                 Arthur Wahl / Los Alamos 1943 / 87 \\
                 Berlyn Brixner / A Scientific Photographer at Project Y
                 / 90 \\
                 Charles L. Critchfield / The First Implosion at Los
                 Alamos / 101 \\
                 Edward F. Hammel / Recollections of Plutonium
                 Metallurgy Work in D-Building / 103 \\
                 Joseph L. McKibben / Timing on the Trinity Bomb
                 Explosion / 112 \\
                 Hugh T. Richards / The Making of the Bomb: A Personal
                 Perspective / 116 \\
                 Poster Evans / Early Super Work / 135 \\
                 John Allred and Louis Rosen / First Fusion Neutrons
                 from a Thermonuclear Weapon Device: Two Researchers'
                 Personal Accounts / 143 \\
                 J. Carson Mark / A Maverick View / 155 \\
                 Impressions \\
                 Unknown GI / Los Alamos Blues / 168 \\
                 Charles L. Critchfield / The Robert Oppenheimer I Knew
                 / 169 \\
                 Karan McKibben / Behind Tall Fences / 178 \\
                 Serguei Kapitsa / Our Nonlinear World [Twenty-third J.
                 Robert Oppenheimer Lecture, August 1993] / 182 \\
                 Richard Rhodes / A Different Country / 197 \\
                 Glossary / / 209",
}

@Book{Arfken:2013:MMP,
  author =       "George B. (George Brown) Arfken and Hans-J{\"u}rgen
                 Weber and Frank E. Harris",
  booktitle =    "Mathematical Methods for Physicists: a Comprehensive
                 Guide",
  title =        "Mathematical Methods for Physicists: a Comprehensive
                 Guide",
  publisher =    pub-ELSEVIER-ACADEMIC,
  address =      pub-ELSEVIER-ACADEMIC:adr,
  edition =      "Seventh",
  pages =        "xiii + 1205",
  year =         "2013",
  ISBN =         "0-12-384654-4 (hardcover)",
  ISBN-13 =      "978-0-12-384654-9 (hardcover)",
  LCCN =         "QA37.3 .A74 2013",
  bibdate =      "Thu May 3 08:02:53 MDT 2012",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/h/harris-frank-e.bib;
                 https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/numana2010.bib;
                 jenson.stanford.edu:2210/unicorn",
  acknowledgement = ack-nhfb,
  subject =      "Mathematical analysis; Mathematical physics",
  tableofcontents = "Preface / xi--xiii \\
                 1: Mathematical Preliminaries / 1--82 \\
                 2: Determinants and Matrices / 83--121 \\
                 3: Vector Analysis / 123--203 \\
                 4: Tensors and Differential Forms / 205--249 \\
                 5: Vector Spaces / 251--297 \\
                 6: Eigenvalue Problems / 299--328 \\
                 7: Ordinary Differential Equations / 329--380 \\
                 8: Sturm--Liouville Theory / 381--399 \\
                 9: Partial Differential Equations / 401--445 \\
                 10: Green's Functions / 447--467 \\
                 11: Complex Variable Theory / 469--550 \\
                 12: Further Topics in Analysis / 551--598 \\
                 13: Gamma Function / 599--641 \\
                 14: Bessel Functions / 643--713 \\
                 15: Legendre Functions / 715--772 \\
                 16: Angular Momentum / 773--814 \\
                 17: Group Theory / 815--870 \\
                 18: More Special Functions / 871--933 \\
                 19: Fourier Series / 935--962 \\
                 20: Integral Transforms / 963--1046 \\
                 21: Integral Equations / 1047--1079 \\
                 22: Calculus of Variations / 1081--1124 \\
                 23: Probability and Statistics / 1125--1179 \\
                 Index / 1181--1205",
}

@Book{Aspray:1987:PJN,
  editor =       "William Aspray and Arthur Burks",
  booktitle =    "Papers of {John von Neumann} on Computing and Computer
                 Theory",
  title =        "Papers of {John von Neumann} on Computing and Computer
                 Theory",
  volume =       "12",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "xviii + 624",
  year =         "1987",
  ISBN =         "0-262-22030-X",
  ISBN-13 =      "978-0-262-22030-9",
  LCCN =         "QA76.5 .P31451 1987",
  bibdate =      "Mon Sep 16 16:40:48 2002",
  bibsource =    "ftp://ftp.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Math/fparith.bib;
                 ftp://ftp.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See \cite{Knuth:1970:VNF}.",
  series =       "Charles Babbage Institute reprint series for the
                 history of computing",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject-dates = "John von Neumann (1903--1957)",
  tableofcontents = "Preface xi\\
                 Biographical Notes xiii \\
                 I. Computer Architecture and Logical Design \\
                 Introduction 3 \\
                 1. First Draft of a Report on the EDVAC 17 \\
                 2. Donald Knuth---Von Neumann's First Computer Program
                 83 \\
                 3. Preliminary Discussion of the Logical Design of an
                 Electronic Computing Instrument (with Arthur W. Burks
                 and Herman H. Goldstine) 97 \\
                 II. Computer Programming and Flow Diagrams Introduction
                 145 \\
                 Planning and Coding of Problems for an Electronic
                 Computing Instrument (with Herman H. Goldstine) \\
                 4. Planning and Coding of Problems, vol. 1 151 \\
                 5. Planning and Coding of Problems, vol. 2 223 \\
                 6. Planning and Coding of Problems, vol. 3 286 \\
                 III. Large-Scale High-Speed Computing \\
                 Introduction 309 \\
                 7. On the Principles of Large Scale Computing Machines
                 (with Herman H. Goldstine) 317 \\
                 8 The Future of High-Speed Computing 349 \\
                 9. The NORC and Problems in High Speed Computing 350
                 \\
                 IV. Theory of Natural and Artificial Automata \\
                 Introduction 363 \\
                 10. The General and Logical Theory of Automata 391 \\
                 11. Theory and Organization of Complicated Automata 432
                 \\
                 First Lecture: Computing Machines in General 434 \\
                 Second Lecture: Rigorous Theories of Control and
                 Information 445 \\
                 Third Lecture: Statistical Theories of Information 460
                 \\
                 Fourth Lecture: The Role of High and of Extremely High
                 Complication 467 \\
                 Fifth Lecture: Re-evaluation of the Problems of
                 Complicated Automata-Problems of Hierarchy and
                 Evolution 477 \\
                 12. Von Neumann's Self-Reproducing Automata, edited by
                 Arthur W. Burks 491 \\
                 13. Probabilistic Logics and the Synthesis of Reliable
                 Organisms from Unreliable Components 553 \\
                 Bibliography 603 \\
                 References 611",
}

@Book{Austrian:1982:HHF,
  author =       "Geoffrey D. Austrian",
  booktitle =    "{Herman Hollerith} --- Forgotten Giant of Information
                 Processing",
  title =        "{Herman Hollerith} --- Forgotten Giant of Information
                 Processing",
  publisher =    pub-COLUMBIA,
  address =      pub-COLUMBIA:adr,
  pages =        "xvi + 418",
  year =         "1982",
  ISBN =         "0-231-05146-8",
  ISBN-13 =      "978-0-231-05146-0",
  LCCN =         "QA76.2.H64 .A97",
  bibdate =      "Tue Dec 14 22:40:03 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/babbage-charles.bib;
                 https://www.math.utah.edu/pub/tex/bib/adabooks.bib;
                 https://www.math.utah.edu/pub/tex/bib/annhistcomput.bib;
                 https://www.math.utah.edu/pub/tex/bib/css.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  remark =       "Brief mention of Charles Babbage.",
  tableofcontents = "Preface / ix \\
                 Acknowledgments / xiii \\
                 1. Discovering the Census Problem / 1 \\
                 2. Instructor at M.I.T. / 11 \\
                 3. Grounding as a Patent Expert / 19 \\
                 4. Experiments with Air Brakes / 24 \\
                 5. Trials for a Census System / 39 \\
                 6. 1890: Beating the Mills of the Gods / 58 \\
                 7. Taking the Census Abroad / 74 \\
                 8. Setting Up Shop in Georgetown / 97 \\
                 9. Railroad Experiments / 107 \\
                 10. Persuading the Russians / 115 \\
                 11. Taking on the Central / 124 \\
                 12. The Russian Census / 142 \\
                 13. The Tabulating Machine Company / 152 \\
                 14. 1900: Putting Information on the Assembly Line /
                 168 \\
                 15. Probing the Commercial Market / 197 \\
                 16. Getting Started in Britain / 212 \\
                 17. ``My Row with North'' / 221 \\
                 18. Commercial Success / 238 \\
                 19. An Unusual Competitor: the Government / 258 \\
                 20. Enter Mr. Powers / 267 \\
                 21. The Growing Impasse / 277 \\
                 22. {\em Tabulating Machine Co.} v. {\em Durand} / 296
                 \\
                 23. Hollerith Sells Out / 306 \\
                 24. A Life of Leisure / 315 \\
                 25. The Rise of IBM / 323 \\
                 Notes / 349 \\
                 Selected Bibliography / 403 \\
                 Index / 407",
}

@Proceedings{Bergin:1996:HPL,
  editor =       "Thomas J. {Bergin, Jr.} and Richard G. {Gibson, Jr.}",
  booktitle =    "History of Programming Languages {II}",
  title =        "History of Programming Languages {II}",
  publisher =    pub-ACM # " and " # pub-AW,
  address =      pub-ACM:adr # " and " # pub-AW:adr,
  pages =        "xvi + 864",
  year =         "1996",
  ISBN =         "0-201-89502-1",
  ISBN-13 =      "978-0-201-89502-5",
  LCCN =         "QA76.7 .H558 1996",
  bibdate =      "Wed Nov 19 08:49:59 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Drawn from the Second ACM SIGPLAN History of
                 Programming Languages Conference.",
  abstract =     "This specially prepared work compromises a living
                 archive of important programming languages, described
                 by the people most instrumental in their creation and
                 development. Drawn from the ACM/SIGPLAN Second History
                 of Programming Languages Conference, this volume, like
                 the earlier book from the first such conference (HOPL),
                 conveys the motivations of the language designers and
                 the reasons why they rejected existing languages and
                 created new ones. The book relates the processes by
                 which different languages evolved, in the words of the
                 individuals active in the languages' development. Most
                 important, participants share insights about influences
                 and decisions, both on choices made and on the many
                 roads not taken. In the book's conclusion,
                 distinguished historians of computing share views about
                 preserving programming language history. Fourteen
                 chapters cover a broad range of languages in wide use
                 today, as well as lesser known languages that made
                 significant contributions to programming language
                 evolution: C, C++, Smalltalk, Pascal, Ada, Prolog,
                 Lisp, ALGOL 68, FORMAC, CLU, Icon, Forth, Monitors and
                 Concurrent Pascal, and Discrete Simulation Languages.
                 Prominent contributors to the book are Frederick
                 Brooks, Alain Colmerauer, Richard Gabriel, Ralph
                 Griswold, Per Brinch Hansen, Alan Kay, C. H. Lindsey,
                 Barbara Liskov, Richard Nance, Elizabeth Rather, Dennis
                 Ritchie, Jean Sammet, Guy Steele, Bjarne Stroustrup,
                 William Whitaker, and Niklaus Wirth. Together, the
                 conference contributors and the book's editors have put
                 together a volume of interest to researchers, teachers,
                 students, and computing professionals everywhere who
                 are involved in the use or the development of
                 programming languages today.",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "The opening session \\
                 ALGOL 68 session \\
                 Pascal session \\
                 Monitors and concurrent Pascal session \\
                 Ada session \\
                 Lisp session \\
                 Prolog session \\
                 Discrete event simulation languages session \\
                 FORMAC session \\
                 CLU session \\
                 Smalltalk session \\
                 Icon session \\
                 Forth session \\
                 C session \\
                 C++ session \\
                 Forum on the history of computing (April 20, 1993)",
  tableofcontents = "Development of the HOPL-II Program \\
                 Conference Chairman's Opening Remarks / John A. N. Lee
                 \\
                 Language Design as Design / Frederick P. Brooks, Jr.
                 \\
                 From HOPL to HOPL-II (1978--1993): 15 Years of
                 Programming Language Development / Jean E. Sammet \\
                 Making History / Michael S. Mahoney \\
                 History of ALGOL 68 / C. H. Lindsey \\
                 Recollections about the Development of Pascal / N.
                 Wirth \\
                 Monitors and Concurrent Pascal: A Personal History /
                 Per Brinch Hansen \\
                 ADA \\
                 The Project: The DoD High Order Language Working Group
                 / William A. Whitaker \\
                 Evolution of Lisp / Guy L. Steele, Jr. and Richard P.
                 Gabriel \\
                 Birth of Prolog / Alain Colmerauer and Philippe Roussel
                 \\
                 History of Discrete Event Simulation Programming
                 Languages / Richard E. Nance \\
                 Beginning and Development of Formac (FORmula
                 MAnipulation Compiler) / Jean E. Sammet \\
                 History of CLU / Barbara Liskov \\
                 Early History of Smalltalk / Alan C. Kay \\
                 History of the Icon Programming Language / Ralph E.
                 Griswold and Madge T. Griswold \\
                 Evolution of Forth / Donald R. Colburn, Charles H.
                 Moore and Elizabeth D. Rather \\
                 Development of the C Programming Language / Dennis M.
                 Ritchie \\
                 History of C++: 1979--1991 / Bjarne Stroustrup \\
                 Issues in the History of Computing / Michael S. Mahoney
                 \\
                 Archives Specializing in the History of Computing /
                 Bruce H. Bruemmer \\
                 Role of Museums in Collecting Computers / Gwen Bell /
                 Edited by Robert F. Rosin \\
                 Annals of the History of Computing and Other Journals /
                 Bernard A. Galler \\
                 Effective History Conference / Jean E. Sammet \\
                 University Courses / Martin Campbell-Kelly \\
                 Documenting Projects with History in Mind / Michael
                 Marcotty \\
                 Issues in the Writing of Contemporary History / J. A.
                 N. Lee \\
                 Forum Closing Panel \\
                 Appendix A: What Makes History? / Michael S. Mahoney
                 \\
                 Appendix B: Call for Papers \\
                 Appendix C: List of Attendees \\
                 Appendix D: Final Conference Program",
}

@Book{Bernardini:2004:EFH,
  editor =       "C. (Carlo) Bernardini and Luisa Bonolis",
  booktitle =    "{Enrico Fermi}: His Work and Legacy",
  title =        "{Enrico Fermi}: His Work and Legacy",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xii + 410",
  year =         "2004",
  DOI =          "https://doi.org/10.1007/978-3-662-01160-7",
  ISBN =         "88-7438-015-1 (SIF, Bologna, Italy), 3-540-22141-7
                 (Springer-Verlag, Berlin, Heidelberg, New York)",
  ISBN-13 =      "978-88-7438-015-2 (SIF, Bologna, Italy),
                 978-3-540-22141-8 (Springer-Verlag, Berlin, Heidelberg,
                 New York)",
  LCCN =         "QC774.F4 C6613 2004",
  bibdate =      "Sat Jun 16 17:43:09 MDT 2012",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/f/fermi-enrico.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0818/2004108212-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0818/2004108212-t.html",
  acknowledgement = ack-nhfb,
  keywords =     "Bologna: Societ{\`a} Italiana di Fisica (SIF)",
  remark =       "English translation of Italian original
                 \cite{Bernardini:2002:CFN}.",
  subject =      "Fermi, Enrico; nuclear physics; history",
  subject-dates = "1901--1954",
  tableofcontents = "Commemoration of Enrico Fermi (Edoardo Amaldi) \\
                 Commemoration of Enrico Fermi (Enrico Persico) \\
                 Enrico Fermi and Italian physics (Franco Rasetti) \\
                 Enrico Fermi and solid state physics (Franco Bassani)
                 \\
                 Fermi's statistics (Giorgio Parisi) \\
                 Classical mechanics and the quantum revolution in
                 Fermi's early works (Giovanni Gallavotti) \\
                 On the adiabatic invariants (Tullio Levi-Civita) \\
                 Fermi's coordinates and the principle of equivalence
                 (Bruno Bertotti) \\
                 Fermi and quantum electrodynamics (Marcello Cini) \\
                 Weak interactions (Nicola Cabibbo) \\
                 Nuclear physics from the nineteen thirties to the
                 present day (Ugo Amaldi) \\
                 The birth of nuclear energy: Fermi's pile (Carlo
                 Salvetti) \\
                 From the Chicago Pile 1 to the next-generation reactors
                 (Augusto Gandini) \\
                 Reactors and nuclear technology: development in the
                 world (Maurizio Cumo) \\
                 The scientific legacy of Fermi in particle physics
                 (Maurice Jacob and Luciano Maiani) \\
                 Enrico Fermi's contributions to non-linear systems: the
                 influence of an unpublished article (Massimo Falcioni
                 and Angelo Vulpiani) \\
                 Fermi's last lessons (Renato Angelo Ricci) \\
                 Enrico Fermi's scientific work (Lisa Bonolis) \\
                 Bibliography \\
                 Index",
  xxaddress =    "Societ\`a Italiana di Fisica, Bologna, Italy",
  xxpublisher =  "Springer",
}

@Book{Bethe:1991:RAP,
  author =       "Hans Albrecht Bethe",
  booktitle =    "The road from {Los Alamos}: Profound perspective and
                 personal viewpoints on atomic weapons, nuclear power,
                 and science",
  title =        "The road from {Los Alamos}: Profound perspective and
                 personal viewpoints on atomic weapons, nuclear power,
                 and science",
  publisher =    pub-AIP,
  address =      pub-AIP:adr,
  pages =        "xvii + 286",
  year =         "1991",
  ISBN =         "0-88318-707-8, 0-671-74012-1",
  ISBN-13 =      "978-0-88318-707-4, 978-0-671-74012-2",
  LCCN =         "U264 .B455 1991",
  bibdate =      "Mon Dec 12 15:57:22 MST 2005",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/bethe-hans.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/b/bohr-niels.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/f/feynman-richard-p.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/g/goudsmit-samuel-a.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/h/heisenberg-werner.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/o/oppenheimer-j-robert.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/t/teller-edward.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  price =        "US\$24.95",
  series =       "Masters of modern physics",
  acknowledgement = ack-nhfb,
  author-dates = "Hans Albrecht Bethe (1906--2005)",
  remark-1 =     "From page 27: ``My opinion about the [Oppenheimer]
                 trial is well known and has been best stated by Werner
                 von Braun in testimony before a Congressional
                 committee: `In England, Oppenheimer would have been
                 knighted.'\,''",
  remark-2 =     "Page 43 discusses Bethe's presentation of the `theory
                 of the big hole', on underground nuclear testing, and
                 its detectability, to the Russian side of disarmament
                 negotiations in Geneva in November 1959.",
  subject =      "Nuclear weapons; Atomic bomb; History",
  tableofcontents = "1 The bomb \\
                 How close is the danger? (with Frederick Seitz) \\
                 The hydrogen bomb \\
                 Brighter than a thousand suns \\
                 Ultimate catastrophe? \\
                 2 Arms control \\
                 The case for ending nuclear tests \\
                 Disarmament and strategy \\
                 Antiballistic-missile systems (with Richard L. Garwin)
                 \\
                 Meaningless superiority \\
                 We are not inferior to the Soviets \\
                 The five year war plan (with Kurt Gottfried) \\
                 Debate: elusive security (with Kurt Gottfried, response
                 by Malcolm Wallop) \\
                 Space based ballistic missile defence (with Richard L.
                 Garwin, Kurt Gottfried, and Henry W. Kendall) \\
                 The technological imperative \\
                 Reducing the risk of nuclear war (with Robert S.
                 McNamara) \\
                 Chop down nuclear arsenals \\
                 3 The freeze \\
                 The value of a freeze (with Franklin A. Long) \\
                 Debate: Bethe vs. Teller (response by Edward Teller)
                 \\
                 After the freeze referendum (with Franklin A. Long) \\
                 4 Advice and dissent \\
                 Science and morality (with Donald McDonald) \\
                 Back to science advisors (with John Bardeen) \\
                 5 Nuclear power \\
                 The necessity of fission power \\
                 Debate: Nuclear Safety (response by Frank von Hippel)
                 \\
                 Chernobyl \\
                 6 Five physicists \\
                 J. Robert Oppenheimer \\
                 Freeman Dyson \\
                 Herman W. Hoerlin (with Donald M. Kerr and Robert A.
                 Jeffries) \\
                 Paul P. Ewald (with H. J. Juretschke, A. F. Moodie, and
                 H. K. Wagenfeld) \\
                 Richard P. Feynman \\
                 7 Astrophysics: energy production in stars \\
                 How a supernova explodes (with Gerald Brown) \\
                 Acknowledgments \\
                 Index",
}

@Book{Blumberg:1976:ECL,
  author =       "Stanley A. Blumberg and Gwinn Owens",
  booktitle =    "Energy and conflict: the life and times of {Edward
                 Teller}",
  title =        "Energy and conflict: the life and times of {Edward
                 Teller}",
  publisher =    pub-PUTNAM,
  address =      pub-PUTNAM:adr,
  pages =        "xvii + 492 + 4",
  year =         "1976",
  ISBN =         "0-399-11551-X",
  ISBN-13 =      "978-0-399-11551-6",
  LCCN =         "QC16.T37 B58 1976",
  bibdate =      "Thu Oct 6 06:57:45 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/o/oppenheimer-j-robert.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/s/szilard-leo.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/t/teller-edward.bib;
                 https://www.math.utah.edu/pub/tex/bib/bullatsci.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  price =        "US\$12.95",
  URL =          "http://alsos.wlu.edu/information.aspx?id=367",
  abstract =     "In this 1976 biography of Edward Teller, father of the
                 hydrogen bomb, the authors present exclusive
                 interviews, memorabilia, and photos provided by Teller.
                 The book does not focus on one era of Teller's life,
                 but delves into each stage of his life and career. The
                 controversial Teller spearheaded America's effort to
                 build the hydrogen bomb, and then testified against
                 Robert Oppenheimer in his security clearance trial. The
                 book explains his early persecution by the Hungarian
                 communists, then the Nazis in Germany. His role in the
                 Manhattan Project is described in detail. Also
                 portrayed is the development of the H-bomb, including
                 descriptions of its evolving design. Teller's life
                 after the H-bomb is shown to a limited extent, with
                 government surveillance of his activities and his
                 despair over the limited test ban treaty as two of the
                 highlights. The book offers a detailed and
                 comprehensive view of Edward Teller. Though objective,
                 the biography emphasizes the interviews with Teller and
                 does not always fully treat the opinions of his
                 critics.",
  acknowledgement = ack-nhfb,
  subject =      "Teller, Edward",
  subject-dates = "1908--2003",
  tableofcontents = "Acknowledgments / ix \\
                 Introduction / xiii \\
                 1. The Russians Are Coming / 1 \\
                 2. Birth and Death of a Golden Age / 28 \\
                 3. The Quantum Jump / 51 \\
                 4. The Garfield Street Gang / 64 \\
                 5. Duty Whispers Low / 79 \\
                 6. Prospects of Doomsday / 102 \\
                 7. Rebel on the Assembly Line / 124 \\
                 8. Woe Without Warning / 142 \\
                 9. Flashback to Budapest / 164 \\
                 10. Deuterium, Tritium, and Politics / 184 \\
                 11. The Capture of Washington / 213 \\
                 12. Fusion and Confusion / 232 \\
                 13. Racing Through the Fog / 263 \\
                 14. Background for a Tragedy / 299 \\
                 15. The Oppenheimer Noose / 321 \\
                 i6. The Witness / 342 \\
                 17. The Years of the Black Bugs / 364 \\
                 i8. The Era of the Falling Out / 381 \\
                 19. There Is No Peace / 415 \\
                 Appendix I: What I Did in Los Alamos in World War II
                 [letter from Edward Teller] / 453 \\
                 Appendix II: Petition Circulated by Leo Szilard to
                 Oppose U.S. Use of Atomic Bomb Against Japan, July 17,
                 1945 / 459 \\
                 Notes / 461 \\
                 Index / 479",
}

@Book{Borwein:2008:CMD,
  editor =       "Jonathan M. Borwein and E. M. (Eugenio M.) Rocha and
                 Jos{\'e}-Francisco Rodrigues",
  booktitle =    "Communicating Mathematics in the Digital Era",
  title =        "Communicating Mathematics in the Digital Era",
  publisher =    pub-A-K-PETERS,
  address =      pub-A-K-PETERS:adr,
  pages =        "xii + 325",
  year =         "2008",
  DOI =          "https://doi.org/10.1201/b10587",
  ISBN =         "1-56881-410-0",
  ISBN-13 =      "978-1-56881-410-0",
  LCCN =         "QA76.95 .C59 2008",
  bibdate =      "Tue Nov 10 17:48:02 MST 2009",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/borwein-jonathan-m.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/toc/fy0903/2008022183.html",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  remark =       "This book reflects many of the contributions \ldots{}
                 that were delivered and discussed at the ICM 2006
                 satellite meeting entitled ``Communicating Mathematics
                 in the Digital Era'' (CMDE2006), which took place at
                 the University of Aveiro in Portugal, August 15--18,
                 2006.",
  subject =      "mathematics; data processing; congresses; libraries
                 and electronic publishing; image processing; digital
                 techniques",
  tableofcontents = "Front Matter / i \\
                 Part I. Electronic Publishing and Digital Libraries / 1
                 \\
                 1. Disseminating and Preserving Mathematical Knowledge
                 / E. M. Rocha / 3 \\
                 2. The Digital Downside / J. Ewing / 23 \\
                 3. Implementing Electronic Access for an Independent
                 Journal / K. Kaiser / 31 \\
                 4. Toward a Digital Mathematics Library? / T. Bouche /
                 47 \\
                 5. The DML-CZ Project / M. Barto{\v{s}}ek, M.
                 Lhot{\'a}k, J. R{\'a}kosn{\'\i}k, P. Sojka, M.
                 {\v{S}}{\'a}rfy / 75 \\
                 6. The DML-E Digitization Project and Related Topics /
                 E. Mac{\'\i}as-Virg{\'o}s / 87 \\
                 7. Digital Libraries and the Rebirth of Printed
                 Journals / J. Borbinha / 97 \\
                 8. A Digital Library Framework for the University of
                 Aveiro / M. Fernandes, P. Almeida, J. A. Martins, J. S.
                 Pinto / 111 \\
                 Part 2. Technology Enhancements for Disseminating
                 Mathematics / 125 \\
                 9. Coast-to-Coast (C2C) Seminar / J. Borwein, V.
                 Jungi{\'c}, D. Langstroth, M. Macklem, S. Wilson / 127
                 \\
                 10. Digitally Enhanced Documents / K. Kanev, N.
                 Mirenkov, N. Kamiya / 141 \\
                 11. Speech and Tactile Assistive Technologies / C.
                 Bernareggi, V. Brigatti, D. Campanozzi, A. Messini /
                 157 \\
                 12. On the Conversion between Content MathML and
                 OpenMath / C. M. So, S. M. Watt / 169 \\
                 13. XML-Based Format for Geometry / P. Quaresma, P.
                 Jani{\v{c}}i{\'c}. Toma{\v{s}}evi{\'c}, M.
                 V.-Jani{\v{c}}i{\'c}, and D. To{\v{s}}i{\'c} / 183 \\
                 14. From Parametrized Graphics to Interactive
                 Illustrations / M. Kraus / 199 \\
                 Part 3. Educational and Cultural Frameworks / 213 \\
                 15. Reaching Mathematical Audiences across All Levels /
                 T. Banchoff / 215 \\
                 16. Toward Autonomous Learners of Mathematics / Olga
                 Caprott, Mika Sepp{\"a}l{\"a}, Sebastian Xamb{\'o} /
                 225 \\
                 17. The IntBook Concept as an Adaptive Web Environment
                 / A. Breda, T Parreira, E. M. Rocha / 239 \\
                 18. An Educational Environment Based on Ontology / K.
                 Sugita, T. Goto, T. Yaku, K. Tsuchida / 255 \\
                 19. Art and Mathematics / M. Francaviglia, M. G.
                 Lorenzi, P. Pantano / 265 \\
                 Appendix A. List of C2C Past Talks / 279 \\
                 Appendix B. Guidelines for Managing a Distributed
                 Seminar / 281 \\
                 Appendix C. Curriculum Guideline and Mathtext Example /
                 295 \\
                 Bibliography / 299 \\
                 List of URLs / 313 \\
                 Contributors / 319",
}

@Book{Bosma:2006:DMM,
  editor =       "Wieb Bosma and John Cannon",
  booktitle =    "Discovering Mathematics with {Magma}: Reducing the
                 Abstract to the Concrete",
  title =        "Discovering Mathematics with {Magma}: Reducing the
                 Abstract to the Concrete",
  volume =       "19",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xxiv + 374",
  year =         "2006",
  DOI =          "https://doi.org/10.1007/978-3-540-37634-7",
  ISBN =         "3-540-37632-1 (hardcover), 3-540-37634-8 (e-book)",
  ISBN-13 =      "978-3-540-37632-3 (hardcover), 978-3-540-37634-7
                 (e-book)",
  ISSN =         "1431-1550",
  LCCN =         "QA155.7.E4 D57 2006",
  MRclass =      "00B15 (11-06 14-06 20-06)",
  MRnumber =     "2265375 (2007h:00016)",
  bibdate =      "Sat Aug 9 14:06:25 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/magma.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Algorithms and computation in mathematics",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0824/2006931477-b.html;
                 http://www.loc.gov/catdir/enhancements/fy0824/2006931477-d.html;
                 http://www.loc.gov/catdir/toc/fy0707/2006931477.html;
                 http://www.springerlink.com/content/978-3-642-01960-9;
                 http://www.springerlink.com/openurl.asp?genre=book&isbn=978-3-540-37632-3",
  abstract =     "With a design based on the ontology and semantics of
                 algebra, Magma enables users to rapidly formulate and
                 perform calculations in the more abstract parts of
                 mathematics. This book introduces the role Magma plays
                 in advanced mathematical research through 14 case
                 studies which, in most cases, describe computations
                 underpinning theoretical results.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Algebra; Data processing; Alg{\`e}bre; Informatique;
                 Mathematics; Abstract; Algebra; Data processing;
                 algebra; data processing; symbolic algebra",
  tableofcontents = "Preface \\
                 Magma: the project \\
                 Discovering mathematics: about this volume \\
                 How to read the Magma code? \\
                 Some computational experiments in number theory / Wieb
                 Bosma \\
                 Applications of the class field theory of global fields
                 / Claus Fieker \\
                 Some ternary Diophantine equations of signature (n, n,
                 2) / Nils Bruin \\
                 Studying the Birch and Swinnerton-Dyer conjecture for
                 modular abelian varieties using Magma / William Stein
                 \\
                 Computing with the analytic Jacobian of a genus 2 curve
                 / Paul B. van Wamelen \\
                 Graded rings and special K3 surfaces / Gavin Brown \\
                 Constructing the split octonions / Donald E. Taylor \\
                 Support varieties for modules / Jon F. Carlson \\
                 When is projectivity detected on subalgebras? / Jon F.
                 Carlson \\
                 Cohomology and group extensions in Magma / Derek F.
                 Holt \\
                 Computing the primitive permutation groups of degree
                 less than 1000 / Colva M. Roney-Dougal and William R.
                 Unger \\
                 Computer aided discovery of a fast algorithm for
                 testing conjugacy in braid groups / Volker Gebhardt \\
                 Searching for linear codes with large minimum distance
                 / Markus Grassl \\
                 Colouring planar graphs / Paulette Lieby \\
                 Appendix: The Magma language / Geoff Bailey",
}

@Book{Brown:1993:MGS,
  editor =       "Laurie M. Brown and John S. Rigden",
  booktitle =    "Most of the Good Stuff: Memories of {Richard
                 Feynman}",
  title =        "Most of the Good Stuff: Memories of {Richard
                 Feynman}",
  publisher =    pub-AIP,
  address =      pub-AIP:adr,
  pages =        "181 + 16",
  year =         "1993",
  ISBN =         "0-88318-870-8",
  ISBN-13 =      "978-0-88318-870-5",
  LCCN =         "QC16.F49 A3 1993",
  bibdate =      "Mon Dec 12 15:35:40 MST 2005",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/bethe-hans.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/d/dyson-freeman-j.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/f/feynman-richard-p.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  note =         "Commentary by Joan Feynman, John Wheeler, Hans Bethe,
                 Julian Schwinger, Murray Gell-Mann, Daniel Hillis,
                 David Goodstein, Freeman Dyson, and Laurie Brown.",
  acknowledgement = ack-nhfb,
  author-dates = "Richard Phillips Feynman (1918--1988)",
  libnote =      "Not yet in my library.",
  subject =      "Feynman, Richard Phillips; Physics; History;
                 Physicists; United States; Biography",
  subject-dates = "1918--1988",
  tableofcontents = "The young Feynman / John Archibald Wheeler \\
                 Feynman in Los Alamos and Cornell / Hans Albrecht Bethe
                 \\
                 Feynman at Cornell / Freeman J. Dyson \\
                 To have been a student of Richard Feynman / Laurie M.
                 Brown \\
                 A path to quantum electrodynamics / Julian Schwinger
                 \\
                 Dick Feynman --- the guy in the office down the hall /
                 Murray Gell-Mann \\
                 Feynman and Partons / James D. Bjorken \\
                 Richard Feynman and condensed matter physics / David
                 Pines \\
                 Richard P. Feynman, teacher / David L. Goodstein \\
                 It never passed Him by / Michael Cohen \\
                 Reflections on Dick Feynman as an acolyte and as his
                 boss / Marvin L. Goldberger \\
                 Richard Feynman and the connection machine / W. Daniel
                 Hillis \\
                 Richard Feynman at La Ca{\~n}ada High School: Feynman's
                 last public performance / John S. Rigden \\
                 A. Lowbrow's view of Feynman / Valentine L. Telegdi \\
                 R. P. Feynman: the beginnings of a teacher / Joan
                 Feynman",
}

@Book{Cannell:2001:GGM,
  author =       "D. M. (Doris Mary) Cannell",
  booktitle =    "{George Green}: mathematician and physicist,
                 1793--1841: the background to his life and work",
  title =        "{George Green}: mathematician and physicist,
                 1793--1841: the background to his life and work",
  publisher =    pub-SIAM,
  address =      pub-SIAM:adr,
  edition =      "Second",
  pages =        "xxxiv + 316 + 10",
  year =         "2001",
  DOI =          "https://doi.org/10.1137/1.9780898718102",
  ISBN =         "0-89871-463-X",
  ISBN-13 =      "978-0-89871-463-0",
  LCCN =         "QC16.G64 C36 2001",
  bibdate =      "Thu Nov 12 16:23:43 MST 2015",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/d/dyson-freeman-j.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://epubs.siam.org/ebooks/siam/other_titles_in_applied_mathematics/ot73;
                 http://www.loc.gov/catdir/enhancements/fy0726/00041938-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0726/00041938-t.html",
  acknowledgement = ack-nhfb,
  author-dates = "1913--",
  libnote =      "Not in my library.",
  subject =      "Green, George; Mathematical physics; Great Britain;
                 History; Mathematics; Physicists; Biography;
                 Mathematicians",
  subject-dates = "1793--1841",
  tableofcontents = "1. Family background / 1--13 \\
                 2. George Green's education / 14--23 \\
                 3. Cambridge interlude / 24--42 \\
                 4. Bromley House Library and the essay of 1828 / 43--60
                 \\
                 5. Sir Edward Bromhead / 61--73 \\
                 6. The publication of George Green's further
                 investigations / 74--86 \\
                 7. An undergraduate at Cambridge / 87--98 \\
                 8. A fellowship at Caius College / 99--118 \\
                 9. George Green's family / 119--141 \\
                 10. William Thomson and the rediscovery of the essay of
                 1828 / 142--155 \\
                 11. ``Honour in his own country'' / 156--179 \\
                 Appendix I. The mathematics of George Green / by M. C.
                 Thornley / 183--204 \\
                 Appendix II. Mathematical papers of George Green /
                 205--206 \\
                 Appendix IIIa. Account by William Tomlin, Esq.:
                 ``Memoir of George Green, Esq.'' / 207--209 \\
                 Appendix IIIb. Account by Sir E. Ffrench Bromhead /
                 210--211 \\
                 Appendix IVa. Green family tree / 212--213 \\
                 Appendix IVb. Butler family tree / 214--214 \\
                 Appendix IVc. Smith family tree / 214--214 \\
                 Appendix IVd. Tomlin family tree / 215--215 \\
                 Appendix Va. Time chart of British mathematicians and
                 men of science / 216--217 \\
                 Appendix Vb. Time chart of other mathematicians and men
                 of science / 218--219 \\
                 Appendix VIa. The greening of quantum field theory:
                 George and I / by Professor Julian Schwinger / 220--231
                 \\
                 Appendix VIb. Homage to George Green: how physics
                 looked in the nineteen-forties / 232--247 by Professor
                 Freeman Dyson",
}

@Book{Chan:2007:MMC,
  editor =       "Raymond H. Chan and Chen Greif and Dianne P. O'Leary",
  booktitle =    "Milestones in Matrix Computation: the Selected Works
                 of {Gene H. Golub} with Commentaries",
  title =        "Milestones in Matrix Computation: the Selected Works
                 of {Gene H. Golub} with Commentaries",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  pages =        "xi + 565 + 3",
  year =         "2007",
  ISBN =         "0-19-920681-3",
  ISBN-13 =      "978-0-19-920681-0",
  LCCN =         "QA188 .G67 2007",
  MRclass =      "65-06 (01A75 65Fxx)",
  MRnumber =     "MR2281939 (2008b:65004)",
  MRreviewer =   "David Scott Watkins",
  bibdate =      "Sat Apr 07 10:23:33 2007",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/h/higham-nicholas-john.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/l/lanczos-cornelius.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/numana2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjnumeranal.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamreview.bib;
                 https://www.math.utah.edu/pub/tex/bib/technometrics1970.bib",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0737/2007276086-d.html",
  abstract =     "The text presents and discusses some of the most
                 influential papers in Matrix Computation authored by
                 Gene H. Golub, one of the founding fathers of the
                 field. The collection of 21 papers in divided into five
                 main areas: iterative methods for linear systems,
                 solution of least squares problems, matrix
                 factorizations and applications, orthogonal polynomials
                 and quadrature, and eigenvalue problems an commentaries
                 for each area are provided by leading experts: Anne
                 Greenbaum, {\AA}ke Bj{\"o}rck, Nicholas Higham, Walter
                 Gautschi, and G. W. (Pete) Stewart. Comments on each
                 paper are also provided by the original authors,
                 providing the reader with historical information on how
                 the paper came to be written and under what
                 circumstances the collaboration was undertaken.
                 Including a brief biography and facsimiles of the
                 original papers, this text will be of great interest to
                 students and researchers in numerical analysis and
                 scientific computation.",
  acknowledgement = ack-nhfb,
  tableofcontents = "List of Plates / x \\
                 I: Gene H. Golub \\
                 1 Gene H. Golub Biography, by Chen Greif / 3 \\
                 2 Publications of Gene H. Golub / 13 \\
                 3 Major Awards / 30 \\
                 4 Students of Gene H. Golub / 32 \\
                 II: Iterative Methods for Linear Systems \\
                 5 Commentary, by Anne Greenbaum / 35 \\
                 References / 43 \\
                 6 Chebyshev semi-iterative methods, successive
                 over-relaxation iterative methods, and second-order
                 Richardson iterative methods, Parts I and II (with R.
                 S. Varga) / 45 \\
                 7 A generalized conjugate gradient method for
                 non-symmetric systems of linear equations (with Paul
                 Concus) / 68 \\
                 8 A generalized conjugate gradient method for the
                 numerical solution of elliptic partial differential
                 equations (with Paul Concus and Dianne P. O'Leary) / 79
                 \\
                 9 Hermitian and Skew-Hermitian Splitting Methods for
                 Non-Hermitian Positive Definite Linear Systems (with
                 Zhong-Zhi Bai and Michael K. Ng) / 102 \\
                 III: Solution of Least Squares Problems \\
                 10 Commentary, by {\AA}ke Bj{\"o}rck / 129 \\
                 References / 141 \\
                 11 Numerical methods for solving linear least squares
                 problems / 148 \\
                 12 Singular value decomposition and least squares
                 solutions (with C. Reinsch) / 160 \\
                 13 The differentiation of pseudo-inverses and
                 non-linear least squares problems whose variables
                 separate (with V. Pereyra) / 181 \\
                 14 Generalized cross-validation as a method for
                 choosing a good ridge parameter (with M. Heath and G.
                 Wahba) / 202 \\
                 15 An analysis of the total least squares problem (with
                 C. Van Loan) / 213 \\
                 IV: Matrix Factorizations and Applications \\
                 16 Commentary, by Nicholas Higham / 227 \\
                 References / 233 \\
                 17 Calculating the singular values and pseudo-inverse
                 of a matrix (with W. Kahan) / 236 \\
                 18 The simplex method of linear programming using $ L U
                 $ decomposition (with R. H. Bartels) / 257 \\
                 19 On direct methods for solving Poisson's equation
                 (with B. L. Buzbee and C. W. Nielson) / 261 \\
                 20 Numerical methods for computing angles between
                 linear subspaces (with {\AA}. Bj{\"o}rck) / 292 \\
                 21 Methods for modifying matrix factorizations (with P.
                 E. Gill, W. Murray and M. A. Saunders) / 309 \\
                 V: Orthogonal Polynomials and Quadrature \\
                 22 Commentary, by Walter Gautschi / 345 \\
                 References / 354 \\
                 23 Calculation of Gauss quadrature rules (with J. H.
                 Welsch) / 359 \\
                 24 Matrices, moments, and quadrature (with G{\'e}rard
                 Meurant) / 380 \\
                 25 Computation of Gauss--Kronrod Quadrature Rules (with
                 D. Calvetti, W. B. Gragg and L. Reichel) / 434 \\
                 VI: Eigenvalue Problems \\
                 26 Commentary, by G. W. Stewart / 457 \\
                 References / 465 \\
                 27 Some modified matrix eigenvalue problems / 467 \\
                 28 Ill-conditioned eigensystems and the computation of
                 the Jordan canonical form (with J. H. Wilkinson) / 485
                 \\
                 29 The block Lanczos method for computing eigenvalues
                 (with R. Underwood) / 528 \\
                 30 The numerically stable reconstruction of a Jacobi
                 matrix from spectral data (with C. de Boor) / 546 \\
                 Index / 563",
}

@Book{Cherkaev:2000:VMS,
  author =       "Andrej Cherkaev",
  booktitle =    "Variational Methods for Structural Optimization",
  title =        "Variational Methods for Structural Optimization",
  volume =       "140",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xxvi + 545",
  year =         "2000",
  DOI =          "https://doi.org/10.1007/978-1-4612-1188-4",
  ISBN =         "0-387-98462-3 (hardcover)",
  ISBN-13 =      "978-0-387-98462-9 (hardcover)",
  ISSN =         "0066-5452 (print), 2196-968X (electronic)",
  ISSN-L =       "0066-5452",
  LCCN =         "QA1 .A647 v.140; TA658.8 .C53 2000",
  MRclass =      "74-02 74Pxx 74E30 74Q05 74Q20",
  bibdate =      "Sat Sep 22 09:49:02 2001",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/beebe-nelson-h-f.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "NHFB was the chief technical editor for this book, and
                 wrote the author/editor indexing software, the {\TeX}
                 DVI-to-PostScript driver and the initial Web site for
                 the book, at
                 \path=https://www.math.utah.edu/books/vmso/index.html=.",
  series =       "Applied mathematical sciences",
  URL =          "https://www.math.utah.edu/book/vmso",
  ZMnumber =     "0956.74001",
  abstract =     "In recent decades, it has become possible to turn the
                 design process into computer algorithms. By applying
                 different computer oriented methods the topology and
                 shape of structures can be optimized and thus designs
                 systematically improved. These possibilities have
                 stimulated an interest in the mathematical foundations
                 of structural optimization. The challenge of this book
                 is to bridge a gap between a rigorous mathematical
                 approach to variational problems and the practical use
                 of algorithms of structural optimization in engineering
                 applications. The foundations of structural
                 optimization are presented in a sufficiently simple
                 form to make them available for practical use and to
                 allow their critical appraisal for improving and
                 adapting these results to specific models. Special
                 attention is to pay to the description of optimal
                 structures of composites; to deal with this problem,
                 novel mathematical methods of nonconvex calculus of
                 variation are developed. The exposition is accompanied
                 by examples.",
  acknowledgement = ack-nhfb,
  tableofcontents = "I: Preliminaries / 1 \\
                 1: Relaxation of One-Dimensional Variational Problems /
                 3 \\
                 2: Conducting Composites / 35 \\
                 3: Bounds and $G$-Closures / 59 \\
                 II: Optimization of Conducting Composites / 79 \\
                 4: Domains of Extremal Conductivity / 81 \\
                 5: Optimal Conducting Structures / 117 \\
                 III: Quasiconvexity and Relaxation / 143 \\
                 6: Quasiconvexity / 145 \\
                 7: Optimal Structures and Laminates / 171 \\
                 8: Lower Bound: Translation Method / 213 \\
                 9: Necessary Conditions and Minimal Extensions / 239
                 \\
                 IV: $G$-Closures / 259 \\
                 10: Obtaining $G$-Closures / 261 \\
                 11: Examples of $G$-Closures / 279 \\
                 12: Multimaterial Composites / 309 \\
                 13: Supplement: Variational Principles for Dissipative
                 Media / 343 \\
                 V: Optimization of Elastic Structures / 357 \\
                 14: Elasticity of Inhomogeneous Media / 359 \\
                 15: Elastic Composites of Extremal Energy / 393 \\
                 16: Bounds on Effective Properties / 419 \\
                 17: Some Problems of Structural Optimization / 459 \\
                 References / 495 \\
                 Author/Editor Index / 525 \\
                 Subject Index / 533",
}

@Book{Cowell:1984:SDM,
  editor =       "Wayne R. Cowell",
  booktitle =    "Sources and Development of Mathematical Software",
  title =        "Sources and Development of Mathematical Software",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xii + 404",
  year =         "1984",
  ISBN =         "0-13-823501-5",
  ISBN-13 =      "978-0-13-823501-7",
  LCCN =         "QA76.95 .S68 1984",
  bibdate =      "Tue Dec 14 22:44:45 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/d/dongarra-jack-j.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/s/stewart-gilbert-w.bib;
                 https://www.math.utah.edu/pub/tex/bib/fortran2.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Prentice-Hall Series in Computational Mathematics,
                 Cleve Moler, Advisor",
  acknowledgement = ack-nhfb,
  tableofcontents = "Observations on the mathematical software effort /
                 W. J. Cody \\
                 LINPACK: A package for solving linear systems / J. J.
                 Dongarra and G. W. Stewart \\
                 FUNPACK: A package of special function routines / W. J.
                 Cody \\
                 EISPACK: A package for solving matrix eigenvalue
                 problems / J. J. Dongarra and C. B. Moler \\
                 The MINPACK project / J. More, D. Sorensen, B. Garbow,
                 and K. Hillstrom \\
                 Software for ordinary differential equations / L. F.
                 Shampine and H. A. Watts \\
                 Sources of information on quadrature software / D.
                 Kahaner \\
                 A survey of sparse matrix software / Iain S. Duff \\
                 Mathematical software for elliptic boundary value
                 problems \\
                 Ronald F. Boisvert and Roland A. Sweet \\
                 The IMSL Library / Thomas J. Aird \\
                 The SLATEC common mathematical library / Bill L. Buzbee
                 \\
                 The Boeing mathematical software library / A. H.
                 Erisman, K. W. Neves, and I. R. Philips \\
                 The PORT mathematical subroutine Library / Phyllis Fox
                 \\
                 The evolving NAG library service / Brian Ford and James
                 C. T. Pool",
}

@Book{Dijkstra:1982:SWC,
  author =       "Edsger Wybe Dijkstra",
  booktitle =    "Selected Writings on Computing: a Personal
                 Perspective",
  title =        "Selected Writings on Computing: a Personal
                 Perspective",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xvii + 362",
  year =         "1982",
  DOI =          "https://doi.org/10.1007/978-1-4612-5695-3",
  ISBN =         "0-387-90652-5 (New York), 3-540-90652-5 (Berlin)",
  ISBN-13 =      "978-0-387-90652-2 (New York), 978-3-540-90652-0
                 (Berlin)",
  LCCN =         "QA76.24 .D54 1982",
  MRclass =      "68-00 (00A25 01A75 68N05)",
  MRnumber =     "677672 (85d:68001)",
  MRreviewer =   "Kh. I. Kilov",
  bibdate =      "Tue Dec 14 22:47:28 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Including a paper co-authored by C. S. Sch{\"o}lten.",
  series =       "Texts and Monographs in Computer Science",
  acknowledgement = ack-nhfb,
  tableofcontents = "EWD227 Stepwise Program Construction / Edsger W.
                 Dijkstra / 1--14 \\
                 EWD338 Parallelism in Multi-Record Transactions / E. W.
                 Dijkstra and C. S. Sch{\"o}lten / 15--21 \\
                 EWD376 Finding the Maximum Strong Components in a
                 Directed Graph / Edsger W. Dijkstra / 22--30 \\
                 EWD385 Trip Report E. W. Dijkstra, Summer School
                 Munich, July 25 to August 4, 1973 / Dr. Edsger W.
                 Dijkstra / 31--33 \\
                 EWD386 The Solution to a Cyclic Relaxation Problem /
                 Dr. Edsger W. Dijkstra / 34--35 \\
                 EWD387 Trip Report IBM Seminar ``Communication and
                 Computers'', Newcastle, Sept. 1973 / Dr. Edsger W.
                 Dijkstra / 36--40 \\
                 EWD391 Self-Stabilization in Spite of Distributed
                 Control / Edsger W. Dijkstra / 41--46 \\
                 EWD407 Acceptance Speech for the AFIPS Harry Goode
                 Memorial Award 1974 / Prof. Dr. Edsger W. Dijkstra /
                 47--49 \\
                 EWD427 Speech at the Occasion of an Anniversary /
                 Edsger W. Dijkstra / 50--53 \\
                 EWD442 Inside ``Mathematics Inc.'' / Edsger W. Dijkstra
                 / 54--55 \\
                 EWD443 A Multidisciplinary Approach to Mathematics /
                 Edsger W. Dijkstra / 56--59 \\
                 EWD447 On the Role of Scientific Thought / Prof. Dr.
                 Edsger W. Dijkstra / 60--66 \\
                 EWD462 A Time-Wise Hierarchy Imposed upon the Use of a
                 Two-Level Store / Prof. Dr. Edsger W. Dijkstra / 67--78
                 \\
                 EWD464 A New Elephant Built from Mosquitoes Humming in
                 Harmony / Prof. Dr. Edsger W. Dijkstra / 79--83 \\
                 EWD465 Monotonic Replacement Algorithms and Their
                 Implementation / Prof. Dr. Edsger W. Dijkstra / 84--88
                 \\
                 EWD466 Trip Report E. W. Dijkstra, Meeting IFIP
                 W.G.2.3, Munich, 8---14 December 1974 / Prof. Dr.
                 Edsger W. Dijkstra / 89--94 \\
                 EWD474 Trip Report Visit ETH Z{\"u}rich, 3--4 February
                 1975 by E. W. Dijkstra / Edsger W. Dijkstra / 95--98
                 \\
                 EWD475 A Letter to My Old Friend Jonathan / Edsger W.
                 Dijkstra / 99--103 \\
                 EWD480 ``Craftsman or Scientist?'' / Prof. Dr. Edsger
                 W. Dijkstra / 104--109 \\
                 EWD482 Exercises in Making Programs Robust / Prof. Dr.
                 Edsger W. Dijkstra / 110--119 \\
                 EWD494 Trip Report E. W. Dijkstra 16th April / 7th May,
                 1975, U.S.A. and Canada / Prof. Dr. Edsger W. Dijkstra
                 / 120--128 \\
                 EWD498 How Do We Tell Truths that Might Hurt? / Prof.
                 Dr. Edsger W. Dijkstra / 129--131 \\
                 EWD501 Variations on a Theme: An Open Letter to C. A.
                 R. Hoare / Professor C. A. R. Hoare / 132--140 \\
                 EWD503 A Post-Scriptum to EWD501 / Edsger / 141--144
                 \\
                 EWD504 Erratum and Embellishments of EWD503 / Prof. Dr.
                 Edsger W. Dijkstra / 145--146 \\
                 EWD508 A Synthesis Emerging? / Prof. Dr. Edsger W.
                 Dijkstra / 147--160 \\
                 EWD512 Comments at a Symposium / Edsger W. Dijkstra /
                 161--164 \\
                 EWD513 Trip Report E. W. Dijkstra, Newcastle, 8--12
                 September 1975 / Prof. Dr. Edsger W. Dijkstra /
                 165--168 \\
                 EWD525 On a Warning from E. A. Hauck / Prof. Dr. Edsger
                 W. Dijkstra / 169--171 \\
                 EWD528 More on Hauck's Warning / Prof. Dr. Edsger W.
                 Dijkstra / 172--173 \\
                 EWD538 A Collection of Beautiful Proofs / Edsger W.
                 Dijkstra / 174--183 \\
                 EWD539 Mathematics Inc., a Private Letter from Its
                 Chairman / Prof. Dr. Edsger W. Dijkstra / 184--187 \\
                 EWD554 A Personal Summary of the Gries--Owicki Theory /
                 Prof. Dr. Edsger W. Dijkstra / 188--199 \\
                 EWD561 A ``Non Trip Report'' from E. W. Dijkstra /
                 Prof. Dr. Edsger W. Dijkstra / 200--204 \\
                 EWD563 Formal Techniques and Sizeable Programs / Edsger
                 W. Dijkstra / 205--214 \\
                 EWD570 An Exercise for Dr. R. M. Burstall / Prof. Dr.
                 Edsger W. Dijkstra / 215--216 \\
                 EWD573 A Great Improvement / Prof. Dr. Edsger W.
                 Dijkstra / 217--219 \\
                 EWD575 To H. D. Mills, Chairman Software Methodology
                 Panel / Prof. Dr. Edsger W. Dijkstra / 220--222 \\
                 EWD576 On Subgoal Induction / Prof. Dr. Edsger W.
                 Dijkstra / 223--224 \\
                 EWD577 Trip Report E. W. Dijkstra, ECI-Conference 9--12
                 August 1976, Amsterdam / Prof. Dr. Edsger W. Dijkstra /
                 225--229 \\
                 EWD578 More About the Function ``tt fusc'' (A Sequel to
                 EWD570) / Prof. Dr. Edsger W. Dijkstra / 230--232 \\
                 EWD582A Proof of a Theorem Communicated to Us by S.
                 Ghosh / Prof. Dr. Edsger W. Dijkstra and Drs. C. S.
                 Scholten / 233--234 \\
                 EWD584 Trip Report E. W. Dijkstra, Poland and USSR,
                 4--25 September 1976 / Prof. Dr. Edsger W. Dijkstra /
                 235--244 \\
                 EWD585 Trip Report E. W. Dijkstra, Tokyo, 28 Sept--3
                 Oct. 1976 / Prof. Dr. Edsger W. Dijkstra / 245--250 \\
                 EWD594 A Parable / Prof. Dr. Edsger W. Dijkstra /
                 251--252 \\
                 EWD603 Trip Report E. W. Dijkstra, St.
                 Pierre-de-Chartreuse, 12--19 Dec. 1976 / Prof. Dr.
                 Edsger W. Dijkstra / 253--258 \\
                 EWD607 A Correctness Proof for Communicating Processes:
                 A Small Exercise / Prof. Dr. Edsger W. Dijkstra /
                 259--263 \\
                 EWD608 An Elephant Inspired by the Dutch National Flag
                 / Prof. Dr. Edsger W. Dijkstra / 264--267 \\
                 EWD611 On the Fact that the Atlantic Ocean Has Two
                 Sides / Prof. Dr. Edsger W. Dijkstra / 268--276 \\
                 EWD613 Trip Report E. W. Dijkstra, Australia, 16
                 February 1977--21 March 1977 / Prof. Dr. Edsger W.
                 Dijkstra / 277--283 \\
                 EWD614 A Somewhat Open Letter to EAA or: Why I Proved
                 the Boundedness of the Nondeterminacy in the Way I Did
                 / Prof. Dr. Edsger W. Dijkstra / 284--287 \\
                 EWD618 On Webster, Users, Bugs, and Aristotle / Prof.
                 Dr. Edsger W. Dijkstra / 288--291 \\
                 EWD622 On Making Solutions More and More Fine-Grained /
                 Prof. Dr. Edsger W. Dijkstra / 292--307 \\
                 EWD623 The Mathematics Behind the Banker's Algorithm /
                 Prof. Dr. Edsger W. Dijkstra / 308--312 \\
                 EWD629 On Two Beautiful Solutions Designed by Martin
                 Rem / Prof. Dr. Edsger W. Dijkstra / 313--318 \\
                 EWD635 Trip Report E. W. Dijkstra, Newcastle-upon-Tyne,
                 5--10 Sept. 1977 / Prof. Dr. Edsger W. Dijkstra /
                 319--323 \\
                 EWD636 Why Naive Program Transformation Systems Are
                 Unlikely to Work / Prof. Dr. Edsger W. Dijkstra /
                 324--328 \\
                 EWD637 The Three Golden Rules for Successful Scientific
                 Research / Prof. Dr. Edsger W. Dijkstra / 329--330 \\
                 EWD639 The Introduction of MAES / Prof. Dr. Edsger W.
                 Dijkstra / 331--333 \\
                 EWD643 A Class of Simple Communication Patterns / C. S.
                 Scholten and Prof. Dr. Edsger W. Dijkstra / 334--337
                 \\
                 EWD648 ``Why is Software So Expensive?'' An Explanation
                 to the Hardware Designer / Prof. Dr. Edsger W. Dijkstra
                 / 338--348 \\
                 EWD650 A Theorem about Odd Powers of Odd Integers /
                 Prof. Dr. Edsger W. Dijkstra / 349--350 \\
                 EWD671 Program Inversion / Prof. Dr. Edsger W. Dijkstra
                 / 351--354 \\
                 EWD673 On Weak and Strong Termination / Prof. Dr.
                 Edsger W. Dijkstra / 355--357 \\
                 EWD675 The Equivalence of Bounded Nondeterminacy and
                 Continuity / Prof. Dr. Edsger W. Dijkstra / 358--359
                 \\
                 EWD678 A Story that Starts with a Very Good Computer /
                 Prof. Dr. Edsger W. Dijkstra / 360--362",
}

@Book{Dyson:2012:TCO,
  author =       "George Dyson",
  booktitle =    "{Turing}'s cathedral: the origins of the digital
                 universe",
  title =        "{Turing}'s cathedral: the origins of the digital
                 universe",
  publisher =    pub-PANTHEON,
  address =      pub-PANTHEON:adr,
  pages =        "xxii + 401",
  year =         "2012",
  ISBN =         "0-375-42277-3 (hardcover)",
  ISBN-13 =      "978-0-375-42277-5 (hardcover)",
  LCCN =         "QA76.17 .D97 2012",
  bibdate =      "Sun Mar 25 21:48:01 MDT 2012",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/metropolis-nicholas.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/t/teller-edward.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/u/ulam-stanislaw-m.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.bib;
                 https://www.math.utah.edu/pub/tex/bib/bstj2010.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "Legendary historian and philosopher of science George
                 Dyson vividly re-creates the scenes of focused
                 experimentation, incredible mathematical insight, and
                 pure creative genius that gave us computers, digital
                 television, modern genetics, models of stellar
                 evolution --- in other words, computer code. In the
                 1940s and '50s, a group of eccentric geniuses --- led
                 by John von Neumann --- gathered at the newly created
                 Institute for Advanced Study in Princeton, New Jersey.
                 Their joint project was the realization of the
                 theoretical universal machine, an idea that had been
                 put forth by mathematician Alan Turing. This group of
                 brilliant engineers worked in isolation, almost
                 entirely independent from industry and the traditional
                 academic community. But because they relied exclusively
                 on government funding, the government wanted its share
                 of the results: the computer that they built also led
                 directly to the hydrogen bomb. George Dyson has
                 uncovered a wealth of new material about this project,
                 and in bringing the story of these men and women and
                 their ideas to life, he shows how the crucial
                 advancements that dominated twentieth-century
                 technology emerged from one computer in one laboratory,
                 where the digital universe as we know it was born.",
  acknowledgement = ack-nhfb,
  remark-1 =     "From a photo caption three plates before page 249:
                 ``\ldots{} at the University of Manchester in 1951. The
                 Ferranti Mark I, with 256 40-bit words (1 kilobyte) of
                 cathode-ray tube memory, and a 16,000-word magnetic
                 drum, was the first commercially available
                 implementation of Turing's Universal Machine. At
                 Turing's insistence, a random number generator was
                 included, so that the computer could learn by trial and
                 error or perform a search by means of random walk.''",
  remark-2 =     "From page 265: In 1949, \ldots{}, Turing designed a
                 random-number generator that instead of producing
                 pseudo-random numbers by a numerical process included a
                 source of truly-random noise. This avoid von Neumann's
                 ``state of sin''.",
  subject =      "computers; history; Turing machines; computable
                 functions; random access memory; von Neumann, John;
                 Turing, Alan Mathison; science / general; biography and
                 autobiography / science and technology",
  subject-dates = "1903--1957; 1912--1954",
  tableofcontents = "1953 \\
                 Olden Farm \\
                 Veblen's circle \\
                 Neumann J{\'a}nos \\
                 MANIAC \\
                 Fuld 219 \\
                 6J6 \\
                 V-40 \\
                 Cyclogenesis \\
                 Monte Carlo \\
                 Ulam's demons \\
                 Barricelli's universe \\
                 Turing's cathedral \\
                 Engineer's dreams \\
                 Theory of self-reproducing automata \\
                 Mach 9 \\
                 The tale of the big computer \\
                 The thirty-ninth step",
}

@Book{Einstein:1954:IO,
  author =       "Albert Einstein",
  booktitle =    "Ideas and Opinions",
  title =        "Ideas and Opinions",
  publisher =    pub-CROWN,
  address =      pub-CROWN:adr,
  pages =        "vi + 377",
  year =         "1954",
  LCCN =         "AC35 .E526 1954",
  bibdate =      "Wed Mar 8 11:01:08 MST 2006",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/c/clerk-maxwell-james.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/p/planck-max.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.gbv.de:20011/gvk",
  acknowledgement = ack-nhfb,
  author-dates = "1879--1955",
  remark =       "Based on {\em Mein Weltbild}, edited by Cal Seelig,
                 with new translations and revisions by Sonja
                 Bargmann.",
  tableofcontents = "Publisher's note / v \\
                 Part I: Ideas and Opinions / 1 \\
                 Paradise Lost \\
                 My First Impressions of the USA \\
                 Reply to the Women of America \\
                 The World as I See It \\
                 The Meaning of Life \\
                 The True Value of a Human Being \\
                 Good and Evil \\
                 On Wealth \\
                 Society and Personality \\
                 Interviewers \\
                 Congratulations to a Critic \\
                 To the Schoolchildren of Japan \\
                 Message in the Time-Capsule \\
                 Remarks on Bertrand Russell's Theory of Knowledge \\
                 A Mathematician's Mind \\
                 the State and the Individual Conscience \\
                 Aphorisms for Leo Baeck \\
                 About Freedom \\
                 On Academic Freedom \\
                 Fascism and Science \\
                 On Freedom \\
                 Address on Receiving Lord and Taylor Award \\
                 Modern Inquisitional Methods \\
                 Human Methods \\
                 About Religion \\
                 Religion and Science \\
                 The Religious Spirit of Science \\
                 Science and Religion \\
                 Religion and Science: Irreconcilable? \\
                 The Need for Ethical Culture \\
                 About Education \\
                 The University Courses at Davos \\
                 Teachers and Pupils \\
                 Education and Educators \\
                 Education and World Peace \\
                 On Education \\
                 On Classic Literature \\
                 Ensuring the Future of Mankind \\
                 Education for Independent Thought \\
                 About Friends \\
                 Joseph Popper-Lynkaeus \\
                 Greeting to George Bernard Shaw \\
                 In Honor of Arnold Berliner's Seventieth Birthday \\
                 H. A. Lorentz's Work in the Cause of International
                 Cooperation \\
                 Address at the Grave of H. A. Lorentz \\
                 H. A. Lorentz, Creator and Personality \\
                 Marie Curie in Memoriam \\
                 Mahatma Gandhi (``Generations to come will scarce
                 believe that such a one \\
                 as this ever in flesh and blood walked upon this
                 earth.'') \\
                 Max Planck in Memoriam \\
                 Message in Honor of Morris Raphael Cohen \\
                 \\
                 Part II: On Politics, Government, and Pacifism / 81 \\
                 The International of Science \\
                 A Farewell \\
                 The Institute of Intellectual Cooperation \\
                 Thoughts on the World Economic Crisis \\
                 Production and Purchasing Power \\
                 Production and Work \\
                 Address to the Students' Disarmament Meeting \\
                 The Disarmament Conference of 1932 \\
                 America and the Disarmament Conference of 1932 \\
                 The Question of Disarmament \\
                 Arbitration \\
                 To Sigmund Freud \\
                 Peace \\
                 The Pacifist Problem \\
                 Compulsory Service \\
                 Women and War \\
                 Three Letters to Friends of Peace \\
                 Active Pacifism \\
                 Observations on the Present Situation in Europe \\
                 Germany and France \\
                 Culture and Prosperity \\
                 Minorities \\
                 The Heirs of the Ages \\
                 The War Is Won, but the Peace Is Not \\
                 Atomic War or Peace \\
                 The Military Mentality \\
                 Exchange of Letters with Members of the Russian Academy
                 \\
                 On Receiving the One World Award \\
                 A Message to Intellectuals \\
                 Why Socialism? \\
                 National Security \\
                 The Pursuit of Peace \\
                 ``Culture Must Be One of the Foundations for World
                 Understanding'' \\
                 On the Abolition of the Threat of War \\
                 Symptoms of Cultural Decay \\
                 \\
                 Part III: On the Jewish People / 169 \\
                 A Letter to Professor Dr. Hellpach, Minister of State
                 \\
                 Letter to an Arab \\
                 The Jewish Community \\
                 Addresses on Reconstruction in Palestine \\
                 Working Palestine \\
                 Jewish Recovery \\
                 Christianity and Judaism \\
                 Jewish Ideals \\
                 Is There a Jewish Point of View? \\
                 Anti-Semitism and Academic Youth \\
                 Our Debt to Zionism \\
                 Why Do They Hate the Jews? \\
                 The Dispersal of European Jewry \\
                 The Jews of Israel \\
                 \\
                 Part IV: On Germany / 203 \\
                 Manifesto -- March, 1933 \\
                 Correspondence with the Prussian Academy of Sciences
                 \\
                 Correspondence with the Bavarian Academy of Sciences
                 \\
                 A Reply to the Invitation to Participate in a Meeting
                 against Anti-Semitism \\
                 To the Heroes of the Battle of the Warsaw Ghetto \\
                 \\
                 Part V: Contributions to Science / 215 \\
                 Introduction by Valentine Bargmann \\
                 Principles of Theoretical Physics \\
                 Principles of Research \\
                 What Is the Theory of Relativity? \\
                 Geometry and Experience \\
                 On the Theory of Relativity \\
                 The Cause of the Formation of Meanders in the Courses
                 of River and the So-called Baer's Law \\
                 The Mechanics of Newton and Their Influence on the
                 Development of Theoretical Physics \\
                 On Scientific Truth \\
                 Johannes Kepler \\
                 Maxwell's Influence on the Evolution of the Idea of
                 Physical Reality \\
                 On the Method of Theoretical Physics \\
                 The Problem of Space, Ether, and Field in Physics \\
                 Notes on the Origin of the General Theory of Relativity
                 \\
                 Physics and Reality \\
                 The Fundaments of Theoretical Physics \\
                 The Common Language of Science \\
                 $E = m c^$ \\
                 On the Generalized Theory of Gravitation \\
                 Message to the Italian Society for the Advancement of
                 Science \\
                 Message on the 410th Anniversary of the Death of
                 Copernicus \\
                 Relativity and the Problem of Space",
}

@Book{Einstein:1982:IO,
  author =       "Albert Einstein",
  booktitle =    "Ideas and Opinions",
  title =        "Ideas and Opinions",
  publisher =    pub-THREE-RIVERS,
  address =      pub-THREE-RIVERS:adr,
  pages =        "377",
  year =         "1982",
  ISBN =         "0-517-88440-2",
  ISBN-13 =      "978-0-517-88440-9",
  LCCN =         "AC35 .E526 1982x",
  bibdate =      "Wed Mar 8 11:01:08 MST 2006",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/c/clerk-maxwell-james.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/p/planck-max.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.gbv.de:20011/gvk",
  acknowledgement = ack-nhfb,
  author-dates = "1879--1955",
  remark =       "Based on {\em Mein Weltbild}, edited by Cal Seelig,
                 with new translations and revisions by Sonja
                 Bargmann.",
  tableofcontents = "Publisher's note / v \\
                 Part I: Ideas and Opinions / 1 \\
                 Paradise Lost \\
                 My First Impressions of the USA \\
                 Reply to the Women of America \\
                 The World as I See It \\
                 The Meaning of Life \\
                 The True Value of a Human Being \\
                 Good and Evil \\
                 On Wealth \\
                 Society and Personality \\
                 Interviewers \\
                 Congratulations to a Critic \\
                 To the Schoolchildren of Japan \\
                 Message in the Time-Capsule \\
                 Remarks on Bertrand Russell's Theory of Knowledge \\
                 A Mathematician's Mind \\
                 the State and the Individual Conscience \\
                 Aphorisms for Leo Baeck \\
                 About Freedom \\
                 On Academic Freedom \\
                 Fascism and Science \\
                 On Freedom \\
                 Address on Receiving Lord and Taylor Award \\
                 Modern Inquisitional Methods \\
                 Human Methods \\
                 About Religion \\
                 Religion and Science \\
                 The Religious Spirit of Science \\
                 Science and Religion \\
                 Religion and Science: Irreconcilable? \\
                 The Need for Ethical Culture \\
                 About Education \\
                 The University Courses at Davos \\
                 Teachers and Pupils \\
                 Education and Educators \\
                 Education and World Peace \\
                 On Education \\
                 On Classic Literature \\
                 Ensuring the Future of Mankind \\
                 Education for Independent Thought \\
                 About Friends \\
                 Joseph Popper-Lynkaeus \\
                 Greeting to George Bernard Shaw \\
                 In Honor of Arnold Berliner's Seventieth Birthday \\
                 H. A. Lorentz's Work in the Cause of International
                 Cooperation \\
                 Address at the Grave of H. A. Lorentz \\
                 H. A. Lorentz, Creator and Personality \\
                 Marie Curie in Memoriam \\
                 Mahatma Gandhi (``Generations to come will scarce
                 believe that such a one \\
                 as this ever in flesh and blood walked upon this
                 earth.'') \\
                 Max Planck in Memoriam \\
                 Message in Honor of Morris Raphael Cohen \\
                 \\
                 Part II: On Politics, Government, and Pacifism / 81 \\
                 The International of Science \\
                 A Farewell \\
                 The Institute of Intellectual Cooperation \\
                 Thoughts on the World Economic Crisis \\
                 Production and Purchasing Power \\
                 Production and Work \\
                 Address to the Students' Disarmament Meeting \\
                 The Disarmament Conference of 1932 \\
                 America and the Disarmament Conference of 1932 \\
                 The Question of Disarmament \\
                 Arbitration \\
                 To Sigmund Freud \\
                 Peace \\
                 The Pacifist Problem \\
                 Compulsory Service \\
                 Women and War \\
                 Three Letters to Friends of Peace \\
                 Active Pacifism \\
                 Observations on the Present Situation in Europe \\
                 Germany and France \\
                 Culture and Prosperity \\
                 Minorities \\
                 The Heirs of the Ages \\
                 The War Is Won, but the Peace Is Not \\
                 Atomic War or Peace \\
                 The Military Mentality \\
                 Exchange of Letters with Members of the Russian Academy
                 \\
                 On Receiving the One World Award \\
                 A Message to Intellectuals \\
                 Why Socialism? \\
                 National Security \\
                 The Pursuit of Peace \\
                 ``Culture Must Be One of the Foundations for World
                 Understanding'' \\
                 On the Abolition of the Threat of War \\
                 Symptoms of Cultural Decay \\
                 \\
                 Part III: On the Jewish People / 169 \\
                 A Letter to Professor Dr. Hellpach, Minister of State
                 \\
                 Letter to an Arab \\
                 The Jewish Community \\
                 Addresses on Reconstruction in Palestine \\
                 Working Palestine \\
                 Jewish Recovery \\
                 Christianity and Judaism \\
                 Jewish Ideals \\
                 Is There a Jewish Point of View? \\
                 Anti-Semitism and Academic Youth \\
                 Our Debt to Zionism \\
                 Why Do They Hate the Jews? \\
                 The Dispersal of European Jewry \\
                 The Jews of Israel \\
                 \\
                 Part IV: On Germany / 203 \\
                 Manifesto -- March, 1933 \\
                 Correspondence with the Prussian Academy of Sciences
                 \\
                 Correspondence with the Bavarian Academy of Sciences
                 \\
                 A Reply to the Invitation to Participate in a Meeting
                 against Anti-Semitism \\
                 To the Heroes of the Battle of the Warsaw Ghetto \\
                 \\
                 Part V: Contributions to Science / 215 \\
                 Introduction by Valentine Bargmann \\
                 Principles of Theoretical Physics \\
                 Principles of Research \\
                 What Is the Theory of Relativity? \\
                 Geometry and Experience \\
                 On the Theory of Relativity \\
                 The Cause of the Formation of Meanders in the Courses
                 of River and the So-called Baer's Law \\
                 The Mechanics of Newton and Their Influence on the
                 Development of Theoretical Physics \\
                 On Scientific Truth \\
                 Johannes Kepler \\
                 Maxwell's Influence on the Evolution of the Idea of
                 Physical Reality \\
                 On the Method of Theoretical Physics \\
                 The Problem of Space, Ether, and Field in Physics \\
                 Notes on the Origin of the General Theory of Relativity
                 \\
                 Physics and Reality \\
                 The Fundaments of Theoretical Physics \\
                 The Common Language of Science \\
                 $E = m c^$ \\
                 On the Generalized Theory of Gravitation \\
                 Message to the Italian Society for the Advancement of
                 Science \\
                 Message on the 410th Anniversary of the Death of
                 Copernicus \\
                 Relativity and the Problem of Space",
}

@Book{Farmelo:2003:IMB,
  editor =       "Graham Farmelo",
  booktitle =    "It Must Be Beautiful: Great Equations of Modern
                 Science",
  title =        "It Must Be Beautiful: Great Equations of Modern
                 Science",
  publisher =    "Granta",
  address =      "London, UK",
  pages =        "xviii + 284",
  year =         "2003",
  ISBN =         "1-86207-555-7",
  ISBN-13 =      "978-1-86207-555-9",
  LCCN =         "Q125 .I88 2003",
  bibdate =      "Fri Oct 31 06:46:55 MDT 2014",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/d/dirac-p-a-m.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/s/schroedinger-erwin.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/s/shannon-claude-elwood.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Equations lie at the heart of many of the most
                 extraordinarily successful scientific theories. Here,
                 some of the greatest living scientists unpack the best
                 known equations so that they become understandable, and
                 we are entertained and enlightened by a knowledge of
                 how it was arrived at, what it can do and what remains
                 to be understood about it.",
  acknowledgement = ack-nhfb,
  subject =      "Science; History; 20th century; Equations; Gleichung;
                 Naturwissenschaften; Equations; Science",
  tableofcontents = "Foreword: It must be beautiful / Graham Farmelo /
                 ix \\
                 A revolution with no revolutionaries: the
                 Planck--Einstein equation for the energy of a quantum /
                 Graham Farmelo / 1 \\
                 The best possible time to be alive: the logistic map /
                 Robert May / 28 \\
                 A mirror in the sky: the Drake equation / Oliver Morton
                 / 46 \\
                 The sextant equation: $E = m c^2$ / Peter Galison / 68
                 \\
                 An environmental fairy tale: the Molina--Rowland
                 chemical equations and the CFC problem / Aisling Irwin
                 / 87 \\
                 Erotica, aesthetics and Schr{\"o}dinger's wave equation
                 / Arthur I. Miller / 110 \\
                 A piece of magic: the Dirac equation / Frank Wilczek /
                 132 \\
                 Equations of life: the mathematics of evolution / John
                 Maynard Smith / 161 \\
                 The rediscovery of gravity: the Einstein equation of
                 general relativity / Roger Penrose / 180 \\
                 Understanding information, bit by bit: Shannon's
                 equations / Igor Aleksander / 213 \\
                 Hidden symmetry: the Yang--Mills equation / Christine
                 Sutton / 231 \\
                 Afterword: how great equations survive / Steven
                 Weinberg / 253 \\
                 Notes and Further Reading / / 258 \\
                 Index / / 274",
}

@Book{Farmelo:2013:CBHa,
  author =       "Graham Farmelo",
  booktitle =    "{Churchill}'s bomb: a hidden history of science, war
                 and politics",
  title =        "{Churchill}'s bomb: a hidden history of science, war
                 and politics",
  publisher =    pub-FABER-FABER,
  address =      pub-FABER-FABER:adr,
  pages =        "x + 554 + 12",
  year =         "2013",
  ISBN =         "0-571-24978-7 (hardcover)",
  ISBN-13 =      "978-0-571-24978-7 (hardcover)",
  LCCN =         "????",
  bibdate =      "Fri Oct 31 06:10:37 MDT 2014",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/b/bohr-niels.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/s/szilard-leo.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  subject =      "Churchill, Winston; (Winston Leonard Spencer);
                 Lindemann, Frederick Alexander (Viscount Lord Cherwell)
                 (The `Prof'); Prime ministers; Great Britain;
                 Biography; World War, 1939--1945; Science; Atomic bomb;
                 Kernwapenpolitiek; Kernwapens; Verenigd Koninkrijk van
                 Groot-Brittanni{\"e} en Noord-Ierland",
  subject-dates = "1874--1965 (WSC); 1886--1957 (FAL)",
  tableofcontents = "Dedication \\
                 List of Plates \\
                 Epigraphs \\
                 Prologue \\
                 February 1955 Churchill, his nuclear scientists and the
                 bomb \\
                 1: Towards the Nuclear Age \\
                 1894--1925 Wells and his liberating `atomic bombs' \\
                 1924--1932 Churchill glimpses a nuclear future \\
                 1932 Rutherford: nuclear sceptic \\
                 March 1933 to December 1934 The Prof advises a
                 `scientist who missed his vocation' \\
                 September 1933 to February 1935 Szil{\'a}rd's nuclear
                 epiphany \\
                 February 1934 to October 1935 Churchill fears war ---
                 and that nuclear energy will soon be harnassed \\
                 November 1938 to September 1939 Bohr thinks the Bomb is
                 `inconceivable' \\
                 2: World War II \\
                 August to December 1939 Churchill --- nuclear weapons
                 will not be ready for the war \\
                 September 1939 to February 1940 Chadwick doubts that
                 the Bomb is viable \\
                 October 1939 to July 1940 FDR receives a nuclear
                 warning \\
                 March to June 1940 Frisch and Peierls discover how to
                 make the Bomb \\
                 May and June 1940 Churchill has more pressing problems
                 \\
                 June to September 1940 Thomson and his MAUD committee
                 debate policy on the Bomb \\
                 August 1940 to August 1941 In his finest hour,
                 Churchill begs America for help \\
                 July and August 1941 Chadwick believes Britain should
                 build its own Bomb \\
                 August 1941 to January 1942 Oliphant bustles in America
                 \\
                 November 1941 to July 1942 Churchill talks about the
                 Bomb with FDR \\
                 January 1942 to January 1943 Akers attempts a merger
                 \\
                 October 1942 to July 1943 Bush aims for an American
                 monopoly \\
                 January to September 1943 Churchill's nuclear deal with
                 FDR \\
                 September 1943 to May 1944 Bohr takes a political
                 initiative \\
                 April to September 1944 The Bulldog meets the Great
                 Dane \\
                 February 1944 to July 1945 Chadwick witnesses the first
                 nuclear explosion \\
                 1 July to 5 August 1945 Churchill says yes to dropping
                 the Bomb \\
                 3: Churchill as Leader of the Opposition \\
                 August 1945 to January 1949 Blackett: nuclear heretic
                 \\
                 August 1945 to August 1945 Churchill the Cold Warrior
                 \\
                 February and March 1950 Peierls and `the spy of the
                 century' \\
                 February 1950 to Spring 1951 Churchill softens his line
                 on the Bomb \\
                 August 1945 to October 1951 Penney delivers the British
                 Bomb \\
                 4: Churchill's Second Premiership \\
                 October 1951 to December 1952 Churchill --- Britain's
                 first nuclear Premier \\
                 1953 Hinton engineers nuclear power \\
                 March 1953 to February 1954 Churchill the nuclear
                 missionary \\
                 March to December 1954 Cockcroft becomes a confidant of
                 the Prime Minister \\
                 April 1954 to April 1955 Churchill's nuclear swansong
                 \\
                 Epilogues \\
                 1954 Onwards 1: Churchill's nuclear scientists \\
                 6 April 1955 Onwards 2: Churchill and his Prof \\
                 Acknowledgements \\
                 References \\
                 Index \\
                 Plates \\
                 About the Author \\
                 By the Same Author",
}

@Book{Farmelo:2013:CBHb,
  author =       "Graham Farmelo",
  booktitle =    "{Churchill}'s bomb: how the {United States} overtook
                 {Britain} in the first nuclear arms race",
  title =        "{Churchill}'s bomb: how the {United States} overtook
                 {Britain} in the first nuclear arms race",
  publisher =    pub-BASIC-BOOKS,
  address =      pub-BASIC-BOOKS:adr,
  pages =        "vi + 554",
  year =         "2013",
  ISBN =         "0-465-02195-6 (hardcover), 0-465-06989-4 (e-book)",
  ISBN-13 =      "978-0-465-02195-6 (hardcover), 978-0-465-06989-7
                 (e-book)",
  LCCN =         "UA647 .F28 2013",
  bibdate =      "Fri Oct 31 07:19:01 MDT 2014",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/b/bohr-niels.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/s/szilard-leo.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Describes how the science behind Britain's nuclear
                 arms advances at the beginning of World War II was
                 given to America because Winston Churchill didn't fully
                 believe in the physicists' research or the implications
                 of such powerful weaponry.",
  acknowledgement = ack-nhfb,
  subject =      "Churchill, Winston; Military leadership; Cherwell,
                 Frederick Alexander Lindemann; Viscount; Churchill,
                 Winston; Viscount; Churchill, Winston; World War,
                 1939-1945; Science; Great Britain; Nuclear weapons;
                 Government policy; History; Atomic bomb; United States;
                 Kernwaffe; Kernphysik; Atomic bomb; Military
                 leadership; Military policy; Military relations;
                 Government policy; Science; Military policy; 20th
                 century; Military relations",
  subject-dates = "1874--1965 (WSC); 1886--1957 (FAL)",
  tableofcontents = "Towards the nuclear age \\
                 World War II \\
                 Churchill as leader of the opposition \\
                 Churchill's second premiership \\
                 Epilogues \\
                 Acknowledgments \\
                 References \\
                 Notes \\
                 Index",
}

@Book{Fernandez:2013:UMA,
  author =       "Bernard Fernandez and Georges Ripka",
  booktitle =    "Unravelling the Mystery of the Atomic Nucleus --- a
                 Sixty Year Journey 1896--1956",
  title =        "Unravelling the Mystery of the Atomic Nucleus --- a
                 Sixty Year Journey 1896--1956",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xviii + 522",
  year =         "2013",
  DOI =          "https://doi.org/10.1007/978-1-4614-4181-6",
  ISBN =         "1-4614-4180-3 (hardcover), 1-4614-4181-1 (e-book)",
  ISBN-13 =      "978-1-4614-4180-9 (hardcover), 978-1-4614-4181-6
                 (e-book)",
  LCCN =         "QC773 .F47 2013",
  bibdate =      "Mon Apr 23 15:26:52 MDT 2018",
  bibsource =    "fsz3950.oclc.org:210/WorldCat
                 https://www.math.utah.edu/pub/bibnet/authors/b/bethe-hans.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/b/bohr-niels.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/b/born-max.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/d/debroglie-louis.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/d/dirac-p-a-m.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/f/fermi-enrico.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/f/frisch-otto.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/g/gamow-george.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/h/heisenberg-werner.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/p/pauli-wolfgang.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/p/peierls-rudolf.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/schroedinger-erwin.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 =     "\booktitle{Unravelling the Mystery of the Atomic
                 Nucleus} tells the story of how, in the span of barely
                 sixty years, we made a transition from the belief that
                 matter was composed of indivisible atoms, to the
                 discovery that in the heart of each atom lies a nucleus
                 which is ten thousand times smaller than the atom,
                 which nonetheless carries almost all its mass, and the
                 transformations of which involve energies that could
                 never be reached by chemical reactions. It was not a
                 smooth transition. The nature of nuclei, their
                 properties, the physical laws which govern their
                 behaviour, and the possibility of controlling to some
                 extent their transformations, were discovered in
                 discontinuous steps, following paths which occasionally
                 led to errors which in turn were corrected by further
                 experimental discoveries. The story begins in 1896 when
                 radioactivity was unexpectedly discovered and continues
                 up to the nineteen-sixties. The authors describe the
                 spectacular progress made by physics during that time,
                 which not only revealed a new form of matter, namely
                 nuclei, but also modified our way of thinking by
                 developing quantum mechanics and the theory of
                 relativity. The book is written in a clear and non
                 mathematical language which makes it both accessible
                 and instructive to laymen, physicists and students, as
                 well as to historians of science. It delves into
                 subjects which are of utmost importance for the
                 understanding of matter in our universe and for
                 understanding how this knowledge was achieved.",
  acknowledgement = ack-nhfb,
  remark =       "Substantially revised by the authors from the French
                 original, \booktitle{De l atome au noyau. Une approche
                 historique et de la physique nucl{\'e}aire}, Ellipses
                 (2006), and viewed by them as a second edition.",
  subject =      "Nuclear physics; History; stralingschemie;
                 deeltjesfysica; Pure sciences. Natural sciences
                 (general); quarks; History of physics; Nuclear
                 chemistry; wetenschapsgeschiedenis; Physics; fysica;
                 Nuclear physics.",
  tableofcontents = "Radioactivity: The First Puzzles / 1 \\
                 The ``Uranic Rays'' of Henri Becquerel / 1 \\
                 The Discovery / 2 \\
                 Is It Really Phosphorescence? / 4 \\
                 What Is the Nature of the Radiation? / 5 \\
                 A Limited Impact on Scientists and the Public / 6 \\
                 Why 1896? / 7 \\
                 Was Radioactivity Discovered by Chance? / 7 \\
                 Polonium and Radium / 9 \\
                 Marya Sk{\l}odowska / 9 \\
                 Pierre Curie / 10 \\
                 Polonium and Radium: Pierre and Marie Curie Invent
                 Radiochemistry / 11 \\
                 Enigmas / 14 \\
                 Emanation from Thorium / 17 \\
                 Ernest Rutherford / 17 \\
                 Rutherford Studies Radioactivity: $\alpha$- and
                 $\beta$-Rays / 18 \\
                 $\beta$-Rays Are Electrons / 19 \\
                 Rutherford in Montreal: The Radiation of Thorium, the
                 Exponential Decrease / 19 \\
                 ``Induced'' and ``Excited'' Radioactivity / 20 \\
                 Elster and Geitel: The Radioactivity of the Air and of
                 the Earth / 22 \\
                 A Third Type of Ray: $\gamma$-Rays / 24 \\
                 The Emanation of Thorium Is a Gas Belonging to the
                 Argon Family / 24 \\
                 A Proliferation of ``X'' Radiations / 25 \\
                 ``An Enigma, a Deeply Astonishing Subject'' / 26 \\
                 The Puzzle Is Disentangled / 27 \\
                 $\alpha$-Rays Revisited / 29 \\
                 Radioactivity Is an Atomic Decay / 30 \\
                 The Puzzle Is Unravelled: Radioactive Families / 30 \\
                 Where Does the Energy of Radioactivity Come from? \\
                 The Conjecture of Rutherford / 32 \\
                 Experimental Evidence of Transmutation / 35 \\
                 Radioactivity is Understood. Radioactive Families / 35
                 \\
                 Consecrations and Mourning: The End of an Era / 37 \\
                 1903: Henri Becquerel Shares the Nobel Prize with
                 Pierre and Marie Curie / 37 \\
                 The Death of Pierre Curie / 39 \\
                 1908: Rutherford is Awarded the Nobel Prize / 40 \\
                 The Death of Henri Becquerel / 40 \\
                 References / 41 \\
                 A Nucleus at the Heart of the Atom / 47 \\
                 Prehistory of the Atom / 47 \\
                 Eighteenth Century: The Abbot Nollet / 48 \\
                 Beginning of the Nineteenth Century: John Dalton,
                 William Prout, Gay-Lussac, Avogadro, and Amp{\`e}re /
                 49 \\
                 Do Atoms Really Exist? / 50 \\
                 1865: Loschmidt Estimates the Size of Air Molecules /
                 51 \\
                 Spectral Lines: A First Indication of an Internal
                 Structure of Atoms / 52 \\
                 Jean Perrin Advocates the Reality of Atoms / 52 \\
                 1897: The Electrons Are in the Atom / 55 \\
                 Electric Discharges in Gases, Cathode Rays and the
                 Electron / 55 \\
                 ``Dynamids'': The Atoms of Philipp Lenard / 55 \\
                 Numeric Attempts to Describe Spectral Rays: Balmer and
                 Rydberg / 56 \\
                 J. J. Thomson's First Model: An Atom Consisting
                 Entirely of Electrons / 57 \\
                 A Speculation of Jean Perrin: The Atom Is Like a Small
                 Scale Solar System / 57 \\
                 The ``Saturn'' Model of Hantaro Nagaoka / 58 \\
                 The ``Plum-Pudding'' Atom of J. J. Thomson / 59 \\
                 Charles Barkla Measures the Number of Electrons in an
                 Atom / 60 \\
                 The Scattering of $\alpha$ Particles Makes It Possible
                 to ``See'' a Nucleus in the Atom / 63 \\
                 An Observation of Marie Curie / 63 \\
                 William Henry Bragg: The Slowing Down of
                 $\alpha$-Particles in Matter / 63 \\
                 The ``Scattering'' of $\alpha$-Particles / 65 \\
                 The Nature of the $\alpha$-Particle: An Unresolved
                 Question / 66 \\
                 The First Geiger Counter / 67 \\
                 The Nature of the $\alpha$-Particle / 69 \\
                 Another Way to Count $\alpha$-Particles: Scintillations
                 / 70 \\
                 Back to the Scattering of $\alpha$-Particles / 71 \\
                 The Experiments of Geiger and Marsden / 72 \\
                 Are the Large Deviations Caused by Multiple Small
                 Deviations? / 73 \\
                 Rutherford Invents the Nucleus / 74 \\
                 A Last Ingredient: Moseley Measures the Charge of the
                 Nucleus in the Atom / 77 \\
                 Barkla Creates X-ray Spectroscopy / 77 \\
                 The Diffraction of X-rays: Max von Laue, William Henry
                 and William Lawrence Bragg / 78 \\
                 Henry Moseley Measures the Charge of Nuclei / 79 \\
                 A Paradox / 81 \\
                 References / 83 \\
                 Quantum Mechanics: The Unavoidable Path / 89 \\
                 Branching Off / 89 \\
                 An Improbable Beginning / 91 \\
                 The Peak of Classical Mechanics / 91 \\
                 A Persistent Problem / 92 \\
                 1900: Max Planck Invents the Quantum of the Action / 94
                 \\
                 A Quantum of Action / 96 \\
                 Einstein and Light Quanta / 96 \\
                 The Specific Heat of Solids / 99 \\
                 The First Solvay Council and the Theory of Quanta / 99
                 \\
                 Niels Bohr: The Quanta Are in the Atom / 103 \\
                 Bohr Introduces Quanta in the Theory of the Atom / 103
                 \\
                 ``On the Constitution of Atoms and Molecules'' / 105
                 \\
                 Two Other Papers in Bohr's 1913 Trilogy / 108 \\
                 1913--1923: Victories and Setbacks / 109 \\
                 Skepticism, Enthusiasm and Adhesion / 109 \\
                 Confirmation: The Experiment of Franck and Hertz / 110
                 \\
                 A Proliferation of Optical Lines: The Zeeman and Stark
                 Effects / 110 \\
                 Arnold Sommerfeld: Elliptic Orbits and New Quantum
                 Numbers / 111 \\
                 Relativistic Corrections and the Fine Structure
                 Constant / 112 \\
                 A Hoax! / 113 \\
                 A Further Contribution of Einstein: The Interaction
                 Between Radiation and Matter / 113 \\
                 The Stark Effect: A Victory of the Theory of Quanta /
                 114 \\
                 The ``Correspondence Principle'' / 115 \\
                 Kossel, Bohr and the Mendeleev Table / 116 \\
                 The Rare Earths / 118 \\
                 1918, 1921 and 1922: Three Nobel Prizes Attributed to
                 Quanta / 118 \\
                 1925: Spin and the Pauli Principle / 121 \\
                 Wolfgang Pauli / 121 \\
                 Max Born / 122 \\
                 The Stern and Gerlach Experiment / 123 \\
                 The Compton Effect / 124 \\
                 A Strange Explanation of the Zeeman Effect / 125 \\
                 Pauli's Exclusion Principle / 126 \\
                 The ``Spin'' of the Electron / 127 \\
                 Quantum Mechanics / 131 \\
                 Louis de Broglie / 131 \\
                 Heisenberg and Matrix Mechanics / 133 \\
                 New Physics / 135 \\
                 Pauli Applies the New Mechanics to the Spectrum of
                 Hydrogen / 136 \\
                 The Schr{\"o}dinger Equation / 136 \\
                 Heisenberg and Schr{\"o}dinger, Two Sides of the Same
                 Coin / 139 \\
                 The Probabilistic Interpretation of Max Born and the
                 End of Determinism / 139 \\
                 The Pauli Matrices / 141 \\
                 Indistinguishable Particles: Bose-Einstein
                 ``Statistics'' / 141 \\
                 Enrico Fermi: A New ``Statistics'' / 143 \\
                 Paul Adrien Maurice Dirac / 144 \\
                 ``Bosons'' and ``Fermions'' / 147 \\
                 The Uncertainty Relations of Heisenberg / 148 \\
                 Nobel Acknowledgments / 152 \\
                 The Fifth Solvay Council: An Assessment of the New
                 Mechanics / 153 \\
                 The German Language, the Language of Quantum Mechanics
                 / 154 \\
                 A Brief Bibliography / 155 \\
                 References / 157 \\
                 A Timid Infancy / 163 \\
                 The Atomic Nucleus in 1913 / 163 \\
                 The Discovery of Isotopes and the Measurement of Masses
                 of Nuclei / 165 \\
                 The Chemistry of Radioactive Products / 165 \\
                 Frederick Soddy / 166 \\
                 Isotopes / 166 \\
                 The Revival of Positively Charged ``Canal Rays'' / 168
                 \\
                 The First Physical Measurements of Atomic Masses / 168
                 \\
                 Francis Aston and the First Mass Spectrometer / 169 \\
                 The ``Whole Number Law'' and the Old Hypothesis of
                 William Prout / 171 \\
                 The Exceptional Mass of the Hydrogen Atom / 173 \\
                 A Nobel Prize for the ``Whole-Number Rule'' / 175 \\
                 The Atomic Masses Known in 1932: The Binding Energy of
                 Nuclei / 176 \\
                 An Enquiry Full of Surprises: $\beta$ Radioactivity /
                 179 \\
                 The Velocity of the $\beta$ Electrons / 180 \\
                 Otto Hahn / 180 \\
                 Lise Meitner / 182 \\
                 Hahn, Meitner and $\beta$ Radioactivity / 184 \\
                 The First ``$\beta$ Spectrometer'' / 185 \\
                 The Kaiser Wilhelm Institut / 186 \\
                 Clouds Are Gathering / 186 \\
                 James Chadwick: A Continuous $\beta$ Spectrum! / 187
                 \\
                 Is It Really a Continuous Spectrum? / 189 \\
                 In Berlin: The War / 190 \\
                 Lise Meitner Returns to $\beta$ Radioactivity / 190 \\
                 The Decisive Experiment of Charles Ellis / 191 \\
                 A Scandal: Energy May Not Be Conserved! / 193 \\
                 Geiger and Bothe: A ``Coincidence'' Experiment / 193
                 \\
                 The Idea of Wolfgang Pauli / 194 \\
                 But Why Are So Many Spectral Lines Observed? The Key to
                 the Mystery / 196 \\
                 The First Nuclear Reactions / 199 \\
                 The First Nuclear Reaction / 200 \\
                 Sir Ernest Rutherford, Cavendish Professor of Physics /
                 202 \\
                 New Nuclear Reactions / 202 \\
                 A Controversy Between Vienna and Cambridge / 203 \\
                 How Do the Transmutations Occur? / 205 \\
                 The Nucleus in 1920 According to Rutherford / 207 \\
                 The Size of the Nucleus / 208 \\
                 The Constitution of the Nucleus and of Isotopes / 208
                 \\
                 Rutherford the Visionary: The Neutron / 209 \\
                 Chadwick Hunts for New Forces / 210 \\
                 The Rapid Expansion of Experimental Means / 213 \\
                 Scintillation Methods / 213 \\
                 The Point Counter / 214 \\
                 The Geiger--M{\"u}ller Counter / 215 \\
                 A Digression: The Birth and Development of Wireless
                 Radio / 216 \\
                 The Electronically Amplified Ionization Chamber / 217
                 \\
                 Coincidence Measurements / 219 \\
                 The Measurement of the Energy of $\gamma$ Radiation /
                 220 \\
                 A Unique Detector: Wilson's Cloud Chamber / 222 \\
                 The Atomic Nucleus in 1930 / 227 \\
                 Some Certainties and One Enigma / 228 \\
                 At the Beginning of 1932, the Enigma Remains / 231 \\
                 References / 233 \\
                 1930--1940: A Dazzling Development / 241 \\
                 The Nucleus: A New Boundary / 241 \\
                 Quantum Mechanics Acting in the Nucleus / 242 \\
                 Salomon Rosenblum and the Fine Structure of $\alpha$
                 Radioactivity / 244 \\
                 1931: The First International Congress of Nuclear
                 Physics / 246 \\
                 The Discovery of an Exceptional Isotope: Deuterium /
                 249 \\
                 The Discovery of the Neutron / 253 \\
                 Fr{\'e}d{\'e}ric and Ir{\`e}ne Joliot-Curie / 254 \\
                 Protons Are Ejected / 256 \\
                 The Neutron Is Revealed / 257 \\
                 Is the Neutron Lighter or Heavier than the Proton? /
                 258 \\
                 Nuclear Theory After the Discovery of the Neutron / 263
                 \\
                 Werner Heisenberg / 263 \\
                 Ettore Majorana / 267 \\
                 Eugene P. Wigner / 270 \\
                 Do the Protons and Neutrons form Shells as Electrons Do
                 in the Atom? / 271 \\
                 A New Particle: The Positron / 279 \\
                 Cosmic Rays / 279 \\
                 Blackett and Occhialini / 280 \\
                 Carl Anderson Discovers a Positive Electron / 282 \\
                 The Positive Electron of Anderson and that of Dirac /
                 283 \\
                 Ir{\`e}ne and Fr{\'e}d{\'e}ric Joliot-Curie / 286 \\
                 The Birth of Particle Accelerators / 289 \\
                 Direct Acceleration: A High-Voltage Race / 290 \\
                 Acceleration in Steps / 295 \\
                 ``Charge Independence'' of the Nuclear Force / 303 \\
                 The Discovery of Artificial Radioactivity / 305 \\
                 The Joliot-Curies After the Solvay Council / 307 \\
                 ``A New Kind of Radioactivity'' / 308 \\
                 The Chemical Proof / 309 \\
                 It Spreads like Wildfire / 310 \\
                 The Importance of the Discovery / 311 \\
                 New Perspectives for Radioactive Indicators / 312 \\
                 The Death of Marie Curie / 313 \\
                 The 1935 Nobel Prizes Are Attributed to Chadwick and to
                 the Joliot-Curies / 314 \\
                 The School of Rome / 315 \\
                 The Theory of $\beta$ Decay / 316 \\
                 Neutron Physics in Rome / 318 \\
                 ``Slow'' Neutrons / 321 \\
                 A New Field in Nuclear Physics / 323 \\
                 Resonances / 324 \\
                 Fermi Is Awarded the Nobel Prize. The End of the Rome
                 Team / 326 \\
                 The Great Exodus of Jewish Scientists Under Nazism /
                 327 \\
                 A Proliferation of Theories: Yukawa, Breit and Wigner,
                 Bohr / 331 \\
                 Hideki Yukawa / 331 \\
                 The First Theories of Nuclear Reactions / 335 \\
                 The Structure of the Nucleus According to Bohr in 1937
                 / 338 \\
                 The Death of a Giant: Ernest Rutherford / 341 \\
                 Hans Bethe Sums Up the Situation in 1936--1937 / 343
                 \\
                 Hans Albrecht Bethe / 343 \\
                 The Structure of Nuclei / 344 \\
                 Nuclear Reactions / 348 \\
                 The Fission of Uranium / 349 \\
                 A Fragile Discovery: The Transuranic Elements / 349 \\
                 Loads of ``Transuranic'' Elements / 352 \\
                 At the Institut du Radium / 354 \\
                 Lise Meitner Flees Nazi Germany / 358 \\
                 Otto Hahn and Fritz Strassmann Set Again to Work / 359
                 \\
                 More and More Disconcerting Results / 360 \\
                 The Word Is Finally Uttered / 363 \\
                 The News Spreads to the United States / 364 \\
                 Confirmations / 365 \\
                 Niels Bohr: The Theory of Fission, Uranium 235 / 368
                 \\
                 The Number of Emitted Neutrons / 370 \\
                 Leo Szilard / 371 \\
                 Is a Chain Reaction Possible? / 372 \\
                 The Last Publications Before the War / 375 \\
                 Francis Perrin and the Critical Mass / 377 \\
                 French Patents / 378 \\
                 References / 381 \\
                 The Upheavals of the Second World War / 395 \\
                 A Chronology / 395 \\
                 The New Face of Physics After the War / 401 \\
                 Big Science: Physics on a Large Scale / 402 \\
                 Team Work / 402 \\
                 The H-Bomb: Political and Military Implications / 403
                 \\
                 The American Supremacy / 404 \\
                 Europe and Japan After the War / 405 \\
                 Is ``Big Science'' Really the Result of the War? / 409
                 \\
                 References / 411 \\
                 The Time of Maturity / 413 \\
                 New Experimental Means / 413 \\
                 New Accelerators Have Ever Increasing Energies / 414
                 \\
                 New Detectors, New Measuring Instruments / 419 \\
                 Data Accumulate / 425 \\
                 The Papers of Bethe / 425 \\
                 Real Transuranic Nuclei / 425 \\
                 The Lifetime of the Neutron / 429 \\
                 Electron Scattering and the Electric Charge
                 Distribution in Nuclei / 430 \\
                 The ``Shell'' Structure of Nuclei / 433 \\
                 A Model of Quasi-independent Particles? / 434 \\
                 The Symmetries and Supermultiplets of Wigner and
                 Feenberg / 434 \\
                 Arguments Put Forth by Maria Goeppert-Mayer / 435 \\
                 The Spin-Orbit Interaction / 436 \\
                 Johannes Hans Daniel Jensen / 437 \\
                 A Paradoxical Model / 438 \\
                 Elastic Scattering and the ``Optical Model'' / 441 \\
                 The Nucleus Is Like a Cloudy Crystal Ball / 442 \\
                 ``Optical'' Attempts / 442 \\
                 The Woods--Saxon ``Optical'' Potential / 443 \\
                 The Computer: A Decisive Instrument / 444 \\
                 Direct Nuclear Reactions / 447 \\
                 The Stripping of a Deuteron / 448 \\
                 Direct Reactions and Reactions Which Proceed Though the
                 Formation of a Compound Nucleus / 452 \\
                 A Collective Behavior / 455 \\
                 Photonuclear Reactions / 455 \\
                 Giant Resonances / 456 \\
                 Are All Nuclei Spherical? / 457 \\
                 The Quadrupole Moment: An Indicator of Nuclear
                 Deformation / 458 \\
                 James Rainwater and Aage Bohr / 458 \\
                 Aage Bohr, the Resolution of a Paradox / 460 \\
                 A Unified Model of the Nucleus / 463 \\
                 Ben Mottelson / 463 \\
                 New Data, New Confirmations / 464 \\
                 Bohr and Mottelson: The Key to Nuclear Spectra / 465
                 \\
                 The Birth of Nuclear Spectroscopy / 467 \\
                 Nobel Awards / 468 \\
                 The Nuclear Force / 469 \\
                 The Discovery of the $\pi$ Meson / 469 \\
                 The $\pi^0$ Completes the Pion Trio / 470 \\
                 The Hard Core / 471 \\
                 Nuclear Matter / 473 \\
                 The Challenge / 473 \\
                 Keith Brueckner, Jeffrey Goldstone, Hans Bethe, and a
                 Few Others / 474 \\
                 Solid Foundations / 475 \\
                 And What About Niels Bohr's Original Objection? / 476
                 \\
                 The End of an Era / 476 \\
                 References / 479 \\
                 Where the Narrative Ends / 487 \\
                 Glossary / 491 \\
                 Bibliography of cited books / 513 \\
                 Index / 521 \\
                 The Periodic Law or Mendeleev table / 530",
}

@Book{Feynman:2000:PFT,
  author =       "Richard P. Feynman",
  booktitle =    "The pleasure of finding things out: the best short
                 works of {Richard P. Feynman}",
  title =        "The pleasure of finding things out: the best short
                 works of {Richard P. Feynman}",
  publisher =    pub-PERSEUS,
  address =      pub-PERSEUS:adr,
  pages =        "xvi + 270",
  year =         "2000",
  ISBN =         "0-7382-0349-1 (paperback)",
  ISBN-13 =      "978-0-7382-0349-2 (paperback)",
  LCCN =         "Q171 .F385 1999",
  bibdate =      "Mon Dec 12 15:35:40 MST 2005",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/d/dyson-freeman-j.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/f/feynman-richard-p.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  note =         "Edited by Jeffrey Robbins, and foreword by Freeman
                 Dyson.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "Foreword by Freeman Dyson / ix \\
                 Editor's Introduction / xv \\
                 1: The Pleasure of Finding Things Out / 1 \\
                 2: Computing Machines in the Future / 23 \\
                 3: Los Alamos from Below / 53 \\
                 4: What Is and What Should Be the Role of Scientific
                 Culture in Modern Society / 93 \\
                 5: There's Plenty of Room at the Bottom / 117 \\
                 6: The Value of Science / 141 \\
                 7: Richard P. Feynman's Minority Report to the Space
                 Shuttle Challenger Inquiry / 151 \\
                 8: What Is Science? / 171 \\
                 9: The Smartest Man in the World / 189 \\
                 10: Cargo Cult Science: Some Remarks on Science,
                 Pseudoscience, and Learning How to Not Fool Yourself /
                 205 \\
                 11: It's as Simple as One, Two, Three / 217 \\
                 12: Richard Feynman Builds a Universe / 225 \\
                 13: The Relation of Science and Religion / 245 \\
                 Acknowledgments / 259 \\
                 Index / 261",
}

@Book{Feynman:2005:PRD,
  editor =       "Michelle Feynman",
  booktitle =    "Perfectly Reasonable Deviations (from the Beaten
                 Track): the Collected Letters of {Richard P. Feynman}",
  title =        "Perfectly Reasonable Deviations (from the Beaten
                 Track): the Collected Letters of {Richard P. Feynman}",
  publisher =    pub-BASIC-BOOKS,
  address =      pub-BASIC-BOOKS:adr,
  pages =        "xxiii + 486",
  year =         "2005",
  ISBN =         "0-7382-0636-9",
  ISBN-13 =      "978-0-7382-0636-3",
  LCCN =         "QC16 .F49 A4 2005",
  bibdate =      "Mon Dec 12 15:45:27 MST 2005",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/f/feynman-richard-p.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.loc.gov:7090/Voyager",
  note =         "Foreword by Timothy Ferris. See also interview with
                 the editor \cite{Anonymous:2005:BFI}.",
  URL =          "ftp://uiarchive.cso.uiuc.edu/pub/etext/gutenberg/;
                 http://www.loc.gov/catdir/toc/ecip055/2005000049.html",
  abstract =     "One of the towering figures of twentieth-century
                 science, Richard Feynman possessed a curiosity that was
                 the stuff of legend. Even before he won the Nobel Prize
                 in 1965, his unorthodox and spellbinding lectures on
                 physics secured his reputation amongst students and
                 seekers around the world. It was his outsized love for
                 life, however, that earned him the status of an
                 American cultural icon--here was an extraordinary
                 intellect devoted to the proposition that the thrill of
                 discovery was matched only by the joy of communicating
                 it to others. In this career-spanning collection of
                 letters, many published here for the first time, we are
                 able to see this side of Feynman like never before. As
                 edited and annotated by his daughter, Michelle, these
                 letters not only allow us to better grasp the how and
                 why of Feynman's enduring appeal, but also to see the
                 virtues of an inquiring eye in spectacular fashion. The
                 result is a wonderful de facto guide to life, an
                 eloquent testimony to the human quest for knowledge at
                 all levels.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  remark =       "Published in the UK \cite{Feynman:2005:DYT}.",
  subject =      "Feynman, Richard Phillips; Physicists; United States;
                 Correspondence; Physicists; United States; Biography;
                 Physics",
  tableofcontents = "Letters \\
                 1939--1942 \\
                 1943--1945 \\
                 1946--1959 \\
                 1960--1970: The National Academy of Science \\
                 1960--1965 \\
                 1965: The Nobel Prize \\
                 1966--1969 \\
                 1970--1975 \\
                 1976--1981 \\
                 1982--1984 \\
                 1985--1987",
}

@Book{Feynman:2006:CFA,
  author =       "Richard Phillips Feynman and Ralph Leighton",
  booktitle =    "Classic {Feynman}: All the Adventures of a Curious
                 Character",
  title =        "Classic {Feynman}: All the Adventures of a Curious
                 Character",
  publisher =    pub-NORTON,
  address =      pub-NORTON:adr,
  pages =        "x + 511",
  year =         "2006",
  ISBN =         "0-393-06132-9",
  ISBN-13 =      "978-0-393-06132-1",
  LCCN =         "QC16.F49 A3 2006",
  bibdate =      "Fri Apr 8 22:15:10 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/d/dyson-freeman-j.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/f/feynman-richard-p.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.loc.gov:7090/Voyager",
  URL =          "ftp://uiarchive.cso.uiuc.edu/pub/etext/gutenberg/;
                 http://www.loc.gov/catdir/toc/ecip0515/2005018928.html",
  acknowledgement = ack-nhfb,
  author-dates = "Richard Phillips Feynman (1918--1988)",
  libnote =      "Not yet in my library.",
  remark =       "With a commemorative CD.",
  subject =      "Feynman, Richard Phillips; Physicists; United States;
                 Biography; Physicists; United States; Intellectual
                 life; 20th century",
  tableofcontents = "Prologue / 1 \\
                 To the reader / by Ralph Leighton / 3 \\
                 Foreword / by Freeman Dyson / 5 \\
                 \\
                 From far Rockaway to MIT / 11 \\
                 The making of a scientist / 13 \\
                 He fixes radios by thinking! / 20 \\
                 String beans / 29 \\
                 Who stole the door? / 33 \\
                 Always trying to escape / 43 \\
                 The chief research chemist of the Metaplast Corporation
                 / 50 \\
                 \\
                 The Princeton years / 57 \\
                 ``Surely you're joking, Mr. Feynman!'' / 59 \\
                 Monster minds / 65 \\
                 A different box of tools / 69 \\
                 It's a simple as one, two, three, \ldots{} / 72 \\
                 Meeeeeeeee! / 77 \\
                 Mind readers / 80 \\
                 Mixing paints / 83 \\
                 Latin or Italian! / 86 \\
                 Arlene [sic, i.e. Arline] / 89 \\
                 ``What do you care what other people think?'' / 91 \\
                 Feynman, the military, and the bomb / 121 \\
                 Fizzled fuses / 123 \\
                 Los Alamos from below (spoken version on commemorative
                 CD inside back cover) / 128 \\
                 Safecracker meets safecracker / 154 \\
                 Uncle Sam doesn't need you! / 172 \\
                 From Cornell to Caltech with a touch of Brazil / 181
                 \\
                 The dignified professor / 183 \\
                 Any questions? / 192 \\
                 I want my dollar! / 197 \\
                 You just ask them? / 200 \\
                 O Americano, outra vez! / 207 \\
                 Getting ahead / 225 \\
                 Lucky numbers / 227 \\
                 Certainly, Mr. Big! / 233 \\
                 An offer you must refuse / 243 \\
                 Man of a thousand tongues / 248 \\
                 \\
                 The World of One Physicist / 249 \\
                 Would \emph{You} Solve the Dirac Equation? / 251 \\
                 Is Electricity Fire? / 260 \\
                 Hotel City / 268 \\
                 It Sounds Greek to Me! / 273 \\
                 The 7 Percent Solution / 274 \\
                 The Amateur Scientist / 282 \\
                 Testing Bloodhounds / 288 \\
                 A Map of the Cat? / 291 \\
                 But Is It Art? / 298 \\
                 Judging Books by Their Covers / 317 \\
                 Who the Hell is Herman? / 331 \\
                 Feynman Sexist Pig! / 333 \\
                 Thirteen Times / 336 \\
                 Alfred Nobel's Other Mistake / 338 \\
                 Bringing Culture to the Physicists / 347 \\
                 Altered States / 352 \\
                 Found Out in Paris / 359 \\
                 I Just Shook His Hand, Can You Believe It? / 370 \\
                 \\
                 Mr. Feynman Goes to Washington: Investigating the Space
                 Shuttle Challenger Disaster / 379 \\
                 Preliminaries / 381 \\
                 Committing Suicide / 383 \\
                 The Cold Facts / 385 \\
                 Check Six! / 413 \\
                 Gumshoes / 417 \\
                 Fantastic Figures / 431 \\
                 An Inflamed Appendix / 440 \\
                 The Tenth Recommendation / 448 \\
                 Meet the Press / 453 \\
                 Afterthoughts / 458 \\
                 Appendix F: Personal Observations on the Reliability of
                 the Shuttle / 465 \\
                 \\
                 Epilogues / 479 \\
                 Reflections / 481 \\
                 The Value of Science / 483 \\
                 Cargo Cult Science / 499 \\
                 Finding Feynman: Afterword by Alan Alda / 499 \\
                 \\
                 The Commemorative CD / 507 \\
                 About the CD \booktitle{Los Alamos from Below} / 509
                 \\
                 Other Feynman CDs / 511",
}

@Book{French:1985:NBC,
  editor =       "A. P. (Anthony Philip) French and P. J. Kennedy",
  booktitle =    "{Niels Bohr}: a centenary volume",
  title =        "{Niels Bohr}: a centenary volume",
  publisher =    pub-HARVARD,
  address =      pub-HARVARD:adr,
  pages =        "xiv + 403",
  year =         "1985",
  ISBN =         "0-674-62415-7, 0-674-62416-5 (paperback)",
  ISBN-13 =      "978-0-674-62415-3, 978-0-674-62416-0 (paperback)",
  LCCN =         "QC16.B63 N49 1985",
  bibdate =      "Thu Apr 28 21:19:11 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/bethe-hans.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/b/bohr-niels.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/h/heisenberg-werner.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/s/slater-john-clarke.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/t/teller-edward.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  price =        "US\$27.50",
  acknowledgement = ack-nhfb,
  subject =      "Bohr, Niels; Physics; History; Physicists; Denmark;
                 Biography",
  subject-dates = "1885--1962",
  tableofcontents = "Chronology / / xi--xiv \\
                 Part I: The man and what he achieved \\
                 A short biography / P. J. Kennedy / 3 \\
                 A personal memoir / James Franck / 16 \\
                 Niels Bohr, the quantum, and the world / Victor F.
                 Weisskopf / 19 \\
                 Part II: The early years \\
                 Bohr's first theories of the atom / John L. Heilbron /
                 33 \\
                 The theory of the periodic system / Helge Kragh / 50
                 \\
                 Bohr and Rutherford / Mark Oliphant / 68 \\
                 Bohr, G{\"o}ttingen, and quantum mechanics / Friedrich
                 Hund / 71 \\
                 The trilogy / Niels Bohr / 76 \\
                 Nobel Prize lecture: the structure of the atom / Niels
                 Bohr / 91 \\
                 Part III: The birth and growth of quantum mechanics \\
                 Bohr on the foundations of quantum theory / Edward
                 MacKinnon / 101 \\
                 The Bohr--Einstein dialogue / Niels Bohr / 121 \\
                 A bolt from the blue: the E-P-R paradox / N. David
                 Mermin / 141 \\
                 Delayed-choice experiments / P. J. Kennedy / 148 \\
                 On Bohr's views concerning the quantum theory / David
                 Bohm / 153 \\
                 Waves and particles: 1923--1924 / John C. Slater / 160
                 \\
                 Reminiscences from 1926 and 1927 / Werner Heisenberg /
                 163 \\
                 At the Niels Bohr Institute in 1929 / Nevill Mott / 172
                 \\
                 Niels Bohr and the physics of simple phenomena / H. B.
                 G. Casimir / 175 \\
                 A few memories / Edward Teller / 181 \\
                 A reminiscence from 1932 / C. F. von Weizs{\"a}cker /
                 183 \\
                 The Como lecture / Niels Bohr / 191 \\
                 Part IV: In the world of nuclear physics \\
                 Niels Bohr and nuclear physics / Roger Stuewer / 197
                 \\
                 Physics in Copenhagen in 1934 and 1935 / John A.
                 Wheeler / 221 \\
                 Some recollections of Bohr / Rudolf Peierls / 227 \\
                 Niels Bohr and his institute / Hans Bethe / 232 \\
                 Transmutations of atomic nuclei / Niels Bohr / 235 \\
                 The mechanism of nuclear fission / Niels Bohr and John
                 A. Wheeler / 240 \\
                 Reminiscences from the postwar years / Abraham Pais /
                 244 \\
                 Part V: Bohr and politics \\
                 Niels Bohr as a political figure / Ruth Moore / 253 \\
                 Energy from the atom: an opportunity and a challenge /
                 Niels Bohr / 261 \\
                 Niels Bohr and nuclear weapons / Margaret Gowing / 266
                 \\
                 Meetings in wartime and after / R. V. Jones / 278 \\
                 Open letter to the United Nations / Niels Bohr / 288
                 \\
                 Part VI: Philosophical ideas \\
                 The philosophy of Niels Bohr / Aage Petersen / 299 \\
                 Light and life / Niels Bohr / 311 \\
                 Complementarity as a way of life / R. V. Jones / 320
                 \\
                 The complementarity principle and eastern philosophy /
                 D. S. Kothari / 325 \\
                 Complementarity and Marxism--Leninism / Loren Graham /
                 332 \\
                 Part VII: Epilogue \\
                 A glimpse on the other side / Philip Morrison / 345 \\
                 Some closing reflections / A. P. French / 351 \\
                 Notes / / 355 \\
                 Glossary / / 368 \\
                 Works by Niels Bohr / / 385 \\
                 Credits / / 392 \\
                 Index / / 396--403",
}

@Book{Gamow:1985:TYS,
  author =       "George Gamow",
  booktitle =    "Thirty Years That Shook Physics: the Story of Quantum
                 Theory",
  title =        "Thirty Years That Shook Physics: the Story of Quantum
                 Theory",
  publisher =    pub-DOVER,
  address =      pub-DOVER:adr,
  pages =        "xiv + 224 + 9",
  year =         "1985",
  ISBN =         "0-486-24895-X (paperback)",
  ISBN-13 =      "978-0-486-24895-0 (paperback)",
  LCCN =         "QC174.12 .G35 1985",
  bibdate =      "Mon May 28 15:19:57 MDT 2012",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/bohr-niels.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/d/dirac-p-a-m.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/f/fermi-enrico.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/g/gamow-george.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/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  price =        "US\$4.95",
  URL =          "http://www.loc.gov/catdir/description/dover032/85006797.html",
  acknowledgement = ack-nhfb,
  author-dates = "George Gamow (1904--1968)",
  keywords =     "Albert Einstein; Enrico Fermi; George Gamow; Lord
                 Rutherford; Louis de Brogle Max Planck; L{\'e}on
                 Rosenfeld; Niels Bohr; Paul Ehrenfest; Sir J. J.
                 Thomson; Solvay Conference; Werner Heisenberg; Wolfgang
                 Pauli",
  remark =       "Reprint of
                 \cite{Gamow:1966:TYSa,Gamow:1966:TYSb,Gamow:1972:TYS}.",
  shorttableofcontents = "I. M. Planck and Light Quanta \\
                 II. N. Bohr and Quantum Orbits \\
                 III. W. Pauli and the Exclusion Principle \\
                 IV. L. de Broglie and Pilot Waves \\
                 V. W. Heisenberg and the Uncertainty Principle \\
                 VI. P. A. M. Dirac and Anti-Particles \\
                 VII. E. Fermi and Particle Transformations \\
                 VIII. H. Yukawa and Mesons \\
                 IX. Men At Work \\
                 Appendix Blegdamsvej Faust",
  subject =      "Quantum theory; Physics; History",
  tableofcontents = "Biographical Preface / vii \\
                 Preface / xi \\
                 Introduction / 1 \\
                 I M. Planck and Light Quanta: Statistical Mechanics and
                 Thermal Radiation --- Max Planck and the Quantum of
                 Energy --- Light Quanta and the Photoelectric Effect
                 --- The Compton Effect / 6 \\
                 II N. Bohr and Quantum Orbits: Rutherford's Theory of
                 the Nuclear Atom --- Quantizing a Mechanical System ---
                 Sommerfeld's Elliptical Orbits --- Bohr's Institute /
                 29 \\
                 III W. Pauli and the Exclusion Principle: Quotas for
                 Electron Levels --- The Spinning Electron --- Pauli and
                 Nuclear Physics --- The Neutrino / 62 \\
                 IV L. De Broglie and Pilot Waves: Schr{\"o}dinger's
                 Wave Equation --- Applying Wave Mechanics / 80 \\
                 V W. Heisenberg and the Uncertainty Principle:
                 Discarding Classical Linear Trajectories / 98 \\
                 VI P. A. M. Dirac and Anti-Particles: Unifying
                 Relativity and Quantum Theory --- Anti-Particle Physics
                 / 118 \\
                 VII E. Fermi and Particle Transformations: The Forces
                 Behind $\beta$-Transformation --- Using Fermi
                 Interaction Laws --- Fermi's Research in Nuclear
                 Reactions / 139 \\
                 VIII H. Yukawa and Mesons / 149 \\
                 IX Men at Work / 154 \\
                 Appendix Blegdamsvej \booktitle{Faust} / 165 \\
                 Index",
}

@Book{Gell-Mann:1997:QJA,
  author =       "Murray Gell-Mann",
  booktitle =    "The quark and the jaguar: adventures in the simple and
                 the complex",
  title =        "The quark and the jaguar: adventures in the simple and
                 the complex",
  publisher =    pub-W-H-FREEMAN,
  address =      pub-W-H-FREEMAN:adr,
  pages =        "xviii + 392",
  year =         "1997",
  ISBN =         "0-7167-2725-0 (paperback)",
  ISBN-13 =      "978-0-7167-2725-5 (paperback)",
  LCCN =         "QC774.G45 A3 1994",
  bibdate =      "Fri Aug 8 06:26:36 MDT 2014",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "http://www.gbv.de/dms/bowker/toc/9780716725817.pdf;
                 http://www.zentralblattmath.org/zmath/en/search/?an=0833.00011",
  abstract =     "From one of the architects of the new science of
                 simplicity and complexity comes a highly personal,
                 unifying vision of the natural world. As a theoretical
                 physicist, Murray Gell-Mann has explored nature at its
                 most fundamental level. His achievements include the
                 1969 Nobel Prize for work leading up to his discovery
                 of the quark --- the basic building block of all atomic
                 nuclei throughout the universe. But Gell-Mann is a man
                 of many intellectual passions, with lifelong interests
                 in fields that seek to understand existence at its most
                 complex: natural history, biological evolution, the
                 history of language, and the study of creative
                 thinking. These seemingly disparate pursuits come
                 together in Gell-Mann's current work at the Santa Fe
                 Institute, where scientists are investigating the
                 similarities and differences among complex adaptive
                 systems --- systems that learn or evolve by utilizing
                 acquired information. They include a child learning his
                 or her native language, a strain of bacteria becoming
                 resistant to an antibiotic, the scientific community
                 testing new theories, or an artist implementing a
                 creative idea. The Quark and the Jaguar is Gell-Mann's
                 own story of finding the connections between the basic
                 laws of physics and the complexity and diversity of the
                 natural world. The simple: a quark inside an atom. The
                 complex: a jaguar prowling its jungle territory in the
                 night. Exploring the relationship between them becomes
                 a series of exciting intellectual adventures.",
  acknowledgement = ack-nhfb,
  subject =      "Gell-Mann, Murray; Travel; Ecuador; Particles (Nuclear
                 physics); Nuclear physicists; United States; Biography;
                 Description and travel",
  tableofcontents = "Part 1. The Simple and the Complex \\
                 1. Prologue: An Encounter in the Jungle \\
                 2. Early Light \\
                 3. Information and Crude Complexity \\
                 4. RANDomness \\
                 5. A Child Learning a Language \\
                 6. Bacteria Developing Drug Resistance \\
                 7. The Scientific Enterprise \\
                 8. The Power of Theory \\
                 9. What Is Fundamental? \\
                 Part 2. The Quantum Universe \\
                 10. Simplicity and Randomness in the Quantum Mechanics
                 Universe \\
                 11. A Contemporary View of Quantum Mechanics \\
                 12. Quantum Mechanics and Flapdoodle \\
                 13. Quarks and All That: The Standard Model \\
                 14. Superstring Theory: Unification at Last? \\
                 15. Time's Arrow's: Forward and Backward Time \\
                 Part 3. Selection and Fitness \\
                 16. Selection at Work in Biological Evolution and
                 Elsewhere \\
                 17. From Learning to Creative Thinking \\
                 18. Superstition and Skepticism \\
                 19. Adaptive and Maladaptive Schema \\
                 20. Machines That Learn or Simulate Learning \\
                 Part 4. Diversity and Sustainability \\
                 21. Diversities Under Threat \\
                 22. Transitions to a More Sustainable World \\
                 23. Afterword \\
                 Index",
}

@Book{Gleick:1992:GLS,
  author =       "James Gleick",
  booktitle =    "Genius: The Life and Science of {Richard Feynman}",
  title =        "Genius: The Life and Science of {Richard Feynman}",
  publisher =    pub-PANTHEON,
  address =      pub-PANTHEON:adr,
  pages =        "x + 531",
  year =         "1992",
  ISBN =         "0-679-40836-3",
  ISBN-13 =      "978-0-679-40836-9",
  LCCN =         "QC16.F49G54 1992",
  bibdate =      "Thu May 12 08:31:36 1994",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/d/dyson-freeman-j.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/f/feynman-richard-p.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$27.50",
  acknowledgement = ack-nhfb,
  tableofcontents = "Prologue / 3 \\
                 Far Rockaway / 17 \\
                 Neither country nor city \\
                 A birth and a death \\
                 It's worth it \\
                 At school \\
                 All things are made of atoms \\
                 A century of progress \\
                 Richard and Julian \\
                 MIT / 51 \\
                 The best path \\
                 Socializing the engineer \\
                 The newest physics \\
                 Shop men \\
                 Feynman of course is Jewish \\
                 Forces in molecules \\
                 Is he good enough? \\
                 Princeton / 93 \\
                 A quaint ceremonious village \\
                 Folds and rhythms \\
                 Forward or backward? \\
                 The reasonable man \\
                 Mr. X and the nature of time \\
                 Least action in quantum mechanics \\
                 The aura \\
                 The white plague \\
                 Preparing for war \\
                 The Manhattan Project \\
                 Finishing up \\
                 Los Alamos / 153 \\
                 The man comes in with his briefcase \\
                 Chain reactions \\
                 The battleship and the mosquito boat \\
                 Diffusion \\
                 Computing by brain \\
                 Computing by machine \\
                 Fenced in \\
                 The last springtime \\
                 False hopes \\
                 Nuclear fear \\
                 I will bide my time \\
                 We scientists are clever \\
                 Cornell / 207 \\
                 The university at peace \\
                 Phenomena complex --- laws simple \\
                 They all seem ashes \\
                 Around a mental block \\
                 Shrinking the infinities \\
                 Dyson \\
                 A half-assedly thought-out pictorial semi-vision thing
                 \\
                 Schwinger's glory \\
                 My machines came from too far away \\
                 There was also presented (by Feynman) \ldots{} \\
                 Cross-country with Freeman Dyson \\
                 Oppenheimer's surrender \\
                 Dyson graphs, Feynman diagrams \\
                 Away to a fabulous land \\
                 CalTech / 281 \\
                 Faker from Copacabana \\
                 Alas, the love of women! \\
                 Onward with physics \\
                 A quantum liquid \\
                 New particles, new language \\
                 Murray \\
                 In search of genius \\
                 Weak interactions \\
                 Toward a domestic life \\
                 From QED to genetics \\
                 Ghosts and worms \\
                 Room at the bottom \\
                 All his knowledge \\
                 The explorers and the tourists \\
                 The Swedish Prize \\
                 Quarks and partons \\
                 Teaching the young \\
                 Do you think you can last on forever? \\
                 Surely you're joking! \\
                 A disaster of technology \\
                 Epilogue / 429 \\
                 Acknowledgments / 441 \\
                 Notes / 445 \\
                 A Feynman Bibliography / 493 \\
                 Bibliography / 499 \\
                 Index / 517 \\
                 Illustration Credits / 532",
}

@Book{Goodstein:1991:MSH,
  author =       "Judith R. Goodstein",
  booktitle =    "{Millikan}'s school: a history of the {California
                 Institute of Technology}",
  title =        "{Millikan}'s school: a history of the {California
                 Institute of Technology}",
  publisher =    pub-NORTON,
  address =      pub-NORTON:adr,
  pages =        "317",
  year =         "1991",
  ISBN =         "0-393-03017-2, 0-393-32998-4",
  ISBN-13 =      "978-0-393-03017-4, 978-0-393-32998-8",
  LCCN =         "T171.C219 G67 1991",
  bibdate =      "Wed Sep 13 06:49:38 MDT 2017",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "Presidential Perspectives \\
                 Thomas E. Everhart / 9 \\
                 Harold Brown / 15 \\
                 Marvin L. Goldberger / 17 \\
                 Acknowledgments / 19 \\
                 1: From the Orange Groves to ``Camp Throop'' / 23 \\
                 2: Preamble to a Technical School / 41 \\
                 3: The Birth of Caltech / 64 \\
                 4: ``A Trio of Men'' / 76 \\
                 5: Millikan and the Rise of Physics / 88 \\
                 6: Biological Work / 109 \\
                 7: Earthquakes / 125 \\
                 8: Aeronautics and the Airplane Industry / 153 \\
                 9: Atoms, Molecules, and Linus Pauling / 178 \\
                 10: The Thomas Hunt Morgan Era in Biology / 193 \\
                 11: Astronomy and the 200-Inch Telescope / 213 \\
                 12: Nuclear Reactions / 228 \\
                 13: The Rockets' Red Glare / 239 \\
                 14: The DuBridge Era at Caltech / 261 \\
                 Select Bibliography / 279 \\
                 Notes / 285 \\
                 Index / 303",
}

@Book{Graybill:2002:PAC,
  editor =       "Robert Graybill and Rami Melhem",
  booktitle =    "Power Aware Computing",
  title =        "Power Aware Computing",
  publisher =    pub-KAPP,
  address =      pub-KAPP:adr,
  pages =        "xxiv + 376",
  year =         "2002",
  ISBN =         "0-306-46786-0",
  ISBN-13 =      "978-0-306-46786-8",
  LCCN =         "TK7895.P68 P69 2002",
  bibdate =      "Fri Aug 09 07:24:34 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "This book presents a new and complete view to the
                 increasingly critical area of system power through the
                 development of multi-level energy management. It
                 addresses total system requirements, tailoring energy
                 use to ensure maximum system performance. The multiple
                 layer view covers a spectrum of power optimization and
                 energy management at the circuit level, the
                 architecture level, the operating system level, the
                 compiler level, and the application level. The book
                 provides state-of-the-art research techniques and
                 specific examples for each of these power management
                 levels.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Comparative Analysis of Flip-Flops and
                 Application of Data-Gating in Dynamic Flip-Flops for
                 High Speed, Low Active and Low Leakage Power
                 Dissipation / Vamsi Srikantam and Mario Martinez \\
                 2: Low Power Sandwich/Spin Tunneling Memory Device /
                 Jim Daughton, Arthur Pohm and Russell Beech \\
                 3: Power-Efficient Issue Queue Design / Alper
                 Buyuktosunoglu, David H. Albonesi and Stanley Schuster
                 and others \\
                 4: Micro-Architecture Design and Control Speculation
                 for Energy Reduction / Dirk Grunwald \\
                 5: Energy-Exposed Instruction Sets / Krste Asanovic,
                 Mark Hampton and Ronny Krashinsky \\
                 6: Dynamic Management of Power Consumption / Tajana
                 Simunic",
}

@Book{Greenspan:2005:ECW,
  author =       "Nancy Thorndike Greenspan",
  booktitle =    "The end of the certain world: the life and science of
                 {Max Born}: the {Nobel} physicist who ignited the
                 quantum revolution",
  title =        "The end of the certain world: the life and science of
                 {Max Born}: the {Nobel} physicist who ignited the
                 quantum revolution",
  publisher =    pub-BASIC-BOOKS,
  address =      pub-BASIC-BOOKS:adr,
  pages =        "x + 374 + 16",
  year =         "2005",
  ISBN =         "0-7382-0693-8 (hardcover)",
  ISBN-13 =      "978-0-7382-0693-6 (hardcover)",
  LCCN =         "QC16.B643 G74 2005",
  bibdate =      "Wed Apr 9 10:20:05 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/born-max.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/d/dirac-p-a-m.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/f/fermi-enrico.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/h/heisenberg-werner.bib;
                 https://www.math.utah.edu/pub/tex/bib/annscience.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  remark-1 =     "See page 135 for the story of Jordan's lost paper, and
                 lost credit, for Fermi--Dirac statistics.",
  remark-2 =     "See page 191 for an English translation of a letter
                 from Heisenberg to Born regretting that Born and Jordan
                 did not share the 1932 Nobel Prize in Physics with
                 Heisenberg.",
  subject =      "Born, Max; physicists; Germany; biography",
  subject-dates = "1882--1970",
  tableofcontents = "A kind of shell \\
                 A higher desire \\
                 Matters physical \\
                 A bitter pill to swallow \\
                 There is no other born in Germany \\
                 Thinking hopelessly about Quanta \\
                 But God does play dice \\
                 Dark future \\
                 Seeing how expendable you are \\
                 Talking of desperate matters \\
                 Worse than imagination \\
                 There are so many ifs \\
                 A curse of the age \\
                 A trip to Stockholm",
}

@Book{Greenspan:2020:ASD,
  author =       "Nancy Thorndike Greenspan",
  title =        "Atomic Spy: The Dark Lives of {Klaus Fuchs}",
  publisher =    "Viking",
  address =      "New York, NY, USA",
  pages =        "xii + 401",
  year =         "2020",
  ISBN =         "0-593-08339-3 (hardcover), 0-593-08340-7 (paperback),
                 0-593-08341-5 (e-book), 2-01-905313-8",
  ISBN-13 =      "978-0-593-08339-0 (hardcover), 978-0-593-08340-6
                 (paperback), 978-2-01-905313-0",
  LCCN =         "UB271.R9 F8355 2020",
  bibdate =      "Tue Dec 21 10:31:55 MST 2021",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/p/peierls-rudolf.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "The gripping biography of a notorious Cold War villain
                 --- the German-born British scientist who handed the
                 Soviets top-secret American plans for the plutonium
                 bomb --- showing a man torn between conventional
                 loyalties and a sense of obligation to a greater good
                 Klaus Fuchs was convicted of espionage by Britain in
                 1950 for handing over the designs of the plutonium bomb
                 to the Russians, and has gone down in history as one of
                 the most dangerous agents in American and British
                 history. Using German archives and family
                 correspondence, Greenspan brings into sharp focus the
                 moral and political ambiguity of the times in which
                 Fuchs lived. After years of struggle and ideological
                 conflict, when Fuchs joined the atomic bomb project his
                 loyalties were firmly split. He started handing over
                 top secret research to the Soviets in 1941, and
                 continued for years from deep within the Manhattan
                 Project at Los Alamos, seemingly driven by a dedication
                 to peace, seeking to level the playing field of the
                 world powers.",
  acknowledgement = ack-nhfb,
  subject =      "20e si{\`e}cle; 20th century; Allemagne; Armes
                 nucl{\'e}aires Biographies; Biography and Autobiography
                 / Science and Technology; Espionage, Soviet; true crime
                 / Espionage; Espionnage sovi{\'e}tique; Espions;
                 {\'E}tats-Unis; Fuchs, Klaus Emil Julius; Germany;
                 Grande-Bretagne; Great Britain; Histoire; History /
                 Europe / Great Britain / 20th Century; Nuclear weapons;
                 Physiciens; Physicists; Soviet Union; Spies; United
                 States; URSS; USSR",
  subject-dates = "1911--1988",
  tableofcontents = "Prologue: Revelations, London August 1949 / 1 \\
                 I: Resistance / 17 \\
                 Beginnings, Leipzig 1930 / 19 \\
                 Loss, Kiel 1931 / 31 \\
                 Revolt, Kiel 1932 / 39 \\
                 Leader, Kiel 1933 / 49 \\
                 Underground, Berlin 1933 / 59 \\
                 Interlude, Paris 1933 / 71 \\
                 II: Rescue / 75 \\
                 Safety, Bristol 1933 / 77 \\
                 War, Edinburgh 1937 / 87 \\
                 Internment, England 1940 / 101 \\
                 Internment, Canada 1940 / 113 \\
                 III: Research / 127 \\
                 Tube Alloys, Birmingham 1941 / 129 \\
                 Manhattan Project, New York 1944 / 143 \\
                 Trinity, Los Alamos 1945 / 155 \\
                 Director, Harwell 1946 / 175 \\
                 IV: Reconnaissance / 193 Suspects, London September
                 1949 / 195 \\
                 Surveillance, Harwell September 1949 / 211 \\
                 Disposal, London October 1949 / 221 \\
                 Interrogation, London November 1949 / 231 \\
                 V: Results / 245 \\
                 Disposal again, London January 1950 / 247 \\
                 Confession, Harwell January 1950 / 257 \\
                 Arrest, London February 1950 / 271 \\
                 Trial, London March 1950 / 285 \\
                 The FBI, London May 1950 / 299 \\
                 Prison, Wormwood Scrubs, June 1950 / 313 \\
                 VI: Return / 329 \\
                 East Germany, Berlin 1959 / 331 \\
                 Expectations, Dresden 1960 / 341 \\
                 Epilogue: Remembrances, Berlin March 1989 / 351 \\
                 Acknowledgments / 355 \\
                 Abbreviations / 359 \\
                 Notes / 363 \\
                 Bibliography / 387 \\
                 Index / 391",
}

@Book{Hahn:1967:OHS,
  author =       "Otto Hahn",
  booktitle =    "{Otto Hahn}: a scientific autobiography",
  title =        "{Otto Hahn}: a scientific autobiography",
  publisher =    "MacGibbon and Kee",
  address =      "London, UK",
  pages =        "xxiv + 296 + 16",
  year =         "1967",
  LCCN =         "QD22.H2 1967",
  bibdate =      "Wed Jun 03 07:39:26 2015",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/r/rutherford-ernest.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.bibsys.no:2100/BIBSYS",
  note =         "Translated and edited by Willy Ley. With an
                 introduction by Glenn T. Seaborg.",
  acknowledgement = ack-nhfb,
  author-dates = "1879--1968",
  remark =       "English translation of \cite{Hahn:1962:RUW}.
                 Co-published by Charles Scribner's Sons, New York
                 (1966).",
  subject =      "Hahn, Otto",
  subject-dates = "1879--1968",
  tableofcontents = "Illustrations / vi \\
                 Tables / viii \\
                 Introduction by Glenn T. Seaborg / ix \\
                 One: Youth and Student Years --- 1879 to 1904 / 2 \\
                 Two: In London with Sir William Ramsay --- Fall 1904 to
                 Summer 1905 / 12 \\
                 Three: In Montreal with Ernest Rutherford --- Fall 1905
                 to Summer 1906 / 24 \\
                 Four: Berlin: the Chemical Institute of the University
                 --- 1906 to 1912 / 37 \\
                 Five: Scientific Commissions / 73 \\
                 Six: At the Kaiser Wilhelm Institute for Chemistry ---
                 1913 to 1933: Work with Naturally Radioactive Elements
                 and Isotopes / 81 \\
                 Seven: At the Kaiser Wilhelm Institute for Chemistry
                 --- 1933 to 1945: Work with Artificially Radioactive
                 Isotopes / 137 \\
                 Eight: Epilogue / 181 \\
                 Publisher's Postscript / 183 \\
                 Appendixes / 185 \\
                 Appendix I / 187 \\
                 Appendix II / 207 \\
                 Appendix III / 251 \\
                 Biographical Notes / 266 \\
                 Synoptic Calendar / 280 \\
                 Bibliography / 286 Index / 293",
}

@Book{Hargittai:2010:JET,
  author =       "Istv{\'a}n Hargittai",
  booktitle =    "Judging {Edward Teller}: a closer look at one of the
                 most influential scientists of the {Twentieth
                 Century}",
  title =        "Judging {Edward Teller}: a closer look at one of the
                 most influential scientists of the {Twentieth
                 Century}",
  publisher =    pub-PROMETHEUS-BOOKS,
  address =      pub-PROMETHEUS-BOOKS:adr,
  pages =        "575",
  year =         "2010",
  ISBN =         "1-61614-221-9 (hardcover)",
  ISBN-13 =      "978-1-61614-221-6 (hardcover)",
  LCCN =         "QC16.T37 H37 2010",
  bibdate =      "Thu Oct 6 06:57:45 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/bethe-hans.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/m/metropolis-nicholas.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/o/oppenheimer-j-robert.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/s/szilard-leo.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/t/teller-edward.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/u/ulam-stanislaw-m.bib;
                 https://www.math.utah.edu/pub/tex/bib/biometrika1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/bullatsci.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  note =         "Afterword by Richard Garwin.",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "Teller in Hungary: origins and background \\
                 Germany: road to science \\
                 Transitions \\
                 Atomic bomb quest \\
                 No calm before the storm \\
                 Fathering the hydrogen bomb \\
                 From worrier to warrior \\
                 Double tragedy: Teller and Oppenheimer \\
                 Fallout and test ban \\
                 ``A monomaniac with many manias'' \\
                 Warring the stars \\
                 Final thoughts",
  subject =      "Teller, Edward; Physicists; United States; Biography;
                 Scientists; Hungarian Americans; Atomic bomb; History",
  subject-dates = "1908--2003",
  tableofcontents = "Foreword by Peter Lax / 15 \\
                 Preface / 19 \\
                 I: Teller in Hungary: Origins and Background / 27 \\
                 Broader Background / 29 \\
                 Origins / 37 \\
                 Childhood / 41 \\
                 Gimn{\'a}zium Experience / 43 \\
                 Higher Learning Begins / 49 \\
                 Family Fate / 54 \\
                 2: Germany: Road to Science / 61 \\
                 Why Germany? / 61 \\
                 Karlsruhe and Munich / 66 \\
                 Leipzig and G{\"o}ttingen / 69 \\
                 Teller and Germany / 81 \\
                 3: Transitions / 91 \\
                 Copenhagen and London / 92 \\
                 New World / 102 \\
                 ``Molecule Inspector'' / 104 \\
                 Enter Nuclear Physics / 116 \\
                 4: Atomic Bomb Quest / 123 \\
                 Idyll Ending / 124 \\
                 War-Footing / 136 \\
                 Roots of Anticommunism / 146 \\
                 Bomb Dilemmas / 152 \\
                 5: No Calm Before the Storm / 165 \\
                 Chicago / 168 \\
                 Lasting Friendship / 173 \\
                 Mici / 177 \\
                 Entering Politics / 178 \\
                 Reactor Safety / 186 \\
                 The Big Debate / 189 \\
                 6: Fathering the Hydrogen Bomb / 205 \\
                 Hydrogen Bomb Quest / 207 \\
                 Can We Know the Past? / 225 \\
                 7: From Worrier to Warrior / 243 \\
                 Road to Livermore / 244 \\
                 Lengthened Shadows / 254 \\
                 Teller Tech / 273 \\
                 8: Double Tragedy: Teller and Oppenheimer / 277 \\
                 Parallel Lives / 278 \\
                 The Case and the Hearing / 294 \\
                 Aftermath / 304 \\
                 ``Dangerous Mole'' / 311 \\
                 9: Fallout and Test Ban / 317 \\
                 Against the Test Ban / 319 \\
                 Teller versus Pauling / 323 \\
                 Continued Opposition / 329 \\
                 Teller-Szilard Debates / 337 \\
                 ``Reluctant Revolutionary'' / 342 \\
                 Against Other Treaties / 345 \\
                 Nuclear Winter / 348 \\
                 10: ``A Monomaniac With Many Manias'' / 353 \\
                 Coding Excursion / 354 \\
                 Taste of Bidding / 356 \\
                 TRIGA / 359 \\
                 Politics Unlimited / 360 \\
                 ``And They Shall Beat Their Plowshare into Chariot'' /
                 368 \\
                 Secrecy / 378 \\
                 Three Mile Island / 385 \\
                 11: Warring the Stars / 389 \\
                 Great Alliance / 390 \\
                 SDI / 392 \\
                 Vision and Dedication / 397 \\
                 Excalibur / 403 \\
                 World Politics / 413 \\
                 Brilliant Pebbles / 417 \\
                 Summits / 418 \\
                 12: Final Thoughts / 425 \\
                 Homecoming / 427 \\
                 Being Jewish / 431 \\
                 Russian Connection / 433 \\
                 Assessment / 436 \\
                 Labels / 442 \\
                 Advising / 446 \\
                 Two Tellers (At Least) / 449 \\
                 Legacy / 453 \\
                 Afterword by Richard Garwin / 457 \\
                 Timeline: Selected Events in Edward Teller's Life / 461
                 \\
                 Acknowledgments / 465 \\
                 Biographical Names / 469 \\
                 Notes / 489 \\
                 Index / 549",
}

@Book{Hennessy:2012:CAQ,
  author =       "John L. Hennessy and David A. Patterson",
  booktitle =    "Computer Architecture: a Quantitative Approach",
  title =        "Computer Architecture: a Quantitative Approach",
  publisher =    pub-MORGAN-KAUFMANN-ELSEVIER,
  address =      pub-MORGAN-KAUFMANN-ELSEVIER:adr,
  edition =      "Fifth",
  pages =        "xxvii + 493 + 325",
  year =         "2012",
  ISBN =         "0-12-383872-X (paperback)",
  ISBN-13 =      "978-0-12-383872-8 (paperback)",
  LCCN =         "QA76.9.A73 P377 2012",
  bibdate =      "Wed Feb 15 07:46:38 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  note =         "With contributions by Krste Asanovi{\'c}, Jason D.
                 Kabos, Robert P. Colwell, Thomas M. Conte, Jos{\'e}
                 Duato, Diana Franklin, David Goldberg, Norman P.
                 Jouppi, Sheng Li, Naveen Muralimanohar, Gregory D.
                 Peterson, Timothy M. Pinkston, Parthasarathy
                 Ranganthan, David A. Wood, and Amr Zaky.",
  URL =          "http://booksite.mkp.com/9780123838728",
  acknowledgement = ack-nhfb,
  subject =      "Computer architecture",
  tableofcontents = "1: Fundamentals of Quantitative Design and Analysis
                 \\
                 2: Memory Hierarchy Design \\
                 3: Instruction-Level Parallelism and Its Exploitation
                 \\
                 4: Data-Level Parallelism in Vector, SIMD, and GPU
                 Architectures \\
                 5: Thread-Level Parallelism \\
                 6: Warehouse-Scale Computers to Exploit Request-Level
                 and Data-Level Parallelism \\
                 A: Instruction Set Principles \\
                 B: Review of Memory Hierarchy \\
                 C: Pipelining: Basic and Intermediate Concepts \\
                 D: Storage Systems \\
                 E: Embedded Systems \\
                 F: Interconnection Networks \\
                 G: Vector Processors in More Depth \\
                 H: Hardware and Software for VLIW and EPIC \\
                 I: Large-Scale Multiprocessors and Scientific
                 Applications \\
                 J: Computer Arithmetic \\
                 K: Survey of Instruction Set Architectures \\
                 L: Historical Perspective and References \\
                 References \\
                 Index",
}

@Book{Hey:1999:FCE,
  editor =       "Anthony J. G. Hey",
  booktitle =    "{Feynman} and Computation: Exploring the Limits of
                 Computers",
  title =        "{Feynman} and Computation: Exploring the Limits of
                 Computers",
  publisher =    pub-PERSEUS,
  address =      pub-PERSEUS:adr,
  pages =        "xxiii + 438",
  year =         "1999",
  ISBN =         "0-7382-0057-3",
  ISBN-13 =      "978-0-7382-0057-6",
  LCCN =         "QA76 .F46 1999, QC52 .F49 199",
  bibdate =      "Thu Apr 12 11:10:30 2001",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/f/feynman-richard-p.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/physperspect.bib",
  price =        "US\$50.00",
  abstract =     "Richard P. Feynman made profoundly important and
                 prescient contributions to the physics of computing,
                 notably with his seminal articles ``\booktitle{There's
                 Plenty of Room at the Bottom}'' and
                 ``\booktitle{Simulating Physics with Computers}''.
                 These two provocative papers (both reprinted in this
                 volume) anticipated, decades before their time, several
                 breakthroughs that have since become fields of science
                 in their own right, such as nanotechnology and the
                 newest, perhaps most exciting area of physics and
                 computer science, quantum computing. Both a tribute to
                 Feynman and a new exploration of the limits of
                 computers by some of today's most influential
                 scientists, \booktitle{Feynman and Computation}
                 continues the pioneering work started by Feynman and
                 published by him in his own \booktitle{Lectures on
                 Computation}. This new computation volume consists of
                 both original chapters and reprints of classic papers
                 by leaders in the field. \booktitle{Feynman and
                 Computation} will generate great interest from the
                 scientific community and provide essential background
                 for further work in this field.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Feynman and computation / John J. Hopfield \\
                 Neural networks and physical systems with emergent
                 collective computational abilities / John J. Hopfield
                 \\
                 Feynman as a colleague / Carver A. Mead \\
                 Collective electrodynamics I / Carver A. Mead \\
                 Memory / Gerald Jay Sussman \\
                 Numerical evidence that the motion of Pluto is chaotic
                 / Gerald Jay Sussman and Jack Wisdom \\
                 There's plenty of room at the bottom / Richard P.
                 Feynman \\
                 Information is inevitably physical / Rolf Landauer \\
                 Scaling of MOS technology to submicrometer feature
                 sizes / Carver A. Mead \\
                 Richard Feynman and cellular vacuum / Marvin Minsky \\
                 Simulating physics with computers / Richard P. Feynman
                 \\
                 Quantum robots / Paul Benioff \\
                 Quantum information theory / Charles H. Bennett \\
                 Quantum computation / Richard J. Hughes \\
                 Computing machines in the future / Richard P. Feynman
                 \\
                 Internetics: technologies, applications and academic
                 fields / Geoffrey C. Fox \\
                 Richard Feynman and the Connection Machine / W. Daniel
                 Hillis \\
                 Crystalline computation / Norman H. Margolus \\
                 Information, physics, quantum: the search for links /
                 John Archibald Wheeler \\
                 Feynman, Barton and the reversible Schr{\"o}dinger
                 difference equation / Ed Fredkin \\
                 Action, or the fungibility of computation / Tommaso
                 Toffoli \\
                 Algorithmic randomness, physical entropy, measurements,
                 and the demon of choice / Wojciech Zurek",
}

@Book{Janssen:2014:CCE,
  editor =       "Michel Janssen and Christopher Lehner",
  booktitle =    "The {Cambridge} Companion to {Einstein}",
  title =        "The {Cambridge} Companion to {Einstein}",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xvi + 562",
  year =         "2014",
  DOI =          "https://doi.org/10.1017/CCO9781139024525",
  ISBN =         "0-521-82834-1 (hardcover), 0-521-53542-5 (paperback)",
  ISBN-13 =      "978-0-521-82834-5 (hardcover), 978-0-521-53542-7
                 (paperback)",
  LCCN =         "QC16.E5 C36 2014",
  bibdate =      "Sat Sep 20 15:12:23 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/annscience.bib;
                 https://www.math.utah.edu/pub/tex/bib/bjhs2010.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/isis2010.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "The first systematic presentation of the work of
                 Albert Einstein, comprised of fourteen essays by
                 leading historians and philosophers of science that
                 introduce readers to his work.",
  acknowledgement = ack-nhfb,
  remark-1 =     "From page 121: ``Comparison of the new law [of
                 blackbody radiation] with the latest Berlin
                 measurements permitted a numerical determination of the
                 two constants $h$ and $k$. Planck emphasized that the
                 resulting value of Avogadro's number $ N = R /k $,
                 where $ R $ is the constant of perfect gases, was the
                 most accurate to date.''",
  remark-2 =     "From page 136: ``Anyone who could follow Einstein's
                 not-so-simple argument was compelled to admit one of
                 three uncomfortable possibilities: the existence of
                 light quanta, the nonexistence of discrete quantum
                 states, or the violation of energy conservation for
                 elementary radiation processes. Among the contemporary
                 leaders of quantum theory, Einstein opted for the first
                 possibility, Planck for the second, and Bohr for the
                 third. Sommerfeld was agnostic.''",
  remark-3 =     "From page 154: ``Millikan [declared that] `After ten
                 years of testing and changing and learning and
                 sometimes blundering \ldots{} this work resulted,
                 contrary to my own expectation, in the first direct
                 experimental proof in 1914 of the exact validity
                 \ldots{} of the Einstein equation [for the
                 photoelectric effect], and the first direct
                 photoelectric determination of Planck's $h$.'''",
  remark-4 =     "Pages 161--165 discuss the background of the famous
                 Bohr--Kramers--Slater (BKS) paper, and the serious
                 disagreement between the authors. It also notes that
                 Slater took no part in the writing of the paper, and
                 for the rest of his life remained hostile to Bohr and
                 Kramers. Bohr did not yet accept the concept of light
                 quanta, and was willing to give up conservation of
                 energy; experiments soon proved him wrong, and
                 confirmed Einstein's interpretation of the
                 photoelectric effect. Einstein is quoted in a letter of
                 29 April 1924 to Hedi Born (Max Born's wife): ``[if] an
                 electron ejected by a light ray can choose of {\em its
                 own free will\/} the moment and direction in which it
                 will fly off, [then I] would rather be a shoemaker or
                 even an employee in a gambling casino than a
                 physicist.''",
  subject =      "Einstein, Albert; Physicists; Biography; Physics;
                 History; 20th century",
  subject-dates = "1879--1955",
  tableofcontents = "Contributors / / xi \\
                 Prefix / / xv \\
                 Introduction / Michel Janssen and Christoph Lehner /
                 1--37 \\
                 Einstein's Copernican Revolution / J{\"u}rgen Renn and
                 Robert Rynasiewicz / 38--71 \\
                 Einstein's special theory of relativity and the
                 problems in the electrodynamics of moving bodies that
                 led him to it / John D. Norton / 72--102 \\
                 Einstein on statistical physics: fluctuations and
                 atomism / A. J. Kox / 103--116 \\
                 The quantum enigma / Olivier Darrigol / 117--142 \\
                 The experimental challenge of light quanta / Roger H.
                 Stuewer / 143--166 \\
                 ``No success like failure\ldots{}'': Einstein's quest
                 for general relativity, 1907--1920 / Michel Janssen /
                 167--227 \\
                 Einstein's role in the creation of Relativistic
                 Cosmology / Christopher Smeenk / 228--269 \\
                 Einstein, gravitational waves, and the theoretician's
                 regress / Daniel J. Kennefick / 270--280 \\
                 Einstein's unified field theory program / Tilman Sauer
                 / 281--305 \\
                 Einstein's realism and his critique of quantum
                 mechanics / Christoph Lehner / 306--353 \\
                 Einstein and the development of twentieth-century
                 philosophy of science / Don Howard / 354--376 \\
                 ``A believing rationalist'': Einstein and ``the truly
                 valuable'' in Kant / Thomas Ryckman / 377--397 \\
                 Space, time, and geometry / Michael Friedman / 398--420
                 \\
                 Einstein's politics / Robert Schulmann / 421--454 \\
                 Appendix: Special Relativity / Michel Janssen /
                 455--506 \\
                 Bibliography / / 507--550 \\
                 Index / 551--562",
}

@Book{Jensen:2000:CCN,
  author =       "Carsten Jensen",
  booktitle =    "Controversy and Consensus: Nuclear Beta Decay
                 1911--1934",
  title =        "Controversy and Consensus: Nuclear Beta Decay
                 1911--1934",
  volume =       "24",
  publisher =    pub-BIRKHAUSER,
  address =      pub-BIRKHAUSER:adr,
  pages =        "xv + 217",
  year =         "2000",
  DOI =          "https://doi.org/10.1007/978-3-0348-8444-0",
  ISBN =         "3-0348-9569-0 (paperback), 3-7643-5313-9 (hardcover),
                 3-0348-8444-3 (e-book)",
  ISBN-13 =      "978-3-0348-9569-9 (paperback), 978-3-7643-5313-1
                 (hardcover), 978-3-0348-8444-0 (e-book)",
  LCCN =         "QC793.5.B425 J46 2000",
  bibdate =      "Fri Oct 31 18:37:55 MDT 2014",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/b/bohr-niels.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/f/fermi-enrico.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/p/pauli-wolfgang.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/r/rutherford-ernest.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/shps-b.bib;
                 z3950.loc.gov:7090/Voyager",
  note =         "Carsten Jensen died of cancer a few months after
                 presenting his doctoral dissertation in 1990 at the
                 University of Copenhagen. Finn Aaserud, Helge Kragh,
                 Erik R{\"u}dinger, and Roger H. Stuewer produced this
                 book as a slightly edited version of that work,
                 supplying additional figures, but leaving the prose
                 largely untouched.",
  series =       "Science networks historical studies",
  URL =          "http://www.springerlink.com/content/978-3-0348-8444-0",
  abstract =     "The book describes in detail the considerable efforts
                 by theoretical and experimental physicists to
                 understand the beta spectra of atomic nuclei. After a
                 brief prehistory, the main narrative spans the period
                 from 1911, when Rutherford and collaborators in
                 Manchester established that the atom had an extremely
                 massive nucleus, until 1934, when the question of beta
                 decay was settled theoretically by Fermi and others. It
                 includes prominently the intense controversy over
                 several years between Lise Meitner from Germany and C.
                 D. Ellis from England about the origin of beta rays.",
  acknowledgement = ack-nhfb,
  author-dates = "1948--1990",
  keywords =     "Adolf Smekal; Charles Ellis; Enrico Fermi; Ernest
                 Rutherford; James Chadwick; Lise Meitner; Niels Bohr;
                 William Wooster; Wolfgang Pauli",
  subject =      "Beta decay; History; Controverse scientifique;
                 D{\'e}sint{\'e}gration b{\'e}ta; Histoire; Beta decay;
                 Rayons b{\'e}ta; Histoire; Betazerfall; Geschichte
                 1911--1934",
  tableofcontents = "In Carsten Jensen's Memory / Erik R{\"u}dinger / vi
                 \\
                 Editors' Acknowledgments / vii \\
                 Editors' Preface / ix \\
                 Author's Preface / xi--xii \\
                 The Main Decay Chains / xvii \\
                 1 Prelude: Beta-Spectrum Research in the Pre-Nuclear
                 Years, 1900--1911 \\
                 1.1 Discovery and identification of the beta particle /
                 / 1 \\
                 1.2 The first experiments on the velocity distribution
                 of beta particles / 3 \\
                 1.3 Absorption measurements question the inhomogeneity
                 of the beta particles / 7 \\
                 1.4 The Hahn--Meitner vs. Wilson controversy / 18 \\
                 1.5 From unity to complexity: magnetic-deflection
                 experiments, 1910--1911 / 23 \\
                 \\
                 2 The Origin of Beta Rays, and the Growing Complexity
                 of Their Spectrum: The Rutherford Era, 1911--1919 \\
                 2.1 Introduction / 29 \\
                 2.2 Rutherford's 1912 theory, and reactions to it / 31
                 \\
                 2.3 The beta particle as a nuclear constituent / 34 \\
                 2.4 An extreme complexity of beta line-spectra is
                 brought to light: deflection experiments in the years
                 1911--1913 / 37 \\
                 2.5 Continuity as well as lines: The composite beta
                 spectrum / 41 \\
                 2.6 Rutherford's 1914 theory / 45 \\
                 2.7 The Bohr--Sommerfeld quantum conditions and the
                 beta line-spectrum / 47 \\
                 2.8 Rutherford and the gamma rays / 50 \\
                 \\
                 3 The Rise of a Controversy: Ellis, Meitner and Smekal
                 Advance Different Beta-Spectrum Theories, 1920--1922
                 \\
                 3.1 Introduction / 55 \\
                 3.2 Internal conversion, nuclear levels, and Ellis's
                 interpretation of the beta line-spectrum / 56 \\
                 3.3 Analogy between alpha and beta emission, and
                 Meitner's interpretation of the beta line-spectrum / /
                 64 \\
                 3.4 Ellis's response to Meitner's hypothesis, and his
                 interpretation of the continuous beta spectrum / 68 \\
                 3.5 Meitner replies to Ellis, and reveals her view on
                 the continuous beta spectrum / 74 \\
                 3.6 The atom as a unity: Smekal joins the discussion,
                 and is met with a sharp reaction / 79 \\
                 3.7 Two repetitions of the Chadwick experiment lead to
                 contradictory conclusions / 88 \\
                 \\
                 4 Secondary Effects and Order of Emission: Two Main
                 Questions in the Controversy, 1923--1925 \\
                 4.1 Introduction / 95 \\
                 4.2 Meitner investigates the beta spectrum of UX 1 and
                 takes it as further support for her view / 95 \\
                 4.3 Radiationless transitions: Rosseland suggests an
                 explanation of the emission of primary, and some
                 secondary, beta particles / 99 \\
                 4.4 The nuclear field and the Compton effect: Two
                 possible reasons for the continuous beta spectrum / /
                 102 \\
                 4.5 Ellis and Skinner reinvestigate the beta
                 line-spectra of RaB and C, and serious problems arise /
                 / 105 \\
                 4.6 Beta first, gamma second, or is it the other way
                 around? / 110 \\
                 \\
                 5 The End of the Beginning: The Controversy Enters the
                 Decisive Phase, 1925--1929 \\
                 5.1 Introduction / 121 \\
                 5.2 Ellis adjusts his view on the emission process, but
                 maintains his interpretation of the continuous spectrum
                 / 122 \\
                 5.3 The number of emitted beta particles / 123 \\
                 5.4 Ellis and Wooster's tour de force: A determination
                 of the heating effect of RaE / 128 \\
                 5.5 Continental reactions to Ellis and Wooster's
                 experiment / 137 \\
                 5.6 Some concluding remarks about the controversy / 143
                 \\
                 \\
                 6 From Anomaly to Explanation: The Continuous Beta
                 Spectrum, 1929--1934 \\
                 6.1 Introduction / 145 \\
                 6.2 Non-conservation of energy or a new particle? The
                 first phase of the Bohr--Pauli dispute, 1929--1932 / /
                 146 \\
                 6.3 Other attempts at explaining the anomalous
                 continuity / 157 \\
                 6.4 The question of upper limits in beta spectra, and
                 the thorium C branching problem / 163 \\
                 6.5 The impact of the miraculous year: The second phase
                 of the Bohr--Pauli dispute, 1932--1933 / 170 \\
                 6.6 The two theories of beta decay / 177 \\
                 \\
                 7 Towards a Theory of Internal Conversion: The Beta
                 Line-Spectrum, 1927--1934 \\
                 7.1 Introduction / 185 \\
                 7.2 Experimental evidence brings about a new view on
                 the origin of gamma rays / 186 \\
                 7.3 The radiation hypothesis proves insufficient to
                 explain internal conversion of gamma rays / 194 \\
                 7.4 A theory of internal conversion is developed / 199
                 \\
                 Summary and Conclusion / 207 \\
                 Name Index / 213",
}

@Book{Kernighan:1999:PP,
  author =       "Brian W. Kernighan and Rob Pike",
  booktitle =    "The Practice of Programming",
  title =        "The Practice of Programming",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xii + 267",
  year =         "1999",
  ISBN =         "0-201-61586-X",
  ISBN-13 =      "978-0-201-61586-9",
  LCCN =         "QA76.6 .K48 1999",
  bibdate =      "Fri Jan 21 06:58:06 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/css.bib;
                 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/mathcw.bib;
                 https://www.math.utah.edu/pub/tex/bib/plan9.bib;
                 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
  price =        "US\$24.95, CAN\$37.50",
  URL =          "http://cm.bell-labs.com/cm/cs/tpop/code.html;
                 http://cseng.aw.com/bookdetail.qry?ISBN=0-201-61586-X&ptype=0;
                 http://tpop.awl.com",
  acknowledgement = ack-nhfb,
  remark =       "Section 9.2 discusses regular expressions.",
  shorttableofcontents = "Preface \\
                 1: Style / 1 \\
                 2: Algorithms and Data Structures / 29 \\
                 3: Design and Implementation / 61 \\
                 4: Interfaces / 85 \\
                 5: Debugging / 117 \\
                 6: Testing / 139 \\
                 7: Performance / 165 \\
                 8: Portability / 189 \\
                 9: Notation / 215 \\
                 Epilogue / 247 \\
                 Appendix: Collected Rules / 249 \\
                 Index / 253",
  tableofcontents = "Preface / ix \\
                 1: Style / 1 \\
                 1.1 Names / 3 \\
                 1.2 Expressions and Statements / 6 \\
                 1.3 Consistency and Idioms / 10 \\
                 1.4 Function Macros / 17 \\
                 1.5 Magic Numbers / 19 \\
                 1.6 Comments / 23 \\
                 1.7 Why Bother? / 27 \\
                 2: Algorithms and Data Structures / 29 \\
                 2.1 Searching / 30 \\
                 2.2 Sorting / 32 \\
                 2.3 Libraries / 34 \\
                 2.4 A Java Quicksort / 37 \\
                 2.5 O-Notation / 40 \\
                 2.6 Growing Arrays / 41 \\
                 2.7 Lists / 44 \\
                 2.8 Trees / 50 \\
                 2.9 Hash Tables / 55 \\
                 2.10 Summary / 58 \\
                 3: Design and Implementation / 61 \\
                 3.1 The Markov Chain Algorithm / 62 \\
                 3.2 Data Structure Alternatives / 64 \\
                 3.3 Building the Data Structure in C / 65 \\
                 3.4 Generating Output / 69 \\
                 3.5 Java / 71 \\
                 3.6 C++ / 76 \\
                 3.7 Awk and Perl / 78 \\
                 3.8 Performance / 80 \\
                 3.9 Lessons / 82 \\
                 4: Interfaces / 85 \\
                 4.1 Comma-Separated Values / 86 \\
                 4.2 A Prototype Library / 87 \\
                 4.3 A Library for Others / 91 \\
                 4.4 A C++ Implementation / 99 \\
                 4.5 Interface Principles / 103 \\
                 4.6 Resource Management / 106 \\
                 4.7 Abort, Retry. Fail? / 109 \\
                 4.8 User Interfaces / 113 \\
                 5: Debugging / 117 \\
                 5.1 Debuggers / 118 \\
                 5.2 Good Clues, Easy Bugs / 119 \\
                 5.3 No Clues, Hard Bugs / 123 \\
                 5.4 Last Resorts / 127 \\
                 5.5 Non-reproducible Bugs / 130 \\
                 5.6 Debugging Tools / 131 \\
                 5.7 Other People's Bugs / 135 \\
                 5.8 Summary / 136 \\
                 6: Testing / 139 \\
                 6.1 Test as You Write the Code / 140 \\
                 6.2 Systematic Testing / 145 \\
                 6.3 Test Automation / 149 \\
                 6.4 Test Scaffolds / 151 \\
                 6.5 Stress Tests / 155 \\
                 6.6 Tips for Testing / 158 \\
                 6.7 Who Does the Testing? / 159 \\
                 6.8 Testing the Markov Program / 160 \\
                 6.9 Summary / 162 \\
                 7: Performance / 165 \\
                 7.1 A Bottleneck / 166 \\
                 7.2 Timing and Profiling / 171 \\
                 7.3 Strategies for Speed / 175 \\
                 7.4 Tuning the Code / 178 \\
                 7.5 Space Efficiency / 182 \\
                 7.6 Estimation / 184 \\
                 7.7 Summary / 187 \\
                 8: Portability / 189 \\
                 8.1 Language / 190 \\
                 8.2 Headers and Libraries / 196 \\
                 8.3 Program Organization / 198 \\
                 8.4 Isolation / 202 \\
                 8.5 Data Exchange / 203 \\
                 8.6 Byte Order / 204 \\
                 8.7 Portability and Upgrade / 207 \\
                 8.8 Internationalization / 209 \\
                 8.9 Summary / 212 \\
                 9: Notation / 215 \\
                 9.1 Formatting Data / 216 \\
                 9.2 Regular Expressions / 222 \\
                 9.3 Programmable Tools / 228 \\
                 9.4 Interpreters, Compilers, and Virtual Machines / 231
                 \\
                 9.5 Programs that Write Programs / 237 \\
                 9.6 Using Macros to Generate Code / 240 \\
                 9.7 Compiling on the Fly / 241 \\
                 Epilogue / 247 \\
                 Appendix: Collected Rules / 249 \\
                 Index / 253",
}

@Book{Knuth:1996:SPC,
  author =       "Donald E. Knuth",
  booktitle =    "Selected Papers on Computer Science",
  title =        "Selected Papers on Computer Science",
  volume =       "59",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xii + 274",
  year =         "1996",
  ISBN =         "1-881526-91-7 (paperback), 1-881526-92-5 (hardcover)",
  ISBN-13 =      "978-1-881526-91-9 (paperback), 978-1-881526-92-6
                 (hardcover)",
  LCCN =         "QA76.K537 1996",
  bibdate =      "Thu Aug 07 13:46:40 1997",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Dedicated ``to George Forsythe, whose inspiring
                 leadership shaped the field.''",
  series =       "CSLI lecture notes",
  acknowledgement = ack-nhfb,
  keywords =     "Computer science.",
  tableofcontents = "1. Von Neumann's first computer program \\
                 2. Ancient Babylonian algorithms \\
                 3. George Forsythe and the development of Computer
                 Science \\
                 4. Computer Science and its Relation to Mathematics \\
                 5. Algorithms \\
                 6. Mathematics and Computer Science: Coping with
                 Finiteness \\
                 7. Algorithms in modern mathematics and computer
                 science \\
                 8. The IBM 650: An appreciation from the field \\
                 9. Theory and Practice \\
                 10. Algorithm and program \\
                 information and data \\
                 11. Are toy problems useful? \\
                 12. Theory and practice \\
                 13. Algorithmic themes \\
                 14. Typesetting Concrete Mathematics \\
                 15. Computer programming and computer science \\
                 16. This Week's Citation Classic: Artistic
                 Programming",
}

@Book{Kochan:1989:UN,
  editor =       "Stephen G. Kochan and Patrick H. Wood",
  booktitle =    "{UNIX} Networking",
  title =        "{UNIX} Networking",
  publisher =    pub-HAYDEN,
  address =      pub-HAYDEN:adr,
  pages =        "viii + 400",
  year =         "1989",
  ISBN =         "0-672-48440-4",
  ISBN-13 =      "978-0-672-48440-7",
  LCCN =         "QA76.76.O63 U546 1989",
  bibdate =      "Wed Dec 15 10:37:44 1993",
  bibsource =    "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/unix.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Introduction \\
                 UUCP UNIX-to-UNIX copy / Brian Redman \\
                 TCP/IP / Douglas E. Comer and Thomas Narten \\
                 NFS and RPC / Louis A. Delzompo \\
                 Streams / Douglas Harris \\
                 TLI / Douglas Harris \\
                 Remote file system / Douglas Harris \\
                 OS/2 to UNIX LAN / Martin Dunsmuir \\
                 Networking and the X Window system / Adrian Nye \\
                 Networking NeWS / Owen Densmore",
}

@Book{Krause:2014:CHW,
  author =       "Michael Krause",
  booktitle =    "{CERN}: how we found the {Higgs} boson",
  title =        "{CERN}: how we found the {Higgs} boson",
  publisher =    pub-WORLD-SCI,
  address =      pub-WORLD-SCI:adr,
  pages =        "xiii + 243",
  year =         "2014",
  ISBN =         "981-4623-55-5 (hardcover), 981-4623-46-6 (paperback),
                 981-4623-48-2 (e-book)",
  ISBN-13 =      "978-981-4623-55-1 (hardcover), 978-981-4623-46-9
                 (paperback), 978-981-4623-48-3 (e-book)",
  LCCN =         "QC793 .K73 2014",
  bibdate =      "Thu Oct 30 06:58:24 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/bohr-niels.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/r/rutherford-ernest.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  author-dates = "1956--",
  subject =      "Higgs bosons",
  tableofcontents = "1: The history of CERN \\
                 2: The practitioner: Rolf-Dieter Heuer \\
                 The atomic theory of Democritus of Abdera \\
                 Democritus' atomic model \\
                 3: The beginning of modern physics: Galileo,
                 Copernicus, and Kepler \\
                 4: The experimentalist: Tejinder S. Virdee \\
                 The four fundamental forces (interactions) \\
                 Quotes by and about Newton \\
                 Isaac Newton \\
                 5: Dalton, Thomson, Rutherford, Bohr \\
                 The development of the atomic model \\
                 {Bohr}'s atomic model \\
                 6: The man who built the LHC: Lyn Evans \\
                 The Large Hadron Collider (LHC) \\
                 7: Physics, music, and art: Tara Shears \\
                 8: The theorist: John Ellis \\
                 The standard model \\
                 9: Oersted--Amp{\`e}re--Faraday--Maxwell \\
                 Hans Christian Oersted (1777--1851) \\
                 Andr{\'e}-Marie Amp{\`e}re (1775--1836) \\
                 Michael Faraday (1791--1867) \\
                 Electromagnetic induction-classical field theory \\
                 Electromagnetism: James Clerk Maxwell \\
                 10: The communicator: Rolf Landua \\
                 Edwin Powell Hubble (1889--1953) \\
                 11: Albert Einstein (1879--1955) \\
                 Einstein quotes \\
                 12: The Japanese way: Masaki Hori \\
                 Antimatter I \\
                 The Michelson--Morley experiment \\
                 Antimatter II \\
                 Einstein's cosmological constant \\
                 13: The Nobel Prize Laureate: Carlo Rubbia \\
                 The Rubbiatron \\
                 14: The American friend: Sebastian White \\
                 The Flammarion engraving \\
                 The Crab Nebula --- Type II supernovae \\
                 Type 1A Supernovae \\
                 15: Friendly competitors: Sebastian White and Albert De
                 Roeck \\
                 ATLAS and CMS --- a healthy competition \\
                 16: Rock `n' roll, beer, billiards, and music: Jonathan
                 Butterworth \\
                 Beauty is where you find it \\
                 17: The Higgs boson: and then? \\
                 List of CERN Directors-General \\
                 Bibliography \\
                 Glossary \\
                 Index",
}

@Book{Lieb:1966:MPO,
  editor =       "Elliott H. Lieb and Daniel C. Mattis",
  booktitle =    "Mathematical Physics in One Dimension: exactly soluble
                 models of interacting particles",
  title =        "Mathematical Physics in One Dimension: exactly soluble
                 models of interacting particles",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "xiv + 565",
  year =         "1966",
  LCCN =         "QC174.5 .L47",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/d/dyson-freeman-j.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Book{Longair:2016:MEL,
  author =       "Malcolm Longair",
  booktitle =    "{Maxwell}'s Enduring Legacy",
  title =        "{Maxwell}'s Enduring Legacy",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xxi + 664",
  year =         "2016",
  ISBN =         "1-107-08369-9",
  ISBN-13 =      "978-1-107-08369-1",
  LCCN =         "????",
  bibdate =      "Sun Jun 19 07:51:07 MDT 2016",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/c/clerk-maxwell-james.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/h/hartree-douglas-r.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/r/rutherford-ernest.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://www.cambridge.org/us/academic/subjects/physics/general-and-classical-physics/maxwells-enduring-legacy-scientific-history-cavendish-laboratory",
  acknowledgement = ack-nhfb,
  keywords =     "Douglas Rayner Hartree; Ernest Rutherford; Ernest
                 Walton; James Chadwick; James Clerk Maxwell; John
                 Cockcroft",
  shorttableofcontents = "Preface \\
                 Acknowledgements \\
                 Figure credits \\
                 Part I. To 1874 \\
                 1. Physics in the nineteenth century \\
                 2. Mathematics and physics in Cambridge in the
                 nineteenth century \\
                 Part II. 1874 to 1879 \\
                 3. The Maxwell era \\
                 Part III. 1879 to 1884 \\
                 4. Rayleigh's Quinquennium \\
                 Part IV. 1884 to 1919 \\
                 5. The challenges facing J. J. Thomson \\
                 6. The J. J. Thomson era, 1884--1900 --- the electron
                 \\
                 7. The Thomson era, 1900--19 --- atomic structure \\
                 Part V. 1919 to 1937 \\
                 8. Rutherford at McGill and Manchester Universities ---
                 new challenges in Cambridge \\
                 9. The Rutherford era --- the radioactivists1 \\
                 10. Rutherford era --- the seeds of the new physics \\
                 Part VI. 1938 to 1953 \\
                 11. Bragg and the war years \\
                 12. Bragg and the post-war years \\
                 Part VII. 1953 to 1971 \\
                 13. The Mott era --- an epoch of expansion \\
                 14. The Mott era --- radio astronomy and high energy
                 physics \\
                 15. The Mott era --- the growth of condensed matter
                 physics \\
                 Part VIII. 1971 to 1982 \\
                 16. The Pippard era --- a new laboratory and a new
                 vision \\
                 17. The Pippard era --- radio astronomy, high energy
                 physics and laboratory astrophysics \\
                 18. The Pippard era --- condensed matter physics \\
                 Part IX. 1984 to 1995 \\
                 19. The Edwards era --- a new epoch of expansion \\
                 20. The Edwards era --- new directions in condensed
                 matter physics \\
                 21. The Edwards era --- high energy physics and radio
                 astronomy \\
                 Part X. 1995 to present \\
                 22. Towards the new millennium and beyond \\
                 23. The evolution of the New Museums site \\
                 Notes \\
                 Bibliography \\
                 Author index \\
                 Index",
  subject-dates = "James Clerk Maxwell (1831--1879)",
  tableofcontents = "Preface page / xiii \\
                 Acknowledgements / xv \\
                 Figure credits / xvii \\
                 Part I To / 1874 \\
                 1 Physics in the nineteenth century / 3 \\
                 1.1 Discoveries in physics, 1687 to 1874 / 3 \\
                 1.2 Precise measurement and the determination of time /
                 5 \\
                 1.3 Fraunhofer, Kirchhoff and the development of
                 optical spectroscopy / 6 \\
                 1.4 Electricity and magnetism / 10 \\
                 1.5 The laws of thermodynamics / 24 \\
                 1.6 Atoms and molecules / 31 \\
                 1.7 Reflections / 34 \\
                 2 Mathematics and physics in Cambridge in the
                 nineteenth century / 35 \\
                 2.1 Pure and mixed mathematics at Cambridge / 35 \\
                 2.2 Attempts to reform mathematics teaching in
                 Cambridge / 37 \\
                 2.3 The Royal Commission report of 1852 and its
                 aftermath / 39 \\
                 2.4 William Cavendish and the founding of the
                 Laboratory / 42 \\
                 Part II 1874 to 1879 \\
                 3 The Maxwell era / 49 \\
                 3.1 The appointment of James Clerk Maxwell / 49 \\
                 3.2 The rise of experimental physics in Great Britain
                 in the latter half of the nineteenth century / 50 \\
                 3.3 The changing face of natural philosophy / 53 \\
                 3.4 Maxwell's manifesto: his inaugural lecture, 1871 /
                 54 \\
                 3.5 The building of the Cavendish Laboratory / 56 \\
                 3.6 Maxwell's Cavendish Laboratory: research / 60 \\
                 3.7 Undergraduate teaching / 71 \\
                 3.8 What had been achieved / 73 \\
                 Part III 1879 to 1884 \\
                 4 Rayleigh's quinquennium / 79 \\
                 4.1 Rayleigh's appointment / 79 \\
                 4.2 Teaching in Rayleigh's Cavendish: Glazebrook and
                 Shaw / 82 \\
                 4.3 Research in Rayleigh's Cavendish / 86 \\
                 4.4 Rayleigh's colleagues, graduate students and their
                 future employment / 92 \\
                 4.5 Rayleigh's legacy / 93 \\
                 Part IV 1884 to 1919 \\
                 5 The challenges facing J. J. Thomson / 97 \\
                 5.1 Thomson's election to the Cavendish Chair / 97 \\
                 5.2 Pure and applied physics in the 1880s / 98 \\
                 5.3 The developing research and teaching programme /
                 100 \\
                 5.4 Accommodation / 107 \\
                 6 The Thomson era, 1884--1900: the electron / 111 \\
                 6.1 Thomson's agenda / 111 \\
                 6.2 The conduction of electricity through gases / 118
                 \\
                 6.3 C. T. R. Wilson and the condensation of water
                 droplets / 122 \\
                 6.4 The revolutions of 1895 and 1896 / 124 \\
                 6.5 The discovery of the electron and its universality
                 / 127 \\
                 6.6 Physics in 1900 / 137 \\
                 7 The Thomson era, 1900--1919: atomic structure / 139
                 \\
                 7.1 The problems of building models of atoms / 139 \\
                 7.2 Thomson and the numbers of electrons in atoms / 141
                 \\
                 7.3 Richardson and the law of thermionic emission / 145
                 \\
                 7.4 Thomson, Aston and positive rays / 147 \\
                 7.5 Towards the old quantum theory / 150 \\
                 7.6 Wilson's cloud chamber / 156 \\
                 7.7 Bragg's law and the X-ray spectra of the chemical
                 elements / 159 \\
                 7.8 The war years / 166 \\
                 7.9 The end of an era / 166 \\
                 Part V 1919 to 1937 \\
                 8 Rutherford at McGill and Manchester universities: new
                 challenges in Cambridge / 171 \\
                 8.1 The changing frontiers of physics research / 171
                 \\
                 8.2 Rutherford at McGill and Manchester universities /
                 173 \\
                 8.3 The aftermath of war / 183 \\
                 8.4 The undergraduate teaching programme / 187 \\
                 8.5 Accommodation, finance and management / 190 \\
                 9 The Rutherford era: the radioactivists / 194 \\
                 9.1 Rutherford and nuclear transformations / 194 \\
                 9.2 Shimizu, Blackett and the cloud chamber / 199 \\
                 9.3 Blackett and Ochiallini: cosmic rays and the
                 discovery of the positron / 202 \\
                 9.4 Wynn-Williams, thyratrons and the scale-of-two
                 counter / 206 \\
                 9.5 Chadwick and the discovery of the neutron / 209 \\
                 9.6 Cockcroft, Gamow and Walton: splitting the atom /
                 213 \\
                 9.7 Ellis, Pauli, Fermi and -decay / 218 \\
                 9.8 The discovery of nuclear fission / 222 \\
                 9.9 The exodus of the radioactivists / 224 \\
                 10 The Rutherford era: the seeds of the new physics /
                 226 \\
                 10.1 Experimental and theoretical physics / 226 \\
                 10.2 Appleton and the physics of the ionosphere / 228
                 \\
                 10.3 Kapitsa and the Mond Laboratory / 233 \\
                 10.4 Superconductivity and superfluidity: Kapitsa,
                 Allen, Misener and Jones / 238 \\
                 10.5 Geoffrey Taylor: continuum and fluid mechanics /
                 243 \\
                 10.6 The end of an era / 249 \\
                 Part VI 1938 to 1953 \\
                 11 Bragg and the war years / 253 \\
                 11.1 Lawrence Bragg at Manchester and the National
                 Physical Laboratory / 253 \\
                 11.2 Changing directions: Bragg and the immediate
                 pre-war years / 255 \\
                 11.3 The war years / 260 \\
                 11.4 The Tube Alloys and Manhattan projects / 262 \\
                 11.5 G. I. Taylor and high-energy explosions / 264 \\
                 11.6 Radar / 266 \\
                 11.7 De Bruyne and glues for aircraft structures / 269
                 \\
                 11.8 Impact of the war years / 270 \\
                 12 Bragg and the post-war years / 272 \\
                 12.1 Restructuring the Laboratory: the immediate
                 post-war years / 272 \\
                 12.2 Teaching / 276 \\
                 12.3 Electronic computing: EDSAC and EDSAC 2 / 277 \\
                 12.4 Nuclear physics / 280 \\
                 12.5 Crystallography / 284 \\
                 12.6 The MRC Research Unit for the Study of the
                 Molecular Structure of Biological Systems / 286 \\
                 12.7 Ratcliffe, the Radio Group and the birth of radio
                 astronomy / 295 \\
                 12.8 Electron microscopy / 302 \\
                 12.9 Low-temperature physics / 308 \\
                 12.10 Other research activities / 313 \\
                 12.11 The Cavendish Collection of Historic Scientific
                 Instruments / 317 \\
                 12.12 The end of the Bragg era / 317 \\
                 Part VII 1953 to 1971 \\
                 13 The Mott era: an epoch of expansion / 321 \\
                 13.1 Mott's pre-Cavendish days / 321 \\
                 13.2 Strategic decisions in research / 322 \\
                 13.3 Mott and education / 328 \\
                 13.4 The evolving group structure of the Laboratory /
                 329 \\
                 13.5 Planning the move to West Cambridge / 329 \\
                 14 The Mott era: radio astronomy and high-energy
                 physics / 335 \\
                 14.1 The growth of the Radio Astronomy Group / 335 \\
                 14.2 The 3CR catalogue and the discovery of quasars /
                 341 \\
                 14.3 The development of earth rotation aperture
                 synthesis / 343 \\
                 14.4 Interplanetary scintillation (IPS) and the
                 discovery of pulsars / 349 \\
                 14.5 The cosmic microwave background radiation / 352
                 \\
                 14.6 High-energy physics / 353 \\
                 15 The Mott era: the growth of condensed matter physics
                 / 358 \\
                 15.1 Low-temperature physics / 358 \\
                 15.2 Electron microscopy / 371 \\
                 15.3 Crystallography / 378 \\
                 15.4 Physics and chemistry of solids / 381 \\
                 15.5 Solid state theory / 389 \\
                 15.6 The teaching of theoretical physics / 393 \\
                 15.7 Mott's legacy / 395 \\
                 Part VIII 1971 to 1982 \\
                 16 The Pippard era: a new Laboratory and a new vision /
                 399 \\
                 16.1 Pippard as Cavendish Professor / 399 \\
                 16.2 The new Cavendish Laboratory / 401 \\
                 16.3 Teaching / 406 \\
                 16.4 Implementing Pippard's vision for condensed matter
                 physics / 408 \\
                 17 The Pippard era: radio astronomy, high-energy
                 physics and laboratory astrophysics / 414 \\
                 17.1 The Mullard Radio Astronomy Observatory / 414 \\
                 17.2 Wind power / 420 \\
                 17.3 High-energy physics / 422 \\
                 17.4 The Energy Research Group / 430 \\
                 17.5 Laboratory astrophysics / 431 \\
                 18 The Pippard era: condensed matter physics / 436 \\
                 18.1 Physics and chemistry of solids / 436 \\
                 18.2 Pepper and the quantum Hall effect / 440 \\
                 18.3 The HREM, STEM and metal physics / 442 \\
                 18.4 Low-temperature physics / 445 \\
                 18.5 Theory of condensed matter / 450 \\
                 18.6 The Pippard era concluded / 454 \\
                 Part IX 1984 to 1995 \\
                 19 The Edwards era: a new epoch of expansion / 459 \\
                 19.1 Expansion of the Laboratory's programme / 459 \\
                 19.2 Teaching: the three/four-year physics course / 461
                 \\
                 20 The Edwards era: new directions in condensed matter
                 physics / 467 \\
                 20.1 Pepper and semiconductor physics / 467 \\
                 20.2 Microelectronics / 471 \\
                 20.3 Polymers and colloids / 474 \\
                 20.4 Optoelectronics / 477 \\
                 20.5 High-temperature superconductivity and the IRC /
                 482 \\
                 20.6 Low-temperature physics / 487 \\
                 20.7 Microstructural physics / 495 \\
                 20.8 Physics and chemistry of solids / 497 \\
                 20.9 Theory of condensed matter / 503 \\
                 21 The Edwards era: high-energy physics and radio
                 astronomy / 506 \\
                 21.1 High-energy physics: the LEP era / 506 \\
                 21.2 Radio astronomy: new initiatives / 510 \\
                 Part X 1995 to present \\
                 22 Towards the new millennium and beyond / 521 \\
                 22.1 The end of history? / 521 \\
                 22.2 Management, administration, responsibility and
                 accountability / 522 \\
                 22.3 The evolution of the staff profile / 524 \\
                 22.4 New areas of research / 528 \\
                 22.5 The Cavendish research programme in 2016 / 534 \\
                 22.6 The extreme universe / 535 \\
                 22.7 The biological universe / 537 \\
                 22.8 The quantum universe / 540 \\
                 22.9 The materials universe / 550 \\
                 22.10 The Cavendish III project / 556 \\
                 Appendix: The evolution of the New Museums site / 561
                 \\
                 Notes / 571 \\
                 References / 589 \\
                 Author index / 640 \\
                 Subject index / 651",
}

@Book{Lowdin:1964:MOC,
  editor =       "Per-Olov L{\"o}wdin and Bernard Pullman",
  booktitle =    "Molecular Orbitals in Chemistry, Physics, and Biology:
                 {A} Tribute to {R. S. Mulliken}",
  title =        "Molecular Orbitals in Chemistry, Physics, and Biology:
                 {A} Tribute to {R. S. Mulliken}",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "xiii + 578",
  year =         "1964",
  LCCN =         "QD461 .L872 1964",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "http://falcon.kvac.uu.se/swe/personal/PerOlovLowdinPub.html;
                 https://www.math.utah.edu/pub/bibnet/authors/l/lowdin-per-olov.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/s/slater-john-clarke.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 LOCATORplus database; University of California MELVYL
                 catalog",
  acknowledgement = ack-nhfb,
  keywords =     "molecular orbitals; Robert Sanderson Mulliken",
  tableofcontents = "Contributors / / v \\
                 Preface / / ix \\
                 R. S. Mulliken --- His Work and Influence on Quantum
                 Chemistry / C. A. Coulson / 1 \\
                 Robert Mulliken of Newburyport / John C. Slater / 17
                 \\
                 Recent Advances in the Quantum-Mechanical Calculation
                 of the Properties of Molecules / Robert G. Parr / 21
                 \\
                 Molecular Orbitals in the Exact SCF Theory / Per-Olov
                 L{\"o}wdin / 37 \\
                 Self-Consistent Field Methods for Open-Shell Molecules
                 / G. Berthier / 57 \\
                 The Self-Consistent Field Molecular Orbital Theory: An
                 Elementary Approach / Massimo Simonetta and Ermanno
                 Gianinetti / 83 \\
                 The Symmetry Groups of Nonrigid Molecules / H. C.
                 Longuet-Higgins / 113 \\
                 Group Theory and the Molecular Orbital Method / Josiane
                 Serre / 133 \\
                 Rydberg Orbitals and Energies for H$_2^*$ / F. A.
                 Matsen and J. C. Browne / 151 \\
                 The Molecular Orbital Interpretation of Bond-Length
                 Changes Following Excitation and Ionization of Diatomic
                 Molecules / A. C. Hurley / 161 \\
                 An Explanation of Walsh's Rules Using United-Atom
                 Molecular Orbitals / Werner A. Bingel / 191 \\
                 The Structure of Methylene and Methyl / Linus Pauling /
                 207 \\
                 Two Center Electron Interaction Energies / Klaus
                 Ruedenberg / 215 \\
                 The Nature of the Two-Electron Chemical Bond. VI.
                 Natural Orbital Analysis for HeH$^+$ / Basil G. Anex
                 and Harrison Shull / 227 \\
                 Electronic Structure and Absorption Spectra of the
                 Nitrate Ion / S. J. Strickler and M. Kasha / 241 \\
                 A Study of Cl- and HCl by a Factorization Technique of
                 Density Matrix in the SCF LCAO-MO Method / Eolo Scrocco
                 and Jacopo Tomasi / 263 \\
                 Energy Calculations for Polyatomic Carbon Molecules /
                 S. J. Strickler and Kenneth S. Pitzer / 281 \\
                 Rotational Structure of the Fundamental Band $\nu_6$ of
                 Methyl Cyanide / G. Amal and H. H. Nielsen / 293 \\
                 The Self-Consistent Generalization of H{\"u}ckel Theory
                 / R. McWeeny / 305 \\
                 The Resonance Formulation of Electronically Excited
                 $\pi$-Electron States / E. Heilbronner / 329 \\
                 A General Scheme for the Determination of Semiempirical
                 Parameters in the Molecular Orbital Theory of
                 Conjugated Systems / Inga Fischer-Hjalmars / 361 \\
                 Resonance Among Molecular Orbital Configurations /
                 William T. Simpson / 385 \\
                 Electron Correlation in $\pi$-Electron Systems / Alice
                 L. H. Chung, Michael J. S. Dewar, and Nora L. Sabelli /
                 395 \\
                 Self-Consistent Equations for Localized Orbitals in
                 Polyatomic Systems / T. L. Gilbert / 405 \\
                 $\pi$-Electron Conjugation in Some Polyphenyl Molecules
                 / Takashi Nakamura, Sook-il Kwun, and Henry Eyring /
                 421 \\
                 The Alternant Molecular Orbital Method and the
                 Correlation Problem / Ruben Pauncz / 433 \\
                 Molecular Orbital Calculations and the Aromaticity of
                 Some Nonbenzenoid Aromatic Hydrocarbons / Takeshi
                 Nakajima / 451 \\
                 On the Scaling Factor for MO Calculated Spectral
                 Intensities / G. J. Hoijtink / 471 \\
                 Application of the Molecular Orbitals to the Study of
                 the Base Strength / Odilon Chalvet, Raymond Daudel, and
                 Federico Peradejordi / 475 \\
                 Molecular Orbital Calculations and Electrophilic
                 Substitution / R. D. Brown / 485 \\
                 A Simple Quantum-Theoretical Interpretation of the
                 Chemical Reactivity of Organic Compounds / Kenichi
                 Fukui / 513 \\
                 A Formal Theory of Rydberg Series of Molecules / Masao
                 Kotani / 539 \\
                 $\pi$-Molecular Orbitals and the Processes of Life /
                 Alberte Pullman and Bernard Pullman / 547 \\
                 Index / 573",
}

@Proceedings{Lyche:1989:MMC,
  editor =       "Tom Lyche and Larry L. Schumaker",
  booktitle =    "Mathematical Methods in Computer Aided Geometric
                 Design",
  title =        "Mathematical Methods in Computer Aided Geometric
                 Design",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "xv + 611",
  year =         "1989",
  ISBN =         "0-12-460515-X",
  ISBN-13 =      "978-0-12-460515-2",
  LCCN =         "QA448.D38 M381 1989",
  MRclass =      "00Bxx, 41-06",
  bibdate =      "Wed Dec 15 10:38:41 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook2.bib",
  ZMnumber =     "0669.00011",
  acknowledgement = ack-nhfb,
  remark =       "Papers originally presented at an international
                 conference held June 16--22, 1988, at the University of
                 Oslo, Norway.",
}

@Book{Margenau:1964:MPC,
  editor =       "Henry Margenau and George Moseley Murphy",
  booktitle =    "The Mathematics of Physics and Chemistry",
  title =        "The Mathematics of Physics and Chemistry",
  volume =       "2",
  publisher =    "D. Van Nostrand",
  address =      "Princeton, NJ, USA",
  pages =        "v + 786",
  year =         "1964",
  LCCN =         "QA37 .M3818 1956",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/h/householder-alston-s.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  remark =       "With contributions by William Band, John O. Dimmock,
                 Robert G. Gallager, Edward M. Hofstetter, Alston S.
                 Householder, Nicholas Minorsky, David Mintzer, Thomas
                 L. Saaty, S. S. Schweber, and Robert J. Wheeler.",
  tableofcontents = "1 Transport Theory of Gases / David Mintzer / 1 \\
                 2 Numerical Analysis / Alston S. Householder / 50 \\
                 3 Random Processes / Edward M. Hofstetter / 99 \\
                 4 Information Theory / Robert G. Gallager / 190 \\
                 5 Operations Analysis; Methods and Structure of
                 Operations / Thomas L. Saaty / 249 \\
                 6 Nonlinear Problems in Physics and Engineering /
                 Nicholas Minorsky / 321 \\
                 7 Angular Momentum Operators and Rotations in Space and
                 Transformation Theory of Quantum Mechanics / Henry
                 Margenau / 391 \\
                 8 The Mathematical Formalism of Quantum Statistics /
                 William Band / 426 \\
                 9 Relativistic Quantum Mechanics / S. S. Schweber / 484
                 \\
                 10 External Field Problems / S. S. Schweber / 580 \\
                 11 Quantum Electrodynamics / S. S. Schweber / 642 \\
                 12 Symmetry Properties of Magnetic Crystals / J. O.
                 Dimmock and R. G. Wheeler / 725 \\
                 Index / 769",
  xxISBN =       "none",
}

@Book{Milton:2002:TC,
  author =       "Graeme W. Milton",
  booktitle =    "The Theory of Composites",
  title =        "The Theory of Composites",
  volume =       "6",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xxviii + 719",
  year =         "2002",
  DOI =          "https://doi.org/10.1017/CBO9780511613357",
  ISBN =         "0-521-78125-6",
  ISBN-13 =      "978-0-521-78125-1",
  LCCN =         "TA418.9.C6 M58 2001",
  MRclass =      "74Qxx (74A40 74E30 74Pxx 78A48 82B99 82D20)",
  MRnumber =     "1899805 (2003d:74077)",
  MRreviewer =   "Gr{\'e}goire Allaire",
  bibdate =      "Sat May 04 06:33:55 2002",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/beebe-nelson-h-f.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/m/milton-graeme-w.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/utah-math-dept-books.bib",
  note =         "Series editors: P. G. Ciarlet, A. Iserles, Robert V.
                 Kohn, and M. H. Wright.",
  price =        "US\$80",
  series =       "Cambridge Monographs on Applied and Computational
                 Mathematics",
  URL =          "https://www.math.utah.edu/books/tcbook",
  acknowledgement = ack-gwm # " and " # ack-nhfb,
  keywords =     "composite materials; differential equations, partial;
                 homogenization (differential equations)",
  remark =       "NHFB was the chief technical editor for this book, and
                 wrote the author/editor indexing software, the {\TeX}
                 DVI-to-PostScript driver and the initial Web site for
                 the book, at
                 \path=https://www.math.utah.edu/books/tcbook/index.html=.",
  tableofcontents = "1. Introduction \\
                 2. Some equations of interest and numerical approaches
                 to solving them \\
                 3. Duality transformations in two-dimensional media \\
                 4. Translations and equivalent media \\
                 5. Some microstructure-independent exact relations \\
                 6. Exact relations for coupled equations \\
                 7. Assemblages of spheres, ellipsoids, and other
                 neutral inclusions \\
                 8. Tricks for generating other exactly solvable
                 microgeometries \\
                 9. Laminate materials \\
                 10. Approximations and asymptotic formulas \\
                 11. Wave propagation in the quasistatic limit \\
                 12. Reformulating the problem of finding effective
                 tensors \\
                 13. Variational principles and inequalities \\
                 14. Series expansions for the fields and effective
                 tensors \\
                 15. Correlation functions and how they enter series
                 expansions \\
                 16. Other perturbation solutions \\
                 17. General theory of exact relations and links between
                 effective tensors \\
                 18 Analytic properties \\
                 19. Y -tensors \\
                 20. Y -tensors and effective tensors in electrical
                 circuits \\
                 21. Bounds on the properties of composites \\
                 22. Classical variational principle bounds \\
                 23. Bounds from the Hashin-Shtrikman variational
                 inequalities \\
                 24. Bounds using the compensated compactness or
                 translation method \\
                 25. Choosing the translations and finding
                 microgeometries that attain the bounds \\
                 26. Bounds incorporating three-point correlation
                 functions \\
                 27. Bounds using the analytic method \\
                 28. Fractional linear transformations as a tool for
                 generating bounds \\
                 29. Field equation recursion method \\
                 30. Properties of the G-closure and extremal families
                 of composites \\
                 31. Bounding of effective moduli as a
                 quasiconvexification problem",
}

@Book{Milton:2016:ETC,
  editor =       "Graeme W. Milton",
  booktitle =    "Extending the Theory of Composites to Other Areas of
                 Science",
  title =        "Extending the Theory of Composites to Other Areas of
                 Science",
  publisher =    "Milton--Patton Publishers",
  address =      "P.O. Box 581077, Salt Lake City, UT 85148, USA",
  pages =        "xx + 422",
  year =         "2016",
  ISBN =         "1-4835-6919-5 (print), 1-4835-6920-9 (e-book)",
  ISBN-13 =      "978-1-4835-6919-2 (print), 978-1-4835-6920-8
                 (e-book)",
  LCCN =         "????",
  bibdate =      "Wed Jul 06 09:36:32 2016",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/beebe-nelson-h-f.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/m/milton-graeme-w.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/utah-math-dept-books.bib",
  URL =          "https://www.math.utah.edu/books/milton",
  acknowledgement = ack-gwm # " and " # ack-nhfb,
  tableofcontents = "1: Canonical forms for linear physics equations and
                 key identities / Graeme W. Milton / 1 \\
                 2: Composites and the associated abstract theory /
                 Graeme W. Milton / 47 \\
                 3: A new perspective on boundary value problems /
                 Graeme W. Milton / 77 \\
                 4: Analyticity of the Dirichlet-to-Neumann map for the
                 time-harmonic Maxwell's equations / Maxence Cassier,
                 Aaron Welters and Graeme W. Milton / 95 \\
                 5: The inverse problem / Graeme W. Milton / 123 \\
                 6: Bounds for the transient response of viscoelastic
                 composites / Ornella Mattei and Graeme W. Milton / 149
                 \\
                 7: Superfunctions and the algebra of subspace
                 collections / Graeme W. Milton / 179 \\
                 8: Accelerating FFT methods for conducting composites /
                 Graeme W. Milton / 235 \\
                 9: The response of systems with coupled fields /
                 Mordehai Milgrom and Graeme W. Milton / 255 \\
                 10: A rigorous approach to the field recursion method /
                 Maxence Cassier, Aaron Welters and Graeme W. Milton /
                 287 \\
                 11: Projection Functional Theory for finding excited
                 states / Graeme W. Milton / 309 \\
                 12: The desymmetrization method for solving the
                 Schr{\"o}dinger equation / Graeme W. Milton / 319 \\
                 13: Variational principles and $Q_C^*$-convex functions
                 for Schr{\"o}dinger's equation / Graeme W. Milton / 337
                 \\
                 14: Green's functions for self-adjoint and
                 non-self-adjoint operators / Graeme W. Milton / 355 \\
                 Bibliography / / 369 \\
                 Author/editor index / / 401 \\
                 Index / / 413",
}

@Book{Milton:2023:TC,
  author =       "Graeme W. Milton",
  booktitle =    "The Theory of Composites",
  title =        "The Theory of Composites",
  publisher =    pub-SIAM,
  address =      pub-SIAM:adr,
  pages =        "xxviii + 719",
  year =         "2023",
  DOI =          "https://doi.org/10.1137/1.9781611977486",
  ISBN =         "1-61197-748-7 (paperback), 1-61197-748-7 (e-book)",
  ISBN-13 =      "978-1-61197-748-6 (paperback), 978-1-61197-748-6
                 (e-book)",
  LCCN =         "TA418.9.C6 M58 2023",
  bibdate =      "Fri Apr 25 12:19:09 2025",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/milton-graeme-w.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "https://epubs.siam.org/doi/book/10.1137/1.9781611977486",
  acknowledgement = ack-nhfb,
  remark =       "Reprint of \cite{Milton:2002:TC} in SIAM Classics in
                 Applied Mathematics series.",
}

@Book{Olver:2010:NHM,
  editor =       "Frank W. J. Olver and Daniel W. Lozier and Ronald F.
                 Boisvert and Charles W. Clark",
  key =          "NIST",
  booktitle =    "{NIST} Handbook of Mathematical Functions",
  title =        "{NIST} Handbook of Mathematical Functions",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xv + 951",
  year =         "2010",
  ISBN =         "0-521-19225-0",
  ISBN-13 =      "978-0-521-19225-5",
  LCCN =         "QA331 .N57 2010",
  bibdate =      "Sat May 15 09:08:09 2010",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/l/lanczos-cornelius.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/w/wigner-eugene.bib;
                 https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/mathcw.bib",
  price =        "US\$99.00",
  URL =          "http://dlmf.nist.gov/;
                 http://www.cambridge.org/9780521140638",
  acknowledgement = ack-nhfb,
  remark =       "Includes a DVD with a searchable PDF of each
                 chapter.",
  tableofcontents = "1. Algebraic and analytic methods [Ranjan Roy,
                 Frank W. J. Olver, Richard A. Askey and Roderick S. C.
                 Wong] \\
                 2. Asymptotic approximations [Frank W. J. Olver and
                 Roderick S. C. Wong] \\
                 3. Numerical methods [Nico M. Temme] \\
                 4. Elementary functions [Ranjan Roy and Frank W. J.
                 Olver] \\
                 5. Gamma function [Richard A. Askey and Ranjan Roy] \\
                 6. Exponential, logarithmic, sine and cosine integrals
                 [Nico M. Temme] \\
                 7. Error functions, Dawson's and Fresnel integrals
                 [Nico M. Temme] \\
                 8. Incomplete gamma and related functions [Richard B.
                 Paris] \\
                 9. Airy and related functions [Frank W. J. Olver] \\
                 10. Bessel functions [Frank W. J. Olver and Leonard C.
                 Maximon] \\
                 11. Struve and related functions [Richard B. Paris] \\
                 12. Parabolic cylinder functions [Nico M. Temme] \\
                 13. Confluent hypergeometric functions [Adri B. Olde
                 Daalhuis] \\
                 14. Legendre and related functions [T. Mark Dunster]
                 \\
                 15. Hypergeometric function [Adri B. Olde Daalhuis] \\
                 16. Generalized hypergeometric functions and Meijer
                 G-function [Richard A. Askey and Adri B. Olde Daalhuis]
                 \\
                 17. q-Hypergeometric and related functions [George E.
                 Andrews] \\
                 18. Orthogonal polynomials [Tom H. Koornwinder,
                 Roderick S. C. Wong, Roelof Koekoek and Rene F.
                 Swarttouw] \\
                 19. Elliptic integrals [Bille C. Carlson] \\
                 20. Theta functions [William P. Reinhardt and Peter L.
                 Walker] \\
                 21. Multidimensional theta functions [Bernard
                 Deconinck] \\
                 22. Jacobian elliptic functions [William P. Reinhardt
                 and Peter L. Walker] \\
                 23. Weierstrass elliptic and modular functions [William
                 P. Reinhardt and Peter L. Walker] \\
                 24. Bernoulli and Euler polynomials [Karl Dilcher] \\
                 25. Zeta and related functions [Tom M. Apostol] \\
                 26. Combinatorial analysis [David M. Bressoud] \\
                 27. Functions of number theory [Tom M. Apostol] \\
                 28. Mathieu functions and Hill's equation [Gerhard
                 Wolf] \\
                 29. Lam{\'e} functions [Hans Volkmer] \\
                 30. Spheroidal wave functions [Hans Volkmer] \\
                 31. Heun functions [Brian D. Sleeman and Vadim
                 Kuznetsov] \\
                 32. Painlev{\'e} transcendents [Peter A. Clarkson] \\
                 33. Coulomb functions [Ian J. Thompson] \\
                 34. 3j, 6j, 9j symbols [Leonard C. Maximon] \\
                 35. Functions of matrix argument [Donald St. P.
                 Richards] \\
                 36. Integrals with coalescing saddles [Michael V. Berry
                 and Chris Howls]",
}

@Book{Patterson:2008:COD,
  author =       "David A. Patterson and John L. Hennessy",
  booktitle =    "Computer Organization and Design: the Hardware\slash
                 Software Interface",
  title =        "Computer Organization and Design: the Hardware\slash
                 Software Interface",
  publisher =    pub-ELSEVIER-MORGAN-KAUFMANN,
  address =      pub-ELSEVIER-MORGAN-KAUFMANN:adr,
  edition =      "Fourth",
  bookpages =    "xxv + 703 + A-77 + B-83 + I-26",
  pages =        "xxv + 703 + A-77 + B-83 + I-26",
  year =         "2008",
  ISBN =         "0-12-374493-8",
  ISBN-13 =      "978-0-12-374493-7",
  LCCN =         "QA76.9.C643",
  bibdate =      "Mon Nov 17 13:31:21 MST 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/mathcw.bib;
                 z3950.gbv.de:20011/gvk",
  acknowledgement = ack-nhfb,
  subject =      "computer organization; computer engineering; computer
                 interfaces",
  tableofcontents = "1: Computer Abstractions and Technology \\
                 2: Instructions: Language of the Computer \\
                 3: Arithmetic for Computers \\
                 4: The Processor \\
                 5: Large and Fast: Exploiting Memory Hierarchy \\
                 6: Storage and Other I /O Topics \\
                 7: Multicores, Multiprocessors, and Clusters \\
                 Appendix A: Graphics and Computing GPUs \\
                 Appendix B: Assemblers, Linkers, and the SPIM Simulator
                 \\
                 Appendix C: The Basics of Logic Design \\
                 Appendix D: Mapping Control to Hardware \\
                 Appendix E: A Survey of RISC Architectures for Desktop,
                 Server, and Embedded Computers",
}

@Book{Hennessy:2017:CAQ,
  author =       "John L. Hennessy and David A. Patterson",
  title =        "Computer Architecture: a Quantitative Approach",
  publisher =    pub-MORGAN-KAUFMANN,
  address =      pub-MORGAN-KAUFMANN:adr,
  edition =      "Sixth",
  pages =        "xxix + 617 + 55 + 67 + 78 + 36 + 48",
  year =         "2017",
  ISBN =         "0-12-383873-8, 0-12-811905-5 (paperback),
                 0-12-811906-3 (e-Pub)",
  ISBN-13 =      "978-0-12-383873-5, 978-0-12-811905-1 (paperback),
                 978-0-12-811906-8 (e-Pub)",
  LCCN =         "QA76.9.A73",
  bibdate =      "Sat Jun 14 07:16:37 MDT 2025",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/risc-v.bib",
  abstract =     "\booktitle{Computer Architecture: A Quantitative
                 Approach}, Sixth Edition has been considered essential
                 reading by instructors, students and practitioners of
                 computer design for over 20 years. The sixth edition of
                 this classic textbook from Hennessy and Patterson,
                 winners of the 2017 ACM A. M. Turing Award recognizing
                 contributions of lasting and major technical importance
                 to the computing field, is fully revised with the
                 latest developments in processor and system
                 architecture. The text now features examples from the
                 RISC-V (RISC Five) instruction set architecture, a
                 modern RISC instruction set developed and designed to
                 be a free and openly adoptable standard. It also
                 includes a new chapter on domain-specific architectures
                 and an updated chapter on warehouse-scale computing
                 that features the first public information on Google's
                 newest WSC. True to its original mission of
                 demystifying computer architecture, this edition
                 continues the longstanding tradition of focusing on
                 areas where the most exciting computing innovation is
                 happening, while always keeping an emphasis on good
                 engineering design.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Printed Text \\
                 Foreword / ix--xiii \\
                 Preface / xvii--xxiii \\
                 Acknowledgments / xxv--xxix \\
                 1. Fundamentals of Quantitative Design and Analysis /
                 xxx \\
                 2. Memory Hierarchy Design / 76--164 \\
                 3. Instruction-Level Parallelism and Its Exploitation /
                 166--278 \\
                 4. Data-Level Parallelism in Vector, SIMD, and GPU
                 Architectures / 280--365 \\
                 5. Multiprocessors and Thread-Level Parallelism /
                 366--462 \\
                 6. Warehouse-Scale Computers to Exploit Request-Level
                 and Data-Level Parallelism / 464--537 \\
                 7. Domain Specific Architectures / 538--617 \\
                 A. Instruction Set Principles / A-0--A-66 \\
                 B. Review of Memory Hierarchy / B-0--B-67 \\
                 C. Pipelining: Basic and Intermediate Concepts /
                 C-0--C-78 \\
                 References / R-1--R-36 \\
                 Index / I-1--I-48 \\
                 Online \\
                 https://www.elsevier.com/books-and-journals/book-companion/9780128119051
                 \\
                 D. Storage Systems / D-0--D-67 \\
                 E. Embedded Systems / E-0--E-26 \\
                 F. Interconnection Networks / Revised by Timothy M.
                 Pinkston and Jos{\'e} Duato / F-0--F-118 \\
                 G. Vector Processors in More Depth / Revised by Krste
                 Asanovic / G-0--G-34 \\
                 H. Hardware and Software for VLIW and EPIC / H-0--H-44
                 \\
                 I. Large-Scale Multiprocessors and Scientific
                 Applications / I-0--I-47 \\
                 J. Computer Arithmetic / David Goldberg / J-0--J-73 \\
                 K. Survey of Instruction Set Architectures / K-0--K-75
                 \\
                 L. Advanced Concepts on Address Translation / Abhishek
                 Bhattacharjee / L-0--L-69 \\
                 M. Historical Perspectives and References / M-0--M-93",
}

@Book{Patterson:2017:COD,
  author =       "David A. Patterson and John L. Hennessy",
  title =        "Computer Organization and Design: the Hardware\slash
                 Software Interface",
  publisher =    pub-MORGAN-KAUFMANN,
  address =      pub-MORGAN-KAUFMANN:adr,
  edition =      "{RISC-V}",
  pages =        "xxiv + 565 + a-86 + i + 22",
  year =         "2017",
  ISBN =         "0-12-812275-7 (paperback), 0-12-812276-5 (e-book)",
  ISBN-13 =      "978-0-12-812275-4 (paperback), 978-0-12-812276-1
                 (e-book)",
  LCCN =         "QA76.9.C643",
  bibdate =      "Wed Sep 25 15:00:48 MDT 2024",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Morgan Kaufmann series in computer architecture and
                 design",
  URL =          "https://www.elsevier.com/books-and-journals/book-companion/9780128119051;
                 https://www.elsevier.com/books/computer-architecture/hennessy/978-0-12-811905-1",
  abstract =     "The new RISC-V Edition of Computer Organization and
                 Design features the RISC-V open source instruction set
                 architecture, the first open source architecture
                 designed to be used in modern computing environments
                 such as cloud computing, mobile devices, and other
                 embedded systems. With the post-PC era now upon us,
                 Computer Organization and Design moves forward to
                 explore this generational change with examples,
                 exercises, and material highlighting the emergence of
                 mobile computing and the Cloud. Updated content
                 featuring tablet computers, Cloud infrastructure, and
                 the x86 (cloud computing) and ARM (mobile computing
                 devices) architectures is included.",
  acknowledgement = ack-nhfb,
  subject =      "Computer organization; Computer engineering; Computer
                 interfaces; Ordinateurs; Conception et construction;
                 Interfaces (Informatique); Computer engineering.;
                 Computer interfaces.; Computer organization.",
  tableofcontents = "1. Computer Abstractions and Technology \\
                 2. Instructions: Language of the Computer \\
                 3. Arithmetic for Computers \\
                 4. The RISC-V Processor \\
                 5. Large and Fast: Exploiting Memory Hierarchy \\
                 6. Parallel Processors from Client to Cloud \\
                 A. The Basics of Logic Design \\
                 B. Graphics and Computing GPUs \\
                 C. Mapping Control to Hardware \\
                 D. A Survey of RISC Architectures",
}

@Book{Peitgen:1988:SFI,
  editor =       "Heinz-Otto Peitgen and Dietmar Saupe",
  booktitle =    "The Science of Fractal Images",
  title =        "The Science of Fractal Images",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xiii + 312",
  year =         "1988",
  ISBN =         "0-387-96608-0 (New York), 1-4612-8349-3, 3-540-96608-0
                 (Berlin)",
  ISBN-13 =      "978-0-387-96608-3 (New York), 978-1-4612-8349-2,
                 978-3-540-96608-1 (Berlin)",
  LCCN =         "QA614.86 .S35 1988",
  bibdate =      "Wed Dec 15 18:08:22 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib;
                 https://www.math.utah.edu/pub/bibnet/subjects/fractal-image-comp.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "This book is based on notes for the course Fractals:
                 Introduction, Basics and Perspectives given by Michael
                 F. Barnsley, Robert L. Devaney, Heinz-Otto Peitgen,
                 Dietmar Saupe and Richard F. Voss. The course was
                 chaired by Heinz-Otto Peitgen and was part of the
                 SIGGRAPH '87 (Anaheim, California) course program.
                 Though the five chapters of this book have emerged from
                 those courses we have tried to make this book a
                 coherent and uniformly styled presentation as much as
                 possible. It is the first book which discusses fractals
                 solely from the point of view of computer graphics.
                 Though fundamental concepts and algorithms are not
                 introduced and discussed in mathematical rigor we have
                 made a serious attempt to justify and motivate wherever
                 it appeared to be desirable. Basic algorithms are
                 typically presented in pseudo-code or a description so
                 close to code that a reader who is familiar with
                 elementary computer graphics should find no problem to
                 get started. Mandelbrot's fractal geometry provides
                 both a description and a mathematical model for many of
                 the seemingly complex forms and patterns in nature and
                 the sciences. Fractals have blossomed enormously in the
                 past few years and have helped reconnect pure
                 mathematics research with both natural sciences and
                 computing. Computer graphics has played an essential
                 role both in its development and rapidly growing
                 popularity. Conversely, fractal geometry now plays an
                 important role in the rendering, modelling and
                 animation of natural phenomena and fantastic shapes in
                 computer graphics.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Foreword: People and events behind the ``Science of
                 Fractal Images'' / Beno{\^\i}t B. Mandelbrot \\
                 1: Fractals in nature: From characterization to
                 simulation / Richard F. Voss \\
                 2: Algorithms for random fractals / Dietmar Saupe \\
                 3: Fractal patterns arising in chaotic dynamical
                 systems / Robert L. Devaney \\
                 4: Fantastic deterministic fractals / Heinz-Otto
                 Peitgen \\
                 5: Fractal modelling of real world images / Michael F.
                 Barnsley \\
                 Appendix A: Fractal landscapes without creases and with
                 rivers / Beno{\^\i}t B. Mandelbrot \\
                 Appendix B: An eye for fractals / Michael McGuire \\
                 Appendix C: A unified approach to fractal curves and
                 plants / Dietmar Saupe \\
                 Appendix D: Exploring the Mandelbrot set / Yuval
                 Fisher",
}

@Book{Pitici:2019:BWM,
  editor =       "Mircea Pitici",
  booktitle =    "The Best Writing On Mathematics: 2019",
  title =        "The Best Writing On Mathematics: 2019",
  volume =       "2019",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "xvi + 272 + 16",
  year =         "2019",
  ISBN =         "0-691-19835-7, 0-691-19867-5",
  ISBN-13 =      "978-0-691-19835-4, 978-0-691-19867-5",
  LCCN =         "QA8.6 .B337 2019",
  bibdate =      "Mon Dec 9 05:55:58 MST 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/kepler.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/pagerank.bib",
  abstract =     "An anthology of the year's finest writing on
                 mathematics from around the world, featuring promising
                 new voices as well as some of the foremost names in
                 mathematics.",
  acknowledgement = ack-nhfb,
  subject =      "Mathematics; Popular works; Mathematics.",
  tableofcontents = "Introduction / Mircea Pitici / ix--xvi \\
                 Geometry v. gerrymandering / Moon Duchin / 1--11 \\
                 Slicing sandwiches, states, and solar systems: can
                 mathematical tools help determine what divisions are
                 provably fair? / Theodore P. Hill / 12--26 \\
                 Does mathematics teach how to think? / Paul J. Campbell
                 / 27--42 \\
                 Abstracting the Rubik's cube / Roice Nelson / 43--52
                 \\
                 Topology-disturbing objects: a new class of 3D optical
                 illusion / Kokichi Sugihara / 53--73 \\
                 Mathematicians explore mirror link between two
                 geometric worlds / Kevin Hartnett / 74--80 \\
                 Professor Engel's marvelously improbable machines /
                 James Propp / 81--89 \\
                 The on-line encyclopedia of integer sequences / Neil J.
                 A. Sloane / 90--119 \\
                 Mathematics for big data / Alessandro Di Bucchianico,
                 Laura Iapichino, Nelly Litvak, Frank van der Meulen,
                 and Ron Wehrens / 120--131 \\
                 The un(solv)able problem / Toby S. Cubitt, David
                 P{\'e}rez-Garc{\'i}a, and Michael Wolf / 132--149 \\
                 The mechanization of mathematics / Jeremy Avigad /
                 150--170 \\
                 Mathematics as an empirical phenomenon, subject to
                 modeling / Reuben Hersh / 171--185 \\
                 Does $2 + 3 = 5$? In defense of a near absurdity / Mary
                 Leng / 186--194 \\
                 Gregory's sixth operation / Tiziana Bascelli, Piotr
                 Blaszczyk, Validmir Kanovei, Karin U. Katz, Mikhail G.
                 Katz, Semen S. Kutateladze, Tahl Nowik, Daivd M.
                 Schaps, and David Sherry / 195--207 \\
                 Kolmogorov complexity and our search for meaning: what
                 math can teach us about finding order in our chaotic
                 lives / Noson S. Yanofsky / 208--213 \\
                 Ethics in statistical practice and communication: five
                 recommendations / Andrew Gelman / 214--223 \\
                 The Fields Medal should return to its roots / Michael
                 J. Barany / 224--231 \\
                 The Erd{\H{o}}s paradox / Melvyn B. Nathanson /
                 232--239 \\
                 Contributors / 241--249 \\
                 Notable Writings / 251--268 \\
                 Acknowledgments / 269--270 \\
                 Credits [to original publication of this book's
                 chapters] / 271--272",
}

@Book{Posamentier:2007:FFN,
  author =       "Alfred S. Posamentier and Ingmar Lehmann",
  booktitle =    "The Fabulous {Fibonacci} Numbers",
  title =        "The Fabulous {Fibonacci} Numbers",
  publisher =    "Prometheus Books",
  address =      "Amherst, NY, USA",
  pages =        "385",
  year =         "2007",
  ISBN =         "1-59102-475-7",
  ISBN-13 =      "978-1-59102-475-0",
  LCCN =         "QA241 .P665 2007",
  bibdate =      "Thu Nov 8 21:18:29 MST 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fibquart.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/toc/ecip073/2006035406.html",
  acknowledgement = ack-nhfb,
  subject =      "Fibonacci numbers",
  tableofcontents = "A history and introduction to the Fibonacci numbers
                 \\
                 The Fibonacci numbers in nature \\
                 The Fibonacci numbers and the Pascal triangle \\
                 The Fibonacci numbers and the golden ratio \\
                 The Fibonacci numbers and continued fractions \\
                 A potpourri of the Fibonacci number applications \\
                 The Fibonacci numbers found in art and architecture \\
                 The Fibonacci numbers and musical form \\
                 The famous Binet formula for finding a particular
                 Fibonacci number \\
                 The Fibonacci numbers and fractals",
}

@Book{Randell:1982:ODC,
  editor =       "Brian Randell",
  booktitle =    "The Origins of Digital Computers: Selected Papers",
  title =        "The Origins of Digital Computers: Selected Papers",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Third",
  pages =        "xvi + 580",
  year =         "1982",
  DOI =          "https://doi.org/10.1007/978-3-642-61812-3",
  ISBN =         "0-387-11319-3, 3-540-11319-3",
  ISBN-13 =      "978-0-387-11319-7, 978-3-540-11319-5",
  LCCN =         "TK7885.A5 O741 1982",
  bibdate =      "Sun Nov 03 08:28:47 2002",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/babbage-charles.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/w/wilkes-maurice-v.bib;
                 https://www.math.utah.edu/pub/tex/bib/annhistcomput.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/mathcw.bib",
  series =       "Texts and monographs in computer science",
  acknowledgement = ack-nhfb,
  remark =       "See also other editions
                 \cite{Randell:1973:ODC,Randell:1975:ODC}.",
  tableofcontents = "Chapter I: Introduction / 1 \par

                 Chapter II: Analytical Engines / 9 \\
                 2.1. On the Mathematical Powers of the Calculating
                 Engine / C. Babbage (1837) / 19 \\
                 2.2. Report of the Committee \ldots{} appointed to
                 consider the advisability and to estimate the expense
                 of constructing Mr. Babbage's Analytical Machine, and
                 of printing tables by its means / C. W. Merrifield
                 (1879) / 55 \\
                 2.3. Babbage's Analytical Engine / H. P. Babbage (1910)
                 / 67 \\
                 2.4. On a Proposed Analytical Machine / P. E. Ludgate
                 (1909) / 73 \\
                 2.5. Essays on Automatics -- Its Definition --
                 Theoretical Extent of its Applications / L. Torres Y
                 Quevedo 1914 / 89 \\
                 2.6. Electromechanical Calculating Machine / L. Torres
                 y Quevedo (1920) / 109 \\
                 2.7. Scheme of Assembly of a Machine Suitable for the
                 Calculations of Celestial Mechanics / L. Couffignal
                 (1938) / 121 \par

                 Chapter III: Tabulating Machines / 127 \\
                 3.1. An Electric Tabulating System / H. Hollerith
                 (1889) / 133 \\
                 3.2. Calculating Machines: Their Principles and
                 Evolution / L. Couffignal (1933) / 145 \\
                 3.3. The Automatic Calculator IPM / H.-J. Dreyer and A.
                 Walther (1946) / 155 \par

                 Chapter IV: Zuse and Schreyer / 159 \\
                 4.1. Method for Automatic Execution of Calculations
                 with the aid of Computers / K. Zuse 1936 / 163 \\
                 4.2. Technical Computing Machines / H. Schreyer (1939)
                 / 171 \\
                 4.3. The Outline of a Computer Development from
                 Mechanics to Electronics / K. Zuse 1962 / 175
                 \par

                 Chapter V: Aiken and IBM / 191 \\
                 5.1. Proposed Automatic Calculating Machine / H. H.
                 Aiken (1937) / 195 \\
                 5.2. The Automatic Sequence Controlled Calculator / H.
                 H. Aiken and G. M. Hopper (1946) / 203 \\
                 5.3. Electrons and Computation / W. J. Eckert (1948) /
                 223 \\
                 5.4. The IBM Card-Programmed Electronic Calculator / J.
                 W. Sheldon and L. Tatum (1951) / 233 \par

                 Chapter VI: Bell Telephone Laboratories / 241 \\
                 6.1. Computer / G. R. Stibitz (1940) / 247 \\
                 6.2. The Relay Interpolator / O. Cesareo (1946) / 253
                 \\
                 6.3. The Ballistic Computer / J. Juley (1947) / 257 \\
                 6.4. A Bell Telephone Laboratories' Computing Machine /
                 F. L. Alt (1948) / 263 \par

                 Chapter VII: The Advent of Electronic Computers / 293
                 \\
                 7.1. Binary Calculation / E. W. Phillips (1936) / 303
                 \\
                 7.2. Computing Machine for the Solution of Large
                 Systems of Linear Algebraic Equations / J. V. Atanasoff
                 (1940) / 315 \\
                 7.3. Arithmetical Machine / V. Bush (1940) / 337 \\
                 7.4. Report on Electronic Predictors for Anti-Aircraft
                 Fire Control / J. A. Rajchman et al. (1942) / 345 \\
                 7.5. Colossus: Godfather of the Computer / B. Randell
                 (1977) / 349 \\
                 7.6. The Use of High Speed Vacuum Tube Devices for
                 Calculating / J. W. Mauchly (1942) / 355 \\
                 7.7. The Electronic Numerical Integrator and Computer.
                 (ENIAC) / H. H. Goldstine and A. Goldstine (1946) / 359
                 \par

                 Chapter VIII: Stored Program Electronic Computers / 375
                 \\
                 8.1. First Draft of a Report on the EDVAC / J. von
                 Neumann (1945) / 383 \\
                 8.2. Preparation of Problems for EDVAC-type Machines /
                 J. W. Mauchly (1947) / 393 \\
                 8.3. Preliminary Discussion of the Logical Design of an
                 Electronic Computing Instrument / A. W. Burks et al.
                 (1946) / 399 \\
                 8.4. Electronic Digital Computers / F. C. Williams and
                 T. Kilburn (1948) / 415 \\
                 8.5. The EDSAC / M. V. Wilkes and W. Renwick (1949) /
                 417 \\
                 8.6. The EDSAC Demonstration / B. H. Worsley (1949) /
                 423 \par

                 Bibliography / 431 \\
                 Index to Bibliography / 545 \\
                 Subject Index / 563",
}

@Book{Rhodes:2018:EHH,
  author =       "Richard Rhodes",
  booktitle =    "Energy: a human history",
  title =        "Energy: a human history",
  publisher =    pub-SIMON-SCHUSTER,
  address =      pub-SIMON-SCHUSTER:adr,
  pages =        "xiv + 464",
  year =         "2018",
  ISBN =         "1-5011-0535-3 (hardcover), 1-5011-0537-X (e-book)",
  ISBN-13 =      "978-1-5011-0535-7 (hardcover), 978-1-5011-0537-1
                 (e-book)",
  LCCN =         "TJ163.2 .R56 2018; TJ163.2 .R498 2018",
  bibdate =      "Mon Jun 4 08:32:13 MDT 2018",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/f/fermi-enrico.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Pulitzer Prize- and National Book Award-winning author
                 Richard Rhodes reveals the fascinating history behind
                 energy transitions over time --- wood to coal to oil to
                 electricity and beyond. People have lived and died,
                 businesses have prospered and failed, and nations have
                 risen to world power and declined, all over energy
                 challenges. Ultimately, the history of these challenges
                 tells the story of humanity itself. [\ldots{}] Human
                 beings have confronted the problem of how to draw life
                 from raw material since the beginning of time. Each
                 invention, each discovery, each adaptation brought
                 further challenges, and through such transformations,
                 we arrived at where we are today. In Rhodes's singular
                 style, \booktitle{Energy} details how this knowledge of
                 our history can inform our way tomorrow.",
  acknowledgement = ack-nhfb,
  author-dates = "1937--",
  subject =      "Power resources; History; Social aspects; Energy
                 development",
  tableofcontents = "Part 1. Power \\
                 1: No wood, no kingdom / 3 \\
                 2: Raising water by fire / 16 \\
                 3: A giant with one idea / 34 \\
                 4: To make for all the world / 49 \\
                 5: Catch me who can / 61 \\
                 6: Unconquered steam! / 80 \\
                 Part 2. Light \\
                 7: Rushlight to gaslight / 105 \\
                 8: Pursuing Leviathan / 126 \\
                 9: Burning fluids / 138 \\
                 10: Wild animals / 156 \\
                 11: Great forces of nature / 168 \\
                 12: A cadence of water / 185 \\
                 13: An enormous yellow cheese / 207 \\
                 14: Pillars of black cloud / 219 \\
                 Part 3. New fires \\
                 15: A gift of God / 229 \\
                 16: One-armed men doing welding / 249 \\
                 17: Full power in fifty-seven / 272 \\
                 18: Affection from the smog / 293 \\
                 19: The dark age to come / 307 \\
                 20: All aboard / 326 \\
                 Acknowledgments / 345 \\
                 Bibliography / 347 \\
                 Notes / 399 \\
                 Index / 445 \\
                 Images Credits / 463",
}

@Book{Rodgers:2019:TAS,
  author =       "Glen E. Rodgers",
  booktitle =    "Travelling with the Atom: a Scientific Guide to
                 {Europe} and Beyond",
  title =        "Travelling with the Atom: a Scientific Guide to
                 {Europe} and Beyond",
  publisher =    "Royal Society of Chemistry",
  address =      "Cambridge, UK",
  pages =        "xxxii + 551",
  year =         "2019",
  ISBN =         "1-78801-528-2 (paperback), 1-78801-702-1 (e-book)",
  ISBN-13 =      "978-1-78801-528-8 (paperback), 978-1-78801-702-2
                 (e-book)",
  LCCN =         "QC171.2 .R63 2020",
  bibdate =      "Fri Apr 3 08:52:49 MDT 2020",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/b/bohr-niels.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/b/born-max.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/c/clerk-maxwell-james.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/d/debroglie-louis.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/d/dirac-p-a-m.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/f/fermi-enrico.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/h/heisenberg-werner.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/m/meitner-lise.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/schroedinger-erwin.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  author-dates = "1944--",
  subject =      "Atomic theory; History; Atoms; Physicists",
  tableofcontents = "1: Traveling with the History of the Atomic Concept
                 / 1 \\
                 2: Bookending the Atom: Boyle and Schr{\"o}dinger
                 (Southern Ireland and Dublin) / 10 \\
                 3: Pneumatists Set the Atomic Stage: Boyle, Hooke,
                 Newton, Black, Cavendish, Priestley, and Davy (Western
                 England and Northumberland, Pennsylvania) / 30 \\
                 4: Hard Spheres and Pictograms, the First Concrete
                 Atomic Theory: John Dalton (Northern England and
                 Manchester) / 76 \\
                 5: Electricity and the Atom: Davy, Faraday, Clerk
                 Maxwell, and Thomson (England and Scotland, 1801--1907)
                 / 99 \\
                 6: The Brits, Led by the ``Crocodile'' and His Boys,
                 Take the Atom Apart: Ernest Rutherford (England,
                 Scotland, Ireland, New Zealand, and Montreal) / 140 \\
                 7: Scientists at the Heart of Westminster Abbey / 176
                 \\
                 8: The New French Chemistry and Atomism: Franklin,
                 Lavoisier, Berthollet, Gay-Lussac, Amp{\`e}re (Paris I)
                 / 196 \\
                 9: Atoms Go South: The Italians Volta, Avogadro, and
                 Cannizzaro (Italy) / 222 \\
                 10: Questioning the Reality of Atoms on the Ground:
                 Loschmid, Mach, Boltzmann, and Ostwald (Germany and
                 Austria) / 244 \\
                 11: Lighting the Dark Path to Atomism: Spectroscopy
                 Shows the Way: Fraunhofer, Bunsen, and Kirchhoff
                 (Germany I) / 264 \\
                 12: The Danes Jump In: {\O}rsted and Bohr / 284 \\
                 13: R{\"o}ntgen Rays Revolutionize Physics and Lead to
                 the Inner Atom (Germany II) / 311 \\
                 14: The Discovery That Atoms ``Fly to Bits'': Becquerel
                 and the Curies (Paris and Warsaw) / 327 \\
                 15: Quantum Mechanics Reluctantly Proposed: Planck and
                 Einstein (Germany and Switzerland) / 359 \\
                 16: Quantum Mechanics Brings Uncertainty to the Atom:
                 de Broglie, Schr{\"o}dinger, Heisenberg, Dirac, and
                 Born (France, Switzerland, England, Austria, and
                 Germany) / 386 \\
                 17: Nuclear Physics with ``the Pope'': Fission and the
                 Hahn\slash Meitner Controversy: Fermi, Hahn, Meitner,
                 Heisenberg (Italy, Germany, Austria, Sweden, and
                 Norway) / 412 \\
                 18: Mendeleev's and Our Path to the Periodic Table:
                 Mendeleev, Meyer, and Winkler (Russian and Germany) /
                 447 \\
                 19: Stockholm, the Atom and the Nobel Prizes:
                 Berzelius. Scheele, Arrhenius, and the Atomic Nobel
                 Prizes (Sweden) / 474 \\
                 Appendix / 510 \\
                 Place Index / 519 \\
                 Subject Index / 533",
}

@Book{Schein:2003:DDL,
  editor =       "Edgar H. Schein",
  booktitle =    "{DEC} is dead, long live {DEC}: the lasting legacy of
                 {Digital Equipment Corporation}",
  title =        "{DEC} is dead, long live {DEC}: the lasting legacy of
                 {Digital Equipment Corporation}",
  publisher =    "Berrett-Koehler",
  address =      "San Francisco, CA, USA",
  pages =        "xv + 319",
  year =         "2003",
  ISBN =         "1-57675-225-9",
  ISBN-13 =      "978-1-57675-225-8",
  LCCN =         "HD9696.2.U64 D543 2003",
  bibdate =      "Thu Dec 28 07:41:43 MST 2017",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0715/2003041788-d.html",
  abstract =     "\booktitle{DEC is Dead, Long Live DEC} tells the
                 40-year story of DEC's creation, demise, and enduring
                 legacy. Author Edgar Schein consulted to DEC throughout
                 its history and so had unparalleled access to all the
                 major players, and an inside view of all the major
                 events. He shows how the unique organizational culture
                 established by DEC's founder, Ken Olsen, gave the
                 company important competitive advantages in its early
                 years, but later became a hindrance and ultimately led
                 to the company's downfall.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Computer industry; United States; History; Management;
                 Case studies",
  tableofcontents = "Three Developmental Streams: A Model for
                 Deciphering the Lessons of the DEC Story \\
                 The Creation of a Culture of Innovation: the
                 Technology, Organization, and Culture Streams are One
                 and the Same \\
                 Ken Olsen, the Scientist--Engineer \\
                 Ken Olsen, the Leader and Manager \\
                 Ken Olsen, the Salesman--Marketer \\
                 DEC's Cultural Paradigm \\
                 DEC's ``Other'' Legacy: The Development of Leaders /
                 Tracy C. Gibbons \\
                 DEC's Impact on the Evolution of Organization
                 Development \\
                 The Streams Diverge, Causing an Organizational Midlife
                 Crisis \\
                 The Impact of Changing Technology / Paul Kampas \\
                 The Impact of Success, Growth, and Age \\
                 Learning Efforts Reveal Cultural Strengths and
                 Rigidities \\
                 The Turbulent 1980s: Peaking but Weakening \\
                 The Beginning of the End: Ken Olsen's Final Efforts to
                 Save DEC \\
                 Lessons and Legacies \\
                 The Lasting Legacy of Digital Equipment Corporation \\
                 DEC's Technical Legacy \\
                 DEC Manufacturing: Contributions Made and Lessons
                 Learned / Michael Sonduck \\
                 DEC, the First Knowledge Organization: A 1991 Memo /
                 Debra Rogers Amidon \\
                 Digital: The Strategic Failure / Peter DeLisi \\
                 What Happened? A Postscript / Gordon Bell",
}

@Book{Schilpp:1949:AEPa,
  editor =       "Paul Arthur Schilpp",
  booktitle =    "{Albert Einstein}: Philosopher-Scientist",
  title =        "{Albert Einstein}: Philosopher-Scientist",
  volume =       "1",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xviii + 781",
  year =         "1949",
  ISBN =         "0-87548-286-4",
  ISBN-13 =      "978-0-87548-286-6",
  ISSN =         "0075-9139",
  LCCN =         "QC16.E5 S3 1970",
  bibdate =      "Wed Dec 15 18:20:28 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/bohr-niels.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/b/born-max.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/d/debroglie-louis.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/i/infeld-leopold.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/p/pauli-wolfgang.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/s/sommerfeld-arnold.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Reprinted 1951, 1969, and 1982.",
  series =       "The Library of Living Philosophers",
  acknowledgement = ack-nhfb,
  tableofcontents = "Autobiographical Notes / Albert Einstein / 3--94
                 \\
                 1: To Albert Einstein's seventieth Birthday / Arnold
                 Sommerfeld / 97--105 \\
                 2: A General Survey of the Scientific Work of Albert
                 Einstein / Louis de Broglie / 107--127 \\
                 3: Presuppositions and Anticipations in Einstein's
                 Physics / Ilse Rosenthal-Schneider / 129--146 \\
                 4: Einstein's contributions to Quantum Theory / Pauli
                 Wolfgang / 147--160 \\
                 5: Einstein's Statistical Theories / Max Born /
                 161--177 \\
                 6: The Departure from Classical Thought in Modern
                 Physics / Walter Heitler / 179--198 \\
                 7: Discussion with Einstein on Epistemological Problems
                 in Atomic Physics / Niels Bohr / 199--241 \\
                 8: Einstein's Conception of Reality / Henry Margenau /
                 243--268 \\
                 9: Einstein, Mach, and Logical Positivism / Philipp
                 Frank / 269--286 \\
                 10: The Philosophical Significance of the Theory of
                 Relativity / Hans Reichenbach / 287--311 \\
                 11: Geometry as a Branch of Physics / H. P. Robertson /
                 313--332 \\
                 12: Einstein's Theories and the Operational Point of
                 View / P. W. Bridgman / 333--354 \\
                 13: Einstein's Theory of Knowledge / Victor F. Lenzen /
                 355--384 \\
                 14: Einstein's Conception of Science / Filmer S. C.
                 Northrop / 385--408 \\
                 15: Gravitation without General Relativity / E. A.
                 Milne / 409--435 \\
                 16: The Cosmological Constant / Georges Edward
                 Lema{\^\i}tre / 437--456 \\
                 17: The Theory of Relativity and Geometry / Karl Menger
                 / 457--474 \\
                 18: On the Structure of our Universe / Leopold Infeld /
                 477--499 \\
                 19: Inertia and Energy / Max von Laue / 501--533 \\
                 20: Scientific and Philosophical implications of the
                 Special Theory of Relativity / Herbert Dingle /
                 535--554 \\
                 21: A Remark About the Relationship Between Relativity
                 Theory and Idealistic Philosophy / Kurt G{\"o}del /
                 555--562 \\
                 22: The Philosophic Dialectic of the Concepts of
                 Relativity / Gaston Bachelard / 563--580 \\
                 23: Einstein's Theory of Relativity, Viewed from the
                 Standpoint of Critical Realism, and its Significance
                 for Philosophy / Aloys Wenzl / 581--606 \\
                 24: Einstein's Influence on Contemporary Philosophy /
                 Andrew Paul Ushenko / 607--645 \\
                 25: Einstein's Social Philosophy / Virgil G. Hinshaw,
                 Jr. / 647--661 \\
                 Remarks Concerning the Essays Brought Together in This
                 Co-operative Volume / Albert Einstein / 665--688 \\
                 Bibliography of the writings of Albert Einstein to
                 October 1949 / Margaret C. Shields / 689--758 \\
                 Supplement to Addenda to Einstein's Writings / Helen
                 Dukas / 758a--758b \\
                 Chronological List of Principal Works / Paul Arthur
                 Schilpp / 759--760 \\
                 Surindar Suri and Kenneth G. Halvorsen / Index /
                 761--781",
}

@Book{Schilpp:1949:AEPb,
  editor =       "Paul Arthur Schilpp",
  booktitle =    "{Albert Einstein}: Philosopher-Scientist",
  title =        "{Albert Einstein}: Philosopher-Scientist",
  volume =       "2",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xviii + 781",
  year =         "1949",
  ISBN =         "0-87548-286-4",
  ISBN-13 =      "978-0-87548-286-6",
  ISSN =         "0075-9139",
  LCCN =         "QC16.E5 S3 1970",
  bibdate =      "Wed Dec 15 18:20:31 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/bohr-niels.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/b/born-max.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/d/debroglie-louis.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/i/infeld-leopold.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/p/pauli-wolfgang.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/s/sommerfeld-arnold.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Reprinted 1951 and 1970.",
  series =       "The Library of Living Philosophers",
  acknowledgement = ack-nhfb,
  remark =       "There is an extensive bibliography of Einstein's
                 writings (journal articles, letters, and addresses) on
                 pp. 694--760.",
  tableofcontents = "Autobiographical Notes / Albert Einstein / 3--94
                 \\
                 1: To Albert Einstein's seventieth Birthday / Arnold
                 Sommerfeld / 97--105 \\
                 2: A General Survey of the Scientific Work of Albert
                 Einstein / Louis de Broglie / 107--127 \\
                 3: Presuppositions and Anticipations in Einstein's
                 Physics / Ilse Rosenthal-Schneider / 129--146 \\
                 4: Einstein's contributions to Quantum Theory / Pauli
                 Wolfgang / 147--160 \\
                 5: Einstein's Statistical Theories / Max Born /
                 161--177 \\
                 6: The Departure from Classical Thought in Modern
                 Physics / Walter Heitler / 179--198 \\
                 7: Discussion with Einstein on Epistemological Problems
                 in Atomic Physics / Niels Bohr / 199--241 \\
                 8: Einstein's Conception of Reality / Henry Margenau /
                 243--268 \\
                 9: Einstein, Mach, and Logical Positivism / Philipp
                 Frank / 269--286 \\
                 10: The Philosophical Significance of the Theory of
                 Relativity / Hans Reichenbach / 287--311 \\
                 11: Geometry as a Branch of Physics / H. P. Robertson /
                 313--332 \\
                 12: Einstein's Theories and the Operational Point of
                 View / P. W. Bridgman / 333--354 \\
                 13: Einstein's Theory of Knowledge / Victor F. Lenzen /
                 355--384 \\
                 14: Einstein's Conception of Science / Filmer S. C.
                 Northrop / 385--408 \\
                 15: Gravitation without General Relativity / E. A.
                 Milne / 409--435 \\
                 16: The Cosmological Constant / Georges Edward
                 Lema{\^\i}tre / 437--456 \\
                 17: The Theory of Relativity and Geometry / Karl Menger
                 / 457--474 \\
                 18: On the Structure of our Universe / Leopold Infeld /
                 477--499 \\
                 19: Inertia and Energy / Max von Laue / 501--533 \\
                 20: Scientific and Philosophical implications of the
                 Special Theory of Relativity / Herbert Dingle /
                 535--554 \\
                 21: A Remark About the Relationship Between Relativity
                 Theory and Idealistic Philosophy / Kurt G{\"o}del /
                 555--562 \\
                 22: The Philosophic Dialectic of the Concepts of
                 Relativity / Gaston Bachelard / 563--580 \\
                 23: Einstein's Theory of Relativity, Viewed from the
                 Standpoint of Critical Realism, and its Significance
                 for Philosophy / Aloys Wenzl / 581--606 \\
                 24: Einstein's Influence on Contemporary Philosophy /
                 Andrew Paul Ushenko / 607--645 \\
                 25: Einstein's Social Philosophy / Virgil G. Hinshaw,
                 Jr. / 647--661 \\
                 Remarks Concerning the Essays Brought Together in This
                 Co-operative Volume / Albert Einstein / 665--688 \\
                 Bibliography of the writings of Albert Einstein to
                 October 1949 / Margaret C. Shields / 689--758 \\
                 Supplement to Addenda to Einstein's Writings / Helen
                 Dukas / 758a--758b \\
                 Chronological List of Principal Works / Paul Arthur
                 Schilpp / 759--760 \\
                 Surindar Suri and Kenneth G. Halvorsen / Index /
                 761--781",
}

@Book{Shasha:1998:TML,
  editor =       "Dennis Shasha and Cathy Lazere",
  booktitle =    "Out of Their Minds: The Lives and Discoveries of 15
                 Great Computer Scientists",
  title =        "Out of Their Minds: The Lives and Discoveries of 15
                 Great Computer Scientists",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xi + 293",
  year =         "1998",
  ISBN =         "0-387-98269-8",
  ISBN-13 =      "978-0-387-98269-4",
  LCCN =         "QA76.2.A2 S53 1998",
  bibdate =      "Wed Mar 14 09:08:25 2001",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$16.00",
  abstract =     "\booktitle{Out of Their Minds} profiles 15 of the
                 planet's foremost computer scientists, including eight
                 winners of the Turing Award, computing's Nobel Prize.
                 Based on recent interviews, the scientists are revealed
                 in fascinating anecdotes about their early inspirations
                 and influences, contributions, and thoughts on the
                 field's explosive future.",
  acknowledgement = ack-nhfb,
  keywords =     "Alan Kay; Burton Smith; Danny Hillis; Donald Knuth;
                 Doug Lenat; Edsger Dijkstra; Edward Feigenbaum; Fred
                 Brooks; John Backus; John McCarthy; Leonid Levin;
                 Leslie Lamport; Michael Rabin; Robert Tarjan; Steve
                 Cook",
  libnote =      "Not yet in my library.",
  tableofcontents = "Linguists, how to talk to machines \\
                 Restless inventor / John Backus \\
                 Uncommon logician of common sense / John McCarthy \\
                 Clear romantic vision / Alan C. Kay \\
                 Algorithmists, how to solve problems fast \\
                 Appalling prose and the shortest path / Edsger W.
                 Dijkstra \\
                 Possibilities of chance / Michael O. Rabin \\
                 Boundless interests, a common thread / Donald E. Knuth
                 \\
                 In search of good structure / Robert E. Tarjan \\
                 Of time, space, and computation / Leslie Lamport \\
                 Good solution is hard to find / Stephen Cook and Leonid
                 Levin \\
                 Architects, how to build better machines \\
                 Delight in making things work / Frederick P. Brooks,
                 Jr. \\
                 Racing with the speed of light / Burton J. Smith \\
                 Biological connection / W. Daniel Hillis \\
                 Sculptors of machine intelligence, how to make machines
                 smart \\
                 Power of knowledge / Edward A. Feigenbaum \\
                 Twenty-year bet / Douglas B. Lenat \\
                 Epilogue: Secrets of success? \\
                 Postscript: Next 25 years \\
                 Glossary",
}

@Book{Shea:1983:OHR,
  editor =       "William R. Shea",
  booktitle =    "{Otto Hahn} and the Rise of Nuclear Physics",
  title =        "{Otto Hahn} and the Rise of Nuclear Physics",
  volume =       "22",
  publisher =    pub-REIDEL,
  address =      pub-REIDEL:adr,
  pages =        "252",
  year =         "1983",
  DOI =          "https://doi.org/10.1007/978-94-009-7133-2",
  ISBN =         "90-277-1584-X",
  ISBN-13 =      "978-90-277-1584-5",
  LCCN =         "QC773 .O87 1983",
  bibdate =      "Sun Jul 7 15:23:33 MDT 2013",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/h/heisenberg-werner.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/m/meitner-lise.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/r/rutherford-ernest.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "The University of Western Ontario series in philosophy
                 of science",
  URL =          "http://link.springer.com/book/10.1007/978-94-009-7133-2",
  acknowledgement = ack-nhfb,
  remark-1 =     "From page 34: ``We now know that Kronig himself, while
                 on a travelling fellowship in Europe, independently
                 conceived of electron spin as a physical interpretation
                 of Wolfgang Pauli's fourth quantum number, but that
                 Pauli discouraged Kronig from publication when the two
                 met in T{\"u}binger in early 1925.''. That statement
                 references a long note on page 61, which includes ``See
                 R. Kronig, `The Turning Point', in M. Fierz and V. F.
                 Weisskopf (ed.) \booktitle{Theoretical Physics in the
                 Twentieth Century: A Memorial Volume to Wolfgang Pauli}
                 (New York: Interscience, 1960), pp. 5--39, esp. pp.
                 19--28, \ldots{}''.",
  remark-2 =     "Pages 181--199 by Neil Cameron, \booktitle{The
                 Politics of British Science in the Munich Era},
                 discusses the significant impact of the death of Lord
                 Rutherford on 19 October 1937.",
  subject =      "Hahn, Otto; Nuclear physics; History; Nuclear
                 physicists; Germany; Biography; Kernfysica; Physiciens;
                 Allemagne. Physique nucl{\'e}aire; Histoire;
                 Aufsatzsammlung; Kernphysik; Geschichte; Nuclear
                 physics. Role of Hahn, Otto; 1879--1968",
  subject-dates = "1879--1968; (1879--1968)",
  tableofcontents = "Introduction: From Rutherford to Hahn / William R.
                 Shea / 1--18 \\
                 The nuclear electron hypothesis / Roger H. Stuewer /
                 19--67 \\
                 The evolution of matter / Robert H. Kargon / 69--89 \\
                 The discovery of fission and a nuclear physics paradigm
                 / Spencer R. Weart / 91--133 \\
                 Internal and external conditions for the discovery of
                 fission by the Berlin Team / Fritz Krafft / 135--165
                 \\
                 Otto Hahn, science, and social responsibility /
                 Lawrence Badash / 167--180 \\
                 The politics of British science in the Munich era /
                 Neil Cameron / 181--199 \\
                 Why Hahn's radiothorium surprised Rutherford in
                 Montreal / Thaddeus J. Trenn / 201--212 \\
                 The discovery of uranium Z by Otto Hahn / Ernst
                 Berninger / 213--220 \\
                 Nuclear physics in Canada in the 1930s / B. W. Sargent
                 / 221--240 \\
                 Back matter / 241--252",
}

@Book{Sokal:2000:SHS,
  editor =       "Alan D. Sokal",
  booktitle =    "The {Sokal} Hoax: the Sham That Shook the Academy",
  title =        "The {Sokal} Hoax: the Sham That Shook the Academy",
  publisher =    "University of Nebraska Press",
  address =      "Lincoln, NE, USA",
  pages =        "ix + 271",
  year =         "2000",
  ISBN =         "0-8032-7995-7 (paperback), 0-8032-1924-5",
  ISBN-13 =      "978-0-8032-7995-7 (paperback), 978-0-8032-1924-3",
  LCCN =         "Q175.37 .S65 2000",
  bibdate =      "Wed Oct 26 14:47:20 MDT 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  remark =       "The Library of Congress catalog credits Sokal as the
                 editor, but the book jacket says ``By the editors of
                 {\em Lingua Franca}.''",
  subject =      "Fraud in science; Science; Philosophy; Science; Social
                 aspects; Humanities; Sokal, Alan D.",
  subject-dates = "1955--",
  tableofcontents = "Introduction \\
                 Transgressing the Boundaries: Toward a Transformative
                 Hermeneutics of Quantum Gravity / Alan Sokal \\
                 Revelation: A Physicist Experiments with Cultural
                 Studies / Alan Sokal \\
                 Response: Mystery Science Theater / Bruce Robbins,
                 Andrew Ross \\
                 Selected Letters to the Editor \\
                 Scientist Takes Academia for a Ridge with Parody /
                 Linda Seebach \\
                 Is It-Gibberish or Merely Obscure?: Scientist Hoaxes
                 Academic Journal / Mitchell Landsberg \\
                 Postmodern Gravity Deconstructed, Slyly / Janny Scott
                 \\
                 Hokum for High-Brows / John Yemma \\
                 Professor Sokal's Bad Joke / Stanley Eugene Fish \\
                 When Pretension Reigns Supreme / Scott McConnell \\
                 A Physics Prof. Drops a Bomb on the Faux Left / Ruth
                 Rosen \\
                 Smitten with Gibberish / George F. Will \\
                 Hoax Article Yanks Academics' Legs / John Omicinski \\
                 Pomolotov Cocktail, and selected responses / Katha
                 Pollitt \\
                 Another Dispatch from the Culture: Wars / James Terry
                 \\
                 Scholarly Article a Fine Hoax: Social Scientists Wore
                 No Clothes \\
                 Illogical Dons Swallow Hoaxer's Leap into Quantum
                 Gibberish / Euan Ferguson \\
                 Sokal's Prank / Roberto Campos \\
                 Sokal, a Self-Parodist / Olavo de Carvalho \\
                 Academic Insult in Greenwich Village, and selected
                 responses / Marco d'Eramo \\
                 When Clever Men Think Rubbish, Sound the Alarm Bells /
                 A. N. Wilson \\
                 Sokal Is No Socrates / Denis Duclos \\
                 Is There Science after the Cold War? / Bruno Latour \\
                 Why I Wrote My Parody / Alan Sokal \\
                 My Sokaled Life; Or, Revenge of the Nerds / Ellen
                 Willis \\
                 The Sokal Hoax / Michael Berube, Alan Sokal \\
                 Sokal's Hoax, and selected responses / Steven Weinberg
                 \\
                 What the Sokal Hoax Ought to Teach Us, and selected
                 responses / Paul Boghossian \\
                 Was Sokal's Hoax Justified? / Kurt Gottfried \\
                 The ``Sokal Affair'' Takes Transatlantic Turn / David
                 Dickson \\
                 Friendly Fire: The Hoaxing of Social Text / Peter
                 Osborne \\
                 Alan Sokal's ``Transgression'' / Stanley Aronowitz \\
                 The Science Wars in India / Meera Nanda \\
                 Postmodernism and the Left / Barbara Epstein \\
                 Cultural Studies and Its Discontents: A Comment on the
                 Sokal Affair / Ken Hirschkop \\
                 Just Doing Your Job: Some Lessons of the Sokal Affair /
                 Bruce Robbins \\
                 Reflections on the Sokal Affair / Andrew Ross \\
                 A Plea for Reason, Evidence, and Logic / Alan Sokal \\
                 Lingua Franca Roundtable \\
                 Among Our Academic Contributors \\
                 Source Acknowledgments",
}

@Book{Srikant:2002:CDH,
  editor =       "Y. N. Srikant and Priti Shankar",
  booktitle =    "The Compiler Design Handbook: Optimizations and
                 Machine Code Generation",
  title =        "The Compiler Design Handbook: Optimizations and
                 Machine Code Generation",
  publisher =    pub-CRC,
  address =      pub-CRC:adr,
  pages =        "xii + 916",
  year =         "2002",
  ISBN =         "0-8493-1240-X, 1-4200-4057-X (e-book)",
  ISBN-13 =      "978-0-8493-1240-3, 978-1-4200-4057-9 (e-book)",
  LCCN =         "QA76.76.C65 C66 2003",
  bibdate =      "Sat Jul 27 12:20:09 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$139.95, UK\pounds 98.00",
  abstract =     "The widespread use of object-oriented languages and
                 Internet security concerns are just the beginning. Add
                 embedded systems, multiple memory banks, highly
                 pipelined units operating in parallel, and a host of
                 other advances and it becomes clear that current and
                 future computer architectures pose immense challenges
                 to compiler designers-challenges that already exceed
                 the capabilities of traditional compilation techniques.
                 \booktitle{The Compiler Design Handbook: Optimizations
                 and Machine Code Generation} is designed to help you
                 meet those challenges. Written by top researchers and
                 designers from around the world, it presents detailed,
                 up-to-date discussions on virtually all aspects of
                 compiler optimizations and code generation. It covers a
                 wide range of advanced topics, focusing on contemporary
                 architectures such as VLIW, superscalar,
                 multiprocessor, and digital signal processing. It also
                 includes detailed presentations that highlight the
                 different techniques required for optimizing programs
                 written in parallel and those written in
                 object-oriented languages. Each chapter is
                 self-contained, treats its topic in depth, and includes
                 a section of future research directions. Compiler
                 design has always been a highly specialized subject
                 with a fine blend of intricate theory and difficult
                 implementation. Yet compilers play an increasingly
                 vital role in the quest for improved performance. With
                 its careful attention to the most researched,
                 difficult, and widely discussed topics in compiler
                 design, \booktitle{The Compiler Design Handbook} offers
                 a unique opportunity for designers and researchers to
                 update their knowledge, refine their skills, and
                 prepare for future innovations.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  tableofcontents = "Data flow analysis / Uday P. Khedker \\
                 Automatic generation of code optimizers from formal
                 specifications / Vineeth Kumar Paleri \\
                 Scalar compiler optimizations on the static single
                 assignment form and the flow graph / Y. N. Srikant \\
                 Profile-guided compiler optimizations / Rajiv Gupta,
                 Eduard Mehofer, Youtao Zhang \\
                 Shape analysis and applications / Reinhard Wilhelm,
                 Thomas Reps, Mooly Sagiv \\
                 Optimizations for object-oriented languages / Andreas
                 Krall, Nigel Horspool \\
                 Data flow testing / Rajiv Gupta, Neelam Gupta \\
                 Program slicing / G. B. Mund, D. Goswami, Rajib Mall
                 \\
                 Debuggers for programming languages / Sanjeev Kumar
                 Aggarwal, M. Sarath Kumar \\
                 Dependence analysis and parallelizing transformations /
                 Sanjay Rajopadhye \\
                 Compilation for distributed memory architectures / Alok
                 Choudhary, Mahmut Kandemir \\
                 Automatic data distribution / J. Ramanujam \\
                 Register allocation / K. Gopinath \\
                 Architecture description languages for retargetable
                 compilation / Wei Qin, Sharad Malik \\
                 Instruction selection using tree parsing / Priti
                 Shankar \\
                 Retargetable very long instruction word compiler
                 framework for digital signal processors / Subramanian
                 Rajagopalan, Sharad Malik \\
                 Instruction scheduling / R. Govindarajan \\
                 Software pipelining / Vicki H. Allan, Stephen J. Allan
                 \\
                 Dynamic compilation / Evelyn Duesterwald \\
                 Compiling safe mobile code / R. Vengopal, Ravindra B.
                 Keskar \\
                 Type systems in programming languages / Ramesh
                 Subrahmanyam \\
                 Introduction to operational semantics / Sanjeeva
                 Prasad, S. Arun-Kumar",
}

@Book{Swade:2001:DEC,
  author =       "Doron Swade",
  key =          "Swade-DE",
  booktitle =    "The {Difference Engine}: {Charles Babbage} and the
                 Quest to Build the First Computer",
  title =        "The {Difference Engine}: {Charles Babbage} and the
                 Quest to Build the First Computer",
  publisher =    pub-VIKING,
  address =      pub-VIKING:adr,
  pages =        "x + 342 + 16",
  year =         "2001",
  ISBN =         "0-670-91020-1, 0-14-200144-9 (paperback)",
  ISBN-13 =      "978-0-670-91020-5, 978-0-14-200144-8 (paperback)",
  LCCN =         "QA75 .S954 2001",
  bibdate =      "Sat Jan 12 22:44:09 MST 2013",
  bibsource =    "cat.libraries.psu.edu:2200/Unicorn;
                 clio-db.cc.columbia.edu:7090/Voyager;
                 https://www.math.utah.edu/pub/bibnet/authors/b/babbage-charles.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/l/lovelace-ada-augusta.bib;
                 https://www.math.utah.edu/pub/tex/bib/annhistcomput.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 library.usc.edu:2200/unicorn;
                 sirsi.library.utoronto.ca:2200/UNICORN;
                 z3950.bibsys.no:2100/BIBSYS; z3950.gbv.de:20011/gvk;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.gbv.de/dms/bowker/toc/9780670910205.pdf;
                 http://www.loc.gov/catdir/toc/fy034/00068643.html;
                 http://www.zentralblatt-math.org/zmath/en/search/?an=1017.01006",
  abstract-1 =   "In 1821, Charles Babbage was reviewing a set of
                 mathematical tables with a colleague in preparation for
                 a scientific presentation when, after finding a wealth
                 of errors, he exclaimed in frustration, ``I wish to God
                 these calculations had been executed by steam!'' With
                 this outburst, Babbage began to envision an end to
                 human errors in the numerical tables upon which
                 finance, trade, science, and navigation relied. The
                 Difference Engine is the fascinating story of his
                 heroic quest, against all odds, to build the first
                 computing machine more than one hundred years before
                 the modern computer we use today was invented. Set
                 against the politics and science of the explosive early
                 Victorian era, The Difference Engine is a thrilling
                 tale of Babbage's exuberant determination. Like
                 Longitude, The Difference Engine is a fascinating
                 portrait of the human story behind a pivotal moment in
                 history and one of the most influential inventions of
                 our time. Forensic anthropologist Maples revisits his
                 strangest, most interesting, and most horrific
                 investigations, from gruesome and baffling
                 dismemberment cases to the revelation of the identity
                 of long-buried skeletons. ``These tales of crime
                 unmasked by science are compelling in their own
                 right.''.",
  abstract-2 =   "In 1821 an inventor and mathematician, Charles
                 Babbage, was poring over a set of mathematical tables.
                 Finding error after error Babbage exclaimed, ''I wish
                 to God these calculations had been executed by steam.``
                 His frustration was not simply at the grindingly
                 tedious labor of checking manually evaluated tables,
                 but at their daunting unreliability. Science,
                 engineering, construction, banking, and insurance
                 depended on tables for calculation. Ships navigating by
                 the stars relied on them to find their positions at
                 sea.''. ``Babbage launched himself on a grand venture
                 to design and build mechanical calculating engines that
                 would eliminate such errors. His bid to build
                 infallible machines is a saga of ingenuity and will,
                 which led beyond mechanized arithmetic into the
                 entirely new realm of computing. Through Ada, Countess
                 of Lovelace and daughter of Lord Byron, we gain
                 tantalizing insights into how at least one Victorian
                 glimpsed the promise of what was to come. Babbage
                 springs out of history like a jack-in-the-box: a
                 gentleman philosopher, a tireless inventor, a vigorous
                 socialite, and a mesmerizing raconteur. `Mr. Babbage is
                 coming to dinner' was a coup for any hostess.''
                 ``Drawing on previously unused archival material, The
                 Difference Engine is a tale of both Babbage's
                 nineteenth-century quest to build a calculating engine
                 and its twentieth-century sequel. For in 1991,
                 Babbage's vision was finally realized, at least in
                 part, by the completion at the Science Museum in London
                 of the first full-sized Babbage engine, finished in
                 time for the 200th anniversary of Babbage's birth. The
                 two quests are mutually illuminating and are recounted
                 here by the then Curator of Computing, Doron Swade ---
                 one of the main protagonists of the successful
                 resumption of Babbage's extraordinary work.",
  acknowledgement = ack-nhfb,
  subject =      "Calculators; Great Britain; History; 19th century;
                 Babbage, Charles",
  subject-dates = "1791--1871",
  tableofcontents = "Acknowledgements / vii \\
                 A Note on the Value of Money in the Nineteenth Century
                 / x \\
                 Preface / 1 \\
                 Part I. The Difference Engine \\
                 1: The Tables Crisis / 9 \\
                 2: A Personal Question / 32 \\
                 3: Tragedy and Decline / 49 \\
                 4: Miracles and Machines / 72 \\
                 Part II. The Analytical Engine \\
                 5: Breakthrough / 91 \\
                 6: Applause in Turin / 114 \\
                 7: The Astronomer Royal Objects / 134 \\
                 8: The Enchantress of Number / 155 \\
                 9: Intrigues of Science / 172 \\
                 10: Visionaries and Pragmatists / 193 \\
                 11: Curtain Call / 210 \\
                 Part III. A Modern Sequel \\
                 12: Here We Go Again / 221 \\
                 13: The Trial Piece / 232 \\
                 14: The Money / 252 \\
                 15: The Deal / 269 \\
                 16: The Build / 283 \\
                 17: The `Irascible Genius' Redeemed / 296 \\
                 18: The Modern Legacy / 308 \\
                 Charles Babbage: Biographical Note / 319 \\
                 Bibliography / 321 \\
                 Credits / 332 \\
                 Index / 333",
}

@Book{Swartzlander:1976:CDD,
  author =       "Earl E. {Swartzlander, Jr.}",
  booktitle =    "Computer Design Development: Principal Papers",
  title =        "Computer Design Development: Principal Papers",
  publisher =    pub-HAYDEN-BOOK,
  address =      pub-HAYDEN-BOOK:adr,
  pages =        "310",
  year =         "1976",
  ISBN =         "0-8104-5988-4",
  ISBN-13 =      "978-0-8104-5988-5",
  LCCN =         "QA76.5 .C612565",
  bibdate =      "Wed Oct 13 08:14:58 2004",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/w/wilkes-maurice-v.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  tableofcontents = "0. Preface by Swartzlander \\
                 1: Logic Design \\
                 1.0 Introduction by Swartzlander \\
                 1.1 ``A Symbolic Analysis of Relay and Switching
                 Circuits'', Claude E. Shannon (1938) \\
                 1.2 ``The Map Method for Synthesis of Combinational
                 Logic Circuits'', M. Karnaugh (1953) \\
                 1.3 ``Minimization of Boolean Functions'', E. J.
                 McCluskey (1956) \\
                 1.4 ``A Method for Synthesizing Sequential Circuits'',
                 George H. Mealy (1955) \\
                 1.5 ``Hazards and Delays in Asynchronous Sequential
                 Switching Circuits'', S. H. Unger (1959) \\
                 1.6 ``Internal State Assignments for Asynchronous
                 Sequential Machines'', James H. Tracey \\
                 2: Arithmetic Algorithms \\
                 2.0 Introduction by Swartzlander \\
                 2.1 ``High-Speed Arithmetic in Binary Computers'',
                 O. L. MacSorley (1961) \\
                 2.2 ``A Signed Binary Multiplication Technique'',
                 Andrew D. Booth (1951) \\
                 2.3 ``Some Schemes for Parallel Multipliers'', L. Dadda
                 (1965) \\
                 2.4 ``The Residue Number System'', Harvey L. Garner
                 (1959) \\
                 2.5 ``The IBM System 360 Model 91: Floating-Point
                 Execution Unit'', S. F. Anderson, J. G. Earle, R. E.
                 Goldschmidt, and D. M. Powers (1967) \\
                 3: Computer Architecture \\
                 3.0 Introduction by Swartzlander \\
                 3.1 ''Preliminary Discussion of the Logical Design of
                 an Electronic Computing Instrument'', Arthur W. Burks,
                 Herman H. Goldstine, and John von Neumann (1946) \\
                 3.2 ''Symbolic Synthesis of Digital Computers'', Irving
                 S. Reed (1950) \\
                 3.3 ''The Best Way to Design an Automatic Calculating
                 Machine'', M. V. Wilkes (1951) \\
                 3.4 ''Structural Aspects of the System/360 Model 85
                 part II: The Cache'', J. S. Liptay (1968) \\
                 3.5 ''Parallel Operation in the Control Data 6600'',
                 James E. Thornton (1964) \\
                 3.6 ''The SOLOMON Computer'', Daniel L. Slotnick, W.
                 Borck, and R. McReynolds (1962) \\
                 4: Appendix \\
                 4.0 Introduction by Swartzlander \\
                 4.1 ``A Trigger Relay Utilizing Three-Electrode
                 Thermionic Vacuum Tubes'', W. H. Eccles and F. W.
                 Jordan (1919) \\
                 4.2 ``The CORDIC Trigonometric Computing Technique'',
                 Jack E. Bolder (1959)",
}

@Book{Swartzlander:1990:CAa,
  author =       "Earl E. {Swartzlander, Jr.}",
  booktitle =    "Computer Arithmetic",
  title =        "Computer Arithmetic",
  volume =       "1",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "xiii + 378",
  year =         "1990",
  ISBN =         "0-8186-8931-5 (hardcover), 0-8186-5931-9
                 (microfiche)",
  ISBN-13 =      "978-0-8186-8931-4 (hardcover), 978-0-8186-5931-7
                 (microfiche)",
  LCCN =         "QA76.6 .C633 1990",
  bibdate =      "Wed Dec 15 10:43:03 1993",
  bibsource =    "ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/ibmsysj.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "IEEE Computer Society Press tutorial",
  acknowledgement = ack-nj,
  keywords =     "Computer arithmetic; Electronic digital computers ---
                 Programming; Floating-point arithmetic.",
  remark =       "Vol. 1 is a reprint. Originally published:
                 Stroudsburg, Pa.: Dowden, Hutchinson and Ross, c1980.
                 Originally published in series: Benchmark papers in
                 electrical engineering and computer science; 21. Vol 2
                 is a sequel to the earlier collection. Vol. 1: 2nd
                 ed.",
  tableofcontents = "Series Editor's Foreword / v \\
                 Preface / vii \\
                 Contents by Author / xiii \\
                 Introduction / 1 \\
                 Part I: Overview / 6 \\
                 Editor's / Comments on Papers 1 and 2 / 7 \\
                 1: Shaw, R. F.: Arithmetic Operations in a Binary
                 Computer, Rev. Sci. Instrum. 21:687--693 (1950) / 7 \\
                 2: MacSorley, O. L: High-Speed Arithmetic in Binary
                 Computers, IRE Proc. 49:67--91 (1961) / 14 \\
                 Part II: Addition and Subtraction \\
                 Editor's Comments on Papers 3 Through 10 / 40 \\
                 3: Gilchrist, B., J. H. Pomerene, and S. Y. Wong: Fast
                 Carry Logic for Digital Computers, IRE Trans. Electron.
                 Comput. EC-4:133--136 (1955) / 43 \\
                 4: Weinberger, A., and J. L. Smith: A Logic for
                 High-Speed Addition, Nat. Bur. Stand. Circ. 591, pp.
                 3--12 (1958) / 47 \\
                 5: Sklansky J.: Conditional-Sum Addition Logic, IRE
                 Trans. Electron. Comput. EC-9:226--231 (1960) / 57 \\
                 6: Sklansky J.: An Evaluation of Several Two-Summand
                 Binary Adders / IRE Trans. Electron. Comput.
                 EC-9:213--226 (1960) / 63 \\
                 7: Svoboda, A.: Adder with Distributed Control, IEEE
                 Trans. Comput. C-19: 749--751 (1970) / 77 \\
                 8: Ho, I. T., and T. C. Chen: Multiple Addition by
                 Residue Threshold Functions and Their Representation by
                 Array Logic, IEEE Trans. Comput. C-22:762--767 (1973) /
                 80 \\
                 9: Foster, C C,, and F. D. Stockton: Counting
                 Responders in an Associative Memory, IEEE Trans.
                 Comput. C-20:1580--1583 (1971) / 86 \\
                 10: Swartzlander, E. E., Jr.: Parallel Counters, IEEE
                 Trans. Comput. C-22:1021--1024 (1973) / 90 \\
                 Editor's Comments on Papers 11 Through 20 / 96 \\
                 11: Booth, A, D.: A Signed Binary Multiplication
                 Technique, Q. J. Mech. Appl. Math. 4:236--240 (1951) /
                 100 \\
                 12: Ghest, C.: Multiplying Made Easy for Digital
                 Assemblies, Electronics 44:56--61 (Nov. 22, 1971) / 105
                 \\
                 13: Chen, T. C.: A Binary Multiplication Scheme Based
                 on Squaring, IEEE Trans. Comput. C-20:678--680 (1971) /
                 111 \\
                 14: Wallace, C. S.: A Suggestion for a Fast Multiplier,
                 IEEE Trans. Electron. Comput. EC-13:14--17 (1964) / 114
                 \\
                 15: Dadda, L.: Some Schemes for Parallel Multipliers,
                 Alta Freq. 34:349--356 (1965) / 118 \\
                 16: Dadda, L.: On Parallel Digital Multipliers, Alta
                 Freq. 45:574--580 (1976) / 126 \\
                 17: Stenzel, W. J., W. J. Kubitz, and G. H. Garcia: A
                 Compact High-Speed Parallel Multiplication Scheme, IEEE
                 Trans. Comput. C-26:948--957 (1977) / 133 \\
                 18A: Baugh, C. R., and B. A, Wooley: A Two's Complement
                 Parallel Array Multiplication Algorithm, IEEE Trans.
                 Comput. C-22:1045--1047 (1973) / 143 \\
                 18B: Blankenship, P. E.: Comments on ``A Two's
                 Complement Parallel Array Multiplication Algorithm'',
                 IEEE Trans. Comput. C-23:1327 (1974) / 146 \\
                 19: Swartzlander, E. E., Jr.: The Quasi-Serial
                 Multiplier, IEEE Trans. Comput. C-22:317--321 (1973) /
                 147 \\
                 20: McDaneld, T. G., and R. K. Guha: The Two's
                 Complement Quasi-Serial Multiplier, IEEE Trans. Comput.
                 C-24:1233--1235 (1975) / 152 \\
                 Part IV: Division \\
                 Editor's Comments on Papers 21 Through 26 / 156 \\
                 21: Robertson, J. E.: A New Class of Digital Division
                 Methods, IRE Trans. Electron. Comput. EC-7:218--222
                 (1958) / 159 \\
                 22: Wilson, J. B., and R. S. Ledley: An Algorithm for
                 Rapid Binary Division, IRE Trans. Electron. Comput.
                 EC-10:662--670 (1961) / 164 \\
                 23: Atkins, D. E.: Higher-Radix Division Using
                 Estimates of the Divisor and Partial Remainders, IEEE
                 Trans. Comput. C-17:925--934 (1968) / 173 \\
                 24: Svoboda, A.: An Algorithm for Division, Inf.
                 Process. Mach. 9:25--32 (1963) / 183 \\
                 25: Ferrari, D.: A Division Method Using a Parallel
                 Multiplier, IEEE Trans. Electron. Comput.
                 EC-16:224--226 (1967) / 191 \\
                 26: Flynn, M. J.: On Division by Functional Iteration,
                 IEEE Trans. Comput. C-19:702--706 (1970) / 194 \\
                 Part V: Logarithms \\
                 Editor's Comments on Papers 27 Through 31 / 200 \\
                 27: Combet, M., H. van Zonneveld, and L. Verbeek:
                 Computation of the Base Two Logarithm of Binary
                 Numbers, IEEE Trans. Electron. Comput. EC-14:863--867
                 (1965) / 202 \\
                 28: Marino, D.: New Algorithms for the Approximate
                 Evaluation in Hardware of Binary Logarithms and
                 Elementary Functions IEEE Trans. Comput. C-21:
                 1416--1421 (1972) / 207 \\
                 29: Majithia J. C., and D. Levan: A Note on Base-2
                 Logarithm Computations, IEEE Proc. 61:1519--1520 (1973)
                 / 213 \\
                 30: Kingsbury N. G., and P. J. W. Rayner: Digital
                 Filtering Using Logarithmic Arithmetic, Electron. Lett.
                 7:56--58 (1971) / 215 \\
                 31: Swartzlander E. E., Jr., and A. G. Alexopoulos: The
                 Sign/Logarithm Number System, IEEE Trans. Comput.
                 C-24:1238--1242 (1975) / 218 \\
                 Part VI: Elementary Functions \\
                 Editor's Comments on Papers 32 Through 37 / 224 \\
                 32: Volder, J. E.: The CORDIC Trigonometric Computing
                 Technique, IRE Trans. Electron. Comput. EC-8:330--334
                 (1959) / 226 \\
                 33: Specker W. H.: A Class of Algorithms for Ln $x$,
                 Exp $x$, Sin $x$, Cos $x$, Tan$^{-1}$ $x$, and
                 Cot$^{-1}$ $x$, IEEE Trans. Electron. Comput.
                 EC-14:85--86 (1965) / 231 \\
                 34: Linhardt, R. J., and H. S. Muller: Digit-by-Digit
                 Transcendental-Function Computation RCA Rev. 30:20 247
                 (1969) / 233 \\
                 35: Walther J. S.: A Unified Algorithm for Elementary
                 Functions, Spring Joint Computer Conf., 1971, Proc.,
                 pp. 379--385 / 272 \\
                 36: Ramamoorthy, C. V., J. R. Goodman, and K. H. Kim:
                 Some Properties of Iterative Square-Rooting Methods
                 Using High-Speed Multiplication, IEEE Trans. Comput.
                 C-21: 837--847 (1972) / 279 \\
                 37: Ercegovac M. D.: Radix-16 Evaluation of Certain
                 Elementary Functions, IEEE Trans. Comput. C-22:561--566
                 (1973) / 290 \\
                 Part VII: Floating-Point Arithmetic \\
                 Editor's Comments on Papers 38 Through 42 / 298 \\
                 38: Hamming, R. W.: On the Distribution of Numbers,
                 Bell Syst. Tech. J. 49:1609--1625 (1970) / 300 \\
                 39: Sweeney D. W.: An Analysis of Floating-Point
                 Addition, IBM Syst. J. 4:31--42 (1965) / 317 \\
                 40: Anderson, S. F., J. G. Earler, R. E. Goldschmidt,
                 and D. M. Powers: The IBM System/360 Model 91:
                 Floating-Point Execution Unit, IBM J. Res. Dev.
                 11:34--53 (1967) / 329 \\
                 41: Gosling, J. B.: Design of Large High-Speed Floating
                 Point Arithmetic Units, IEE Proc. 118:493--498 (1971) /
                 349 \\
                 42: Kuck, D. J., D. S. Parker, Jr., and A. H. Sameh:
                 Analysis of Rounding Methods in Floating-Point
                 Arithmetic, IEEE Trans. Comput. C-26:643--650 (1977) /
                 355 \\
                 Bibliography / 363 \\
                 Author Citation Index / 373 \\
                 Subject Index / 377 \\
                 About the Editor / 379",
}

@Book{Swartzlander:1990:CAb,
  author =       "Earl E. {Swartzlander, Jr.}",
  booktitle =    "Computer Arithmetic",
  title =        "Computer Arithmetic",
  volume =       "2",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "ix + 396",
  year =         "1990",
  ISBN =         "0-8186-8945-5",
  ISBN-13 =      "978-0-8186-8945-1",
  LCCN =         "QA76.9 .C62C66 1990",
  bibdate =      "Wed Dec 15 10:43:03 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/c/cody-william-j.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/h/hamming-richard-w.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "This is part of a two-volume collection of influential
                 papers on the design of computer arithmetic. See also
                 \cite{Swartzlander:1990:CAa}.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Preface / v \\
                 Chapter 1: Overview / E. E. Swartzlander, Jr. / 1 \\
                 Chapter 2: Error Tolerant Arithmetic / 15 \\
                 Error Detecting and Error Correcting Codes / R. W.
                 Hamming (Bell System Technical Journal, 1950, Pages
                 147--160) / 16 \\
                 Generalized Parity Checking / H. L. Garner (IRE
                 Transactions on Electronic Computers, 1958, Pages
                 207--213) / 30 \\
                 Error Checking Logic for Arithmetic Type Operations of
                 a Processor / T. R. N. Rao (IEEE Transactions on
                 Computers, 1968, Pages 845--849) / 37 \\
                 Arithmetic Algorithms for Error-Coded Operands / A.
                 Avizienis (IEEE Transactions on Computers, 1973, Pages
                 567--572) / 42 \\
                 Error Detection and Correction for Addition and
                 Subtraction, through Use of Higher Radix Extensions of
                 Hamming Codes / J. E. Robertson (Proceedings 8th
                 Symposium on Computer Arithmetic, 1987, Pages 226--229)
                 / 48 \\
                 Chapter 3: On-Line Arithmetic / 53 \\
                 Signed-Digit Number Representations for Fast Parallel
                 Arithmetic / A. Avizienis (IRE Transactions on
                 Electronic Computers, 1961, Pages 389---400) / 54 \\
                 On-Line Arithmetic: A Design Methodology and
                 Applications in Digital Signal Processing / M. D.
                 Ercegovac and T. Lang (VLSI Signal Processing, III,
                 1988, Pages 252--263) / 66 \\
                 On-Line Algorithms for Division and Multiplication / K.
                 S. Trivedi and M. D. Ercegovac (IEEE Transactions on
                 Computers, 1977, Pages 681---687) / 78 \\
                 Error Analysis of Certain Floating-point On-Line
                 Algorithms / O. Watanuki and M. D. Ercegovac (IEEE
                 Transactions on Computers, 1983, Pages 352--358) / 85
                 \\
                 Improved Normalization Results for Digit On-Line
                 Arithmetic / R. J. Zaccone and J. L. Barlow
                 (Proceedings 7th Symposium on Computer Arithmetic,
                 1985, Pages 20--27) / 92 \\
                 Fully Digit On-Line Networks / M. J. Irwin and R. M.
                 Owens (IEEE Transactions on Computers, 1983, Pages
                 402---406) / 100 \\
                 On-Line Scheme for Computing Rotation Factors / M. D.
                 Ercegovac and T. Lang (Journal of Parallel and
                 Distributed Computing, 1988, Pages 209--227) / 104 \\
                 On-the-Fly Conversion of Redundant into Conventional
                 Representations / M. D. Ercegovac and T. Lang (IEEE
                 Transactions on Computers, 1987, Pages 895--897) / 123
                 \\
                 Chapter 4: VLSI Adder Implementations / 127 \\
                 Time-Component Complexity of Two Approaches to
                 Multioperand Binary Addition / D. E. Atkins and S. Ong
                 (IEEE Transactions on Computers, 1979, Pages 918--926)
                 / 128 \\
                 Some Optimal Schemes for ALU Implementation in VLSI
                 Technology / V. G. Oklobdzija and E. R. Barnes
                 (Proceedings7 th Symposium on Computer Arithmetic,
                 1985, Pages 2--8) / 137 \\
                 A Regular Layout for Parallel Adders / R. P. Brent and
                 H. T. Kung (IEEE Transactions on Computers, 1982, Pages
                 260--264) / 144 \\
                 An Area-Time Efficient NMOS Adder / M. A. Bayoumi, G.
                 A. Jullien, and W. C. Miller (Integration, the VLSI
                 Journal, 1983, Pages 317--334) / 148 \\
                 Regular, Area-Time Efficient Carry-Lookahead Adders /
                 T.-F. Ngai, M. J. Irwin, and S. Rawat (Journal of
                 Parallel and Distributed Computing, 1986, Pages
                 92--105) / 166 \\
                 Efficient Use of Time and Hardware Redundancy for
                 Concurrent Error Detection in a 32-Bit VLSI Adder / B.
                 W. Johnson, J. H. Aylor, and H. H. Hana (IEEE Journal
                 of Solid-State Circuits, 1988, Pages 208--215) / 180
                 \\
                 Chapter 5: VLSI Multiplier Implementations / 189 \\
                 A Monolithic $16 \times 16$ Digital Multiplier / G. W.
                 McIver, R. W. Miller, and T. G. O'Shaughnessy (IEEE
                 International Solid-State Circuits Conference Digest of
                 Technical Papers, 1974, Pages 231--233) / 190 \\
                 Optimization of One-Bit Full Adders Embedded in Regular
                 Structures / K. Iwano and K. Steiglitz (IEEE
                 Transactions on Acoustics, Speech, and Signal
                 Processing, 1986, Pages 1289--1300) / 193 \\
                 A VLSI Layout for a Pipelined Dadda Multiplier / P. R.
                 Cappello and K. Steiglitz (ACM Transactions on Computer
                 Systems, 1983, Pages 157--174) / 205 \\
                 A Very Fast Multiplication Algorithm for VLSI
                 Implementation / J. Vuillemin (Integration, the VLSI
                 Journal, 1983, Pages 39--52) / 223 \\
                 A High-Speed Multiplier Using a Redundant Binary Adder
                 Tree / Y. Harata, Y. Nakamura, H. Nagase, M. Takigawa,
                 and N. Takagi (IEEE Journal of Solid-State Circuits,
                 1987, Pages 28--34) / 237 \\
                 A Sub-10-ns $16 \times 16$ Multiplier Using 0.6-$\mu$m
                 CMOS Technology / Y. Oowaaki, K. Numata, K. Tsuchiya,
                 K. Tsuda, H. Takato, N. Takenouchi, A. Nitayama, T.
                 Kobayashi, M. Chiba, S. Watanabe, K. Ohuchi, and A.
                 Rojo (IEEE Journal of Solid-State Circuits, 1987, Pages
                 762--767) / 244 \\
                 Chapter 6: Floating Point VLSI Chips / 251 \\
                 A High Performance Floating Point Coprocessor / G.
                 Wolrich, E. McLellan, L. Harada, J. Montanaro, and R.
                 A. J. Yodlowski (IEEE Journal of Solid-State Circuits,
                 1984, Pages 690--696) / 252 \\
                 64-Bit Monolithic Floating Point Processors / F. A.
                 Ware, W. H. McAllister, J. R. Carlson, D. K. Sun, and
                 R. J. Vlach (IEEE Journal of Solid-State Circuits,
                 1982, Pages 898--907) / 259 \\
                 A CMOS Floating Point Multiplier / M. Uya, K. Kaneko,
                 and J. Yasui (IEEE Journal of Solid-State Circuits,
                 1984, Pages 697--702) / 269 \\
                 A Single-Chip 80-Bit Floating Point Processor / K.
                 Takeda, F. Ishino, Y. Ito, R. Kasai, and T. Nakashima
                 (IEEE Journal of Solid-State Circuits, 1985, Pages
                 986--992) / 275 \\
                 VLSI Floating-Point Processors / J. Fandrianto and B.
                 Y. Woo (Proceedings 7th Symposium on Computer
                 Arithmetic, 1985, Pages 93--100) / 282 \\
                 Fast Multiply and Divide for a VLSI Floating-Point Unit
                 / B. K. Bose, L. Pei, G. S. Taylor, and D. A. Patterson
                 (Proceedings 8th Symposium on Computer Arithmetic,
                 1987, Pages 87--94) / 290 \\
                 Chapter 7: Number Representation / 299 \\
                 A Formalization of Floating-Point Numeric Base
                 Conversion / D. W. Matula (IEEE Transactions on
                 Computers, 1970, Pages 681--692) / 300 \\
                 Analysis of Proposals for the Floating-Point Standard /
                 W. J. Cody (Computer, March 1987, Pages 63--68) / 312
                 \\
                 CADAC: A Controlled-Precision Decimal Arithmetic Unit /
                 M. S. Cohen, T. E. Hull, and V. C. Hamacher (IEEE
                 Transactions on Computers, 1983, Pages 370--377) / 317
                 \\
                 Finite Precision Rational Arithmetic: Slash Number
                 Systems / D. W. Matula and P. Kornerup (IEEE
                 Transactions on Computers, 1985, Pages 3--18) / 325 \\
                 Finite Precision Lexicographic Continued Fraction
                 Number Systerns / P. Kornerup and D. W. Matula
                 (Proceedings 7th Symposium on Computer Arithmetic,
                 1985, Pages 207--214) / 341 \\
                 An Overflow\slash Underflow Free Floating Point
                 Representation of Numbers / S. Matsui and M. lri
                 (Journal of Information Processing, 1981, Pages
                 123--133) / 349 \\
                 A Closed Computer Arithmetic / F. W. J. Olver
                 (Proceedings 8th Symposium on Computer Arithmetic,
                 1987, Pages 139--143) / 360 \\
                 Bibliography / 365 \\
                 Index / 393 \\
                 About the Editor / 397",
}

@Book{Taub:1963:JNCa,
  editor =       "A. H. Taub",
  booktitle =    "{John von Neumann}: Collected Works. {Volume V}:
                 {Design} of Computers, Theory of Automata and Numerical
                 Analysis",
  title =        "{John von Neumann}: Collected Works. {Volume V}:
                 {Design} of Computers, Theory of Automata and Numerical
                 Analysis",
  publisher =    pub-PERGAMON,
  address =      pub-PERGAMON:adr,
  pages =        "ix + 784",
  year =         "1963",
  LCCN =         "????",
  bibdate =      "Wed Jun 01 16:58:29 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See also volumes I--IV, VI
                 \cite{Taub:1961:JNCa,Taub:1961:JNCb,Taub:1961:JNCc,Taub:1962:JNC,Taub:1963:JNCb}.",
  ZMnumber =     "0188.00102",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

@Book{Weart:1985:HP,
  editor =       "Spencer R. Weart and Melba Phillips",
  booktitle =    "History of physics",
  title =        "History of physics",
  volume =       "2",
  publisher =    pub-AIP,
  address =      pub-AIP:adr,
  pages =        "375",
  year =         "1985",
  ISBN =         "0-88318-468-0 (paperback)",
  ISBN-13 =      "978-0-88318-468-4 (paperback)",
  LCCN =         "QC7 .H694 1985",
  bibdate =      "Tue Sep 4 18:34:44 MDT 2012",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/bohr-niels.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/f/fermi-enrico.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/g/gamow-george.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/h/heisenberg-werner.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/o/oppenheimer-j-robert.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/schroedinger-erwin.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/s/slater-john-clarke.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/s/szilard-leo.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Readings from \booktitle{Physics Today}",
  acknowledgement = ack-nhfb,
  subject =      "Physics; History; Sources",
  tableofcontents = "1 / CHAPTER 1: BEFORE OUR TIMES \\
                 2 / The prehistory of solid-state physics / Cyril
                 Stanley Smith \\
                 12 / Franklin's Physics / John L. Heilbron \\
                 18 / A sketch for a history of early thermodynamics /
                 E. Mendoza \\
                 25 / A sketch for a history of the kinetic theory of
                 gases / E. Mendoza \\
                 29 / Rowland's physics / John D. Miller \\
                 36 / Michelson and his interferometer / Robert S.
                 Shankland \\
                 42 / Poincare and cosmic evolution / Stephen G. Brush
                 \\
                 50 / Steps toward the Hertzsprung--Russell Diagram //
                 David H. DeVorkin \\
                 59 / CHAPTER 2: INSTITUTIONS OF PHYSICS \\
                 61 / The roots of solid-state research at Bell Labs /
                 Lillian Hartmann Hoddeson \\
                 68 / Some personal experiences in the international
                 coordination of crystal diffractometry / P. P. Ewald
                 \\
                 74 / The founding of the American Institute of Physics
                 / Karl T. Compton \\
                 78 / The first fifty years of the AAPT / Melba Phillips
                 \\
                 86 / The giant cancer tube and the Kellogg Radiation
                 Laboratory / Charles H. Holbrow \\
                 94 / The evolution of the Office of Naval Research /
                 The Bird Dogs \\
                 101 / CHAPTER 3: SOCIAL CONTEXT \\
                 103 / Nagaoka to Rutherford, 22 February 1911 /
                 Lawrence Badash \\
                 108 / American physics and the origins of electrical
                 engineering / Robert Rosenberg \\
                 115 / Physics in the Great Depression / Charles Weiner
                 \\
                 123 / Scientists with a secret / Spencer R. Weart \\
                 130 / Some thoughts on science in the Federal
                 government / Edward U. Condon \\
                 138 / Fifty years of physics education / A. P. French
                 \\
                 149 / Women in physics: unnecessary, injurious and out
                 of place? / Vera Kistiakowsky \\
                 159 / The last fifty years --- A revolution? / Spencer
                 R. Weart \\
                 171 / CHAPTER 4: BIOGRAPHY \\
                 173 / The two Ernests / Mark L. Oliphant \\
                 194 / Van Vleck and magnetism / Philip W. Anderson \\
                 198 / Alfred Lee Loomis --- last great amateur of
                 science / Luis W. Alvarez \\
                 208 / Harold Urey and the discovery of deuterium /
                 Ferdinand G. Brickwedde \\
                 214 / Pyotr Kapitza, octogenarian dissident / Grace
                 Marmor Spruch \\
                 221 / The young Oppenheimer: Letters and recollections
                 / Alice Kimball Smith and Charles Weiner \\
                 228 / Maria Goeppert Mayer --- two-fold pioneer /
                 Robert G. Sachs \\
                 234 / Philip Morrison --- A profile / Anne Eisenberg
                 \\
                 241 / CHAPTER 5: PERSONAL ACCOUNTS \\
                 243 / How I created the theory of relativity / Albert
                 Einstein \\
                 246 / It might as well be spin / Samuel A. Goudsmit and
                 George E. Uhlenbeck \\
                 255 / History of the cyclotron. Part I / M. Stanley
                 Livingston \\
                 261 / History of the cyclotron. Part II / Edwin M.
                 McMillan \\
                 272 / The discovery of fission / Otto R. Frisch and
                 John A. Wheeler \\
                 282 / Physics at Columbia University / Enrico Fermi \\
                 287 / CHAPTER 6: PARTICLES AND QUANTA \\
                 289 / J. J. Thomson and the discovery of the electron /
                 George P. Thomson \\
                 294 / Thermodynamics and quanta in Planck's work /
                 Martin J. Klein \\
                 303 / J. J. Thomson and the Bohr atom / John L.
                 Heilbron \\
                 310 / Sixty years of quantum physics / Edward U. Condon
                 \\
                 319 / Heisenberg and the early days of quantum
                 mechanics / Felix Bloch \\
                 324 / Electron diffraction: Fifty years ago / Richard
                 K. Gehrenbeck \\
                 332 / 1932 --- Moving into the new physics / Charles
                 Weiner \\
                 340 / The idea of the neutrino / Laurie M. Brown \\ \\
                 346 / The birth of elementary-particle physics / Laurie
                 M. Brown and Lillian Hartmann Hoddeson \\
                 354 / The discovery of electron tunneling into
                 superconductors / Roland W. Schmitt \\
                 358 / The development of field theory in the last fifty
                 years / Victor F. Weisskopf",
}

@Book{Wilkinson:1965:AEP,
  author =       "J. H. Wilkinson",
  booktitle =    "The Algebraic Eigenvalue Problem",
  title =        "The Algebraic Eigenvalue Problem",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  pages =        "xviii + 662",
  year =         "1965",
  ISBN =         "0-19-853403-5",
  ISBN-13 =      "978-0-19-853403-7",
  LCCN =         "QA218 .W686 1965",
  MRclass =      "65.40",
  MRnumber =     "MR0184422 (32 \#1894)",
  MRreviewer =   "A. S. Householder",
  bibdate =      "Tue Aug 15 18:20:34 MDT 1995",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/l/lanczos-cornelius.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/w/wilkinson-james-hardy.bib;
                 https://www.math.utah.edu/pub/tex/bib/cordic.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  shorttableofcontents = "1. Theoretical Background \\
                 2. Perturbation Theory \\
                 3. Error Analysis \\
                 4. Solution of Linear Algebraic Equations \\
                 5. Hermitian Matrices \\
                 6. Reduction of a General Matrix to Condensed Form \\
                 7. Eigenvalues of Matrices of Condensed Forms \\
                 8. The $ L R $ and $ Q R $ Algorithms \\
                 9. Iterative Methods \\
                 Bibliography / 649 \\
                 Index / 657",
  tableofcontents = "1. Theoretical Background \\
                 Introduction / 1 \\
                 Definitions / 2 \\
                 Eigenvalues and eigenvectors of the transposed matrix /
                 3 \\
                 Distinct eigenvalues / 4 \\
                 Similarity transformations / 6 \\
                 Multiple eigenvalues and canonical forms for general
                 matrices / 7 \\
                 Defective system of eigenvectors / 9 \\
                 The Jordan (classical) canonical form / 10 \\
                 The elementary divisors / 12 \\
                 Companion matrix of the characteristic polynomial of
                 $A$ / 12 \\
                 Non-derogatory matrices / 13 \\
                 The Frobenius (rational) canonical form / 15 \\
                 Relationship between the Jordan and Frobenius canonical
                 forms / 16 \\
                 Equivalence transformations / 17 \\
                 Lambda matrices / 18 \\
                 Elementary operations / 19 \\
                 Smith's canonical form / 19 \\
                 The highest common factor of $k$-rowed minors of a
                 $A$-matrix / 22 \\
                 Invariant factors of $ (A - \lambda M) $ / 22 \\
                 The triangular canonical form / 24 \\
                 Hermitian and symmetric matrices / 24 \\
                 Elementary properties of Hermitian matrices / 25 \\
                 Complex symmetric matrices / 26 \\
                 Reduction to triangular form by unitary transformations
                 / 27 \\
                 Quadratic forms / 27 \\
                 Necessary and sufficient conditions for positive
                 definiteness / 28 \\
                 Differential equations with constant coefficients / 30
                 \\
                 Solutions corresponding to non-linear elementary
                 divisors / 31 \\
                 Differential equations of higher order / 32 \\
                 Second-order equations of special form / 34 \\
                 Explicit solution of $ B \ddot{y} = -A y$ / 35 \\
                 Equations of the form $(AB - \lambda I) x = 0$ / 35 \\
                 The minimum polynomial of a vector / 36 \\
                 The minimum polynomial of a matrix / 37 \\
                 Cayley--Hamilton theorem / 38 \\
                 Relation between minimum polynomial and canonical forms
                 / 39 \\
                 Principal vectors / 42 \\
                 Elementary similarity transformations / 43 \\
                 Properties of elementary matrices / 45 \\
                 Reduction to triangular canonical form by elementary
                 similarity transformations / 46 \\
                 Elementary unitary transformations / 47 \\
                 Elementary unitary Hermitian matrices / 48 \\
                 Reduction to triangular form by elementary unitary
                 transformations / 50 \\
                 Normal matrices / 51 \\
                 Commuting matrices / 52 \\
                 Eigenvalues of $A B$ / 54 \\
                 Vector and matrix norms / 55 \\
                 Subordinate matrix norms / 56 \\
                 The Euclidean and spectral norms / 57 \\
                 Norms and limits / 58 \\
                 Avoiding use of infinite matrix series / 60 \\
                 2. Perturbation Theory \\
                 Introduction / 62 \\
                 Ostrowski's theorem on continuity of the eigenvalues /
                 63 \\
                 Algebraic functions / 64 \\
                 Numerical examples / 65 \\
                 Perturbation theory for simple eigenvalues / 66 \\
                 Perturbation of corresponding eigenvectors / 67 \\
                 Matrix with linear elementary divisors / 68 \\
                 First-order perturbations of eigenvalues / 68 \\
                 First-order perturbations of eigenvectors / 69 \\
                 Higher-order perturbations / 70 \\
                 Multiple eigenvalues / 70 \\
                 Gerschgorin's theorems / 71 \\
                 Perturbation theory based on Gerschgorin's theorems /
                 72 \\
                 Case 1. Perturbation of a simple eigenvalue $\lambda_1$
                 of a matrix having linear elementary divisors / 72 \\
                 Case 2. Perturbation of a multiple eigenvalue
                 $\lambda_1$ of a matrix having linear elementary
                 divisors / 75 \\
                 Case 3. Perturbation of a simple eigenvalue of a matrix
                 having one or more non-linear elementary divisors / 77
                 \\
                 Case 4. Perturbations of the eigenvalues corresponding
                 to a non-linear elementary divisor of a non-derogatory
                 matrix / 79 \\
                 Case 5. Perturbations of eigenvalues $\lambda_i$ when
                 there is more than one divisor involving $(\lambda_i -
                 \lambda_)$ and at least one of them is non-linear / 80
                 \\
                 Perturbations corresponding to the general distribution
                 of non-linear divisors / 81 \\
                 Perturbation theory for the eigenvectors from Jordan
                 canonical form / 81 \\
                 Perturbations of eigenvectors corresponding to a
                 multiple eigenvalue (linear elementary divisors) / 83
                 \\
                 Limitations of perturbation theory / 84 \\
                 Relationships between the $s_i$ / 85 \\
                 The condition of a computing problem / 86 \\
                 Condition numbers / 86 \\
                 Spectral condition number of A with respect to its
                 eigenproblem / 87 \\
                 Properties of spectral condition number / 88 \\
                 Invariant properties of condition numbers / 89 \\
                 Very ill-conditioned matrices / 90 \\
                 Perturbation theory for real symmetric matrices / 93
                 \\
                 Unsymmetric perturbations / 93 \\
                 Symmetric perturbations / 94 \\
                 Classical techniques / 94 \\
                 Symmetric matrix of rank unity / 97 \\
                 Extremal properties of eigenvalues / 98 \\
                 Minimax characterization of eigenvalues / 99 \\
                 Eigenvalues of the sum of two symmetric matrices / 101
                 \\
                 Practical applications / 102 \\
                 Further applications of minimax principle / 103 \\
                 Separation theorem / 103 \\
                 The Wielandt--Hoffman theorem / 104 \\
                 3. Error Analysis \\
                 Introduction / 110 \\
                 Fixed-point operations / 110 \\
                 Accumulation of inner-products / 111 \\
                 Floating-point operations / 112 \\
                 Simplified expressions for error bounds / 113 \\
                 Error bounds for some basic floating-point computations
                 / 114 \\
                 Bounds for norms of the error matrices / 115 \\
                 Accumulation of inner-products in floating-point
                 arithmetic / 116 \\
                 Error bounds for some basic $\fl_2( )$ computations /
                 117 \\
                 Computation of square roots / 118 \\
                 Block-floating vectors and matrices / 119 \\
                 Fundamental limitations oft-digit computation / 120 \\
                 Eigenvalue techniques based on reduction by similarity
                 transformations / 123 \\
                 Error analysis of methods based on elementary
                 non-unitary transformations / 124 \\
                 Error analysis of methods based on elementary unitary
                 transformations / 126 \\
                 Superiority of the unitary transformation / 128 \\
                 Real symmetric matrices / 129 \\
                 Limitations of unitary transformations / 129 \\
                 Error analysis of floating-point computation of plane
                 rotations / 131 \\
                 Multiplication by a plane rotation / 133 \\
                 Multiplication by a sequence of plane rotations / 134
                 \\
                 Error in product of approximate plane rotations / 139
                 \\
                 Errors in similarity transforms / 140 \\
                 Symmetric matrices / 141 \\
                 Plane rotations in fixed-point arithmetic / 143 \\
                 Alternative computation of $\sin \theta$ and $\cos
                 \theta$ / 145 \\
                 Pre-multiplication by an approximate fixed-point
                 rotation / 145 \\
                 Multiplication by a sequence of plane rotations
                 (fixed-point) / 147 \\
                 The computed product of an approximate set of plane
                 rotations / 148 \\
                 Errors in similarity transformations / 148 \\
                 General comments on the error bounds / 151 \\
                 Elementary Hermitian matrices in floating-point / 152
                 \\
                 Error analysis of the computation of an elementary
                 Hermitian matrix / 153 \\
                 Numerical example / 156 \\
                 Pre-multiplication by an approximate elementary
                 Hermitian matrix / 157 \\
                 Multiplication by a sequence of approximate elementary
                 Hermitians / 160 \\
                 Non-unitary elementary matrices analogous to plane
                 rotations / 162 \\
                 Non-unitary elementary matrices analogous to elementary
                 Hermitian matrices / 163 \\
                 Pre-multiplication by a sequence of non-unitary
                 matrices / 165 \\
                 A priori error bounds / 166 \\
                 Departure from normality / 167 \\
                 Simple examples / 169 \\
                 A posteriori bounds / 170 \\
                 A posteriori bounds for normal matrices / 170 \\
                 Rayleigh quotient / 172 \\
                 Error in Rayleigh quotient / 173 \\
                 Hermitian matrices / 174 \\
                 Pathologically close eigenvalues / 176 \\
                 Non-normal matrices / 178 \\
                 Error analysis for a complete eigensystem / 180 \\
                 Numerical example / 181 \\
                 Conditions limiting attainable accuracy / 181 \\
                 Non-linear elementary, divisors / 182 \\
                 Approximate invariant subspaces / 184 \\
                 Almost normal matrices / 187 \\
                 4. Solution of Linear Algebraic Equations \\
                 Introduction / 189 \\
                 Perturbation theory / 189 \\
                 Condition numbers / 191 \\
                 Equilibrated matrices / 192 \\
                 Simple practical examples / 193 \\
                 Condition of matrix of eigenvectors / 193 \\
                 Explicit solution / 194 \\
                 General comments on condition of matrices / 195 \\
                 Relation of ill-conditioning to near-singularity / 196
                 \\
                 Limitations imposed by t-digit arithmetic / 197 \\
                 Algorithms for solving linear equations / 198 \\
                 Gaussian elimination / 200 \\
                 Triangular decomposition / 201 \\
                 Structure of triangular decomposition matrices / 201
                 \\
                 Explicit expressions for elements of the triangles /
                 202 \\
                 Breakdown of Gaussian elimination / 204 \\
                 Numerical stability / 205 \\
                 Significance of the interchanges / 206 \\
                 Numerical example / 207 \\
                 Error analysis of Gaussian elimination / 209 \\
                 Upper bounds for the perturbation matrices using
                 fixed-point arithmetic / 211 \\
                 Upper bound for elements of reduced matrices / 212 \\
                 Complete pivoting / 212 \\
                 Practical procedure with partial pivoting / 214 \\
                 Floating-point error analysis / 214 \\
                 Floating-point decomposition without pivoting / 215 \\
                 Loss of significant figures / 217 \\
                 A popular fallacy / 217 \\
                 Matrices of special form / 218 \\
                 Gaussian elimination on a high-speed computer / 220 \\
                 Solutions corresponding to different right-hand sides /
                 221 \\
                 Direct triangular decomposition / 221 \\
                 Relations between Gaussian elimination and direct
                 triangular decomposition / 223 \\
                 Examples of failure and non-uniqueness of decomposition
                 / 224 \\
                 Triangular decomposition with row interchanges / 225
                 \\
                 Error analysis of triangular decomposition / 227 \\
                 Evaluation of determinants / 228 \\
                 Cholesky decomposition / 229 \\
                 Symmetric matrices which are not positive definite /
                 230 \\
                 Error analysis of Cholesky decomposition in fixed-point
                 arithmetic / 231 \\
                 An ill-conditioned matrix / 233 \\
                 Triangularization using elementary Hermitian matrices /
                 233 \\
                 Error analysis of Householder triangularization / 236
                 \\
                 Triangularization by elementary stabilized matrices of
                 the type M1, / 236 \\
                 Evaluation of determinants of leading principal minors
                 / 237 \\
                 Triangularization by plane rotations / 239 \\
                 Error analysis of Givens reduction / 240 \\
                 Uniqueness of orthogonal triangularization / 241 \\
                 Schmidt orthogonalization / 242 \\
                 Comparison of the methods of triangularization / 244
                 \\
                 Back-substitution / 247 \\
                 High accuracy of computed solutions of triangular sets
                 of equations / 249 \\
                 Solution of a general set of equations / 251 \\
                 Computation of the inverse of a general matrix / 252
                 \\
                 Accuracy of computed solutions / 253 \\
                 Ill-conditioned matrices which give no small pivots /
                 254 \\
                 Iterative improvements of approximate solution / 255
                 \\
                 Effect of rounding errors on the iterative process /
                 256 \\
                 The iterative procedure in fixed-point computation /
                 257 \\
                 Simple example of iterative procedure / 258 \\
                 General comments on the iterative procedure / 260 \\
                 Related iterative procedures / 261 \\
                 Limitations of the iterative procedure / 261 \\
                 Rigorous justification of the iterative method / 262
                 \\
                 5. Hermitian Matrices \\
                 Introduction / 265 \\
                 The classical Jacobi method for real symmetric matrices
                 / 266 \\
                 Rate of convergence / 267 \\
                 Convergence to fixed diagonal matrix / 268 \\
                 Serial Jacobi method / 269 \\
                 The Gerschgorin discs / 269 \\
                 Ultimate quadratic convergence of Jacobi methods / 270
                 \\
                 Close and multiple eigenvalues / 271 \\
                 Numerical examples / 273 \\
                 Calculation of cos 8 and sin B / 274 \\
                 Simpler determination of the angles of rotation / 276
                 \\
                 The threshold Jacobi method / 277 \\
                 Calculation of the eigenvectors / 278 \\
                 Numerical example / 279 \\
                 Error analysis of the Jacobi method / 279 \\
                 Accuracy of the computed eigenvectors / 280 \\
                 Error bounds for fixed-point computation / 281 \\
                 Organizational problems / 282 \\
                 Givens' method / 282 \\
                 Givens' process on a computer with a two-level store /
                 284 \\
                 Floating-point error analysis of Givens' process / 286
                 \\
                 Fixed-point error analysis / 287 \\
                 Numerical example / 288 \\
                 Householder's method / 290 \\
                 Taking advantage of symmetry / 292 \\
                 Storage considerations / 293 \\
                 Householder's process on a computer with a two-level
                 store / 294 \\
                 Householder's method in fixed-point arithmetic / 294
                 \\
                 Numerical example / 296 \\
                 Error analyses of Householder's method / 297 \\
                 Eigenvalues of a symmetric tri-diagonal matrix / 299
                 \\
                 Sturm sequence property / 300 \\
                 Method of bisection / 302 \\
                 Numerical stability of the bisection method / 302 \\
                 Numerical example / 305 \\
                 General comments on the bisection method / 306 \\
                 Small eigenvalues / 307 \\
                 Close eigenvalues and small $\beta_i$ / 308 \\
                 Fixed-point computation of the eigenvalues / 312 \\
                 Computation of the eigenvectors of a tri-diagonal form
                 / 315 \\
                 Instability of the explicit expression for the
                 eigenvector / 316 \\
                 Numerical examples / 319 \\
                 Inverse iteration / 321 \\
                 Choice of initial vector $b$ / 322 \\
                 Error analysis / 323 \\
                 Numerical example / 325 \\
                 Close eigenvalues and small $\beta_i$ / 327 \\
                 Independent vectors corresponding to coincident
                 eigenvalues / 328 \\
                 Alternative method for computing the eigenvectors / 330
                 \\
                 Numerical example / 331 \\
                 Comments on the eigenproblem for tri-diagonal matrices
                 / 332 \\
                 Completion of the Givens and Householder methods / 333
                 \\
                 Comparison of methods / 334 \\
                 Quasi-symmetric tri-diagonal matrices / 335 \\
                 Calculation of the eigenvectors / 336 \\
                 Equations of the form $A x = \lambda B x$ and $A B x =
                 \lambda X $ / 337 \\
                 Numerical example / 339 \\
                 Simultaneous reduction of $A$ and $B$ to diagonal form
                 / 340 \\
                 Tri-diagonal $A$ and $B$ / 340 \\
                 Complex Hermitian matrices / 342 \\
                 6. Reduction of a General Matrix to Condensed Form \\
                 Introduction / 345 \\
                 Givens' method / 345 \\
                 Householder's method / 347 \\
                 Storage considerations / 350 \\
                 Error analysis / 350 \\
                 Relationship between the Givens and Householder methods
                 / 351 \\
                 Elementary stabilized transformations / 353 \\
                 Significance of the permutations / 355 \\
                 Direct reduction to Hessenberg form / 357 \\
                 Incorporation of interchanges / 359 \\
                 Numerical example / 360 \\
                 Error analysis / 363 \\
                 Related error analyses / 365 \\
                 Poor determination of the Hessenberg matrix / 368 \\
                 Reduction to Hessenberg form using stabilized matrices
                 of the type $ M^'_{ji} $ / 368 \\
                 The method of Krylov / 369 \\
                 Gaussian elimination by columns / 370 \\
                 Practical difficulties / 371 \\
                 Condition of O for some standard distributions of
                 eigenvalues / 372 \\
                 Initial vectors of grade less than n / 374 \\
                 Practical experience / 376 \\
                 Generalized Hessenberg processes / 377 \\
                 Failure of the generalized Hessenberg process / 378 \\
                 The Hessenberg method / 379 \\
                 Practical procedure / 380 \\
                 Relation between the Hessenberg method and earlier
                 methods / 381 \\
                 The method of Arnoldi / 382 \\
                 Practical considerations / 383 \\
                 Significance of re-orthogonalization / 385 \\
                 The method of Lanczos / 388 \\
                 Failure of procedure / 389 \\
                 Numerical example / 390 \\
                 The practical Lanczos process / 391 \\
                 Numerical example / 392 \\
                 General comments on the unsymmetric Lanczos process /
                 394 \\
                 The symmetric Lanczos process / 394 \\
                 Reduction of a Hessenberg matrix to a more compact form
                 / 395 \\
                 Reduction of a lower Hessenberg matrix to tri-diagonal
                 form / 396 \\
                 The use of interchanges / 397 \\
                 Effect of a small pivotal element / 398 \\
                 Error analysis / 399 \\
                 The Hessenberg process applied to a lower Hessenberg
                 matrix / 402 \\
                 Relationship between the Hessenberg process and the
                 Lanczos process / 402 \\
                 Reduction of a general matrix to tri-diagonal form /
                 403 \\
                 Comparison with Lanczos method / 404 \\
                 Re-examination of reduction to tri-diagonal form / 404
                 \\
                 Reduction from upper Hessenberg form to Frobenius form
                 / 405 \\
                 Effect of small pivot / 407 \\
                 Numerical example / 408 \\
                 General comments on the stability / 408 \\
                 Specialized upper Hessenberg form / 409 \\
                 Direct determination of the characteristic polynomial /
                 410 \\
                 7. Eigenvalues of Matrices of Condensed Forms \\
                 Introduction / 413 \\
                 Explicit polynomial form / 413 \\
                 Condition numbers of explicit polynomials / 416 \\
                 Some typical distributions of zeros / 417 \\
                 Final assessment of Krylov's method / 421 \\
                 General comments on explicit polynomials / 421 \\
                 Tri-diagonal matrices / 423 \\
                 Determinants of Hessenberg matrices / 426 \\
                 Effect of rounding errors / 427 \\
                 Floating-point accumulation / 428 \\
                 Evaluation by orthogonal transformations / 429 \\
                 Evaluation of determinants of general matrices / 431
                 \\
                 The generalized eigenvalue problem / 432 \\
                 Indirect determinations of the characteristic
                 polynomial / 432 \\
                 Le Verrier's method / 434 \\
                 Iterative methods based on interpolation / 435 \\
                 Asymptotic rate of convergence / 436 \\
                 Multiple zeros / 437 \\
                 Inversion of the functional relationship / 439 \\
                 The method of bisection / 440 \\
                 Newton's method / 441 \\
                 Comparison of Newton's method with interpolation / 442
                 \\
                 Methods giving cubic convergence / 443 \\
                 Laguerre's method / 443 \\
                 Complex zeros / 446 \\
                 Complex conjugate zeros / 447 \\
                 Bairstow's method / 449 \\
                 The generalized Bairstow method / 450 \\
                 Practical considerations / 452 \\
                 Effect of rounding errors on asymptotic convergence /
                 453 \\
                 The method of bisection / 453 \\
                 Successive linear interpolation / 455 \\
                 Multiple and pathologically close eigenvalues / 457 \\
                 Other interpolation methods / 458 \\
                 Methods involving the use of a derivative / 459 \\
                 Criterion for acceptance of a zero / 461 \\
                 Effect of rounding errors / 462 \\
                 Suppression of computed zeros / 464 \\
                 Deflation for Hessenberg matrices / 465 \\
                 Deflation of tri-diagonal matrices / 468 \\
                 Deflation by rotations or stabilized elementary
                 transformations / 469 \\
                 Stability of the deflation / 472 \\
                 General comments on deflation / 474 \\
                 Suppression of computed zeros / 474 \\
                 Suppression of computed quadratic factors / 475 \\
                 General comments on the methods of suppression / 476
                 \\
                 Asymptotic rates of convergence / 478 \\
                 Convergence in the large / 478 \\
                 Complex zeros / 481 \\
                 Recommendations / 482 \\
                 Complex matrices / 483 \\
                 Matrices containing an independent parameter / 483 \\
                 8. The $ L R $ and $ Q R $ Algorithms \\
                 Introduction / 485 \\
                 Real matrices with complex eigenvalues / 486 \\
                 The $ L R $ algorithm / 487 \\
                 Proof of the convergence of the $A_s$ / 489 \\
                 Positive definite Hermitian matrices / 493 \\
                 Complex conjugate eigenvalues / 494 \\
                 Introduction of interchanges / 498 \\
                 Numerical example / 499 \\
                 Convergence of the modified process / 501 \\
                 Preliminary reduction of original matrix / 501 \\
                 Invariance of upper Hessenberg form / 502 \\
                 Simultaneous row and column operations / 504 \\
                 Acceleration of convergence / 505 \\
                 Incorporation of shifts of origin / 506 \\
                 Choice of shift of origin / 507 \\
                 Deflation of the matrix / 509 \\
                 Practical experience of convergence / 510 \\
                 Improved shift strategy / 511 \\
                 Complex conjugate eigenvalues / 512 \\
                 Criticisms of the modified $ L R $ algorithm. / 515 \\
                 The $ Q R $ algorithm / 515 \\
                 Convergence of the $ Q R $ algorithm / 516 \\
                 Formal proof of convergence / 517 \\
                 Disorder of the eigenvalues / 519 \\
                 Eigenvalues of equal modulus / 520 \\
                 Alternative proof for the $ L R $ technique / 521 \\
                 Practical application of the $ Q R $ algorithm / 523
                 \\
                 Shifts of origin / 524 \\
                 Decomposition of A8 / 525 \\
                 Numerical example / 527 \\
                 Practical procedure / 527 \\
                 Avoiding complex conjugate shifts / 528 \\
                 Double $ Q R $ step using elementary Hermitians / 532
                 \\
                 Computational details / 534 \\
                 Decomposition of A8 / 535 \\
                 Double-shift technique for $ L R $ / 537 \\
                 Assessment of $ L R $ and $ Q R $ algorithms / 538 \\
                 Multiple eigenvalues / 540 \\
                 Special use of the deflation process / 543 \\
                 Symmetric matrices / 544 \\
                 Relationship between $ L R $ and $ Q R $ algorithms /
                 545 \\
                 Convergence of the Cholesky $ L R $ algorithm / 546 \\
                 Cubic convergence of the $ Q R $ algorithm / 548 \\
                 Shift of origin in Cholesky $ L R $ / 549 \\
                 Failure of the Cholesky decomposition / 550 \\
                 Cubically convergent $ L R $ process / 551 \\
                 Band matrices / 553 \\
                 $ Q R $ decomposition of a band matrix / 557 \\
                 Error analysis / 561 \\
                 Unsymmetric band matrices / 562 \\
                 Simultaneous decomposition and recombination in $ Q R $
                 algorithm / 565 \\
                 Reduction of band width / 567 \\
                 9. ITERATIVE METHODS \\
                 Introduction / 570 \\
                 The power method / 570 \\
                 Direct iteration with a single vector / 571 \\
                 Shift of origin / 572 \\
                 Effect of rounding errors / 573 \\
                 Variation of $p$ / 576 \\
                 {\em Ad hoc\/} choice of $p$ / 577 \\
                 Aitken's acceleration technique / 578 \\
                 Complex conjugate eigenvalues / 579 \\
                 Calculation of the complex eigenvector / 581 \\
                 Shift of origin / 582 \\
                 Non-linear divisors / 582 \\
                 Simultaneous determination of several eigenvalues / 583
                 \\
                 Complex matrices / 584 \\
                 Deflation / 584 \\
                 Deflation based on similarity transformations / 585 \\
                 Deflation using invariant subspaces / 587 \\
                 Deflation using stabilized elementary transformations /
                 587 \\
                 Deflation using unitary transformations / 589 \\
                 Numerical stability / 590 \\
                 Numerical example / 592 \\
                 Stability of unitary transformations / 594 \\
                 Deflation by non-similarity transformations / 596 \\
                 General reduction using invariant subspaces / 599 \\
                 Practical application / 601 \\
                 Treppen-iteration / 602 \\
                 Accurate determination of complex conjugate eigenvalues
                 / 604 \\
                 Very close eigenvalues / 606 \\
                 Orthogonalization techniques / 606 \\
                 Analogue of treppen-iteration using orthogonalization /
                 607 \\
                 Bi-iteration / 609 \\
                 Numerical example / 610 \\
                 Richardson's purification process / 614 \\
                 Matrix squaring / 615 \\
                 Numerical stability / 616 \\
                 Use of Chebyshev polynomials / 617 \\
                 General assessment of methods based on direct iteration
                 / 618 \\
                 Inverse iteration / 619 \\
                 Error analysis of inverse iteration / 620 \\
                 General comments on the analysis / 621 \\
                 Further refinement of eigenvectors / 622 \\
                 Non-linear elementary divisors / 626 \\
                 Inverse iteration with Hessenberg matrices / 626 \\
                 Degenerate cases / 627 \\
                 Inverse iteration with band matrices / 628 \\
                 Complex conjugate eigenvectors / 629 \\
                 Error analysis / 631 \\
                 Numerical example / 633 \\
                 The generalized eigenvalue problem / 633 \\
                 Variation of approximate eigenvalues / 635 \\
                 Refinement of eigensystems / 637 \\
                 Numerical example / 639 \\
                 Refinement of the eigenvectors / 641 \\
                 Complex conjugate eigenvalues / 643 \\
                 Coincident and pathologically close eigenvalues / 644
                 \\
                 Comments on the ACE programmes / 646 \\
                 Bibliography / 649 \\
                 Index / 657",
}

@Book{Wilkinson:1971:LA,
  editor =       "James H. Wilkinson and Christian Reinsch",
  booktitle =    "Linear Algebra",
  title =        "Linear Algebra",
  volume =       "II",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "viii + 439",
  year =         "1971",
  ISBN =         "0-387-05414-6, 3-540-05414-6",
  ISBN-13 =      "978-0-387-05414-8, 978-3-540-05414-6",
  LCCN =         "QA251 .W67",
  bibdate =      "Wed Dec 15 18:44:50 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/h/householder-alston-s.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/p/parlett-beresford-n.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/w/wilkinson-james-hardy.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/gnu.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/nummath.bib",
  series =       "Handbook for Automatic Computation, Editors: {F. L.
                 Bauer, A. S. Householder, F. W. J. Olver, H.
                 Rutishauser, K. Samelson and E. Stiefel}",
  acknowledgement = ack-nhfb,
  author-dates = "Christian H. Reinsch (?? ?? 1932--8 October 2022);
                 James H. Wilkinson (27 September 1919--5 October
                 1986)",
  tableofcontents = "Part I: Linear systems, least squares and linear
                 programming \\
                 J. H. Wilkinson / Introduction to Part I / 1--8 \\
                 1. Introduction \\
                 2. List of procedures \\
                 3. Positive definite symmetric matrices \\
                 4. Non-positive definite symmetric matrices \\
                 5. Non-Hermitian matrices \\
                 6. Least squares and related problems \\
                 7. The linear programming problem \\
                 R. S. Martin, G. Peters and J. H. Wilkinson / Symmetric
                 decomposition of a positive definite matrix / 9--30 \\
                 Martin, Peters and Wilkinson / Iterative refinement of
                 the solution of a positive definite system of equations
                 / 31--44 \\
                 F. L. Bauer and C. Reinsch / Inversion of positive
                 definite matrices by the Gauss-Jordan method / 45--49
                 \\
                 Martin and Wilkinson / Symmetric decomposition of
                 positive definite band matrices / 50--56 \\
                 T. Ginsburg / The conjugate gradient method / 57--69
                 \\
                 Martin and Wilkinson / Solution of symmetric and
                 unsymmetric band equations and the calculation of
                 eigenvectors of band matrices / 70--92 \\
                 H. J. Bowdler, Martin, Peters and Wilkinson / Solution
                 of real and complex systems of linear equations /
                 93--110 \\
                 P. Businger and G. H. Golub / Linear least squares
                 solutions by Householder transformations / 111--118 \\
                 Bauer / Elimination with weighted row combinations for
                 solving linear equations and least squares problems /
                 119--133 \\
                 Golub and Reinsch / Singular value decomposition and
                 least squares solutions / 134--151 \\
                 R. H. Bartels, J. Stoer and Ch. Zenger / A realization
                 of the simplex method based on triangular
                 decompositions / 152--190 \\
                 Part II: The algebraic eigenvalue problem \\
                 Wilkinson / Introduction to Part II / 191--201 \\
                 1. Introduction \\
                 2. List of procedures \\
                 3. Real, dense, symmetric matrices \\
                 4. Symmetric band matrices \\
                 5. Simultaneous determination of dominant eigenvalues
                 and eigenvectors of a symmetric sparse matrix \\
                 6. The generalized symmetric eigenvalue problems $A x =
                 \lambda B x$ and $A B x = \lambda x$ \\
                 7. Hermitian matrices \\
                 8. Real dense unsymmetric matrices \\
                 9. Unsymmetric band matrices \\
                 10. Dense unsymmetric matrices with complex elements,
                 H. Rutishauser / The Jacobi method for real symmetric
                 matrices / 202--211 \\
                 Martin, Reinsch and Wilkinson / Householder's
                 tridiagonalization of a symmetric matrix / 212--226 \\
                 H. Bowdler, Martin, Reinsch and Wilkinson / The $QR$
                 and $QL$ algorithms for symmetric matrices / 227--240
                 \\
                 A. Dubrulle, Martin and Wilkinson / The implicit $QL$
                 algorithm / 241--248 \\
                 W. Barth, Martin, and Wilkinson / Calculation of the
                 eigenvalues of a symmetric tridiagonal matrix by the
                 method of bisection / 249--256 \\
                 Reinsch and Bauer / Rational $QR$ transformation with
                 Newton shift for symmetric tridiagonal matrices /
                 257--265 \\
                 Martin, Reinsch and Wilkinson / The $QR$ algorithm for
                 band symmetric matrices / 266--272 \\
                 H. R. Schwarz / Tridiagonalization of a symmetric band
                 matrix / 273--283 \\
                 Rutishauser / Simultaneous iteration method for
                 symmetric matrices / 284--302 \\
                 Martin and Wilkinson / Reduction of the symmetric
                 eigenproblem $A x = \lambda B x$ and related problems
                 to standard form / 303--314 \\
                 B. N. Parlett and Reinsch / Balancing a matrix for
                 calculation of eigenvalues and eigenvectors / 315--326
                 \\
                 P. J. Eberlein and J. Boothroyd / Solution to the
                 eigenproblem by a norm reducing Jacobi type method /
                 327--338 \\
                 Martin and Wilkinson / Similarity reduction of a
                 general matrix to Hessenberg form / 339--358 \\
                 Martin, Peters and Wilkinson / The $QR$ algorithm for
                 real Hessenberg matrices / 359--371 \\
                 Peters and Wilkinson / Eigenvectors of real and complex
                 matrices by $LR$ and $QR$ triangularizations / 372--395
                 \\
                 Martin and Wilkinson / The modified $LR$ algorithm for
                 complex Hessenberg matrices / 396--403 \\
                 Eberlein / Solution to the complex eigenproblem by a
                 norm reducing Jacobi type method / 404--417 \\
                 Peters and Wilkinson / The calculation of specified
                 eigenvectors by inverse iteration / 418--439",
}

%%% ====================================================================
%%% These entries must come last because they are cross-referenced
%%% by others above.  From version 0.04, ``bibsort -byyear'' will
%%% correctly position Book entries that contain booktitle information.

@Article{Knuth:1970:VNF,
  author =       "Donald E. Knuth",
  title =        "{Von Neumann}'s First Computer Program",
  journal =      j-COMP-SURV,
  volume =       "2",
  number =       "4",
  pages =        "247--260",
  month =        dec,
  year =         "1970",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356580.356581",
  ISSN =         "0010-4892",
  bibdate =      "Sat Mar 23 15:03:00 2002",
  bibsource =    "ftp://ftp.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/compsurv.bib;
                 ftp://ftp.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/HBP/ACMCS.bib;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Reprinted in \cite{Aspray:1987:PJN}.",
  acknowledgement = ack-nhfb,
}

@Book{Taub:1961:JNCa,
  editor =       "A. H. Taub",
  booktitle =    "{John von Neumann}: Collected Works: {Volume I}:
                 {Logic}, Theory of Sets and Quantum Mechanics",
  title =        "{John von Neumann}: Collected Works: {Volume I}:
                 {Logic}, Theory of Sets and Quantum Mechanics",
  publisher =    pub-PERGAMON,
  address =      pub-PERGAMON:adr,
  pages =        "x + 654",
  year =         "1961",
  LCCN =         "????",
  bibdate =      "Wed Jun 01 16:58:29 2005",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See also volumes II--VI
                 \cite{Taub:1961:JNCb,Taub:1961:JNCc,Taub:1962:JNC,Taub:1963:JNCa,Taub:1963:JNCb}.",
  ZMnumber =     "0188.00102",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

@Book{Taub:1961:JNCb,
  editor =       "A. H. Taub",
  booktitle =    "{John von Neumann}: Collected Works. {Volume II}:
                 {Operators}, Ergodic Theory and Almost Periodic
                 Functions in a Group",
  title =        "{John von Neumann}: Collected Works. {Volume II}:
                 {Operators}, Ergodic Theory and Almost Periodic
                 Functions in a Group",
  publisher =    pub-PERGAMON,
  address =      pub-PERGAMON:adr,
  pages =        "x + 568",
  year =         "1961",
  LCCN =         "????",
  bibdate =      "Wed Jun 01 16:58:29 2005",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See also volumes I, III--VI
                 \cite{Taub:1961:JNCa,Taub:1961:JNCc,Taub:1962:JNC,Taub:1963:JNCa,Taub:1963:JNCb}.",
  ZMnumber =     "0188.00102",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

@Book{Taub:1961:JNCc,
  editor =       "A. H. Taub",
  booktitle =    "{John von Neumann}: Collected Works. {Volume III}:
                 Rings of Operators",
  title =        "{John von Neumann}: Collected Works. {Volume III}:
                 Rings of Operators",
  publisher =    pub-PERGAMON,
  address =      pub-PERGAMON:adr,
  pages =        "ix + 574",
  year =         "1961--1963",
  LCCN =         "????",
  bibdate =      "Wed Jun 01 16:58:29 2005",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See also volumes I--II, IV--VI
                 \cite{Taub:1961:JNCa,Taub:1961:JNCb,Taub:1962:JNC,Taub:1963:JNCa,Taub:1963:JNCb}.",
  ZMnumber =     "0188.00102",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

@Book{Taub:1962:JNC,
  editor =       "A. H. Taub",
  booktitle =    "{John von Neumann}: Collected Works. {Volume IV}:
                 {Continuous} Geometry and Other Topics",
  title =        "{John von Neumann}: Collected Works. {Volume IV}:
                 {Continuous} Geometry and Other Topics",
  publisher =    pub-PERGAMON,
  address =      pub-PERGAMON:adr,
  pages =        "x + 516",
  year =         "1962",
  LCCN =         "????",
  bibdate =      "Wed Jun 01 16:58:29 2005",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See also volumes I--III, V--VI
                 \cite{Taub:1961:JNCa,Taub:1961:JNCb,Taub:1961:JNCc,Taub:1963:JNCa,Taub:1963:JNCb}.",
  ZMnumber =     "0188.00102",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

@Book{Taub:1963:JNCb,
  editor =       "A. H. Taub",
  booktitle =    "{John von Neumann}: Collected Works. {Volume VI}:
                 {Theory} of Games, Astrophysics, Hydrodynamics and
                 Meteorology",
  title =        "{John von Neumann}: Collected Works. {Volume VI}:
                 {Theory} of Games, Astrophysics, Hydrodynamics and
                 Meteorology",
  publisher =    pub-PERGAMON,
  address =      pub-PERGAMON:adr,
  pages =        "x + 538",
  year =         "1963",
  LCCN =         "????",
  bibdate =      "Wed Jun 01 16:58:29 2005",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/d/dirac-p-a-m.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/f/fermi-enrico.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/m/metropolis-nicholas.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.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/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See also volumes I--V
                 \cite{Taub:1961:JNCa,Taub:1961:JNCb,Taub:1961:JNCc,Taub:1962:JNC,Taub:1963:JNCa}.",
  ZMnumber =     "0188.00102",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

@Proceedings{Erdahl:1974:RDO,
  editor =       "R. M. Erdahl",
  booktitle =    "Reduced Density Operators With Applications To
                 Physical and Chemical Systems, {II}: proceedings of a
                 conference held at {Queen's University, Kingston, June
                 20--22, 1974}",
  title =        "Reduced Density Operators With Applications To
                 Physical and Chemical Systems, {II}: proceedings of a
                 conference held at {Queen's University, Kingston, June
                 20--22, 1974}",
  volume =       "40",
  publisher =    "Queen's University",
  address =      "Kingston, ON, Canada",
  pages =        "x + 235",
  year =         "1974",
  LCCN =         "QA3.Q38 no.40",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Queen's Papers in Pure and Applied Mathematics",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}

@Proceedings{AFIPS:1975:SUJ,
  key =          "AFIPS:1975:SUJ",
  booktitle =    "{Second USA--Japan Computer Conference proceedings:
                 August 26--28, 1975, Tokyo, Japan}",
  title =        "{Second USA--Japan Computer Conference proceedings:
                 August 26--28, 1975, Tokyo, Japan}",
  publisher =    pub-AFIPS,
  address =      pub-AFIPS:adr,
  pages =        "615",
  year =         "1975",
  LCCN =         "QA76 .U2 1975",
  bibdate =      "Tue May 27 15:13:17 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  subject =      "Computers; Congresses; Electronic data processing",
}

@Proceedings{Woolf:1980:SSP,
  editor =       "Harry Woolf",
  booktitle =    "Some strangeness in the proportion: a centennial
                 symposium to celebrate the achievements of {Albert
                 Einstein}",
  title =        "Some strangeness in the proportion: a centennial
                 symposium to celebrate the achievements of {Albert
                 Einstein}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xxxi + 539",
  year =         "1980",
  ISBN =         "0-201-09924-1",
  ISBN-13 =      "978-0-201-09924-9",
  LCCN =         "QC16.E5 S63",
  bibdate =      "Mon Oct 9 06:44:09 MDT 2006",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/d/dyson-freeman-j.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/jhistastron.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Einstein, Albert; congresses; Relativity (physics);
                 quantum theory; astrophysics",
  subject-dates = "1879--1955",
  tableofcontents = "Einstein's Europe / Felix Gilbert \\
                 Albert Einstein: encounter with America / Harry Woolf
                 \\
                 Relativity and twentieth-century intellectual life /
                 Ernest Nagel \\
                 Einstein's scientific program: the formative years /
                 Gerald Holton \\
                 On some other approaches to electrodynamics in 1905 /
                 Arthur I. Miller \\
                 Special relativity theory in engineering / Wolfgang K.
                 H. Panofsky \\
                 Comments on ``Special relativity theory in
                 engineering'' / Edward M. Purcell \\
                 Experimental challenges posed by the general theory of
                 relativity / Irwin I. Shapiro \\
                 Comments on ``Experimental relativity / David T.
                 Wilkinson \\
                 Theoretical advances in general relativity / Stephen W.
                 Hawking \\
                 Comments on S. Hawking's ``Theoretical advances in
                 general relativity'' / William G. Unruh \\
                 No firm foundation: Einstein and the early quantum
                 theory / Martin J. Klein \\
                 Einstein's critique of Planck / Thomas S. Kuhn \\
                 Einstein on particles, fields, and the quantum theory /
                 Abraham Pais \\
                 Comment on ``Einstein on particles, fields, and the
                 quantum theory'' / Res Jost \\
                 General relativity and differential geometry /
                 Shiing-shen Chern / 271--287 \\
                 Mathematics and physics / Tullio Regge \\
                 The size and shape of the universe / Martin J. Rees \\
                 Comment on ``The size and shape of the universe'' /
                 Phillip J. E. Peebles \\
                 Galaxies and intergalactic matter / George B. Field \\
                 Comment on ``galaxies and intergalactic matter'' /
                 Wallace L. W. Sargent \\
                 Beyond the black hole / John Archibald Wheeler \\
                 Comment on the topic ``Beyond the black hole'' /
                 Freeman Dyson \\
                 Issues in cosmology / Dennis W. Sciama \\
                 Symmetry paradoxes and other cosmological comments /
                 Charles W. Misner \\
                 On the extragalactic distance scale and the Hubble
                 constant / Gerard de Vaucouleurs \\
                 Quantum gravity and supergravity / Yuval Ne'eman \\
                 Supergravity / Peter van Nieuwenhuizen \\
                 Thirty years of knowing Einstein / Eugene P. Wigner \\
                 Reminiscenses of Einstein / Else Rosenthal-Schneider
                 \\
                 Some reminiscenses about Einstein's visits to Leiden /
                 George E. Uhlenbeck \\
                 On playing with scientists: remarks at the Einstein
                 centennial celebration concert by the Juilliard quartet
                 / Robert Mann",
}

@Proceedings{GI:86,
  key =          "GI86",
  booktitle =    "Graphics Interface 86",
  title =        "Graphics Interface 86",
  publisher =    pub-CIPS,
  address =      pub-CIPS:adr,
  year =         "1986",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Vancouver, B. C. 26--30 May, 1986.",
  acknowledgement = ack-nhfb,
}

@Proceedings{IEEE:1988:PIC,
  editor =       "IEEE",
  booktitle =    "{Proceedings of the 2nd IEEE Conference on Computer
                 Workstations, March 7--10, 1988, Santa Clara,
                 California}",
  title =        "{Proceedings of the 2nd IEEE Conference on Computer
                 Workstations, March 7--10, 1988, Santa Clara,
                 California}",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "viii + 179",
  year =         "1988",
  ISBN =         "0-8186-0810-2 (paperback), 0-8186-4810-4 (microfiche),
                 0-8186-8810-6 (case)",
  ISBN-13 =      "978-0-8186-0810-0 (paperback), 978-0-8186-4810-6
                 (microfiche), 978-0-8186-8810-2 (case)",
  LCCN =         "QA76.5 .I33 1988",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  remark =       "Computer Society order number 810. IEEE catalog number
                 88CH2441-4.",
}

@Proceedings{Andre:ridt,
  editor =       "Jacques Andr{\'e} and Roger Hersch",
  booktitle =    "Raster Imaging and Digital Topography: Proceedings of
                 the {International Conference, {\'E}cole Polytechnique
                 F{\'e}d{\'e}rale, Lausanne, Switzerland, October
                 1989}",
  title =        "Raster Imaging and Digital Topography: Proceedings of
                 the {International Conference, {\'E}cole Polytechnique
                 F{\'e}d{\'e}rale, Lausanne, Switzerland, October
                 1989}",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "x + 292",
  year =         "1989",
  ISBN =         "0-521-37490-1",
  ISBN-13 =      "978-0-521-37490-3",
  LCCN =         "Z253.3 .R37 1989",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Proceedings{Hansmann:eurographics89,
  editor =       "W. Hansmann and F. R. A. Hopgood and W. Strasser",
  booktitle =    "{Eurographics '89}",
  title =        "{Eurographics '89}",
  publisher =    pub-NORTH-HOLLAND,
  address =      pub-NORTH-HOLLAND:adr,
  year =         "1989",
  ISBN =         "0-444-88013-5",
  ISBN-13 =      "978-0-444-88013-0",
  LCCN =         "T 385 E97 1989",
  bibdate =      "Sat Feb 24 09:40:34 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

@Proceedings{Clark:TAU90,
  editor =       "Malcolm Clark",
  booktitle =    "{\TeX}: Applications, Uses, Methods",
  title =        "{\TeX}: Applications, Uses, Methods",
  publisher =    pub-ELLIS-HORWOOD,
  address =      pub-ELLIS-HORWOOD:adr,
  pages =        "277",
  year =         "1990",
  ISBN =         "0-13-912296-6",
  ISBN-13 =      "978-0-13-912296-5",
  LCCN =         "Z253.4.T47 C45 1990",
  bibdate =      "Fri Jul 22 08:39:56 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$69.95",
  acknowledgement = ack-nhfb,
}

@Book{Feijen:1990:BOB,
  editor =       "W. H. J. Feijen and A. J. M. van Gasteren and David
                 Gries and J. Misra",
  booktitle =    "Beauty is our Business: a Birthday Salute to {Edsger
                 W. Dijkstra}",
  title =        "Beauty is our Business: a Birthday Salute to {Edsger
                 W. Dijkstra}",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xix + 453",
  year =         "1990",
  DOI =          "https://doi.org/10.1007/978-1-4612-4476-9",
  ISBN =         "0-387-97299-4, 3-540-97299-4, 1-4612-8792-8 (print),
                 1-4612-4476-5 (online)",
  ISBN-13 =      "978-0-387-97299-2, 978-3-540-97299-0,
                 978-1-4612-8792-6 (print), 978-1-4612-4476-9 (online)",
  ISSN =         "0172-603X",
  ISSN-L =       "0172-603X",
  LCCN =         "QA76 .B326 1990",
  bibdate =      "Thu Mar 24 09:27:40 1994",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/bauer-friedrich-ludwig.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/ibmjrd.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  note =         "Contains important treatment of accurate
                 binary-to-decimal conversion
                 \cite{Gries:1990:BDO,Knuth:1990:SPW}.",
  URL =          "http://www.zentralblatt-math.org/zmath/en/search/?an=0718.68004",
  acknowledgement = ack-nhfb,
  tableofcontents = "Anonymous / Front Matter / i--xix \\
                 Krzysztof R. Apt, Frank S. de Boer, Ernst-R{\"u}diger
                 Olderog / Proving Termination of Parallel Programs /
                 1--6 / doi:10.1007/978-1-4612-4476-9_1 \\
                 Roland C. Backhouse / On a Relation on Functions /
                 7--18 / doi:10.1007/978-1-4612-4476-9_2 \\
                 F. L. Bauer / Efficient Solution of a Non--Monotonic
                 Inverse Problem / 19--26 /
                 doi:10.1007/978-1-4612-4476-9_3 \\
                 A. Bijlsma / Semantics of Quasi--Boolean Expressions /
                 27--35 / doi:10.1007/978-1-4612-4476-9_4 \\
                 Richard S. Bird / Small Specification Exercises /
                 36--43 / doi:10.1007/978-1-4612-4476-9_5 \\
                 Maarten Boasson / Architecture of Real--Time Systems /
                 44--53 / doi:10.1007/978-1-4612-4476-9_6 \\
                 Robert S. Boyer, Milton W. Green, J Strother Moore /
                 The Use of a Formal Simulator to Verify a Simple Real
                 Time Control Program / 54--66 /
                 doi:10.1007/978-1-4612-4476-9_7 \\
                 Donald W. Braben / Exploring the Future: Trends and
                 Discontinuities / 67--75 /
                 doi:10.1007/978-1-4612-4476-9_8 \\
                 Coen Bron / On a Renewed Visit to the Banker and a
                 Remarkable Analogy / 76--82 /
                 doi:10.1007/978-1-4612-4476-9_9 \\
                 Manfred Broy / On Bounded Buffers: Modularity,
                 Robustness, and Reliability in Reactive Systems /
                 83--93 / doi:10.1007/978-1-4612-4476-9_10 \\
                 K. Mani Chandy, Stephen Taylor / Examples in Program
                 Composition / 94--101 /
                 doi:10.1007/978-1-4612-4476-9_11 \\
                 Albert J. Dijkstra / On the Mechanism of the
                 Hydrogenation of Edible Oils / 102--111 /
                 doi:10.1007/978-1-4612-4476-9_12 \\
                 W. H. J. Feijen, A. J. M. van Gasteren, D. Gries, J.
                 Misra / The Problem of the Majority Network / 112--118
                 / doi:10.1007/978-1-4612-4476-9_13 \\
                 W. H. J. Feijen / A Little Exercise in Deriving
                 Multiprograms / 119--126 /
                 doi:10.1007/978-1-4612-4476-9_14 \\
                 A. J. M. van Gasteren / Experimenting with a Refinement
                 Calculus / 127--134 / doi:10.1007/978-1-4612-4476-9_15
                 \\
                 Mohamed G. Gouda / Serializable Programs,
                 Parallelizable Assertions: A Basis for Interleaving /
                 135--140 / doi:10.1007/978-1-4612-4476-9_16 \\
                 David Gries / Binary to Decimal, One More Time /
                 141--148 / doi:10.1007/978-1-4612-4476-9_17 \\
                 A. N. Habermann / Rotate and Double / 149--162 /
                 doi:10.1007/978-1-4612-4476-9_18 \\
                 Eric C. R. Hehner / Beautifying G{\"o}del / 163--172 /
                 doi:10.1007/978-1-4612-4476-9_19 \\
                 G. Helmberg / A Striptease of Entropy / 173--175 /
                 doi:10.1007/978-1-4612-4476-9_20 \\
                 Ted Herman / On a Theorem of Jacobson / 176--181 /
                 doi:10.1007/978-1-4612-4476-9_21 \\
                 Wim H. Hesselink / Modalities of Nondeterminacy /
                 182--192 / doi:10.1007/978-1-4612-4476-9_22 \\
                 C. A. R. Hoare / A Theory for the Derivation of C-mos
                 Circuit Designs / 193--205 /
                 doi:10.1007/978-1-4612-4476-9_23 \\
                 Rob Hoogerwoord / On Mathematical Induction and the
                 Invariance Theorem / 206--211 /
                 doi:10.1007/978-1-4612-4476-9_24 \\
                 J. J. Horning / Formalizing Some Classic
                 Synchronization Primitives / 212--219 /
                 doi:10.1007/978-1-4612-4476-9_25 \\
                 Cliff B. Jones / Consequences / 220--225 /
                 doi:10.1007/978-1-4612-4476-9_26 \\
                 Anne Kaldewaij / Shortest and Longest Segments /
                 226--232 / doi:10.1007/978-1-4612-4476-9_27 \\
                 Donald E. Knuth / A Simple Program Whose Proof Isn't /
                 233--242 / doi:10.1007/978-1-4612-4476-9_28 \\
                 Vadim E. Kotov / Binding Structure and Behaviour in
                 ``Whole Net'' Concurrency Semantics / 243--250 /
                 doi:10.1007/978-1-4612-4476-9_29 \\
                 F. E. J. Kruseman Aretz / Maximal Strong Components: An
                 Exercise in Program Presentation / 251--261 /
                 doi:10.1007/978-1-4612-4476-9_30 \\
                 Christian Lengauer, Duncan G. Hudson / A Systolic
                 Program for Gauss--Jordan Elimination / 262--273 /
                 doi:10.1007/978-1-4612-4476-9_31 \\
                 J. H. van Lint / Coding for Channels with Localized
                 Errors / 274--279 / doi:10.1007/978-1-4612-4476-9_32
                 \\
                 Johan J. Lukkien, Jan L. A. van de Snepscheut /
                 Topology-Independent Algorithms Based on Spanning Trees
                 / 280--288 / doi:10.1007/978-1-4612-4476-9_33 \\
                 Zohar Manna, Amir Pnueli / An Exercise in the
                 Verification of Multi--Process Programs / 289--301 /
                 doi:10.1007/978-1-4612-4476-9_34 \\
                 Alain J. Martin / The Limitations to
                 Delay--Insensitivity in Asynchronous Circuits /
                 302--311 / doi:10.1007/978-1-4612-4476-9_35 \\
                 Jayadev Misra / A Simple Proof of a Simple Consensus
                 Algorithm / 312--318 / doi:10.1007/978-1-4612-4476-9_36
                 \\
                 Carroll Morgan / Of wp and {CSP} / 319--326 /
                 doi:10.1007/978-1-4612-4476-9_37 \\
                 Joseph M. Morris / Programming by Expression
                 Refinement: the {KMP} Algorithm / 327--338 /
                 doi:10.1007/978-1-4612-4476-9_38 \\
                 Greg Nelson / Methodical Competitive Snoopy--Caching /
                 339--345 / doi:10.1007/978-1-4612-4476-9_39 \\
                 Peter G. Neumann / Beauty and the Beast of Software
                 Complexity Elegance versus Elephants / 346--351 /
                 doi:10.1007/978-1-4612-4476-9_40 \\
                 W. Peremans / A Note on Feasibility / 352--355 /
                 doi:10.1007/978-1-4612-4476-9_41 \\
                 Karel A. Post / A Curious Property of Points and
                 Circles in the Plane / 356--357 /
                 doi:10.1007/978-1-4612-4476-9_42 \\
                 Paul Pritchard / A Problem Involving Subsequences /
                 358--364 / doi:10.1007/978-1-4612-4476-9_43 \\
                 Martin Rem / A Personal Perspective of the
                 Alpern--Schneider Characterization of Safety and
                 Liveness / 365--372 / doi:10.1007/978-1-4612-4476-9_44
                 \\
                 Fred B. Schneider / Simpler Proofs for Concurrent
                 Reading and Writing / 373--379 /
                 doi:10.1007/978-1-4612-4476-9_45 \\
                 Carel S. Scholten / Goodbye Junctivity? / 380--385 /
                 doi:10.1007/978-1-4612-4476-9_46 \\
                 Henk C. A. van Tilborg / An Assignment Problem for the
                 Vertices of a Cycle / 386--389 /
                 doi:10.1007/978-1-4612-4476-9_47 \\
                 D. A. Turner / Duality and De Morgan Principles for
                 Lists / 390--398 / doi:10.1007/978-1-4612-4476-9_48 \\
                 W. M. Turski / The Quest for Timeless Specifications
                 Leads to Non--Stepping Automata / 399--409 /
                 doi:10.1007/978-1-4612-4476-9_49 \\
                 Jan Tijmen Udding / The Maximum Length of a Palindrome
                 in a Sequence / 410--416 /
                 doi:10.1007/978-1-4612-4476-9_50 \\
                 Lincoln A. Wallen / On Form, Formalism and Equivalence
                 / 417--426 / doi:10.1007/978-1-4612-4476-9_51 \\
                 N. Wirth / Drawing Lines, Circles, and Ellipses in a
                 Raster / 427--434 / doi:10.1007/978-1-4612-4476-9_52
                 \\
                 Jaap van der Woude / Calculations with Relations, an
                 Example / 435--441 / doi:10.1007/978-1-4612-4476-9_53
                 \\
                 Heinz Zemanek / Two Proofs for Pythagoras / 442--447 /
                 doi:10.1007/978-1-4612-4476-9_54 \\
                 Anonymous / Back Matter / 448--453",
}

@Book{Nash:1990:HSC,
  editor =       "Stephen G. Nash",
  booktitle =    "A History of Scientific Computing",
  title =        "A History of Scientific Computing",
  publisher =    pub-AW # " and " # pub-ACM,
  address =      pub-AW # " and " # pub-ACM:adr,
  pages =        "xix + 359",
  year =         "1990",
  ISBN =         "0-201-50814-1",
  ISBN-13 =      "978-0-201-50814-7",
  LCCN =         "QA76.17 .H59 1990",
  bibdate =      "Wed Dec 15 10:39:57 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/birkhoff-garrett.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/f/fox-leslie.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/g/gear-c-w.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/h/hartree-douglas-r.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/h/hestenes-magnus-r.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/h/householder-alston-s.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/l/lanczos-cornelius.bib;;
                 https://www.math.utah.edu/pub/bibnet/authors/m/metropolis-nicholas.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/p/parlett-beresford-n.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/r/rice-john-r.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/t/todd-john.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/t/tukey-john-w.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/v/varga-richard-steven.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/y/young-david-m.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/w/wilkinson-james-hardy.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/numana1990.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "ACM Press history series",
  acknowledgement = ack-nhfb,
  author-dates = "Charles William ``Bill'' Gear (1 February 1935--15
                 March 2022); Garrett Birkhoff (19 January 1911--22
                 November 1996); Magnus Rudolph Hestenes (13 February
                 1906--31 May 1991)",
  remark =       "Based on papers presented at the Conference on the
                 History of Scientific and Numeric Computation, held in
                 Princeton, NJ, 1987. A few brief mentions of Alston
                 Householder are indexed in the book, with photographs
                 of him on pages xvi and 344.",
  subject =      "Electronic data processing; History; Science; Data
                 processing",
  tableofcontents = "Remembrance of things past / Herman H. Goldstine /
                 5--16 \\
                 The contribution of J. H. Wilkinson to numerical
                 analysis / B. N. Parlett / 17--30 \\
                 The influence of George Forsythe and his students /
                 James Varah / 31--40 \\
                 Howard H. Aiken and the computer / I. Bernard Cohen /
                 41--52 \\
                 Particles in their self-consistent field: from
                 Hartree's differential analyzer to Cray machines /
                 Oscar Buneman / 57--62 \\
                 Fluid dynamics, reactor computations, and surface
                 representation / Garrett Birkhoff / 63--87 \\
                 The development of ODE methods: a symbiosis between
                 hardware and numerical analysis / C. W. Gear and R. D.
                 Skeel / 88--105 \\
                 A personal retrospection of reservoir simulation /
                 Donald W. Peaceman / 106--129 \\
                 How the FFT gained acceptance / James W. Cooley /
                 133--140 \\
                 Origins of the simplex method / George B. Dantzig /
                 141--151 \\
                 Historical comments on finite elements / J. Tinsley
                 Oden / 152--166 \\
                 Conjugacy and gradients / Magnus R. Hestenes / 167--179
                 \\
                 A historical review of iterative methods / David M.
                 Young / 180--194 \\
                 Shaping the evolution of numerical analysis in the
                 computer age: the SIAM thrust / I. Edward Block /
                 199--205 \\
                 Reminiscences on the University of Michigan summer
                 schools, the Gatlinburg Symposia, and Numerische
                 Mathematik / Richard S. Varga / 206--210 \\
                 The origin of mathematics of computation and some
                 personal recollections / Eugene Isaacson / 211--216 \\
                 Mathematical software and ACM publications / John R.
                 Rice / 217--227 \\
                 BIT --- a child of the computer / Carl-Erik Fr{\"o}berg
                 / 228--233 \\
                 The Los Alamos experience, 1943--1954 / N. Metropolis /
                 237--250 \\
                 The prehistory and early history of computation at the
                 U.S. National Bureau of Standards / John Todd /
                 251--268 \\
                 Programmed computing at the Universities of Cambridge
                 and Illinois in the early fifties / David J. Wheeler /
                 269--279 \\
                 Early numerical analysis in the United Kingdom / L. Fox
                 / 280--300 \\
                 The pioneer days of scientific computing in Switzerland
                 / Martin H. Gutknecht / 301--313 \\
                 The development of computational mathematics in
                 Czechoslovakia and the USSR / I. Babuska / 314--328 \\
                 The contribution of Leningrad mathematicians to the
                 development of numerical linear algebra, 1950--1986 /
                 V. N. Kublanovskaya / 329--338",
}

@Proceedings{Farin:NCS91,
  editor =       "Gerald Farin",
  booktitle =    "{NURBS} for Curve and Surface Design",
  title =        "{NURBS} for Curve and Surface Design",
  publisher =    pub-SIAM,
  address =      pub-SIAM:adr,
  pages =        "ix + 161",
  year =         "1991",
  ISBN =         "0-89871-286-6",
  ISBN-13 =      "978-0-89871-286-5",
  LCCN =         "QA224 .N85 1991",
  bibdate =      "Wed Dec 15 08:57:00 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}

@Proceedings{Morris:1991:RID,
  editor =       "Robert A. Morris and Jacques Andr{\'e}",
  booktitle =    "Raster Imaging and Digital Topography {II}: Papers
                 from the second {RIDT} meeting, held in {Boston, Oct.
                 14--16, 1991}",
  title =        "Raster Imaging and Digital Topography {II}: Papers
                 from the second {RIDT} meeting, held in {Boston, Oct.
                 14--16, 1991}",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "x + 217",
  year =         "1991",
  ISBN =         "0-521-41764-3",
  ISBN-13 =      "978-0-521-41764-8",
  LCCN =         "Z253.3 .R39 1991",
  MRclass =      "68U10, 68-06, 68U15",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ep.bib;
                 https://www.math.utah.edu/pub/tex/bib/font.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  ZMnumber =     "0817.68133",
  abstract =     "The papers presented in this book were given at the
                 RIDT 91 conference in Boston. State of the art
                 techniques in digital typography and raster imaging,
                 including curve-fitting, shape manipulation, font
                 design, and page-description languages are discussed by
                 some of the most highly regarded international
                 figures.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  tableofcontents = "1: Grayscale \\
                 2: Autotracing \\
                 3: The shape of the stroke \\
                 4: Moir{\'e} phenomenon \\
                 5: Edge detection \\
                 6: Modern Hebrew typefaces \\
                 7: Looking at the pixels \\
                 8: Colour half-toning \\
                 9: CRT \\
                 10: Intelligent Chinese character design \\
                 11: Kanji font bitmaps",
}

@Proceedings{Zlatuska:1992:EPE,
  editor =       "Ji{\v{r}}{\'\i} Zlatu{\v{s}}ka",
  booktitle =    "{Euro\TeX{} '92: Proceedings of the 7th European
                 {\TeX} Conference, Prague, Czechoslovakia, September
                 14--18, 1992}",
  title =        "{Euro\TeX{} '92: Proceedings of the 7th European
                 {\TeX} Conference, Prague, Czechoslovakia, September
                 14--18, 1992}",
  publisher =    pub-MASARYKOVA,
  address =      pub-MASARYKOVA:adr,
  pages =        "viii + 330",
  month =        sep,
  year =         "1992",
  ISBN =         "80-210-0480-0",
  ISBN-13 =      "978-80-210-0480-1",
  bibdate =      "Tue Dec 27 06:37:06 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/postscri.bib;
                 https://www.math.utah.edu/pub/tex/bib/texgraph.bib;
                 https://www.math.utah.edu/pub/tex/bib/typeset.bib",
  series =       "Proceedings of the European \TeX{} Conference",
  acknowledgement = ack-nhfb,
  tableofcontents = "Alan Hoenig / When \TeX{} and METAFONT work
                 together (invited talk) / 1 \\
                 John D. Hobby / Introduction to MetaPost (invited talk)
                 / 21 \\
                 Andrei B. Khodulev and Irina A. Makhovaya / On \TeX{}
                 experience in Mir Publishers / 37 \\
                 Laurent Siebenmann / The Lion and the Mouse / 43 \\
                 Petr Sojka, Rudolf Cervenka, and Martin Svoboda /
                 \TeX{} for database publishing / 53 \\
                 Ondfej Vacha / TgX for typesetting in a publishing
                 house / 59 \\
                 Michel Lavaud / A solution to help ensuring the future
                 of \TeX{}: make its use easier on cheap machines / 66
                 \\
                 Frank Mittelbach and Chris Rowley / {\LaTeX3}:
                 structure and design (invited talk) / 69 \\
                 Anita Z. Hoover / The key to successful support:
                 knowing your \TeX{} and \LaTeX{} users (invited talk) /
                 71 \\
                 Theo Jurriens / \TeX{} for everybody? / 86 \\
                 Daniel Flipo and Laurent Siebenmann / Hyphenation in
                 presence of accents and diacritics: An easy and
                 low-cost solution / 87 \\
                 Laurent Siebenmann / CaesarCM --- A gentle road to
                 perfect hyphenation in modest \TeX{} environments / 97
                 \\
                 Laurent Siebenmann / La mise en application
                 d{\'e}finitive de la norme de Cork / 107 \\
                 Boguslav Jackowski and Marek Rycko / Polishing \TeX{}:
                 from ready to use to handy in use / 119 \\
                 Rama Porrat / Developments in Hebrew \TeX{} / 135 \\
                 Michael Vinogradov / Russian \TeX{}: new eight bit
                 fonts and IBM PC equipment / 149 \\
                 Klaus Lagally / Arab\TeX{} --- Typesetting Arabic with
                 vowels and ligatures / 153 \\
                 Erik-Jan Vens / Incorporating PostScript fonts in
                 \TeX{} / 173 \\
                 Kristoffer H. Rose / How to typeset pretty diagram
                 arrows with \TeX{} --- design decisions used in Xy-pic
                 / 183 \\
                 Kees van der Laan / Table diversions / 211 \\
                 Jorg Knappen / Changing the appearance of math / 212
                 \\
                 Kees van der Laan / Typesetting crosswords via \TeX{} /
                 217 \\
                 Kees van der Laan / FIFO and LIFO incognito / 225 \\
                 Philip Taylor / The future of \TeX{} / 235 \\
                 Frank Mittelbach and Chris Rowley / The future of high
                 quality typesetting: structure and design (invited
                 talk) / 255 \\
                 Daniel Taupin / Music\TeX{}: using \TeX{} to write
                 polyphonic or instrumental music (invited talk) / 257
                 \\
                 Kristoffer H. Rose / Typesetting Diagrams with Xy-pic:
                 user's manual / 273 \\
                 Yannis Haralambous / Towards the revival of traditional
                 Arabic typography \ldots{} through \TeX{} (invited
                 talk) / 293",
}

@Proceedings{USENIX:PUC94,
  key =          "USENIX-WINTER'94",
  booktitle =    "Proceedings of the {1994 USENIX Conference, January
                 17--21, 1994, San Francisco, CA, USA}",
  title =        "Proceedings of the {1994 USENIX Conference, January
                 17--21, 1994, San Francisco, CA, USA}",
  publisher =    pub-USENIX,
  address =      pub-USENIX:adr,
  year =         "1994",
  ISBN =         "1-880446-58-8",
  ISBN-13 =      "978-1-880446-58-4",
  LCCN =         "QA 76.76 O63 U84 1994",
  bibdate =      "Wed Aug 10 12:18:40 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}

@Proceedings{Boisvert:1997:QNS,
  editor =       "Ronald F. Boisvert",
  booktitle =    "Quality of numerical software: assessment and
                 enhancement / proceedings of the IFIP TC2/WG2.5 Working
                 Conference on the Quality of Numerical Software,
                 Assessment and Enhancement, Oxford, United Kingdom,
                 8--12 July 1996",
  title =        "Quality of numerical software: assessment and
                 enhancement / proceedings of the {IFIP} {TC2}/{WG2}.5
                 Working Conference on the Quality of Numerical
                 Software, Assessment and Enhancement, Oxford, United
                 Kingdom, 8--12 July 1996",
  publisher =    pub-CHAPMAN-HALL,
  address =      pub-CHAPMAN-HALL:adr,
  pages =        "vii + 384",
  year =         "1997",
  ISBN =         "0-412-80530-8",
  ISBN-13 =      "978-0-412-80530-1",
  LCCN =         "QA297.I35 1996",
  bibdate =      "Mon May 17 18:18:12 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/numana1990.bib",
  price =        "US\$146.50",
  abstract =     "Numerical software is central to our computerized
                 society. It is used to control aeroplanes and bridges,
                 operate manufacturing lines, control power plants and
                 refineries, and analyse financial markets. Such
                 software must be accurate, reliable, robust, efficient,
                 easy to use, maintainable and adaptable. Quality
                 assessment and control of numerical software is still
                 not well understood. Although measurement is a key
                 element, it remains difficult to assess many components
                 of software quality and to evaluate the trade-offs
                 between them.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "1. The problem of numerical software quality \\
                 2. Testing and evaluation methodology \\
                 3. The effect of new environments on numerical software
                 quality \\
                 4. Case studies \\
                 5. The conference",
}

@Book{Othmer:1997:CSM,
  editor =       "H. G. Othmer and F. R. Adler and M. A. Lewis and J. C.
                 Dallon",
  booktitle =    "Case Studies in Mathematical Modeling---Ecology,
                 Physiology, and Cell Biology",
  title =        "Case Studies in Mathematical Modeling---Ecology,
                 Physiology, and Cell Biology",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "viii + 411",
  year =         "1997",
  ISBN =         "0-13-574039-8",
  ISBN-13 =      "978-0-13-574039-2",
  LCCN =         "QH541.15.M3C37 1997",
  bibdate =      "Tue Nov 26 10:32:51 1996",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/beebe-nelson-h-f.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "https://www.math.utah.edu/books/csmmepcb/",
  abstract =     "This volume is a collection of case studies designed
                 to instruct advanced undergraduates and beginning
                 graduate students in the art and science of modeling
                 applied to biological problems. Students with
                 quantitative science background (some knowledge of
                 differential equations) are introduced to the
                 diversity, excitement, and accessibility of problems in
                 the life sciences, and exposed to the intellectual
                 tools for successful mathematical modeling. Each
                 chapter distills lectures given by a leading researcher
                 during a Special Year in Mathematical Biology at the
                 University of Utah in 1995--96. Authors were asked to
                 provide an in-depth exposition of a crucial problem in
                 their area of expertise. The resulting case studies
                 lead students through the formulation, solution, and
                 interpretation of cutting-edge research, catapulting
                 them directly into the research process. To emphasize
                 the unifying power of mathematical methods in biology,
                 authors, have drawn from three highly active areas of
                 research in the life sciences: ecology, physiology, and
                 cell biology.",
  acknowledgement = ack-nhfb,
  remark =       "NHFB was the chief technical editor for this book, and
                 wrote the author/editor indexing software
                 \cite{Beebe:1998:AAE}, the {\TeX} DVI-to-PostScript
                 driver, the colophon, and the Web site for the book, at
                 \path=https://www.math.utah.edu/books/csmmepcb/index.html=.",
  subject =      "Ecology; Mathematical models; Case studies;
                 Physiology; Cytology; Mathematical models; Biologie;
                 Ecologie; Wiskundige modellen; Fallstudie;
                 Mathematisches Modell",
  tableofcontents = "pt. I. Ecology and Evolution / Frederick R. Adler
                 \\
                 1. You Bet Your Life: Life-History Strategies in
                 Fluctuating Environments / Stephen P. Ellner \\
                 2. The Evolution of Species' Niches: A Population
                 Dynamic Perspective / Robert D. Holt and Richard
                 Gomulkiewicz \\
                 3. Reflections on Models of Epidemics Triggered by the
                 Case of Phocine Distemper Virus among Seals / Odo
                 Diekmann \\
                 4. Simple Representations of Biomass Dynamics in
                 Structured Populations / R. M. Nisbet, E. McCauley and
                 W. S. C. Gurney \\
                 5. Ancestral Inference from DNA Sequence Data / Simon
                 Tavare \\
                 pt. II. Cell Biology / Mark A. Lewis \\
                 6. Signal Transduction and Second Messenger Systems /
                 Hans G. Othmer \\
                 7. The Eukaryotic Cell Cycle: Molecules, Mechanisms,
                 and Mathematical Models / John J. Tyson, Kathy Chen and
                 Bela Novak \\
                 8. Mathematical Models of Hematopoietic Cell
                 Replication and Control / Michael C. Mackey \\
                 9. Oscillations and Multistability in Delayed Feedback
                 Control / John Milton and Jennifer Foss \\
                 10. Calcium and Membrane Potential Oscillations in
                 Pancreatic $\beta$-Cells / Arthur Sherman \\
                 pt. III. Physiology / Hans G. Othmer \\
                 11. Mathematical Modelling of Muscle Crossbridge
                 Mechanics / Edward Pate \\
                 12. The Topology of Phase Resetting and the Entrainment
                 of Limit Cycles / Leon Glass \\
                 13. Modeling the Interaction of Cardiac Muscle with
                 Strong Electric Fields / Wanda Krassowska \\
                 14. Fluid Dynamics of the Heart and its Valves /
                 Charles S. Peskin and David M. McQueen \\
                 15. Bioconvection / N. A. Hill \\
                 A. Age-structured Models / Frederick R. Adler \\
                 B. Qualitative Theory of Ordinary Differential
                 Equations / Mark A. Lewis and Hans G. Othmer \\
                 C. An Introduction to Partial Differential Equations /
                 Hans G. Othmer",
}

@Proceedings{Syropoulos:2004:TXD,
  editor =       "Apostolos Syropoulos and Karl Berry and Yannis
                 Haralambous and Baden Hughes and Steven Peter and John
                 Plaice",
  booktitle =    "{{\TeX}, XML, and Digital Typography: International
                 Conference on \TeX, XML, and Digital Typography, held
                 jointly with the 25th Annual Meeting of the \TeX{}
                 Users Group, TUG 2004, Xanthi, Greece, August
                 30--September 3, 2004: Proceedings}",
  title =        "{{\TeX}, XML, and Digital Typography: International
                 Conference on \TeX, XML, and Digital Typography, held
                 jointly with the 25th Annual Meeting of the \TeX{}
                 Users Group, TUG 2004, Xanthi, Greece, August
                 30--September 3, 2004: Proceedings}",
  volume =       "3130",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "viii + 263",
  year =         "2004",
  CODEN =        "LNCSD9",
  DOI =          "https://doi.org/10.1007/b99374",
  ISBN =         "3-540-22801-2 (paperback)",
  ISBN-13 =      "978-3-540-22801-1 (paperback)",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  LCCN =         "Z253.3 I58 2004",
  bibdate =      "Tue Nov 16 08:40:30 2004",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/java2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/lncs.bib;
                 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/texgraph.bib",
  series =       ser-LNCS,
  URL =          "http://link.springer-ny.com/link/service/series/0558/tocs/t3130.htm;
                 http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3130;
                 http://www.springerlink.com/openurl.asp?genre=volume&id=doi:10.1007/b99374",
  acknowledgement = ack-nhfb,
  tableofcontents = "Digital Typography in the New Millennium: Flexible
                 Documents by a Flexible Engine / Christos K. K.
                 Loverdos and Apostolos Syropoulos / 1--16 \\
                 Moving $\Omega$ to an Object-Oriented Platform / John
                 Plaice, Yannis Haralambous, Paul Swoboda, and G{\'a}bor
                 Bella / 17--26 \\
                 Basque: A Case Study in Generalizing LaTeX Language
                 Support / Jagoba Arias P{\'e}rez, Jes{\'u}s L{\'a}zaro,
                 and Juan M. Aguirregabiria / 27--33 \\
                 $\mu o \nu o 2 \pi o \lambda \nu$: Java-Based
                 Conversion of Monotonic to Polytonic Greek / Johannes
                 Likos / 34--54 \\
                 Using LaTeX to Typeset a
                 Mar{\=a}{\d{t}}h{\=\i}--English Dictionary / Manasi
                 Athale and Rahul Athale / 55--58 \\
                 Hyphenation Patterns for Ancient and Modern Greek /
                 Dimitrios Filippou / 59--67 \\
                 Typesetting the Deseret Alphabet with LaTeX and
                 METAFONT / Kenneth R. Beesley / 68--111 \\
                 FEATPOST and a Review of 3D METAPOST Packages / Luis
                 Nobre Gon{\c{c}}alves / 112--124 \\
                 Interactive Editing of MathML Markup Using TeX Syntax /
                 Luca Padovani / 125--139 \\
                 Typesetting CJK Languages with $\Omega$ / Jin-Hwan Cho
                 / 139--139 \\
                 Dynamic Arabic Mathematical Fonts / Mustapha Eddahibi,
                 Azzeddine Lazrek, and Khalid Sami / 149--157 \\
                 Arabic Mathematical e-Documents / Mustapha Eddahibi,
                 Azzeddine Lazrek, and Khalid Sami / 158--168 \\
                 Migrating to XML: The Case of the GUST Bulletin Archive
                 / W{\l}odzimierz Bzyl and Tomasz Przechlewski /
                 169--178 \\
                 Animations in pdfTeX-Generated PDF / Jan Hole{\c{c}}ek
                 and Petr Sojka / 179--191 \\
                 iTeXMac: An Integrated TeX Environment for Mac OS X /
                 J{\'e}r{\^o}ne Laurens / 192--202 \\
                 MlBibTeX: Beyond LaTeX / Jan-Michel Hufflen / 203--215
                 \\
                 Managing TeX Resources with XML Topic Maps / Tomasz
                 Przechlewski / 216--228 \\
                 {\c{S}}{\"a}ferTeX: Source Code Esthetics for Automated
                 Typesetting / Frank-Rene Schaefer / 229--239 \\
                 Creating Type 1 Fonts from metafont Sources / Karel
                 P{\'\i}{\v{s}}ka / 240--256 \\
                 Beyond Glyphs, Advanced Typographic Features of Fonts /
                 George Williams / 257--263 \\
                 Author Index / / 256--256",
}

@Book{Born:2005:BEL,
  editor =       "Max Born and Hedwig Born",
  booktitle =    "The {Born--Einstein} letters: friendship, politics,
                 and physics in uncertain times: correspondence between
                 {Albert Einstein} and {Max} and {Hedwig Born} from 1916
                 to 1955 with commentaries by {Max Born}",
  title =        "The {Born--Einstein} letters: friendship, politics,
                 and physics in uncertain times: correspondence between
                 {Albert Einstein} and {Max} and {Hedwig Born} from 1916
                 to 1955 with commentaries by {Max Born}",
  publisher =    pub-MACMILLAN,
  address =      pub-MACMILLAN:adr,
  pages =        "xxxii + 235",
  year =         "2005",
  ISBN =         "1-4039-4496-2",
  ISBN-13 =      "978-1-4039-4496-2",
  LCCN =         "QC16.E5 A4 2005",
  bibdate =      "Mon Jul 5 12:12:50 MDT 2010",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/born-max.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/h/heisenberg-werner.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  note =         "Note on the new edition by Gustav Born. New preface by
                 Diana Buchwald and Kip S. Thorne. Foreword by Bertrand
                 Russell. Introduction by Werner Heisenberg. Translated
                 by Irene Born.",
  URL =          "http://www.loc.gov/catdir/bios/hol059/2004061027.html;
                 http://www.loc.gov/catdir/description/hol054/2004061027.html;
                 http://www.loc.gov/catdir/enhancements/fy0618/2004061027-t.html",
  acknowledgement = ack-nhfb,
  KSnumber =     "30",
  subject =      "Einstein, Albert; correspondence; Born, Max; Born,
                 Hedwig; physicists",
  subject-dates = "Albert Einstein (1879--1955); Max Born (1882--1970)",
}

@Proceedings{Simos:2007:CMS,
  editor =       "Theodore E. Simos and George Maroulis",
  booktitle =    "{Computation in Modern Science and Engineering:
                 Proceedings of the [Fifth] International Conference on
                 Computational Methods in Science and Engineering 2007
                 (ICCMSE 2007), Corfu, Greece, 25--30 September 2007}",
  title =        "{Computation in Modern Science and Engineering:
                 Proceedings of the [Fifth] International Conference on
                 Computational Methods in Science and Engineering 2007
                 (ICCMSE 2007), Corfu, Greece, 25--30 September 2007}",
  volume =       "2A, 2B",
  publisher =    pub-AIP,
  address =      pub-AIP:adr,
  bookpages =    "xxvi + 730 + 10 (vol. 2A)",
  pages =        "xxvi + 730 + 10 (vol. 2A)",
  year =         "2007",
  ISBN =         "0-7354-0476-3 (set), 0-7354-0477-1 (vol. 1),
                 0-7354-0478-X (vol. 2)",
  ISBN-13 =      "978-0-7354-0476-2 (set), 978-0-7354-0477-9 (vol. 1),
                 978-0-7354-0478-6 (vol. 2)",
  ISSN =         "0094-243X (print), 1551-7616 (electronic), 1935-0465",
  LCCN =         "Q183.9 .I524 2007",
  bibdate =      "Thu Feb 21 14:15:15 2008",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/beebe-nelson-h-f.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "AIP Conference Proceedings (\#963)",
  URL =          "http://www.springer.com/physics/atoms/book/978-0-7354-0478-6",
  abstract =     "All papers have been peer-reviewed. The aim of ICCMSE
                 2007 is to bring together computational scientists and
                 engineers from several disciplines in order to share
                 methods, methodologies and ideas. The potential readers
                 of these proceedings are all the scientists with
                 interest in the following fields: Computational
                 Mathematics, Theoretical Physics, Computational
                 Physics, Theoretical Chemistry, Computational
                 Chemistry, Mathematical Chemistry, Computational
                 Engineering, Computational Mechanics, Computational
                 Biology and Medicine, Scientific Computation, High
                 Performance Computing, Parallel and Distributed
                 Computing, Visualization, Problem Solving Environments,
                 Software Tools, Advanced Numerical Algorithms, Modeling
                 and Simulation of Complex Systems, Web-based Simulation
                 and Computing, Grid-based Simulation and Computing,
                 Computational Grids, and Computer Science.",
  acknowledgement = ack-nhfb,
  remark =       "Two volumes.",
  tableofcontents = "European Society of Computational Methods in
                 Sciences and Engineering (ESCMSE) \\
                 Time-dependent Molecular Reaction Dynamics / Y.
                 {\"O}hrn \\
                 A Elementary Energetic Effects of Radiation Damage to
                 DNA and RNA Subunits / P. P. Bern and H. F. Schaefer
                 III \\
                 Left-handed Metamaterials: A New Frontier in Optics? /
                 E. N. Economou \\
                 At the Cutting Edge of a Petascale Computing World: An
                 Overview of Petascale System Interconnect Project / K.
                 J. Murakami \\
                 Interatomic (Intermolecular) Decay Processes in
                 Clusters: Current Status and Outlook / V. Averbukh and
                 L. S. Cederbaum \\
                 Molecular Currents and Aromaticity / P. W. Fowler \\
                 Electron Momentum Spectroscopy and Its Applications to
                 Molecules of Biological Interest / F. Wang \\
                 Nonlinear AC Dielectric Response in Polyelectrolytes /
                 J.-L. Dejardin \\
                 Prediction of Fluid Phase Behavior from Molecular
                 Models / K. Lucas \\
                 Mechanisms of Nucleotidyl Transfer Catalyzed by the
                 Yeast RNA Polymerase II / R. Zhu and D. R. Salahub \\
                 Applications of a Novel Spin-free Combinatoric
                 Open-shell Coupled Cluster (COS- CC) Theory to
                 Single-reference Doublets / D. Datta and D. Mukherjee
                 \\
                 Elongation Method Applied to Aperiodic Systems \\
                 Random Polypeptides, High Spin Alignment, Polymer in
                 Solvent, and DNA / Y. Aoki, F. L. Qu, Y. Orimoto, S.
                 Suhai, and A. Imamura \\
                 Molecular Response Properties Calculated and Analyzed
                 Using Static and Time-dependent DFT / J. Autsehbach \\
                 Genetic Algorithm for Structural Optimization of
                 Tubular Nanostructures / T. E. B. Davies / M. M. Popa /
                 C. V. Ciobanu \\
                 Applications of Response Theory with Relaxation / P.
                 Norman \\
                 Temperature Dependence of the Polarizability of Sodium
                 Clusters: An All-electron Density Functional Study / P.
                 Calaminici / A. M. Koster and G. U. G. Martinez \\
                 Nuclear Quantum Effects on the Structural Properties of
                 Solids / I. Scivetti, D. Hughes, N. Gidopoulos, A.
                 Caro, and J. Kohanoff \\
                 Computational Methods for Fundamental Studies of Plasma
                 Processes / N. Ning, G. Dolgonos, W. Morscheidt, A.
                 Michau, K. Hassouni, and H. Vach \\
                 Induced Rayleigh and Hyper-Rayleigh Spectra Pair
                 Hyperpolarizability / T. Baneewiez \\
                 Spin-orbit Coupling Effects in Di-hydrides of Third-row
                 Transition Elements / S. Koseki \\
                 Approximate Procedures in Multireference Perturbation
                 Theory: Successes and Limitations / J. J. W. McDouall
                 and D. Robinson \\
                 A Dynamically Adaptive Refinement in Muliresolution
                 Multiwavelet Basis for Dynamical Quantum Wavefunctions
                 / H. Sekino and S. Hamada \\
                 Molecular Dynamics and Monte Carlo Simulations of
                 Organic Compounds Adsorbed on Ice Surfaces / S. Picaud,
                 P. N. M. Hoang, L. B. Parlay, G. Hantal and P.
                 Jedlovszky \\
                 On the Frontier Bond Location in the QM/MM Description
                 of Peptides and Proteins / P.-F. Loos and X. Assfeld
                 \\
                 The Linear and Non-linear Optical Properties of Some
                 Noble Gas Compounds / M. G. Papadopoulos and A.
                 Avramopoulos \\
                 Vibrational Analysis from Quantum Mechanic Molecular
                 Dynamics Trajectories / P. Carbonniere, A. Dargelos,
                 and C. Pouchan \\
                 Constrained Variational Response to Fock-space
                 Multi-reference Coupled-cluster Theory: Formulation for
                 Excited-state Electronic Structure Calculations and
                 Some Pilot Applications / P. U. Manohar and S. Pal \\
                 The Electronic Flux in Chemical Reactions. Insights on
                 the Mechanism of the Maillard Reaction / P. Flores, S.
                 Gutierrez-Oliva, B. Herrera, E. Silva, and A.
                 Toro-Labbe \\
                 Multi-scale Simulations for Materials and Life Sciences
                 / F. Castet, B. Champagne, M. Nakano, and H. Takahashi
                 \\
                 Recent Progress in the Computation of Non-linear
                 Optical Properties of Chiral Systems / A. Rizzo \\
                 Theoretical Approach to Large Two-photon Absorption
                 Cross Section in Extended [pi]-Conjugated Systems / K.
                 Ohta / K. Kamada \\
                 Multiscale Modeling of Molecular Magnets / S. Ramasesha
                 / R. Raghunathan \\
                 Calculations of the Stabilization Energies of the
                 Building Blocks of Biomacromolecules / P. Hobza \\
                 Applications of B3LYP Method for Enzyme Reactions:
                 O[subscript 2] Reduction by Cytochrome c Oxidase and
                 Ubiquinol Oxidation by Cytochrome bc[subscript 1]
                 Complex / Y. Yoshioka \\
                 Directional Aspects of Swift Ion Stopping in a
                 Proto-biological Molecule: Formaldehyde / J. R. Sabin,
                 R. C. Trujillo, L. T. Chadderton, N. Y. {\"O}hrn, and
                 E. Deumens \\
                 Highly Compact Wavefunctions for Four-body Systems / F.
                 E. Harris \\
                 Coherent-states Dynamics: A Tribute to N. Yngve
                 {\"O}hrn / J. A. Morales \\
                 Similarities and Difference between Silicon and Carbon
                 Nanostructures: Theoretical Predictions / A. D. Zdetsis
                 \\
                 A Unifying View of Computational Electrochemistry / L.
                 K. Bieniasz \\
                 Recent Advances in the Theory of Zagreb Indices / S.
                 Nikolic \\
                 COBRAMM: A Tunable QM/MM Approach to Complex Molecular
                 Architectures. Modelling the Excited and Ground State
                 Properties of Sized Molecular Systems / P. Altoe, M.
                 Stenta, A. Bottom, and M. Garavelli \\
                 Towards Understanding Different Spatial and Temporal
                 Scales / F. Zerbetto \\
                 Simulation of Proton Transfer Processes and
                 Excited-state Properties in Proteins with QM/MM Methods
                 / M. Elstner, M. Hoffmann, and M. Wanko \\
                 Computer Simulation of Liquid Crystal Materials: From
                 Generic to Specifically Decorated Molecular Models / C.
                 Zannoni \\
                 Bioexcimers as Precursors of Charge Transfer and
                 Reactivity in Photobiology / L. Serrano-Andrea, M.
                 Merchan, D. Roca-Sanjuan, G. Olaso-Gonzalez, and M.
                 Rubio \\
                 Controlled Intersubband Population Dynamics in a
                 Semiconductor Quantum Well / E. Paspalakis, C.
                 Simserides, and A. F. Terzis \\
                 Laser-induced Dynamical Chirality and Intramolecular
                 Energy Flow in the CH Chromophore / I. Thanopulos \\
                 High-energy Quantum Dynamics in Ultra-Intense Laser
                 Pulses / C. Muller, G. R. Mocken, K. Z. Hatsagortsyan,
                 and C. H. Keitel \\
                 Ab Initio Many-electron Calculation of Hyperfast
                 Time-resolved Coherent Excitation and Decay of
                 Polyelectronic Atoms / C. A. Nicolaides, T. Merecouris,
                 and Y. Komninos \\
                 Tomographic Imaging of Molecular Orbitals in Length and
                 Velocity Form / E. V. van der Zwan and M. Lein \\
                 Laser Control of Wavepacket Photodissociation and
                 Photoisomerization Dynamics in Isolated Molecules / L.
                 Gonzalez, T. Rozgonyi, D. Ambrosek, and G.
                 Perez-Hernandez \\
                 Two-step Fuzzy Multicriteria Ranking of Whole Cells
                 Immobilization Methods for Biosensor/Biocatalyst
                 Selection/Synthesis / F. Batzias \\
                 Mathematical Characterization of DNA Sequences \\
                 Towards New Directions / A. Nandy \\
                 Reducing Spatial Data Complexity for Classification
                 Models / D. Ruta and B. Gabrys \\
                 Experimental Structural Studies of Solutes in Aqueous
                 Solution / I. Persson \\
                 Coupling MD Simulations and X-ray Absorption
                 Spectroscopy to Study Ions in Solution / H. S. Marcos,
                 E. C. Beret, J. M. Martinez, R. R. Pappalardo, R.
                 Ayala, and A. Munoz-Paez \\
                 Graph-based Improvement of Edit Distance Attacks / P.
                 Caballero-Gil / A. Fuster-Sabater \\
                 Equation-of-state Model for Temperature-responsive
                 Polymers with Tunable Response Onset / E. Manias and A.
                 M. Kisselev \\
                 Computer Design of Copolymers with Desired
                 Functionalities: Microphase Separation in Diblock
                 Copolymers with Amphiphilic Block / A. R. Khokhlov, Y.
                 A. Kriksin, I. Ya. Erukhimovich, and P. G. Khalatur \\
                 Simulation-based Evolutionary Method in Antenna Design
                 Optimization for WLAN and Wireless Communication
                 Applications / Y. Li, S.-M. Yu, Y.-T. Kuo, and Y.-L. Li
                 \\
                 Evolutionary Estimation of Diffusion Models in
                 Multi-generation NAND Flash Memory Using Genetic
                 Algorithm / Y. Li, S.-Y. Chiang, and K.-Y. Liou",
}

@Proceedings{Bruguera:2009:PIS,
  editor =       "Javier D. Bruguera and Marius Cornea and Debjit
                 DasSarma and John Harrison",
  booktitle =    "{Proceedings of the 19th IEEE Symposium on Computer
                 Arithmetic, June 8--10, 2009, Portland, Oregon, USA}",
  title =        "{Proceedings of the 19th IEEE Symposium on Computer
                 Arithmetic, June 8--10, 2009, Portland, Oregon, USA}",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "xi + 235",
  year =         "2009",
  ISBN =         "0-7695-3670-0, 1-4244-4329-6",
  ISBN-13 =      "978-0-7695-3670-5, 978-1-4244-4329-1",
  ISSN =         "1063-6889",
  LCCN =         "QA76.6 .S887 2009",
  bibdate =      "Fri Jun 12 12:24:37 2009",
  bibsource =    "http://www.ac.usc.es/arith19/;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/mathcw.bib",
  URL =          "http://www.ac.usc.es/arith19/",
  acknowledgement = ack-nhfb,
  keywords =     "ARITH-19",
  tableofcontents = "Keynote Talk \\
                 Anton: A Specialized Machine for Millisecond-Scale
                 Molecular Dynamics Simulations of Proteins / David E.
                 Shaw / 3 \\
                 Session 1: Algorithms and Number Systems \\
                 Efficient Data Structure and Algorithms for Sparse
                 Integers, Sets and Predicates / Jean E. Vuillemin / 7
                 \\
                 A Dual-Purpose Real/Complex Logarithmic Number System
                 ALU / Mark G. Arnold and Sylvain Collange / 15 \\
                 Selected RNS Bases for Modular Multiplication / J. C.
                 Bajard, M. Kaihara, and T. Plantard / 25 \\
                 Invited Talk \\
                 A Historical Perspective on Computer Arithmetic /
                 Stanley Mazor / 35 \\
                 Session 2: Arithmetic Hardware \\
                 Higher Radix Squaring Operations Employing
                 Left-to-Right Dual Recoding / David W. Matula / 39 \\
                 Advanced Clockgating Schemes for
                 Fused-Multiply-Add-Type Floating-Point Units / Jochen
                 Preiss, Maarten Boersma, and Silvia Melitta Mueller /
                 48 \\
                 Unified Approach to the Design of Modulo-$(2^n \pm 1)$
                 Adders Based on Signed-LSB Representation of Residues /
                 Ghassem Jaberipur and Behrooz Parhami / 57 \\
                 Session 3: Finite Fields and Cryptography \\
                 Subquadratic Space Complexity Multiplier for a Class of
                 Binary Fields Using Toeplitz Matrix Approach / M. A.
                 Hasan and C. Negre / 67 \\
                 Hybrid Binary-Ternary Joint Form and Its Application in
                 Elliptic Curve / Cryptography / Jithra Adikari, Vassil
                 Dimitrov, and Laurent Imbert / 76 \\
                 Polynomial Multiplication over Finite Fields Using
                 Field Extensions and Interpolation / Murat Cenk, Cetin
                 Kaya Koc, and Ferruh Ozbudak / 84 \\
                 Session 4: Mathematical Software \\
                 A New Binary Floating-Point Division Algorithm and Its
                 Software Implementation on the ST231 Processor /
                 Claude-Pierre Jeannerod, Herve Knochel, Christophe
                 Monat, Guillaume Revy, and Gilles Villard / 95 \\
                 Fast and Accurate Bessel Function Computation / John
                 Harrison / 104 \\
                 Implementation Specific Verification of Divide and
                 Square Root Instructions / Elena Guralnik, Ariel J.
                 Birnbaum, Anatoly Koyfinan, and Avi Kaplan / 114 \\
                 Session 5: Decimal Hardware \\
                 A Decimal Floating-Point Adder with Decoded Operands
                 and a Decimal Leading-Zero Anticipator / Liang-Kai Wang
                 and Michael J. Schulte / 125 \\
                 A High-Performance Significand BCD Adder with IEEE
                 754-2008 Decimal Rounding / Alvaro Vazquez and Elisardo
                 Antelo / 135 \\
                 Fully Redundant Decimal Arithmetic / Saeid Gorgin and
                 Ghassem Jaberipur / 145 \\
                 Session 6: Floating-Point Techniques \\
                 On the Computation of Correctly-Rounded Sums / P.
                 Kornerup, V. Lefevre, N. Louvet, and J. M. Muller / 155
                 \\
                 Multi-operand Floating-Point Addition / Alexandre F.
                 Tenca / 161 \\
                 Certified and Fast Computation of Supremum Norms of
                 Approximation Errors / Sylvain Chevillard, Mioara
                 Jolde{\c{s}}, and Christoph Lauter / 169 \\
                 Session 7: Decimal Transcendentals \\
                 Computation of Decimal Transcendental Functions Using
                 the CORDIC Algorithm / {\'A}lvaro V{\'a}zquez, Julio
                 Villalba, and Elisardo Antelo / 179 \\
                 Decimal Transcendentals via Binary / John Harrison /
                 187 \\
                 A 32-bit Decimal Floating-Point Logarithmic Converter /
                 Dongdong Chen, Yu Zhang, Younhee Choi, Moon Ho Lee, and
                 Seok-Bum Ko / 195 \\
                 Special Session on Automated Synthesis of Arithmetic
                 Operations \\
                 Datapath Synthesis for Standard-Cell Design / Reto
                 Zimmermann / 207 \\
                 Design Space Exploration for Power-Efficient
                 Mixed-Radix Ling Adders / Chung-Kuan Cheng / 212 \\
                 Challenges in Automatic Optimization of Arithmetic
                 Circuits / Ajay K. Verma, Philip Brisk, and Paolo Ienne
                 / 213 \\
                 Panel on Decimal Arithmetic in Industry \\
                 Energy and Delay Improvement via Decimal Floating Point
                 Units / Hossam A. H. Fahmy, Ramy Raafat, Amira M.
                 Abdel-Majeed, Rodina Samy, Torek ElDeeb, and Yasmin
                 Farouk / 221 \\
                 IEEE 754-2008 Decimal Floating-Point for Intel
                 Architecture Processors / Marius Cornea / 225 \\
                 Special Session on Interval Arithmetic \\
                 IEEE Interval Standard Working Group --- P1788: Current
                 Status / William Edmonson and Guillaume Melquiond / 231
                 \\
                 Author Index",
}

@Proceedings{Schwarz:2011:PIS,
  editor =       "Eric Schwarz and Vojin G. Oklobdzija",
  booktitle =    "{Proceedings of the 20th IEEE Symposium on Computer
                 Arithmetic, July 25--27, 2011, T{\"u}bingen, Germany}",
  title =        "{Proceedings of the 20th IEEE Symposium on Computer
                 Arithmetic, July 25--27, 2011, T{\"u}bingen, Germany}",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "xix + 253",
  year =         "2011",
  ISBN =         "0-7695-4318-9, 1-4244-9457-5",
  ISBN-13 =      "978-0-7695-4318-5, 978-1-4244-9457-6",
  LCCN =         "QA76.6",
  bibdate =      "Sat Aug 20 09:19:17 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/mathcw.bib",
  acknowledgement = ack-nhfb,
  keywords =     "ARITH-20",
  tableofcontents = "Foreword / ix \\
                 Dedication / x \\
                 Steering Committee / xv \\
                 Symposium Committee / xvi \\
                 Program Committee / xvii \\
                 Additional Reviewers / xviii \\
                 Corporate Sponsors / xix \\
                 Session 1: Keynote Talk: Chair: Eric Schwarz and Vojin
                 G. Oklobdzija \\
                 High Intelligence Computing: The New Era of High
                 Performance Computing / Ralf Fischer / 3 \\
                 Session 2: Multiple-Precision Algorithms: Chair: Marius
                 Cornea \\
                 Short Division of Long Integers / David Harvey and Paul
                 Zimmermann / 7 \\
                 High Degree Toom'n'Half for Balanced and Unbalanced
                 Multiplication / Marco Bodrato / 15 \\
                 Augmented Precision Square Roots and 2-D Norms, and
                 Discussion on Correctly Rounding sqrt($x^2 + y^2$) /
                 Nicolas Brisebarre, Mioara Jolde{\c{s}}, Peter
                 Kornerup, Erik Martin-Dorel, and Jean-Michel Muller /
                 23 \\
                 Session 3: Transcendental Methods: Chair: Naofumi
                 Takagi \\
                 Towards a Quaternion Complex Logarithmic Number System
                 / Mark G. Arnold, John Cowles, Vassilis Paliouras, and
                 Ioannis Kouretas / 33 \\
                 ROM-less LNS / R. Che Ismail and J. N. Coleman / 43 \\
                 Composite Iterative Algorithm and Architecture for q-th
                 Root Calculation / Alvaro Vazquez and Javier D.
                 Bruguera / 52 \\
                 On the Fixed-Point Accuracy Analysis and Optimization
                 of FFT Units with CORDIC Multipliers / Omid Sarbishei
                 and Katarzyna Radecka / 62 \\
                 Session 4: Special Session on Industrial Practices:
                 Chair: Mike Schulte \\
                 Self Checking in Current Floating-Point Units / Daniel
                 Lipetz and Eric Schwarz / 73 \\
                 How to Square Floats Accurately and Efficiently on the
                 ST231 Integer Processor/ Claude-Pierre Jeannerod,
                 Jingyan Jourdan-Lu, Christophe Monat, and Guillaume
                 Revy / 77 \\
                 A 1.5 Ghz VLIW DSP CPU with Integrated Floating Point
                 and Fixed Point Instructions in 40 nm CMOS / Timothy
                 Anderson, Due Bui, Shriram Moharil, Soujanya Narnur,
                 Mujibur Rahman, Anthony Lell, Eric Biscondi, Ashish
                 Shrivastava, Peter Dent, Mingjian Yan, and Hasan
                 Mahmood / 82 \\
                 The POWER7 Binary Floating-Point Unit / Maarten
                 Boersma, Michael Kroner, Christophe Layer, Petra Leber,
                 Silvia M. Muller, and Kerstin Schelm / 87 \\
                 Session 5: Addition: Chair: Alberto Nannarelli \\
                 Accelerating Computations on FPGA Carry Chains by
                 Operand Compaction / Thomas B. Preus{\ss}er, Martin
                 Zabel, and Rainer G. Spallek / 95 \\
                 Fast Ripple-Carry Adders in Standard-Cell CMOS VLSI /
                 Neil Burgess / 103 \\
                 A Family of High Radix Signed Digit Adders / Saeid
                 Gorgin and Ghassem Jaberipur / 112 \\
                 Session 6: Floating-Point Units: Chair: Javier Bruguera
                 \\
                 Fused Multiply-Add Microarchitecture Comprising
                 Separate Early-Normalizing Multiply and Add Pipelines /
                 David R. Lutz / 123 \\
                 Latency Sensitive FMA Design / Sameh Galal and Mark
                 Horowitz / 129 \\
                 The IBM zEnterprise-196 Decimal Floating-Point
                 Accelerator / Steven Carlough, Adam Collura, Silvia
                 Mueller, and Michael Kroener / 139 \\
                 Session 7: Division, Square-Root and Reciprocal
                 Square-Root: Chair: Peter Kornerup \\
                 Radix-8 Digit-by-Rounding: Achieving High-Performance
                 Reciprocals, Square Roots, and Reciprocal Square Roots
                 / J. Adam Butts, Ping Tak Peter Tang, Ron O. Dror, and
                 David E. Shaw / 149 \\
                 Tight Certification Techniques for Digit-by-Rounding
                 Algorithms with Application to a New 1/sqrt(x) Design /
                 Ping Tak Peter Tang, J. Adam Butts, Ron O. Dror, and
                 David E. Shaw / 159 \\
                 Radix-16 Combined Division and Square Root Unit /
                 Alberto Nannarelli / 169 \\
                 A Prescale-Lookup-Postscale Additive Procedure for
                 Obtaining a Single Precision Ulp Accurate Reciprocal /
                 David W. Matula and Mihai T. Panu / 177 \\
                 Session 8: Special Session on High Performance
                 Arithmetic for FPGA's: Chair: Martin Langhammer \\
                 Teraflop FPGA Design / Martin Langhammer / 187 \\
                 The Arithmetic Operators You Will Never See in a
                 Microprocessor / Florent de Dinechin / 189 \\
                 Accelerating Large-Scale HPC Applications Using FPGAs /
                 Rob Dimond, Sebastien Racaniere, and Oliver Pell / 191
                 \\
                 Session 9: Arithmetic Algorithms for Cryptography:
                 Chair: David Matula \\
                 A General Approach for Improving RNS Montgomery
                 Exponentiation Using Pre-processing / Filippo Gandino,
                 Fabrizio Lamberti, Paolo Montuschi, and Jean-Claude
                 Bajard / 195 \\
                 Bit-Sliced Binary Normal Basis Multiplication / Billy
                 Bob Brumley and Dan Page / 205 \\
                 Efficient SIMD Arithmetic Modulo a Mersenne Number /
                 Joppe W. Bos, Thorsten Kleinjung, Arjen K. Lenstra, and
                 Peter L. Montgomery / 213 \\
                 Session 10: Tools for Formal Certified Code: Chair:
                 Martin Schmookler \\
                 Automatic Generation of Code for the Evaluation of
                 Constant Expressions at Any Precision with a Guaranteed
                 Error Bound / Sylvain Chevillard / 225 \\
                 Automatic Generation of Fast and Certified Code for
                 Polynomial Evaluation / Christophe Mouilleron and
                 Guillaume Revy / 233 \\
                 Flocq: A Unified Library for Proving Floating-Point
                 Algorithms in Coq / Sylvie Boldo and Guillaume
                 Melquiond / 243 \\
                 Author Index / 253",
}