DAVID KARGER. Checkered Past Core Algorithms –graph algorithms, randomization, combinatorial...

41
DAVID KARGER
  • date post

    21-Dec-2015
  • Category

    Documents

  • view

    230
  • download

    0

Transcript of DAVID KARGER. Checkered Past Core Algorithms –graph algorithms, randomization, combinatorial...

Page 1: DAVID KARGER. Checkered Past Core Algorithms –graph algorithms, randomization, combinatorial optimization –min-cuts, max-flows, shortest paths, minimum.

DAVID KARGER

Page 2: DAVID KARGER. Checkered Past Core Algorithms –graph algorithms, randomization, combinatorial optimization –min-cuts, max-flows, shortest paths, minimum.

Checkered Past

• Core Algorithms– graph algorithms, randomization, combinatorial optimization– min-cuts, max-flows, shortest paths, minimum spanning tree, TSP– Still do some work

• Applied Algorithms– Lots of collaborations– Compilers– Web caching Akamai Technologies– Peer to peer systems– Networking: Denial of Service, SPAM blocking, Censorship evasion– Coding theory: Turbo Codes, Network Coding– Machine Learning, graphical models– Natural Language Processing– Computational Biology– Can’t resist a good problem

Page 3: DAVID KARGER. Checkered Past Core Algorithms –graph algorithms, randomization, combinatorial optimization –min-cuts, max-flows, shortest paths, minimum.

One Big Question

How do we make it easier for regular people

to deal with information?

Capture

Organize

RetrieveQuery

Share

Annotate

Publish

Page 4: DAVID KARGER. Checkered Past Core Algorithms –graph algorithms, randomization, combinatorial optimization –min-cuts, max-flows, shortest paths, minimum.

Many Answers

• Use any applicable domain– HCI– Information retrieval– Databases– Machine Learning– Social networks– Crowdsourcing– Semantic Web

• Full-cycle research

• Study Users (ethnography

)

• Build Systems

• Deploy• Recruit

Users

Page 5: DAVID KARGER. Checkered Past Core Algorithms –graph algorithms, randomization, combinatorial optimization –min-cuts, max-flows, shortest paths, minimum.

Handling information scraps that don’t fit anywhere

Listit

Page 6: DAVID KARGER. Checkered Past Core Algorithms –graph algorithms, randomization, combinatorial optimization –min-cuts, max-flows, shortest paths, minimum.
Page 7: DAVID KARGER. Checkered Past Core Algorithms –graph algorithms, randomization, combinatorial optimization –min-cuts, max-flows, shortest paths, minimum.

Needs

1. Too much effort to write it down/put it in“If it takes three clicks to get it down, it’s easier to e-mail [to myself].”

2. No tool for it / it doesn’t fit“I wanted to assign dates to notes, but [it] would only allow dates on

tasks.”“Where else would I keep my { guitar tabs / poetry }?”

3. Too hard to organize“It’s too much work to decide which section it should go in –sometimes

things don’t fit in just one place. It’s hard to decide what to do.”

4. Visibility and availability“If it’s not in my face, I’ll forget about it.”

“I need it with me at all times, so I have no choice.”

Page 8: DAVID KARGER. Checkered Past Core Algorithms –graph algorithms, randomization, combinatorial optimization –min-cuts, max-flows, shortest paths, minimum.

Listit

• Minimal Tool– Firefox plugin– One-click entry/access– No organization– Text-search retrieval

• Deployed in 2009– 19000 users– 2000 study subjects– 120,000 notes

Try it! http://listit.csail.mit.edu/

Page 9: DAVID KARGER. Checkered Past Core Algorithms –graph algorithms, randomization, combinatorial optimization –min-cuts, max-flows, shortest paths, minimum.

Automatically handling incoming information streams

Atomate

Page 10: DAVID KARGER. Checkered Past Core Algorithms –graph algorithms, randomization, combinatorial optimization –min-cuts, max-flows, shortest paths, minimum.

music listened to

running

sleep

desktop

activity

physical locations

event

s documents

message

s

travelsfriends/

enemies

Page 11: DAVID KARGER. Checkered Past Core Algorithms –graph algorithms, randomization, combinatorial optimization –min-cuts, max-flows, shortest paths, minimum.

Design

• Parse data streams from the web

• Build a structured model of user state

• User writes rules in Controlled Natural Language

• Refers to items and properties in data model

Page 12: DAVID KARGER. Checkered Past Core Algorithms –graph algorithms, randomization, combinatorial optimization –min-cuts, max-flows, shortest paths, minimum.
Page 13: DAVID KARGER. Checkered Past Core Algorithms –graph algorithms, randomization, combinatorial optimization –min-cuts, max-flows, shortest paths, minimum.

Friendsourced Content Sharing

Feedme

Page 14: DAVID KARGER. Checkered Past Core Algorithms –graph algorithms, randomization, combinatorial optimization –min-cuts, max-flows, shortest paths, minimum.

Suggestions

Page 15: DAVID KARGER. Checkered Past Core Algorithms –graph algorithms, randomization, combinatorial optimization –min-cuts, max-flows, shortest paths, minimum.

Choose Send

Page 16: DAVID KARGER. Checkered Past Core Algorithms –graph algorithms, randomization, combinatorial optimization –min-cuts, max-flows, shortest paths, minimum.

Results

• People sent more• Right recipients recommended• People liked what they got

Try it! http://feedme.csail.mit.edu/

