http://cluedumps.mit.edu/w/index.php?title=Special:Contributions/Price&feed=atom&limit=50&target=Price&year=&month=SIPB Cluedumps - User contributions [en]2024-03-29T01:07:23ZFrom SIPB CluedumpsMediaWiki 1.16.0http://cluedumps.mit.edu/wiki/2008/12-092008/12-092008-12-10T03:57:10Z<p>Price: rewrite abstract</p>
<hr />
<div>{{Cluedump<br />
|title=Invirt<br />
|date=2008-12-09 20:30<br />
|presenters=Greg Price (price) and Evan Broder (broder)<br />
|location=4-231<br />
|notes=[http://invirt.mit.edu/cluedump.pdf slides], [http://invirt.mit.edu website], [https://xvm.mit.edu XVM service]<br />
|abstract=<br />
Invirt is the software developed at SIPB to power our [https://xvm.mit.edu XVM virtualization service] for the MIT community. In this talk, two Invirt developers explain some of the crazy (awesome?) techniques used inside Invirt to implement its most interesting features.<br />
}}</div>Pricehttp://cluedumps.mit.edu/wiki/2008/12-092008/12-092008-12-10T03:50:08Z<p>Price: add slides, links</p>
<hr />
<div>{{Cluedump<br />
|title=Invirt<br />
|date=2008-12-09 20:30<br />
|presenters=Greg Price (price) and Evan Broder (broder)<br />
|location=4-231<br />
|notes=[http://invirt.mit.edu/cluedump.pdf slides], [http://invirt.mit.edu website], [https://xvm.mit.edu XVM service]<br />
|abstract=<br />
Invirt is a software package originally designed by the Student Information Processing Board of MIT as a free service for the MIT community. It includes VM creation and management through a web interface, load balancing across multiple virtual machine hosts, a serial console server accessible over ssh, a 3 minute autoinstaller-in-a-domU, and several other features for provisioning. Invirt is the package that powers the MIT [http://xvm.mit.edu/ XVM] service. In this talk, Invirt developers will provide an overview of the system architecture and implementation.<br />
}}</div>Pricehttp://cluedumps.mit.edu/wiki/SIPB_Cluedump_Series_2011SIPB Cluedump Series 20112008-10-28T06:42:19Z<p>Price: add heading for previous years' schedules</p>
<hr />
<div>__NOTOC__<br />
SIPB Cluedumps are informal technical talks, well supplied with snacks.<br />
Interrupt with questions at any time, or quietly get up for food.<br />
Cluedumps ordinarily run at 8:30 PM Tuesday evenings.<br />
<br />
Feel free to contact the Cluedump Series organizers at <tt>cluedumps at obvious dot edu</tt>.<br />
<br />
Sign up for weekly announcements by blancheing yourself onto <tt>cluedump-announce</tt>, or mail us and we'll add you.<br />
<br />
{{:Cluedumps 2008}}<br />
<br />
<br />
==All Years==<br />
<br />
* [[Cluedumps 2006]]<br />
* [[Cluedumps 2007]]<br />
* [[Cluedumps 2008]]</div>Pricehttp://cluedumps.mit.edu/wiki/200820082008-10-28T06:38:23Z<p>Price: add spacing between cluedumps</p>
<hr />
<div>== Scheduled ==<br />
<br />
{{:2008/10-07}}<br />
<br />
<br />
{{:2008/10-21}}<br />
<br />
<br />
{{:2008/10-28}}<br />
<br />
<br />
{{:2008/11-04}}<br />
<br />
<br />
{{:2008/11-11}}<br />
<br />
<br />
{{:2008/11-18}}<br />
<br />
<br />
{{:2008/11-25}}<br />
<br />
<br />
{{:2008/12-02}}</div>Pricehttp://cluedumps.mit.edu/wiki/200820082008-10-28T06:30:27Z<p>Price: remove fulfilled promise</p>
<hr />
<div>== Scheduled ==<br />
<br />
{{:2008/10-07}}<br />
<br />
{{:2008/10-21}}<br />
<br />
{{:2008/10-28}}<br />
<br />
{{:2008/11-04}}<br />
<br />
{{:2008/11-11}}<br />
<br />
{{:2008/11-18}}<br />
<br />
{{:2008/11-25}}<br />
<br />
{{:2008/12-02}}</div>Pricehttp://cluedumps.mit.edu/wiki/Cluedumps_2008Cluedumps 20082008-10-28T06:30:14Z<p>Price: remove duplicate "unscheduled" section</p>
<hr />
<div>===Full schedule:===<br />
<br />
{{:2008}}</div>Pricehttp://cluedumps.mit.edu/wiki/SIPB_Cluedump_Series_2011SIPB Cluedump Series 20112008-10-28T06:26:47Z<p>Price: remove fulfilled promise</p>
<hr />
<div>__NOTOC__<br />
SIPB Cluedumps are informal technical talks, well supplied with snacks.<br />
Interrupt with questions at any time, or quietly get up for food.<br />
Cluedumps ordinarily run at 8:30 PM Tuesday evenings.<br />
<br />
Feel free to contact the Cluedump Series organizers at <tt>cluedumps at obvious dot edu</tt>.<br />
<br />
Sign up for weekly announcements by blancheing yourself onto <tt>cluedump-announce</tt>, or mail us and we'll add you.<br />
<br />
{{:Cluedumps 2008}}<br />
<br />
You can also see schedules from past years if interested.<br />
<br />
* [[Cluedumps 2006]]<br />
* [[Cluedumps 2007]]<br />
* [[Cluedumps 2008]]</div>Pricehttp://cluedumps.mit.edu/wiki/SandboxSandbox2008-10-06T18:26:25Z<p>Price: New page: {{cluedump|title=Computational Intractability As A Law of Physics |presenters=Scott Aaronson |date=2007-12-03 20:30 |location=56-114 |abstract=In this talk, I'll ask whether the hardness o...</p>
<hr />
<div>{{cluedump|title=Computational Intractability As A Law of Physics<br />
|presenters=Scott Aaronson<br />
|date=2007-12-03 20:30<br />
|location=56-114<br />
|abstract=In this talk, I'll ask whether the hardness of NP-complete problems would be useful to assume as a physical principle, on par with (say) the Second Law of Thermodynamics or the impossibility of faster-than-light communication. As part of discussing that question, I'll tell you the real story about quantum computing (i.e. not what you've read in the popular press): why this field is tremendously exciting, and why quantum computers could break RSA, Diffie-Hellman, and almost every other public-key cryptosystem used today, but also why we ''don't'' believe quantum computers would provide unlimited exponential parallelism.<br />
<br />
As time permits, I'll also give a critical assessment of hypothetical computing models that try to go beyond quantum computing. These models involve (for example) closed timelike curves, spacetime singularities, nonlinearities in the Schrödinger equation, or particular many-particle entangled states left over from the Big Bang.<br />
|bio=}}</div>Pricehttp://cluedumps.mit.edu/wiki/SIPB_Cluedump_Series_2011SIPB Cluedump Series 20112008-09-14T19:54:31Z<p>Price: 2007-specific text moved to Cluedumps 2007</p>
<hr />
<div>__NOTOC__<br />
SIPB Cluedumps are informal technical talks, well supplied with snacks.<br />
Interrupt with questions at any time, or quietly get up for food.<br />
Cluedumps ordinarily run at 8:30 PM Monday evenings.<br />
<br />
Feel free to contact the Cluedump Series organizers at <tt>cluedumps at obvious dot edu</tt>.<br />
<br />
Sign up for weekly announcements by blancheing yourself onto <tt>cluedump-announce</tt>, or mail us and we'll add you.<br />
<br />
{{:Cluedumps 2007}}<br />
<br />
You can also see [[Cluedumps 2006|the 2006 schedule]] if interested.</div>Pricehttp://cluedumps.mit.edu/wiki/Cluedumps_2007Cluedumps 20072008-09-14T19:53:58Z<p>Price: move from front page</p>
<hr />
<div>===Last:===<br />
<br />
We'll resume sometime next term, for at least a couple of sessions.<br />
Let us know if you have topics to suggest!<br />
<br />
<br />
{{:2007/12-03}}<br />
<br />
<br />
===Full schedule:===<br />
<br />
{{:2007}}<br />
<br />
<br />
===Unscheduled===<br />
<br />
Kerberos and Related Technologies<br />
Date: TBA<br />
Presenters: hartmans and TBA<br />
Abstract: <br />
Developers from MIT's Kerberos group will give an overview of Kerberos, SASL,<br />
GSS-API and related technologies. The talk will focus on what these<br />
technologies can do for users and application developers. The talk also<br />
describes how Kerberos works over the network enough to explain what its<br />
advantages and drawbacks are.<br />
<br />
DNS and LDAP<br />
Date: TBA<br />
Presenter: TBA<br />
Abstract:<br />
How can a large, distributed system make available naming and directory information?<br />
On the Internet, the Domain Name System (DNS) is used to map names to IP addresses,<br />
to servers for mail and sometimes for AFS or Kerberos, and occasionally to other metadata.<br />
At MIT, DNS has traditionally been used in the guise of Hesiod to identify users' home<br />
directories and poboxes, printers' locations, and many other data. But DNS is unencrypted<br />
and vulnerable to spoofing. MIT and other sites are increasingly replacing many uses<br />
of DNS with the so-called Lightweight Directory Access Protocol (LDAP), which can be<br />
secured with SSL/TLS, but LDAP is a complex beastie from an unfamiliar technical culture.<br />
This talk will discuss the design and architecture of both protocols, and show briefly<br />
some tools to help you poke around your favorite LDAP directory or DNS zone.</div>Pricehttp://cluedumps.mit.edu/wiki/2007/11-192007/11-192008-05-24T07:48:29Z<p>Price: better context</p>
<hr />
<div>{{cluedump|title=Haskell: Compiler as Theorem-Prover<br />
|presenters=Greg Price (price)<br />
|date=2007-11-19 20:30<br />
|location=56-114<br />
|notes= '''UPDATE''' May 2008: Jesse has [http://www.ccs.neu.edu/home/tov/session-types/ a new implementation] of session types, complete with a paper explaining it and prototype implementations in five other languages.<br />
<br />
See [http://web.mit.edu/price/a/2007/haskell/slides.pdf slides], and (tarball) [http://web.mit.edu/price/a/2007/haskell/examples.tar.gz code examples].<br />
<br />
For STM, see [http://web.mit.edu/price/a/2007/haskell/stm-long-intro-spj.pdf Simon Peyton Jones' gentle introduction],<br />
or [http://web.mit.edu/price/a/2007/haskell/stm-lock-free-data-structures.pdf a paper applying STM to lock-free data structures].<br />
<br />
For protocol/session types, see [http://scholar.google.com/scholar?q=%22session+types%22 the literature], or check out [http://okmij.org/ftp/Haskell/types.html Oleg Kiselyov's work], particularly "HList", for some of the tools that make Jesse Tov's Haskell implementation, which I presented, possible. Or look at [http://www.ccs.neu.edu/home/tov/ Jesse's web page] to see if he's put up a paper or a new version. '''UPDATE''': he has, see above.<br />
<br />
For "theorems for free", see Phil Wadler's [http://homepages.inf.ed.ac.uk/wadler/topics/parametricity.html 1989 and later writeups].<br />
<br />
For a broad overview of the Curry-Howard correspondence ("proofs are programs, programs proofs"), see [http://homepages.inf.ed.ac.uk/wadler/topics/history.html more Phil Wadler], particularly [http://web.mit.edu/price/a/2007/haskell/curry-howard-history-wadler.pdf his 2000 writeup].<br />
|abstract=Haskell is the world's most *reasonable* programming language. Every language's optimizing compilers reason about programs, and every programmer reasons about the code they write ("this loop never indexes this array out of bounds"; "this resource is never accessed without holding the lock") -- but in no more mainstream language do the compiler and the programmer have an adequate medium in which to communicate about their reasoning: a rich static type system. In Haskell the programmer has in the type system a powerful theorem-prover ready at hand, and if the programmer's theorem is of the form "task X can be done", the compiler's proof can be the very code that carries out task X.<br />
<br />
This cluedump will briefly introduce Haskell and its type system, describe the Curry-Howard isomorphism between code with types and propositions with proofs, and show you how you can make a Haskell implementation verify the units you attach to physical quantities; guarantee code to be free of side effects; write code for you to traverse a complicated data structure; and guarantee your lock-free code threadsafe with software transactional memory.<br />
}}</div>Pricehttp://cluedumps.mit.edu/wiki/2007/11-192007/11-192008-05-24T07:46:56Z<p>Price: update with Jesse's new version</p>
<hr />
<div>{{cluedump|title=Haskell: Compiler as Theorem-Prover<br />
|presenters=Greg Price (price)<br />
|date=2007-11-19 20:30<br />
|location=56-114<br />
|notes= '''UPDATE''' May 2008: Jesse has [http://www.ccs.neu.edu/home/tov/session-types/ a new implementation] complete with a paper explaining it, and prototype implementations in five other languages.<br />
<br />
See [http://web.mit.edu/price/a/2007/haskell/slides.pdf slides], and (tarball) [http://web.mit.edu/price/a/2007/haskell/examples.tar.gz code examples].<br />
<br />
For STM, see [http://web.mit.edu/price/a/2007/haskell/stm-long-intro-spj.pdf Simon Peyton Jones' gentle introduction],<br />
or [http://web.mit.edu/price/a/2007/haskell/stm-lock-free-data-structures.pdf a paper applying STM to lock-free data structures].<br />
<br />
For protocol/session types, see [http://scholar.google.com/scholar?q=%22session+types%22 the literature], or check out [http://okmij.org/ftp/Haskell/types.html Oleg Kiselyov's work], particularly "HList", for some of the tools that make Jesse Tov's Haskell implementation, which I presented, possible. Or look at [http://www.ccs.neu.edu/home/tov/ Jesse's web page] to see if he's put up a paper or a new version. '''UPDATE''': he has, see above.<br />
<br />
For "theorems for free", see Phil Wadler's [http://homepages.inf.ed.ac.uk/wadler/topics/parametricity.html 1989 and later writeups].<br />
<br />
For a broad overview of the Curry-Howard correspondence ("proofs are programs, programs proofs"), see [http://homepages.inf.ed.ac.uk/wadler/topics/history.html more Phil Wadler], particularly [http://web.mit.edu/price/a/2007/haskell/curry-howard-history-wadler.pdf his 2000 writeup].<br />
|abstract=Haskell is the world's most *reasonable* programming language. Every language's optimizing compilers reason about programs, and every programmer reasons about the code they write ("this loop never indexes this array out of bounds"; "this resource is never accessed without holding the lock") -- but in no more mainstream language do the compiler and the programmer have an adequate medium in which to communicate about their reasoning: a rich static type system. In Haskell the programmer has in the type system a powerful theorem-prover ready at hand, and if the programmer's theorem is of the form "task X can be done", the compiler's proof can be the very code that carries out task X.<br />
<br />
This cluedump will briefly introduce Haskell and its type system, describe the Curry-Howard isomorphism between code with types and propositions with proofs, and show you how you can make a Haskell implementation verify the units you attach to physical quantities; guarantee code to be free of side effects; write code for you to traverse a complicated data structure; and guarantee your lock-free code threadsafe with software transactional memory.<br />
}}</div>Pricehttp://cluedumps.mit.edu/wiki/2007/11-262007/11-262008-02-12T20:04:12Z<p>Price: a long-belated afternote</p>
<hr />
<div>{{cluedump|title=VoIP and SIP: Telephony Comes To Software Hackers<br />
|presenters=Dennis Baron (dbaron)<br />
|date=2007-11-26 20:30<br />
|location=56-114<br />
|afternotes=[http://mit.edu/ist/topics/telecommunications/psip/ MIT Personal SIP accounts], to play around for yourself<br />
|abstract=Until the 1990s, if you wanted to make telephone hardware do your bidding you had to do it at the level of signal processing, EE, and physical-layer analog protocols. Now MIT and the rest of the world are switching to voice-over-IP, based on RFC-documented protocols on the familiar IETF stack, and the opportunity is opening for software hackers to work their magic on the oldest extant medium in telecommunications. A SIPB project in the scripts tradition, aiming to provide infrastructure for members of the MIT community to serve up their own innovations, is still in the early stages and welcoming new participants. This cluedump will give a technical grounding in the architecture of the protocols governing voice-over-IP and in their implementation at MIT.<br />
|bio=Dennis Baron is a Senior Strategist for Integrated Communications at IS&T, and has worked on MIT's ongoing deployment of VoIP.<br />
}}</div>Pricehttp://cluedumps.mit.edu/wiki/SIPB_Cluedump_Series_2011SIPB Cluedump Series 20112007-12-06T19:13:15Z<p>Price: quantum isn't "next" anymore, but nothing else is</p>
<hr />
<div>__NOTOC__<br />
SIPB Cluedumps are informal technical talks, well supplied with snacks.<br />
Interrupt with questions at any time, or quietly get up for food.<br />
Cluedumps ordinarily run at 8:30 PM Monday evenings.<br />
<br />
Feel free to contact the Cluedump Series organizers at <tt>cluedumps at obvious dot edu</tt>.<br />
<br />
Sign up for weekly announcements by blancheing yourself onto <tt>cluedump-announce</tt>, or mail us and we'll add you.<br />
<br />
===Last:===<br />
<br />
We'll resume sometime next term, for at least a couple of sessions.<br />
Let us know if you have topics to suggest!<br />
<br />
<br />
{{:2007/12-03}}<br />
<br />
<br />
===Full schedule:===<br />
<br />
{{:2007}}<br />
<br />
<br />
===Unscheduled===<br />
<br />
Kerberos and Related Technologies<br />
Date: TBA<br />
Presenters: hartmans and TBA<br />
Abstract: <br />
Developers from MIT's Kerberos group will give an overview of Kerberos, SASL,<br />
GSS-API and related technologies. The talk will focus on what these<br />
technologies can do for users and application developers. The talk also<br />
describes how Kerberos works over the network enough to explain what its<br />
advantages and drawbacks are.<br />
<br />
DNS and LDAP<br />
Date: TBA<br />
Presenter: TBA<br />
Abstract:<br />
How can a large, distributed system make available naming and directory information?<br />
On the Internet, the Domain Name System (DNS) is used to map names to IP addresses,<br />
to servers for mail and sometimes for AFS or Kerberos, and occasionally to other metadata.<br />
At MIT, DNS has traditionally been used in the guise of Hesiod to identify users' home<br />
directories and poboxes, printers' locations, and many other data. But DNS is unencrypted<br />
and vulnerable to spoofing. MIT and other sites are increasingly replacing many uses<br />
of DNS with the so-called Lightweight Directory Access Protocol (LDAP), which can be<br />
secured with SSL/TLS, but LDAP is a complex beastie from an unfamiliar technical culture.<br />
This talk will discuss the design and architecture of both protocols, and show briefly<br />
some tools to help you poke around your favorite LDAP directory or DNS zone.<br />
<br />
<br />
You can also see [[Cluedumps 2006|the 2006 schedule]] if interested.</div>Pricehttp://cluedumps.mit.edu/wiki/SIPB_Cluedump_Series_2011SIPB Cluedump Series 20112007-11-30T17:22:55Z<p>Price: voip done, quantum/physical next</p>
<hr />
<div>__NOTOC__<br />
SIPB Cluedumps are informal technical talks, well supplied with snacks.<br />
Interrupt with questions at any time, or quietly get up for food.<br />
Cluedumps ordinarily run at 8:30 PM Monday evenings.<br />
<br />
Feel free to contact the Cluedump Series organizers at <tt>cluedumps at obvious dot edu</tt>.<br />
<br />
Sign up for weekly announcements by blancheing yourself onto <tt>cluedump-announce</tt>, or mail us and we'll add you.<br />
<br />
===Next up:===<br />
{{:2007/12-03}}<br />
<br />
<br />
===Full schedule:===<br />
<br />
{{:2007}}<br />
<br />
<br />
===Unscheduled===<br />
<br />
Kerberos and Related Technologies<br />
Date: TBA<br />
Presenters: hartmans and TBA<br />
Abstract: <br />
Developers from MIT's Kerberos group will give an overview of Kerberos, SASL,<br />
GSS-API and related technologies. The talk will focus on what these<br />
technologies can do for users and application developers. The talk also<br />
describes how Kerberos works over the network enough to explain what its<br />
advantages and drawbacks are.<br />
<br />
DNS and LDAP<br />
Date: TBA<br />
Presenter: TBA<br />
Abstract:<br />
How can a large, distributed system make available naming and directory information?<br />
On the Internet, the Domain Name System (DNS) is used to map names to IP addresses,<br />
to servers for mail and sometimes for AFS or Kerberos, and occasionally to other metadata.<br />
At MIT, DNS has traditionally been used in the guise of Hesiod to identify users' home<br />
directories and poboxes, printers' locations, and many other data. But DNS is unencrypted<br />
and vulnerable to spoofing. MIT and other sites are increasingly replacing many uses<br />
of DNS with the so-called Lightweight Directory Access Protocol (LDAP), which can be<br />
secured with SSL/TLS, but LDAP is a complex beastie from an unfamiliar technical culture.<br />
This talk will discuss the design and architecture of both protocols, and show briefly<br />
some tools to help you poke around your favorite LDAP directory or DNS zone.<br />
<br />
<br />
You can also see [[Cluedumps 2006|the 2006 schedule]] if interested.</div>Pricehttp://cluedumps.mit.edu/wiki/SIPB_Cluedump_Series_2011SIPB Cluedump Series 20112007-11-25T18:38:51Z<p>Price: haskell done, voip and quantum next</p>
<hr />
<div>__NOTOC__<br />
SIPB Cluedumps are informal technical talks, well supplied with snacks.<br />
Interrupt with questions at any time, or quietly get up for food.<br />
Cluedumps ordinarily run at 8:30 PM Monday evenings.<br />
<br />
Feel free to contact the Cluedump Series organizers at <tt>cluedumps at obvious dot edu</tt>.<br />
<br />
Sign up for weekly announcements by blancheing yourself onto <tt>cluedump-announce</tt>, or mail us and we'll add you.<br />
<br />
===Next up:===<br />
{{:2007/11-26}}<br />
<br />
<br />
{{:2007/12-03}}<br />
<br />
<br />
===Full schedule:===<br />
<br />
{{:2007}}<br />
<br />
<br />
===Unscheduled===<br />
<br />
Kerberos and Related Technologies<br />
Date: TBA<br />
Presenters: hartmans and TBA<br />
Abstract: <br />
Developers from MIT's Kerberos group will give an overview of Kerberos, SASL,<br />
GSS-API and related technologies. The talk will focus on what these<br />
technologies can do for users and application developers. The talk also<br />
describes how Kerberos works over the network enough to explain what its<br />
advantages and drawbacks are.<br />
<br />
DNS and LDAP<br />
Date: TBA<br />
Presenter: TBA<br />
Abstract:<br />
How can a large, distributed system make available naming and directory information?<br />
On the Internet, the Domain Name System (DNS) is used to map names to IP addresses,<br />
to servers for mail and sometimes for AFS or Kerberos, and occasionally to other metadata.<br />
At MIT, DNS has traditionally been used in the guise of Hesiod to identify users' home<br />
directories and poboxes, printers' locations, and many other data. But DNS is unencrypted<br />
and vulnerable to spoofing. MIT and other sites are increasingly replacing many uses<br />
of DNS with the so-called Lightweight Directory Access Protocol (LDAP), which can be<br />
secured with SSL/TLS, but LDAP is a complex beastie from an unfamiliar technical culture.<br />
This talk will discuss the design and architecture of both protocols, and show briefly<br />
some tools to help you poke around your favorite LDAP directory or DNS zone.<br />
<br />
<br />
You can also see [[Cluedumps 2006|the 2006 schedule]] if interested.</div>Pricehttp://cluedumps.mit.edu/wiki/2007/11-262007/11-262007-11-25T18:35:31Z<p>Price: skeleton bio</p>
<hr />
<div>{{cluedump|title=VoIP and SIP: Telephony Comes To Software Hackers<br />
|presenters=Dennis Baron (dbaron)<br />
|date=2007-11-26 20:30<br />
|location=56-114<br />
|abstract=Until the 1990s, if you wanted to make telephone hardware do your bidding you had to do it at the level of signal processing, EE, and physical-layer analog protocols. Now MIT and the rest of the world are switching to voice-over-IP, based on RFC-documented protocols on the familiar IETF stack, and the opportunity is opening for software hackers to work their magic on the oldest extant medium in telecommunications. A SIPB project in the scripts tradition, aiming to provide infrastructure for members of the MIT community to serve up their own innovations, is still in the early stages and welcoming new participants. This cluedump will give a technical grounding in the architecture of the protocols governing voice-over-IP and in their implementation at MIT.<br />
|bio=Dennis Baron is a Senior Strategist for Integrated Communications at IS&T, and has worked on MIT's ongoing deployment of VoIP.<br />
}}</div>Pricehttp://cluedumps.mit.edu/wiki/2007/12-032007/12-032007-11-22T10:49:39Z<p>Price: best keep a formal straight face in the bio (despite last sentence)</p>
<hr />
<div>{{cluedump|title=Computational Intractability As A Law of Physics<br />
|presenters=Scott Aaronson<br />
|date=2007-12-03 20:30<br />
|location=56-114<br />
|abstract=In this talk, I'll ask whether the hardness of NP-complete problems would be useful to assume as a physical principle, on par with (say) the Second Law of Thermodynamics or the impossibility of faster-than-light communication. As part of discussing that question, I'll tell you the real story about quantum computing (i.e. not what you've read in the popular press): why this field is tremendously exciting, and why quantum computers could break RSA, Diffie-Hellman, and almost every other public-key cryptosystem used today, but also why we ''don't'' believe quantum computers would provide unlimited exponential parallelism.<br />
<br />
As time permits, I'll also give a critical assessment of hypothetical computing models that try to go beyond quantum computing. These models involve (for example) closed timelike curves, spacetime singularities, nonlinearities in the Schrödinger equation, or particular many-particle entangled states left over from the Big Bang.<br />
|bio=Scott Aaronson joined MIT this year as an Assistant Professor of EECS. Before that he received a PhD in CS from UC Berkeley, and was a postdoc at the Institute for Advanced Study in Princeton and the University of Waterloo. Within computer science he is best-known for creating the Complexity Zoo (an online encyclopedia of over 400 complexity classes) and for his widely-read blog. His research interests center around computational complexity theory and the limits of quantum computers. He was invited to speak in the SIPB Cluedump Series because of his numerous hacker credentials, including the ability to use a text editor and to program in BASIC.<br />
}}</div>Pricehttp://cluedumps.mit.edu/wiki/2007/11-192007/11-192007-11-22T07:51:40Z<p>Price: clarify Jesse's relationship to the session-types work, per his own scruples; also link Oleg's work</p>
<hr />
<div>{{cluedump|title=Haskell: Compiler as Theorem-Prover<br />
|presenters=Greg Price (price)<br />
|date=2007-11-19 20:30<br />
|location=56-114<br />
|notes=See [http://web.mit.edu/price/a/2007/haskell/slides.pdf slides], and (tarball) [http://web.mit.edu/price/a/2007/haskell/examples.tar.gz code examples].<br />
<br />
For STM, see [http://web.mit.edu/price/a/2007/haskell/stm-long-intro-spj.pdf Simon Peyton Jones' gentle introduction],<br />
or [http://web.mit.edu/price/a/2007/haskell/stm-lock-free-data-structures.pdf a paper applying STM to lock-free data structures].<br />
<br />
For protocol/session types, see [http://scholar.google.com/scholar?q=%22session+types%22 the literature], or check out [http://okmij.org/ftp/Haskell/types.html Oleg Kiselyov's work], particularly "HList", for some of the tools that make Jesse Tov's Haskell implementation, which I presented, possible. Or look at [http://www.ccs.neu.edu/home/tov/ Jesse's web page] to see if he's put up a paper or a new version.<br />
<br />
For "theorems for free", see Phil Wadler's [http://homepages.inf.ed.ac.uk/wadler/topics/parametricity.html 1989 and later writeups].<br />
<br />
For a broad overview of the Curry-Howard correspondence ("proofs are programs, programs proofs"), see [http://homepages.inf.ed.ac.uk/wadler/topics/history.html more Phil Wadler], particularly [http://web.mit.edu/price/a/2007/haskell/curry-howard-history-wadler.pdf his 2000 writeup].<br />
|abstract=Haskell is the world's most *reasonable* programming language. Every language's optimizing compilers reason about programs, and every programmer reasons about the code they write ("this loop never indexes this array out of bounds"; "this resource is never accessed without holding the lock") -- but in no more mainstream language do the compiler and the programmer have an adequate medium in which to communicate about their reasoning: a rich static type system. In Haskell the programmer has in the type system a powerful theorem-prover ready at hand, and if the programmer's theorem is of the form "task X can be done", the compiler's proof can be the very code that carries out task X.<br />
<br />
This cluedump will briefly introduce Haskell and its type system, describe the Curry-Howard isomorphism between code with types and propositions with proofs, and show you how you can make a Haskell implementation verify the units you attach to physical quantities; guarantee code to be free of side effects; write code for you to traverse a complicated data structure; and guarantee your lock-free code threadsafe with software transactional memory.<br />
}}</div>Pricehttp://cluedumps.mit.edu/wiki/Template:CluedumpTemplate:Cluedump2007-11-20T00:34:04Z<p>Price: lower notes</p>
<hr />
<div><span style="font-size: larger">'''[[{{#timel: Y/m-d | {{{date}}}}}|{{{title}}}]]'''</span><br />
{|<br />
|-<br />
| Date: {{#timel: '''F j''', Y, "at" g:i A | {{{date}}}}}<br />
|-<br />
{{ #if: {{{afternotes|}}} | {{!}} '''Afternotes''': {{{afternotes}}}}}<br />
|-<br />
{{ #if: {{{presenters|}}} | {{!}} Presenters: '''{{{presenters}}}'''}}<br />
|-<br />
{{ #if: {{{location|}}} | {{!}} Location: {{{location}}}}}<br />
|-<br />
{{ #if: {{{notes|}}} | {{!}} '''Notes''': {{{notes}}}}}<br />
|-<br />
{{ #if: {{{abstract|}}} | {{!}} '''Abstract''': {{{abstract}}}}}<br />
|-<br />
{{ #if: {{{bio|}}} | {{!}} '''Bio''': {{{bio}}}}}<br />
|}</div>Pricehttp://cluedumps.mit.edu/wiki/2007/11-122007/11-122007-11-12T01:45:42Z<p>Price: juice title a bit</p>
<hr />
<div>{{cluedump|title=Debian Packaging (For Sysadmins)<br />
|presenters=Benjamin Mako Hill (mako)<br />
|date=2007-11-12 20:30<br />
|location=56-114<br />
|bio=[http://mako.cc Benjamin Mako Hill] is a technology and intellectual property researcher, activist, and consultant. He is currently a Senior Researcher at the MIT Sloan School of Management, a Fellow at the MIT Center for Future Civic Media, and an adviser and contractor for the One Laptop per Child project. He has been an leader, developer, and contributor to the Free and Open Source Software community for more than a decade as part of the Debian and Ubuntu projects. He is the author of several best-selling technical books including ''The Debian 3.X Bible'' and ''The Official Ubuntu Book'', and a member of the Free Software Foundation board of directors. Hill has a Masters degree from the MIT Media Lab.<br />
|abstract=The Debian package system controls every aspect of the installation and configuration of software on Debian, Ubuntu, and other systems. For sysadmins' local software and patches it's an upgrade-friendly alternative to manual installation, for anyone writing free software it's the gateway to easy availability to (many) users, and for anyone curious how their Debian or Ubuntu box decides to do what it does it's a prerequisite to investigation. This hands-on cluedump will describe the key components of a package and the major tools for manipulating them, poke around a representative example from the repository, and build a minimal package from scratch.<br />
}}</div>Pricehttp://cluedumps.mit.edu/wiki/200720072007-11-08T19:47:11Z<p>Price: add haskell cluedump</p>
<hr />
<div>{{:2007/09-10}}<br />
<br />
<br />
{{:2007/09-17}}<br />
<br />
<br />
{{:2007/09-24}}<br />
<br />
<br />
{{:2007/10-01}}<br />
<br />
<br />
{{:2007/10-08}}<br />
<br />
<br />
{{:2007/11-05}}<br />
<br />
<br />
{{:2007/11-12}}<br />
<br />
<br />
{{:2007/11-19}}<br />
<br />
<br />
{{:2007/11-26}}<br />
<br />
<br />
{{:2007/12-03}}</div>Pricehttp://cluedumps.mit.edu/wiki/Talk:Cluedumps_2006Talk:Cluedumps 20062007-11-08T17:50:11Z<p>Price: Talk:Cluedumps 2006 moved to Talk:2006: name harmony</p>
<hr />
<div>#REDIRECT [[Talk:2006]]</div>Pricehttp://cluedumps.mit.edu/wiki/Cluedumps_2006Cluedumps 20062007-11-08T17:50:11Z<p>Price: Cluedumps 2006 moved to 2006: name harmony</p>
<hr />
<div>#REDIRECT [[2006]]</div>Pricehttp://cluedumps.mit.edu/wiki/Talk:2006Talk:20062007-11-08T17:50:11Z<p>Price: Talk:Cluedumps 2006 moved to Talk:2006: name harmony</p>
<hr />
<div></div>Pricehttp://cluedumps.mit.edu/wiki/200620062007-11-08T17:50:11Z<p>Price: Cluedumps 2006 moved to 2006: name harmony</p>
<hr />
<div><big>SIPB Cluedump Series Schedule</big><br />
<br />
Below is the draft schedule for the SIPB Cluedump Series for Fall 2006. This site will be updated as we decide on further details, and will be updated with any relevant updates on the series. <br />
<br />
How Athena Works<br />
Date: September 11, 2006, 8:30 PM<br />
Presenters: Marc Horowitz (marc)<br />
Location: 3-133<br />
Notes: Based off of ghudson's document<br />
Abstract: <br />
Athena is a ubiquitous part of the computing infrastructure at MIT, often taken<br />
for granted. Its history goes back more than twenty years, encompassing the<br />
invention of a number of technologies which are widespread today. However, its<br />
development marked a time of rapid change in distributed computing. In some<br />
ways, Athena is still well ahead of a typical distributed computing environment.<br />
<br />
I will discuss the history of Athena, its notable inventions, and give an overview <br />
of each of the network and workstation services which make up Athena today, including <br />
Kerberos, AFS, Moira, Hesiod, and the installation and update processes.<br />
Bio: <br />
Marc Horowitz arrived at MIT in 1988, when Athena was still a funded research<br />
project. As a Watchmaker (student developer) at Project Athena, he worked on<br />
the Kerberos, Zephyr, and Moira projects. Marc was also vice-chairman of the<br />
Student Information Processing Board in 1991, and Secretary in 1992. From 1992<br />
to 2000, Marc continued to maintain an informal relationship with Athena,<br />
working on commercial versions of technologies born there, especially Kerberos,<br />
and participating in follow-on open source development and IETF standards<br />
activities. Today, he works with RFID software for BEA Systems in Burlington.<br />
Slides: [http://web.mit.edu/cluedumps/slides/how-athena-works.pdf A PDF is available here]<br />
License: http://creativecommons.org/images/public/somerights20.png [http://creativecommons.org/licenses/by-nc/2.5/ Creative Commons Attribution-NonCommercial 2.5 License ]<br />
<br />
AFS<br />
Date: September 18, 2006, 8:30 PM<br />
Presenters: Mitch Berger (mitchb) and Tim Abbott (tabbott)<br />
Location: 3-133<br />
Abstract:<br />
AFS is the distributed filesystem product used by MIT, pioneered at Carnegie<br />
Mellon University and supported and developed as a product by Transarc<br />
Corporation (now IBM Pittsburgh Labs). It offers a client-server architecture<br />
for file sharing, providing location independence, scalability, security, and<br />
transparent migration capabilities for data.<br />
<br />
We will describe AFS, its various components and their interactions. We will<br />
talk about how AFS works, including discussion of important design and<br />
implementation details, including many useful quirks at most one of us was<br />
aware of a week ago. We will say something about Ubik (the distributed<br />
database protocol), replications, the Basic OverSeer server, afs_randomMod15(),<br />
and numerous other things that you've probably actually heard of.<br />
<br />
This talk should cover the information necessary to take you from knowing how<br />
to use AFS (fs la, fs lq) to understanding enough to debug interesting<br />
problems, and being able to administer an AFS cell without reading too much<br />
documentation.<br />
Slides: [http://web.mit.edu/cluedumps/slides/afs-cluedump.pdf A PDF is available here]<br />
License: http://creativecommons.org/images/public/somerights20.png [http://creativecommons.org/licenses/by-nc/2.5/ Creative Commons Attribution-NonCommercial 2.5 License ]<br />
<br />
Athena Locker Management + Hesiod<br />
Date: September 25, 2006, 8:30 PM<br />
Presenters: Jacob Morzinski (jmorzins)<br />
Location: 3-133<br />
Abstract:<br />
This cluedump will outline a couple topics, mainly concentrating on<br />
how software lockers on Athena work. We'll discuss what a "locker" is,<br />
and how your computer finds lockers when it needs files from them. We<br />
will move on to discussing how it works when you run software from<br />
lockers on Athena, and how you can install your own software -- either<br />
into your own personal locker, or into a special software locker.<br />
Slides: [http://web.mit.edu/cluedumps/slides/athena-lockers.pdf A PDF is available here]<br />
License: http://creativecommons.org/images/public/somerights20.png [http://creativecommons.org/licenses/by-nc/2.5/ Creative Commons Attribution-NonCommercial 2.5 License ]<br />
<br />
Technical overview of scripts.mit.edu<br />
Date: October 2, 2006, 8:30 PM<br />
Presenters: jbarnold<br />
Volunteers: tabbott<br />
Location: 3-133<br />
Abstract:<br />
The scripts.mit.edu web script service allows individuals and groups to put CGI<br />
scripts (perl, php, python, ruby, scheme, etc) on the web using nothing more than<br />
an Athena account. Integrating this functionality with Athena presented certain<br />
challenges that had to be overcome before the service could be launched.<br />
<br />
In this talk, Jeff Arnold will describe the design and implementation of the<br />
SIPB script services. This talk is intended to be a technical overview of the<br />
internals of the services rather than a gentle introduction to the services<br />
(for documentation intended for potential new users, see http://scripts.mit.edu).<br />
<br />
Technical documentation about scripts is available at<br />
http://scripts.mit.edu/wiki, and the code is available via <br />
svn co https://scripts.mit.edu:1111. Our code is released under the GPL.<br />
<br />
Columbus Day Holiday (No Cluedump)<br />
Date: October 9, 2006<br />
<br />
Kerberos and Related Technologies<br />
Date: October 16, 2006<br />
Presenters: hartmans<br />
Volunteers:<br />
Location: 3-133<br />
Abstract: <br />
Sam Hartman will give an overview of Kerberos, SASL, GSS-API and<br />
related technologies. The talk will focus on what these technologies<br />
can do for users and application developers. The talk also describes<br />
how Kerberos works over the network enough to explain what its<br />
advantages and drawbacks are.<br />
<br />
The Multics Way<br />
Date: October 23, 2006<br />
Presenters: srz<br />
Volunteers:<br />
Location: 3-133<br />
Slides: http://web.mit.edu/srz/www/slides/<br />
Abstract: <br />
Multics was an extraordinarily influential operating system developed<br />
as a joint project of MIT, GE, and Bell Labs. Multicians went on to<br />
develop many other important systems in computer science, such as<br />
Unix, AFS, and Kerberos. This talk will discuss the design philosophy<br />
behind Multics and explain how it is an example of the MIT/Stanford<br />
style of design, captured by the phrase "the right thing".<br />
<br />
We will illustrate a few examples of the Multics design philosophy and<br />
discuss how features that Multics had over 25 years ago are still<br />
being added to modern Unix systems today. We will finish up with a<br />
brief overview of Multics resources available today that describe a<br />
well-documented, well-designed operating system.<br />
<br />
The Law (copyrights, etc.)<br />
Date: October 30, 2006<br />
Presenters: keithw<br />
Volunteers:<br />
Location: 3-133<br />
Abstract: <br />
Could MIT listen in on your phone calls and read your e-mail? Does the DMCA<br />
really authorize torture? Why did a Republican group have to pay $537 to<br />
wdaher last year? Do those MIT singing groups need permission to release<br />
recordings of other people's songs? How did Aimee Smith beat the rap after<br />
getting arrested for calling the MIT Police "fucking pigs"? Could you get in<br />
trouble for buying from allofmp3.com?<br />
<br />
Keith might not be able to answer all these legal questions, but he will help<br />
you learn how to research legal issues for yourself. The cluedump will<br />
discuss American law and legal research, how to use Lexis-Nexis, and touch on<br />
topics relevant to technology, copyrights, and MIT.<br />
<br />
E-mail at MIT<br />
Date: November 6, 2006<br />
Presenters: mitchb<br />
Volunteers: nelhage, jmorzins<br />
Location: 3-133<br />
Abstract:<br />
Where's that e-mail I was supposed to get three hours ago?<br />
Why did that e-mail from my advisor get flagged as spam?<br />
What if I don't want to buy five billion Rolex replicas?<br />
<br />
Just a few years ago, the standard e-mail setup for an ISP could be fairly<br />
simple - one server for your incoming mail (POP), and one for your<br />
outgoing mail (SMTP), and sometimes these were even the same server.<br />
Handling e-mail for a community with the size and characteristics of MIT,<br />
especially in today's world with the huge spam problem that plagues us<br />
all, is a very challenging task. Accordingly, MIT's e-mail architecture<br />
is orders of magnitude more complex than the setup people could expect<br />
from their ISP years ago.<br />
<br />
In this talk, we'll be discussing many of the details of MIT's e-mail<br />
setup, including the various types of mail servers MIT has and the roles<br />
they play. We'll talk about the paths mail takes through the twisty maze<br />
of the mail system, how we try to combat the spam problem and why it's so<br />
difficult, and how to interpret e-mail headers and do some basic debugging<br />
of mail delays. We'll also cover some of the tradeoffs between moira lists<br />
and mailman lists.<br />
<br />
Debian-Athena<br />
Date: November 13, 2006<br />
Presenters: tabbott<br />
Volunteers:<br />
Location: 3-133<br />
Abstract:<br />
The Debian-Athena Project was an effort to create a modular port of the<br />
Athena environment to Debian GNU/Linux. The modulararity allows the user<br />
to select from various levels of integration of Athena with one's personal<br />
computer, varying from complete kerberos integration, to simply being able<br />
to blanche lists or run locker software without problems. SIPB's linux<br />
dialup, linerva.mit.edu, currently runs Debian-Athena with a few security<br />
enhancements. In this talk we will discuss the design and implementation<br />
of Debian-Athena and the various challenges that we faced in creating it.<br />
<br />
WIN.MIT.EDU<br />
Date: November 20, 2006<br />
Presenters: pbh<br />
Volunteers:<br />
Location: 3-133<br />
Abstract:<br />
The creation of the WIN.MIT.EDU started in 1997. The domain started to be<br />
used by early pilot programs in 2001. The domain is now managed and operated<br />
by IS&T's OIS group and has been used by well over 10,000 individuals.<br />
Tonight's talk will attempt to focus on aspects of the domain that are of<br />
direct concern to students and talk about how students may add value to the<br />
domain.<br />
<br />
SAP & MIT's Financial Systems<br />
Date: November 27, 2006<br />
Presenters: mitchb, jhawk<br />
Volunteers:<br />
Location: 3-133<br />
Abstract:<br />
As one might imagine, the finances of an entity like MIT are quite<br />
complex, and require similarly complex systems to keep track of them.<br />
Most people go through their time at MIT without knowing much about its<br />
finances, but lots of them often wonder where the money's being spent,<br />
what really happens after someone orders office supplies on the web,<br />
what an endowment actually is, why it took so long to get a <br />
reimbursement check, etc. In this talk, we'll attempt to demystify <br />
some of the inner workings of money at MIT.<br />
<br />
We'll discuss SAP (MIT's primary business and financial system), as<br />
well as other interrelated systems such as the Roles Database, the Data<br />
Warehouse, and ECAT. We'll cover much of the elusive vocabulary that<br />
people involved with MIT finance use, and will discuss and provide <br />
examples of the way MIT structures accounts and assigns permissions, <br />
how to examine account activity, the detailed process by which MIT <br />
purchases items, and a handful of other topics. While the focus will<br />
not be on the things that are specific to student group accounts, some<br />
of the information presented may be of interest or use to people involved<br />
in the treasuries of such groups.<br />
<br />
Xen and virtualization<br />
Date: December 4, 2006 [didn't happen]<br />
Presenters: nelhage, aseering<br />
Volunteers:<br />
Location: 3-133<br />
Abstract:<br />
Virtualization is the hot new topic in both software and hardware<br />
these days! Learn about the software behind virtualization, and how it<br />
works, as well as about Intel and AMD's new hardware extensions<br />
intended to make implementing virtualization easier. Then, learn more<br />
about VMWare and Xen, two of the leading virtualization products on<br />
the market today, how they work, how they're different, and what they<br />
can do.<br />
<br />
Audio and Video Compression (HDTV, MP3 and DVD)<br />
Date: December 11, 2006 [didn't happen]<br />
Presenters: keithw<br />
Volunteers:<br />
Location: 3-133</div>Pricehttp://cluedumps.mit.edu/wiki/2007/11-052007/11-052007-11-06T02:59:21Z<p>Price: nelson's extra info</p>
<hr />
<div>{{cluedump|title=Exploiting the Internet (or, how to 0wn the internet in your free time)<br />
|date=2007-11-05 20:30<br />
|presenters=Nelson Elhage (nelhage)<br />
|location=56-114<br />
|afternotes=See [http://nelhage.com/cluedump/stack/ Nelson's cluedump page].<br />
|abstract=The world has changed since Aleph One's "Smashing The Stack For Fun And Profit." Buffer overflows, while less common, are still discovered in major software almost every day. However, runtime-system countermeasures, such as non-executable stacks and stack protection or "canary" technologies, are increasingly prevalent and sophisticated. I'll start with a review of the classic "stack-smashing" attack, and then cover a variety of the methods used to defeat such attacks even on vulnerable software, as well as some of the tricks hackers have invented for getting around them.<br />
}}</div>Pricehttp://cluedumps.mit.edu/wiki/MediaWiki:MainpageMediaWiki:Mainpage2007-10-25T00:55:39Z<p>Price: New page: SIPB Cluedump Series</p>
<hr />
<div>SIPB Cluedump Series</div>Pricehttp://cluedumps.mit.edu/wiki/Template:!-Template:!-2007-10-24T23:44:15Z<p>Price: terrible hack</p>
<hr />
<div>|-</div>Pricehttp://cluedumps.mit.edu/wiki/Template:!Template:!2007-10-24T23:41:46Z<p>Price: terrible hack</p>
<hr />
<div>|</div>Price