# bibtab

bibtype: book
filename: master.bib
label: Salomon:1998:DCC
author: David Salomon
title: Data Compression: The Complete Reference
publisher: pub-SV
address: pub-SV:adr
pages: xx + 427
year: 1998
ISBN: 0-387-98280-9 OR 0387982809
ISBN13: 978-0-387-98280-9 OR 9780387982809
LCCN: QA76.9.D33S25 1997
bibdate: Fri Sep 10 09:21:56 1999
bibtimestamp: 1999.09.10 09:21:56 ???
URL: http://www.booksbydavidsalomon.com/; http://www.ecs.csun.edu/~dxs/DCadvertis/DcompAd.html
subject: Data compression (Computer science)
acknowledgement: ack-nhfb
rawauthor: David Salomon
rawtitle: Data Compression: The Complete Reference
bibsource:
https://www.math.utah.edu/pub/tex/bib/datacompression.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

abstract:
Data compression is one of the most important techniques in computing engineering. From archiving data to CD-ROMs and from coding theory to image analysis, many facets of computing make use of data compression in one form or another. This book is intended to provide an overview of the many different types of compression: it includes a taxonomy, an analysis of the most common systems of compression, discussion of their relative benefits and disadvantages, and their most common usages. Readers are presupposed to have a basic understanding of computer science: essentially the storage of data in bytes and bits and computing terminology, but otherwise this book is self-contained. The book divides naturally into four main parts based on the main branches of data compression: run length encoding, statistical methods, dictionary-based methods, and lossy image compression (where in contrast to the other techniques, information in the data may be lossed but an acceptable standard of image quality retained). Detailed descriptions of many of the most well-known compression techniques are covered including: Zip, BinHex, Huffman coding, GIF and many others.

TOC:
Preface 1: Basic Techniques 2: Statistical Methods 3: Dictionary Methods 4: Image Compression 5: Other Methods A: ASCII Code B: Bibliography C: Curves That Fill Space D: Determinants and Matrices E: Error Correcting Codes F: Fourier Transform G: Group 4 Codes Summary H: Hashing I: Interpolating Polynomials Answers to Exercises Glossary Index

rawabstract:
Data compression is one of the most important techniques in computing engineering. From archiving data to CD-ROMs and from coding theory to image analysis, many facets of computing make use of data compression in one form or another. This book is intended to provide an overview of the many different types of compression: it includes a taxonomy, an analysis of the most common systems of compression, discussion of their relative benefits and disadvantages, and their most common usages. Readers are presupposed to have a basic understanding of computer science: essentially the storage of data in bytes and bits and computing terminology, but otherwise this book is self-contained. The book divides naturally into four main parts based on the main branches of data compression: run length encoding, statistical methods, dictionary-based methods, and lossy image compression (where in contrast to the other techniques, information in the data may be lossed but an acceptable standard of image quality retained). Detailed descriptions of many of the most well-known compression techniques are covered including: Zip, BinHex, Huffman coding, GIF and many others.

rawTOC:
Preface \\ 1: Basic Techniques \\ 2: Statistical Methods \\ 3: Dictionary Methods \\ 4: Image Compression \\ 5: Other Methods \\ A: ASCII Code \\ B: Bibliography \\ C: Curves That Fill Space \\ D: Determinants and Matrices \\ E: Error Correcting Codes \\ F: Fourier Transform \\ G: Group 4 Codes Summary \\ H: Hashing \\ I: Interpolating Polynomials \\ Answers to Exercises \\ Glossary \\ Index

entry:
@Book{Salomon:1998:DCC,
  author =       "David Salomon",
  title =        "Data Compression: The Complete Reference",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xx + 427",
  year =         "1998",
  ISBN =         "0-387-98280-9",
  ISBN-13 =      "978-0-387-98280-9",
  LCCN =         "QA76.9.D33S25 1997",
  bibdate =      "Fri Sep 10 09:21:56 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$39.95",
  URL =          "http://www.booksbydavidsalomon.com/;
                 http://www.ecs.csun.edu/~dxs/DCadvertis/DcompAd.html",
  abstract =     "Data compression is one of the most important
                 techniques in computing engineering. From archiving
                 data to CD-ROMs and from coding theory to image
                 analysis, many facets of computing make use of data
                 compression in one form or another. This book is
                 intended to provide an overview of the many different
                 types of compression: it includes a taxonomy, an
                 analysis of the most common systems of compression,
                 discussion of their relative benefits and
                 disadvantages, and their most common usages. Readers
                 are presupposed to have a basic understanding of
                 computer science: essentially the storage of data in
                 bytes and bits and computing terminology, but otherwise
                 this book is self-contained. The book divides naturally
                 into four main parts based on the main branches of data
                 compression: run length encoding, statistical methods,
                 dictionary-based methods, and lossy image compression
                 (where in contrast to the other techniques, information
                 in the data may be lossed but an acceptable standard of
                 image quality retained). Detailed descriptions of many
                 of the most well-known compression techniques are
                 covered including: Zip, BinHex, Huffman coding, GIF and
                 many others.",
  acknowledgement = ack-nhfb,
  subject =      "Data compression (Computer science)",
  tableofcontents = "Preface \\
                 1: Basic Techniques \\
                 2: Statistical Methods \\
                 3: Dictionary Methods \\
                 4: Image Compression \\
                 5: Other Methods \\
                 A: ASCII Code \\
                 B: Bibliography \\
                 C: Curves That Fill Space \\
                 D: Determinants and Matrices \\
                 E: Error Correcting Codes \\
                 F: Fourier Transform \\
                 G: Group 4 Codes Summary \\
                 H: Hashing \\
                 I: Interpolating Polynomials \\
                 Answers to Exercises \\
                 Glossary \\
                 Index",
}


bibtype: book
filename: master.bib
label: Salomon:1999:CGG
author: David Salomon
title: Computer Graphics and Geometric Modeling
publisher: pub-SV
address: pub-SV:adr
pages: xviii + 851
year: 1999
ISBN: 0-387-98682-0 OR 0387986820
ISBN13: 978-0-387-98682-1 OR 9780387986821
LCCN: T385 S243 1999
bibdate: Sat Jan 26 12:46:16 MST 2013
bibtimestamp: 2013.01.26 12:46:16 MST
URL: http://www.booksbydavidsalomon.com/; http://www.ecs.csun.edu/~dxs/CGGMadvertis/CGad.html
acknowledgement: ack-ds
rawauthor: David Salomon
rawtitle: Computer Graphics and Geometric Modeling
abstract:
This is a book for those interested in understanding how graphics programs work and how present-day computer graphics can generate realistic-looking curves, surfaces, and solid objects. The book emphasizes the mathematics behind computer graphics, and most of the required mathematics is included in an appendix. With its numerous illustrative examples and (solved) exercises, the book makes a splendid text for a two-semester course in computer graphics for advanced undergraduate or graduate students. It also serves as a fine reference for professionals in the computer graphics field.

TOC:
1: First Principles 2: Scan-Converting Methods 3: Transformations and Projections 4: Curves 5: Surfaces 6: Rendering 7: Color 8: Computer Animation 9: Image Compression 10: Short Topics Appendix: Mathematical Topics

rawabstract:
This is a book for those interested in understanding how graphics programs work and how present-day computer graphics can generate realistic-looking curves, surfaces, and solid objects. The book emphasizes the mathematics behind computer graphics, and most of the required mathematics is included in an appendix. With its numerous illustrative examples and (solved) exercises, the book makes a splendid text for a two-semester course in computer graphics for advanced undergraduate or graduate students. It also serves as a fine reference for professionals in the computer graphics field.

rawTOC:
1: First Principles \\ 2: Scan-Converting Methods \\ 3: Transformations and Projections \\ 4: Curves \\ 5: Surfaces \\ 6: Rendering \\ 7: Color \\ 8: Computer Animation \\ 9: Image Compression \\ 10: Short Topics \\ Appendix: Mathematical Topics

entry:
@Book{Salomon:1999:CGG,
  author =       "David Salomon",
  title =        "Computer Graphics and Geometric Modeling",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xviii + 851",
  year =         "1999",
  ISBN =         "0-387-98682-0",
  ISBN-13 =      "978-0-387-98682-1",
  LCCN =         "T385 S243 1999",
  bibdate =      "Sat Jan 26 12:46:16 MST 2013",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://www.booksbydavidsalomon.com/;
                 http://www.ecs.csun.edu/~dxs/CGGMadvertis/CGad.html",
  abstract =     "This is a book for those interested in understanding
                 how graphics programs work and how present-day computer
                 graphics can generate realistic-looking curves,
                 surfaces, and solid objects. The book emphasizes the
                 mathematics behind computer graphics, and most of the
                 required mathematics is included in an appendix. With
                 its numerous illustrative examples and (solved)
                 exercises, the book makes a splendid text for a
                 two-semester course in computer graphics for advanced
                 undergraduate or graduate students. It also serves as a
                 fine reference for professionals in the computer
                 graphics field.",
  acknowledgement = ack-ds # " and " # ack-nhfb,
  rawdata-1 =    "Salomon, David (1999) {\it Computer Graphics and
                 Geometric Modeling}, New York, Springer.",
  rawdata-2 =    "Salomon, David (1999) {\it Computer Graphics and
                 Geometric Modeling}, New York, Springer-Verlag.",
  tableofcontents = "1: First Principles \\
                 2: Scan-Converting Methods \\
                 3: Transformations and Projections \\
                 4: Curves \\
                 5: Surfaces \\
                 6: Rendering \\
                 7: Color \\
                 8: Computer Animation \\
                 9: Image Compression \\
                 10: Short Topics \\
                 Appendix: Mathematical Topics",
}


bibtype: book
filename: master.bib
label: Salomon:2000:DCC
author: David Salomon
title: Data Compression: The Complete Reference
publisher: pub-SV
address: pub-SV:adr
edition: Second
pages: xvi + 823
year: 2000
ISBN: 0-387-95045-1 OR 0387950451
ISBN13: 978-0-387-95045-7 OR 9780387950457
LCCN: QA76.9.D33 S25 2000
bibdate: Mon Oct 16 05:47:11 2000
bibtimestamp: 2000.10.16 05:47:11 ???
URL: http://www.booksbydavidsalomon.com/; http://www.ecs.csun.edu/~dxs/DCadvertis/Dcomp2Ad.html
subject: Data compression (Computer science)
acknowledgement: ack-ds
rawauthor: David Salomon
rawtitle: Data Compression: The Complete Reference
bibsource:
clio-db.cc.columbia.edu:7090/Voyager; https://www.math.utah.edu/pub/tex/bib/datacompression.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

abstract:
This new edition of Data Compression provides a comprehensive reference for the many different types and methods of compression. Included are a detailed and helpful taxonomy, a description of most common methods, and discussions on the use and comparative benefits of methods and descriptions of ``how to'' use them. The presentation is organized into the main branches of the field of data compression: run length encoding, statistical methods, dictionary-based methods, image compression, audio compression, and video compression.par The book provides an invaluable reference and guide for all computer scientists, computer engineers, electrical engineers, signal/image processing engineers, and other scientists needing a comprehensive compilation for a broad range of compression methods.

TOC:
1. Basic Techniques 2. Statistical Methods 3. Dictionary Methods 4. Image Compression 5. Wavelet Methods 6. Video Compression 7. Audio Compression 8. Other Methods Joining the Data Compression Community

rawabstract:
This new edition of Data Compression provides a comprehensive reference for the many different types and methods of compression. Included are a detailed and helpful taxonomy, a description of most common methods, and discussions on the use and comparative benefits of methods and descriptions of ``how to'' use them. The presentation is organized into the main branches of the field of data compression: run length encoding, statistical methods, dictionary-based methods, image compression, audio compression, and video compression.\par The book provides an invaluable reference and guide for all computer scientists, computer engineers, electrical engineers, signal/image processing engineers, and other scientists needing a comprehensive compilation for a broad range of compression methods.

rawTOC:
1. Basic Techniques \\ 2. Statistical Methods \\ 3. Dictionary Methods \\ 4. Image Compression \\ 5. Wavelet Methods \\ 6. Video Compression \\ 7. Audio Compression \\ 8. Other Methods \\ Joining the Data Compression Community

entry:
@Book{Salomon:2000:DCC,
  author =       "David Salomon",
  title =        "Data Compression: The Complete Reference",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Second",
  pages =        "xvi + 823",
  year =         "2000",
  ISBN =         "0-387-95045-1",
  ISBN-13 =      "978-0-387-95045-7",
  LCCN =         "QA76.9.D33 S25 2000",
  bibdate =      "Mon Oct 16 05:47:11 2000",
  bibsource =    "clio-db.cc.columbia.edu:7090/Voyager;
                 https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$39.95",
  URL =          "http://www.booksbydavidsalomon.com/;
                 http://www.ecs.csun.edu/~dxs/DCadvertis/Dcomp2Ad.html",
  abstract =     "This new edition of Data Compression provides a
                 comprehensive reference for the many different types
                 and methods of compression. Included are a detailed and
                 helpful taxonomy, a description of most common methods,
                 and discussions on the use and comparative benefits of
                 methods and descriptions of ``how to'' use them. The
                 presentation is organized into the main branches of the
                 field of data compression: run length encoding,
                 statistical methods, dictionary-based methods, image
                 compression, audio compression, and video
                 compression.\par

                 The book provides an invaluable reference and guide for
                 all computer scientists, computer engineers, electrical
                 engineers, signal/image processing engineers, and other
                 scientists needing a comprehensive compilation for a
                 broad range of compression methods.",
  acknowledgement = ack-ds # " and " # ack-nhfb,
  rawdata =      "Salomon, David (2000) {\it Data Compression: The
                 Complete Reference}, New York, Springer-Verlag.",
  subject =      "Data compression (Computer science)",
  tableofcontents = "1. Basic Techniques \\
                 2. Statistical Methods \\
                 3. Dictionary Methods \\
                 4. Image Compression \\
                 5. Wavelet Methods \\
                 6. Video Compression \\
                 7. Audio Compression \\
                 8. Other Methods \\
                 Joining the Data Compression Community",
}


bibtype: book
filename: master.bib
label: Salomon:2002:GDC
author: David Salomon
title: A Guide to Data Compression Methods
publisher: pub-SV
address: pub-SV:adr
pages: xii + 295
year: 2002
ISBN: 0-387-95260-8 (paperback) OR 0387952608 (paperback)
ISBN13: 978-0-387-95260-4 (paperback) OR 9780387952604 (paperback)
LCCN: QA76.9.D33 S28 2001
bibdate: Tue Mar 12 16:09:14 2002
bibtimestamp: 2002.03.12 16:09:14 ???
URL: http://www.booksbydavidsalomon.com/
acknowledgement: ack-nhfb
rawauthor: David Salomon
rawtitle: A Guide to Data Compression Methods
bibsource:
clas.caltech.edu:210/INNOPAC; https://www.math.utah.edu/pub/tex/bib/datacompression.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

TOC:
1. Statistical Methods 1. Entropy 2. Variable-Size Codes 3. Decoding 4. Huffman Coding 5. Adaptive Huffman Coding 6. Facsimile Compression 7. Arithmetic Coding 8. Adaptive Arithmetic Coding 2. Dictionary Methods 1. LZ77 (Sliding Window) 2. LZSS 3. LZ78 4. LZW 5. Summary 3. Image Compression 1. Introduction 2. Image Types 3. Approaches to Image Compression 4. Intuitive Methods 5. Image Transforms 6. Progressive Image Compression 7. JPEG 8. JPEG-LS 4. Wavelet Methods 1. Averaging and Differencing 2. The Haar Transform 3. Subband Transforms 4. Filter Banks 5. Deriving the Filter Coefficients 6. The DWT 7. Examples 8. The Daubechies Wavelets 9. SPIHT 5. Video Compression 1. Basic Principles 2. Suboptimal Search Methods 6. Audio Compression 1. Sound 2. Digital Audio 3. The Human Auditory System 4. Conventional Methods 5. MPEG-1 Audio Layers Joining the Data Compression Community App. of Algorithms

rawTOC:
1. Statistical Methods \\ 1. Entropy \\ 2. Variable-Size Codes \\ 3. Decoding \\ 4. Huffman Coding \\ 5. Adaptive Huffman Coding \\ 6. Facsimile Compression \\ 7. Arithmetic Coding \\ 8. Adaptive Arithmetic Coding \\ 2. Dictionary Methods \\ 1. LZ77 (Sliding Window) \\ 2. LZSS \\ 3. LZ78 \\ 4. LZW \\ 5. Summary \\ 3. Image Compression \\ 1. Introduction \\ 2. Image Types \\ 3. Approaches to Image Compression \\ 4. Intuitive Methods \\ 5. Image Transforms \\ 6. Progressive Image Compression \\ 7. JPEG \\ 8. JPEG-LS \\ 4. Wavelet Methods \\ 1. Averaging and Differencing \\ 2. The Haar Transform \\ 3. Subband Transforms \\ 4. Filter Banks \\ 5. Deriving the Filter Coefficients \\ 6. The DWT \\ 7. Examples \\ 8. The Daubechies Wavelets \\ 9. SPIHT \\ 5. Video Compression \\ 1. Basic Principles \\ 2. Suboptimal Search Methods \\ 6. Audio Compression \\ 1. Sound \\ 2. Digital Audio \\ 3. The Human Auditory System \\ 4. Conventional Methods \\ 5. MPEG-1 Audio Layers \\ Joining the Data Compression Community \\ App. of Algorithms

entry:
@Book{Salomon:2002:GDC,
  author =       "David Salomon",
  title =        "A Guide to Data Compression Methods",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xii + 295",
  year =         "2002",
  ISBN =         "0-387-95260-8 (paperback)",
  ISBN-13 =      "978-0-387-95260-4 (paperback)",
  LCCN =         "QA76.9.D33 S28 2001",
  bibdate =      "Tue Mar 12 16:09:14 2002",
  bibsource =    "clas.caltech.edu:210/INNOPAC;
                 https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://www.booksbydavidsalomon.com/",
  acknowledgement = ack-nhfb,
  tableofcontents = "1. Statistical Methods \\
                 1. Entropy \\
                 2. Variable-Size Codes \\
                 3. Decoding \\
                 4. Huffman Coding \\
                 5. Adaptive Huffman Coding \\
                 6. Facsimile Compression \\
                 7. Arithmetic Coding \\
                 8. Adaptive Arithmetic Coding \\
                 2. Dictionary Methods \\
                 1. LZ77 (Sliding Window) \\
                 2. LZSS \\
                 3. LZ78 \\
                 4. LZW \\
                 5. Summary \\
                 3. Image Compression \\
                 1. Introduction \\
                 2. Image Types \\
                 3. Approaches to Image Compression \\
                 4. Intuitive Methods \\
                 5. Image Transforms \\
                 6. Progressive Image Compression \\
                 7. JPEG \\
                 8. JPEG-LS \\
                 4. Wavelet Methods \\
                 1. Averaging and Differencing \\
                 2. The Haar Transform \\
                 3. Subband Transforms \\
                 4. Filter Banks \\
                 5. Deriving the Filter Coefficients \\
                 6. The DWT \\
                 7. Examples \\
                 8. The Daubechies Wavelets \\
                 9. SPIHT \\
                 5. Video Compression \\
                 1. Basic Principles \\
                 2. Suboptimal Search Methods \\
                 6. Audio Compression \\
                 1. Sound \\
                 2. Digital Audio \\
                 3. The Human Auditory System \\
                 4. Conventional Methods \\
                 5. MPEG-1 Audio Layers \\
                 Joining the Data Compression Community \\
                 App. of Algorithms",
}


bibtype: book
filename: master.bib
label: Salomon:2003:DPS
author: David Salomon
title: Data Privacy and Security
publisher: pub-SV
address: pub-SV:adr
pages: xiv + 465
year: 2003
ISBN: 0-387-00311-8 OR 0387003118
ISBN13: 978-0-387-00311-5 OR 9780387003115
LCCN: QA76.9.A25 S265 2003
bibdate: Mon Jun 16 18:35:35 2003
bibtimestamp: 2003.06.16 18:35:35 ???
URL: http://www.booksbydavidsalomon.com/
acknowledgement: ack-nhfb
rawauthor: David Salomon
rawtitle: Data Privacy and Security
bibsource:
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib; https://www.math.utah.edu/pub/tex/bib/datacompression.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/sigact.bib; https://www.math.utah.edu/pub/tex/bib/texbook2.bib

abstract:
This integrated volume focuses on keeping data secure and private and covers classical cryptography, modern cryptography, and steganography. Each topic is presented and explained by describing various methods, techniques, and algorithms. Moreover, there are numerous helpful examples to reinforce the reader's understanding and expertise with these techniques and methodologies.

TOC:
Part I: Data Encryption 1: Monoalphabetic Substitution Ciphers 2: Transposition Ciphers 3: Polyalphabetic Substitution Ciphers 4: Random Numbers 5: The Enigma 6: Stream Ciphers 7: Block Ciphers 8: Public-Key Cryptography 9: Quantum Cryptography Part II: Data Hiding 10: Data Hiding in Text 11: Data Hiding in Images 12: Data Hiding: Other Methods Part III: Essential Resources Appendix A: Convolution Appendix B: Hashing Appendix C: Cyclic Redundancy Codes Appendix D: Galois Fields

rawabstract:
This integrated volume focuses on keeping data secure and private and covers classical cryptography, modern cryptography, and steganography. Each topic is presented and explained by describing various methods, techniques, and algorithms. Moreover, there are numerous helpful examples to reinforce the reader's understanding and expertise with these techniques and methodologies.

rawTOC:
Part I: Data Encryption \\ 1: Monoalphabetic Substitution Ciphers \\ 2: Transposition Ciphers \\ 3: Polyalphabetic Substitution Ciphers \\ 4: Random Numbers \\ 5: The Enigma \\ 6: Stream Ciphers \\ 7: Block Ciphers \\ 8: Public-Key Cryptography \\ 9: Quantum Cryptography \\ Part II: Data Hiding \\ 10: Data Hiding in Text \\ 11: Data Hiding in Images \\ 12: Data Hiding: Other Methods \\ Part III: Essential Resources \\ Appendix A: Convolution \\ Appendix B: Hashing \\ Appendix C: Cyclic Redundancy Codes \\ Appendix D: Galois Fields

entry:
@Book{Salomon:2003:DPS,
  author =       "David Salomon",
  title =        "Data Privacy and Security",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xiv + 465",
  year =         "2003",
  ISBN =         "0-387-00311-8",
  ISBN-13 =      "978-0-387-00311-5",
  LCCN =         "QA76.9.A25 S265 2003",
  bibdate =      "Mon Jun 16 18:35:35 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook2.bib",
  price =        "US\$59.95",
  URL =          "http://www.booksbydavidsalomon.com/",
  abstract =     "This integrated volume focuses on keeping data secure
                 and private and covers classical cryptography, modern
                 cryptography, and steganography. Each topic is
                 presented and explained by describing various methods,
                 techniques, and algorithms. Moreover, there are
                 numerous helpful examples to reinforce the reader's
                 understanding and expertise with these techniques and
                 methodologies.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Part I: Data Encryption \\
                 1: Monoalphabetic Substitution Ciphers \\
                 2: Transposition Ciphers \\
                 3: Polyalphabetic Substitution Ciphers \\
                 4: Random Numbers \\
                 5: The Enigma \\
                 6: Stream Ciphers \\
                 7: Block Ciphers \\
                 8: Public-Key Cryptography \\
                 9: Quantum Cryptography \\
                 Part II: Data Hiding \\
                 10: Data Hiding in Text \\
                 11: Data Hiding in Images \\
                 12: Data Hiding: Other Methods \\
                 Part III: Essential Resources \\
                 Appendix A: Convolution \\
                 Appendix B: Hashing \\
                 Appendix C: Cyclic Redundancy Codes \\
                 Appendix D: Galois Fields",
}


bibtype: book
filename: master.bib
label: Salomon:2004:DCC
author: David Salomon
title: Data Compression: The Complete Reference
publisher: pub-SV
address: pub-SV:adr
edition: Third
pages: xx + 898
year: 2004
ISBN: 0-387-40697-2 OR 0387406972
ISBN13: 978-0-387-40697-8 OR 9780387406978
LCCN: QA76.9.D33 S25 2004
bibdate: Wed Apr 28 13:21:19 2004
bibtimestamp: 2004.04.28 13:21:19 ???
URL: http://www.booksbydavidsalomon.com/; http://www.ecs.csun.edu/~dsalomon/DC3advertis/DComp3Ad.html
acknowledgement: ack-ds
rawauthor: David Salomon
rawtitle: Data Compression: The Complete Reference
bibsource:
https://www.math.utah.edu/pub/tex/bib/datacompression.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/texbook2.bib

abstract:
This substantially enhanced reference is an essential resource and companion for all computer scientists, computer electrical, and signal image processing engineers, and scientists needing a comprehensive compilation of compression methods. It requires only a minimum of mathematics and is well suited to nonspecialists and general readers.

TOC:
1. Basic techniques 1.1 Intuitive compression 1.2 Run-length encoding 1.3 RLE text compression 1.4 RLE image compression 1.5 Move-to-front coding 1.6 Scalar quantization 2. Statistical methods 2.1 Information theory concepts 2.2 Variable-size codes 2.3 Prefix codes 2.4 The Golomb code 2.5 The Kraft--MacMillan inequality 2.6 The counting argument 2.7 Shannon--Fano coding 2.8 Huffman coding 2.9 Adaptive Huffman coding 2.10 MNP5 2.11 MNP7 2.12 Reliability 2.13 Facsimile compression 2.14 Arithmetic coding 2.16 The QM coder 2.17 Text compression 2.18 PPM 2.19 Context-tree weighting 3. Dictionary methods 3.1 String compression 3.2 Simple dictionary compression 3.3 LZ77 (sliding window) 3.4 LZSS 3.5 Repetition times 3.6 QIC-122 3.7 LZX 3.8 File differencing: VCDIFF 3.9 LZ78 3.10 LZFG 3.11 LZRW1 3.12 LZRW4 3.13 LZW 3.14 LZMW 3.15 LZAP 3.16 LZY 3.17 LZP 3.18 Repetition finder 3.19 UNIX compression 3.20 GIF images 3.21 The V.42vis protocol 3.22 Various LZ applications 3.23 Deflate: Zip and Gzip 3.24 PNG 3.25 XML compression: XMill 3.26 EXE compressors 3.27 CRC 3.28 Summary 3.29 Data compression patents 3.30 A unification 4. Image compression 4.1 Introduction 4.2 Approaches to image compression 4.3 Intuitive methods 4.4 Image transforms 4.5 Orthogonal transforms 4.6 The discrete cosine transform 4.7 Test images 4.8 JPEG 4.9 JPEG-LS 4.10 Progressive image compression 4.11 JBIG 4.12 JBIG2 4.13 Simple images: EIDAC 4.14 Vector quantization 4.15 Adaptive vector quantization 4.16 Block matching 4.17 Block truncation coding 4.18 Context-based methods 4.19 FELICS 4.20 Progressive FELICS 4.21 MLP 4.22 Adaptive Golomb 4.23 PPPM 4.24 CALIC 4.25 Differential lossless compression 4.26 DPCM 4.27 Context-tree weighting 4.28 Block decomposition 4.29 Binary tree predictive coding 4.30 Quadtrees 4.31 Quadrisection 4.32 Space-filling curves 4.33 Hilbert scan and VQ 4.34 Finite automata methods 4.35 Iterated function systems 4.36 Cell encoding 5. Wavelet methods 5.1 Fourier transform 5.2 The frequency domain 5.3 The uncertainty principle 5.4 Fourier image compression 5.5 The CWT and its inverse 5.6 The Haar transform 5.7 Filter banks 5.8 The DWT 5.9 Multiresolution decomposition 5.10 Various image decompositions 5.11 The lifting scheme 5.12 The IWT 5.13 The Laplacian pyramid 5.14 SPIHT 5.15 CREW 5.16 EZW 5.17 DjVu 5.18 WSQ, fingerprint compression 5.19 JPEG 2000 6. Video compression 6.1 Analog video 6.2 Composite and components video 6.3 Digital video 6.4 Video compression 6.5 MPEG 6.6 MPEG-4 6.7 H.261 7. Audio compression 7.1 Sound 7.2 Digital audio 7.3 The human auditory system 7.4 $mu $-law and A-law companding 7.5 ADPCM audio compression 7.6 MLP audio 7.7 Speech compression 7.8 Shorten 7.9 MPEG-1 audio layers 8. Other methods 8.1 The Burrows--Wheeler method 8.2 Symbol ranking 8.3 ACB 8.4 Sort-based context similarity 8.5 Sparse strings 8.6 Word-based text compression 8.7 Textual image compression 8.8 Dynamic Markov coding 8.9 FHM curve compression 8.10 Sequitur 8.11 Triangle mesh compression: Edgebreaker 8.12 SCSU: Unicode compression Bibliography Glossary Joining the Data Compression Community Index

rawabstract:
This substantially enhanced reference is an essential resource and companion for all computer scientists, computer electrical, and signal image processing engineers, and scientists needing a comprehensive compilation of compression methods. It requires only a minimum of mathematics and is well suited to nonspecialists and general readers.

rawTOC:
1. Basic techniques \\ 1.1 Intuitive compression \\ 1.2 Run-length encoding \\ 1.3 RLE text compression \\ 1.4 RLE image compression \\ 1.5 Move-to-front coding \\ 1.6 Scalar quantization \\ 2. Statistical methods \\ 2.1 Information theory concepts \\ 2.2 Variable-size codes \\ 2.3 Prefix codes \\ 2.4 The Golomb code \\ 2.5 The Kraft--MacMillan inequality \\ 2.6 The counting argument \\ 2.7 Shannon--Fano coding \\ 2.8 Huffman coding \\ 2.9 Adaptive Huffman coding \\ 2.10 MNP5 \\ 2.11 MNP7 \\ 2.12 Reliability \\ 2.13 Facsimile compression \\ 2.14 Arithmetic coding \\ 2.16 The QM coder \\ 2.17 Text compression \\ 2.18 PPM \\ 2.19 Context-tree weighting \\ 3. Dictionary methods \\ 3.1 String compression \\ 3.2 Simple dictionary compression \\ 3.3 LZ77 (sliding window) \\ 3.4 LZSS \\ 3.5 Repetition times \\ 3.6 QIC-122 \\ 3.7 LZX \\ 3.8 File differencing: VCDIFF \\ 3.9 LZ78 \\ 3.10 LZFG \\ 3.11 LZRW1 \\ 3.12 LZRW4 \\ 3.13 LZW \\ 3.14 LZMW \\ 3.15 LZAP \\ 3.16 LZY \\ 3.17 LZP \\ 3.18 Repetition finder \\ 3.19 UNIX compression \\ 3.20 GIF images \\ 3.21 The V.42vis protocol \\ 3.22 Various LZ applications \\ 3.23 Deflate: Zip and Gzip \\ 3.24 PNG \\ 3.25 XML compression: XMill \\ 3.26 EXE compressors \\ 3.27 CRC \\ 3.28 Summary \\ 3.29 Data compression patents \\ 3.30 A unification \\ 4. Image compression \\ 4.1 Introduction \\ 4.2 Approaches to image compression \\ 4.3 Intuitive methods \\ 4.4 Image transforms \\ 4.5 Orthogonal transforms \\ 4.6 The discrete cosine transform \\ 4.7 Test images \\ 4.8 JPEG \\ 4.9 JPEG-LS \\ 4.10 Progressive image compression \\ 4.11 JBIG \\ 4.12 JBIG2 \\ 4.13 Simple images: EIDAC \\ 4.14 Vector quantization \\ 4.15 Adaptive vector quantization \\ 4.16 Block matching \\ 4.17 Block truncation coding \\ 4.18 Context-based methods \\ 4.19 FELICS \\ 4.20 Progressive FELICS \\ 4.21 MLP \\ 4.22 Adaptive Golomb \\ 4.23 PPPM \\ 4.24 CALIC \\ 4.25 Differential lossless compression \\ 4.26 DPCM \\ 4.27 Context-tree weighting \\ 4.28 Block decomposition \\ 4.29 Binary tree predictive coding \\ 4.30 Quadtrees \\ 4.31 Quadrisection \\ 4.32 Space-filling curves \\ 4.33 Hilbert scan and VQ \\ 4.34 Finite automata methods \\ 4.35 Iterated function systems \\ 4.36 Cell encoding \\ 5. Wavelet methods \\ 5.1 Fourier transform \\ 5.2 The frequency domain \\ 5.3 The uncertainty principle \\ 5.4 Fourier image compression \\ 5.5 The CWT and its inverse \\ 5.6 The Haar transform \\ 5.7 Filter banks \\ 5.8 The DWT \\ 5.9 Multiresolution decomposition \\ 5.10 Various image decompositions \\ 5.11 The lifting scheme \\ 5.12 The IWT \\ 5.13 The Laplacian pyramid \\ 5.14 SPIHT \\ 5.15 CREW \\ 5.16 EZW \\ 5.17 DjVu \\ 5.18 WSQ, fingerprint compression \\ 5.19 JPEG 2000 \\ 6. Video compression \\ 6.1 Analog video \\ 6.2 Composite and components video \\ 6.3 Digital video \\ 6.4 Video compression \\ 6.5 MPEG \\ 6.6 MPEG-4 \\ 6.7 H.261 \\ 7. Audio compression \\ 7.1 Sound \\ 7.2 Digital audio \\ 7.3 The human auditory system \\ 7.4 $\mu$-law and A-law companding \\ 7.5 ADPCM audio compression \\ 7.6 MLP audio \\ 7.7 Speech compression \\ 7.8 Shorten \\ 7.9 MPEG-1 audio layers \\ 8. Other methods \\ 8.1 The Burrows--Wheeler method \\ 8.2 Symbol ranking \\ 8.3 ACB \\ 8.4 Sort-based context similarity \\ 8.5 Sparse strings \\ 8.6 Word-based text compression \\ 8.7 Textual image compression \\ 8.8 Dynamic Markov coding \\ 8.9 FHM curve compression \\ 8.10 Sequitur \\ 8.11 Triangle mesh compression: Edgebreaker \\ 8.12 SCSU: Unicode compression \\ Bibliography \\ Glossary \\ Joining the Data Compression Community \\ Index

entry:
@Book{Salomon:2004:DCC,
  author =       "David Salomon",
  title =        "Data Compression: The Complete Reference",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Third",
  pages =        "xx + 898",
  year =         "2004",
  ISBN =         "0-387-40697-2",
  ISBN-13 =      "978-0-387-40697-8",
  LCCN =         "QA76.9.D33 S25 2004",
  bibdate =      "Wed Apr 28 13:21:19 2004",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook2.bib",
  URL =          "http://www.booksbydavidsalomon.com/;
                 http://www.ecs.csun.edu/~dsalomon/DC3advertis/DComp3Ad.html",
  abstract =     "This substantially enhanced reference is an essential
                 resource and companion for all computer scientists,
                 computer electrical, and signal image processing
                 engineers, and scientists needing a comprehensive
                 compilation of compression methods. It requires only a
                 minimum of mathematics and is well suited to
                 nonspecialists and general readers.",
  acknowledgement = ack-ds # " and " # ack-nhfb,
  tableofcontents = "1. Basic techniques \\
                 1.1 Intuitive compression \\
                 1.2 Run-length encoding \\
                 1.3 RLE text compression \\
                 1.4 RLE image compression \\
                 1.5 Move-to-front coding \\
                 1.6 Scalar quantization \\
                 2. Statistical methods \\
                 2.1 Information theory concepts \\
                 2.2 Variable-size codes \\
                 2.3 Prefix codes \\
                 2.4 The Golomb code \\
                 2.5 The Kraft--MacMillan inequality \\
                 2.6 The counting argument \\
                 2.7 Shannon--Fano coding \\
                 2.8 Huffman coding \\
                 2.9 Adaptive Huffman coding \\
                 2.10 MNP5 \\
                 2.11 MNP7 \\
                 2.12 Reliability \\
                 2.13 Facsimile compression \\
                 2.14 Arithmetic coding \\
                 2.16 The QM coder \\
                 2.17 Text compression \\
                 2.18 PPM \\
                 2.19 Context-tree weighting \\
                 3. Dictionary methods \\
                 3.1 String compression \\
                 3.2 Simple dictionary compression \\
                 3.3 LZ77 (sliding window) \\
                 3.4 LZSS \\
                 3.5 Repetition times \\
                 3.6 QIC-122 \\
                 3.7 LZX \\
                 3.8 File differencing: VCDIFF \\
                 3.9 LZ78 \\
                 3.10 LZFG \\
                 3.11 LZRW1 \\
                 3.12 LZRW4 \\
                 3.13 LZW \\
                 3.14 LZMW \\
                 3.15 LZAP \\
                 3.16 LZY \\
                 3.17 LZP \\
                 3.18 Repetition finder \\
                 3.19 UNIX compression \\
                 3.20 GIF images \\
                 3.21 The V.42vis protocol \\
                 3.22 Various LZ applications \\
                 3.23 Deflate: Zip and Gzip \\
                 3.24 PNG \\
                 3.25 XML compression: XMill \\
                 3.26 EXE compressors \\
                 3.27 CRC \\
                 3.28 Summary \\
                 3.29 Data compression patents \\
                 3.30 A unification \\
                 4. Image compression \\
                 4.1 Introduction \\
                 4.2 Approaches to image compression \\
                 4.3 Intuitive methods \\
                 4.4 Image transforms \\
                 4.5 Orthogonal transforms \\
                 4.6 The discrete cosine transform \\
                 4.7 Test images \\
                 4.8 JPEG \\
                 4.9 JPEG-LS \\
                 4.10 Progressive image compression \\
                 4.11 JBIG \\
                 4.12 JBIG2 \\
                 4.13 Simple images: EIDAC \\
                 4.14 Vector quantization \\
                 4.15 Adaptive vector quantization \\
                 4.16 Block matching \\
                 4.17 Block truncation coding \\
                 4.18 Context-based methods \\
                 4.19 FELICS \\
                 4.20 Progressive FELICS \\
                 4.21 MLP \\
                 4.22 Adaptive Golomb \\
                 4.23 PPPM \\
                 4.24 CALIC \\
                 4.25 Differential lossless compression \\
                 4.26 DPCM \\
                 4.27 Context-tree weighting \\
                 4.28 Block decomposition \\
                 4.29 Binary tree predictive coding \\
                 4.30 Quadtrees \\
                 4.31 Quadrisection \\
                 4.32 Space-filling curves \\
                 4.33 Hilbert scan and VQ \\
                 4.34 Finite automata methods \\
                 4.35 Iterated function systems \\
                 4.36 Cell encoding \\
                 5. Wavelet methods \\
                 5.1 Fourier transform \\
                 5.2 The frequency domain \\
                 5.3 The uncertainty principle \\
                 5.4 Fourier image compression \\
                 5.5 The CWT and its inverse \\
                 5.6 The Haar transform \\
                 5.7 Filter banks \\
                 5.8 The DWT \\
                 5.9 Multiresolution decomposition \\
                 5.10 Various image decompositions \\
                 5.11 The lifting scheme \\
                 5.12 The IWT \\
                 5.13 The Laplacian pyramid \\
                 5.14 SPIHT \\
                 5.15 CREW \\
                 5.16 EZW \\
                 5.17 DjVu \\
                 5.18 WSQ, fingerprint compression \\
                 5.19 JPEG 2000 \\
                 6. Video compression \\
                 6.1 Analog video \\
                 6.2 Composite and components video \\
                 6.3 Digital video \\
                 6.4 Video compression \\
                 6.5 MPEG \\
                 6.6 MPEG-4 \\
                 6.7 H.261 \\
                 7. Audio compression \\
                 7.1 Sound \\
                 7.2 Digital audio \\
                 7.3 The human auditory system \\
                 7.4 $\mu$-law and A-law companding \\
                 7.5 ADPCM audio compression \\
                 7.6 MLP audio \\
                 7.7 Speech compression \\
                 7.8 Shorten \\
                 7.9 MPEG-1 audio layers \\
                 8. Other methods \\
                 8.1 The Burrows--Wheeler method \\
                 8.2 Symbol ranking \\
                 8.3 ACB \\
                 8.4 Sort-based context similarity \\
                 8.5 Sparse strings \\
                 8.6 Word-based text compression \\
                 8.7 Textual image compression \\
                 8.8 Dynamic Markov coding \\
                 8.9 FHM curve compression \\
                 8.10 Sequitur \\
                 8.11 Triangle mesh compression: Edgebreaker \\
                 8.12 SCSU: Unicode compression \\
                 Bibliography \\
                 Glossary \\
                 Joining the Data Compression Community \\
                 Index",
}


bibtype: book
filename: master.bib
label: Salomon:2005:CDC
author: David Salomon
title: Coding for Data and Computer Communications
publisher: pub-SV
address: pub-SV:adr
pages: xv + 548
year: 2005
ISBN: 0-387-21245-0 OR 0387212450
ISBN13: 978-0-387-21245-6 OR 9780387212456
LCCN: TK5102.94 .S35 2005
bibdate: Mon Apr 25 16:21:05 2005
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2005.04.25 16:21:05 ???
URL: http://www.DavidSalomon.name/Codes/Codes.html; http://www.ecs.csun.edu/~dsalomon/
subject: Telecommunication systems; Coding theory; Cryptography
acknowledgement: ack-nhfb
rawauthor: David Salomon
rawtitle: Coding for Data and Computer Communications
TOC:
Preface vii Part I: Channel Coding 1 1 Error-Control Codes 3 2 Check Digits for Error Detection 35 Part II: Source Codes 59 3 Statistical Methods 67 4 Dictionary Methods 111 5 Image Compression 133 Part III: Secure Codes 197 6 Basic Concepts 199 7 Monoalphabetic Substitution Ciphers 213 8 Transposition Ciphers 227 9 Polyalphabetic Substitution Ciphers 243 10 Stream Ciphers 269 11 Block Ciphers 289 12 Public-Key Cryptography 311 13 Data Hiding 341 14 Data Hiding in Images 365 15 Data Hiding: Other Methods 417 Part IV: Essential Resources 445 Appendixes A Symmetry Groups 447 B Galois Fields 451 B.1 Field Definitions and Operations 451 B.2 Polynomial Arithmetic 459 C Cyclic Redundancy Codes 461 D Projects 465 Answers to Exercises 471 Glossary 503 Bibliography 523 Index 533

rawTOC:
Preface vii \\ \\ Part I: Channel Coding 1 \\ \\ 1 Error-Control Codes 3 \\ 2 Check Digits for Error Detection 35 \\ \\ Part II: Source Codes 59 \\ \\ 3 Statistical Methods 67 \\ 4 Dictionary Methods 111 \\ 5 Image Compression 133 \\ \\ Part III: Secure Codes 197 \\ \\ 6 Basic Concepts 199 \\ 7 Monoalphabetic Substitution Ciphers 213 \\ 8 Transposition Ciphers 227 \\ 9 Polyalphabetic Substitution Ciphers 243 \\ 10 Stream Ciphers 269 \\ 11 Block Ciphers 289 \\ 12 Public-Key Cryptography 311 \\ 13 Data Hiding 341 \\ 14 Data Hiding in Images 365 \\ 15 Data Hiding: Other Methods 417 \\ \\ Part IV: Essential Resources 445 \\ \\ Appendixes \\ \\ A Symmetry Groups 447 \\ B Galois Fields 451 \\ B.1 Field Definitions and Operations 451 \\ B.2 Polynomial Arithmetic 459 \\ C Cyclic Redundancy Codes 461 \\ D Projects 465 \\ \\ Answers to Exercises 471 \\ \\ Glossary 503 \\ \\ Bibliography 523 \\ \\ Index 533

entry:
@Book{Salomon:2005:CDC,
  author =       "David Salomon",
  title =        "Coding for Data and Computer Communications",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xv + 548",
  year =         "2005",
  ISBN =         "0-387-21245-0",
  ISBN-13 =      "978-0-387-21245-6",
  LCCN =         "TK5102.94 .S35 2005",
  bibdate =      "Mon Apr 25 16:21:05 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.DavidSalomon.name/Codes/Codes.html;
                 http://www.ecs.csun.edu/~dsalomon/",
  acknowledgement = ack-nhfb,
  subject =      "Telecommunication systems; Coding theory;
                 Cryptography",
  tableofcontents = "Preface vii \\
                 \\
                 Part I: Channel Coding 1 \\
                 \\
                 1 Error-Control Codes 3 \\
                 2 Check Digits for Error Detection 35 \\
                 \\
                 Part II: Source Codes 59 \\
                 \\
                 3 Statistical Methods 67 \\
                 4 Dictionary Methods 111 \\
                 5 Image Compression 133 \\
                 \\
                 Part III: Secure Codes 197 \\
                 \\
                 6 Basic Concepts 199 \\
                 7 Monoalphabetic Substitution Ciphers 213 \\
                 8 Transposition Ciphers 227 \\
                 9 Polyalphabetic Substitution Ciphers 243 \\
                 10 Stream Ciphers 269 \\
                 11 Block Ciphers 289 \\
                 12 Public-Key Cryptography 311 \\
                 13 Data Hiding 341 \\
                 14 Data Hiding in Images 365 \\
                 15 Data Hiding: Other Methods 417 \\
                 \\
                 Part IV: Essential Resources 445 \\
                 \\
                 Appendixes \\
                 \\
                 A Symmetry Groups 447 \\
                 B Galois Fields 451 \\
                 B.1 Field Definitions and Operations 451 \\
                 B.2 Polynomial Arithmetic 459 \\
                 C Cyclic Redundancy Codes 461 \\
                 D Projects 465 \\
                 \\
                 Answers to Exercises 471 \\
                 \\
                 Glossary 503 \\
                 \\
                 Bibliography 523 \\
                 \\
                 Index 533",
}


bibtype: book
filename: master.bib
label: Salomon:2005:FCS
author: David Salomon
title: Foundations of Computer Security
publisher: pub-SV
address: pub-SV:adr
pages: xxi + 368
year: 2005
DOI: https://doi.org/10.1007/1-84628-341-8
ISBN: 1-84628-193-8 (hardcover), 1-84628-341-8 OR 1846281938 (hardcover), 1846283418
ISBN13: 978-1-84628-193-8 (hardcover), 978-1-84628-341-3 OR 9781846281938 (hardcover), 9781846283413
LCCN: QA76.9.A25 S2656 2005
bibdate: Sat Jan 7 09:42:09 MST 2006
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2006.01.07 09:42:09 MST
acknowledgement: ack-nhfb
rawauthor: David Salomon
rawtitle: Foundations of Computer Security
URL:
http://www.springer.com/sgw/cda/frontpage/0,11855,4-40007-22-65173048-0,00.html; http://www.springer.com/sgw/cda/pageitems/document/cda_downloaddocument/0,11855,0-0-45-166687-p65173048,00.pdf; http://www.springer.com/sgw/cda/pageitems/document/cda_downloaddocument/0,11855,0-0-45-166688-p65173048,00.pdf; http://www.springer.com/sgw/cda/pageitems/document/cda_downloaddocument/0,11855,0-0-45-166689-p65173048,00.pdf

keywords:
authentication; computer security; cryptography; encryption; firewalls; identity theft; malware; physical security; spyware; trojan horses; viruses; worms

TOC:
Physical Security Viruses Worms Trojan Horses Examples of Malware Prevention and Defenses Network Security Authentication Spyware Identity Theft Privacy and Trust Elements of Cryptography

rawTOC:
Physical Security \\ Viruses \\ Worms \\ Trojan Horses \\ Examples of Malware \\ Prevention and Defenses \\ Network Security \\ Authentication \\ Spyware \\ Identity Theft \\ Privacy and Trust \\ Elements of Cryptography

entry:
@Book{Salomon:2005:FCS,
  author =       "David Salomon",
  title =        "Foundations of Computer Security",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xxi + 368",
  year =         "2005",
  DOI =          "https://doi.org/10.1007/1-84628-341-8",
  ISBN =         "1-84628-193-8 (hardcover), 1-84628-341-8",
  ISBN-13 =      "978-1-84628-193-8 (hardcover), 978-1-84628-341-3",
  LCCN =         "QA76.9.A25 S2656 2005",
  bibdate =      "Sat Jan 7 09:42:09 MST 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.springer.com/sgw/cda/frontpage/0,11855,4-40007-22-65173048-0,00.html;
                 http://www.springer.com/sgw/cda/pageitems/document/cda_downloaddocument/0,11855,0-0-45-166687-p65173048,00.pdf;
                 http://www.springer.com/sgw/cda/pageitems/document/cda_downloaddocument/0,11855,0-0-45-166688-p65173048,00.pdf;
                 http://www.springer.com/sgw/cda/pageitems/document/cda_downloaddocument/0,11855,0-0-45-166689-p65173048,00.pdf",
  acknowledgement = ack-nhfb,
  keywords =     "authentication; computer security; cryptography;
                 encryption; firewalls; identity theft; malware;
                 physical security; spyware; trojan horses; viruses;
                 worms",
  publishersummary = "Anyone with a computer has heard of viruses, had
                 to deal with several, and has been struggling with
                 spam, spyware, and disk crashes. This book is intended
                 as a starting point for those familiar with basic
                 concepts of computers and computations and who would
                 like to extend their knowledge into the realm of
                 computer and network security. Its comprehensive
                 treatment of all the major areas of computer security
                 aims to give readers a complete foundation in the field
                 of Computer Security. Exercises are given throughout
                 the book and are intended to strengthening the reader?s
                 knowledge --- answers are also provided.\par

                 Written in a clear, easy to understand style, aimed
                 towards advanced undergraduates and non-experts who
                 want to know about the security problems confronting
                 them everyday. The technical level of the book is low
                 and requires no mathematics, and only a basic concept
                 of computers and computations. Foundations of Computer
                 Security will be an invaluable tool for students and
                 professionals alike.",
  tableofcontents = "Physical Security \\
                 Viruses \\
                 Worms \\
                 Trojan Horses \\
                 Examples of Malware \\
                 Prevention and Defenses \\
                 Network Security \\
                 Authentication \\
                 Spyware \\
                 Identity Theft \\
                 Privacy and Trust \\
                 Elements of Cryptography",
}


bibtype: book
filename: master.bib
label: Salomon:2006:CSC
author: David Salomon
title: Curves and Surfaces for Computer Graphics
publisher: pub-SV
address: pub-SV:adr
pages: xvi + 460
year: 2006
ISBN: 0-387-24196-5, 0-387-28452-4 (e-book) OR 0387241965, 0387284524 (ebook)
ISBN13: 978-0-387-24196-8, 978-0-387-28452-1 (e-book) OR 9780387241968, 9780387284521 (ebook)
LCCN: T385 .S2434 2005
bibdate: Sat Jan 26 12:46:16 MST 2013
bibtimestamp: 2013.01.26 12:46:16 MST
subject: Computer graphics; Mathematical models
acknowledgement: ack-ds
rawauthor: David Salomon
rawtitle: Curves and Surfaces for Computer Graphics
bibsource:
https://www.math.utah.edu/pub/tex/bib/datacompression.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/texbook2.bib; z3950.loc.gov:7090/Voyager

TOC:
1. Basic theory 2. Linear interpolation 3. Polynomial interpolation 4. Hermite interpolation 5. Spline interpolation 6. Bezier approximation 7. B-spline approximation 8. Subdivision methods 9. Sweep surfaces A. Conic sections B. Approximate circles C. Graphics gallery D. Mathematica notes

rawTOC:
1. Basic theory \\ 2. Linear interpolation \\ 3. Polynomial interpolation \\ 4. Hermite interpolation \\ 5. Spline interpolation \\ 6. B{\'e}zier approximation \\ 7. B-spline approximation \\ 8. Subdivision methods \\ 9. Sweep surfaces \\ A. Conic sections \\ B. Approximate circles \\ C. Graphics gallery \\ D. Mathematica notes

entry:
@Book{Salomon:2006:CSC,
  author =       "David Salomon",
  title =        "Curves and Surfaces for Computer Graphics",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xvi + 460",
  year =         "2006",
  ISBN =         "0-387-24196-5, 0-387-28452-4 (e-book)",
  ISBN-13 =      "978-0-387-24196-8, 978-0-387-28452-1 (e-book)",
  LCCN =         "T385 .S2434 2005",
  bibdate =      "Sat Jan 26 12:46:16 MST 2013",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook2.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-ds # " and " # ack-nhfb,
  rawdata =      "Salomon, David (2006) {\it Curves and Surfaces for
                 Computer Graphics}, New York, Springer.",
  subject =      "Computer graphics; Mathematical models",
  tableofcontents = "1. Basic theory \\
                 2. Linear interpolation \\
                 3. Polynomial interpolation \\
                 4. Hermite interpolation \\
                 5. Spline interpolation \\
                 6. B{\'e}zier approximation \\
                 7. B-spline approximation \\
                 8. Subdivision methods \\
                 9. Sweep surfaces \\
                 A. Conic sections \\
                 B. Approximate circles \\
                 C. Graphics gallery \\
                 D. Mathematica notes",
}


bibtype: book
filename: master.bib
label: Salomon:2006:TPC
author: David Salomon
title: Transformations and Projections in Computer Graphics
publisher: pub-SV
address: pub-SV:adr
pages: xiv + 288
year: 2006
ISBN: 1-84628-392-2 OR 1846283922
ISBN13: 978-1-84628-392-5 OR 9781846283925
LCCN: T385 .S2439 2006
bibdate: Fri Aug 25 14:38:27 2006
bibtimestamp: 2006.08.25 14:38:27 ???
acknowledgement: ack-nhfb
rawauthor: David Salomon
rawtitle: Transformations and Projections in Computer Graphics
bibsource:
https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/texbook2.bib; prodorbis.library.yale.edu:7090/voyager; z3950.loc.gov:7090/Voyager

abstract:
Computer graphics are part of everyone's lives via feature films, advertisements, computers, PDAs, mobile phones, and more. This book introduces perspective and discusses the mathematics of perspective. It also discusses nonlinear projections in depth, including the fisheye, panorama, and map projections used to enhance digital images.

TOC:
1: Transformations Introduction Two-Dimensional Transformations Three-Dimensional Coordinate Systems Three-Dimensional Transformations Transforming the Coordinate System 2: Parallel Projections Orthographic Projections Axonometric Projections Oblique Projections 3: Perspective Projection One Two Three ldots Infinity History of Perspective Perspective in Curved Objects The Mathematics of Perspective General Perspective Transforming The Object Viewer At An Arbitrary Location Coordinate-Free Approach The Viewing Volume Stereoscopic Images Creating a Stereoscopic Image Viewing a Stereoscopic Image 4: Nonlinear Projections False Perspective Fisheye Projection Circle Inversion Panoramic Projections Cylindrical Panoramic Projection Spherical Panoramic Projection Cubic Panoramic Projection Six-Point Perspective Other Panoramic Projections Panoramic Cameras Telescopic Projection Microscopic Projection Anamorphosis Map Projections A. Vector products B. Quaternions C. Color figures

rawabstract:
Computer graphics are part of everyone's lives via feature films, advertisements, computers, PDAs, mobile phones, and more. This book introduces perspective and discusses the mathematics of perspective. It also discusses nonlinear projections in depth, including the fisheye, panorama, and map projections used to enhance digital images.

shortTOC:
1. Transformations 2. Parallel projections 3. Perspective projection 4. Nonlinear projections A. Vector products B. Quaternions C. Color figures

rawshortTOC:
1. Transformations \\ 2. Parallel projections \\ 3. Perspective projection \\ 4. Nonlinear projections \\ A. Vector products \\ B. Quaternions \\ C. Color figures

rawTOC:
1: Transformations \\ Introduction \\ Two-Dimensional Transformations \\ Three-Dimensional Coordinate Systems \\ Three-Dimensional Transformations \\ Transforming the Coordinate System \\ 2: Parallel Projections \\ Orthographic Projections \\ Axonometric Projections \\ Oblique Projections \\ 3: Perspective Projection \\ One Two Three \ldots{} Infinity \\ History of Perspective \\ Perspective in Curved Objects \\ The Mathematics of Perspective \\ General Perspective \\ Transforming The Object \\ Viewer At An Arbitrary Location \\ Coordinate-Free Approach \\ The Viewing Volume \\ Stereoscopic Images \\ Creating a Stereoscopic Image \\ Viewing a Stereoscopic Image \\ 4: Nonlinear Projections \\ False Perspective \\ Fisheye Projection \\ Circle Inversion \\ Panoramic Projections \\ Cylindrical Panoramic Projection \\ Spherical Panoramic Projection \\ Cubic Panoramic Projection \\ Six-Point Perspective \\ Other Panoramic Projections \\ Panoramic Cameras \\ Telescopic Projection \\ Microscopic Projection \\ Anamorphosis \\ Map Projections \\ A. Vector products \\ B. Quaternions \\ C. Color figures

entry:
@Book{Salomon:2006:TPC,
  author =       "David Salomon",
  title =        "Transformations and Projections in Computer Graphics",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xiv + 288",
  year =         "2006",
  ISBN =         "1-84628-392-2",
  ISBN-13 =      "978-1-84628-392-5",
  LCCN =         "T385 .S2439 2006",
  bibdate =      "Fri Aug 25 14:38:27 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook2.bib;
                 prodorbis.library.yale.edu:7090/voyager;
                 z3950.loc.gov:7090/Voyager",
  price =        "US\$59.95",
  abstract =     "Computer graphics are part of everyone's lives via
                 feature films, advertisements, computers, PDAs, mobile
                 phones, and more. This book introduces perspective and
                 discusses the mathematics of perspective. It also
                 discusses nonlinear projections in depth, including the
                 fisheye, panorama, and map projections used to enhance
                 digital images.",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "1. Transformations \\
                 2. Parallel projections \\
                 3. Perspective projection \\
                 4. Nonlinear projections \\
                 A. Vector products \\
                 B. Quaternions \\
                 C. Color figures",
  tableofcontents = "1: Transformations \\
                 Introduction \\
                 Two-Dimensional Transformations \\
                 Three-Dimensional Coordinate Systems \\
                 Three-Dimensional Transformations \\
                 Transforming the Coordinate System \\
                 2: Parallel Projections \\
                 Orthographic Projections \\
                 Axonometric Projections \\
                 Oblique Projections \\
                 3: Perspective Projection \\
                 One Two Three \ldots{} Infinity \\
                 History of Perspective \\
                 Perspective in Curved Objects \\
                 The Mathematics of Perspective \\
                 General Perspective \\
                 Transforming The Object \\
                 Viewer At An Arbitrary Location \\
                 Coordinate-Free Approach \\
                 The Viewing Volume \\
                 Stereoscopic Images \\
                 Creating a Stereoscopic Image \\
                 Viewing a Stereoscopic Image \\
                 4: Nonlinear Projections \\
                 False Perspective \\
                 Fisheye Projection \\
                 Circle Inversion \\
                 Panoramic Projections \\
                 Cylindrical Panoramic Projection \\
                 Spherical Panoramic Projection \\
                 Cubic Panoramic Projection \\
                 Six-Point Perspective \\
                 Other Panoramic Projections \\
                 Panoramic Cameras \\
                 Telescopic Projection \\
                 Microscopic Projection \\
                 Anamorphosis \\
                 Map Projections \\
                 A. Vector products \\
                 B. Quaternions \\
                 C. Color figures",
}


bibtype: book
filename: master.bib
label: Salomon:2007:DCC
author: David Salomon
title: Data Compression: The Complete Reference
publisher: pub-SV
address: pub-SV:adr
edition: Fourth
pages: xxv + 1092
year: 2007
ISBN: 1-84628-602-6 OR 1846286026
ISBN13: 978-1-84628-602-5 OR 9781846286025
LCCN: QA76.9.D33 S25 2007
bibdate: Tue Jan 23 14:16:11 MST 2007
bibtimestamp: 2007.01.23 14:16:11 MST
note: With contributions by Giovanni Motta and David Bryant.
acknowledgement: ack-nhfb
rawauthor: David Salomon
rawnote: With contributions by Giovanni Motta and David Bryant.
rawtitle: Data Compression: The Complete Reference
bibsource:
https://www.math.utah.edu/pub/tex/bib/master.bib; prodorbis.library.yale.edu:7090/voyager; z3950.loc.gov:7090/Voyager

TOC:
Front Matter Introduction Basic Techniques Statistical Methods Dictionary Methods Image Compression Wavelet Methods Video Compression Audio Compression Other Methods Back Matter

rawTOC:
Front Matter \\ Introduction \\ Basic Techniques \\ Statistical Methods \\ Dictionary Methods \\ Image Compression \\ Wavelet Methods \\ Video Compression \\ Audio Compression \\ Other Methods \\ Back Matter

entry:
@Book{Salomon:2007:DCC,
  author =       "David Salomon",
  title =        "Data Compression: The Complete Reference",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Fourth",
  pages =        "xxv + 1092",
  year =         "2007",
  ISBN =         "1-84628-602-6",
  ISBN-13 =      "978-1-84628-602-5",
  LCCN =         "QA76.9.D33 S25 2007",
  bibdate =      "Tue Jan 23 14:16:11 MST 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 prodorbis.library.yale.edu:7090/voyager;
                 z3950.loc.gov:7090/Voyager",
  note =         "With contributions by Giovanni Motta and David
                 Bryant.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Front Matter \\
                 Introduction \\
                 Basic Techniques \\
                 Statistical Methods \\
                 Dictionary Methods \\
                 Image Compression \\
                 Wavelet Methods \\
                 Video Compression \\
                 Audio Compression \\
                 Other Methods \\
                 Back Matter",
}


bibtype: book
filename: master.bib
label: Salomon:2007:VLC
author: David Salomon
title: Variable-length Codes for Data Compression
publisher: pub-SV
address: pub-SV:adr
pages: xii + 191
year: 2007
ISBN: 1-84628-958-0 OR 1846289580
ISBN13: 978-1-84628-958-3 OR 9781846289583
LCCN: QA76.9.D33 S25 2007
bibdate: Wed Oct 17 14:22:23 MDT 2007
bibtimestamp: 2007.10.17 14:22:23 MDT
acknowledgement: ack-nhfb
rawauthor: David Salomon
rawtitle: Variable-length Codes for Data Compression
TOC:
1. Basic Codes 1.1. Codes, Fixed- and Variable-Length 1.2. Prefix Codes 1.3. VLCs, Entropy, and Redundancy 1.4. Universal Codes 1.5. Kraft-McMillan Inequality 1.6. Tunstall Code 1.7. Schalkwijk's Coding 1.8. Tjalkens--Willems V-to-B Coding 1.9. Phased-In Codes 1.10. Redundancy Feedback (RF) Coding 1.11. Recursive Phased-In Codes 1.12. Self-Delimiting Codes 1.13. Huffman Coding 2. Advanced Codes 2.1. VLCs for Integers 2.2. Start-Step-Stop Codes 2.3. Start/Stop Codes 2.4. Elias Codes 2.5. Levenstein Code 2.6. Even--Rodeh Code 2.7. Punctured Elias Codes 2.8. Other Prefix Codes 2.9. Ternary Comma Code 2.10. Location Based Encoding (LBE) 2.11. Stout Codes 2.12. Boldi--Vigna ([zeta]) Codes 2.13. Yamamoto's Recursive Code 2.14. VLCs and Search Trees 2.15. Taboo Codes 2.16. Wang's Flag Code 2.17. Yamamoto Flag Code 2.18. Number Bases 2.19. Fibonacci Code 2.20. Generalized Fibonacci Codes 2.21. Goldbach Codes 2.22. Additive Codes 2.23. Golomb Code 2.24. Rice Codes 2.25. Subexponential Code 2.26. Codes Ending with ``1'' 3. Robust Codes 3.1. Codes For Error Control 3.2. Free Distance 3.3. Synchronous Prefix Codes 3.4. Resynchronizing Huffman Codes 3.5. Bidirectional Codes 3.6. Symmetric Codes 3.7. VLEC Codes Summary and Unification Bibliography Index

rawTOC:
1. Basic Codes \\ 1.1. Codes, Fixed- and Variable-Length \\ 1.2. Prefix Codes \\ 1.3. VLCs, Entropy, and Redundancy \\ 1.4. Universal Codes \\ 1.5. Kraft-McMillan Inequality \\ 1.6. Tunstall Code \\ 1.7. Schalkwijk's Coding \\ 1.8. Tjalkens--Willems V-to-B Coding \\ 1.9. Phased-In Codes \\ 1.10. Redundancy Feedback (RF) Coding \\ 1.11. Recursive Phased-In Codes \\ 1.12. Self-Delimiting Codes \\ 1.13. Huffman Coding \\ 2. Advanced Codes \\ 2.1. VLCs for Integers \\ 2.2. Start-Step-Stop Codes \\ 2.3. Start/Stop Codes \\ 2.4. Elias Codes \\ 2.5. Levenstein Code \\ 2.6. Even--Rodeh Code \\ 2.7. Punctured Elias Codes \\ 2.8. Other Prefix Codes \\ 2.9. Ternary Comma Code \\ 2.10. Location Based Encoding (LBE) \\ 2.11. Stout Codes \\ 2.12. Boldi--Vigna ([zeta]) Codes \\ 2.13. Yamamoto's Recursive Code \\ 2.14. VLCs and Search Trees \\ 2.15. Taboo Codes \\ 2.16. Wang's Flag Code \\ 2.17. Yamamoto Flag Code \\ 2.18. Number Bases \\ 2.19. Fibonacci Code \\ 2.20. Generalized Fibonacci Codes \\ 2.21. Goldbach Codes \\ 2.22. Additive Codes \\ 2.23. Golomb Code \\ 2.24. Rice Codes \\ 2.25. Subexponential Code \\ 2.26. Codes Ending with ``1'' \\ 3. Robust Codes \\ 3.1. Codes For Error Control \\ 3.2. Free Distance \\ 3.3. Synchronous Prefix Codes \\ 3.4. Resynchronizing Huffman Codes \\ 3.5. Bidirectional Codes \\ 3.6. Symmetric Codes \\ 3.7. VLEC Codes \\ Summary and Unification \\ Bibliography \\ Index

entry:
@Book{Salomon:2007:VLC,
  author =       "David Salomon",
  title =        "Variable-length Codes for Data Compression",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xii + 191",
  year =         "2007",
  ISBN =         "1-84628-958-0",
  ISBN-13 =      "978-1-84628-958-3",
  LCCN =         "QA76.9.D33 S25 2007",
  bibdate =      "Wed Oct 17 14:22:23 MDT 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 prodorbis.library.yale.edu:7090/voyager;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  tableofcontents = "1. Basic Codes \\
                 1.1. Codes, Fixed- and Variable-Length \\
                 1.2. Prefix Codes \\
                 1.3. VLCs, Entropy, and Redundancy \\
                 1.4. Universal Codes \\
                 1.5. Kraft-McMillan Inequality \\
                 1.6. Tunstall Code \\
                 1.7. Schalkwijk's Coding \\
                 1.8. Tjalkens--Willems V-to-B Coding \\
                 1.9. Phased-In Codes \\
                 1.10. Redundancy Feedback (RF) Coding \\
                 1.11. Recursive Phased-In Codes \\
                 1.12. Self-Delimiting Codes \\
                 1.13. Huffman Coding \\
                 2. Advanced Codes \\
                 2.1. VLCs for Integers \\
                 2.2. Start-Step-Stop Codes \\
                 2.3. Start/Stop Codes \\
                 2.4. Elias Codes \\
                 2.5. Levenstein Code \\
                 2.6. Even--Rodeh Code \\
                 2.7. Punctured Elias Codes \\
                 2.8. Other Prefix Codes \\
                 2.9. Ternary Comma Code \\
                 2.10. Location Based Encoding (LBE) \\
                 2.11. Stout Codes \\
                 2.12. Boldi--Vigna ([zeta]) Codes \\
                 2.13. Yamamoto's Recursive Code \\
                 2.14. VLCs and Search Trees \\
                 2.15. Taboo Codes \\
                 2.16. Wang's Flag Code \\
                 2.17. Yamamoto Flag Code \\
                 2.18. Number Bases \\
                 2.19. Fibonacci Code \\
                 2.20. Generalized Fibonacci Codes \\
                 2.21. Goldbach Codes \\
                 2.22. Additive Codes \\
                 2.23. Golomb Code \\
                 2.24. Rice Codes \\
                 2.25. Subexponential Code \\
                 2.26. Codes Ending with ``1'' \\
                 3. Robust Codes \\
                 3.1. Codes For Error Control \\
                 3.2. Free Distance \\
                 3.3. Synchronous Prefix Codes \\
                 3.4. Resynchronizing Huffman Codes \\
                 3.5. Bidirectional Codes \\
                 3.6. Symmetric Codes \\
                 3.7. VLEC Codes \\
                 Summary and Unification \\
                 Bibliography \\
                 Index",
}


bibtype: book
filename: master.bib
label: Salomon:2008:CID
author: David Salomon
title: A Concise Introduction to Data Compression
publisher: pub-SV
address: pub-SV:adr
pages: xiii + 310
year: 2008
ISBN: 1-84800-071-5 (paperback) OR 1848000715 (paperback)
ISBN13: 978-1-84800-071-1 (paperback) OR 9781848000711 (paperback)
LCCN: QA76.9.D33 S34 2008
bibdate: Thu Feb 21 12:37:12 2008
bibtimestamp: 2008.02.21 12:37:12 ???
series: Undergraduate topics in computer science
acknowledgement: ack-nhfb
rawauthor: David Salomon
rawtitle: A Concise Introduction to Data Compression
bibsource:
https://www.math.utah.edu/pub/tex/bib/datacompression.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.gbv.de:20011/gvk; z3950.loc.gov:7090/Voyager

abstract:
Compressing data is an option naturally selected when faced with problems of high costs or restricted space. Written by a renowned expert in the field, this book offers readers a succinct, reader-friendly foundation to the chief approaches, methods and techniques currently employed in the field of data compression. Part I presents the basic approaches to data compression and describes a few popular techniques and methods commonly used to compress data. The reader discovers essential concepts, such as variable-length and prefix codes, statistical distributions and run-length encoding. Part II then concentrates on advanced techniques, such as arithmetic coding, orthogonal transforms, subband transforms and the Burrows--Wheeler transform.

subject:
computer science; data structures (computer science); data structures; cryptology and information theory; data compression (computer science)

TOC:
Pt. I. Basic Concepts 1. Approaches to Compression 2. Huffman Coding 3. Dictionary Methods Pt. II. Advanced Techniques 4. Arithmetic Coding 5. Image Compression 6. Audio Compression 7. Other Methods

rawabstract:
Compressing data is an option naturally selected when faced with problems of high costs or restricted space. Written by a renowned expert in the field, this book offers readers a succinct, reader-friendly foundation to the chief approaches, methods and techniques currently employed in the field of data compression. Part I presents the basic approaches to data compression and describes a few popular techniques and methods commonly used to compress data. The reader discovers essential concepts, such as variable-length and prefix codes, statistical distributions and run-length encoding. Part II then concentrates on advanced techniques, such as arithmetic coding, orthogonal transforms, subband transforms and the Burrows--Wheeler transform.

rawTOC:
Pt. I. Basic Concepts \\ 1. Approaches to Compression \\ 2. Huffman Coding \\ 3. Dictionary Methods \\ Pt. II. Advanced Techniques \\ 4. Arithmetic Coding \\ 5. Image Compression \\ 6. Audio Compression \\ 7. Other Methods

entry:
@Book{Salomon:2008:CID,
  author =       "David Salomon",
  title =        "A Concise Introduction to Data Compression",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xiii + 310",
  year =         "2008",
  ISBN =         "1-84800-071-5 (paperback)",
  ISBN-13 =      "978-1-84800-071-1 (paperback)",
  LCCN =         "QA76.9.D33 S34 2008",
  bibdate =      "Thu Feb 21 12:37:12 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.gbv.de:20011/gvk; z3950.loc.gov:7090/Voyager",
  price =        "EUR 32",
  series =       "Undergraduate topics in computer science",
  abstract =     "Compressing data is an option naturally selected when
                 faced with problems of high costs or restricted space.
                 Written by a renowned expert in the field, this book
                 offers readers a succinct, reader-friendly foundation
                 to the chief approaches, methods and techniques
                 currently employed in the field of data compression.
                 Part I presents the basic approaches to data
                 compression and describes a few popular techniques and
                 methods commonly used to compress data. The reader
                 discovers essential concepts, such as variable-length
                 and prefix codes, statistical distributions and
                 run-length encoding. Part II then concentrates on
                 advanced techniques, such as arithmetic coding,
                 orthogonal transforms, subband transforms and the
                 Burrows--Wheeler transform.",
  acknowledgement = ack-nhfb,
  subject =      "computer science; data structures (computer science);
                 data structures; cryptology and information theory;
                 data compression (computer science)",
  tableofcontents = "Pt. I. Basic Concepts \\
                 1. Approaches to Compression \\
                 2. Huffman Coding \\
                 3. Dictionary Methods \\
                 Pt. II. Advanced Techniques \\
                 4. Arithmetic Coding \\
                 5. Image Compression \\
                 6. Audio Compression \\
                 7. Other Methods",
}


bibtype: book
filename: master.bib
label: Salomon:2011:CGM
author: David Salomon
title: The Computer Graphics Manual
publisher: pub-SV
address: pub-SV:adr
pages: xxiii + 1--727 + 5 + xxiii + 1--6 + 731--1503 + 5
year: 2011
DOI: https://doi.org/10.1007/978-0-85729-886-7
ISBN: 0-85729-885-2 (print), 0-85729-886-0 (e-book) OR 0857298852 (print), 0857298860 (ebook)
ISSN: 1868-0941 (print), 1868-095X (electronic) OR 18680941 (print), 1868095X (electronic)
LCCN: T385 .S25 2011
bibdate: Fri Oct 28 16:59:37 MDT 2011
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2011.10.28 16:59:37 MDT
acknowledgement: ack-nhfb
rawauthor: David Salomon
rawtitle: The Computer Graphics Manual
ISBN13:
978-0-85729-885-0 (print), 978-0-85729-886-7 (e-book) OR 9780857298850 (print), 9780857298867 (ebook)

TOC:
Part I: Basic Techniques Historical Notes Raster Graphics Scan Conversion Part II: Transformations and Projections Transformations Parallel Projections Perspective Projection Nonlinear Projections Part III: Curves and Surfaces Basic Theory Linear Interpolation Polynomial Interpolation Hermite Interpolation Spline Interpolation Bezier Approximation B-Spline Approximation Subdivision Methods Sweep Surfaces Part IV: Advanced Techniques Rendering Visible Surface Determination Computer Animation Graphics Standards Color Fractals Part V: Image Compression Compression Techniques Transforms and JPEG The Wavelet Transform Part VI: Graphics Devices Graphics Devices Part VII: Appendixes

rawTOC:
Part I: Basic Techniques \\ Historical Notes \\ Raster Graphics \\ Scan Conversion \\ Part II: Transformations and Projections \\ Transformations \\ Parallel Projections \\ Perspective Projection \\ Nonlinear Projections \\ Part III: Curves and Surfaces \\ Basic Theory \\ Linear Interpolation \\ Polynomial Interpolation \\ Hermite Interpolation \\ Spline Interpolation \\ B{\'e}zier Approximation \\ B-Spline Approximation \\ Subdivision Methods \\ Sweep Surfaces \\ Part IV: Advanced Techniques \\ Rendering \\ Visible Surface Determination \\ Computer Animation \\ Graphics Standards \\ Color \\ Fractals \\ Part V: Image Compression \\ Compression Techniques \\ Transforms and JPEG \\ The Wavelet Transform \\ Part VI: Graphics Devices \\ Graphics Devices \\ Part VII: Appendixes

entry:
@Book{Salomon:2011:CGM,
  author =       "David Salomon",
  title =        "The Computer Graphics Manual",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xxiii + 1--727 + 5 + xxiii + 1--6 + 731--1503 + 5",
  year =         "2011",
  DOI =          "https://doi.org/10.1007/978-0-85729-886-7",
  ISBN =         "0-85729-885-2 (print), 0-85729-886-0 (e-book)",
  ISBN-13 =      "978-0-85729-885-0 (print), 978-0-85729-886-7
                 (e-book)",
  ISSN =         "1868-0941 (print), 1868-095X (electronic)",
  LCCN =         "T385 .S25 2011",
  bibdate =      "Fri Oct 28 16:59:37 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  tableofcontents = "Part I: Basic Techniques \\
                 Historical Notes \\
                 Raster Graphics \\
                 Scan Conversion \\
                 Part II: Transformations and Projections \\
                 Transformations \\
                 Parallel Projections \\
                 Perspective Projection \\
                 Nonlinear Projections \\
                 Part III: Curves and Surfaces \\
                 Basic Theory \\
                 Linear Interpolation \\
                 Polynomial Interpolation \\
                 Hermite Interpolation \\
                 Spline Interpolation \\
                 B{\'e}zier Approximation \\
                 B-Spline Approximation \\
                 Subdivision Methods \\
                 Sweep Surfaces \\
                 Part IV: Advanced Techniques \\
                 Rendering \\
                 Visible Surface Determination \\
                 Computer Animation \\
                 Graphics Standards \\
                 Color \\
                 Fractals \\
                 Part V: Image Compression \\
                 Compression Techniques \\
                 Transforms and JPEG \\
                 The Wavelet Transform \\
                 Part VI: Graphics Devices \\
                 Graphics Devices \\
                 Part VII: Appendixes",
}


bibtype: book
filename: master.bib
label: Salthouse:1972:PGC
author: J. A. Salthouse and M. J. Ware
title: Point group character tables and related data
publisher: pub-CAMBRIDGE
address: pub-CAMBRIDGE:adr
pages: v + 88
year: 1972
ISBN: 0-521-08139-4 OR 0521081394
ISBN13: 978-0-521-08139-9 OR 9780521081399
LCCN: QD911 .S25 1972
bibdate: Sat Jul 25 13:55:27 1998
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1998.07.25 13:55:27 ???
acknowledgement: ack-nhfb
rawauthor: J. A. Salthouse and M. J. Ware
rawtitle: Point group character tables and related data
entry:
@Book{Salthouse:1972:PGC,
  author =       "J. A. Salthouse and M. J. Ware",
  title =        "Point group character tables and related data",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "v + 88",
  year =         "1972",
  ISBN =         "0-521-08139-4",
  ISBN-13 =      "978-0-521-08139-9",
  LCCN =         "QD911 .S25 1972",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Salus:1994:QCU
author: Peter H. Salus
title: A Quarter Century of UNIX
publisher: pub-AW
address: pub-AW:adr
pages: xii + 256
year: 1994
ISBN: 0-201-54777-5 OR 0201547775
ISBN13: 978-0-201-54777-1 OR 9780201547771
LCCN: QA76.76.O63 S342 1994
bibdate: Thu Nov 14 06:38:30 2002
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2002.11.14 06:38:30 ???
URL: http://wiki.tuhs.org/doku.php?id=publications:quarter_century_of_unix
acknowledgement: ack-nhfb
rawauthor: Peter H. Salus
rawtitle: A Quarter Century of {UNIX}
abstract:
UNIX is a software system that is simple, elegant, portable, and powerful. It grew in popularity without the benefit of a large marketing organization. Programmers kept using it; big companies kept fighting it. After a decade, it was clear that the users had won. booktitle A Quarter Century of UNIX is the first book to explain this incredible success, using the words of its creators, developers and users to illustrate how the sociology of a technical group can overwhelm the intent of multi-billion-dollar corporations. In preparing to write this book, Peter Salus interviewed over 100 of these key figures and gathered relevant information from Australia to Austria. This is the book that turns UNIX folklore into UNIX history. Features: provides the first documented history of the development of the UNIX operating system, includes interviews with over 100 key figures in the UNIX community, contains classic photos and illustrations, and explains why UNIX succeeded.

TOC:
Acknowledgments Preface Introduction Part I. Genesis 0: Prelude to space 1: Summer 1969--Fall 1970 2: Calculating and computing 3: Operating systems 4: Project MAC: CTSS and Multics Part II. Birth of a system 5: The PDP-11 6: First edition, 1971 7: C and pipes: 1971-1973 8: The first paper -1973 9: The law --- part I Status 1974 Part III. What makes UNIX Unix? 10: The users 11: Why Unix? 12: Style and tools 13: PWB and MERT 14: Utilities Part IV. Unix spreads and blossoms 15: The users --- part II 16: Berkeley Unix: part I 17: Version 7 18: Berkeley Unix: part II 19: Commercial Unix 20: DEC 21: The law --- part II Part V. The Unix industry 22: /usr/group 23: Sun and JAWS 24: Standards Part VI. The currents of change 25: Duelling Unixes 26: Offspring systems 27: OSF and UI 28: Berkeley Unix: after the VAX 29: The law --- part III Finale Finale: What Made it Work? Further Reading Who's Who and What's What Index

rawabstract:
UNIX is a software system that is simple, elegant, portable, and powerful. It grew in popularity without the benefit of a large marketing organization. Programmers kept using it; big companies kept fighting it. After a decade, it was clear that the users had won. \booktitle{A Quarter Century of UNIX} is the first book to explain this incredible success, using the words of its creators, developers and users to illustrate how the sociology of a technical group can overwhelm the intent of multi-billion-dollar corporations. In preparing to write this book, Peter Salus interviewed over 100 of these key figures and gathered relevant information from Australia to Austria. This is the book that turns UNIX folklore into UNIX history. Features: provides the first documented history of the development of the UNIX operating system, includes interviews with over 100 key figures in the UNIX community, contains classic photos and illustrations, and explains why UNIX succeeded.

rawTOC:
Acknowledgments \\ Preface \\ Introduction Part I. Genesis \\ 0: Prelude to space \\ 1: Summer 1969--Fall 1970 \\ 2: Calculating and computing \\ 3: Operating systems \\ 4: Project MAC: CTSS and Multics \\ Part II. Birth of a system \\ 5: The PDP-11 \\ 6: First edition, 1971 \\ 7: C and pipes: 1971-1973 \\ 8: The first paper -1973 \\ 9: The law --- part I \\ Status 1974 \\ Part III. What makes UNIX Unix? 10: The users \\ 11: Why Unix? \\ 12: Style and tools \\ 13: PWB and MERT \\ 14: Utilities \\ Part IV. Unix spreads and blossoms \\ 15: The users --- part II \\ 16: Berkeley Unix: part I \\ 17: Version 7 \\ 18: Berkeley Unix: part II \\ 19: Commercial Unix \\ 20: DEC \\ 21: The law --- part II \\ Part V. The Unix industry \\ 22: /usr/group \\ 23: Sun and JAWS \\ 24: Standards \\ Part VI. The currents of change \\ 25: Duelling Unixes \\ 26: Offspring systems \\ 27: OSF and UI \\ 28: Berkeley Unix: after the VAX \\ 29: The law --- part III \\ Finale \\ Finale: What Made it Work? \\ Further Reading \\ Who's Who and What's What \\ Index

entry:
@Book{Salus:1994:QCU,
  author =       "Peter H. Salus",
  title =        "A Quarter Century of {UNIX}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xii + 256",
  year =         "1994",
  ISBN =         "0-201-54777-5",
  ISBN-13 =      "978-0-201-54777-1",
  LCCN =         "QA76.76.O63 S342 1994",
  bibdate =      "Thu Nov 14 06:38:30 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  URL =          "http://wiki.tuhs.org/doku.php?id=publications:quarter_century_of_unix",
  abstract =     "UNIX is a software system that is simple, elegant,
                 portable, and powerful. It grew in popularity without
                 the benefit of a large marketing organization.
                 Programmers kept using it; big companies kept fighting
                 it. After a decade, it was clear that the users had
                 won. \booktitle{A Quarter Century of UNIX} is the first
                 book to explain this incredible success, using the
                 words of its creators, developers and users to
                 illustrate how the sociology of a technical group can
                 overwhelm the intent of multi-billion-dollar
                 corporations. In preparing to write this book, Peter
                 Salus interviewed over 100 of these key figures and
                 gathered relevant information from Australia to
                 Austria. This is the book that turns UNIX folklore into
                 UNIX history. Features: provides the first documented
                 history of the development of the UNIX operating
                 system, includes interviews with over 100 key figures
                 in the UNIX community, contains classic photos and
                 illustrations, and explains why UNIX succeeded.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Acknowledgments \\
                 Preface \\
                 Introduction Part I. Genesis \\
                 0: Prelude to space \\
                 1: Summer 1969--Fall 1970 \\
                 2: Calculating and computing \\
                 3: Operating systems \\
                 4: Project MAC: CTSS and Multics \\
                 Part II. Birth of a system \\
                 5: The PDP-11 \\
                 6: First edition, 1971 \\
                 7: C and pipes: 1971-1973 \\
                 8: The first paper -1973 \\
                 9: The law --- part I \\
                 Status 1974 \\
                 Part III. What makes UNIX Unix? 10: The users \\
                 11: Why Unix? \\
                 12: Style and tools \\
                 13: PWB and MERT \\
                 14: Utilities \\
                 Part IV. Unix spreads and blossoms \\
                 15: The users --- part II \\
                 16: Berkeley Unix: part I \\
                 17: Version 7 \\
                 18: Berkeley Unix: part II \\
                 19: Commercial Unix \\
                 20: DEC \\
                 21: The law --- part II \\
                 Part V. The Unix industry \\
                 22: /usr/group \\
                 23: Sun and JAWS \\
                 24: Standards \\
                 Part VI. The currents of change \\
                 25: Duelling Unixes \\
                 26: Offspring systems \\
                 27: OSF and UI \\
                 28: Berkeley Unix: after the VAX \\
                 29: The law --- part III \\
                 Finale \\
                 Finale: What Made it Work? \\
                 Further Reading \\
                 Who's Who and What's What \\
                 Index",
}


bibtype: book
filename: master.bib
label: Sander:2012:MHA
author: Richard Henry Sander and Stuart Taylor
publisher: pub-BASIC-BOOKS
address: pub-BASIC-BOOKS:adr
pages: xii + 256
year: 2012
ISBN: 0-465-02996-5 (hardcover), 0-465-03001-7 (e-book) OR 0465029965 (hardcover), 0465030017 (ebook)
LCCN: LC213.52 .S26 2012
bibdate: Sat Sep 15 11:31:46 MDT 2018
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2018.09.15 11:31:46 MDT
acknowledgement: ack-nhfb
rawauthor: Richard Henry Sander and Stuart Taylor
title:
Mismatch: How Affirmative Action Hurts Students It's Intended to Help, and Why Universities Won't Admit It

ISBN13:
978-0-465-02996-9 (hardcover), 978-0-465-03001-9 (e-book) OR 9780465029969 (hardcover), 9780465030019 (ebook)

subject:
Affirmative action programs in education; United States; Discrimination in education; Universities and colleges; Admission; Educational equalization; Minorities; Education (Higher); Democratizacion de la enseananza; Estados Unidos; Programas de accion positiva; Integracion escolar; Universidades; Administracion; Minorias; Educacion; Affirmative action programs in education.; Discrimination in education.; Educational equalization.; Education (Higher); Admission.

TOC:
The idea of mismatch and why it matters A primer on affirmative action The discovery of the mismatch effect Law school mismatch The debate on law school mismatch The breadth of mismatch Proposition 209: the high road and the low road The warming effect Mismatch and the swelling ranks of graduates The hydra of preferences: the evasion of prop 209 at the University of California Why academics avoid honest debate about affirmative action Media, politics, and the accountability void The supreme court: rewarding opacity The George Mason affair Transparency and the California Bar affair Class, race, and the targeting of preferences Closing the test score gap: better parenting and K-12 education

rawtitle:
Mismatch: How Affirmative Action Hurts Students It's Intended to Help, and Why Universities Won't Admit It

rawTOC:
The idea of mismatch and why it matters \\ A primer on affirmative action \\ The discovery of the mismatch effect \\ Law school mismatch \\ The debate on law school mismatch \\ The breadth of mismatch \\ Proposition 209: the high road and the low road \\ The warming effect \\ Mismatch and the swelling ranks of graduates \\ The hydra of preferences: the evasion of prop 209 at the University of California \\ Why academics avoid honest debate about affirmative action \\ Media, politics, and the accountability void \\ The supreme court: rewarding opacity \\ The George Mason affair \\ Transparency and the California Bar affair \\ Class, race, and the targeting of preferences \\ Closing the test score gap: better parenting and K-12 education

entry:
@Book{Sander:2012:MHA,
  author =       "Richard Henry Sander and Stuart Taylor",
  title =        "Mismatch: How Affirmative Action Hurts Students It's
                 Intended to Help, and Why Universities Won't Admit It",
  publisher =    pub-BASIC-BOOKS,
  address =      pub-BASIC-BOOKS:adr,
  year =         "2012",
  ISBN =         "0-465-02996-5 (hardcover), 0-465-03001-7 (e-book)",
  ISBN-13 =      "978-0-465-02996-9 (hardcover), 978-0-465-03001-9
                 (e-book)",
  LCCN =         "LC213.52 .S26 2012",
  bibdate =      "Sat Sep 15 11:31:46 MDT 2018",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Affirmative action programs in education; United
                 States; Discrimination in education; Universities and
                 colleges; Admission; Educational equalization;
                 Minorities; Education (Higher); Democratizaci{\'o}n de
                 la ense{\"a}nanza; Estados Unidos; Programas de
                 acci{\'o}n positiva; Integraci{\'o}n escolar;
                 Universidades; Administraci{\'o}n; Minor{\'i}as;
                 Educaci{\'o}n; Affirmative action programs in
                 education.; Discrimination in education.; Educational
                 equalization.; Education (Higher); Admission.",
  tableofcontents = "The idea of mismatch and why it matters \\
                 A primer on affirmative action \\
                 The discovery of the mismatch effect \\
                 Law school mismatch \\
                 The debate on law school mismatch \\
                 The breadth of mismatch \\
                 Proposition 209: the high road and the low road \\
                 The warming effect \\
                 Mismatch and the swelling ranks of graduates \\
                 The hydra of preferences: the evasion of prop 209 at
                 the University of California \\
                 Why academics avoid honest debate about affirmative
                 action \\
                 Media, politics, and the accountability void \\
                 The supreme court: rewarding opacity \\
                 The George Mason affair \\
                 Transparency and the California Bar affair \\
                 Class, race, and the targeting of preferences \\
                 Closing the test score gap: better parenting and K-12
                 education",
}


bibtype: book
filename: master.bib
label: Sanders:2010:CEI
author: Jason Sanders and Edward Kandrot
title: CUDA by Example: an Introduction to General-purpose GPU Programming
publisher: pub-AW
address: pub-AW:adr
pages: xix + 290
year: 2010
ISBN: 0-13-138768-5 OR 0131387685
ISBN13: 978-0-13-138768-3 OR 9780131387683
LCCN: QA76.76.A65
bibdate: Wed Jul 28 23:24:12 MDT 2010
bibtimestamp: 2010.07.28 23:24:12 MDT
keywords: CUDA; GPU
subject: application software; development; computer architecture; parallel programming (computer science)
acknowledgement: ack-nhfb
rawauthor: Jason Sanders and Edward Kandrot
rawtitle: {CUDA} by Example: an Introduction to General-purpose {GPU} Programming
bibsource:
https://www.math.utah.edu/pub/bibnet/authors/d/dongarra-jack-j.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/pvm.bib; https://www.math.utah.edu/pub/tex/bib/scpe.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib; z3950.gbv.de:20011/gvk

abstract:
CUDA is a computing architecture designed to facilitate the development of parallel programs. This book shows programmers how to employ this new technology. Each area of CUDA development is introduced through working examples. After a concise introduction to the CUDA platform and architecture, as well as a quick-start guide to CUDA C, the book details the techniques and trade-offs associated with each key CUDA feature.

TOC:
Why CUDA? why now? Getting started Introduction to CUDA C Parallel programming in CUDA C Thread cooperation Constant memory and events Texture memory Graphics interoperability Atomics Streams CUDA C on multiple GPUs The final countdown Appendix A: Advanced atomics

rawabstract:
CUDA is a computing architecture designed to facilitate the development of parallel programs. This book shows programmers how to employ this new technology. Each area of CUDA development is introduced through working examples. After a concise introduction to the CUDA platform and architecture, as well as a quick-start guide to CUDA C, the book details the techniques and trade-offs associated with each key CUDA feature.

rawTOC:
Why CUDA? why now? \\ Getting started \\ Introduction to CUDA C \\ Parallel programming in CUDA C \\ Thread cooperation \\ Constant memory and events \\ Texture memory \\ Graphics interoperability \\ Atomics \\ Streams \\ CUDA C on multiple GPUs \\ The final countdown \\ Appendix A: Advanced atomics

entry:
@Book{Sanders:2010:CEI,
  author =       "Jason Sanders and Edward Kandrot",
  title =        "{CUDA} by Example: an Introduction to General-purpose
                 {GPU} Programming",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xix + 290",
  year =         "2010",
  ISBN =         "0-13-138768-5",
  ISBN-13 =      "978-0-13-138768-3",
  LCCN =         "QA76.76.A65",
  bibdate =      "Wed Jul 28 23:24:12 MDT 2010",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/d/dongarra-jack-j.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/pvm.bib;
                 https://www.math.utah.edu/pub/tex/bib/scpe.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib;
                 z3950.gbv.de:20011/gvk",
  abstract =     "CUDA is a computing architecture designed to
                 facilitate the development of parallel programs. This
                 book shows programmers how to employ this new
                 technology. Each area of CUDA development is introduced
                 through working examples. After a concise introduction
                 to the CUDA platform and architecture, as well as a
                 quick-start guide to CUDA C, the book details the
                 techniques and trade-offs associated with each key CUDA
                 feature.",
  acknowledgement = ack-nhfb,
  keywords =     "CUDA; GPU",
  subject =      "application software; development; computer
                 architecture; parallel programming (computer science)",
  tableofcontents = "Why CUDA? why now? \\
                 Getting started \\
                 Introduction to CUDA C \\
                 Parallel programming in CUDA C \\
                 Thread cooperation \\
                 Constant memory and events \\
                 Texture memory \\
                 Graphics interoperability \\
                 Atomics \\
                 Streams \\
                 CUDA C on multiple GPUs \\
                 The final countdown \\
                 Appendix A: Advanced atomics",
}


bibtype: book
filename: master.bib
label: Sandifer:2007:EML
author: Charles Edward Sandifer
title: The Early Mathematics of Leonhard Euler
volume: 1
publisher: pub-MAA
address: pub-MAA:adr
pages: xix + 391
year: 2007
ISBN: 0-88385-559-3 OR 0883855593
ISBN13: 978-0-88385-559-1 OR 9780883855591
LCCN: QA29.E8 S26 2007
bibdate: Mon Aug 10 17:49:32 MDT 2009
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2009.08.10 17:49:32 MDT
series: Spectrum series; MAA tercentenary Euler celebration
subject: Euler, Leonhard; Mathematics; History; 18th century
acknowledgement: ack-nhfb
subjectdates: 1707--1783
rawauthor: Charles Edward Sandifer
rawtitle: The Early Mathematics of {Leonhard Euler}
URL:
http://www.loc.gov/catdir/enhancements/fy0743/2006933948-d.html; http://www.loc.gov/catdir/enhancements/fy0743/2006933948-t.html

TOC:
Preface Interlude: 1725--1727 Construction of isochronal curves in any kind of resistant Method of finding reciprocal algebraic trajectories Interlude 1728 Solution to problems of reciprocal trajectories A new method of reducing innumerable differential equations of the second degree to equations of the first degree Interlude 1729--1731 On transcendental progressions, or those for which the general term cannot be given algebraically On the shortest curve on a surface that joins any two given points On the summation of innumerably many progressions Interlude 1732 General methods for summing progressions Observations on theorems that Fermat and others have looked at about prime numbers An account of the solution of isoperimetric problems in the broadest sense Interlude 1733 Construction of differential equations which do not admit separation of variables Example of the solution of a differential equation without separation of variables On the solution of problems of Diophantus about integer numbers Inferences on the forms of roots of equations and of their orders Solution of the differential equation $a x^n dx = dy + y^2 dx$ Interlude 1734 On curves of fastest descent in a resistant medium Observations on harmonic progressions On an infinity of curves of a given kind, or a method of finding equations for an infinity of curves of a given kind Additions to the dissertation on infinitely many curves of a given kind Investigation of two curves, the abscissas of which are corresponding arcs and the sum of which is algebraic Interlude 1735 On sums of series of reciprocals A universal method for finding sums which approximate convergent series Finding the sum of a series from a given general term On the solution of equations from the motion of pulling and other equations pertaining to the method of inverse tangents Solution of a problem requiring the rectification of an ellipse Solution of a problem relating to the geometry of position Interlude 1736 Proof of some theorems about looking at prime numbers Further universal methods for summing series A new and easy way of finding curves enjoying properties of maximum or minimum Interlude 1737 On the solution of equations An essay on continued fractions Various observations about infinite series Solution to a geometric problem about lunes formed by circles Interlude 1738 On rectifiable algebraic curves and algebraic reciprocal trajectories On various ways of closely approximating numbers for the quadrature of the circle On differential equations which sometimes can be integrated Proofs of some theorems of arithmetic Solution of some problems that were posed by the celebrated Daniel Bernoulli Interlude 1739 On products arising from infinitely many factors Observations on continued fractions Consideration of some progressions appropriate for finding the quadrature of the circle An easy method for computing sines and tangents of angles both natural and artificial Investigation of curves which produce evolutes that are similar to themselves Considerations about certain series Interlude 1740 Solution of problems in arithmetic of finding a number, which, when divided by given numbers leaves given remainders On the extraction of roots of irrational quantities Interlude 1741 Proof of the sum of this series $1 + 1/4 + 1/9 + 1/16 + 1/25 + 1/ 36 +$ etc Several analytic observations on combinations On the utility of higher mathematics

rawTOC:
Preface \\ Interlude: 1725--1727 \\ Construction of isochronal curves in any kind of resistant \\ Method of finding reciprocal algebraic trajectories \\ Interlude 1728 \\ Solution to problems of reciprocal trajectories \\ A new method of reducing innumerable differential equations of the second degree to equations of the first degree \\ Interlude 1729--1731 \\ On transcendental progressions, or those for which the general term cannot be given algebraically \\ On the shortest curve on a surface that joins any two given points \\ On the summation of innumerably many progressions \\ Interlude 1732 \\ General methods for summing progressions \\ Observations on theorems that Fermat and others have looked at about prime numbers \\ An account of the solution of isoperimetric problems in the broadest sense \\ Interlude 1733 \\ Construction of differential equations which do not admit separation of variables \\ Example of the solution of a differential equation without separation of variables \\ On the solution of problems of Diophantus about integer numbers \\ Inferences on the forms of roots of equations and of their orders \\ Solution of the differential equation $a x^n dx = dy + y^2 dx$ \\ Interlude 1734 \\ On curves of fastest descent in a resistant medium \\ Observations on harmonic progressions \\ On an infinity of curves of a given kind, or a method of finding equations for an infinity of curves of a given kind \\ Additions to the dissertation on infinitely many curves of a given kind \\ Investigation of two curves, the abscissas of which are corresponding arcs and the sum of which is algebraic \\ Interlude 1735 \\ On sums of series of reciprocals \\ A universal method for finding sums which approximate convergent series \\ Finding the sum of a series from a given general term \\ On the solution of equations from the motion of pulling and other equations pertaining to the method of inverse tangents \\ Solution of a problem requiring the rectification of an ellipse \\ Solution of a problem relating to the geometry of position \\ Interlude 1736 \\ Proof of some theorems about looking at prime numbers \\ Further universal methods for summing series \\ A new and easy way of finding curves enjoying properties of maximum or minimum \\ Interlude 1737 \\ On the solution of equations \\ An essay on continued fractions \\ Various observations about infinite series \\ Solution to a geometric problem about lunes formed by circles \\ Interlude 1738 \\ On rectifiable algebraic curves and algebraic reciprocal trajectories \\ On various ways of closely approximating numbers for the quadrature of the circle \\ On differential equations which sometimes can be integrated \\ Proofs of some theorems of arithmetic \\ Solution of some problems that were posed by the celebrated Daniel Bernoulli \\ Interlude 1739 \\ On products arising from infinitely many factors \\ Observations on continued fractions \\ Consideration of some progressions appropriate for finding the quadrature of the circle \\ An easy method for computing sines and tangents of angles both natural and artificial \\ Investigation of curves which produce evolutes that are similar to themselves \\ Considerations about certain series \\ Interlude 1740 \\ Solution of problems in arithmetic of finding a number, which, when divided by given numbers leaves given remainders \\ On the extraction of roots of irrational quantities \\ Interlude 1741 \\ Proof of the sum of this series $1 + 1/4 + 1/9 + 1/16 + 1/25 + 1/ 36 +$ etc \\ Several analytic observations on combinations \\ On the utility of higher mathematics

entry:
@Book{Sandifer:2007:EML,
  author =       "Charles Edward Sandifer",
  title =        "The Early Mathematics of {Leonhard Euler}",
  volume =       "1",
  publisher =    pub-MAA,
  address =      pub-MAA:adr,
  pages =        "xix + 391",
  year =         "2007",
  ISBN =         "0-88385-559-3",
  ISBN-13 =      "978-0-88385-559-1",
  LCCN =         "QA29.E8 S26 2007",
  bibdate =      "Mon Aug 10 17:49:32 MDT 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Spectrum series; MAA tercentenary Euler celebration",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0743/2006933948-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0743/2006933948-t.html",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Euler, Leonhard; Mathematics; History; 18th century",
  subject-dates = "1707--1783",
  tableofcontents = "Preface \\
                 Interlude: 1725--1727 \\
                 Construction of isochronal curves in any kind of
                 resistant \\
                 Method of finding reciprocal algebraic trajectories \\
                 Interlude 1728 \\
                 Solution to problems of reciprocal trajectories \\
                 A new method of reducing innumerable differential
                 equations of the second degree to equations of the
                 first degree \\
                 Interlude 1729--1731 \\
                 On transcendental progressions, or those for which the
                 general term cannot be given algebraically \\
                 On the shortest curve on a surface that joins any two
                 given points \\
                 On the summation of innumerably many progressions \\
                 Interlude 1732 \\
                 General methods for summing progressions \\
                 Observations on theorems that Fermat and others have
                 looked at about prime numbers \\
                 An account of the solution of isoperimetric problems in
                 the broadest sense \\
                 Interlude 1733 \\
                 Construction of differential equations which do not
                 admit separation of variables \\
                 Example of the solution of a differential equation
                 without separation of variables \\
                 On the solution of problems of Diophantus about integer
                 numbers \\
                 Inferences on the forms of roots of equations and of
                 their orders \\
                 Solution of the differential equation $a x^n dx = dy +
                 y^2 dx$ \\
                 Interlude 1734 \\
                 On curves of fastest descent in a resistant medium \\
                 Observations on harmonic progressions \\
                 On an infinity of curves of a given kind, or a method
                 of finding equations for an infinity of curves of a
                 given kind \\
                 Additions to the dissertation on infinitely many curves
                 of a given kind \\
                 Investigation of two curves, the abscissas of which are
                 corresponding arcs and the sum of which is algebraic
                 \\
                 Interlude 1735 \\
                 On sums of series of reciprocals \\
                 A universal method for finding sums which approximate
                 convergent series \\
                 Finding the sum of a series from a given general term
                 \\
                 On the solution of equations from the motion of pulling
                 and other equations pertaining to the method of inverse
                 tangents \\
                 Solution of a problem requiring the rectification of an
                 ellipse \\
                 Solution of a problem relating to the geometry of
                 position \\
                 Interlude 1736 \\
                 Proof of some theorems about looking at prime numbers
                 \\
                 Further universal methods for summing series \\
                 A new and easy way of finding curves enjoying
                 properties of maximum or minimum \\
                 Interlude 1737 \\
                 On the solution of equations \\
                 An essay on continued fractions \\
                 Various observations about infinite series \\
                 Solution to a geometric problem about lunes formed by
                 circles \\
                 Interlude 1738 \\
                 On rectifiable algebraic curves and algebraic
                 reciprocal trajectories \\
                 On various ways of closely approximating numbers for
                 the quadrature of the circle \\
                 On differential equations which sometimes can be
                 integrated \\
                 Proofs of some theorems of arithmetic \\
                 Solution of some problems that were posed by the
                 celebrated Daniel Bernoulli \\
                 Interlude 1739 \\
                 On products arising from infinitely many factors \\
                 Observations on continued fractions \\
                 Consideration of some progressions appropriate for
                 finding the quadrature of the circle \\
                 An easy method for computing sines and tangents of
                 angles both natural and artificial \\
                 Investigation of curves which produce evolutes that are
                 similar to themselves \\
                 Considerations about certain series \\
                 Interlude 1740 \\
                 Solution of problems in arithmetic of finding a number,
                 which, when divided by given numbers leaves given
                 remainders \\
                 On the extraction of roots of irrational quantities \\
                 Interlude 1741 \\
                 Proof of the sum of this series $1 + 1/4 + 1/9 + 1/16 +
                 1/25 + 1/ 36 +$ etc \\
                 Several analytic observations on combinations \\
                 On the utility of higher mathematics",
}


bibtype: book
filename: master.bib
label: Sandorfy:1964:ESQ
author: C. (Camille) Sandorfy
title: Electronic Spectra and Quantum Chemistry
publisher: pub-PH
address: pub-PH:adr
pages: xiii + 385
year: 1964
LCCN: QD95 .S218 1959
bibdate: Sat Jul 25 13:55:27 1998
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1998.07.25 13:55:27 ???
note: Originally published in French as em Les Spectres Electroniques en Chimie Theorique, 1959.
acknowledgement: ack-nhfb
rawauthor: C. (Camille) Sandorfy
rawnote: Originally published in French as {\em Les Spectres Electroniques en Chimie Theorique}, 1959.
rawtitle: Electronic Spectra and Quantum Chemistry
entry:
@Book{Sandorfy:1964:ESQ,
  author =       "C. (Camille) Sandorfy",
  title =        "Electronic Spectra and Quantum Chemistry",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xiii + 385",
  year =         "1964",
  LCCN =         "QD95 .S218 1959",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Originally published in French as {\em Les Spectres
                 Electroniques en Chimie Theorique}, 1959.",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}


bibtype: book
filename: master.bib
label: Sargent:1984:IPC
author: Murray Sargent III and Richard L. Schoemaker
title: The IBM Personal Computer from the Inside Out
publisher: pub-AW
address: pub-AW:adr
pages: xii + 483
year: 1984
ISBN: 0-201-06896-6 OR 0201068966
ISBN13: 978-0-201-06896-2 OR 9780201068962
LCCN: QA76.8.I2594 S27 1984
bibdate: Wed Dec 15 10:41:29 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 10:41:29 ???
acknowledgement: ack-nhfb
rawauthor: Murray {Sargent III} and Richard L. Schoemaker
rawtitle: The {IBM} Personal Computer from the Inside Out
note:
A strongly hardware-oriented, but very readable, treatment of the IBM PC. Contains three chapters on the 8088 and assembly language programming, with the remainder of the book devoted to descriptions of hardware, keyboard and video display, external devices, and data communications.

abstract:
Introduction to a super micro Introduction to assembly language Assembly language programming Advanced assembly language techniques Introduction to digital circuitry The inner workings Interrupts: real-time clock, typing ahead Keyboard and video display Controlling/monitoring devices Data communications The bigger picture Building your own interfaces

rawabstract:
Introduction to a super micro \\ Introduction to assembly language \\ Assembly language programming \\ Advanced assembly language techniques \\ Introduction to digital circuitry \\ The inner workings \\ Interrupts: real-time clock, typing ahead \\ Keyboard and video display \\ Controlling/monitoring devices \\ Data communications \\ The bigger picture \\ Building your own interfaces

rawnote:
A strongly hardware-oriented, but very readable, treatment of the IBM PC. Contains three chapters on the 8088 and assembly language programming, with the remainder of the book devoted to descriptions of hardware, keyboard and video display, external devices, and data communications.

entry:
@Book{Sargent:1984:IPC,
  author =       "Murray {Sargent III} and Richard L. Schoemaker",
  title =        "The {IBM} Personal Computer from the Inside Out",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xii + 483",
  year =         "1984",
  ISBN =         "0-201-06896-6",
  ISBN-13 =      "978-0-201-06896-2",
  LCCN =         "QA76.8.I2594 S27 1984",
  bibdate =      "Wed Dec 15 10:41:29 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "A strongly hardware-oriented, but very readable,
                 treatment of the IBM PC. Contains three chapters on the
                 8088 and assembly language programming, with the
                 remainder of the book devoted to descriptions of
                 hardware, keyboard and video display, external devices,
                 and data communications.",
  abstract =     "Introduction to a super micro \\
                 Introduction to assembly language \\
                 Assembly language programming \\
                 Advanced assembly language techniques \\
                 Introduction to digital circuitry \\
                 The inner workings \\
                 Interrupts: real-time clock, typing ahead \\
                 Keyboard and video display \\
                 Controlling/monitoring devices \\
                 Data communications \\
                 The bigger picture \\
                 Building your own interfaces",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Sayood:1996:IDC
author: Khalid Sayood
title: Introduction to Data Compression
publisher: pub-MORGAN-KAUFMANN
address: pub-MORGAN-KAUFMANN:adrnew
pages: xviii + 475
year: 1996
ISBN: 1-55860-346-8 OR 1558603468
ISBN13: 978-1-55860-346-2 OR 9781558603462
LCCN: TK5102.92 .S39 1996
MRclass: 94A29, 94-01
bibdate: Tue Feb 12 17:47:29 2002
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2002.02.12 17:47:29 ???
acknowledgement: ack-nhfb
rawauthor: Khalid Sayood
rawtitle: Introduction to Data Compression
TOC:
1: Introduction 2: Mathematical Preliminaries 3: Huffman Coding 4: Arithmetic Coding 5: Dictionary Techniques 6: Lossless Image Compression 7: Mathematical Preliminaries 8: Scalar Quantization 9: Vector Quantization 10: Differential Encoding 11: Subband Coding 12: Transform Coding 13: Analysis/Synthesis Schemes 14: Video Compression A: Probability and Random Processes B: A Brief Review of Matrix Concepts C: Codes for Facsimile Encoding D: The Root Lattices

rawTOC:
1: Introduction \\ 2: Mathematical Preliminaries \\ 3: Huffman Coding \\ 4: Arithmetic Coding \\ 5: Dictionary Techniques \\ 6: Lossless Image Compression \\ 7: Mathematical Preliminaries \\ 8: Scalar Quantization \\ 9: Vector Quantization \\ 10: Differential Encoding \\ 11: Subband Coding \\ 12: Transform Coding \\ 13: Analysis/Synthesis Schemes \\ 14: Video Compression \\ A: Probability and Random Processes \\ B: A Brief Review of Matrix Concepts \\ C: Codes for Facsimile Encoding \\ D: The Root Lattices

entry:
@Book{Sayood:1996:IDC,
  author =       "Khalid Sayood",
  title =        "Introduction to Data Compression",
  publisher =    pub-MORGAN-KAUFMANN,
  address =      pub-MORGAN-KAUFMANN:adrnew,
  pages =        "xviii + 475",
  year =         "1996",
  ISBN =         "1-55860-346-8",
  ISBN-13 =      "978-1-55860-346-2",
  LCCN =         "TK5102.92 .S39 1996",
  MRclass =      "94A29, 94-01",
  bibdate =      "Tue Feb 12 17:47:29 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "1: Introduction \\
                 2: Mathematical Preliminaries \\
                 3: Huffman Coding \\
                 4: Arithmetic Coding \\
                 5: Dictionary Techniques \\
                 6: Lossless Image Compression \\
                 7: Mathematical Preliminaries \\
                 8: Scalar Quantization \\
                 9: Vector Quantization \\
                 10: Differential Encoding \\
                 11: Subband Coding \\
                 12: Transform Coding \\
                 13: Analysis/Synthesis Schemes \\
                 14: Video Compression \\
                 A: Probability and Random Processes \\
                 B: A Brief Review of Matrix Concepts \\
                 C: Codes for Facsimile Encoding \\
                 D: The Root Lattices",
  xxpages =      "xx + 636",
}


bibtype: book
filename: master.bib
label: Sayood:2000:IDC
author: Khalid Sayood
title: Introduction to Data Compression
publisher: pub-MORGAN-KAUFMANN
address: pub-MORGAN-KAUFMANN:adrnew
edition: Second
pages: xx + 636
year: 2000
ISBN: 1-55860-558-4 OR 1558605584
ISBN13: 978-1-55860-558-9 OR 9781558605589
LCCN: TK5102.92 .S39 2000
bibdate: Mon Jan 28 06:42:20 MST 2013
bibtimestamp: 2013.01.28 06:42:20 MST
URL: http://www.mkp.com/books_catalog/catalog.asp?ISBN=1-55860-558-4
acknowledgement: ack-nhfb
rawauthor: Khalid Sayood
rawtitle: Introduction to Data Compression
bibsource:
https://www.math.utah.edu/pub/tex/bib/datacompression.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager

abstract:
This book provides an extensive introduction to the theory underlying today's compression techniques with detailed instruction for their application. The coverage has been significantly updated to reflect the state of the art in data compression, including both new algorithms and older methods for which new uses are being found. And the downloadable software gives you the opportunity to see firsthand how various algorithms work, to choose and implement appropriate techniques in your own applications, and to build your own algorithms.

TOC:
1: Introduction 2: Mathematical Preliminaries for Lossless Compression 3: Huffman Coding 4: Arithmetic Coding 5: Dictionary Techniques 6: Predictive Coding 7: Mathematical Preliminaries for Lossy Coding 8: Scalar Quantization 9: Vector Quantization 10: Differential Encoding 11: Mathematical Preliminaries for Transforms, Subbands, and Wavelets 12: Transform Coding 13: Subband Coding 14: Wavelet-Based Compression 15: Analysis/Synthesis Schemes 16: Video Compression A: Probability and Random Processes B: A Brief Review of Matrix Concepts C: The Root Lattices

rawabstract:
This book provides an extensive introduction to the theory underlying today's compression techniques with detailed instruction for their application. The coverage has been significantly updated to reflect the state of the art in data compression, including both new algorithms and older methods for which new uses are being found. And the downloadable software gives you the opportunity to see firsthand how various algorithms work, to choose and implement appropriate techniques in your own applications, and to build your own algorithms.

rawTOC:
1: Introduction \\ 2: Mathematical Preliminaries for Lossless Compression \\ 3: Huffman Coding \\ 4: Arithmetic Coding \\ 5: Dictionary Techniques \\ 6: Predictive Coding \\ 7: Mathematical Preliminaries for Lossy Coding \\ 8: Scalar Quantization \\ 9: Vector Quantization \\ 10: Differential Encoding \\ 11: Mathematical Preliminaries for Transforms, Subbands, and Wavelets \\ 12: Transform Coding \\ 13: Subband Coding \\ 14: Wavelet-Based Compression \\ 15: Analysis/Synthesis Schemes \\ 16: Video Compression \\ A: Probability and Random Processes \\ B: A Brief Review of Matrix Concepts \\ C: The Root Lattices

entry:
@Book{Sayood:2000:IDC,
  author =       "Khalid Sayood",
  title =        "Introduction to Data Compression",
  publisher =    pub-MORGAN-KAUFMANN,
  address =      pub-MORGAN-KAUFMANN:adrnew,
  edition =      "Second",
  pages =        "xx + 636",
  year =         "2000",
  ISBN =         "1-55860-558-4",
  ISBN-13 =      "978-1-55860-558-9",
  LCCN =         "TK5102.92 .S39 2000",
  bibdate =      "Mon Jan 28 06:42:20 MST 2013",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  price =        "US\$69.95",
  URL =          "http://www.mkp.com/books_catalog/catalog.asp?ISBN=1-55860-558-4",
  abstract =     "This book provides an extensive introduction to the
                 theory underlying today's compression techniques with
                 detailed instruction for their application. The
                 coverage has been significantly updated to reflect the
                 state of the art in data compression, including both
                 new algorithms and older methods for which new uses are
                 being found. And the downloadable software gives you
                 the opportunity to see firsthand how various algorithms
                 work, to choose and implement appropriate techniques in
                 your own applications, and to build your own
                 algorithms.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "1: Introduction \\
                 2: Mathematical Preliminaries for Lossless Compression
                 \\
                 3: Huffman Coding \\
                 4: Arithmetic Coding \\
                 5: Dictionary Techniques \\
                 6: Predictive Coding \\
                 7: Mathematical Preliminaries for Lossy Coding \\
                 8: Scalar Quantization \\
                 9: Vector Quantization \\
                 10: Differential Encoding \\
                 11: Mathematical Preliminaries for Transforms,
                 Subbands, and Wavelets \\
                 12: Transform Coding \\
                 13: Subband Coding \\
                 14: Wavelet-Based Compression \\
                 15: Analysis/Synthesis Schemes \\
                 16: Video Compression \\
                 A: Probability and Random Processes \\
                 B: A Brief Review of Matrix Concepts \\
                 C: The Root Lattices",
}


bibtype: book
filename: master.bib
label: Sayood:2005:IDC
author: Khalid Sayood
title: Introduction to Data Compression
publisher: pub-ELSEVIER
address: pub-ELSEVIER:adr
edition: Third
pages: xxii + 680
year: 2005
ISBN: 0-12-620862-X (hardcover), 0-08-050925-8 (e-book) OR 012620862X (hardcover), 0080509258 (ebook)
LCCN: TK5102.92 .S39 2005
bibdate: Wed Oct 26 16:49:48 MDT 2005
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2005.10.26 16:49:48 MDT
subject: Data compression (Telecommunication); Coding theory
acknowledgement: ack-nhfb
rawauthor: Khalid Sayood
rawtitle: Introduction to Data Compression
ISBN13:
978-0-12-620862-7 (hardcover), 978-0-08-050925-9 (e-book) OR 9780126208627 (hardcover), 9780080509259 (ebook)

TOC:
1: Introduction 2: Lossless Compression 3: Huffman Coding 4: Arithmetic Coding 5: Dictionary Techniques 6: Context Based Compression 7: Lossless Image Compression 8: Lossy Coding 9: Scalar Quantization 10: Vector Quantization 11: Differential Encoding 12: Transforms, Subbands, and Wavelets 13: Transform Coding 14: Subband Coding 15: Wavelet-Based Compression 16: Audio Coding 17: Analysis/Synthesis and Analysis by Synthesis Schemes 18: Video Compression Appendix A: Probability and Random Processes Appendix B: A Brief Review of Matrix Concepts Appendix C: The Root Lattices Bibliography

rawTOC:
1: Introduction \\ 2: Lossless Compression \\ 3: Huffman Coding \\ 4: Arithmetic Coding \\ 5: Dictionary Techniques \\ 6: Context Based Compression \\ 7: Lossless Image Compression \\ 8: Lossy Coding \\ 9: Scalar Quantization \\ 10: Vector Quantization \\ 11: Differential Encoding \\ 12: Transforms, Subbands, and Wavelets \\ 13: Transform Coding \\ 14: Subband Coding \\ 15: Wavelet-Based Compression \\ 16: Audio Coding \\ 17: Analysis/Synthesis and Analysis by Synthesis Schemes \\ 18: Video Compression \\ Appendix A: Probability and Random Processes \\ Appendix B: A Brief Review of Matrix Concepts \\ Appendix C: The Root Lattices \\ Bibliography

entry:
@Book{Sayood:2005:IDC,
  author =       "Khalid Sayood",
  title =        "Introduction to Data Compression",
  publisher =    pub-ELSEVIER,
  address =      pub-ELSEVIER:adr,
  edition =      "Third",
  pages =        "xxii + 680",
  year =         "2005",
  ISBN =         "0-12-620862-X (hardcover), 0-08-050925-8 (e-book)",
  ISBN-13 =      "978-0-12-620862-7 (hardcover), 978-0-08-050925-9
                 (e-book)",
  LCCN =         "TK5102.92 .S39 2005",
  bibdate =      "Wed Oct 26 16:49:48 MDT 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "Data compression (Telecommunication); Coding theory",
  tableofcontents = "1: Introduction \\
                 2: Lossless Compression \\
                 3: Huffman Coding \\
                 4: Arithmetic Coding \\
                 5: Dictionary Techniques \\
                 6: Context Based Compression \\
                 7: Lossless Image Compression \\
                 8: Lossy Coding \\
                 9: Scalar Quantization \\
                 10: Vector Quantization \\
                 11: Differential Encoding \\
                 12: Transforms, Subbands, and Wavelets \\
                 13: Transform Coding \\
                 14: Subband Coding \\
                 15: Wavelet-Based Compression \\
                 16: Audio Coding \\
                 17: Analysis/Synthesis and Analysis by Synthesis
                 Schemes \\
                 18: Video Compression \\
                 Appendix A: Probability and Random Processes \\
                 Appendix B: A Brief Review of Matrix Concepts \\
                 Appendix C: The Root Lattices \\
                 Bibliography",
}


bibtype: book
filename: master.bib
label: Scanlon:1984:ALP
author: Leo J. Scanlon
title: 8086 / 88 Assembly Language Programming
publisher: pub-BRADY
address: pub-BRADY:adr
pages: ix + 213
year: 1984
ISBN: 0-89303-424-X OR 089303424X
ISBN13: 978-0-89303-424-5 OR 9780893034245
LCCN: QA76.8.I292 S29 1984
bibdate: Wed Dec 15 18:14:57 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 18:14:57 ???
acknowledgement: ack-nhfb
rawauthor: Leo J. Scanlon
rawtitle: 8086\slash 88 Assembly Language Programming
note:
A rather short treatment of assembly language programming for the 8088 and 8086, with a short chapter on the 8087. Nothing specific to the IBM PC, and not detailed enough for a beginner. Two related books cite Bradley:1984:ALP,Lafore:1984:ALP contain much more detail.

rawnote:
A rather short treatment of assembly language programming for the 8088 and 8086, with a short chapter on the 8087. Nothing specific to the IBM PC, and not detailed enough for a beginner. Two related books \cite{Bradley:1984:ALP,Lafore:1984:ALP} contain much more detail.

entry:
@Book{Scanlon:1984:ALP,
  author =       "Leo J. Scanlon",
  title =        "8086\slash 88 Assembly Language Programming",
  publisher =    pub-BRADY,
  address =      pub-BRADY:adr,
  pages =        "ix + 213",
  year =         "1984",
  ISBN =         "0-89303-424-X",
  ISBN-13 =      "978-0-89303-424-5",
  LCCN =         "QA76.8.I292 S29 1984",
  bibdate =      "Wed Dec 15 18:14:57 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "A rather short treatment of assembly language
                 programming for the 8088 and 8086, with a short chapter
                 on the 8087. Nothing specific to the IBM PC, and not
                 detailed enough for a beginner. Two related books
                 \cite{Bradley:1984:ALP,Lafore:1984:ALP} contain much
                 more detail.",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Schachter:1983:CIG
editor: Bruce J. Schachter
title: Computer Image Generation
publisher: pub-WILEY
address: pub-WILEY:adr
pages: xx + 236
year: 1983
ISBN: 0-471-87287-3 OR 0471872873
ISBN13: 978-0-471-87287-0 OR 9780471872870
LCCN: T385 .C5934 1983
bibdate: Wed Dec 15 10:41:31 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 10:41:31 ???
acknowledgement: ack-nhfb
raweditor: Bruce J. Schachter
rawtitle: Computer Image Generation
entry:
@Book{Schachter:1983:CIG,
  editor =       "Bruce J. Schachter",
  title =        "Computer Image Generation",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xx + 236",
  year =         "1983",
  ISBN =         "0-471-87287-3",
  ISBN-13 =      "978-0-471-87287-0",
  LCCN =         "T385 .C5934 1983",
  bibdate =      "Wed Dec 15 10:41:31 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$29.95",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Schechter:1998:MBO
author: Bruce Schechter
title: My Brain is Open: the Mathematical Journeys of Paul Erdos
publisher: pub-SIMON-SCHUSTER
address: pub-SIMON-SCHUSTER:adr
pages: 224
year: 1998
ISBN: 0-684-84635-7 OR 0684846357
ISBN13: 978-0-684-84635-4 OR 9780684846354
LCCN: QA29.E86 S34 1998
bibdate: Mon Mar 06 08:50:51 2000
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2000.03.06 08:50:51 ???
acknowledgement: ack-nhfb
rawauthor: Bruce Schechter
rawtitle: My Brain is Open: the Mathematical Journeys of {Paul Erd{\H{o}}s}
abstract:
Physicist and science writer Bruce Schechter's biography of legendary Hungarian mathematician Paul Erdos is an engaging portrait, warm and intimate, bringing this strange, happy man to life. Here, we get to see Erdos's brief childhood transform quickly into a carefree adolescence of solving difficult math problems with his circle of brilliant friends --- uniquely encouraged by a country that valued the contributions of mathematics in a way that has never been equaled. Fleeing the Holocaust, Erdos never settled down, instead traveling from place to place, showing up on the doorsteps of other mathematicians with his few possessions and an open mind. During his career, Erdos published more papers than any other mathematician in history. Most of the papers were collaborations.

TOC:
Proof The happy end problem Erdos and the fate of western civilization The joy of sets Six degrees of collaboration

rawabstract:
Physicist and science writer Bruce Schechter's biography of legendary Hungarian mathematician Paul Erd{\H{o}}s is an engaging portrait, warm and intimate, bringing this strange, happy man to life. Here, we get to see Erd{\H{o}}s's brief childhood transform quickly into a carefree adolescence of solving difficult math problems with his circle of brilliant friends --- uniquely encouraged by a country that valued the contributions of mathematics in a way that has never been equaled. Fleeing the Holocaust, Erd{\H{o}}s never settled down, instead traveling from place to place, showing up on the doorsteps of other mathematicians with his few possessions and an open mind. During his career, Erd{\H{o}}s published more papers than any other mathematician in history. Most of the papers were collaborations.

rawTOC:
Proof \\ The happy end problem \\ Erd{\H{o}}s and the fate of western civilization \\ The joy of sets \\ Six degrees of collaboration

entry:
@Book{Schechter:1998:MBO,
  author =       "Bruce Schechter",
  title =        "My Brain is Open: the Mathematical Journeys of {Paul
                 Erd{\H{o}}s}",
  publisher =    pub-SIMON-SCHUSTER,
  address =      pub-SIMON-SCHUSTER:adr,
  pages =        "224",
  year =         "1998",
  ISBN =         "0-684-84635-7",
  ISBN-13 =      "978-0-684-84635-4",
  LCCN =         "QA29.E86 S34 1998",
  bibdate =      "Mon Mar 06 08:50:51 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$13.00",
  abstract =     "Physicist and science writer Bruce Schechter's
                 biography of legendary Hungarian mathematician Paul
                 Erd{\H{o}}s is an engaging portrait, warm and intimate,
                 bringing this strange, happy man to life. Here, we get
                 to see Erd{\H{o}}s's brief childhood transform quickly
                 into a carefree adolescence of solving difficult math
                 problems with his circle of brilliant friends ---
                 uniquely encouraged by a country that valued the
                 contributions of mathematics in a way that has never
                 been equaled. Fleeing the Holocaust, Erd{\H{o}}s never
                 settled down, instead traveling from place to place,
                 showing up on the doorsteps of other mathematicians
                 with his few possessions and an open mind. During his
                 career, Erd{\H{o}}s published more papers than any
                 other mathematician in history. Most of the papers were
                 collaborations.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Proof \\
                 The happy end problem \\
                 Erd{\H{o}}s and the fate of western civilization \\
                 The joy of sets \\
                 Six degrees of collaboration",
}


bibtype: book
filename: master.bib
label: Scheifler:1988:XWS
author: Robert W. Scheifler and James Gettys and Ron Newman
title: X Window System: C Library and Protocol Reference
publisher: pub-DP
address: pub-DP:adr
pages: xxix + 701
year: 1988
ISBN: 1-55558-012-2 OR 1555580122
ISBN13: 978-1-55558-012-4 OR 9781555580124
LCCN: QA76.76.W56 S34 1988
bibdate: Wed Dec 15 10:41:32 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 10:41:32 ???
acknowledgement: ack-nhfb
rawauthor: Robert W. Scheifler and James Gettys and Ron Newman
rawtitle: {X Window System}: {C} Library and Protocol Reference
entry:
@Book{Scheifler:1988:XWS,
  author =       "Robert W. Scheifler and James Gettys and Ron Newman",
  title =        "{X Window System}: {C} Library and Protocol
                 Reference",
  publisher =    pub-DP,
  address =      pub-DP:adr,
  pages =        "xxix + 701",
  year =         "1988",
  ISBN =         "1-55558-012-2",
  ISBN-13 =      "978-1-55558-012-4",
  LCCN =         "QA76.76.W56 S34 1988",
  bibdate =      "Wed Dec 15 10:41:32 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Scheifler:1989:XPR
author: Robert W. Scheifler
title: X Protocol Reference Manual
volume: 0
publisher: pub-ORA
address: pub-ORA:adr
pages: xv + 398
year: 1989
ISBN: 0-937175-40-4 OR 0937175404
ISBN13: 978-0-937175-40-8 OR 9780937175408
LCCN: QA76.76.W56 X5 1989
bibdate: Wed Jul 6 14:53:46 1994
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1994.07.06 14:53:46 ???
acknowledgement: ack-nhfb
rawauthor: Robert W. Scheifler
rawtitle: {X} Protocol Reference Manual
entry:
@Book{Scheifler:1989:XPR,
  author =       "Robert W. Scheifler",
  title =        "{X} Protocol Reference Manual",
  volume =       "0",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xv + 398",
  year =         "1989",
  ISBN =         "0-937175-40-4",
  ISBN-13 =      "978-0-937175-40-8",
  LCCN =         "QA76.76.W56 X5 1989",
  bibdate =      "Wed Jul 6 14:53:46 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Scheinerman:2011:MN
author: Edward R. Scheinerman
title: Mathematical notation
publisher: CreateSpace
address: USA
pages: viii + 84
year: 2011
ISBN: 1-4662-3052-5 OR 1466230525
ISBN13: 978-1-4662-3052-1 OR 9781466230521
LCCN: QA41 .S34 2011
bibdate: Tue Aug 4 09:33:21 MDT 2020
bibtimestamp: 2020.08.04 09:33:21 MDT
remark: Includes chart on pages 69--72 of common LaTeX mathematical symbol names.
subject: Mathematical notation
acknowledgement: ack-nhfb
rawauthor: Edward R. Scheinerman
rawtitle: Mathematical notation
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

TOC:
Preface / vii How to use this Guide / vii How not to use this Guide / viii Acknowledgments / viii Chapter 1. Letters / 1 1. The Latin alphabet / 1 2. The Greek alphabet / 2 3. Decorations / 2 4. Traditional uses / 3 Chapter 2. Collections / 5 1. Sets / 5 2. Lists / 8 3. Big sums, products, and so on / 8 Chapter 3. Logic / 11 1. Boolean operations and proof symbols / 11 2. Quantifiers / 12 Chapter 4. Numbers / 13 1. Real numbers / 13 2. Subsets of the reals / 15 3. ``Famous'' real numbers / 16 4. Complex numbers / 17 5. Basic operations / 18 6. Other number systems / 18 7. To infinity and beyond / 19 Chapter 5. Geometry / 21 1. Fundamentals / 21 2. Coordinates / 22 3. Differential geometry / 23 Chapter 6. Functions / 25 1. Fundamentals / 25 2. Standard functions / 27 3. Classes of functions / 33 4. Polynomials, power series, and rational functions / 34 5. Miscellany / 35 Chapter 7. Linear Algebra / 39 1. Vectors / 39 2. Matrices / 41 3. Tensors / 47 Chapter 8. Calculus / 49 1. Limits / 49 2. Derivatives (single independent variable, scalar- or vector-valued) / 49 3. Derivatives (multiple independent variables, scalar-valued) / 50 4. Derivatives (multiple independent variables, vector-valued) / 52 5. Integration / 54 6. Convolution and transforms / 55 Chapter 9. Probability and Statistics / 57 1. Probability / 57 2. Statistics / 61 Chapter 10. Approximation / 63 1. Approximate equality of numbers / 63 2. Asymptotic relations / 63 3. Big-oh notation and its relatives / 64 Bibliography / 67 Chart / 69 Alphabetical Notation Index / 73 Greek Notation Index / 77 Topic Index / 79

rawTOC:
Preface / vii \\ How to use this Guide / vii \\ How not to use this Guide / viii \\ Acknowledgments / viii \\ Chapter 1. Letters / 1 \\ 1. The Latin alphabet / 1 \\ 2. The Greek alphabet / 2 \\ 3. Decorations / 2 \\ 4. Traditional uses / 3 \\ Chapter 2. Collections / 5 \\ 1. Sets / 5 \\ 2. Lists / 8 \\ 3. Big sums, products, and so on / 8 \\ Chapter 3. Logic / 11 \\ 1. Boolean operations and proof symbols / 11 \\ 2. Quantifiers / 12 \\ Chapter 4. Numbers / 13 \\ 1. Real numbers / 13 \\ 2. Subsets of the reals / 15 \\ 3. ``Famous'' real numbers / 16 \\ 4. Complex numbers / 17 \\ 5. Basic operations / 18 \\ 6. Other number systems / 18 \\ 7. To infinity and beyond / 19 \\ Chapter 5. Geometry / 21 \\ 1. Fundamentals / 21 \\ 2. Coordinates / 22 \\ 3. Differential geometry / 23 \\ Chapter 6. Functions / 25 \\ 1. Fundamentals / 25 \\ 2. Standard functions / 27 \\ 3. Classes of functions / 33 \\ 4. Polynomials, power series, and rational functions / 34 \\ 5. Miscellany / 35 \\ Chapter 7. Linear Algebra / 39 \\ 1. Vectors / 39 \\ 2. Matrices / 41 \\ 3. Tensors / 47 \\ Chapter 8. Calculus / 49 \\ 1. Limits / 49 \\ 2. Derivatives (single independent variable, scalar- or vector-valued) / 49 \\ 3. Derivatives (multiple independent variables, scalar-valued) / 50 \\ 4. Derivatives (multiple independent variables, vector-valued) / 52 \\ 5. Integration / 54 \\ 6. Convolution and transforms / 55 \\ Chapter 9. Probability and Statistics / 57 \\ 1. Probability / 57 \\ 2. Statistics / 61 \\ Chapter 10. Approximation / 63 \\ 1. Approximate equality of numbers / 63 \\ 2. Asymptotic relations / 63 \\ 3. Big-oh notation and its relatives / 64 \\ Bibliography / 67 \\ Chart / 69 \\ Alphabetical Notation Index / 73 \\ Greek Notation Index / 77 \\ Topic Index / 79

entry:
@Book{Scheinerman:2011:MN,
  author =       "Edward R. Scheinerman",
  title =        "Mathematical notation",
  publisher =    "CreateSpace",
  address =      "USA",
  pages =        "viii + 84",
  year =         "2011",
  ISBN =         "1-4662-3052-5",
  ISBN-13 =      "978-1-4662-3052-1",
  LCCN =         "QA41 .S34 2011",
  bibdate =      "Tue Aug 4 09:33:21 MDT 2020",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  acknowledgement = ack-nhfb,
  remark =       "Includes chart on pages 69--72 of common LaTeX
                 mathematical symbol names.",
  subject =      "Mathematical notation",
  tableofcontents = "Preface / vii \\
                 How to use this Guide / vii \\
                 How not to use this Guide / viii \\
                 Acknowledgments / viii \\
                 Chapter 1. Letters / 1 \\
                 1. The Latin alphabet / 1 \\
                 2. The Greek alphabet / 2 \\
                 3. Decorations / 2 \\
                 4. Traditional uses / 3 \\
                 Chapter 2. Collections / 5 \\
                 1. Sets / 5 \\
                 2. Lists / 8 \\
                 3. Big sums, products, and so on / 8 \\
                 Chapter 3. Logic / 11 \\
                 1. Boolean operations and proof symbols / 11 \\
                 2. Quantifiers / 12 \\
                 Chapter 4. Numbers / 13 \\
                 1. Real numbers / 13 \\
                 2. Subsets of the reals / 15 \\
                 3. ``Famous'' real numbers / 16 \\
                 4. Complex numbers / 17 \\
                 5. Basic operations / 18 \\
                 6. Other number systems / 18 \\
                 7. To infinity and beyond / 19 \\
                 Chapter 5. Geometry / 21 \\
                 1. Fundamentals / 21 \\
                 2. Coordinates / 22 \\
                 3. Differential geometry / 23 \\
                 Chapter 6. Functions / 25 \\
                 1. Fundamentals / 25 \\
                 2. Standard functions / 27 \\
                 3. Classes of functions / 33 \\
                 4. Polynomials, power series, and rational functions /
                 34 \\
                 5. Miscellany / 35 \\
                 Chapter 7. Linear Algebra / 39 \\
                 1. Vectors / 39 \\
                 2. Matrices / 41 \\
                 3. Tensors / 47 \\
                 Chapter 8. Calculus / 49 \\
                 1. Limits / 49 \\
                 2. Derivatives (single independent variable, scalar- or
                 vector-valued) / 49 \\
                 3. Derivatives (multiple independent variables,
                 scalar-valued) / 50 \\
                 4. Derivatives (multiple independent variables,
                 vector-valued) / 52 \\
                 5. Integration / 54 \\
                 6. Convolution and transforms / 55 \\
                 Chapter 9. Probability and Statistics / 57 \\
                 1. Probability / 57 \\
                 2. Statistics / 61 \\
                 Chapter 10. Approximation / 63 \\
                 1. Approximate equality of numbers / 63 \\
                 2. Asymptotic relations / 63 \\
                 3. Big-oh notation and its relatives / 64 \\
                 Bibliography / 67 \\
                 Chart / 69 \\
                 Alphabetical Notation Index / 73 \\
                 Greek Notation Index / 77 \\
                 Topic Index / 79",
}


bibtype: book
filename: master.bib
label: Schendel:1984:INM
author: U. Schendel
title: Introduction to Numerical Methods for Parallel Computers
publisher: pub-ELLIS-HORWOOD
address: pub-ELLIS-HORWOOD:adr
pages: 151
year: 1984
ISBN: 0-470-20091-X, 0-85312-597-X OR 047020091X, 085312597X
ISBN13: 978-0-470-20091-9, 978-0-85312-597-6 OR 9780470200919, 9780853125976
LCCN: QA297 .S3813 1984
bibdate: Wed Dec 15 10:41:33 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 10:41:33 ???
series: Ellis Horwood Series in Mathematics and its Applications, Editor: G. M. Bell
acknowledgement: ack-nhfb
rawauthor: U. Schendel
rawtitle: Introduction to Numerical Methods for Parallel Computers
entry:
@Book{Schendel:1984:INM,
  author =       "U. Schendel",
  title =        "Introduction to Numerical Methods for Parallel
                 Computers",
  publisher =    pub-ELLIS-HORWOOD,
  address =      pub-ELLIS-HORWOOD:adr,
  pages =        "151",
  year =         "1984",
  ISBN =         "0-470-20091-X, 0-85312-597-X",
  ISBN-13 =      "978-0-470-20091-9, 978-0-85312-597-6",
  LCCN =         "QA297 .S3813 1984",
  bibdate =      "Wed Dec 15 10:41:33 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "UK\pounds 15.00",
  series =       "Ellis Horwood Series in Mathematics and its
                 Applications, Editor: G. M. Bell",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Schengili-Roberts:2000:CC
author: Keith Schengili-Roberts
title: Core CSS
publisher: pub-PHPTR
address: pub-PHPTR:adr
pages: xxxvii + 635 + 4
year: 2000
ISBN: 0-13-083456-4 (paperback) OR 0130834564 (paperback)
ISBN13: 978-0-13-083456-0 (paperback) OR 9780130834560 (paperback)
LCCN: TK5105.888. S32 2000
bibdate: Mon Oct 26 18:00:35 MDT 2009
bibtimestamp: 2009.10.26 18:00:35 MDT
series: Prentice Hall PTR core series
subject: Cascading Style Sheets; Web sites; design; computer graphics; Web publishing
acknowledgement: ack-nhfb
rawauthor: Keith Schengili-Roberts
rawtitle: Core {CSS}
bibsource:
https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/sgml2000.bib; z3950.loc.gov:7090/Voyager

TOC:
Acknowledgments / xxix Preface / xxxi Who You Are / xxxii How This Book Is Organized / xxxiii Conventions Used in This Book / xxxv Further Information / xxxv Additional Material / xxxvi Feedback / xxxvii The Birth of CSS / 2 The World Wide Web Consortium Introduces Cascading Style Sheets / 5 XHTML, CSS2 and CSS3 / 7 Re-emergence of the Browser Wars? / 10 (X)Html and Its Relationship to CSS / 14 Adding Cascading Style Sheets to Web Pages / 17 The <style> Element / 18 The <span> and <div> Elements / 21 The <link> Element / 24 Browser Adoption of CSS / 28 Internet Explorer 3.x / 30 Internet Explorer 4.x / 31 Internet Explorer 4.5 (Macintosh) and 5.x (Windows and Macintosh) / 32 Internet Explorer 5.5 / 34 Internet Explorer 6.0 / 35 Opera 3.5 / 37 Opera 4.x--6.x / 38 Netscape Navigator 4.x / 39 Mozilla and Netscape Navigator 6.x and 7.x / 40 Other Browsers / 47 Implementation of Basic CSS Concepts / 52 Grouping / 53 Inheritance / 56 Class and id as Selectors / 58 Contextual Selectors / 62 Comments / 66 CSS2 Selectors / 67 CSS3 Selectors / 76 The Cascade / 82 Cascading Order / 83 Important / 88 Cascade-Order Sources / 90 CSS Units / 94 Length Units / 95 Percentage Units / 101 URLs / 103 Strings / 106 Time Units / 108 Angle Units / 108 Frequency Units / 110 Pseudo-Classes and Pseudo-Elements / 112 Anchor Pseudo-Element / 114 First-line Pseudo-Element / 117 First-letter Pseudo-Element / 119 Lang Pseudo-Class / 122 Left, right and first Pseudo-Classes / 123 Focus and hover Pseudo-Classes / 123 First-child Pseudo-Class / 125 Pseudo-Elements in Selectors and Combining Multiple Pseudo-Elements / 128 Media Types and Media Queries / 130 Browser Compatibility / 134 Media Queries / 135 Width and height Media Queries / 136 Device-width and device-height Media Queries / 136 Device-aspect-ratio Media Query / 137 Color Media Query / 137 Color-index Media Query / 138 Monochrome Media Query / 138 Resolution Media Query / 139 Scan Media Query / 139 Grid Media Query / 140 Font Properties / 142 Font-family Property / 144 Font-size Property / 150 Font-style Property / 158 Font-variant Property / 160 Font-weight Property / 162 Font Property / 167 Font-stretch Property / 170 Font-size-adjust Property / 173 The <at>font-face Pseudo-Element / 175 CSS3 Font Decoration Properties / 182 Text Properties / 186 Letter-spacing Property / 187 Word-spacing Property / 190 Line-height Property / 193 Vertical-align Property / 196 Text-align Property / 198 Text-decoration Property / 201 Text-indent Property / 204 Text-transform Property / 207 Text-shadow Property / 209 Glyph-orientation-horizontal and glyph-orientation-vertical Properties / 211 Text-script Property / 214 Min-font-size and max-font-size Properties / 215 Text-justify-trim Property / 216 Line-break Property / 216 Word-break-cjk Property / 216 Word-break-inside Property / 217 Word-break Property / 217 Wrap-option Property / 218 Linefeed-treatment Property / 219 White-space-treatment Property / 219 All-space-treatment Property / 220 White-space Property / 220 Text-overflow-mode Property / 222 Text-overflow-ellipsis Property / 222 Text-overflow Property / 223 Kerning-mode Property / 223 Kerning-pair-threshold Property / 224 Punctuation-trim Property / 224 Text-line-through Set of Properties / 225 Text-overline Set of Properties / 228 Text-underline Set of Properties / 232 Text-blink Property / 236 Text Property Extensions / 238 Internet Explorer Text-Formatting CSS Extensions / 239 Layout-flow Property / 239 Writing-mode Property / 244 Layout-grid Sub-Family of Properties / 247 Text-autospace Property / 258 Text-justify Property / 261 Text-kashida-space Property / 264 Text-underline-position Property / 266 Word-break Property / 268 Text-align-last Property / 271 Box Properties / 274 Border-`style' Properties / 276 Border-style Property / 277 Border-color Property / 280 Border-width Property / 283 Border-bottom Property / 286 Border-left Property / 289 Border-right Property / 292 Border-top Property / 294 Border-bottom-width Property / 297 Border-left-width Property / 299 Border-right-width Property / 302 Border-top-width Property / 304 Border Property / 307 Border-radius Set of Properties / 310 Border-image Set of Properties / 312 Border-fit Set of Properties / 314 Border-image-transform Set of Properties / 317 Border-break Property / 319 Box-shadow Property / 319 Clear Property / 321 Clear-after Property / 324 Float Property / 325 Float-displace Property / 331 Indent-edge-reset Property / 332 Height Property / 332 Width Property / 335 Padding-bottom Property / 337 Padding-left Property / 339 Padding-right Property / 341 Padding-top Property / 343 Padding Property / 345 Margin-bottom Property / 349 Margin-left Property / 352 Margin-right Property / 354 Margin-top Property / 357 Margin Property / 360 Min-width, max-width, min-height and max-height Properties / 362 Fit and fit-position Properties / 363 Marquee Properties / 365 Color / 368 Color Property / 370 Gamma Correction under CSS3 / 375 Opacity Property / 376 Rendering-intent Property / 377 Color-profile Property / 378 Color-profile / 379 XII Color Keywords / 379 Background Properties / 386 Background-color Property / 387 Background-image Property / 391 Background-repeat Property / 394 Background-attachment Property / 397 Background-position Property / 401 Background Property / 407 Background-position-x and background-position-y Properties / 410 CSS3 Properties / 415 Background-clip Property / 415 Background-origin / 416 Background-size / 418 Background-quantity / 419 Background-spacing / 420 Classification Properties and Generated/Automatic Content / 422 White-space Property / 423 List-style-type Property / 426 List-style-image Property / 435 List-style-position Property / 437 List-style Property / 440 The content Property plus the before and after Pseudo-Elements / 443 Quotes Property / 446 Counter-increment and counter-reset Properties / 449 Marker-offset Property / 452 Visual Formatting and Detailed Visual Formatting / 456 Display Property / 457 Positioning Properties: position, top, left, right and bottom / 465 Z-index Property / 473 Direction and unicode-bidi Properties / 476 Min-width, max-width, min-height and max-height Properties / 479 Visual Effects / 486 Overflow Property / 487 Overflow-x and overflow-y Properties / 490 Clip Property / 492 Visibility Property / 495 Zoom Property / 500 Ime-mode Property / 503 Paged Media / 506 Size Property / 507 Marks Property / 510 Page-Break Properties / 512 Page Property / 515 Windows and orphans Properties / 517 Tables / 520 Caption-side Property / 521 Table-layout Property / 524 Border-collapse, border-spacing and empty-cells / 527 Speak-header Property / 536 Table-like Layout Using CSS / 537 User Interface / 542 Cursor Property / 544 Outline Sub-Family of Properties / 549 Outline-width Property / 550 Outline-style Property / 553 Outline-color Property / 554 Outline Property / 556 Accelerator Property / 557 CSS3 Properties / 559 Resizer Property / 559 Key-equivalent Property / 560 Tab-index Property / 561 User-input Property / 562 User-modify Property / 562 User-select Property / 563 User-focus, user-focus-key and user-focus-pointer Properties / 564 Toggle-group and group-reset Properties / 564 Mozilla User-Interface-Related Extensions / 565 CSS3 Additions to Existing User-Interface Properties / 567 Aural Cascading Style Sheets / 568 Speak Property / 570 Volume Property / 571 Pause Sub-Set of Properties / 573 Cue Sub-Set of Properties / 576 Play-during Property / 577 zimuth Property / 579 Elevation Property / 582 Speech-rate Property / 584 Voice-family Property / 586 Pitch Property / 587 Pitch-range Property / 589 Stress Property / 590 Richness Property / 591 Speech Sub-Group of Properties / 592 Ruby / 596 What Is Ruby? / 597 The <ruby> Tag Set / 598 Ruby-align Property / 602 Ruby-overhang Property / 605 Ruby-position Property / 608 Multi-Column Layout / 612 Introduction / 613 Column-count Property / 616 Column-width Property / 616 Column-gap Property / 617 Column-width-policy Property / 617 Column-space-distribution Property / 618 Column Rule Properties / 620 Column-span Property / 622 Scrollbars / 624 The Parts of a Scrollbar / 625 Scrollbar Properties / 626 Browser Compatibility / 634 Filters and Transitions / 636 Visual Filters in Internet Explorer / 637 Static Filters / 638 Transition Filter Overview / 672 CSS1 and CSS2 Compatibility Charts / 692 Alphabetical Listing of CSS Properties and Values / 706 Accelerator / 707 Azimuth / 708 Background / 709 Background-attachment / 710

rawTOC:
Acknowledgments / xxix \\ Preface / xxxi \\ Who You Are / xxxii \\ How This Book Is Organized / xxxiii \\ Conventions Used in This Book / xxxv \\ Further Information / xxxv \\ Additional Material / xxxvi \\ Feedback / xxxvii \\ The Birth of CSS / 2 \\ The World Wide Web Consortium Introduces Cascading Style Sheets / 5 \\ XHTML, CSS2 and CSS3 / 7 \\ Re-emergence of the Browser Wars? / 10 \\ (X)Html and Its Relationship to CSS / 14 \\ Adding Cascading Style Sheets to Web Pages / 17 \\ The <style> Element / 18 \\ The <span> and <div> Elements / 21 \\ The <link> Element / 24 \\ Browser Adoption of CSS / 28 \\ Internet Explorer 3.x / 30 \\ Internet Explorer 4.x / 31 \\ Internet Explorer 4.5 (Macintosh) and 5.x (Windows and Macintosh) / 32 \\ Internet Explorer 5.5 / 34 \\ Internet Explorer 6.0 / 35 \\ Opera 3.5 / 37 \\ Opera 4.x--6.x / 38 \\ Netscape Navigator 4.x / 39 \\ Mozilla and Netscape Navigator 6.x and 7.x / 40 \\ Other Browsers / 47 \\ Implementation of Basic CSS Concepts / 52 \\ Grouping / 53 \\ Inheritance / 56 \\ Class and id as Selectors / 58 \\ Contextual Selectors / 62 \\ Comments / 66 \\ CSS2 Selectors / 67 \\ CSS3 Selectors / 76 \\ The Cascade / 82 \\ Cascading Order / 83 \\ Important / 88 \\ Cascade-Order Sources / 90 \\ CSS Units / 94 \\ Length Units / 95 \\ Percentage Units / 101 \\ URLs / 103 \\ Strings / 106 \\ Time Units / 108 \\ Angle Units / 108 \\ Frequency Units / 110 \\ Pseudo-Classes and Pseudo-Elements / 112 \\ Anchor Pseudo-Element / 114 \\ First-line Pseudo-Element / 117 \\ First-letter Pseudo-Element / 119 \\ Lang Pseudo-Class / 122 \\ Left, right and first Pseudo-Classes / 123 \\ Focus and hover Pseudo-Classes / 123 \\ First-child Pseudo-Class / 125 \\ Pseudo-Elements in Selectors and Combining Multiple Pseudo-Elements / 128 \\ Media Types and Media Queries / 130 \\ Browser Compatibility / 134 \\ Media Queries / 135 \\ Width and height Media Queries / 136 \\ Device-width and device-height Media Queries / 136 \\ Device-aspect-ratio Media Query / 137 \\ Color Media Query / 137 \\ Color-index Media Query / 138 \\ Monochrome Media Query / 138 \\ Resolution Media Query / 139 \\ Scan Media Query / 139 \\ Grid Media Query / 140 \\ Font Properties / 142 \\ Font-family Property / 144 \\ Font-size Property / 150 \\ Font-style Property / 158 \\ Font-variant Property / 160 \\ Font-weight Property / 162 \\ Font Property / 167 \\ Font-stretch Property / 170 \\ Font-size-adjust Property / 173 \\ The <at>font-face Pseudo-Element / 175 \\ CSS3 Font Decoration Properties / 182 \\ Text Properties / 186 \\ Letter-spacing Property / 187 \\ Word-spacing Property / 190 \\ Line-height Property / 193 \\ Vertical-align Property / 196 \\ Text-align Property / 198 \\ Text-decoration Property / 201 \\ Text-indent Property / 204 \\ Text-transform Property / 207 \\ Text-shadow Property / 209 \\ Glyph-orientation-horizontal and glyph-orientation-vertical Properties / 211 \\ Text-script Property / 214 \\ Min-font-size and max-font-size Properties / 215 \\ Text-justify-trim Property / 216 \\ Line-break Property / 216 \\ Word-break-cjk Property / 216 \\ Word-break-inside Property / 217 \\ Word-break Property / 217 \\ Wrap-option Property / 218 \\ Linefeed-treatment Property / 219 \\ White-space-treatment Property / 219 \\ All-space-treatment Property / 220 \\ White-space Property / 220 \\ Text-overflow-mode Property / 222 \\ Text-overflow-ellipsis Property / 222 \\ Text-overflow Property / 223 \\ Kerning-mode Property / 223 \\ Kerning-pair-threshold Property / 224 \\ Punctuation-trim Property / 224 \\ Text-line-through Set of Properties / 225 \\ Text-overline Set of Properties / 228 \\ Text-underline Set of Properties / 232 \\ Text-blink Property / 236 \\ Text Property Extensions / 238 \\ Internet Explorer Text-Formatting CSS Extensions / 239 \\ Layout-flow Property / 239 \\ Writing-mode Property / 244 \\ Layout-grid Sub-Family of Properties / 247 \\ Text-autospace Property / 258 \\ Text-justify Property / 261 \\ Text-kashida-space Property / 264 \\ Text-underline-position Property / 266 \\ Word-break Property / 268 \\ Text-align-last Property / 271 \\ Box Properties / 274 \\ Border-`style' Properties / 276 \\ Border-style Property / 277 \\ Border-color Property / 280 \\ Border-width Property / 283 \\ Border-bottom Property / 286 \\ Border-left Property / 289 \\ Border-right Property / 292 \\ Border-top Property / 294 \\ Border-bottom-width Property / 297 \\ Border-left-width Property / 299 \\ Border-right-width Property / 302 \\ Border-top-width Property / 304 \\ Border Property / 307 \\ Border-radius Set of Properties / 310 \\ Border-image Set of Properties / 312 \\ Border-fit Set of Properties / 314 \\ Border-image-transform Set of Properties / 317 \\ Border-break Property / 319 \\ Box-shadow Property / 319 \\ Clear Property / 321 \\ Clear-after Property / 324 \\ Float Property / 325 \\ Float-displace Property / 331 \\ Indent-edge-reset Property / 332 \\ Height Property / 332 \\ Width Property / 335 \\ Padding-bottom Property / 337 \\ Padding-left Property / 339 \\ Padding-right Property / 341 \\ Padding-top Property / 343 \\ Padding Property / 345 \\ Margin-bottom Property / 349 \\ Margin-left Property / 352 \\ Margin-right Property / 354 \\ Margin-top Property / 357 \\ Margin Property / 360 \\ Min-width, max-width, min-height and max-height Properties / 362 \\ Fit and fit-position Properties / 363 \\ Marquee Properties / 365 \\ Color / 368 \\ Color Property / 370 \\ Gamma Correction under CSS3 / 375 \\ Opacity Property / 376 \\ Rendering-intent Property / 377 \\ Color-profile Property / 378 \\ Color-profile / 379 \\ XII Color Keywords / 379 \\ Background Properties / 386 \\ Background-color Property / 387 \\ Background-image Property / 391 \\ Background-repeat Property / 394 \\ Background-attachment Property / 397 \\ Background-position Property / 401 \\ Background Property / 407 \\ Background-position-x and background-position-y Properties / 410 \\ CSS3 Properties / 415 \\ Background-clip Property / 415 \\ Background-origin / 416 \\ Background-size / 418 \\ Background-quantity / 419 \\ Background-spacing / 420 \\ Classification Properties and Generated/Automatic Content / 422 \\ White-space Property / 423 \\ List-style-type Property / 426 \\ List-style-image Property / 435 \\ List-style-position Property / 437 \\ List-style Property / 440 \\ The content Property plus the before and after Pseudo-Elements / 443 \\ Quotes Property / 446 \\ Counter-increment and counter-reset Properties / 449 \\ Marker-offset Property / 452 \\ Visual Formatting and Detailed Visual Formatting / 456 \\ Display Property / 457 \\ Positioning Properties: position, top, left, right and bottom / 465 \\ Z-index Property / 473 \\ Direction and unicode-bidi Properties / 476 \\ Min-width, max-width, min-height and max-height Properties / 479 \\ Visual Effects / 486 \\ Overflow Property / 487 \\ Overflow-x and overflow-y Properties / 490 \\ Clip Property / 492 \\ Visibility Property / 495 \\ Zoom Property / 500 \\ Ime-mode Property / 503 \\ Paged Media / 506 \\ Size Property / 507 \\ Marks Property / 510 \\ Page-Break Properties / 512 \\ Page Property / 515 \\ Windows and orphans Properties / 517 \\ Tables / 520 \\ Caption-side Property / 521 \\ Table-layout Property / 524 \\ Border-collapse, border-spacing and empty-cells / 527 \\ Speak-header Property / 536 \\ Table-like Layout Using CSS / 537 \\ User Interface / 542 \\ Cursor Property / 544 \\ Outline Sub-Family of Properties / 549 \\ Outline-width Property / 550 \\ Outline-style Property / 553 \\ Outline-color Property / 554 \\ Outline Property / 556 \\ Accelerator Property / 557 \\ CSS3 Properties / 559 \\ Resizer Property / 559 \\ Key-equivalent Property / 560 \\ Tab-index Property / 561 \\ User-input Property / 562 \\ User-modify Property / 562 \\ User-select Property / 563 \\ User-focus, user-focus-key and user-focus-pointer Properties / 564 \\ Toggle-group and group-reset Properties / 564 \\ Mozilla User-Interface-Related Extensions / 565 \\ CSS3 Additions to Existing User-Interface Properties / 567 \\ Aural Cascading Style Sheets / 568 \\ Speak Property / 570 \\ Volume Property / 571 \\ Pause Sub-Set of Properties / 573 \\ Cue Sub-Set of Properties / 576 \\ Play-during Property / 577 \\ zimuth Property / 579 \\ Elevation Property / 582 \\ Speech-rate Property / 584 \\ Voice-family Property / 586 \\ Pitch Property / 587 \\ Pitch-range Property / 589 \\ Stress Property / 590 \\ Richness Property / 591 \\ Speech Sub-Group of Properties / 592 \\ Ruby / 596 \\ What Is Ruby? / 597 \\ The <ruby> Tag Set / 598 \\ Ruby-align Property / 602 \\ Ruby-overhang Property / 605 \\ Ruby-position Property / 608 \\ Multi-Column Layout / 612 \\ Introduction / 613 \\ Column-count Property / 616 \\ Column-width Property / 616 \\ Column-gap Property / 617 \\ Column-width-policy Property / 617 \\ Column-space-distribution Property / 618 \\ Column Rule Properties / 620 \\ Column-span Property / 622 \\ Scrollbars / 624 \\ The Parts of a Scrollbar / 625 \\ Scrollbar Properties / 626 \\ Browser Compatibility / 634 \\ Filters and Transitions / 636 \\ Visual Filters in Internet Explorer / 637 \\ Static Filters / 638 \\ Transition Filter Overview / 672 \\ CSS1 and CSS2 Compatibility Charts / 692 \\ Alphabetical Listing of CSS Properties and Values / 706 \\ Accelerator / 707 \\ Azimuth / 708 \\ Background / 709 \\ Background-attachment / 710

entry:
@Book{Schengili-Roberts:2000:CC,
  author =       "Keith Schengili-Roberts",
  title =        "Core {CSS}",
  publisher =    pub-PHPTR,
  address =      pub-PHPTR:adr,
  pages =        "xxxvii + 635 + 4",
  year =         "2000",
  ISBN =         "0-13-083456-4 (paperback)",
  ISBN-13 =      "978-0-13-083456-0 (paperback)",
  LCCN =         "TK5105.888. S32 2000",
  bibdate =      "Mon Oct 26 18:00:35 MDT 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/sgml2000.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Prentice Hall PTR core series",
  acknowledgement = ack-nhfb,
  subject =      "Cascading Style Sheets; Web sites; design; computer
                 graphics; Web publishing",
  tableofcontents = "Acknowledgments / xxix \\
                 Preface / xxxi \\
                 Who You Are / xxxii \\
                 How This Book Is Organized / xxxiii \\
                 Conventions Used in This Book / xxxv \\
                 Further Information / xxxv \\
                 Additional Material / xxxvi \\
                 Feedback / xxxvii \\
                 The Birth of CSS / 2 \\
                 The World Wide Web Consortium Introduces Cascading
                 Style Sheets / 5 \\
                 XHTML, CSS2 and CSS3 / 7 \\
                 Re-emergence of the Browser Wars? / 10 \\
                 (X)Html and Its Relationship to CSS / 14 \\
                 Adding Cascading Style Sheets to Web Pages / 17 \\
                 The <style> Element / 18 \\
                 The <span> and <div> Elements / 21 \\
                 The <link> Element / 24 \\
                 Browser Adoption of CSS / 28 \\
                 Internet Explorer 3.x / 30 \\
                 Internet Explorer 4.x / 31 \\
                 Internet Explorer 4.5 (Macintosh) and 5.x (Windows and
                 Macintosh) / 32 \\
                 Internet Explorer 5.5 / 34 \\
                 Internet Explorer 6.0 / 35 \\
                 Opera 3.5 / 37 \\
                 Opera 4.x--6.x / 38 \\
                 Netscape Navigator 4.x / 39 \\
                 Mozilla and Netscape Navigator 6.x and 7.x / 40 \\
                 Other Browsers / 47 \\
                 Implementation of Basic CSS Concepts / 52 \\
                 Grouping / 53 \\
                 Inheritance / 56 \\
                 Class and id as Selectors / 58 \\
                 Contextual Selectors / 62 \\
                 Comments / 66 \\
                 CSS2 Selectors / 67 \\
                 CSS3 Selectors / 76 \\
                 The Cascade / 82 \\
                 Cascading Order / 83 \\
                 Important / 88 \\
                 Cascade-Order Sources / 90 \\
                 CSS Units / 94 \\
                 Length Units / 95 \\
                 Percentage Units / 101 \\
                 URLs / 103 \\
                 Strings / 106 \\
                 Time Units / 108 \\
                 Angle Units / 108 \\
                 Frequency Units / 110 \\
                 Pseudo-Classes and Pseudo-Elements / 112 \\
                 Anchor Pseudo-Element / 114 \\
                 First-line Pseudo-Element / 117 \\
                 First-letter Pseudo-Element / 119 \\
                 Lang Pseudo-Class / 122 \\
                 Left, right and first Pseudo-Classes / 123 \\
                 Focus and hover Pseudo-Classes / 123 \\
                 First-child Pseudo-Class / 125 \\
                 Pseudo-Elements in Selectors and Combining Multiple
                 Pseudo-Elements / 128 \\
                 Media Types and Media Queries / 130 \\
                 Browser Compatibility / 134 \\
                 Media Queries / 135 \\
                 Width and height Media Queries / 136 \\
                 Device-width and device-height Media Queries / 136 \\
                 Device-aspect-ratio Media Query / 137 \\
                 Color Media Query / 137 \\
                 Color-index Media Query / 138 \\
                 Monochrome Media Query / 138 \\
                 Resolution Media Query / 139 \\
                 Scan Media Query / 139 \\
                 Grid Media Query / 140 \\
                 Font Properties / 142 \\
                 Font-family Property / 144 \\
                 Font-size Property / 150 \\
                 Font-style Property / 158 \\
                 Font-variant Property / 160 \\
                 Font-weight Property / 162 \\
                 Font Property / 167 \\
                 Font-stretch Property / 170 \\
                 Font-size-adjust Property / 173 \\
                 The <at>font-face Pseudo-Element / 175 \\
                 CSS3 Font Decoration Properties / 182 \\
                 Text Properties / 186 \\
                 Letter-spacing Property / 187 \\
                 Word-spacing Property / 190 \\
                 Line-height Property / 193 \\
                 Vertical-align Property / 196 \\
                 Text-align Property / 198 \\
                 Text-decoration Property / 201 \\
                 Text-indent Property / 204 \\
                 Text-transform Property / 207 \\
                 Text-shadow Property / 209 \\
                 Glyph-orientation-horizontal and
                 glyph-orientation-vertical Properties / 211 \\
                 Text-script Property / 214 \\
                 Min-font-size and max-font-size Properties / 215 \\
                 Text-justify-trim Property / 216 \\
                 Line-break Property / 216 \\
                 Word-break-cjk Property / 216 \\
                 Word-break-inside Property / 217 \\
                 Word-break Property / 217 \\
                 Wrap-option Property / 218 \\
                 Linefeed-treatment Property / 219 \\
                 White-space-treatment Property / 219 \\
                 All-space-treatment Property / 220 \\
                 White-space Property / 220 \\
                 Text-overflow-mode Property / 222 \\
                 Text-overflow-ellipsis Property / 222 \\
                 Text-overflow Property / 223 \\
                 Kerning-mode Property / 223 \\
                 Kerning-pair-threshold Property / 224 \\
                 Punctuation-trim Property / 224 \\
                 Text-line-through Set of Properties / 225 \\
                 Text-overline Set of Properties / 228 \\
                 Text-underline Set of Properties / 232 \\
                 Text-blink Property / 236 \\
                 Text Property Extensions / 238 \\
                 Internet Explorer Text-Formatting CSS Extensions / 239
                 \\
                 Layout-flow Property / 239 \\
                 Writing-mode Property / 244 \\
                 Layout-grid Sub-Family of Properties / 247 \\
                 Text-autospace Property / 258 \\
                 Text-justify Property / 261 \\
                 Text-kashida-space Property / 264 \\
                 Text-underline-position Property / 266 \\
                 Word-break Property / 268 \\
                 Text-align-last Property / 271 \\
                 Box Properties / 274 \\
                 Border-`style' Properties / 276 \\
                 Border-style Property / 277 \\
                 Border-color Property / 280 \\
                 Border-width Property / 283 \\
                 Border-bottom Property / 286 \\
                 Border-left Property / 289 \\
                 Border-right Property / 292 \\
                 Border-top Property / 294 \\
                 Border-bottom-width Property / 297 \\
                 Border-left-width Property / 299 \\
                 Border-right-width Property / 302 \\
                 Border-top-width Property / 304 \\
                 Border Property / 307 \\
                 Border-radius Set of Properties / 310 \\
                 Border-image Set of Properties / 312 \\
                 Border-fit Set of Properties / 314 \\
                 Border-image-transform Set of Properties / 317 \\
                 Border-break Property / 319 \\
                 Box-shadow Property / 319 \\
                 Clear Property / 321 \\
                 Clear-after Property / 324 \\
                 Float Property / 325 \\
                 Float-displace Property / 331 \\
                 Indent-edge-reset Property / 332 \\
                 Height Property / 332 \\
                 Width Property / 335 \\
                 Padding-bottom Property / 337 \\
                 Padding-left Property / 339 \\
                 Padding-right Property / 341 \\
                 Padding-top Property / 343 \\
                 Padding Property / 345 \\
                 Margin-bottom Property / 349 \\
                 Margin-left Property / 352 \\
                 Margin-right Property / 354 \\
                 Margin-top Property / 357 \\
                 Margin Property / 360 \\
                 Min-width, max-width, min-height and max-height
                 Properties / 362 \\
                 Fit and fit-position Properties / 363 \\
                 Marquee Properties / 365 \\
                 Color / 368 \\
                 Color Property / 370 \\
                 Gamma Correction under CSS3 / 375 \\
                 Opacity Property / 376 \\
                 Rendering-intent Property / 377 \\
                 Color-profile Property / 378 \\
                 Color-profile / 379 \\
                 XII Color Keywords / 379 \\
                 Background Properties / 386 \\
                 Background-color Property / 387 \\
                 Background-image Property / 391 \\
                 Background-repeat Property / 394 \\
                 Background-attachment Property / 397 \\
                 Background-position Property / 401 \\
                 Background Property / 407 \\
                 Background-position-x and background-position-y
                 Properties / 410 \\
                 CSS3 Properties / 415 \\
                 Background-clip Property / 415 \\
                 Background-origin / 416 \\
                 Background-size / 418 \\
                 Background-quantity / 419 \\
                 Background-spacing / 420 \\
                 Classification Properties and Generated/Automatic
                 Content / 422 \\
                 White-space Property / 423 \\
                 List-style-type Property / 426 \\
                 List-style-image Property / 435 \\
                 List-style-position Property / 437 \\
                 List-style Property / 440 \\
                 The content Property plus the before and after
                 Pseudo-Elements / 443 \\
                 Quotes Property / 446 \\
                 Counter-increment and counter-reset Properties / 449
                 \\
                 Marker-offset Property / 452 \\
                 Visual Formatting and Detailed Visual Formatting / 456
                 \\
                 Display Property / 457 \\
                 Positioning Properties: position, top, left, right and
                 bottom / 465 \\
                 Z-index Property / 473 \\
                 Direction and unicode-bidi Properties / 476 \\
                 Min-width, max-width, min-height and max-height
                 Properties / 479 \\
                 Visual Effects / 486 \\
                 Overflow Property / 487 \\
                 Overflow-x and overflow-y Properties / 490 \\
                 Clip Property / 492 \\
                 Visibility Property / 495 \\
                 Zoom Property / 500 \\
                 Ime-mode Property / 503 \\
                 Paged Media / 506 \\
                 Size Property / 507 \\
                 Marks Property / 510 \\
                 Page-Break Properties / 512 \\
                 Page Property / 515 \\
                 Windows and orphans Properties / 517 \\
                 Tables / 520 \\
                 Caption-side Property / 521 \\
                 Table-layout Property / 524 \\
                 Border-collapse, border-spacing and empty-cells / 527
                 \\
                 Speak-header Property / 536 \\
                 Table-like Layout Using CSS / 537 \\
                 User Interface / 542 \\
                 Cursor Property / 544 \\
                 Outline Sub-Family of Properties / 549 \\
                 Outline-width Property / 550 \\
                 Outline-style Property / 553 \\
                 Outline-color Property / 554 \\
                 Outline Property / 556 \\
                 Accelerator Property / 557 \\
                 CSS3 Properties / 559 \\
                 Resizer Property / 559 \\
                 Key-equivalent Property / 560 \\
                 Tab-index Property / 561 \\
                 User-input Property / 562 \\
                 User-modify Property / 562 \\
                 User-select Property / 563 \\
                 User-focus, user-focus-key and user-focus-pointer
                 Properties / 564 \\
                 Toggle-group and group-reset Properties / 564 \\
                 Mozilla User-Interface-Related Extensions / 565 \\
                 CSS3 Additions to Existing User-Interface Properties /
                 567 \\
                 Aural Cascading Style Sheets / 568 \\
                 Speak Property / 570 \\
                 Volume Property / 571 \\
                 Pause Sub-Set of Properties / 573 \\
                 Cue Sub-Set of Properties / 576 \\
                 Play-during Property / 577 \\
                 zimuth Property / 579 \\
                 Elevation Property / 582 \\
                 Speech-rate Property / 584 \\
                 Voice-family Property / 586 \\
                 Pitch Property / 587 \\
                 Pitch-range Property / 589 \\
                 Stress Property / 590 \\
                 Richness Property / 591 \\
                 Speech Sub-Group of Properties / 592 \\
                 Ruby / 596 \\
                 What Is Ruby? / 597 \\
                 The <ruby> Tag Set / 598 \\
                 Ruby-align Property / 602 \\
                 Ruby-overhang Property / 605 \\
                 Ruby-position Property / 608 \\
                 Multi-Column Layout / 612 \\
                 Introduction / 613 \\
                 Column-count Property / 616 \\
                 Column-width Property / 616 \\
                 Column-gap Property / 617 \\
                 Column-width-policy Property / 617 \\
                 Column-space-distribution Property / 618 \\
                 Column Rule Properties / 620 \\
                 Column-span Property / 622 \\
                 Scrollbars / 624 \\
                 The Parts of a Scrollbar / 625 \\
                 Scrollbar Properties / 626 \\
                 Browser Compatibility / 634 \\
                 Filters and Transitions / 636 \\
                 Visual Filters in Internet Explorer / 637 \\
                 Static Filters / 638 \\
                 Transition Filter Overview / 672 \\
                 CSS1 and CSS2 Compatibility Charts / 692 \\
                 Alphabetical Listing of CSS Properties and Values / 706
                 \\
                 Accelerator / 707 \\
                 Azimuth / 708 \\
                 Background / 709 \\
                 Background-attachment / 710",
}


bibtype: book
filename: master.bib
label: Schewe:2013:MGP
author: Phillip F. Schewe
title: Maverick Genius: the Pioneering Odyssey of Freeman Dyson
publisher: Thomas Dunn Books, St. Martin's Press
address: New York, NY, USA
pages: x + 339
year: 2013
ISBN: 0-312-64235-0 (hardcover), 1-250-02101-4 (e-book) OR 0312642350 (hardcover), 1250021014 (ebook)
LCCN: QC16.D95 S34 2013
bibdate: Mon Aug 19 15:29:10 MDT 2013
bibtimestamp: 2013.08.19 15:29:10 MDT
remark: This is claimed to be the first biography of Freeman Dyson.
acknowledgement: ack-nhfb
rawauthor: Phillip F. Schewe
rawtitle: Maverick Genius: the Pioneering Odyssey of {Freeman Dyson}
ISBN13:
978-0-312-64235-8 (hardcover), 978-1-250-02101-4 (e-book) OR 9780312642358 (hardcover), 9781250021014 (ebook)

bibsource:
https://www.math.utah.edu/pub/bibnet/authors/d/dyson-freeman-j.bib; https://www.math.utah.edu/pub/tex/bib/einstein.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager

abstract:
Freeman Dyson has been influential in many fields over his long and legendary career, including quantum physics, national defense, space, and religion. In this definitive biography, author Phillip F. Schewe examines the life of one of the most innovative thinkers of our time, whose accomplishments include: Designing a nuclear rocket ship, em The Orion, for NASA; Helping write the booktitle Nuclear Test Ban Treaty; Consulting for Stanley Kubrick on the film booktitle 2001: A Space Odyssey; Winning the coveted million dollar booktitle Templeton Prize for Progress in Religion. A colleague of Albert Einstein at Princeton and friends with leading thinkers including Robert Oppenheimer, George F. Kennan, and Richard Feynman, Freeman Dyson is a larger-than-life figure in the world of science, and he has recently made headlines for his controversial views on global warming. Written with the cooperation of Dyson's children, entrepreneur Esther Dyson (an early investor in Flickr, Google, and Orbitz, who has often been called `The First Lady of the Internet') and tech writer George Dyson, this is the first complete biography of the man who changed the way we think about science today.

subject:
Dyson, Freeman J; Physicists; United States; Biography; Mathematicians; Biography and Autobiography / Science and Technology

TOC:
Introduction Killing time: Dyson bombs Berlin (1923--1945) Life is a blur: Dyson as mathematician (1945--1947) Ecumenical councils: Dyson as seminarian (1947--1948) The secret signature of things: Dyson as artist (1948--1949) Recessional: Dyson as professor (1949--1953) Nuclear opera: Dyson and the Cold War (1954--1956) Intrinsically safe: Dyson as engineer (1956--1957) Space traveler's manifesto: Dyson as rocketeer (1957--1959) Civilized behavior: Dyson searches for extraterrestrial intelligence (early 1960s) Nuclear manifesto: Dyson as diplomat (early 1960s) On the Oregon Trail: Dyson as Pentagon consultant (1960s--1970s) Success in life: Dyson as astronomer (mid 1960s to mid 1970s) Science and sublime: Dyson as essayist (1976--1985) Nuclear slavery: Dyson as abolitionist (1980s) The arc of life: Dyson as biologist (1980s and 1990s) God and man at Princeton: Dyson as preacher (1985--2000) Splintering the species: Dyson as heretic (1990--2010) Long-term thinking: Dyson as storyteller (recent years)

rawabstract:
Freeman Dyson has been influential in many fields over his long and legendary career, including quantum physics, national defense, space, and religion. In this definitive biography, author Phillip F. Schewe examines the life of one of the most innovative thinkers of our time, whose accomplishments include: Designing a nuclear rocket ship, {\em The Orion}, for NASA; Helping write the \booktitle{Nuclear Test Ban Treaty}; Consulting for Stanley Kubrick on the film \booktitle{2001: A Space Odyssey}; Winning the coveted million dollar \booktitle{Templeton Prize for Progress in Religion}. A colleague of Albert Einstein at Princeton and friends with leading thinkers including Robert Oppenheimer, George F. Kennan, and Richard Feynman, Freeman Dyson is a larger-than-life figure in the world of science, and he has recently made headlines for his controversial views on global warming. Written with the cooperation of Dyson's children, entrepreneur Esther Dyson (an early investor in Flickr, Google, and Orbitz, who has often been called `The First Lady of the Internet') and tech writer George Dyson, this is the first complete biography of the man who changed the way we think about science today.

rawTOC:
Introduction \\ Killing time: Dyson bombs Berlin (1923--1945) \\ Life is a blur: Dyson as mathematician (1945--1947) \\ Ecumenical councils: Dyson as seminarian (1947--1948) \\ The secret signature of things: Dyson as artist (1948--1949) \\ Recessional: Dyson as professor (1949--1953) \\ Nuclear opera: Dyson and the Cold War (1954--1956) \\ Intrinsically safe: Dyson as engineer (1956--1957) \\ Space traveler's manifesto: Dyson as rocketeer (1957--1959) \\ Civilized behavior: Dyson searches for extraterrestrial intelligence (early 1960s) \\ Nuclear manifesto: Dyson as diplomat (early 1960s) \\ On the Oregon Trail: Dyson as Pentagon consultant (1960s--1970s) \\ Success in life: Dyson as astronomer (mid 1960s to mid 1970s) \\ Science and sublime: Dyson as essayist (1976--1985) \\ Nuclear slavery: Dyson as abolitionist (1980s) \\ The arc of life: Dyson as biologist (1980s and 1990s) \\ God and man at Princeton: Dyson as preacher (1985--2000) \\ Splintering the species: Dyson as heretic (1990--2010) \\ Long-term thinking: Dyson as storyteller (recent years)

entry:
@Book{Schewe:2013:MGP,
  author =       "Phillip F. Schewe",
  title =        "Maverick Genius: the Pioneering Odyssey of {Freeman
                 Dyson}",
  publisher =    "Thomas Dunn Books, St. Martin's Press",
  address =      "New York, NY, USA",
  pages =        "x + 339",
  year =         "2013",
  ISBN =         "0-312-64235-0 (hardcover), 1-250-02101-4 (e-book)",
  ISBN-13 =      "978-0-312-64235-8 (hardcover), 978-1-250-02101-4
                 (e-book)",
  LCCN =         "QC16.D95 S34 2013",
  bibdate =      "Mon Aug 19 15:29:10 MDT 2013",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/d/dyson-freeman-j.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "Freeman Dyson has been influential in many fields over
                 his long and legendary career, including quantum
                 physics, national defense, space, and religion. In this
                 definitive biography, author Phillip F. Schewe examines
                 the life of one of the most innovative thinkers of our
                 time, whose accomplishments include: Designing a
                 nuclear rocket ship, {\em The Orion}, for NASA; Helping
                 write the \booktitle{Nuclear Test Ban Treaty};
                 Consulting for Stanley Kubrick on the film
                 \booktitle{2001: A Space Odyssey}; Winning the coveted
                 million dollar \booktitle{Templeton Prize for Progress
                 in Religion}. A colleague of Albert Einstein at
                 Princeton and friends with leading thinkers including
                 Robert Oppenheimer, George F. Kennan, and Richard
                 Feynman, Freeman Dyson is a larger-than-life figure in
                 the world of science, and he has recently made
                 headlines for his controversial views on global
                 warming. Written with the cooperation of Dyson's
                 children, entrepreneur Esther Dyson (an early investor
                 in Flickr, Google, and Orbitz, who has often been
                 called `The First Lady of the Internet') and tech
                 writer George Dyson, this is the first complete
                 biography of the man who changed the way we think about
                 science today.",
  acknowledgement = ack-nhfb,
  remark =       "This is claimed to be the first biography of Freeman
                 Dyson.",
  subject =      "Dyson, Freeman J; Physicists; United States;
                 Biography; Mathematicians; Biography and Autobiography
                 / Science and Technology",
  tableofcontents = "Introduction \\
                 Killing time: Dyson bombs Berlin (1923--1945) \\
                 Life is a blur: Dyson as mathematician (1945--1947) \\
                 Ecumenical councils: Dyson as seminarian (1947--1948)
                 \\
                 The secret signature of things: Dyson as artist
                 (1948--1949) \\
                 Recessional: Dyson as professor (1949--1953) \\
                 Nuclear opera: Dyson and the Cold War (1954--1956) \\
                 Intrinsically safe: Dyson as engineer (1956--1957) \\
                 Space traveler's manifesto: Dyson as rocketeer
                 (1957--1959) \\
                 Civilized behavior: Dyson searches for extraterrestrial
                 intelligence (early 1960s) \\
                 Nuclear manifesto: Dyson as diplomat (early 1960s) \\
                 On the Oregon Trail: Dyson as Pentagon consultant
                 (1960s--1970s) \\
                 Success in life: Dyson as astronomer (mid 1960s to mid
                 1970s) \\
                 Science and sublime: Dyson as essayist (1976--1985) \\
                 Nuclear slavery: Dyson as abolitionist (1980s) \\
                 The arc of life: Dyson as biologist (1980s and 1990s)
                 \\
                 God and man at Princeton: Dyson as preacher
                 (1985--2000) \\
                 Splintering the species: Dyson as heretic (1990--2010)
                 \\
                 Long-term thinking: Dyson as storyteller (recent
                 years)",
}


bibtype: book
filename: master.bib
label: Schildt:1990:AAC
author: Herbert Schildt
title: The Annotated ANSI C Standard: American National Standard for Programming Languages: C
publisher: pub-OSBORNE-MCGRAW-HILL
address: pub-OSBORNE-MCGRAW-HILL:adr
pages: xvi + 219
year: 1990
ISBN: 0-07-881952-0 OR 0078819520
ISBN13: 978-0-07-881952-0 OR 9780078819520
LCCN: QA76.73.C15S356 1990
bibdate: Mon Dec 27 09:38:20 1993
bibtimestamp: 1993.12.27 09:38:20 ???
acknowledgement: ack-nhfb
rawauthor: Herbert Schildt
rawtitle: The Annotated {ANSI C} Standard: {American National Standard for Programming Languages: C}
bibsource:
https://www.math.utah.edu/pub/tex/bib/ansistd.bib; https://www.math.utah.edu/pub/tex/bib/cccuj.bib; https://www.math.utah.edu/pub/tex/bib/isostd.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/standard.bib

keywords:
C (Computer program language); Programming languages; Programming languages (Electronic computers) --- Standards; Standards.

remark:
Contains the full text of the ANSI/ISO Standard for the C programming language, which is commonly called the ANSI C Standard. ldots To make the text of the standard more generally accessible and easier to understand, I have provided explanations, comments, and examples on the pages that face the pages of the standard.

TOC:
Acknowledgments Introduction Scope / 1 Normative references / 1 Definitions and conventions / 2 Compliance / 3 Environment / 5 Language / 18 Library / 96 Annex A: Bibliography / 177 Annex B: Language syntax summary / 178 Annex C: Sequence points / 189 Annex D: Library summary / 190 Annex E: Implementation limits / 196 Annex F: Common warnings / 198 Annex G: Portability issues / 199 Index / 210

rawTOC:
Acknowledgments \\ Introduction \\ Scope / 1 \\ Normative references / 1 \\ Definitions and conventions / 2 \\ Compliance / 3 \\ Environment / 5 \\ Language / 18 \\ Library / 96 \\ Annex A: Bibliography / 177 \\ Annex B: Language syntax summary / 178 \\ Annex C: Sequence points / 189 \\ Annex D: Library summary / 190 \\ Annex E: Implementation limits / 196 \\ Annex F: Common warnings / 198 \\ Annex G: Portability issues / 199 \\ Index / 210

entry:
@Book{Schildt:1990:AAC,
  author =       "Herbert Schildt",
  title =        "The Annotated {ANSI C} Standard: {American National
                 Standard for Programming Languages: C}",
  publisher =    pub-OSBORNE-MCGRAW-HILL,
  address =      pub-OSBORNE-MCGRAW-HILL:adr,
  pages =        "xvi + 219",
  year =         "1990",
  ISBN =         "0-07-881952-0",
  ISBN-13 =      "978-0-07-881952-0",
  LCCN =         "QA76.73.C15S356 1990",
  bibdate =      "Mon Dec 27 09:38:20 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ansistd.bib;
                 https://www.math.utah.edu/pub/tex/bib/cccuj.bib;
                 https://www.math.utah.edu/pub/tex/bib/isostd.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/standard.bib",
  price =        "US\$39.95",
  acknowledgement = ack-nhfb,
  keywords =     "C (Computer program language); Programming languages;
                 Programming languages (Electronic computers) ---
                 Standards; Standards.",
  remark =       "Contains the full text of the ANSI/ISO Standard for
                 the C programming language, which is commonly called
                 the ANSI C Standard. \ldots{} To make the text of the
                 standard more generally accessible and easier to
                 understand, I have provided explanations, comments, and
                 examples on the pages that face the pages of the
                 standard.",
  tableofcontents = "Acknowledgments \\
                 Introduction \\
                 Scope / 1 \\
                 Normative references / 1 \\
                 Definitions and conventions / 2 \\
                 Compliance / 3 \\
                 Environment / 5 \\
                 Language / 18 \\
                 Library / 96 \\
                 Annex A: Bibliography / 177 \\
                 Annex B: Language syntax summary / 178 \\
                 Annex C: Sequence points / 189 \\
                 Annex D: Library summary / 190 \\
                 Annex E: Implementation limits / 196 \\
                 Annex F: Common warnings / 198 \\
                 Annex G: Portability issues / 199 \\
                 Index / 210",
}


bibtype: book
filename: master.bib
label: Schneier:1994:ACP
author: Bruce Schneier
title: Applied Cryptography: Protocols, Algorithms, and Source Code in C
publisher: pub-WILEY
address: pub-WILEY:adr
pages: xviii + 618
year: 1994
ISBN: 0-471-59756-2 (paperback) OR 0471597562 (paperback)
ISBN13: 978-0-471-59756-8 (paperback) OR 9780471597568 (paperback)
LCCN: QA76.9.A25S35 1993
bibdate: Sun Dec 04 13:11:37 1994
bibtimestamp: 1994.12.04 13:11:37 ???
acknowledgement: ack-nhfb
rawauthor: Bruce Schneier
rawtitle: Applied Cryptography: Protocols, Algorithms, and Source Code in {C}
bibsource:
https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

abstract:
The explosive growth of public and private computer networks has resulted in a tremendous increase in the volume of sensitive and valuable data that is routinely stored and transmitted digitally. From computer messages speeding through global networks to vast sums of money transferred electronically, the greatest challenge in this new `digital world' is keeping this information out of the hands of unauthorized users who prey on vulnerable computer systems. In booktitle Applied Cryptography, data security expert Bruce Schneier details how programmers can use cryptography --- the technique of enciphering and deciphering messages --- to maintain the privacy of computer data. Covering the latest developments in practical cryptographic techniques, the book shows programmers who design computer applications, networks, and storage systems how security can be built into the computer software and systems we use every day. Along with more than 100 pages of actual C source code of working cryptographic algorithms, this practical handbook explains data encryption protocols and techniques currently in use and likely to be used in the future; offers numerous present-day applications from secure correspondence to anonymous messaging; includes numerous source code fragments and shows how to incorporate them into larger programs; and discusses related issues like patents, export law, and legal rulings.

TOC:
Foreword / Whitfield Diffie 1. Foundations Part 1. Cryptographic Protocols 2. Protocol Building Blocks 3. Basic Protocols 4. Intermediate Protocols 5. Advanced Protocols 6. Esoteric Protocols Part 2. Cryptographic Techniques 7. Keys 8. Using Algorithms Part 3. Cryptographic Algorithms 9. Mathematical Background 10. Data Encryption Standard (DES) 11. Other Block Algorithms 12. Public-Key Algorithms 13. More Public-Key Algorithms 14. One-Way Hash Functions 15. Random Sequence Generators and Stream Ciphers 16. Special Algorithms for Protocols Part 4. The Real World 17. Example Implementations 18. Politics Part 5. Source Code VIGENERE, BEAUFORD, VARIANT BEAUFORD ENIGMA DES LUCIFER NEWDES FEAL-8 FEAL-NX REDOC III LOKI 91 IDEA N-HASH MD5 SECURE HASH ALGORITHM SECRET SHARING

rawabstract:
The explosive growth of public and private computer networks has resulted in a tremendous increase in the volume of sensitive and valuable data that is routinely stored and transmitted digitally. From computer messages speeding through global networks to vast sums of money transferred electronically, the greatest challenge in this new `digital world' is keeping this information out of the hands of unauthorized users who prey on vulnerable computer systems. In \booktitle{Applied Cryptography}, data security expert Bruce Schneier details how programmers can use cryptography --- the technique of enciphering and deciphering messages --- to maintain the privacy of computer data. Covering the latest developments in practical cryptographic techniques, the book shows programmers who design computer applications, networks, and storage systems how security can be built into the computer software and systems we use every day. Along with more than 100 pages of actual C source code of working cryptographic algorithms, this practical handbook explains data encryption protocols and techniques currently in use and likely to be used in the future; offers numerous present-day applications from secure correspondence to anonymous messaging; includes numerous source code fragments and shows how to incorporate them into larger programs; and discusses related issues like patents, export law, and legal rulings.

rawTOC:
Foreword / Whitfield Diffie \\ 1. Foundations \\ Part 1. Cryptographic Protocols \\ 2. Protocol Building Blocks \\ 3. Basic Protocols \\ 4. Intermediate Protocols \\ 5. Advanced Protocols \\ 6. Esoteric Protocols \\ Part 2. Cryptographic Techniques \\ 7. Keys \\ 8. Using Algorithms \\ Part 3. Cryptographic Algorithms \\ 9. Mathematical Background \\ 10. Data Encryption Standard (DES) \\ 11. Other Block Algorithms \\ 12. Public-Key Algorithms \\ 13. More Public-Key Algorithms \\ 14. One-Way Hash Functions \\ 15. Random Sequence Generators and Stream Ciphers \\ 16. Special Algorithms for Protocols \\ Part 4. The Real World \\ 17. Example Implementations \\ 18. Politics \\ Part 5. Source Code \\ VIGENERE, BEAUFORD, VARIANT BEAUFORD \\ ENIGMA \\ DES \\ LUCIFER \\ NEWDES \\ FEAL-8 \\ FEAL-NX \\ REDOC III \\ LOKI 91 \\ IDEA \\ N-HASH \\ MD5 \\ SECURE HASH ALGORITHM \\ SECRET SHARING

entry:
@Book{Schneier:1994:ACP,
  author =       "Bruce Schneier",
  title =        "Applied Cryptography: Protocols, Algorithms, and
                 Source Code in {C}",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xviii + 618",
  year =         "1994",
  ISBN =         "0-471-59756-2 (paperback)",
  ISBN-13 =      "978-0-471-59756-8 (paperback)",
  LCCN =         "QA76.9.A25S35 1993",
  bibdate =      "Sun Dec 04 13:11:37 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$44.95",
  abstract =     "The explosive growth of public and private computer
                 networks has resulted in a tremendous increase in the
                 volume of sensitive and valuable data that is routinely
                 stored and transmitted digitally. From computer
                 messages speeding through global networks to vast sums
                 of money transferred electronically, the greatest
                 challenge in this new `digital world' is keeping this
                 information out of the hands of unauthorized users who
                 prey on vulnerable computer systems. In
                 \booktitle{Applied Cryptography}, data security expert
                 Bruce Schneier details how programmers can use
                 cryptography --- the technique of enciphering and
                 deciphering messages --- to maintain the privacy of
                 computer data. Covering the latest developments in
                 practical cryptographic techniques, the book shows
                 programmers who design computer applications, networks,
                 and storage systems how security can be built into the
                 computer software and systems we use every day. Along
                 with more than 100 pages of actual C source code of
                 working cryptographic algorithms, this practical
                 handbook explains data encryption protocols and
                 techniques currently in use and likely to be used in
                 the future; offers numerous present-day applications
                 from secure correspondence to anonymous messaging;
                 includes numerous source code fragments and shows how
                 to incorporate them into larger programs; and discusses
                 related issues like patents, export law, and legal
                 rulings.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Foreword / Whitfield Diffie \\
                 1. Foundations \\
                 Part 1. Cryptographic Protocols \\
                 2. Protocol Building Blocks \\
                 3. Basic Protocols \\
                 4. Intermediate Protocols \\
                 5. Advanced Protocols \\
                 6. Esoteric Protocols \\
                 Part 2. Cryptographic Techniques \\
                 7. Keys \\
                 8. Using Algorithms \\
                 Part 3. Cryptographic Algorithms \\
                 9. Mathematical Background \\
                 10. Data Encryption Standard (DES) \\
                 11. Other Block Algorithms \\
                 12. Public-Key Algorithms \\
                 13. More Public-Key Algorithms \\
                 14. One-Way Hash Functions \\
                 15. Random Sequence Generators and Stream Ciphers \\
                 16. Special Algorithms for Protocols \\
                 Part 4. The Real World \\
                 17. Example Implementations \\
                 18. Politics \\
                 Part 5. Source Code \\
                 VIGENERE, BEAUFORD, VARIANT BEAUFORD \\
                 ENIGMA \\
                 DES \\
                 LUCIFER \\
                 NEWDES \\
                 FEAL-8 \\
                 FEAL-NX \\
                 REDOC III \\
                 LOKI 91 \\
                 IDEA \\
                 N-HASH \\
                 MD5 \\
                 SECURE HASH ALGORITHM \\
                 SECRET SHARING",
}


bibtype: book
filename: master.bib
label: Schneier:1996:ACP
author: Bruce Schneier
title: Applied Cryptography: Protocols, Algorithms, and Source Code in C
publisher: pub-WILEY
address: pub-WILEY:adr
edition: Second
pages: xxiii + 758
year: 1996
LCCN: QA76.9.A25 S35 1996
MRclass: 94A60, 94-01
bibdate: Tue Oct 20 17:50:50 1998
bibtimestamp: 1998.10.20 17:50:50 ???
acknowledgement: ack-nhfb
rawauthor: Bruce Schneier
rawtitle: Applied Cryptography: Protocols, Algorithms, and Source Code in {C}
ISBN:
0-471-12845-7 (hardcover), 0-471-11709-9 (paperback) OR 0471128457 (hardcover), 0471117099 (paperback)

ISBN13:
978-0-471-12845-8 (hardcover), 978-0-471-11709-4 (paperback) OR 9780471128458 (hardcover), 9780471117094 (paperback)

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

TOC:
Foreword / Whitfield Diffie 1: Foundations 2: Protocol Building Blocks 3: Basic Protocols 4: Intermediate Protocols 5: Advanced Protocols 6: Esoteric Protocols 7: Key Length 8: Key Management 9: Algorithm Types and Modes 10: Using Algorithms 11: Mathematical Background 12: Data Encryption Standard (DES) 13: Other Block Ciphers 14: Still Other Block Ciphers 15: Combining Block Ciphers 16: Pseudo-Random-Sequence Generators and Stream Ciphers 17: Other Stream Ciphers and Real Random-Sequence Generators 18: One-Way Hash Functions 19: Public-Key Algorithms 20: Public-Key Digital Signature Algorithms 21: Identification Schemes 22: Key-Exchange Algorithms 23: Special Algorithms for Protocols 24: Example Implementations 25: Politics Afterword / Matt Blaze

rawTOC:
Foreword / Whitfield Diffie \\ 1: Foundations \\ 2: Protocol Building Blocks \\ 3: Basic Protocols \\ 4: Intermediate Protocols \\ 5: Advanced Protocols \\ 6: Esoteric Protocols \\ 7: Key Length \\ 8: Key Management \\ 9: Algorithm Types and Modes \\ 10: Using Algorithms \\ 11: Mathematical Background \\ 12: Data Encryption Standard (DES) \\ 13: Other Block Ciphers \\ 14: Still Other Block Ciphers \\ 15: Combining Block Ciphers \\ 16: Pseudo-Random-Sequence Generators and Stream Ciphers \\ 17: Other Stream Ciphers and Real Random-Sequence Generators \\ 18: One-Way Hash Functions \\ 19: Public-Key Algorithms \\ 20: Public-Key Digital Signature Algorithms \\ 21: Identification Schemes \\ 22: Key-Exchange Algorithms \\ 23: Special Algorithms for Protocols \\ 24: Example Implementations \\ 25: Politics \\ Afterword / Matt Blaze

entry:
@Book{Schneier:1996:ACP,
  author =       "Bruce Schneier",
  title =        "Applied Cryptography: Protocols, Algorithms, and
                 Source Code in {C}",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  edition =      "Second",
  pages =        "xxiii + 758",
  year =         "1996",
  ISBN =         "0-471-12845-7 (hardcover), 0-471-11709-9 (paperback)",
  ISBN-13 =      "978-0-471-12845-8 (hardcover), 978-0-471-11709-4
                 (paperback)",
  LCCN =         "QA76.9.A25 S35 1996",
  MRclass =      "94A60, 94-01",
  bibdate =      "Tue Oct 20 17:50:50 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Foreword / Whitfield Diffie \\
                 1: Foundations \\
                 2: Protocol Building Blocks \\
                 3: Basic Protocols \\
                 4: Intermediate Protocols \\
                 5: Advanced Protocols \\
                 6: Esoteric Protocols \\
                 7: Key Length \\
                 8: Key Management \\
                 9: Algorithm Types and Modes \\
                 10: Using Algorithms \\
                 11: Mathematical Background \\
                 12: Data Encryption Standard (DES) \\
                 13: Other Block Ciphers \\
                 14: Still Other Block Ciphers \\
                 15: Combining Block Ciphers \\
                 16: Pseudo-Random-Sequence Generators and Stream
                 Ciphers \\
                 17: Other Stream Ciphers and Real Random-Sequence
                 Generators \\
                 18: One-Way Hash Functions \\
                 19: Public-Key Algorithms \\
                 20: Public-Key Digital Signature Algorithms \\
                 21: Identification Schemes \\
                 22: Key-Exchange Algorithms \\
                 23: Special Algorithms for Protocols \\
                 24: Example Implementations \\
                 25: Politics \\
                 Afterword / Matt Blaze",
}


bibtype: book
filename: master.bib
label: Schneier:2000:SLD
author: Bruce Schneier
title: Secrets and Lies: Digital Security in a Networked World
publisher: pub-WILEY
address: pub-WILEY:adr
pages: xv + 412
year: 2000
DOI: https://doi.org/10.1002/9781119183631
ISBN: 0-471-25311-1 OR 0471253111
ISBN13: 978-0-471-25311-2 OR 9780471253112
LCCN: QA76.9.A25 S352 2000
bibdate: Wed Sep 20 16:28:33 2000
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2000.09.20 16:28:33 ???
acknowledgement: ack-nhfb
rawauthor: Bruce Schneier
rawtitle: Secrets and Lies: Digital Security in a Networked World
abstract:
Information security expert Bruce Schneier explains what everyone in business needs to know about security in order to survive and be competitive. Pragmatic, interesting, and humorous, Schneier exposes the digital world and the realities of our networked society. He examines the entire system, from the reasons for technical insecurities to the minds behind malicious attacks. You'll be guided through the security war zone, and learn how to understand and arm yourself against the threats of our connected world. booktitle Secrets and Lies offers the expert guidance you'll need to make the right choices about securing your digital self.

TOC:
1: Introduction Part 1: The landscape 2: Digital threats 3: Attacks 4: Adversaries 5: Security needs Part 2: Technologies 6: Cryptography 7: Cryptography in context 8: Computer security 9: Identification and authentication 10: Networked-computer security 11: Network security 12: Network defenses 13: Software reliability 14: Secure hardware 15: Certificates and credentials 16: Security tricks 17: The human factor Part 3: Strategies 18: Vulnerabilities and the vulnerability landscape 19: Threat modeling and risk assessment 20: Security policies and countermeasures 21: Attack trees 22: Product testing and verification 23: The future of products 24: Security processes 25: Conclusion Afterword Resources Index

rawabstract:
Information security expert Bruce Schneier explains what everyone in business needs to know about security in order to survive and be competitive. Pragmatic, interesting, and humorous, Schneier exposes the digital world and the realities of our networked society. He examines the entire system, from the reasons for technical insecurities to the minds behind malicious attacks. You'll be guided through the security war zone, and learn how to understand and arm yourself against the threats of our connected world. \booktitle{Secrets and Lies} offers the expert guidance you'll need to make the right choices about securing your digital self.

rawTOC:
1: Introduction \\ Part 1: The landscape \\ 2: Digital threats \\ 3: Attacks \\ 4: Adversaries \\ 5: Security needs \\ Part 2: Technologies \\ 6: Cryptography \\ 7: Cryptography in context \\ 8: Computer security \\ 9: Identification and authentication \\ 10: Networked-computer security \\ 11: Network security \\ 12: Network defenses \\ 13: Software reliability \\ 14: Secure hardware \\ 15: Certificates and credentials \\ 16: Security tricks \\ 17: The human factor \\ Part 3: Strategies \\ 18: Vulnerabilities and the vulnerability landscape \\ 19: Threat modeling and risk assessment \\ 20: Security policies and countermeasures \\ 21: Attack trees \\ 22: Product testing and verification \\ 23: The future of products \\ 24: Security processes \\ 25: Conclusion \\ Afterword \\ Resources \\ Index

entry:
@Book{Schneier:2000:SLD,
  author =       "Bruce Schneier",
  title =        "Secrets and Lies: Digital Security in a Networked
                 World",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xv + 412",
  year =         "2000",
  DOI =          "https://doi.org/10.1002/9781119183631",
  ISBN =         "0-471-25311-1",
  ISBN-13 =      "978-0-471-25311-2",
  LCCN =         "QA76.9.A25 S352 2000",
  bibdate =      "Wed Sep 20 16:28:33 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$29.99",
  abstract =     "Information security expert Bruce Schneier explains
                 what everyone in business needs to know about security
                 in order to survive and be competitive. Pragmatic,
                 interesting, and humorous, Schneier exposes the digital
                 world and the realities of our networked society. He
                 examines the entire system, from the reasons for
                 technical insecurities to the minds behind malicious
                 attacks. You'll be guided through the security war
                 zone, and learn how to understand and arm yourself
                 against the threats of our connected world.
                 \booktitle{Secrets and Lies} offers the expert guidance
                 you'll need to make the right choices about securing
                 your digital self.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Introduction \\
                 Part 1: The landscape \\
                 2: Digital threats \\
                 3: Attacks \\
                 4: Adversaries \\
                 5: Security needs \\
                 Part 2: Technologies \\
                 6: Cryptography \\
                 7: Cryptography in context \\
                 8: Computer security \\
                 9: Identification and authentication \\
                 10: Networked-computer security \\
                 11: Network security \\
                 12: Network defenses \\
                 13: Software reliability \\
                 14: Secure hardware \\
                 15: Certificates and credentials \\
                 16: Security tricks \\
                 17: The human factor \\
                 Part 3: Strategies \\
                 18: Vulnerabilities and the vulnerability landscape \\
                 19: Threat modeling and risk assessment \\
                 20: Security policies and countermeasures \\
                 21: Attack trees \\
                 22: Product testing and verification \\
                 23: The future of products \\
                 24: Security processes \\
                 25: Conclusion \\
                 Afterword \\
                 Resources \\
                 Index",
}


bibtype: book
filename: master.bib
label: Schneier:2003:BFT
author: Bruce Schneier
title: Beyond Fear: Thinking Sensibly About Security in an Uncertain World
publisher: Copernicus Books
address: New York, NY, USA
pages: viii + 295
year: 2003
ISBN: 0-387-02620-7 (hardcover), 0-387-21712-6 (e-book) OR 0387026207 (hardcover), 0387217126 (ebook)
LCCN: HV6432 .S36 2003
bibdate: Thu Aug 21 08:38:41 2003
bibtimestamp: 2003.08.21 08:38:41 ???
acknowledgement: ack-nhfb
rawauthor: Bruce Schneier
rawtitle: Beyond Fear: Thinking Sensibly About Security in an Uncertain World
ISBN13:
978-0-387-02620-6 (hardcover), 978-0-387-21712-3 (e-book) OR 9780387026206 (hardcover), 9780387217123 (ebook)

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

abstract:
Many of us, especially since 9/11, have become personally concerned about issues of security, and this is no surprise. Security is near the top of government and corporate agendas around the globe. Security-related stories appear on the front page everyday. How well though, do any of us truly understand what achieving real security involves? In booktitle Beyond Fear, Bruce Schneier invites us to take a critical look at not just the threats to our security, but the ways in which we're encouraged to think about security by law enforcement agencies, businesses of all shapes and sizes, and our national governments and militaries. Schneier believes we all can and should be better security consumers, and that the trade-offs we make in the name of security --- in terms of cash outlays, taxes, inconvenience, and diminished freedoms --- should be part of an ongoing negotiation in our personal, professional, and civic lives, and the subject of an open and informed national discussion. With a well-deserved reputation for original and sometimes iconoclastic thought, Schneier has a lot to say that is provocative, counter-intuitive, and just plain good sense. He explains in detail, for example, why we need to design security systems that don't just work well, but fail well, and why secrecy on the part of government often undermines security. He also believes, for instance, that national ID cards are an exceptionally bad idea: technically unsound, and even destructive of security. And, contrary to a lot of current nay-sayers, he thinks online shopping is fundamentally safe, and that many of the new airline security measure (though by no means all) are actually quite effective. A skeptic of much that's promised by highly touted technologies like biometrics, Schneier is also a refreshingly positive, problem-solving force in the often self-dramatizing and fear-mongering world of security pundits. Schneier helps the reader to understand the issues at stake, and how to best come to one's own conclusions, including the vast infrastructure we already have in place, and the vaster systems--some useful, others useless or worse--that we're being asked to submit to and pay for. Bruce Schneier is the author of seven books, including booktitle Applied Cryptography (which Wired called ``the one book the National Security Agency wanted never to be published'') and booktitle Secrets and Lies (described in Fortune as ``startlingly lively ldots [a] jewel box of little surprises you can actually use.''). He is also Founder and Chief Technology Officer of Counterpane Internet Security, Inc., and publishes Crypto-Gram, one of the most widely read newsletters in the field of online security.

TOC:
1: All security involves trade-offs 2: Security trade-offs are subjective 3: Security trade-offs depend on power and agenda 4: Systems and how they fail 5: Knowing the attackers 6: Attackers never change their tunes, just their instruments 7: Technology creates security imbalances 8: Security is a weakest-link problem 9: Brittleness makes for bad security 10: Security revolves around people 11: Detection works where prevention fails 12: Detection is useless without response 13: Identification, authentication, and authorization 14: All countermeasures have some value 15: Fighting terrorism 16: Negotiating for security 17: Security demystified

rawabstract:
Many of us, especially since 9/11, have become personally concerned about issues of security, and this is no surprise. Security is near the top of government and corporate agendas around the globe. Security-related stories appear on the front page everyday. How well though, do any of us truly understand what achieving real security involves? In \booktitle{Beyond Fear}, Bruce Schneier invites us to take a critical look at not just the threats to our security, but the ways in which we're encouraged to think about security by law enforcement agencies, businesses of all shapes and sizes, and our national governments and militaries. Schneier believes we all can and should be better security consumers, and that the trade-offs we make in the name of security --- in terms of cash outlays, taxes, inconvenience, and diminished freedoms --- should be part of an ongoing negotiation in our personal, professional, and civic lives, and the subject of an open and informed national discussion. With a well-deserved reputation for original and sometimes iconoclastic thought, Schneier has a lot to say that is provocative, counter-intuitive, and just plain good sense. He explains in detail, for example, why we need to design security systems that don't just work well, but fail well, and why secrecy on the part of government often undermines security. He also believes, for instance, that national ID cards are an exceptionally bad idea: technically unsound, and even destructive of security. And, contrary to a lot of current nay-sayers, he thinks online shopping is fundamentally safe, and that many of the new airline security measure (though by no means all) are actually quite effective. A skeptic of much that's promised by highly touted technologies like biometrics, Schneier is also a refreshingly positive, problem-solving force in the often self-dramatizing and fear-mongering world of security pundits. Schneier helps the reader to understand the issues at stake, and how to best come to one's own conclusions, including the vast infrastructure we already have in place, and the vaster systems--some useful, others useless or worse--that we're being asked to submit to and pay for. Bruce Schneier is the author of seven books, including \booktitle{Applied Cryptography} (which Wired called ``the one book the National Security Agency wanted never to be published'') and \booktitle{Secrets and Lies} (described in Fortune as ``startlingly lively \ldots{} [a] jewel box of little surprises you can actually use.''). He is also Founder and Chief Technology Officer of Counterpane Internet Security, Inc., and publishes Crypto-Gram, one of the most widely read newsletters in the field of online security.

rawTOC:
1: All security involves trade-offs \\ 2: Security trade-offs are subjective \\ 3: Security trade-offs depend on power and agenda \\ 4: Systems and how they fail \\ 5: Knowing the attackers \\ 6: Attackers never change their tunes, just their instruments \\ 7: Technology creates security imbalances \\ 8: Security is a weakest-link problem \\ 9: Brittleness makes for bad security \\ 10: Security revolves around people \\ 11: Detection works where prevention fails \\ 12: Detection is useless without response \\ 13: Identification, authentication, and authorization \\ 14: All countermeasures have some value \\ 15: Fighting terrorism \\ 16: Negotiating for security \\ 17: Security demystified

entry:
@Book{Schneier:2003:BFT,
  author =       "Bruce Schneier",
  title =        "Beyond Fear: Thinking Sensibly About Security in an
                 Uncertain World",
  publisher =    "Copernicus Books",
  address =      "New York, NY, USA",
  pages =        "viii + 295",
  year =         "2003",
  ISBN =         "0-387-02620-7 (hardcover), 0-387-21712-6 (e-book)",
  ISBN-13 =      "978-0-387-02620-6 (hardcover), 978-0-387-21712-3
                 (e-book)",
  LCCN =         "HV6432 .S36 2003",
  bibdate =      "Thu Aug 21 08:38:41 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Many of us, especially since 9/11, have become
                 personally concerned about issues of security, and this
                 is no surprise. Security is near the top of government
                 and corporate agendas around the globe.
                 Security-related stories appear on the front page
                 everyday. How well though, do any of us truly
                 understand what achieving real security involves? In
                 \booktitle{Beyond Fear}, Bruce Schneier invites us to
                 take a critical look at not just the threats to our
                 security, but the ways in which we're encouraged to
                 think about security by law enforcement agencies,
                 businesses of all shapes and sizes, and our national
                 governments and militaries. Schneier believes we all
                 can and should be better security consumers, and that
                 the trade-offs we make in the name of security --- in
                 terms of cash outlays, taxes, inconvenience, and
                 diminished freedoms --- should be part of an ongoing
                 negotiation in our personal, professional, and civic
                 lives, and the subject of an open and informed national
                 discussion. With a well-deserved reputation for
                 original and sometimes iconoclastic thought, Schneier
                 has a lot to say that is provocative,
                 counter-intuitive, and just plain good sense. He
                 explains in detail, for example, why we need to design
                 security systems that don't just work well, but fail
                 well, and why secrecy on the part of government often
                 undermines security. He also believes, for instance,
                 that national ID cards are an exceptionally bad idea:
                 technically unsound, and even destructive of security.
                 And, contrary to a lot of current nay-sayers, he thinks
                 online shopping is fundamentally safe, and that many of
                 the new airline security measure (though by no means
                 all) are actually quite effective. A skeptic of much
                 that's promised by highly touted technologies like
                 biometrics, Schneier is also a refreshingly positive,
                 problem-solving force in the often self-dramatizing and
                 fear-mongering world of security pundits. Schneier
                 helps the reader to understand the issues at stake, and
                 how to best come to one's own conclusions, including
                 the vast infrastructure we already have in place, and
                 the vaster systems--some useful, others useless or
                 worse--that we're being asked to submit to and pay for.
                 Bruce Schneier is the author of seven books, including
                 \booktitle{Applied Cryptography} (which Wired called
                 ``the one book the National Security Agency wanted
                 never to be published'') and \booktitle{Secrets and
                 Lies} (described in Fortune as ``startlingly lively
                 \ldots{} [a] jewel box of little surprises you can
                 actually use.''). He is also Founder and Chief
                 Technology Officer of Counterpane Internet Security,
                 Inc., and publishes Crypto-Gram, one of the most widely
                 read newsletters in the field of online security.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: All security involves trade-offs \\
                 2: Security trade-offs are subjective \\
                 3: Security trade-offs depend on power and agenda \\
                 4: Systems and how they fail \\
                 5: Knowing the attackers \\
                 6: Attackers never change their tunes, just their
                 instruments \\
                 7: Technology creates security imbalances \\
                 8: Security is a weakest-link problem \\
                 9: Brittleness makes for bad security \\
                 10: Security revolves around people \\
                 11: Detection works where prevention fails \\
                 12: Detection is useless without response \\
                 13: Identification, authentication, and authorization
                 \\
                 14: All countermeasures have some value \\
                 15: Fighting terrorism \\
                 16: Negotiating for security \\
                 17: Security demystified",
}


bibtype: book
filename: master.bib
label: Schneier:2012:LOE
author: Bruce Schneier
title: Liars and outliers: enabling the trust that society needs to thrive
publisher: pub-WILEY
address: pub-WILEY:adr
pages: xiv + 366
year: 2012
ISBN: 1-118-14330-2 (hardcover) OR 1118143302 (hardcover)
ISBN13: 978-1-118-14330-8 (hardcover) OR 9781118143308 (hardcover)
LCCN: BJ1500.T78 S35 2012
bibdate: Thu Jun 7 16:31:21 MDT 2012
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2012.06.07 16:31:21 MDT
acknowledgement: ack-nhfb
rawauthor: Bruce Schneier
rawtitle: Liars and outliers: enabling the trust that society needs to thrive
abstract:
Schneier argues that society requires trust in order to function, describes how society creates and maintains that trust through societal pressures, and discusses what happens when those pressures fail.

subject:
trust; social aspects; truthfulness and falsehood; social interaction; social stability; social aspects; interpersonal relations; sociology

TOC:
Overview Part I. The science of trust. A natural history of security The evolution of cooperation A social history of trust Societal dilemmas Part II. A model of trust. Societal pressures Moral pressures Reputational pressures Institutional pressures Security systems Part III. The real world. Competing interests Organizations Corporations Institutions Part IV. Conclusions. How societal pressures fail Technological advances The future

rawabstract:
Schneier argues that society requires trust in order to function, describes how society creates and maintains that trust through societal pressures, and discusses what happens when those pressures fail.

rawTOC:
Overview \\ Part I. The science of trust. A natural history of security \\ The evolution of cooperation \\ A social history of trust \\ Societal dilemmas \\ Part II. A model of trust. Societal pressures \\ Moral pressures \\ Reputational pressures \\ Institutional pressures \\ Security systems \\ Part III. The real world. Competing interests \\ Organizations \\ Corporations \\ Institutions \\ Part IV. Conclusions. How societal pressures fail \\ Technological advances \\ The future

entry:
@Book{Schneier:2012:LOE,
  author =       "Bruce Schneier",
  title =        "Liars and outliers: enabling the trust that society
                 needs to thrive",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xiv + 366",
  year =         "2012",
  ISBN =         "1-118-14330-2 (hardcover)",
  ISBN-13 =      "978-1-118-14330-8 (hardcover)",
  LCCN =         "BJ1500.T78 S35 2012",
  bibdate =      "Thu Jun 7 16:31:21 MDT 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "Schneier argues that society requires trust in order
                 to function, describes how society creates and
                 maintains that trust through societal pressures, and
                 discusses what happens when those pressures fail.",
  acknowledgement = ack-nhfb,
  subject =      "trust; social aspects; truthfulness and falsehood;
                 social interaction; social stability; social aspects;
                 interpersonal relations; sociology",
  tableofcontents = "Overview \\
                 Part I. The science of trust. A natural history of
                 security \\
                 The evolution of cooperation \\
                 A social history of trust \\
                 Societal dilemmas \\
                 Part II. A model of trust. Societal pressures \\
                 Moral pressures \\
                 Reputational pressures \\
                 Institutional pressures \\
                 Security systems \\
                 Part III. The real world. Competing interests \\
                 Organizations \\
                 Corporations \\
                 Institutions \\
                 Part IV. Conclusions. How societal pressures fail \\
                 Technological advances \\
                 The future",
}


bibtype: book
filename: master.bib
label: Schofield:1989:OFPa
author: Clive F. (Clive F.) Schofield
title: Optimising Fortran programs
publisher: pub-ELLIS-HORWOOD
address: pub-ELLIS-HORWOOD:adr
pages: x + 309
month: jul
monthnumber: 7
year: 1989
ISBN: 0-7458-0654-6, 0-470-21533-X (Halsted Press) OR 0745806546, 047021533X (Halsted Press)
LCCN: QA76.73.F25 S334 1989 WITHDRAWN
bibdate: Sun Sep 28 10:42:07 MDT 1997
bibtimestamp: 1997.09.28 10:42:07 MDT
note: Cover title: Optimizing Fortran programs. Includes index. Bibliography: p. [293]-296.
series: Ellis Horwood series in computers and their applications
URL: http://www.cbooks.com/sqlnut/SP/search/gtsumt?source=&isbn=047021533X
acknowledgement: ack-nhfb
rawauthor: Clive F. (Clive F.) Schofield
rawnote: Cover title: Optimizing Fortran programs. Includes index. Bibliography: p. [293]-296.
rawtitle: Optimising {Fortran} programs
ISBN13:
978-0-7458-0654-9, 978-0-470-21533-3 (Halsted Press) OR 9780745806549, 9780470215333 (Halsted Press)

bibsource:
http://www.amazon.com/exec/obidos/ISBN=047021533X/wholesaleproductA/; http://www.amazon.com/exec/obidos/ISBN=0745806546/wholesaleproductA/; http://www.cbooks.com/; https://www.math.utah.edu/pub/tex/bib/fortran2.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

keywords:
Computer systems --- Programming languages: Fortran language; Fortran (computer program language); Fortran (Computer program language)

entry:
@Book{Schofield:1989:OFPa,
  author =       "Clive F. (Clive F.) Schofield",
  title =        "Optimising {Fortran} programs",
  publisher =    pub-ELLIS-HORWOOD # " and " # pub-HALSTED,
  address =      pub-ELLIS-HORWOOD:adr # " and " # pub-HALSTED:adr,
  pages =        "x + 309",
  month =        jul,
  year =         "1989",
  ISBN =         "0-7458-0654-6, 0-470-21533-X (Halsted Press)",
  ISBN-13 =      "978-0-7458-0654-9, 978-0-470-21533-3 (Halsted Press)",
  LCCN =         "QA76.73.F25 S334 1989 WITHDRAWN",
  bibdate =      "Sun Sep 28 10:42:07 MDT 1997",
  bibsource =    "http://www.amazon.com/exec/obidos/ISBN=047021533X/wholesaleproductA/;
                 http://www.amazon.com/exec/obidos/ISBN=0745806546/wholesaleproductA/;
                 http://www.cbooks.com/;
                 https://www.math.utah.edu/pub/tex/bib/fortran2.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Cover title: Optimizing Fortran programs. Includes
                 index. Bibliography: p. [293]-296.",
  price =        "US\$40.95, US\$74.95",
  series =       "Ellis Horwood series in computers and their
                 applications",
  URL =          "http://www.cbooks.com/sqlnut/SP/search/gtsumt?source=&isbn=047021533X",
  acknowledgement = ack-nhfb,
  keywords =     "Computer systems --- Programming languages: Fortran
                 language; Fortran (computer program language);
                 {Fortran} (Computer program language)",
  libnote =      "Not in my library.",
}


bibtype: book
filename: master.bib
label: Scholze-Stubenrecht:1997:ODG
title: The Oxford--Duden German Dictionary: German--English / English--German
publisher: pub-CLARENDON
address: pub-CLARENDON:adr
pages: 1712
year: 1997
ISBN: 0-19-860130-1, 0-19-860132-8 OR 0198601301, 0198601328
ISBN13: 978-0-19-860130-2, 978-0-19-860132-6 OR 9780198601302, 9780198601326
LCCN: PF3640.O94 1997
bibdate: Sun Dec 28 22:38:30 1997
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1997.12.28 22:38:30 ???
keywords: German language --- Dictionaries --- English, English language --- Dictionaries --- German
acknowledgement: ack-nhfb
rawtitle: The {Oxford--Duden German} Dictionary: {German--English\slash English--German}
editor:
W. Scholze-Stubenrecht and J. B. Sykes and the Dudenredaktion and the German Section of the Oxford University Press Dictionary Department

raweditor:
W. Scholze-Stubenrecht and J. B. Sykes and {the Dudenredaktion} and {the German Section of the Oxford University Press Dictionary Department}

entry:
@Book{Scholze-Stubenrecht:1997:ODG,
  editor =       "W. Scholze-Stubenrecht and J. B. Sykes and {the
                 Dudenredaktion} and {the German Section of the Oxford
                 University Press Dictionary Department}",
  title =        "The {Oxford--Duden German} Dictionary:
                 {German--English\slash English--German}",
  publisher =    pub-CLARENDON,
  address =      pub-CLARENDON:adr,
  pages =        "1712",
  year =         "1997",
  ISBN =         "0-19-860130-1, 0-19-860132-8",
  ISBN-13 =      "978-0-19-860130-2, 978-0-19-860132-6",
  LCCN =         "PF3640.O94 1997",
  bibdate =      "Sun Dec 28 22:38:30 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$39.95",
  acknowledgement = ack-nhfb,
  idnumber =     "500",
  keywords =     "German language --- Dictionaries --- English, English
                 language --- Dictionaries --- German",
}


bibtype: book
filename: master.bib
label: Schonfeld:2003:JH
author: Roger C. Schonfeld
title: JSTOR: a history
publisher: pub-PRINCETON
address: pub-PRINCETON:adr
pages: xxxiv + 412
year: 2003
ISBN: 0-691-11531-1 OR 0691115311
ISBN13: 978-0-691-11531-3 OR 9780691115313
LCCN: PN4836 .S36 2003
bibdate: Mon Sep 14 11:35:15 MDT 2015
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2015.09.14 11:35:15 MDT
subject: JSTOR (Computer file); Periodicals; Databases
acknowledgement: ack-nhfb
authordates: 1977--
rawauthor: Roger C. Schonfeld
rawtitle: {JSTOR}: a history
URL:
http://www.loc.gov/catdir/description/prin031/2002035907.html; http://www.loc.gov/catdir/enhancements/fy0654/2002035907-b.html; http://www.loc.gov/catdir/samples/prin031/2002035907.html

TOC:
List of Illustrations / vii Foreword / Hal Varian / xi A Note on Publication / William G. Bowen / xiii Introduction / xv Acknowledgments / xxi List of Abbreviations / xxv A JSTOR Time Line / xxvii 1: The Idea at Denison, the Project at Mellon: December 1993--January 1994 / 1 2: In Search of a Partner, but Beginning Alone: February--May 1994 / 17 3: Securing an Institutional Partner: The University of Michigan: April--August 1994 / 46 4: The Pilot Project: September 1994--April 1995 / 69 5: Evolving Organizational Decisions and Independence: February--December 1995 / 95 6: Defining a Mission in Partnership with Publishers: September 1995--August 1996 / 119 7: Operational Changes at Michigan: September 1995--August 1996 / 149 8: Developing a Business Plan: January--December 1996 / 166 9: A More Thoroughly Professionalized Operation: September 1996--December 1997 / 198 10: Public Availability and Library Participation: September 1996--December 1997 / 230 11: Developing Two New Collections: May 1997--December 1999 / 264 12: Increasing Availability and Participation: January 1998--December 1999 / 281 13: Completing Arts and Sciences I and Strategizing for the Future: July 1998--December 1999 / 301 14: Challenges and Opportunities of Growth: January 2000--December 2001 / 318 Conclusion: A Self-Sustaining Organization / 355 Epilogue: Lessons Learned / 374 App. List of Journals / 387 Bibliography / 393 Index / 405

rawTOC:
List of Illustrations / vii \\ Foreword / Hal Varian / xi \\ A Note on Publication / William G. Bowen / xiii \\ Introduction / xv \\ Acknowledgments / xxi \\ List of Abbreviations / xxv \\ A JSTOR Time Line / xxvii \\ 1: The Idea at Denison, the Project at Mellon: December 1993--January 1994 / 1 \\ 2: In Search of a Partner, but Beginning Alone: February--May 1994 / 17 \\ 3: Securing an Institutional Partner: The University of Michigan: April--August 1994 / 46 \\ 4: The Pilot Project: September 1994--April 1995 / 69 \\ 5: Evolving Organizational Decisions and Independence: February--December 1995 / 95 \\ 6: Defining a Mission in Partnership with Publishers: September 1995--August 1996 / 119 \\ 7: Operational Changes at Michigan: September 1995--August 1996 / 149 \\ 8: Developing a Business Plan: January--December 1996 / 166 \\ 9: A More Thoroughly Professionalized Operation: September 1996--December 1997 / 198 \\ 10: Public Availability and Library Participation: September 1996--December 1997 / 230 \\ 11: Developing Two New Collections: May 1997--December 1999 / 264 \\ 12: Increasing Availability and Participation: January 1998--December 1999 / 281 \\ 13: Completing Arts and Sciences I and Strategizing for the Future: July 1998--December 1999 / 301 \\ 14: Challenges and Opportunities of Growth: January 2000--December 2001 / 318 \\ Conclusion: A Self-Sustaining Organization / 355 \\ Epilogue: Lessons Learned / 374 \\ App. List of Journals / 387 \\ Bibliography / 393 \\ Index / 405

entry:
@Book{Schonfeld:2003:JH,
  author =       "Roger C. Schonfeld",
  title =        "{JSTOR}: a history",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "xxxiv + 412",
  year =         "2003",
  ISBN =         "0-691-11531-1",
  ISBN-13 =      "978-0-691-11531-3",
  LCCN =         "PN4836 .S36 2003",
  bibdate =      "Mon Sep 14 11:35:15 MDT 2015",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/description/prin031/2002035907.html;
                 http://www.loc.gov/catdir/enhancements/fy0654/2002035907-b.html;
                 http://www.loc.gov/catdir/samples/prin031/2002035907.html",
  acknowledgement = ack-nhfb,
  author-dates = "1977--",
  libnote =      "Not in my library.",
  subject =      "JSTOR (Computer file); Periodicals; Databases",
  tableofcontents = "List of Illustrations / vii \\
                 Foreword / Hal Varian / xi \\
                 A Note on Publication / William G. Bowen / xiii \\
                 Introduction / xv \\
                 Acknowledgments / xxi \\
                 List of Abbreviations / xxv \\
                 A JSTOR Time Line / xxvii \\
                 1: The Idea at Denison, the Project at Mellon: December
                 1993--January 1994 / 1 \\
                 2: In Search of a Partner, but Beginning Alone:
                 February--May 1994 / 17 \\
                 3: Securing an Institutional Partner: The University of
                 Michigan: April--August 1994 / 46 \\
                 4: The Pilot Project: September 1994--April 1995 / 69
                 \\
                 5: Evolving Organizational Decisions and Independence:
                 February--December 1995 / 95 \\
                 6: Defining a Mission in Partnership with Publishers:
                 September 1995--August 1996 / 119 \\
                 7: Operational Changes at Michigan: September
                 1995--August 1996 / 149 \\
                 8: Developing a Business Plan: January--December 1996 /
                 166 \\
                 9: A More Thoroughly Professionalized Operation:
                 September 1996--December 1997 / 198 \\
                 10: Public Availability and Library Participation:
                 September 1996--December 1997 / 230 \\
                 11: Developing Two New Collections: May 1997--December
                 1999 / 264 \\
                 12: Increasing Availability and Participation: January
                 1998--December 1999 / 281 \\
                 13: Completing Arts and Sciences I and Strategizing for
                 the Future: July 1998--December 1999 / 301 \\
                 14: Challenges and Opportunities of Growth: January
                 2000--December 2001 / 318 \\
                 Conclusion: A Self-Sustaining Organization / 355 \\
                 Epilogue: Lessons Learned / 374 \\
                 App. List of Journals / 387 \\
                 Bibliography / 393 \\
                 Index / 405",
}


bibtype: book
filename: master.bib
label: Schoonover:1992:GEU
author: Michael A. Schoonover and John S. Bowie and William R. Arnold
title: GNU Emacs: UNIX Text Editing and Programming
publisher: pub-AW
address: pub-AW:adr
pages: xxvii + 609
year: 1992
ISBN: 0-201-56345-2 OR 0201563452
ISBN13: 978-0-201-56345-0 OR 9780201563450
LCCN: QA76.76.T49S36
series: Hewlett-Packard Press series
subject: Text editors (Computer programs); GNU Emacs; UNIX (Computer file)
acknowledgement: ack-nhfb
rawauthor: Michael A. Schoonover and John S. Bowie and William R. Arnold
rawtitle: {GNU Emacs}: {UNIX} Text Editing and Programming
bibsource:
https://www.math.utah.edu/pub/tex/bib/gnu.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib

TOC:
Preface Text Editing In Emacs A Quick Tour of Emacs Starting Emacs Exiting Emacs Understanding the Emacs Screen Tying Text Typing Commands Using a Basic Set of Editing Commands Getting Online Help Using Emacs to Process Electronic Mail Using Emacs to Manage Files Changing Emacs' Behavior with Variables Basic Editing Commands Visiting a File Saving a Buffer Listing Buffers Switching to a Different Buffer Killing A Buffer Setting the Mode for a Buffer Moving the Cursor Using Line Numbers Deleting Text Undoing Mistakes Using Regions Searching for Text Searching and Replacing Text Overwriting Text More Efficient Editing Running a Command Multiple Times Modifying Command Behavior with Arguments Inserting Control Characters into a Buffer Working with Words, Sentences, and Paragraphs Working with Pages Working with Blank Lines Getting Cursor, Line, and Page Information Transposing Text Filling Text Indenting Text Changing Letter Case Searching and Replacing Text Narrowing a Buffer Moving the Cursor to Previous Marks (the Mark Ring) Using the Kill Ring Completing Long Command Names Completing File Names Using Abbreviations (Text Expansions) Using Macros for Repeated Editing Tasks Scrolling Windows Wording with Multiple Windows Printing a Buffer Listing a Directory Advanced Editing Changing Emacs' Behavior with Commands Changing Emacs' Behavior with Command-Line Arguments Searching for Regular Expressions (Regexps) Searching and Replacing Regexps Editing Outlines Manipulating Buffers Advanced File Operations Managing Auto-Saving Managing Emacs Backup Files Reverting a Buffer to Its Original Contents Preventing Simultaneous Editing Advanced Window Operations Editing Your Responses in the Minibuffer Sorting Test Using Rectangles Using Registers Programming In Emacs Program Development in Emacs Supported Editing Modes Using Fundamental and Text Mode Commands in Programming Modes Moving by Function Marking Functions Indenting Programs Commenting Programs Matching Parentheses, Braces, and Brackets Forcing Balanced Parentheses Selectively Displaying Program Lines Getting Documentation on System Commands and Routines Editing Across Multiple Files with Tag Tables Keeping Track of Changes to source with a ChangeLog Compiling Programs Sexp Commands (Advanced Usage) Editing in C Mode Invoking C Mode Assumptions About C Source Moving Among Functions Marking Functions Indenting Programs Commenting Programs Working with Sexps and Lists (Advanced Usage) Customizing Indentation (Advanced Usage) Customizing Commenting (Advanced Usage) Editing in FORTRAN Mode Invoking FORTRAN Mode Assumptions About FORTRAN Source Moving Among Subprograms and Statements Marking Subprograms Indenting Programs Labeling Lines Commenting Programs Using FORTRAN Keyword Abbreviations Working with Sexps and Lists (Advanced Usage) What Are Sexps and Lists in FORTRAN Mode? Customizing Indentation (Advanced Usage) Customizing Commenting (Advanced Usage) Editing in Lisp Modes Lisp Major Modes Assumptions About Lisp Source Moving Among Defuns Moving Among Sexps and Lists List and Sexp Motion Commands Marking Text Transposing Sexps Killing Sexps Indenting Programs Commenting Programs Evaluating Lisp Code Customizing Indentation (Advanced Usage) Customizing Commenting (Advanced Usage) Additional Emacs Features Getting Online Help Running Help Commands Getting Instructions for Using Help Getting Command Information Using Emacs for Electronic Mail The RMAIL Facility and Other UNIX Mail Facilities Reading Mail Messages Exiting from the RMAIL Buffer Moving Around Your Mail Messages Saving Messages to Files Removing Messages Getting New Mail Using a Mail Summary to Scan Messages Composing and Sending Messages Using Mode Line Status Messages (Labels) Using Multiple Mailbox Files Reading Digest Messages Associating UNIX Mailbox Files with RMAIL Mailbox Files (Advanced Usage) Managing Files and Buffers Using the Dired Facility to Manage Files Managing Multiple Buffers with Buffer-Menus Miscellaneous Emacs Features Checking Your Spelling Rerunning Commands from the Command History Recovering Files After System Crashes Using UNIX Commands in Emacs Running a UNIX Shell in an Emacs Buffer Nroff Major Mode TeX Modes: LaTeX and Plain TeX Picture Mode Doctor Mode Customizing And Administering Emacs Customizing the Emacs Environment Using a .emacs Start-Up File Using Variables to Change Emacs' Behavior Changing Command Key Bindings Forcing Confirmation for a Function More About Variable (Advanced Usage) More About Key Bindings (Advanced Usage) Examples of .emacs Customizations Administering Emacs Finding Emacs and identifying Its Parts Using New (or Notes) to Get Emacs Information Installing Emacs Editing in Pascal Mode Obtaining a Pascal Mode Enabling Pascal Mode Assumptions About Pascal Source Moving the Cursor Indenting Programs Commands That Build Pascal Constructs Creating a New Program Commenting Programs Working with Sexps and Lists (Advanced Usage) Customizing Indentation Customizing Commenting (Advanced Usage) Summary Emacs-Lisp Programming An Overview of Emacs-Lisp Programming Getting Documentation on Emacs-Lisp Defuns and Variables Evaluating Lisp Code Loading Emacs-Lisp Libraries Compiling Emacs-Lisp Code Debugging Emacs-Lisp Code (Advanced Usage) Converting Mocklisp to Emacs-Lisp (for Mocklisp Users) Summary Switching from vi to Emacs The vi Emulation Mode in Emacs Starting the Editor Saving Text and Exiting Line Number Information Commands Inserting Text Undoing Commands Repeating Commands Rerunning Previous Commands Moving the Cursor Deleting Text Using Marks Searching for Text Search and Replace Text Indenting Text Copying and Moving Blocks of Text Changing (Overwriting) Text Scrolling Text Using Shell Commands Using Macros Using Abbreviations Miscellaneous Commands Emacs Command Reference Abbreviations Buffers Buffer-Menu Case Conversion C Mode Compilation Cursor Motion Debugger (Emacs-Lisp) Deletion and Killing Dired Display Management Editor Emulation (EDT, vi, Gosling Emacs) Emacs-Lisp Programming Exiting files Filling FORTRAN Mode Help Indentation Key Bindings Killing and Yanking (Moving and Copying) Lisp Modes Location and Date/Time Macros Mail Minibuffer Editing Modes Nroff Mode Numeric Prefix Outline Editing Pages Paragraphs Picture Mode Printing Rectangles Regions Registers Searching Searching and Replacing Sentences Sexps and Lists (Balanced Expressions) Shells Sorting Spell-Checking Tags TeX Mode Transposing Undo Variables Windows Words Index

shortTOC:
Preface Part 1: Text editing in Emacs 1: A quick tour of Emacs 2: Basic editing commands 3: More efficient editing 4: Advanced editing Part 2: Programming in Emacs 5: Program development in Emacs 6: Editing in C mode 7: Editing in FORTRAN mode 8: Editing in Lisp modes Part 3: Additional Emacs features 9: Getting online help 10: Using Emacs for electronic mail 11: Managing files and buffers 12: Miscellaneous Emacs features Part 4: Customizing and administering Emacs 13: Customizing the Emacs environment 14: Administering Emacs A: Editing in Pascal mode B: Emacs-Lisp Programming C: Switching from vi to Emacs D: Emacs command reference Index

rawshortTOC:
Preface \\ Part 1: Text editing in Emacs \\ 1: A quick tour of Emacs \\ 2: Basic editing commands \\ 3: More efficient editing \\ 4: Advanced editing \\ Part 2: Programming in Emacs \\ 5: Program development in Emacs \\ 6: Editing in C mode \\ 7: Editing in FORTRAN mode \\ 8: Editing in Lisp modes \\ Part 3: Additional Emacs features \\ 9: Getting online help \\ 10: Using Emacs for electronic mail \\ 11: Managing files and buffers \\ 12: Miscellaneous Emacs features \\ Part 4: Customizing and administering Emacs \\ 13: Customizing the Emacs environment \\ 14: Administering Emacs \\ A: Editing in Pascal mode \\ B: Emacs-Lisp Programming \\ C: Switching from vi to Emacs \\ D: Emacs command reference \\ Index

rawTOC:
Preface \\ Text Editing In Emacs \\ A Quick Tour of Emacs \\ Starting Emacs \\ Exiting Emacs \\ Understanding the Emacs Screen \\ Tying Text \\ Typing Commands \\ Using a Basic Set of Editing Commands \\ Getting Online Help \\ Using Emacs to Process Electronic Mail \\ Using Emacs to Manage Files \\ Changing Emacs' Behavior with Variables \\ Basic Editing Commands \\ Visiting a File \\ Saving a Buffer \\ Listing Buffers \\ Switching to a Different Buffer \\ Killing A Buffer \\ Setting the Mode for a Buffer \\ Moving the Cursor \\ Using Line Numbers \\ Deleting Text \\ Undoing Mistakes \\ Using Regions \\ Searching for Text \\ Searching and Replacing Text \\ Overwriting Text \\ More Efficient Editing \\ Running a Command Multiple Times \\ Modifying Command Behavior with Arguments \\ Inserting Control Characters into a Buffer \\ Working with Words, Sentences, and Paragraphs \\ Working with Pages \\ Working with Blank Lines \\ Getting Cursor, Line, and Page Information \\ Transposing Text \\ Filling Text \\ Indenting Text \\ Changing Letter Case \\ Searching and Replacing Text \\ Narrowing a Buffer \\ Moving the Cursor to Previous Marks (the Mark Ring) \\ Using the Kill Ring \\ Completing Long Command Names \\ Completing File Names \\ Using Abbreviations (Text Expansions) \\ Using Macros for Repeated Editing Tasks \\ Scrolling Windows \\ Wording with Multiple Windows \\ Printing a Buffer \\ Listing a Directory \\ Advanced Editing \\ Changing Emacs' Behavior with Commands \\ Changing Emacs' Behavior with Command-Line Arguments \\ Searching for Regular Expressions (Regexps) \\ Searching and Replacing Regexps \\ Editing Outlines \\ Manipulating Buffers \\ Advanced File Operations \\ Managing Auto-Saving \\ Managing Emacs Backup Files \\ Reverting a Buffer to Its Original Contents \\ Preventing Simultaneous Editing \\ Advanced Window Operations \\ Editing Your Responses in the Minibuffer \\ Sorting Test \\ Using Rectangles \\ Using Registers \\ Programming In Emacs \\ Program Development in Emacs \\ Supported Editing Modes \\ Using Fundamental and Text Mode Commands in Programming Modes \\ Moving by Function \\ Marking Functions \\ Indenting Programs Commenting Programs \\ Matching Parentheses, Braces, and Brackets \\ Forcing Balanced Parentheses \\ Selectively Displaying Program Lines \\ Getting Documentation on System Commands and Routines \\ Editing Across Multiple Files with Tag Tables \\ Keeping Track of Changes to source with a ChangeLog \\ Compiling Programs \\ Sexp Commands (Advanced Usage) \\ Editing in C Mode \\ Invoking C Mode \\ Assumptions About C Source \\ Moving Among Functions \\ Marking Functions \\ Indenting Programs \\ Commenting Programs \\ Working with Sexps and Lists (Advanced Usage) \\ Customizing Indentation (Advanced Usage) \\ Customizing Commenting (Advanced Usage) \\ Editing in FORTRAN Mode \\ Invoking FORTRAN Mode \\ Assumptions About FORTRAN Source \\ Moving Among Subprograms and Statements \\ Marking Subprograms \\ Indenting Programs \\ Labeling Lines \\ Commenting Programs \\ Using FORTRAN Keyword Abbreviations \\ Working with Sexps and Lists (Advanced Usage) \\ What Are Sexps and Lists in FORTRAN Mode? \\ Customizing Indentation (Advanced Usage) \\ Customizing Commenting (Advanced Usage) \\ Editing in Lisp Modes \\ Lisp Major Modes \\ Assumptions About Lisp Source \\ Moving Among Defuns \\ Moving Among Sexps and Lists \\ List and Sexp Motion Commands \\ Marking Text \\ Transposing Sexps \\ Killing Sexps \\ Indenting Programs \\ Commenting Programs \\ Evaluating Lisp Code \\ Customizing Indentation (Advanced Usage) \\ Customizing Commenting (Advanced Usage) \\ Additional Emacs Features \\ Getting Online Help \\ Running Help Commands \\ Getting Instructions for Using Help \\ Getting Command Information \\ Using Emacs for Electronic Mail \\ The RMAIL Facility and Other UNIX Mail Facilities \\ Reading Mail Messages \\ Exiting from the RMAIL Buffer Moving Around Your Mail Messages \\ Saving Messages to Files \\ Removing Messages \\ Getting New Mail \\ Using a Mail Summary to Scan Messages \\ Composing and Sending Messages \\ Using Mode Line Status Messages (Labels) \\ Using Multiple Mailbox Files \\ Reading Digest Messages \\ Associating UNIX Mailbox Files with RMAIL Mailbox Files (Advanced Usage) \\ Managing Files and Buffers \\ Using the Dired Facility to Manage Files \\ Managing Multiple Buffers with Buffer-Menus \\ Miscellaneous Emacs Features \\ Checking Your Spelling \\ Rerunning Commands from the Command History \\ Recovering Files After System Crashes \\ Using UNIX Commands in Emacs \\ Running a UNIX Shell in an Emacs Buffer \\ Nroff Major Mode \\ TeX Modes: LaTeX and Plain TeX \\ Picture Mode \\ Doctor Mode \\ Customizing And Administering Emacs \\ Customizing the Emacs Environment \\ Using a .emacs Start-Up File \\ Using Variables to Change Emacs' Behavior \\ Changing Command Key Bindings \\ Forcing Confirmation for a Function \\ More About Variable (Advanced Usage) \\ More About Key Bindings (Advanced Usage) \\ Examples of .emacs Customizations \\ Administering Emacs \\ Finding Emacs and identifying Its Parts \\ Using New (or Notes) to Get Emacs Information \\ Installing Emacs \\ Editing in Pascal Mode \\ Obtaining a Pascal Mode \\ Enabling Pascal Mode \\ Assumptions About Pascal Source \\ Moving the Cursor \\ Indenting Programs \\ Commands That Build Pascal Constructs \\ Creating a New Program \\ Commenting Programs \\ Working with Sexps and Lists (Advanced Usage) \\ Customizing Indentation \\ Customizing Commenting (Advanced Usage) \\ Summary \\ Emacs-Lisp Programming \\ An Overview of Emacs-Lisp Programming \\ Getting Documentation on Emacs-Lisp Defuns and Variables \\ Evaluating Lisp Code \\ Loading Emacs-Lisp Libraries \\ Compiling Emacs-Lisp Code \\ Debugging Emacs-Lisp Code (Advanced Usage) \\ Converting Mocklisp to Emacs-Lisp (for Mocklisp Users) \\ Summary \\ Switching from vi to Emacs \\ The vi Emulation Mode in Emacs \\ Starting the Editor \\ Saving Text and Exiting \\ Line Number Information Commands \\ Inserting Text \\ Undoing Commands \\ Repeating Commands \\ Rerunning Previous Commands \\ Moving the Cursor \\ Deleting Text \\ Using Marks \\ Searching for Text Search and Replace Text \\ Indenting Text \\ Copying and Moving Blocks of Text \\ Changing (Overwriting) Text \\ Scrolling Text \\ Using Shell Commands \\ Using Macros \\ Using Abbreviations \\ Miscellaneous Commands \\ Emacs Command Reference \\ Abbreviations \\ Buffers \\ Buffer-Menu \\ Case Conversion \\ C Mode \\ Compilation \\ Cursor Motion \\ Debugger (Emacs-Lisp) \\ Deletion and Killing \\ Dired \\ Display Management \\ Editor Emulation (EDT, vi, Gosling Emacs) \\ Emacs-Lisp Programming \\ Exiting \\ files \\ Filling \\ FORTRAN Mode \\ Help \\ Indentation \\ Key Bindings \\ Killing and Yanking (Moving and Copying) \\ Lisp Modes \\ Location and Date/Time \\ Macros \\ Mail \\ Minibuffer Editing \\ Modes \\ Nroff Mode \\ Numeric Prefix \\ Outline Editing \\ Pages \\ Paragraphs \\ Picture Mode \\ Printing \\ Rectangles \\ Regions \\ Registers \\ Searching \\ Searching and Replacing \\ Sentences \\ Sexps and Lists (Balanced Expressions) \\ Shells \\ Sorting \\ Spell-Checking \\ Tags \\ TeX Mode \\ Transposing \\ Undo \\ Variables \\ Windows \\ Words \\ Index

entry:
@Book{Schoonover:1992:GEU,
  author =       "Michael A. Schoonover and John S. Bowie and William R.
                 Arnold",
  title =        "{GNU Emacs}: {UNIX} Text Editing and Programming",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xxvii + 609",
  year =         "1992",
  ISBN =         "0-201-56345-2",
  ISBN-13 =      "978-0-201-56345-0",
  LCCN =         "QA76.76.T49S36",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/gnu.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  series =       "Hewlett-Packard Press series",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "Preface \\
                 Part 1: Text editing in Emacs \\
                 1: A quick tour of Emacs \\
                 2: Basic editing commands \\
                 3: More efficient editing \\
                 4: Advanced editing \\
                 Part 2: Programming in Emacs \\
                 5: Program development in Emacs \\
                 6: Editing in C mode \\
                 7: Editing in FORTRAN mode \\
                 8: Editing in Lisp modes \\
                 Part 3: Additional Emacs features \\
                 9: Getting online help \\
                 10: Using Emacs for electronic mail \\
                 11: Managing files and buffers \\
                 12: Miscellaneous Emacs features \\
                 Part 4: Customizing and administering Emacs \\
                 13: Customizing the Emacs environment \\
                 14: Administering Emacs \\
                 A: Editing in Pascal mode \\
                 B: Emacs-Lisp Programming \\
                 C: Switching from vi to Emacs \\
                 D: Emacs command reference \\
                 Index",
  subject =      "Text editors (Computer programs); GNU Emacs; UNIX
                 (Computer file)",
  tableofcontents = "Preface \\
                 Text Editing In Emacs \\
                 A Quick Tour of Emacs \\
                 Starting Emacs \\
                 Exiting Emacs \\
                 Understanding the Emacs Screen \\
                 Tying Text \\
                 Typing Commands \\
                 Using a Basic Set of Editing Commands \\
                 Getting Online Help \\
                 Using Emacs to Process Electronic Mail \\
                 Using Emacs to Manage Files \\
                 Changing Emacs' Behavior with Variables \\
                 Basic Editing Commands \\
                 Visiting a File \\
                 Saving a Buffer \\
                 Listing Buffers \\
                 Switching to a Different Buffer \\
                 Killing A Buffer \\
                 Setting the Mode for a Buffer \\
                 Moving the Cursor \\
                 Using Line Numbers \\
                 Deleting Text \\
                 Undoing Mistakes \\
                 Using Regions \\
                 Searching for Text \\
                 Searching and Replacing Text \\
                 Overwriting Text \\
                 More Efficient Editing \\
                 Running a Command Multiple Times \\
                 Modifying Command Behavior with Arguments \\
                 Inserting Control Characters into a Buffer \\
                 Working with Words, Sentences, and Paragraphs \\
                 Working with Pages \\
                 Working with Blank Lines \\
                 Getting Cursor, Line, and Page Information \\
                 Transposing Text \\
                 Filling Text \\
                 Indenting Text \\
                 Changing Letter Case \\
                 Searching and Replacing Text \\
                 Narrowing a Buffer \\
                 Moving the Cursor to Previous Marks (the Mark Ring) \\
                 Using the Kill Ring \\
                 Completing Long Command Names \\
                 Completing File Names \\
                 Using Abbreviations (Text Expansions) \\
                 Using Macros for Repeated Editing Tasks \\
                 Scrolling Windows \\
                 Wording with Multiple Windows \\
                 Printing a Buffer \\
                 Listing a Directory \\
                 Advanced Editing \\
                 Changing Emacs' Behavior with Commands \\
                 Changing Emacs' Behavior with Command-Line Arguments
                 \\
                 Searching for Regular Expressions (Regexps) \\
                 Searching and Replacing Regexps \\
                 Editing Outlines \\
                 Manipulating Buffers \\
                 Advanced File Operations \\
                 Managing Auto-Saving \\
                 Managing Emacs Backup Files \\
                 Reverting a Buffer to Its Original Contents \\
                 Preventing Simultaneous Editing \\
                 Advanced Window Operations \\
                 Editing Your Responses in the Minibuffer \\
                 Sorting Test \\
                 Using Rectangles \\
                 Using Registers \\
                 Programming In Emacs \\
                 Program Development in Emacs \\
                 Supported Editing Modes \\
                 Using Fundamental and Text Mode Commands in Programming
                 Modes \\
                 Moving by Function \\
                 Marking Functions \\
                 Indenting Programs Commenting Programs \\
                 Matching Parentheses, Braces, and Brackets \\
                 Forcing Balanced Parentheses \\
                 Selectively Displaying Program Lines \\
                 Getting Documentation on System Commands and Routines
                 \\
                 Editing Across Multiple Files with Tag Tables \\
                 Keeping Track of Changes to source with a ChangeLog \\
                 Compiling Programs \\
                 Sexp Commands (Advanced Usage) \\
                 Editing in C Mode \\
                 Invoking C Mode \\
                 Assumptions About C Source \\
                 Moving Among Functions \\
                 Marking Functions \\
                 Indenting Programs \\
                 Commenting Programs \\
                 Working with Sexps and Lists (Advanced Usage) \\
                 Customizing Indentation (Advanced Usage) \\
                 Customizing Commenting (Advanced Usage) \\
                 Editing in FORTRAN Mode \\
                 Invoking FORTRAN Mode \\
                 Assumptions About FORTRAN Source \\
                 Moving Among Subprograms and Statements \\
                 Marking Subprograms \\
                 Indenting Programs \\
                 Labeling Lines \\
                 Commenting Programs \\
                 Using FORTRAN Keyword Abbreviations \\
                 Working with Sexps and Lists (Advanced Usage) \\
                 What Are Sexps and Lists in FORTRAN Mode? \\
                 Customizing Indentation (Advanced Usage) \\
                 Customizing Commenting (Advanced Usage) \\
                 Editing in Lisp Modes \\
                 Lisp Major Modes \\
                 Assumptions About Lisp Source \\
                 Moving Among Defuns \\
                 Moving Among Sexps and Lists \\
                 List and Sexp Motion Commands \\
                 Marking Text \\
                 Transposing Sexps \\
                 Killing Sexps \\
                 Indenting Programs \\
                 Commenting Programs \\
                 Evaluating Lisp Code \\
                 Customizing Indentation (Advanced Usage) \\
                 Customizing Commenting (Advanced Usage) \\
                 Additional Emacs Features \\
                 Getting Online Help \\
                 Running Help Commands \\
                 Getting Instructions for Using Help \\
                 Getting Command Information \\
                 Using Emacs for Electronic Mail \\
                 The RMAIL Facility and Other UNIX Mail Facilities \\
                 Reading Mail Messages \\
                 Exiting from the RMAIL Buffer Moving Around Your Mail
                 Messages \\
                 Saving Messages to Files \\
                 Removing Messages \\
                 Getting New Mail \\
                 Using a Mail Summary to Scan Messages \\
                 Composing and Sending Messages \\
                 Using Mode Line Status Messages (Labels) \\
                 Using Multiple Mailbox Files \\
                 Reading Digest Messages \\
                 Associating UNIX Mailbox Files with RMAIL Mailbox Files
                 (Advanced Usage) \\
                 Managing Files and Buffers \\
                 Using the Dired Facility to Manage Files \\
                 Managing Multiple Buffers with Buffer-Menus \\
                 Miscellaneous Emacs Features \\
                 Checking Your Spelling \\
                 Rerunning Commands from the Command History \\
                 Recovering Files After System Crashes \\
                 Using UNIX Commands in Emacs \\
                 Running a UNIX Shell in an Emacs Buffer \\
                 Nroff Major Mode \\
                 TeX Modes: LaTeX and Plain TeX \\
                 Picture Mode \\
                 Doctor Mode \\
                 Customizing And Administering Emacs \\
                 Customizing the Emacs Environment \\
                 Using a .emacs Start-Up File \\
                 Using Variables to Change Emacs' Behavior \\
                 Changing Command Key Bindings \\
                 Forcing Confirmation for a Function \\
                 More About Variable (Advanced Usage) \\
                 More About Key Bindings (Advanced Usage) \\
                 Examples of .emacs Customizations \\
                 Administering Emacs \\
                 Finding Emacs and identifying Its Parts \\
                 Using New (or Notes) to Get Emacs Information \\
                 Installing Emacs \\
                 Editing in Pascal Mode \\
                 Obtaining a Pascal Mode \\
                 Enabling Pascal Mode \\
                 Assumptions About Pascal Source \\
                 Moving the Cursor \\
                 Indenting Programs \\
                 Commands That Build Pascal Constructs \\
                 Creating a New Program \\
                 Commenting Programs \\
                 Working with Sexps and Lists (Advanced Usage) \\
                 Customizing Indentation \\
                 Customizing Commenting (Advanced Usage) \\
                 Summary \\
                 Emacs-Lisp Programming \\
                 An Overview of Emacs-Lisp Programming \\
                 Getting Documentation on Emacs-Lisp Defuns and
                 Variables \\
                 Evaluating Lisp Code \\
                 Loading Emacs-Lisp Libraries \\
                 Compiling Emacs-Lisp Code \\
                 Debugging Emacs-Lisp Code (Advanced Usage) \\
                 Converting Mocklisp to Emacs-Lisp (for Mocklisp Users)
                 \\
                 Summary \\
                 Switching from vi to Emacs \\
                 The vi Emulation Mode in Emacs \\
                 Starting the Editor \\
                 Saving Text and Exiting \\
                 Line Number Information Commands \\
                 Inserting Text \\
                 Undoing Commands \\
                 Repeating Commands \\
                 Rerunning Previous Commands \\
                 Moving the Cursor \\
                 Deleting Text \\
                 Using Marks \\
                 Searching for Text Search and Replace Text \\
                 Indenting Text \\
                 Copying and Moving Blocks of Text \\
                 Changing (Overwriting) Text \\
                 Scrolling Text \\
                 Using Shell Commands \\
                 Using Macros \\
                 Using Abbreviations \\
                 Miscellaneous Commands \\
                 Emacs Command Reference \\
                 Abbreviations \\
                 Buffers \\
                 Buffer-Menu \\
                 Case Conversion \\
                 C Mode \\
                 Compilation \\
                 Cursor Motion \\
                 Debugger (Emacs-Lisp) \\
                 Deletion and Killing \\
                 Dired \\
                 Display Management \\
                 Editor Emulation (EDT, vi, Gosling Emacs) \\
                 Emacs-Lisp Programming \\
                 Exiting \\
                 files \\
                 Filling \\
                 FORTRAN Mode \\
                 Help \\
                 Indentation \\
                 Key Bindings \\
                 Killing and Yanking (Moving and Copying) \\
                 Lisp Modes \\
                 Location and Date/Time \\
                 Macros \\
                 Mail \\
                 Minibuffer Editing \\
                 Modes \\
                 Nroff Mode \\
                 Numeric Prefix \\
                 Outline Editing \\
                 Pages \\
                 Paragraphs \\
                 Picture Mode \\
                 Printing \\
                 Rectangles \\
                 Regions \\
                 Registers \\
                 Searching \\
                 Searching and Replacing \\
                 Sentences \\
                 Sexps and Lists (Balanced Expressions) \\
                 Shells \\
                 Sorting \\
                 Spell-Checking \\
                 Tags \\
                 TeX Mode \\
                 Transposing \\
                 Undo \\
                 Variables \\
                 Windows \\
                 Words \\
                 Index",
}


bibtype: book
filename: master.bib
label: Schreiner:1985:ICC
author: Axel T. Schreiner and H. George Friedman, Jr.
title: Introduction to Compiler Construction Under UNIX
publisher: pub-PH
address: pub-PH:adr
pages: viii + 194
year: 1985
ISBN: 0-13-474396-2 OR 0134743962
ISBN13: 978-0-13-474396-7 OR 9780134743967
LCCN: QA76.76.C65 S37 1985
bibdate: Wed Dec 15 18:20:18 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 18:20:18 ???
URL: ftp://ftp.cs.uiuc.edu/pub/faculty/friedman/tar
acknowledgement: ack-nhfb
rawauthor: Axel T. Schreiner and H. George {Friedman, Jr.}
rawtitle: Introduction to Compiler Construction Under {UNIX}
TOC:
Language definition Word recognition Language recognition Error recovery Semantic restrictions Memory allocation Code generation A load-and-go system Sample C compiler listing

rawTOC:
Language definition \\ Word recognition \\ Language recognition \\ Error recovery \\ Semantic restrictions \\ Memory allocation \\ Code generation \\ A load-and-go system \\ Sample C compiler listing

entry:
@Book{Schreiner:1985:ICC,
  author =       "Axel T. Schreiner and H. George {Friedman, Jr.}",
  title =        "Introduction to Compiler Construction Under {UNIX}",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "viii + 194",
  year =         "1985",
  ISBN =         "0-13-474396-2",
  ISBN-13 =      "978-0-13-474396-7",
  LCCN =         "QA76.76.C65 S37 1985",
  bibdate =      "Wed Dec 15 18:20:18 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "ftp://ftp.cs.uiuc.edu/pub/faculty/friedman/tar",
  acknowledgement = ack-nhfb,
  tableofcontents = "Language definition \\
                 Word recognition \\
                 Language recognition \\
                 Error recovery \\
                 Semantic restrictions \\
                 Memory allocation \\
                 Code generation \\
                 A load-and-go system \\
                 Sample C compiler listing",
}


bibtype: book
filename: master.bib
label: Schroeder:1991:FCP
author: Manfred Schroeder
title: Fractals, Chaos, Power Laws
publisher: pub-W-H-FREEMAN
address: pub-W-H-FREEMAN:adr
pages: xviii + 429
year: 1991
ISBN: 0-671-74217-5, 0-7167-2136-8, 0-7167-2357-3 OR 0671742175, 0716721368, 0716723573
LCCN: QD921 .S3 1990
bibdate: Wed Dec 15 10:41:35 1993
bibtimestamp: 1993.12.15 10:41:35 ???
acknowledgement: ack-nhfb
rawauthor: Manfred Schroeder
rawtitle: Fractals, Chaos, Power Laws
ISBN13:
978-0-671-74217-1, 978-0-7167-2136-9, 978-0-7167-2357-8 OR 9780671742171, 9780716721369, 9780716723578

bibsource:
https://www.math.utah.edu/pub/bibnet/authors/h/heisenberg-werner.bib; https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib; https://www.math.utah.edu/pub/bibnet/authors/s/shannon-claude-elwood.bib; https://www.math.utah.edu/pub/tex/bib/benfords-law.bib; https://www.math.utah.edu/pub/tex/bib/fibquart.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/pi.bib

abstract:
Reveals the extraordinary dimensions of new mathematical insights about the nature of physical reality; explores the powerful applications of these symmetry concepts in physics, chemistry, music, and the visual arts. Includes such areas as deterministic chaos and strange attractors, iterated mappings, nonlinear dynamics, Cayley trees, cellular automata, random fractals and related topics.

TOC:
Preface / xiii 1: Introduction / 1 Einstein, Pythagoras, and Simple Similarity / 3 A Self-Similar Array of Self-Preserving Queens / 4 A Self-Similar Snowflake / 7 A New Dimension for Fractals / 9 A Self-Similar Tiling and a ``Non-Euclidean'' Paradox / 13 At the Gates of Cantor's Paradise / 15 The Sierpinski Gasket / 17 Sir Pinski's Game and Deterministic Chaos / 20 Three Bodies Cause Chaos / 25 Strange Attractors, Their Basins, and a Chaos Game 2 / 7 Percolating Random Fractals / 30 Power Laws: from Alvarez to Zipf / 33 Newton's Iteration and How to Abolish Two-Nation Boundaries / 38 Could Minkowski Hear the Shape of a Drum? / 40 Discrete Self-Similarity: Creases and Center Folds / 45 Golden and Silver Means and Hyperbolic Chaos / 49 Winning at Fibonacci Nim / 53 Self-Similar Sequences from Square Lattices / 55 John Horton Conway's ``Death Bet'' / 57 2: Similarity and Dissimilarity / 61 More Than One Scale / 61 To Scale or Not to Scale: A Bit of Biology and Astrophysics / 63 Similarity in Physics: Some Astounding Consequences / 66 Similarity in Concert Halls, Microwaves, and Hydrodynamics / 68 Scaling in Psychology / 70 Acousticians, Alchemy, and Concert Halls / 72 Preference and Dissimilarity: Concert Halls Revisited / 74 3: Self-Similarity --- Discrete, Continuous, Strict, and Otherwise / 81 The Logarithmic Spiral, Cutting Knives, and Wideband Antennas / 89 Some Simple Cases of Self-Similarity / 93 Weierstrass Functions and a Musical Paradox / 96 More Self-Similarity in Music: The Tempered Scales of Bach / 99 The Excellent Relations between the Primes 3, 5, and 7 / 102 4: Power Laws: Endless Sources of Self-Similarity / 103 The Sizes of Cities and Meteorites / 103 A Fifth Force of Attraction / 105 Free of Natural Scales / 107 Bach Composing on All Scales / 107 Birkhoff's Aesthetic Theory / 109 Heisenberg's Hyperbolic Uncertainty Principle / 112 Fractional Exponents / 115 The Peculiar Distribution of the First Digit / 116 The Diameter Exponents of Trees, Rivers, Arteries, and Lungs / 117 5: Noises: White, Pink, Brown, and Black / 121 Pink Noise / 122 Self-Similar Trends on the Stock Market / 126 Black Noises and Nile Floods / 129 Warning: World Warming / 131 Fractional Integration: A Modem Tool / 131 Brownian Mountains / 133 Radon Transform and Computer Tomography / 134 Fresh and Tired Mountains / 135 6: Brownian Motion, Gambling Losses, and Intergalactic Voids: Random Fractals Par Excellence / 139 The Brownian Beast Tamed / 140 Brownian Motion as a Fractal / 141 How Many Molecules? / 143 The Spectrum of Brownian Motion / 144 The Gambler's Ruin, Random Walks, and Information Theory / 145 Counterintuition Runs Rampant in Random Runs / 146 More Food for Fair Thought / 147 The St. Petersburg Paradox / 148 Shannon's Outguessing Machine / 149 The Classical Mechanics of Roulette and Shannon's Channel Capacity / 150 The Clustering of Poverty and Galaxies / 152 Levy Flights through the Universe / 155 Paradoxes from Probabilistic Power Laws / 155 Invariant Distributions: Gauss, Cauchy, and Beyond / 157 7: Cantor Sets: Self-Similarity and Arithmetic Dust / 161 A Comer of Cantor's Paradise / 161 Cantor Sets as Invariant Sets / 165 Symbolic Dynamics and Deterministic Chaos / 166 Devil's Staircases and a Pinball Machine / 167 Mode Locking in Swings and Clocks / 171 The Frustrated Manhattan Pedestrian / 172 Arnold Tongues 17 / 4 8: Fractals in Higher Dimensions and a Digital Sundial / 177 Cartesian Products of Cantor Sets / 177 A Leaky Gasket, Soft Sponges, and Swiss Cheeses / 178 A Cantor-Set Sundial / 181 Fat Fractals / 183 9: Multifractals: Intimately Intertwined Fractals / 187 The Distributions of People and Ore / 187 Self-Affine Fractals without Holes / 190 The Multifractal Spectrum: Turbulence and Diffusion-Limited Aggregation / 193 Viscous Fingering / 199 Multifractals on Fractals / 200 Fractal Dimensions from Generalized Entropies / 203 The Relation between the Multifractal Spectrum $f(alpha )$ and the Mass Exponents $(q)$ / 205 Strange Attractors as Multifractals / 206 A Greedy Algorithm for Unfavorable Odds / 207 10: Some Practical Fractals and Their Measurement / 211 Dimensions from Box Counting / 213 The Mass Dimension / 215 The Correlation Dimension / 220 Infinitely Many Dimensions / 220 The Determination of Fractal Dimensions from Time Series / 223 Abstract Concrete / 224 Fractal Interfaces Enforce Fractional Frequency Exponents / 225 The Fractal Dimensions of Fracture Surfaces / 230 The Fractal Shapes of Clouds and Rain Areas / 231 Cluster Agglomeration / 232 Diffraction from Fractals / 233 11: Iteration, Strange Mappings, and a Billion Digits for Pi / 237 Looking for Zeros and Encountering Chaos / 239 The Strange Sets of Julia / 243 A Multifractal Julia Set / 245 The Beauty of Broken Linear Relationships / 249 The Baker's Transformation and Digital Musical Chairs / 251 Arnol'd's Cat Map / 253 A Billion Digits for $pi $ / 257 Bushes and Flowers from Iterations / 259 12: A Self-Similar Sequence, the Logistic Parabola, and Symbolic Dynamics / 263 Self-Similarity from the Integers / 264 The Logistic Parabola and Period Doubling / 268 Self-Similarity in the Logistic Parabola / 272 The Scaling of the Growth Parameter / 274 Self-Similar Symbolic Dynamics / 277 Periodic Windows Embedded in Chaos / 279 The Parenting of New Orbits / 282 The Calculation of the Growth Parameters for Different Orbits / 286 Tangent Bifurcations, Intermittency, and I/f Noise / 289 A Case of Complete Chaos / 291 The Mandelbrot Set / 295 The Julia Sets of the Complex Quadratic Map / 297 13: A Forbidden Symmetry, Fibonacci's Rabbits, and a New State of Matter / 301 The Forbidden Fivefold Symmetry / 301 Long-Range Order from Neighborly Interactions / 304 Generation of the Rabbit Sequence from the Fibonacci Number System / 307 The Self-Similar Spectrum of the Rabbit Sequence / 308 Self-Similarity in the Rabbit Sequence / 310 A One-Dimensional Quasiperiodic Lattice / 310 Self-Similarity from Projections / 311 More Forbidden Symmetries / 315 14: Periodic and Quasiperiodic Structures in Space --- The route to Spatial Chaos / 319 Periodicity and Quasiperiodicity in Space / 320 The Devil's Staircase for Ising Spins / 321 Quasiperiodic Spatial Distributions / 322 Beatty Sequence Spins / 325 The Scaling Laws for Quasiperiodic Spins / 329 Self-Similar Winding Numbers / 330 Circle Maps and Arnold Tongues / 331 Mediants, Farey Sequences, and the Farey Tree / 334 The Golden-Mean Route to Chaos / 340 15: Percolation: From Forest Fires to Epidemics / 345 Critical Conflagration on a Square Lattice / 346 Universality / 350 The Critical Density / 353 The Fractal Perimeters of Percolation / 353 Finite-Size Scaling / 354 16: Phase Transitions and Renormalization / 357 A First-Order Markov Process / 357 Self-Similar and Non-Self-Similar Markov Processes / 358 The Scaling of Markov Output's / 360 Renormalization and Hierarchical Lattices / 362 The Percolation Threshold of the Bethe Lattice / 363 A Simple Renormalization / 367 17: Cellular Automata / 371 The Game of Life / 373 Cellular Growth and Decay / 375 Biological Pattern Formation / 382 Self-Similarity from a Cellular Automaton / 383 A Catalytic Converter as a Cellular Automaton / 386 Pascal's Triangle Modulo $N$ / 387 Bak's Self-Organized Critical Sandpiles / 389 Appendix / 391 References / 395 Author Index / 411 Subject Index / 417

rawabstract:
Reveals the extraordinary dimensions of new mathematical insights about the nature of physical reality; explores the powerful applications of these symmetry concepts in physics, chemistry, music, and the visual arts. Includes such areas as deterministic chaos and strange attractors, iterated mappings, nonlinear dynamics, Cayley trees, cellular automata, random fractals and related topics.

shortTOC:
Introduction Similarity and dissimilarity Self-similarity --- discrete, continuous, strict, and otherwise Power laws: endless sources of self-similarity Noises: white, pink, brown, and black Brownian motion, gambling losses, and intergalactic voids: random fractals par excellence Cantor sets: self-similarity and arithmetic dust Fractals in higher dimensions and a digital sundial Multifractals: intimately intertwined fractals Some practical fractals and their measurement Iteration, strange mappings, and a billion digits for $pi $ A self-similar sequence, the logistic parabola, and symbolic dynamics A forbidden symmetry, Fibonacci's rabbits, and a new state of matter Periodic and quasiperiodic structures in space --- the route to spatial chaos Percolation: from forest fires to epidemics Phase transitions and renormalization Cellular automata

rawshortTOC:
Introduction \\ Similarity and dissimilarity \\ Self-similarity --- discrete, continuous, strict, and otherwise \\ Power laws: endless sources of self-similarity \\ Noises: white, pink, brown, and black \\ Brownian motion, gambling losses, and intergalactic voids: random fractals par excellence \\ Cantor sets: self-similarity and arithmetic dust \\ Fractals in higher dimensions and a digital sundial \\ Multifractals: intimately intertwined fractals \\ Some practical fractals and their measurement \\ Iteration, strange mappings, and a billion digits for $\pi$ \\ A self-similar sequence, the logistic parabola, and symbolic dynamics \\ A forbidden symmetry, Fibonacci's rabbits, and a new state of matter \\ Periodic and quasiperiodic structures in space --- the route to spatial chaos \\ Percolation: from forest fires to epidemics \\ Phase transitions and renormalization \\ Cellular automata

rawTOC:
Preface / xiii \\ 1: Introduction / 1 \\ Einstein, Pythagoras, and Simple Similarity / 3 \\ A Self-Similar Array of Self-Preserving Queens / 4 \\ A Self-Similar Snowflake / 7 \\ A New Dimension for Fractals / 9 \\ A Self-Similar Tiling and a ``Non-Euclidean'' Paradox / 13 \\ At the Gates of Cantor's Paradise / 15 \\ The Sierpinski Gasket / 17 \\ Sir Pinski's Game and Deterministic Chaos / 20 \\ Three Bodies Cause Chaos / 25 \\ Strange Attractors, Their Basins, and a Chaos Game 2 / 7 \\ Percolating Random Fractals / 30 \\ Power Laws: from Alvarez to Zipf / 33 \\ Newton's Iteration and How to Abolish Two-Nation Boundaries / 38 \\ Could Minkowski Hear the Shape of a Drum? / 40 \\ Discrete Self-Similarity: Creases and Center Folds / 45 \\ Golden and Silver Means and Hyperbolic Chaos / 49 \\ Winning at Fibonacci Nim / 53 \\ Self-Similar Sequences from Square Lattices / 55 \\ John Horton Conway's ``Death Bet'' / 57 \\ 2: Similarity and Dissimilarity / 61 \\ More Than One Scale / 61 \\ To Scale or Not to Scale: A Bit of Biology and Astrophysics / 63 \\ Similarity in Physics: Some Astounding Consequences / 66 \\ Similarity in Concert Halls, Microwaves, and Hydrodynamics / 68 \\ Scaling in Psychology / 70 \\ Acousticians, Alchemy, and Concert Halls / 72 \\ Preference and Dissimilarity: Concert Halls Revisited / 74 \\ 3: Self-Similarity --- Discrete, Continuous, Strict, and Otherwise / 81 \\ The Logarithmic Spiral, Cutting Knives, and Wideband Antennas / 89 \\ Some Simple Cases of Self-Similarity / 93 \\ Weierstrass Functions and a Musical Paradox / 96 \\ More Self-Similarity in Music: The Tempered Scales of Bach / 99 \\ The Excellent Relations between the Primes 3, 5, and 7 / 102 \\ 4: Power Laws: Endless Sources of Self-Similarity / 103 \\ The Sizes of Cities and Meteorites / 103 \\ A Fifth Force of Attraction / 105 \\ Free of Natural Scales / 107 \\ Bach Composing on All Scales / 107 \\ Birkhoff's Aesthetic Theory / 109 \\ Heisenberg's Hyperbolic Uncertainty Principle / 112 \\ Fractional Exponents / 115 \\ The Peculiar Distribution of the First Digit / 116 \\ The Diameter Exponents of Trees, Rivers, Arteries, and Lungs / 117 \\ 5: Noises: White, Pink, Brown, and Black / 121 \\ Pink Noise / 122 \\ Self-Similar Trends on the Stock Market / 126 \\ Black Noises and Nile Floods / 129 \\ Warning: World Warming / 131 \\ Fractional Integration: A Modem Tool / 131 \\ Brownian Mountains / 133 \\ Radon Transform and Computer Tomography / 134 \\ Fresh and Tired Mountains / 135 \\ 6: Brownian Motion, Gambling Losses, and Intergalactic Voids: Random Fractals Par Excellence / 139 \\ The Brownian Beast Tamed / 140 \\ Brownian Motion as a Fractal / 141 \\ How Many Molecules? / 143 \\ The Spectrum of Brownian Motion / 144 \\ The Gambler's Ruin, Random Walks, and Information Theory / 145 \\ Counterintuition Runs Rampant in Random Runs / 146 \\ More Food for Fair Thought / 147 \\ The St. Petersburg Paradox / 148 \\ Shannon's Outguessing Machine / 149 \\ The Classical Mechanics of Roulette and Shannon's Channel Capacity / 150 \\ The Clustering of Poverty and Galaxies / 152 \\ Levy Flights through the Universe / 155 \\ Paradoxes from Probabilistic Power Laws / 155 \\ Invariant Distributions: Gauss, Cauchy, and Beyond / 157 \\ 7: Cantor Sets: Self-Similarity and Arithmetic Dust / 161 \\ A Comer of Cantor's Paradise / 161 \\ Cantor Sets as Invariant Sets / 165 \\ Symbolic Dynamics and Deterministic Chaos / 166 \\ Devil's Staircases and a Pinball Machine / 167 \\ Mode Locking in Swings and Clocks / 171 \\ The Frustrated Manhattan Pedestrian / 172 \\ Arnold Tongues 17 / 4 \\ 8: Fractals in Higher Dimensions and a Digital Sundial / 177 \\ Cartesian Products of Cantor Sets / 177 \\ A Leaky Gasket, Soft Sponges, and Swiss Cheeses / 178 \\ A Cantor-Set Sundial / 181 \\ Fat Fractals / 183 \\ 9: Multifractals: Intimately Intertwined Fractals / 187 \\ The Distributions of People and Ore / 187 \\ Self-Affine Fractals without Holes / 190 \\ The Multifractal Spectrum: Turbulence and Diffusion-Limited Aggregation / 193 \\ Viscous Fingering / 199 \\ Multifractals on Fractals / 200 \\ Fractal Dimensions from Generalized Entropies / 203 \\ The Relation between the Multifractal Spectrum $f(\alpha)$ and the Mass Exponents $(q)$ / 205 \\ Strange Attractors as Multifractals / 206 \\ A Greedy Algorithm for Unfavorable Odds / 207 \\ 10: Some Practical Fractals and Their Measurement / 211 \\ Dimensions from Box Counting / 213 \\ The Mass Dimension / 215 \\ The Correlation Dimension / 220 \\ Infinitely Many Dimensions / 220 \\ The Determination of Fractal Dimensions from Time Series / 223 \\ Abstract Concrete / 224 \\ Fractal Interfaces Enforce Fractional Frequency Exponents / 225 \\ The Fractal Dimensions of Fracture Surfaces / 230 \\ The Fractal Shapes of Clouds and Rain Areas / 231 \\ Cluster Agglomeration / 232 \\ Diffraction from Fractals / 233 \\ 11: Iteration, Strange Mappings, and a Billion Digits for Pi / 237 \\ Looking for Zeros and Encountering Chaos / 239 \\ The Strange Sets of Julia / 243 \\ A Multifractal Julia Set / 245 \\ The Beauty of Broken Linear Relationships / 249 \\ The Baker's Transformation and Digital Musical Chairs / 251 \\ Arnol'd's Cat Map / 253 \\ A Billion Digits for $\pi$ / 257 \\ Bushes and Flowers from Iterations / 259 \\ 12: A Self-Similar Sequence, the Logistic Parabola, and Symbolic Dynamics / 263 \\ Self-Similarity from the Integers / 264 \\ The Logistic Parabola and Period Doubling / 268 \\ Self-Similarity in the Logistic Parabola / 272 \\ The Scaling of the Growth Parameter / 274 \\ Self-Similar Symbolic Dynamics / 277 \\ Periodic Windows Embedded in Chaos / 279 \\ The Parenting of New Orbits / 282 \\ The Calculation of the Growth Parameters for Different Orbits / 286 \\ Tangent Bifurcations, Intermittency, and I/f Noise / 289 \\ A Case of Complete Chaos / 291 \\ The Mandelbrot Set / 295 \\ The Julia Sets of the Complex Quadratic Map / 297 \\ 13: A Forbidden Symmetry, Fibonacci's Rabbits, and a New State of Matter / 301 \\ The Forbidden Fivefold Symmetry / 301 \\ Long-Range Order from Neighborly Interactions / 304 \\ Generation of the Rabbit Sequence from the Fibonacci Number System / 307 \\ The Self-Similar Spectrum of the Rabbit Sequence / 308 \\ Self-Similarity in the Rabbit Sequence / 310 \\ A One-Dimensional Quasiperiodic Lattice / 310 \\ Self-Similarity from Projections / 311 \\ More Forbidden Symmetries / 315 \\ 14: Periodic and Quasiperiodic Structures in Space --- The route to Spatial Chaos / 319 \\ Periodicity and Quasiperiodicity in Space / 320 \\ The Devil's Staircase for Ising Spins / 321 \\ Quasiperiodic Spatial Distributions / 322 \\ Beatty Sequence Spins / 325 \\ The Scaling Laws for Quasiperiodic Spins / 329 \\ Self-Similar Winding Numbers / 330 \\ Circle Maps and Arnold Tongues / 331 \\ Mediants, Farey Sequences, and the Farey Tree / 334 \\ The Golden-Mean Route to Chaos / 340 \\ 15: Percolation: From Forest Fires to Epidemics / 345 \\ Critical Conflagration on a Square Lattice / 346 \\ Universality / 350 \\ The Critical Density / 353 \\ The Fractal Perimeters of Percolation / 353 \\ Finite-Size Scaling / 354 \\ 16: Phase Transitions and Renormalization / 357 \\ A First-Order Markov Process / 357 \\ Self-Similar and Non-Self-Similar Markov Processes / 358 \\ The Scaling of Markov Output's / 360 \\ Renormalization and Hierarchical Lattices / 362 \\ The Percolation Threshold of the Bethe Lattice / 363 \\ A Simple Renormalization / 367 \\ 17: Cellular Automata / 371 \\ The Game of Life / 373 \\ Cellular Growth and Decay / 375 \\ Biological Pattern Formation / 382 \\ Self-Similarity from a Cellular Automaton / 383 \\ A Catalytic Converter as a Cellular Automaton / 386 \\ Pascal's Triangle Modulo $N$ / 387 \\ Bak's Self-Organized Critical Sandpiles / 389 \\ Appendix / 391 \\ References / 395 \\ Author Index / 411 \\ Subject Index / 417

entry:
@Book{Schroeder:1991:FCP,
  author =       "Manfred Schroeder",
  title =        "Fractals, Chaos, Power Laws",
  publisher =    pub-W-H-FREEMAN,
  address =      pub-W-H-FREEMAN:adr,
  pages =        "xviii + 429",
  year =         "1991",
  ISBN =         "0-671-74217-5, 0-7167-2136-8, 0-7167-2357-3",
  ISBN-13 =      "978-0-671-74217-1, 978-0-7167-2136-9,
                 978-0-7167-2357-8",
  LCCN =         "QD921 .S3 1990",
  bibdate =      "Wed Dec 15 10:41:35 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/h/heisenberg-werner.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/s/shannon-claude-elwood.bib;
                 https://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
                 https://www.math.utah.edu/pub/tex/bib/fibquart.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/pi.bib",
  abstract =     "Reveals the extraordinary dimensions of new
                 mathematical insights about the nature of physical
                 reality; explores the powerful applications of these
                 symmetry concepts in physics, chemistry, music, and the
                 visual arts. Includes such areas as deterministic chaos
                 and strange attractors, iterated mappings, nonlinear
                 dynamics, Cayley trees, cellular automata, random
                 fractals and related topics.",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "Introduction \\
                 Similarity and dissimilarity \\
                 Self-similarity --- discrete, continuous, strict, and
                 otherwise \\
                 Power laws: endless sources of self-similarity \\
                 Noises: white, pink, brown, and black \\
                 Brownian motion, gambling losses, and intergalactic
                 voids: random fractals par excellence \\
                 Cantor sets: self-similarity and arithmetic dust \\
                 Fractals in higher dimensions and a digital sundial \\
                 Multifractals: intimately intertwined fractals \\
                 Some practical fractals and their measurement \\
                 Iteration, strange mappings, and a billion digits for
                 $\pi$ \\
                 A self-similar sequence, the logistic parabola, and
                 symbolic dynamics \\
                 A forbidden symmetry, Fibonacci's rabbits, and a new
                 state of matter \\
                 Periodic and quasiperiodic structures in space --- the
                 route to spatial chaos \\
                 Percolation: from forest fires to epidemics \\
                 Phase transitions and renormalization \\
                 Cellular automata",
  tableofcontents = "Preface / xiii \\
                 1: Introduction / 1 \\
                 Einstein, Pythagoras, and Simple Similarity / 3 \\
                 A Self-Similar Array of Self-Preserving Queens / 4 \\
                 A Self-Similar Snowflake / 7 \\
                 A New Dimension for Fractals / 9 \\
                 A Self-Similar Tiling and a ``Non-Euclidean'' Paradox /
                 13 \\
                 At the Gates of Cantor's Paradise / 15 \\
                 The Sierpinski Gasket / 17 \\
                 Sir Pinski's Game and Deterministic Chaos / 20 \\
                 Three Bodies Cause Chaos / 25 \\
                 Strange Attractors, Their Basins, and a Chaos Game 2 /
                 7 \\
                 Percolating Random Fractals / 30 \\
                 Power Laws: from Alvarez to Zipf / 33 \\
                 Newton's Iteration and How to Abolish Two-Nation
                 Boundaries / 38 \\
                 Could Minkowski Hear the Shape of a Drum? / 40 \\
                 Discrete Self-Similarity: Creases and Center Folds / 45
                 \\
                 Golden and Silver Means and Hyperbolic Chaos / 49 \\
                 Winning at Fibonacci Nim / 53 \\
                 Self-Similar Sequences from Square Lattices / 55 \\
                 John Horton Conway's ``Death Bet'' / 57 \\
                 2: Similarity and Dissimilarity / 61 \\
                 More Than One Scale / 61 \\
                 To Scale or Not to Scale: A Bit of Biology and
                 Astrophysics / 63 \\
                 Similarity in Physics: Some Astounding Consequences /
                 66 \\
                 Similarity in Concert Halls, Microwaves, and
                 Hydrodynamics / 68 \\
                 Scaling in Psychology / 70 \\
                 Acousticians, Alchemy, and Concert Halls / 72 \\
                 Preference and Dissimilarity: Concert Halls Revisited /
                 74 \\
                 3: Self-Similarity --- Discrete, Continuous, Strict,
                 and Otherwise / 81 \\
                 The Logarithmic Spiral, Cutting Knives, and Wideband
                 Antennas / 89 \\
                 Some Simple Cases of Self-Similarity / 93 \\
                 Weierstrass Functions and a Musical Paradox / 96 \\
                 More Self-Similarity in Music: The Tempered Scales of
                 Bach / 99 \\
                 The Excellent Relations between the Primes 3, 5, and 7
                 / 102 \\
                 4: Power Laws: Endless Sources of Self-Similarity / 103
                 \\
                 The Sizes of Cities and Meteorites / 103 \\
                 A Fifth Force of Attraction / 105 \\
                 Free of Natural Scales / 107 \\
                 Bach Composing on All Scales / 107 \\
                 Birkhoff's Aesthetic Theory / 109 \\
                 Heisenberg's Hyperbolic Uncertainty Principle / 112 \\
                 Fractional Exponents / 115 \\
                 The Peculiar Distribution of the First Digit / 116 \\
                 The Diameter Exponents of Trees, Rivers, Arteries, and
                 Lungs / 117 \\
                 5: Noises: White, Pink, Brown, and Black / 121 \\
                 Pink Noise / 122 \\
                 Self-Similar Trends on the Stock Market / 126 \\
                 Black Noises and Nile Floods / 129 \\
                 Warning: World Warming / 131 \\
                 Fractional Integration: A Modem Tool / 131 \\
                 Brownian Mountains / 133 \\
                 Radon Transform and Computer Tomography / 134 \\
                 Fresh and Tired Mountains / 135 \\
                 6: Brownian Motion, Gambling Losses, and Intergalactic
                 Voids: Random Fractals Par Excellence / 139 \\
                 The Brownian Beast Tamed / 140 \\
                 Brownian Motion as a Fractal / 141 \\
                 How Many Molecules? / 143 \\
                 The Spectrum of Brownian Motion / 144 \\
                 The Gambler's Ruin, Random Walks, and Information
                 Theory / 145 \\
                 Counterintuition Runs Rampant in Random Runs / 146 \\
                 More Food for Fair Thought / 147 \\
                 The St. Petersburg Paradox / 148 \\
                 Shannon's Outguessing Machine / 149 \\
                 The Classical Mechanics of Roulette and Shannon's
                 Channel Capacity / 150 \\
                 The Clustering of Poverty and Galaxies / 152 \\
                 Levy Flights through the Universe / 155 \\
                 Paradoxes from Probabilistic Power Laws / 155 \\
                 Invariant Distributions: Gauss, Cauchy, and Beyond /
                 157 \\
                 7: Cantor Sets: Self-Similarity and Arithmetic Dust /
                 161 \\
                 A Comer of Cantor's Paradise / 161 \\
                 Cantor Sets as Invariant Sets / 165 \\
                 Symbolic Dynamics and Deterministic Chaos / 166 \\
                 Devil's Staircases and a Pinball Machine / 167 \\
                 Mode Locking in Swings and Clocks / 171 \\
                 The Frustrated Manhattan Pedestrian / 172 \\
                 Arnold Tongues 17 / 4 \\
                 8: Fractals in Higher Dimensions and a Digital Sundial
                 / 177 \\
                 Cartesian Products of Cantor Sets / 177 \\
                 A Leaky Gasket, Soft Sponges, and Swiss Cheeses / 178
                 \\
                 A Cantor-Set Sundial / 181 \\
                 Fat Fractals / 183 \\
                 9: Multifractals: Intimately Intertwined Fractals / 187
                 \\
                 The Distributions of People and Ore / 187 \\
                 Self-Affine Fractals without Holes / 190 \\
                 The Multifractal Spectrum: Turbulence and
                 Diffusion-Limited Aggregation / 193 \\
                 Viscous Fingering / 199 \\
                 Multifractals on Fractals / 200 \\
                 Fractal Dimensions from Generalized Entropies / 203 \\
                 The Relation between the Multifractal Spectrum
                 $f(\alpha)$ and the Mass Exponents $(q)$ / 205 \\
                 Strange Attractors as Multifractals / 206 \\
                 A Greedy Algorithm for Unfavorable Odds / 207 \\
                 10: Some Practical Fractals and Their Measurement / 211
                 \\
                 Dimensions from Box Counting / 213 \\
                 The Mass Dimension / 215 \\
                 The Correlation Dimension / 220 \\
                 Infinitely Many Dimensions / 220 \\
                 The Determination of Fractal Dimensions from Time
                 Series / 223 \\
                 Abstract Concrete / 224 \\
                 Fractal Interfaces Enforce Fractional Frequency
                 Exponents / 225 \\
                 The Fractal Dimensions of Fracture Surfaces / 230 \\
                 The Fractal Shapes of Clouds and Rain Areas / 231 \\
                 Cluster Agglomeration / 232 \\
                 Diffraction from Fractals / 233 \\
                 11: Iteration, Strange Mappings, and a Billion Digits
                 for Pi / 237 \\
                 Looking for Zeros and Encountering Chaos / 239 \\
                 The Strange Sets of Julia / 243 \\
                 A Multifractal Julia Set / 245 \\
                 The Beauty of Broken Linear Relationships / 249 \\
                 The Baker's Transformation and Digital Musical Chairs /
                 251 \\
                 Arnol'd's Cat Map / 253 \\
                 A Billion Digits for $\pi$ / 257 \\
                 Bushes and Flowers from Iterations / 259 \\
                 12: A Self-Similar Sequence, the Logistic Parabola, and
                 Symbolic Dynamics / 263 \\
                 Self-Similarity from the Integers / 264 \\
                 The Logistic Parabola and Period Doubling / 268 \\
                 Self-Similarity in the Logistic Parabola / 272 \\
                 The Scaling of the Growth Parameter / 274 \\
                 Self-Similar Symbolic Dynamics / 277 \\
                 Periodic Windows Embedded in Chaos / 279 \\
                 The Parenting of New Orbits / 282 \\
                 The Calculation of the Growth Parameters for Different
                 Orbits / 286 \\
                 Tangent Bifurcations, Intermittency, and I/f Noise /
                 289 \\
                 A Case of Complete Chaos / 291 \\
                 The Mandelbrot Set / 295 \\
                 The Julia Sets of the Complex Quadratic Map / 297 \\
                 13: A Forbidden Symmetry, Fibonacci's Rabbits, and a
                 New State of Matter / 301 \\
                 The Forbidden Fivefold Symmetry / 301 \\
                 Long-Range Order from Neighborly Interactions / 304 \\
                 Generation of the Rabbit Sequence from the Fibonacci
                 Number System / 307 \\
                 The Self-Similar Spectrum of the Rabbit Sequence / 308
                 \\
                 Self-Similarity in the Rabbit Sequence / 310 \\
                 A One-Dimensional Quasiperiodic Lattice / 310 \\
                 Self-Similarity from Projections / 311 \\
                 More Forbidden Symmetries / 315 \\
                 14: Periodic and Quasiperiodic Structures in Space ---
                 The route to Spatial Chaos / 319 \\
                 Periodicity and Quasiperiodicity in Space / 320 \\
                 The Devil's Staircase for Ising Spins / 321 \\
                 Quasiperiodic Spatial Distributions / 322 \\
                 Beatty Sequence Spins / 325 \\
                 The Scaling Laws for Quasiperiodic Spins / 329 \\
                 Self-Similar Winding Numbers / 330 \\
                 Circle Maps and Arnold Tongues / 331 \\
                 Mediants, Farey Sequences, and the Farey Tree / 334 \\
                 The Golden-Mean Route to Chaos / 340 \\
                 15: Percolation: From Forest Fires to Epidemics / 345
                 \\
                 Critical Conflagration on a Square Lattice / 346 \\
                 Universality / 350 \\
                 The Critical Density / 353 \\
                 The Fractal Perimeters of Percolation / 353 \\
                 Finite-Size Scaling / 354 \\
                 16: Phase Transitions and Renormalization / 357 \\
                 A First-Order Markov Process / 357 \\
                 Self-Similar and Non-Self-Similar Markov Processes /
                 358 \\
                 The Scaling of Markov Output's / 360 \\
                 Renormalization and Hierarchical Lattices / 362 \\
                 The Percolation Threshold of the Bethe Lattice / 363
                 \\
                 A Simple Renormalization / 367 \\
                 17: Cellular Automata / 371 \\
                 The Game of Life / 373 \\
                 Cellular Growth and Decay / 375 \\
                 Biological Pattern Formation / 382 \\
                 Self-Similarity from a Cellular Automaton / 383 \\
                 A Catalytic Converter as a Cellular Automaton / 386 \\
                 Pascal's Triangle Modulo $N$ / 387 \\
                 Bak's Self-Organized Critical Sandpiles / 389 \\
                 Appendix / 391 \\
                 References / 395 \\
                 Author Index / 411 \\
                 Subject Index / 417",
}


bibtype: book
filename: master.bib
label: Schroeder:1998:VT
author: William J. Schroeder and Kenneth M. Martin and William E. Lorensen
title: The Visualization Toolkit
publisher: pub-PH
address: pub-PH:adr
edition: Second
pages: xx + 645
year: 1998
ISBN: 0-13-954694-4 OR 0139546944
ISBN13: 978-0-13-954694-5 OR 9780139546945
LCCN: QA76.64.S36 1997
bibdate: Mon Apr 13 10:46:55 1998
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1998.04.13 10:46:55 ???
acknowledgement: ack-nhfb
rawauthor: William J. Schroeder and Kenneth M. Martin and William E. Lorensen
rawtitle: The Visualization Toolkit
note:
With special contributors Lisa Sobierajski Avila, Rick Avila, and C. Charles Law. Includes CD-ROM with vtk-2.0. The most recent release is available on the World-Wide Web at path =http://www.kitware.com/vtk.html=.

TOC:
Introduction Object-oriented design Computer graphics primer The visualization pipeline Basic data representation Fundamental algorithms Advanced computer graphics Color plates Advanced data representation Advanced algorithms Image processing Interpreters and Tcl/Tk Visualization on the web Applications Appendix A: Software guide Appendix B: CD-ROM organization Glossary

rawnote:
With special contributors Lisa Sobierajski Avila, Rick Avila, and C. Charles Law. Includes CD-ROM with vtk-2.0. The most recent release is available on the World-Wide Web at \path=http://www.kitware.com/vtk.html=.

rawTOC:
Introduction \\ Object-oriented design \\ Computer graphics primer \\ The visualization pipeline \\ Basic data representation \\ Fundamental algorithms \\ Advanced computer graphics \\ Color plates \\ Advanced data representation \\ Advanced algorithms \\ Image processing \\ Interpreters and Tcl/Tk \\ Visualization on the web \\ Applications \\ Appendix A: Software guide \\ Appendix B: CD-ROM organization \\ Glossary

entry:
@Book{Schroeder:1998:VT,
  author =       "William J. Schroeder and Kenneth M. Martin and William
                 E. Lorensen",
  title =        "The Visualization Toolkit",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  edition =      "Second",
  pages =        "xx + 645",
  year =         "1998",
  ISBN =         "0-13-954694-4",
  ISBN-13 =      "978-0-13-954694-5",
  LCCN =         "QA76.64.S36 1997",
  bibdate =      "Mon Apr 13 10:46:55 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "With special contributors Lisa Sobierajski Avila, Rick
                 Avila, and C. Charles Law. Includes CD-ROM with
                 vtk-2.0. The most recent release is available on the
                 World-Wide Web at
                 \path=http://www.kitware.com/vtk.html=.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  tableofcontents = "Introduction \\
                 Object-oriented design \\
                 Computer graphics primer \\
                 The visualization pipeline \\
                 Basic data representation \\
                 Fundamental algorithms \\
                 Advanced computer graphics \\
                 Color plates \\
                 Advanced data representation \\
                 Advanced algorithms \\
                 Image processing \\
                 Interpreters and Tcl/Tk \\
                 Visualization on the web \\
                 Applications \\
                 Appendix A: Software guide \\
                 Appendix B: CD-ROM organization \\
                 Glossary",
}


bibtype: book
filename: master.bib
label: Schwarz:1988:ET
author: Norbert Schwarz
title: Einfuhrung in TeX
publisher: pub-AW
address: pub-AW:adr
edition: Second
pages: 272
year: 1988
ISBN: 3-925118-97-7 OR 3925118977
ISBN13: 978-3-925118-97-5 OR 9783925118975
bibdate: Wed Dec 15 18:20:05 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 18:20:05 ???
acknowledgement: ack-nhfb
rawauthor: Norbert Schwarz
rawtitle: Einf{\"u}hrung in {\TeX{}}
entry:
@Book{Schwarz:1988:ET,
  author =       "Norbert Schwarz",
  title =        "Einf{\"u}hrung in {\TeX{}}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Second",
  pages =        "272",
  year =         "1988",
  ISBN =         "3-925118-97-7",
  ISBN-13 =      "978-3-925118-97-5",
  bibdate =      "Wed Dec 15 18:20:05 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "DM 68",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Schweber:2008:EOM
author: S. S. (Silvan S.) Schweber
title: Einstein and Oppenheimer: the meaning of genius
publisher: pub-HARVARD
address: pub-HARVARD:adr
pages: xiv + 412
year: 2008
ISBN: 0-674-02828-7 OR 0674028287
ISBN13: 978-0-674-02828-9 OR 9780674028289
LCCN: QC16.E5 S3285 2008
bibdate: Thu Sep 18 21:33:15 MDT 2008
bibtimestamp: 2008.09.18 21:33:15 MDT
URL: http://www.loc.gov/catdir/toc/ecip082/2007043108.html
acknowledgement: ack-nhfb
subjectdates: 1879--1955; 1904--1967
rawauthor: S. S. (Silvan S.) Schweber
rawtitle: {Einstein} and {Oppenheimer}: the meaning of genius
bibsource:
https://www.math.utah.edu/pub/bibnet/authors/o/oppenheimer-j-robert.bib; https://www.math.utah.edu/pub/tex/bib/einstein.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager

subject:
Einstein, Albert; Oppenheimer, J. Robert; physicists; intellectual Life; 20th Century; psychology; science; history

TOC:
Albert Einstein and nuclear weapons Albert Einstein and the founding of Brandeis University J. Robert Oppenheimer: proteus unbound J. Robert Oppenheimer and American pragmatism Einstein, Oppenheimer, and the extension of physics Einstein, Oppenheimer, and the meaning of community

rawTOC:
Albert Einstein and nuclear weapons \\ Albert Einstein and the founding of Brandeis University \\ J. Robert Oppenheimer: proteus unbound \\ J. Robert Oppenheimer and American pragmatism \\ Einstein, Oppenheimer, and the extension of physics \\ Einstein, Oppenheimer, and the meaning of community

entry:
@Book{Schweber:2008:EOM,
  author =       "S. S. (Silvan S.) Schweber",
  title =        "{Einstein} and {Oppenheimer}: the meaning of genius",
  publisher =    pub-HARVARD,
  address =      pub-HARVARD:adr,
  pages =        "xiv + 412",
  year =         "2008",
  ISBN =         "0-674-02828-7",
  ISBN-13 =      "978-0-674-02828-9",
  LCCN =         "QC16.E5 S3285 2008",
  bibdate =      "Thu Sep 18 21:33:15 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/o/oppenheimer-j-robert.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/toc/ecip082/2007043108.html",
  acknowledgement = ack-nhfb,
  subject =      "Einstein, Albert; Oppenheimer, J. Robert; physicists;
                 intellectual Life; 20th Century; psychology; science;
                 history",
  subject-dates = "1879--1955; 1904--1967",
  tableofcontents = "Albert Einstein and nuclear weapons \\
                 Albert Einstein and the founding of Brandeis University
                 \\
                 J. Robert Oppenheimer: proteus unbound \\
                 J. Robert Oppenheimer and American pragmatism \\
                 Einstein, Oppenheimer, and the extension of physics \\
                 Einstein, Oppenheimer, and the meaning of community",
}


bibtype: book
filename: master.bib
label: Schweber:2012:NFM
author: S. S. (Silvan S.) Schweber
title: Nuclear forces: the making of the physicist Hans Bethe
publisher: pub-HARVARD
address: pub-HARVARD:adr
pages: viii + 579 + 12
year: 2012
ISBN: 0-674-06587-5 (hardcover) OR 0674065875 (hardcover)
ISBN13: 978-0-674-06587-1 (hardcover) OR 9780674065871 (hardcover)
LCCN: QC774.B4 S39 2012
bibdate: Mon Nov 19 13:35:16 MST 2012
bibtimestamp: 2012.11.19 13:35:16 MST
subject: Bethe, Hans A; (Hans Albrecht); Nuclear physicists; Biography
acknowledgement: ack-nhfb
subjectdates: 1906--2005
rawauthor: S. S. (Silvan S.) Schweber
rawtitle: Nuclear forces: the making of the physicist {Hans Bethe}
bibsource:
https://www.math.utah.edu/pub/bibnet/authors/b/bethe-hans.bib; https://www.math.utah.edu/pub/tex/bib/bjhs2010.bib; https://www.math.utah.edu/pub/tex/bib/hsns.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; jenson.stanford.edu:2210/unicorn; library.ox.ac.uk:210/ADVANCE

TOC:
Growing Up Maturing Becoming Bethe Beyond the Doctorate: 1928--1933 England, 1933--1935 Hilde Levi Cornell University The Happy Thirties Rose Ewald Bethe Conclusion: Past and Future Appendix A: The Bethe Family Genealogy Appendix B: Courses Taken at Frankfurt University Appendix C: A Brief History of the Genesis of Quantum Mechanics Appendix D: Courses Taken at Munich University Appendix E: Bethe's Doctoral Thesis Appendix F: The Habilitationsschrift Defense

rawTOC:
Growing Up \\ Maturing \\ Becoming Bethe \\ Beyond the Doctorate: 1928--1933 \\ England, 1933--1935 \\ Hilde Levi \\ Cornell University \\ The Happy Thirties \\ Rose Ewald Bethe \\ Conclusion: Past and Future \\ Appendix A: The Bethe Family Genealogy \\ Appendix B: Courses Taken at Frankfurt University \\ Appendix C: A Brief History of the Genesis of Quantum Mechanics \\ Appendix D: Courses Taken at Munich University \\ Appendix E: Bethe's Doctoral Thesis \\ Appendix F: The Habilitationsschrift Defense

entry:
@Book{Schweber:2012:NFM,
  author =       "S. S. (Silvan S.) Schweber",
  title =        "Nuclear forces: the making of the physicist {Hans
                 Bethe}",
  publisher =    pub-HARVARD,
  address =      pub-HARVARD:adr,
  pages =        "viii + 579 + 12",
  year =         "2012",
  ISBN =         "0-674-06587-5 (hardcover)",
  ISBN-13 =      "978-0-674-06587-1 (hardcover)",
  LCCN =         "QC774.B4 S39 2012",
  bibdate =      "Mon Nov 19 13:35:16 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/bethe-hans.bib;
                 https://www.math.utah.edu/pub/tex/bib/bjhs2010.bib;
                 https://www.math.utah.edu/pub/tex/bib/hsns.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 jenson.stanford.edu:2210/unicorn;
                 library.ox.ac.uk:210/ADVANCE",
  price =        "\pounds 25.95",
  acknowledgement = ack-nhfb,
  subject =      "Bethe, Hans A; (Hans Albrecht); Nuclear physicists;
                 Biography",
  subject-dates = "1906--2005",
  tableofcontents = "Growing Up \\
                 Maturing \\
                 Becoming Bethe \\
                 Beyond the Doctorate: 1928--1933 \\
                 England, 1933--1935 \\
                 Hilde Levi \\
                 Cornell University \\
                 The Happy Thirties \\
                 Rose Ewald Bethe \\
                 Conclusion: Past and Future \\
                 Appendix A: The Bethe Family Genealogy \\
                 Appendix B: Courses Taken at Frankfurt University \\
                 Appendix C: A Brief History of the Genesis of Quantum
                 Mechanics \\
                 Appendix D: Courses Taken at Munich University \\
                 Appendix E: Bethe's Doctoral Thesis \\
                 Appendix F: The Habilitationsschrift Defense",
}


bibtype: book
filename: master.bib
label: Schwichtenberg:2015:PS
author: Jakob Schwichtenberg
title: Physics from Symmetry
publisher: pub-SV
address: pub-SV:adr
pages: xix + 279
year: 2015
ISBN: 3-319-19200-0, 3-319-66631-2 (e-book) OR 3319192000, 3319666312 (ebook)
ISBN13: 978-3-319-19200-0, 978-3-319-66631-0 (e-book) OR 9783319192000, 9783319666310 (ebook)
LCCN: QC174.17.S9 S4 2015eb
bibdate: Wed Jan 27 13:21:23 MST 2021
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2021.01.27 13:21:23 MST
series: Undergraduate lecture notes in physics
subject: Symmetry (Physics); Symmetrie; Physik
acknowledgement: ack-nhfb
rawauthor: Jakob Schwichtenberg
rawtitle: Physics from Symmetry
abstract:
This is a textbook that derives the fundamental theories of physics from symmetry. It starts by introducing, in a completely self-contained way, all mathematical tools needed to use symmetry ideas in physics. Thereafter, these tools are put into action and by using symmetry constraints, the fundamental equations of Quantum Mechanics, Quantum Field Theory, Electromagnetism, and Classical Mechanics are derived. As a result, the reader is able to understand the basic assumptions behind, and the connections between the modern theories of physics. The book concludes with first applications of the previously derived equations.

TOC:
Special Relativity Lie group theory The framework Measuring nature Free theory Interaction theory Quantum mechanics Quantum field theory Classical mechanics Electrodynamics Gravity Closing Words Appendices Vector calculus Calculus Linear algebra Additional mathematical notions

rawabstract:
This is a textbook that derives the fundamental theories of physics from symmetry. It starts by introducing, in a completely self-contained way, all mathematical tools needed to use symmetry ideas in physics. Thereafter, these tools are put into action and by using symmetry constraints, the fundamental equations of Quantum Mechanics, Quantum Field Theory, Electromagnetism, and Classical Mechanics are derived. As a result, the reader is able to understand the basic assumptions behind, and the connections between the modern theories of physics. The book concludes with first applications of the previously derived equations.

rawTOC:
Special Relativity \\ Lie group theory \\ The framework \\ Measuring nature \\ Free theory \\ Interaction theory \\ Quantum mechanics \\ Quantum field theory \\ Classical mechanics \\ Electrodynamics \\ Gravity \\ Closing Words \\ Appendices \\ Vector calculus \\ Calculus \\ Linear algebra \\ Additional mathematical notions

entry:
@Book{Schwichtenberg:2015:PS,
  author =       "Jakob Schwichtenberg",
  title =        "Physics from Symmetry",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xix + 279",
  year =         "2015",
  ISBN =         "3-319-19200-0, 3-319-66631-2 (e-book)",
  ISBN-13 =      "978-3-319-19200-0, 978-3-319-66631-0 (e-book)",
  LCCN =         "QC174.17.S9 S4 2015eb",
  bibdate =      "Wed Jan 27 13:21:23 MST 2021",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Undergraduate lecture notes in physics",
  abstract =     "This is a textbook that derives the fundamental
                 theories of physics from symmetry. It starts by
                 introducing, in a completely self-contained way, all
                 mathematical tools needed to use symmetry ideas in
                 physics. Thereafter, these tools are put into action
                 and by using symmetry constraints, the fundamental
                 equations of Quantum Mechanics, Quantum Field Theory,
                 Electromagnetism, and Classical Mechanics are derived.
                 As a result, the reader is able to understand the basic
                 assumptions behind, and the connections between the
                 modern theories of physics. The book concludes with
                 first applications of the previously derived
                 equations.",
  acknowledgement = ack-nhfb,
  subject =      "Symmetry (Physics); Symmetrie; Physik",
  tableofcontents = "Special Relativity \\
                 Lie group theory \\
                 The framework \\
                 Measuring nature \\
                 Free theory \\
                 Interaction theory \\
                 Quantum mechanics \\
                 Quantum field theory \\
                 Classical mechanics \\
                 Electrodynamics \\
                 Gravity \\
                 Closing Words \\
                 Appendices \\
                 Vector calculus \\
                 Calculus \\
                 Linear algebra \\
                 Additional mathematical notions",
}


bibtype: book
filename: master.bib
label: Schwinger:2015:AM
author: Julian Schwinger
title: On Angular Momentum
publisher: pub-DOVER
address: pub-DOVER:adr
pages: 51
year: 2015
ISBN: 0-486-78810-5 (paperback) OR 0486788105 (paperback)
ISBN13: 978-0-486-78810-4 (paperback) OR 9780486788104 (paperback)
LCCN: QC793.3.A5 S39 2015
bibdate: Sat Apr 7 18:17:43 MDT 2018
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2018.04.07 18:17:43 MDT
subject: Angular momentum (Nuclear physics); Dynamics of a particle
acknowledgement: ack-nhfb
authordates: 1918--1994
rawauthor: Julian Schwinger
rawtitle: On Angular Momentum
URL:
http://www.loc.gov/catdir/enhancements/fy1503/2014036399-b.html; http://www.loc.gov/catdir/enhancements/fy1503/2014036399-d.html

abstract:
A concise treatment of angular momentum by an important American physicist, this major work was first published under the auspices of the United States Atomic Energy Commission in 1952 and is finally available to a general audience of students and professionals in the field. Advanced undergraduates and graduate students of physics will particularly benefit from its teachings. One of the most prominent American physicists of the twentieth century, Julian Schwinger (1918--94) taught at Harvard, MIT, and UCLA, among other institutions. In addition to his many other awards, Schwinger, jointly with Richard Feynman and Shinichiro Tomonaga, received the Nobel Prize in Physics in 1965 for his work in quantum electrodynamics.

remark:
Originally published: Oak Ridge, Tenn.: U.S. Atomic Energy Commission. Distributed by Technical Information Service, 1952. (U.S. Atomic Energy Commission report; NYO 3071).

TOC:
1. Introduction 2. Rotations 3. Addition of two angular momenta 4. Three and four angular momenta 5. Tensor operators

rawabstract:
A concise treatment of angular momentum by an important American physicist, this major work was first published under the auspices of the United States Atomic Energy Commission in 1952 and is finally available to a general audience of students and professionals in the field. Advanced undergraduates and graduate students of physics will particularly benefit from its teachings. One of the most prominent American physicists of the twentieth century, Julian Schwinger (1918--94) taught at Harvard, MIT, and UCLA, among other institutions. In addition to his many other awards, Schwinger, jointly with Richard Feynman and Shinichiro Tomonaga, received the Nobel Prize in Physics in 1965 for his work in quantum electrodynamics.

rawTOC:
1. Introduction \\ 2. Rotations \\ 3. Addition of two angular momenta \\ 4. Three and four angular momenta \\ 5. Tensor operators

entry:
@Book{Schwinger:2015:AM,
  author =       "Julian Schwinger",
  title =        "On Angular Momentum",
  publisher =    pub-DOVER,
  address =      pub-DOVER:adr,
  pages =        "51",
  year =         "2015",
  ISBN =         "0-486-78810-5 (paperback)",
  ISBN-13 =      "978-0-486-78810-4 (paperback)",
  LCCN =         "QC793.3.A5 S39 2015",
  bibdate =      "Sat Apr 7 18:17:43 MDT 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy1503/2014036399-b.html;
                 http://www.loc.gov/catdir/enhancements/fy1503/2014036399-d.html",
  abstract =     "A concise treatment of angular momentum by an
                 important American physicist, this major work was first
                 published under the auspices of the United States
                 Atomic Energy Commission in 1952 and is finally
                 available to a general audience of students and
                 professionals in the field. Advanced undergraduates and
                 graduate students of physics will particularly benefit
                 from its teachings. One of the most prominent American
                 physicists of the twentieth century, Julian Schwinger
                 (1918--94) taught at Harvard, MIT, and UCLA, among
                 other institutions. In addition to his many other
                 awards, Schwinger, jointly with Richard Feynman and
                 Shinichiro Tomonaga, received the Nobel Prize in
                 Physics in 1965 for his work in quantum
                 electrodynamics.",
  acknowledgement = ack-nhfb,
  author-dates = "1918--1994",
  libnote =      "Not in my library.",
  remark =       "Originally published: Oak Ridge, Tenn.: U.S. Atomic
                 Energy Commission. Distributed by Technical Information
                 Service, 1952. (U.S. Atomic Energy Commission report;
                 NYO 3071).",
  subject =      "Angular momentum (Nuclear physics); Dynamics of a
                 particle",
  tableofcontents = "1. Introduction \\
                 2. Rotations \\
                 3. Addition of two angular momenta \\
                 4. Three and four angular momenta \\
                 5. Tensor operators",
}


bibtype: book
filename: master.bib
label: Scott:1982:IIC
author: Joan E. Scott
title: Introduction to Interactive Computer Graphics
publisher: pub-WILEY
address: pub-WILEY:adr
pages: xi + 255
year: 1982
LCCN: T385.S36
bibdate: Wed Dec 15 10:41:36 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 10:41:36 ???
acknowledgement: ack-nhfb
rawauthor: Joan E. Scott
rawtitle: Introduction to Interactive Computer Graphics
ISBN:
0-471-05773-8 (hardcover), 0-471-86623-7 (paperback) OR 0471057738 (hardcover), 0471866237 (paperback)

ISBN13:
978-0-471-05773-4 (hardcover), 978-0-471-86623-7 (paperback) OR 9780471057734 (hardcover), 9780471866237 (paperback)

entry:
@Book{Scott:1982:IIC,
  author =       "Joan E. Scott",
  title =        "Introduction to Interactive Computer Graphics",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xi + 255",
  year =         "1982",
  ISBN =         "0-471-05773-8 (hardcover), 0-471-86623-7 (paperback)",
  ISBN-13 =      "978-0-471-05773-4 (hardcover), 978-0-471-86623-7
                 (paperback)",
  LCCN =         "T385.S36",
  bibdate =      "Wed Dec 15 10:41:36 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Scott:2000:PLP
author: Michael Lee Scott
title: Programming Language Pragmatics
publisher: pub-MORGAN-KAUFMANN
address: pub-MORGAN-KAUFMANN:adrsf
pages: xxi + 856
year: 2000
LCCN: QA76.7 .S38 2000
bibdate: Fri Sep 5 13:01:33 MDT 2008
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2008.09.05 13:01:33 MDT
subject: Programming languages (Electronic computers)
acknowledgement: ack-nhfb
rawauthor: Michael Lee Scott
rawtitle: Programming Language Pragmatics
ISBN:
1-55860-578-9 (paperback), 1-55860-442-1 (hardcover) OR 1558605789 (paperback), 1558604421 (hardcover)

ISBN13:
978-1-55860-578-7 (paperback), 978-1-55860-442-1 (hardcover) OR 9781558605787 (paperback), 9781558604421 (hardcover)

URL:
http://www.loc.gov/catdir/description/els033/99047125.html; http://www.loc.gov/catdir/toc/els033/99047125.html

abstract:
booktitle Programming Language Pragmatics addresses the fundamental principles at work in the most important contemporary languages, highlights the critical relationship between language design and language implementation, and devotes special attention to issues of importance to the expert programmer. Thanks to its rigorous but accessible teaching style, you'll emerge better prepared to choose the best language for particular projects, to make more effective use of languages you already know, and to learn new languages quickly and completely.

TOC:
1: Introduction 2: Programming Language Syntax 3: Names, Scopes, and Bindings 4: Semantic Analysis 5: Assembly-Level Computer Architecture 6: Control Flow 7: Data Types 8: Subroutines and Control Abstraction 9: Building a Runnable Program 10: Data Abstraction and Object Orientation 11: Nonimperative Programming Models: Functional and Logic Languages 12: Concurrency 13: Code Improvement Appendix A: Programming Languages Mentioned Appendix B: Language Design and Language Implementation

rawabstract:
\booktitle{Programming Language Pragmatics} addresses the fundamental principles at work in the most important contemporary languages, highlights the critical relationship between language design and language implementation, and devotes special attention to issues of importance to the expert programmer. Thanks to its rigorous but accessible teaching style, you'll emerge better prepared to choose the best language for particular projects, to make more effective use of languages you already know, and to learn new languages quickly and completely.

rawTOC:
1: Introduction \\ 2: Programming Language Syntax \\ 3: Names, Scopes, and Bindings \\ 4: Semantic Analysis \\ 5: Assembly-Level Computer Architecture \\ 6: Control Flow \\ 7: Data Types \\ 8: Subroutines and Control Abstraction \\ 9: Building a Runnable Program \\ 10: Data Abstraction and Object Orientation \\ 11: Nonimperative Programming Models: Functional and Logic Languages \\ 12: Concurrency \\ 13: Code Improvement \\ Appendix A: Programming Languages Mentioned \\ Appendix B: Language Design and Language Implementation

entry:
@Book{Scott:2000:PLP,
  author =       "Michael Lee Scott",
  title =        "Programming Language Pragmatics",
  publisher =    pub-MORGAN-KAUFMANN,
  address =      pub-MORGAN-KAUFMANN:adrsf,
  pages =        "xxi + 856",
  year =         "2000",
  ISBN =         "1-55860-578-9 (paperback), 1-55860-442-1 (hardcover)",
  ISBN-13 =      "978-1-55860-578-7 (paperback), 978-1-55860-442-1
                 (hardcover)",
  LCCN =         "QA76.7 .S38 2000",
  bibdate =      "Fri Sep 5 13:01:33 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/description/els033/99047125.html;
                 http://www.loc.gov/catdir/toc/els033/99047125.html",
  abstract =     "\booktitle{Programming Language Pragmatics} addresses
                 the fundamental principles at work in the most
                 important contemporary languages, highlights the
                 critical relationship between language design and
                 language implementation, and devotes special attention
                 to issues of importance to the expert programmer.
                 Thanks to its rigorous but accessible teaching style,
                 you'll emerge better prepared to choose the best
                 language for particular projects, to make more
                 effective use of languages you already know, and to
                 learn new languages quickly and completely.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Programming languages (Electronic computers)",
  tableofcontents = "1: Introduction \\
                 2: Programming Language Syntax \\
                 3: Names, Scopes, and Bindings \\
                 4: Semantic Analysis \\
                 5: Assembly-Level Computer Architecture \\
                 6: Control Flow \\
                 7: Data Types \\
                 8: Subroutines and Control Abstraction \\
                 9: Building a Runnable Program \\
                 10: Data Abstraction and Object Orientation \\
                 11: Nonimperative Programming Models: Functional and
                 Logic Languages \\
                 12: Concurrency \\
                 13: Code Improvement \\
                 Appendix A: Programming Languages Mentioned \\
                 Appendix B: Language Design and Language
                 Implementation",
}


bibtype: book
filename: master.bib
label: Scott:2006:PLP
author: Michael Lee Scott
title: Programming Language Pragmatics
publisher: pub-MORGAN-KAUFMANN
address: pub-MORGAN-KAUFMANN:adrsf
edition: Second
pages: xxxi + 875
year: 2006
ISBN: 0-12-633951-1 OR 0126339511
ISBN13: 978-0-12-633951-2 OR 9780126339512
LCCN: QA76.7 .S38 2006
bibdate: Fri Sep 5 12:53:37 MDT 2008
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2008.09.05 12:53:37 MDT
URL: http://www.loc.gov/catdir/enhancements/fy0632/2006272697-d.html
subject: Programming languages (Electronic computers)
acknowledgement: ack-nhfb
rawauthor: Michael Lee Scott
rawtitle: Programming Language Pragmatics
TOC:
Part I. Foundations 1: Introduction 2: Programming language syntax 3: Names, scopes, and bindings 4: Semantic analysis 5: Target machine architecture Part II. Core issues in language design 6: Control flow 7: Data types 8: Subroutines and control abstraction 9: Data abstraction and object orientation Part III. Alternative programming models 10: Functional languages 11: Logic languages 12: Concurrency 13: Scripting languages Part IV. A closer look at implementation 14: Building a runnable program 15: Code improvement A: Programming languages mentioned B: Language design and language implementation

rawTOC:
Part I. Foundations \\ 1: Introduction \\ 2: Programming language syntax \\ 3: Names, scopes, and bindings \\ 4: Semantic analysis \\ 5: Target machine architecture \\ Part II. Core issues in language design \\ 6: Control flow \\ 7: Data types \\ 8: Subroutines and control abstraction \\ 9: Data abstraction and object orientation \\ Part III. Alternative programming models \\ 10: Functional languages \\ 11: Logic languages \\ 12: Concurrency \\ 13: Scripting languages \\ Part IV. A closer look at implementation \\ 14: Building a runnable program \\ 15: Code improvement \\ A: Programming languages mentioned \\ B: Language design and language implementation

entry:
@Book{Scott:2006:PLP,
  author =       "Michael Lee Scott",
  title =        "Programming Language Pragmatics",
  publisher =    pub-MORGAN-KAUFMANN,
  address =      pub-MORGAN-KAUFMANN:adrsf,
  edition =      "Second",
  pages =        "xxxi + 875",
  year =         "2006",
  ISBN =         "0-12-633951-1",
  ISBN-13 =      "978-0-12-633951-2",
  LCCN =         "QA76.7 .S38 2006",
  bibdate =      "Fri Sep 5 12:53:37 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0632/2006272697-d.html",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Programming languages (Electronic computers)",
  tableofcontents = "Part I. Foundations \\
                 1: Introduction \\
                 2: Programming language syntax \\
                 3: Names, scopes, and bindings \\
                 4: Semantic analysis \\
                 5: Target machine architecture \\
                 Part II. Core issues in language design \\
                 6: Control flow \\
                 7: Data types \\
                 8: Subroutines and control abstraction \\
                 9: Data abstraction and object orientation \\
                 Part III. Alternative programming models \\
                 10: Functional languages \\
                 11: Logic languages \\
                 12: Concurrency \\
                 13: Scripting languages \\
                 Part IV. A closer look at implementation \\
                 14: Building a runnable program \\
                 15: Code improvement \\
                 A: Programming languages mentioned \\
                 B: Language design and language implementation",
}


bibtype: book
filename: master.bib
label: Seacord:2005:SCC
author: Robert C. Seacord
title: Secure coding in C and C++
publisher: pub-AW
address: pub-AW:adr
pages: xxiv + 341
year: 2005
ISBN: 0-321-33572-4 (paperback) OR 0321335724 (paperback)
ISBN13: 978-0-321-33572-2 (paperback) OR 9780321335722 (paperback)
LCCN: QA76.9.A25 S368 2005
bibdate: Thu Aug 31 10:52:01 MDT 2006
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2006.08.31 10:52:01 MDT
URL: http://www.cert.org/books/secure-coding/; http://www.loc.gov/catdir/toc/ecip0513/2005015012.html
subject: Computer security; C (Computer program language); C++ (Computer program language)
acknowledgement: ack-nhfb
rawauthor: Robert C. Seacord
rawtitle: Secure coding in {C} and {C++}
TOC:
Contents Preface ix 1 Running with Scissors 1 1.1 Gauging the Threat 4 1.2 Security Concepts 9 1.3 C and C++ 14 1.4 Development Platforms 17 1.5 Summary 21 1.6 For Further Reading 21 2 Strings 23 2.1 String Characteristics 23 2.2 Common String Manipulation Errors 24 2.3 String Vulnerabilities 30 2.4 Process Memory Organization 33 2.5 Stack Smashing 37 2.6 Code Injection 42 2.7 Arc Injection 45 2.8 Mitigation Strategies 48 2.9 Notable Vulnerabilities 66 2.10 Summary 68 2.11 For Further Reading 70 3 Pointer Subterfuge 71 3.1 Data Locations 72 3.2 Function Pointers 73 3.3 Data Pointers 74 3.4 Modifying the Instruction Pointer 75 3.5 Global Offset Table 76 3.6 The .dtors Section 78 3.7 Virtual Pointers 80 3.8 The atexit() and on_exit() Functions 82 3.9 The longjmp() Function 84 3.10 Exception Handling 85 3.11 Mitigation Strategies 89 3.12 Summary 89 3.13 For Further Reading 90 4 Dynamic Memory Management 91 4.1 Dynamic Memory Management 92 4.2 Common Dynamic Memory Management Errors 94 4.3 Doug Lea's Memory Allocator 100 4.4 RtlHeap 113 4.5 Mitigation Strategies 129 4.6 Notable Vulnerabilities 138 4.7 Summary 140 4.8 For Further Reading 141 5 Integer Security 143 5.1 Integers 144 5.2 Integer Conversions 151 5.3 Integer Error Conditions 156 5.4 Integer Operations 159 5.5 Vulnerabilities 172 5.6 Non-Exceptional Integer Logic Errors 177 5.7 Mitigation Strategies 178 5.8 Notable Vulnerabilities 187 5.9 Summary 190 5.10 For Further Reading 191 6 Formatted Output 193 6.1 Variadic Functions 194 6.2 Formatted Output Functions 198 6.3 Exploiting Formatted Output Functions 203 6.4 Stack Randomization 214 6.5 Mitigation Strategies 220 6.6 Notable Vulnerabilities 230 6.7 Summary 231 6.8 For Further Reading 233 7 File I/O 235 7.1 Concurrency 235 7.2 Time of Check, Time of Use 238 7.3 Files as Locks and File Locking 240 7.4 File System Exploits 242 7.5 Mitigation Strategies 249 7.6 Summary 259 8 Recommended Practices 261 8.1 Secure Software Development Principles 263 8.2 Systems Quality Requirements Engineering 267 8.3 Threat Modeling 269 8.4 Use/Misuse Cases 270 8.5 Architecture and Design 271 8.6 Off-the-Shelf Software 273 8.7 Compiler Checks 275 8.8 Input Validation 275 8.9 Data Sanitization 277 8.10 Static Analysis 280 8.11 Quality Assurance 283 8.12 Memory Permissions 286 8.13 Defense in Depth 288 8.14 TSP-Secure 289 8.15 Summary 292 8.16 Further Reading 292

rawTOC:
Contents \\ Preface ix \\ 1 Running with Scissors 1 \\ 1.1 Gauging the Threat 4 \\ 1.2 Security Concepts 9 \\ 1.3 C and C++ 14 \\ 1.4 Development Platforms 17 \\ 1.5 Summary 21 \\ 1.6 For Further Reading 21 \\ 2 Strings 23 \\ 2.1 String Characteristics 23 \\ 2.2 Common String Manipulation Errors 24 \\ 2.3 String Vulnerabilities 30 \\ 2.4 Process Memory Organization 33 \\ 2.5 Stack Smashing 37 \\ 2.6 Code Injection 42 \\ 2.7 Arc Injection 45 \\ 2.8 Mitigation Strategies 48 \\ 2.9 Notable Vulnerabilities 66 \\ 2.10 Summary 68 \\ 2.11 For Further Reading 70 \\ 3 Pointer Subterfuge 71 \\ 3.1 Data Locations 72 \\ 3.2 Function Pointers 73 \\ 3.3 Data Pointers 74 \\ 3.4 Modifying the Instruction Pointer 75 \\ 3.5 Global Offset Table 76 \\ 3.6 The .dtors Section 78 \\ 3.7 Virtual Pointers 80 \\ 3.8 The atexit() and on_exit() Functions 82 \\ 3.9 The longjmp() Function 84 \\ 3.10 Exception Handling 85 \\ 3.11 Mitigation Strategies 89 \\ 3.12 Summary 89 \\ 3.13 For Further Reading 90 \\ 4 Dynamic Memory Management 91 \\ 4.1 Dynamic Memory Management 92 \\ 4.2 Common Dynamic Memory Management Errors 94 \\ 4.3 Doug Lea's Memory Allocator 100 \\ 4.4 RtlHeap 113 \\ 4.5 Mitigation Strategies 129 \\ 4.6 Notable Vulnerabilities 138 \\ 4.7 Summary 140 \\ 4.8 For Further Reading 141 \\ 5 Integer Security 143 \\ 5.1 Integers 144 \\ 5.2 Integer Conversions 151 \\ 5.3 Integer Error Conditions 156 \\ 5.4 Integer Operations 159 \\ 5.5 Vulnerabilities 172 \\ 5.6 Non-Exceptional Integer Logic Errors 177 \\ 5.7 Mitigation Strategies 178 \\ 5.8 Notable Vulnerabilities 187 \\ 5.9 Summary 190 \\ 5.10 For Further Reading 191 \\ 6 Formatted Output 193 \\ 6.1 Variadic Functions 194 \\ 6.2 Formatted Output Functions 198 \\ 6.3 Exploiting Formatted Output Functions 203 \\ 6.4 Stack Randomization 214 \\ 6.5 Mitigation Strategies 220 \\ 6.6 Notable Vulnerabilities 230 \\ 6.7 Summary 231 \\ 6.8 For Further Reading 233 \\ 7 File I/O 235 \\ 7.1 Concurrency 235 \\ 7.2 Time of Check, Time of Use 238 \\ 7.3 Files as Locks and File Locking 240 \\ 7.4 File System Exploits 242 \\ 7.5 Mitigation Strategies 249 \\ 7.6 Summary 259 \\ 8 Recommended Practices 261 \\ 8.1 Secure Software Development Principles 263 \\ 8.2 Systems Quality Requirements Engineering 267 \\ 8.3 Threat Modeling 269 \\ 8.4 Use/Misuse Cases 270 \\ 8.5 Architecture and Design 271 \\ 8.6 Off-the-Shelf Software 273 \\ 8.7 Compiler Checks 275 \\ 8.8 Input Validation 275 \\ 8.9 Data Sanitization 277 \\ 8.10 Static Analysis 280 \\ 8.11 Quality Assurance 283 \\ 8.12 Memory Permissions 286 \\ 8.13 Defense in Depth 288 \\ 8.14 TSP-Secure 289 \\ 8.15 Summary 292 \\ 8.16 Further Reading 292

entry:
@Book{Seacord:2005:SCC,
  author =       "Robert C. Seacord",
  title =        "Secure coding in {C} and {C++}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xxiv + 341",
  year =         "2005",
  ISBN =         "0-321-33572-4 (paperback)",
  ISBN-13 =      "978-0-321-33572-2 (paperback)",
  LCCN =         "QA76.9.A25 S368 2005",
  bibdate =      "Thu Aug 31 10:52:01 MDT 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.cert.org/books/secure-coding/;
                 http://www.loc.gov/catdir/toc/ecip0513/2005015012.html",
  acknowledgement = ack-nhfb,
  subject =      "Computer security; C (Computer program language); C++
                 (Computer program language)",
  tableofcontents = "Contents \\
                 Preface ix \\
                 1 Running with Scissors 1 \\
                 1.1 Gauging the Threat 4 \\
                 1.2 Security Concepts 9 \\
                 1.3 C and C++ 14 \\
                 1.4 Development Platforms 17 \\
                 1.5 Summary 21 \\
                 1.6 For Further Reading 21 \\
                 2 Strings 23 \\
                 2.1 String Characteristics 23 \\
                 2.2 Common String Manipulation Errors 24 \\
                 2.3 String Vulnerabilities 30 \\
                 2.4 Process Memory Organization 33 \\
                 2.5 Stack Smashing 37 \\
                 2.6 Code Injection 42 \\
                 2.7 Arc Injection 45 \\
                 2.8 Mitigation Strategies 48 \\
                 2.9 Notable Vulnerabilities 66 \\
                 2.10 Summary 68 \\
                 2.11 For Further Reading 70 \\
                 3 Pointer Subterfuge 71 \\
                 3.1 Data Locations 72 \\
                 3.2 Function Pointers 73 \\
                 3.3 Data Pointers 74 \\
                 3.4 Modifying the Instruction Pointer 75 \\
                 3.5 Global Offset Table 76 \\
                 3.6 The .dtors Section 78 \\
                 3.7 Virtual Pointers 80 \\
                 3.8 The atexit() and on_exit() Functions 82 \\
                 3.9 The longjmp() Function 84 \\
                 3.10 Exception Handling 85 \\
                 3.11 Mitigation Strategies 89 \\
                 3.12 Summary 89 \\
                 3.13 For Further Reading 90 \\
                 4 Dynamic Memory Management 91 \\
                 4.1 Dynamic Memory Management 92 \\
                 4.2 Common Dynamic Memory Management Errors 94 \\
                 4.3 Doug Lea's Memory Allocator 100 \\
                 4.4 RtlHeap 113 \\
                 4.5 Mitigation Strategies 129 \\
                 4.6 Notable Vulnerabilities 138 \\
                 4.7 Summary 140 \\
                 4.8 For Further Reading 141 \\
                 5 Integer Security 143 \\
                 5.1 Integers 144 \\
                 5.2 Integer Conversions 151 \\
                 5.3 Integer Error Conditions 156 \\
                 5.4 Integer Operations 159 \\
                 5.5 Vulnerabilities 172 \\
                 5.6 Non-Exceptional Integer Logic Errors 177 \\
                 5.7 Mitigation Strategies 178 \\
                 5.8 Notable Vulnerabilities 187 \\
                 5.9 Summary 190 \\
                 5.10 For Further Reading 191 \\
                 6 Formatted Output 193 \\
                 6.1 Variadic Functions 194 \\
                 6.2 Formatted Output Functions 198 \\
                 6.3 Exploiting Formatted Output Functions 203 \\
                 6.4 Stack Randomization 214 \\
                 6.5 Mitigation Strategies 220 \\
                 6.6 Notable Vulnerabilities 230 \\
                 6.7 Summary 231 \\
                 6.8 For Further Reading 233 \\
                 7 File I/O 235 \\
                 7.1 Concurrency 235 \\
                 7.2 Time of Check, Time of Use 238 \\
                 7.3 Files as Locks and File Locking 240 \\
                 7.4 File System Exploits 242 \\
                 7.5 Mitigation Strategies 249 \\
                 7.6 Summary 259 \\
                 8 Recommended Practices 261 \\
                 8.1 Secure Software Development Principles 263 \\
                 8.2 Systems Quality Requirements Engineering 267 \\
                 8.3 Threat Modeling 269 \\
                 8.4 Use/Misuse Cases 270 \\
                 8.5 Architecture and Design 271 \\
                 8.6 Off-the-Shelf Software 273 \\
                 8.7 Compiler Checks 275 \\
                 8.8 Input Validation 275 \\
                 8.9 Data Sanitization 277 \\
                 8.10 Static Analysis 280 \\
                 8.11 Quality Assurance 283 \\
                 8.12 Memory Permissions 286 \\
                 8.13 Defense in Depth 288 \\
                 8.14 TSP-Secure 289 \\
                 8.15 Summary 292 \\
                 8.16 Further Reading 292",
}


bibtype: book
filename: master.bib
label: Seacord:2020:EC
author: Robert Seacord
title: Effective C
publisher: pub-NO-STARCH
address: pub-NO-STARCH:adr
pages: xxviii + 240
year: 2020
ISBN: 1-71850-104-8 (paperback), 1-0981-2567-3 (e-book) OR 1718501048 (paperback), 1098125673 (ebook)
LCCN: QA76.73.C15 .S433 2020
bibdate: Tue Feb 27 10:34:57 MST 2024
bibsource: fsz3950.oclc.org:210/WorldCat
bibtimestamp: 2024.02.27 10:34:57 MST
URL: https://nostarch.com/download/samples/EffectiveC_ToC_sample.pdf; https://nostarch.com/Effective_C
acknowledgement: ack-nhfb
rawauthor: Robert Seacord
rawtitle: Effective {C}
ISBN13:
978-1-71850-104-1 (paperback), 978-1-0981-2567-7 (e-book) OR 9781718501041 (paperback), 9781098125677 (ebook)

abstract:
The world runs on code written in the C programming language, yet most schools begin the curriculum with Python or Java. Effective C bridges this gap and brings C into the modern era-covering the modern C17 Standard as well as potential C2x features. With the aid of this instant classic, you'll soon be writing professional, portable, and secure C programs to power robust systems and solve real-world problems. Robert C. Seacord introduces C and the C Standard Library while addressing best practices, common errors, and open debates in the C community. Developed together with other C Standards committee experts, Effective C will teach you how to debug, test, and analyze C programs. You'll benefit from Seacord's concise explanations of C language constructs and behaviors, and from his 40 years of coding experience. You'll learn: * how to identify and handle undefined behavior in a C program * the range and representations of integers and floating-point values; * how dynamic memory allocation works and how to use nonstandard functions; * how to use character encodings and types; * how to perform I/O with terminals and filesystems using C Standard streams and POSIX file descriptors; * how to understand the C compiler's translation phases and the role of the preprocessor; * how to test, debug, and analyze C programs. Effective C will teach you how to write professional, secure, and portable C code that will stand the test of time and help strengthen the foundation of the computing world.

TOC:
Introduction 1: Getting Started 2: Objects, Functions, and Types 3: Arithmetic Types 4: Expressions and Operators 5: Control Flow 6: Dynamically Allocated Memory 7: Characters and Strings 8: Input/Output 9: Preprocessor 10: Program Structure 11: Debugging, Testing, and Analysis Index

rawabstract:
The world runs on code written in the C programming language, yet most schools begin the curriculum with Python or Java. Effective C bridges this gap and brings C into the modern era-covering the modern C17 Standard as well as potential C2x features. With the aid of this instant classic, you'll soon be writing professional, portable, and secure C programs to power robust systems and solve real-world problems. Robert C. Seacord introduces C and the C Standard Library while addressing best practices, common errors, and open debates in the C community. Developed together with other C Standards committee experts, Effective C will teach you how to debug, test, and analyze C programs. You'll benefit from Seacord's concise explanations of C language constructs and behaviors, and from his 40 years of coding experience. You'll learn: * how to identify and handle undefined behavior in a C program * the range and representations of integers and floating-point values; * how dynamic memory allocation works and how to use nonstandard functions; * how to use character encodings and types; * how to perform I/O with terminals and filesystems using C Standard streams and POSIX file descriptors; * how to understand the C compiler's translation phases and the role of the preprocessor; * how to test, debug, and analyze C programs. Effective C will teach you how to write professional, secure, and portable C code that will stand the test of time and help strengthen the foundation of the computing world.

rawTOC:
Introduction \\ 1: Getting Started \\ 2: Objects, Functions, and Types \\ 3: Arithmetic Types \\ 4: Expressions and Operators \\ 5: Control Flow \\ 6: Dynamically Allocated Memory \\ 7: Characters and Strings \\ 8: Input/Output \\ 9: Preprocessor \\ 10: Program Structure \\ 11: Debugging, Testing, and Analysis \\ Index

entry:
@Book{Seacord:2020:EC,
  author =       "Robert Seacord",
  title =        "Effective {C}",
  publisher =    pub-NO-STARCH,
  address =      pub-NO-STARCH:adr,
  pages =        "xxviii + 240",
  year =         "2020",
  ISBN =         "1-71850-104-8 (paperback), 1-0981-2567-3 (e-book)",
  ISBN-13 =      "978-1-71850-104-1 (paperback), 978-1-0981-2567-7
                 (e-book)",
  LCCN =         "QA76.73.C15 .S433 2020",
  bibdate =      "Tue Feb 27 10:34:57 MST 2024",
  bibsource =    "fsz3950.oclc.org:210/WorldCat",
  URL =          "https://nostarch.com/download/samples/EffectiveC_ToC_sample.pdf;
                 https://nostarch.com/Effective_C",
  abstract =     "The world runs on code written in the C programming
                 language, yet most schools begin the curriculum with
                 Python or Java. Effective C bridges this gap and brings
                 C into the modern era-covering the modern C17 Standard
                 as well as potential C2x features. With the aid of this
                 instant classic, you'll soon be writing professional,
                 portable, and secure C programs to power robust systems
                 and solve real-world problems. Robert C. Seacord
                 introduces C and the C Standard Library while
                 addressing best practices, common errors, and open
                 debates in the C community. Developed together with
                 other C Standards committee experts, Effective C will
                 teach you how to debug, test, and analyze C programs.
                 You'll benefit from Seacord's concise explanations of C
                 language constructs and behaviors, and from his 40
                 years of coding experience. You'll learn: * how to
                 identify and handle undefined behavior in a C program *
                 the range and representations of integers and
                 floating-point values; * how dynamic memory allocation
                 works and how to use nonstandard functions; * how to
                 use character encodings and types; * how to perform I/O
                 with terminals and filesystems using C Standard streams
                 and POSIX file descriptors; * how to understand the C
                 compiler's translation phases and the role of the
                 preprocessor; * how to test, debug, and analyze C
                 programs. Effective C will teach you how to write
                 professional, secure, and portable C code that will
                 stand the test of time and help strengthen the
                 foundation of the computing world.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  tableofcontents = "Introduction \\
                 1: Getting Started \\
                 2: Objects, Functions, and Types \\
                 3: Arithmetic Types \\
                 4: Expressions and Operators \\
                 5: Control Flow \\
                 6: Dynamically Allocated Memory \\
                 7: Characters and Strings \\
                 8: Input/Output \\
                 9: Preprocessor \\
                 10: Program Structure \\
                 11: Debugging, Testing, and Analysis \\
                 Index",
}


bibtype: book
filename: master.bib
label: Searfoss:1994:JKC
author: Glenn Searfoss
title: JIS-Kanji Character Recognition: Featuring the Gaiji method
publisher: pub-VAN-NOSTRAND-REINHOLD
address: pub-VAN-NOSTRAND-REINHOLD:adr
pages: xxii + 419
year: 1994
ISBN: 0-442-01813-4 OR 0442018134
ISBN13: 978-0-442-01813-9 OR 9780442018139
LCCN: TA1640 .S43 1994
MRclass: *68U15, 68-01, 68T10
bibdate: Wed Aug 10 10:57:45 1994
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1994.08.10 10:57:45 ???
ZMnumber: 0821.68126
acknowledgement: ack-nhfb
rawauthor: Glenn Searfoss
rawtitle: {JIS-Kanji} Character Recognition: Featuring the {Gaiji} method
TOC:
Introduction About This Book Applications Book Organization Trademarks and Copyrights Understanding Kanji: A Background in Form, Function, and Utility / 1 JIS-Kanji Standards and Specifications / 15 JIS-Kanji Character Encoding Methods / 25 JIS-Kanji Character Identification Methods / 39 The Gaiji Method / 55 The Gaiji Method Character Recognition Charts / 69 International Trade, Investment Education, and Professional Organizations / 219 JIS-Kanji Product Listings / 239 Included Software / 259 Glossary of Terms / 359 Appendix A: Tables and Charts / 371 Appendix B: JIS x 0208-1990 Standard Character Chart with 8-Bit Hexadecimal and Ward-Point Code Ranges / 383 Bibliography / 405 Index / 415

rawTOC:
Introduction \\ About This Book \\ Applications \\ Book Organization \\ Trademarks and Copyrights \\ Understanding Kanji: A Background in Form, Function, and Utility / 1 \\ JIS-Kanji Standards and Specifications / 15 \\ JIS-Kanji Character Encoding Methods / 25 \\ JIS-Kanji Character Identification Methods / 39 \\ The Gaiji Method / 55 \\ The Gaiji Method Character Recognition Charts / 69 \\ International Trade, Investment Education, and Professional Organizations / 219 \\ JIS-Kanji Product Listings / 239 \\ Included Software / 259 \\ Glossary of Terms / 359 \\ Appendix A: Tables and Charts / 371 \\ Appendix B: JIS x 0208-1990 Standard Character Chart with 8-Bit Hexadecimal and Ward-Point Code Ranges / 383 \\ Bibliography / 405 \\ Index / 415

entry:
@Book{Searfoss:1994:JKC,
  author =       "Glenn Searfoss",
  title =        "{JIS-Kanji} Character Recognition: Featuring the
                 {Gaiji} method",
  publisher =    pub-VAN-NOSTRAND-REINHOLD,
  address =      pub-VAN-NOSTRAND-REINHOLD:adr,
  pages =        "xxii + 419",
  year =         "1994",
  ISBN =         "0-442-01813-4",
  ISBN-13 =      "978-0-442-01813-9",
  LCCN =         "TA1640 .S43 1994",
  MRclass =      "*68U15, 68-01, 68T10",
  bibdate =      "Wed Aug 10 10:57:45 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$49.95",
  ZMnumber =     "0821.68126",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "Introduction \\
                 About This Book \\
                 Applications \\
                 Book Organization \\
                 Trademarks and Copyrights \\
                 Understanding Kanji: A Background in Form, Function,
                 and Utility / 1 \\
                 JIS-Kanji Standards and Specifications / 15 \\
                 JIS-Kanji Character Encoding Methods / 25 \\
                 JIS-Kanji Character Identification Methods / 39 \\
                 The Gaiji Method / 55 \\
                 The Gaiji Method Character Recognition Charts / 69 \\
                 International Trade, Investment Education, and
                 Professional Organizations / 219 \\
                 JIS-Kanji Product Listings / 239 \\
                 Included Software / 259 \\
                 Glossary of Terms / 359 \\
                 Appendix A: Tables and Charts / 371 \\
                 Appendix B: JIS x 0208-1990 Standard Character Chart
                 with 8-Bit Hexadecimal and Ward-Point Code Ranges / 383
                 \\
                 Bibliography / 405 \\
                 Index / 415",
}


bibtype: book
filename: master.bib
label: Sedgewick:1983:A
author: Robert Sedgewick
title: Algorithms
publisher: pub-AW
address: pub-AW:adr
pages: viii + 551
year: 1983
ISBN: 0-201-06672-6 OR 0201066726
ISBN13: 978-0-201-06672-2 OR 9780201066722
LCCN: QA76.6 .S435 1983
bibdate: Wed Dec 15 18:23:21 1993
bibtimestamp: 1993.12.15 18:23:21 ???
acknowledgement: ack-nhfb
rawauthor: Robert Sedgewick
rawtitle: Algorithms
TOC:
Introduction 1. Preview Mathematical Algorithms 2. Arithmetic 3. Random numbers 4. Polynomials 5. Gaussian Elimination 6. Curve fitting 7. Integration Sorting 8. Elementary sorting methods 9. Quicksort 10. Radix sorting 11. Priority Queues 12. Selection and merging 13. External sorting Searching 14. Elementary searching methods 15. Balanced trees 16. Hashing 17. Radix searching 18. External searching String Processing 19. String searching 20. Pattern matching 21. Parsing 22. File compression 23. Cryptology Geometric Algorithms 24. Elementary geometric methods 25. Finding the convex hull 26. Range searching 27. Geometric intersection 28. Closest point problems Graph Algorithms 29. Elementary graph algorithms 30. Connectivity 31. Weighted graphs 32. Directed graphs 33. Network flow 34. Matching Advanced Topics 35. Algorithm machines 36. The Fast Fourier Transform 37. Dynamic programming 38. Linear programming 39. Exhaustive search 40. NP-complete problems

rawTOC:
Introduction \\ 1. Preview \\ Mathematical Algorithms \\ 2. Arithmetic \\ 3. Random numbers \\ 4. Polynomials \\ 5. Gaussian Elimination \\ 6. Curve fitting \\ 7. Integration \\ Sorting \\ 8. Elementary sorting methods \\ 9. Quicksort \\ 10. Radix sorting \\ 11. Priority Queues \\ 12. Selection and merging \\ 13. External sorting \\ Searching \\ 14. Elementary searching methods \\ 15. Balanced trees \\ 16. Hashing \\ 17. Radix searching \\ 18. External searching \\ String Processing \\ 19. String searching \\ 20. Pattern matching \\ 21. Parsing \\ 22. File compression \\ 23. Cryptology \\ Geometric Algorithms \\ 24. Elementary geometric methods \\ 25. Finding the convex hull \\ 26. Range searching \\ 27. Geometric intersection \\ 28. Closest point problems \\ Graph Algorithms \\ 29. Elementary graph algorithms \\ 30. Connectivity \\ 31. Weighted graphs \\ 32. Directed graphs \\ 33. Network flow \\ 34. Matching \\ Advanced Topics \\ 35. Algorithm machines \\ 36. The Fast Fourier Transform \\ 37. Dynamic programming \\ 38. Linear programming \\ 39. Exhaustive search \\ 40. NP-complete problems

entry:
@Book{Sedgewick:1983:A,
  author =       "Robert Sedgewick",
  title =        "Algorithms",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "viii + 551",
  year =         "1983",
  ISBN =         "0-201-06672-6",
  ISBN-13 =      "978-0-201-06672-2",
  LCCN =         "QA76.6 .S435 1983",
  bibdate =      "Wed Dec 15 18:23:21 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Introduction \\
                 1. Preview \\
                 Mathematical Algorithms \\
                 2. Arithmetic \\
                 3. Random numbers \\
                 4. Polynomials \\
                 5. Gaussian Elimination \\
                 6. Curve fitting \\
                 7. Integration \\
                 Sorting \\
                 8. Elementary sorting methods \\
                 9. Quicksort \\
                 10. Radix sorting \\
                 11. Priority Queues \\
                 12. Selection and merging \\
                 13. External sorting \\
                 Searching \\
                 14. Elementary searching methods \\
                 15. Balanced trees \\
                 16. Hashing \\
                 17. Radix searching \\
                 18. External searching \\
                 String Processing \\
                 19. String searching \\
                 20. Pattern matching \\
                 21. Parsing \\
                 22. File compression \\
                 23. Cryptology \\
                 Geometric Algorithms \\
                 24. Elementary geometric methods \\
                 25. Finding the convex hull \\
                 26. Range searching \\
                 27. Geometric intersection \\
                 28. Closest point problems \\
                 Graph Algorithms \\
                 29. Elementary graph algorithms \\
                 30. Connectivity \\
                 31. Weighted graphs \\
                 32. Directed graphs \\
                 33. Network flow \\
                 34. Matching \\
                 Advanced Topics \\
                 35. Algorithm machines \\
                 36. The Fast Fourier Transform \\
                 37. Dynamic programming \\
                 38. Linear programming \\
                 39. Exhaustive search \\
                 40. NP-complete problems",
}


bibtype: book
filename: master.bib
label: Sedgewick:1988:A
author: Robert Sedgewick
title: Algorithms
publisher: pub-AW
address: pub-AW:adr
edition: Second
pages: xii + 657
year: 1988
ISBN: 0-201-06673-4 OR 0201066734
ISBN13: 978-0-201-06673-9 OR 9780201066739
LCCN: QA76.6 .S435 1988
MRclass: 68-01, 68N01, 68P05, 68P10, 68Q25, 68W10, 68W99
bibdate: Wed Dec 15 10:41:37 1993
bibtimestamp: 1993.12.15 10:41:37 ???
remark: prep-tex
ZMnumber: 0717.68005
acknowledgement: ack-nhfb
rawauthor: Robert Sedgewick
rawtitle: Algorithms
bibsource:
https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg-2ed.bib; https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib; https://www.math.utah.edu/pub/tex/bib/hash.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/texbook2.bib

entry:
@Book{Sedgewick:1988:A,
  author =       "Robert Sedgewick",
  title =        "Algorithms",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Second",
  pages =        "xii + 657",
  year =         "1988",
  ISBN =         "0-201-06673-4",
  ISBN-13 =      "978-0-201-06673-9",
  LCCN =         "QA76.6 .S435 1988",
  MRclass =      "68-01, 68N01, 68P05, 68P10, 68Q25, 68W10, 68W99",
  bibdate =      "Wed Dec 15 10:41:37 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg-2ed.bib;
                 https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
                 https://www.math.utah.edu/pub/tex/bib/hash.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook2.bib",
  price =        "US\$34.95",
  ZMnumber =     "0717.68005",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  remark =       prep-tex,
}


bibtype: book
filename: master.bib
label: Sedgewick:1990:AC
author: Robert Sedgewick
title: Algorithms in C
publisher: pub-AW
address: pub-AW:adr
pages: xii + 657
year: 1990
ISBN: 0-201-51425-7 OR 0201514257
ISBN13: 978-0-201-51425-4 OR 9780201514254
LCCN: QA76.73.C15 S43 1990
bibdate: Wed Dec 15 10:41:38 1993
bibtimestamp: 1993.12.15 10:41:38 ???
acknowledgement: ack-nhfb
rawauthor: Robert Sedgewick
rawtitle: Algorithms in {C}
TOC:
Fundamentals 1. Introduction 2. C 3. Elementary data structures 4. Trees 5. Recursion 6. Analysis of algorithms 7. Implementation of algorithms Sorting algorithms 8. Elementary sorting methods 9. Quicksort 10. Radix sorting 11. Priority queues 12. Mergesort 13. External sorting Searching algorithms 14. Elementary searching methods 15. Balanced trees 16. Hashing 17. Radix searching 18. External searching String processing 19. String searching 20. Pattern matching 21. Parsing 22. File compression 23. Cryptology Geometry algorithms 24. Elementary geometric methods 25. Finding the convex hull 26. Range searching 27. Geometric intersection 28. Closet-point problems Graph algorithms 29. Elementary graph algorithms 30. Connectivity 31. Weighted graphs 32. Directed graphs 33. Network flow 34. Matching Mathematical algorithms 35. Random numbers 36. Arithmetic 37. Gaussian elimination 38. Curve fitting 39. Integration Advanced topics 40. Parallel algorithms 41. The Fast Fourier Transform 42. Dynamic programming 43. Linear programming 44. Exhaustive search 45. NP-complete problems Index

rawTOC:
Fundamentals \\ 1. Introduction \\ 2. C \\ 3. Elementary data structures \\ 4. Trees \\ 5. Recursion \\ 6. Analysis of algorithms \\ 7. Implementation of algorithms \\ Sorting algorithms \\ 8. Elementary sorting methods \\ 9. Quicksort \\ 10. Radix sorting \\ 11. Priority queues \\ 12. Mergesort \\ 13. External sorting \\ Searching algorithms \\ 14. Elementary searching methods \\ 15. Balanced trees \\ 16. Hashing \\ 17. Radix searching \\ 18. External searching \\ String processing \\ 19. String searching \\ 20. Pattern matching \\ 21. Parsing \\ 22. File compression \\ 23. Cryptology \\ Geometry algorithms \\ 24. Elementary geometric methods \\ 25. Finding the convex hull \\ 26. Range searching \\ 27. Geometric intersection \\ 28. Closet-point problems \\ Graph algorithms \\ 29. Elementary graph algorithms \\ 30. Connectivity \\ 31. Weighted graphs \\ 32. Directed graphs \\ 33. Network flow \\ 34. Matching \\ Mathematical algorithms \\ 35. Random numbers \\ 36. Arithmetic \\ 37. Gaussian elimination \\ 38. Curve fitting \\ 39. Integration \\ Advanced topics \\ 40. Parallel algorithms \\ 41. The Fast Fourier Transform \\ 42. Dynamic programming \\ 43. Linear programming \\ 44. Exhaustive search \\ 45. NP-complete problems \\ Index

entry:
@Book{Sedgewick:1990:AC,
  author =       "Robert Sedgewick",
  title =        "Algorithms in {C}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xii + 657",
  year =         "1990",
  ISBN =         "0-201-51425-7",
  ISBN-13 =      "978-0-201-51425-4",
  LCCN =         "QA76.73.C15 S43 1990",
  bibdate =      "Wed Dec 15 10:41:38 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Fundamentals \\
                 1. Introduction \\
                 2. C \\
                 3. Elementary data structures \\
                 4. Trees \\
                 5. Recursion \\
                 6. Analysis of algorithms \\
                 7. Implementation of algorithms \\
                 Sorting algorithms \\
                 8. Elementary sorting methods \\
                 9. Quicksort \\
                 10. Radix sorting \\
                 11. Priority queues \\
                 12. Mergesort \\
                 13. External sorting \\
                 Searching algorithms \\
                 14. Elementary searching methods \\
                 15. Balanced trees \\
                 16. Hashing \\
                 17. Radix searching \\
                 18. External searching \\
                 String processing \\
                 19. String searching \\
                 20. Pattern matching \\
                 21. Parsing \\
                 22. File compression \\
                 23. Cryptology \\
                 Geometry algorithms \\
                 24. Elementary geometric methods \\
                 25. Finding the convex hull \\
                 26. Range searching \\
                 27. Geometric intersection \\
                 28. Closet-point problems \\
                 Graph algorithms \\
                 29. Elementary graph algorithms \\
                 30. Connectivity \\
                 31. Weighted graphs \\
                 32. Directed graphs \\
                 33. Network flow \\
                 34. Matching \\
                 Mathematical algorithms \\
                 35. Random numbers \\
                 36. Arithmetic \\
                 37. Gaussian elimination \\
                 38. Curve fitting \\
                 39. Integration \\
                 Advanced topics \\
                 40. Parallel algorithms \\
                 41. The Fast Fourier Transform \\
                 42. Dynamic programming \\
                 43. Linear programming \\
                 44. Exhaustive search \\
                 45. NP-complete problems \\
                 Index",
}


bibtype: book
filename: master.bib
label: Sedgewick:1992:AC
author: Robert Sedgewick
title: Algorithms in C++
publisher: pub-AW
address: pub-AW:adr
pages: xiv + 656
year: 1992
ISBN: 0-201-36118-3, 0-201-51059-6 OR 0201361183, 0201510596
ISBN13: 978-0-201-36118-6, 978-0-201-51059-1 OR 9780201361186, 9780201510591
LCCN: QA76.73.C153 S38 1992
MRclass: 68N15, 68-01, 68-04, 68P10, 68W10, 68W15, 68N15
bibdate: Mon Jan 3 12:10:05 1994
bibtimestamp: 1994.01.03 12:10:05 ???
ZMnumber: 0826.68025
acknowledgement: ack-nhfb
rawauthor: Robert Sedgewick
rawtitle: Algorithms in {C++}
bibsource:
https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib; https://www.math.utah.edu/pub/tex/bib/hash.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/numana1990.bib; https://www.math.utah.edu/pub/tex/bib/prng.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib

TOC:
Fundamentals 1: Introduction Algorithms Outline of Topics 2: C++ (and C) Example: Euclid's Algorithm Types of Data Input/Output Concluding Remarks 3: Elementary Data Structures Arrays Linked Lists Storage Allocation Pushdown Stacks Queues Linked List Implementation of Stacks Abstract and Concrete Data Types 4: Trees Glossary Properties Representing Binary Trees Representing Forests Traversing Trees 5: Recursion Recurrences Divide-and-Conquer Recursive Tree Traversal Removing Recursion Perspective 6: Analysis of Algorithms Framework Classification of Algorithms Computational Complexity Average-Case Analysis Approximate and Asymptotic Results Basic Recurrences Perspective 7: Implementation of Algorithms Selecting an Algorithm Empirical Analysis Program Optimization Algorithms and Systems Sorting Algorithms 8: Elementary Sorting Methods Rules of the Game Selection Sort Insertion Sort Digression: Bubble Sort Performance Characteristics of Elementary Sorts Sorting Files with Large Records Shellsort Distribution Counting 9: Quicksort The Basic Algorithm Performance Characteristics of Quicksort Removing Recursion Small Subfiles Median-of-Three Partitioning Selection 10: Radix Sorting Bits Radix Exchange Sort Straight Radix Sort Performance Characteristics of Radix Sorts A Linear Sort 11: Priority Queues Elementary Implementations Heap Data Structure Algorithms on Heaps Heapsort Indirect Heaps Advanced Implementations 12: Mergesort Merging Mergesort List Mergesort Bottom-Up Mergesort Performance Characteristics Optimized Implementations Recursion Revisited 13: External Sorting Sort-Merge Balanced Multiway Merging Replacement Selection Practical Considerations Polyphase Merging An Easier Way Searching Algorithms 14: Elementary Searching Methods Sequential Searching Binary Search Binary Tree Search Deletion Indirect Binary Search Trees 15: Balanced Trees Top-Down 2-3-4 Trees Red-Black Trees Other Algorithms 16: Hashing Hash Functions Separate Chaining Linear Probing Double Hashing Perspective 17: Radix Searching Digital Search Trees Radix Search Tries Multiway Radix Searching Patricia 18: External Searching Indexed Sequential Access B-Trees Extendible Hashing Virtual Memory String Processing 19: String Searching A Short History Brute-Force Algorithm Knuth--Morris--Pratt Algorithm Boyer--Moore Algorithm Rabin--Karp Algorithm Multiple Searches 20: Pattern Matching Describing Patterns Pattern Matching Machines Representing the Machine Simulating the Machine 21: Parsing Context-Free Grammars Top-Down Parsing Bottom-Up Parsing Compilers Compiler-Compilers 22: File Compression Run-Length Encoding Variable-Length Encoding Building the Huffman Code Implementation 23: Cryptology Rules of the Game Simple Methods Encryption/Decryption Machines Public-Key Cryptosystems Geometric Algorithms 24: Elementary Geometric Methods Points, Lines, and Polygons Line Segment Intersection Simple Closed Path Inclusion in a Polygon Perspective 25: Finding the Convex Hull Rules of the Game Package-Wrapping The Graham Scan Interior Elimination Performance Issues 26: Range Searching Elementary Methods Grid Method Two-Dimensional Trees Multidimensional Range Searching 27: Geometric Intersection Horizontal and Vertical Lines Implementation General Line Intersection 28: Closest-Point Problems Closest-Pair Problem Voronoi Diagrams Graph Algorithms 29: Elementary Graph Algorithms Glossary Representation Depth-First Search Nonrecursive Depth-First Search Breadth-First Search Mazes Perspective 30: Connectivity Connected Components Biconnectivity Union-Find Algorithms 31: Weighted Graphs Minimum Spanning Tree Priority-First Search Kruskal's Method Shortest Path Minimum Spanning Tree and Shortest Paths in Dense Graphs Geometric Problems 32: Directed Graphs Depth-First Search Transitive Closure All Shortest Paths Topological Sorting Strongly Connected Components 33: Network Flow The Network Flow Problem Ford--Fulkerson Method Network Searching 34: Matching Bipartite Graphs Stable Marriage Problem Advanced Algorithms Mathematical Algorithms 35: Random Numbers Applications Linear Congruential Method Additive Congruential Method Testing Randomness Implementation Notes 36: Arithmetic Polynomial Arithmetic Polynomial Evaluation and Interpolation Polynomial Multiplication Arithmetic Operations with Large Integers Matrix Arithmetic 37: Gaussian Elimination A Simple Example Outline of the Method Variations and Extensions 38: Curve Fitting Polynomial Interpolation Spline Interpolation Method of Least Squares 39: Integration Symbolic Integration Simple Quadrature Methods Compound Methods Adaptive Quadrature Advanced Topics 40: Parallel Algorithms General Approaches Perfect Shuffles Systolic Arrays Perspective 41: The Fast Fourier Transform Evaluate, Multiply, Interpolate Complex Roots of Unity Evaluation at the Roots of Unity Interpolation at the Roots of Unity Implementation 42: Dynamic Programming Knapsack Problem Matrix Chain Product Optimal Binary Search Trees Time and Space Requirements 43: Linear Programming Linear Programs Geometric Interpretation The Simplex Method Implementation 44: Exhaustive Search Exhaustive Search in Graphs Backtracking Digression: Permutation Generation Approximation Algorithms 45: NP-Complete Problems Deterministic and Nondeterministic Polynomial-Time Algorithms NP-Completeness Cook's Theorem Some NP-Complete Problems

rawTOC:
Fundamentals \\ 1: Introduction \\ Algorithms \\ Outline of Topics \\ 2: C++ (and C) \\ Example: Euclid's Algorithm \\ Types of Data \\ Input/Output \\ Concluding Remarks \\ 3: Elementary Data Structures \\ Arrays \\ Linked Lists \\ Storage Allocation \\ Pushdown Stacks \\ Queues \\ Linked List Implementation of Stacks \\ Abstract and Concrete Data Types \\ 4: Trees \\ Glossary \\ Properties \\ Representing Binary Trees \\ Representing Forests \\ Traversing Trees \\ 5: Recursion \\ Recurrences \\ Divide-and-Conquer \\ Recursive Tree Traversal \\ Removing Recursion \\ Perspective \\ 6: Analysis of Algorithms \\ Framework \\ Classification of Algorithms \\ Computational Complexity \\ Average-Case Analysis \\ Approximate and Asymptotic Results \\ Basic Recurrences \\ Perspective \\ 7: Implementation of Algorithms \\ Selecting an Algorithm \\ Empirical Analysis \\ Program Optimization \\ Algorithms and Systems \\ Sorting Algorithms \\ 8: Elementary Sorting Methods \\ Rules of the Game \\ Selection Sort \\ Insertion Sort \\ Digression: Bubble Sort \\ Performance Characteristics of Elementary Sorts \\ Sorting Files with Large Records \\ Shellsort \\ Distribution Counting \\ 9: Quicksort \\ The Basic Algorithm \\ Performance Characteristics of Quicksort \\ Removing Recursion \\ Small Subfiles \\ Median-of-Three Partitioning \\ Selection \\ 10: Radix Sorting \\ Bits \\ Radix Exchange Sort \\ Straight Radix Sort \\ Performance Characteristics of Radix Sorts \\ A Linear Sort \\ 11: Priority Queues \\ Elementary Implementations \\ Heap Data Structure \\ Algorithms on Heaps \\ Heapsort \\ Indirect Heaps \\ Advanced Implementations \\ 12: Mergesort \\ Merging \\ Mergesort \\ List Mergesort \\ Bottom-Up Mergesort \\ Performance Characteristics \\ Optimized Implementations \\ Recursion Revisited \\ 13: External Sorting \\ Sort-Merge \\ Balanced Multiway Merging \\ Replacement Selection \\ Practical Considerations \\ Polyphase Merging \\ An Easier Way \\ Searching Algorithms \\ 14: Elementary Searching Methods \\ Sequential Searching \\ Binary Search \\ Binary Tree Search \\ Deletion \\ Indirect Binary Search Trees \\ 15: Balanced Trees \\ Top-Down 2-3-4 Trees \\ Red-Black Trees \\ Other Algorithms \\ 16: Hashing \\ Hash Functions \\ Separate Chaining \\ Linear Probing \\ Double Hashing \\ Perspective \\ 17: Radix Searching \\ Digital Search Trees \\ Radix Search Tries \\ Multiway Radix Searching \\ Patricia \\ 18: External Searching \\ Indexed Sequential Access \\ B-Trees \\ Extendible Hashing \\ Virtual Memory \\ String Processing \\ 19: String Searching \\ A Short History \\ Brute-Force Algorithm \\ Knuth--Morris--Pratt Algorithm \\ Boyer--Moore Algorithm \\ Rabin--Karp Algorithm \\ Multiple Searches \\ 20: Pattern Matching \\ Describing Patterns \\ Pattern Matching Machines \\ Representing the Machine \\ Simulating the Machine \\ 21: Parsing \\ Context-Free Grammars \\ Top-Down Parsing \\ Bottom-Up Parsing \\ Compilers \\ Compiler-Compilers \\ 22: File Compression \\ Run-Length Encoding \\ Variable-Length Encoding \\ Building the Huffman Code \\ Implementation \\ 23: Cryptology \\ Rules of the Game \\ Simple Methods \\ Encryption/Decryption Machines \\ Public-Key Cryptosystems \\ Geometric Algorithms \\ 24: Elementary Geometric Methods \\ Points, Lines, and Polygons \\ Line Segment Intersection \\ Simple Closed Path \\ Inclusion in a Polygon \\ Perspective \\ 25: Finding the Convex Hull \\ Rules of the Game \\ Package-Wrapping \\ The Graham Scan \\ Interior Elimination \\ Performance Issues \\ 26: Range Searching \\ Elementary Methods \\ Grid Method \\ Two-Dimensional Trees \\ Multidimensional Range Searching \\ 27: Geometric Intersection \\ Horizontal and Vertical Lines \\ Implementation \\ General Line Intersection \\ 28: Closest-Point Problems \\ Closest-Pair Problem \\ Voronoi Diagrams \\ Graph Algorithms \\ 29: Elementary Graph Algorithms \\ Glossary \\ Representation \\ Depth-First Search \\ Nonrecursive Depth-First Search \\ Breadth-First Search \\ Mazes \\ Perspective \\ 30: Connectivity \\ Connected Components \\ Biconnectivity \\ Union-Find Algorithms \\ 31: Weighted Graphs \\ Minimum Spanning Tree \\ Priority-First Search \\ Kruskal's Method \\ Shortest Path \\ Minimum Spanning Tree and Shortest Paths in Dense Graphs \\ Geometric Problems \\ 32: Directed Graphs \\ Depth-First Search \\ Transitive Closure \\ All Shortest Paths \\ Topological Sorting \\ Strongly Connected Components \\ 33: Network Flow \\ The Network Flow Problem \\ Ford--Fulkerson Method \\ Network Searching \\ 34: Matching \\ Bipartite Graphs \\ Stable Marriage Problem \\ Advanced Algorithms \\ Mathematical Algorithms \\ 35: Random Numbers \\ Applications \\ Linear Congruential Method \\ Additive Congruential Method \\ Testing Randomness \\ Implementation Notes \\ 36: Arithmetic \\ Polynomial Arithmetic \\ Polynomial Evaluation and Interpolation \\ Polynomial Multiplication \\ Arithmetic Operations with Large Integers \\ Matrix Arithmetic \\ 37: Gaussian Elimination \\ A Simple Example \\ Outline of the Method \\ Variations and Extensions \\ 38: Curve Fitting \\ Polynomial Interpolation \\ Spline Interpolation \\ Method of Least Squares \\ 39: Integration \\ Symbolic Integration \\ Simple Quadrature Methods \\ Compound Methods \\ Adaptive Quadrature \\ Advanced Topics \\ 40: Parallel Algorithms \\ General Approaches \\ Perfect Shuffles \\ Systolic Arrays \\ Perspective \\ 41: The Fast Fourier Transform \\ Evaluate, Multiply, Interpolate \\ Complex Roots of Unity \\ Evaluation at the Roots of Unity \\ Interpolation at the Roots of Unity \\ Implementation \\ 42: Dynamic Programming \\ Knapsack Problem \\ Matrix Chain Product \\ Optimal Binary Search Trees \\ Time and Space Requirements \\ 43: Linear Programming \\ Linear Programs \\ Geometric Interpretation \\ The Simplex Method \\ Implementation \\ 44: Exhaustive Search \\ Exhaustive Search in Graphs \\ Backtracking \\ Digression: Permutation Generation \\ Approximation Algorithms \\ 45: NP-Complete Problems \\ Deterministic and Nondeterministic Polynomial-Time Algorithms \\ NP-Completeness \\ Cook's Theorem \\ Some NP-Complete Problems

entry:
@Book{Sedgewick:1992:AC,
  author =       "Robert Sedgewick",
  title =        "Algorithms in {C++}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xiv + 656",
  year =         "1992",
  ISBN =         "0-201-36118-3, 0-201-51059-6",
  ISBN-13 =      "978-0-201-36118-6, 978-0-201-51059-1",
  LCCN =         "QA76.73.C153 S38 1992",
  MRclass =      "68N15, 68-01, 68-04, 68P10, 68W10, 68W15, 68N15",
  bibdate =      "Mon Jan 3 12:10:05 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/hash.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/numana1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
  ZMnumber =     "0826.68025",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "Fundamentals \\
                 1: Introduction \\
                 Algorithms \\
                 Outline of Topics \\
                 2: C++ (and C) \\
                 Example: Euclid's Algorithm \\
                 Types of Data \\
                 Input/Output \\
                 Concluding Remarks \\
                 3: Elementary Data Structures \\
                 Arrays \\
                 Linked Lists \\
                 Storage Allocation \\
                 Pushdown Stacks \\
                 Queues \\
                 Linked List Implementation of Stacks \\
                 Abstract and Concrete Data Types \\
                 4: Trees \\
                 Glossary \\
                 Properties \\
                 Representing Binary Trees \\
                 Representing Forests \\
                 Traversing Trees \\
                 5: Recursion \\
                 Recurrences \\
                 Divide-and-Conquer \\
                 Recursive Tree Traversal \\
                 Removing Recursion \\
                 Perspective \\
                 6: Analysis of Algorithms \\
                 Framework \\
                 Classification of Algorithms \\
                 Computational Complexity \\
                 Average-Case Analysis \\
                 Approximate and Asymptotic Results \\
                 Basic Recurrences \\
                 Perspective \\
                 7: Implementation of Algorithms \\
                 Selecting an Algorithm \\
                 Empirical Analysis \\
                 Program Optimization \\
                 Algorithms and Systems \\
                 Sorting Algorithms \\
                 8: Elementary Sorting Methods \\
                 Rules of the Game \\
                 Selection Sort \\
                 Insertion Sort \\
                 Digression: Bubble Sort \\
                 Performance Characteristics of Elementary Sorts \\
                 Sorting Files with Large Records \\
                 Shellsort \\
                 Distribution Counting \\
                 9: Quicksort \\
                 The Basic Algorithm \\
                 Performance Characteristics of Quicksort \\
                 Removing Recursion \\
                 Small Subfiles \\
                 Median-of-Three Partitioning \\
                 Selection \\
                 10: Radix Sorting \\
                 Bits \\
                 Radix Exchange Sort \\
                 Straight Radix Sort \\
                 Performance Characteristics of Radix Sorts \\
                 A Linear Sort \\
                 11: Priority Queues \\
                 Elementary Implementations \\
                 Heap Data Structure \\
                 Algorithms on Heaps \\
                 Heapsort \\
                 Indirect Heaps \\
                 Advanced Implementations \\
                 12: Mergesort \\
                 Merging \\
                 Mergesort \\
                 List Mergesort \\
                 Bottom-Up Mergesort \\
                 Performance Characteristics \\
                 Optimized Implementations \\
                 Recursion Revisited \\
                 13: External Sorting \\
                 Sort-Merge \\
                 Balanced Multiway Merging \\
                 Replacement Selection \\
                 Practical Considerations \\
                 Polyphase Merging \\
                 An Easier Way \\
                 Searching Algorithms \\
                 14: Elementary Searching Methods \\
                 Sequential Searching \\
                 Binary Search \\
                 Binary Tree Search \\
                 Deletion \\
                 Indirect Binary Search Trees \\
                 15: Balanced Trees \\
                 Top-Down 2-3-4 Trees \\
                 Red-Black Trees \\
                 Other Algorithms \\
                 16: Hashing \\
                 Hash Functions \\
                 Separate Chaining \\
                 Linear Probing \\
                 Double Hashing \\
                 Perspective \\
                 17: Radix Searching \\
                 Digital Search Trees \\
                 Radix Search Tries \\
                 Multiway Radix Searching \\
                 Patricia \\
                 18: External Searching \\
                 Indexed Sequential Access \\
                 B-Trees \\
                 Extendible Hashing \\
                 Virtual Memory \\
                 String Processing \\
                 19: String Searching \\
                 A Short History \\
                 Brute-Force Algorithm \\
                 Knuth--Morris--Pratt Algorithm \\
                 Boyer--Moore Algorithm \\
                 Rabin--Karp Algorithm \\
                 Multiple Searches \\
                 20: Pattern Matching \\
                 Describing Patterns \\
                 Pattern Matching Machines \\
                 Representing the Machine \\
                 Simulating the Machine \\
                 21: Parsing \\
                 Context-Free Grammars \\
                 Top-Down Parsing \\
                 Bottom-Up Parsing \\
                 Compilers \\
                 Compiler-Compilers \\
                 22: File Compression \\
                 Run-Length Encoding \\
                 Variable-Length Encoding \\
                 Building the Huffman Code \\
                 Implementation \\
                 23: Cryptology \\
                 Rules of the Game \\
                 Simple Methods \\
                 Encryption/Decryption Machines \\
                 Public-Key Cryptosystems \\
                 Geometric Algorithms \\
                 24: Elementary Geometric Methods \\
                 Points, Lines, and Polygons \\
                 Line Segment Intersection \\
                 Simple Closed Path \\
                 Inclusion in a Polygon \\
                 Perspective \\
                 25: Finding the Convex Hull \\
                 Rules of the Game \\
                 Package-Wrapping \\
                 The Graham Scan \\
                 Interior Elimination \\
                 Performance Issues \\
                 26: Range Searching \\
                 Elementary Methods \\
                 Grid Method \\
                 Two-Dimensional Trees \\
                 Multidimensional Range Searching \\
                 27: Geometric Intersection \\
                 Horizontal and Vertical Lines \\
                 Implementation \\
                 General Line Intersection \\
                 28: Closest-Point Problems \\
                 Closest-Pair Problem \\
                 Voronoi Diagrams \\
                 Graph Algorithms \\
                 29: Elementary Graph Algorithms \\
                 Glossary \\
                 Representation \\
                 Depth-First Search \\
                 Nonrecursive Depth-First Search \\
                 Breadth-First Search \\
                 Mazes \\
                 Perspective \\
                 30: Connectivity \\
                 Connected Components \\
                 Biconnectivity \\
                 Union-Find Algorithms \\
                 31: Weighted Graphs \\
                 Minimum Spanning Tree \\
                 Priority-First Search \\
                 Kruskal's Method \\
                 Shortest Path \\
                 Minimum Spanning Tree and Shortest Paths in Dense
                 Graphs \\
                 Geometric Problems \\
                 32: Directed Graphs \\
                 Depth-First Search \\
                 Transitive Closure \\
                 All Shortest Paths \\
                 Topological Sorting \\
                 Strongly Connected Components \\
                 33: Network Flow \\
                 The Network Flow Problem \\
                 Ford--Fulkerson Method \\
                 Network Searching \\
                 34: Matching \\
                 Bipartite Graphs \\
                 Stable Marriage Problem \\
                 Advanced Algorithms \\
                 Mathematical Algorithms \\
                 35: Random Numbers \\
                 Applications \\
                 Linear Congruential Method \\
                 Additive Congruential Method \\
                 Testing Randomness \\
                 Implementation Notes \\
                 36: Arithmetic \\
                 Polynomial Arithmetic \\
                 Polynomial Evaluation and Interpolation \\
                 Polynomial Multiplication \\
                 Arithmetic Operations with Large Integers \\
                 Matrix Arithmetic \\
                 37: Gaussian Elimination \\
                 A Simple Example \\
                 Outline of the Method \\
                 Variations and Extensions \\
                 38: Curve Fitting \\
                 Polynomial Interpolation \\
                 Spline Interpolation \\
                 Method of Least Squares \\
                 39: Integration \\
                 Symbolic Integration \\
                 Simple Quadrature Methods \\
                 Compound Methods \\
                 Adaptive Quadrature \\
                 Advanced Topics \\
                 40: Parallel Algorithms \\
                 General Approaches \\
                 Perfect Shuffles \\
                 Systolic Arrays \\
                 Perspective \\
                 41: The Fast Fourier Transform \\
                 Evaluate, Multiply, Interpolate \\
                 Complex Roots of Unity \\
                 Evaluation at the Roots of Unity \\
                 Interpolation at the Roots of Unity \\
                 Implementation \\
                 42: Dynamic Programming \\
                 Knapsack Problem \\
                 Matrix Chain Product \\
                 Optimal Binary Search Trees \\
                 Time and Space Requirements \\
                 43: Linear Programming \\
                 Linear Programs \\
                 Geometric Interpretation \\
                 The Simplex Method \\
                 Implementation \\
                 44: Exhaustive Search \\
                 Exhaustive Search in Graphs \\
                 Backtracking \\
                 Digression: Permutation Generation \\
                 Approximation Algorithms \\
                 45: NP-Complete Problems \\
                 Deterministic and Nondeterministic Polynomial-Time
                 Algorithms \\
                 NP-Completeness \\
                 Cook's Theorem \\
                 Some NP-Complete Problems",
}


