# bibtab

bibtype: book
filename: master.bib
label: Trott:2006:MGS
author: Michael Trott
title: The Mathematica Guidebook for Symbolics
publisher: pub-SV
address: pub-SV:adr
pages: xxxviii + 1453
year: 2006
ISBN: 0-387-95020-6 OR 0387950206
ISBN13: 978-0-387-95020-4 OR 9780387950204
LCCN: QA76.73.M29 T765 2006
bibdate: Wed Oct 4 11:03:45 MDT 2006
bibtimestamp: 2006.10.04 11:03:45 MDT
note: Includes CD-ROM.
keywords: Mathematica (computer file); mathematics -- data processing.
acknowledgement: ack-nhfb
rawauthor: Michael Trott
rawnote: Includes CD-ROM.
rawtitle: The {Mathematica} Guidebook for Symbolics
bibsource:
https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/mathematica.bib

TOC:
Introduction and Orientation I. Symbolic computations: Remarks Manipulation of polynomials Manipulations of rational functions of polynomials Manipulations of trigonometric expressions Systems of linear and nonlinear equations Classical analysis Differential equations Integral transforms and generalized functions Three applications Overview II Classical orthogonal polynomials: Remarks General properties of orthogonal polynomials Hermite polynomials Jacobi polynomials Gegenbauer polynomials Laguerre polynomials Legendre polynomials Chebyshev polynomials $T$ Chebyshev polynomials $U$ Relationships among the orthogonal polynomials Overview III Classical special functions: Remarks/Introduction Gamma, beta, and polygamma functions Error functions and Fresnel integrals Sine, cosine, exponential, and logarithmic integral functions Bessel and airy functions Legendre functions Hypergeometric functions Elliptic integrals Elliptic functions ProductLog function Mathieu functions Additional special functions Solution of quintics with hypergeometric functions Overview Index

rawTOC:
Introduction and Orientation \\ I. Symbolic computations: Remarks \\ Manipulation of polynomials \\ Manipulations of rational functions of polynomials \\ Manipulations of trigonometric expressions \\ Systems of linear and nonlinear equations \\ Classical analysis \\ Differential equations \\ Integral transforms and generalized functions \\ Three applications \\ Overview \\ II Classical orthogonal polynomials: Remarks \\ General properties of orthogonal polynomials \\ Hermite polynomials \\ Jacobi polynomials \\ Gegenbauer polynomials \\ Laguerre polynomials \\ Legendre polynomials \\ Chebyshev polynomials $T$ \\ Chebyshev polynomials $U$ \\ Relationships among the orthogonal polynomials \\ Overview \\ III Classical special functions: Remarks/Introduction \\ Gamma, beta, and polygamma functions \\ Error functions and Fresnel integrals \\ Sine, cosine, exponential, and logarithmic integral functions \\ Bessel and airy functions \\ Legendre functions \\ Hypergeometric functions \\ Elliptic integrals \\ Elliptic functions \\ ProductLog function \\ Mathieu functions \\ Additional special functions \\ Solution of quintics with hypergeometric functions \\ Overview \\ Index

entry:
@Book{Trott:2006:MGS,
  author =       "Michael Trott",
  title =        "The {Mathematica} Guidebook for Symbolics",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xxxviii + 1453",
  year =         "2006",
  ISBN =         "0-387-95020-6",
  ISBN-13 =      "978-0-387-95020-4",
  LCCN =         "QA76.73.M29 T765 2006",
  bibdate =      "Wed Oct 4 11:03:45 MDT 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/mathematica.bib",
  note =         "Includes CD-ROM.",
  acknowledgement = ack-nhfb,
  keywords =     "Mathematica (computer file); mathematics -- data
                 processing.",
  tableofcontents = "Introduction and Orientation \\
                 I. Symbolic computations: Remarks \\
                 Manipulation of polynomials \\
                 Manipulations of rational functions of polynomials \\
                 Manipulations of trigonometric expressions \\
                 Systems of linear and nonlinear equations \\
                 Classical analysis \\
                 Differential equations \\
                 Integral transforms and generalized functions \\
                 Three applications \\
                 Overview \\
                 II Classical orthogonal polynomials: Remarks \\
                 General properties of orthogonal polynomials \\
                 Hermite polynomials \\
                 Jacobi polynomials \\
                 Gegenbauer polynomials \\
                 Laguerre polynomials \\
                 Legendre polynomials \\
                 Chebyshev polynomials $T$ \\
                 Chebyshev polynomials $U$ \\
                 Relationships among the orthogonal polynomials \\
                 Overview \\
                 III Classical special functions: Remarks/Introduction
                 \\
                 Gamma, beta, and polygamma functions \\
                 Error functions and Fresnel integrals \\
                 Sine, cosine, exponential, and logarithmic integral
                 functions \\
                 Bessel and airy functions \\
                 Legendre functions \\
                 Hypergeometric functions \\
                 Elliptic integrals \\
                 Elliptic functions \\
                 ProductLog function \\
                 Mathieu functions \\
                 Additional special functions \\
                 Solution of quintics with hypergeometric functions \\
                 Overview \\
                 Index",
}


bibtype: book
filename: master.bib
label: Troutwine:2018:HCR
author: Brian L. Troutwine
publisher: pub-PACKT
address: pub-PACKT:adr
pages: v + 449
year: 2018
ISBN: 1-78839-997-8 (paperback), 1-78847-835-5 OR 1788399978 (paperback), 1788478355
ISBN13: 978-1-78839-997-5 (paperback), 978-1-78847-835-9 OR 9781788399975 (paperback), 9781788478359
LCCN: QA76.76.A65
bibdate: Tue Dec 10 05:53:29 MST 2019
bibtimestamp: 2019.12.10 05:53:29 MST
URL: http://proquest.safaribooksonline.com/?fpi=9781788399975
acknowledgement: ack-nhfb
rawauthor: Brian L. Troutwine
title:
Hands-on Concurrency with Rust: Confidently Build Memory-safe, Parallel, and Efficient Software in Rust

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

abstract:
Get to grips with modern software demands by learning the effective uses of Rust's powerful memory safety.Key Features Learn and improve the sequential performance characteristics of your software Understand the use of operating system processes in a high-scale concurrent system Learn of the various coordination methods available in the Standard library. Most programming languages can really complicate things, especially with regard to unsafe memory access. The burden on you, the programmer, lies across two domains: understanding the modern machine and your language's pain-points. This book will teach you to how to manage program performance on modern machines and build fast, memory-safe, and concurrent software in Rust. It starts with the fundamentals of Rust and discusses machine architecture concepts. You will be taken through ways to measure and improve the performance of Rust code systematically and how to write collections with confidence. You will learn about the Sync and Send traits applied to threads, and coordinate thread execution with locks, atomic primitives, data-parallelism, and more.The book will show you how to efficiently embed Rust in C++ code and explore the functionalities of various crates for multithreaded applications. It explores implementations in depth. You will know how a mutex works and build several yourself. You will master radically different approaches that exist in the ecosystem for structuring and managing high-scale systems. By the end of the book, you will feel comfortable with designing safe, consistent, parallel, and high-performance applications in Rust.What you will learn Probe your programs for performance and accuracy issues Create your own threading and multi-processing environment in Rust Use coarse locks from Rust's Standard library Solve common synchronization problems or avoid synchronization using atomic programming Build lock-free/wait-free structures in Rust and understand their implementations in the crates ecosystem Leverage Rust's memory model and type system to build safety properties into your parallel programs Understand the new features of the Rust programming language to ease the writing of parallel programs. Who this book is for. This book is aimed at software engineers with a basic understanding of Rust who want to exploit the parallel and concurrent nature of modern computing environments, safely.

subject:
Application software; Development; Computer multitasking; Programming languages (Electronic computers); Portable and handheld devices: consumer/user guides; Mobile phones: consumer/user guides; Parallel processing; Programming and scripting languages: general; Computers; Programming; Parallel; Hardware; Handheld Devices; Programming Languages; C; Development; Computer multitasking; Programming languages (Electronic computers)

rawabstract:
Get to grips with modern software demands by learning the effective uses of Rust's powerful memory safety.Key Features Learn and improve the sequential performance characteristics of your software Understand the use of operating system processes in a high-scale concurrent system Learn of the various coordination methods available in the Standard library. Most programming languages can really complicate things, especially with regard to unsafe memory access. The burden on you, the programmer, lies across two domains: understanding the modern machine and your language's pain-points. This book will teach you to how to manage program performance on modern machines and build fast, memory-safe, and concurrent software in Rust. It starts with the fundamentals of Rust and discusses machine architecture concepts. You will be taken through ways to measure and improve the performance of Rust code systematically and how to write collections with confidence. You will learn about the Sync and Send traits applied to threads, and coordinate thread execution with locks, atomic primitives, data-parallelism, and more.The book will show you how to efficiently embed Rust in C++ code and explore the functionalities of various crates for multithreaded applications. It explores implementations in depth. You will know how a mutex works and build several yourself. You will master radically different approaches that exist in the ecosystem for structuring and managing high-scale systems. By the end of the book, you will feel comfortable with designing safe, consistent, parallel, and high-performance applications in Rust.What you will learn Probe your programs for performance and accuracy issues Create your own threading and multi-processing environment in Rust Use coarse locks from Rust's Standard library Solve common synchronization problems or avoid synchronization using atomic programming Build lock-free/wait-free structures in Rust and understand their implementations in the crates ecosystem Leverage Rust's memory model and type system to build safety properties into your parallel programs Understand the new features of the Rust programming language to ease the writing of parallel programs. Who this book is for. This book is aimed at software engineers with a basic understanding of Rust who want to exploit the parallel and concurrent nature of modern computing environments, safely.

rawtitle:
Hands-on Concurrency with {Rust}: Confidently Build Memory-safe, Parallel, and Efficient Software in {Rust}

entry:
@Book{Troutwine:2018:HCR,
  author =       "Brian L. Troutwine",
  title =        "Hands-on Concurrency with {Rust}: Confidently Build
                 Memory-safe, Parallel, and Efficient Software in
                 {Rust}",
  publisher =    pub-PACKT,
  address =      pub-PACKT:adr,
  pages =        "v + 449",
  year =         "2018",
  ISBN =         "1-78839-997-8 (paperback), 1-78847-835-5",
  ISBN-13 =      "978-1-78839-997-5 (paperback), 978-1-78847-835-9",
  LCCN =         "QA76.76.A65",
  bibdate =      "Tue Dec 10 05:53:29 MST 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/multithreading.bib",
  URL =          "http://proquest.safaribooksonline.com/?fpi=9781788399975",
  abstract =     "Get to grips with modern software demands by learning
                 the effective uses of Rust's powerful memory safety.Key
                 Features Learn and improve the sequential performance
                 characteristics of your software Understand the use of
                 operating system processes in a high-scale concurrent
                 system Learn of the various coordination methods
                 available in the Standard library. Most programming
                 languages can really complicate things, especially with
                 regard to unsafe memory access. The burden on you, the
                 programmer, lies across two domains: understanding the
                 modern machine and your language's pain-points. This
                 book will teach you to how to manage program
                 performance on modern machines and build fast,
                 memory-safe, and concurrent software in Rust. It starts
                 with the fundamentals of Rust and discusses machine
                 architecture concepts. You will be taken through ways
                 to measure and improve the performance of Rust code
                 systematically and how to write collections with
                 confidence. You will learn about the Sync and Send
                 traits applied to threads, and coordinate thread
                 execution with locks, atomic primitives,
                 data-parallelism, and more.The book will show you how
                 to efficiently embed Rust in C++ code and explore the
                 functionalities of various crates for multithreaded
                 applications. It explores implementations in depth. You
                 will know how a mutex works and build several yourself.
                 You will master radically different approaches that
                 exist in the ecosystem for structuring and managing
                 high-scale systems. By the end of the book, you will
                 feel comfortable with designing safe, consistent,
                 parallel, and high-performance applications in
                 Rust.What you will learn Probe your programs for
                 performance and accuracy issues Create your own
                 threading and multi-processing environment in Rust Use
                 coarse locks from Rust's Standard library Solve common
                 synchronization problems or avoid synchronization using
                 atomic programming Build lock-free/wait-free structures
                 in Rust and understand their implementations in the
                 crates ecosystem Leverage Rust's memory model and type
                 system to build safety properties into your parallel
                 programs Understand the new features of the Rust
                 programming language to ease the writing of parallel
                 programs. Who this book is for. This book is aimed at
                 software engineers with a basic understanding of Rust
                 who want to exploit the parallel and concurrent nature
                 of modern computing environments, safely.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Application software; Development; Computer
                 multitasking; Programming languages (Electronic
                 computers); Portable and handheld devices:
                 consumer/user guides; Mobile phones: consumer/user
                 guides; Parallel processing; Programming and scripting
                 languages: general; Computers; Programming; Parallel;
                 Hardware; Handheld Devices; Programming Languages; C;
                 Development; Computer multitasking; Programming
                 languages (Electronic computers)",
}


bibtype: book
filename: master.bib
label: Truss:2003:ESL
author: Lynne Truss
title: Eats, Shoots & Leaves: The Zero Tolerance Approach to Punctuation
publisher: Gotham Books
address: New York, NY, USA
pages: xxvii + 209
year: 2003
ISBN: 1-59240-087-6, 1-59240-203-8 (paperback) OR 1592400876, 1592402038 (paperback)
ISBN13: 978-1-59240-087-4, 978-1-59240-203-8 (paperback) OR 9781592400874, 9781592402038 (paperback)
LCCN: PE1450 .T75 2004
bibdate: Wed Oct 13 14:33:40 2004
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2004.10.13 14:33:40 ???
acknowledgement: ack-nhfb
rawauthor: Lynne Truss
rawtitle: Eats, Shoots \& Leaves: The Zero Tolerance Approach to Punctuation
abstract:
We all know the basics of punctuation. Or do we? A look at most neighborhood signage tells a different story. Through sloppy usage and low standards on the internet, in email, and now text messages, we have made proper punctuation an endangered species. In Eats, Shoots and Leaves, former editor Lynne Truss dares to say, in her delightfully urbane, witty, and very English way, that it is time to look at our commas and semicolons and see them as the wonderful and necessary things they are. This is a book for people who love punctuation and get upset when it is mishandled. From the invention of the question mark in the time of Charlemagne to George Orwell shunning the semicolon, this lively history makes a powerful case for the preservation of a system of printing conventions that is much too subtle to be mucked about with.

TOC:
Foreword / Frank McCourt Publisher's note Preface Introduction: Seventh sense Tractable apostrophe That'll do, comma Airs and graces Cutting a dash Little used punctuation mark Merely conventional signs Bibliography

rawabstract:
We all know the basics of punctuation. Or do we? A look at most neighborhood signage tells a different story. Through sloppy usage and low standards on the internet, in email, and now text messages, we have made proper punctuation an endangered species. In Eats, Shoots and Leaves, former editor Lynne Truss dares to say, in her delightfully urbane, witty, and very English way, that it is time to look at our commas and semicolons and see them as the wonderful and necessary things they are. This is a book for people who love punctuation and get upset when it is mishandled. From the invention of the question mark in the time of Charlemagne to George Orwell shunning the semicolon, this lively history makes a powerful case for the preservation of a system of printing conventions that is much too subtle to be mucked about with.

rawTOC:
Foreword / Frank McCourt \\ Publisher's note \\ Preface \\ Introduction: Seventh sense \\ Tractable apostrophe \\ That'll do, comma \\ Airs and graces \\ Cutting a dash \\ Little used punctuation mark \\ Merely conventional signs \\ Bibliography

entry:
@Book{Truss:2003:ESL,
  author =       "Lynne Truss",
  title =        "Eats, Shoots \& Leaves: The Zero Tolerance Approach to
                 Punctuation",
  publisher =    "Gotham Books",
  address =      "New York, NY, USA",
  pages =        "xxvii + 209",
  year =         "2003",
  ISBN =         "1-59240-087-6, 1-59240-203-8 (paperback)",
  ISBN-13 =      "978-1-59240-087-4, 978-1-59240-203-8 (paperback)",
  LCCN =         "PE1450 .T75 2004",
  bibdate =      "Wed Oct 13 14:33:40 2004",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$17.50, CAN\$26.00",
  abstract =     "We all know the basics of punctuation. Or do we? A
                 look at most neighborhood signage tells a different
                 story. Through sloppy usage and low standards on the
                 internet, in email, and now text messages, we have made
                 proper punctuation an endangered species. In Eats,
                 Shoots and Leaves, former editor Lynne Truss dares to
                 say, in her delightfully urbane, witty, and very
                 English way, that it is time to look at our commas and
                 semicolons and see them as the wonderful and necessary
                 things they are. This is a book for people who love
                 punctuation and get upset when it is mishandled. From
                 the invention of the question mark in the time of
                 Charlemagne to George Orwell shunning the semicolon,
                 this lively history makes a powerful case for the
                 preservation of a system of printing conventions that
                 is much too subtle to be mucked about with.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Foreword / Frank McCourt \\
                 Publisher's note \\
                 Preface \\
                 Introduction: Seventh sense \\
                 Tractable apostrophe \\
                 That'll do, comma \\
                 Airs and graces \\
                 Cutting a dash \\
                 Little used punctuation mark \\
                 Merely conventional signs \\
                 Bibliography",
}


bibtype: book
filename: master.bib
label: Trzeciak:1995:WMP
author: Jerzy Trzeciak
title: Writing Mathematical Papers in English: a Practical Guide
publisher: European Mathematical Society Publishing House, Seminar for Applied Mathematics
address: Zurich, Switzerland
edition: Revised
pages: 49
year: 1995
DOI: https://doi.org/10.4171/014
ISBN: 3-03719-014-0, 83-85694-02-1 OR 3037190140, 8385694021
ISBN13: 978-3-03719-014-2, 978-83-85694-02-1 OR 9783037190142, 9788385694021
LCCN: QA42 .T79 1995
bibdate: Mon Oct 28 16:58:40 MDT 2013
bibtimestamp: 2013.10.28 16:58:40 MDT
URL: http://www.ems-ph.org/books/book.php?proj_nr=34
subject: Mathematics; Authorship; Technical writing; Handbooks, manuals, etc
acknowledgement: ack-nhfb
rawauthor: Jerzy Trzeciak
rawtitle: Writing Mathematical Papers in {English}: a Practical Guide
TOC:
Part A: Phrases Used in Mathematical Texts Abstract and introduction / 4 Definition / 6 Notation / 7 Property / 8 Assumption, condition, convention / 10 Theorem: general remarks / 12 Theorem: introductory phrase / 13 Theorem: formulation / 13 Proof: beginning / 14 Proof: arguments / 15 Proof: consecutive steps / 16 Proof: ``it is sufficient to'' / 17 Proof: ``it is easily seen that'' / 18 Proof: conclusion and remarks / 18 References to the literature / 19 Acknowledgments / 20 How to shorten the paper / 20 Editorial correspondence / 21 Referee's report / 21 Part B: Selected Problems of English Grammar Indefinite article (a, an, ---) / 23 Definite article (the) / 24 Article omission / 25 Infinitive / 27 Ing-form / 29 Passive voice / 31 Quantifiers / 32 Number, quantity, size / 34 How to avoid repetition / 38 Word order / 40 Where to insert a comma / 44 Hyphenation / 46 Some typical errors / 46 Index / 49

rawTOC:
Part A: Phrases Used in Mathematical Texts \\ Abstract and introduction / 4 \\ Definition / 6 \\ Notation / 7 \\ Property / 8 \\ Assumption, condition, convention / 10 \\ Theorem: general remarks / 12 \\ Theorem: introductory phrase / 13 \\ Theorem: formulation / 13 \\ Proof: beginning / 14 \\ Proof: arguments / 15 \\ Proof: consecutive steps / 16 \\ Proof: ``it is sufficient to'' / 17 \\ Proof: ``it is easily seen that'' / 18 \\ Proof: conclusion and remarks / 18 \\ References to the literature / 19 \\ Acknowledgments / 20 \\ How to shorten the paper / 20 \\ Editorial correspondence / 21 \\ Referee's report / 21 \\ Part B: Selected Problems of English Grammar \\ Indefinite article (a, an, ---) / 23 \\ Definite article (the) / 24 \\ Article omission / 25 \\ Infinitive / 27 \\ Ing-form / 29 \\ Passive voice / 31 \\ Quantifiers / 32 \\ Number, quantity, size / 34 \\ How to avoid repetition / 38 \\ Word order / 40 \\ Where to insert a comma / 44 \\ Hyphenation / 46 \\ Some typical errors / 46 Index / 49

entry:
@Book{Trzeciak:1995:WMP,
  author =       "Jerzy Trzeciak",
  title =        "Writing Mathematical Papers in {English}: a Practical
                 Guide",
  publisher =    "European Mathematical Society Publishing House,
                 Seminar for Applied Mathematics",
  address =      "Z{\"u}rich, Switzerland",
  edition =      "Revised",
  pages =        "49",
  year =         "1995",
  DOI =          "https://doi.org/10.4171/014",
  ISBN =         "3-03719-014-0, 83-85694-02-1",
  ISBN-13 =      "978-3-03719-014-2, 978-83-85694-02-1",
  LCCN =         "QA42 .T79 1995",
  bibdate =      "Mon Oct 28 16:58:40 MDT 2013",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  URL =          "http://www.ems-ph.org/books/book.php?proj_nr=34",
  acknowledgement = ack-nhfb,
  subject =      "Mathematics; Authorship; Technical writing; Handbooks,
                 manuals, etc",
  tableofcontents = "Part A: Phrases Used in Mathematical Texts \\
                 Abstract and introduction / 4 \\
                 Definition / 6 \\
                 Notation / 7 \\
                 Property / 8 \\
                 Assumption, condition, convention / 10 \\
                 Theorem: general remarks / 12 \\
                 Theorem: introductory phrase / 13 \\
                 Theorem: formulation / 13 \\
                 Proof: beginning / 14 \\
                 Proof: arguments / 15 \\
                 Proof: consecutive steps / 16 \\
                 Proof: ``it is sufficient to'' / 17 \\
                 Proof: ``it is easily seen that'' / 18 \\
                 Proof: conclusion and remarks / 18 \\
                 References to the literature / 19 \\
                 Acknowledgments / 20 \\
                 How to shorten the paper / 20 \\
                 Editorial correspondence / 21 \\
                 Referee's report / 21 \\
                 Part B: Selected Problems of English Grammar \\
                 Indefinite article (a, an, ---) / 23 \\
                 Definite article (the) / 24 \\
                 Article omission / 25 \\
                 Infinitive / 27 \\
                 Ing-form / 29 \\
                 Passive voice / 31 \\
                 Quantifiers / 32 \\
                 Number, quantity, size / 34 \\
                 How to avoid repetition / 38 \\
                 Word order / 40 \\
                 Where to insert a comma / 44 \\
                 Hyphenation / 46 \\
                 Some typical errors / 46 Index / 49",
}


bibtype: article
filename: master.bib
label: Tsuji:structured-fortran
author: Tatsui Tsuji and Katsumasa Watanabe
title: Structured Fortran Preprocessors Generating Optimized Output
journal: j-SPE
volume: 18
number: 5
pages: 427--442
month: may
monthnumber: 5
year: 1988
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
acknowledgement: ack-nhfb
rawauthor: Tatsui Tsuji and Katsumasa Watanabe
rawtitle: Structured {Fortran} Preprocessors Generating Optimized Output
entry:
@Article{Tsuji:structured-fortran,
  author =       "Tatsui Tsuji and Katsumasa Watanabe",
  title =        "Structured {Fortran} Preprocessors Generating
                 Optimized Output",
  journal =      j-SPE,
  volume =       "18",
  number =       "5",
  pages =        "427--442",
  month =        may,
  year =         "1988",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Tucker:1977:PL
author: Allen B. Tucker, Jr.
title: Programming Languages
publisher: pub-MCGRAW-HILL
address: pub-MCGRAW-HILL:adr
pages: xv + 439
year: 1977
ISBN: 0-07-065415-8 OR 0070654158
ISBN13: 978-0-07-065415-0 OR 9780070654150
LCCN: QA76.7 T8 1977
bibdate: Wed Dec 15 10:58:52 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 10:58:52 ???
series: McGraw-Hill Computer Science Series, Editor: Richard W. Hamming and Edward A. Feigenbaum
TOC: ALGOL FORTRAN COBOL PL/I RPG SNOBOL Comparative evaluation and conclusions
acknowledgement: ack-nhfb
rawauthor: Allen B. {Tucker, Jr.}
rawtitle: Programming Languages
rawTOC: ALGOL \\ FORTRAN \\ COBOL \\ PL/I \\ RPG \\ SNOBOL \\ Comparative evaluation and conclusions
entry:
@Book{Tucker:1977:PL,
  author =       "Allen B. {Tucker, Jr.}",
  title =        "Programming Languages",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "xv + 439",
  year =         "1977",
  ISBN =         "0-07-065415-8",
  ISBN-13 =      "978-0-07-065415-0",
  LCCN =         "QA76.7 T8 1977",
  bibdate =      "Wed Dec 15 10:58:52 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "McGraw-Hill Computer Science Series, Editor: Richard
                 W. Hamming and Edward A. Feigenbaum",
  acknowledgement = ack-nhfb,
  tableofcontents = "ALGOL \\
                 FORTRAN \\
                 COBOL \\
                 PL/I \\
                 RPG \\
                 SNOBOL \\
                 Comparative evaluation and conclusions",
}


bibtype: book
filename: master.bib
label: Tufte:1983:VDQ
author: Edward R. Tufte
title: The Visual Display of Quantitative Information
publisher: pub-GRAPHICS-PRESS
address: pub-GRAPHICS-PRESS:adr
pages: 197
year: 1983
ISBN: 0-9613921-0-X, 0-9613921-4-2 OR 096139210X, 0961392142
ISBN13: 978-0-9613921-0-9, 978-0-9613921-4-7 OR 9780961392109, 9780961392147
LCCN: K27.S8 T84
bibdate: Wed Dec 15 10:58:53 1993
bibtimestamp: 1993.12.15 10:58:53 ???
acknowledgement: ack-nhfb
authordates: 1942--
rawauthor: Edward R. Tufte
rawtitle: The Visual Display of Quantitative Information
bibsource:
https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib; https://www.math.utah.edu/pub/bibnet/subjects/han-wri-mat-sci-2ed.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/texbook3.bib; https://www.math.utah.edu/pub/tex/bib/typeset.bib

abstract:
The subject of this book is on statistical graphics, charts, tables. It deals with the theory and practice in the design of data graphics, and includes 250 illustrations of the best (and a few of the worst) statistical graphics, with detailed analysis of how to display data for precise, effective, quick analysis. Also offered is information on the design of the high-resolution displays, small multiples, editing and improving graphics, and the data-ink ratio. Time-series, relational graphics, data maps, multivariate designs, as well as detection of graphical deception: design variation vs. data variation, and sources of deception are discussed. Information on aesthetics and data graphical displays is included.

subject:
Statistics; Graphic methods; Charts, diagrams, etc.; Statistical analysis; Statistique; Methodes graphiques; Tableaux, graphiques, etc.; Graphiques; Statistique; Conception assistee par ordinateur; Statistics; Graphic methods; Kwantitatieve gegevens; Grafische voorstellingen; Graphische Darstellung; Statistik; Statistik; Estatistica Descritiva; Matematica; Statistics --- Graphic methods; Graphische Darstellung; Statistik

TOC:
Graphical Practice Graphical excellence / 13 Graphical integrity / 53 Sources of graphical integrity and sophistication / 79 Theory of Data Graphics Data-ink and graphical redesign / 91 Chartjunk: vibrations, grids, and ducks / 107 Data-ink maximization and graphical design / 123 Multifunctioning graphical elements / 139 Data density and small multiples / 161 Aesthetics and technique in data graphical design / 177 Epilogue: Designs for the Display of Information / 191

rawabstract:
The subject of this book is on statistical graphics, charts, tables. It deals with the theory and practice in the design of data graphics, and includes 250 illustrations of the best (and a few of the worst) statistical graphics, with detailed analysis of how to display data for precise, effective, quick analysis. Also offered is information on the design of the high-resolution displays, small multiples, editing and improving graphics, and the data-ink ratio. Time-series, relational graphics, data maps, multivariate designs, as well as detection of graphical deception: design variation vs. data variation, and sources of deception are discussed. Information on aesthetics and data graphical displays is included.

rawTOC:
Graphical Practice \\ Graphical excellence / 13 \\ Graphical integrity / 53 \\ Sources of graphical integrity and sophistication / 79 \\ Theory of Data Graphics \\ Data-ink and graphical redesign / 91 \\ Chartjunk: vibrations, grids, and ducks / 107 \\ Data-ink maximization and graphical design / 123 \\ Multifunctioning graphical elements / 139 \\ Data density and small multiples / 161 \\ Aesthetics and technique in data graphical design / 177 \\ Epilogue: Designs for the Display of Information / 191

entry:
@Book{Tufte:1983:VDQ,
  author =       "Edward R. Tufte",
  title =        "The Visual Display of Quantitative Information",
  publisher =    pub-GRAPHICS-PRESS,
  address =      pub-GRAPHICS-PRESS:adr,
  pages =        "197",
  year =         "1983",
  ISBN =         "0-9613921-0-X, 0-9613921-4-2",
  ISBN-13 =      "978-0-9613921-0-9, 978-0-9613921-4-7",
  LCCN =         "K27.S8 T84",
  bibdate =      "Wed Dec 15 10:58:53 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
                 https://www.math.utah.edu/pub/bibnet/subjects/han-wri-mat-sci-2ed.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib;
                 https://www.math.utah.edu/pub/tex/bib/typeset.bib",
  price =        "US\$34.00",
  abstract =     "The subject of this book is on statistical graphics,
                 charts, tables. It deals with the theory and practice
                 in the design of data graphics, and includes 250
                 illustrations of the best (and a few of the worst)
                 statistical graphics, with detailed analysis of how to
                 display data for precise, effective, quick analysis.
                 Also offered is information on the design of the
                 high-resolution displays, small multiples, editing and
                 improving graphics, and the data-ink ratio.
                 Time-series, relational graphics, data maps,
                 multivariate designs, as well as detection of graphical
                 deception: design variation vs. data variation, and
                 sources of deception are discussed. Information on
                 aesthetics and data graphical displays is included.",
  acknowledgement = ack-nhfb,
  author-dates = "1942--",
  subject =      "Statistics; Graphic methods; Charts, diagrams, etc.;
                 Statistical analysis; Statistique; M{\'e}thodes
                 graphiques; Tableaux, graphiques, etc.; Graphiques;
                 Statistique; Conception assist{\'e}e par ordinateur;
                 Statistics; Graphic methods; Kwantitatieve gegevens;
                 Grafische voorstellingen; Graphische Darstellung;
                 Statistik; Statistik; Estatistica Descritiva;
                 Matematica; Statistics --- Graphic methods; Graphische
                 Darstellung; Statistik",
  tableofcontents = "Graphical Practice \\
                 Graphical excellence / 13 \\
                 Graphical integrity / 53 \\
                 Sources of graphical integrity and sophistication / 79
                 \\
                 Theory of Data Graphics \\
                 Data-ink and graphical redesign / 91 \\
                 Chartjunk: vibrations, grids, and ducks / 107 \\
                 Data-ink maximization and graphical design / 123 \\
                 Multifunctioning graphical elements / 139 \\
                 Data density and small multiples / 161 \\
                 Aesthetics and technique in data graphical design / 177
                 \\
                 Epilogue: Designs for the Display of Information /
                 191",
}


bibtype: book
filename: master.bib
label: Tufte:1990:EI
author: Edward R. Tufte
title: Envisioning Information
publisher: pub-GRAPHICS-PRESS
address: pub-GRAPHICS-PRESS:adr
pages: 126
year: 1990
LCCN: P93.5 .T84 1990
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
acknowledgement: ack-nhfb
rawauthor: Edward R. Tufte
rawtitle: Envisioning Information
entry:
@Book{Tufte:1990:EI,
  author =       "Edward R. Tufte",
  title =        "Envisioning Information",
  publisher =    pub-GRAPHICS-PRESS,
  address =      pub-GRAPHICS-PRESS:adr,
  pages =        "126",
  year =         "1990",
  LCCN =         "P93.5 .T84 1990",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$48.00",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}


bibtype: book
filename: master.bib
label: Tufte:1997:VEI
author: Edward R. Tufte
title: Visual Explanations: Images and Quantities, Evidence and Narrative
publisher: pub-GRAPHICS-PRESS
address: pub-GRAPHICS-PRESS:adr
pages: 156 + 2
year: 1997
ISBN: 0-9613921-2-6 OR 0961392126
ISBN13: 978-0-9613921-2-3 OR 9780961392123
LCCN: P93.5.T846 1997
bibdate: Thu Aug 07 13:39:07 1997
bibtimestamp: 1997.08.07 13:39:07 ???
acknowledgement: ack-nhfb
rawauthor: Edward R. Tufte
rawtitle: Visual Explanations: Images and Quantities, Evidence and Narrative
abstract:
Tufte discusses design strategies for effectively presenting information about change -- motion, process, mechanism, cause and effect -- in print, in presentations, and on the computer screen. The first section of the book discusses the history behind our current methods of depicting information, such as graphs, pie charts, and topographic maps. The second part of the book considers strategies that can be used to arrange information in a more visually exciting way, not only on the printed page but also on the video and computer screen, and examines the design of computer interfaces and Web sites, whose limited screen resolution makes the presentation of text and graphics particularly challenging.

TOC:
1: Images and quantities 2: Visual and statistical thinking: displays of evidence for making decisions 3: Explaining magic: pictorial instructions and disinformation design 4: Small effective difference 5: Parallelism: repetition and change, comparison and surprise 6: Multiples in space and time 7: Visual confections: juxtapositions from the ocean of the streams of story

rawabstract:
Tufte discusses design strategies for effectively presenting information about change -- motion, process, mechanism, cause and effect -- in print, in presentations, and on the computer screen. The first section of the book discusses the history behind our current methods of depicting information, such as graphs, pie charts, and topographic maps. The second part of the book considers strategies that can be used to arrange information in a more visually exciting way, not only on the printed page but also on the video and computer screen, and examines the design of computer interfaces and Web sites, whose limited screen resolution makes the presentation of text and graphics particularly challenging.

rawTOC:
1: Images and quantities \\ 2: Visual and statistical thinking: displays of evidence for making decisions \\ 3: Explaining magic: pictorial instructions and disinformation design \\ 4: Small effective difference \\ 5: Parallelism: repetition and change, comparison and surprise \\ 6: Multiples in space and time \\ 7: Visual confections: juxtapositions from the ocean of the streams of story

entry:
@Book{Tufte:1997:VEI,
  author =       "Edward R. Tufte",
  title =        "Visual Explanations: Images and Quantities, Evidence
                 and Narrative",
  publisher =    pub-GRAPHICS-PRESS,
  address =      pub-GRAPHICS-PRESS:adr,
  pages =        "156 + 2",
  year =         "1997",
  ISBN =         "0-9613921-2-6",
  ISBN-13 =      "978-0-9613921-2-3",
  LCCN =         "P93.5.T846 1997",
  bibdate =      "Thu Aug 07 13:39:07 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  price =        "US\$45.00",
  abstract =     "Tufte discusses design strategies for effectively
                 presenting information about change -- motion, process,
                 mechanism, cause and effect -- in print, in
                 presentations, and on the computer screen. The first
                 section of the book discusses the history behind our
                 current methods of depicting information, such as
                 graphs, pie charts, and topographic maps. The second
                 part of the book considers strategies that can be used
                 to arrange information in a more visually exciting way,
                 not only on the printed page but also on the video and
                 computer screen, and examines the design of computer
                 interfaces and Web sites, whose limited screen
                 resolution makes the presentation of text and graphics
                 particularly challenging.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Images and quantities \\
                 2: Visual and statistical thinking: displays of
                 evidence for making decisions \\
                 3: Explaining magic: pictorial instructions and
                 disinformation design \\
                 4: Small effective difference \\
                 5: Parallelism: repetition and change, comparison and
                 surprise \\
                 6: Multiples in space and time \\
                 7: Visual confections: juxtapositions from the ocean of
                 the streams of story",
}


bibtype: book
filename: master.bib
label: Turabian:2007:MWR
editor: Kate L. Turabian
publisher: pub-U-CHICAGO
address: pub-U-CHICAGO:adr
edition: Seventh
pages: xviii + 466
year: 2007
ISBN: 0-226-82336-9 (cloth), 0-226-82337-7 (paperback) OR 0226823369 (cloth), 0226823377 (paperback)
LCCN: LB2369 .T8 2007; LB2369 .T87 2007
bibdate: Fri Jan 8 15:21:54 MST 2010
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; melvyl.cdlib.org:210/CDL90
bibtimestamp: 2010.01.08 15:21:54 MST
series: Chicago guides to writing, editing, and publishing
acknowledgement: ack-nhfb
raweditor: Kate L. Turabian
title:
A manual for writers of research papers, theses, and dissertations: Chicago style for students and researchers

ISBN13:
978-0-226-82336-2 (cloth), 978-0-226-82337-9 (paperback) OR 9780226823362 (cloth), 9780226823379 (paperback)

note:
Revised by Wayne C. Booth, Gregory G. Colomb, Joseph M. Williams, and the University of Chicago Press editorial staff

URL:
http://www.loc.gov/catdir/enhancements/fy0707/2006025443-b; http://www.loc.gov/catdir/enhancements/fy0707/2006025443-b.html; http://www.loc.gov/catdir/enhancements/fy0707/2006025443-d; http://www.loc.gov/catdir/enhancements/fy0707/2006025443-d.html; http://www.loc.gov/catdir/toc/ecip0618/2006025443; http://www.loc.gov/catdir/toc/ecip0618/2006025443.html

subject:
Dissertations, Academic; Handbooks, manuals, etc; Academic writing; Writing; Handbooks, Dissertations, Academic as Topic

TOC:
A note to students Preface Acknowledgments Part 1. Research and writing: from planning to production / Wayne C. Booth, Gregory G. Colomb, and Joseph M. Williams Overview of part 1 1. What research is and how researchers think about it 1.1. How researchers think about their aims 1.2. Three kinds of questions that researchers ask 2. Moving from a topic to a question to a working hypothesis 2.1. Find a question in your topic 2.2. Propose some working answers 2.3. Build a storyboard to plan and guide your work 2.4. Organize a writing support group 3. Finding useful sources 3.1. Understand the kinds of sources readers expect you to use 3.2. Record your sources fully, accurately, and appropriately 3.3. Search for sources systematically 3.4. Evaluate sources for relevance and reliability 3.5. Look beyond the usual kinds of references 4. Engaging sources 4.1. Read generously to understand, then critically to engage and evaluate 4.2. Take notes systematically 4.3. Take useful notes 4.4. Write as you read 4.5. Review your progress 4.6. Manage moments of normal panic 5. Planning your argument 5.1. What a research argument is and is not 5.2. Build your argument around answers to readers' questions 5.3. Turn your working hypothesis into a claim 5.4. Assemble the elements of your argument 5.5. Distinguish arguments based on evidence from arguments based on warrants 5.6. Assemble an argument 6. Planning a first draft 6.1. Avoid unhelpful plans 6.2. Create a plan that meets your readers' needs 6.3. File away leftovers 7. Drafting your report 7.1. Draft in the way that feels most comfortable 7.2. Develop productive drafting habits 7.3. Use your key terms to keep yourself on track 7.4. Quote, paraphrase, and summarize appropriately 7.5. Integrate quotations into your text 7.6. Use footnotes and endnotes judiciously 7.7. Interpret complex or detailed evidence before you offer it 7.8. Be open to surprises 7.9. Guard against inadvertent plagiarism 7.10. Guard against inappropriate assistance 7.11. Work through chronic procrastination and writer's block 8. Presenting evidence in tables and figures 8.1. Choose verbal or visual representations 8.2. Choose the most effective graphic 8.3. Design tables and figures 8.4. Communicate data ethically 9. Revising your draft 9.1. Check your introduction, conclusion, and claim 9.2. Make sure the body of your report is coherent 9.3. Check your paragraphs 9.4. Let your draft cool, then paraphrase it 10. Writing your final introduction and conclusion 10.1. Draft your final introduction 10.2. Draft your final conclusion 10.3. Write your title last 11. Revising sentences 11.1. Focus on the first seven or eight words of a sentence 11.2. Diagnose what you read 11.3. Choose the right word 11.4. Polish it off 11.5. Give it up and print it out 12. Learning from your returned paper 12.1. Find general principles in specific comments 12.2. Talk to your instructor 13. Presenting research in alternative forums 13.1. Plan your oral presentation 13.2. Design your presentation to be listened to 13.3. Plan your poster presentation 13.4. Plan your conference proposal 14. On the spirit of research Part 2. Source citation 15. General introduction to citation practices 15.1. Reasons for citing your sources 15.2. The requirements of citation 15.3. Two citation styles 15.4. Citation of electronic sources 15.5. Preparation of citations 15.6. A word on citation software 16. Notes-bibliography style: the basic form 16.1. Basic patterns 16.2. Bibliographies 16.3. Notes 16.4. Short forms for notes 17. Notes-bibliography style: citing specific types of sources 17.1. Books 17.2. Journal articles 17.3. Magazine articles 17.4. Newspaper articles 17.5. Additional types of published sources 17.6. Unpublished sources 17.7. Informally published electronic sources 17.8. Sources in the visual and performing arts 17.9. Public documents 17.10. One source quoted in another 18. Parenthetical citations-reference list style: the basic form 18.1. Basic patterns 18.2. Reference lists 18.3. Parenthetical citations 19. Parenthetical citations-reference list style: citing specific types of sources 19.1. Books 19.2. Journal articles 19.3. Magazine articles 19.4. Newspaper articles 19.5. Additional types of published sources 19.6. Unpublished sources 19.7. Informally published electronic sources 19.8. Sources in the visual and performing arts 19.9. Public documents 19.10. One source quoted in another Part 3. Style 20. Spelling 20.1. Plurals 20.2. Possessives 20.3. Compounds and words formed with prefixes 20.4. Line breaks 21. Punctuation 21.1. Period 21.2. Comma 21.3. Semicolon 21.4. Colon 21.5. Question mark 21.6. Exclamation point 21.7. Hyphen and dashes 21.8. Parentheses and brackets 21.9. Slashes 21.10. Quotation marks 21.11. Multiple punctuation marks 22. Names, special terms, and titles of works 22.1. Names 22.2. Special terms 22.3. Titles of works 23. Numbers 23.1. Words or numerals? 23.2. Plurals and punctuation 23.3. Date systems 23.4. Numbers used outside the text 24. Abbreviations 24.1. General principles 24.2. Names and titles 24.3. Geographical terms 24.4. Time and dates 24.5. Units of measure 24.6. The Bible and other sacred works 24.7. Abbreviations in citations and other scholarly contexts 25. Quotations 25.1. Quoting accurately and avoiding plagiarism 25.2. Incorporating quotations into your text 25.3. Modifying quotations 26. Tables and figures 26.1. General issues 26.2. Tables 26.3. Figures Appendix: Paper format and submission A.1. General format requirements A.2. Format requirements for specific elements A.3. Submission requirements Bibliography Authors Index

rawnote:
Revised by Wayne C. Booth, Gregory G. Colomb, Joseph M. Williams, and the University of Chicago Press editorial staff

rawtitle:
A manual for writers of research papers, theses, and dissertations: {Chicago} style for students and researchers

rawTOC:
A note to students \\ Preface \\ Acknowledgments \\ Part 1. Research and writing: from planning to production / Wayne C. Booth, Gregory G. Colomb, and Joseph M. Williams \\ Overview of part 1 \\ 1. What research is and how researchers think about it \\ 1.1. How researchers think about their aims \\ 1.2. Three kinds of questions that researchers ask \\ 2. Moving from a topic to a question to a working hypothesis \\ 2.1. Find a question in your topic \\ 2.2. Propose some working answers \\ 2.3. Build a storyboard to plan and guide your work \\ 2.4. Organize a writing support group \\ 3. Finding useful sources \\ 3.1. Understand the kinds of sources readers expect you to use \\ 3.2. Record your sources fully, accurately, and appropriately \\ 3.3. Search for sources systematically \\ 3.4. Evaluate sources for relevance and reliability \\ 3.5. Look beyond the usual kinds of references \\ 4. Engaging sources \\ 4.1. Read generously to understand, then critically to engage and evaluate \\ 4.2. Take notes systematically \\ 4.3. Take useful notes \\ 4.4. Write as you read \\ 4.5. Review your progress \\ 4.6. Manage moments of normal panic \\ 5. Planning your argument \\ 5.1. What a research argument is and is not \\ 5.2. Build your argument around answers to readers' questions \\ 5.3. Turn your working hypothesis into a claim \\ 5.4. Assemble the elements of your argument \\ 5.5. Distinguish arguments based on evidence from arguments based on warrants \\ 5.6. Assemble an argument \\ 6. Planning a first draft \\ 6.1. Avoid unhelpful plans \\ 6.2. Create a plan that meets your readers' needs \\ 6.3. File away leftovers \\ 7. Drafting your report \\ 7.1. Draft in the way that feels most comfortable \\ 7.2. Develop productive drafting habits \\ 7.3. Use your key terms to keep yourself on track \\ 7.4. Quote, paraphrase, and summarize appropriately \\ 7.5. Integrate quotations into your text \\ 7.6. Use footnotes and endnotes judiciously \\ 7.7. Interpret complex or detailed evidence before you offer it \\ 7.8. Be open to surprises \\ 7.9. Guard against inadvertent plagiarism \\ 7.10. Guard against inappropriate assistance \\ 7.11. Work through chronic procrastination and writer's block \\ 8. Presenting evidence in tables and figures \\ 8.1. Choose verbal or visual representations \\ 8.2. Choose the most effective graphic \\ 8.3. Design tables and figures \\ 8.4. Communicate data ethically \\ 9. Revising your draft \\ 9.1. Check your introduction, conclusion, and claim \\ 9.2. Make sure the body of your report is coherent \\ 9.3. Check your paragraphs \\ 9.4. Let your draft cool, then paraphrase it \\ 10. Writing your final introduction and conclusion \\ 10.1. Draft your final introduction \\ 10.2. Draft your final conclusion \\ 10.3. Write your title last \\ 11. Revising sentences \\ 11.1. Focus on the first seven or eight words of a sentence \\ 11.2. Diagnose what you read \\ 11.3. Choose the right word \\ 11.4. Polish it off \\ 11.5. Give it up and print it out \\ 12. Learning from your returned paper \\ 12.1. Find general principles in specific comments \\ 12.2. Talk to your instructor \\ 13. Presenting research in alternative forums \\ 13.1. Plan your oral presentation \\ 13.2. Design your presentation to be listened to \\ 13.3. Plan your poster presentation \\ 13.4. Plan your conference proposal \\ 14. On the spirit of research \\ Part 2. Source citation \\ 15. General introduction to citation practices \\ 15.1. Reasons for citing your sources \\ 15.2. The requirements of citation \\ 15.3. Two citation styles \\ 15.4. Citation of electronic sources \\ 15.5. Preparation of citations \\ 15.6. A word on citation software \\ 16. Notes-bibliography style: the basic form \\ 16.1. Basic patterns \\ 16.2. Bibliographies \\ 16.3. Notes \\ 16.4. Short forms for notes \\ 17. Notes-bibliography style: citing specific types of sources \\ 17.1. Books \\ 17.2. Journal articles \\ 17.3. Magazine articles \\ 17.4. Newspaper articles \\ 17.5. Additional types of published sources \\ 17.6. Unpublished sources \\ 17.7. Informally published electronic sources \\ 17.8. Sources in the visual and performing arts \\ 17.9. Public documents \\ 17.10. One source quoted in another\\ 18. Parenthetical citations-reference list style: the basic form \\ 18.1. Basic patterns \\ 18.2. Reference lists \\ 18.3. Parenthetical citations \\ 19. Parenthetical citations-reference list style: citing specific types of sources \\ 19.1. Books \\ 19.2. Journal articles \\ 19.3. Magazine articles \\ 19.4. Newspaper articles \\ 19.5. Additional types of published sources \\ 19.6. Unpublished sources \\ 19.7. Informally published electronic sources \\ 19.8. Sources in the visual and performing arts \\ 19.9. Public documents \\ 19.10. One source quoted in another \\ Part 3. Style \\ 20. Spelling \\ 20.1. Plurals \\ 20.2. Possessives \\ 20.3. Compounds and words formed with prefixes \\ 20.4. Line breaks \\ 21. Punctuation \\ 21.1. Period \\ 21.2. Comma \\ 21.3. Semicolon \\ 21.4. Colon \\ 21.5. Question mark \\ 21.6. Exclamation point \\ 21.7. Hyphen and dashes \\ 21.8. Parentheses and brackets \\ 21.9. Slashes \\ 21.10. Quotation marks \\ 21.11. Multiple punctuation marks \\ 22. Names, special terms, and titles of works \\ 22.1. Names \\ 22.2. Special terms \\ 22.3. Titles of works \\ 23. Numbers \\ 23.1. Words or numerals? \\ 23.2. Plurals and punctuation \\ 23.3. Date systems \\ 23.4. Numbers used outside the text \\ 24. Abbreviations \\ 24.1. General principles \\ 24.2. Names and titles \\ 24.3. Geographical terms \\ 24.4. Time and dates \\ 24.5. Units of measure \\ 24.6. The Bible and other sacred works \\ 24.7. Abbreviations in citations and other scholarly contexts \\ 25. Quotations \\ 25.1. Quoting accurately and avoiding plagiarism \\ 25.2. Incorporating quotations into your text \\ 25.3. Modifying quotations \\ 26. Tables and figures \\ 26.1. General issues \\ 26.2. Tables \\ 26.3. Figures \\ Appendix: Paper format and submission \\ A.1. General format requirements \\ A.2. Format requirements for specific elements \\ A.3. Submission requirements \\ Bibliography \\ Authors \\ Index

entry:
@Book{Turabian:2007:MWR,
  editor =       "Kate L. Turabian",
  title =        "A manual for writers of research papers, theses, and
                 dissertations: {Chicago} style for students and
                 researchers",
  publisher =    pub-U-CHICAGO,
  address =      pub-U-CHICAGO:adr,
  edition =      "Seventh",
  pages =        "xviii + 466",
  year =         "2007",
  ISBN =         "0-226-82336-9 (cloth), 0-226-82337-7 (paperback)",
  ISBN-13 =      "978-0-226-82336-2 (cloth), 978-0-226-82337-9
                 (paperback)",
  LCCN =         "LB2369 .T8 2007; LB2369 .T87 2007",
  bibdate =      "Fri Jan 8 15:21:54 MST 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 melvyl.cdlib.org:210/CDL90",
  note =         "Revised by Wayne C. Booth, Gregory G. Colomb, Joseph
                 M. Williams, and the University of Chicago Press
                 editorial staff",
  series =       "Chicago guides to writing, editing, and publishing",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0707/2006025443-b;
                 http://www.loc.gov/catdir/enhancements/fy0707/2006025443-b.html;
                 http://www.loc.gov/catdir/enhancements/fy0707/2006025443-d;
                 http://www.loc.gov/catdir/enhancements/fy0707/2006025443-d.html;
                 http://www.loc.gov/catdir/toc/ecip0618/2006025443;
                 http://www.loc.gov/catdir/toc/ecip0618/2006025443.html",
  acknowledgement = ack-nhfb,
  subject =      "Dissertations, Academic; Handbooks, manuals, etc;
                 Academic writing; Writing; Handbooks, Dissertations,
                 Academic as Topic",
  tableofcontents = "A note to students \\
                 Preface \\
                 Acknowledgments \\
                 Part 1. Research and writing: from planning to
                 production / Wayne C. Booth, Gregory G. Colomb, and
                 Joseph M. Williams \\
                 Overview of part 1 \\
                 1. What research is and how researchers think about it
                 \\
                 1.1. How researchers think about their aims \\
                 1.2. Three kinds of questions that researchers ask \\
                 2. Moving from a topic to a question to a working
                 hypothesis \\
                 2.1. Find a question in your topic \\
                 2.2. Propose some working answers \\
                 2.3. Build a storyboard to plan and guide your work \\
                 2.4. Organize a writing support group \\
                 3. Finding useful sources \\
                 3.1. Understand the kinds of sources readers expect you
                 to use \\
                 3.2. Record your sources fully, accurately, and
                 appropriately \\
                 3.3. Search for sources systematically \\
                 3.4. Evaluate sources for relevance and reliability \\
                 3.5. Look beyond the usual kinds of references \\
                 4. Engaging sources \\
                 4.1. Read generously to understand, then critically to
                 engage and evaluate \\
                 4.2. Take notes systematically \\
                 4.3. Take useful notes \\
                 4.4. Write as you read \\
                 4.5. Review your progress \\
                 4.6. Manage moments of normal panic \\
                 5. Planning your argument \\
                 5.1. What a research argument is and is not \\
                 5.2. Build your argument around answers to readers'
                 questions \\
                 5.3. Turn your working hypothesis into a claim \\
                 5.4. Assemble the elements of your argument \\
                 5.5. Distinguish arguments based on evidence from
                 arguments based on warrants \\
                 5.6. Assemble an argument \\
                 6. Planning a first draft \\
                 6.1. Avoid unhelpful plans \\
                 6.2. Create a plan that meets your readers' needs \\
                 6.3. File away leftovers \\
                 7. Drafting your report \\
                 7.1. Draft in the way that feels most comfortable \\
                 7.2. Develop productive drafting habits \\
                 7.3. Use your key terms to keep yourself on track \\
                 7.4. Quote, paraphrase, and summarize appropriately \\
                 7.5. Integrate quotations into your text \\
                 7.6. Use footnotes and endnotes judiciously \\
                 7.7. Interpret complex or detailed evidence before you
                 offer it \\
                 7.8. Be open to surprises \\
                 7.9. Guard against inadvertent plagiarism \\
                 7.10. Guard against inappropriate assistance \\
                 7.11. Work through chronic procrastination and writer's
                 block \\
                 8. Presenting evidence in tables and figures \\
                 8.1. Choose verbal or visual representations \\
                 8.2. Choose the most effective graphic \\
                 8.3. Design tables and figures \\
                 8.4. Communicate data ethically \\
                 9. Revising your draft \\
                 9.1. Check your introduction, conclusion, and claim \\
                 9.2. Make sure the body of your report is coherent \\
                 9.3. Check your paragraphs \\
                 9.4. Let your draft cool, then paraphrase it \\
                 10. Writing your final introduction and conclusion \\
                 10.1. Draft your final introduction \\
                 10.2. Draft your final conclusion \\
                 10.3. Write your title last \\
                 11. Revising sentences \\
                 11.1. Focus on the first seven or eight words of a
                 sentence \\
                 11.2. Diagnose what you read \\
                 11.3. Choose the right word \\
                 11.4. Polish it off \\
                 11.5. Give it up and print it out \\
                 12. Learning from your returned paper \\
                 12.1. Find general principles in specific comments \\
                 12.2. Talk to your instructor \\
                 13. Presenting research in alternative forums \\
                 13.1. Plan your oral presentation \\
                 13.2. Design your presentation to be listened to \\
                 13.3. Plan your poster presentation \\
                 13.4. Plan your conference proposal \\
                 14. On the spirit of research \\
                 Part 2. Source citation \\
                 15. General introduction to citation practices \\
                 15.1. Reasons for citing your sources \\
                 15.2. The requirements of citation \\
                 15.3. Two citation styles \\
                 15.4. Citation of electronic sources \\
                 15.5. Preparation of citations \\
                 15.6. A word on citation software \\
                 16. Notes-bibliography style: the basic form \\
                 16.1. Basic patterns \\
                 16.2. Bibliographies \\
                 16.3. Notes \\
                 16.4. Short forms for notes \\
                 17. Notes-bibliography style: citing specific types of
                 sources \\
                 17.1. Books \\
                 17.2. Journal articles \\
                 17.3. Magazine articles \\
                 17.4. Newspaper articles \\
                 17.5. Additional types of published sources \\
                 17.6. Unpublished sources \\
                 17.7. Informally published electronic sources \\
                 17.8. Sources in the visual and performing arts \\
                 17.9. Public documents \\
                 17.10. One source quoted in another\\
                 18. Parenthetical citations-reference list style: the
                 basic form \\
                 18.1. Basic patterns \\
                 18.2. Reference lists \\
                 18.3. Parenthetical citations \\
                 19. Parenthetical citations-reference list style:
                 citing specific types of sources \\
                 19.1. Books \\
                 19.2. Journal articles \\
                 19.3. Magazine articles \\
                 19.4. Newspaper articles \\
                 19.5. Additional types of published sources \\
                 19.6. Unpublished sources \\
                 19.7. Informally published electronic sources \\
                 19.8. Sources in the visual and performing arts \\
                 19.9. Public documents \\
                 19.10. One source quoted in another \\
                 Part 3. Style \\
                 20. Spelling \\
                 20.1. Plurals \\
                 20.2. Possessives \\
                 20.3. Compounds and words formed with prefixes \\
                 20.4. Line breaks \\
                 21. Punctuation \\
                 21.1. Period \\
                 21.2. Comma \\
                 21.3. Semicolon \\
                 21.4. Colon \\
                 21.5. Question mark \\
                 21.6. Exclamation point \\
                 21.7. Hyphen and dashes \\
                 21.8. Parentheses and brackets \\
                 21.9. Slashes \\
                 21.10. Quotation marks \\
                 21.11. Multiple punctuation marks \\
                 22. Names, special terms, and titles of works \\
                 22.1. Names \\
                 22.2. Special terms \\
                 22.3. Titles of works \\
                 23. Numbers \\
                 23.1. Words or numerals? \\
                 23.2. Plurals and punctuation \\
                 23.3. Date systems \\
                 23.4. Numbers used outside the text \\
                 24. Abbreviations \\
                 24.1. General principles \\
                 24.2. Names and titles \\
                 24.3. Geographical terms \\
                 24.4. Time and dates \\
                 24.5. Units of measure \\
                 24.6. The Bible and other sacred works \\
                 24.7. Abbreviations in citations and other scholarly
                 contexts \\
                 25. Quotations \\
                 25.1. Quoting accurately and avoiding plagiarism \\
                 25.2. Incorporating quotations into your text \\
                 25.3. Modifying quotations \\
                 26. Tables and figures \\
                 26.1. General issues \\
                 26.2. Tables \\
                 26.3. Figures \\
                 Appendix: Paper format and submission \\
                 A.1. General format requirements \\
                 A.2. Format requirements for specific elements \\
                 A.3. Submission requirements \\
                 Bibliography \\
                 Authors \\
                 Index",
}


bibtype: book
filename: master.bib
label: Turing:2018:XYZ
author: Dermot Turing
title: X, Y and Z: the Real Story of How Enigma Was Broken
publisher: The History Press
address: Gloucestershire, UK
pages: 319 + 1
year: 2018
ISBN: 0-7509-8782-0 (hardcover), 0-7509-8967-X (ePub) OR 0750987820 (hardcover), 075098967X (ePub)
LCCN: D810.C88 T87 2018
bibdate: Fri Feb 4 16:28:59 MST 2022
bibtimestamp: 2022.02.04 16:28:59 MST
acknowledgement: ack-nhfb
rawauthor: Dermot Turing
rawtitle: {X}, {Y} and {Z}: the Real Story of How {Enigma} Was Broken
ISBN13:
978-0-7509-8782-0 (hardcover), 978-0-7509-8967-1 (ePub) OR 9780750987820 (hardcover), 9780750989671 (ePub)

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

abstract:
X, Y and Z describes how French, British and Polish secret services came together to unravel the Enigma machine. It tells of how, under the very noses of the Germans, Enigma code-breaking continued in Vichy France. And how code-breakers from Poland continued their work for Her Majesty's Secret Service, watching the USSR's first steps of the Cold War. The people of X, Y and Z were eccentric, colourful and caught up in world events that they could watch not control. This is their story ldots .

subject:
Enigma (maszyna szyfrujyaca).; Wojna yswiatowa (1939-1945); syuyzby wywiadowcze; Wielka Brytania; Enigma cipher system; World War, 1939-1945; Military intelligence; Great Britain; Enigma cipher system.; Military intelligence.

TOC:
List of Maps Foreword Dramatis Personae Timeline Introduction 1 Nulle Part 2 Enter the King 3 Mighty Pens 4 The Scarlet Pimpernels 5 How They Brought the Good News from Ghent to Aix 6 Monstrous Pile 7 The Mirror Crack'd from Side to Side 8 Into Three Parts 9 A Mystery Inside an Enigma 10 Hide and Seek 11 The Last Play Epilogue Appendix Notes Abbreviations Select Bibliography

rawabstract:
X, Y and Z describes how French, British and Polish secret services came together to unravel the Enigma machine. It tells of how, under the very noses of the Germans, Enigma code-breaking continued in Vichy France. And how code-breakers from Poland continued their work for Her Majesty's Secret Service, watching the USSR's first steps of the Cold War. The people of X, Y and Z were eccentric, colourful and caught up in world events that they could watch not control. This is their story \ldots{}.

rawTOC:
List of Maps \\ Foreword \\ Dramatis Personae \\ Timeline \\ Introduction \\ 1 Nulle Part \\ 2 Enter the King \\ 3 Mighty Pens \\ 4 The Scarlet Pimpernels \\ 5 How They Brought the Good News from Ghent to Aix \\ 6 Monstrous Pile \\ 7 The Mirror Crack'd from Side to Side \\ 8 Into Three Parts \\ 9 A Mystery Inside an Enigma \\ 10 Hide and Seek \\ 11 The Last Play \\ Epilogue \\ Appendix \\ Notes \\ Abbreviations \\ Select Bibliography

entry:
@Book{Turing:2018:XYZ,
  author =       "Dermot Turing",
  title =        "{X}, {Y} and {Z}: the Real Story of How {Enigma} Was
                 Broken",
  publisher =    "The History Press",
  address =      "Gloucestershire, UK",
  pages =        "319 + 1",
  year =         "2018",
  ISBN =         "0-7509-8782-0 (hardcover), 0-7509-8967-X (ePub)",
  ISBN-13 =      "978-0-7509-8782-0 (hardcover), 978-0-7509-8967-1
                 (ePub)",
  LCCN =         "D810.C88 T87 2018",
  bibdate =      "Fri Feb 4 16:28:59 MST 2022",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "X, Y and Z describes how French, British and Polish
                 secret services came together to unravel the Enigma
                 machine. It tells of how, under the very noses of the
                 Germans, Enigma code-breaking continued in Vichy
                 France. And how code-breakers from Poland continued
                 their work for Her Majesty's Secret Service, watching
                 the USSR's first steps of the Cold War. The people of
                 X, Y and Z were eccentric, colourful and caught up in
                 world events that they could watch not control. This is
                 their story \ldots{}.",
  acknowledgement = ack-nhfb,
  subject =      "Enigma (maszyna szyfruj{\'y}aca).; Wojna {\'y}swiatowa
                 (1939-1945); s{\'y}u{\'y}zby wywiadowcze; Wielka
                 Brytania; Enigma cipher system; World War, 1939-1945;
                 Military intelligence; Great Britain; Enigma cipher
                 system.; Military intelligence.",
  tableofcontents = "List of Maps \\
                 Foreword \\
                 Dramatis Personae \\
                 Timeline \\
                 Introduction \\
                 1 Nulle Part \\
                 2 Enter the King \\
                 3 Mighty Pens \\
                 4 The Scarlet Pimpernels \\
                 5 How They Brought the Good News from Ghent to Aix \\
                 6 Monstrous Pile \\
                 7 The Mirror Crack'd from Side to Side \\
                 8 Into Three Parts \\
                 9 A Mystery Inside an Enigma \\
                 10 Hide and Seek \\
                 11 The Last Play \\
                 Epilogue \\
                 Appendix \\
                 Notes \\
                 Abbreviations \\
                 Select Bibliography",
}


bibtype: book
filename: master.bib
label: Turing:2020:CBP
author: Dermot Turing
title: The Codebreakers of Bletchley Park: the Secret Intelligence Station That Helped Defeat the Nazis
publisher: Arcturus Publishing Limited
address: London, UK
pages: 256
year: 2020
ISBN: 1-78950-621-2, 1-83857-650-9 (paperback) OR 1789506212, 1838576509 (paperback)
ISBN13: 978-1-78950-621-1, 978-1-83857-650-9 (paperback) OR 9781789506211, 9781838576509 (paperback)
bibdate: Fri Feb 4 16:16:43 MST 2022
bibtimestamp: 2022.02.04 16:16:43 MST
note: With an introduction by Christopher M. Andrew.
acknowledgement: ack-nhfb
rawauthor: Dermot Turing
rawnote: With an introduction by Christopher M. Andrew.
bibsource:
fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib; https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

abstract:
At Bletchley Park, some of Britain's most talented mathematicians, linguists, and intellectuals were assembled to break Nazi codes. Kept secret for nearly thirty years, we have now come to realise the crucial role that these codebreakers played in the Allied victory in World War II. Written by Dermot Turing, the nephew of famous codebreaker Alan Turing, this illustrated account provides unique insight into the behind-the-scenes action at Bletchley Park. Discover how brilliant and eccentric individuals such as Dilly Knox, Alan Turing and Joan Clarke were recruited, the social life that grew up around the park, and how they dealt with the ever-present burden of secrecy. Including a foreword by Professor Christopher Andrew of Cambridge University, author of MI5's official history The Secret World, this book brings to life the stories of the men and women who toiled day and night to crack the seemingly unbreakable Enigma code.

subject:
World War, 1939--1945; Secret service; Great Britain; Electronic intelligence; England; Bletchley (Buckinghamshire); Electronic intelligence.; Secret service.

rawabstract:
At Bletchley Park, some of Britain's most talented mathematicians, linguists, and intellectuals were assembled to break Nazi codes. Kept secret for nearly thirty years, we have now come to realise the crucial role that these codebreakers played in the Allied victory in World War II. Written by Dermot Turing, the nephew of famous codebreaker Alan Turing, this illustrated account provides unique insight into the behind-the-scenes action at Bletchley Park. Discover how brilliant and eccentric individuals such as Dilly Knox, Alan Turing and Joan Clarke were recruited, the social life that grew up around the park, and how they dealt with the ever-present burden of secrecy. Including a foreword by Professor Christopher Andrew of Cambridge University, author of MI5's official history The Secret World, this book brings to life the stories of the men and women who toiled day and night to crack the seemingly unbreakable Enigma code.

rawtitle:
The Codebreakers of {Bletchley Park}: the Secret Intelligence Station That Helped Defeat the {Nazis}

entry:
@Book{Turing:2020:CBP,
  author =       "Dermot Turing",
  title =        "The Codebreakers of {Bletchley Park}: the Secret
                 Intelligence Station That Helped Defeat the {Nazis}",
  publisher =    "Arcturus Publishing Limited",
  address =      "London, UK",
  pages =        "256",
  year =         "2020",
  ISBN =         "1-78950-621-2, 1-83857-650-9 (paperback)",
  ISBN-13 =      "978-1-78950-621-1, 978-1-83857-650-9 (paperback)",
  LCCN =         "????",
  bibdate =      "Fri Feb 4 16:16:43 MST 2022",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "With an introduction by Christopher M. Andrew.",
  abstract =     "At Bletchley Park, some of Britain's most talented
                 mathematicians, linguists, and intellectuals were
                 assembled to break Nazi codes. Kept secret for nearly
                 thirty years, we have now come to realise the crucial
                 role that these codebreakers played in the Allied
                 victory in World War II. Written by Dermot Turing, the
                 nephew of famous codebreaker Alan Turing, this
                 illustrated account provides unique insight into the
                 behind-the-scenes action at Bletchley Park. Discover
                 how brilliant and eccentric individuals such as Dilly
                 Knox, Alan Turing and Joan Clarke were recruited, the
                 social life that grew up around the park, and how they
                 dealt with the ever-present burden of secrecy.
                 Including a foreword by Professor Christopher Andrew of
                 Cambridge University, author of MI5's official history
                 The Secret World, this book brings to life the stories
                 of the men and women who toiled day and night to crack
                 the seemingly unbreakable Enigma code.",
  acknowledgement = ack-nhfb,
  subject =      "World War, 1939--1945; Secret service; Great Britain;
                 Electronic intelligence; England; Bletchley
                 (Buckinghamshire); Electronic intelligence.; Secret
                 service.",
}


bibtype: book
filename: master.bib
label: Turnbull:1993:GM
author: Herbert Westren Turnbull
title: The Great Mathematicians
publisher: pub-BARNES-NOBLE
address: pub-BARNES-NOBLE:adr
pages: xi + 141
year: 1993
ISBN: 1-56619-157-2 OR 1566191572
ISBN13: 978-1-56619-157-9 OR 9781566191579
LCCN: QA28 .T8 1993
bibdate: Sat Apr 1 15:05:30 MDT 2017
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2017.04.01 15:05:30 MDT
subject: Mathematicians; Biography; Mathematics; History; Wiskundigen; Mathematicians; Mathematics
acknowledgement: ack-nhfb
authordates: 1885--1961
rawauthor: Herbert Westren Turnbull
rawtitle: The Great Mathematicians
TOC:
Early beginnings: Thales, Pythagoras and the Pythagoreans Eudoxus and the Athenian school Alexandria: Euclid, Archimedes and Apollonius The second Alexandrian school: Pappus and Diophantus The Renaissance: Napier and Kepler: the rise of analysis Descartes and Pascal: the early French geometers and their contemporaries Isaac Newton The Bernoullis and Euler Maclaurin and Lagrange Gauss and Hamilton: the nineteenth century More recent developments

rawTOC:
Early beginnings: Thales, Pythagoras and the Pythagoreans \\ Eudoxus and the Athenian school \\ Alexandria: Euclid, Archimedes and Apollonius \\ The second Alexandrian school: Pappus and Diophantus \\ The Renaissance: Napier and Kepler: the rise of analysis \\ Descartes and Pascal: the early French geometers and their contemporaries \\ Isaac Newton \\ The Bernoullis and Euler \\ Maclaurin and Lagrange \\ Gauss and Hamilton: the nineteenth century \\ More recent developments

entry:
@Book{Turnbull:1993:GM,
  author =       "Herbert Westren Turnbull",
  title =        "The Great Mathematicians",
  publisher =    pub-BARNES-NOBLE,
  address =      pub-BARNES-NOBLE:adr,
  pages =        "xi + 141",
  year =         "1993",
  ISBN =         "1-56619-157-2",
  ISBN-13 =      "978-1-56619-157-9",
  LCCN =         "QA28 .T8 1993",
  bibdate =      "Sat Apr 1 15:05:30 MDT 2017",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  author-dates = "1885--1961",
  libnote =      "Not in my library.",
  subject =      "Mathematicians; Biography; Mathematics; History;
                 Wiskundigen; Mathematicians; Mathematics",
  tableofcontents = "Early beginnings: Thales, Pythagoras and the
                 Pythagoreans \\
                 Eudoxus and the Athenian school \\
                 Alexandria: Euclid, Archimedes and Apollonius \\
                 The second Alexandrian school: Pappus and Diophantus
                 \\
                 The Renaissance: Napier and Kepler: the rise of
                 analysis \\
                 Descartes and Pascal: the early French geometers and
                 their contemporaries \\
                 Isaac Newton \\
                 The Bernoullis and Euler \\
                 Maclaurin and Lagrange \\
                 Gauss and Hamilton: the nineteenth century \\
                 More recent developments",
}


bibtype: book
filename: master.bib
label: Tymms:1987:AI
author: W. R. Tymms and M. D. Wyatt
title: The Art of Illuminating
publisher: pub-CHARTWELL
address: pub-CHARTWELL:adr
pages: 104
year: 1987
ISBN: 1-55521-198-4 OR 1555211984
ISBN13: 978-1-55521-198-1 OR 9781555211981
LCCN: ND3310 .T95 1987
bibdate: Wed Dec 15 10:58:55 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 10:58:55 ???
acknowledgement: ack-nhfb
rawauthor: W. R. Tymms and M. D. Wyatt
rawtitle: The Art of Illuminating
entry:
@Book{Tymms:1987:AI,
  author =       "W. R. Tymms and M. D. Wyatt",
  title =        "The Art of Illuminating",
  publisher =    pub-CHARTWELL,
  address =      pub-CHARTWELL:adr,
  pages =        "104",
  year =         "1987",
  ISBN =         "1-55521-198-4",
  ISBN-13 =      "978-1-55521-198-1",
  LCCN =         "ND3310 .T95 1987",
  bibdate =      "Wed Dec 15 10:58:55 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Ueberhuber:1997:NCM
author: Christoph W. Ueberhuber
title: Numerical Computation: Methods, Software, and Analysis
publisher: pub-SV
address: pub-SV:adr
pages: xvi + 474 (vol. 1), xvi + 495 (vol. 2)
year: 1997
DOI: https://doi.org/10.1007/978-3-642-59118-1
LCCN: QA297 .U2413 1997
bibdate: Thu Oct 28 15:17:48 1999
bibtimestamp: 1999.10.28 15:17:48 ???
acknowledgement: ack-nhfb
rawauthor: Christoph W. Ueberhuber
rawtitle: Numerical Computation: Methods, Software, and Analysis
ISBN:
3-540-62058-3 (vol. 1: softcover), 3-540-62057-5 (vol. 2: softcover), 3-642-59118-3 (e-book) OR 3540620583 (vol. 1: softcover), 3540620575 (vol. 2: softcover), 3642591183 (ebook)

ISBN13:
978-3-540-62058-7 (vol. 1: softcover), 978-3-540-62057-0 (vol. 2: softcover), 978-3-642-59118-1 (e-book) OR 9783540620587 (vol. 1: softcover), 9783540620570 (vol. 2: softcover), 9783642591181 (ebook)

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

abstract:
This book is the first part of a modern, two-volume introduction to numerical computation, which strongly emphasizes software aspects. It can serve as a textbook for courses on numerical analysis, particularly for engineers. The book can also be used as a reference book and it includes an extensive bibliography. The author is a well-known specialist in numerical analysis who was involved in the creation of the software package QUADPACK.

TOC:
1 Scientific Modeling 1.1 Reality Versus Model 1.2 The Model Subject and the Model 1.3 The Model Subject and Reality 1.4 Model Building 2 Fundamental Principles of Numerical Methods 2.1 From Application Problems to their Numerical Solution 2.2 Numerical Problems 2.3 Types of Errors in Numerics 2.4 The Condition of Mathematical Problems 2.5 The Condition of Application Problems 2.6 The Mathematical Elements of Condition Estimation 2.7 Validation of Numerical Computations 3 Computers for Numerical Data Processing 3.1 Processors 3.2 Memory 3.3 Performance Quantification 3.4 Analytical Performance Assessment 3.5 Empirical Performance Assessment 4 Numerical Data and Numerical Operations 4.1 Mathematical Data 4.2 Numerical Data on Computers 4.3 Operations on Numerical Data 4.4 Number Systems on Computers 4.5 Structure of Floating-Point Systems 4.6 Standardization of Floating-Point Number Systems 4.7 Arithmetics for Floating-Point Systems 4.8 Inquiry Functions and Manipulation of Numbers in Fortran 90 4.9 Operations with Algebraic Data 4.10 Operations with Arrays 4.11 Operations with Analytic Data 5 Numerical Algorithms 5.1 The Intuitive Notion of an Algorithm 5.2 Properties of Algorithms 5.3 Existence of Algorithms 5.4 Practical Solvability of Problems 5.5 Complexity of Algorithms 5.6 Representation of Algorithms 5.7 Influence of Rounding Errors on Numerical Algorithms 5.8 Case Study: Floating-Point Summation 6 Numerical Programs 6.1 The Quality of Numerical Programs 6.2 Reasons for Poor Efficiency 6.3 The Measurement of Performance Indices 6.4 Performance Optimization 6.5 Architecture Independent Optimizations 6.6 Loop Optimizations 6.7 Blocked Memory Access 6.8 Case Study: Multiplication of Matrices 7 Available Numerical Software 7.1 The Cost of Software 7.2 Sources of Numerical Software 7.3 Software and the Internet 7.4 Interactive Multifunctional Systems 7.5 Problem Solving Environments 7.6 Case Study: Software for Elliptic PDEs 8 Using Approximation in Mathematical Model Building 8.1 Analytic Models 8.2 Information and Data 8.3 Discrete Approximation 8.4 Function Approximation 8.5 Choosing a Model Function 8.6 Choice of the Distance Function 8.7 Transformation of the Problem 9 Interpolation 9.1 Interpolation Problems 9.2 Mathematical Foundations 9.3 Univariate Polynomial Interpolation 9.4 Univariate, Piecewise, Polynomial Interpolation 9.5 Polynomial Splines 9.6 B-Splines 9.7 Cubic Spline Interpolation 9.8 Splines Without Undesirable Oscillations 9.9 Multivariate Interpolation 9.10 Multivariate Polynomial Interpolation 9.11 Multivariate (Sub- ) Spline Interpolation 9.12 Related Problems and Methods Glossary of Notation Author Index

rawabstract:
This book is the first part of a modern, two-volume introduction to numerical computation, which strongly emphasizes software aspects. It can serve as a textbook for courses on numerical analysis, particularly for engineers. The book can also be used as a reference book and it includes an extensive bibliography. The author is a well-known specialist in numerical analysis who was involved in the creation of the software package QUADPACK.

rawTOC:
1 Scientific Modeling \\ 1.1 Reality Versus Model \\ 1.2 The Model Subject and the Model \\ 1.3 The Model Subject and Reality \\ 1.4 Model Building \\ 2 Fundamental Principles of Numerical Methods \\ 2.1 From Application Problems to their Numerical Solution \\ 2.2 Numerical Problems \\ 2.3 Types of Errors in Numerics \\ 2.4 The Condition of Mathematical Problems \\ 2.5 The Condition of Application Problems \\ 2.6 The Mathematical Elements of Condition Estimation \\ 2.7 Validation of Numerical Computations \\ 3 Computers for Numerical Data Processing \\ 3.1 Processors \\ 3.2 Memory \\ 3.3 Performance Quantification \\ 3.4 Analytical Performance Assessment \\ 3.5 Empirical Performance Assessment \\ 4 Numerical Data and Numerical Operations \\ 4.1 Mathematical Data \\ 4.2 Numerical Data on Computers \\ 4.3 Operations on Numerical Data \\ 4.4 Number Systems on Computers \\ 4.5 Structure of Floating-Point Systems \\ 4.6 Standardization of Floating-Point Number Systems \\ 4.7 Arithmetics for Floating-Point Systems \\ 4.8 Inquiry Functions and Manipulation of Numbers in Fortran 90 \\ 4.9 Operations with Algebraic Data \\ 4.10 Operations with Arrays \\ 4.11 Operations with Analytic Data \\ 5 Numerical Algorithms \\ 5.1 The Intuitive Notion of an Algorithm \\ 5.2 Properties of Algorithms \\ 5.3 Existence of Algorithms \\ 5.4 Practical Solvability of Problems \\ 5.5 Complexity of Algorithms \\ 5.6 Representation of Algorithms \\ 5.7 Influence of Rounding Errors on Numerical Algorithms \\ 5.8 Case Study: Floating-Point Summation \\ 6 Numerical Programs \\ 6.1 The Quality of Numerical Programs \\ 6.2 Reasons for Poor Efficiency \\ 6.3 The Measurement of Performance Indices \\ 6.4 Performance Optimization \\ 6.5 Architecture Independent Optimizations \\ 6.6 Loop Optimizations \\ 6.7 Blocked Memory Access \\ 6.8 Case Study: Multiplication of Matrices \\ 7 Available Numerical Software \\ 7.1 The Cost of Software \\ 7.2 Sources of Numerical Software \\ 7.3 Software and the Internet \\ 7.4 Interactive Multifunctional Systems \\ 7.5 Problem Solving Environments \\ 7.6 Case Study: Software for Elliptic PDEs \\ 8 Using Approximation in Mathematical Model Building \\ 8.1 Analytic Models \\ 8.2 Information and Data \\ 8.3 Discrete Approximation \\ 8.4 Function Approximation \\ 8.5 Choosing a Model Function \\ 8.6 Choice of the Distance Function \\ 8.7 Transformation of the Problem \\ 9 Interpolation \\ 9.1 Interpolation Problems \\ 9.2 Mathematical Foundations \\ 9.3 Univariate Polynomial Interpolation \\ 9.4 Univariate, Piecewise, Polynomial Interpolation \\ 9.5 Polynomial Splines \\ 9.6 B-Splines \\ 9.7 Cubic Spline Interpolation \\ 9.8 Splines Without Undesirable Oscillations \\ 9.9 Multivariate Interpolation \\ 9.10 Multivariate Polynomial Interpolation \\ 9.11 Multivariate (Sub- ) Spline Interpolation \\ 9.12 Related Problems and Methods \\ Glossary of Notation \\ Author Index

entry:
@Book{Ueberhuber:1997:NCM,
  author =       "Christoph W. Ueberhuber",
  title =        "Numerical Computation: Methods, Software, and
                 Analysis",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xvi + 474 (vol. 1), xvi + 495 (vol. 2)",
  year =         "1997",
  DOI =          "https://doi.org/10.1007/978-3-642-59118-1",
  ISBN =         "3-540-62058-3 (vol. 1: softcover), 3-540-62057-5 (vol.
                 2: softcover), 3-642-59118-3 (e-book)",
  ISBN-13 =      "978-3-540-62058-7 (vol. 1: softcover),
                 978-3-540-62057-0 (vol. 2: softcover),
                 978-3-642-59118-1 (e-book)",
  LCCN =         "QA297 .U2413 1997",
  bibdate =      "Thu Oct 28 15:17:48 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fortran3.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/numana1990.bib",
  price =        "US\$44.95 (vol. 1), US\$49.95 (vol. 2)",
  abstract =     "This book is the first part of a modern, two-volume
                 introduction to numerical computation, which strongly
                 emphasizes software aspects. It can serve as a textbook
                 for courses on numerical analysis, particularly for
                 engineers. The book can also be used as a reference
                 book and it includes an extensive bibliography. The
                 author is a well-known specialist in numerical analysis
                 who was involved in the creation of the software
                 package QUADPACK.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1 Scientific Modeling \\
                 1.1 Reality Versus Model \\
                 1.2 The Model Subject and the Model \\
                 1.3 The Model Subject and Reality \\
                 1.4 Model Building \\
                 2 Fundamental Principles of Numerical Methods \\
                 2.1 From Application Problems to their Numerical
                 Solution \\
                 2.2 Numerical Problems \\
                 2.3 Types of Errors in Numerics \\
                 2.4 The Condition of Mathematical Problems \\
                 2.5 The Condition of Application Problems \\
                 2.6 The Mathematical Elements of Condition Estimation
                 \\
                 2.7 Validation of Numerical Computations \\
                 3 Computers for Numerical Data Processing \\
                 3.1 Processors \\
                 3.2 Memory \\
                 3.3 Performance Quantification \\
                 3.4 Analytical Performance Assessment \\
                 3.5 Empirical Performance Assessment \\
                 4 Numerical Data and Numerical Operations \\
                 4.1 Mathematical Data \\
                 4.2 Numerical Data on Computers \\
                 4.3 Operations on Numerical Data \\
                 4.4 Number Systems on Computers \\
                 4.5 Structure of Floating-Point Systems \\
                 4.6 Standardization of Floating-Point Number Systems
                 \\
                 4.7 Arithmetics for Floating-Point Systems \\
                 4.8 Inquiry Functions and Manipulation of Numbers in
                 Fortran 90 \\
                 4.9 Operations with Algebraic Data \\
                 4.10 Operations with Arrays \\
                 4.11 Operations with Analytic Data \\
                 5 Numerical Algorithms \\
                 5.1 The Intuitive Notion of an Algorithm \\
                 5.2 Properties of Algorithms \\
                 5.3 Existence of Algorithms \\
                 5.4 Practical Solvability of Problems \\
                 5.5 Complexity of Algorithms \\
                 5.6 Representation of Algorithms \\
                 5.7 Influence of Rounding Errors on Numerical
                 Algorithms \\
                 5.8 Case Study: Floating-Point Summation \\
                 6 Numerical Programs \\
                 6.1 The Quality of Numerical Programs \\
                 6.2 Reasons for Poor Efficiency \\
                 6.3 The Measurement of Performance Indices \\
                 6.4 Performance Optimization \\
                 6.5 Architecture Independent Optimizations \\
                 6.6 Loop Optimizations \\
                 6.7 Blocked Memory Access \\
                 6.8 Case Study: Multiplication of Matrices \\
                 7 Available Numerical Software \\
                 7.1 The Cost of Software \\
                 7.2 Sources of Numerical Software \\
                 7.3 Software and the Internet \\
                 7.4 Interactive Multifunctional Systems \\
                 7.5 Problem Solving Environments \\
                 7.6 Case Study: Software for Elliptic PDEs \\
                 8 Using Approximation in Mathematical Model Building
                 \\
                 8.1 Analytic Models \\
                 8.2 Information and Data \\
                 8.3 Discrete Approximation \\
                 8.4 Function Approximation \\
                 8.5 Choosing a Model Function \\
                 8.6 Choice of the Distance Function \\
                 8.7 Transformation of the Problem \\
                 9 Interpolation \\
                 9.1 Interpolation Problems \\
                 9.2 Mathematical Foundations \\
                 9.3 Univariate Polynomial Interpolation \\
                 9.4 Univariate, Piecewise, Polynomial Interpolation \\
                 9.5 Polynomial Splines \\
                 9.6 B-Splines \\
                 9.7 Cubic Spline Interpolation \\
                 9.8 Splines Without Undesirable Oscillations \\
                 9.9 Multivariate Interpolation \\
                 9.10 Multivariate Polynomial Interpolation \\
                 9.11 Multivariate (Sub- ) Spline Interpolation \\
                 9.12 Related Problems and Methods \\
                 Glossary of Notation \\
                 Author Index",
}


bibtype: book
filename: master.bib
label: Ulichney:1987:DH
author: Robert Ulichney
title: Digital Halftoning
publisher: pub-MIT
address: pub-MIT:adr
pages: xiv + 362
year: 1987
ISBN: 0-262-21009-6 OR 0262210096
ISBN13: 978-0-262-21009-6 OR 9780262210096
LCCN: T385 .U451 1987
bibdate: Wed Dec 15 10:58:55 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 10:58:55 ???
acknowledgement: ack-nhfb
rawauthor: Robert Ulichney
rawtitle: Digital Halftoning
entry:
@Book{Ulichney:1987:DH,
  author =       "Robert Ulichney",
  title =        "Digital Halftoning",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "xiv + 362",
  year =         "1987",
  ISBN =         "0-262-21009-6",
  ISBN-13 =      "978-0-262-21009-6",
  LCCN =         "T385 .U451 1987",
  bibdate =      "Wed Dec 15 10:58:55 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Unger:1987:FGF
author: J. Marshall Unger
title: The Fifth Generation Fallacy: Why Japan is Betting its Future on Artificial Intelligence
publisher: pub-OXFORD
address: pub-OXFORD:adr
pages: x + 230
year: 1987
ISBN: 0-19-504939-X OR 019504939X
ISBN13: 978-0-19-504939-8 OR 9780195049398
LCCN: QA76.85 .U541 1987
bibdate: Sun May 02 07:55:17 1999
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1999.05.02 07:55:17 ???
note: See cite Reischauer:1988:JTC.
acknowledgement: ack-nhfb
rawauthor: J. Marshall Unger
rawnote: See \cite{Reischauer:1988:JTC}.
rawtitle: The Fifth Generation Fallacy: Why Japan is Betting its Future on Artificial Intelligence
entry:
@Book{Unger:1987:FGF,
  author =       "J. Marshall Unger",
  title =        "The Fifth Generation Fallacy: Why Japan is Betting its
                 Future on Artificial Intelligence",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  pages =        "x + 230",
  year =         "1987",
  ISBN =         "0-19-504939-X",
  ISBN-13 =      "978-0-19-504939-8",
  LCCN =         "QA76.85 .U541 1987",
  bibdate =      "Sun May 02 07:55:17 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See \cite{Reischauer:1988:JTC}.",
  price =        "US\$19.95",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Unicode:1991:USW
author: The Unicode Consortium
title: The Unicode Standard: Worldwide Character Encoding. Version 1.0. Volumes 1 and 2
publisher: pub-AW
address: pub-AW:adr
pages: x + 230
year: 1991
LCCN: QA268 .U55 1991, Z103 .U6 1991
bibdate: Wed Jun 26 15:16:24 1996
bibtimestamp: 1996.06.26 15:16:24 ???
acknowledgement: ack-nhfb
key: Uni91
rawauthor: {The Unicode Consortium}
rawtitle: The Unicode Standard: Worldwide Character Encoding. Version 1.0. Volumes 1 and 2
ISBN:
0-201-56788-1 (paperback, vol. 1), 0-201-60845-6 (paperback, vol. 2) OR 0201567881 (paperback, vol. 1), 0201608456 (paperback, vol. 2)

ISBN13:
978-0-201-56788-5 (paperback, vol. 1), 978-0-201-60845-8 (paperback, vol. 2) OR 9780201567885 (paperback, vol. 1), 9780201608458 (paperback, vol. 2)

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

abstract:
The Unicode Standard is a new international standard used to encode written characters for storage in computer files or transmission over communication lines. This book is the authorized description and guide to this new standard. It is an essential reference for computer programmers and software developers who deal with multilingual text. Volume 1 covers alphabets in countries across Europe, Africa, and the Indian subcontinent.

rawabstract:
The Unicode Standard is a new international standard used to encode written characters for storage in computer files or transmission over communication lines. This book is the authorized description and guide to this new standard. It is an essential reference for computer programmers and software developers who deal with multilingual text. Volume 1 covers alphabets in countries across Europe, Africa, and the Indian subcontinent.

entry:
@Book{Unicode:1991:USW,
  author =       "{The Unicode Consortium}",
  key =          "Uni91",
  title =        "The Unicode Standard: Worldwide Character Encoding.
                 Version 1.0. Volumes 1 and 2",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  year =         "1991",
  ISBN =         "0-201-56788-1 (paperback, vol. 1), 0-201-60845-6
                 (paperback, vol. 2)",
  ISBN-13 =      "978-0-201-56788-5 (paperback, vol. 1),
                 978-0-201-60845-8 (paperback, vol. 2)",
  LCCN =         "QA268 .U55 1991, Z103 .U6 1991",
  bibdate =      "Wed Jun 26 15:16:24 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/standard.bib;
                 https://www.math.utah.edu/pub/tex/bib/unicode.bib",
  price =        "US\$39.95 (paperback), US\$32.95 (hardcover)",
  abstract =     "The Unicode Standard is a new international standard
                 used to encode written characters for storage in
                 computer files or transmission over communication
                 lines. This book is the authorized description and
                 guide to this new standard. It is an essential
                 reference for computer programmers and software
                 developers who deal with multilingual text. Volume 1
                 covers alphabets in countries across Europe, Africa,
                 and the Indian subcontinent.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}


bibtype: book
filename: master.bib
label: Unicode:1996:USV
author: The Unicode Consortium
title: The Unicode Standard, Version 2.0
publisher: pub-AW
address: pub-AW:adr
pages: various
year: 1996
ISBN: 0-201-48345-9 (paperback), 0-201-96623-9 (CD-ROM) OR 0201483459 (paperback), 0201966239 (CDROM)
ISBN13: 978-0-201-48345-1 OR 9780201483451
LCCN: QA268.U56 1996
MRclass: 68U15, 68-00, 68U99
bibdate: Wed Sep 25 12:17:05 1996
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/unicode.bib
bibtimestamp: 1996.09.25 12:17:05 ???
remark: NB: The ISBN 0-201-48345-9 is valid, but has been allocated to two different books.
acknowledgement: ack-nhfb
rawauthor: {The Unicode Consortium}
rawtitle: The {Unicode Standard}, Version 2.0
TOC:
Unicode Consortium Members and Directors 1: Introduction 2: General Structure 3: Conformance 4: Character Properties 5: Implementation Guidelines 6: Character Block Descriptions 7: Code Charts 8: Han Radical-Stroke Index A: Transformation Formats B: Submitting New Characters C: Relationship to ISO/IEC 10646 D: Cumulative Changes E: Han Unification History

rawTOC:
Unicode Consortium Members and Directors \\ 1: Introduction \\ 2: General Structure \\ 3: Conformance \\ 4: Character Properties \\ 5: Implementation Guidelines \\ 6: Character Block Descriptions \\ 7: Code Charts \\ 8: Han Radical-Stroke Index \\ A: Transformation Formats \\ B: Submitting New Characters \\ C: Relationship to ISO/IEC 10646 \\ D: Cumulative Changes \\ E: Han Unification History

entry:
@Book{Unicode:1996:USV,
  author =       "{The Unicode Consortium}",
  title =        "The {Unicode Standard}, Version 2.0",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "various",
  year =         "1996",
  ISBN =         "0-201-48345-9 (paperback), 0-201-96623-9 (CD-ROM)",
  ISBN-13 =      "978-0-201-48345-1",
  LCCN =         "QA268.U56 1996",
  MRclass =      "68U15, 68-00, 68U99",
  bibdate =      "Wed Sep 25 12:17:05 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unicode.bib",
  price =        "US\$54.95",
  acknowledgement = ack-nhfb,
  remark =       "NB: The ISBN 0-201-48345-9 is valid, but has been
                 allocated to two different books.",
  tableofcontents = "Unicode Consortium Members and Directors \\
                 1: Introduction \\
                 2: General Structure \\
                 3: Conformance \\
                 4: Character Properties \\
                 5: Implementation Guidelines \\
                 6: Character Block Descriptions \\
                 7: Code Charts \\
                 8: Han Radical-Stroke Index \\
                 A: Transformation Formats \\
                 B: Submitting New Characters \\
                 C: Relationship to ISO/IEC 10646 \\
                 D: Cumulative Changes \\
                 E: Han Unification History",
}


bibtype: book
filename: master.bib
label: Unicode:2000:USV
author: The Unicode Consortium
title: The Unicode Standard, Version 3.0
publisher: pub-AW
address: pub-AW:adr
pages: xxx + 1040
year: 2000
ISBN: 0-201-61633-5 OR 0201616335
ISBN13: 978-0-201-61633-0 OR 9780201616330
LCCN: QA268.U56 1996
bibdate: Mon Oct 15 18:01:08 2001
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/unicode.bib
bibtimestamp: 2001.10.15 18:01:08 ???
URL: http://www.unicode.org/book/; http://www.unicode.org/unicode/standard/versions/
acknowledgement: ack-nhfb
rawauthor: {The Unicode Consortium}
rawtitle: The {Unicode Standard}, Version 3.0
note:
Includes CD-ROM. The principal authors and editors of booktitle The Unicode Standard, Version 3.0 are Joan Aliprand, Julie Allen, Joe Becker, Mark Davis, Michael Everson, Asmus Freytag, John Jenkins, Mike Ksar, Rick McGowan, Lisa Moore, Michel Suignard, and Ken Whistler.

abstract:
Detailed specifications for Unicode: structure, conformance encoding forms, character properties, semantics, equivalence, combining characters, logical ordering, conversion, allocation, big/little endian usage, Korean syllable formation, control characters, case mappings, numeric values, mathematical properties, writing directions (Arabic, Japanese, English, and so on), character shaping (Arabic, Devanagari, Tamil, and so on). Expanded implementation guidelines by experts in global software design: normalization, sorting and searching, case mapping, compression, language tagging, boundaries (characters, words, lines, and sentences), rendering of non-spacing marks, transcoding to other character sets, handling unknown characters, surrogate pairs, numbers, editing and selection, keyboard input, and more.

TOC:
0.1: About the Unicode Standard / xxv Concepts, Architecture, Conformance, and Guidelines / xxv Character Block Descriptions / xxvi Unicode Character Database and Technical Reports / xxvii On the CD-ROM / xxvii 0.2: Notational Conventions / xxviii Extended BNF / xxviii Operators / xxix Unicode Web Site / xxx Unicode Anonymous FTP Site / xxx Unicode Public Mailing List / xxx How to Contact the Unicode Consortium / xxx 1.1: Coverage / 2 Standards Coverage / 3 New Characters / 3 1.2: Design Basis / 3 1.3: Text Handling / 4 Interpreting Characters / 5 Text Elements / 5 1.4: Unicode Standard and ISO/IEC 10646 / 5 1.5: Unicode Consortium / 6 Unicode Technical Committee / 6 2.1: Architectural Context / 9 Basic Text Processes / 9 Text Elements, Code Values, and Text Processes / / 10 Text Processes and Encoding / 11 2.2: Unicode Design Principles / 12 Sixteen-Bit Character Codes / 12 Efficiency / 13 Characters, Not Glyphs / 13 Semantics / 15 Plain Text / 15 Logical Order / 16 Unification / 17 Dynamic Composition / 18 Equivalent Sequence / 18 Convertibility / 18 2.3: Encoding Forms / 19 UTF-16 / 19 UTF-8 / 20 Character Encoding Schemes / 21 2.4: Unicode Allocation / 21 Allocation Areas / 21 Codespace Assignment for Graphic Characters / 23 Nongraphic Characters, Reserved and Unassigned Codes / 23 2.5: Writing Direction / 24 2.6: Combining Characters / 24 Sequence of Base Characters and Diacritics / 25 Multiple Combining Characters / 25 Multiple Base Characters / 27 Spacing Clones of European Diacritical Marks / / 27 2.7: Special Character and Noncharacter Values / 28 Byte Order Mark (BOM) / 28 Special Noncharacter Values / 28 Separators / 29 Layout and Format Control Characters / 29 Replacement Character / 29 2.8: Controls and Control Sequences / 29 Control Characters / 29 Representing Control Sequences / 30 2.9: Conforming to the Unicode Standard / 30 Characters Not Used in a Subset / 32 2.10: Referencing Versions of the Unicode Standard / / 32 3: Conformance / 37 3.1: Conformance Requirements / 37 Byte Ordering / 37 Invalid Code Values / 38 Interpretation / 38 Modification / 39 Transformations / 39 Bidirectional Text / 39 Unicode Technical Reports / 39 3.2: Semantics / 40 3.3: Characters and Coded Representations / 40 3.4: Simple Properties / 42 3.5: Combination / 43 3.6: Decomposition / 44 Compatibility Decomposition / 44 Canonical Decomposition / 44 3.7: Surrogates / 45 3.8: Transformations / 45 3.9: Special Character Properties / 47 3.10: Canonical Ordering Behavior / 50 Combining Classes / 51 Canonical Ordering / 51 Use with Collation / 52 3.11: Conjoining Jamo Behavior / 52 Syllable Boundaries / 53 Standard Syllables / 53 Hangul Syllable Composition / 54 Hangul Syllable Decomposition / 55 Hangul Syllable Names / 55 3.12: Bidirectional Behavior / 55 Directional Formatting Codes / 56 Basic Display Algorithm / 57 Definitions / 58 Resolving Embedding Levels / 61 Reordering Resolved Levels / 65 Bidirectional Conformance / 67 Implementation Notes / 68 4: Character Properties / 73 4.1: Case--Normative / 75 4.2: Combining Classes--Normative / 75 4.3: Directionality--Normative / 85 4.4: Jamo Short Names--Normative / 86 4.5: General Category--Normative in Part / 87 4.6: Numeric Value--Normative / 89 4.7: Mirrored--Normative / 97 4.8: Unicode 1.0 Names / 101 4.9: Mathematical Property / 101 4.10: Letters and Other Useful Properties / 102 5: Implementation Guidelines / 105 5.1: Transcoding to Other Standards / 105 Issues / 105 Multistage Tables / 106 7-Bit or 8-Bit Transmission / 107 Mapping Table Resources / 107 5.2: ANSI/ISO C wchar_t / 107 5.3: Unknown and Missing Characters / 108 Unassigned- and Private Use Character Codes / 108 Interpretable but Unrenderable Characters / 108 Reassigned Characters / 109 5.4: Handling Surrogate Pairs / 109 5.5: Handling Numbers / 110 5.6: Handling Properties / 111 5.7: Normalization / 112 5.8: Compression / 113 5.9: Line Handling / 113 5.10: Regular Expressions / 114 5.11: Language Information in Plain Text / 114 Requirements for Language Tagging / 114 Working with Language Tags / 114 Language Tags and Han Unification / 115 5.12: Editing and Selection / 116 Consistent Text Elements / 116 5.13: Strategies for Handling Nonspacing Marks / / 117 Keyboard Input / 118 Truncation / 119 5.14: Rendering Nonspacing Marks / 120 Positioning Methods / 122 5.15: Locating Text Element Boundaries / 124 Boundary Specification / 124 Example Specifications / 126 Grapheme Boundaries / 126 Word Boundaries / 127 Line Boundaries / 129 Sentence Boundaries / 132 Random Access / 133 5.16: Identifiers / 133 Syntactic Rule / 134 5.17: Sorting and Searching / 135 Culturally Expected Sorting / 135 Unicode Character Equivalence / 136 Similar Characters / 136 Levels of Comparison / 137 Ignorable Characters / 138 Multiple Mappings / 138 Collating Out-of-Scope Characters / 139 Unmapped Characters / 139 Parameterization / 140 Optimizations / 140 Searching / 140 Sublinear Searching / 141 5.18: Case Mappings / 141 6: Punctuation / 147 Punctuation: U+0020-U+00BF / 148 General Punctuation: U+2000-U+206F / 149 CJK Symbols and Punctuation: U+3000-U+303F / 155 CJK Compatibility Forms: U+FE30-U+FE4F / 156 Small Form Variants: U+FE50-U+FE6F / 156 7: European Alphabetic Scripts / 159 7.1: Latin / 160 Letters of Basic Latin: U+0041-U+007A / 160 Letters of the Latin-1 Supplement: U+00C0-U+00FF / / 161 Latin Extended-A: U+0100-U+017F / 161 Latin Extended-B: U+0180-U+024F / 163 IPA Extensions: U+0250-U+02AF / 164 Latin Extended Additional: U+1E00-U+1EFF / 165 Latin Ligatures: FB00-FB06 / 166 Greek: U+0370-U+03FF / 167 Greek Extended: U+1F00-U+1FFF / 169 Cyrillic: U+0400-U+04FF / 171 Armenian: U+0530-U+058F / 172 Georgian: U+10A0-U+10FF / 173 7.6: Runic / 174 Runic: U+16A0-U+16F0 / 174 Ogham: U+1680-U+169F / 176 7.8: Modifier Letters / 177 Spacing Modifer Letters: U+02B0-U+02FF / 177 7.9: Combining Marks / 179 Combining Diacritical Marks: U+0300-U+036F / 179 Combining Marks for Symbols: U+20D0-U+20FF / 180 Combining Half Marks: U+FE20-U+FE2F / 181 8: Middle Eastern Scripts / 185 Hebrew: U+0590-U+05FF / 186 Alphabetic Presentation Forms: U+FB1D-U+FB4F / 188 Arabic: U+0600-U+06FF / 189 Cursive Joining / 192 Ligatures / 194 Arabic Presentation Forms-A: U+FB50-U+FDFF / 197 Arabic Presentation Forms-B: U+FE70-U+FEFF / 197 Syriac: U+0700-U+074F / 199 Syriac Shaping / 203 Syriac Cursive Joining / 203 Ligatures / 205 Thaana: U+0780-U+07BF / 206 9: South and Southeast Asian Scripts / 209 Devanagari: U+0900-U+097F / 211 Bengali: U+0980-U+09FF / 224 Gurmukhi: U+0A00-U+0A7F / 225 Gujarati: U+0A80-U+0AFF / 226 Oriya: U+0B00-U+0B7F / 227 Tamil: U+0B80-U+0BFF / 228 Telugu: U+0C00-U+0C7F / 233 Kannada: U+0C80-U+0CFF / 234 Malayalam: U+0D00-U+0D7F / 235 Sinhala: U+0D80-U+0DFF / 236 Thai: U+0E00-U+0E7F / 237 Lao: U+0E80-U+0EFF / 239 Tibetan: U+0F00-U+0FBF / 240 9.14: Myanmar / 249 Myanmar: U+1000-U+109F / 249 9.15: Khmer / 251 10: East Asian Scripts / 257 10.1: Han / 258 CJK Unified Ideographs / 258 CJK Compatibility Ideographs: U+F900-U+FAFF / 267 Kanbum: U+3190-U+319F / 267 CJK and KangXi Radicals: U+2E80-U+2FD5 / 267 Ideographic Description: U+2FF0-U+2FFB / 268 Hiragana: U+3040-U+309F / 272 Katakana: U+30A0-U+30FF / 273 Halfwidth and Fullwidth Forms: U+FF00-U+FFEF / / 273 10.4: Hangul / 275 Hangul Jamo:s U+1100-U+11FF / 275 Hangul Compatibility Jamo: U+3130-U+318F / 275 Hangul Syllables: U+AC00-U+D7A3 / 276 Bopomofo: U+3100-U+312F / 278 Yi: U+A000-U+A4CF / 280 11: Additional Scripts / 283 Ethiopic: U+1200-U+137F / 284 Cherokee: U+13A0-U+13FF / 287 Canadian Aboriginal Syllabics: U+1400-U+167F / 288 Mongolian: U+1800-U+18AF / 289 12: Symbols / 295 Currency Symbols: U+20A0-U+20CF / 297 Letterlike Symbols: U+2100-U+214F / 298 Number Forms: U+2150-U+218F / 299 Superscripts and Subscripts: U+2070-U+209F / / 299 12.4: Mathematical Operators / 300 Arrows: U+2190-U+21FF / 301 12.5: Technical Symbols / 302 Control Pictures: U+2400-U+243F / 302 Miscellaneous Technical: U+2300-U+23FF / 302 Optical Character Recognition: U+2440-U+245F / / 303 12.6: Geometrical Symbols / 304 Box Drawing: U+2500-U+257F / 304 Block Elements: U+2580-U+259F / 304 Geometric Shapes: U+25A0-U+25FF / 304 Miscellaneous Symbols: U+2600-U+26FF / 305 Dingbats: U+2700-U+27BF / 305 12.8: Enclosed and Square / 307 Enclosed Alphanumerics: U+2460-U+24FF / 307 Enclosed CJK Letters and Months: U+3200-U+32FF / / 307 CJK Compatibility: U+3300-U+33FF / 307 Braille: U+2800-U+28FF / 308 13: Special Areas and Format Characters / 313 C0 Control Codes: U+0000-U+001F / 314 C1 Control Codes: U+0080-U+009F / 314 Layout Controls / 315 Deprecated Format Characters: U+206A-U+206F / 320 Surrogates Area: U+D800-U+DFFF / 322 Private Use Area: U+E000-U+F8FF / 323 Specials: U+FEFF, U+FFF0-U+FFFF / 324 14: Code Charts / 331 14.1: Character Names List / 331 Images in the Code Charts and Character Lists / / 332 Cross References / 333 Case Form Mappings / 333 Decompositions / 333 Information About Languages / 334 Reserved Characters / 334 14.2: CJK Unified Ideographs / 335 14.3: Hangul Syllables / 335 15: Han Indices / 849 15.1: Han Radical-Stroke Index / 849

rawabstract:
Detailed specifications for Unicode: structure, conformance encoding forms, character properties, semantics, equivalence, combining characters, logical ordering, conversion, allocation, big/little endian usage, Korean syllable formation, control characters, case mappings, numeric values, mathematical properties, writing directions (Arabic, Japanese, English, and so on), character shaping (Arabic, Devanagari, Tamil, and so on). Expanded implementation guidelines by experts in global software design: normalization, sorting and searching, case mapping, compression, language tagging, boundaries (characters, words, lines, and sentences), rendering of non-spacing marks, transcoding to other character sets, handling unknown characters, surrogate pairs, numbers, editing and selection, keyboard input, and more.

rawnote:
Includes CD-ROM. The principal authors and editors of \booktitle{The Unicode Standard, Version 3.0} are Joan Aliprand, Julie Allen, Joe Becker, Mark Davis, Michael Everson, Asmus Freytag, John Jenkins, Mike Ksar, Rick McGowan, Lisa Moore, Michel Suignard, and Ken Whistler.

rawTOC:
0.1: About the Unicode Standard / xxv \\ Concepts, Architecture, Conformance, and Guidelines / xxv \\ Character Block Descriptions / xxvi \\ Unicode Character Database and Technical Reports / xxvii \\ On the CD-ROM / xxvii \\ 0.2: Notational Conventions / xxviii \\ Extended BNF / xxviii \\ Operators / xxix \\ Unicode Web Site / xxx \\ Unicode Anonymous FTP Site / xxx \\ Unicode Public Mailing List / xxx \\ How to Contact the Unicode Consortium / xxx \\ 1.1: Coverage / 2 \\ Standards Coverage / 3 \\ New Characters / 3 \\ 1.2: Design Basis / 3 \\ 1.3: Text Handling / 4 \\ Interpreting Characters / 5 \\ Text Elements / 5 \\ 1.4: Unicode Standard and ISO/IEC 10646 / 5 \\ 1.5: Unicode Consortium / 6 \\ Unicode Technical Committee / 6 \\ 2.1: Architectural Context / 9 \\ Basic Text Processes / 9 \\ Text Elements, Code Values, and Text Processes / / 10 \\ \\ Text Processes and Encoding / 11 \\ 2.2: Unicode Design Principles / 12 \\ Sixteen-Bit Character Codes / 12 \\ Efficiency / 13 \\ Characters, Not Glyphs / 13 \\ Semantics / 15 \\ Plain Text / 15 \\ Logical Order / 16 \\ Unification / 17 \\ Dynamic Composition / 18 \\ Equivalent Sequence / 18 \\ Convertibility / 18 \\ 2.3: Encoding Forms / 19 \\ UTF-16 / 19 \\ UTF-8 / 20 \\ Character Encoding Schemes / 21 \\ 2.4: Unicode Allocation / 21 \\ Allocation Areas / 21 \\ Codespace Assignment for Graphic Characters / 23 \\ Nongraphic Characters, Reserved and Unassigned Codes / 23 \\ 2.5: Writing Direction / 24 \\ 2.6: Combining Characters / 24 \\ Sequence of Base Characters and Diacritics / 25 \\ Multiple Combining Characters / 25 \\ Multiple Base Characters / 27 \\ Spacing Clones of European Diacritical Marks / / 27 \\ \\ 2.7: Special Character and Noncharacter Values / 28 \\ Byte Order Mark (BOM) / 28 \\ Special Noncharacter Values / 28 \\ Separators / 29 \\ Layout and Format Control Characters / 29 \\ Replacement Character / 29 \\ 2.8: Controls and Control Sequences / 29 \\ Control Characters / 29 \\ Representing Control Sequences / 30 \\ 2.9: Conforming to the Unicode Standard / 30 \\ Characters Not Used in a Subset / 32 \\ 2.10: Referencing Versions of the Unicode Standard / / 32 \\ \\ 3: Conformance / 37 \\ 3.1: Conformance Requirements / 37 \\ Byte Ordering / 37 \\ Invalid Code Values / 38 \\ Interpretation / 38 \\ Modification / 39 \\ Transformations / 39 \\ Bidirectional Text / 39 \\ Unicode Technical Reports / 39 \\ 3.2: Semantics / 40 \\ 3.3: Characters and Coded Representations / 40 \\ 3.4: Simple Properties / 42 \\ 3.5: Combination / 43 \\ 3.6: Decomposition / 44 \\ Compatibility Decomposition / 44 \\ Canonical Decomposition / 44 \\ 3.7: Surrogates / 45 \\ 3.8: Transformations / 45 \\ 3.9: Special Character Properties / 47 \\ 3.10: Canonical Ordering Behavior / 50 \\ Combining Classes / 51 \\ Canonical Ordering / 51 \\ Use with Collation / 52 \\ 3.11: Conjoining Jamo Behavior / 52 \\ Syllable Boundaries / 53 \\ Standard Syllables / 53 \\ Hangul Syllable Composition / 54 \\ Hangul Syllable Decomposition / 55 \\ Hangul Syllable Names / 55 \\ 3.12: Bidirectional Behavior / 55 \\ Directional Formatting Codes / 56 \\ Basic Display Algorithm / 57 \\ Definitions / 58 \\ Resolving Embedding Levels / 61 \\ Reordering Resolved Levels / 65 \\ Bidirectional Conformance / 67 \\ Implementation Notes / 68 \\ 4: Character Properties / 73 \\ 4.1: Case--Normative / 75 \\ 4.2: Combining Classes--Normative / 75 \\ 4.3: Directionality--Normative / 85 \\ 4.4: Jamo Short Names--Normative / 86 \\ 4.5: General Category--Normative in Part / 87 \\ 4.6: Numeric Value--Normative / 89 \\ 4.7: Mirrored--Normative / 97 \\ 4.8: Unicode 1.0 Names / 101 \\ 4.9: Mathematical Property / 101 \\ 4.10: Letters and Other Useful Properties / 102 \\ 5: Implementation Guidelines / 105 \\ 5.1: Transcoding to Other Standards / 105 \\ Issues / 105 \\ Multistage Tables / 106 \\ 7-Bit or 8-Bit Transmission / 107 \\ Mapping Table Resources / 107 \\ 5.2: ANSI/ISO C wchar\_t / 107 \\ 5.3: Unknown and Missing Characters / 108 \\ Unassigned- and Private Use Character Codes / 108 \\ Interpretable but Unrenderable Characters / 108 \\ Reassigned Characters / 109 \\ 5.4: Handling Surrogate Pairs / 109 \\ 5.5: Handling Numbers / 110 \\ 5.6: Handling Properties / 111 \\ 5.7: Normalization / 112 \\ 5.8: Compression / 113 \\ 5.9: Line Handling / 113 \\ 5.10: Regular Expressions / 114 \\ 5.11: Language Information in Plain Text / 114 \\ Requirements for Language Tagging / 114 \\ Working with Language Tags / 114 \\ Language Tags and Han Unification / 115 \\ 5.12: Editing and Selection / 116 \\ Consistent Text Elements / 116 \\ 5.13: Strategies for Handling Nonspacing Marks / / 117 \\ \\ Keyboard Input / 118 \\ Truncation / 119 \\ 5.14: Rendering Nonspacing Marks / 120 \\ Positioning Methods / 122 \\ 5.15: Locating Text Element Boundaries / 124 \\ Boundary Specification / 124 \\ Example Specifications / 126 \\ Grapheme Boundaries / 126 \\ Word Boundaries / 127 \\ Line Boundaries / 129 \\ Sentence Boundaries / 132 \\ Random Access / 133 \\ 5.16: Identifiers / 133 \\ Syntactic Rule / 134 \\ 5.17: Sorting and Searching / 135 \\ Culturally Expected Sorting / 135 \\ Unicode Character Equivalence / 136 \\ Similar Characters / 136 \\ Levels of Comparison / 137 \\ Ignorable Characters / 138 \\ Multiple Mappings / 138 \\ Collating Out-of-Scope Characters / 139 \\ Unmapped Characters / 139 \\ Parameterization / 140 \\ Optimizations / 140 \\ Searching / 140 \\ Sublinear Searching / 141 \\ 5.18: Case Mappings / 141 \\ 6: Punctuation / 147 \\ Punctuation: U+0020-U+00BF / 148 \\ General Punctuation: U+2000-U+206F / 149 \\ CJK Symbols and Punctuation: U+3000-U+303F / 155 \\ CJK Compatibility Forms: U+FE30-U+FE4F / 156 \\ Small Form Variants: U+FE50-U+FE6F / 156 \\ 7: European Alphabetic Scripts / 159 \\ 7.1: Latin / 160 \\ Letters of Basic Latin: U+0041-U+007A / 160 \\ Letters of the Latin-1 Supplement: U+00C0-U+00FF / / 161 \\ \\ Latin Extended-A: U+0100-U+017F / 161 \\ Latin Extended-B: U+0180-U+024F / 163 \\ IPA Extensions: U+0250-U+02AF / 164 \\ Latin Extended Additional: U+1E00-U+1EFF / 165 \\ Latin Ligatures: FB00-FB06 / 166 \\ Greek: U+0370-U+03FF / 167 \\ Greek Extended: U+1F00-U+1FFF / 169 \\ Cyrillic: U+0400-U+04FF / 171 \\ Armenian: U+0530-U+058F / 172 \\ Georgian: U+10A0-U+10FF / 173 \\ 7.6: Runic / 174 \\ Runic: U+16A0-U+16F0 / 174 \\ Ogham: U+1680-U+169F / 176 \\ 7.8: Modifier Letters / 177 \\ Spacing Modifer Letters: U+02B0-U+02FF / 177 \\ 7.9: Combining Marks / 179 \\ Combining Diacritical Marks: U+0300-U+036F / 179 \\ Combining Marks for Symbols: U+20D0-U+20FF / 180 \\ Combining Half Marks: U+FE20-U+FE2F / 181 \\ 8: Middle Eastern Scripts / 185 \\ Hebrew: U+0590-U+05FF / 186 \\ Alphabetic Presentation Forms: U+FB1D-U+FB4F / 188 \\ Arabic: U+0600-U+06FF / 189 \\ Cursive Joining / 192 \\ Ligatures / 194 \\ Arabic Presentation Forms-A: U+FB50-U+FDFF / 197 \\ Arabic Presentation Forms-B: U+FE70-U+FEFF / 197 \\ Syriac: U+0700-U+074F / 199 \\ Syriac Shaping / 203 \\ Syriac Cursive Joining / 203 \\ Ligatures / 205 \\ Thaana: U+0780-U+07BF / 206 \\ 9: South and Southeast Asian Scripts / 209 \\ Devanagari: U+0900-U+097F / 211 \\ Bengali: U+0980-U+09FF / 224 \\ Gurmukhi: U+0A00-U+0A7F / 225 \\ Gujarati: U+0A80-U+0AFF / 226 \\ Oriya: U+0B00-U+0B7F / 227 \\ Tamil: U+0B80-U+0BFF / 228 \\ Telugu: U+0C00-U+0C7F / 233 \\ Kannada: U+0C80-U+0CFF / 234 \\ Malayalam: U+0D00-U+0D7F / 235 \\ Sinhala: U+0D80-U+0DFF / 236 \\ Thai: U+0E00-U+0E7F / 237 \\ Lao: U+0E80-U+0EFF / 239 \\ Tibetan: U+0F00-U+0FBF / 240 \\ 9.14: Myanmar / 249 \\ Myanmar: U+1000-U+109F / 249 \\ 9.15: Khmer / 251 \\ 10: East Asian Scripts / 257 \\ 10.1: Han / 258 \\ CJK Unified Ideographs / 258 \\ CJK Compatibility Ideographs: U+F900-U+FAFF / 267 \\ Kanbum: U+3190-U+319F / 267 \\ CJK and KangXi Radicals: U+2E80-U+2FD5 / 267 \\ Ideographic Description: U+2FF0-U+2FFB / 268 \\ Hiragana: U+3040-U+309F / 272 \\ Katakana: U+30A0-U+30FF / 273 \\ Halfwidth and Fullwidth Forms: U+FF00-U+FFEF / / 273 \\ \\ 10.4: Hangul / 275 \\ Hangul Jamo:s U+1100-U+11FF / 275 \\ Hangul Compatibility Jamo: U+3130-U+318F / 275 \\ Hangul Syllables: U+AC00-U+D7A3 / 276 \\ Bopomofo: U+3100-U+312F / 278 \\ Yi: U+A000-U+A4CF / 280 \\ 11: Additional Scripts / 283 \\ Ethiopic: U+1200-U+137F / 284 \\ Cherokee: U+13A0-U+13FF / 287 \\ Canadian Aboriginal Syllabics: U+1400-U+167F / 288 \\ Mongolian: U+1800-U+18AF / 289 \\ 12: Symbols / 295 \\ Currency Symbols: U+20A0-U+20CF / 297 \\ Letterlike Symbols: U+2100-U+214F / 298 \\ Number Forms: U+2150-U+218F / 299 \\ Superscripts and Subscripts: U+2070-U+209F / / 299 \\ \\ 12.4: Mathematical Operators / 300 \\ Arrows: U+2190-U+21FF / 301 \\ 12.5: Technical Symbols / 302 \\ Control Pictures: U+2400-U+243F / 302 \\ Miscellaneous Technical: U+2300-U+23FF / 302 \\ Optical Character Recognition: U+2440-U+245F / / 303 \\ \\ 12.6: Geometrical Symbols / 304 \\ Box Drawing: U+2500-U+257F / 304 \\ Block Elements: U+2580-U+259F / 304 \\ Geometric Shapes: U+25A0-U+25FF / 304 \\ Miscellaneous Symbols: U+2600-U+26FF / 305 \\ Dingbats: U+2700-U+27BF / 305 \\ 12.8: Enclosed and Square / 307 \\ Enclosed Alphanumerics: U+2460-U+24FF / 307 \\ Enclosed CJK Letters and Months: U+3200-U+32FF / / 307 \\ \\ CJK Compatibility: U+3300-U+33FF / 307 \\ Braille: U+2800-U+28FF / 308 \\ 13: Special Areas and Format Characters / 313 \\ C0 Control Codes: U+0000-U+001F / 314 \\ C1 Control Codes: U+0080-U+009F / 314 \\ Layout Controls / 315 \\ Deprecated Format Characters: U+206A-U+206F / 320 \\ Surrogates Area: U+D800-U+DFFF / 322 \\ Private Use Area: U+E000-U+F8FF / 323 \\ Specials: U+FEFF, U+FFF0-U+FFFF / 324 \\ 14: Code Charts / 331 \\ 14.1: Character Names List / 331 \\ Images in the Code Charts and Character Lists / / 332 \\ \\ Cross References / 333 \\ Case Form Mappings / 333 \\ Decompositions / 333 \\ Information About Languages / 334 \\ Reserved Characters / 334 \\ 14.2: CJK Unified Ideographs / 335 \\ 14.3: Hangul Syllables / 335 \\ 15: Han Indices / 849 \\ 15.1: Han Radical-Stroke Index / 849

entry:
@Book{Unicode:2000:USV,
  author =       "{The Unicode Consortium}",
  title =        "The {Unicode Standard}, Version 3.0",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xxx + 1040",
  year =         "2000",
  ISBN =         "0-201-61633-5",
  ISBN-13 =      "978-0-201-61633-0",
  LCCN =         "QA268.U56 1996",
  bibdate =      "Mon Oct 15 18:01:08 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unicode.bib",
  note =         "Includes CD-ROM. The principal authors and editors of
                 \booktitle{The Unicode Standard, Version 3.0} are Joan
                 Aliprand, Julie Allen, Joe Becker, Mark Davis, Michael
                 Everson, Asmus Freytag, John Jenkins, Mike Ksar, Rick
                 McGowan, Lisa Moore, Michel Suignard, and Ken
                 Whistler.",
  price =        "US\$50.00",
  URL =          "http://www.unicode.org/book/;
                 http://www.unicode.org/unicode/standard/versions/",
  abstract =     "Detailed specifications for Unicode: structure,
                 conformance encoding forms, character properties,
                 semantics, equivalence, combining characters, logical
                 ordering, conversion, allocation, big/little endian
                 usage, Korean syllable formation, control characters,
                 case mappings, numeric values, mathematical properties,
                 writing directions (Arabic, Japanese, English, and so
                 on), character shaping (Arabic, Devanagari, Tamil, and
                 so on). Expanded implementation guidelines by experts
                 in global software design: normalization, sorting and
                 searching, case mapping, compression, language tagging,
                 boundaries (characters, words, lines, and sentences),
                 rendering of non-spacing marks, transcoding to other
                 character sets, handling unknown characters, surrogate
                 pairs, numbers, editing and selection, keyboard input,
                 and more.",
  acknowledgement = ack-nhfb,
  tableofcontents = "0.1: About the Unicode Standard / xxv \\
                 Concepts, Architecture, Conformance, and Guidelines /
                 xxv \\
                 Character Block Descriptions / xxvi \\
                 Unicode Character Database and Technical Reports /
                 xxvii \\
                 On the CD-ROM / xxvii \\
                 0.2: Notational Conventions / xxviii \\
                 Extended BNF / xxviii \\
                 Operators / xxix \\
                 Unicode Web Site / xxx \\
                 Unicode Anonymous FTP Site / xxx \\
                 Unicode Public Mailing List / xxx \\
                 How to Contact the Unicode Consortium / xxx \\
                 1.1: Coverage / 2 \\
                 Standards Coverage / 3 \\
                 New Characters / 3 \\
                 1.2: Design Basis / 3 \\
                 1.3: Text Handling / 4 \\
                 Interpreting Characters / 5 \\
                 Text Elements / 5 \\
                 1.4: Unicode Standard and ISO/IEC 10646 / 5 \\
                 1.5: Unicode Consortium / 6 \\
                 Unicode Technical Committee / 6 \\
                 2.1: Architectural Context / 9 \\
                 Basic Text Processes / 9 \\
                 Text Elements, Code Values, and Text Processes / / 10
                 \\
                 \\
                 Text Processes and Encoding / 11 \\
                 2.2: Unicode Design Principles / 12 \\
                 Sixteen-Bit Character Codes / 12 \\
                 Efficiency / 13 \\
                 Characters, Not Glyphs / 13 \\
                 Semantics / 15 \\
                 Plain Text / 15 \\
                 Logical Order / 16 \\
                 Unification / 17 \\
                 Dynamic Composition / 18 \\
                 Equivalent Sequence / 18 \\
                 Convertibility / 18 \\
                 2.3: Encoding Forms / 19 \\
                 UTF-16 / 19 \\
                 UTF-8 / 20 \\
                 Character Encoding Schemes / 21 \\
                 2.4: Unicode Allocation / 21 \\
                 Allocation Areas / 21 \\
                 Codespace Assignment for Graphic Characters / 23 \\
                 Nongraphic Characters, Reserved and Unassigned Codes /
                 23 \\
                 2.5: Writing Direction / 24 \\
                 2.6: Combining Characters / 24 \\
                 Sequence of Base Characters and Diacritics / 25 \\
                 Multiple Combining Characters / 25 \\
                 Multiple Base Characters / 27 \\
                 Spacing Clones of European Diacritical Marks / / 27 \\
                 \\
                 2.7: Special Character and Noncharacter Values / 28 \\
                 Byte Order Mark (BOM) / 28 \\
                 Special Noncharacter Values / 28 \\
                 Separators / 29 \\
                 Layout and Format Control Characters / 29 \\
                 Replacement Character / 29 \\
                 2.8: Controls and Control Sequences / 29 \\
                 Control Characters / 29 \\
                 Representing Control Sequences / 30 \\
                 2.9: Conforming to the Unicode Standard / 30 \\
                 Characters Not Used in a Subset / 32 \\
                 2.10: Referencing Versions of the Unicode Standard / /
                 32 \\
                 \\
                 3: Conformance / 37 \\
                 3.1: Conformance Requirements / 37 \\
                 Byte Ordering / 37 \\
                 Invalid Code Values / 38 \\
                 Interpretation / 38 \\
                 Modification / 39 \\
                 Transformations / 39 \\
                 Bidirectional Text / 39 \\
                 Unicode Technical Reports / 39 \\
                 3.2: Semantics / 40 \\
                 3.3: Characters and Coded Representations / 40 \\
                 3.4: Simple Properties / 42 \\
                 3.5: Combination / 43 \\
                 3.6: Decomposition / 44 \\
                 Compatibility Decomposition / 44 \\
                 Canonical Decomposition / 44 \\
                 3.7: Surrogates / 45 \\
                 3.8: Transformations / 45 \\
                 3.9: Special Character Properties / 47 \\
                 3.10: Canonical Ordering Behavior / 50 \\
                 Combining Classes / 51 \\
                 Canonical Ordering / 51 \\
                 Use with Collation / 52 \\
                 3.11: Conjoining Jamo Behavior / 52 \\
                 Syllable Boundaries / 53 \\
                 Standard Syllables / 53 \\
                 Hangul Syllable Composition / 54 \\
                 Hangul Syllable Decomposition / 55 \\
                 Hangul Syllable Names / 55 \\
                 3.12: Bidirectional Behavior / 55 \\
                 Directional Formatting Codes / 56 \\
                 Basic Display Algorithm / 57 \\
                 Definitions / 58 \\
                 Resolving Embedding Levels / 61 \\
                 Reordering Resolved Levels / 65 \\
                 Bidirectional Conformance / 67 \\
                 Implementation Notes / 68 \\
                 4: Character Properties / 73 \\
                 4.1: Case--Normative / 75 \\
                 4.2: Combining Classes--Normative / 75 \\
                 4.3: Directionality--Normative / 85 \\
                 4.4: Jamo Short Names--Normative / 86 \\
                 4.5: General Category--Normative in Part / 87 \\
                 4.6: Numeric Value--Normative / 89 \\
                 4.7: Mirrored--Normative / 97 \\
                 4.8: Unicode 1.0 Names / 101 \\
                 4.9: Mathematical Property / 101 \\
                 4.10: Letters and Other Useful Properties / 102 \\
                 5: Implementation Guidelines / 105 \\
                 5.1: Transcoding to Other Standards / 105 \\
                 Issues / 105 \\
                 Multistage Tables / 106 \\
                 7-Bit or 8-Bit Transmission / 107 \\
                 Mapping Table Resources / 107 \\
                 5.2: ANSI/ISO C wchar\_t / 107 \\
                 5.3: Unknown and Missing Characters / 108 \\
                 Unassigned- and Private Use Character Codes / 108 \\
                 Interpretable but Unrenderable Characters / 108 \\
                 Reassigned Characters / 109 \\
                 5.4: Handling Surrogate Pairs / 109 \\
                 5.5: Handling Numbers / 110 \\
                 5.6: Handling Properties / 111 \\
                 5.7: Normalization / 112 \\
                 5.8: Compression / 113 \\
                 5.9: Line Handling / 113 \\
                 5.10: Regular Expressions / 114 \\
                 5.11: Language Information in Plain Text / 114 \\
                 Requirements for Language Tagging / 114 \\
                 Working with Language Tags / 114 \\
                 Language Tags and Han Unification / 115 \\
                 5.12: Editing and Selection / 116 \\
                 Consistent Text Elements / 116 \\
                 5.13: Strategies for Handling Nonspacing Marks / / 117
                 \\
                 \\
                 Keyboard Input / 118 \\
                 Truncation / 119 \\
                 5.14: Rendering Nonspacing Marks / 120 \\
                 Positioning Methods / 122 \\
                 5.15: Locating Text Element Boundaries / 124 \\
                 Boundary Specification / 124 \\
                 Example Specifications / 126 \\
                 Grapheme Boundaries / 126 \\
                 Word Boundaries / 127 \\
                 Line Boundaries / 129 \\
                 Sentence Boundaries / 132 \\
                 Random Access / 133 \\
                 5.16: Identifiers / 133 \\
                 Syntactic Rule / 134 \\
                 5.17: Sorting and Searching / 135 \\
                 Culturally Expected Sorting / 135 \\
                 Unicode Character Equivalence / 136 \\
                 Similar Characters / 136 \\
                 Levels of Comparison / 137 \\
                 Ignorable Characters / 138 \\
                 Multiple Mappings / 138 \\
                 Collating Out-of-Scope Characters / 139 \\
                 Unmapped Characters / 139 \\
                 Parameterization / 140 \\
                 Optimizations / 140 \\
                 Searching / 140 \\
                 Sublinear Searching / 141 \\
                 5.18: Case Mappings / 141 \\
                 6: Punctuation / 147 \\
                 Punctuation: U+0020-U+00BF / 148 \\
                 General Punctuation: U+2000-U+206F / 149 \\
                 CJK Symbols and Punctuation: U+3000-U+303F / 155 \\
                 CJK Compatibility Forms: U+FE30-U+FE4F / 156 \\
                 Small Form Variants: U+FE50-U+FE6F / 156 \\
                 7: European Alphabetic Scripts / 159 \\
                 7.1: Latin / 160 \\
                 Letters of Basic Latin: U+0041-U+007A / 160 \\
                 Letters of the Latin-1 Supplement: U+00C0-U+00FF / /
                 161 \\
                 \\
                 Latin Extended-A: U+0100-U+017F / 161 \\
                 Latin Extended-B: U+0180-U+024F / 163 \\
                 IPA Extensions: U+0250-U+02AF / 164 \\
                 Latin Extended Additional: U+1E00-U+1EFF / 165 \\
                 Latin Ligatures: FB00-FB06 / 166 \\
                 Greek: U+0370-U+03FF / 167 \\
                 Greek Extended: U+1F00-U+1FFF / 169 \\
                 Cyrillic: U+0400-U+04FF / 171 \\
                 Armenian: U+0530-U+058F / 172 \\
                 Georgian: U+10A0-U+10FF / 173 \\
                 7.6: Runic / 174 \\
                 Runic: U+16A0-U+16F0 / 174 \\
                 Ogham: U+1680-U+169F / 176 \\
                 7.8: Modifier Letters / 177 \\
                 Spacing Modifer Letters: U+02B0-U+02FF / 177 \\
                 7.9: Combining Marks / 179 \\
                 Combining Diacritical Marks: U+0300-U+036F / 179 \\
                 Combining Marks for Symbols: U+20D0-U+20FF / 180 \\
                 Combining Half Marks: U+FE20-U+FE2F / 181 \\
                 8: Middle Eastern Scripts / 185 \\
                 Hebrew: U+0590-U+05FF / 186 \\
                 Alphabetic Presentation Forms: U+FB1D-U+FB4F / 188 \\
                 Arabic: U+0600-U+06FF / 189 \\
                 Cursive Joining / 192 \\
                 Ligatures / 194 \\
                 Arabic Presentation Forms-A: U+FB50-U+FDFF / 197 \\
                 Arabic Presentation Forms-B: U+FE70-U+FEFF / 197 \\
                 Syriac: U+0700-U+074F / 199 \\
                 Syriac Shaping / 203 \\
                 Syriac Cursive Joining / 203 \\
                 Ligatures / 205 \\
                 Thaana: U+0780-U+07BF / 206 \\
                 9: South and Southeast Asian Scripts / 209 \\
                 Devanagari: U+0900-U+097F / 211 \\
                 Bengali: U+0980-U+09FF / 224 \\
                 Gurmukhi: U+0A00-U+0A7F / 225 \\
                 Gujarati: U+0A80-U+0AFF / 226 \\
                 Oriya: U+0B00-U+0B7F / 227 \\
                 Tamil: U+0B80-U+0BFF / 228 \\
                 Telugu: U+0C00-U+0C7F / 233 \\
                 Kannada: U+0C80-U+0CFF / 234 \\
                 Malayalam: U+0D00-U+0D7F / 235 \\
                 Sinhala: U+0D80-U+0DFF / 236 \\
                 Thai: U+0E00-U+0E7F / 237 \\
                 Lao: U+0E80-U+0EFF / 239 \\
                 Tibetan: U+0F00-U+0FBF / 240 \\
                 9.14: Myanmar / 249 \\
                 Myanmar: U+1000-U+109F / 249 \\
                 9.15: Khmer / 251 \\
                 10: East Asian Scripts / 257 \\
                 10.1: Han / 258 \\
                 CJK Unified Ideographs / 258 \\
                 CJK Compatibility Ideographs: U+F900-U+FAFF / 267 \\
                 Kanbum: U+3190-U+319F / 267 \\
                 CJK and KangXi Radicals: U+2E80-U+2FD5 / 267 \\
                 Ideographic Description: U+2FF0-U+2FFB / 268 \\
                 Hiragana: U+3040-U+309F / 272 \\
                 Katakana: U+30A0-U+30FF / 273 \\
                 Halfwidth and Fullwidth Forms: U+FF00-U+FFEF / / 273
                 \\
                 \\
                 10.4: Hangul / 275 \\
                 Hangul Jamo:s U+1100-U+11FF / 275 \\
                 Hangul Compatibility Jamo: U+3130-U+318F / 275 \\
                 Hangul Syllables: U+AC00-U+D7A3 / 276 \\
                 Bopomofo: U+3100-U+312F / 278 \\
                 Yi: U+A000-U+A4CF / 280 \\
                 11: Additional Scripts / 283 \\
                 Ethiopic: U+1200-U+137F / 284 \\
                 Cherokee: U+13A0-U+13FF / 287 \\
                 Canadian Aboriginal Syllabics: U+1400-U+167F / 288 \\
                 Mongolian: U+1800-U+18AF / 289 \\
                 12: Symbols / 295 \\
                 Currency Symbols: U+20A0-U+20CF / 297 \\
                 Letterlike Symbols: U+2100-U+214F / 298 \\
                 Number Forms: U+2150-U+218F / 299 \\
                 Superscripts and Subscripts: U+2070-U+209F / / 299 \\
                 \\
                 12.4: Mathematical Operators / 300 \\
                 Arrows: U+2190-U+21FF / 301 \\
                 12.5: Technical Symbols / 302 \\
                 Control Pictures: U+2400-U+243F / 302 \\
                 Miscellaneous Technical: U+2300-U+23FF / 302 \\
                 Optical Character Recognition: U+2440-U+245F / / 303
                 \\
                 \\
                 12.6: Geometrical Symbols / 304 \\
                 Box Drawing: U+2500-U+257F / 304 \\
                 Block Elements: U+2580-U+259F / 304 \\
                 Geometric Shapes: U+25A0-U+25FF / 304 \\
                 Miscellaneous Symbols: U+2600-U+26FF / 305 \\
                 Dingbats: U+2700-U+27BF / 305 \\
                 12.8: Enclosed and Square / 307 \\
                 Enclosed Alphanumerics: U+2460-U+24FF / 307 \\
                 Enclosed CJK Letters and Months: U+3200-U+32FF / / 307
                 \\
                 \\
                 CJK Compatibility: U+3300-U+33FF / 307 \\
                 Braille: U+2800-U+28FF / 308 \\
                 13: Special Areas and Format Characters / 313 \\
                 C0 Control Codes: U+0000-U+001F / 314 \\
                 C1 Control Codes: U+0080-U+009F / 314 \\
                 Layout Controls / 315 \\
                 Deprecated Format Characters: U+206A-U+206F / 320 \\
                 Surrogates Area: U+D800-U+DFFF / 322 \\
                 Private Use Area: U+E000-U+F8FF / 323 \\
                 Specials: U+FEFF, U+FFF0-U+FFFF / 324 \\
                 14: Code Charts / 331 \\
                 14.1: Character Names List / 331 \\
                 Images in the Code Charts and Character Lists / / 332
                 \\
                 \\
                 Cross References / 333 \\
                 Case Form Mappings / 333 \\
                 Decompositions / 333 \\
                 Information About Languages / 334 \\
                 Reserved Characters / 334 \\
                 14.2: CJK Unified Ideographs / 335 \\
                 14.3: Hangul Syllables / 335 \\
                 15: Han Indices / 849 \\
                 15.1: Han Radical-Stroke Index / 849",
}


bibtype: book
filename: master.bib
label: Unicode:2003:USV
author: The Unicode Consortium
title: The Unicode Standard, Version 4.0
publisher: pub-AW
address: pub-AW:adr
pages: xxxviii + 1462
year: 2003
ISBN: 0-321-18578-1 OR 0321185781
ISBN13: 978-0-321-18578-5 OR 9780321185785
LCCN: QA268 .U545 2004
bibdate: Tue Oct 21 17:47:30 2003
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2003.10.21 17:47:30 ???
note: Includes CD-ROM.
URL: http://www.unicode.org/versions/Unicode4.0.0/
acknowledgement: ack-nhfb
rawauthor: {The Unicode Consortium}
rawnote: Includes CD-ROM.
rawtitle: The {Unicode Standard}, Version 4.0
abstract:
booktitle The Unicode Standard provides a unique code number for every character in electronic text, no matter what the platform, no matter what the application, no matter what the language. It is required for XML and is at the core of modern software products. Unicode 4.0 contains 96,248 characters covering languages of the world. booktitle The Unicode Standard contains extensive descriptions of each writing system, as well as definitions of character properties and detailed conformance requirements. It is the complete and definitive user's guide for novices and experts alike. This edition, booktitle The Unicode Standard, Version 4.0, adds 47,188 new characters for minority and historic scripts, several sets of symbols, and a very large collection of additional CJK [Chinese Japanese Korean] ideographs. It provides updated specifications covering structure, conformance, character behavior and semantics, as well as implementation guidelines, detailed discussions of writing systems, comprehensive charts, and an extensive glossary. The accompanying CD-ROM includes the text of all the Unicode Standard Annexes and the entire Unicode Character Database.

TOC:
Unicode Consortium Members and Directors 1: Introduction 2: General Structure 3: Conformance 4: Character Properties 5: Implementation Guidelines 6: Writing Systems and Punctuation 7: European Alphabetic Scripts 8: Middle Eastern Scripts 9: South Asian Scripts 10: Southeast Asian Scripts 11: East Asian Scripts 12: Additional Modern Scripts 13: Archaic Scripts 14: Symbols 15: Special Areas and Format Characters 16: Code Charts 17: Han Radical-Stroke Index A: Han Unification History B: Abstracts of Unicode Technical Reports C: Relationship to ISO/IEC 10646 D: Changes from Unicode Version 3.0

rawabstract:
\booktitle{The Unicode Standard} provides a unique code number for every character in electronic text, no matter what the platform, no matter what the application, no matter what the language. It is required for XML and is at the core of modern software products. Unicode 4.0 contains 96,248 characters covering languages of the world. \booktitle{The Unicode Standard} contains extensive descriptions of each writing system, as well as definitions of character properties and detailed conformance requirements. It is the complete and definitive user's guide for novices and experts alike. This edition, \booktitle{The Unicode Standard}, Version 4.0, adds 47,188 new characters for minority and historic scripts, several sets of symbols, and a very large collection of additional CJK [Chinese Japanese Korean] ideographs. It provides updated specifications covering structure, conformance, character behavior and semantics, as well as implementation guidelines, detailed discussions of writing systems, comprehensive charts, and an extensive glossary. The accompanying CD-ROM includes the text of all the Unicode Standard Annexes and the entire Unicode Character Database.

rawTOC:
Unicode Consortium Members and Directors \\ 1: Introduction \\ 2: General Structure \\ 3: Conformance \\ 4: Character Properties \\ 5: Implementation Guidelines \\ 6: Writing Systems and Punctuation \\ 7: European Alphabetic Scripts \\ 8: Middle Eastern Scripts \\ 9: South Asian Scripts \\ 10: Southeast Asian Scripts \\ 11: East Asian Scripts \\ 12: Additional Modern Scripts \\ 13: Archaic Scripts \\ 14: Symbols \\ 15: Special Areas and Format Characters \\ 16: Code Charts \\ 17: Han Radical-Stroke Index \\ A: Han Unification History \\ B: Abstracts of Unicode Technical Reports \\ C: Relationship to ISO/IEC 10646 \\ D: Changes from Unicode Version 3.0

entry:
@Book{Unicode:2003:USV,
  author =       "{The Unicode Consortium}",
  title =        "The {Unicode Standard}, Version 4.0",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xxxviii + 1462",
  year =         "2003",
  ISBN =         "0-321-18578-1",
  ISBN-13 =      "978-0-321-18578-5",
  LCCN =         "QA268 .U545 2004",
  bibdate =      "Tue Oct 21 17:47:30 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Includes CD-ROM.",
  URL =          "http://www.unicode.org/versions/Unicode4.0.0/",
  abstract =     "\booktitle{The Unicode Standard} provides a unique
                 code number for every character in electronic text, no
                 matter what the platform, no matter what the
                 application, no matter what the language. It is
                 required for XML and is at the core of modern software
                 products. Unicode 4.0 contains 96,248 characters
                 covering languages of the world. \booktitle{The Unicode
                 Standard} contains extensive descriptions of each
                 writing system, as well as definitions of character
                 properties and detailed conformance requirements. It is
                 the complete and definitive user's guide for novices
                 and experts alike. This edition, \booktitle{The Unicode
                 Standard}, Version 4.0, adds 47,188 new characters for
                 minority and historic scripts, several sets of symbols,
                 and a very large collection of additional CJK [Chinese
                 Japanese Korean] ideographs. It provides updated
                 specifications covering structure, conformance,
                 character behavior and semantics, as well as
                 implementation guidelines, detailed discussions of
                 writing systems, comprehensive charts, and an extensive
                 glossary. The accompanying CD-ROM includes the text of
                 all the Unicode Standard Annexes and the entire Unicode
                 Character Database.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Unicode Consortium Members and Directors \\
                 1: Introduction \\
                 2: General Structure \\
                 3: Conformance \\
                 4: Character Properties \\
                 5: Implementation Guidelines \\
                 6: Writing Systems and Punctuation \\
                 7: European Alphabetic Scripts \\
                 8: Middle Eastern Scripts \\
                 9: South Asian Scripts \\
                 10: Southeast Asian Scripts \\
                 11: East Asian Scripts \\
                 12: Additional Modern Scripts \\
                 13: Archaic Scripts \\
                 14: Symbols \\
                 15: Special Areas and Format Characters \\
                 16: Code Charts \\
                 17: Han Radical-Stroke Index \\
                 A: Han Unification History \\
                 B: Abstracts of Unicode Technical Reports \\
                 C: Relationship to ISO/IEC 10646 \\
                 D: Changes from Unicode Version 3.0",
}


bibtype: book
filename: master.bib
label: Unicode:2006:USV
author: The Unicode Consortium
title: The Unicode Standard, Version 5.0
publisher: pub-AW
address: pub-AW:adr
pages: l + 1417
year: 2006
ISBN: 0-321-48091-0 (hardcover) OR 0321480910 (hardcover)
ISBN13: 978-0-321-48091-0 (hardcover) OR 9780321480910 (hardcover)
LCCN: QA268 .U545 2007
bibdate: Thu Nov 30 18:54:46 2006
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2006.11.30 18:54:46 ???
note: Includes CD-ROM.
subject: Unicode (Computer character set)
acknowledgement: ack-nhfb
rawauthor: {The Unicode Consortium}
rawnote: Includes CD-ROM.
rawtitle: The {Unicode Standard}, Version 5.0
URL:
http://www.loc.gov/catdir/toc/ecip0617/2006023526.html; http://www.unicode.org/versions/beta.html; http://www.unicode.org/versions/Unicode5.0.0/

abstract:
Not yet published, but a beta version is available. The Web site says ``The Unicode Standard Version 5.0 is planned for release in book form in the third quarter of 2006, and supersedes all previous versions of the Standard.''

TOC:
 Acknowledgments Unicode Consortium Members Unicode Consortium Liaison Members Unicode Consortium Board of Directors Figures Tables Preface Chapter 1: Introduction 1.1 Coverage 1.2 Design Goals 1.3 Text Handling Chapter 2: General Structure 2.1 Architectural Context 2.2 Unicode Design Principles 2.3 Compatibility Characters 2.4 Code Points and Characters 2.5 Encoding Forms 2.6 Encoding Schemes 2.7 Unicode Strings 2.8 Unicode Allocation 2.9 Details of Allocation 2.10 Writing Direction 2.11 Combining Characters 2.12 Equivalent Sequences and Normalization 2.13 Special Characters and Noncharacters 2.14 Conforming to the Unicode Standard Chapter 3: Conformance 3.1 Versions of the Unicode Standard 3.2 Conformance Requirements 3.3 Semantics 3.4 Characters and Encoding 3.5 Properties 3.6 Combination 3.7 Decomposition 3.8 Surrogates 3.9 Unicode Encoding Forms 3.10 Unicode Encoding Schemes 3.11 Canonical Ordering Behavior 3.12 Conjoining Jamo Behavior 3.13 Default Case Algorithms Chapter 4: Character Properties 4.1 Unicode Character Database 4.2 Case; Normative 4.3 Combining Classes; Normative 4.4 Directionality; Normative 4.5 General Category; Normative 4.6 Numeric Value; Normative 4.7 Bidi Mirrored; Normative 4.8 Name; Normative 4.9 Unicode 1.0 Names 4.10 Letters, Alphabetic, and Ideographic 4.11 Properties Related to Text Boundaries 4.12 Characters with Unusual Properties Chapter 5: Implementation Guidelines 5.1 Transcoding to Other Standards 5.2 Programming Languages and Data Types 5.3 Unknown and Missing Characters 5.4 Handling Surrogate Pairs in UTF-16 5.5 Handling Numbers 5.6 Normalization 5.7 Compression 5.8 Newline Guidelines 5.9 Regular Expressions 5.10 Language Information in Plain Text 5.11 Editing and Selection 5.12 Strategies for Handling Nonspacing Marks 5.13 Rendering Nonspacing Marks 5.14 Locating Text Element Boundaries 5.15 Identifiers 5.16 Sorting and Searching 5.17 Binary Order 5.18 Case Mappings 5.19 Unicode Security 5.20 Default Ignorable Code Points Chapter 6: Writing Systems and Punctuation 6.1 Writing Systems 6.2 General Punctuation Chapter 7: European Alphabetic Scripts 7.1 Latin 7.2 Greek 7.3 Coptic 7.4 Cyrillic 7.5 Glagolitic 7.6 Armenian 7.7 Georgian 7.8 Modifier Letters 7.9 Combining Marks Chapter 8: Middle Eastern Scripts 8.1 Hebrew 8.2 Arabic 8.3 Syriac 8.4 Thaana Chapter 9: South Asian Scripts-I 9.1 Devanagari 9.2 Bengali 9.3 Gurmukhi 9.4 Gujarati 9.5 Oriya 9.6 Tamil 9.7 Telugu 9.8 Kannada 9.9 Malayalam Chapter 10: South Asian Scripts-II 10.1 Sinhala 10.2 Tibetan 10.3 Phags-pa 10.4 Limbu 10.5 Syloti Nagri 10.6 Kharoshthi Chapter 11: Southeast Asian Scripts 11.1 Thai 11.2 Lao 11.3 Myanmar 11.4 Khmer 11.5 Tai Le 11.6 New Tai Lue 11.7 Philippine Scripts 11.8 Buginese 11.9 Balinese Chapter 12: East Asian Scripts 12.1 Han 12.2 Ideographic Description Characters 12.3 Bopomofo 12.4 Hiragana and Katakana 12.5 Halfwidth and Fullwidth Forms 12.6 Hangul 12.7 Yi Chapter 13: Additional Modern Scripts 13.1 Ethiopic 13.2 Mongolian 13.3 Osmanya 13.4 Tifinagh 13.5 N'Ko 13.6 Cherokee 13.7 Canadian Aboriginal Syllabics 13.8 Deseret 13.9 Shavian Chapter 14: Archaic Scripts 14.1 Ogham 14.2 Old Italic 14.3 Runic 14.4 Gothic 14.5 Linear B 14.6 Cypriot Syllabary 14.7 Phoenician 14.8 Ugaritic 14.9 Old Persian 14.10 Sumero-Akkadian Chapter 15: Symbols 15.1 Currency Symbols 15.2 Letterlike Symbols 15.3 Number Forms 15.4 Mathematical Symbols 15.5 Invisible Mathematical Operators 15.6 Technical Symbols 15.7 Geometrical Symbols 15.8 Miscellaneous Symbols and Dingbats 15.9 Enclosed and Square 15.10 Braille 15.11 Western Musical Symbols 15.12 Byzantine Musical Symbols 15.13 Ancient Greek Musical Notation Chapter 16: Special Areas and Format Characters 16.1 Control Codes 16.2 Layout Controls 16.3 Deprecated Format Characters 16.4 Variation Selectors 16.5 Private-Use Characters 16.6 Surrogates Area 16.7 Noncharacters 16.8 Specials 16.9 Tag Characters Chapter 17: Code Charts 17.1 Character Names List 17.2 CJK Unified Ideographs 17.3 Hangul Syllables Chapter 18: Han Radical-Stroke Index Appendix A: Notational Conventions Appendix B: Unicode Publications and Resources B.1 The Unicode Consortium B.2 Unicode Publications B.3 Unicode Technical Standards B.4 Unicode Technical Reports B.5 Unicode Technical Notes B.6 Other Unicode Online Resources Appendix C: Relationship to ISO/IEC 10646 C.1 History C.2 Encoding Forms in ISO/IEC 10646 C.3 UCS Transformation Formats C.4 Synchronization of the Standards C.5 Identification of Features for the Unicode Standard C.6 Character Names C.7 Character Functional Specifications Appendix D: Changes from Previous Versions D.1 Improvements to the Standard D.2 Versions of the Unicode Standard D.3 Clause and Definition Numbering Changes D.4 Changes from Version 4.1 to Version 5.0 D.5 Changes from Version 4.0 to Version 4.1 D.6 Changes from Unicode Version 3.2 to Version 4.0 D.7 Changes from Unicode Version 3.1 to Version 3.2 D.8 Changes from Unicode Version 3.0 to Version 3.1 Appendix E: Han Unification History E.1 Development of the URO E.2 Ideographic Rapporteur Group Appendix F: Unicode Encoding Stability Policies F.1 Encoding Stability Policies for the Unicode Standard Appendix G: Glossary Appendix R: References R.1 Source Standards and Specifications R.2 Source Dictionaries for Han Unification R.3 Other Sources for the Unicode Standard R.4 Selected Resources: Technical R.5 Selected Resources: Scripts and Languages Appendix I: Indices I.1 Unicode Names Index I.2 General Index Appendix X: Annexes UAX 9: The Bidirectional Algorithm UAX 11: East Asian Width UAX 14: Line Breaking Properties UAX 15: Unicode Normalization Forms UAX 24: Script Names UAX 29: Text Boundaries UAX 31: Identifier and Pattern Syntax UAX 34: Unicode Named Character Sequences UAX 41: Common References for Unicode Standard Annexes

rawabstract:
Not yet published, but a beta version is available. The Web site says ``The Unicode Standard Version 5.0 is planned for release in book form in the third quarter of 2006, and supersedes all previous versions of the Standard.''

rawTOC:
\\ Acknowledgments \\ Unicode Consortium Members \\ Unicode Consortium Liaison Members \\ Unicode Consortium Board of Directors \\ Figures \\ Tables \\ Preface \\ Chapter 1: Introduction \\ 1.1 Coverage \\ 1.2 Design Goals \\ 1.3 Text Handling \\ Chapter 2: General Structure \\ 2.1 Architectural Context \\ 2.2 Unicode Design Principles \\ 2.3 Compatibility Characters \\ 2.4 Code Points and Characters \\ 2.5 Encoding Forms \\ 2.6 Encoding Schemes \\ 2.7 Unicode Strings \\ 2.8 Unicode Allocation \\ 2.9 Details of Allocation \\ 2.10 Writing Direction \\ 2.11 Combining Characters \\ 2.12 Equivalent Sequences and Normalization \\ 2.13 Special Characters and Noncharacters \\ 2.14 Conforming to the Unicode Standard \\ Chapter 3: Conformance \\ 3.1 Versions of the Unicode Standard \\ 3.2 Conformance Requirements \\ 3.3 Semantics \\ 3.4 Characters and Encoding \\ 3.5 Properties \\ 3.6 Combination \\ 3.7 Decomposition \\ 3.8 Surrogates \\ 3.9 Unicode Encoding Forms \\ 3.10 Unicode Encoding Schemes \\ 3.11 Canonical Ordering Behavior \\ 3.12 Conjoining Jamo Behavior \\ 3.13 Default Case Algorithms \\ Chapter 4: Character Properties \\ 4.1 Unicode Character Database \\ 4.2 Case; Normative \\ 4.3 Combining Classes; Normative \\ 4.4 Directionality; Normative \\ 4.5 General Category; Normative \\ 4.6 Numeric Value; Normative \\ 4.7 Bidi Mirrored; Normative \\ 4.8 Name; Normative \\ 4.9 Unicode 1.0 Names \\ 4.10 Letters, Alphabetic, and Ideographic \\ 4.11 Properties Related to Text Boundaries \\ 4.12 Characters with Unusual Properties \\ Chapter 5: Implementation Guidelines \\ 5.1 Transcoding to Other Standards \\ 5.2 Programming Languages and Data Types \\ 5.3 Unknown and Missing Characters \\ 5.4 Handling Surrogate Pairs in UTF-16 \\ 5.5 Handling Numbers \\ 5.6 Normalization \\ 5.7 Compression \\ 5.8 Newline Guidelines \\ 5.9 Regular Expressions \\ 5.10 Language Information in Plain Text \\ 5.11 Editing and Selection \\ 5.12 Strategies for Handling Nonspacing Marks \\ 5.13 Rendering Nonspacing Marks \\ 5.14 Locating Text Element Boundaries \\ 5.15 Identifiers \\ 5.16 Sorting and Searching \\ 5.17 Binary Order \\ 5.18 Case Mappings \\ 5.19 Unicode Security \\ 5.20 Default Ignorable Code Points \\ Chapter 6: Writing Systems and Punctuation \\ 6.1 Writing Systems \\ 6.2 General Punctuation \\ Chapter 7: European Alphabetic Scripts \\ 7.1 Latin \\ 7.2 Greek \\ 7.3 Coptic \\ 7.4 Cyrillic \\ 7.5 Glagolitic \\ 7.6 Armenian \\ 7.7 Georgian \\ 7.8 Modifier Letters \\ 7.9 Combining Marks \\ Chapter 8: Middle Eastern Scripts \\ 8.1 Hebrew \\ 8.2 Arabic \\ 8.3 Syriac \\ 8.4 Thaana \\ Chapter 9: South Asian Scripts-I \\ 9.1 Devanagari \\ 9.2 Bengali \\ 9.3 Gurmukhi \\ 9.4 Gujarati \\ 9.5 Oriya \\ 9.6 Tamil \\ 9.7 Telugu \\ 9.8 Kannada \\ 9.9 Malayalam \\ Chapter 10: South Asian Scripts-II \\ 10.1 Sinhala \\ 10.2 Tibetan \\ 10.3 Phags-pa \\ 10.4 Limbu \\ 10.5 Syloti Nagri \\ 10.6 Kharoshthi \\ Chapter 11: Southeast Asian Scripts \\ 11.1 Thai \\ 11.2 Lao \\ 11.3 Myanmar \\ 11.4 Khmer \\ 11.5 Tai Le \\ 11.6 New Tai Lue \\ 11.7 Philippine Scripts \\ 11.8 Buginese \\ 11.9 Balinese \\ Chapter 12: East Asian Scripts \\ 12.1 Han \\ 12.2 Ideographic Description Characters \\ 12.3 Bopomofo \\ 12.4 Hiragana and Katakana \\ 12.5 Halfwidth and Fullwidth Forms \\ 12.6 Hangul \\ 12.7 Yi \\ Chapter 13: Additional Modern Scripts \\ 13.1 Ethiopic \\ 13.2 Mongolian \\ 13.3 Osmanya \\ 13.4 Tifinagh \\ 13.5 N'Ko \\ 13.6 Cherokee \\ 13.7 Canadian Aboriginal Syllabics \\ 13.8 Deseret \\ 13.9 Shavian \\ Chapter 14: Archaic Scripts \\ 14.1 Ogham \\ 14.2 Old Italic \\ 14.3 Runic \\ 14.4 Gothic \\ 14.5 Linear B \\ 14.6 Cypriot Syllabary \\ 14.7 Phoenician \\ 14.8 Ugaritic \\ 14.9 Old Persian \\ 14.10 Sumero-Akkadian \\ Chapter 15: Symbols \\ 15.1 Currency Symbols \\ 15.2 Letterlike Symbols \\ 15.3 Number Forms \\ 15.4 Mathematical Symbols \\ 15.5 Invisible Mathematical Operators \\ 15.6 Technical Symbols \\ 15.7 Geometrical Symbols \\ 15.8 Miscellaneous Symbols and Dingbats \\ 15.9 Enclosed and Square \\ 15.10 Braille \\ 15.11 Western Musical Symbols \\ 15.12 Byzantine Musical Symbols \\ 15.13 Ancient Greek Musical Notation \\ Chapter 16: Special Areas and Format Characters \\ 16.1 Control Codes \\ 16.2 Layout Controls \\ 16.3 Deprecated Format Characters \\ 16.4 Variation Selectors \\ 16.5 Private-Use Characters \\ 16.6 Surrogates Area \\ 16.7 Noncharacters \\ 16.8 Specials \\ 16.9 Tag Characters \\ Chapter 17: Code Charts \\ 17.1 Character Names List \\ 17.2 CJK Unified Ideographs \\ 17.3 Hangul Syllables \\ Chapter 18: Han Radical-Stroke Index \\ Appendix A: Notational Conventions \\ Appendix B: Unicode Publications and Resources \\ B.1 The Unicode Consortium \\ B.2 Unicode Publications \\ B.3 Unicode Technical Standards \\ B.4 Unicode Technical Reports \\ B.5 Unicode Technical Notes \\ B.6 Other Unicode Online Resources \\ Appendix C: Relationship to ISO/IEC 10646 \\ C.1 History \\ C.2 Encoding Forms in ISO/IEC 10646 \\ C.3 UCS Transformation Formats \\ C.4 Synchronization of the Standards \\ C.5 Identification of Features for the Unicode Standard \\ C.6 Character Names \\ C.7 Character Functional Specifications \\ Appendix D: Changes from Previous Versions \\ D.1 Improvements to the Standard \\ D.2 Versions of the Unicode Standard \\ D.3 Clause and Definition Numbering Changes \\ D.4 Changes from Version 4.1 to Version 5.0 \\ D.5 Changes from Version 4.0 to Version 4.1 \\ D.6 Changes from Unicode Version 3.2 to Version 4.0 \\ D.7 Changes from Unicode Version 3.1 to Version 3.2 \\ D.8 Changes from Unicode Version 3.0 to Version 3.1 \\ Appendix E: Han Unification History \\ E.1 Development of the URO \\ E.2 Ideographic Rapporteur Group \\ Appendix F: Unicode Encoding Stability Policies \\ F.1 Encoding Stability Policies for the Unicode Standard \\ Appendix G: Glossary \\ Appendix R: References \\ R.1 Source Standards and Specifications \\ R.2 Source Dictionaries for Han Unification \\ R.3 Other Sources for the Unicode Standard \\ R.4 Selected Resources: Technical \\ R.5 Selected Resources: Scripts and Languages \\ Appendix I: Indices \\ I.1 Unicode Names Index \\ I.2 General Index \\ Appendix X: Annexes \\ UAX 9: The Bidirectional Algorithm \\ UAX 11: East Asian Width \\ UAX 14: Line Breaking Properties \\ UAX 15: Unicode Normalization Forms \\ UAX 24: Script Names \\ UAX 29: Text Boundaries \\ UAX 31: Identifier and Pattern Syntax \\ UAX 34: Unicode Named Character Sequences \\ UAX 41: Common References for Unicode Standard Annexes

entry:
@Book{Unicode:2006:USV,
  author =       "{The Unicode Consortium}",
  title =        "The {Unicode Standard}, Version 5.0",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "l + 1417",
  year =         "2006",
  ISBN =         "0-321-48091-0 (hardcover)",
  ISBN-13 =      "978-0-321-48091-0 (hardcover)",
  LCCN =         "QA268 .U545 2007",
  bibdate =      "Thu Nov 30 18:54:46 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Includes CD-ROM.",
  URL =          "http://www.loc.gov/catdir/toc/ecip0617/2006023526.html;
                 http://www.unicode.org/versions/beta.html;
                 http://www.unicode.org/versions/Unicode5.0.0/",
  abstract =     "Not yet published, but a beta version is available.
                 The Web site says ``The Unicode Standard Version 5.0 is
                 planned for release in book form in the third quarter
                 of 2006, and supersedes all previous versions of the
                 Standard.''",
  acknowledgement = ack-nhfb,
  subject =      "Unicode (Computer character set)",
  tableofcontents = "\\
                 Acknowledgments \\
                 Unicode Consortium Members \\
                 Unicode Consortium Liaison Members \\
                 Unicode Consortium Board of Directors \\
                 Figures \\
                 Tables \\
                 Preface \\
                 Chapter 1: Introduction \\
                 1.1 Coverage \\
                 1.2 Design Goals \\
                 1.3 Text Handling \\
                 Chapter 2: General Structure \\
                 2.1 Architectural Context \\
                 2.2 Unicode Design Principles \\
                 2.3 Compatibility Characters \\
                 2.4 Code Points and Characters \\
                 2.5 Encoding Forms \\
                 2.6 Encoding Schemes \\
                 2.7 Unicode Strings \\
                 2.8 Unicode Allocation \\
                 2.9 Details of Allocation \\
                 2.10 Writing Direction \\
                 2.11 Combining Characters \\
                 2.12 Equivalent Sequences and Normalization \\
                 2.13 Special Characters and Noncharacters \\
                 2.14 Conforming to the Unicode Standard \\
                 Chapter 3: Conformance \\
                 3.1 Versions of the Unicode Standard \\
                 3.2 Conformance Requirements \\
                 3.3 Semantics \\
                 3.4 Characters and Encoding \\
                 3.5 Properties \\
                 3.6 Combination \\
                 3.7 Decomposition \\
                 3.8 Surrogates \\
                 3.9 Unicode Encoding Forms \\
                 3.10 Unicode Encoding Schemes \\
                 3.11 Canonical Ordering Behavior \\
                 3.12 Conjoining Jamo Behavior \\
                 3.13 Default Case Algorithms \\
                 Chapter 4: Character Properties \\
                 4.1 Unicode Character Database \\
                 4.2 Case; Normative \\
                 4.3 Combining Classes; Normative \\
                 4.4 Directionality; Normative \\
                 4.5 General Category; Normative \\
                 4.6 Numeric Value; Normative \\
                 4.7 Bidi Mirrored; Normative \\
                 4.8 Name; Normative \\
                 4.9 Unicode 1.0 Names \\
                 4.10 Letters, Alphabetic, and Ideographic \\
                 4.11 Properties Related to Text Boundaries \\
                 4.12 Characters with Unusual Properties \\
                 Chapter 5: Implementation Guidelines \\
                 5.1 Transcoding to Other Standards \\
                 5.2 Programming Languages and Data Types \\
                 5.3 Unknown and Missing Characters \\
                 5.4 Handling Surrogate Pairs in UTF-16 \\
                 5.5 Handling Numbers \\
                 5.6 Normalization \\
                 5.7 Compression \\
                 5.8 Newline Guidelines \\
                 5.9 Regular Expressions \\
                 5.10 Language Information in Plain Text \\
                 5.11 Editing and Selection \\
                 5.12 Strategies for Handling Nonspacing Marks \\
                 5.13 Rendering Nonspacing Marks \\
                 5.14 Locating Text Element Boundaries \\
                 5.15 Identifiers \\
                 5.16 Sorting and Searching \\
                 5.17 Binary Order \\
                 5.18 Case Mappings \\
                 5.19 Unicode Security \\
                 5.20 Default Ignorable Code Points \\
                 Chapter 6: Writing Systems and Punctuation \\
                 6.1 Writing Systems \\
                 6.2 General Punctuation \\
                 Chapter 7: European Alphabetic Scripts \\
                 7.1 Latin \\
                 7.2 Greek \\
                 7.3 Coptic \\
                 7.4 Cyrillic \\
                 7.5 Glagolitic \\
                 7.6 Armenian \\
                 7.7 Georgian \\
                 7.8 Modifier Letters \\
                 7.9 Combining Marks \\
                 Chapter 8: Middle Eastern Scripts \\
                 8.1 Hebrew \\
                 8.2 Arabic \\
                 8.3 Syriac \\
                 8.4 Thaana \\
                 Chapter 9: South Asian Scripts-I \\
                 9.1 Devanagari \\
                 9.2 Bengali \\
                 9.3 Gurmukhi \\
                 9.4 Gujarati \\
                 9.5 Oriya \\
                 9.6 Tamil \\
                 9.7 Telugu \\
                 9.8 Kannada \\
                 9.9 Malayalam \\
                 Chapter 10: South Asian Scripts-II \\
                 10.1 Sinhala \\
                 10.2 Tibetan \\
                 10.3 Phags-pa \\
                 10.4 Limbu \\
                 10.5 Syloti Nagri \\
                 10.6 Kharoshthi \\
                 Chapter 11: Southeast Asian Scripts \\
                 11.1 Thai \\
                 11.2 Lao \\
                 11.3 Myanmar \\
                 11.4 Khmer \\
                 11.5 Tai Le \\
                 11.6 New Tai Lue \\
                 11.7 Philippine Scripts \\
                 11.8 Buginese \\
                 11.9 Balinese \\
                 Chapter 12: East Asian Scripts \\
                 12.1 Han \\
                 12.2 Ideographic Description Characters \\
                 12.3 Bopomofo \\
                 12.4 Hiragana and Katakana \\
                 12.5 Halfwidth and Fullwidth Forms \\
                 12.6 Hangul \\
                 12.7 Yi \\
                 Chapter 13: Additional Modern Scripts \\
                 13.1 Ethiopic \\
                 13.2 Mongolian \\
                 13.3 Osmanya \\
                 13.4 Tifinagh \\
                 13.5 N'Ko \\
                 13.6 Cherokee \\
                 13.7 Canadian Aboriginal Syllabics \\
                 13.8 Deseret \\
                 13.9 Shavian \\
                 Chapter 14: Archaic Scripts \\
                 14.1 Ogham \\
                 14.2 Old Italic \\
                 14.3 Runic \\
                 14.4 Gothic \\
                 14.5 Linear B \\
                 14.6 Cypriot Syllabary \\
                 14.7 Phoenician \\
                 14.8 Ugaritic \\
                 14.9 Old Persian \\
                 14.10 Sumero-Akkadian \\
                 Chapter 15: Symbols \\
                 15.1 Currency Symbols \\
                 15.2 Letterlike Symbols \\
                 15.3 Number Forms \\
                 15.4 Mathematical Symbols \\
                 15.5 Invisible Mathematical Operators \\
                 15.6 Technical Symbols \\
                 15.7 Geometrical Symbols \\
                 15.8 Miscellaneous Symbols and Dingbats \\
                 15.9 Enclosed and Square \\
                 15.10 Braille \\
                 15.11 Western Musical Symbols \\
                 15.12 Byzantine Musical Symbols \\
                 15.13 Ancient Greek Musical Notation \\
                 Chapter 16: Special Areas and Format Characters \\
                 16.1 Control Codes \\
                 16.2 Layout Controls \\
                 16.3 Deprecated Format Characters \\
                 16.4 Variation Selectors \\
                 16.5 Private-Use Characters \\
                 16.6 Surrogates Area \\
                 16.7 Noncharacters \\
                 16.8 Specials \\
                 16.9 Tag Characters \\
                 Chapter 17: Code Charts \\
                 17.1 Character Names List \\
                 17.2 CJK Unified Ideographs \\
                 17.3 Hangul Syllables \\
                 Chapter 18: Han Radical-Stroke Index \\
                 Appendix A: Notational Conventions \\
                 Appendix B: Unicode Publications and Resources \\
                 B.1 The Unicode Consortium \\
                 B.2 Unicode Publications \\
                 B.3 Unicode Technical Standards \\
                 B.4 Unicode Technical Reports \\
                 B.5 Unicode Technical Notes \\
                 B.6 Other Unicode Online Resources \\
                 Appendix C: Relationship to ISO/IEC 10646 \\
                 C.1 History \\
                 C.2 Encoding Forms in ISO/IEC 10646 \\
                 C.3 UCS Transformation Formats \\
                 C.4 Synchronization of the Standards \\
                 C.5 Identification of Features for the Unicode Standard
                 \\
                 C.6 Character Names \\
                 C.7 Character Functional Specifications \\
                 Appendix D: Changes from Previous Versions \\
                 D.1 Improvements to the Standard \\
                 D.2 Versions of the Unicode Standard \\
                 D.3 Clause and Definition Numbering Changes \\
                 D.4 Changes from Version 4.1 to Version 5.0 \\
                 D.5 Changes from Version 4.0 to Version 4.1 \\
                 D.6 Changes from Unicode Version 3.2 to Version 4.0 \\
                 D.7 Changes from Unicode Version 3.1 to Version 3.2 \\
                 D.8 Changes from Unicode Version 3.0 to Version 3.1 \\
                 Appendix E: Han Unification History \\
                 E.1 Development of the URO \\
                 E.2 Ideographic Rapporteur Group \\
                 Appendix F: Unicode Encoding Stability Policies \\
                 F.1 Encoding Stability Policies for the Unicode
                 Standard \\
                 Appendix G: Glossary \\
                 Appendix R: References \\
                 R.1 Source Standards and Specifications \\
                 R.2 Source Dictionaries for Han Unification \\
                 R.3 Other Sources for the Unicode Standard \\
                 R.4 Selected Resources: Technical \\
                 R.5 Selected Resources: Scripts and Languages \\
                 Appendix I: Indices \\
                 I.1 Unicode Names Index \\
                 I.2 General Index \\
                 Appendix X: Annexes \\
                 UAX 9: The Bidirectional Algorithm \\
                 UAX 11: East Asian Width \\
                 UAX 14: Line Breaking Properties \\
                 UAX 15: Unicode Normalization Forms \\
                 UAX 24: Script Names \\
                 UAX 29: Text Boundaries \\
                 UAX 31: Identifier and Pattern Syntax \\
                 UAX 34: Unicode Named Character Sequences \\
                 UAX 41: Common References for Unicode Standard
                 Annexes",
}


bibtype: book
filename: master.bib
label: Upstill:1990:RC
author: Steve Upstill
title: The RenderMan Companion
publisher: pub-AW
address: pub-AW:adr
pages: xix + 475
year: 1990
ISBN: 0-201-50868-0 OR 0201508680
ISBN13: 978-0-201-50868-0 OR 9780201508680
LCCN: T385 .U67 1990
bibdate: Wed Dec 15 10:58:57 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 10:58:57 ???
acknowledgement: ack-nhfb
rawauthor: Steve Upstill
rawtitle: The {RenderMan} Companion
TOC:
The Image-Rendering World Getting Started The Structure of a Render Man Program Primitive Surfaces I: Quadratic Surfaces Primitive Surfaces II: Polygons Primitive Surfaces III: Parametric Surfaces Geometric Transformations and Hierarchical Modeling Viewing I: The Digital Camera Viewing II: A Model of the Rendering Process Procedural Models and Level of Detail Lighting and Shading Surface Mapping The RenderMan Shading Language I: Introduction The RenderMan Shading Language II: Description The RenderMan Shading Language III: Tools A Gallery of Shaders Appendixes

rawTOC:
The Image-Rendering World \\ Getting Started \\ The Structure of a Render Man Program \\ Primitive Surfaces I: Quadratic Surfaces \\ Primitive Surfaces II: Polygons \\ Primitive Surfaces III: Parametric Surfaces \\ Geometric Transformations and Hierarchical Modeling \\ Viewing I: The Digital Camera \\ Viewing II: A Model of the Rendering Process \\ Procedural Models and Level of Detail \\ Lighting and Shading \\ Surface Mapping \\ The RenderMan Shading Language I: Introduction \\ The RenderMan Shading Language II: Description \\ The RenderMan Shading Language III: Tools \\ A Gallery of Shaders \\ Appendixes

entry:
@Book{Upstill:1990:RC,
  author =       "Steve Upstill",
  title =        "The {RenderMan} Companion",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xix + 475",
  year =         "1990",
  ISBN =         "0-201-50868-0",
  ISBN-13 =      "978-0-201-50868-0",
  LCCN =         "T385 .U67 1990",
  bibdate =      "Wed Dec 15 10:58:57 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "The Image-Rendering World \\
                 Getting Started \\
                 The Structure of a Render Man Program \\
                 Primitive Surfaces I: Quadratic Surfaces \\
                 Primitive Surfaces II: Polygons \\
                 Primitive Surfaces III: Parametric Surfaces \\
                 Geometric Transformations and Hierarchical Modeling \\
                 Viewing I: The Digital Camera \\
                 Viewing II: A Model of the Rendering Process \\
                 Procedural Models and Level of Detail \\
                 Lighting and Shading \\
                 Surface Mapping \\
                 The RenderMan Shading Language I: Introduction \\
                 The RenderMan Shading Language II: Description \\
                 The RenderMan Shading Language III: Tools \\
                 A Gallery of Shaders \\
                 Appendixes",
}


bibtype: book
filename: master.bib
label: Urroz:2001:NSMa
author: Gilberto E. Urroz
title: Numerical and Statistical Methods with SCILAB for Science and Engineering
volume: 1
publisher: BookSurge Publishing
address: North Charleston, SC, USA
pages: xv + 563
year: 2001
ISBN: 1-58898-304-8 OR 1588983048
ISBN13: 978-1-58898-304-6 OR 9781588983046
LCCN: TA345 .U77 2001
bibdate: Sat Jun 13 10:49:17 MDT 2009
bibtimestamp: 2009.06.13 10:49:17 MDT
acknowledgement: ack-nhfb
rawauthor: Gilberto E. Urroz
rawtitle: Numerical and Statistical Methods with {SCILAB} for Science and Engineering
bibsource:
https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/numana2000.bib; z3950.bibsys.no:2100/BIBSYS

entry:
@Book{Urroz:2001:NSMa,
  author =       "Gilberto E. Urroz",
  title =        "Numerical and Statistical Methods with {SCILAB} for
                 Science and Engineering",
  volume =       "1",
  publisher =    "BookSurge Publishing",
  address =      "North Charleston, SC, USA",
  pages =        "xv + 563",
  year =         "2001",
  ISBN =         "1-58898-304-8",
  ISBN-13 =      "978-1-58898-304-6",
  LCCN =         "TA345 .U77 2001",
  bibdate =      "Sat Jun 13 10:49:17 MDT 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/numana2000.bib;
                 z3950.bibsys.no:2100/BIBSYS",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
}


bibtype: book
filename: master.bib
label: Urroz:2001:NSMb
author: Gilberto E. Urroz
title: Numerical and statistical methods with SCILAB for science and engineering
volume: 2
publisher: Greatunpublished.com
address: Charleston, SC, USA
pages: xv + 486
year: 2001
ISBN: 1-58898-305-6 OR 1588983056
ISBN13: 978-1-58898-305-3 OR 9781588983053
LCCN: TA345 .U77 2001
bibdate: Wed Jan 9 14:11:42 MST 2019
bibtimestamp: 2019.01.09 14:11:42 MST
acknowledgement: ack-nhfb
rawauthor: Gilberto E. Urroz
rawtitle: Numerical and statistical methods with {SCILAB} for science and engineering
bibsource:
fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/numana2000.bib

entry:
@Book{Urroz:2001:NSMb,
  author =       "Gilberto E. Urroz",
  title =        "Numerical and statistical methods with {SCILAB} for
                 science and engineering",
  volume =       "2",
  publisher =    "Greatunpublished.com",
  address =      "Charleston, SC, USA",
  pages =        "xv + 486",
  year =         "2001",
  ISBN =         "1-58898-305-6",
  ISBN-13 =      "978-1-58898-305-3",
  LCCN =         "TA345 .U77 2001",
  bibdate =      "Wed Jan 9 14:11:42 MST 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/numana2000.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
}


bibtype: book
filename: master.bib
label: Vahalia:1996:UI
author: Uresh Vahalia
title: UNIX Internals
publisher: pub-PH
address: pub-PH:adr
pages: xxxiii + 601
year: 1996
ISBN: 0-13-101908-2 OR 0131019082
ISBN13: 978-0-13-101908-9 OR 9780131019089
LCCN: QA76.76.063V33 1996
MRclass: 68N25, 68-01
bibdate: Mon Sep 23 08:50:16 1996
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 1996.09.23 08:50:16 ???
acknowledgement: ack-nhfb
rawauthor: Uresh Vahalia
rawtitle: {UNIX} Internals
TOC:
1: Introduction Introduction The Mandate For Change Looking Back, Looking Forward The Scope of This Book References 2: The Process and the Kernel Introduction Mode, Space, and Context The Process Abstraction Executing In Kernel Mode Synchronization Process Scheduling Signals New Processes and Programs Summary Exercises References 3: Threads and Lightweight Processes Introduction Fundamental Abstractions Lightweight Process Design-Issues To Consider User-Lever Threads Libraries Scheduler Activations Multithreading in Solaris and SVR4 Threads In MACH Digital UNIX MACH 3.0 Continuations Summary Exercises References 4: Signals and Session Management Introduction Signal Generation and Handling Unreliable Signals Reliable Signals Signals in SVR4 Signals Implementation Exceptions MACH Exception Handling Process Groups and Terminal Management The SVR4 Sessions Architecture Summary Exercises References 5: Process Scheduling Introduction Clock Interrupt Handling Scheduler Goals Traditional UNIX Scheduling The SVR4 Scheduler SOLARIS 2.X Scheduling Enhancements Scheduling in MACH The Digital UNIX Real-Time Scheduler Other Scheduling Implementations Summary Exercises References 6: Interprocess Communications Introduction Universal IPC Facilities System V IPC Mach IPC Messages Ports Message Passing Port Operations Extensibility MACH 3.0 Enhancements Discussion Summary Exercises References 7: Synchronization and Multiprocessing Introduction Synchronization in Traditional UNIX Kernels Multiprocessor Systems Multiprocessor Synchronization Issues Semaphores Spin Locks Condition Variables Read-Write Locks Reference Counts Other Considerations Case Studies Summary Exercises References 8: File System Interface and Framework Introduction The User Interface to Files File Systems Special Files File System Framework The Vnode /VFS Architecture Implementation Overview File-System-Dependent Objects Mounting a File System Operations on Files Analysis Summary Exercises References 9: File System Implementations Introduction The System V File System (s5fs) S5fs Kernel Organization Analysis of S5fs The Berkeley Fast File System Hard Disk Structure On-Disk Organization FFS Functionality Enhancements Analysis Temporary File Systems Special-Purpose File Systems The Old Buffer Cache Summary Exercises References 10: Distributed File Systems Introduction General Characteristics of Distributed File Systems Network File System (NFS) The Protocol Suite NFS Implementation UNIX Semantics NFS Performance Dedicated NFS Servers NFS Security NFS Version 3 Remote File Sharing (RFS) RFS Architecture RFS Implementation Client-Side Caching The Andrew File System AFS Implementation AFS Shortcomings The DCE Distributed File System (DCE DFS) Summary Exercises References 11: Advanced File Systems Introduction Limitations of Traditional File Systems File System Clustering (Sun-FFS) The Journaling Approach Log-Structured File Systems The 4.4BSD Log-Structured File System Metadata Logging The Episode File System Watchdogs The 4.4BSD Portal File System Stackable File System Layers The 4.4BSD File System Interface Summary Exercises References 12: Kernel Memory Allocation Introduction Functional Requirements Resource Map Allocator Simple Power-of-Two Free Lists The McKusick-Karels Allocator The Buddy System The SVR4 Lazy Buddy Algorithm The MACH-OSF /1 Zone Allocator A Hierarchical Allocator for Multiprocessors The Solaris 2.4 Slab Allocator Summary Exercises References 13: Virtual Memory Introduction Demand Paging Hardware Requirements 4: 3BSD A Case Study 4: 3BSD Memory Management Operations Analysis Exercises References 14: The SVR4 VM Architecture Motivation Memory-Mapped Files VM Design Principles Fundamental Abstractions Segment Drivers The Swap Layer VM Operations Interaction with the Vnode Subsystem Virtual Swap Space in Solaris Analysis Performance Improvements Summary Exercises References 15: More Memory Management Topics Introduction MACH Memory Management Design Memory Sharing Facilities Memory Objects and Pagers External and Internal Pagers Page Replacement Analysis Memory Management in 4.4BSD Translation Lookaside Buffer (TLB) Consistency TLB Shootdown in MACH TLB Consistency in SVR4 and SVR4.2 UNIX Other TLB Consistency Algorithms Virtually Addressed Caches Exercises References 16: Device Drivers and I /O Introduction Overview Device Driver Framework The I /O Subsystem The poll System Call Block I /O The DDI /DKI Specification Newer SVR4 Releases Future Directions Summary Exercises References 17: Streams Motivation Overview Messages and Queues Stream I /O Configuration and Setup STREAMS ioctls Memory Allocation Multiplexing FIFOs and Pipes Networking Interfaces Summary Exercises References

rawTOC:
1: Introduction \\ Introduction \\ The Mandate For Change \\ Looking Back, Looking Forward \\ The Scope of This Book \\ References \\ 2: The Process and the Kernel \\ Introduction \\ Mode, Space, and Context \\ The Process Abstraction \\ Executing In Kernel Mode \\ Synchronization \\ Process Scheduling \\ Signals \\ New Processes and Programs \\ Summary \\ Exercises \\ References \\ 3: Threads and Lightweight Processes \\ Introduction \\ Fundamental Abstractions \\ Lightweight Process Design-Issues To Consider \\ User-Lever Threads Libraries \\ Scheduler Activations \\ Multithreading in Solaris and SVR4 \\ Threads In MACH \\ Digital UNIX \\ MACH 3.0 Continuations \\ Summary \\ Exercises \\ References \\ 4: Signals and Session Management \\ Introduction \\ Signal Generation and Handling \\ Unreliable Signals \\ Reliable Signals \\ Signals in SVR4 \\ Signals Implementation \\ Exceptions \\ MACH Exception Handling \\ Process Groups and Terminal Management \\ The SVR4 Sessions Architecture \\ Summary \\ Exercises \\ References \\ 5: Process Scheduling \\ Introduction \\ Clock Interrupt Handling \\ Scheduler Goals \\ Traditional UNIX Scheduling \\ The SVR4 Scheduler \\ SOLARIS 2.X Scheduling Enhancements \\ Scheduling in MACH \\ The Digital UNIX Real-Time Scheduler \\ Other Scheduling Implementations \\ Summary \\ Exercises \\ References \\ 6: Interprocess Communications \\ Introduction \\ Universal IPC Facilities \\ System V IPC \\ Mach IPC \\ Messages \\ Ports \\ Message Passing \\ Port Operations \\ Extensibility \\ MACH 3.0 Enhancements \\ Discussion \\ Summary \\ Exercises \\ References \\ 7: Synchronization and Multiprocessing \\ Introduction \\ Synchronization in Traditional UNIX Kernels \\ Multiprocessor Systems \\ Multiprocessor Synchronization Issues \\ Semaphores \\ Spin Locks \\ Condition Variables \\ Read-Write Locks \\ Reference Counts \\ Other Considerations \\ Case Studies \\ Summary \\ Exercises \\ References \\ 8: File System Interface and Framework \\ Introduction \\ The User Interface to Files \\ File Systems \\ Special Files \\ File System Framework \\ The Vnode /VFS Architecture \\ Implementation Overview \\ File-System-Dependent Objects \\ Mounting a File System \\ Operations on Files \\ Analysis \\ Summary \\ Exercises \\ References \\ 9: File System Implementations \\ Introduction \\ The System V File System (s5fs) \\ S5fs Kernel Organization \\ Analysis of S5fs \\ The Berkeley Fast File System \\ Hard Disk Structure \\ On-Disk Organization \\ FFS Functionality Enhancements \\ Analysis \\ Temporary File Systems \\ Special-Purpose File Systems \\ The Old Buffer Cache \\ Summary \\ Exercises \\ References \\ 10: Distributed File Systems \\ Introduction \\ General Characteristics of Distributed File Systems \\ Network File System (NFS) \\ The Protocol Suite \\ NFS Implementation \\ UNIX Semantics \\ NFS Performance \\ Dedicated NFS Servers \\ NFS Security \\ NFS Version 3 \\ Remote File Sharing (RFS) \\ RFS Architecture \\ RFS Implementation \\ Client-Side Caching \\ The Andrew File System \\ AFS Implementation \\ AFS Shortcomings \\ The DCE Distributed File System (DCE DFS) \\ Summary \\ Exercises \\ References \\ 11: Advanced File Systems \\ Introduction \\ Limitations of Traditional File Systems \\ File System Clustering (Sun-FFS) \\ The Journaling Approach \\ Log-Structured File Systems \\ The 4.4BSD Log-Structured File System \\ Metadata Logging \\ The Episode File System \\ Watchdogs \\ The 4.4BSD Portal File System \\ Stackable File System Layers \\ The 4.4BSD File System Interface \\ Summary \\ Exercises \\ References \\ 12: Kernel Memory Allocation \\ Introduction \\ Functional Requirements \\ Resource Map Allocator \\ Simple Power-of-Two Free Lists \\ The McKusick-Karels Allocator \\ The Buddy System \\ The SVR4 Lazy Buddy Algorithm \\ The MACH-OSF /1 Zone Allocator \\ A Hierarchical Allocator for Multiprocessors \\ The Solaris 2.4 Slab Allocator \\ Summary \\ Exercises \\ References \\ 13: Virtual Memory \\ Introduction \\ Demand Paging \\ Hardware Requirements \\ 4: 3BSD \\ A Case Study \\ 4: 3BSD Memory Management Operations \\ Analysis \\ Exercises \\ References \\ 14: The SVR4 VM Architecture \\ Motivation \\ Memory-Mapped Files \\ VM Design Principles \\ Fundamental Abstractions \\ Segment Drivers \\ The Swap Layer \\ VM Operations \\ Interaction with the Vnode Subsystem \\ Virtual Swap Space in Solaris \\ Analysis \\ Performance Improvements \\ Summary \\ Exercises \\ References \\ 15: More Memory Management Topics \\ Introduction \\ MACH Memory Management Design \\ Memory Sharing Facilities \\ Memory Objects and Pagers \\ External and Internal Pagers \\ Page Replacement \\ Analysis \\ Memory Management in 4.4BSD \\ Translation Lookaside Buffer (TLB) Consistency \\ TLB Shootdown in MACH \\ TLB Consistency in SVR4 and SVR4.2 UNIX \\ Other TLB Consistency Algorithms \\ Virtually Addressed Caches \\ Exercises \\ References \\ 16: Device Drivers and I /O \\ Introduction \\ Overview \\ Device Driver Framework \\ The I /O Subsystem \\ The poll System Call \\ Block I /O \\ The DDI /DKI Specification \\ Newer SVR4 Releases \\ Future Directions \\ Summary \\ Exercises \\ References \\ 17: Streams \\ Motivation \\ Overview \\ Messages and Queues \\ Stream I /O \\ Configuration and Setup \\ STREAMS ioctls \\ Memory Allocation \\ Multiplexing \\ FIFOs and Pipes \\ Networking Interfaces \\ Summary \\ Exercises \\ References

entry:
@Book{Vahalia:1996:UI,
  author =       "Uresh Vahalia",
  title =        "{UNIX} Internals",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xxxiii + 601",
  year =         "1996",
  ISBN =         "0-13-101908-2",
  ISBN-13 =      "978-0-13-101908-9",
  LCCN =         "QA76.76.063V33 1996",
  MRclass =      "68N25, 68-01",
  bibdate =      "Mon Sep 23 08:50:16 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Introduction \\
                 Introduction \\
                 The Mandate For Change \\
                 Looking Back, Looking Forward \\
                 The Scope of This Book \\
                 References \\
                 2: The Process and the Kernel \\
                 Introduction \\
                 Mode, Space, and Context \\
                 The Process Abstraction \\
                 Executing In Kernel Mode \\
                 Synchronization \\
                 Process Scheduling \\
                 Signals \\
                 New Processes and Programs \\
                 Summary \\
                 Exercises \\
                 References \\
                 3: Threads and Lightweight Processes \\
                 Introduction \\
                 Fundamental Abstractions \\
                 Lightweight Process Design-Issues To Consider \\
                 User-Lever Threads Libraries \\
                 Scheduler Activations \\
                 Multithreading in Solaris and SVR4 \\
                 Threads In MACH \\
                 Digital UNIX \\
                 MACH 3.0 Continuations \\
                 Summary \\
                 Exercises \\
                 References \\
                 4: Signals and Session Management \\
                 Introduction \\
                 Signal Generation and Handling \\
                 Unreliable Signals \\
                 Reliable Signals \\
                 Signals in SVR4 \\
                 Signals Implementation \\
                 Exceptions \\
                 MACH Exception Handling \\
                 Process Groups and Terminal Management \\
                 The SVR4 Sessions Architecture \\
                 Summary \\
                 Exercises \\
                 References \\
                 5: Process Scheduling \\
                 Introduction \\
                 Clock Interrupt Handling \\
                 Scheduler Goals \\
                 Traditional UNIX Scheduling \\
                 The SVR4 Scheduler \\
                 SOLARIS 2.X Scheduling Enhancements \\
                 Scheduling in MACH \\
                 The Digital UNIX Real-Time Scheduler \\
                 Other Scheduling Implementations \\
                 Summary \\
                 Exercises \\
                 References \\
                 6: Interprocess Communications \\
                 Introduction \\
                 Universal IPC Facilities \\
                 System V IPC \\
                 Mach IPC \\
                 Messages \\
                 Ports \\
                 Message Passing \\
                 Port Operations \\
                 Extensibility \\
                 MACH 3.0 Enhancements \\
                 Discussion \\
                 Summary \\
                 Exercises \\
                 References \\
                 7: Synchronization and Multiprocessing \\
                 Introduction \\
                 Synchronization in Traditional UNIX Kernels \\
                 Multiprocessor Systems \\
                 Multiprocessor Synchronization Issues \\
                 Semaphores \\
                 Spin Locks \\
                 Condition Variables \\
                 Read-Write Locks \\
                 Reference Counts \\
                 Other Considerations \\
                 Case Studies \\
                 Summary \\
                 Exercises \\
                 References \\
                 8: File System Interface and Framework \\
                 Introduction \\
                 The User Interface to Files \\
                 File Systems \\
                 Special Files \\
                 File System Framework \\
                 The Vnode /VFS Architecture \\
                 Implementation Overview \\
                 File-System-Dependent Objects \\
                 Mounting a File System \\
                 Operations on Files \\
                 Analysis \\
                 Summary \\
                 Exercises \\
                 References \\
                 9: File System Implementations \\
                 Introduction \\
                 The System V File System (s5fs) \\
                 S5fs Kernel Organization \\
                 Analysis of S5fs \\
                 The Berkeley Fast File System \\
                 Hard Disk Structure \\
                 On-Disk Organization \\
                 FFS Functionality Enhancements \\
                 Analysis \\
                 Temporary File Systems \\
                 Special-Purpose File Systems \\
                 The Old Buffer Cache \\
                 Summary \\
                 Exercises \\
                 References \\
                 10: Distributed File Systems \\
                 Introduction \\
                 General Characteristics of Distributed File Systems \\
                 Network File System (NFS) \\
                 The Protocol Suite \\
                 NFS Implementation \\
                 UNIX Semantics \\
                 NFS Performance \\
                 Dedicated NFS Servers \\
                 NFS Security \\
                 NFS Version 3 \\
                 Remote File Sharing (RFS) \\
                 RFS Architecture \\
                 RFS Implementation \\
                 Client-Side Caching \\
                 The Andrew File System \\
                 AFS Implementation \\
                 AFS Shortcomings \\
                 The DCE Distributed File System (DCE DFS) \\
                 Summary \\
                 Exercises \\
                 References \\
                 11: Advanced File Systems \\
                 Introduction \\
                 Limitations of Traditional File Systems \\
                 File System Clustering (Sun-FFS) \\
                 The Journaling Approach \\
                 Log-Structured File Systems \\
                 The 4.4BSD Log-Structured File System \\
                 Metadata Logging \\
                 The Episode File System \\
                 Watchdogs \\
                 The 4.4BSD Portal File System \\
                 Stackable File System Layers \\
                 The 4.4BSD File System Interface \\
                 Summary \\
                 Exercises \\
                 References \\
                 12: Kernel Memory Allocation \\
                 Introduction \\
                 Functional Requirements \\
                 Resource Map Allocator \\
                 Simple Power-of-Two Free Lists \\
                 The McKusick-Karels Allocator \\
                 The Buddy System \\
                 The SVR4 Lazy Buddy Algorithm \\
                 The MACH-OSF /1 Zone Allocator \\
                 A Hierarchical Allocator for Multiprocessors \\
                 The Solaris 2.4 Slab Allocator \\
                 Summary \\
                 Exercises \\
                 References \\
                 13: Virtual Memory \\
                 Introduction \\
                 Demand Paging \\
                 Hardware Requirements \\
                 4: 3BSD \\
                 A Case Study \\
                 4: 3BSD Memory Management Operations \\
                 Analysis \\
                 Exercises \\
                 References \\
                 14: The SVR4 VM Architecture \\
                 Motivation \\
                 Memory-Mapped Files \\
                 VM Design Principles \\
                 Fundamental Abstractions \\
                 Segment Drivers \\
                 The Swap Layer \\
                 VM Operations \\
                 Interaction with the Vnode Subsystem \\
                 Virtual Swap Space in Solaris \\
                 Analysis \\
                 Performance Improvements \\
                 Summary \\
                 Exercises \\
                 References \\
                 15: More Memory Management Topics \\
                 Introduction \\
                 MACH Memory Management Design \\
                 Memory Sharing Facilities \\
                 Memory Objects and Pagers \\
                 External and Internal Pagers \\
                 Page Replacement \\
                 Analysis \\
                 Memory Management in 4.4BSD \\
                 Translation Lookaside Buffer (TLB) Consistency \\
                 TLB Shootdown in MACH \\
                 TLB Consistency in SVR4 and SVR4.2 UNIX \\
                 Other TLB Consistency Algorithms \\
                 Virtually Addressed Caches \\
                 Exercises \\
                 References \\
                 16: Device Drivers and I /O \\
                 Introduction \\
                 Overview \\
                 Device Driver Framework \\
                 The I /O Subsystem \\
                 The poll System Call \\
                 Block I /O \\
                 The DDI /DKI Specification \\
                 Newer SVR4 Releases \\
                 Future Directions \\
                 Summary \\
                 Exercises \\
                 References \\
                 17: Streams \\
                 Motivation \\
                 Overview \\
                 Messages and Queues \\
                 Stream I /O \\
                 Configuration and Setup \\
                 STREAMS ioctls \\
                 Memory Allocation \\
                 Multiplexing \\
                 FIFOs and Pipes \\
                 Networking Interfaces \\
                 Summary \\
                 Exercises \\
                 References",
}


bibtype: book
filename: master.bib
label: vanCalmthout:2018:SGH
editor: Martijn van Calmthout and Michiel Horn
title: Sam Goudsmit and the hunt for Hitler's atom bomb
publisher: pub-PROMETHEUS-BOOKS
address: pub-PROMETHEUS-BOOKS:adr
pages: 243 + 14
year: 2018
ISBN: 1-63388-450-3 (hardcover), 1-63388-451-1 (e-book) OR 1633884503 (hardcover), 1633884511 (ebook)
LCCN: DS135.N6 G65613 2018
bibdate: Sat Apr 13 15:58:03 MDT 2019
bibtimestamp: 2019.04.13 15:58:03 MDT
remark: English translation of cite vanCalmthout:2016:SGJ.
acknowledgement: ack-nhfb
authordates: 1961--
subjectdates: Samuel Goudsmit (1902--1978)
raweditor: Martijn van Calmthout and Michiel Horn
rawtitle: {Sam Goudsmit} and the hunt for {Hitler}'s atom bomb
ISBN13:
978-1-63388-450-2 (hardcover), 978-1-63388-451-9 (e-book) OR 9781633884502 (hardcover), 9781633884519 (ebook)

bibsource:
fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/bibnet/authors/g/goudsmit-samuel-a.bib; https://www.math.utah.edu/pub/bibnet/authors/h/heisenberg-werner.bib; https://www.math.utah.edu/pub/tex/bib/einstein.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

abstract:
The first biography in English of a leading Dutch American physicist, who discovered the subatomic property of ``spin'' and spearheaded the search for Hitler's atom bomb as World War II came to an end.

subject:
Goudsmit, Samuel A. (Samuel Abraham); Physicists; Netherlands; Biography; Jews; Atomic bomb; Germany; History; 20th century; Biography and Autobiography / Science and Technology; Science / Physics / Nuclear; Kernwaffe; Nationalsozialismus; Physiker; Niederlande

TOC:
Editor/Translator's Note / 11 Preface / 13 Prologue: A Home Stripped Bare: The Hague, September 1945 / 19 1: Nothing to Lose as Yet: Leiden, September 1927 / 27 2: Appeals and Zeeman's Chair: Michigan, 1933--1940 / 47 3: The Shadow of War: Boston, 1941--1944 / 65 4: Hider's Atom Bomb: Paris, 1944 / 77 5: Uranium and Heavy Water: Germany, 1944--1945 / 101 6: The Truth of Kistemaker: Amsterdam, 1960--1961 / 129 7: Heisenberg's Version: Cambridge, 1945--1973 / 149 8: Sam's Cold War: Brookhaven, 1947--1978 / 171 9: Under the Spell of the Scarab: Leiden--Nevada, 1925--1978 / 205 Bibliography / 235 Index / 239

rawabstract:
The first biography in English of a leading Dutch American physicist, who discovered the subatomic property of ``spin'' and spearheaded the search for Hitler's atom bomb as World War II came to an end.

rawTOC:
Editor/Translator's Note / 11 \\ Preface / 13 \\ Prologue: A Home Stripped Bare: The Hague, September 1945 / 19 \\ 1: Nothing to Lose as Yet: Leiden, September 1927 / 27 \\ 2: Appeals and Zeeman's Chair: Michigan, 1933--1940 / 47 \\ 3: The Shadow of War: Boston, 1941--1944 / 65 \\ 4: Hider's Atom Bomb: Paris, 1944 / 77 \\ 5: Uranium and Heavy Water: Germany, 1944--1945 / 101 \\ 6: The Truth of Kistemaker: Amsterdam, 1960--1961 / 129 \\ 7: Heisenberg's Version: Cambridge, 1945--1973 / 149 \\ 8: Sam's Cold War: Brookhaven, 1947--1978 / 171 \\ 9: Under the Spell of the Scarab: Leiden--Nevada, 1925--1978 / 205 \\ Bibliography / 235 \\ Index / 239

entry:
@Book{vanCalmthout:2018:SGH,
  editor =       "Martijn van Calmthout and Michiel Horn",
  title =        "{Sam Goudsmit} and the hunt for {Hitler}'s atom bomb",
  publisher =    pub-PROMETHEUS-BOOKS,
  address =      pub-PROMETHEUS-BOOKS:adr,
  pages =        "243 + 14",
  year =         "2018",
  ISBN =         "1-63388-450-3 (hardcover), 1-63388-451-1 (e-book)",
  ISBN-13 =      "978-1-63388-450-2 (hardcover), 978-1-63388-451-9
                 (e-book)",
  LCCN =         "DS135.N6 G65613 2018",
  bibdate =      "Sat Apr 13 15:58:03 MDT 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/g/goudsmit-samuel-a.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/h/heisenberg-werner.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "The first biography in English of a leading Dutch
                 American physicist, who discovered the subatomic
                 property of ``spin'' and spearheaded the search for
                 Hitler's atom bomb as World War II came to an end.",
  acknowledgement = ack-nhfb,
  author-dates = "1961--",
  brieftableofcontents = "Prologue: A home stripped bare: The Hague,
                 September 1945 \\
                 Nothing to lose as yet: Leiden, September 1927 \\
                 Appeals and Zeeman's chair: Michigan, 1933--1940 \\
                 The shadow of war: Boston, 1941--1944 \\
                 Hitler's atom bomb: Paris, 1944 \\
                 Uranium and heavy water: Germany, 1944--1945 \\
                 The truth of Kistemaker: Amsterdam, 1960--1961 \\
                 Heisenberg's version: Cambridge, 1945--1973 \\
                 Sam's Cold War: Brookhaven, 1947--1978 \\
                 Under the spell of the scarab: Leiden--Nevada,
                 1925--1978",
  remark =       "English translation of \cite{vanCalmthout:2016:SGJ}.",
  subject =      "Goudsmit, Samuel A. (Samuel Abraham); Physicists;
                 Netherlands; Biography; Jews; Atomic bomb; Germany;
                 History; 20th century; Biography and Autobiography /
                 Science and Technology; Science / Physics / Nuclear;
                 Kernwaffe; Nationalsozialismus; Physiker; Niederlande",
  subject-dates = "Samuel Goudsmit (1902--1978)",
  tableofcontents = "Editor/Translator's Note / 11 \\
                 Preface / 13 \\
                 Prologue: A Home Stripped Bare: The Hague, September
                 1945 / 19 \\
                 1: Nothing to Lose as Yet: Leiden, September 1927 / 27
                 \\
                 2: Appeals and Zeeman's Chair: Michigan, 1933--1940 /
                 47 \\
                 3: The Shadow of War: Boston, 1941--1944 / 65 \\
                 4: Hider's Atom Bomb: Paris, 1944 / 77 \\
                 5: Uranium and Heavy Water: Germany, 1944--1945 / 101
                 \\
                 6: The Truth of Kistemaker: Amsterdam, 1960--1961 / 129
                 \\
                 7: Heisenberg's Version: Cambridge, 1945--1973 / 149
                 \\
                 8: Sam's Cold War: Brookhaven, 1947--1978 / 171 \\
                 9: Under the Spell of the Scarab: Leiden--Nevada,
                 1925--1978 / 205 \\
                 Bibliography / 235 \\
                 Index / 239",
}


bibtype: book
filename: master.bib
label: Vandevoorde:1999:CSC
author: David Vandevoorde
title: C++ solutions: companion to The C++ Programming Language, Third edition
publisher: pub-AW
address: pub-AW:adr
pages: vii + 292
year: 1999
ISBN: 0-201-30965-3 (paperback) OR 0201309653 (paperback)
ISBN13: 978-0-201-30965-2 (paperback) OR 9780201309652 (paperback)
LCCN: QA76.73.C153V36 1998
bibdate: Tue May 11 07:04:43 1999
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1999.05.11 07:04:43 ???
note: See cite Stroustrup:1997:CPL.
acknowledgement: ack-nhfb
rawauthor: David Vandevoorde
rawnote: See \cite{Stroustrup:1997:CPL}.
rawtitle: {C++} solutions: companion to {The C++ Programming Language, Third edition}
entry:
@Book{Vandevoorde:1999:CSC,
  author =       "David Vandevoorde",
  title =        "{C++} solutions: companion to {The C++ Programming
                 Language, Third edition}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "vii + 292",
  year =         "1999",
  ISBN =         "0-201-30965-3 (paperback)",
  ISBN-13 =      "978-0-201-30965-2 (paperback)",
  LCCN =         "QA76.73.C153V36 1998",
  bibdate =      "Tue May 11 07:04:43 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See \cite{Stroustrup:1997:CPL}.",
  price =        "US\$29.95",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
}


bibtype: book
filename: master.bib
label: vanHerwijnen:1990:PS
author: Eric van Herwijnen
title: Practical SGML
publisher: pub-KLUWER
address: pub-KLUWER:adr
pages: xviii + 307
year: 1990
DOI: https://doi.org/10.1007/978-1-4613-0687-0
ISBN: 0-7923-0635-X, 0-7923-9434-8 OR 079230635X, 0792394348
ISBN13: 978-0-7923-0635-1, 978-0-7923-9434-1 OR 9780792306351, 9780792394341
LCCN: QA76.73.S44 V36 1990
bibdate: Mon Oct 26 07:31:07 1998
bibtimestamp: 1998.10.26 07:31:07 ???
acknowledgement: ack-nhfb
rawauthor: Eric {van Herwijnen}
rawtitle: Practical {SGML}
bibsource:
https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/sgml.bib; https://www.math.utah.edu/pub/tex/bib/texbook2.bib; https://www.math.utah.edu/pub/tex/bib/texbook3.bib

abstract:
Many times there are subjects which demand further explanations and guidance written about them. Such is the case with SGML, the Standard Generalized Markup Language; and ISO Standard published in October, 1986 under the number 8879. There have been many conferences given on this topic, world-wide, as the interest in SGML exists in Europe, the US, Australia and Japan. This book is the first which contains information not only on ISO 8879 itself, but many helpful hints and ideas on developing SGML, applications and discussions of the current software written to be conforming to the ISO standard. This book is critical for any end-user and application developer to understand the many issues necessary to develop SGML implementations (software selection is one of the topics discussed) and SGML applications. A number of examples of the applications of SGML in various situations are discussed and one can expect that the book will stimulate further discussion of these. This book is a practical guide to various components of the language and the author's experience in development and working with SGML in his position as leader of the text processing section at CERN ensures that the guidance is based on practical first-hand experience at an installation with a large number of end-users of very varied experience.

TOC:
I Getting Started with SGML 1 1: Introduction 2: An SGML application document type components 3: Creating an SGML application: method and basics 4: Creating an SGML application: examples and summary 5: Managing SGML II: Advanced SGML 97 6: Creating an SGML application: advanced concepts 7: Advanced SGML constructs 8: Mathematics and Graphics III: SGML implementations 165 9: SGML implementations 10: Creating SGML documents 11: SGML and databases 12: The CALS initiative 13: SGML and EDI Appendix A: Answers to the problems A.1 Answers for Chapter 1 A.2 Answers for Chapter 2 A.3 Answers for Chapter 3 A.4 Answers for Chapter 4 A.5 Answers for Chapter 6 A.6 Answers for Chapter 7 A.7 Answers for Chapter 10 Appendix B: Writing a book on SGML using SGML B.1 Statistics B.2 Document exchange B.3 Bibliography for Appendix B Appendix C: The Ericbook DTD Appendix D: Some TeX entity definitions Appendix E: How to read ISO 8879 E.1 Structure of the SGML standard E.2 Notation used in the SGML standard E.3 Bibliography for Appendix E Bibliography for Glossary

rawabstract:
Many times there are subjects which demand further explanations and guidance written about them. Such is the case with SGML, the Standard Generalized Markup Language; and ISO Standard published in October, 1986 under the number 8879. There have been many conferences given on this topic, world-wide, as the interest in SGML exists in Europe, the US, Australia and Japan. This book is the first which contains information not only on ISO 8879 itself, but many helpful hints and ideas on developing SGML, applications and discussions of the current software written to be conforming to the ISO standard. This book is critical for any end-user and application developer to understand the many issues necessary to develop SGML implementations (software selection is one of the topics discussed) and SGML applications. A number of examples of the applications of SGML in various situations are discussed and one can expect that the book will stimulate further discussion of these. This book is a practical guide to various components of the language and the author's experience in development and working with SGML in his position as leader of the text processing section at CERN ensures that the guidance is based on practical first-hand experience at an installation with a large number of end-users of very varied experience.

rawTOC:
I Getting Started with SGML 1 \\ 1: Introduction \\ 2: An SGML application \\ document type components \\ 3: Creating an SGML application: method and basics \\ 4: Creating an SGML application: examples and summary \\ 5: Managing SGML \\ II: Advanced SGML 97 \\ 6: Creating an SGML application: advanced concepts \\ 7: Advanced SGML constructs \\ 8: Mathematics and Graphics \\ III: SGML implementations 165 \\ 9: SGML implementations \\ 10: Creating SGML documents \\ 11: SGML and databases \\ 12: The CALS initiative \\ 13: SGML and EDI \\ Appendix A: Answers to the problems \\ A.1 Answers for Chapter 1 \\ A.2 Answers for Chapter 2 \\ A.3 Answers for Chapter 3 \\ A.4 Answers for Chapter 4 \\ A.5 Answers for Chapter 6 \\ A.6 Answers for Chapter 7 \\ A.7 Answers for Chapter 10 \\ Appendix B: Writing a book on SGML using SGML \\ B.1 Statistics \\ B.2 Document exchange \\ B.3 Bibliography for Appendix B \\ Appendix C: The Ericbook DTD \\ Appendix D: Some TeX entity definitions \\ Appendix E: How to read ISO 8879 \\ E.1 Structure of the SGML standard \\ E.2 Notation used in the SGML standard \\ E.3 Bibliography for Appendix E \\ Bibliography for Glossary

entry:
@Book{vanHerwijnen:1990:PS,
  author =       "Eric {van Herwijnen}",
  title =        "Practical {SGML}",
  publisher =    pub-KLUWER,
  address =      pub-KLUWER:adr,
  pages =        "xviii + 307",
  year =         "1990",
  DOI =          "https://doi.org/10.1007/978-1-4613-0687-0",
  ISBN =         "0-7923-0635-X, 0-7923-9434-8",
  ISBN-13 =      "978-0-7923-0635-1, 978-0-7923-9434-1",
  LCCN =         "QA76.73.S44 V36 1990",
  bibdate =      "Mon Oct 26 07:31:07 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/sgml.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook2.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  price =        "UK\pounds24.90, US\$49.00",
  abstract =     "Many times there are subjects which demand further
                 explanations and guidance written about them. Such is
                 the case with SGML, the Standard Generalized Markup
                 Language; and ISO Standard published in October, 1986
                 under the number 8879. There have been many conferences
                 given on this topic, world-wide, as the interest in
                 SGML exists in Europe, the US, Australia and Japan.
                 This book is the first which contains information not
                 only on ISO 8879 itself, but many helpful hints and
                 ideas on developing SGML, applications and discussions
                 of the current software written to be conforming to the
                 ISO standard. This book is critical for any end-user
                 and application developer to understand the many issues
                 necessary to develop SGML implementations (software
                 selection is one of the topics discussed) and SGML
                 applications. A number of examples of the applications
                 of SGML in various situations are discussed and one can
                 expect that the book will stimulate further discussion
                 of these. This book is a practical guide to various
                 components of the language and the author's experience
                 in development and working with SGML in his position as
                 leader of the text processing section at CERN ensures
                 that the guidance is based on practical first-hand
                 experience at an installation with a large number of
                 end-users of very varied experience.",
  acknowledgement = ack-nhfb,
  tableofcontents = "I Getting Started with SGML 1 \\
                 1: Introduction \\
                 2: An SGML application \\
                 document type components \\
                 3: Creating an SGML application: method and basics \\
                 4: Creating an SGML application: examples and summary
                 \\
                 5: Managing SGML \\
                 II: Advanced SGML 97 \\
                 6: Creating an SGML application: advanced concepts \\
                 7: Advanced SGML constructs \\
                 8: Mathematics and Graphics \\
                 III: SGML implementations 165 \\
                 9: SGML implementations \\
                 10: Creating SGML documents \\
                 11: SGML and databases \\
                 12: The CALS initiative \\
                 13: SGML and EDI \\
                 Appendix A: Answers to the problems \\
                 A.1 Answers for Chapter 1 \\
                 A.2 Answers for Chapter 2 \\
                 A.3 Answers for Chapter 3 \\
                 A.4 Answers for Chapter 4 \\
                 A.5 Answers for Chapter 6 \\
                 A.6 Answers for Chapter 7 \\
                 A.7 Answers for Chapter 10 \\
                 Appendix B: Writing a book on SGML using SGML \\
                 B.1 Statistics \\
                 B.2 Document exchange \\
                 B.3 Bibliography for Appendix B \\
                 Appendix C: The Ericbook DTD \\
                 Appendix D: Some TeX entity definitions \\
                 Appendix E: How to read ISO 8879 \\
                 E.1 Structure of the SGML standard \\
                 E.2 Notation used in the SGML standard \\
                 E.3 Bibliography for Appendix E \\
                 Bibliography for Glossary",
}


bibtype: book
filename: master.bib
label: vanHerwijnen:1994:PS
author: Eric van Herwijnen
title: Practical SGML
publisher: pub-KLUWER
address: pub-KLUWER:adr
edition: Second
pages: xx + 288
year: 1994
ISBN: 0-7923-9434-8 OR 0792394348
ISBN13: 978-0-7923-9434-1 OR 9780792394341
LCCN: QA76.73.S44 V36 1994
bibdate: Mon Oct 26 07:31:11 1998
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/sgml.bib
bibtimestamp: 1998.10.26 07:31:11 ???
acknowledgement: ack-nhfb
rawauthor: Eric {van Herwijnen}
rawtitle: Practical {SGML}
TOC:
Foreword Preface to the second edition Acknowledgments Conventions and definitions Introduction / 3 A brief history of SGML / 17 Components of an SGML system / 25 Document type components / 31 Creating SGML documents / 47 How to keep up to date with SGML / 51 Document analysis / 57 Structure diagrams / 65 Markup declarations / 73 Element declarations / 81 Attribute declarations / 89 Entity declarations / 95 Putting the DTD together / 105 Some advice on DTDs / 111 The SGML declaration / 121 SGML features / 151 Notation / 161 Marked sections / 167 Short references / 173 Record boundaries and ambiguities / 181 SGML and EDI / 191 SGML and mathematics / 207 Graphics and SGML / 217 Other ISO text processing standards / 225 A. Solutions to the exercises / 244 B. The sgmls parser / 260 C. The ISO 646: 1983 character set / 262 D. How to read ISO 8879 / 263 Glossary / 267 Index / 281

rawTOC:
Foreword \\ Preface to the second edition \\ Acknowledgments \\ Conventions and definitions \\ Introduction / 3 \\ A brief history of SGML / 17 \\ Components of an SGML system / 25 \\ Document type components / 31 \\ Creating SGML documents / 47 \\ How to keep up to date with SGML / 51 \\ Document analysis / 57 \\ Structure diagrams / 65 \\ Markup declarations / 73 \\ Element declarations / 81 \\ Attribute declarations / 89 \\ Entity declarations / 95 \\ Putting the DTD together / 105 \\ Some advice on DTDs / 111 \\ The SGML declaration / 121 \\ SGML features / 151 \\ Notation / 161 \\ Marked sections / 167 \\ Short references / 173 \\ Record boundaries and ambiguities / 181 \\ SGML and EDI / 191 \\ SGML and mathematics / 207 \\ Graphics and SGML / 217 \\ Other ISO text processing standards / 225 \\ A. Solutions to the exercises / 244 \\ B. The sgmls parser / 260 \\ C. The ISO 646: 1983 character set / 262 \\ D. How to read ISO 8879 / 263 \\ Glossary / 267 \\ Index / 281

entry:
@Book{vanHerwijnen:1994:PS,
  author =       "Eric {van Herwijnen}",
  title =        "Practical {SGML}",
  publisher =    pub-KLUWER,
  address =      pub-KLUWER:adr,
  edition =      "Second",
  pages =        "xx + 288",
  year =         "1994",
  ISBN =         "0-7923-9434-8",
  ISBN-13 =      "978-0-7923-9434-1",
  LCCN =         "QA76.73.S44 V36 1994",
  bibdate =      "Mon Oct 26 07:31:11 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/sgml.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Foreword \\
                 Preface to the second edition \\
                 Acknowledgments \\
                 Conventions and definitions \\
                 Introduction / 3 \\
                 A brief history of SGML / 17 \\
                 Components of an SGML system / 25 \\
                 Document type components / 31 \\
                 Creating SGML documents / 47 \\
                 How to keep up to date with SGML / 51 \\
                 Document analysis / 57 \\
                 Structure diagrams / 65 \\
                 Markup declarations / 73 \\
                 Element declarations / 81 \\
                 Attribute declarations / 89 \\
                 Entity declarations / 95 \\
                 Putting the DTD together / 105 \\
                 Some advice on DTDs / 111 \\
                 The SGML declaration / 121 \\
                 SGML features / 151 \\
                 Notation / 161 \\
                 Marked sections / 167 \\
                 Short references / 173 \\
                 Record boundaries and ambiguities / 181 \\
                 SGML and EDI / 191 \\
                 SGML and mathematics / 207 \\
                 Graphics and SGML / 217 \\
                 Other ISO text processing standards / 225 \\
                 A. Solutions to the exercises / 244 \\
                 B. The sgmls parser / 260 \\
                 C. The ISO 646: 1983 character set / 262 \\
                 D. How to read ISO 8879 / 263 \\
                 Glossary / 267 \\
                 Index / 281",
}


bibtype: book
filename: master.bib
label: vanLeunen:1992:HS
author: Mary-Claire van Leunen
title: A handbook for scholars
publisher: pub-OXFORD
address: pub-OXFORD:adr
edition: Revised
pages: xi + 348
year: 1992
LCCN: PN146 .V36 1992
bibdate: Tue Nov 21 07:44:41 2000
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/typeset.bib
bibtimestamp: 2000.11.21 07:44:41 ???
acknowledgement: ack-nhfb
rawauthor: Mary-Claire van Leunen
rawtitle: A handbook for scholars
ISBN:
0-394-40904-3 (hardcover), 0-394-73395-9 (paperback) OR 0394409043 (hardcover), 0394733959 (paperback)

ISBN13:
978-0-394-40904-7 (hardcover), 978-0-394-73395-1 (paperback) OR 9780394409047 (hardcover), 9780394733951 (paperback)

subject:
Academic writing; Handbooks, manuals, etc; Scholarly publishing; Art d'ecrire; Guides, manuels, etc; Academic writing; Scholarly publishing; Schrijfvaardigheid; Wetenschappelijke publicaties; Authorship

TOC:
The text Citation: The new style of citation Embedding citations Brackets alone Handling bracketed numbers Pointing citations Tense in citations Citing authors Citing works Citing yourself Irrelevant citation Citations in draft Quotation: A plea against quotation A plea for quotation Epigraphs Quotation and citation Inlaid versus displayed quotations Punctuating quotations Quoting format Changes in quotations Permission to quote Other uses for quotation marks Quotations in draft The footnote: Fundamentals Explanatory footnotes The footnote aside Footnotes in draft Scholarly peculiarities: The abstract Acknowledgments Bad words Bending over backwards Capitalization The cliche redivivus Coherence The colonated title Conclusions Emphasis Equanimity Hyperqualification Initialisms and acronyms Introductions Inventing terms and notation Inversion A little Latin Motivation Nor Paragraphing Passivity Personal fads Respective The waffle Which-hunting The reference Panorama Reference format: Style I. Authors II. Titles III. Bibliographic information IV. More bibliographic information V. Annotation Pinpointing Needless information Easy References: Books Compilations Collections Editions with editors Translations Multivolume works Journal articles Reviews Pamphlets Works not yet published Theses and dissertations Secondary reference Hard references: Archival sources Author equals publishers Conference proceedings Correspondence Court cases Government documents Microfilm and microfiche Newspapers Reference works Shoes and ships and sealing wax The reference list: Reference list versus bibliography Compound references Special sections Cross-reference Alphabetical order Chronological order Order of mention Last-minute changes Compression The finishing touch Special schemes: Short names White copy Super-quick Manuscript preparation: Final draft Classroom copy Examples of display layout Classroom copy with footnotes Page from a reference list Photo-ready copy Sample instruction sheet Perfect copy Galleys and page proofs The end Appendix 1: The Vita Appendix 2: Federal documents of the United States

rawTOC:
The text \\ Citation: The new style of citation \\ Embedding citations \\ Brackets alone \\ Handling bracketed numbers \\ Pointing citations \\ Tense in citations \\ Citing authors \\ Citing works \\ Citing yourself \\ Irrelevant citation \\ Citations in draft \\ Quotation: A plea against quotation \\ A plea for quotation \\ Epigraphs \\ Quotation and citation \\ Inlaid versus displayed quotations \\ Punctuating quotations \\ Quoting format \\ Changes in quotations \\ Permission to quote \\ Other uses for quotation marks \\ Quotations in draft \\ The footnote: Fundamentals \\ Explanatory footnotes \\ The footnote aside \\ Footnotes in draft \\ Scholarly peculiarities: The abstract \\ Acknowledgments \\ Bad words \\ Bending over backwards \\ Capitalization \\ The cliche redivivus \\ Coherence \\ The colonated title \\ Conclusions \\ Emphasis \\ Equanimity \\ Hyperqualification \\ Initialisms and acronyms \\ Introductions \\ Inventing terms and notation \\ Inversion \\ A little Latin \\ Motivation \\ Nor \\ Paragraphing \\ Passivity \\ Personal fads \\ Respective \\ The waffle \\ Which-hunting \\ The reference \\ Panorama \\ Reference format: Style \\ I. Authors \\ II. Titles \\ III. Bibliographic information \\ IV. More bibliographic information \\ V. Annotation \\ Pinpointing \\ Needless information \\ Easy References: Books \\ Compilations \\ Collections \\ Editions with editors \\ Translations \\ Multivolume works \\ Journal articles \\ Reviews \\ Pamphlets \\ Works not yet published \\ Theses and dissertations \\ Secondary reference \\ Hard references: Archival sources \\ Author equals publishers \\ Conference proceedings \\ Correspondence \\ Court cases \\ Government documents \\ Microfilm and microfiche \\ Newspapers \\ Reference works \\ Shoes and ships and sealing wax \\ The reference list: Reference list versus bibliography \\ Compound references \\ Special sections \\ Cross-reference \\ Alphabetical order \\ Chronological order \\ Order of mention \\ Last-minute changes \\ Compression \\ The finishing touch \\ Special schemes: Short names \\ White copy \\ Super-quick \\ Manuscript preparation: Final draft \\ Classroom copy \\ Examples of display layout \\ Classroom copy with footnotes \\ Page from a reference list \\ Photo-ready copy \\ Sample instruction sheet \\ Perfect copy \\ Galleys and page proofs \\ The end \\ Appendix 1: The Vita \\ Appendix 2: Federal documents of the United States

entry:
@Book{vanLeunen:1992:HS,
  author =       "Mary-Claire van Leunen",
  title =        "A handbook for scholars",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  edition =      "Revised",
  pages =        "xi + 348",
  year =         "1992",
  ISBN =         "0-394-40904-3 (hardcover), 0-394-73395-9 (paperback)",
  ISBN-13 =      "978-0-394-40904-7 (hardcover), 978-0-394-73395-1
                 (paperback)",
  LCCN =         "PN146 .V36 1992",
  bibdate =      "Tue Nov 21 07:44:41 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/typeset.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Academic writing; Handbooks, manuals, etc; Scholarly
                 publishing; Art d'{\'e}crire; Guides, manuels, etc;
                 Academic writing; Scholarly publishing;
                 Schrijfvaardigheid; Wetenschappelijke publicaties;
                 Authorship",
  tableofcontents = "The text \\
                 Citation: The new style of citation \\
                 Embedding citations \\
                 Brackets alone \\
                 Handling bracketed numbers \\
                 Pointing citations \\
                 Tense in citations \\
                 Citing authors \\
                 Citing works \\
                 Citing yourself \\
                 Irrelevant citation \\
                 Citations in draft \\
                 Quotation: A plea against quotation \\
                 A plea for quotation \\
                 Epigraphs \\
                 Quotation and citation \\
                 Inlaid versus displayed quotations \\
                 Punctuating quotations \\
                 Quoting format \\
                 Changes in quotations \\
                 Permission to quote \\
                 Other uses for quotation marks \\
                 Quotations in draft \\
                 The footnote: Fundamentals \\
                 Explanatory footnotes \\
                 The footnote aside \\
                 Footnotes in draft \\
                 Scholarly peculiarities: The abstract \\
                 Acknowledgments \\
                 Bad words \\
                 Bending over backwards \\
                 Capitalization \\
                 The cliche redivivus \\
                 Coherence \\
                 The colonated title \\
                 Conclusions \\
                 Emphasis \\
                 Equanimity \\
                 Hyperqualification \\
                 Initialisms and acronyms \\
                 Introductions \\
                 Inventing terms and notation \\
                 Inversion \\
                 A little Latin \\
                 Motivation \\
                 Nor \\
                 Paragraphing \\
                 Passivity \\
                 Personal fads \\
                 Respective \\
                 The waffle \\
                 Which-hunting \\
                 The reference \\
                 Panorama \\
                 Reference format: Style \\
                 I. Authors \\
                 II. Titles \\
                 III. Bibliographic information \\
                 IV. More bibliographic information \\
                 V. Annotation \\
                 Pinpointing \\
                 Needless information \\
                 Easy References: Books \\
                 Compilations \\
                 Collections \\
                 Editions with editors \\
                 Translations \\
                 Multivolume works \\
                 Journal articles \\
                 Reviews \\
                 Pamphlets \\
                 Works not yet published \\
                 Theses and dissertations \\
                 Secondary reference \\
                 Hard references: Archival sources \\
                 Author equals publishers \\
                 Conference proceedings \\
                 Correspondence \\
                 Court cases \\
                 Government documents \\
                 Microfilm and microfiche \\
                 Newspapers \\
                 Reference works \\
                 Shoes and ships and sealing wax \\
                 The reference list: Reference list versus bibliography
                 \\
                 Compound references \\
                 Special sections \\
                 Cross-reference \\
                 Alphabetical order \\
                 Chronological order \\
                 Order of mention \\
                 Last-minute changes \\
                 Compression \\
                 The finishing touch \\
                 Special schemes: Short names \\
                 White copy \\
                 Super-quick \\
                 Manuscript preparation: Final draft \\
                 Classroom copy \\
                 Examples of display layout \\
                 Classroom copy with footnotes \\
                 Page from a reference list \\
                 Photo-ready copy \\
                 Sample instruction sheet \\
                 Perfect copy \\
                 Galleys and page proofs \\
                 The end \\
                 Appendix 1: The Vita \\
                 Appendix 2: Federal documents of the United States",
}


bibtype: book
filename: master.bib
label: VanLoan:1992:CFF
author: Charles F. Van Loan
title: Computational Frameworks for the Fast Fourier Transform
publisher: pub-SIAM
address: pub-SIAM:adr
pages: xiii + 273
year: 1992
DOI: https://doi.org/10.1137/1.9781611970999
ISBN: 0-89871-285-8 (paperback), 1-61197-099-7 (e-book) OR 0898712858 (paperback), 1611970997 (ebook)
LCCN: QA403.5 .V35 1992
bibdate: Mon Oct 26 07:31:14 1998
bibtimestamp: 1998.10.26 07:31:14 ???
series: Frontiers in applied mathematics
subject: Fourier transformations
acknowledgement: ack-nhfb
rawauthor: Charles F. {Van Loan}
rawtitle: Computational Frameworks for the {Fast Fourier Transform}
ISBN13:
978-0-89871-285-8 (paperback), 978-1-61197-099-9 (e-book) OR 9780898712858 (paperback), 9781611970999 (ebook)

bibsource:
https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg-2ed.bib; https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib; https://www.math.utah.edu/pub/bibnet/subjects/han-wri-mat-sci-2ed.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/matlab.bib

TOC:
1: The Radix-2 Frameworks: Matrix Notation and Algorithms The FFT Idea The Cooley--Tukey Factorization Weight and Butterfly Computations Bit Reversal and Transposition The Cooley--Tukey Framework The Stockham Autosort Frameworks The Pease Framework Decimation in Frequency and Inverse FFTs 2: General Radix Frameworks: The General Radix Ideas Index Reversal and Transposition Mixed-Radix Factorizations Radix-4 and Radix-8 Frameworks The Split-Radix Frameworks 3: High Performance Frameworks: The Multiple DFT Problem Matrix Transposition The Large Single-Vector FFT Problem Multi-Dimensional FFT Problem Distributed Memory FFTs Shared Memory FFTs 4: Selected Topics: Prime Factor FFTs Convolution FFTs of Real Data Cosine and Sine Transforms Fast Poisson Solvers Bibliography Index

rawTOC:
1: The Radix-2 Frameworks: Matrix Notation and Algorithms \\ The FFT Idea \\ The Cooley--Tukey Factorization \\ Weight and Butterfly Computations \\ Bit Reversal and Transposition \\ The Cooley--Tukey Framework \\ The Stockham Autosort Frameworks \\ The Pease Framework \\ Decimation in Frequency and Inverse FFTs \\ 2: General Radix Frameworks: The General Radix Ideas \\ Index Reversal and Transposition \\ Mixed-Radix Factorizations \\ Radix-4 and Radix-8 Frameworks \\ The Split-Radix Frameworks \\ 3: High Performance Frameworks: The Multiple DFT Problem \\ Matrix Transposition \\ The Large Single-Vector FFT Problem \\ Multi-Dimensional FFT Problem \\ Distributed Memory FFTs \\ Shared Memory FFTs \\ 4: Selected Topics: Prime Factor FFTs \\ Convolution \\ FFTs of Real Data \\ Cosine and Sine Transforms \\ Fast Poisson Solvers \\ Bibliography \\ Index

entry:
@Book{VanLoan:1992:CFF,
  author =       "Charles F. {Van Loan}",
  title =        "Computational Frameworks for the {Fast Fourier
                 Transform}",
  publisher =    pub-SIAM,
  address =      pub-SIAM:adr,
  pages =        "xiii + 273",
  year =         "1992",
  DOI =          "https://doi.org/10.1137/1.9781611970999",
  ISBN =         "0-89871-285-8 (paperback), 1-61197-099-7 (e-book)",
  ISBN-13 =      "978-0-89871-285-8 (paperback), 978-1-61197-099-9
                 (e-book)",
  LCCN =         "QA403.5 .V35 1992",
  bibdate =      "Mon Oct 26 07:31:14 1998",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg-2ed.bib;
                 https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
                 https://www.math.utah.edu/pub/bibnet/subjects/han-wri-mat-sci-2ed.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/matlab.bib",
  series =       "Frontiers in applied mathematics",
  acknowledgement = ack-nhfb,
  subject =      "Fourier transformations",
  tableofcontents = "1: The Radix-2 Frameworks: Matrix Notation and
                 Algorithms \\
                 The FFT Idea \\
                 The Cooley--Tukey Factorization \\
                 Weight and Butterfly Computations \\
                 Bit Reversal and Transposition \\
                 The Cooley--Tukey Framework \\
                 The Stockham Autosort Frameworks \\
                 The Pease Framework \\
                 Decimation in Frequency and Inverse FFTs \\
                 2: General Radix Frameworks: The General Radix Ideas
                 \\
                 Index Reversal and Transposition \\
                 Mixed-Radix Factorizations \\
                 Radix-4 and Radix-8 Frameworks \\
                 The Split-Radix Frameworks \\
                 3: High Performance Frameworks: The Multiple DFT
                 Problem \\
                 Matrix Transposition \\
                 The Large Single-Vector FFT Problem \\
                 Multi-Dimensional FFT Problem \\
                 Distributed Memory FFTs \\
                 Shared Memory FFTs \\
                 4: Selected Topics: Prime Factor FFTs \\
                 Convolution \\
                 FFTs of Real Data \\
                 Cosine and Sine Transforms \\
                 Fast Poisson Solvers \\
                 Bibliography \\
                 Index",
}


bibtype: book
filename: master.bib
label: vanWijngaarden:1976:RRA
title: Revised Report on the Algorithmic Language ALGOL 68
publisher: pub-SV
address: pub-SV:adr
pages: 236
year: 1976
ISBN: 0-387-07592-5, 3-540-07592-5 OR 0387075925, 3540075925
ISBN13: 978-0-387-07592-1, 978-3-540-07592-9 OR 9780387075921, 9783540075929
LCCN: QA76.73.A24 R45 1976
bibdate: Sat Apr 27 15:52:06 MDT 2024
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2024.04.27 15:52:06 MDT
acknowledgement: ack-nhfb
rawtitle: Revised Report on the Algorithmic Language {ALGOL 68}
editor:
Adriaan van Wijngaarden and B. J. (Barry James)) Mailloux and J. E. L. (John E. L. (Edward Lancelot)) Peck and C. H. A. (Cornelis H. A.) Koster and M. Sintzoff and C. H. Lindsey and Lambert G. L. Meertens and R. G. Fisker

subject:
Algol (Lenguaje de Programaciyon para Computadores); Lenguajes de Programaciyon (Computadores Electryonicos)

TOC:
Preliminary definitions Fundamental constructions Context dependence Elaboration-independent constructions Environment and examples

raweditor:
Adriaan van Wijngaarden and B. J. (Barry James)) Mailloux and J. E. L. (John E. L. (Edward Lancelot)) Peck and C. H. A. (Cornelis H. A.) Koster and M. Sintzoff and C. H. Lindsey and Lambert G. L. Meertens and R. G. Fisker

rawTOC:
Preliminary definitions \\ Fundamental constructions \\ Context dependence \\ Elaboration-independent constructions \\ Environment and examples

entry:
@Book{vanWijngaarden:1976:RRA,
  editor =       "Adriaan van Wijngaarden and B. J. (Barry James))
                 Mailloux and J. E. L. (John E. L. (Edward Lancelot))
                 Peck and C. H. A. (Cornelis H. A.) Koster and M.
                 Sintzoff and C. H. Lindsey and Lambert G. L. Meertens
                 and R. G. Fisker",
  title =        "Revised Report on the Algorithmic Language {ALGOL
                 68}",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "236",
  year =         "1976",
  ISBN =         "0-387-07592-5, 3-540-07592-5",
  ISBN-13 =      "978-0-387-07592-1, 978-3-540-07592-9",
  LCCN =         "QA76.73.A24 R45 1976",
  bibdate =      "Sat Apr 27 15:52:06 MDT 2024",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Algol (Lenguaje de Programaci{\'y}on para
                 Computadores); Lenguajes de Programaci{\'y}on
                 (Computadores Electr{\'y}onicos)",
  tableofcontents = "Preliminary definitions \\
                 Fundamental constructions \\
                 Context dependence \\
                 Elaboration-independent constructions \\
                 Environment and examples",
}


bibtype: book
filename: master.bib
label: VanWolferen:1989:EJP
author: Karel Van Wolferen
title: The enigma of Japanese power: people and politics in a stateless nation
publisher: pub-KNOPF
address: pub-KNOPF:adr
pages: 496
year: 1989
ISBN: 0-333-44321-7, 0-394-57796-5 OR 0333443217, 0394577965
ISBN13: 978-0-333-44321-7, 978-0-394-57796-8 OR 9780333443217, 9780394577968
LCCN: JQ1681 .W6521 1989
bibdate: Mon Oct 26 07:31:18 1998
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1998.10.26 07:31:18 ???
acknowledgement: ack-nhfb
rawauthor: Karel {Van Wolferen}
rawtitle: The enigma of {Japanese} power: people and politics in a stateless nation
entry:
@Book{VanWolferen:1989:EJP,
  author =       "Karel {Van Wolferen}",
  title =        "The enigma of {Japanese} power: people and politics in
                 a stateless nation",
  publisher =    pub-KNOPF,
  address =      pub-KNOPF:adr,
  pages =        "496",
  year =         "1989",
  ISBN =         "0-333-44321-7, 0-394-57796-5",
  ISBN-13 =      "978-0-333-44321-7, 978-0-394-57796-8",
  LCCN =         "JQ1681 .W6521 1989",
  bibdate =      "Mon Oct 26 07:31:18 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$24.95, UK\pounds 16.95",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}


bibtype: book
filename: master.bib
label: VanWyk:1988:DSC
author: Christopher J. Van Wyk
title: Data Structures in C
publisher: pub-AW
address: pub-AW:adr
pages: x + 387
year: 1988
ISBN: 0-201-16116-8 OR 0201161168
ISBN13: 978-0-201-16116-8 OR 9780201161168
LCCN: QA76.73.C15 V36 1988
bibdate: Mon Oct 26 07:31:49 1998
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 1998.10.26 07:31:49 ???
acknowledgement: ack-nhfb
rawauthor: Christopher J. {Van Wyk}
rawtitle: Data Structures in {C}
TOC:
Preface / iii Part I: Fundamental Ideas 1: Charting Our Course / 3 1.1 Problem: Summarizing Data / 3 1.2 Solution I / 5 1.3 Solution II / 7 1.4 Measuring Performance / 12 1.5 Summary and Perspective / 20 2: The Complexity of Algorithms / 25 2.1 The Idea of An Algorithm / 25 2.2 Algorithms For Exponentiation / 27 2.3 Asymptotic Analysis / 35 2.4 Implementation Considerations / 38 2.5 Summary and Perspective / 41 3: Pointers and Dynamic Storage / 49 3.1 Variables and Pointers / 49 3.2 Character Strings and Arrays / 56 3.3 Typedefs and Structures / 66 3.4 Dynamic Storage Allocation / 69 3.5 Summary and Perspective / 72 4: Stacks and Queues / 79 4.1 Two Disciplines For Paying Bills / 79 4.2 The Stack Data Type / 81 4.3 The Queue Data Type / 84 4.4 Example Applications / 89 4.5 Summary and Perspective / 94 5: Linked Lists / 101 5.1 Lists / 101 5.2 Application: Sets / 106 5.3 Miscellaneous Tools For Linked Structures / 117 5.4 Multiply Linked Structures / 123 5.5 Summary and Perspective / 125 6: Memory Organization / 129 6.1 More About Memory / 129 6.2 Variables and the Runtime Stack / 133 6.3 A Simple Heap Management Scheme / 136 6.4 Physical Memory Organization / 139 6.5 Summary and Perspective / 142 Part II: Efficient Algorithms 7: Searching / 149 7.1 Aspects of Searching / 149 7.2 Self-Organizing Linked Lists / 152 7.3 Binary Search / 155 7.4 Binary Trees / 159 7.5 Binary Search Trees / 163 7.6 Summary and Perspective / 170 8: Hashing / 177 8.1 Perfect Hashing / 177 8.2 Collision Resolution Using A Probe Strategy / 179 8.3 Collision Resolution Using Linked Lists / 185 8.4 Summary and Perspective / 186 9: Sorted Lists / 193 9.1 AVL Trees / 194 9.2 2,4 Trees / 200 9.3 Implementation: Red--Black Trees / 205 9.4 Further Topics / 218 9.5 Summary and Perspective / 220 10: Priority Queues / 225 10.1 The Data Type Priority Queue / 226 10.2 Heaps / 227 10.3 Implementation of Heaps / 232 10.4 Huffman Trees / 235 10.5 Other Operations / 240 10.6 Summary and Perspective / 243 11: Sorting / 249 11.1 Settings For Sorting / 249 11.2 Two Simple Sorting Algorithms / 251 11.3 Two Efficient Sorting Algorithms / 255 11.4 Two Useful Sorting Ideas / 262 11.5 Summary and Perspective / 265 12: Applying Data Structures / 271 12.1 Double-Entry Bookkeeping / 271 12.2 Basic Solution / 277 12.3 Solution I / 284 12.4 Solution II / 287 12.5 Summary and Perspective / 289 Part III: Advanced Topics 13: Acyclic Graphs / 297 13.1 Rooted Trees / 297 13.2 Disjoint Sets / 300 13.3 Topological Sorting / 306 13.4 Summary and Perspective / 309 14: Graphs / 313 14.1 Terminology / 313 14.2 Data Structures / 315 14.3 Shortest Paths / 317 14.4 Minimum Spanning Trees / 324 14.5 Traversal Orders and Graph Connectivity / 329 14.6 Summary and Perspective / 337 Appendixes A: C for Programmers / 345 B: Library Functions / 357 C: Our Header File / 365 D: Solutions to Selected Exercises / 367 Index / 377

shortTOC:
Part I: Fundamental Ideas 1: Charting Our Course / 3 2: The Complexity of Algorithms / 25 3: Pointers and Dynamic Storage / 49 4: Stacks and Queues / 79 5: Linked Lists / 101 6: Memory Organization / 129 Part II: Efficient Algorithms 7: Searching / 149 8: Hashing / 177 9: Sorted Lists / 193 10: Priority Queues / 225 11: Sorting / 249 12: Applying Data Structures / 271 Part III: Advanced Topics 13: Acyclic Graphs / 297 14: Graphs / 313 A: C for Programmers / 345 B: Library Functions / 357 C: Our Header File / 365 D: Solutions to Selected Exercises / 367 Index / 377

rawshortTOC:
Part I: Fundamental Ideas \\ 1: Charting Our Course / 3 \\ 2: The Complexity of Algorithms / 25 \\ 3: Pointers and Dynamic Storage / 49 \\ 4: Stacks and Queues / 79 \\ 5: Linked Lists / 101 \\ 6: Memory Organization / 129 \\ Part II: Efficient Algorithms \\ 7: Searching / 149 \\ 8: Hashing / 177 \\ 9: Sorted Lists / 193 \\ 10: Priority Queues / 225 \\ 11: Sorting / 249 \\ 12: Applying Data Structures / 271 \\ Part III: Advanced Topics \\ 13: Acyclic Graphs / 297 \\ 14: Graphs / 313 \\ A: C for Programmers / 345 \\ B: Library Functions / 357 \\ C: Our Header File / 365 \\ D: Solutions to Selected Exercises / 367 \\ Index / 377

rawTOC:
Preface / iii \\ Part I: Fundamental Ideas \\ 1: Charting Our Course / 3 \\ 1.1 Problem: Summarizing Data / 3 \\ 1.2 Solution I / 5 \\ 1.3 Solution II / 7 \\ 1.4 Measuring Performance / 12 \\ 1.5 Summary and Perspective / 20 \\ 2: The Complexity of Algorithms / 25 \\ 2.1 The Idea of An Algorithm / 25 \\ 2.2 Algorithms For Exponentiation / 27 \\ 2.3 Asymptotic Analysis / 35 \\ 2.4 Implementation Considerations / 38 \\ 2.5 Summary and Perspective / 41 \\ 3: Pointers and Dynamic Storage / 49 \\ 3.1 Variables and Pointers / 49 \\ 3.2 Character Strings and Arrays / 56 \\ 3.3 Typedefs and Structures / 66 \\ 3.4 Dynamic Storage Allocation / 69 \\ 3.5 Summary and Perspective / 72 \\ 4: Stacks and Queues / 79 \\ 4.1 Two Disciplines For Paying Bills / 79 \\ 4.2 The Stack Data Type / 81 \\ 4.3 The Queue Data Type / 84 \\ 4.4 Example Applications / 89 \\ 4.5 Summary and Perspective / 94 \\ 5: Linked Lists / 101 \\ 5.1 Lists / 101 \\ 5.2 Application: Sets / 106 \\ 5.3 Miscellaneous Tools For Linked Structures / 117 \\ 5.4 Multiply Linked Structures / 123 \\ 5.5 Summary and Perspective / 125 \\ 6: Memory Organization / 129 \\ 6.1 More About Memory / 129 \\ 6.2 Variables and the Runtime Stack / 133 \\ 6.3 A Simple Heap Management Scheme / 136 \\ 6.4 Physical Memory Organization / 139 \\ 6.5 Summary and Perspective / 142 \\ Part II: Efficient Algorithms \\ 7: Searching / 149 \\ 7.1 Aspects of Searching / 149 \\ 7.2 Self-Organizing Linked Lists / 152 \\ 7.3 Binary Search / 155 \\ 7.4 Binary Trees / 159 \\ 7.5 Binary Search Trees / 163 \\ 7.6 Summary and Perspective / 170 \\ 8: Hashing / 177 \\ 8.1 Perfect Hashing / 177 \\ 8.2 Collision Resolution Using A Probe Strategy / 179 \\ 8.3 Collision Resolution Using Linked Lists / 185 \\ 8.4 Summary and Perspective / 186 \\ 9: Sorted Lists / 193 \\ 9.1 AVL Trees / 194 \\ 9.2 2,4 Trees / 200 \\ 9.3 Implementation: Red--Black Trees / 205 \\ 9.4 Further Topics / 218 \\ 9.5 Summary and Perspective / 220 \\ 10: Priority Queues / 225 \\ 10.1 The Data Type Priority Queue / 226 \\ 10.2 Heaps / 227 \\ 10.3 Implementation of Heaps / 232 \\ 10.4 Huffman Trees / 235 \\ 10.5 Other Operations / 240 \\ 10.6 Summary and Perspective / 243 \\ 11: Sorting / 249 \\ 11.1 Settings For Sorting / 249 \\ 11.2 Two Simple Sorting Algorithms / 251 \\ 11.3 Two Efficient Sorting Algorithms / 255 \\ 11.4 Two Useful Sorting Ideas / 262 \\ 11.5 Summary and Perspective / 265 \\ 12: Applying Data Structures / 271 \\ 12.1 Double-Entry Bookkeeping / 271 \\ 12.2 Basic Solution / 277 \\ 12.3 Solution I / 284 \\ 12.4 Solution II / 287 \\ 12.5 Summary and Perspective / 289 \\ Part III: Advanced Topics \\ 13: Acyclic Graphs / 297 \\ 13.1 Rooted Trees / 297 \\ 13.2 Disjoint Sets / 300 \\ 13.3 Topological Sorting / 306 \\ 13.4 Summary and Perspective / 309 \\ 14: Graphs / 313 \\ 14.1 Terminology / 313 \\ 14.2 Data Structures / 315 \\ 14.3 Shortest Paths / 317 \\ 14.4 Minimum Spanning Trees / 324 \\ 14.5 Traversal Orders and Graph Connectivity / 329 \\ 14.6 Summary and Perspective / 337 \\ Appendixes \\ A: C for Programmers / 345 \\ B: Library Functions / 357 \\ C: Our Header File / 365 \\ D: Solutions to Selected Exercises / 367 \\ Index / 377

entry:
@Book{VanWyk:1988:DSC,
  author =       "Christopher J. {Van Wyk}",
  title =        "Data Structures in {C}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "x + 387",
  year =         "1988",
  ISBN =         "0-201-16116-8",
  ISBN-13 =      "978-0-201-16116-8",
  LCCN =         "QA76.73.C15 V36 1988",
  bibdate =      "Mon Oct 26 07:31:49 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  shorttableofcontents = "Part I: Fundamental Ideas \\
                 1: Charting Our Course / 3 \\
                 2: The Complexity of Algorithms / 25 \\
                 3: Pointers and Dynamic Storage / 49 \\
                 4: Stacks and Queues / 79 \\
                 5: Linked Lists / 101 \\
                 6: Memory Organization / 129 \\
                 Part II: Efficient Algorithms \\
                 7: Searching / 149 \\
                 8: Hashing / 177 \\
                 9: Sorted Lists / 193 \\
                 10: Priority Queues / 225 \\
                 11: Sorting / 249 \\
                 12: Applying Data Structures / 271 \\
                 Part III: Advanced Topics \\
                 13: Acyclic Graphs / 297 \\
                 14: Graphs / 313 \\
                 A: C for Programmers / 345 \\
                 B: Library Functions / 357 \\
                 C: Our Header File / 365 \\
                 D: Solutions to Selected Exercises / 367 \\
                 Index / 377",
  tableofcontents = "Preface / iii \\
                 Part I: Fundamental Ideas \\
                 1: Charting Our Course / 3 \\
                 1.1 Problem: Summarizing Data / 3 \\
                 1.2 Solution I / 5 \\
                 1.3 Solution II / 7 \\
                 1.4 Measuring Performance / 12 \\
                 1.5 Summary and Perspective / 20 \\
                 2: The Complexity of Algorithms / 25 \\
                 2.1 The Idea of An Algorithm / 25 \\
                 2.2 Algorithms For Exponentiation / 27 \\
                 2.3 Asymptotic Analysis / 35 \\
                 2.4 Implementation Considerations / 38 \\
                 2.5 Summary and Perspective / 41 \\
                 3: Pointers and Dynamic Storage / 49 \\
                 3.1 Variables and Pointers / 49 \\
                 3.2 Character Strings and Arrays / 56 \\
                 3.3 Typedefs and Structures / 66 \\
                 3.4 Dynamic Storage Allocation / 69 \\
                 3.5 Summary and Perspective / 72 \\
                 4: Stacks and Queues / 79 \\
                 4.1 Two Disciplines For Paying Bills / 79 \\
                 4.2 The Stack Data Type / 81 \\
                 4.3 The Queue Data Type / 84 \\
                 4.4 Example Applications / 89 \\
                 4.5 Summary and Perspective / 94 \\
                 5: Linked Lists / 101 \\
                 5.1 Lists / 101 \\
                 5.2 Application: Sets / 106 \\
                 5.3 Miscellaneous Tools For Linked Structures / 117 \\
                 5.4 Multiply Linked Structures / 123 \\
                 5.5 Summary and Perspective / 125 \\
                 6: Memory Organization / 129 \\
                 6.1 More About Memory / 129 \\
                 6.2 Variables and the Runtime Stack / 133 \\
                 6.3 A Simple Heap Management Scheme / 136 \\
                 6.4 Physical Memory Organization / 139 \\
                 6.5 Summary and Perspective / 142 \\
                 Part II: Efficient Algorithms \\
                 7: Searching / 149 \\
                 7.1 Aspects of Searching / 149 \\
                 7.2 Self-Organizing Linked Lists / 152 \\
                 7.3 Binary Search / 155 \\
                 7.4 Binary Trees / 159 \\
                 7.5 Binary Search Trees / 163 \\
                 7.6 Summary and Perspective / 170 \\
                 8: Hashing / 177 \\
                 8.1 Perfect Hashing / 177 \\
                 8.2 Collision Resolution Using A Probe Strategy / 179
                 \\
                 8.3 Collision Resolution Using Linked Lists / 185 \\
                 8.4 Summary and Perspective / 186 \\
                 9: Sorted Lists / 193 \\
                 9.1 AVL Trees / 194 \\
                 9.2 2,4 Trees / 200 \\
                 9.3 Implementation: Red--Black Trees / 205 \\
                 9.4 Further Topics / 218 \\
                 9.5 Summary and Perspective / 220 \\
                 10: Priority Queues / 225 \\
                 10.1 The Data Type Priority Queue / 226 \\
                 10.2 Heaps / 227 \\
                 10.3 Implementation of Heaps / 232 \\
                 10.4 Huffman Trees / 235 \\
                 10.5 Other Operations / 240 \\
                 10.6 Summary and Perspective / 243 \\
                 11: Sorting / 249 \\
                 11.1 Settings For Sorting / 249 \\
                 11.2 Two Simple Sorting Algorithms / 251 \\
                 11.3 Two Efficient Sorting Algorithms / 255 \\
                 11.4 Two Useful Sorting Ideas / 262 \\
                 11.5 Summary and Perspective / 265 \\
                 12: Applying Data Structures / 271 \\
                 12.1 Double-Entry Bookkeeping / 271 \\
                 12.2 Basic Solution / 277 \\
                 12.3 Solution I / 284 \\
                 12.4 Solution II / 287 \\
                 12.5 Summary and Perspective / 289 \\
                 Part III: Advanced Topics \\
                 13: Acyclic Graphs / 297 \\
                 13.1 Rooted Trees / 297 \\
                 13.2 Disjoint Sets / 300 \\
                 13.3 Topological Sorting / 306 \\
                 13.4 Summary and Perspective / 309 \\
                 14: Graphs / 313 \\
                 14.1 Terminology / 313 \\
                 14.2 Data Structures / 315 \\
                 14.3 Shortest Paths / 317 \\
                 14.4 Minimum Spanning Trees / 324 \\
                 14.5 Traversal Orders and Graph Connectivity / 329 \\
                 14.6 Summary and Perspective / 337 \\
                 Appendixes \\
                 A: C for Programmers / 345 \\
                 B: Library Functions / 357 \\
                 C: Our Header File / 365 \\
                 D: Solutions to Selected Exercises / 367 \\
                 Index / 377",
}


bibtype: article
filename: master.bib
label: VanWyk:awk
author: Christopher J. Van Wyk
title: AWK as Glue for Programs
journal: j-SPE
volume: 16
number: 4
pages: 369--388
month: apr
monthnumber: 4
year: 1986
bibdate: Mon Oct 26 07:31:34 1998
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1998.10.26 07:31:34 ???
acknowledgement: ack-nhfb
rawauthor: Christopher J. {Van Wyk}
rawtitle: {AWK} as Glue for Programs
entry:
@Article{VanWyk:awk,
  author =       "Christopher J. {Van Wyk}",
  title =        "{AWK} as Glue for Programs",
  journal =      j-SPE,
  volume =       "16",
  number =       "4",
  pages =        "369--388",
  month =        apr,
  year =         "1986",
  bibdate =      "Mon Oct 26 07:31:34 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: article
filename: master.bib
label: VanWyk:ideal
author: Christopher J. Van Wyk
title: A High-Level Language for Specifying Pictures
journal: j-TOG
volume: 1
number: 2
pages: 163--182
month: apr
monthnumber: 4
year: 1982
bibdate: Mon Oct 26 07:31:54 1998
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1998.10.26 07:31:54 ???
acknowledgement: ack-nhfb
rawauthor: Christopher J. {Van Wyk}
rawtitle: A High-Level Language for Specifying Pictures
entry:
@Article{VanWyk:ideal,
  author =       "Christopher J. {Van Wyk}",
  title =        "A High-Level Language for Specifying Pictures",
  journal =      j-TOG,
  volume =       "1",
  number =       "2",
  pages =        "163--182",
  month =        apr,
  year =         "1982",
  bibdate =      "Mon Oct 26 07:31:54 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: article
filename: master.bib
label: Viswanath:2000:RFS
author: Divakar Viswanath
title: Random Fibonacci sequences and the number $ 1.13198824 dots $
journal: j-MATH-COMPUT
volume: 69
number: 231
pages: 1131--1155
month: jul
monthnumber: 7
year: 2000
CODEN: MCMPAF
ISSN: 0025-5718 (print), 1088-6842 (electronic) OR 00255718 (print), 10886842 (electronic)
bibdate: Wed Nov 1 11:50:05 MST 2000
bibsource: http://www.ams.org/mcom/2000-69-231; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2000.11.01 11:50:05 MST
acknowledgement: ack-nhfb
rawauthor: Divakar Viswanath
rawtitle: Random {Fibonacci} sequences and the number $ 1.13198824 \dots $
URL:
http://www.ams.org/journal-getitem?pii=S0025-5718-99-01145-X; http://www.ams.org/mcom/2000-69-231/S0025-5718-99-01145-X/S0025-5718-99-01145-X.dvi; http://www.ams.org/mcom/2000-69-231/S0025-5718-99-01145-X/S0025-5718-99-01145-X.pdf; http://www.ams.org/mcom/2000-69-231/S0025-5718-99-01145-X/S0025-5718-99-01145-X.ps; http://www.ams.org/mcom/2000-69-231/S0025-5718-99-01145-X/S0025-5718-99-01145-X.tex

annote:
This paper generalizes the Fibonacci sequence by replacing the addition rule by a random choice of addition or subtraction; the surprising result is that the terms still grow exponentially, and the absolute value of the $ n^mbox th $ term obtained this way approaches the $ n^mbox th $ power of $ 1.13198824 dots $, a new mathematical constant, for large $n$.

entry:
@Article{Viswanath:2000:RFS,
  author =       "Divakar Viswanath",
  title =        "Random {Fibonacci} sequences and the number $
                 1.13198824 \dots $",
  journal =      j-MATH-COMPUT,
  volume =       "69",
  number =       "231",
  pages =        "1131--1155",
  month =        jul,
  year =         "2000",
  CODEN =        "MCMPAF",
  ISSN =         "0025-5718 (print), 1088-6842 (electronic)",
  bibdate =      "Wed Nov 1 11:50:05 MST 2000",
  bibsource =    "http://www.ams.org/mcom/2000-69-231;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://www.ams.org/journal-getitem?pii=S0025-5718-99-01145-X;
                 http://www.ams.org/mcom/2000-69-231/S0025-5718-99-01145-X/S0025-5718-99-01145-X.dvi;
                 http://www.ams.org/mcom/2000-69-231/S0025-5718-99-01145-X/S0025-5718-99-01145-X.pdf;
                 http://www.ams.org/mcom/2000-69-231/S0025-5718-99-01145-X/S0025-5718-99-01145-X.ps;
                 http://www.ams.org/mcom/2000-69-231/S0025-5718-99-01145-X/S0025-5718-99-01145-X.tex",
  acknowledgement = ack-nhfb,
  annote =       "This paper generalizes the Fibonacci sequence by
                 replacing the addition rule by a random choice of
                 addition or subtraction; the surprising result is that
                 the terms still grow exponentially, and the absolute
                 value of the $ n^{\mbox {th}} $ term obtained this way
                 approaches the $ n^{\mbox {th}} $ power of $ 1.13198824
                 \dots $, a new mathematical constant, for large $n$.",
}


bibtype: book
filename: master.bib
label: vonLaue:2023:HP
author: Max von Laue and Vesselin Petkov and Ralph Oesper
title: History of Physics
publisher: Minkowski Institute Press
address: Montreal, Quebec, Canada
pages: vi + 176
year: 2023
ISBN: 1-998902-01-3 OR 1998902013
ISBN13: 978-1-998902-01-9, 978-1-998902-02-6 OR 9781998902019, 9781998902026
bibdate: Tue Aug 22 17:22:14 MDT 2023
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2023.08.22 17:22:14 MDT
note: English translation of German original booktitle Geschichte der Physik (1946, 1950, 1957).
remark: TO DO: Find table of contents
acknowledgement: ack-nhfb
authordates: Max von Laue (1879--1960); 1879--1960
rawauthor: Max von Laue and Vesselin Petkov and Ralph Oesper
rawnote: English translation of German original \booktitle{Geschichte der Physik} (1946, 1950, 1957).
rawtitle: History of Physics
entry:
@Book{vonLaue:2023:HP,
  author =       "Max von Laue and Vesselin Petkov and Ralph Oesper",
  title =        "History of Physics",
  publisher =    "Minkowski Institute Press",
  address =      "Montr{\'e}al, Qu{\'e}bec, Canada",
  pages =        "vi + 176",
  year =         "2023",
  ISBN =         "1-998902-01-3",
  ISBN-13 =      "978-1-998902-01-9, 978-1-998902-02-6",
  LCCN =         "????",
  bibdate =      "Tue Aug 22 17:22:14 MDT 2023",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "English translation of German original
                 \booktitle{Geschichte der Physik} (1946, 1950, 1957).",
  acknowledgement = ack-nhfb,
  author-dates = "Max von Laue (1879--1960); 1879--1960",
  libnote =      "Not yet in my library.",
  remark =       "TO DO: Find table of contents",
}


bibtype: techreport
filename: master.bib
label: vonNeumann:1945:FDR
author: John von Neumann
title: First Draft of a Report on the EDVAC
institution: University of Pennsylvania
pages: vi + 176
day: 30
month: jun
monthnumber: 6
year: 1945
bibdate: Mon Jun 06 19:17:03 2005
bibtimestamp: 2005.06.06 19:17:03 ???
note: Reprinted in cite [ 8.2]Randell:1982:ODC.
acknowledgement: ack-nhfb
rawauthor: John von Neumann
rawnote: Reprinted in \cite[\S 8.2]{Randell:1982:ODC}.
rawtitle: First Draft of a Report on the {EDVAC}
bibsource:
ftp://ftp.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Ai/alife.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

remark:
This is the report that got von Neumann's name associated with the serial, stored-program, general purpose, digital architecture upon which 99.99% of all computers today are based.

entry:
@TechReport{vonNeumann:1945:FDR,
  author =       "John von Neumann",
  title =        "First Draft of a Report on the {EDVAC}",
  institution =  "University of Pennsylvania",
  day =          "30",
  month =        jun,
  year =         "1945",
  bibdate =      "Mon Jun 06 19:17:03 2005",
  bibsource =    "ftp://ftp.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Ai/alife.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Reprinted in \cite[\S 8.2]{Randell:1982:ODC}.",
  acknowledgement = ack-nhfb,
  remark =       "This is the report that got von Neumann's name
                 associated with the serial, stored-program, general
                 purpose, digital architecture upon which 99.99\% of all
                 computers today are based.",
  xxnote =       "Report prepared for U.S. Army Ordinance Department
                 under Contract W-670-ORD-4926. Reprinted in
                 \cite[pp.~177--246]{Stern:1981:EUA},
                 \cite[pp.~399--413]{Randell:1982:ODC},
                 \cite{vonNeumann:1993:FDR}, and
                 \cite{Laplante:1996:GPC}.",
}


bibtype: book
filename: master.bib
label: vonOstermann:1952:MFL
author: Georg F. von Ostermann
title: Manual of Foreign Languages for the Use of Printers and Translators
publisher: pub-USGPO
address: pub-USGPO:adr
edition: Fourth
pages: xii + 347
year: 1952
LCCN: Z253 .V94 1952
bibdate: Fri Jul 22 11:26:32 1994
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1994.07.22 11:26:32 ???
acknowledgement: ack-nhfb
rawauthor: Georg F. {von Ostermann}
rawtitle: Manual of Foreign Languages for the Use of Printers and Translators
entry:
@Book{vonOstermann:1952:MFL,
  author =       "Georg F. {von Ostermann}",
  title =        "Manual of Foreign Languages for the Use of Printers
                 and Translators",
  publisher =    pub-USGPO,
  address =      pub-USGPO:adr,
  edition =      "Fourth",
  pages =        "xii + 347",
  year =         "1952",
  LCCN =         "Z253 .V94 1952",
  bibdate =      "Fri Jul 22 11:26:32 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  xxISBN =       "none",
}


bibtype: book
filename: master.bib
label: Voss:2012:PL
author: Herbert Voss
title: Presentations with LaTeX : which package, which command, which syntax?
publisher: Lehmanns Media
address: Berlin, Germany
pages: vi + 205
year: 2012
ISBN: 3-86541-496-6 OR 3865414966
ISBN13: 978-3-86541-496-0 OR 9783865414960
bibdate: Tue May 14 11:52:57 MDT 2013
bibtimestamp: 2013.05.14 11:52:57 MDT
series: Dante
acknowledgement: ack-nhfb
rawauthor: Herbert Vo{\ss}
rawtitle: Presentations with {\LaTeX}: which package, which command, which syntax?
TOC:
1: Introduction / 3 1.1 Some history / 3 1.2 Typography and layout / 9 1.3 Text placement and colours / 10 2: tt powerdot / 15 2.1 Document structure / 16 2.2 Parameters / 20 2.3 Slides / 23 2.4 Overlays / 25 2.5 Navigation / 31 2.6 Two-column mode / 32 2.7 Verbatim mode / 34 2.8 Videos and animations / 36 2.9 Available space / 37 2.10 Style file / 38 2.11 Background picture / 43 2.12 Bibliography / 44 2.13 Notes / 46 2.14 Default layouts for tt powerdot / 47 3: Creating custom layouts with tt powerdot / 53 3.1 Definition of a custom document class / 53 3.2 Definition of a custom style file / 57 3.3 Custom navigation and square logo / 59 3.4 Further examples / 62 4: tt beamer / 65 4.1 Document structure / 66 4.2 The structure of a presentation / 71 4.3 Setting parameters / 73 4.4 The title page / 76 4.5 Multiple use of slides / 77 4.6 Overlays / 78 4.7 Environments from standard LaTeX / 88 4.8 Navigation elements / 90 4.9 Animations, sound and films / 91 4.10 Slide transitions / 93 4.11 Text boxes / 95 4.12 Inserting a logo / 98 4.13 Navigation structure / 100 4.14 Multi-column mode / 103 4.15 Hyperlinks / 104 4.16 Lists / 107 4.17 Text styles / 109 4.18 Verbatim mode / 110 4.19 Including figures / 112 4.20 Templates - the heart of tt beamer / 114 4.21 Commands to insert material / 124 4.22 Notes / 125 4.23 Bibliography / 130 4.24 Using two screens / 132 4.25 Output mode / 134 4.26 Tips and tricks / 136 4.27 Default layouts for tt beamer / 139 5: Creating custom layouts with tt beamer / 157 5.1 Defining a custom document class / 158 5.2 Definition of a custom theme / 162 5.3 Additional examples / 165 6: Colours / 169 6.1 Colour definition / 171 6.2 Colour specification / 174 6.3 Use of predefined colours --- named colours / 175 6.4 The background colour and colours in boxes / 179 6.5 Determining colour values / 180 7: Questions and answers / 181 7.1 tt beamer / 181 7.2 tt powerdot / 182 7.3 LaTeX --- General / 182 7.4 Output format / 184 7.5 PSTricks / 188 Bibliography / 191 Index of commands and concepts / 193 People / 206

rawTOC:
1: Introduction / 3 \\ 1.1 Some history / 3 \\ 1.2 Typography and layout / 9 \\ 1.3 Text placement and colours / 10 \\ 2: {\tt powerdot} / 15 \\ 2.1 Document structure / 16 \\ 2.2 Parameters / 20 \\ 2.3 Slides / 23 \\ 2.4 Overlays / 25 \\ 2.5 Navigation / 31 \\ 2.6 Two-column mode / 32 \\ 2.7 Verbatim mode / 34 \\ 2.8 Videos and animations / 36 \\ 2.9 Available space / 37 \\ 2.10 Style file / 38 \\ 2.11 Background picture / 43 \\ 2.12 Bibliography / 44 \\ 2.13 Notes / 46 \\ 2.14 Default layouts for {\tt powerdot} / 47 \\ 3: Creating custom layouts with {\tt powerdot} / 53 \\ 3.1 Definition of a custom document class / 53 \\ 3.2 Definition of a custom style file / 57 \\ 3.3 Custom navigation and square logo / 59 \\ 3.4 Further examples / 62 \\ 4: {\tt beamer} / 65 \\ 4.1 Document structure / 66 \\ 4.2 The structure of a presentation / 71 \\ 4.3 Setting parameters / 73 \\ 4.4 The title page / 76 \\ 4.5 Multiple use of slides / 77 \\ 4.6 Overlays / 78 \\ 4.7 Environments from standard \LaTeX{} / 88 \\ 4.8 Navigation elements / 90 \\ 4.9 Animations, sound and films / 91 \\ 4.10 Slide transitions / 93 \\ 4.11 Text boxes / 95 \\ 4.12 Inserting a logo / 98 \\ 4.13 Navigation structure / 100 \\ 4.14 Multi-column mode / 103 \\ 4.15 Hyperlinks / 104 \\ 4.16 Lists / 107 \\ 4.17 Text styles / 109 \\ 4.18 Verbatim mode / 110 \\ 4.19 Including figures / 112 \\ 4.20 Templates - the heart of {\tt beamer} / 114 \\ 4.21 Commands to insert material / 124 \\ 4.22 Notes / 125 \\ 4.23 Bibliography / 130 \\ 4.24 Using two screens / 132 \\ 4.25 Output mode / 134 \\ 4.26 Tips and tricks / 136 \\ 4.27 Default layouts for {\tt beamer} / 139 \\ 5: Creating custom layouts with {\tt beamer} / 157 \\ 5.1 Defining a custom document class / 158 \\ 5.2 Definition of a custom theme / 162 \\ 5.3 Additional examples / 165 \\ 6: Colours / 169 \\ 6.1 Colour definition / 171 \\ 6.2 Colour specification / 174 \\ 6.3 Use of predefined colours --- named colours / 175 \\ 6.4 The background colour and colours in boxes / 179 \\ 6.5 Determining colour values / 180 \\ 7: Questions and answers / 181 \\ 7.1 {\tt beamer} / 181 \\ 7.2 {\tt powerdot} / 182 \\ 7.3 \LaTeX{} --- General / 182 \\ 7.4 Output format / 184 \\ 7.5 PSTricks / 188 \\ Bibliography / 191 \\ Index of commands and concepts / 193 \\ People / 206

entry:
@Book{Voss:2012:PL,
  author =       "Herbert Vo{\ss}",
  title =        "Presentations with {\LaTeX}: which package, which
                 command, which syntax?",
  publisher =    "Lehmanns Media",
  address =      "Berlin, Germany",
  pages =        "vi + 205",
  year =         "2012",
  ISBN =         "3-86541-496-6",
  ISBN-13 =      "978-3-86541-496-0",
  LCCN =         "????",
  bibdate =      "Tue May 14 11:52:57 MDT 2013",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  series =       "Dante",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Introduction / 3 \\
                 1.1 Some history / 3 \\
                 1.2 Typography and layout / 9 \\
                 1.3 Text placement and colours / 10 \\
                 2: {\tt powerdot} / 15 \\
                 2.1 Document structure / 16 \\
                 2.2 Parameters / 20 \\
                 2.3 Slides / 23 \\
                 2.4 Overlays / 25 \\
                 2.5 Navigation / 31 \\
                 2.6 Two-column mode / 32 \\
                 2.7 Verbatim mode / 34 \\
                 2.8 Videos and animations / 36 \\
                 2.9 Available space / 37 \\
                 2.10 Style file / 38 \\
                 2.11 Background picture / 43 \\
                 2.12 Bibliography / 44 \\
                 2.13 Notes / 46 \\
                 2.14 Default layouts for {\tt powerdot} / 47 \\
                 3: Creating custom layouts with {\tt powerdot} / 53 \\
                 3.1 Definition of a custom document class / 53 \\
                 3.2 Definition of a custom style file / 57 \\
                 3.3 Custom navigation and square logo / 59 \\
                 3.4 Further examples / 62 \\
                 4: {\tt beamer} / 65 \\
                 4.1 Document structure / 66 \\
                 4.2 The structure of a presentation / 71 \\
                 4.3 Setting parameters / 73 \\
                 4.4 The title page / 76 \\
                 4.5 Multiple use of slides / 77 \\
                 4.6 Overlays / 78 \\
                 4.7 Environments from standard \LaTeX{} / 88 \\
                 4.8 Navigation elements / 90 \\
                 4.9 Animations, sound and films / 91 \\
                 4.10 Slide transitions / 93 \\
                 4.11 Text boxes / 95 \\
                 4.12 Inserting a logo / 98 \\
                 4.13 Navigation structure / 100 \\
                 4.14 Multi-column mode / 103 \\
                 4.15 Hyperlinks / 104 \\
                 4.16 Lists / 107 \\
                 4.17 Text styles / 109 \\
                 4.18 Verbatim mode / 110 \\
                 4.19 Including figures / 112 \\
                 4.20 Templates - the heart of {\tt beamer} / 114 \\
                 4.21 Commands to insert material / 124 \\
                 4.22 Notes / 125 \\
                 4.23 Bibliography / 130 \\
                 4.24 Using two screens / 132 \\
                 4.25 Output mode / 134 \\
                 4.26 Tips and tricks / 136 \\
                 4.27 Default layouts for {\tt beamer} / 139 \\
                 5: Creating custom layouts with {\tt beamer} / 157 \\
                 5.1 Defining a custom document class / 158 \\
                 5.2 Definition of a custom theme / 162 \\
                 5.3 Additional examples / 165 \\
                 6: Colours / 169 \\
                 6.1 Colour definition / 171 \\
                 6.2 Colour specification / 174 \\
                 6.3 Use of predefined colours --- named colours / 175
                 \\
                 6.4 The background colour and colours in boxes / 179
                 \\
                 6.5 Determining colour values / 180 \\
                 7: Questions and answers / 181 \\
                 7.1 {\tt beamer} / 181 \\
                 7.2 {\tt powerdot} / 182 \\
                 7.3 \LaTeX{} --- General / 182 \\
                 7.4 Output format / 184 \\
                 7.5 PSTricks / 188 \\
                 Bibliography / 191 \\
                 Index of commands and concepts / 193 \\
                 People / 206",
}


bibtype: book
filename: master.bib
label: Vulis:1992:MTA
author: Michael Vulis
title: Modern TeX and its Applications
publisher: pub-CRC
address: pub-CRC:adr
pages: vii + 294
year: 1992
ISBN: 0-8493-4431-X OR 084934431X
ISBN13: 978-0-8493-4431-2 OR 9780849344312
LCCN: Z253.4.T47V84 1993
bibdate: Wed Dec 15 19:53:27 1993
bibtimestamp: 1993.12.15 19:53:27 ???
acknowledgement: ack-nhfb
rawauthor: Michael Vulis
rawtitle: Modern {\TeX} and its Applications
abstract:
An essential new guide for TeX users TeX is a powerful typesetting language and processing environment developed by Professor Donald Knuth at Stanford University in the early 1980s. Its machine-independence has made it a defacto standard for text processing with microcomputers throughout the scientific and engineering communities. While there have been several TeX -based macro packages developed over the years, Modern TeX and its Applications focuses on the original macro package designed by Knuth upon which all other TeX programs are based-Plain TeX . All of the basic topics for understanding the TeX user environment are covered, including fonts and characters, formatting, math mode, macros, terminal and file operations, tables, and foreign language capabilities. A PC-compatible disk containing examples, extra typefaces and even a ready-to-run restricted version of TeX is included with the book. Modern TeX and its Applications is an essential guide for all scientists, engineers, technicians, and support staff who prepare technical text and documents using a version of TeX .

TOC:
1: Introduction 2: Fonts and Characters 3: Formatting 4: Math Mode 5: Variables, Dimensions, Glue 6: Macros 7: Input/Output and Extensions 8: Modes, Rules, Boxes 9: Tabulation and Tables 10: Font Rotation 11: Appendix 12: Index

rawabstract:
An essential new guide for \TeX{} users \TeX{} is a powerful typesetting language and processing environment developed by Professor Donald Knuth at Stanford University in the early 1980s. Its machine-independence has made it a defacto standard for text processing with microcomputers throughout the scientific and engineering communities. While there have been several \TeX{}-based macro packages developed over the years, Modern \TeX{} and its Applications focuses on the original macro package designed by Knuth upon which all other \TeX{} programs are based-Plain \TeX{}. All of the basic topics for understanding the \TeX{} user environment are covered, including fonts and characters, formatting, math mode, macros, terminal and file operations, tables, and foreign language capabilities. A PC-compatible disk containing examples, extra typefaces and even a ready-to-run restricted version of \TeX{} is included with the book. Modern \TeX{} and its Applications is an essential guide for all scientists, engineers, technicians, and support staff who prepare technical text and documents using a version of \TeX{}.

rawTOC:
1: Introduction \\ 2: Fonts and Characters \\ 3: Formatting \\ 4: Math Mode \\ 5: Variables, Dimensions, Glue \\ 6: Macros \\ 7: Input/Output and Extensions \\ 8: Modes, Rules, Boxes \\ 9: Tabulation and Tables \\ 10: Font Rotation \\ 11: Appendix \\ 12: Index

entry:
@Book{Vulis:1992:MTA,
  author =       "Michael Vulis",
  title =        "Modern {\TeX} and its Applications",
  publisher =    pub-CRC,
  address =      pub-CRC:adr,
  pages =        "vii + 294",
  year =         "1992",
  ISBN =         "0-8493-4431-X",
  ISBN-13 =      "978-0-8493-4431-2",
  LCCN =         "Z253.4.T47V84 1993",
  bibdate =      "Wed Dec 15 19:53:27 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  price =        "US\$32.95",
  abstract =     "An essential new guide for \TeX{} users \TeX{} is a
                 powerful typesetting language and processing
                 environment developed by Professor Donald Knuth at
                 Stanford University in the early 1980s. Its
                 machine-independence has made it a defacto standard for
                 text processing with microcomputers throughout the
                 scientific and engineering communities. While there
                 have been several \TeX{}-based macro packages developed
                 over the years, Modern \TeX{} and its Applications
                 focuses on the original macro package designed by Knuth
                 upon which all other \TeX{} programs are based-Plain
                 \TeX{}. All of the basic topics for understanding the
                 \TeX{} user environment are covered, including fonts
                 and characters, formatting, math mode, macros, terminal
                 and file operations, tables, and foreign language
                 capabilities. A PC-compatible disk containing examples,
                 extra typefaces and even a ready-to-run restricted
                 version of \TeX{} is included with the book. Modern
                 \TeX{} and its Applications is an essential guide for
                 all scientists, engineers, technicians, and support
                 staff who prepare technical text and documents using a
                 version of \TeX{}.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Introduction \\
                 2: Fonts and Characters \\
                 3: Formatting \\
                 4: Math Mode \\
                 5: Variables, Dimensions, Glue \\
                 6: Macros \\
                 7: Input/Output and Extensions \\
                 8: Modes, Rules, Boxes \\
                 9: Tabulation and Tables \\
                 10: Font Rotation \\
                 11: Appendix \\
                 12: Index",
}


bibtype: book
filename: master.bib
label: Wadleigh:2000:SOH
author: Kevin R. Wadleigh and Isom L. Crawford
title: Software Optimization for High Performance Computing: Creating Faster Applications
publisher: pub-PHPTR
address: pub-PHPTR:adr
pages: xxxi + 377
year: 2000
ISBN: 0-13-017008-9 OR 0130170089
ISBN13: 978-0-13-017008-8 OR 9780130170088
LCCN: QA76.76.D47 W34 2000
bibdate: Mon Jul 23 17:56:54 2001
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2001.07.23 17:56:54 ???
URL: http://vig.prenhall.com/catalog/academic/product/1,4096,0130170089,00.html
acknowledgement: ack-nhfb
rawauthor: Kevin R. Wadleigh and Isom L. Crawford
rawtitle: Software Optimization for High Performance Computing: Creating Faster Applications
abstract:
Aimed at programmers who want to get high-performance from the software they write, this text provides a hands-on book for high-performance code and algorithm optimization.

TOC:
1: Introduction 2: Processors: The Core of High Performance Computing 3: Data Storage 4: An Overview of Parallel Processing 5: How the Compiler Can Help and Hinder Performance 6: Predicting and Measuring Performance 7: Is High Performance Computing Language Dependent? 8: Parallel Processing An Algorithmic Approach 9: High Performance Libraries 10: Mathematical Kernels: The Building Blocks of High Performance 11: Faster Solutions for Systems of Equations 12: High Performance Algorithms and Approaches for Signal Processing

rawabstract:
Aimed at programmers who want to get high-performance from the software they write, this text provides a hands-on book for high-performance code and algorithm optimization.

rawTOC:
1: Introduction \\ 2: Processors: The Core of High Performance Computing \\ 3: Data Storage \\ 4: An Overview of Parallel Processing \\ 5: How the Compiler Can Help and Hinder Performance \\ 6: Predicting and Measuring Performance \\ 7: Is High Performance Computing Language Dependent? \\ 8: Parallel Processing \\ An Algorithmic Approach \\ 9: High Performance Libraries \\ 10: Mathematical Kernels: The Building Blocks of High Performance \\ 11: Faster Solutions for Systems of Equations \\ 12: High Performance Algorithms and Approaches for Signal Processing

entry:
@Book{Wadleigh:2000:SOH,
  author =       "Kevin R. Wadleigh and Isom L. Crawford",
  title =        "Software Optimization for High Performance Computing:
                 Creating Faster Applications",
  publisher =    pub-PHPTR,
  address =      pub-PHPTR:adr,
  pages =        "xxxi + 377",
  year =         "2000",
  ISBN =         "0-13-017008-9",
  ISBN-13 =      "978-0-13-017008-8",
  LCCN =         "QA76.76.D47 W34 2000",
  bibdate =      "Mon Jul 23 17:56:54 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$45.00",
  URL =          "http://vig.prenhall.com/catalog/academic/product/1,4096,0130170089,00.html",
  abstract =     "Aimed at programmers who want to get high-performance
                 from the software they write, this text provides a
                 hands-on book for high-performance code and algorithm
                 optimization.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Introduction \\
                 2: Processors: The Core of High Performance Computing
                 \\
                 3: Data Storage \\
                 4: An Overview of Parallel Processing \\
                 5: How the Compiler Can Help and Hinder Performance \\
                 6: Predicting and Measuring Performance \\
                 7: Is High Performance Computing Language Dependent?
                 \\
                 8: Parallel Processing \\
                 An Algorithmic Approach \\
                 9: High Performance Libraries \\
                 10: Mathematical Kernels: The Building Blocks of High
                 Performance \\
                 11: Faster Solutions for Systems of Equations \\
                 12: High Performance Algorithms and Approaches for
                 Signal Processing",
}


bibtype: book
filename: master.bib
label: Waldrop:2001:DMJ
author: M. Mitchell Waldrop
title: The Dream Machine: J. C. R. Licklider and the Revolution That Made Computing Personal
publisher: pub-VIKING
address: pub-VIKING:adr
pages: 502
year: 2001
ISBN: 0-670-89976-3 OR 0670899763
ISBN13: 978-0-670-89976-0 OR 9780670899760
LCCN: QA76.17 .W35 2001
bibdate: Wed Dec 2 16:12:53 MST 2009
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2009.12.02 16:12:53 MST
series: The Sloan technology series
URL: http://www.loc.gov/catdir/toc/fy031/2001017985.html
subject: Licklider, J. C. R; Microcomputers; History
acknowledgement: ack-nhfb
rawauthor: M. Mitchell Waldrop
rawtitle: The Dream Machine: {J. C. R. Licklider} and the Revolution That Made Computing Personal
TOC:
Prologue: Tracy's Dad / 1 1: Missouri Boys / 7 2: The Last Transition / 24 3: New Kinds of People / 66 4: The Freedom to Make Mistakes / 99 5: The Tale of the Fig Tree and the Wasp / 142 6: The Phenomena Surrounding Computers / 196 7: The Intergalactic Network / 259 8: Living in the Future / 333 9: Lick's Kids / 411

rawTOC:
Prologue: Tracy's Dad / 1 \\ 1: Missouri Boys / 7 \\ 2: The Last Transition / 24 \\ 3: New Kinds of People / 66 \\ 4: The Freedom to Make Mistakes / 99 \\ 5: The Tale of the Fig Tree and the Wasp / 142 \\ 6: The Phenomena Surrounding Computers / 196 \\ 7: The Intergalactic Network / 259 \\ 8: Living in the Future / 333 \\ 9: Lick's Kids / 411

entry:
@Book{Waldrop:2001:DMJ,
  author =       "M. Mitchell Waldrop",
  title =        "The Dream Machine: {J. C. R. Licklider} and the
                 Revolution That Made Computing Personal",
  publisher =    pub-VIKING,
  address =      pub-VIKING:adr,
  pages =        "502",
  year =         "2001",
  ISBN =         "0-670-89976-3",
  ISBN-13 =      "978-0-670-89976-0",
  LCCN =         "QA76.17 .W35 2001",
  bibdate =      "Wed Dec 2 16:12:53 MST 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "The Sloan technology series",
  URL =          "http://www.loc.gov/catdir/toc/fy031/2001017985.html",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "Licklider, J. C. R; Microcomputers; History",
  tableofcontents = "Prologue: Tracy's Dad / 1 \\
                 1: Missouri Boys / 7 \\
                 2: The Last Transition / 24 \\
                 3: New Kinds of People / 66 \\
                 4: The Freedom to Make Mistakes / 99 \\
                 5: The Tale of the Fig Tree and the Wasp / 142 \\
                 6: The Phenomena Surrounding Computers / 196 \\
                 7: The Intergalactic Network / 259 \\
                 8: Living in the Future / 333 \\
                 9: Lick's Kids / 411",
}


bibtype: book
filename: master.bib
label: Walker:2003:SES
author: Gabrielle Walker
title: Snowball Earth: the Story of the Great Global Catastrophe That Spawned Life as We Know It
publisher: Crown Publishers
address: New York, NY, USA
pages: xiii + 269
year: 2003
ISBN: 0-609-60973-4 (hardcover), 1-4000-5125-8 OR 0609609734 (hardcover), 1400051258
ISBN13: 978-0-609-60973-6 (hardcover), 978-1-4000-5125-0 OR 9780609609736 (hardcover), 9781400051250
LCCN: QE507 .W35 2003
bibdate: Sat Jun 9 16:56:29 MDT 2018
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2018.06.09 16:56:29 MDT
acknowledgement: ack-nhfb
rawauthor: Gabrielle Walker
rawtitle: {Snowball Earth}: the Story of the Great Global Catastrophe That Spawned Life as We Know It
abstract:
Did the Earth once undergo a super ice age, one that froze the entire planet from the poles to the equator? In booktitle Snowball Earth, gifted writer Gabrielle Walker has crafted an intriguing global adventure story, following maverick scientist Paul Hoffman's quest to prove a theory so audacious and profound that it is shaking the world of earth sciences to its core. In lyrical prose that brings each remote and alluring locale vividly to life, Walker takes us on a thrilling natural history expedition to witness firsthand the supporting evidence Hoffman has pieced together. That evidence, he argues, shows that 700 million years ago the Earth did indeed freeze over completely, becoming a giant ``snowball'', in the worst climatic catastrophe in history. Even more startling is his assertion that, instead of ending life on Earth, this global deep freeze was the trigger for the Cambrian Explosion, the hitherto unexplained moment in geological time when a glorious profusion of complex life forms first emerged from the primordial ooze. In a story full of intellectual intrigue, we follow the irascible but brilliant Hoffman and a supporting cast of intrepid geologists as they scour the planet, uncovering clue after surprising clue. We travel to a primeval lagoon at Shark Bay in western Australia, where dolphins cavort with swimmers every morning at seven and ``living rocks'' sprout out of the water like broccoli heads; to the desolate and forbidding ice fields of a tiny Arctic archipelago seven hundred miles north of Norway; to the surprising fossil beds that decorate Newfoundland's foggy and windswept coastline; and on to the superheated salt pans of California's Death Valley. Through the contours of these rich and varied landscapes Walker teaches us to read the traces of geological time with expert eyes, and we marvel at the stunning feats of resilience and renewal our remarkable planet is capable of. booktitle Snowball Earth is science writing at its most gripping and enlightening.

subject:
Snowball Earth (Geology); Paleoclimatology; Proterozoic; Life; Origin; Origin; Paleoclimatology; Proterozoic Geologic Period; Snowball Earth (Geology)

TOC:
1: First Fumblings 2: The Sheltering Desert 3: In the Beginning 4: Magnetic Moments 5: Eureka 6: On the Road 7: Down Under 8: Snowbrawls 9: Creation 10: Ever Again Epilogue Notes and Suggestions for Further Reading Index

rawabstract:
Did the Earth once undergo a super ice age, one that froze the entire planet from the poles to the equator? In \booktitle{Snowball Earth}, gifted writer Gabrielle Walker has crafted an intriguing global adventure story, following maverick scientist Paul Hoffman's quest to prove a theory so audacious and profound that it is shaking the world of earth sciences to its core. In lyrical prose that brings each remote and alluring locale vividly to life, Walker takes us on a thrilling natural history expedition to witness firsthand the supporting evidence Hoffman has pieced together. That evidence, he argues, shows that 700 million years ago the Earth did indeed freeze over completely, becoming a giant ``snowball'', in the worst climatic catastrophe in history. Even more startling is his assertion that, instead of ending life on Earth, this global deep freeze was the trigger for the Cambrian Explosion, the hitherto unexplained moment in geological time when a glorious profusion of complex life forms first emerged from the primordial ooze. In a story full of intellectual intrigue, we follow the irascible but brilliant Hoffman and a supporting cast of intrepid geologists as they scour the planet, uncovering clue after surprising clue. We travel to a primeval lagoon at Shark Bay in western Australia, where dolphins cavort with swimmers every morning at seven and ``living rocks'' sprout out of the water like broccoli heads; to the desolate and forbidding ice fields of a tiny Arctic archipelago seven hundred miles north of Norway; to the surprising fossil beds that decorate Newfoundland's foggy and windswept coastline; and on to the superheated salt pans of California's Death Valley. Through the contours of these rich and varied landscapes Walker teaches us to read the traces of geological time with expert eyes, and we marvel at the stunning feats of resilience and renewal our remarkable planet is capable of. \booktitle{Snowball Earth} is science writing at its most gripping and enlightening.

rawTOC:
1: First Fumblings \\ 2: The Sheltering Desert \\ 3: In the Beginning \\ 4: Magnetic Moments \\ 5: Eureka \\ 6: On the Road \\ 7: Down Under \\ 8: Snowbrawls \\ 9: Creation \\ 10: Ever Again \\ Epilogue \\ Notes and Suggestions for Further Reading \\ Index

entry:
@Book{Walker:2003:SES,
  author =       "Gabrielle Walker",
  title =        "{Snowball Earth}: the Story of the Great Global
                 Catastrophe That Spawned Life as We Know It",
  publisher =    "Crown Publishers",
  address =      "New York, NY, USA",
  pages =        "xiii + 269",
  year =         "2003",
  ISBN =         "0-609-60973-4 (hardcover), 1-4000-5125-8",
  ISBN-13 =      "978-0-609-60973-6 (hardcover), 978-1-4000-5125-0",
  LCCN =         "QE507 .W35 2003",
  bibdate =      "Sat Jun 9 16:56:29 MDT 2018",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Did the Earth once undergo a super ice age, one that
                 froze the entire planet from the poles to the equator?
                 In \booktitle{Snowball Earth}, gifted writer Gabrielle
                 Walker has crafted an intriguing global adventure
                 story, following maverick scientist Paul Hoffman's
                 quest to prove a theory so audacious and profound that
                 it is shaking the world of earth sciences to its core.
                 In lyrical prose that brings each remote and alluring
                 locale vividly to life, Walker takes us on a thrilling
                 natural history expedition to witness firsthand the
                 supporting evidence Hoffman has pieced together. That
                 evidence, he argues, shows that 700 million years ago
                 the Earth did indeed freeze over completely, becoming a
                 giant ``snowball'', in the worst climatic catastrophe
                 in history. Even more startling is his assertion that,
                 instead of ending life on Earth, this global deep
                 freeze was the trigger for the Cambrian Explosion, the
                 hitherto unexplained moment in geological time when a
                 glorious profusion of complex life forms first emerged
                 from the primordial ooze. In a story full of
                 intellectual intrigue, we follow the irascible but
                 brilliant Hoffman and a supporting cast of intrepid
                 geologists as they scour the planet, uncovering clue
                 after surprising clue. We travel to a primeval lagoon
                 at Shark Bay in western Australia, where dolphins
                 cavort with swimmers every morning at seven and
                 ``living rocks'' sprout out of the water like broccoli
                 heads; to the desolate and forbidding ice fields of a
                 tiny Arctic archipelago seven hundred miles north of
                 Norway; to the surprising fossil beds that decorate
                 Newfoundland's foggy and windswept coastline; and on to
                 the superheated salt pans of California's Death Valley.
                 Through the contours of these rich and varied
                 landscapes Walker teaches us to read the traces of
                 geological time with expert eyes, and we marvel at the
                 stunning feats of resilience and renewal our remarkable
                 planet is capable of. \booktitle{Snowball Earth} is
                 science writing at its most gripping and
                 enlightening.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Snowball Earth (Geology); Paleoclimatology;
                 Proterozoic; Life; Origin; Origin; Paleoclimatology;
                 Proterozoic Geologic Period; Snowball Earth (Geology)",
  tableofcontents = "1: First Fumblings \\
                 2: The Sheltering Desert \\
                 3: In the Beginning \\
                 4: Magnetic Moments \\
                 5: Eureka \\
                 6: On the Road \\
                 7: Down Under \\
                 8: Snowbrawls \\
                 9: Creation \\
                 10: Ever Again \\
                 Epilogue \\
                 Notes and Suggestions for Further Reading \\
                 Index",
}


bibtype: misc
filename: master.bib
label: Wall:perl
author: Larry Wall
title: perl: Practical Extraction and Report Language
pages: xiii + 269
year: 1987
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
note: Electronic mail: path |lwall@jpl-devvax.jpl.nasa.gov|.
acknowledgement: ack-nhfb
howpublished: Usenet path |mod.sources| archives
rawauthor: Larry Wall
rawnote: Electronic mail: \path|lwall@jpl-devvax.jpl.nasa.gov|.
rawtitle: perl: Practical Extraction and Report Language
entry:
@Misc{Wall:perl,
  author =       "Larry Wall",
  title =        "perl: Practical Extraction and Report Language",
  howpublished = "Usenet \path|mod.sources| archives",
  year =         "1987",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Electronic mail:
                 \path|lwall@jpl-devvax.jpl.nasa.gov|.",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Wallis:1982:PP
author: Peter J. L. Wallis
title: Portable Programming
publisher: pub-WILEY
address: pub-WILEY:adr
pages: xiv + 141
year: 1982
ISBN: 0-470-27331-3 OR 0470273313
ISBN13: 978-0-470-27331-9 OR 9780470273319
LCCN: QA76.6.W329 1982
bibdate: Wed Dec 15 10:58:59 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 10:58:59 ???
acknowledgement: ack-nhfb
rawauthor: Peter J. L. Wallis
rawtitle: Portable Programming
entry:
@Book{Wallis:1982:PP,
  author =       "Peter J. L. Wallis",
  title =        "Portable Programming",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xiv + 141",
  year =         "1982",
  ISBN =         "0-470-27331-3",
  ISBN-13 =      "978-0-470-27331-9",
  LCCN =         "QA76.6.W329 1982",
  bibdate =      "Wed Dec 15 10:58:59 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Walsh:1975:MO
author: G. R. Walsh
title: Methods of Optimization
publisher: pub-WILEY
address: pub-WILEY:adr
pages: x + 200
year: 1975
LCCN: QA402.5 .W341
bibdate: Wed Dec 15 10:59:00 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 10:59:00 ???
acknowledgement: ack-nhfb
rawauthor: G. R. Walsh
rawtitle: Methods of Optimization
ISBN:
0-471-91922-5 (hardcover), 0-471-91924-1 (paperback) OR 0471919225 (hardcover), 0471919241 (paperback)

ISBN13:
978-0-471-91922-3 (hardcover), 978-0-471-91924-7 (paperback) OR 9780471919223 (hardcover), 9780471919247 (paperback)

TOC:
1 Introduction / 1 1.1 What is optimization? / 1 1.2 Statement of the problem / 3 1.3 Classical optimization / 6 1.4 Classical treatment of inequality constraints / 16 1.5 The Lagrangian function and duality / 20 1.6 Convex and concave functions / 22 Summary / 31 Exercises / 31 2 Nonlinear Programming / 35 21 Introduction / 35 2.2 Kuhn--Tucker necessary conditions / 35 2.3 Saddle-point property of the Lagrangian function / 39 2.4 The constraint qualification / 44 2.5 Quadratic programming: Wolfe's algorithm / 51 2.6 Further discussion of Wolfe's algorithm / 58 2.7 Quadratic programming and duality / 60 2.8 Griffith and Stewart's method / 64 Summary / 70 Exercises / 71 3 Search Methods for Unconstrained Optimization / 74 3.1 Introduction / 74 3.2 Grid search / 75 3.3 Hooke and Jeeves' method / 76 3.4 Spendley, Hext and Himsworth's method / 79 3.5 Nelder and Mead's method / 81 3.6 Fibonacci search / 84 3.7 Golden Section search / 91 3.8 Powell's quadratic interpolation method / 93 3.9 Davidon's cubic interpolation method / 97 Summary / 102 Exercises / 102 4 Gradient Methods for Unconstrained Optimization / 105 4.1 Introduction / 105 4.2 Method of steepest descent / 106 4.3 The Newton--Raphson method / 108 4.4 The Davidon--Fletcher--Powell method / 110 4.5 The complementary DFP formula / 117 4.6 Conjugate directions / 120 4.7 The Fletcher--Reeves method / 123 4.8 Smith's method / 126 4.9 Powell's method / 129 4.10 Choice of method / 138 Summary / 140 Exercises / 140 5 Constrained Optimization / 143 5.1 Introduction / 143 5.2 Hemstitching / 144 5.3 The gradient projection method / 146 5.4 Penalty functions / 148 5.5 Sequential unconstrained minimization technique (SUMT) / 150 5.6 The DFP method with linear constraints / 155 Summary / 160 Exercises / 161 6 Dynamic Programming / 164 6.1 Introduction / 164 6.2 The allocation problem / 165 6.3 Oriented networks / 170 6.4 Non-oriented networks / 173 6.5 The farmer's problem / 177 6.6 Scheduling problems / 181 Summary / 184 Exercises / 185 References / 188 Suggestions for Further Reading / 192 Answers to Exercises / 193 Index 197

shortTOC:
1: Introduction 2: Nonlinear programming 3: Search methods for unconstrainned optimization 4: Gradient methods for unconstrained optimization 5: Constrained optimization 6: Dynamic programming

rawshortTOC:
1: Introduction \\ 2: Nonlinear programming \\ 3: Search methods for unconstrainned optimization \\ 4: Gradient methods for unconstrained optimization \\ 5: Constrained optimization \\ 6: Dynamic programming

rawTOC:
1 Introduction / 1 \\ 1.1 What is optimization? / 1 \\ 1.2 Statement of the problem / 3 \\ 1.3 Classical optimization / 6 \\ 1.4 Classical treatment of inequality constraints / 16 \\ 1.5 The Lagrangian function and duality / 20 \\ 1.6 Convex and concave functions / 22 \\ Summary / 31 \\ Exercises / 31 \\ 2 Nonlinear Programming / 35 \\ 21 Introduction / 35 \\ 2.2 Kuhn--Tucker necessary conditions / 35 \\ 2.3 Saddle-point property of the Lagrangian function / 39 \\ 2.4 The constraint qualification / 44 \\ 2.5 Quadratic programming: Wolfe's algorithm / 51 \\ 2.6 Further discussion of Wolfe's algorithm / 58 \\ 2.7 Quadratic programming and duality / 60 \\ 2.8 Griffith and Stewart's method / 64 \\ Summary / 70 \\ Exercises / 71 \\ 3 Search Methods for Unconstrained Optimization / 74 \\ 3.1 Introduction / 74 \\ 3.2 Grid search / 75 \\ 3.3 Hooke and Jeeves' method / 76 \\ 3.4 Spendley, Hext and Himsworth's method / 79 \\ 3.5 Nelder and Mead's method / 81 \\ 3.6 Fibonacci search / 84 \\ 3.7 Golden Section search / 91 \\ 3.8 Powell's quadratic interpolation method / 93 \\ 3.9 Davidon's cubic interpolation method / 97 \\ Summary / 102 \\ Exercises / 102 \\ 4 Gradient Methods for Unconstrained Optimization / 105 \\ 4.1 Introduction / 105 \\ 4.2 Method of steepest descent / 106 \\ 4.3 The Newton--Raphson method / 108 \\ 4.4 The Davidon--Fletcher--Powell method / 110 \\ 4.5 The complementary DFP formula / 117 \\ 4.6 Conjugate directions / 120 \\ 4.7 The Fletcher--Reeves method / 123 \\ 4.8 Smith's method / 126 \\ 4.9 Powell's method / 129 \\ 4.10 Choice of method / 138 \\ Summary / 140 \\ Exercises / 140 \\ 5 Constrained Optimization / 143 \\ 5.1 Introduction / 143 \\ 5.2 Hemstitching / 144 \\ 5.3 The gradient projection method / 146 \\ 5.4 Penalty functions / 148 \\ 5.5 Sequential unconstrained minimization technique (SUMT) / 150 \\ 5.6 The DFP method with linear constraints / 155 \\ Summary / 160 \\ Exercises / 161 \\ 6 Dynamic Programming / 164 \\ 6.1 Introduction / 164 \\ 6.2 The allocation problem / 165 \\ 6.3 Oriented networks / 170 \\ 6.4 Non-oriented networks / 173 \\ 6.5 The farmer's problem / 177 \\ 6.6 Scheduling problems / 181 \\ Summary / 184 \\ Exercises / 185 \\ References / 188 \\ Suggestions for Further Reading / 192 \\ Answers to Exercises / 193 \\ Index 197

entry:
@Book{Walsh:1975:MO,
  author =       "G. R. Walsh",
  title =        "Methods of Optimization",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "x + 200",
  year =         "1975",
  ISBN =         "0-471-91922-5 (hardcover), 0-471-91924-1 (paperback)",
  ISBN-13 =      "978-0-471-91922-3 (hardcover), 978-0-471-91924-7
                 (paperback)",
  LCCN =         "QA402.5 .W341",
  bibdate =      "Wed Dec 15 10:59:00 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "1: Introduction \\
                 2: Nonlinear programming \\
                 3: Search methods for unconstrainned optimization \\
                 4: Gradient methods for unconstrained optimization \\
                 5: Constrained optimization \\
                 6: Dynamic programming",
  tableofcontents = "1 Introduction / 1 \\
                 1.1 What is optimization? / 1 \\
                 1.2 Statement of the problem / 3 \\
                 1.3 Classical optimization / 6 \\
                 1.4 Classical treatment of inequality constraints / 16
                 \\
                 1.5 The Lagrangian function and duality / 20 \\
                 1.6 Convex and concave functions / 22 \\
                 Summary / 31 \\
                 Exercises / 31 \\
                 2 Nonlinear Programming / 35 \\
                 21 Introduction / 35 \\
                 2.2 Kuhn--Tucker necessary conditions / 35 \\
                 2.3 Saddle-point property of the Lagrangian function /
                 39 \\
                 2.4 The constraint qualification / 44 \\
                 2.5 Quadratic programming: Wolfe's algorithm / 51 \\
                 2.6 Further discussion of Wolfe's algorithm / 58 \\
                 2.7 Quadratic programming and duality / 60 \\
                 2.8 Griffith and Stewart's method / 64 \\
                 Summary / 70 \\
                 Exercises / 71 \\
                 3 Search Methods for Unconstrained Optimization / 74
                 \\
                 3.1 Introduction / 74 \\
                 3.2 Grid search / 75 \\
                 3.3 Hooke and Jeeves' method / 76 \\
                 3.4 Spendley, Hext and Himsworth's method / 79 \\
                 3.5 Nelder and Mead's method / 81 \\
                 3.6 Fibonacci search / 84 \\
                 3.7 Golden Section search / 91 \\
                 3.8 Powell's quadratic interpolation method / 93 \\
                 3.9 Davidon's cubic interpolation method / 97 \\
                 Summary / 102 \\
                 Exercises / 102 \\
                 4 Gradient Methods for Unconstrained Optimization / 105
                 \\
                 4.1 Introduction / 105 \\
                 4.2 Method of steepest descent / 106 \\
                 4.3 The Newton--Raphson method / 108 \\
                 4.4 The Davidon--Fletcher--Powell method / 110 \\
                 4.5 The complementary DFP formula / 117 \\
                 4.6 Conjugate directions / 120 \\
                 4.7 The Fletcher--Reeves method / 123 \\
                 4.8 Smith's method / 126 \\
                 4.9 Powell's method / 129 \\
                 4.10 Choice of method / 138 \\
                 Summary / 140 \\
                 Exercises / 140 \\
                 5 Constrained Optimization / 143 \\
                 5.1 Introduction / 143 \\
                 5.2 Hemstitching / 144 \\
                 5.3 The gradient projection method / 146 \\
                 5.4 Penalty functions / 148 \\
                 5.5 Sequential unconstrained minimization technique
                 (SUMT) / 150 \\
                 5.6 The DFP method with linear constraints / 155 \\
                 Summary / 160 \\
                 Exercises / 161 \\
                 6 Dynamic Programming / 164 \\
                 6.1 Introduction / 164 \\
                 6.2 The allocation problem / 165 \\
                 6.3 Oriented networks / 170 \\
                 6.4 Non-oriented networks / 173 \\
                 6.5 The farmer's problem / 177 \\
                 6.6 Scheduling problems / 181 \\
                 Summary / 184 \\
                 Exercises / 185 \\
                 References / 188 \\
                 Suggestions for Further Reading / 192 \\
                 Answers to Exercises / 193 \\
                 Index 197",
}


bibtype: book
filename: master.bib
label: Walsh:1994:MTW
author: Norman Walsh
title: Making TeX Work
publisher: pub-ORA
address: pub-ORA:adr
pages: xxxvi + 483
year: 1994
ISBN: 1-56592-051-1 OR 1565920511
ISBN13: 978-1-56592-051-4 OR 9781565920514
LCCN: TK5105.875.I57 M36 1994; Z253.4.T47 W34 1994
bibdate: Thu May 12 08:24:59 1994
bibtimestamp: 1994.05.12 08:24:59 ???
URL: ftp://ftp.ora.com/pub/products/catalogs/book.catalog; http://www.oreilly.com/catalog/9781565920514
acknowledgement: ack-nhfb
rawauthor: Norman Walsh
rawtitle: Making {\TeX} Work
bibsource:
https://www.math.utah.edu/pub/tex/bib/css.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/ora.bib; https://www.math.utah.edu/pub/tex/bib/texbook3.bib

note:
Written specifically for database maintainers and system administrators, this Unix-based technical guide covers installing, setting up, and running Internet applications such as gopher holes, FTP and telnet sites, mailing lists, WAIS, and World Wide Web pages, and other sites, as well as keeping them secure.

abstract:
TeX is a powerful tool for creating professional quality typeset text and is unsurpassed at typesetting mathematical equations, scientific text, and multiple languages. Many books describe how you use TeX to construct sentences, paragraphs, and chapters. Until now, no book has described all the software that actually lets you build, run, and use TeX to best advantage on your platform. Because creating a TeX document requires the use of many tools, this lack of information is a serious problem for TeX users. TeX is increasing in popularity, and the need for information is becoming more critical. Many technical journals now request that articles be submitted in TeX. TeX is also playing an increasing role in the Standard Generalized Markup Language (SGML) environment. TeX's portability and flexibility -- not to mention the fact that it is free -- are also making it the typesetting tool of choice for interchange between hardware and software platforms and for international exchange. Yet, despite this growing interest in TeX, TeX users everywhere are having to ``reinvent the wheel'' by wrestling with TeX's many tools and files on their own. Making TeX Workguides you through the maze of tools available in the overall TeX system. Beyond the core TeX program there are myriad drivers, macro packages, previewers, printing programs, online documentation facilities, graphics programs, and more. This book describes them all. It covers:How to assemble the software you need to build and install TeX on all common platforms: UNIX, DOS, Macintosh, and VMS. How to get TeX and its associated tools from public domain and commercial sources (a complete buyer's guide). How to select and use the tools that let you incorporate graphics into your documents and create bibliographies, indices, and other complex document elements. How to install and use fonts to best advantage, including PostScript and TrueType fonts and LaTeX's New Font Selection Scheme (NFSS).

keywords:
Computer Communication Networks., internet (computer network); Computer networks --- Management; computer networks --- management; Internet (Computer network)

TOC:
Gopher World Wide Web Internet service concepts Introduction to information services Finger-, Inetd-, and Telnet-based services Setting up an FTP archive The WU archive FTP daemon Maintaining an FTP archive Creating an Internet database server with WAIS Creating WAIS sources with waisindex Gopher: introduction Gopher: compiling the server Gopher: managing the server Gopher: preparing information Gopher: linking services together Gopher: incorporating databases Gopher: Veronica and Jughead Gopher+ forms and other new features Introduction to the world wide web Setting up a web server Authoring for the web Web: gateways and forms Web: access control and security Introduction to email services Simple mailing lists Automating mailing lists with majordomo The majordomo list owner and moderator Ftpmail Firewalls and information services Xinetd Legal issues Protecting intellectual property

rawabstract:
TeX is a powerful tool for creating professional quality typeset text and is unsurpassed at typesetting mathematical equations, scientific text, and multiple languages. Many books describe how you use TeX to construct sentences, paragraphs, and chapters. Until now, no book has described all the software that actually lets you build, run, and use TeX to best advantage on your platform. Because creating a TeX document requires the use of many tools, this lack of information is a serious problem for TeX users. TeX is increasing in popularity, and the need for information is becoming more critical. Many technical journals now request that articles be submitted in TeX. TeX is also playing an increasing role in the Standard Generalized Markup Language (SGML) environment. TeX's portability and flexibility -- not to mention the fact that it is free -- are also making it the typesetting tool of choice for interchange between hardware and software platforms and for international exchange. Yet, despite this growing interest in TeX, TeX users everywhere are having to ``reinvent the wheel'' by wrestling with TeX's many tools and files on their own. Making TeX Workguides you through the maze of tools available in the overall TeX system. Beyond the core TeX program there are myriad drivers, macro packages, previewers, printing programs, online documentation facilities, graphics programs, and more. This book describes them all. It covers:How to assemble the software you need to build and install TeX on all common platforms: UNIX, DOS, Macintosh, and VMS. How to get TeX and its associated tools from public domain and commercial sources (a complete buyer's guide). How to select and use the tools that let you incorporate graphics into your documents and create bibliographies, indices, and other complex document elements. How to install and use fonts to best advantage, including PostScript and TrueType fonts and LaTeX's New Font Selection Scheme (NFSS).

rawnote:
Written specifically for database maintainers and system administrators, this Unix-based technical guide covers installing, setting up, and running Internet applications such as gopher holes, FTP and telnet sites, mailing lists, WAIS, and World Wide Web pages, and other sites, as well as keeping them secure.

rawTOC:
Gopher World Wide Web \\ Internet service concepts \\ Introduction to information services \\ Finger-, Inetd-, and Telnet-based services \\ Setting up an FTP archive \\ The WU archive FTP daemon \\ Maintaining an FTP archive \\ Creating an Internet database server with WAIS \\ Creating WAIS sources with waisindex \\ Gopher: introduction \\ Gopher: compiling the server \\ Gopher: managing the server \\ Gopher: preparing information \\ Gopher: linking services together \\ Gopher: incorporating databases \\ Gopher: Veronica and Jughead \\ Gopher+ forms and other new features \\ Introduction to the world wide web \\ Setting up a web server \\ Authoring for the web \\ Web: gateways and forms \\ Web: access control and security \\ Introduction to email services \\ Simple mailing lists \\ Automating mailing lists with majordomo \\ The majordomo list owner and moderator \\ Ftpmail \\ Firewalls and information services \\ Xinetd \\ Legal issues \\ Protecting intellectual property

entry:
@Book{Walsh:1994:MTW,
  author =       "Norman Walsh",
  title =        "Making {\TeX} Work",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xxxvi + 483",
  year =         "1994",
  ISBN =         "1-56592-051-1",
  ISBN-13 =      "978-1-56592-051-4",
  LCCN =         "TK5105.875.I57 M36 1994; Z253.4.T47 W34 1994",
  bibdate =      "Thu May 12 08:24:59 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/css.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/ora.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  note =         "Written specifically for database maintainers and
                 system administrators, this Unix-based technical guide
                 covers installing, setting up, and running Internet
                 applications such as gopher holes, FTP and telnet
                 sites, mailing lists, WAIS, and World Wide Web pages,
                 and other sites, as well as keeping them secure.",
  price =        "US\$29.95",
  URL =          "ftp://ftp.ora.com/pub/products/catalogs/book.catalog;
                 http://www.oreilly.com/catalog/9781565920514",
  abstract =     "TeX is a powerful tool for creating professional
                 quality typeset text and is unsurpassed at typesetting
                 mathematical equations, scientific text, and multiple
                 languages. Many books describe how you use TeX to
                 construct sentences, paragraphs, and chapters. Until
                 now, no book has described all the software that
                 actually lets you build, run, and use TeX to best
                 advantage on your platform. Because creating a TeX
                 document requires the use of many tools, this lack of
                 information is a serious problem for TeX users. TeX is
                 increasing in popularity, and the need for information
                 is becoming more critical. Many technical journals now
                 request that articles be submitted in TeX. TeX is also
                 playing an increasing role in the Standard Generalized
                 Markup Language (SGML) environment. TeX's portability
                 and flexibility -- not to mention the fact that it is
                 free -- are also making it the typesetting tool of
                 choice for interchange between hardware and software
                 platforms and for international exchange. Yet, despite
                 this growing interest in TeX, TeX users everywhere are
                 having to ``reinvent the wheel'' by wrestling with
                 TeX's many tools and files on their own. Making TeX
                 Workguides you through the maze of tools available in
                 the overall TeX system. Beyond the core TeX program
                 there are myriad drivers, macro packages, previewers,
                 printing programs, online documentation facilities,
                 graphics programs, and more. This book describes them
                 all. It covers:How to assemble the software you need to
                 build and install TeX on all common platforms: UNIX,
                 DOS, Macintosh, and VMS. How to get TeX and its
                 associated tools from public domain and commercial
                 sources (a complete buyer's guide). How to select and
                 use the tools that let you incorporate graphics into
                 your documents and create bibliographies, indices, and
                 other complex document elements. How to install and use
                 fonts to best advantage, including PostScript and
                 TrueType fonts and LaTeX's New Font Selection Scheme
                 (NFSS).",
  acknowledgement = ack-nhfb,
  keywords =     "Computer Communication Networks., internet (computer
                 network); Computer networks --- Management; computer
                 networks --- management; Internet (Computer network)",
  tableofcontents = "Gopher World Wide Web \\
                 Internet service concepts \\
                 Introduction to information services \\
                 Finger-, Inetd-, and Telnet-based services \\
                 Setting up an FTP archive \\
                 The WU archive FTP daemon \\
                 Maintaining an FTP archive \\
                 Creating an Internet database server with WAIS \\
                 Creating WAIS sources with waisindex \\
                 Gopher: introduction \\
                 Gopher: compiling the server \\
                 Gopher: managing the server \\
                 Gopher: preparing information \\
                 Gopher: linking services together \\
                 Gopher: incorporating databases \\
                 Gopher: Veronica and Jughead \\
                 Gopher+ forms and other new features \\
                 Introduction to the world wide web \\
                 Setting up a web server \\
                 Authoring for the web \\
                 Web: gateways and forms \\
                 Web: access control and security \\
                 Introduction to email services \\
                 Simple mailing lists \\
                 Automating mailing lists with majordomo \\
                 The majordomo list owner and moderator \\
                 Ftpmail \\
                 Firewalls and information services \\
                 Xinetd \\
                 Legal issues \\
                 Protecting intellectual property",
}


bibtype: book
filename: master.bib
label: Walsh:1999:DDG
author: Norman Walsh and Leonard Muellner
title: DocBook: The Definitive Guide
publisher: pub-ORA
address: pub-ORA:adr
pages: xii + 635
year: 1999
ISBN: 1-56592-580-7 OR 1565925807
ISBN13: 978-1-56592-580-9 OR 9781565925809
LCCN: QA76.76.H94 W35 1999
bibdate: Sat Oct 21 12:42:55 2000
bibtimestamp: 2000.10.21 12:42:55 ???
note: Includes CD-ROM.
URL: http://www.oreilly.com/catalog/9781565925809; http://www.oreilly.com/catalog/docbook
keywords: SGML; XML
subject: SGML (Document markup language); XML (Document markup language)
acknowledgement: ack-nhfb
rawauthor: Norman Walsh and Leonard Muellner
rawnote: Includes CD-ROM.
rawtitle: {DocBook}: The Definitive Guide
bibsource:
http://www.oreilly.com/catalog/; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/ora.bib; https://www.math.utah.edu/pub/tex/bib/sgml.bib

entry:
@Book{Walsh:1999:DDG,
  author =       "Norman Walsh and Leonard Muellner",
  title =        "{DocBook}: The Definitive Guide",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xii + 635",
  year =         "1999",
  ISBN =         "1-56592-580-7",
  ISBN-13 =      "978-1-56592-580-9",
  LCCN =         "QA76.76.H94 W35 1999",
  bibdate =      "Sat Oct 21 12:42:55 2000",
  bibsource =    "http://www.oreilly.com/catalog/;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/ora.bib;
                 https://www.math.utah.edu/pub/tex/bib/sgml.bib",
  note =         "Includes CD-ROM.",
  price =        "US\$36.95",
  URL =          "http://www.oreilly.com/catalog/9781565925809;
                 http://www.oreilly.com/catalog/docbook",
  acknowledgement = ack-nhfb,
  keywords =     "SGML; XML",
  subject =      "SGML (Document markup language); XML (Document markup
                 language)",
}


bibtype: book
filename: master.bib
label: Ward:1985:APT
author: Terry A. Ward
title: Applied Programming Techniques in C
publisher: pub-SCOTT-FORESMAN
address: pub-SCOTT-FORESMAN:adr
pages: xii + 349
year: 1985
ISBN: 0-673-18050-6 OR 0673180506
ISBN13: 978-0-673-18050-6 OR 9780673180506
LCCN: QA76.73.C15 W37 1985
bibdate: Wed Dec 15 10:59:01 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 10:59:01 ???
acknowledgement: ack-nhfb
rawauthor: Terry A. Ward
rawtitle: Applied Programming Techniques in {C}
entry:
@Book{Ward:1985:APT,
  author =       "Terry A. Ward",
  title =        "Applied Programming Techniques in {C}",
  publisher =    pub-SCOTT-FORESMAN,
  address =      pub-SCOTT-FORESMAN:adr,
  pages =        "xii + 349",
  year =         "1985",
  ISBN =         "0-673-18050-6",
  ISBN-13 =      "978-0-673-18050-6",
  LCCN =         "QA76.73.C15 W37 1985",
  bibdate =      "Wed Dec 15 10:59:01 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$19.95",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Ward:2000:REW
author: Peter D. (Peter Douglas) Ward and Donald Brownlee
title: Rare earth: why complex life is uncommon in the universe
publisher: Copernicus
address: New York, NY, USA
pages: xxxii + 335
year: 2000
ISBN: 0-387-95289-6 (paperback), 0-387-21848-3 (e-book) OR 0387952896 (paperback), 0387218483 (ebook)
ISBN13: 978-0-387-95289-5 (paperback) OR 9780387952895 (paperback)
LCCN: QB54 .W336 2000
bibdate: Thu Mar 19 15:11:42 MDT 2015
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2015.03.19 15:11:42 MDT
acknowledgement: ack-nhfb
authordates: 1949--
rawauthor: Peter D. (Peter Douglas) Ward and Donald Brownlee
rawtitle: Rare earth: why complex life is uncommon in the universe
URL:
http://www.loc.gov/catdir/enhancements/fy0817/2003043437-d.html; http://www.loc.gov/catdir/enhancements/fy0817/2003043437-t.html

TOC:
Cover Table of Contents Preface to the Paperback Edition Preface to the First Edition Introduction: The Astrobiology Revolution and the Rare Earth Hypothesis Dead Zones of the Universe Rare Earth Factors 1: Why Life Might Be Widespread in the Universe 2: Habitable Zones of the Universe 3: Building a Habitable Earth 4: Life's First Appearance on Earth 5: How to Build Animals 6: Snowball Earth 7: The Enigma of the Cambrian Explosion 8: Mass Extinctions and the Rare Earth Hypothesis 9: The Surprising Importance of Plate Tectonics 10: The Moon, Jupiter, and Life on Earth 11: Testing the Rare Earth Hypotheses 12: Assessing the Odds 13: Messengers from the Stars References Index

rawTOC:
Cover \\ Table of Contents \\ Preface to the Paperback Edition \\ Preface to the First Edition \\ Introduction: The Astrobiology Revolution and the Rare Earth Hypothesis \\ Dead Zones of the Universe \\ Rare Earth Factors \\ 1: Why Life Might Be Widespread in the Universe \\ 2: Habitable Zones of the Universe \\ 3: Building a Habitable Earth \\ 4: Life's First Appearance on Earth \\ 5: How to Build Animals \\ 6: Snowball Earth \\ 7: The Enigma of the Cambrian Explosion \\ 8: Mass Extinctions and the Rare Earth Hypothesis \\ 9: The Surprising Importance of Plate Tectonics \\ 10: The Moon, Jupiter, and Life on Earth \\ 11: Testing the Rare Earth Hypotheses \\ 12: Assessing the Odds \\ 13: Messengers from the Stars \\ References \\ Index

entry:
@Book{Ward:2000:REW,
  author =       "Peter D. (Peter Douglas) Ward and Donald Brownlee",
  title =        "Rare earth: why complex life is uncommon in the
                 universe",
  publisher =    "Copernicus",
  address =      "New York, NY, USA",
  pages =        "xxxii + 335",
  year =         "2000",
  ISBN =         "0-387-95289-6 (paperback), 0-387-21848-3 (e-book)",
  ISBN-13 =      "978-0-387-95289-5 (paperback)",
  LCCN =         "QB54 .W336 2000",
  bibdate =      "Thu Mar 19 15:11:42 MDT 2015",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0817/2003043437-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0817/2003043437-t.html",
  acknowledgement = ack-nhfb,
  author-dates = "1949--",
  tableofcontents = "Cover \\
                 Table of Contents \\
                 Preface to the Paperback Edition \\
                 Preface to the First Edition \\
                 Introduction: The Astrobiology Revolution and the Rare
                 Earth Hypothesis \\
                 Dead Zones of the Universe \\
                 Rare Earth Factors \\
                 1: Why Life Might Be Widespread in the Universe \\
                 2: Habitable Zones of the Universe \\
                 3: Building a Habitable Earth \\
                 4: Life's First Appearance on Earth \\
                 5: How to Build Animals \\
                 6: Snowball Earth \\
                 7: The Enigma of the Cambrian Explosion \\
                 8: Mass Extinctions and the Rare Earth Hypothesis \\
                 9: The Surprising Importance of Plate Tectonics \\
                 10: The Moon, Jupiter, and Life on Earth \\
                 11: Testing the Rare Earth Hypotheses \\
                 12: Assessing the Odds \\
                 13: Messengers from the Stars \\
                 References \\
                 Index",
}


bibtype: book
filename: master.bib
label: Ward:2008:UGS
author: Peter D. (Peter Douglas) Ward
publisher: Smithsonian Books/Collins
address: New York, NY, USA
pages: xiv + 242
year: 2008
ISBN: 0-06-113792-8 (paperback) OR 0061137928 (paperback)
ISBN13: 978-0-06-113792-1 OR 9780061137921
LCCN: QE721.2.E97 W384 2008
bibdate: Fri May 1 19:02:32 MDT 2015
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2015.05.01 19:02:32 MDT
acknowledgement: ack-nhfb
authordates: 1949--
rawauthor: Peter D. (Peter Douglas) Ward
title:
Under a green sky: global warming, the mass extinctions of the past, and what they can tell us about our future

abstract:
More than 200 million years ago, a cataclysm known as the Permian extinction destroyed nearly 97 percent of all living things. Its origins have long been a puzzle. Paleontologist Ward, fresh from helping prove that an asteroid had killed the dinosaurs, turned to the Permian problem, and he has come to a stunning conclusion: that the near-total devastation at the end of the Permian period was caused by rising levels of carbon dioxide leading to climate change. The story of the discovery makes for a globe-spanning adventure. Here, Ward explains how the Permian extinction as well as four others happened, and describes the freakish oceans --- belching poisonous gas --- and sky --- slightly green and always hazy --- that would have attended them. Those ancient upheavals demonstrate that the threat of climate change cannot be ignored, lest the world's life today --- ourselves included --- face the same dire fate.

subject:
Extinction (Biology); Paleoclimatology; Global warming; Extinct animals; Climate; Environmental aspects; Extinction (Biology); Global warming; Paleoclimatology.

TOC:
Introduction: Going to Nevada Welcome to the revolution! The overlooked extinction The mother of all extinctions The misinterpreted extinction A new paradigm for mass extinction The driver of extinction Bridging the deep and near past The oncoming extinction of winter Back to the Eocene The new old world

rawabstract:
More than 200 million years ago, a cataclysm known as the Permian extinction destroyed nearly 97 percent of all living things. Its origins have long been a puzzle. Paleontologist Ward, fresh from helping prove that an asteroid had killed the dinosaurs, turned to the Permian problem, and he has come to a stunning conclusion: that the near-total devastation at the end of the Permian period was caused by rising levels of carbon dioxide leading to climate change. The story of the discovery makes for a globe-spanning adventure. Here, Ward explains how the Permian extinction as well as four others happened, and describes the freakish oceans --- belching poisonous gas --- and sky --- slightly green and always hazy --- that would have attended them. Those ancient upheavals demonstrate that the threat of climate change cannot be ignored, lest the world's life today --- ourselves included --- face the same dire fate.

rawtitle:
Under a green sky: global warming, the mass extinctions of the past, and what they can tell us about our future

rawTOC:
Introduction: Going to Nevada \\ Welcome to the revolution! \\ The overlooked extinction \\ The mother of all extinctions \\ The misinterpreted extinction \\ A new paradigm for mass extinction \\ The driver of extinction \\ Bridging the deep and near past \\ The oncoming extinction of winter \\ Back to the Eocene \\ The new old world

entry:
@Book{Ward:2008:UGS,
  author =       "Peter D. (Peter Douglas) Ward",
  title =        "Under a green sky: global warming, the mass
                 extinctions of the past, and what they can tell us
                 about our future",
  publisher =    "Smithsonian Books/Collins",
  address =      "New York, NY, USA",
  pages =        "xiv + 242",
  year =         "2008",
  ISBN =         "0-06-113792-8 (paperback)",
  ISBN-13 =      "978-0-06-113792-1",
  LCCN =         "QE721.2.E97 W384 2008",
  bibdate =      "Fri May 1 19:02:32 MDT 2015",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "More than 200 million years ago, a cataclysm known as
                 the Permian extinction destroyed nearly 97 percent of
                 all living things. Its origins have long been a puzzle.
                 Paleontologist Ward, fresh from helping prove that an
                 asteroid had killed the dinosaurs, turned to the
                 Permian problem, and he has come to a stunning
                 conclusion: that the near-total devastation at the end
                 of the Permian period was caused by rising levels of
                 carbon dioxide leading to climate change. The story of
                 the discovery makes for a globe-spanning adventure.
                 Here, Ward explains how the Permian extinction as well
                 as four others happened, and describes the freakish
                 oceans --- belching poisonous gas --- and sky ---
                 slightly green and always hazy --- that would have
                 attended them. Those ancient upheavals demonstrate that
                 the threat of climate change cannot be ignored, lest
                 the world's life today --- ourselves included --- face
                 the same dire fate.",
  acknowledgement = ack-nhfb,
  author-dates = "1949--",
  libnote =      "Not yet in my library.",
  subject =      "Extinction (Biology); Paleoclimatology; Global
                 warming; Extinct animals; Climate; Environmental
                 aspects; Extinction (Biology); Global warming;
                 Paleoclimatology.",
  tableofcontents = "Introduction: Going to Nevada \\
                 Welcome to the revolution! \\
                 The overlooked extinction \\
                 The mother of all extinctions \\
                 The misinterpreted extinction \\
                 A new paradigm for mass extinction \\
                 The driver of extinction \\
                 Bridging the deep and near past \\
                 The oncoming extinction of winter \\
                 Back to the Eocene \\
                 The new old world",
}


bibtype: book
filename: master.bib
label: Warren:2003:HD
author: Henry S. Warren
title: Hacker's delight
publisher: pub-AW
address: pub-AW:adr
pages: xiv + 306
year: 2003
ISBN: 0-201-91465-4 OR 0201914654
ISBN13: 978-0-201-91465-8 OR 9780201914658
LCCN: QA76.6 .W375 2003
bibdate: Tue Jan 03 18:20:34 2006
bibtimestamp: 2006.01.03 18:20:34 ???
subject: Computer programming; Computer hackers
acknowledgement: ack-nhfb
rawauthor: Henry S. Warren
rawtitle: Hacker's delight
bibsource:
https://www.math.utah.edu/pub/tex/bib/benfords-law.bib; https://www.math.utah.edu/pub/tex/bib/fparith.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager

note:
While this book does not specifically address computational aspects of floating-point arithmetic (apart from the nine-page Chapter 15), it has extensive coverage of, and clever algorithms for, integer arithmetic operations that are fundamental for implementing hardware floating-arithmetic and software multiple-precision arithmetic.

URL:
http://www.awprofessional.com/bookstore/product.asp?isbn=0201914654; http://www.hackersdelight.org/; http://www.hackersdelight.org/hackerTOC.pdf; http://www.informit.com/content/images/chap3_0201914654/elementLinks/0201914654.pdf

keywords:
DEC PDP-10; division by constants; Gray code; Hilbert curves; IEEE 754 floating-point arithmetic; integer cube root; integer division; integer exponentiation; integer logarithm; integer square root; prime numbers; unusual number bases

remark:
Foreword by Guy L. Steele, Jr., who begins ``When I first got a summer job at MIT's Project MAC almost 30 years ago, I was delighted to be able to work with the DEC PDP-10 computer, which was more fun to program in assembly language than any other computer, bar none, because of its rich yet tractable set of instructions for performing bit tests, bit masking, field manipulation, and operations on integers. Though the PDP-10 has not been manufactured for quite some years, there remains a thriving cult of enthusiasts who keep old PDP-10 hardware running and who run old PDP-10 software---entire operating systems and their applications---by using personal computers to simulate the PDP-10 instruction set.''

TOC:
Prefacepar 1. Introductionpar Notationpar Instruction Set and Execution Time Modelpar 2. Basispar Manipulating Rightmost Bits Addition Combined with Logical Operations Inequalities among Logical and Arithmetic Expressions Absolute Value Function Sign Extension Shift Right Signed from Unsigned Sign Function Three-Valued Compare Transfer of Sign Decoding a `Zero Means 2**n' Field Comparison Predicates Overflow Detection Condition Code Result of Add, Subtract, and Multiply Rotate Shifts Double-Length Add/Subtract Double-Length Shifts Multibyte Add, Subtract, Absolute Value Doz, Max, Min Exchanging Registers Alternating among Two or More Valuespar 3. Power-of-2 Boundariespar Rounding Up/Down to a Multiple of a Known Power of 2 Rounding Up/Down to the Next Power of 2 Detecting a Power-of-2 Boundary Crossingpar 4. Arithmetic Boundspar Checking Bounds of Integers Propagating Bounds through Adds and Subtracts Propagating Bounds through Logical Operations Signed Boundspar 5. Counting Bitspar Counting 1-bits Parity Counting Leading 0's Counting Trailing 0'spar 6. Searching Wordspar Find First 0-Byte Find First String of 1-Bits of a Given Lengthpar 7. Rearranging Bits and Bytespar Reversing Bits and Bytes Shuffling Bits Transposing a Bit Matrix Compress, or Generalized Extract General Permutations, Sheep and Goats Operation Rearrangements and Index Transformationspar 8. Multiplicationpar Multiword Multiplication High-Order Half of 64-Bit Product High-Order Product Signed from/to Unsigned Multiplication by Constantspar 9. Integer Divisionpar Preliminaries Multiword Division Unsigned Short Division from Signed Division Unsigned Long Divisionpar 10. Integer Division by Constantspar Signed Division by a Known Power of 2 Signed Remainder from Division by a Known Power of 2 Signed Division and Remainder by Non-powers of 2 Signed Division by Divisors >= 2 Signed Division by Divisors <= -2 Incorporation into a Compiler Miscellaneous Topics Unsigned Division Unsigned Division by Divisors >= 1 Incorporation into a Compiler (Unsigned) Miscellaneous Topics (Unsigned) Applicability to Modulus and Floor Division Similar Methods Sample Magic Numbers Exact Division by Constants Test for Zero Remainder after Division by a Constantpar 11. Some Elementary Functionspar Integer Square Root Integer Cube Root Integer Exponentiation Integer Logarithmpar 12. Unusual Bases for Number Systemspar Base -2 Base -1 + i Other Bases What is the Most Efficient Base?par 13. Gray Code Gray Code Incrementing a Gray Coded Integer Negabinary Gray Code Brief History and Applicationspar 14. Hilbert's Curvepar A Recursive Algorithm for Generating the Hilbert Curve Coordinates from Distance along the Hilbert Curve Distance from Coordinates on the Hilbert Curve Incrementing the Coordinates on the Hilbert Curve Non-recursive Generating Algorithms Other Space-Filling Curves Applicationspar 15. Floating-Pointpar IEEE Format Comparing Floating-Point Numbers Using Integer Operations The Distribution of Leading Digits Table of Miscellaneous Valuespar 16. Formulas for Primespar Introduction Willans's Formulas Wormell's Formula Formulas for Other Difficult Functionspar Appendix A. Arithmetic Tables for a 4-Bit Machinepar Appendix B. Newton's Methodpar Bibliography.

rawnote:
While this book does not specifically address computational aspects of floating-point arithmetic (apart from the nine-page Chapter 15), it has extensive coverage of, and clever algorithms for, integer arithmetic operations that are fundamental for implementing hardware floating-arithmetic and software multiple-precision arithmetic.

rawTOC:
Preface\par 1. Introduction\par Notation\par Instruction Set and Execution Time Model\par 2. Basis\par Manipulating Rightmost Bits \\ Addition Combined with Logical Operations \\ Inequalities among Logical and Arithmetic Expressions \\ Absolute Value Function \\ Sign Extension \\ Shift Right Signed from Unsigned \\ Sign Function \\ Three-Valued Compare \\ Transfer of Sign \\ Decoding a `Zero Means 2**n' Field \\ Comparison Predicates \\ Overflow Detection \\ Condition Code Result of Add, Subtract, and Multiply \\ Rotate Shifts \\ Double-Length Add/Subtract \\ Double-Length Shifts \\ Multibyte Add, Subtract, Absolute Value \\ Doz, Max, Min \\ Exchanging Registers \\ Alternating among Two or More Values\par 3. Power-of-2 Boundaries\par Rounding Up/Down to a Multiple of a Known Power of 2 \\ Rounding Up/Down to the Next Power of 2 \\ Detecting a Power-of-2 Boundary Crossing\par 4. Arithmetic Bounds\par Checking Bounds of Integers \\ Propagating Bounds through Adds and Subtracts \\ Propagating Bounds through Logical Operations \\ Signed Bounds\par 5. Counting Bits\par Counting 1-bits \\ Parity \\ Counting Leading 0's \\ Counting Trailing 0's\par 6. Searching Words\par Find First 0-Byte \\ Find First String of 1-Bits of a Given Length\par 7. Rearranging Bits and Bytes\par Reversing Bits and Bytes \\ Shuffling Bits \\ Transposing a Bit Matrix \\ Compress, or Generalized Extract \\ General Permutations, Sheep and Goats Operation \\ Rearrangements and Index Transformations\par 8. Multiplication\par Multiword Multiplication \\ High-Order Half of 64-Bit Product \\ High-Order Product Signed from/to Unsigned \\ Multiplication by Constants\par 9. Integer Division\par Preliminaries \\ Multiword Division \\ Unsigned Short Division from Signed Division \\ Unsigned Long Division\par 10. Integer Division by Constants\par Signed Division by a Known Power of 2 \\ Signed Remainder from Division by a Known Power of 2 \\ Signed Division and Remainder by Non-powers of 2 \\ Signed Division by Divisors >= 2 \\ Signed Division by Divisors <= -2 \\ Incorporation into a Compiler \\ Miscellaneous Topics \\ Unsigned Division \\ Unsigned Division by Divisors >= 1 \\ Incorporation into a Compiler (Unsigned) \\ Miscellaneous Topics (Unsigned) \\ Applicability to Modulus and Floor Division \\ Similar Methods \\ Sample Magic Numbers \\ Exact Division by Constants \\ Test for Zero Remainder after Division by a Constant\par 11. Some Elementary Functions\par Integer Square Root \\ Integer Cube Root \\ Integer Exponentiation \\ Integer Logarithm\par 12. Unusual Bases for Number Systems\par Base -2 \\ Base -1 + i \\ Other Bases \\ What is the Most Efficient Base?\par 13. Gray Code \\ Gray Code \\ Incrementing a Gray Coded Integer \\ Negabinary Gray Code \\ Brief History and Applications\par 14. Hilbert's Curve\par A Recursive Algorithm for Generating the Hilbert Curve \\ Coordinates from Distance along the Hilbert Curve \\ Distance from Coordinates on the Hilbert Curve \\ Incrementing the Coordinates on the Hilbert Curve \\ Non-recursive Generating Algorithms \\ Other Space-Filling Curves \\ Applications\par 15. Floating-Point\par IEEE Format \\ Comparing Floating-Point Numbers Using Integer Operations \\ The Distribution of Leading Digits \\ Table of Miscellaneous Values\par 16. Formulas for Primes\par Introduction \\ Willans's Formulas \\ Wormell's Formula \\ Formulas for Other Difficult Functions\par Appendix A. Arithmetic Tables for a 4-Bit Machine\par Appendix B. Newton's Method\par Bibliography.

entry:
@Book{Warren:2003:HD,
  author =       "Henry S. Warren",
  title =        "Hacker's delight",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xiv + 306",
  year =         "2003",
  ISBN =         "0-201-91465-4",
  ISBN-13 =      "978-0-201-91465-8",
  LCCN =         "QA76.6 .W375 2003",
  bibdate =      "Tue Jan 03 18:20:34 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  note =         "While this book does not specifically address
                 computational aspects of floating-point arithmetic
                 (apart from the nine-page Chapter 15), it has extensive
                 coverage of, and clever algorithms for, integer
                 arithmetic operations that are fundamental for
                 implementing hardware floating-arithmetic and software
                 multiple-precision arithmetic.",
  URL =          "http://www.awprofessional.com/bookstore/product.asp?isbn=0201914654;
                 http://www.hackersdelight.org/;
                 http://www.hackersdelight.org/hackerTOC.pdf;
                 http://www.informit.com/content/images/chap3_0201914654/elementLinks/0201914654.pdf",
  acknowledgement = ack-nhfb,
  keywords =     "DEC PDP-10; division by constants; Gray code; Hilbert
                 curves; IEEE 754 floating-point arithmetic; integer
                 cube root; integer division; integer exponentiation;
                 integer logarithm; integer square root; prime numbers;
                 unusual number bases",
  remark =       "Foreword by Guy L. Steele, Jr., who begins ``When I
                 first got a summer job at MIT's Project MAC almost 30
                 years ago, I was delighted to be able to work with the
                 DEC PDP-10 computer, which was more fun to program in
                 assembly language than any other computer, bar none,
                 because of its rich yet tractable set of instructions
                 for performing bit tests, bit masking, field
                 manipulation, and operations on integers. Though the
                 PDP-10 has not been manufactured for quite some years,
                 there remains a thriving cult of enthusiasts who keep
                 old PDP-10 hardware running and who run old PDP-10
                 software---entire operating systems and their
                 applications---by using personal computers to simulate
                 the PDP-10 instruction set.''",
  subject =      "Computer programming; Computer hackers",
  tableofcontents = "Preface\par

                 1. Introduction\par

                 Notation\par

                 Instruction Set and Execution Time Model\par

                 2. Basis\par

                 Manipulating Rightmost Bits \\
                 Addition Combined with Logical Operations \\
                 Inequalities among Logical and Arithmetic Expressions
                 \\
                 Absolute Value Function \\
                 Sign Extension \\
                 Shift Right Signed from Unsigned \\
                 Sign Function \\
                 Three-Valued Compare \\
                 Transfer of Sign \\
                 Decoding a `Zero Means 2**n' Field \\
                 Comparison Predicates \\
                 Overflow Detection \\
                 Condition Code Result of Add, Subtract, and Multiply
                 \\
                 Rotate Shifts \\
                 Double-Length Add/Subtract \\
                 Double-Length Shifts \\
                 Multibyte Add, Subtract, Absolute Value \\
                 Doz, Max, Min \\
                 Exchanging Registers \\
                 Alternating among Two or More Values\par

                 3. Power-of-2 Boundaries\par

                 Rounding Up/Down to a Multiple of a Known Power of 2
                 \\
                 Rounding Up/Down to the Next Power of 2 \\
                 Detecting a Power-of-2 Boundary Crossing\par

                 4. Arithmetic Bounds\par

                 Checking Bounds of Integers \\
                 Propagating Bounds through Adds and Subtracts \\
                 Propagating Bounds through Logical Operations \\
                 Signed Bounds\par

                 5. Counting Bits\par

                 Counting 1-bits \\
                 Parity \\
                 Counting Leading 0's \\
                 Counting Trailing 0's\par

                 6. Searching Words\par

                 Find First 0-Byte \\
                 Find First String of 1-Bits of a Given Length\par

                 7. Rearranging Bits and Bytes\par

                 Reversing Bits and Bytes \\
                 Shuffling Bits \\
                 Transposing a Bit Matrix \\
                 Compress, or Generalized Extract \\
                 General Permutations, Sheep and Goats Operation \\
                 Rearrangements and Index Transformations\par

                 8. Multiplication\par

                 Multiword Multiplication \\
                 High-Order Half of 64-Bit Product \\
                 High-Order Product Signed from/to Unsigned \\
                 Multiplication by Constants\par

                 9. Integer Division\par

                 Preliminaries \\
                 Multiword Division \\
                 Unsigned Short Division from Signed Division \\
                 Unsigned Long Division\par

                 10. Integer Division by Constants\par

                 Signed Division by a Known Power of 2 \\
                 Signed Remainder from Division by a Known Power of 2
                 \\
                 Signed Division and Remainder by Non-powers of 2 \\
                 Signed Division by Divisors >= 2 \\
                 Signed Division by Divisors <= -2 \\
                 Incorporation into a Compiler \\
                 Miscellaneous Topics \\
                 Unsigned Division \\
                 Unsigned Division by Divisors >= 1 \\
                 Incorporation into a Compiler (Unsigned) \\
                 Miscellaneous Topics (Unsigned) \\
                 Applicability to Modulus and Floor Division \\
                 Similar Methods \\
                 Sample Magic Numbers \\
                 Exact Division by Constants \\
                 Test for Zero Remainder after Division by a
                 Constant\par

                 11. Some Elementary Functions\par

                 Integer Square Root \\
                 Integer Cube Root \\
                 Integer Exponentiation \\
                 Integer Logarithm\par

                 12. Unusual Bases for Number Systems\par

                 Base -2 \\
                 Base -1 + i \\
                 Other Bases \\
                 What is the Most Efficient Base?\par

                 13. Gray Code \\
                 Gray Code \\
                 Incrementing a Gray Coded Integer \\
                 Negabinary Gray Code \\
                 Brief History and Applications\par

                 14. Hilbert's Curve\par

                 A Recursive Algorithm for Generating the Hilbert Curve
                 \\
                 Coordinates from Distance along the Hilbert Curve \\
                 Distance from Coordinates on the Hilbert Curve \\
                 Incrementing the Coordinates on the Hilbert Curve \\
                 Non-recursive Generating Algorithms \\
                 Other Space-Filling Curves \\
                 Applications\par

                 15. Floating-Point\par

                 IEEE Format \\
                 Comparing Floating-Point Numbers Using Integer
                 Operations \\
                 The Distribution of Leading Digits \\
                 Table of Miscellaneous Values\par

                 16. Formulas for Primes\par

                 Introduction \\
                 Willans's Formulas \\
                 Wormell's Formula \\
                 Formulas for Other Difficult Functions\par

                 Appendix A. Arithmetic Tables for a 4-Bit
                 Machine\par

                 Appendix B. Newton's Method\par

                 Bibliography.",
}


bibtype: book
filename: master.bib
label: Warren:2013:HD
author: Henry S. Warren
title: Hacker's Delight
publisher: pub-AW
address: pub-AW:adr
edition: Second
pages: xvi + 494
year: 2013
ISBN: 0-321-84268-5 (hardcover) OR 0321842685 (hardcover)
ISBN13: 978-0-321-84268-8 (hardcover) OR 9780321842688 (hardcover)
LCCN: QA76.6 .W375 2013
bibdate: Mon Sep 23 11:53:48 MDT 2013
bibtimestamp: 2013.09.23 11:53:48 MDT
URL: http://www.pearsonhighered.com/educator/product/Hackers-Delight/9780321842688.page
subject: Computer programming
acknowledgement: ack-nhfb
rawauthor: Henry S. Warren
rawtitle: Hacker's Delight
bibsource:
https://www.math.utah.edu/pub/tex/bib/fparith.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/mathcw.bib; z3950.loc.gov:7090/Voyager

TOC:
Foreword / xiii Preface / xv Chapter 1: Introduction / 1 1-1 Notation / 1 1-2 Instruction Set and Execution Time Model / 5 Chapter 2: Basics / 11 2-1 Manipulating Rightmost Bits / 11 2-2 Addition Combined with Logical Operations / 16 2-3 Inequalities among Logical and Arithmetic Expressions / 17 2-4 Absolute Value Function / 18 2-5 Average of Two Integers / 19 2-6 Sign Extension / 19 2-7 Shift Right Signed from Unsigned / 20 2-8 Sign Function / 20 2-9 Three-Valued Compare Function / 21 2-10 Transfer of Sign Function / 22 2-11 Decoding a Zero Means 2**n Field / 22 2-12 Comparison Predicates / 23 2-13 Overflow Detection / 28 2-14 Condition Code Result of Add, Subtract, and Multiply / 36 2-15 Rotate Shifts / 37 2-16 Double-Length Add/Subtract / 38 2-17 Double-Length Shifts / 39 2-18 Multibyte Add, Subtract, AbsoluteValue / 40 2-19 Doz, Max, Min / 41 2-20 Exchanging Registers / 45 2-21 Alternating among Two or More Values / 48 2-22 A Boolean Decomposition Formula / 51 2-23 Implementing Instructions for all 16 Binary Boolean Operations / 53 Chapter 3: Power-of-2 Boundaries / 59 3-1 Rounding Up/Down to a Multiple of a Known Power of 2 / 59 3-2 Rounding Up/Down to the Next Power of 2 / 60 3-3 Detecting a Power-of-2 Boundary Crossing / 63 Chapter 4: Arithmetic Bounds / 67 4-1 Checking Bounds of Integers / 67 4-2 Propagating Bounds through Adds and Subtracts / 70 4-3 Propagating Bounds through Logical Operations / 73 Chapter 5: Counting Bits / 81 5-1 Counting 1-Bits / 81 5-2 Parity / 96 5-3 Counting Leading 0's / 99 5-4 Counting Trailing 0's / 107 Chapter 6: Searching Words / 117 6-1 Find First 0-Byte / 117 6-2 Find First String of 1-Bits of a Given Length / 123 6-3 Find Longest String of 1-Bits / 125 6-4 Find Shortest String of 1-Bits / 126 Chapter 7: Rearranging Bits And Bytes / 129 7-1 Reversing Bits and Bytes / 129 7-2 Shuffling Bits / 139 7-3 Transposing a Bit Matrix / 141 7-4 Compress, or GeneralizedExtract / 150 7-5 Expand, or GeneralizedInsert / 156 7-6 Hardware Algorithms for Compress and Expand / 157 7-7 General Permutations, Sheep and Goats Operation / 161 7-8 Rearrangements and Index Transformations / 165 7-9 An LRU Algorithm / 166 Chapter 8: Multiplication / 171 8-1 Multiword Multiplication / 171 8-2 High-Order Half of 64-Bit Product / 173 8-3 High-Order Product Signed from/to Unsigned / 174 8-4 Multiplication by Constants / 175 Chapter 9: Integer Division / 181 9-1 Preliminaries / 181 9-2 Multiword Division / 184 9-3 Unsigned Short Division from Signed Division / 189 9-4 Unsigned Long Division / 192 9-5 Doubleword Division from Long Division / 197 Chapter 10: Integer Division by Constants / 205 10-1 Signed Division by a Known Power of 2 / 205 10-2 Signed Remainder from Division by a Known Power of 2 / 206 10-3 Signed Division and Remainder by Non-Powers of 2 / 207 10-4 Signed Division by Divisors 2 / 210 10-5 Signed Division by Divisors 2 / 218 10-6 Incorporation into a Compiler / 220 10-7 Miscellaneous Topics / 223 10-8 Unsigned Division / 227 10-9 Unsigned Division by Divisors 1 / 230 10-10 Incorporation into a Compiler (Unsigned) / 232 10-11 Miscellaneous Topics (Unsigned) / 234 10-12 Applicability to Modulus and Floor Division / 237 10-13 Similar Methods / 237 10-14 Sample Magic Numbers / 238 10-15 Simple Code in Python / 240 10-16 Exact Division by Constants / 240 10-17 Test for Zero Remainder after Division by a Constant / 248 10-18 Methods Not Using Multiply High / 251 10-19 Remainder by Summing Digits / 262 10-20 Remainder by Multiplication and Shifting Right / 268 10-21 Converting to Exact Division / 274 10-22 A Timing Test / 276 10-23 A Circuit for Dividing by 3 / 276 Chapter 11: Some Elementary Functions / 279 11-1 Integer Square Root / 279 11-2 Integer Cube Root / 287 11-3 Integer Exponentiation / 288 11-4 Integer Logarithm / 291 Chapter 12: Unusual Bases For Number Systems / 299 12-1 Base 2 / 299 12-2 Base 1 + i / 306 12-3 Other Bases / 308 12-4 What Is the Most Efficient Base? / 309 Chapter 13: Gray Code / 311 13-1 Gray Code / 311 13-2 Incrementing a Gray-Coded Integer / 313 13-3 Negabinary Gray Code / 315 13-4 Brief History and Applications / 315 Chapter 14: Cyclic Redundancy Check / 319 14-1 Introduction / 319 14-2 Theory / 320 14-3 Practice / 323 Chapter 15: Error-Correcting Codes / 331 15-1 Introduction / 331 15-2 The Hamming Code / 332 15-3 Software for SEC-DED on 32 Information Bits / 337 15-4 Error Correction Considered More Generally / 342 Chapter 16: Hilbert's Curve / 355 16-1 A Recursive Algorithm for Generating the Hilbert Curve / 356 16-2 Coordinates from Distance along the Hilbert Curve / 358 16-3 Distance from Coordinates on the Hilbert Curve / 366 16-4 Incrementing the Coordinates on the Hilbert Curve / 368 16-5 Non-Recursive Generating Algorithms / 371 16-6 Other Space-Filling Curves / 371 16-7 Applications / 372 Chapter 17: Floating-Point / 375 17-1 IEEE Format / 375 17-2 Floating-Point To/From Integer Conversions / 377 17-3 Comparing Floating-Point Numbers Using Integer Operations / 381 17-4 An Approximate Reciprocal Square Root Routine / 383 17-5 The Distribution of Leading Digits / 385 17-6 Table of Miscellaneous Values / 387 Chapter 18: Formulas for Primes / 391 18-1 Introduction / 391 18-2 Willans's Formulas / 393 18-3 Wormell's Formula / 397 18-4 Formulas for Other Difficult Functions / 398 Answers to Exercises: / 405 Appendix A: Arithmetic Tables for a 4-Bit Machine / 453 Appendix B: Newton's Method / 457 Appendix C: A Gallery of Graphs of Discrete Functions / 459 C-1 Plots of Logical Operations on Integers / 459 C-2 Plots of Addition, Subtraction, and Multiplication / 461 C-3 Plots of Functions Involving Division / 463 C-4 Plots of the Compress, SAG, and Rotate Left Functions / 464 C-5 2D Plots of Some Unary Functions / 466 Bibliography / 471 Index / 481

rawTOC:
Foreword / xiii \\ Preface / xv \\ Chapter 1: Introduction / 1 \\ 1-1 Notation / 1 \\ 1-2 Instruction Set and Execution Time Model / 5 \\ Chapter 2: Basics / 11 \\ 2-1 Manipulating Rightmost Bits / 11 \\ 2-2 Addition Combined with Logical Operations / 16 \\ 2-3 Inequalities among Logical and Arithmetic Expressions / 17 \\ 2-4 Absolute Value Function / 18 \\ 2-5 Average of Two Integers / 19 \\ 2-6 Sign Extension / 19 \\ 2-7 Shift Right Signed from Unsigned / 20 \\ 2-8 Sign Function / 20 \\ 2-9 Three-Valued Compare Function / 21 \\ 2-10 Transfer of Sign Function / 22 \\ 2-11 Decoding a Zero Means 2**n Field / 22 \\ 2-12 Comparison Predicates / 23 \\ 2-13 Overflow Detection / 28 \\ 2-14 Condition Code Result of Add, Subtract, and Multiply / 36 \\ 2-15 Rotate Shifts / 37 \\ 2-16 Double-Length Add/Subtract / 38 \\ 2-17 Double-Length Shifts / 39 \\ 2-18 Multibyte Add, Subtract, AbsoluteValue / 40 \\ 2-19 Doz, Max, Min / 41 \\ 2-20 Exchanging Registers / 45 \\ 2-21 Alternating among Two or More Values / 48 \\ 2-22 A Boolean Decomposition Formula / 51 \\ 2-23 Implementing Instructions for all 16 Binary Boolean Operations / 53 \\ Chapter 3: Power-of-2 Boundaries / 59 \\ 3-1 Rounding Up/Down to a Multiple of a Known Power of 2 / 59 \\ 3-2 Rounding Up/Down to the Next Power of 2 / 60 \\ 3-3 Detecting a Power-of-2 Boundary Crossing / 63 \\ Chapter 4: Arithmetic Bounds / 67 \\ 4-1 Checking Bounds of Integers / 67 \\ 4-2 Propagating Bounds through Adds and Subtracts / 70 \\ 4-3 Propagating Bounds through Logical Operations / 73 \\ Chapter 5: Counting Bits / 81 \\ 5-1 Counting 1-Bits / 81 \\ 5-2 Parity / 96 \\ 5-3 Counting Leading 0's / 99 \\ 5-4 Counting Trailing 0's / 107 \\ Chapter 6: Searching Words / 117 \\ 6-1 Find First 0-Byte / 117 \\ 6-2 Find First String of 1-Bits of a Given Length / 123 \\ 6-3 Find Longest String of 1-Bits / 125 \\ 6-4 Find Shortest String of 1-Bits / 126 \\ Chapter 7: Rearranging Bits And Bytes / 129 \\ 7-1 Reversing Bits and Bytes / 129 \\ 7-2 Shuffling Bits / 139 \\ 7-3 Transposing a Bit Matrix / 141 \\ 7-4 Compress, or GeneralizedExtract / 150 \\ 7-5 Expand, or GeneralizedInsert / 156 \\ 7-6 Hardware Algorithms for Compress and Expand / 157 \\ 7-7 General Permutations, Sheep and Goats Operation / 161 \\ 7-8 Rearrangements and Index Transformations / 165 \\ 7-9 An LRU Algorithm / 166 \\ Chapter 8: Multiplication / 171 \\ 8-1 Multiword Multiplication / 171 \\ 8-2 High-Order Half of 64-Bit Product / 173 \\ 8-3 High-Order Product Signed from/to Unsigned / 174 \\ 8-4 Multiplication by Constants / 175 \\ Chapter 9: Integer Division / 181 \\ 9-1 Preliminaries / 181 \\ 9-2 Multiword Division / 184 \\ 9-3 Unsigned Short Division from Signed Division / 189 \\ 9-4 Unsigned Long Division / 192 \\ 9-5 Doubleword Division from Long Division / 197 \\ Chapter 10: Integer Division by Constants / 205 \\ 10-1 Signed Division by a Known Power of 2 / 205 \\ 10-2 Signed Remainder from Division by a Known Power of 2 / 206 \\ 10-3 Signed Division and Remainder by Non-Powers of 2 / 207 \\ 10-4 Signed Division by Divisors 2 / 210 \\ 10-5 Signed Division by Divisors 2 / 218 \\ 10-6 Incorporation into a Compiler / 220 \\ 10-7 Miscellaneous Topics / 223 \\ 10-8 Unsigned Division / 227 \\ 10-9 Unsigned Division by Divisors 1 / 230 \\ 10-10 Incorporation into a Compiler (Unsigned) / 232 \\ 10-11 Miscellaneous Topics (Unsigned) / 234 \\ 10-12 Applicability to Modulus and Floor Division / 237 \\ 10-13 Similar Methods / 237 \\ 10-14 Sample Magic Numbers / 238 \\ 10-15 Simple Code in Python / 240 \\ 10-16 Exact Division by Constants / 240 \\ 10-17 Test for Zero Remainder after Division by a Constant / 248 \\ 10-18 Methods Not Using Multiply High / 251 \\ 10-19 Remainder by Summing Digits / 262 \\ 10-20 Remainder by Multiplication and Shifting Right / 268 \\ 10-21 Converting to Exact Division / 274 \\ 10-22 A Timing Test / 276 \\ 10-23 A Circuit for Dividing by 3 / 276 \\ Chapter 11: Some Elementary Functions / 279 \\ 11-1 Integer Square Root / 279 \\ 11-2 Integer Cube Root / 287 \\ 11-3 Integer Exponentiation / 288 \\ 11-4 Integer Logarithm / 291 \\ Chapter 12: Unusual Bases For Number Systems / 299 \\ 12-1 Base 2 / 299 \\ 12-2 Base 1 + i / 306 \\ 12-3 Other Bases / 308 \\ 12-4 What Is the Most Efficient Base? / 309 \\ Chapter 13: Gray Code / 311 \\ 13-1 Gray Code / 311 \\ 13-2 Incrementing a Gray-Coded Integer / 313 \\ 13-3 Negabinary Gray Code / 315 \\ 13-4 Brief History and Applications / 315 \\ Chapter 14: Cyclic Redundancy Check / 319 \\ 14-1 Introduction / 319 \\ 14-2 Theory / 320 \\ 14-3 Practice / 323 \\ Chapter 15: Error-Correcting Codes / 331 \\ 15-1 Introduction / 331 \\ 15-2 The Hamming Code / 332 \\ 15-3 Software for SEC-DED on 32 Information Bits / 337 \\ 15-4 Error Correction Considered More Generally / 342 \\ Chapter 16: Hilbert's Curve / 355 \\ 16-1 A Recursive Algorithm for Generating the Hilbert Curve / 356 \\ 16-2 Coordinates from Distance along the Hilbert Curve / 358 \\ 16-3 Distance from Coordinates on the Hilbert Curve / 366 \\ 16-4 Incrementing the Coordinates on the Hilbert Curve / 368 \\ 16-5 Non-Recursive Generating Algorithms / 371 \\ 16-6 Other Space-Filling Curves / 371 \\ 16-7 Applications / 372 \\ Chapter 17: Floating-Point / 375 \\ 17-1 IEEE Format / 375 \\ 17-2 Floating-Point To/From Integer Conversions / 377 \\ 17-3 Comparing Floating-Point Numbers Using Integer Operations / 381 \\ 17-4 An Approximate Reciprocal Square Root Routine / 383 \\ 17-5 The Distribution of Leading Digits / 385 \\ 17-6 Table of Miscellaneous Values / 387 \\ Chapter 18: Formulas for Primes / 391 \\ 18-1 Introduction / 391 \\ 18-2 Willans's Formulas / 393 \\ 18-3 Wormell's Formula / 397 \\ 18-4 Formulas for Other Difficult Functions / 398 \\ Answers to Exercises: / 405 \\ Appendix A: Arithmetic Tables for a 4-Bit Machine / 453 \\ Appendix B: Newton's Method / 457 \\ Appendix C: A Gallery of Graphs of Discrete Functions / 459 \\ C-1 Plots of Logical Operations on Integers / 459 \\ C-2 Plots of Addition, Subtraction, and Multiplication / 461 \\ C-3 Plots of Functions Involving Division / 463 \\ C-4 Plots of the Compress, SAG, and Rotate Left Functions / 464 \\ C-5 2D Plots of Some Unary Functions / 466 \\ Bibliography / 471 \\ Index / 481

entry:
@Book{Warren:2013:HD,
  author =       "Henry S. Warren",
  title =        "Hacker's Delight",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Second",
  pages =        "xvi + 494",
  year =         "2013",
  ISBN =         "0-321-84268-5 (hardcover)",
  ISBN-13 =      "978-0-321-84268-8 (hardcover)",
  LCCN =         "QA76.6 .W375 2013",
  bibdate =      "Mon Sep 23 11:53:48 MDT 2013",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/mathcw.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.pearsonhighered.com/educator/product/Hackers-Delight/9780321842688.page",
  acknowledgement = ack-nhfb,
  subject =      "Computer programming",
  tableofcontents = "Foreword / xiii \\
                 Preface / xv \\
                 Chapter 1: Introduction / 1 \\
                 1-1 Notation / 1 \\
                 1-2 Instruction Set and Execution Time Model / 5 \\
                 Chapter 2: Basics / 11 \\
                 2-1 Manipulating Rightmost Bits / 11 \\
                 2-2 Addition Combined with Logical Operations / 16 \\
                 2-3 Inequalities among Logical and Arithmetic
                 Expressions / 17 \\
                 2-4 Absolute Value Function / 18 \\
                 2-5 Average of Two Integers / 19 \\
                 2-6 Sign Extension / 19 \\
                 2-7 Shift Right Signed from Unsigned / 20 \\
                 2-8 Sign Function / 20 \\
                 2-9 Three-Valued Compare Function / 21 \\
                 2-10 Transfer of Sign Function / 22 \\
                 2-11 Decoding a Zero Means 2**n Field / 22 \\
                 2-12 Comparison Predicates / 23 \\
                 2-13 Overflow Detection / 28 \\
                 2-14 Condition Code Result of Add, Subtract, and
                 Multiply / 36 \\
                 2-15 Rotate Shifts / 37 \\
                 2-16 Double-Length Add/Subtract / 38 \\
                 2-17 Double-Length Shifts / 39 \\
                 2-18 Multibyte Add, Subtract, AbsoluteValue / 40 \\
                 2-19 Doz, Max, Min / 41 \\
                 2-20 Exchanging Registers / 45 \\
                 2-21 Alternating among Two or More Values / 48 \\
                 2-22 A Boolean Decomposition Formula / 51 \\
                 2-23 Implementing Instructions for all 16 Binary
                 Boolean Operations / 53 \\
                 Chapter 3: Power-of-2 Boundaries / 59 \\
                 3-1 Rounding Up/Down to a Multiple of a Known Power of
                 2 / 59 \\
                 3-2 Rounding Up/Down to the Next Power of 2 / 60 \\
                 3-3 Detecting a Power-of-2 Boundary Crossing / 63 \\
                 Chapter 4: Arithmetic Bounds / 67 \\
                 4-1 Checking Bounds of Integers / 67 \\
                 4-2 Propagating Bounds through Adds and Subtracts / 70
                 \\
                 4-3 Propagating Bounds through Logical Operations / 73
                 \\
                 Chapter 5: Counting Bits / 81 \\
                 5-1 Counting 1-Bits / 81 \\
                 5-2 Parity / 96 \\
                 5-3 Counting Leading 0's / 99 \\
                 5-4 Counting Trailing 0's / 107 \\
                 Chapter 6: Searching Words / 117 \\
                 6-1 Find First 0-Byte / 117 \\
                 6-2 Find First String of 1-Bits of a Given Length / 123
                 \\
                 6-3 Find Longest String of 1-Bits / 125 \\
                 6-4 Find Shortest String of 1-Bits / 126 \\
                 Chapter 7: Rearranging Bits And Bytes / 129 \\
                 7-1 Reversing Bits and Bytes / 129 \\
                 7-2 Shuffling Bits / 139 \\
                 7-3 Transposing a Bit Matrix / 141 \\
                 7-4 Compress, or GeneralizedExtract / 150 \\
                 7-5 Expand, or GeneralizedInsert / 156 \\
                 7-6 Hardware Algorithms for Compress and Expand / 157
                 \\
                 7-7 General Permutations, Sheep and Goats Operation /
                 161 \\
                 7-8 Rearrangements and Index Transformations / 165 \\
                 7-9 An LRU Algorithm / 166 \\
                 Chapter 8: Multiplication / 171 \\
                 8-1 Multiword Multiplication / 171 \\
                 8-2 High-Order Half of 64-Bit Product / 173 \\
                 8-3 High-Order Product Signed from/to Unsigned / 174
                 \\
                 8-4 Multiplication by Constants / 175 \\
                 Chapter 9: Integer Division / 181 \\
                 9-1 Preliminaries / 181 \\
                 9-2 Multiword Division / 184 \\
                 9-3 Unsigned Short Division from Signed Division / 189
                 \\
                 9-4 Unsigned Long Division / 192 \\
                 9-5 Doubleword Division from Long Division / 197 \\
                 Chapter 10: Integer Division by Constants / 205 \\
                 10-1 Signed Division by a Known Power of 2 / 205 \\
                 10-2 Signed Remainder from Division by a Known Power of
                 2 / 206 \\
                 10-3 Signed Division and Remainder by Non-Powers of 2 /
                 207 \\
                 10-4 Signed Division by Divisors 2 / 210 \\
                 10-5 Signed Division by Divisors 2 / 218 \\
                 10-6 Incorporation into a Compiler / 220 \\
                 10-7 Miscellaneous Topics / 223 \\
                 10-8 Unsigned Division / 227 \\
                 10-9 Unsigned Division by Divisors 1 / 230 \\
                 10-10 Incorporation into a Compiler (Unsigned) / 232
                 \\
                 10-11 Miscellaneous Topics (Unsigned) / 234 \\
                 10-12 Applicability to Modulus and Floor Division / 237
                 \\
                 10-13 Similar Methods / 237 \\
                 10-14 Sample Magic Numbers / 238 \\
                 10-15 Simple Code in Python / 240 \\
                 10-16 Exact Division by Constants / 240 \\
                 10-17 Test for Zero Remainder after Division by a
                 Constant / 248 \\
                 10-18 Methods Not Using Multiply High / 251 \\
                 10-19 Remainder by Summing Digits / 262 \\
                 10-20 Remainder by Multiplication and Shifting Right /
                 268 \\
                 10-21 Converting to Exact Division / 274 \\
                 10-22 A Timing Test / 276 \\
                 10-23 A Circuit for Dividing by 3 / 276 \\
                 Chapter 11: Some Elementary Functions / 279 \\
                 11-1 Integer Square Root / 279 \\
                 11-2 Integer Cube Root / 287 \\
                 11-3 Integer Exponentiation / 288 \\
                 11-4 Integer Logarithm / 291 \\
                 Chapter 12: Unusual Bases For Number Systems / 299 \\
                 12-1 Base 2 / 299 \\
                 12-2 Base 1 + i / 306 \\
                 12-3 Other Bases / 308 \\
                 12-4 What Is the Most Efficient Base? / 309 \\
                 Chapter 13: Gray Code / 311 \\
                 13-1 Gray Code / 311 \\
                 13-2 Incrementing a Gray-Coded Integer / 313 \\
                 13-3 Negabinary Gray Code / 315 \\
                 13-4 Brief History and Applications / 315 \\
                 Chapter 14: Cyclic Redundancy Check / 319 \\
                 14-1 Introduction / 319 \\
                 14-2 Theory / 320 \\
                 14-3 Practice / 323 \\
                 Chapter 15: Error-Correcting Codes / 331 \\
                 15-1 Introduction / 331 \\
                 15-2 The Hamming Code / 332 \\
                 15-3 Software for SEC-DED on 32 Information Bits / 337
                 \\
                 15-4 Error Correction Considered More Generally / 342
                 \\
                 Chapter 16: Hilbert's Curve / 355 \\
                 16-1 A Recursive Algorithm for Generating the Hilbert
                 Curve / 356 \\
                 16-2 Coordinates from Distance along the Hilbert Curve
                 / 358 \\
                 16-3 Distance from Coordinates on the Hilbert Curve /
                 366 \\
                 16-4 Incrementing the Coordinates on the Hilbert Curve
                 / 368 \\
                 16-5 Non-Recursive Generating Algorithms / 371 \\
                 16-6 Other Space-Filling Curves / 371 \\
                 16-7 Applications / 372 \\
                 Chapter 17: Floating-Point / 375 \\
                 17-1 IEEE Format / 375 \\
                 17-2 Floating-Point To/From Integer Conversions / 377
                 \\
                 17-3 Comparing Floating-Point Numbers Using Integer
                 Operations / 381 \\
                 17-4 An Approximate Reciprocal Square Root Routine /
                 383 \\
                 17-5 The Distribution of Leading Digits / 385 \\
                 17-6 Table of Miscellaneous Values / 387 \\
                 Chapter 18: Formulas for Primes / 391 \\
                 18-1 Introduction / 391 \\
                 18-2 Willans's Formulas / 393 \\
                 18-3 Wormell's Formula / 397 \\
                 18-4 Formulas for Other Difficult Functions / 398 \\
                 Answers to Exercises: / 405 \\
                 Appendix A: Arithmetic Tables for a 4-Bit Machine / 453
                 \\
                 Appendix B: Newton's Method / 457 \\
                 Appendix C: A Gallery of Graphs of Discrete Functions /
                 459 \\
                 C-1 Plots of Logical Operations on Integers / 459 \\
                 C-2 Plots of Addition, Subtraction, and Multiplication
                 / 461 \\
                 C-3 Plots of Functions Involving Division / 463 \\
                 C-4 Plots of the Compress, SAG, and Rotate Left
                 Functions / 464 \\
                 C-5 2D Plots of Some Unary Functions / 466 \\
                 Bibliography / 471 \\
                 Index / 481",
}


bibtype: book
filename: master.bib
label: Warwick:2004:HEB
author: Andrew Warwick and Jed Z. Buchwald
title: Histories of the Electron: The Birth of Microphysics
publisher: pub-MIT
address: pub-MIT:adr
pages: xi + 513
year: 2001
LCCN: QC793.5.E62 H57 2004
bibdate: Mon Feb 12 08:14:32 MST 2018
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2018.02.12 08:14:32 MST
series: Dibner Institute studies in the history of science and technology
subject: Science; History
acknowledgement: ack-nhfb
rawauthor: Andrew Warwick and Jed Z. Buchwald
rawtitle: Histories of the Electron: The Birth of Microphysics
ISBN:
0-262-02494-2 (hardcover), 0-262-52424-4 (paperback) OR 0262024942 (hardcover), 0262524244 (paperback)

ISBN13:
978-0-262-02494-5 (hardcover), 978-0-262-52424-7 (paperback) OR 9780262024945 (hardcover), 9780262524247 (paperback)

URL:
https://mitpress.mit.edu/books/histories-electron; https://www.scribd.com/document/216554790/Histories-of-the-Electron-The-Birth-of-Microphysics

abstract:
In the mid to late 1890s, J. J. Thomson and colleagues at Cambridge's Cavendish Laboratory conducted experiments on ``cathode rays'' (a form of radiation produced within evacuated glass vessels subjected to electric fields) --- the results of which some historians later viewed as the ``discovery'' of the electron. This book is both a biography of the electron and a history of the microphysical world that it opened up. The book is organized in four parts. The first part, booktitle Corpuscles and Electrons, considers the varying accounts of Thomson's role in the experimental production of the electron. The second part, booktitle What Was the Newborn Electron Good For?, examines how scientists used the new entity in physical and chemical investigations. The third part, booktitle Electrons Applied and Appropriated, explores the accommodation, or lack thereof, of the electron in nuclear physics, chemistry, and electrical science. It follows the electron's gradual progress from cathode ray to ubiquitous subatomic particle and eponymous entity in one of the world's most successful industries --- electronics. The fourth part, booktitle Philosophical Electrons, considers the role of the electron in issues of instrumentalism, epistemology, and realism. The electron, it turns out, can tell us a great deal about how science works.

TOC:
Introduction / Jed Z. Buchwald and Andrew Warwick I: Corpuscles and Electrons 1 J. J. Thomson and the Electron, 1897--1899 / George E. Smith 2 Corpuscles to Electrons / Isobel Falconer 3 The Questionable Matter of Electricity: the Reception of J. J. Thomson's ``Corpuscle'' Among Electrical Theorists and Technologists / Graeme Gooday 4 Paul Villard, J. J. Thomson, and the Composition of Cathode Rays / Benoit Lelong II: What Was the Newborn Electron Good For? 5 The Zeeman Effect and the Discovery of the Electron / Theodore Arabatzis 6 The Electron, the Protyle, and the Unity of Matter / Helge Kragh 7 0. W. Richardson and the Electron Theory of Matter, 1901--1916 / Ole Knudsen 8 Electron Gas Theory of Metals: Free Electrons in Bulk Matter / Walter Kaiser III: Electrons Applied and Appropriated 9 The Electron and the Nucleus / Laurie M. Brown 10 The Electron, the Hole, and the Transistor / Lillian Hoddeson and Michael Riordan 11 Remodeling A Classic: the Electron in Organic Chemistry, 1900--1940 / Mary Jo Nye 12 The Physicists' Electron and Its Appropriation by the Chemists / Kostas Gavroglu IV: Philosophical Electrons 13 Who Really Discovered the Electron? / Peter Achinstein 14 History and Metaphysics: On the Reality of Spin / Margaret Morrison 15 What Should Philosophers of Science Learn From The History of the Electron? / Jonathan Bain and John D. Norton 16 The Role of Theory in the Use of Instruments; or, How Much Do We Need to Know About Electrons. To Do Science With an Electron Microscope? / Nicolas Rasmussen and Alan Chalmers

rawabstract:
In the mid to late 1890s, J. J. Thomson and colleagues at Cambridge's Cavendish Laboratory conducted experiments on ``cathode rays'' (a form of radiation produced within evacuated glass vessels subjected to electric fields) --- the results of which some historians later viewed as the ``discovery'' of the electron. This book is both a biography of the electron and a history of the microphysical world that it opened up. The book is organized in four parts. The first part, \booktitle{Corpuscles and Electrons}, considers the varying accounts of Thomson's role in the experimental production of the electron. The second part, \booktitle{What Was the Newborn Electron Good For?}, examines how scientists used the new entity in physical and chemical investigations. The third part, \booktitle{Electrons Applied and Appropriated}, explores the accommodation, or lack thereof, of the electron in nuclear physics, chemistry, and electrical science. It follows the electron's gradual progress from cathode ray to ubiquitous subatomic particle and eponymous entity in one of the world's most successful industries --- electronics. The fourth part, \booktitle{Philosophical Electrons}, considers the role of the electron in issues of instrumentalism, epistemology, and realism. The electron, it turns out, can tell us a great deal about how science works.

rawTOC:
Introduction / Jed Z. Buchwald and Andrew Warwick \\ I: Corpuscles and Electrons \\ 1 J. J. Thomson and the Electron, 1897--1899 / George E. Smith \\ 2 Corpuscles to Electrons / Isobel Falconer \\ 3 The Questionable Matter of Electricity: the Reception of J. J. Thomson's ``Corpuscle'' Among Electrical Theorists and Technologists / Graeme Gooday \\ 4 Paul Villard, J. J. Thomson, and the Composition of Cathode Rays / Benoit Lelong \\ II: What Was the Newborn Electron Good For? \\ 5 The Zeeman Effect and the Discovery of the Electron / Theodore Arabatzis \\ 6 The Electron, the Protyle, and the Unity of Matter / Helge Kragh \\ 7 0. W. Richardson and the Electron Theory of Matter, 1901--1916 / Ole Knudsen \\ 8 Electron Gas Theory of Metals: Free Electrons in Bulk Matter / Walter Kaiser \\ III: Electrons Applied and Appropriated \\ 9 The Electron and the Nucleus / Laurie M. Brown \\ 10 The Electron, the Hole, and the Transistor / Lillian Hoddeson and Michael Riordan \\ 11 Remodeling A Classic: the Electron in Organic Chemistry, 1900--1940 / Mary Jo Nye \\ 12 The Physicists' Electron and Its Appropriation by the Chemists / Kostas Gavroglu \\ IV: Philosophical Electrons \\ 13 Who Really Discovered the Electron? / Peter Achinstein \\ 14 History and Metaphysics: On the Reality of Spin / Margaret Morrison \\ 15 What Should Philosophers of Science Learn From The History of the Electron? / Jonathan Bain and John D. Norton \\ 16 The Role of Theory in the Use of Instruments; or, How Much Do We Need to Know About Electrons. To Do Science With an Electron Microscope? / Nicolas Rasmussen and Alan Chalmers

entry:
@Book{Warwick:2004:HEB,
  author =       "Andrew Warwick and Jed Z. Buchwald",
  title =        "Histories of the Electron: The Birth of Microphysics",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "xi + 513",
  year =         "2001",
  ISBN =         "0-262-02494-2 (hardcover), 0-262-52424-4 (paperback)",
  ISBN-13 =      "978-0-262-02494-5 (hardcover), 978-0-262-52424-7
                 (paperback)",
  LCCN =         "QC793.5.E62 H57 2004",
  bibdate =      "Mon Feb 12 08:14:32 MST 2018",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Dibner Institute studies in the history of science and
                 technology",
  URL =          "https://mitpress.mit.edu/books/histories-electron;
                 https://www.scribd.com/document/216554790/Histories-of-the-Electron-The-Birth-of-Microphysics",
  abstract =     "In the mid to late 1890s, J. J. Thomson and colleagues
                 at Cambridge's Cavendish Laboratory conducted
                 experiments on ``cathode rays'' (a form of radiation
                 produced within evacuated glass vessels subjected to
                 electric fields) --- the results of which some
                 historians later viewed as the ``discovery'' of the
                 electron. This book is both a biography of the electron
                 and a history of the microphysical world that it opened
                 up. The book is organized in four parts. The first
                 part, \booktitle{Corpuscles and Electrons}, considers
                 the varying accounts of Thomson's role in the
                 experimental production of the electron. The second
                 part, \booktitle{What Was the Newborn Electron Good
                 For?}, examines how scientists used the new entity in
                 physical and chemical investigations. The third part,
                 \booktitle{Electrons Applied and Appropriated},
                 explores the accommodation, or lack thereof, of the
                 electron in nuclear physics, chemistry, and electrical
                 science. It follows the electron's gradual progress
                 from cathode ray to ubiquitous subatomic particle and
                 eponymous entity in one of the world's most successful
                 industries --- electronics. The fourth part,
                 \booktitle{Philosophical Electrons}, considers the role
                 of the electron in issues of instrumentalism,
                 epistemology, and realism. The electron, it turns out,
                 can tell us a great deal about how science works.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Science; History",
  tableofcontents = "Introduction / Jed Z. Buchwald and Andrew Warwick
                 \\
                 I: Corpuscles and Electrons \\
                 1 J. J. Thomson and the Electron, 1897--1899 / George
                 E. Smith \\
                 2 Corpuscles to Electrons / Isobel Falconer \\
                 3 The Questionable Matter of Electricity: the Reception
                 of J. J. Thomson's ``Corpuscle'' Among Electrical
                 Theorists and Technologists / Graeme Gooday \\
                 4 Paul Villard, J. J. Thomson, and the Composition of
                 Cathode Rays / Benoit Lelong \\
                 II: What Was the Newborn Electron Good For? \\
                 5 The Zeeman Effect and the Discovery of the Electron /
                 Theodore Arabatzis \\
                 6 The Electron, the Protyle, and the Unity of Matter /
                 Helge Kragh \\
                 7 0. W. Richardson and the Electron Theory of Matter,
                 1901--1916 / Ole Knudsen \\
                 8 Electron Gas Theory of Metals: Free Electrons in Bulk
                 Matter / Walter Kaiser \\
                 III: Electrons Applied and Appropriated \\
                 9 The Electron and the Nucleus / Laurie M. Brown \\
                 10 The Electron, the Hole, and the Transistor / Lillian
                 Hoddeson and Michael Riordan \\
                 11 Remodeling A Classic: the Electron in Organic
                 Chemistry, 1900--1940 / Mary Jo Nye \\
                 12 The Physicists' Electron and Its Appropriation by
                 the Chemists / Kostas Gavroglu \\
                 IV: Philosophical Electrons \\
                 13 Who Really Discovered the Electron? / Peter
                 Achinstein \\
                 14 History and Metaphysics: On the Reality of Spin /
                 Margaret Morrison \\
                 15 What Should Philosophers of Science Learn From The
                 History of the Electron? / Jonathan Bain and John D.
                 Norton \\
                 16 The Role of Theory in the Use of Instruments; or,
                 How Much Do We Need to Know About Electrons. To Do
                 Science With an Electron Microscope? / Nicolas
                 Rasmussen and Alan Chalmers",
}


bibtype: book
filename: master.bib
label: Watkins:2007:MEP
author: David S. Watkins
title: The Matrix Eigenvalue Problem: GR and Krylov Subspace Methods
volume: 101
publisher: pub-SIAM
address: pub-SIAM:adr
pages: x + 442
year: 2007
ISBN: 0-89871-641-1 OR 0898716411
ISBN13: 978-0-89871-641-2 OR 9780898716412
LCCN: QA193 .W38 2007
bibdate: Thu Nov 15 14:26:45 MST 2007
bibtimestamp: 2007.11.15 14:26:45 MST
series: Other titles in applied mathematics
subject: Eigenvalues; Invariant subspaces; Matrices
acknowledgement: ack-nhfb
rawauthor: David S. Watkins
rawtitle: The Matrix Eigenvalue Problem: {GR} and {Krylov} Subspace Methods
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

TOC:
Preface 1. Preliminary material 2. Basic theory of Eigensystems 3. Elimination 4. Iteration 5. Convergence 6. The generalized Eigenvalue problem 7. Inside the bulge 8. Product Eigenvalue problems 9. Krylov subspace methods Bibliography Index

rawTOC:
Preface \\ 1. Preliminary material \\ 2. Basic theory of Eigensystems \\ 3. Elimination \\ 4. Iteration \\ 5. Convergence \\ 6. The generalized Eigenvalue problem \\ 7. Inside the bulge \\ 8. Product Eigenvalue problems \\ 9. Krylov subspace methods \\ Bibliography \\ Index

entry:
@Book{Watkins:2007:MEP,
  author =       "David S. Watkins",
  title =        "The Matrix Eigenvalue Problem: {GR} and {Krylov}
                 Subspace Methods",
  volume =       "101",
  publisher =    pub-SIAM,
  address =      pub-SIAM:adr,
  pages =        "x + 442",
  year =         "2007",
  ISBN =         "0-89871-641-1",
  ISBN-13 =      "978-0-89871-641-2",
  LCCN =         "QA193 .W38 2007",
  bibdate =      "Thu Nov 15 14:26:45 MST 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/numana2000.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Other titles in applied mathematics",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "Eigenvalues; Invariant subspaces; Matrices",
  tableofcontents = "Preface \\
                 1. Preliminary material \\
                 2. Basic theory of Eigensystems \\
                 3. Elimination \\
                 4. Iteration \\
                 5. Convergence \\
                 6. The generalized Eigenvalue problem \\
                 7. Inside the bulge \\
                 8. Product Eigenvalue problems \\
                 9. Krylov subspace methods \\
                 Bibliography \\
                 Index",
}


bibtype: book
filename: master.bib
label: Watson:1990:FSC
author: Thomas J. Watson Jr.
title: Father Son & Co.: My Life at IBM and Beyond
publisher: pub-BANTAM
address: pub-BANTAM:adr
pages: xi + 468 + 32
year: 1990
ISBN: 0-553-07011-8 OR 0553070118
ISBN13: 978-0-553-07011-8 OR 9780553070118
LCCN: HD9696.C64 I4887 1990
bibdate: Wed Dec 15 10:59:01 1993
bibtimestamp: 1993.12.15 10:59:01 ???
note: Memoirs of IBM President Watson, the son of the founder of IBM.
acknowledgement: ack-nhfb
rawauthor: Thomas J. {Watson Jr.}
rawnote: Memoirs of IBM President Watson, the son of the founder of IBM.
rawtitle: Father Son \& Co.: My Life at {IBM} and Beyond
bibsource:
https://www.math.utah.edu/pub/tex/bib/annhistcomput.bib; https://www.math.utah.edu/pub/tex/bib/css.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

abstract:
Tom Watson, Jr., shares how he took IBM, the company founded by his father, through its spectacular growth burst which made it the leader of the computer age.

keywords:
executives --- United States --- biography; International Business Machines Corporation --- history; Watson, Thomas J., 1914

rawabstract:
Tom Watson, Jr., shares how he took IBM, the company founded by his father, through its spectacular growth burst which made it the leader of the computer age.

entry:
@Book{Watson:1990:FSC,
  author =       "Thomas J. {Watson Jr.}",
  title =        "Father Son \& Co.: My Life at {IBM} and Beyond",
  publisher =    pub-BANTAM,
  address =      pub-BANTAM:adr,
  pages =        "xi + 468 + 32",
  year =         "1990",
  ISBN =         "0-553-07011-8",
  ISBN-13 =      "978-0-553-07011-8",
  LCCN =         "HD9696.C64 I4887 1990",
  bibdate =      "Wed Dec 15 10:59:01 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/annhistcomput.bib;
                 https://www.math.utah.edu/pub/tex/bib/css.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Memoirs of IBM President Watson, the son of the
                 founder of IBM.",
  abstract =     "Tom Watson, Jr., shares how he took IBM, the company
                 founded by his father, through its spectacular growth
                 burst which made it the leader of the computer age.",
  acknowledgement = ack-nhfb,
  keywords =     "executives --- United States --- biography;
                 International Business Machines Corporation ---
                 history; Watson, Thomas J., 1914",
}


bibtype: book
filename: master.bib
label: Watts:2000:OGD
author: Niki Watts
title: Oxford Greek Dictionary: Greek--English, English--Greek
publisher: pub-BERKLEY-BOOKS
address: pub-BERKLEY-BOOKS:adr
edition: American
pages: x + 470
year: 2000
ISBN: 0-425-17600-2 OR 0425176002
ISBN13: 978-0-425-17600-9 OR 9780425176009
LCCN: PA1139.E5 O94 2000
bibdate: Sat Dec 24 16:29:17 2005
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2005.12.24 16:29:17 ???
acknowledgement: ack-nhfb
rawauthor: Niki Watts
rawtitle: {Oxford} {Greek} Dictionary: {Greek--English}, {English--Greek}
entry:
@Book{Watts:2000:OGD,
  author =       "Niki Watts",
  title =        "{Oxford} {Greek} Dictionary: {Greek--English},
                 {English--Greek}",
  publisher =    pub-BERKLEY-BOOKS,
  address =      pub-BERKLEY-BOOKS:adr,
  edition =      "{American}",
  pages =        "x + 470",
  year =         "2000",
  ISBN =         "0-425-17600-2",
  ISBN-13 =      "978-0-425-17600-9",
  LCCN =         "PA1139.E5 O94 2000",
  bibdate =      "Sat Dec 24 16:29:17 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Weart:2012:RNF
author: Spencer R. Weart
title: The rise of nuclear fear
publisher: pub-HARVARD
address: pub-HARVARD:adr
pages: ix + 367
year: 2012
ISBN: 0-674-05233-1 OR 0674052331
ISBN13: 978-0-674-05233-8 OR 9780674052338
LCCN: QC773 .W44 2012
bibdate: Wed Jun 11 16:19:34 MDT 2014
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2014.06.11 16:19:34 MDT
subject: Nuclear energy; History; Psychological aspects; Antinuclear movement; Radiation; Public opinion
acknowledgement: ack-nhfb
authordates: 1942--
rawauthor: Spencer R. Weart
rawtitle: The rise of nuclear fear
TOC:
Radioactive hopes Radioactive fears Radium: elixir or poison? The secret, the master, and the monster The destroyer of worlds The news from Hiroshima National defenses Atoms for peace Good and bad atoms The new blasphemy Death dust The imagination of survival The politics of survival Seeking shelter Fail/safe Reactor promises and poisons The debate explodes Energy choices Civilization or liberation? Watersheds The second nuclear age Deconstructing nuclear weapons Tyrants and terrorists The modern arcanum Artistic transmutations

rawTOC:
Radioactive hopes \\ Radioactive fears \\ Radium: elixir or poison? \\ The secret, the master, and the monster \\ The destroyer of worlds \\ The news from Hiroshima \\ National defenses \\ Atoms for peace \\ Good and bad atoms \\ The new blasphemy \\ Death dust \\ The imagination of survival \\ The politics of survival \\ Seeking shelter \\ Fail/safe \\ Reactor promises and poisons \\ The debate explodes \\ Energy choices \\ Civilization or liberation? \\ Watersheds \\ The second nuclear age \\ Deconstructing nuclear weapons \\ Tyrants and terrorists \\ The modern arcanum \\ Artistic transmutations

entry:
@Book{Weart:2012:RNF,
  author =       "Spencer R. Weart",
  title =        "The rise of nuclear fear",
  publisher =    pub-HARVARD,
  address =      pub-HARVARD:adr,
  pages =        "ix + 367",
  year =         "2012",
  ISBN =         "0-674-05233-1",
  ISBN-13 =      "978-0-674-05233-8",
  LCCN =         "QC773 .W44 2012",
  bibdate =      "Wed Jun 11 16:19:34 MDT 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  author-dates = "1942--",
  subject =      "Nuclear energy; History; Psychological aspects;
                 Antinuclear movement; Radiation; Public opinion",
  tableofcontents = "Radioactive hopes \\
                 Radioactive fears \\
                 Radium: elixir or poison? \\
                 The secret, the master, and the monster \\
                 The destroyer of worlds \\
                 The news from Hiroshima \\
                 National defenses \\
                 Atoms for peace \\
                 Good and bad atoms \\
                 The new blasphemy \\
                 Death dust \\
                 The imagination of survival \\
                 The politics of survival \\
                 Seeking shelter \\
                 Fail/safe \\
                 Reactor promises and poisons \\
                 The debate explodes \\
                 Energy choices \\
                 Civilization or liberation? \\
                 Watersheds \\
                 The second nuclear age \\
                 Deconstructing nuclear weapons \\
                 Tyrants and terrorists \\
                 The modern arcanum \\
                 Artistic transmutations",
}


