Today Sam Greenfield, Manager of System Development of the Sports Illustrated Magazine, gave a talk on the photographic technology behind SI. During the Q&A section, there was a great conversation:
Audience: A few years ago National Geographic got into some issues where they modified the cover image…
Sam: Yes, I know about that. They put two pyramids together.
Audience: So what’s your opinion on that?
Sam: That’s an ethical question. I am not the right person to ask about it. 
(Pause) Actually there are guidelines on what you can do and cannot do. [snip...]
Anureet Saxena, Tepper School of Business, Carnegie Mellon University
Friday, April 22, 2005
2:00 – 3:30 pm
343 Posner Hall
Facets of the Set-Covering Polytope with Coefficients in 0,1,2,3
Abstract:
Read the rest of this entry »
Surely you know the Slide Sorter exists in PowerPoint (View->Slide Sorter), but do you know you can press Alt-4 to get there quickly?
Also, inside the Slide Sorter, pressing Enter will bring you to the currently selected slide.
And while we are at this subject, try Alt-1, Alt-2 and Alt-3 as well.
P.S. In Windows, such keys are techically called “accelerators”.
I just installed a calendar plugin. If a post is in the Calendar category, it will appear in this ics:
https://diamond.aladdin.cs.cmu.edu/dav/calendar/aladdin.ics
Later on I will try to enable file sharing on Diamond for those ics clients that don’t do http.
Speaker: Juan Carlos Vera
Place: NSH 1507
Time: Wednesday 12-1pm
Title: Modeling the web: Preferential Attachment
Abstract:
Read the rest of this entry »
All authors can add words to the site-wide custom dictionary. Let me know if you have problems.
Proof of P != NP:
Proof by contradiction. Assume P = NP. Let y be a proof that P = NP. The proof y can be verified in polynomial time by a competent computer scientist, the existence of which we assert. However, since P = NP, the proof y can be generated in polynomial time by such computer scientists. Since this generation has not yet occurred (despite attempts by such computer scientists to produce a proof), we have a contradiction.
Talking about Google funs, this is a must read.
http://www.eecs.harvard.edu/~michaelm/funny-google.txt
From: John Byers
To: michaelm@eecs.harvard.edu
Delivery-Date: Tue Jan 6 16:33:16 2004
Subject: Smart people search for “Mitzenmacher”
How do I know this?
Because when I just googled you, the sidebar invited me to click on www.google.com/jobs saying “We can’t hire smart people fast enough”.
No such luck with me, Jon Kleinberg, Dick Karp, or Mike Luby.
But boy should you see how badly they want you to work at google if you are searching for “Andrei Broder”. In this case, they assume you are an “expert computer scientist” 
When you search for “Monika Henzinger” they dispense with the sidebar entirely and blast the jobs link right across the top of the page
– JB
