<?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>René Pickhardt</title>
	<atom:link href="http://www.rene-pickhardt.de/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.rene-pickhardt.de</link>
	<description>China, Mathematik, SEO, Heavy Metal</description>
	<lastBuildDate>Tue, 15 May 2012 13:30:51 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0.4</generator>
		<item>
		<title>Stealing music is bullcrap and not acceptable!</title>
		<link>http://www.rene-pickhardt.de/stealing-music-is-bullcrap-and-not-acceptable/</link>
		<comments>http://www.rene-pickhardt.de/stealing-music-is-bullcrap-and-not-acceptable/#comments</comments>
		<pubDate>Tue, 15 May 2012 13:30:50 +0000</pubDate>
		<dc:creator>Rene</dc:creator>
				<category><![CDATA[Online music marketing]]></category>
		<category><![CDATA[copyright]]></category>
		<category><![CDATA[pirate party]]></category>

		<guid isPermaLink="false">http://www.rene-pickhardt.de/?p=1333</guid>
		<description><![CDATA[After a series of successes of the German pirate party in elections there came up a big discussion on the German web about copyright in the publishing industry. see for example: we are the creators we are the citizens and I am the bad girl even new collecting companies (as competitor to GEMA) are about [...]


Related posts:<ol><li><a href='http://www.rene-pickhardt.de/look-for-love-video-did-dj-sammy-steel-the-video-stroy-from-jubilees-love-language-video-watch-both-clips/' rel='bookmark' title='Look for love video: Did DJ Sammy steel the video story from jubilees Love Language video? Watch both clips!'>Look for love video: Did DJ Sammy steel the video story from jubilees Love Language video? Watch both clips!</a></li>
<li><a href='http://www.rene-pickhardt.de/why-online-music-marketing-and-what-is-it/' rel='bookmark' title='Why online music marketing and what is it?'>Why online music marketing and what is it?</a></li>
<li><a href='http://www.rene-pickhardt.de/facebook-streaming-app-viral-maketing-word-of-mouth-for-music-bands/' rel='bookmark' title='Facebook Streaming App &#8211; viral maketing (Word of mouth) for music bands'>Facebook Streaming App &#8211; viral maketing (Word of mouth) for music bands</a></li>
</ol>]]></description>
			<content:encoded><![CDATA[<p>After a series of successes of the German pirate party in elections there came up a big discussion on the German web about copyright in the publishing industry. see for example:</p>
<ul>
<li><a target="_blank" href="http://www.wir-sind-die-urheber.de/">we are the creators</a></li>
<li><a target="_blank" href="http://wir-sind-die-buerger.de">we are the citizens</a></li>
<li>and <a target="_blank" href="http://anneschuessler.com/2012/05/11/ich-bin-die-bose/">I am the bad girl</a></li>
<li>even new <a target="_blank" href="http://www.c-3-s.eu/">collecting companies</a> (as competitor to GEMA) are about to be established</li>
</ul>
<p>Being myself a member of the <a target="_blank" href="http://www.piratenpartei.de/">pirate party</a> people often assume that I want to legalize file sharing and make music free of charge for anybody. Even though I think <a href="http://www.rene-pickhardt.de/share-your-music-but-do-it-the-right-way/">this can be a smart move in online music marketing</a>&nbsp;I don&#8217;t follow these goals. After a huge discussion with two musicians I am befriend with I have the feeling that I should make this public clear statement once and for all:</p>
<p><strong>I don&#8217;t support people steeling music in p2p file sharing services. This does harm the musician!</strong></p>
<p>What I support is the idea of a modern copyright law that respects modern technology and also the&nbsp;behavior&nbsp;of the market and our society. This means in particular the establishment of modern business models for musicians.</p>
<p>I encourage any German person reading this blog to participate in the <a target="_blank" href="http://wiki.piratenpartei.de/AG_Urheberrecht">Working group copyright of the pirate party</a>. You can participate and <a target="_blank" href="https://service.piratenpartei.de/listinfo/ag-urheberrecht">follow the mailinglist</a>&nbsp;and join the discussion without being a member of the party.&nbsp;Most pirates don&#8217;t want to get rid of the copyright (as stated in media) but they want to modernize it and they enjoy music and are on the side of the musicians.&nbsp;Especially musicians should join the discussion since it is a topic that is of their concern!</p>


<p>Related posts:<ol><li><a href='http://www.rene-pickhardt.de/look-for-love-video-did-dj-sammy-steel-the-video-stroy-from-jubilees-love-language-video-watch-both-clips/' rel='bookmark' title='Look for love video: Did DJ Sammy steel the video story from jubilees Love Language video? Watch both clips!'>Look for love video: Did DJ Sammy steel the video story from jubilees Love Language video? Watch both clips!</a></li>
<li><a href='http://www.rene-pickhardt.de/why-online-music-marketing-and-what-is-it/' rel='bookmark' title='Why online music marketing and what is it?'>Why online music marketing and what is it?</a></li>
<li><a href='http://www.rene-pickhardt.de/facebook-streaming-app-viral-maketing-word-of-mouth-for-music-bands/' rel='bookmark' title='Facebook Streaming App &#8211; viral maketing (Word of mouth) for music bands'>Facebook Streaming App &#8211; viral maketing (Word of mouth) for music bands</a></li>
</ol></p>]]></content:encoded>
			<wfw:commentRss>http://www.rene-pickhardt.de/stealing-music-is-bullcrap-and-not-acceptable/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Smartphones of Policemen could give criminals a competitive advantage</title>
		<link>http://www.rene-pickhardt.de/smartphones-of-policemen-could-give-criminals-a-competitive-advantage/</link>
		<comments>http://www.rene-pickhardt.de/smartphones-of-policemen-could-give-criminals-a-competitive-advantage/#comments</comments>
		<pubDate>Fri, 27 Apr 2012 09:31:43 +0000</pubDate>
		<dc:creator>Rene</dc:creator>
				<category><![CDATA[Privacy]]></category>
		<category><![CDATA[android]]></category>
		<category><![CDATA[anonymous]]></category>
		<category><![CDATA[application]]></category>
		<category><![CDATA[Information retrieval]]></category>
		<category><![CDATA[iPhone]]></category>
		<category><![CDATA[risk]]></category>
		<category><![CDATA[security]]></category>
		<category><![CDATA[tracking]]></category>
		<category><![CDATA[why]]></category>

		<guid isPermaLink="false">http://www.rene-pickhardt.de/?p=1310</guid>
		<description><![CDATA[If I were a criminal I would create a smart phone app which would give me the possability to geographically and socially track policemen. Here some background on this thought. Yesterday I was sitting in the German summit on &#8220;Facebook Goolgle &#38; Co &#8211; Chances and Risks&#8221; (which I will blog about soon) But today [...]


Related posts:<ol><li><a href='http://www.rene-pickhardt.de/first-privacy-impressions-of-my-new-android-phone/' rel='bookmark' title='First privacy impressions of my new android phone'>First privacy impressions of my new android phone</a></li>
<li><a href='http://www.rene-pickhardt.de/keynote-on-www2012-by-sir-tim-berners-lee/' rel='bookmark' title='Keynote on www2012 by Sir Tim Berners Lee'>Keynote on www2012 by Sir Tim Berners Lee</a></li>
</ol>]]></description>
			<content:encoded><![CDATA[<p>If I were a criminal I would create a smart phone app which would give me the possability to geographically and socially track policemen. Here some background on this thought.</p>
<p>Yesterday I was sitting in the German summit on &#8220;Facebook Goolgle &amp; Co &#8211; Chances and Risks&#8221; (which I will blog about soon) But today during my train trip to the second day of the summit I was sitting in the train talking to a very friendly police officer. He agreed with what was said on the summit. The police is using social networks to find potential criminals. They also use cellphone tracking together with mobile providers to find people they are looking for. Nothing new and special so far. But now my interesting observation.</p>
<p>The police officer proudly told me that he is not using any social networking service because he enjoys his life in privacy. I understood that he believed this to be necessary in his job. By telling me this he was holding his iPhone in his hand. Again this shows one of the most crucial parts in this entire privacy discussion. Even highly educated people often lack an understanding of how much private information they implicitly give to third parties.</p>
<p>So I asked him if he used it during work times and he told me that he did since only mobile providers would know where he is and they could not give away data that easily. I was amazed! A policeman using an iPhone during work. That is such a security lack. If I were a terrorist organization I would create an iPhone and android app (or if possible an <a target="_blank" href="http://www.rene-pickhardt.de/keynote-on-www2012-by-sir-tim-berners-lee/">open mobile html5 app like Tim Berners Lee suggests</a> &lt;&#8211; you see the ethics overwhelm I am just not a criminal (-:). I would design this app in a way to support policemen. Help them communicate or have a cool map integration anything that was useful for the police. In this way I would create a database with real movement data of policemen. This data I could use for a different service similar to&nbsp;<a rel="nofollow" href="http://girlsaround.me/">http://girlsaround.me/</a>&nbsp;displaying the current position and face of policemen (including if requested a list of people they recently communicated with including their phone numbers) on a map to anyone of my terrorist organization. The police just could never catch me since I would always know where they are (without asking any mobile provider!) I could even give them fake phone calls pretending I am one of the people they recently communicated with inputting them false information or just distracting them.</p>
<h3>Of course this setting is only half realistic:</h3>
<ul>
<li>Every policeman would have to have a smartphone and use it during work time</li>
<li>Every policeman would have to install the app of the criminal</li>
<li>The criminal can distinguish between policemen and other people using the app (should be possible with data mining)</li>
<li>The criminal can decide weather the policeman is currently working or in leisure time</li>
</ul>
<p>But it should show and demonstrate the dangers&#8230;</p>
<h3>To conclude:</h3>
<p>We have to disallow policemen to use private smart phones during work! Or if they do so they must not install any applications from a source they don&#8217;t trust. And here is the crucial point. Who to trust and who not? Trust usually is created through social ties. So if the app is there and some policemen like the service and recommend it to their coworkers trust is created. Who does really ask about the source of an app and about who is running/owning the data servers. A service that is well known on the web can easily run by 2 or 3 people and even if they are nice it is easy to manipulate or blackmail them in order to get access to these very sensitive data.</p>
<p>And on another more technical topic: We need a decentralized mobile space. There has to be a frequency on which people are able to set up their own transmitters and create decentralized mobile networks. It is a shame that those frequencies are all owned by companies creating centralized services.</p>
<p>By the way this would be a good solution since it would also enable the police to have their own decentralized mobile networks giving them privacy against third parties!</p>
<h3>Disclaimer:</h3>
<p>I never thought I would write an article in this paranoid way telling people what is possible and where the risks are. I almost feel like a member of ccc, anonymous or finally like a real pirate. But one year of PhD in a very data driven environment having social networks, information retrieval and the web as a focus really makes me understand more and more what is possible (in particular easy to achieve). Also the low awareness of society about these dangers (probably due to the complex technologies) overwhelms me and makes me feel like I have to act and at least inform people.</p>
<p>To bad that mostly people who are already aware of these topics read my blog. Maybe <a href="http://www.rene-pickhardt.de/how-tim-berners-lee-told-me-in-front-of-thousand-people-%E2%80%9Cgo-geek-and-do-it%E2%80%9D/">I have to go geek and create this app to demonstrate the functionality</a>&nbsp;in order to really rise awareness. There are just too many interesting things to do during a PhD program so I think this time only writing about this has to be sufficient.</p>


<p>Related posts:<ol><li><a href='http://www.rene-pickhardt.de/first-privacy-impressions-of-my-new-android-phone/' rel='bookmark' title='First privacy impressions of my new android phone'>First privacy impressions of my new android phone</a></li>
<li><a href='http://www.rene-pickhardt.de/keynote-on-www2012-by-sir-tim-berners-lee/' rel='bookmark' title='Keynote on www2012 by Sir Tim Berners Lee'>Keynote on www2012 by Sir Tim Berners Lee</a></li>
</ol></p>]]></content:encoded>
			<wfw:commentRss>http://www.rene-pickhardt.de/smartphones-of-policemen-could-give-criminals-a-competitive-advantage/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>How Tim Berners Lee told me in front of thousand people: “Go geek and do it”</title>
		<link>http://www.rene-pickhardt.de/how-tim-berners-lee-told-me-in-front-of-thousand-people-%e2%80%9cgo-geek-and-do-it%e2%80%9d/</link>
		<comments>http://www.rene-pickhardt.de/how-tim-berners-lee-told-me-in-front-of-thousand-people-%e2%80%9cgo-geek-and-do-it%e2%80%9d/#comments</comments>
		<pubDate>Fri, 20 Apr 2012 12:50:12 +0000</pubDate>
		<dc:creator>Rene</dc:creator>
				<category><![CDATA[www2012]]></category>
		<category><![CDATA[copyleft]]></category>
		<category><![CDATA[copyright]]></category>
		<category><![CDATA[enterpreneur]]></category>
		<category><![CDATA[gigbeat]]></category>
		<category><![CDATA[go geek]]></category>
		<category><![CDATA[important]]></category>
		<category><![CDATA[inspiring]]></category>
		<category><![CDATA[metalcon]]></category>
		<category><![CDATA[mp3 downloads]]></category>
		<category><![CDATA[music industry]]></category>
		<category><![CDATA[open access]]></category>

		<guid isPermaLink="false">http://www.rene-pickhardt.de/?p=1254</guid>
		<description><![CDATA[I am at www2012 conference and after the keynote by Neelie Kroes there was a panel discussion with her, Tim Berners Lee and Gille Babinet. The discussion was about the question &#8220;Weather access to an open internet should be a human right?&#8221; Clearly knowing where I am standing on this issue (yes it should be!) [...]


Related posts:<ol><li><a href='http://www.rene-pickhardt.de/keynote-on-www2012-by-sir-tim-berners-lee/' rel='bookmark' title='Keynote on www2012 by Sir Tim Berners Lee'>Keynote on www2012 by Sir Tim Berners Lee</a></li>
<li><a href='http://www.rene-pickhardt.de/look-for-love-video-did-dj-sammy-steel-the-video-stroy-from-jubilees-love-language-video-watch-both-clips/' rel='bookmark' title='Look for love video: Did DJ Sammy steel the video story from jubilees Love Language video? Watch both clips!'>Look for love video: Did DJ Sammy steel the video story from jubilees Love Language video? Watch both clips!</a></li>
<li><a href='http://www.rene-pickhardt.de/question-of-the-day-how-the-hell-do-we-reach-more-people/' rel='bookmark' title='Question of the Day: How the hell do we reach more people?'>Question of the Day: How the hell do we reach more people?</a></li>
</ol>]]></description>
			<content:encoded><![CDATA[<div id="attachment_1276" class="wp-caption alignnone" style="width: 538px"><a href="http://www.rene-pickhardt.de/wp-content/uploads/2012/04/gogeek-timberberslee.png"><img src="http://www.rene-pickhardt.de/wp-content/uploads/2012/04/gogeek-timberberslee.png" alt="" title="gogeek-timberberslee" width="528" height="243" class="size-full wp-image-1276" /></a>
<p class="wp-caption-text">The statement already got twittered by my colleague Thomas Gottron and retweeted by many others</p>
</div>
<p>I am at www2012 conference and after <a target="_blank" href="http://europa.eu/rapid/pressReleasesAction.do?reference=SPEECH/12/275&amp;format=HTML&amp;aged=0&amp;language=EN&amp;guiLanguage=en">the keynote by Neelie Kroes</a> there was a panel discussion with her, Tim Berners Lee and Gille Babinet.<br />
The discussion was about the question &#8220;Weather access to an open internet should be a human right?&#8221;</p>
<p>Clearly knowing where I am standing on this issue (yes it should be!) I was very happy that this question was discussed in front of such an audience. <a target="_blank" href="http://www.w3.org/People/Berners-Lee/">Tim Berners Lee</a> obviously agreed on this point and Neelie Kroes really had some great and very diplomatic insights.</p>
<p>But for some reason the discussion always drifted up to the drawbacks of the web like copyright infringement. I was starting to get annoyed by this. Especially because it was always going as <strong>Free web vs copyright protection.</strong> So I decided to ask a question during Q&amp;A which I am now about to blog.</p>
<h3>During Q&amp;A I also gave a litte background on the actuall question but I want to be a bit more detailed in my blog:</h3>
<ul>
<li>So yes I wish the &#8220;open web&#8221; to be a human right.</li>
<li>And I also think it is really important to protect the copyrights of artists, musicians and other people creating stuff. Working together with <a target="_blank" href="http://www.inlegend.de">In Legend</a> I really know how hard it is for a musician to survive and it is really important that he gets paid for what he does and shares.</li>
<li>BUT: the discussion is always an &#8220;eather &#8211; or&#8221; discussion and goes in the wrong direction! Bastian Emig from In Legend is very open minded about new ways to use the web working for the musician. Already in the plenary session Tim pointed out that he did not invent the Web to harm the record industry. But it is rather the record industry that refuses to think about new business models and just wishes everything to stay in the old ways which used to work quite well for them.&nbsp;</li>
<li>I made the experience that a band still needs to have a record label. You don&#8217;t get booked without the label. You don&#8217;t get articles in big print mags. The label gives you trust within the industrie and without that you are not seen by many people. And so on&#8230;</li>
<li>But just in my experience I see that the record label does big harm to a musician. As a member of this musicband <a href="http://www.rene-pickhardt.de/share-your-music-but-do-it-the-right-way/">I want to share our music on the web</a>. Since there is piracy &#8211; which I cant change &#8211; I just have to think about a way how I could profit from it. Obviously by sharing the music myself I can increase my reach. This could significantly increase my chances for direct marketing (making the record label kind of obsolate) and this is what the labels seem to be afraid of. The web offers several huge opportunities for musicians to become recognized and an established act. But Labels own the licences and block musicians in doing smart and wise moves on the web.</li>
<li>I realize this problem exists due to the fact that labels have a monopoly on the product and too much power but pretending to protect the interests of the artists. Thereby hiding the fact that they are just fighting for their very own interests which do not neccessarily correlate &nbsp;whitch those from artists.</li>
</ul>
<h3>Here my question / point</h3>
<p>It is not about copyright vs free / open internet. It is much more about a new model of copyright that can coexist with a free internet. In This new model licence owners (e.g. the labels) wouldn&#8217;t build those exclusive monopolies giving them such a high power. I asked what can be done to establish a new way of thinking about copyright. Since it really does not make sense that itunes gets 50% royalties for a digital distribution that is almost free of cost which I could easily run myself!</p>
<p>First of all &#8211; to my surprise &#8211; this won me a big applause from the audience which happened very rarely during the conference.</p>
<p><iframe width="480" height="360" src="http://www.youtube.com/embed/clO8SvdwiN8" frameborder="0" allowfullscreen></iframe><br />
The full panel and discussion can be found at: <a target="_blank" href="http://www2012.wwwconference.org/media/videos/keynote-neelie-kroes/">http://www2012.wwwconference.org/media/videos/keynote-neelie-kroes/</a></p>
<p>Gille &#8211; to whom the question was originally directed &#8211; who is very friendly to the record industry answered some stuff I don&#8217;t even remember but he was basically stumbling around.</p>
<p>But then two really great answers came along:</p>
<p><strong>Neelie</strong>:<br />
&#8220;We are working on this and we see that the biggest issue is the record industrie. They pretend to protect the artists and they are not! We need legislation but maybe we need new forms of legislation. Models that worked well in the past may not serve our needs in todays world. I agree with you that you are pointing to the most cruicial point in this discussion.&#8221;</p>
<p><strong>Me being totally satisfied with her answer sat down but Tim Berners Lee wanted to say something</strong>:<br />
&#8220;You know it! Think of a world that you want. Just imagine it!</p>
<ul>
<li>What would be the distribution?&nbsp;</li>
<li>what would be the user interface?&nbsp;</li>
<li>What would be the processes?&nbsp;</li>
<li>What third parties would be involved.</li>
</ul>
<p>Go out and build it! Talk to the people here. Install an apache server and just go geek and make it happen!&#8221;</p>
<h3>what a great statement!</h3>
<p>It is always nice to have ideas and see solutions to problems. And yes you can always wine around and do nothing. But as a matter of the fact right now the web is still open an free! The technology is there. It really is just a matter of going out an building it. This is what I always said: This is why big traditional media companies didn&#8217;t built the youtube, google, facebooks, twitters, flickr,&#8230; applications in this world.&nbsp;</p>
<p>This statement gave me a lot of confidence to stronger believe in my ideas and even one day later I am really feeling that this statement will change my future life. It is really interesting that a man &#8211; who I value a lot &#8211; tells me something I always felt, hardly did and hits right a way to one of my weekest points!&nbsp;</p>
<p>After the sesion I got my copy of Tim Berners Lee&#8217;s book signed and he asked me to send him an email once my site is up. It is really amazing to receive this kind of feedback by such a great person.</p>
<p><strong>That was one of the most inspiring moments in my life! So anyone who wants to join me going geek on the next generation music web app is very welcome to contact me or leave a comment! There really is a lot of stuff in my mind and I have already dreamt a lot and seen what is possible&#8230;<br />
</strong></p>
<div id="attachment_1259" class="wp-caption alignnone" style="width: 512px"><a href="http://www.rene-pickhardt.de/wp-content/uploads/2012/04/rene-pickhardt-tbl.png"><img src="http://www.rene-pickhardt.de/wp-content/uploads/2012/04/rene-pickhardt-tbl.png" alt="tim-berners-lee-rene-pickhardt-weaving-the-web" title="rene-pickhardt-tbl" width="502" height="318" class="size-full wp-image-1259" /></a>
<p class="wp-caption-text">Tim Berners Lee signing my Copy of his book at www2012 in Lyon</p>
</div>


<p>Related posts:<ol><li><a href='http://www.rene-pickhardt.de/keynote-on-www2012-by-sir-tim-berners-lee/' rel='bookmark' title='Keynote on www2012 by Sir Tim Berners Lee'>Keynote on www2012 by Sir Tim Berners Lee</a></li>
<li><a href='http://www.rene-pickhardt.de/look-for-love-video-did-dj-sammy-steel-the-video-stroy-from-jubilees-love-language-video-watch-both-clips/' rel='bookmark' title='Look for love video: Did DJ Sammy steel the video story from jubilees Love Language video? Watch both clips!'>Look for love video: Did DJ Sammy steel the video story from jubilees Love Language video? Watch both clips!</a></li>
<li><a href='http://www.rene-pickhardt.de/question-of-the-day-how-the-hell-do-we-reach-more-people/' rel='bookmark' title='Question of the Day: How the hell do we reach more people?'>Question of the Day: How the hell do we reach more people?</a></li>
</ol></p>]]></content:encoded>
			<wfw:commentRss>http://www.rene-pickhardt.de/how-tim-berners-lee-told-me-in-front-of-thousand-people-%e2%80%9cgo-geek-and-do-it%e2%80%9d/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Keynote on www2012 by Sir Tim Berners Lee</title>
		<link>http://www.rene-pickhardt.de/keynote-on-www2012-by-sir-tim-berners-lee/</link>
		<comments>http://www.rene-pickhardt.de/keynote-on-www2012-by-sir-tim-berners-lee/#comments</comments>
		<pubDate>Wed, 18 Apr 2012 10:30:12 +0000</pubDate>
		<dc:creator>Rene</dc:creator>
				<category><![CDATA[www2012]]></category>
		<category><![CDATA[conference]]></category>
		<category><![CDATA[keynote]]></category>
		<category><![CDATA[open access]]></category>
		<category><![CDATA[open data]]></category>
		<category><![CDATA[PhD]]></category>
		<category><![CDATA[talk]]></category>
		<category><![CDATA[Tim Berners Lee]]></category>

		<guid isPermaLink="false">http://www.rene-pickhardt.de/?p=1244</guid>
		<description><![CDATA[disclaimer: this is a very sloppy summary of the keynote speech of Sir Tim Berners Lee. It is neither spellchecked it was taking as notes while sitting inside. I hope I find the time after www2012 to go over it and improve it. take aways Decentralized design that is very important. and if you talk [...]


Related posts:<ol><li><a href='http://www.rene-pickhardt.de/how-tim-berners-lee-told-me-in-front-of-thousand-people-%e2%80%9cgo-geek-and-do-it%e2%80%9d/' rel='bookmark' title='How Tim Berners Lee told me in front of thousand people: “Go geek and do it”'>How Tim Berners Lee told me in front of thousand people: “Go geek and do it”</a></li>
<li><a href='http://www.rene-pickhardt.de/smartphones-of-policemen-could-give-criminals-a-competitive-advantage/' rel='bookmark' title='Smartphones of Policemen could give criminals a competitive advantage'>Smartphones of Policemen could give criminals a competitive advantage</a></li>
</ol>]]></description>
			<content:encoded><![CDATA[<p>disclaimer: this is a very sloppy summary of the keynote speech of Sir Tim Berners Lee. It is neither spellchecked it was taking as notes while sitting inside. I hope I find the time after www2012 to go over it and improve it.</p>
<h3>take aways</h3>
<p>Decentralized design that is very important. and if you talk about the centralized system like DNS vs internet there are really social issiues that you are talking about.</p>
<p>look at the way w3c builds standards it is hard. It is a huge organizsation and they have to work together but also be split into modular groups.</p>
<h3>IDEA 1 Mobile web apps</h3>
<p>he gave a lot of interesting insights about the freedom of programmers and the limits of programing models. (Closely related to my thoughts on query languages for graph data bases) He says the easier the programming model the more you restrict people the more they can achieve.</p>
<p>But he also points out there is an ongoing battle between being universal and just being a tool like a refrigerator. he didn&#8217;t say it directly but if you listented carefully to him he says don&#8217;t support closed blocked systems like apple or even android but make it a open html5 javascript webapp. You decide weather the web stays open. I think he really sees how the mobile web is beeing more and more closed. </p>
<p><strong>He warns: Make open mobile web apps. Join the working groups for setting the standards&#8230;</strong><br />
takeaway: VERY VERY important and interesting part of his speech! <a href="http://www.rene-pickhardt.de/paul-wagner-and-till-speicher-won-state-competition-jugend-forscht-hessen-and-best-project-award-using-neo4j/">especially for typology</a>.</p>
<p>My Question: &#8220;As a company building something. if it is open you don&#8217;t get as much benefit (like access to the friendship graph) as in the case of going for android / iphone systems&#8230;&#8221;</p>
<h3>IDEA2 Standards  centralized vs decentralized &#8211; power</h3>
<p>He talked about the importance of having the same standards for the low level like html, http, and so on. He compares this to people not speeaking the same language. He says it is cool to build all the cool stuff ontop of it.<br />
He says it is hard to build the standards but also important because it made it possible for the web to scale and win against goopher and other things from the early web.<br />
he says the standards are great because anyone can build something on it. it contributes to be decentralized. You don&#8217;t have to ask anyone to build something.<br />
My Question: &#8220;SPDY seems better / faster and more mature than http. but of course it is hard to change a running system. &#8221;</p>
<p>Value of being completely independend (decentralized) vs the value of working together in a common way (centralized) and this is a huge fight.</p>
<h3>IDEA 3 Trust</h3>
<p>Ananomous are not quite sure what they are fighing for. is it complete anarchie or fight against corruption. is it the fight against certain goverments or against goverments in general. again. central vs decentral.<br />
Very technical part of his talk that I unfortunatly could not really follow. The main idea was clear. It was about trust, the role of social networks and the methods that could build and propagate trust.<br />
He hopes decentralized trust systems can be found but the battle is not over. (Remark from me: Of course Google+ is better than facebook but both systems are centralized I guess there needs to be low level standards like http to olve the problem but they are hard to implement.) He already said that the semantic web people tried to do it but haven&#8217;t successed yet.</p>
<h3>IDEA4 openess especially in UK</h3>
<p>he talks a lot about open goverment data.<br />
&#8220;I spend a lot of time to governments talking to governments to publish data on the web. But a lot of people are pushing back trying to hold back data an maintain power.&#8221;<br />
he says it is your responsability to ask parties before the election to have a commitment on making government data open.</p>
<p>open licences. Companies complain about open licenses since they want to use it but not open up their own data. </p>
<p>As a member of the pirate party I can only emphisize on his statements!</p>
<h3>Idea 5 Privacy</h3>
<p>hes says there are three different forms of privacy:<br />
1.) Of ourse having the shop remembering me and my shoe size is common practise and nice for me. That is one way of privacy. of course those companies if they want to have a good relation with me will not give away my data. </p>
<p>2.) you never know what data will be out there in the future. It might be possible that anonymous data now will become transparent through other data sets coming up in the future&#8230; </p>
<p>3.) invasion / tracking / sells to highest bidder / or to the goverment or whoever asks. In the first days of the web this was hard routers couldn&#8217;t do this but now it is impossible. But in my oppinion tbl was talking about the facebook&#8217;s and googles of this world.<br />
he says this is as dynamite. If someone wants to use this data against you. you will be toasted.<br />
And you cannot stop this. because there are institutions that collet this information and once it is collected it is not save by definition.<br />
he basically says that you cannot collect data about users by default unless you have a similar powershare of &#8220;executive legislative and judicative&#8221; if this is not happening we should not allow anyone to make such data tracking. </p>
<p>We have to spend 90% time to do cool stuff on the web be innovative. but 10% of the time we have to deal with theses issues otherwise the web will be locked down at some time.<br />
It is about blocking, spamming, twitter bombing, data stealing and so own. This is a huge challange and a big risk of our open web! It is not only the open market depending on it but also democracy and human discourse that depends on it. &#8220;I call that net neutrality&#8221;</p>
<p>&#8220;cispn&#8221; americans do this in trying to controll the web and close communication&#8230;. go out and look for this. This things happen quick go out and defend the internet and fight for it. This is a duty we have to do in the 10 % of our time. </p>
<p>&#8220;I want you to see discussing these things. Think about what you are leaving for the next generation of this. i am happy to do this in the next web conferences but I really want to see &#8221;</p>
<p><H3>questions</h3>
<p><strong>on distributed decission making:</strong><br />
How do we move from hirarchical system like our goverments are to a decentralized system which is possible due to all the connections that we have. We should be able to<br />
people naturally don&#8217;t go out an break these boundaries of locallity. (there is also a youtube paper on this) Social networking site should rather suggest to spread friends in stead of building those communities of you have 81 friends in common. go out and meet people that are far away from you. use the connections that are being made. (what is the macroscopic effect of this little change in microscoping behaviour)<br />
I think we should do research on new democratic systems like wikipedia (or in my opinion: pirate party) there was the story that people who didn&#8217;t vote for barack obama. It turned out those who wouldn&#8217;t vote for him didn&#8217;t because they couldn&#8217;t imagine to have a black president. There was a high correlation of those people and those who have never worked together with people from different ethnical beackground. so go out and spread friendship. </p>
<p>Idea: liquid feedback for W3C as a working group!</p>
<p><strong>question on openess an facebook and the request on tbl&#8217;s thoughts</strong><br />
TBL why would you build an app on facebook or a closed world if there is still the open jungle out there. Peopole already asked my that question on netscape and internet explorer. They always ask me this if monoplies rise up. </p>
<h3>Funny/interesing Quotes by Tim Berners Lee: </h3>
<p>&#8220;There is only one person that has been to all web conferences and that is me&#8221;</p>
<p>&#8220;I recieved a mail recently saying: We had to do a project on an inventor and we decided to do it on you because you are not dead!&#8221;</p>
<p>&#8220;Values that made the web possible: Openess, concencious about openess, transparency, privacy,&#8221;</p>
<p>&#8220;If you have questions it is much more interesting for me. Because I have heard myself talking before.&#8221;</p>
<p>&#8220;Please develop HTML5 mobile web apps rater than native mobile apps!&#8221;</p>


