<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>White Hat News &#187; military</title>
	<atom:link href="http://whitehatfirm.com/news/tag/military/feed" rel="self" type="application/rss+xml" />
	<link>http://whitehatfirm.com/news</link>
	<description>We Deliver Technology News</description>
	<lastBuildDate>Fri, 13 Jan 2012 22:38:14 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0.1</generator>
		<item>
		<title>Social networking power &amp; recursive incentive helped MIT team win Balloon hunt</title>
		<link>http://whitehatfirm.com/news/social-networking-power-recursive-incentive-helped-mit-team-win-balloon-hunt/1044-web-seo-nyc.html</link>
		<comments>http://whitehatfirm.com/news/social-networking-power-recursive-incentive-helped-mit-team-win-balloon-hunt/1044-web-seo-nyc.html#comments</comments>
		<pubDate>Mon, 07 Dec 2009 03:50:49 +0000</pubDate>
		<dc:creator>Nancy White</dc:creator>
				<category><![CDATA[Technology]]></category>
		<category><![CDATA[Balloon]]></category>
		<category><![CDATA[balloon hunt]]></category>
		<category><![CDATA[challenge]]></category>
		<category><![CDATA[DARPA]]></category>
		<category><![CDATA[Internet]]></category>
		<category><![CDATA[military]]></category>
		<category><![CDATA[MIT]]></category>
		<category><![CDATA[Netwrok challenge]]></category>
		<category><![CDATA[prizes]]></category>
		<category><![CDATA[red ballon hunt]]></category>
		<category><![CDATA[research]]></category>
		<category><![CDATA[Social Networking]]></category>
		<category><![CDATA[social networks]]></category>
		<category><![CDATA[SocialNetworks]]></category>
		<category><![CDATA[winners]]></category>

		<guid isPermaLink="false">http://whitehatfirm.com/news/?p=1044</guid>
		<description><![CDATA[A team from MIT takes the winning amount of $40,000 for the red balloon contest arranged by DARPA. The contest organized to prize the fastest and strongest network was tagged as DARPA Network Challenge. Defense Advanced Research Projects Agency organized the Network Challenge in which almost 4,000 teams registered to complete the task to correctly [...]]]></description>
			<content:encoded><![CDATA[<p><strong>A team from MIT takes the winning amount of $40,000 for the red balloon contest arranged by DARPA. The contest organized to prize the fastest and strongest network was tagged as DARPA Network Challenge.</strong></p>
<p> Defense Advanced Research Projects Agency organized the <strong>Network Challenge</strong> in which almost 4,000 teams registered to complete the task to correctly identify the location of 10 red balloons distributed around the United States. The competition aimed to develop new ways to understand how information is disseminated through social networks within small amount of time, the study could further be used to help solve big problems through chain of social networking.</p>
<p>The <strong>Contest objective</strong> included exploring basic research issues like mobilization, collaboration, and trusts in diverse social networking constructs and could serve to fuel innovation across a wide spectrum of applications. </p>
<p>DARPA organized the completion to mark 40th anniversary of ARPANet, pre-cursor to todays internet.<br />
<strong><br />
Winners</strong></p>
<p>A small <strong>team at the M.I.T.</strong> Media Laboratory Human Dynamics Group led by a physicist, Riley Crane, was the first to win the challenge by location all the balloons in just eight hours and 56 minutes. </p>
<p>Winning researchers were specialized in studying human interactions that emerge from computer networks. They called their methodology used to complete the task as <strong>“recursive incentive structure”</strong>.  </p>
<p>To locate the balloons they set up a Web site asking people to join their team. They relied on visitors to the Web site to invite their friends. They also sent e-mail messages inviting people to participate and sent a small number of advertisements to mobile phones too.</p>
<p>The team tempted participants by announcing that they would distribute the prize money both to chains of individuals who referred people who had correct information on the balloons’ locations and to charities. </p>
<p>Dr. Cane followed the approach “rewards people who make real contributions”, to win the contest.</p>
<p>The team supporting their technique said that this could also be used for finding criminals and missing children and halting impending terrorist attacks, which if applied correctly would definitely churn out the benefit of the power of social networking.</p>
]]></content:encoded>
			<wfw:commentRss>http://whitehatfirm.com/news/social-networking-power-recursive-incentive-helped-mit-team-win-balloon-hunt/1044-web-seo-nyc.html/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

