# bibtab

bibtype: book
filename: master.bib
label: Nemeth:2001:USA
title: UNIX System Administration Handbook
publisher: pub-PH
address: pub-PH:adr
edition: Third
pages: xxxv + 853
year: 2001
ISBN: 0-13-020601-6 OR 0130206016
ISBN13: 978-0-13-020601-5 OR 9780130206015
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
bibtimestamp: 2001.01.17 18:10:43 ???
URL: http://www.phptr.com/ptrbooks/ptr_0130206016.html
acknowledgement: ack-nhfb
rawtitle: {UNIX} System Administration Handbook
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

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.

TOC:
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

rawabstract:
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.

rawauthor:
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

rawTOC:
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

entry:
@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",
}


bibtype: book
filename: master.bib
label: 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) OR 0130084662 (paperback)
ISBN13: 978-0-13-008466-8 (paperback) OR 9780130084668 (paperback)
LCCN: QA76.76.O63 N448 2002
bibdate: Wed May 01 06:44:16 2002
bibtimestamp: 2002.05.01 06:44:16 ???
acknowledgement: ack-nhfb
rawauthor: Evi Nemeth and Garth Snyder and Trent Hein
rawtitle: {Linux} Administration Handbook
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

TOC:
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

rawTOC:
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

entry:
@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",
}


bibtype: book
filename: master.bib
label: 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 OR 0131480057
ISBN13: 978-0-13-148005-6 OR 9780131480056
LCCN: QA76.76.O63 N45 2010
bibdate: Mon Sep 27 11:07:42 MDT 2010
bibtimestamp: 2010.09.27 11:07:42 MDT
remark: Revised edition of cite Nemeth:2001:USA.
subject: Operating systems (Computers); UNIX (Computer file); Linux
acknowledgement: ack-nhfb
rawauthor: Evi Nemeth and Garth Snyder and Trent R. Hein and Ben Whaley
rawtitle: {UNIX} and {Linux} System Administration Handbook
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

TOC:
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

rawTOC:
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

entry:
@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",
}


bibtype: article
filename: master.bib
label: 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
monthnumber: 8
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
rawauthor: David Ness
rawnote: Proceedings of the Eighth Annual Meeting of the \TeX{} Users Group
rawtitle: The Use of {\TeX{}} in a Commercial Environment
entry:
@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,
}


bibtype: book
filename: master.bib
label: 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 OR 0307949427
ISBN13: 978-0-307-94942-4 OR 9780307949424
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
bibtimestamp: 2014.06.03 10:49:02 ???
subject: Survival; Extinction (Biology); Mass extinctions
acknowledgement: ack-nhfb
authordates: 1969--
rawauthor: Annalee Newitz
rawtitle: Scatter, Adapt, and Remember: How Humans Will Survive a Mass Extinction
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.

TOC:
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

rawabstract:
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.

rawTOC:
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

entry:
@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",
}


bibtype: book
filename: master.bib
label: 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 OR 0070463379
ISBN13: 978-0-07-046337-0 OR 9780070463370
LCCN: T385 .N48
bibdate: Wed Dec 15 10:40:01 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 10:40:01 ???
series: McGraw-Hill Computer Science Series, Editors: Richard W. Hamming and Edward A. Feigenbaum
acknowledgement: ack-nhfb
rawauthor: William M. Newman and Robert F. Sproull
rawtitle: Principles of Interactive Computer Graphics
entry:
@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,
}


bibtype: book
filename: master.bib
label: 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 OR 0070463387
ISBN13: 978-0-07-046338-7 OR 9780070463387
LCCN: T385 .N48 1979
bibdate: Wed Dec 15 11:09:22 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 11:09:22 ???
acknowledgement: ack-nhfb
rawauthor: William M. Newman and Robert F. Sproull
rawtitle: Principles of Interactive Computer Graphics
TOC:
Basic concepts Graphics packages Interactive graphics Raster graphics Three-dimensional graphics Graphic systems Vectors and matrices Homogeneous coordinate techniques

rawTOC:
Basic concepts \\ Graphics packages \\ Interactive graphics \\ Raster graphics \\ Three-dimensional graphics \\ Graphic systems \\ Vectors and matrices \\ Homogeneous coordinate techniques

entry:
@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",
}


bibtype: book
filename: master.bib
label: 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) OR 0674023374 (paperback)
ISBN13: 978-0-674-02337-6 (paperback) OR 9780674023376 (paperback)
LCCN: QC7 .N398 2007
bibdate: Tue Sep 21 14:18:56 MDT 2010
bibtimestamp: 2010.09.21 14:18:56 MDT
subject: Physics; History
acknowledgement: ack-nhfb
rawauthor: Roger G. Newton
rawtitle: From clockwork to crapshoot: a history of physics
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.

TOC:
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

rawabstract:
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.

rawTOC:
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

entry:
@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",
}


bibtype: book
filename: master.bib
label: 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 OR 0321515269
ISBN13: 978-0-321-51526-1 OR 9780321515261
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
bibtimestamp: 2010.04.05 18:03:24 MDT
URL: http://www.loc.gov/catdir/toc/ecip0720/2007023985.html
keywords: nVidia
subject: Computer graphics; Real-time programming
acknowledgement: ack-nhfb
raweditor: Hubert Nguyen
rawtitle: {GPU} gems 3
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.

TOC:
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

rawabstract:
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.

rawTOC:
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

entry:
@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",
}


bibtype: book
filename: master.bib
label: 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 OR 068806910X
ISBN13: 978-0-688-06910-0 OR 9780688069100
LCCN: QC774.N45 A3 1987
bibdate: Fri Aug 8 15:40:26 MDT 2008
bibtimestamp: 2008.08.08 15:40:26 MDT
subject: Nichols, Kenneth D; (Kenneth David); atomic bomb; United States; history; physicists; biography
acknowledgement: ack-nhfb
authordates: 1907--2001
rawauthor: {Major General} Kenneth D. (Kenneth David) Nichols
rawtitle: The road to {Trinity}: a personal account of how {America}'s nuclear policies were made
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

TOC:
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

rawTOC:
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

entry:
@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",
}