<p>Related posts:<ol><li><a href='http://www.rene-pickhardt.de/how-tim-berners-lee-told-me-in-front-of-thousand-people-%e2%80%9cgo-geek-and-do-it%e2%80%9d/' rel='bookmark' title='How Tim Berners Lee told me in front of thousand people: “Go geek and do it”'>How Tim Berners Lee told me in front of thousand people: “Go geek and do it”</a></li>
<li><a href='http://www.rene-pickhardt.de/smartphones-of-policemen-could-give-criminals-a-competitive-advantage/' rel='bookmark' title='Smartphones of Policemen could give criminals a competitive advantage'>Smartphones of Policemen could give criminals a competitive advantage</a></li>
</ol></p>]]></content:encoded>
			<wfw:commentRss>http://www.rene-pickhardt.de/keynote-on-www2012-by-sir-tim-berners-lee/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>Reading Club on distributed graph db returns with a new Format on April 4th 2012</title>
		<link>http://www.rene-pickhardt.de/reading-club-on-distributed-graph-db-returns-with-a-new-format-on-april-4th-2012/</link>
		<comments>http://www.rene-pickhardt.de/reading-club-on-distributed-graph-db-returns-with-a-new-format-on-april-4th-2012/#comments</comments>
		<pubDate>Mon, 02 Apr 2012 09:37:05 +0000</pubDate>
		<dc:creator>Rene</dc:creator>
				<category><![CDATA[Reading Club]]></category>
		<category><![CDATA[distributed graphdb]]></category>
		<category><![CDATA[graph database]]></category>
		<category><![CDATA[graphdb]]></category>
		<category><![CDATA[PhD]]></category>

		<guid isPermaLink="false">http://www.rene-pickhardt.de/?p=1231</guid>
		<description><![CDATA[The reading club was quite inactive due to traveling and also a not optimal process for the choice of literature. That is why a new format for the reading club has been discussed and agreed upon.&#160; The new Format means that we have 4 new rules we will only discuss up to 3 papers in [...]


Related posts:<ol><li><a href='http://www.rene-pickhardt.de/related-work-of-the-reading-club-on-distributed-graph-data-bases-beehive-scalable-sparql-querying-of-large-rdf-graphs-memcached/' rel='bookmark' title='Related work of the Reading club on distributed graph data bases (Beehive, Scalable SPARQL Querying of Large RDF Graphs, memcached)'>Related work of the Reading club on distributed graph data bases (Beehive, Scalable SPARQL Querying of Large RDF Graphs, memcached)</a></li>
<li><a href='http://www.rene-pickhardt.de/reading-club-on-graph-databases-and-distributed-systems/' rel='bookmark' title='Reading club on Graph databases and distributed systems'>Reading club on Graph databases and distributed systems</a></li>
<li><a href='http://www.rene-pickhardt.de/from-graph-batch-processing-towards-a-distributed-graph-data-base/' rel='bookmark' title='From Graph (batch) processing towards a distributed graph data base'>From Graph (batch) processing towards a distributed graph data base</a></li>
</ol>]]></description>
			<content:encoded><![CDATA[<p>The reading club was quite inactive due to traveling and also a not optimal process for the choice of literature. That is why a new format for the reading club has been discussed and agreed upon.&nbsp;</p>
<p>The new Format means that we have 4 new rules</p>
<ol>
<li>we will only discuss up to 3 papers in 90 minutes of time. So rough speaking we have 30 minutes per paper but this does not have to be strict.</li>
<li>The decided papers should be read by everyone <span style="text-decoration: underline;">before</span> the reading club takes place.</li>
<li>For every paper there is one responsible person (moderator) who did read the entire paper before he suggested it as a common reading.</li>
<li>Open questions to the (potential) reading assignments and ideas for reading can and should be discussed on <a target="_blank" href="http://related-work.rene-pickhardt.de/">http://related-work.rene-pickhardt.de/</a>&nbsp;(use the same template as I used for the reading assignments in this blogpost) eg:</li>
</ol>
<blockquote><p>Moderator:<br />
Paper download:<br />
Why to read it<br />
topics to discuss / open questions:</p></blockquote>
<h3>For next meeting on April 4th 2 pm CET (in two days) the literature will be:</h3>
<ul>
<li><a target="_blank" href="http://related-work.rene-pickhardt.de/questions/20/key-key-value-stores-for-efficiently-processing-graph-data-in-the-cloud">Key key value Stores for efficiently processing graph data in the cloud</a> (Moderator: Daniel Bildhauer)</li>
<li><a target="_blank" href="http://related-work.rene-pickhardt.de/questions/21/the-parallel-bgl-a-generic-library-for-distributed-graph-computations">Boost graph library</a> (Moderator: Stefan Scheglmann)</li>
<li><a target="_blank" href="http://related-work.rene-pickhardt.de/questions/22/a-practical-scalable-distributed-b-tree">A Practical Scalable Distributed B-Tree</a> (suggestion by Stefan Scheglmann, Moderator: Rene)</li>
</ul>
<p>While preparing these papers we might come across some other interesting literature.</p>
<p><strong>If you want to suggest some of the literature you should also read that piece of work until the reading club meeting takes place and know why you want everybody to prepare the same paper and discuss it (rule 3). Additionally you should open a topic on the paper on <a target="_blank" href="http://related-work.rene-pickhardt.de/">http://related-work.rene-pickhardt.de/</a>&nbsp;using the above template before the reading club takes place (rule 4)</strong></p>
<p>I hope this is of help for the entire project and I am looking forward to the next meeting!</p>


<p>Related posts:<ol><li><a href='http://www.rene-pickhardt.de/related-work-of-the-reading-club-on-distributed-graph-data-bases-beehive-scalable-sparql-querying-of-large-rdf-graphs-memcached/' rel='bookmark' title='Related work of the Reading club on distributed graph data bases (Beehive, Scalable SPARQL Querying of Large RDF Graphs, memcached)'>Related work of the Reading club on distributed graph data bases (Beehive, Scalable SPARQL Querying of Large RDF Graphs, memcached)</a></li>
<li><a href='http://www.rene-pickhardt.de/reading-club-on-graph-databases-and-distributed-systems/' rel='bookmark' title='Reading club on Graph databases and distributed systems'>Reading club on Graph databases and distributed systems</a></li>
<li><a href='http://www.rene-pickhardt.de/from-graph-batch-processing-towards-a-distributed-graph-data-base/' rel='bookmark' title='From Graph (batch) processing towards a distributed graph data base'>From Graph (batch) processing towards a distributed graph data base</a></li>
</ol></p>]]></content:encoded>
			<wfw:commentRss>http://www.rene-pickhardt.de/reading-club-on-distributed-graph-db-returns-with-a-new-format-on-april-4th-2012/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>PhD proposal on distributed graph data bases</title>
		<link>http://www.rene-pickhardt.de/phd-proposal-on-distributed-graph-data-bases/</link>
		<comments>http://www.rene-pickhardt.de/phd-proposal-on-distributed-graph-data-bases/#comments</comments>
		<pubDate>Tue, 27 Mar 2012 10:19:22 +0000</pubDate>
		<dc:creator>Rene</dc:creator>
				<category><![CDATA[distributed graph data base]]></category>
		<category><![CDATA[collaboration]]></category>
		<category><![CDATA[distributed graphdb]]></category>
		<category><![CDATA[Facebook]]></category>
		<category><![CDATA[Google]]></category>
		<category><![CDATA[graph algebra]]></category>
		<category><![CDATA[graph database]]></category>
		<category><![CDATA[graph processing]]></category>
		<category><![CDATA[graph query language]]></category>
		<category><![CDATA[how to]]></category>
		<category><![CDATA[Information retrieval]]></category>
		<category><![CDATA[neo4j]]></category>
		<category><![CDATA[PhD]]></category>
		<category><![CDATA[proposal]]></category>
		<category><![CDATA[Social Network]]></category>
		<category><![CDATA[social news stream]]></category>
		<category><![CDATA[Twitter]]></category>
		<category><![CDATA[what is]]></category>

		<guid isPermaLink="false">http://www.rene-pickhardt.de/?p=1214</guid>
		<description><![CDATA[Over the last week we had our off campus meeting with a lot of communication training (very good and fruitful) as well as a special treatment for some PhD students called &#8220;massage your diss&#8221;. I was one of the lucky students who were able to discuss our research ideas with a post doc and other [...]


Related posts:<ol><li><a href='http://www.rene-pickhardt.de/data-structure-for-social-news-streams-on-graph-data-bases/' rel='bookmark' title='Data structure for Social news streams on Graph data bases'>Data structure for Social news streams on Graph data bases</a></li>
<li><a href='http://www.rene-pickhardt.de/wishlist-of-features-for-a-distributed-graph-data-base-technology/' rel='bookmark' title='Wishlist of features for a distributed graph data base technology'>Wishlist of features for a distributed graph data base technology</a></li>
<li><a href='http://www.rene-pickhardt.de/from-graph-batch-processing-towards-a-distributed-graph-data-base/' rel='bookmark' title='From Graph (batch) processing towards a distributed graph data base'>From Graph (batch) processing towards a distributed graph data base</a></li>
</ol>]]></description>
			<content:encoded><![CDATA[<p>Over the last week we had our off campus meeting with a lot of communication training (very good and fruitful) as well as a special treatment for some PhD students called &#8220;massage your diss&#8221;. I was one of the lucky students who were able to discuss our research ideas with a post doc and other PhD candidates for more than 6 hours. This lead to the structure, todos and time table of my PhD proposal. This has to be finalized over the next couple days but I already want to share the structure in order to make it more real. You might also want to follow my article on a wish list of <a href="http://www.rene-pickhardt.de/wishlist-of-features-for-a-distributed-graph-data-base-technology/">distributed graph data base technology</a></p>
<h3>[TODO] 0. Find a template for the PhD proposal</h3>
<p>That is straight forward. The task is just to look at other students PhD proposals also at some major conferences and see what kind of structure they use. A very common structure for papers is <a target="_blank" href="http://infolab.stanford.edu/~widom/paper-writing.html">Jennifer Widom&#8217;s structure for writing a good research paper</a>. This or a similar template will help to make the proposal readable in a good way. For this blog article I will follow Jennifer Widom more or less.</p>
<h3>1. Write an Introduction</h3>
<p>Here I will describe the use case(s) of a distributed graph data base. These could be</p>
<ul>
<li>indexing the web graph for a general purpose search engine like Google, Bing, Baidu, Yandex&#8230;</li>
<li>running the backend of a social network like Facebook, Google+, Twitter, LinkedIn,&#8230;</li>
<li>storing web log files and click streams of users</li>
<li>doing information retrieval (recommender systems) in the above scenarios</li>
</ul>
<p>There could also be very other use cases like graphs from</p>
<ul>
<li>biology</li>
<li>finance</li>
<li>regular graphs&nbsp;</li>
<li>geographic maps like road and traffic networks</li>
</ul>
<h3>2. Discuss all the related work</h3>
<p>This is done to name all the existing approaches and challenges that come with a distributed graph data base. It is also important to set onself apart from existing frameworks like <a href="http://www.rene-pickhardt.de/from-graph-batch-processing-towards-a-distributed-graph-data-base/">graph processing</a>. Here I will name the at least the related work in the following fields:</p>
<ul>
<li>graph processing (<a href="http://www.rene-pickhardt.de/google-pregel-vs-signal-collect-for-distributed-graph-processing-pros-and-cons/">Signal Collect, Pregel</a>,&#8230;)</li>
<li>graph theory (especially data structures and algorithms)</li>
<li>(dynamic/adaptive) graph partitioning</li>
<li>distributed computing / systems (MPI, Bulk Synchronous Parallel Programming, Map Reduce, P2P, distributed hash tables, distributed file systems&#8230;)</li>
<li>redundancy vs fault tolerance</li>
<li>network programming (protocols, latency vs bandwidth)</li>
<li>data bases (ACID, multiple user access, &#8230;)</li>
<li>graph data base query languages (SPARQL, Gremlin, Cypher,&#8230;)</li>
<li>Social Network and graph analysis and modelling.</li>
</ul>
<h3>3. Formalize the problem of distributed graph data bases</h3>
<p>After describing the related work and knowing the standard terminology it makes sense to really formalize the problem. Several steps have to be taken: There needs to be notation for distributed graph data bases fixed. This has to respect two things:</p>
<p>a) the real &#8211; so far unknown &#8211; problems that will be solved during PhD. In this way fixing the notation and formalizing the (unknown) problem will be kind of hard.</p>
<p>b) The use cases: For the web use case this will probably translate to scale free small world network graphs with a very small diameter. Probably in order to respect other use cases than the web it will make sense to cite different graph models e.g. mathematical models to generate graphs with certain properties from the related work.</p>
<p>The important step here is that fixing a use case will also fix a notation and help to formalize the problem. The crucial part is to choose the use case still so general that all special cases and boarder line cases are included. Especially the use case should be a real extension to graph processing which should of course be possible with a distributed graph data base.&nbsp;</p>
<p>One very important part of the formalization will lead to a first research question:</p>
<h3>4. Graph Query languages &#8211; Graph Algebra</h3>
<p>I think graph data bases are not really general purpose data bases. They exist to solve a certain class of problems in a certain range. They seem to be especially useful where information of a local neighborhood of data points is frequently needed. They also often seem to be useful when schemaless data is processed. This leads to the question of a query language. Obviously (?) the more general the query language the harder to have a very efficient solution. The model of a relational algebra was a very successful concept in relational data bases. I guess a similar graph algebra is needed as a mathmatical concept for distributed graph data bases as a foundation of their query languages.&nbsp;</p>
<p>Remark that this chapter has nothing much to do with distributed graph data bases but with graph data bases in general.</p>
<p>The graph algebra I have in mind so far is pretty similar to neo4j and consists of some atomic CRUD operations. Once the results are known (ether as an answer from the related work or by own research) I will be able to run my first experiments in a distributed environment.&nbsp;</p>
<h3>5. Analysis of Basic graph data structures vs distribution strategies vs Basic CRUD operations</h3>
<p>As expected the graph algebra will consist of some atomic <a target="_blank" href="http://en.wikipedia.org/wiki/Create,_read,_update_and_delete">CRUD operations</a>&nbsp;those operations have to be tested against all different data structures one can think of in the different known distributed environments over several different real world data sets. This task will be rather straight forward. It will be possible to know the theoretical results of most implementations. The reason for this experiment is to collect experimental experiences in a distributed setting and to understand what is really happening and where the difficulties in a distributed setting are. Already in the&nbsp;<a href="http://www.rene-pickhardt.de/graphity-an-efficient-graph-model-for-retrieving-the-top-k-news-feeds-for-users-in-social-networks/">evaluation of graphity</a> I realized that there is a huge gap between theoretical predictions and the real results. In this way I am convinced that this experiment is a good step forward and the deep understanding of actually implementing all this will hopefully lead to:</p>
<h3>6. Development of hybrid data structures (creative input)</h3>
<p>It would be the first time in my life where I am running such an experiment without any new ideas coming up to tweak and tune. So I am expecting to have learnt a lot from the first experiment in order to have some creative ideas how to combine several data structures and distribution techniques in order to make a better (especially bigger scaling) distributed graph data base technology.</p>
<h3>7. Analysis of multiple user access and ACID</h3>
<p>One important fact of a distributed graph data base that was not in the focus of my research so far is the part that actually makes it a data base and sets it apart from some graph processing frame work. Even after finding a good data structure and distributed model there are new limitations coming once multiple user access and <a target="_blank" href="http://en.wikipedia.org/wiki/ACID">ACID</a>&nbsp; are introduced. These topics are to some degree orthogonal to the CRUD operations examined in my first planned experiment. I am pretty sure that the experiments from above and more reading on ACID in distributed computing will lead to more reasearch questions and ideas how to test several standard ACID strategies for several data structures in several distributed environments. In this sense this chapter will be an extension to the 5. paragraph.</p>
<h3>8. Again creative input for multiple user access and ACID</h3>
<p>After heaving learnt what the best data structures for basic query operations in a distributed setting are and also what the best methods to achieve ACID are it is time for more creative input. This will have the goal to find a solution (data structure and distribution mechanism) that respects both the speed of basic query operations and the ease for ACID. Once this done everything is straight forward again.</p>
<h3>9. Comprehensive benchmark of my solution with existing frameworks</h3>
<p>My own solution has to be benchmarked against all the standard technologies for distributed graph data bases and graph processing frameworks.</p>
<h3>10. Conclusion of my PhD proposal</h3>
<p>So the goal of my PhD is to analyse different data structures and distribution techniques for a realization of distributed graph data base. This will be done with respect to a good runtime of some basic graph queries (CRUD) respecting a standardized graph query algebra as well as muli user access and the paradigms of ACID.&nbsp;</p>
<h3>11 Timetable and mile stones</h3>
<p>This is a rough schedual fixing some of the major mile stones.</p>
<ul>
<li><strong>2012 / 04</strong>: hand in PhD proposal</li>
<li><strong>2012 / 07</strong>: graph query algebra is fixed. Maybe a paper is submitted</li>
<li><strong>2012 / 10</strong>: experiments of basic CRUD operations done</li>
<li><strong>2013 / 02</strong>: paper with results from basic CRUD operations done</li>
<li><strong>2013 / 07</strong>: preliminary results on ACID and multi user experiments are done and submitted to a conference</li>
<li><strong>2013 /08</strong>: min 3 month research internship &nbsp;in a company benchmarking my system on real data</li>
<li><strong>end of 2013</strong>: publishing the results</li>
<li><strong>2014: 9 months</strong> of writing my dissertation</li>
</ul>
<p>For anyone who has input, knows of papers or can point me to similar research I am more than happy if you could contact me or start the discussion!</p>
<p>Thank you very much for reading so far!</p>


<p>Related posts:<ol><li><a href='http://www.rene-pickhardt.de/data-structure-for-social-news-streams-on-graph-data-bases/' rel='bookmark' title='Data structure for Social news streams on Graph data bases'>Data structure for Social news streams on Graph data bases</a></li>
<li><a href='http://www.rene-pickhardt.de/wishlist-of-features-for-a-distributed-graph-data-base-technology/' rel='bookmark' title='Wishlist of features for a distributed graph data base technology'>Wishlist of features for a distributed graph data base technology</a></li>
<li><a href='http://www.rene-pickhardt.de/from-graph-batch-processing-towards-a-distributed-graph-data-base/' rel='bookmark' title='From Graph (batch) processing towards a distributed graph data base'>From Graph (batch) processing towards a distributed graph data base</a></li>
</ol></p>]]></content:encoded>
			<wfw:commentRss>http://www.rene-pickhardt.de/phd-proposal-on-distributed-graph-data-bases/feed/</wfw:commentRss>
		<slash:comments>5</slash:comments>
		</item>
		<item>
		<title>Paul Wagner and Till Speicher won State Competition &#8220;Jugend Forscht Hessen&#8221; and best Project award using neo4j</title>
		<link>http://www.rene-pickhardt.de/paul-wagner-and-till-speicher-won-state-competition-jugend-forscht-hessen-and-best-project-award-using-neo4j/</link>
		<comments>http://www.rene-pickhardt.de/paul-wagner-and-till-speicher-won-state-competition-jugend-forscht-hessen-and-best-project-award-using-neo4j/#comments</comments>
		<pubDate>Fri, 16 Mar 2012 11:18:38 +0000</pubDate>
		<dc:creator>Rene</dc:creator>
				<category><![CDATA[Teaching and Exercises]]></category>
		<category><![CDATA[algorithms]]></category>
		<category><![CDATA[android]]></category>
		<category><![CDATA[application]]></category>
		<category><![CDATA[graph database]]></category>
		<category><![CDATA[graphdb]]></category>
		<category><![CDATA[Information retrieval]]></category>
		<category><![CDATA[jufo]]></category>
		<category><![CDATA[neo4j]]></category>
		<category><![CDATA[ngram]]></category>
		<category><![CDATA[PhD]]></category>
		<category><![CDATA[prediction]]></category>

		<guid isPermaLink="false">http://www.rene-pickhardt.de/?p=1204</guid>
		<description><![CDATA[6 months of hard coding and supervising by me are over and end with a huge success! After analyzing 80 GB of Google ngrams data Paul and Till put them to a neo4j graph data base in order to make predictions for fast scentence completion. Today was the award ceremony and the two students from [...]


Related posts:<ol><li><a href='http://www.rene-pickhardt.de/download-google-n-gram-data-set-and-neo4j-source-code-for-storing-it/' rel='bookmark' title='Download Google n gram data set and neo4j source code for storing it'>Download Google n gram data set and neo4j source code for storing it</a></li>
<li><a href='http://www.rene-pickhardt.de/neo4j-graph-database-vs-mysql/' rel='bookmark' title='Neo4j Graph Database vs MySQL'>Neo4j Graph Database vs MySQL</a></li>
<li><a href='http://www.rene-pickhardt.de/wishlist-of-features-for-a-distributed-graph-data-base-technology/' rel='bookmark' title='Wishlist of features for a distributed graph data base technology'>Wishlist of features for a distributed graph data base technology</a></li>
</ol>]]></description>
			<content:encoded><![CDATA[<p>6 months of hard coding and supervising by me are over and end with a huge success! After analyzing <a href="http://www.rene-pickhardt.de/download-google-n-gram-data-set-and-neo4j-source-code-for-storing-it/">80 GB of Google ngrams data</a> Paul and Till put them to a neo4j graph data base in order to make predictions for fast scentence completion. Today was the award ceremony and the two students from Darmstadt and Saarbrücken (respectivly) won the first place. Additionally the received the &#8220;beste schöpferische Arbeit&#8221; award. Which is the award for the best project in the entire competition (over all disciplines).</p>
<p>With their technology and the almost finnished android app typing will be revolutionized! While typing a scentence they are able to predict the next word with a recall of 67% creating a huge additional vallue for today&#8217;s smartphones.</p>
<p>So stay tuned of the upcomming news and the federal competition on May in Erfurt.</p>
<p>Have a look at <a target="_blank" href="http://typology.de/about-us/">their website</a> where you can find the (still) <a target="_blank" href="http://typology.de/documentation/">German Documentation</a>. As well as the <a target="_blank" href="http://typology.de/source-code/">source code</a> and a <a target="_blank" href="http://complet.typology.de/">demo</a> (which I also include here (use tab completion (-: as in unix bash)</p>
<p>Right now it only works for German Language &#8211; since only German data was processed &#8211; so try sentences like</p>
<ul>
<li>&#8220;Warum ist die Banane krumm&#8221; (where the rare word krumm is correctly predicted due to the relation of the famous question why is the banana curved?</li>
<li>&#8220;Das kann ich doch auch&#8221; (I am also able to do that)</li>
<li>&#8220;geht wirklich nur deutsche Sprache ?&#8221; (Is really only German language possible?)</li>
</ul>
<p><iframe name="typology complet demo" src="http://complet.typology.de" width="100%" height="500"></iframe></p>
<p><noframes>&lt;br /&gt; Ihr Browser kann leider keine eingebetteten Frames anzeigen:&lt;br /&gt; Sie können die eingebettete Seite über den folgenden Verweis&lt;br /&gt; aufrufen: &lt;a href=&#8221;http://complet.typology.de&#8221; data-mce-href=&#8221;http://complet.typology.de&#8221;&gt;Demo&lt;/a&gt;&lt;br /&gt; </noframes></p>


<p>Related posts:<ol><li><a href='http://www.rene-pickhardt.de/download-google-n-gram-data-set-and-neo4j-source-code-for-storing-it/' rel='bookmark' title='Download Google n gram data set and neo4j source code for storing it'>Download Google n gram data set and neo4j source code for storing it</a></li>
<li><a href='http://www.rene-pickhardt.de/neo4j-graph-database-vs-mysql/' rel='bookmark' title='Neo4j Graph Database vs MySQL'>Neo4j Graph Database vs MySQL</a></li>
<li><a href='http://www.rene-pickhardt.de/wishlist-of-features-for-a-distributed-graph-data-base-technology/' rel='bookmark' title='Wishlist of features for a distributed graph data base technology'>Wishlist of features for a distributed graph data base technology</a></li>
</ol></p>]]></content:encoded>
			<wfw:commentRss>http://www.rene-pickhardt.de/paul-wagner-and-till-speicher-won-state-competition-jugend-forscht-hessen-and-best-project-award-using-neo4j/feed/</wfw:commentRss>
		<slash:comments>3</slash:comments>
		</item>
		<item>
		<title>Why Musicians should have a Bandpage on Google Plus!</title>
		<link>http://www.rene-pickhardt.de/why-musicians-should-have-a-bandpage-on-google-plus/</link>
		<comments>http://www.rene-pickhardt.de/why-musicians-should-have-a-bandpage-on-google-plus/#comments</comments>
		<pubDate>Tue, 13 Mar 2012 10:37:16 +0000</pubDate>
		<dc:creator>Rene</dc:creator>
				<category><![CDATA[Online music marketing]]></category>
		<category><![CDATA[advertising]]></category>
		<category><![CDATA[CRM]]></category>
		<category><![CDATA[Google]]></category>
		<category><![CDATA[googleplus]]></category>
		<category><![CDATA[music industry]]></category>
		<category><![CDATA[Social Network]]></category>
		<category><![CDATA[why]]></category>

		<guid isPermaLink="false">http://www.rene-pickhardt.de/?p=1200</guid>
		<description><![CDATA[The following info graphic for businesses was released by Chris Brogan and demonstrates quite well why musicians should get on Google Plus and how to use it. It is released under a creative commons licence http://creativecommons.org/licenses/by-nc-sa/2.0/ Very good work! Related posts:Why Google Plus and social networking is so important to Google Bandpage SEO &#8211; The [...]


Related posts:<ol><li><a href='http://www.rene-pickhardt.de/why-google-plus-and-social-networking-is-so-important-to-google/' rel='bookmark' title='Why Google Plus and social networking is so important to Google'>Why Google Plus and social networking is so important to Google</a></li>
<li><a href='http://www.rene-pickhardt.de/bandpage-seo-the-perfect-band-website-part1/' rel='bookmark' title='Bandpage SEO &#8211; The perfect Band website: part1'>Bandpage SEO &#8211; The perfect Band website: part1</a></li>
<li><a href='http://www.rene-pickhardt.de/google-2011-q4-earnings/' rel='bookmark' title='Google 2011 Q4 Earnings'>Google 2011 Q4 Earnings</a></li>
</ol>]]></description>
			<content:encoded><![CDATA[<p>The following info graphic for businesses was released by <a target="_blank" href="http://www.chrisbrogan.com/gplusinfographic/">Chris Brogan</a> and demonstrates quite well why musicians should get on Google Plus and how to use it. It is released under a creative commons licence <a target="_blank" href="http://creativecommons.org/licenses/by-nc-sa/2.0/" rel="nofollow">http://creativecommons.org/licenses/by-nc-sa/2.0/ </a></p>
<p>Very good work!</p>
<p><a href="http://www.rene-pickhardt.de/wp-content/uploads/2012/03/googleplus-for-business.png"><img src="http://www.rene-pickhardt.de/wp-content/uploads/2012/03/googleplus-for-business.png" alt="" title="googleplus-for-business" width="600" height="6201" class="alignnone size-full wp-image-1201" /></a></p>


<p>Related posts:<ol><li><a href='http://www.rene-pickhardt.de/why-google-plus-and-social-networking-is-so-important-to-google/' rel='bookmark' title='Why Google Plus and social networking is so important to Google'>Why Google Plus and social networking is so important to Google</a></li>
<li><a href='http://www.rene-pickhardt.de/bandpage-seo-the-perfect-band-website-part1/' rel='bookmark' title='Bandpage SEO &#8211; The perfect Band website: part1'>Bandpage SEO &#8211; The perfect Band website: part1</a></li>
<li><a href='http://www.rene-pickhardt.de/google-2011-q4-earnings/' rel='bookmark' title='Google 2011 Q4 Earnings'>Google 2011 Q4 Earnings</a></li>
</ol></p>]]></content:encoded>
			<wfw:commentRss>http://www.rene-pickhardt.de/why-musicians-should-have-a-bandpage-on-google-plus/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Google Video on Search Quality Meeting: Spelling for Long Queries by Lars Hellsten</title>
		<link>http://www.rene-pickhardt.de/google-video-on-search-quality-meeting-spelling-for-long-queries-by-lars-hellsten/</link>
		<comments>http://www.rene-pickhardt.de/google-video-on-search-quality-meeting-spelling-for-long-queries-by-lars-hellsten/#comments</comments>
		<pubDate>Mon, 12 Mar 2012 19:11:04 +0000</pubDate>
		<dc:creator>Rene</dc:creator>
				<category><![CDATA[Collective Intelligence]]></category>
		<category><![CDATA[collaboration]]></category>
		<category><![CDATA[Google]]></category>
		<category><![CDATA[Information retrieval]]></category>
		<category><![CDATA[open access]]></category>
		<category><![CDATA[open data]]></category>
		<category><![CDATA[open education]]></category>
		<category><![CDATA[Search]]></category>

		<guid isPermaLink="false">http://www.rene-pickhardt.de/?p=1196</guid>
		<description><![CDATA[Amazing! Today I had a discussion with a coworker about transparency and the way companies should be more open about what they are doing! And what happens on the same day? One of my favourite webcompanies has decided to publish a short video taken from the weekly search quality meeting! The proposed change by Lars [...]


Related posts:<ol><li><a href='http://www.rene-pickhardt.de/ibms-watson-google-what-is-the-the-difference/' rel='bookmark' title='IBM&#8217;s Watson &amp; Google &#8211; What is the the difference?'>IBM&#8217;s Watson &#038; Google &#8211; What is the the difference?</a></li>
<li><a href='http://www.rene-pickhardt.de/download-google-n-gram-data-set-and-neo4j-source-code-for-storing-it/' rel='bookmark' title='Download Google n gram data set and neo4j source code for storing it'>Download Google n gram data set and neo4j source code for storing it</a></li>
<li><a href='http://www.rene-pickhardt.de/google-uses-57-signals-to-filter/' rel='bookmark' title='What are the 57 signals google uses to filter search results?'>What are the 57 signals google uses to filter search results?</a></li>
</ol>]]></description>
			<content:encoded><![CDATA[<p>Amazing! Today I had a discussion with a coworker about transparency and the way companies should be more open about what they are doing! And what happens on the same day? One of my favourite webcompanies has decided to publish a short video taken from the weekly search quality meeting!</p>
<p>The proposed change by Lars Hellsten is that instead of only checking the first 10 words for possible spelling corrections one could predict which two words are most likely spelled wrong and add an additional window of +-5 words around them. They discuss how this change has much better scores than the old one. </p>
<p>The entire video is interesting because they say that semantic context is usually given by using 3 grams. <a target="_blank" href="http://typology.de">My students</a> used up to <a href="http://www.rene-pickhardt.de/download-google-n-gram-data-set-and-neo4j-source-code-for-storing-it/">5 grams in order to make their scentence prediction</a> and the machine learning already told them that 4grams would be sufficient to make syntactically and semantically correct predictions.</p>
<p>Anyway enjoy this great video by Google and thanks to Google for sharing this:</p>
<p><iframe width="640" height="360" src="http://www.youtube.com/embed/JtRJXnXgE-A" frameborder="0" allowfullscreen></iframe></p>


<p>Related posts:<ol><li><a href='http://www.rene-pickhardt.de/ibms-watson-google-what-is-the-the-difference/' rel='bookmark' title='IBM&#8217;s Watson &amp; Google &#8211; What is the the difference?'>IBM&#8217;s Watson &#038; Google &#8211; What is the the difference?</a></li>
<li><a href='http://www.rene-pickhardt.de/download-google-n-gram-data-set-and-neo4j-source-code-for-storing-it/' rel='bookmark' title='Download Google n gram data set and neo4j source code for storing it'>Download Google n gram data set and neo4j source code for storing it</a></li>
<li><a href='http://www.rene-pickhardt.de/google-uses-57-signals-to-filter/' rel='bookmark' title='What are the 57 signals google uses to filter search results?'>What are the 57 signals google uses to filter search results?</a></li>
</ol></p>]]></content:encoded>
			<wfw:commentRss>http://www.rene-pickhardt.de/google-video-on-search-quality-meeting-spelling-for-long-queries-by-lars-hellsten/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Related-work.net &#8211; Product Requirement Document released!</title>
		<link>http://www.rene-pickhardt.de/related-work-net-product-requirement-document-released/</link>
		<comments>http://www.rene-pickhardt.de/related-work-net-product-requirement-document-released/#comments</comments>
		<pubDate>Mon, 12 Mar 2012 10:26:50 +0000</pubDate>
		<dc:creator>Rene</dc:creator>
				<category><![CDATA[Collective Intelligence]]></category>
		<category><![CDATA[collaboration]]></category>
		<category><![CDATA[copyleft]]></category>
		<category><![CDATA[googleplus]]></category>
		<category><![CDATA[how to]]></category>
		<category><![CDATA[Information retrieval]]></category>
		<category><![CDATA[neo4j]]></category>
		<category><![CDATA[open access]]></category>
		<category><![CDATA[open data]]></category>
		<category><![CDATA[open source]]></category>
		<category><![CDATA[PhD]]></category>
		<category><![CDATA[semantic]]></category>
		<category><![CDATA[Social Network]]></category>
		<category><![CDATA[Twitter]]></category>
		<category><![CDATA[why]]></category>

		<guid isPermaLink="false">http://www.rene-pickhardt.de/?p=1176</guid>
		<description><![CDATA[Recently I visited my friend Heinrich Hartmann in Oxford. We talked about various issues how research is done in these days and how the web could theoretically help to spread information faster and more efficiently connect people interested in the same paper / topics. The idea of http://www.related-work.net was born. A scientific platform which is [...]


Related posts:<ol><li><a href='http://www.rene-pickhardt.de/related-work-of-the-reading-club-on-distributed-graph-data-bases-beehive-scalable-sparql-querying-of-large-rdf-graphs-memcached/' rel='bookmark' title='Related work of the Reading club on distributed graph data bases (Beehive, Scalable SPARQL Querying of Large RDF Graphs, memcached)'>Related work of the Reading club on distributed graph data bases (Beehive, Scalable SPARQL Querying of Large RDF Graphs, memcached)</a></li>
<li><a href='http://www.rene-pickhardt.de/phd-proposal-on-distributed-graph-data-bases/' rel='bookmark' title='PhD proposal on distributed graph data bases'>PhD proposal on distributed graph data bases</a></li>
<li><a href='http://www.rene-pickhardt.de/social-news-streams-a-possible-phd-research-topic/' rel='bookmark' title='Social news streams &#8211; a possible PhD research topic?'>Social news streams &#8211; a possible PhD research topic?</a></li>
</ol>]]></description>
			<content:encoded><![CDATA[<p><strong>Recently I visited my friend <a target="_blank" href="http://www.maths.ox.ac.uk/people/profiles/heinrich.hartmann" rel="nofollow">Heinrich Hartmann</a> in Oxford. We talked about <a href="http://www.rene-pickhardt.de/open-access-and-the-boycott-of-elsevier-let-uns-not-stop-here-and-take-the-digital-revolution-one-step-further/">various issues how research is done in these days</a> and how the web could theoretically help to spread information faster and more efficiently connect people interested in the same paper / topics.<br />
The idea of <a target="_blank" href="http://www.related-work.net" target="_blank">http://www.related-work.net</a> was born. A scientific platform which is open source and open data and tries to solve those problems.</p>
<p>But we did not want to reinvent the wheel. So we did some research on existing online solutions and also asked people from various disciplines to name their problems. Find below our product requirement document! If you like our approach you can <a target="_blank" href="mailto:rene@rene-pickhardt.de">contact us</a> or contribute on the <a target="_blank" href="http://code.google.com/p/related-work-net/">source code</a> find <a target="_blank" href="http://code.google.com/p/related-work-net/wiki/CodeStructure">some starting documentation</a>!</p>
<p>So the plan is to fork an open source question answer system and enrich it with the features fulfilling the needs of scientists and some social aspects (hopefully using <a target="_blank" href="http://rene-pickhardt.de/tag/neo4j">neo4j</a> as a supporting data base technology) which will eventually help to rank related work of a paper.</p>
<p>Feel free to provide us with feedback and wishes and join our effort!</strong></p>
<h2>Beginning of our Product Requirement Document</h2>
<p style="text-align: justify;" dir="ltr">We propose to create a new website for the scientific community which brings together people which are reading the same paper. The basic idea is to mix the functionality of a Q&amp;A platform (like MathOverflow) with a paper database (like arXiv). We follow a strict openness principal by making available the source code and the data we collect.<br />
We start with an analysis how the internet is currently used in different fields and explain the shortcomings. The actual product description can be found under the section “Basic idea”. At the end we present an overview over the websites which follow a similar approach.<br />
This document &#8211; as well as the whole project &#8211; is work in progress. We are happy about any kind of comments or other contributions.</p>
<h2>The distribution of scientific knowledge</h2>
<p style="text-align: justify;" dir="ltr">Every scientist hast to stay up to date with the developments in his area of research. The basic sources for finding new information are:</p>
<ul>
<li>Conferences</li>
<li>Research Seminars</li>
<li>Journals</li>
<li>Preprint-servers (arXiv)</li>
<li>Review Databases (MathSciNet, Zentralblatt, &#8230;)</li>
<li>Q&amp;A Sites (MathOverflow, StackOverflow, &#8230;)</li>
<li>Blogs</li>
<li>Social Networks (Twitter, Google+)</li>
<li>Bibliograhpic Databases (Mendeley, nNode, Medline, <a target="_blank" href="http://en.wikipedia.org/wiki/Comparison_of_reference_management_software">etc.</a> )</li>
</ul>
<p><strong><strong>Every community has found its very own way of how to use this tools.<br />
</strong></strong></p>
<h2 dir="ltr">Mathematics by <a target="_blank" href="http://www.math.uni-bonn.de/people/hartmann/">Heinrich Hartmann</a> &#8211; Oxford:</h2>
<p style="text-align: justify;" dir="ltr"><img alt="" src="http://www.maths.ox.ac.uk/system/files/imagecache/photos/user-photos/IMG_4779_s.JPG" title="heinrich Hartmann" class="alignleft" width="190" height="190" />To stay up to date with recent developments I check <a target="_blank" href="http://www.arxiv.org/">arxiv.org </a>on a daily basis (RSS feed) participate in <a target="_blank" href="http://mathoverflow.net/">mathoverflow.net</a> and search for papers over Google Scholar or <a target="_blank" href="http://www.ams.org/mathscinet/">MathSciNet</a>. Occasionally interesting work is shared by people in my Google+ circles. In general the speed of pure mathematics is very slow. New research often builds upon work which has been out for a few years. To stay reasonably up to date it is enough to go to conferences every 3-5 months.<br />
I read many papers on myself because I am the only one at the department who does research on that particular topic. We have a reading class where we read papers/lecture notes which are relevant for more people. Usually they are concerned with introductions to certain kinds of theory. We have weekly seminars where people talk about their recently published work. There are some very active blogs by famous mathematicians, but in my area blogs play virtually no role.</p>
<h2 dir="ltr">Computer Science by <a href="http://www.rene-pickhardt.de/">René Pickhardt</a> &#8211; Uni Koblenz</h2>
<p style="text-align: justify;" dir="ltr"><a href="http://www.rene-pickhardt.de/wp-content/uploads/2012/03/Rene-Pickhardt.jpg"><img src="http://www.rene-pickhardt.de/wp-content/uploads/2012/03/Rene-Pickhardt.jpg" alt="" title="Rene Pickhardt" width="190" height="190" class="alignright size-full wp-image-1182" /></a>In Computer Science topics are evolving but also changing very quickly. It is always important to have both an overview of upcoming technologies (which you get from tech blogs) as well as access to current research trends.<br />
Since the speed in computer science is so fast and the review process in Journals often takes much time our main source of information and papers are conferences and twitter.</p>
<ul>
<li>Usually conference papers are distributed digitally to participants. If one is interested in those papers google queries like “conference name year papers” are frequently used. Sites like <a target="_blank" href="http://www.sciweavers.org/">http://www.sciweavers.org/</a> host and aggregate preprints of papers and organize them by conference.</li>
<li>The general method to follow a conference that one is not attending is to follow the hashtag of the conference on Twitter. In general Twitter is the most used tool to share distribute and find information not only for papers but also for the above mentioned news about upcoming technologies.</li>
</ul>
<p style="text-align: justify;" dir="ltr">Another rich source for computer scientists is, of course, the related work of papers and google scholar. Especially useful is the method of finding a very influential paper with more than 1000 citations and find newer papers that quote this paper containing a certain keyword which is one of the features of google scholar.<br />
The main problem in computer science is not to find a rare paper or idea but rather to filter the huge amount of publications and also bad publications and also keep track of trends. In this way a system that ranks and summarize papers (not only by abstract and citation counts) would help me a lot to select what related work of a paper I should read!</p>
<h2 dir="ltr">Psychology by <a target="_blank" href="http://www.uniklinik-freiburg.de/fbi/live/groups/kloppel/team/scheller_en.html">Elisa Scheller </a> &#8211; Uni Freiburg</h2>
<p style="text-align: justify;" dir="ltr"><a target="_blank" href="http://www.rene-pickhardt.de/wp-content/uploads/2012/03/elisa-scheller.jpg"><img src="http://www.rene-pickhardt.de/wp-content/uploads/2012/03/elisa-scheller.jpg" alt="" title="elisa scheller" width="150" height="306" class="alignleft size-full wp-image-1183" /></a>As a psychologist/neuroscientist, I receive recommendations for scientific papers via google scholar alerts or science direct alerts (<a href="http://www.sciencedirect.com/">http://www.sciencedirect.com/</a>); I receive alerts regarding keywords or regarding entire journal issues. When I search for a certain publication, I use <a target="_blank" href="http://pubmed.org/">pubmed.org</a> or <a target="_blank" href="http://scholar.google.com/">scholar.google.com</a>. This can sometimes be kind of annoying, as I receive multiple alerts from different sources; but I guess it is the best way to stay up to date regarding recent developments. This is especially important in my field, as we feel a big amount of &#8220;publication pressure&#8221;; I work on a method which is considered as &#8220;quite fancy&#8221; at the moment, so I also use the alerts to make sure nobody has published &#8220;my&#8221; experiment yet.<br />
Sometimes a facebook friend recommends a certain publication or a colleague points me to it. Most of the time, I read articles on my own, as I am the only person working on this specific topic at my institution. Additionally, we have a weekly journal club where everyone in turn presents work which is related to our focus of research, e.g. a certain part of the human brain. There is also a weekly seminar dedicated to presentations about ongoing projects.<br />
Blogs (e.g. <a target="_blank" href="http://mindhacks.com/">mindhacks.com</a>, <a target="_blank" href="http://neuroskeptic.blogspot.com/">http://neuroskeptic.blogspot.com/</a>) can be a source to get an overview about recent developments, but I have to admit I use them mainly for work-related entertainment.<br />
All in all, it is easy to stay up to date using alerts from different platforms;  the annoying part of it is the flood of emails you receive and that you are quite often alerted to articles that don&#8217;t fit your interests (no matter how exact you try to specify your keywords).</p>
<h2>Biomedical Research by <a target="_blank" href="http://www.linkedin.com/pub/johanna-goldmann/22/702/39">Johanna Goldmann</a> &#8211; MIT</h2>
<p><a href="http://www.rene-pickhardt.de/wp-content/uploads/2012/03/johanna.png"><img src="http://www.rene-pickhardt.de/wp-content/uploads/2012/03/johanna-270x300.png" alt="" title="Johanna Goldmann" width="185" height="200" class="alignright size-thumbnail wp-image-1193" /></a>In the biological sciences, in research at the bench – communication is one of the most fundamental tools a scientist can have. Communication with other scientist may open up the possibilities of new collaborations, can lead to a completely new view point of a known question, the integration and expansion of methods as well as allowing a scientist to have a good understanding of what is known, what is not known and what other people have – both successfully and unsuccessfully – tried to investigate.<br />
        Yet communication is something that is currently very much lacking in academic science – lacking to the extent that most scientist will agree hinders the progress of research. Nonetheless the lack of communication and the issues it brings with it is something that most scientists will have accepted as a necessary evil – not knowing how to possibly change it.<br />
         Progress is only reported in peer-reviewed journals – many which are greatly affected not only but what is currently “sexy” in research but also by politics and connections and the “publish or perish” pressure. Due to the amount of this pressure in publishing in journals and the amount of weight the list of your publications will have upon any young scientists chances of success, scientist tend also to be very reluctant in sharing any information pre-publication.<br />
  Furthermore one of the major issues is that currently there really is no way of publishing or communicating either negative results or minor findings, which causes may questions or methods to be repeatedly investigated as well as a loss of information.<br />
Given how much social networks and the internet has changed communication as well as the access to information over the past years – there is a need for this change to affect research and communication in the life science and transform the way we think not only about solving and approaching research questions we gather but the information and insights we gain as a whole. </p>
<h2>Philosophy by <a target="_blank" href="http://www.finks.de/Sascha_Benjamin_Fink/Welcome.html">Sascha Benjamin Fink</a> &#8211; Uni Osnabrück</h2>
<p><a target="_blank" href="http://www.finks.de/Sascha_Benjamin_Fink/Welcome_files/shapeimage_3.png"><img alt="" src="http://www.finks.de/Sascha_Benjamin_Fink/Welcome_files/shapeimage_3.png" title="Sascha Fink" class="alignleft" width="177" height="238" /></a>The most important source of information for philosophers is <a target="_blank" href="http://philpapers.org/">http://philpapers.org/</a>. You can follow trends going on in your field of interest. Philpapers has a list of almost all papers together with their abstracts, keywords and categories as well as a link to the publisher. Additional information about similar papers is displayed.</p>
<p>Every category of papers is managed by some editor. For each category it is possible to subscribe to a newsletter. In this way once per month I will be informed about current publications in journals related to my topic of interest. Every User is able to create an account and manage his literature and the papers of his he is interested in.<br />
Other research and information exchange methods among philosophers consist of mailing lists, reading clubs and  Blogs. Have a look at <a target="_blank" href="http://consc.net/weblogs.html">David Chalmers blog list</a>. Blogs are also becoming more and more important. Unfortunately they are usually on general topics and discussing developments of the community (e.g. <a target="_blank" href="http://leiterreports.typepad.com/">Leiter’s Blog</a>, <a target="_blank" href="http://fragments.consc.net/">Chalmers’ Blog</a> and <a target="_blank" href="http://schwitzsplinters.blogspot.com/">Schwitzgebel’s Blog</a>). </p>
<p>But all together I still think that for me a centralized service like Philpapers is my favourite tool because it aggregates most information. If I don’t hear about it on Philpapers usually it is not that important.  I think among Philosophers this platform &#8211; though incomplete &#8211; seems to be the standard for the next couple of  years.</p>
<h2 dir="ltr">Problems</h2>
<p style="text-align: justify;" dir="ltr">As a scientist it is crucial to be informed about the current developments in the research area. Abstracting from the reports above we divide the tasks roughly into the following stages.<br />
<strong><strong><br />
1. Finding and filtering new publications:<br />
</strong></strong></p>
<ul>
<li><span style="text-align: justify;">What is happening right now? What are the current hot topics my area? What are current trends? (→ Check arXiv/Twitter)</span></li>
<li>Did a friend of mine write something? Did a “big shot” write something?<br />
(→ Check meta information: title, authors)</li>
<li>Are my colleagues excited about a new development? (→ Talk to them.)</li>
</ul>
<p style="text-align: justify;" dir="ltr"><strong><strong>2. Getting more information about a given paper:</strong></strong></p>
<ul>
<li>What is actually done in a given paper? Is it relevant for me? Is it really new? Is it a breakthrough? (→ Read abstracts. Find a good readable summary/review.)</li>
<li>Judge the quality of a paper: Is it correct? Is it well written?<br />
( → Where is it published, if at all? Skim through content.)</li>
</ul>
<p dir="ltr">Finally there is a fundamental decision: Shall I read the whole paper, or not? which leads us to the next task.</p>
<p style="text-align: justify;" dir="ltr"><strong>3. Understanding a paper:</strong> Understanding a paper in depth can be a very time consuming and tedious process. The presentation is often very short and much knowledge is assumed from the reader. The notation choices can be bad, so that even the statements are hard to understand. In effect the paper is easily readable only for a very small circle of specialist in the area. If one is not in the lucky situation to belong to that circle, one usually applies the following strategies:</p>
<ol>
<li><strong>Lookup references</strong>. This forces you to process a whole tree of older papers which might be hard to read, and hard to get hold of. Sometimes it is worthwhile to consult a textbook to polish up fundamentals.</li>
<li><strong>Finding additional resources</strong>. Is there a review? Is there a related video lecture or slides explaining the material in more detail? Is the author going to a conference in the near future, or even giving a seminar in the area?</li>
<li><strong>Join forces.</strong> Find people thinking about the same paper: Has somebody at my department already read the paper, so that I can ask some questions? Is there enough interest to make a reading group, or more formally, run a seminar about that paper.</li>
<li><strong>Contact the author</strong>. This a last resort. If you have struggled with understanding the paper for a very long time and really need/want to get it, you might eventually write an email to the author &#8211; who might respond, or not. Sometimes even errors are found! &#8211; and not published! An indeed, there is no easy way to publish “errata” anywhere on the net.</li>
</ol>
<p style="text-align: justify;" dir="ltr">In mathematics most papers are not getting read though the end. One uses strategies 1 &amp; 2 till one gets stuck and moves on to something more exciting. The chances of survival are much better with strategy 3 where one is committed putting a lot of effort in it over weeks.</p>
<p style="text-align: justify;" dir="ltr"><span style="text-align: justify;"><strong>4. Finding related work.</strong> Where to go from there? Is the paper superseded by a more recent development? Which are the relevant papers which the author builds upon? What are the historic influences? What are the founding ideas of the subject? Finding related work is very time consuming. It is easy to overlook things given that the references are often vast, and sometimes hard to get hold of. Getting information over citations requires often access to commercial databases.</span></p>
<h2 dir="ltr">Basic idea:</h2>
<p style="text-align: justify;" dir="ltr">All researchers around the world are faced with the same problems and come up with their individual solutions. There are great synergies in bringing these people together with an online platform! Most of the addressed problems are solved with a paper centric service which allows you to&#8230;</p>
<ul>
<li>&#8230;get to know other readers of the paper.</li>
<li>&#8230;exchange with the other readers: ask questions, write comments, reviews.</li>
<li>&#8230;share the gained insights with the community.</li>
<li>&#8230;ask questions about the paper.</li>
<li>&#8230;discuss the paper.</li>
<li>&#8230;review the paper.</li>
</ul>
<p dir="ltr">We want to do that with a new mixture of a traditional Q&amp;A system like StackExchange or MathOverflow with a paper database and social features. The key features of this system are as follows:</p>
<p style="text-align: justify;" dir="ltr"><strong>Openness</strong>: We follow a strict openness principle. The software will be developed in <strong>open source</strong>. All data generated on this site will be under a <strong>creative commons license</strong> (like Wikipedia) and will be made available to the community in form of database dumps or an API (<strong>open data</strong>).</p>
<p dir="ltr">We use two different types of content sites in our system: Papers and Discussions.</p>
<p style="text-align: justify;" dir="ltr"><strong><strong>Paper sites. </strong></strong>A paper site is dedicated to a single publication. And has the following features:<strong><strong><br />
</strong></strong></p>
<ol>
<li>Paper meta information<br />
- show title, author, abstract, journal, tags<br />
- leave a comment<br />
- write a review (with wiki option)<br />
- vote up/down</li>
<li>Paper resources<br />
- show pdfs, slides, notes, video lectures, etc.<br />
- add a resource</li>
<li>Related Work<br />
- show the reference-tree and citations in an intelligent way.</li>
<li>Discussions:<br />
- show related discussions<br />
- start a new discussion</li>
<li>Social features<br />
- bookmark<br />
- share on G+, twitter</li>
</ol>
<p style="text-align: justify;" dir="ltr">The point “Related Work” deserves some further explanation. The citation graph offers a great deal more information than just a list of references. Together with the user generated content like votes and the individual paper bookmarks and social graph one has a very interesting data set which can be harvested. We want this point at least view with respect to: Popularity/Topics/Read by Friends. Later on one could add more sophisticated, even graphical views on this graph.</p>
<p style="text-align: justify;" dir="ltr"><strong><strong><br />
Discussion sites. </strong></strong>A discussion looks more like a traditional QA-question, with the difference, that each discussion may have related (many) papers. A discussion site contains:</p>
<ol>
<li>Discussion meta information (title, author, body)</li>
<li>Discussion content</li>
<li>Related papers</li>
<li>Voting</li>
<li>Follow/Bookmark</li>
</ol>
<p style="text-align: justify;" dir="ltr">Besides the content sides we want to provide the following features:</p>
<p><strong>News Stream</strong>. This is the start page of our website. It will be generated from the network consisting of friends, papers and authors. There should be several modes like:</p>
<ul>
<li>hot: heavily discussed papers/discussions</li>
<li>new papers: list new publications (filtered by tag, like arXiv feed)</li>
<li>social: What did your friends do lately</li>
<li>default: intelligent mix of recent activity that is relevant to the logged in user</li>
</ul>
<p style="text-align: justify;" dir="ltr"><strong><strong><br />
</strong></strong>Moreover, filter by tag should be always available.<br />
<strong><strong><br />
Search bar:</strong></strong></p>
<ul>
<li>Searches contents of the site, but should also find papers on freely available databases (e.g. arXiv). Adding a paper should be very seamless process from there.</li>
<li>Search result ranking uses vote and view information.</li>
<li>Personalized search information. (Physicists usually do not want sociology results.)</li>
<li>Auto completion on paper titles, author, discussions.</li>
</ul>
<p style="text-align: justify;" dir="ltr"><strong><strong>Social: </strong></strong>(hard to implement, maybe for second version!)</p>
<ul>
<li>Easily refer to users by @-syntax familiar from Twitter/Google+</li>
<li>Maintain a friendship / trust graph</li>
<li>Friendship recommendations</li>
<li>Find friends from Google+ on the site</li>
</ul>
<h2 dir="ltr">Benefits</h2>
<p>Our proposed websites improves the above mentioned problems in the following ways.<strong><strong></strong></strong></p>
<p>1. Finding and filtering new publications:This step can be improved with even very little  community effort:</p>
<ul>
<li>Tell other people, that you are interested in the paper. Vote it up or leave a comment if you are very excited about it.</li>
</ul>
<ul>
<li>Point out a paper to a colleague.</li>
</ul>
<p><strong><strong>2. Getting more information about a given paper:</strong></strong></p>
<ul>
<li>Write a summary or review about a paper you have read or skimmed through. Maybe the introduction is hard to read or some results are not clearly stated.</li>
<li>Can you recommend reading this paper? Vote it up!</li>
<li>Ask a colleague for his opinion on the paper. Maybe he can write a summary?</li>
</ul>
<p>Many reviews of new papers are already written. E.g. MathSciNet and Zentralblatt maintain a large database of Reviews which are provided by the community and are not freely available. Many authors would be much more happy to write them to an open system!<strong><strong></strong></strong></p>
<p>3. Understanding a paper:Here are the mayor synergies which we want to address with our project.</p>
<ul>
<li><strong>Ask a question</strong>: Why is the author using this experimental method? How does Lemma 3.4 work? Why do I need this assumption? What is the intiution behind the “virtual truncation”? What implications does this work have?</li>
<li><strong>Start a discussion</strong>: (might involve more than one paper.) What is the difference of these two papers? Is there a reference explaining this more clearly? What should I read in advance to understand the theory?</li>
<li><strong>Add resources</strong>. Tell the community about related videos, notes, books etc. which are available on other sites.</li>
<li><strong>Share your notes</strong>. If you have discussed a paper in a reading class or seminar. Collect your notes or opinions and make them available for the community.</li>
<li>Restate interesting statements. Tell the community when you have found a helpful result which is buried inside the paper. In that way Google may find it!</li>
</ul>
<p><strong>4. Finding related work.</strong> Having a well structured and easily navigable view on related papers simplifies the search a lot. The filtering benefits from the content generated by the users (votes) and individual information, like friends who have written/bookmarked a paper.</p>
<h2 dir="ltr">Similar Sites on the Web</h2>
<p>There are several discussions in QA forum which are discussing precisely this problem:</p>
<ul>
<li>Quora.com: <a target="_blank" href="http://www.quora.com/What-are-some-websites-where-one-can-post-commentary-and-reviews-of-academic-papers">Where can I comment on sci papers?</a></li>
<li>MathOverflow: <a target="_blank" href="http://mathoverflow.net/questions/51056/are-there-any-good-websites-for-hosting-discussions-of-mathematical-papers">Good websites for discussions of mathematical papers?</a></li>
<li>MathOverflow: <a target="_blank" href="http://mathoverflow.net/questions/13619/is-a-free-alternative-to-mathscinet-possible">Is a free alternative to MathSciNet possible?</a></li>
<li>MathOverflow: <a target="_blank" href="http://mathoverflow.net/questions/3038/errata-database">Errata-Database</a></li>
</ul>
<p>We found three sites on the internet which follow a similar approach which we examined more carefully.</p>
<p><strong><strong>1. </strong></strong>There is a social network which has most of our features implemented:<strong><strong><br />
</strong></strong></p>
<p style="text-align: center;" dir="ltr"><a target="_blank" href="http://www.researchgate.net/">researchgate.net<br />
</a>“Connect with researchers, make your work visible, and stay current.”</p>
<p>The Economist has dedicated an <a target="_blank" href="http://www.economist.com/node/21547218">article</a> to them. It is essentially a facebook clone, with special features for scientist.</p>
<ul>
<li>Large, fast growing community. 1.4m +50.000/m. Mainly Biology and Medicine.<br />
(As Daniel Mietchen points out, the size might be misleading due to institutional accounts)</li>
<li>Very professional Look and Feel. Company from Berlin, Germany, funded by VC. (48 People involved, 10 Jobs advertised)</li>
<li>Huge Feature set:</li>
<ul>
<li>Profile site, Connect to friends</li>
<li>News Feed</li>
<li>Publication Database, Conference Finder, Jobmarket</li>
<li>Every Paper its own page: with</li>
<ul>
<li>Voting up/down</li>
<li>Comments</li>
<li>Metadata (Title, Author, Abstract, Preveiw)</li>
<li>Social Media (Share, Bookmark, Follow author)</li>
</ul>
<li>Organize Workgroups/Reading Classes.</li>
</ul>
</ul>
<p>Differences to our approach:</p>
<ul>
<li>Closed Data / Closed Source</li>
<li>Very complex site which solves a lot of purposes</li>
<li>Only very basic features on paper site: vote/comment.</li>
<li>QA system is not linked well to paper database</li>
<li>No MathML</li>
<li>Mainly populated by undergraduates</li>
</ul>
<p><strong><strong>2. Another website which comes reasonably close is:<br />
</strong></strong></p>
<p dir="ltr"><a target="_blank" href="http://www.sciweavers.org/">http://www.sciweavers.org/</a></p>
<p dir="ltr">“an academic network that aggregates links to research paper preprints<br />
then categorizes them into proceedings.”</p>
<ul>
<li>Includes a large collection of online tools for various purposes</li>
<li>Have a big library of papers/software/datasets/conferences for computer science.<br />
Paper sites have:</li>
<ul>
<li>Meta information and preview</li>
<li>Vote functionality and view statistics, tags</li>
<li>Comments</li>
<li>Related work</li>
<li>Bookmarking</li>
<li>Author information</li>
</ul>
<li>User profiles (no friendships)</li>
</ul>
<p><strong><strong><br />
Differences to our approach:</strong></strong></p>
<ul>
<li>Focus on computer science community</li>
<li>Comment and Discussions are well hidden on paper sites</li>
<li>No News stream</li>
<li>Very spacious design</li>
</ul>
<p>&nbsp;</p>
<p>3. Another very similar site is:</p>
<p style="text-align: center;"><a target="_blank" href="http://journalfire.com/">journalfire.com</a> &#8211; beta<br />
“Share what your read &#8211; connect to colleagues &#8211; create journal clubs.”</p>
<p>It has the following features:</p>
<ul>
<li>Comment on Papers. Activity feed (?). Follow articles.</li>
<li>Host Journal Clubs. Create Events related to papers.</li>
<li>Powerful search box fetching papers from Arxiv and Pubmed (slow)</li>
<li>Social features on site: User profiles, friend finder (no fb/g+ integration yet)</li>
<li>News feed &#8211; from subscribed papers and friends</li>
<li>Easy paper import via Bookmarklet</li>
<li>Good usability!! (but slow loading times)</li>
<li>Private reading clubs cost money!</li>
</ul>
<p>They are very skilled: Maintained by 3 PhD students/postdocs from Caltec and MIT.<br />
<strong><strong><br />
Differences to our approach:</strong></strong></p>
<ul>
<li>Closed Data, Closed Source</li>
<li>Also this site misses (currently) misses out ranking features</li>
<li>Very Closed model &#8211; Signup required</li>
<li>Weak Crowd sourcing: Cannot add Meta information</li>
</ul>
<p>The site is still at its very beginning with little users. The project started in 2010 and did not gain much momentum since.</p>
<p><strong><strong><br />
</strong></strong>The other sites are roughly classified in the following categories:<strong><strong><br />
</strong></strong>1. Single people who are following a very similar idea:</p>
<ul>
<li><a target="_blank" href="http://annotatr.appspot.com/">annotatr.appspot.com</a>. Combines a metadata-base with the disqus plugin. You can comment but not rate. Good usability. Nice CSS. Good search function. No MathML. No related article suggestion. Maintained by two academics in private time. Hosted on Google Apps. Closed Source &#8211; Closed Data.</li>
<li><a target="_blank" href="http://www.math.ntnu.no/~stacey/Vanilla/rForum/comments.php?DiscussionID=1&amp;page=1#Item_0">r-Forum</a> &#8211; a resource where mathematicians can collect record reviews, corrections of a resource (e.g. paper, talk, …). A simple Vanilla-Forum/Wiki with almost no content used by maybe 12 people in US. No automated Data import. No rating system.</li>
<li><a target="_blank" href="http://math-arch.org/">http://math-arch.org/</a> &#8211; Post comments to math papers. very bad usability &#8211; get even errors. Maintained by a group of russian programmers LogicSun. Closed Source &#8211; Closed Data.</li>
</ul>
<p dir="ltr">Analysis: Although the principal idea to connect people reading papers is there. The implementation is very bad in terms of usability and even basic programming. Also the voting features are missed out.</p>
<p><strong><strong>2. (Semi) Professional sites.</strong></strong></p>
<ul>
<li><a target="_blank" href="http://www.plosone.org/">Public Libary of Science</a> very professional, huge paper data base for mainly biology, medicine. Features full text papers, lots of interesting meta information including references. Has comment features (not very visible) and news stream on the start page.<br />
No QA features (+1, Ask question) on the site. Only published articles are on the site.</li>
<li><a target="_blank" href="http://www.mendeley.com/">Mendeley.com</a> &#8211; Huge Bibliographic database with bookmarking and social features. You can organize reading groups in there, with comments and notes shared among the participants. Features a news stream with papers by friends. Nice import. Impressive fulltext data and Reference features.<br />
No QA features for paper. No comments for paper. Requires Signup to do anything useful.</li>
<li><a target="_blank" href="http://www.papercritic.com/mendeley-pub/70404420-b5cc-11df-a52e-0024e8453de6">papercritic.com</a> &#8211; Open review database. Connected to Mendely bibliographic libary. You can post reviews. No rating. No comments. Not open: Mendely is commercial.</li>
<li><a target="_blank" href="http://apps.webofknowledge.com/">webofknowledge.com</a>. Commercial academic citation index.</li>
<li><a target="_blank" href="http://www.zotero.org/">zotero.org</a> &#8211; features programm that runs inside a browser. “easy-to-use tool to help you collect, organize, cite, and share your research sources”</li>
</ul>
<p>Analysis: The goal of all these tools is to simplify the reference management, by providing metadata like references, citations, abstracts, author profiles. Commenting features on the paper site are not there or not promoted.<strong><strong></strong></strong></p>
<p><strong><strong>3. Vaguely related sites which solve different problems:</strong></strong></p>
<ul>
<li><a target="_blank" href="http://www.citeulike.org/">citeulike.org</a> &#8211; Social bookmarking for papers. Closed Source &#8211; Open Data.</li>
<li><a target="_blank" href="http://www.scholarpedia.org/">http://www.scholarpedia.org</a>. A peer reviewed open access encyclopedia.</li>
<li><a target="_blank" href="http://www.philica.com/">Philica.com</a> Online Journal which publishes articles from any field along with its reviews.</li>
<li>MathSciNet/Zentralblatt &#8211; Review database for math community. Closed Source &#8211; Commercial.</li>
<li><a target="_blank" href="http://f1000research.com/">http://f1000research.com/ </a>- Online Journal with a public, post publish review process. “Open Science &#8211; Open Data &#8211; Open Review”</li>
<li><a target="_blank" href="http://altmetrics.org/manifesto/">http://altmetrics.org/manifesto/</a> as an emerging trend from the web-science trust community. Their goal is to revolutionize the review process and create better filters for scientific publications making use of link structures and public discussions. (Might be interesting for us).</li>
<li><a target="_blank" href="http://meta.wikimedia.org/wiki/WikiScholar">http://meta.wikimedia.org/wiki/WikiScholar</a> &#8211; one of several ideas under discussion at Wikimedia as to a central repository for references (that are cited on Wikipedias and other Wikimedia projects)</li>
</ul>
<p>Upshot of all this:<strong><strong><strong><strong><br />
</strong></strong></strong></strong></p>
<h2 style="text-align: center;" dir="ltr">There is not a single site featuring good Q&amp;A features for papers.</h2>
<p><strong>If you like our approach you can <a target="_blank" href="mailto:rene@rene-pickhardt.de">contact us</a> or contribute on the <a target="_blank" href="http://code.google.com/p/related-work-net/">source code</a> find <a target="_blank" href="http://code.google.com/p/related-work-net/wiki/CodeStructure">some starting documentation</a>!</p>
<p>So the plan is to fork an open source question answer system and enrich it with the features fulfilling the needs of scientists and some social aspects which will eventually help to rank related work of a paper.</p>
<p>Feel free to provide us with feedback and wishes and join our effort!</strong></strong></p>


<p>Related posts:<ol><li><a href='http://www.rene-pickhardt.de/related-work-of-the-reading-club-on-distributed-graph-data-bases-beehive-scalable-sparql-querying-of-large-rdf-graphs-memcached/' rel='bookmark' title='Related work of the Reading club on distributed graph data bases (Beehive, Scalable SPARQL Querying of Large RDF Graphs, memcached)'>Related work of the Reading club on distributed graph data bases (Beehive, Scalable SPARQL Querying of Large RDF Graphs, memcached)</a></li>
<li><a href='http://www.rene-pickhardt.de/phd-proposal-on-distributed-graph-data-bases/' rel='bookmark' title='PhD proposal on distributed graph data bases'>PhD proposal on distributed graph data bases</a></li>
<li><a href='http://www.rene-pickhardt.de/social-news-streams-a-possible-phd-research-topic/' rel='bookmark' title='Social news streams &#8211; a possible PhD research topic?'>Social news streams &#8211; a possible PhD research topic?</a></li>
</ol></p>]]></content:encoded>
			<wfw:commentRss>http://www.rene-pickhardt.de/related-work-net-product-requirement-document-released/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
	</channel>
</rss>

