cs/ee583...
Post on 10-Oct-2020
0 Views
Preview:
TRANSCRIPT
CS/EE 583 Visualiza0ons of Papers/Authors
Spring 2015, Prof. Martonosi mrm@princeton.edu
The assignment was to create any visualiza0on, either
serious or funny. Before reusing anywhere, please contact me for each slide’s aLribu0on names.
Papers by Research Loca/on • Arlington, VA
– Cerf/Kahn (1/2) • Berkeley, CA
– RAID – Searle
• Cambridge, MA – SPACEWAR! – Mul/cs – Liskov x 2 – RSA – Shannon – Sketchpad – Valiant
• Cambridge, UK – Turing
(Computability) – Wilkes
• Cork, Ireland – Boole
• La Jolla, CA (San Diego) – Back-‐Propaga/on
(1/2) • Manchester, UK
– Kilburn – Turing (Imita/on
Game) • Menlo Park, CA
– Engelbart – Lamport x 2
• Mountain View, CA – Moore’s Law
(retrospec/ve) • Murray Hill, NJ
– UNIX – Shor’s Algorithm
• New York City, NY – FORTRAN
• Palo Alto, CA – Kay – Ethernet – Moore’s Law (original) – Weiser
• Philadelphia, PA – Hopper
• Pi[sburgh, PA – Back-‐Propaga/on
(1/2) • Princeton, NJ
– Burks • Stanford, CA
– Cryptography – PageRank – Cerf/Kahn (1/2)
• Washington, D.C. – Bush
Loca/ons and Weights • Cambridge, MA – 5 • Cambridge, UK – 1.5 • Cork, Ireland -‐ 0.5 • La Jolla, CA – 0.25 • Manchester, UK – 1 • Murray Hill, NJ – 2 • New York, NY – 0.5 • Philadelphia, PA – 0.5 • Pi[sburgh, PA – 0.25 • Princeton, NJ – 0.5 • Silicon Valley – 8.5 • Washington, D.C. Area – 1.5
If papers in this class we the focus of a departmental, which track would that course be counted as?
(Or, a visualization of why I can’t find my last theory course)Cody Wilson, COS 583 Prof. Martonosi, 4/29/15
From Publication to ReceptionTuring Award Winners Over Time
]
East Coast West Coast UK
Facial Hair
No Facial Hair
Dennis, Thompson, Ritchie, Rivest,
Shamir, Lamport, Shor
Cerf, Diffie, Hellman, Brin, Kay,
Weiser
Shannon, Turing, Kahn, Von
Neumann, Burks, Goldstine,
Sutherland, Valiant, Hopper, Backus, Adleman, Liskov
Searle, Metcalf, Boggs, Katz,
Patterson, Gibson, Engelbart, Hinton, Rumelhart, Moore,
Page
Boole, Turing, Wilkes, Kilburn
Dan Kang Syllabus Visualization: Birthplaces of the authors of the Great Moments papers
An Institutional Breakdown Can you make money
AND be Great? West Coast Best Coast?
Great Insights(what I callgreat moments)
Great SystemsGreat Trends
Boolean Logic
Artificial Intelligence
TCP/IP
Ethernet
Early Architectures
Computability
Virtual Memory/Multics
Sketchpad
Unix RAIDMouse
Machine Learning
Moore’s Law
Compilers
Asymmetric Encryption
Data Abstraction
Computer Games
PageRank
Consistency
Shor’s Algorithm
UbiquitousComputing
• Mean: 9.65 pages • Median: 9 pages • Mode: 11 pages • Stdev: 4.94 pages - Yatin Manerkar
0
1
2
3
4
5
6
7
8
Fre
qu
en
cy
Pages
How Many Pages Does It Take To Achieve Greatness?
0
1
2
3
4
5
6 # of Great M
omen
t Autho
rs
Birth Month
Cerf and Kahn: BAD MATCH Ritchie and Thompson: Opposite qualiEes, good partners Diffie and Hellman: GREAT MATCH! RSA: R&S = Good match, R&A = GREAT match, S&A = BAD MATCH Brin and Page: GREAT MATCH!
Great Moment Authors by Birth Month and
Zodiac Sign!!
Tess Marchant!COS 583!
0
10
20
30
40
50
60
1840 1860 1880 1900 1920 1940 1960 1980 2000 2020
Au
tho
r's
Age
Paper Publication Year
Author's Age when Paper was Published
WORD CLOUDS OVER THE DECADES BY SHUBHRO SAHA
1960s 1970s
1980s 1990s
Stephen Cook
Boole
Shannon Burks, von Neumann
(thousands)
Searle
Valiant
Patterson/Gibson/Katz
Weiser
Brin/Page
Shor
Spacewar!Kay
Cerf/KahnRitchie/Thompson
Metcalfe/BoggsDiffie/Hellman
Liskov
Rivest et. alLamport
Turing Turing
Wilkes
Hopper
BackusSutherland
Moore
EngelbartKilburn
Boolean Algebra
[1854] George Boole Computability[1936] Alan
Turing Digital circuits[1938] Claude Shannon
Back to the Future
[1945] Vannevar
Bush
Early Architectures
[1946] Burks, Goldstine & von Neuman
Artificial Intelligence:
The Imitation Game
[1950] Alan Turing
Compilers[1952] Grace
Hopper
Fortran Compiler
[1957] Backus et
al.
Virtual Memory
[1962] Kilburn et
al.
Computer Games
[1962] Spacewar!
Human Computer
Interaction: Sketchpad
[1963] Ivan
Sutherland
Early Architectures
[1965] Wilkes
Moore's Law
[1965] Gordon Moore
Virtual Memory (Multics)
[1968] Daley & Dennis
Invention of the Mouse
[1970] Engelbart
Personal Computing: Dynabook
[1972] Alan Kay
Network Protocols:
TCP
[1974] Cerf & Kahn
UNIX[1974]
Ritchie & Thompson
Ethernet[1976]
Metcalfe & Boggs
Public Key Cryptography
and Diffie Hellman Key
Exchange
[1976] Diffie & Hellman
Data Abstraction
[1977] Liskov et
al.
Public Key Cryptography:
RSA
[1978] Rivest, Shamir,
Adleman
Event Ordering and
Memory Consistency
[1978] Lamport
Artificial Intelligence:
Chinese Room Example
[1980] John
Searle
Machine Learning
[1984] Valiant [1986]
Rumelhart
RAID: Redundant Arrays of
Inexpensive Disks
[1988] Patterson et
al.
Ubiquitous Computing
[1993] Weiser
Quantum Computing:
Shor's Algorithm for Factorization and Discrete
Logarithm
[1997] Peter Shor
PageRank Algorithm and
[1998] Brin & Page
Smile on your face if you note this
easter egg is surely a great
moment!
[2015] COS/ELE583
Folks
Number of Degrees Granted to the Great-Moment Authors
BerkeleyStanford
MITPrincetonMichigan
CambridgeHarvard
UCLACaltech
ChicagoBudapest
YaleOxford
TuftsManchester
Weizmann InstituteBrandeis
UtahWisconsin
DePauwZTH
CMUImperial College
NYUOregon State
VassarCity College of NY
Tel AvivBerlin
TorontoWaterloo
CornellSouth Dakota
ColoradoColumbiaWarwick
# of Degrees Granted0 2 4 6 8 10 12 14
1
1111
1111
12
312
35
54
1
1
1111
11
111
222
123
37
5
11111111111
1111
1
111111
42
14
14
BS MS PhD
Amount of Studies Required to Produce All Great Moments We Learned.
0
60
120
180
240
300
360
420
480
540
600
Bachelor Master PhD All Degrees
547
333
70
144111
353838
Number of Degrees Estimated # of Years of Studies
Amount of Studies to Produce one Great Moment
0
3
6
9
12
15
18
21
24
27
30
Bachelor Master PhD All Degrees
24.864
15.136
3.182
6.5455.045
1.5911.7271.727
# of Degrees per Great Moment# of Years of Studies per Great Moment
How Much Education Did Great Moments Take?
COS 583 – Themistoklis Melissaris The awards are ACM Fellow (FACM), IEEE Fellow, Turing Award, Member of the American Academy of Arts and Sciences (AAAS), Member of the National Academy of Engineering (NAE) and National Medal of Technology (NMT). Some authors (Boole, Turing, Von Neumann) lived before these awards were established. The total number of authors is 35. FACM FIEE Turing Award AAAS NAE NMT Adleman 1 1 Backus 1 Boggs 1 1 Boole 1 Brin 1 Cerf 1 1 1 1 1 1 Diffie 1 Engelbart 1 1 Gibson 1 1 Hellman 1 1 Hopper 1 Kahn 1 1 1 1 1 Katz 1 1 1 Kay 1 1 1 Kilburn 1 Lamport 1 1 1 1 Liskov 1 1 1 1 Metcalfe 1 1 1 Moore 1 1 1 Wilkes 1 Page 1 1 Patterson 1 1 1 Ritchie 1 1 Rivest 1 1 1 Rumelhart 1 Searle Shannon Shamir 1 Shor 1 1 1 1 Sutherland 1 1 1 Thompson Turing 1 1 Valiant 1 Von Neumann Weiser 22 7 12 16 7 6
0
5
10
15
20
25
FACM FIEE Turing Award
AAAS NAE NMT
Num
ber of award
winners
Boole Hopper
Thompson
Boggs Hellman
Kay Cerf
Liskov Shamir
Metcalfe
Kahn
Adleman Sutherland
Pa@erson
Lamport
Moore
Diffie
Shor
Page
Rivest
Brand
Burks
Turing
Kilburn
Rumelhart
Bush
Engelbart
Shannon
Weiser Wilkes
Computer ScienGsts: Dead or Alive?
Dead Alive
top related