bibtype: book
filename: master.bib
label: 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
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
bibtimestamp: 2006.04.20 07:24:23 MDT
acknowledgement: ack-nhfb
subjectdates: Charles Darwin (1805--1865); Robert Fitzroy (1809--1882)
rawauthor: Peter Nichols
rawtitle: {Evolution}'s Captain: the Dark Fate of the Man Who Sailed {Charles Darwin} Around the World
ISBN:
0-06-008877-X (hardcover), 0-06-008878-8 (paperback) OR 006008877X (hardcover), 0060088788 (paperback)

ISBN13:
978-0-06-008877-4 (hardcover), 978-0-06-008878-1 (paperback) OR 9780060088774 (hardcover), 9780060088781 (paperback)

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.

subject:
Fitzroy, Robert; Darwin, Charles; Tierra del Fuego (Argentina and Chile); Description and travel; Magellan, Strait of (Chile and Argentina)

rawabstract:
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.

entry:
@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)",
}


bibtype: book
filename: master.bib
label: Nielson:1997:SVO
author: Gregory M. Nielson and Hans Hagen and Heinrich Muller
title: Scientific Visualization: Overviews, Methodologies, and Techniques
publisher: pub-IEEE
address: pub-IEEE:adr
pages: xiii + 577
year: 1997
ISBN: 0-8186-7777-5 OR 0818677775
ISBN13: 978-0-8186-7777-9 OR 9780818677779
LCCN: Q175.N438 1997
bibdate: Wed Jan 27 06:33:19 1999
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1999.01.27 06:33:19 ???
note: IEEE catalog number BP07777.
acknowledgement: ack-nhfb
rawauthor: Gregory M. Nielson and Hans Hagen and Heinrich M{\"u}ller
rawnote: IEEE catalog number BP07777.
rawtitle: Scientific Visualization: Overviews, Methodologies, and Techniques
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.

TOC:
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

rawabstract:
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.

rawTOC:
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

entry:
@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",
}


bibtype: book
filename: master.bib
label: 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 OR 0262539802 (paperback), 0262361000
ISBN13: 978-0-262-53980-7 (paperback), 978-0-262-36100-2 OR 9780262539807 (paperback), 9780262361002
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
bibtimestamp: 2023.08.21 14:51:26 MDT
URL: https://mitpress.mit.edu/search-result-list/?keyword=978-0-262-53980-7
subject: Electronic digital computers; computers; Programmierung; Datenverarbeitung; Computerarchitektur
acknowledgement: ack-nhfb
authordates: 1961--
rawauthor: Noam Nisan and Shimon Schocken
rawtitle: The Elements of Computing Systems Building a Modern Computer from First Principles
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.

TOC:
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

rawabstract:
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.

rawTOC:
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

entry:
@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",
}


bibtype: book
filename: master.bib
label: NISO:1991:EMP
author: National Information Standards Organization
publisher: pub-TRANSACTION
address: pub-TRANSACTION:adr
pages: xv + 167
year: 1991
ISBN: 0-88738-945-7 OR 0887389457
ISBN13: 978-0-88738-945-0 OR 9780887389450
LCCN: Z286.E43 E428 1991
bibdate: Thu Jun 23 16:40:14 1994
bibtimestamp: 1994.06.23 16:40:14 ???
acknowledgement: ack-nhfb
rawauthor: National Information Standards Organization
title:
Electronic Manuscript Preparation and Markup: American National Standard for Electronic Manuscript Preparation and Markup

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.

rawabstract:
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.

rawnote:
ANSI/NISO Z39.59-1988. Approved December 1, 1988, by American National Standards Institute. Developed by The National Information Standards Organization.

rawtitle:
Electronic Manuscript Preparation and Markup: American National Standard for Electronic Manuscript Preparation and Markup

entry:
@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.",
}


bibtype: book
filename: master.bib
label: 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) OR 0387303030 (hardcover)
ISBN13: 978-0-387-30303-1 (hardcover) OR 9780387303031 (hardcover)
LCCN: QA402.5 .N62 2006
bibdate: Mon May 5 12:41:59 MDT 2008
bibtimestamp: 2008.05.05 12:41:59 MDT
series: Springer series in operations research
subject: Mathematical optimization
acknowledgement: ack-nhfb
rawauthor: Jorge Nocedal and Stephen J. Wright
rawtitle: Numerical Optimization
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

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.

TOC:
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

rawabstract:
\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.

rawTOC:
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

entry:
@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",
}


bibtype: book
filename: master.bib
label: 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 OR 0893035564
ISBN13: 978-0-89303-556-3 OR 9780893035563
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
bibtimestamp: 1993.12.15 10:40:04 ???
note: An excellent treatment of the IBM PC.
acknowledgement: ack-nhfb
rawauthor: Peter Norton
rawnote: An excellent treatment of the IBM PC.
rawtitle: Inside the {IBM PC}. Access to Advanced Features and Programming
entry:
@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,
}


bibtype: book
filename: master.bib
label: 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 OR 0914845462
ISBN13: 978-0-914845-46-1 OR 9780914845461
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
bibtimestamp: 1994.07.06 14:06:05 ???
acknowledgement: ack-nhfb
rawauthor: Peter Norton
rawtitle: Programmer's Guide to the {IBM PC}
note:
An excellent treatment of the programming IBM PC. Strongly recommended for all serious users of the PC.

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

rawabstract:
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

rawnote:
An excellent treatment of the programming IBM PC. Strongly recommended for all serious users of the PC.

entry:
@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,
}


bibtype: book
filename: master.bib
label: 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 OR 067230614X
ISBN13: 978-0-672-30614-3 OR 9780672306143
LCCN: QA76.76.O63N6779 1994
bibdate: Fri Aug 21 12:55:48 1998
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1998.08.21 12:55:48 ???
acknowledgement: ack-nhfb
rawauthor: Peter Norton
rawtitle: {Peter Norton}'s complete guide to {DOS 6.22}
entry:
@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,
}


bibtype: book
filename: master.bib
label: 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 OR 0937175269, 0937175897
ISBN13: 978-0-937175-26-2, 978-0-937175-89-7 OR 9780937175262, 9780937175897
LCCN: QA76.76.W56 D44 v.1 1988
URL: http://www.oreilly.com/catalog/9780937175262
acknowledgement: ack-nhfb
rawauthor: Adrian Nye
rawtitle: {Xlib} Programming Manual for Version 11
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

