CSCI 587 - Lecture 7 Collation and Stylistic Analysis

• Assignment 3
  • HW sets 1 and 2; solutions and comments
  • tr
  • DecipherScript
  • trim #1 to Carolina, #6 2pts extra Credit
• RSA one last time
  • Setting Up RSA
    • Generate two large primes p and q
    • Compute n = pq and phi(n) = (p-1)(q-1)
    • Choose random number e, such that gcd(e, phi(n))=1
    • Compute d = the inverse of e mod phi(n) using the Euclidean algorithm
    • (n, e) is the public key
  • extended Euclidean algorithm for computing d
  • Encoding
  • Decoding
  • Multiply and square algorithm
    • for computing x**b mod n
    • p = 1
    • for i = BinaryLength(b)-1 downto 0 do
    • p = p*p mod n
    • if bi = 1 then p = p*x mod n
  • Finding large primes
• Digital signatures
• Unix: passwords, crypt, vi -x, crack
• PGP: Phil Zimmerman's Pretty Good Protection
• Clipper Chip: trapdoor
• Digital cash:

• Concordance Computations

  • Insert words into tree, each node contains linked list of lines
  • Omit "common words"
  • KWOC
  • KWIC

• Text Formatting

  • nroff family
  • TeX, LaTeX
  • WYSIWYG - word, wordperfect, ami pro
  • postscript
  • html

• Text Collation

  • comparison of text to identify variants
  • Unix diff , diff3, diffmk
  • more than two versions

• Stylistic Analysis

  • What is linguistic style?
    "thought and expression come together in style" Oakman
  • computable style
  • authorship analysis
    • Word frequencies. +words -words
    • Interval between successive occurrences of certain words
    • Plato's seventh letter

• Prolog Introduction

  Readings
  Computer Methods for Literary Research by Robert L. Oakman, Univ. of Georgia Press.
  Assignment 3 Due Feb 11 Assignment3 Link

  URL = http://sourgum.cs.sc.edu/~matthews/Courses/587/Lectures/lecture7.html