<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	>
<channel>
	<title>Comments for Vannevar Vision</title>
	<atom:link href="http://vannevarvision.wordpress.com/comments/feed/" rel="self" type="application/rss+xml" />
	<link>http://vannevarvision.wordpress.com</link>
	<description>Information Retrieval, Search Engines, Visualization, Eclipse and Java</description>
	<pubDate>Sat, 17 May 2008 18:39:45 +0000</pubDate>
	<generator>http://wordpress.org/?v=MU</generator>
		<item>
		<title>Comment on Want to comment on Tim Berners-Lee&#8217;s blog? Here&#8217;s how by A Key</title>
		<link>http://vannevarvision.wordpress.com/2007/11/02/want-to-comment-on-tim-berners-lees-blog-heres-how/#comment-143</link>
		<dc:creator>A Key</dc:creator>
		<pubDate>Tue, 13 May 2008 21:02:12 +0000</pubDate>
		<guid isPermaLink="false">http://vannevarvision.wordpress.com/2007/11/02/want-to-comment-on-tim-berners-lees-blog-heres-how/#comment-143</guid>
		<description>Or you could have slipped a couple of bucks to the doorman, like I did.</description>
		<content:encoded><![CDATA[<p>Or you could have slipped a couple of bucks to the doorman, like I did.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Eclipse Plug-in GEF Tutorial by Korennoy Vladimir</title>
		<link>http://vannevarvision.wordpress.com/2007/03/08/eclipse-plug-in-gef-tutorial/#comment-142</link>
		<dc:creator>Korennoy Vladimir</dc:creator>
		<pubDate>Tue, 06 May 2008 20:47:56 +0000</pubDate>
		<guid isPermaLink="false">http://vannevarvision.wordpress.com/2007/03/08/eclipse-plug-in-gef-tutorial/#comment-142</guid>
		<description>thanks!</description>
		<content:encoded><![CDATA[<p>thanks!</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Review: Exploiting Social Networks for Internet Search by Seifu T.</title>
		<link>http://vannevarvision.wordpress.com/2007/10/04/review-exploiting-social-networks-for-internet-search/#comment-139</link>
		<dc:creator>Seifu T.</dc:creator>
		<pubDate>Sun, 27 Apr 2008 07:46:51 +0000</pubDate>
		<guid isPermaLink="false">http://vannevarvision.wordpress.com/2007/10/04/review-exploiting-social-networks-for-internet-search/#comment-139</guid>
		<description>Great comment Shahan.

I read the paper (the summarized version that I found at www.mpi-sws.mpg.de/~amislove/publications/PeerSpective-HotNets.pdf) and I think the idea of improving search based on information gleaned from social relatedness is great.

There are things I don't understand, though:
-In the paper, it is described how the HTTP proxy installed on the computers of the peers voluntarily participating in the experiment was used to index the URLs visited by these users. The queries submitted to the PeerSpective system were matched against these indexes distributed in these peers (if I am not mistaken). I don't thus see how this is different from just a distributed (decentralized) search system. If this was done in a group consisting multiple social circles, was there any mechanism stated for discerning to what social circle an individual belonged to? In the absence of that, how is their system different from a decentralized Web search engine?
-One of the problems of conventional search engines pointed out by the authors was the lack of indexing on non-html pages. How would the use of social network-based searching do away with this problem? I didn't see any data related to this point in the results of the experiment. Did I miss something?
-Again I don't see how the idea of improving results on pages in the deep web or dark web... relate to social network based search than to the search merely being distributed.
-Finally, the authors raised an interesting point in noting that the ranking of a search result can be fine tuned based on an individual's "context" of the term- the context being derived from what social network the individual belongs to. However, while I thought this would at the same time reduce the "serendipity" of the information in the query results as the information would be defined in a narrow context, the authors contended the reverse. What do you think?

I am eager to hear your comments on each one of the above.

S.T.</description>
		<content:encoded><![CDATA[<p>Great comment Shahan.</p>
<p>I read the paper (the summarized version that I found at <a href="http://www.mpi-sws.mpg.de/~amislove/publications/PeerSpective-HotNets.pdf" rel="nofollow">http://www.mpi-sws.mpg.de/~amislove/publications/PeerSpective-HotNets.pdf</a>) and I think the idea of improving search based on information gleaned from social relatedness is great.</p>
<p>There are things I don&#8217;t understand, though:<br />
-In the paper, it is described how the HTTP proxy installed on the computers of the peers voluntarily participating in the experiment was used to index the URLs visited by these users. The queries submitted to the PeerSpective system were matched against these indexes distributed in these peers (if I am not mistaken). I don&#8217;t thus see how this is different from just a distributed (decentralized) search system. If this was done in a group consisting multiple social circles, was there any mechanism stated for discerning to what social circle an individual belonged to? In the absence of that, how is their system different from a decentralized Web search engine?<br />
-One of the problems of conventional search engines pointed out by the authors was the lack of indexing on non-html pages. How would the use of social network-based searching do away with this problem? I didn&#8217;t see any data related to this point in the results of the experiment. Did I miss something?<br />
-Again I don&#8217;t see how the idea of improving results on pages in the deep web or dark web&#8230; relate to social network based search than to the search merely being distributed.<br />
-Finally, the authors raised an interesting point in noting that the ranking of a search result can be fine tuned based on an individual&#8217;s &#8220;context&#8221; of the term- the context being derived from what social network the individual belongs to. However, while I thought this would at the same time reduce the &#8220;serendipity&#8221; of the information in the query results as the information would be defined in a narrow context, the authors contended the reverse. What do you think?</p>
<p>I am eager to hear your comments on each one of the above.</p>
<p>S.T.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Published: Exploring PSI-MI XML Collections Using DescribeX by reza</title>
		<link>http://vannevarvision.wordpress.com/2007/10/02/published-exploring-psi-mi-xml-collections-using-describex/#comment-85</link>
		<dc:creator>reza</dc:creator>
		<pubDate>Wed, 13 Feb 2008 05:15:36 +0000</pubDate>
		<guid isPermaLink="false">http://vannevarvision.wordpress.com/2007/10/02/published-exploring-psi-mi-xml-collections-using-describex/#comment-85</guid>
		<description>it was one of my best experiences working with Shahan!</description>
		<content:encoded><![CDATA[<p>it was one of my best experiences working with Shahan!</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on About by reza</title>
		<link>http://vannevarvision.wordpress.com/about/#comment-84</link>
		<dc:creator>reza</dc:creator>
		<pubDate>Wed, 13 Feb 2008 05:13:38 +0000</pubDate>
		<guid isPermaLink="false">#comment-84</guid>
		<description>very interesting site! when you read it you can perfectly imagine that Shahan is talking with you with his warm, welcoming, and of course professional style. 
lot of good stuff, now I can read from here instead of bugging Shahan with my question at least for some of my questions! 
good luck Shahan and keep going!</description>
		<content:encoded><![CDATA[<p>very interesting site! when you read it you can perfectly imagine that Shahan is talking with you with his warm, welcoming, and of course professional style.<br />
lot of good stuff, now I can read from here instead of bugging Shahan with my question at least for some of my questions!<br />
good luck Shahan and keep going!</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Reading List: Online Social Networks by links for 2007-11-28 &#171; Das Textdepot</title>
		<link>http://vannevarvision.wordpress.com/2007/10/11/reading-list-online-social-networks/#comment-37</link>
		<dc:creator>links for 2007-11-28 &#171; Das Textdepot</dc:creator>
		<pubDate>Wed, 28 Nov 2007 05:24:33 +0000</pubDate>
		<guid isPermaLink="false">http://vannevarvision.wordpress.com/2007/10/11/reading-list-online-social-networks/#comment-37</guid>
		<description>[...] Reading List: Online Social Networks « Vannevar Vision (via Heinz W.) (tags: socialnetworks science) [...]</description>
		<content:encoded><![CDATA[<p>[...] Reading List: Online Social Networks « Vannevar Vision (via Heinz W.) (tags: socialnetworks science) [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Reading List: Online Social Networks by B00MBL1TZ. &#8211; links for 2007-11-28</title>
		<link>http://vannevarvision.wordpress.com/2007/10/11/reading-list-online-social-networks/#comment-36</link>
		<dc:creator>B00MBL1TZ. &#8211; links for 2007-11-28</dc:creator>
		<pubDate>Wed, 28 Nov 2007 01:26:12 +0000</pubDate>
		<guid isPermaLink="false">http://vannevarvision.wordpress.com/2007/10/11/reading-list-online-social-networks/#comment-36</guid>
		<description>[...] Reading List: Online Social Networks « Vannevar Vision Literaturliste zu sozialen Netzwerken, Schwerpunkt auf der Verwendung von SNs für die Suche (tags: via:heinzwittenbrink by:ShahanKhatchadourian socialnetworks literature #forthesis) [...]</description>
		<content:encoded><![CDATA[<p>[...] Reading List: Online Social Networks « Vannevar Vision Literaturliste zu sozialen Netzwerken, Schwerpunkt auf der Verwendung von SNs für die Suche (tags: via:heinzwittenbrink by:ShahanKhatchadourian socialnetworks literature #forthesis) [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Want to comment on Tim Berners-Lee&#8217;s blog? Here&#8217;s how by monkinetic &#124; Blog Archive &#187; Making a list: Whitelisting with OpenId and XFN</title>
		<link>http://vannevarvision.wordpress.com/2007/11/02/want-to-comment-on-tim-berners-lees-blog-heres-how/#comment-35</link>
		<dc:creator>monkinetic &#124; Blog Archive &#187; Making a list: Whitelisting with OpenId and XFN</dc:creator>
		<pubDate>Mon, 26 Nov 2007 12:25:43 +0000</pubDate>
		<guid isPermaLink="false">http://vannevarvision.wordpress.com/2007/11/02/want-to-comment-on-tim-berners-lees-blog-heres-how/#comment-35</guid>
		<description>[...] Sean Palmer has a deeper, very interesting description of the process that went into the system, and Shahan Khatchadourian describes how it works for a new user [...]</description>
		<content:encoded><![CDATA[<p>[...] Sean Palmer has a deeper, very interesting description of the process that went into the system, and Shahan Khatchadourian describes how it works for a new user [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on About by monkinetic &#124; Blog Archive &#187; Making a list: Whitelisting with OpenId and XFN</title>
		<link>http://vannevarvision.wordpress.com/about/#comment-34</link>
		<dc:creator>monkinetic &#124; Blog Archive &#187; Making a list: Whitelisting with OpenId and XFN</dc:creator>
		<pubDate>Mon, 26 Nov 2007 06:53:39 +0000</pubDate>
		<guid isPermaLink="false">#comment-34</guid>
		<description>[...] Palmer has a deeper, very interesting description of the process that went into the system, and Shahan Khatchadourian describes how it works for a new [...]</description>
		<content:encoded><![CDATA[<p>[...] Palmer has a deeper, very interesting description of the process that went into the system, and Shahan Khatchadourian describes how it works for a new [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Want to comment on Tim Berners-Lee&#8217;s blog? Here&#8217;s how by Mike Linksvayer &#187; bar : sex :: social networking site : spam</title>
		<link>http://vannevarvision.wordpress.com/2007/11/02/want-to-comment-on-tim-berners-lees-blog-heres-how/#comment-31</link>
		<dc:creator>Mike Linksvayer &#187; bar : sex :: social networking site : spam</dc:creator>
		<pubDate>Fri, 23 Nov 2007 05:42:13 +0000</pubDate>
		<guid isPermaLink="false">http://vannevarvision.wordpress.com/2007/11/02/want-to-comment-on-tim-berners-lees-blog-heres-how/#comment-31</guid>
		<description>[...] social networks could be used to fight spam and otherwise bootstrap reputation systems. I am mildly surprised that although trust is perhaps [...]</description>
		<content:encoded><![CDATA[<p>[...] social networks could be used to fight spam and otherwise bootstrap reputation systems. I am mildly surprised that although trust is perhaps [...]</p>
]]></content:encoded>
	</item>
</channel>
</rss>