entry:
@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,
}


bibtype: book
filename: master.bib
label: 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 OR 0937175277
ISBN13: 978-0-937175-27-9 OR 9780937175279
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
bibtimestamp: 1993.12.15 10:40:05 ???
acknowledgement: ack-nhfb
rawauthor: Adrian Nye
rawtitle: {Xlib} Reference Manual for Version 11
entry:
@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,
}


bibtype: book
filename: master.bib
label: 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 OR 0937175501
ISBN13: 978-0-937175-50-7 OR 9780937175507
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
bibtimestamp: 1993.12.10 13:42:12 ???
acknowledgement: ack-nhfb
rawauthor: Adrian Nye
rawtitle: {X} Protocol Reference Manual
entry:
@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.",
}


bibtype: book
filename: master.bib
label: 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 OR 093717534X
ISBN13: 978-0-937175-34-7 OR 9780937175347
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
bibtimestamp: 1993.12.15 19:46:34 ???
acknowledgement: ack-nhfb
rawauthor: Adrian Nye and Tim O'Reilly
rawtitle: {X} Toolkit Intrinsics Programming Manual
entry:
@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,
}


bibtype: book
filename: master.bib
label: Nye:1990:XTIb
author: Adrian Nye and Tim O'Reilly
title: X Toolkit Intrinsics Reference Manual: OSF / Motif 1.1 Edition for X11, Release 4
volume: 4
publisher: pub-ORA
address: pub-ORA:adr
edition: Second
pages: xxxi + 632
month: dec
monthnumber: 12
year: 1990
ISBN: 0-937175-62-5 (vol. 4), 0-937175-66-8 (set) OR 0937175625 (vol. 4), 0937175668 (set)
ISBN13: 978-0-937175-62-0 (vol. 4), 978-0-937175-66-8 (set) OR 9780937175620 (vol. 4), 9780937175668 (set)
LCCN: QA76.9.W56N94 1990
bibdate: Mon Nov 20 10:48:16 1995
bibtimestamp: 1995.11.20 10:48:16 ???
URL: http://www.oreilly.com/catalog/9780937175620
acknowledgement: ack-nhfb
rawauthor: Adrian Nye and Tim O'Reilly
rawtitle: {X} Toolkit Intrinsics Reference Manual: {OSF}\slash {Motif} 1.1 Edition for {X11}, Release 4
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

rawabstract:
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

entry:
@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,
}


bibtype: book
filename: master.bib
label: Nye:1992:XPR
author: Adrian Nye
title: X Protocol Reference Manual
volume: 0
publisher: pub-ORA
address: pub-ORA:adr
edition: Third
pages: xxxi + 632
year: 1992
ISBN: 1-56592-008-2 OR 1565920082
ISBN13: 978-1-56592-008-8 OR 9781565920088
LCCN: QA76.76.W56 X215 1990
bibdate: Fri Dec 10 13:42:12 1993
bibtimestamp: 1993.12.10 13:42:12 ???
URL: http://www.oreilly.com/catalog/9781565920088
acknowledgement: ack-nhfb
rawauthor: Adrian Nye
rawtitle: {X} Protocol Reference Manual
TOC:
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 WEIGHTNAME / 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

rawTOC:
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

entry:
@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",
}


bibtype: book
filename: master.bib
label: 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
monthnumber: 8
year: 1992
ISBN: 1-56592-013-9 OR 1565920139
ISBN13: 978-1-56592-013-2 OR 9781565920132
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
bibtimestamp: 1993.12.16 09:46:22 ???
acknowledgement: ack-nhfb
rawauthor: Adrian Nye and Tim O'Reilly
rawtitle: {X} Toolkit Intrinsics Programming Manual: Motif Edition
entry:
@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.",
}


bibtype: book
filename: master.bib
label: 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
monthnumber: 4
year: 1993
ISBN: 1-56592-003-1 OR 1565920031
ISBN13: 978-1-56592-003-3 OR 9781565920033
LCCN: QA76.76.W56 N945 1993
bibdate: Thu Dec 16 09:46:22 1993
bibtimestamp: 1993.12.16 09:46:22 ???
URL: http://www.oreilly.com/catalog/9781565920033
acknowledgement: ack-nhfb
rawauthor: Adrian Nye and Tim O'Reilly
rawtitle: {X Toolkit Intrinsics} Programming Manual
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.

TOC:
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

rawabstract:
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.

rawTOC:
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

entry:
@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",
}


bibtype: book
filename: master.bib
label: Nystrom:2021:CI
author: Robert Nystrom
title: Crafting Interpreters
publisher: Genever Benning
pages: vii + 626
year: 2021
ISBN: 0-9905829-3-0 OR 0990582930
ISBN13: 978-0-9905829-3-9 OR 9780990582939
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
bibtimestamp: 2021.12.15 15:48:20 MST
subject: Programmation; Langages de programmation
acknowledgement: ack-nhfb
rawauthor: Robert Nystrom
rawtitle: Crafting Interpreters
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.

TOC:
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

rawTOC:
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

entry:
@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",
}


bibtype: book
filename: master.bib
label: Oakley:1949:AG
author: C. O. Oakley
title: Analytic Geometry
publisher: pub-BARNES-NOBLE
address: pub-BARNES-NOBLE:adr
pages: vii + 626
year: 1949
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
series: College Outline Series
acknowledgement: ack-nhfb
rawauthor: C. O. Oakley
rawtitle: Analytic Geometry
entry:
@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,
}


bibtype: book
filename: master.bib
label: Oakley:1958:AGP
author: C. O. Oakley
title: Analytic Geometry Problems with Solutions
publisher: pub-BARNES-NOBLE
address: pub-BARNES-NOBLE:adr
pages: vii + 626
year: 1958
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
series: College Outline Series
acknowledgement: ack-nhfb
rawauthor: C. O. Oakley
rawtitle: Analytic Geometry Problems with Solutions
entry:
@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,
}


