<?xml version="1.0" encoding="UTF-8" ?>	
            <rss version="2.0" xmlns:media="http://search.yahoo.com/mrss/">
               	<channel>
                  	<title><![CDATA[Recent Videos posted to Information and decision systems on MIT Video]]></title>
                  	<link>http://video.mit.edu/channel/information-and-decision-systems/</link>
                  	<description></description>
                  	<language>en-us</language>
                  	<pubDate>Wed, 30 Nov 2011 05:00:00 GMT</pubDate>
                  	<lastBuildDate>Mon, 20 May 2013 11:36:26 EDT</lastBuildDate>					
					                    	
                        <item>
                         	<title><![CDATA[Meet 2011 TR35 Winner Alina Oprea]]></title>                         
                         	<link>http://video.mit.edu/watch/meet-2011-tr35-winner-alina-oprea-22/</link>
                         	<description><![CDATA[Oprea describes her work at EmTech 2011: Guaranteeing cloud security

RSA Laboratories

PROBLEM: Cloud computing offers numerous advantages to businesses and individuals by enabling them to store data and run websites on remote computers rather than ones they own. But many hesitate to use the technology for fear of what might happen if a cloud provider's systems aren't secured properly or break down.

SOLUTION: Software created by Alina Oprea, a researcher at RSA Laboratories in Cambridge, Massachusetts, can guarantee users that their data hasn't been tampered with and won't become inaccessible. For her 2007 PhD thesis, she developed a digital fingerprint capable of quickly verifying that data stored in the cloud hasn't been maliciously altered or accidentally corrupted. Then, at RSA, Oprea helped create HAIL, a technology that lets users divide data among multiple cloud providers in such a way that if one provider goes offline, the missing information can be reconstructed from the data stored by the others.

Learn more: http://techre.vu/xoJ0AA]]></description>                         
                         	<media:thumbnail url="http://video.mit.edu/assets/img/videos/165/20120125134448-1-1283643547001.jpg" height="100" width="165" />                         
                        	<pubDate>Wed, 30 Nov 2011 05:00:00 GMT</pubDate>
                        	<guid>http://video.mit.edu/watch/meet-2011-tr35-winner-alina-oprea-22/</guid>
                      	</item>
                                          	
                        <item>
                         	<title><![CDATA[Impact of Context on Information Spreading]]></title>                         
                         	<link>http://video.mit.edu/watch/impact-of-context-on-information-spreading-7988/</link>
                         	<description><![CDATA[
        Wang Dashun from Northeastern Univ.
      ]]></description>                         
                         	<media:thumbnail url="http://video.mit.edu/assets/img/videos/165/20120125135751-9-1_fi7mse4h.jpg" height="100" width="165" />                         
                        	<pubDate>Thu, 28 Jul 2011 18:00:38 GMT</pubDate>
                        	<guid>http://video.mit.edu/watch/impact-of-context-on-information-spreading-7988/</guid>
                      	</item>
                                          	
                        <item>
                         	<title><![CDATA[METHODS FOR CLUSTERING MULTI-LAYER GRAPHS IN MOBILE NETWORKS]]></title>                         
                         	<link>http://video.mit.edu/watch/methods-for-clustering-multi-layer-graphs-in-mobile-networks-7987/</link>
                         	<description><![CDATA[
        Nikolai Nefedov from the Nokia Research Center in Lausanne, Switzerland.
      ]]></description>                         
                         	<media:thumbnail url="http://video.mit.edu/assets/img/videos/165/20120125135751-9-1_utuybpkt.jpg" height="100" width="165" />                         
                        	<pubDate>Thu, 28 Jul 2011 17:58:10 GMT</pubDate>
                        	<guid>http://video.mit.edu/watch/methods-for-clustering-multi-layer-graphs-in-mobile-networks-7987/</guid>
                      	</item>
                                          	
                        <item>
                         	<title><![CDATA[Fellows: Crowd-Sourcing the Evaluation of an Overlapping Community Model based on the Cohesion Measure]]></title>                         
                         	<link>http://video.mit.edu/watch/fellows-crowd-sourcing-the-evaluation-of-an-overlapping-community-model-based-on-the-cohesion-measu-7986/</link>
                         	<description><![CDATA[
        Adrien Friggeri (INRIA)
      ]]></description>                         
                         	<media:thumbnail url="http://video.mit.edu/assets/img/videos/165/20120125135750-9-1_88115lov.jpg" height="100" width="165" />                         
                        	<pubDate>Thu, 28 Jul 2011 17:55:59 GMT</pubDate>
                        	<guid>http://video.mit.edu/watch/fellows-crowd-sourcing-the-evaluation-of-an-overlapping-community-model-based-on-the-cohesion-measu-7986/</guid>
                      	</item>
                                          	
                        <item>
                         	<title><![CDATA[Stochastic Blockmodels with Growing Number of Classes]]></title>                         
                         	<link>http://video.mit.edu/watch/stochastic-blockmodels-with-growing-number-of-classes-7985/</link>
                         	<description><![CDATA[
        David S. Choi of Harvard presents.
      ]]></description>                         
                         	<media:thumbnail url="http://video.mit.edu/assets/img/videos/165/20120125135750-9-1_gzerb548.jpg" height="100" width="165" />                         
                        	<pubDate>Thu, 28 Jul 2011 17:53:24 GMT</pubDate>
                        	<guid>http://video.mit.edu/watch/stochastic-blockmodels-with-growing-number-of-classes-7985/</guid>
                      	</item>
                                          	
                        <item>
                         	<title><![CDATA[Robustness and limited modular information in networks]]></title>                         
                         	<link>http://video.mit.edu/watch/robustness-and-limited-modular-information-in-networks-7983/</link>
                         	<description><![CDATA[
        James P. Bagrow from Northeastern Univ. presents
      ]]></description>                         
                         	<media:thumbnail url="http://video.mit.edu/assets/img/videos/165/20120125135750-9-1_4dncav3r.jpg" height="100" width="165" />                         
                        	<pubDate>Wed, 27 Jul 2011 20:52:40 GMT</pubDate>
                        	<guid>http://video.mit.edu/watch/robustness-and-limited-modular-information-in-networks-7983/</guid>
                      	</item>
                                          	
                        <item>
                         	<title><![CDATA[Computing global social balance in large-scale signed social networks]]></title>                         
                         	<link>http://video.mit.edu/watch/computing-global-social-balance-in-large-scale-signed-social-networks-7982/</link>
                         	<description><![CDATA[
        Claudio Altafini from SISSA International School for Advanced Studies in Trieste, Italy presents.
      ]]></description>                         
                         	<media:thumbnail url="http://video.mit.edu/assets/img/videos/165/20120125135750-9-1_6agntx7l.jpg" height="100" width="165" />                         
                        	<pubDate>Wed, 27 Jul 2011 20:30:24 GMT</pubDate>
                        	<guid>http://video.mit.edu/watch/computing-global-social-balance-in-large-scale-signed-social-networks-7982/</guid>
                      	</item>
                                          	
                        <item>
                         	<title><![CDATA[A Personalized Trip to the Grocery Store]]></title>                         
                         	<link>http://video.mit.edu/watch/a-personalized-trip-to-the-grocery-store-68/</link>
                         	<description><![CDATA[Technology Review IT editor Erica Naone visits a Stop &amp; Shop in Braintree, Massachusetts, to test Modiv Media's new iPhone app. This lets consumers shop using a smart phone and serves up personalized offers when they do.]]></description>                         
                         	<media:thumbnail url="http://video.mit.edu/assets/img/videos/165/20120125134455-1-915459061001.jpg" height="100" width="165" />                         
                        	<pubDate>Mon, 25 Apr 2011 04:00:00 GMT</pubDate>
                        	<guid>http://video.mit.edu/watch/a-personalized-trip-to-the-grocery-store-68/</guid>
                      	</item>
                                          	
                        <item>
                         	<title><![CDATA[The Future of Digital Commons]]></title>                         
                         	<link>http://video.mit.edu/watch/the-future-of-digital-commons-9963/</link>
                         	<description><![CDATA[Nancy Kranich&lt;/b&gt; says the debate boils down to this: &quot;Is information a public good or a commodity?&quot;  The more profit to be made, the higher the tension.   Kranich envisions an &quot;information society of the 21st century,&quot; where the ruling metaphor is the commons:  information is neither public nor private but something shared.  Intellectual assets are not given away but managed &quot;to sustain communities of interest,&quot; and to foster free expression, creativity, innovation and democracy.

Ideas, unlike popsicles, do not disappear once they are consumed, &lt;b&gt;Ann Wolpert&lt;/b&gt; notes.  And the resources of the academic world are intended to be used repeatedly -- exchanged and enhanced.  Wolpert finds particularly threatening the notion of extending copyright law to the work of academics.  Ideas should not &quot;be stuffed in the same box as Mickey Mouse,&quot; she says.  The internet has fundamentally changed the flow of information, and while it has encouraged a greater degree of &quot;social sharing,&quot; it is now threatened by market forces, which insist on controlling and realizing profit from ideas.  Asserts Wolpert, &quot;Neither the academy nor society can tolerate tight control over movement of information.  For knowledge to advance, production and distribution systems can and should occur outside the tightly controlled, capital intensive publishing system.&quot;

Steven Pinker&lt;/b&gt; admits that &quot;as both a consumer and producer of information,&quot; he has not resolved the conflicting demands of distributing his research freely, and making a living from it.  &quot;There is the question of how many  ' books would I write if I didn't get a check in the mail from the publisher every once in while.&quot;  He warns against designing and promoting an information commons that relies exclusively on generosity, openness and inclusiveness -- human nature being what it is.  However, Pinker finds hope in such models as Apple's iTunes, with its micropayments to download music, and Wikipedia the online, participatory encyclopedia where people engage in uncompensated activity for the prestige of making &quot;accurate and useful entries&quot; in a shared online resource.

Participants: Nancy Kranich, Former President, American Library Association;  Guest Lecturer;  Ann Wolpert, Director of Libraries;  Steven Pinker, Johnstone Family Professor of Psychology;  Harvard University

Event date: 09/22/2005

Host(s): School of Humanities, Arts &amp; Social Sciences, Communications Forum]]></description>                         
                         	<media:thumbnail url="http://video.mit.edu/assets/img/videos/165/20120131113436-2214194219.jpg" height="100" width="165" />                         
                        	<pubDate>Thu, 22 Sep 2005 04:00:00 GMT</pubDate>
                        	<guid>http://video.mit.edu/watch/the-future-of-digital-commons-9963/</guid>
                      	</item>
                      				</channel>
			</rss>
	