Page 17: DAVID KARGER. Checkered Past Core Algorithms –graph algorithms, randomization, combinatorial optimization –min-cuts, max-flows, shortest paths, minimum.

Collaborative Lecture-Note Annotation

NB

Page 18: DAVID KARGER. Checkered Past Core Algorithms –graph algorithms, randomization, combinatorial optimization –min-cuts, max-flows, shortest paths, minimum.
Page 19: DAVID KARGER. Checkered Past Core Algorithms –graph algorithms, randomization, combinatorial optimization –min-cuts, max-flows, shortest paths, minimum.

Deployment

• Used in 15 classes at MIT, Harvard• Students see/answer each others’ questions while reading• Faculty learn what’s confusing• Close study of 6.055 Fall 2010

– 100 students created 20,000 notes– Initially, hated being forced to use the tool– By end, were praising how it increased their ability to learn– Faculty found huge value in understanding what students were thinking

Try it!http://nb.csail.mit.edu/

Page 20: DAVID KARGER. Checkered Past Core Algorithms –graph algorithms, randomization, combinatorial optimization –min-cuts, max-flows, shortest paths, minimum.

Easy Data Publishing

Exhibit

Page 21: DAVID KARGER. Checkered Past Core Algorithms –graph algorithms, randomization, combinatorial optimization –min-cuts, max-flows, shortest paths, minimum.

Regular User

Page 22: DAVID KARGER. Checkered Past Core Algorithms –graph algorithms, randomization, combinatorial optimization –min-cuts, max-flows, shortest paths, minimum.

Pro Site

sortsort

filterfiltersearchsearch

templatetemplate

Page 23: DAVID KARGER. Checkered Past Core Algorithms –graph algorithms, randomization, combinatorial optimization –min-cuts, max-flows, shortest paths, minimum.

Pro Site

Page 24: DAVID KARGER. Checkered Past Core Algorithms –graph algorithms, randomization, combinatorial optimization –min-cuts, max-flows, shortest paths, minimum.

Exhibit

• Pro web sites require databases and programming• Exhibit lets people author data and visualization in plain

html documents• Deployed 2005• Several 100 sites• Including newspapers and other professionals

Page 25: DAVID KARGER. Checkered Past Core Algorithms –graph algorithms, randomization, combinatorial optimization –min-cuts, max-flows, shortest paths, minimum.
Page 26: DAVID KARGER. Checkered Past Core Algorithms –graph algorithms, randomization, combinatorial optimization –min-cuts, max-flows, shortest paths, minimum.
Page 27: DAVID KARGER. Checkered Past Core Algorithms –graph algorithms, randomization, combinatorial optimization –min-cuts, max-flows, shortest paths, minimum.
Page 28: DAVID KARGER. Checkered Past Core Algorithms –graph algorithms, randomization, combinatorial optimization –min-cuts, max-flows, shortest paths, minimum.
Page 29: DAVID KARGER. Checkered Past Core Algorithms –graph algorithms, randomization, combinatorial optimization –min-cuts, max-flows, shortest paths, minimum.
Page 30: DAVID KARGER. Checkered Past Core Algorithms –graph algorithms, randomization, combinatorial optimization –min-cuts, max-flows, shortest paths, minimum.
Page 31: DAVID KARGER. Checkered Past Core Algorithms –graph algorithms, randomization, combinatorial optimization –min-cuts, max-flows, shortest paths, minimum.
Page 32: DAVID KARGER. Checkered Past Core Algorithms –graph algorithms, randomization, combinatorial optimization –min-cuts, max-flows, shortest paths, minimum.
Page 33: DAVID KARGER. Checkered Past Core Algorithms –graph algorithms, randomization, combinatorial optimization –min-cuts, max-flows, shortest paths, minimum.
Page 34: DAVID KARGER. Checkered Past Core Algorithms –graph algorithms, randomization, combinatorial optimization –min-cuts, max-flows, shortest paths, minimum.
Page 35: DAVID KARGER. Checkered Past Core Algorithms –graph algorithms, randomization, combinatorial optimization –min-cuts, max-flows, shortest paths, minimum.
Page 36: DAVID KARGER. Checkered Past Core Algorithms –graph algorithms, randomization, combinatorial optimization –min-cuts, max-flows, shortest paths, minimum.
Page 37: DAVID KARGER. Checkered Past Core Algorithms –graph algorithms, randomization, combinatorial optimization –min-cuts, max-flows, shortest paths, minimum.

Datapress

• Wordpress plugin• Upload or link to data

– Spreadsheet, JSON….• Then WYSYWIG your

visualization– Using usual Wordpress

blog post editor

Page 38: DAVID KARGER. Checkered Past Core Algorithms –graph algorithms, randomization, combinatorial optimization –min-cuts, max-flows, shortest paths, minimum.

Botanist

Page 39: DAVID KARGER. Checkered Past Core Algorithms –graph algorithms, randomization, combinatorial optimization –min-cuts, max-flows, shortest paths, minimum.

Music Lover/Entrepeneur

Page 40: DAVID KARGER. Checkered Past Core Algorithms –graph algorithms, randomization, combinatorial optimization –min-cuts, max-flows, shortest paths, minimum.

Pro Blogger

Page 41: DAVID KARGER. Checkered Past Core Algorithms –graph algorithms, randomization, combinatorial optimization –min-cuts, max-flows, shortest paths, minimum.

More Info

http://haystack.csail.mit.edu/

Download/try most of the tools