bibtype: book
filename: master.bib
label: 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) OR 0789720345, 0585344906 (ebook)
ISBN13: 978-0-7897-2034-4, 978-0-585-34490-4 (e-book) OR 9780789720344, 9780585344904 (ebook)
LCCN: TK5105.5 .O344 1999
bibdate: Wed May 16 14:58:17 2001
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2001.05.16 14:58:17 ???
note: Includes CD-ROM.
acknowledgement: ack-nhfb
annote: This book has excellent coverage of many aspects of network hardware and software.
rawauthor: Terry William Ogletree
rawnote: Includes CD-ROM.
rawtitle: Upgrading and Repairing Networks
entry:
@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.",
}


bibtype: book
filename: master.bib
label: 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 OR 0393062937
ISBN13: 978-0-393-06293-9 OR 9780393062939
LCCN: QC7 .O33 2008
bibdate: Thu Aug 21 17:35:23 MDT 2008
bibtimestamp: 2008.08.21 17:35:23 MDT
subject: Physics; History; Philosophy; Science; Einstein, Albert
acknowledgement: ack-nhfb
subjectdates: Albert Einstein (1879--1955)
rawauthor: Hans C. Ohanian
rawtitle: {Einstein}'s Mistakes: the Human Failings of Genius
TOC:
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

rawTOC:
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

entry:
@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",
}


bibtype: book
filename: master.bib
label: 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 OR 012525850X
ISBN13: 978-0-12-525850-0 OR 9780125258500
LCCN: QA351 .O481 1974
bibdate: Wed Dec 15 10:40:06 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 10:40:06 ???
acknowledgement: ack-nhfb
rawauthor: F. W. J. Olver
rawtitle: Asymptotics and Special Functions
subject:
Functions, Special; Asymptotic expansions; Differential equations; Numerical solutions; Fonctions speciales; Developpements asymptotiques; Equations differentielles; Solutions numeriques; Asymptotic expansions; Numerical solutions; Functions, Special; Reeksontwikkelingen; Asymptotisch gedrag; Differentiaalvergelijkingen; Asymptotik; Asymptotische Entwicklung; Differentialgleichung; Numerisches Verfahren; Spezielle Funktion.

TOC:
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 Poincare'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

shortTOC:
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

rawshortTOC:
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

rawTOC:
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

entry:
@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",
}


bibtype: book
filename: master.bib
label: 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 OR 0133343014
ISBN13: 978-0-13-334301-4 OR 9780133343014
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
bibtimestamp: 1995.12.09 11:57:03 ???
acknowledgement: ack-nhfb
rawauthor: Amos R. Omondi
rawtitle: Computer Arithmetic Systems: Algorithms, Architecture, and Implementation
TOC:
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

rawTOC:
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

entry:
@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",
}


bibtype: book
filename: master.bib
label: 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
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
bibtimestamp: 2017.03.20 18:07:07 MDT
acknowledgement: ack-nhfb
rawauthor: Cathy O'Neil
rawtitle: Weapons of math destruction: how big data increases inequality and threatens democracy
ISBN:
0-553-41881-5 (hardcover), 0-553-41883-1 (softcover), 0-553-41882-3 (e-book), 0-451-49733-3 (international edition) OR 0553418815 (hardcover), 0553418831 (softcover), 0553418823 (ebook), 0451497333 (international edition)

ISBN13:
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) OR 9780553418811 (hardcover), 9780553418835 (softcover), 9780553418828 (ebook), 9780451497338 (international edition)

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.

subject:
Big data; Social aspects; United States; Political aspects; Social indicators; Mathematical models; Moral and ethical aspects; Democracy; Social conditions; 21st century

TOC:
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

rawabstract:
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.

rawTOC:
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

entry:
@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",
}


bibtype: misc
filename: master.bib
label: ONW:awk
author: OpenNetwork
title: The Berkeley Utilities
pages: x + 259
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
rawauthor: {OpenNetwork}
rawnote: 215 Berkeley Place, Brooklyn, NY 11217, USA, Tel: (718) 398-3838.
rawtitle: {The Berkeley Utilities}
entry:
@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.",
}


bibtype: book
filename: master.bib
label: 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) OR 1565925653 (paperback)
ISBN13: 978-1-56592-565-6 (paperback) OR 9781565925656 (paperback)
LCCN: T385 .O68 1999
bibdate: Thu Apr 15 06:47:52 1999
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1999.04.15 06:47:52 ???
note: Covers Adobe Photoshop version 5.0.
URL: http://www.oreilly.com/catalog/photonut2/
TOC: Part I: Tools Part II: Menus Part III: Palettes
acknowledgement: ack-nhfb
rawauthor: Donnie O'Quinn
rawnote: Covers Adobe Photoshop version 5.0.
rawtitle: {Photoshop} in a Nutshell: a Desktop Quick Reference
rawTOC: Part I: Tools \\ Part II: Menus \\ Part III: Palettes
entry:
@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",
}


bibtype: book
filename: master.bib
label: 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 OR 0937175900
ISBN13: 978-0-937175-90-3 OR 9780937175903
LCCN: QA76.76.O63 T35 199
bibdate: Wed Dec 15 10:49:41 1993
bibtimestamp: 1993.12.15 10:49:41 ???
URL: http://www.oreilly.com/catalog/9780937175903; http://www.oreilly.com/catalog/make2
acknowledgement: ack-nhfb
rawauthor: Andrew Oram and Steve Talbott
rawtitle: Managing Projects with Make
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

TOC:
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

shortTOC:
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

rawshortTOC:
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

rawTOC:
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

entry:
@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",
}


bibtype: book
filename: master.bib
label: Orchin:1971:SOS
author: Milton Orchin and H. H. Jaffe
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 OR 0471655503
ISBN13: 978-0-471-65550-3 OR 9780471655503
LCCN: QD461.O73
bibdate: Sat Jul 25 13:55:27 1998
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1998.07.25 13:55:27 ???
acknowledgement: ack-nhfb
rawauthor: Milton Orchin and H. H. Jaff{\'e}
rawtitle: Symmetry, Orbitals, and Spectra ({S.O.S}.)
entry:
@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,
}


bibtype: book
filename: master.bib
label: 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
monthnumber: 3
year: 1988
ISBN: 0-937175-09-9 OR 0937175099
ISBN13: 978-0-937175-09-5 OR 9780937175095
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
bibtimestamp: 1993.12.15 10:40:12 ???
URL: http://www.oreilly.com/catalog/9780937175095
acknowledgement: ack-nhfb
rawauthor: Tim O'Reilly and Grace Todino
rawtitle: Managing {UUCP} and {Usenet}
entry:
@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,
}


