Princeton Alumni Weekly
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Tarjan Transcript Final with Timestamps
A.M. Turing Award Oral History Interview with Robert (Bob) Endre Tarjan by Roy Levin San Mateo, California July 12, 2017 Levin: My name is Roy Levin. Today is July 12th, 2017, and I’m in San Mateo, California at the home of Robert Tarjan, where I’ll be interviewing him for the ACM Turing Award Winners project. Good afternoon, Bob, and thanks for spending the time to talk to me today. Tarjan: You’re welcome. Levin: I’d like to start by talking about your early technical interests and where they came from. When do you first recall being interested in what we might call technical things? Tarjan: Well, the first thing I would say in that direction is my mom took me to the public library in Pomona, where I grew up, which opened up a huge world to me. I started reading science fiction books and stories. Originally, I wanted to be the first person on Mars, that was what I was thinking, and I got interested in astronomy, started reading a lot of science stuff. I got to junior high school and I had an amazing math teacher. His name was Mr. Wall. I had him two years, in the eighth and ninth grade. He was teaching the New Math to us before there was such a thing as “New Math.” He taught us Peano’s axioms and things like that. It was a wonderful thing for a kid like me who was really excited about science and mathematics and so on. The other thing that happened was I discovered Scientific American in the public library and started reading Martin Gardner’s columns on mathematical games and was completely fascinated. -
1. Course Information Are Handed Out
6.826—Principles of Computer Systems 2006 6.826—Principles of Computer Systems 2006 course secretary's desk. They normally cover the material discussed in class during the week they 1. Course Information are handed out. Delayed submission of the solutions will be penalized, and no solutions will be accepted after Thursday 5:00PM. Students in the class will be asked to help grade the problem sets. Each week a team of students Staff will work with the TA to grade the week’s problems. This takes about 3-4 hours. Each student will probably only have to do it once during the term. Faculty We will try to return the graded problem sets, with solutions, within a week after their due date. Butler Lampson 32-G924 425-703-5925 [email protected] Policy on collaboration Daniel Jackson 32-G704 8-8471 [email protected] We encourage discussion of the issues in the lectures, readings, and problem sets. However, if Teaching Assistant you collaborate on problem sets, you must tell us who your collaborators are. And in any case, you must write up all solutions on your own. David Shin [email protected] Project Course Secretary During the last half of the course there is a project in which students will work in groups of three Maria Rebelo 32-G715 3-5895 [email protected] or so to apply the methods of the course to their own research projects. Each group will pick a Office Hours real system, preferably one that some member of the group is actually working on but possibly one from a published paper or from someone else’s research, and write: Messrs. -
Literary, Subsidiary, and Foreign Rights Agents
Literary, Subsidiary, and Foreign Rights Agents A Mini-Guide by John Kremer Copyright © 2011 by John Kremer All rights reserved. Open Horizons P. O. Box 2887 Taos NM 87571 575-751-3398 Fax: 575-751-3100 Email: [email protected] Web: http://www.bookmarket.com Introduction Below are the names and contact information for more than 1,450+ literary agents who sell rights for books. For additional lists, see the end of this report. The agents highlighted with a bigger indent are known to work with self-publishers or publishers in helping them to sell subsidiary, film, foreign, and reprint rights for books. All 325+ foreign literary agents (highlighted in bold green) listed here are known to work with one or more independent publishers or authors in selling foreign rights. Some of the major literary agencies are highlighted in bold red. To locate the 260 agents that deal with first-time novelists, look for the agents highlighted with bigger type. You can also locate them by searching for: “first novel” by using the search function in your web browser or word processing program. Unknown author Jennifer Weiner was turned down by 23 agents before finding one who thought a novel about a plus-size heroine would sell. Her book, Good in Bed, became a bestseller. The lesson? Don't take 23 agents word for it. Find the 24th that believes in you and your book. When querying agents, be selective. Don't send to everyone. Send to those that really look like they might be interested in what you have to offer. -
“Mama Tried”--Merle Haggard (1968) Added to the National Registry: 2015 Essay by Rachel Rubin (Guest Post)*
“Mama Tried”--Merle Haggard (1968) Added to the National Registry: 2015 Essay by Rachel Rubin (guest post)* “Mama Tried” original LP cover When Merle Haggard released “Mama Tried” in 1968, it quickly became his biggest hit. But, although in terms of broad reception, the song would be shortly eclipsed by the controversies surrounding Haggard’s “Okie from Muskogee” (released the next year), “Mama Tried” was a path-breaking song in several significant ways. It efficiently marked important, shaping changes to country music made by the generation of musicians and audiences who came of age post-World War II (as did Haggard, who born in 1937). “Mama Tried,” then, encompasses and articulates developments of both Haggard’s career and artistic focus, and the direction of country music in general. Indeed, Haggard’s own story usefully traces the trajectory of modern country music. Haggard was born near the city of Bakersfield, California, in a converted boxcar. He was born two years after his parents, who were devastated Dust Bowl “Okies,” traveled there from East Oklahoma as part of the migration most famously represented by John Steinbeck in “Grapes of Wrath” (1939)--an important novel that presented and commented on the class-based contempt that “Okies” faced in California. Haggard confronted this contempt throughout his career (and even after his 2016 death, the class- based contempt continues). His family (including Haggard himself) took up a range of jobs, including agricultural work, truck-driving, and oil-well drilling. Labor remained a defining factor of Haggard’s music until he died in 2016, and he frequently found ways to refer to his musicianship as work (making a sharp joke on an album, for instance, about the connection between picking cotton and picking guitar). -
The Growth of Cryptography
The growth of cryptography Ronald L. Rivest Viterbi Professor of EECS MIT, Cambridge, MA James R. Killian Jr. Faculty Achievement Award Lecture February 8, 2011 Outline Some pre-1976 context Invention of Public-Key Crypto and RSA Early steps The cryptography business Crypto policy Attacks More New Directions What Next? Conclusion and Acknowledgments Outline Some pre-1976 context Invention of Public-Key Crypto and RSA Early steps The cryptography business Crypto policy Attacks More New Directions What Next? Conclusion and Acknowledgments The greatest common divisor of two numbers is easily computed (using “Euclid’s Algorithm”): gcd(12; 30) = 6 Euclid – 300 B.C. There are infinitely many primes: 2, 3, 5, 7, 11, 13, . Euclid – 300 B.C. There are infinitely many primes: 2, 3, 5, 7, 11, 13, . The greatest common divisor of two numbers is easily computed (using “Euclid’s Algorithm”): gcd(12; 30) = 6 Greek Cryptography – The Scytale An unknown period (the circumference of the scytale) is the secret key, shared by sender and receiver. Euler’s Theorem (1736): If gcd(a; n) = 1, then aφ(n) = 1 (mod n) ; where φ(n) = # of x < n such that gcd(x; n) = 1. Pierre de Fermat (1601-1665) Leonhard Euler (1707–1783) Fermat’s Little Theorem (1640): For any prime p and any a, 1 ≤ a < p: ap−1 = 1 (mod p) Pierre de Fermat (1601-1665) Leonhard Euler (1707–1783) Fermat’s Little Theorem (1640): For any prime p and any a, 1 ≤ a < p: ap−1 = 1 (mod p) Euler’s Theorem (1736): If gcd(a; n) = 1, then aφ(n) = 1 (mod n) ; where φ(n) = # of x < n such that gcd(x; n) = 1. -
The RSA Algorithm
The RSA Algorithm Evgeny Milanov 3 June 2009 In 1978, Ron Rivest, Adi Shamir, and Leonard Adleman introduced a cryptographic algorithm, which was essentially to replace the less secure National Bureau of Standards (NBS) algorithm. Most impor- tantly, RSA implements a public-key cryptosystem, as well as digital signatures. RSA is motivated by the published works of Diffie and Hellman from several years before, who described the idea of such an algorithm, but never truly developed it. Introduced at the time when the era of electronic email was expected to soon arise, RSA implemented two important ideas: 1. Public-key encryption. This idea omits the need for a \courier" to deliver keys to recipients over another secure channel before transmitting the originally-intended message. In RSA, encryption keys are public, while the decryption keys are not, so only the person with the correct decryption key can decipher an encrypted message. Everyone has their own encryption and decryption keys. The keys must be made in such a way that the decryption key may not be easily deduced from the public encryption key. 2. Digital signatures. The receiver may need to verify that a transmitted message actually origi- nated from the sender (signature), and didn't just come from there (authentication). This is done using the sender's decryption key, and the signature can later be verified by anyone, using the corresponding public encryption key. Signatures therefore cannot be forged. Also, no signer can later deny having signed the message. This is not only useful for electronic mail, but for other electronic transactions and transmissions, such as fund transfers. -
Toward a Mathematical Semantics for Computer Languages
(! 1 J TOWARD A MATHEMATICAL SEMANTICS FOR COMPUTER LANGUAGES by Dana Scott and - Christopher Strachey Oxford University Computing Laboratory Programming Research Group-Library 8-11 Keble Road Oxford OX, 3QD Oxford (0865) 54141 Oxford University Computing Laboratory Programming Research Group tI. cr• "';' """, ":.\ ' OXFORD UNIVERSITY COMPUTING LABORATORY PROGRAMMING RESEARCH GROUP ~ 4S BANBURY ROAD \LJ OXFORD ~ .. 4 OCT 1971 ~In (UY'Y L TOWARD A ~ATHEMATICAL SEMANTICS FOR COMPUTER LANGUAGES by Dana Scott Princeton University and Christopher Strachey Oxford University Technical Monograph PRG-6 August 1971 Oxford University Computing Laboratory. Programming Research Group, 45 Banbury Road, Oxford. ~ 1971 Dana Scott and Christopher Strachey Department of Philosophy, Oxford University Computing Laboratory. 1879 lIall, Programming Research Group. Princeton University, 45 Banbury Road. Princeton. New Jersey 08540. Oxford OX2 6PE. This pape r is also to appear in Fl'(.'ceedinBs 0;- the .';y-,;;;o:illT:: on ComputeT's and AutoJ7'ata. lo-licroloo'ave Research Institute Symposia Series Volume 21. Polytechnic Institute of Brooklyn. and appears as a Technical Monograph by special aJ"rangement ...·ith the publishers. RefeJ"~nces in the Ii terature should be:- made to the _"!'OL·,-,',~;r:gs, as the texts are identical and the Symposia Sl?ries is gcaerally available in libraries. ABSTRACT Compilers for high-level languages aTe generally constructed to give the complete translation of the programs into machme language. As machines merely juggle bit patterns, the concepts of the original language may be lost or at least obscured during this passage. The purpose of a mathematical semantics is to give a correct and meaningful correspondence between programs and mathematical entities in a way that is entirely independent of an implementation. -
Why Mathematical Proof?
Why Mathematical Proof? Dana S. Scott, FBA, FNAS University Professor Emeritus Carnegie Mellon University Visiting Scholar University of California, Berkeley NOTICE! The author has plagiarized text and graphics from innumerable publications and sites, and he has failed to record attributions! But, as this lecture is intended as an entertainment and is not intended for publication, he regards such copying, therefore, as “fair use”. Keep this quiet, and do please forgive him. A Timeline for Geometry Some Greek Geometers Thales of Miletus (ca. 624 – 548 BC). Pythagoras of Samos (ca. 580 – 500 BC). Plato (428 – 347 BC). Archytas (428 – 347 BC). Theaetetus (ca. 417 – 369 BC). Eudoxus of Cnidus (ca. 408 – 347 BC). Aristotle (384 – 322 BC). Euclid (ca. 325 – ca. 265 BC). Archimedes of Syracuse (ca. 287 – ca. 212 BC). Apollonius of Perga (ca. 262 – ca. 190 BC). Claudius Ptolemaeus (Ptolemy)(ca. 90 AD – ca. 168 AD). Diophantus of Alexandria (ca. 200 – 298 AD). Pappus of Alexandria (ca. 290 – ca. 350 AD). Proclus Lycaeus (412 – 485 AD). There is no Royal Road to Geometry Euclid of Alexandria ca. 325 — ca. 265 BC Euclid taught at Alexandria in the time of Ptolemy I Soter, who reigned over Egypt from 323 to 285 BC. He authored the most successful textbook ever produced — and put his sources into obscurity! Moreover, he made us struggle with proofs ever since. Why Has Euclidean Geometry Been So Successful? • Our naive feeling for space is Euclidean. • Its methods have been very useful. • Euclid also shows us a mysterious connection between (visual) intuition and proof. The Pythagorean Theorem Euclid's Elements: Proposition 47 of Book 1 The Pythagorean Theorem Generalized If it holds for one Three triple, Similar it holds Figures for all. -
November 2017
COLONIAL CLUB Fall Newsletter November 2017 GRADUATE BOARD OF GOVERNORS Angelica Pedraza ‘12 President A Letter from THE PRESIDENT David Genetti ’98 Vice President OF THE GRADUATE BOARD Joseph Studholme ’84 Treasurer Paul LeVine, Jr. ’72 Secretary Dear Colonial Family, Kristen Epstein ‘97 We are excited to welcome back the Colonial undergraduate Norman Flitt ‘72 members for what is sure to be another great year at the Club. Sean Hammer ‘08 John McMurray ‘95 Fall is such a special time on campus. The great class of 2021 has Sev Onyshkevych ‘83 just passed through FitzRandolph Gate, the leaves are beginning Edward Ritter ’83 to change colors, and it’s the one time of year that orange is Adam Rosenthal, ‘11 especially stylish! Andrew Stein ‘90 Hal L. Stern ‘84 So break out all of your orange swag, because Homecoming is November 11th. Andrew Weintraub ‘10 In keeping with tradition, the Club will be ready to welcome all of its wonderful alumni home for Colonial’s Famous Champagne Brunch. Then, the Tigers take on the Bulldogs UNDERGRADUATE OFFICERS at 1:00pm. And, after the game, be sure to come back to the Club for dinner. Matthew Lucas But even if you can’t make it to Homecoming, there are other opportunities to stay President connected. First, Colonial is working on an updated Club history to commemorate our Alisa Fukatsu Vice-President 125th anniversary, which we celebrated in 2016. Former Graduate Board President, Alexander Regent Joseph Studholme, is leading the charge and needs your help. If you have any pictures, Treasurer stories, or memorabilia from your time at the club, please contact the Club Manager, Agustina de la Fuente Kathleen Galante, at [email protected]. -
The Origins of Structural Operational Semantics
The Origins of Structural Operational Semantics Gordon D. Plotkin Laboratory for Foundations of Computer Science, School of Informatics, University of Edinburgh, King’s Buildings, Edinburgh EH9 3JZ, Scotland I am delighted to see my Aarhus notes [59] on SOS, Structural Operational Semantics, published as part of this special issue. The notes already contain some historical remarks, but the reader may be interested to know more of the personal intellectual context in which they arose. I must straightaway admit that at this distance in time I do not claim total accuracy or completeness: what I write should rather be considered as a reconstruction, based on (possibly faulty) memory, papers, old notes and consultations with colleagues. As a postgraduate I learnt the untyped λ-calculus from Rod Burstall. I was further deeply impressed by the work of Peter Landin on the semantics of pro- gramming languages [34–37] which includes his abstract SECD machine. One should also single out John McCarthy’s contributions [45–48], which include his 1962 introduction of abstract syntax, an essential tool, then and since, for all approaches to the semantics of programming languages. The IBM Vienna school [42, 41] were interested in specifying real programming languages, and, in particular, worked on an abstract interpreting machine for PL/I using VDL, their Vienna Definition Language; they were influenced by the ideas of McCarthy, Landin and Elgot [18]. I remember attending a seminar at Edinburgh where the intricacies of their PL/I abstract machine were explained. The states of these machines are tuples of various kinds of complex trees and there is also a stack of environments; the transition rules involve much tree traversal to access syntactical control points, handle jumps, and to manage concurrency. -
A Library of Graph Algorithms and Supporting Data Structures
Washington University in St. Louis Washington University Open Scholarship All Computer Science and Engineering Research Computer Science and Engineering Report Number: WUCSE-2015-001 2015-01-19 Grafalgo - A Library of Graph Algorithms and Supporting Data Structures Jonathan Turner This report provides an overview of Grafalgo, an open-source library of graph algorithms and the data structures used to implement them. The programs in this library were originally written to support a graduate class in advanced data structures and algorithms at Washington University. Because the code's primary purpose was pedagogical, it was written to be as straightforward as possible, while still being highly efficient. afalgoGr is implemented in C++ and incorporates some features of C++11. The library is available on an open-source basis and may be downloaded from https://code.google.com/p/grafalgo/. Source code documentation is at www.arl.wustl.edu/~jst/doc/grafalgo. While not designed as... Read complete abstract on page 2. Follow this and additional works at: https://openscholarship.wustl.edu/cse_research Part of the Computer Engineering Commons, and the Computer Sciences Commons Recommended Citation Turner, Jonathan, "Grafalgo - A Library of Graph Algorithms and Supporting Data Structures" Report Number: WUCSE-2015-001 (2015). All Computer Science and Engineering Research. https://openscholarship.wustl.edu/cse_research/242 Department of Computer Science & Engineering - Washington University in St. Louis Campus Box 1045 - St. Louis, MO - 63130 - ph: (314) 935-6160. This technical report is available at Washington University Open Scholarship: https://openscholarship.wustl.edu/ cse_research/242 Grafalgo - A Library of Graph Algorithms and Supporting Data Structures Jonathan Turner Complete Abstract: This report provides an overview of Grafalgo, an open-source library of graph algorithms and the data structures used to implement them. -
Princeton USG Senate Meeting 8 April 15, 2018 4: 30 Guyot Hall 10 Introduction 1. President's Report (5 Minutes) N
Princeton USG Senate Meeting 8 April 15, 2018 4: 30 Guyot Hall 10 Introduction 1. President’s Report (5 minutes) New Business 1. Movies Committee Budget Request: Jona Mojados (5 minutes) 2. CCA Day of Action Presentation: Caleb Visser and Eliza Wright (15 minutes) 3. Projects Board Funding Approval: Isabella Bosetti and Eliot Chen (5 minutes) 4. USG Office Makeover: Grace Lee (5 minutes) 5. SGRC Co-Chair Appointments and Student Group Approval: Aaron Sobel and Emily Chen (7 minutes) 6. Student Health Task Force Proposal: Brad Spicher (5 minutes) 7. Senator Accountability/Transparency Proposal: Kade McCorvy (15 minutes) 8. Office Hours/Coffee Chat Proposal: Kade McCorvy (10 minutes) 9. PHA Mini-Grants Proposal: Parker Kushima (5 minutes) 10. Calendar Reform Resolution: Olivia Ott (10 minutes) 11. MHI Video Project: Josh Gardner and Casey Kemper Consent Agenda 1. Matthew Ramirez-2019: a. My name is Matt Ramirez, Class of 2019, Southern California born and raised. I’m an EEB major interested in Environmental Policy, and an elected officer of the Colonial Club. I look forward to serving on the Diversity & Equity Committee so that I can contribute to our inclusive campus culture, that has long been so welcoming to me. 2. Nivida Thomas-2020: a. Hi everyone! My name is Nivida Thomas and I am a sophomore from Seattle, WA. I am involved with the CONTACT Suicide Hotline, Princeton Bhangra, and WPRB News and Culture team. I look forward to getting t know you all as we work towards a more inclusive and diverse campus! 3. Hyojin Lee- 2020: a.