bibtype: book
filename: master.bib
label: 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 OR 0937175293
ISBN13: 978-0-937175-29-3 OR 9780937175293
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
bibtimestamp: 1994.07.06 14:07:05 ???
acknowledgement: ack-nhfb
rawauthor: Tim O'Reilly and Valerie Quercia and Linda Lamb
rawtitle: {X} Window System User's Guide for Version 11
entry:
@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,
}


bibtype: book
filename: master.bib
label: 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 OR 0937175358
ISBN13: 978-0-937175-35-4 OR 9780937175354
LCCN: QA76.76.W56 D44 v.5 1990
bibdate: Wed Jul 6 13:50:20 1994
bibtimestamp: 1994.07.06 13:50:20 ???
URL: http://proquest.safaribooksonline.com/9780937175354
acknowledgement: ack-nhfb
rawauthor: Tim O'Reilly
rawtitle: {X Toolkit Intrinsics} Reference Manual
entry:
@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,
}


bibtype: book
filename: master.bib
label: 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 OR 1856355896
ISBN13: 978-1-85635-589-6 OR 9781856355896
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
bibtimestamp: 2009.10.26 18:09:07 MDT
TOC: Guernsey Friesack The SS Jagdverband mitte Aftermath
acknowledgement: ack-nhfb
subjectdates: 1920--; 1920--
rawauthor: Terence O'Reilly
rawtitle: {Hitler's Irishmen}
rawTOC: Guernsey \\ Friesack \\ The SS \\ Jagdverband mitte \\ Aftermath
subject:
Brady, James; Stringer, Frank; World War, 1939--1945; Collaborationists; Great Britain; Biography; Traitors; Ireland; Prisoners of war; Germany

entry:
@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",
}


bibtype: book
filename: master.bib
label: 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 OR 0262150123
ISBN13: 978-0-262-15012-5 OR 9780262150125
LCCN: QA76.5 O73
bibdate: Sat Feb 5 18:29:13 1994
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1994.02.05 18:29:13 ???
acknowledgement: ack-nhfb
rawauthor: Elliott I. Organick
rawtitle: The Multics System: An Examination of Its Structure
entry:
@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.",
}


bibtype: book
filename: master.bib
label: Organick:1973:CSO
author: Elliott I. Organick
title: Computer System Organization: The B5700 / B6700 Series
publisher: pub-ACADEMIC
address: pub-ACADEMIC:adr
pages: ix + 132
year: 1973
ISBN: 0-12-528250-8 OR 0125282508
ISBN13: 978-0-12-528250-5 OR 9780125282505
bibdate: Wed Jan 03 11:42:22 2024
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2024.01.03 11:42:22 ???
acknowledgement: ack-nhfb
rawauthor: Elliott I. Organick
rawtitle: Computer System Organization: The {B5700\slash B6700} Series
TOC:
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

rawTOC:
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

entry:
@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",
}


bibtype: book
filename: master.bib
label: 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 OR 0070477191
ISBN13: 978-0-07-047719-3 OR 9780070477193
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
bibtimestamp: 1994.01.29 22:36:47 ???
acknowledgement: ack-nhfb
rawauthor: Elliott I. Organick
rawtitle: A Programmer's View of the Intel 432 System
entry:
@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,
}


bibtype: book
filename: master.bib
label: 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 OR 0931988284
ISBN13: 978-0-931988-28-8 OR 9780931988288
LCCN: QA76.9.C66 .O8
bibdate: Wed Aug 10 09:51:35 1994
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1994.08.10 09:51:35 ???
acknowledgement: ack-nhfb
rawauthor: Adam Osborne
rawtitle: Running Wild: The Next Industrial Revolution
TOC:
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

rawTOC:
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

entry:
@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",
}


bibtype: book
filename: master.bib
label: 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 OR 0130435309
ISBN13: 978-0-13-043530-9 OR 9780130435309
LCCN: QA76.76.I57A665 1991
bibdate: Wed Dec 15 10:40:13 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 10:40:13 ???
acknowledgement: ack-nhfb
rawauthor: {Open Software Foundation}
rawtitle: Application Environment Specification {(AES)} User Environment Volume, Revision {B}
entry:
@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,
}


bibtype: book
filename: master.bib
label: OSF:1991:OMPa
author: Open Software Foundation
title: OSF / Motif Programmer's Guide, Revision 1.1
publisher: pub-PH
address: pub-PH:adr
pages: xii + 1084 + 12
year: 1991
ISBN: 0-13-640673-4 OR 0136406734
ISBN13: 978-0-13-640673-0 OR 9780136406730
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
bibtimestamp: 1993.12.15 10:40:18 ???
acknowledgement: ack-nhfb
rawauthor: {Open Software Foundation}
rawtitle: {OSF\slash Motif} Programmer's Guide, Revision 1.1
TOC:
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

rawTOC:
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

entry:
@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",
}


bibtype: book
filename: master.bib
label: OSF:1991:OMPb
author: Open Software Foundation
title: OSF / 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 OR 0136406815
ISBN13: 978-0-13-640681-5 OR 9780136406815
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
bibtimestamp: 1993.12.15 10:40:19 ???
acknowledgement: ack-nhfb
rawauthor: {Open Software Foundation}
rawtitle: {OSF\slash Motif} Programmer's Reference, Revision 1.1
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.

rawabstract:
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.

entry:
@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,
}


bibtype: book
filename: master.bib
label: OSF:1991:OMS
author: Open Software Foundation
title: OSF / Motif Style Guide
publisher: pub-PH
address: pub-PH:adr
pages: xii + 1212 + 15
year: 1991
ISBN: 0-13-640616-5 OR 0136406165
ISBN13: 978-0-13-640616-7 OR 9780136406167
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
bibtimestamp: 1993.12.15 10:40:31 ???
acknowledgement: ack-nhfb
rawauthor: {Open Software Foundation}
rawtitle: {OSF\slash Motif} Style Guide
TOC:
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

rawTOC:
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

entry:
@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",
}


bibtype: book
filename: master.bib
label: 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
bibtimestamp: 1998.07.25 13:55:27 ???
note: Reprint of the original 1937 edition.
acknowledgement: ack-nhfb
rawauthor: William Fogg Osgood
rawnote: Reprint of the original 1937 edition.
rawtitle: Mechanics
entry:
@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",
}


bibtype: book
filename: master.bib
label: OShea:2007:PCS
author: Donal O'Shea
title: The Poincare 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 OR 080271532X
ISBN13: 978-0-8027-1532-6 OR 9780802715326
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
bibtimestamp: 2007.04.13 16:39:37 MDT
acknowledgement: ack-nhfb
subjectdates: 1854--1912
rawauthor: Donal O'Shea
rawtitle: The {Poincar{\'e}} conjecture: in search of the shape of the universe
abstract:
Conceived in 1904, the Poincare 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.

subject:
Poincare, Henri; Perelman, Grigori; Algebraic topology; Mathematics; Awards; History; Mathematicians

TOC:
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 Poincare Poincare's topological papers The great savants The conjecture takes hold Higher dimensions A solution in the new millennium Madrid, August 2006.

rawabstract:
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.

rawTOC:
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.

entry:
@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.",
}


bibtype: book
filename: master.bib
label: Overton:2001:NCI
author: Michael L. Overton
publisher: pub-SIAM
address: pub-SIAM:adr
pages: xiv + 104
year: 2001
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
bibtimestamp: 2001.04.27 16:50:46 ???
URL: http://www.cs.nyu.edu/cs/faculty/overton/book/; http://www.siam.org/catalog/mcc07/ot76.htm
acknowledgement: ack-nhfb
rawauthor: Michael L. Overton
title:
Numerical Computing with IEEE Floating Point Arithmetic, Including One Theorem, One Rule of Thumb, and One Hundred and One Exercises

ISBN:
0-89871-482-6 (hardcover), 0-89871-571-7 (paperback), 0-89871-807-4 (ebook) OR 0898714826 (hardcover), 0898715717 (paperback), 0898718074 (ebook)

ISBN13:
978-0-89871-482-1 (hardcover), 978-0-89871-571-2 (print), 978-0-89871-807-2 (e-book) OR 9780898714821 (hardcover), 9780898715712 (print), 9780898718072 (ebook)

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

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.

TOC:
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

rawabstract:
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.

rawtitle:
Numerical Computing with {IEEE} Floating Point Arithmetic, Including One Theorem, One Rule of Thumb, and One Hundred and One Exercises

rawTOC:
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

entry:
@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",
}


bibtype: book
filename: master.bib
label: Paabo:2014:NMS
author: Svante Paabo
title: Neanderthal man: in search of lost genomes
publisher: pub-BASIC-BOOKS
address: pub-BASIC-BOOKS:adr
pages: ix + 275
year: 2014
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
bibtimestamp: 2015.04.01 18:20:07 MDT
acknowledgement: ack-nhfb
rawauthor: Svante P{\"a}{\"a}bo
rawtitle: {Neanderthal} man: in search of lost genomes
ISBN:
0-465-02083-6 (hardcover), 0-465-05495-1, 0-465-08068-5 (e-book) OR 0465020836 (hardcover), 0465054951, 0465080685 (ebook)

ISBN13:
978-0-465-02083-6 (hardcover), 978-0-465-05495-4, 978-0-465-08068-7 (e-book) OR 9780465020836 (hardcover), 9780465054954, 9780465080687 (ebook)

abstract:
What can we learn from the genes of our closest evolutionary relatives? booktitle Neanderthal Man tells the story of geneticist Svante Paabo'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 Paabo, 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, Paabo 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.

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.

TOC:
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

rawabstract:
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.

rawTOC:
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

entry:
@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",
}


bibtype: book
filename: master.bib
label: 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 OR 0716724286
ISBN13: 978-0-7167-2428-5 OR 9780716724285
LCCN: QA303.5.D37P33 1994
bibdate: Sat Mar 5 12:29:34 1994
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1994.03.05 12:29:34 ???
acknowledgement: ack-nhfb
rawauthor: Ed Packel and Stan Wagon
rawtitle: Animating Calculus: Mathematica Notebooks for the Laboratory
entry:
@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,
}


bibtype: book
filename: master.bib
label: 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 OR 1567311180
ISBN13: 978-1-56731-118-1 OR 9781567311181
LCCN: D247.H46 P33 1996
bibdate: Mon Oct 26 18:35:47 2009
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2009.10.26 18:35:47 ???
acknowledgement: ack-nhfb
rawauthor: Peter Padfield
rawtitle: {Himmler}: a Full-scale Biography of One of {Hitler}'s Most Ruthless Executioners
TOC:
Background Youth Revolutionary Reichsfuhrer-SS Night of the Long Knives Chief of the German Police Expansion War Racial warrior Endlosung Factory murder The Herrenmensch Chief of Intelligence The plot against Hitler Most powerful man in the Reich Fall from grace The end

rawTOC:
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

entry:
@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",
}


bibtype: book
filename: master.bib
label: 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 OR 0125434553, 012543457X
ISBN13: 978-0-12-543455-3, 978-0-12-543457-7 OR 9780125434553, 9780125434577
LCCN: T385 .G6935 1995b
bibdate: Mon Aug 24 17:06:31 1998
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1998.08.24 17:06:31 ???
series: Graphics Gems
acknowledgement: ack-nhfb
raweditor: Alan W. Paeth
rawtitle: Graphics Gems {V}
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, Bezier curves, and ray tracing.

TOC:
Polygons and Polyhedra Geometry Transformations Curves and Surfaces Ray Tracing Shading Frame Buffer Techniques Image Processing Graphic Design Utilities

rawabstract:
\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.

rawTOC:
Polygons and Polyhedra \\ Geometry \\ Transformations \\ Curves and Surfaces \\ Ray Tracing \\ Shading \\ Frame Buffer Techniques \\ Image Processing \\ Graphic Design \\ Utilities

entry:
@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",
}


bibtype: techreport
filename: master.bib
label: 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
monthnumber: 11
year: 1998
bibdate: Thu Oct 24 15:13:54 2002
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2002.10.24 15:13:54 ???
URL: http://dbpubs.stanford.edu/pub/1999-66
acknowledgement: ack-nhfb
annote: This is the Google search algorithm.
rawauthor: Lawrence Page and Sergey Brin and Rajeev Motwani and Terry Winograd
rawtitle: The {PageRank} Citation Ranking: Bringing Order to the Web
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.

rawabstract:
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.

entry:
@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.",
}


bibtype: book
filename: master.bib
label: 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) OR 0691138540, 1400830281 (ebook)
ISBN13: 978-0-691-13854-1, 978-1-4008-3028-2 (e-book) OR 9780691138541, 9781400830282 (ebook)
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
bibtimestamp: 2018.09.15 11:25:59 MDT
acknowledgement: ack-nhfb
rawauthor: Scott E. Page
rawtitle: The difference: how the power of diversity creates better groups, firms, schools, and societies
subject:
Diversity in the workplace; Multiculturalism; Diversiteit; Multiculturele samenlevingen; Groepsdynamica; Arbeids- en organisatiepsychologie; Probleemoplossing

TOC:
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

rawTOC:
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

entry:
@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",
}


bibtype: book
filename: master.bib
label: 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 OR 0671248022
ISBN13: 978-0-671-24802-4 OR 9780671248024
LCCN: QC174.13 .P33 1982
bibdate: Mon Jan 19 20:06:11 MST 2015
bibtimestamp: 2015.01.19 20:06:11 MST
subject: Quantum theory; Particles (Nuclear physics); Science; Philosophy
acknowledgement: ack-nhfb
authordates: 1939--
rawauthor: Heinz R. Pagels
rawtitle: The Cosmic Code: Quantum Physics as the Language of Nature
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

TOC:
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 Schrodinger'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

rawTOC:
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

entry:
@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",
}


bibtype: book
filename: master.bib
label: 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 OR 0553231286, 0553246259
ISBN13: 978-0-553-23128-1, 978-0-553-24625-4 OR 9780553231281, 9780553246254
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
bibtimestamp: 2018.12.01 16:21:16 MST
series: A Bantam new age book
acknowledgement: ack-nhfb
authordates: 1939--
rawauthor: Heinz R. Pagels
rawtitle: The Cosmic Code: Quantum Physics as the Language of Nature
subject:
Quantum theory; Particles (Nuclear physics); Science; Philosophy; Particles (Nuclear physics); Quantum theory.; Philosophy.

entry:
@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.",
}


bibtype: book
filename: master.bib
label: 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 OR 0671627082
ISBN13: 978-0-671-62708-9 OR 9780671627089
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
bibtimestamp: 1993.12.15 10:40:37 ???
acknowledgement: ack-nhfb
rawauthor: Heinz R. Pagels
rawtitle: The Dreams of Reason: The Computer and the Rise of the Sciences of Complexity
abstract:
Explains the new developments and the scientific impact of the computer as an instrument of the new sciences of complexity.

rawabstract:
Explains the new developments and the scientific impact of the computer as an instrument of the new sciences of complexity.

entry:
@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,
}


bibtype: book
filename: master.bib
label: 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) OR 0486485064 (paperback)
ISBN13: 978-0-486-48506-5 (paperback) OR 9780486485065 (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
bibtimestamp: 2015.01.19 20:06:11 MST
remark: Originally published cite Pagels:1982:CCQ.
subject: Quantum theory; Particles (Nuclear physics); Science; Philosophy; SCIENCE / Physics.
acknowledgement: ack-nhfb
authordates: 1939--
rawauthor: Heinz R. Pagels
rawtitle: The cosmic code: quantum physics as the language of nature
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].

TOC:
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 Schrodinger'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

rawabstract:
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].

rawTOC:
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

entry:
@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",
}


bibtype: book
filename: master.bib
label: 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 OR 0198520484 (paperback), 0198520492
ISBN13: 978-0-19-852048-1 (paperback), 978-0-19-852049-8 OR 9780198520481 (paperback), 9780198520498
LCCN: QC773 .P35 1991
bibdate: Fri Oct 27 14:20:50 MDT 2006
bibtimestamp: 2006.10.27 14:20:50 MDT
URL: http://www.loc.gov/catdir/enhancements/fy0635/90027248-d.html
subject: Nuclear physics; History; Bohr, Niels Henrik David
acknowledgement: ack-nhfb
subjectdates: 1885--1962
rawauthor: Abraham Pais
rawtitle: {Niels Bohr}'s times: in physics, philosophy, and polity
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

TOC:
1. A Dane for all seasons 2. `In Denmark I was bornldots ' 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

rawTOC:
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

entry:
@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",
}


bibtype: book
filename: master.bib
label: 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 OR 0198539940
ISBN13: 978-0-19-853994-0 OR 9780198539940
LCCN: QC16.E5 P25 1994
bibdate: Thu Oct 26 13:56:26 2006
bibtimestamp: 2006.10.26 13:56:26 ???
subject: Einstein, Albert; Physics; History; Physicists; Biography
acknowledgement: ack-nhfb
subjectdates: 1879--1955
rawauthor: Abraham Pais
rawtitle: {Einstein} lived here: essays for the layman
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.

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.

TOC:
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

rawabstract:
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.

rawTOC:
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

entry:
@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",
}


bibtype: book
filename: master.bib
label: 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 OR 0821821385
ISBN13: 978-0-8218-2138-1 OR 9780821821381
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
bibtimestamp: 2009.11.30 17:58:16 ???
series: Student mathematical library; IAS/Park City mathematical subseries
acknowledgement: ack-nhfb
rawauthor: Richard S. Palais and Robert A. Palais
rawtitle: Differential Equations, Mechanics, and Computation
subject:
Evolution equations; Differential equations, Linear; Numerical solutions; Differential equations; Mechanics

TOC:
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

rawTOC:
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

entry:
@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",
}


bibtype: book
filename: master.bib
label: 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) OR 0321193660 (paperback)
ISBN13: 978-0-321-19366-7 (paperback) OR 9780321193667 (paperback)
LCCN: QA76.76.O63 P335 2004
bibdate: Fri Apr 29 07:07:06 MDT 2005
bibtimestamp: 2005.04.29 07:07:06 MDT
acknowledgement: ack-nhfb
rawauthor: Brandon Palmer and Jose Nazario
rawtitle: Secure Architectures with {OpenBSD}
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.

subject:
OpenBSD (Electronic resource); Operating systems (Computers); Computer security; Computer architecture

TOC:
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

rawabstract:
\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.

rawTOC:
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

entry:
@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",
}


bibtype: book
filename: master.bib
label: 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 OR 0471875694
ISBN13: 978-0-471-87569-7 OR 9780471875697
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
bibtimestamp: 1993.12.15 10:40:38 ???
acknowledgement: ack-nhfb
rawauthor: John F. Palmer and Stephen P. Morse
rawtitle: The 8087 Primer
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.

rawnote:
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}.

entry:
@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,
}


bibtype: book
filename: master.bib
label: 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) OR 0500051771 (hardcover)
ISBN13: 978-0-500-05177-1 (hardcover) OR 9780500051771 (hardcover)
bibdate: Wed Aug 09 06:20:42 2017
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2017.08.09 06:20:42 ???
acknowledgement: ack-nhfb
rawauthor: Dimitra Papagianni and Michael A. Morse
rawtitle: The {Neanderthals} rediscovered: how modern science is rewriting their story
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.

subject:
Neanderthals; Human evolution; Fossil hominids; Human remains (Archaeology); Antiquities, Prehistoric; Antiquities, Prehistoric; Fossil hominids; Human evolution; Human remains (Archaeology); Neanderthals.

TOC:
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

rawabstract:
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.

rawTOC:
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

entry:
@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",
}


bibtype: book
filename: master.bib
label: 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
LCCN: QA76.9.C62P37 1999
bibdate: Sat Jun 17 12:26:40 2000
bibtimestamp: 2000.06.17 12:26:40 ???
acknowledgement: ack-nhfb
rawauthor: Behrooz Parhami
rawtitle: Computer Arithmetic: Algorithms and Hardware Designs
ISBN:
0-19-512583-5 (hardcover), 3-540-04907-X (print), 3-540-36246-0 (e-book) OR 0195125835 (hardcover), 354004907X (print), 3540362460 (ebook)

ISBN13:
978-0-19-512583-2 (hardcover), 978-3-540-04907-4 (print), 978-3-540-36246-3 (e-book) OR 9780195125832 (hardcover), 9783540049074 (print), 9783540362463 (ebook)

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

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.

TOC:
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

rawabstract:
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.

rawTOC:
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

entry:
@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",
}


bibtype: book
filename: master.bib
label: 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) OR 0465054382 (paperback)
ISBN13: 978-0-465-05438-1 (paperback) OR 9780465054381 (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
bibtimestamp: 2006.03.08 10:50:19 MST
subject: Invertebrates, Fossil; Paleontology; Cambrian; Burgess Shale (B.C.); Evolution (Biology)
acknowledgement: ack-nhfb
rawauthor: Andrew Parker
rawtitle: In the blink of an eye: how vision sparked the big bang of evolution
TOC:
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?

rawTOC:
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?

entry:
@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?",
}


bibtype: incollection
filename: master.bib
label: 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
rawauthor: Mike Parker
rawbooktitle: Output Hardcopy Devices
raweditor: Robert C. Durbeck and Sol Sherr
rawtitle: Printer Fonts
entry:
@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,
}


bibtype: book
filename: master.bib
label: 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 OR 0395291313
ISBN13: 978-0-395-29131-3 OR 9780395291313
LCCN: PN6231.M2 P297 1980
bibdate: Wed Jan 12 14:59:06 1994
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1994.01.12 14:59:06 ???
acknowledgement: ack-nhfb
rawauthor: Cyril Northcote Parkinson
rawtitle: Parkinson, the Law
entry:
@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,
}


bibtype: book
filename: master.bib
label: 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 OR 0138800472
ISBN13: 978-0-13-880047-5 OR 9780138800475
LCCN: QA188 .P3
MRclass: 65F15 (15A18)
MRnumber: MR570116 (81j:65063)
MRreviewer: Robert Todd Gregory
bibdate: Fri Nov 11 06:36:51 MST 2005
bibtimestamp: 2005.11.11 06:36:51 MST
note: Prentice-Hall Series in Computational Mathematics
series: Series in Computational Mathematics
ZMnumber: 0431.65017
acknowledgement: ack-nhfb
rawauthor: Beresford N. Parlett
rawnote: Prentice-Hall Series in Computational Mathematics
rawtitle: The Symmetric Eigenvalue Problem
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

keywords:
bandmatrices; bounds for eigenvalues; eigenvalues; generalized eigenvalue problem; Krylov sequences; localization of eigenvalues; orthogonal transformations; tridiagonal matrices; vector iteration

TOC:
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

shortTOC:
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

rawshortTOC:
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

rawTOC:
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

entry:
@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",
}


bibtype: book
filename: master.bib
label: 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) OR 0898714028 (paperback), 1611971160 (ebook)
LCCN: QA188 .P37 1998
MRclass: 65F15 (15A18)
MRnumber: MR1490034 (99c:65072)
MRreviewer: F. Szidarovszky
bibdate: Fri Nov 21 06:49:56 2014
bibtimestamp: 2014.11.21 06:49:56 ???
note: Corrected reprint cite Parlett:1980:SEP.
series: Classics in Applied Mathematics
URL: http://www.loc.gov/catdir/enhancements/fy0708/97040623-d.html
remark: Unabridged, corrected republication of the original edition (1980; Zbl 0431.65017)
ZMnumber: 0885.65039
acknowledgement: ack-njh
rawauthor: Beresford N. Parlett
rawnote: Corrected reprint \cite{Parlett:1980:SEP}.
rawtitle: The Symmetric Eigenvalue Problem
ISBN13:
978-0-89871-402-9 (paperback), 978-1-61197-116-3 (e-book) OR 9780898714029 (paperback), 9781611971163 (ebook)

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

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.

keywords:
bandmatrices; bounds for eigenvalues; eigenvalues; generalized eigenvalue problem; Krylov sequences; localization of eigenvalues; orthogonal transformations; tridiagonal matrices; vector iteration

TOC:
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

rawabstract:
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.

rawTOC:
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

entry:
@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",
}


