<?xml version="1.0"?>
<rss version="2.0" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:media="http://search.yahoo.com/mrss/" xmlns:yt="http://gdata.youtube.com/schemas/2007" xmlns:atom="http://www.w3.org/2005/Atom">
   <channel>
      <title>larkc</title>
      <description>Pipes Output</description>
      <link>http://pipes.yahoo.com/pipes/pipe.info?_id=3e447f6fc4b9d447447ede5790d7b140</link>
      <atom:link rel="next" href="http://pipes.yahoo.com/pipes/pipe.run?_id=3e447f6fc4b9d447447ede5790d7b140&amp;_render=rss&amp;page=2"/>
      <pubDate>Mon, 20 May 2013 20:42:52 +0000</pubDate>
      <generator>http://pipes.yahoo.com/pipes/</generator>
      <item>
         <title>LarKC’s Botari wins the 2011 Semantic Web Challenge</title>
         <link>http://blog.larkc.eu/?p=2211</link>
         <description>The Botari application from the LarKC project has won the Open Track of the Semantic Web Challenge.
Botari is a LarKC workflow running on servers in Seoul, plus a user frontend that runs on a Galaxy Tab.
The workflow combines open data from the city of Seoul (Open Street Map, POI&amp;#8217;s) with twitter traffic and combines stream processing, [...]</description>
         <guid isPermaLink="false">http://blog.larkc.eu/?p=2211</guid>
         <pubDate>Fri, 28 Oct 2011 14:57:08 +0000</pubDate>
         <content:encoded><![CDATA[<p>The Botari application from the LarKC project has won the Open Track of the Semantic Web Challenge.</p>
<p>Botari is a LarKC workflow running on servers in Seoul, plus a user frontend that runs on a Galaxy Tab.</p>
<p>The workflow combines open data from the city of Seoul (Open Street Map, POI&#8217;s) with twitter traffic and combines stream processing, machine learning and querying over RDF datasets and streams to give personalised restaurant information and recommendations, presented in an augmented reality interface on the Galaxy Tab.</p>
<p>For more info on Botari, see either the <a rel="nofollow" target="_blank" href="http://larkc.cefriel.it/lbsma/bottari/">website</a>, or the <a rel="nofollow" target="_blank" href="http://www.youtube.com/watch?v=c1FmZUz5BOo">demo movie</a> or the <a rel="nofollow" target="_blank" href="http://www.slideshare.net/emanueledellavalle/bottari-location-based-social-media-analysis-with-semantic-web">slide deck</a> or <a rel="nofollow" target="_blank" href="http://www.cs.vu.nl/~pmika/swc/submissions2011/swc2011_submission_15.pdf">the paper</a>.</p>
<p style="margin-top:10px;height:15px;" class="zemanta-pixie"><a rel="nofollow" target="_blank" href="http://www.zemanta.com/" title="Enhanced by Zemanta" class="zemanta-pixie-a"><img src="http://img.zemanta.com/zemified_e.png?x-id=7c3935c5-53f5-404e-9ff7-cee81c49a08f" style="border-color:initial;float:right;border-style:none;" alt="Enhanced by Zemanta" class="zemanta-pixie-img"/></a></p>]]></content:encoded>
      </item>
      <item>
         <title>Another speed record for OWL Horst inference</title>
         <link>http://blog.larkc.eu/?p=2201</link>
         <description>If you liked WebPIE, you&amp;#8217;ll also like QueryPIE
WebPIE performed forward inference over up to 100 billion triples (yes, that&amp;#8217;s 10^11). Our about-to-be-published QueryPIE can do on the fly backward-chaining inference at query-time, over a billion triples, in milliseconds, on just 8 parallel machines.
Last year, Jacopo Urbani and co-authors from the LarKC team broke the speed record for [...]</description>
         <guid isPermaLink="false">http://blog.larkc.eu/?p=2201</guid>
         <pubDate>Mon, 19 Sep 2011 09:18:26 +0000</pubDate>
         <content:encoded><![CDATA[<p><strong>If you liked WebPIE, you&#8217;ll also like QueryPIE</strong></p>
<blockquote style="margin-top:0px;margin-right:0px;margin-bottom:0px;margin-left:40px;border-color:initial;border-style:none;padding:0px;" class="webkit-indent-blockquote"><p>WebPIE performed forward inference over up to 100 billion triples (yes, that&#8217;s 10^11). Our about-to-be-published QueryPIE can do on the fly <em><a rel="nofollow" target="_blank" href="http://en.wikipedia.org/wiki/Backward_chaining" class="zem_slink" title="Backward chaining">backward-chaining</a></em> inference at query-time, over a billion triples, in milliseconds, on just 8 parallel machines.</p></blockquote>
<p>Last year, Jacopo Urbani and co-authors from the LarKC team broke the speed record for forward chaining inference over OWL-Horst.  Computing the complete closure over 100 billion of triples in a number of hours using a MapReduce/Hadoop implementation on a medium-sized cluster. The performance of WebPie [see <a rel="nofollow" target="_blank" href="http://www.mendeley.com/research/owl-reasoning-webpie-calculating-closure-100-billion-triples/">conference </a>and <a rel="nofollow" target="_blank" href="http://www.mendeley.com/c/4426400885/g/1029291/urbani-2011-webpie--a-web-scale-parallel-inference-engine-using-mapreduce/">journal</a> paper] is:</p>
<ul>
<li>1 billion FactForge triples in 1.5 hours on 32 compute nodes</li>
<li>24 billion <a rel="nofollow" target="_blank" href="http://bio2rdf.org/" class="zem_slink" title="Bio2RDF">Bio2RDF</a> triples in 10 hours on 32 compute nodes</li>
<li>100 billion LUBM triples in 15 hours on 64 compute notes</li>
<li>deriving anywhere between 150K-650K triples per second, depending on the dataset</li>
<li>runtime growing linearly with number of triples</li>
<li>speedup growing linearly the number of compute nodes</li>
</ul>
<p>Now, a year later, we&#8217;re breaking another speed record, but this time for &#8220;<em>backward chaining</em>&#8220;: not doing all inferencing up front, but doing the inferencing &#8220;on the fly&#8221;, at query time, as and when they are needed.</p>
<p>Until now, backward-chaining was considered to be unfeasible on very large realistic data, since it would slow down the query response time too much. Our <a rel="nofollow" target="_blank" href="http://www.cs.vu.nl/~frankh/postscript/ISWC11.pdf">paper at ISWC this year</a> shows it&#8217;s not all that impossible: on different real-life datasets of up to 1 billion triples, QueryPIE can do on the fly backward-chaining inference at query-time, implementing the full OWL Horst fragment with response times in millisecs on just 8 machines.</p>
<p>All code available at <a rel="nofollow" target="_blank" href="http://few.vu.nl/~jui200/files/querypie-1.0.0.tar.gz">http://few.vu.nl/~jui200/files/querypie-1.0.0.tar.gz</a></p>
<p class="zemanta-pixie" style="margin-top:10px;height:15px;"><a rel="nofollow" target="_blank" href="http://www.zemanta.com/" class="zemanta-pixie-a" title="Enhanced by Zemanta"><img src="http://img.zemanta.com/zemified_e.png?x-id=2e403695-bc6b-484e-bb54-ec6d50429ba8" class="zemanta-pixie-img" alt="Enhanced by Zemanta" style="border-color:initial;float:right;border-style:none;"/></a></p>]]></content:encoded>
      </item>
      <item>
         <title>Chinese LarKC BooK</title>
         <link>http://blog.larkc.eu/?p=2191</link>
         <description> by Zhisheng Huang
The China Higher Education Press will publish a LarKC book in Chinese. This book will appear  in the book series of Web Intelligence and Web  Science (http://www.wici-lab.org/wici/WIWS/) .
This Chinese LarKC book consists of two parts: Technology part and  application part. The technology part covers the topics of LarKC platform, development guide [...]</description>
         <guid isPermaLink="false">http://blog.larkc.eu/?p=2191</guid>
         <pubDate>Thu, 21 Jul 2011 07:51:41 +0000</pubDate>
         <content:encoded><![CDATA[<p> by <a rel="nofollow" target="_blank" href="http://www.cs.vu.nl/~huang">Zhisheng Huang</a></p>
<p>The China Higher Education Press will publish a LarKC book in Chinese. This book will appear  in the book series of Web Intelligence and Web  Science (<a rel="nofollow" target="_blank" href="http://www.wici-lab.org/wici/WIWS/" class="moz-txt-link-freetext">http://www.wici-lab.org/wici/WIWS/</a>) .</p>
<p>This Chinese LarKC book consists of two parts: Technology part and  application part. The technology part covers the topics of LarKC platform, development guide and various plugins and workflows.  The application  part covers the topics of Linked Life Data, semantic information retrieval, urban computing, and  cancer study. The main contributors of  the book are six Chinese researchers in the  LarKC Consortium, who are from Amsterdam, WICI, and Siemens. See the appended text below for the detail.<br />
The book is expected to be published by the end of this year.</p>
<p>Here is the outline of the book content and the main contributors.</p>
<p>Chapter 1 Introduction to LarKC<br />
by Zhisheng Huang (VUA) and Ning Zhong (WICI)</p>
<p>Chapter 2 LarKC Platform<br />
by Jun Fang (VUA)</p>
<p>Chapter 3 Identification  and Selection<br />
by Yi Zeng (WICI)</p>
<p>Chapter 4 Abstraction and Transformation<br />
by Yi Huang (SIEMENS)</p>
<p>Chapter 5 Reasoning  and Deciding<br />
by Jun Fang (VUA) and Zhisheng Huang (VUA)</p>
<p>Chapter 6 LarKC Development Guide<br />
by Zhisheng Huang (VUA) and Jun Fang (VUA)</p>
<p>Chapter 7 Linked Life Data<br />
by Yi Huang (SIEMENS) and Zhisheng Huang (VUA)</p>
<p>Chapter 8 Semantic information retrieval for biomedical applications<br />
by Ru He (SIEMENS) and Zhisheng Huang (VUA)</p>
<p>Chapter 9 Semantic Technology and Gene Study<br />
by Zhisheng Huang (VUA)</p>
<p>Chapter 10 Urban Computing<br />
by Yi Huang (SIEMENS) and Zhisheng Huang (VUA)</p>
<p>Chapter 11 Conclusions<br />
by Zhisheng Huang (VUA),  Ru He (SIEMENS), and Ning Zhong (WICI)</p>]]></content:encoded>
      </item>
      <item>
         <title>LarKC from an HPC perspective</title>
         <link>http://blog.larkc.eu/?p=2181</link>
         <description>The LarKC folk at the German High Performance Computing Centre in Stuttgart did a rather nice write-up on LarKC from a high-performance computing perspective, intended for their own community. Find the relevant pages here.</description>
         <guid isPermaLink="false">http://blog.larkc.eu/?p=2181</guid>
         <pubDate>Sun, 19 Jun 2011 21:53:33 +0000</pubDate>
         <content:encoded><![CDATA[<p>The LarKC folk at the German High Performance Computing Centre in Stuttgart did a rather nice write-up on LarKC from a high-performance computing perspective, intended for their own community. Find the relevant pages <a rel="nofollow" target="_blank" href="http://www.cs.vu.nl/~frankh/spool/LarKC/HLRS-Magazine-inSiDE-spring2011.pdf">here.</a></p>
<p style="margin-top:10px;height:15px;" class="zemanta-pixie"><a rel="nofollow" target="_blank" href="http://www.zemanta.com/" class="zemanta-pixie-a" title="Enhanced by Zemanta"><img src="http://img.zemanta.com/zemified_e.png?x-id=e4e94f83-b8bf-4029-9426-8655d4f838ea" style="border:medium none;float:right;" class="zemanta-pixie-img" alt="Enhanced by Zemanta"/></a></p>]]></content:encoded>
      </item>
      <item>
         <title>Traffic LarKC wins the AI Mashup Challenge</title>
         <link>http://blog.larkc.eu/?p=2171</link>
         <description>A LarKC workflow for traffic-aware route-planning has won the 1st prize in the AI Mashup Challenge at the ESWC 2011 conference, held this week on Crete.
The detail of &amp;#8220;Traffic_LarKC&amp;#8221; can be found at https://sites.google.com/a/fh-hannover.de/aimashup11/home/traffic_larkc, but in brief:
Four different datasets are used:

the traffic sensors data, obtained from Milano Municipality
the Milano street topology
historical weather data from the Italian [...]</description>
         <guid isPermaLink="false">http://blog.larkc.eu/?p=2171</guid>
         <pubDate>Fri, 03 Jun 2011 14:43:53 +0000</pubDate>
         <content:encoded><![CDATA[<p>A LarKC workflow for traffic-aware route-planning has won the 1st prize in the <a rel="nofollow" target="_blank" href="https://sites.google.com/a/fh-hannover.de/aimashup11/">AI Mashup Challenge</a> at the <a rel="nofollow" target="_blank" href="http://www.eswc2011.org/">ESWC 2011 conference</a>, held this week on Crete.</p>
<p>The detail of &#8220;Traffic_LarKC&#8221; can be found at <a rel="nofollow" target="_blank" href="https://sites.google.com/a/fh-hannover.de/aimashup11/home/traffic_larkc">https://sites.google.com/a/fh-hannover.de/aimashup11/home/traffic_larkc</a>, but in brief:</p>
<p>Four different datasets are used:</p>
<ul>
<li>the traffic sensors data, obtained from <a rel="nofollow" target="_blank" href="http://www.ama-mi.it/">Milano Municipality</a></li>
<li>the Milano street topology</li>
<li>historical weather data from the Italian website <a rel="nofollow" target="_blank" href="http://www.ilmeteo.it/">ilMeteo.it</a></li>
<li>calendar information (week days and week-end days, holidays, etc.) from Milano Municipality and from the <a rel="nofollow" target="_blank" href="http://www.mozilla.org/projects/calendar/holidays.html">Mozilla Calendar project</a>.</li>
</ul>
<p>These are used in a batchtime workflow to predict the traffic situation over the next two ours and in a runtime workflow to respond to route-planning queries from users.</p>
<ul>
<li>The demo can be found at <a rel="nofollow" target="_blank" href="http://larkc.cefriel.it/traffic-larkc">http://larkc.cefriel.it/traffic-larkc</a>,</li>
<li>a video is at <a rel="nofollow" target="_blank" href="http://larkc.cefriel.it/traffic-larkc/traffic-larkc-video.html">http://larkc.cefriel.it/traffic-larkc/traffic-larkc-video.html</a></li>
<li>a paper is at <a rel="nofollow" target="_blank" href="https://sites.google.com/a/fh-hannover.de/aimashup11/home/traffic_larkc/traffic-larkc2_aimc-eswc-2011.pdf?attredirects=0&amp;d=1">https://sites.google.com/a/fh-hannover.de/aimashup11/home/traffic_larkc/traffic-larkc2_aimc-eswc-2011.pdf?attredirects=0&amp;d=1</a>, and</li>
<li>the competition entry is at <a rel="nofollow" target="_blank" href="https://sites.google.com/a/fh-hannover.de/aimashup11/home/traffic_larkc">https://sites.google.com/a/fh-hannover.de/aimashup11/home/traffic_larkc</a>.</li>
</ul>
<p>This LarKC workflow shows that Linked Open Data and the corresponding technologies are now getting good enough to compete with what&#8217;s possible in closed commercial systems.</p>
<p>Congratulations to the entire team that has made this possible!</p>
<p><img src="http://larkc.cefriel.it/traffic-larkc/ai/img/home.png" alt="LarKC traffic demo" width="100%"/></p>]]></content:encoded>
         <category>Uncategorized</category>
      </item>
      <item>
         <title>The Large Knowledge Collider release V2.5</title>
         <link>http://blog.larkc.eu/?p=2151</link>
         <description>The LarKC development team is proud to announce the new release V2.5 of the LarKC platform. The new release is a considerable improvement over the previous V2.0 edition, with the following distinctive features:

V2.5 is fully compliant with the LarKC final architecture. You can now develop your workflows and plugins, and be assured that future updates [...]</description>
         <guid isPermaLink="false">http://blog.larkc.eu/?p=2151</guid>
         <pubDate>Mon, 30 May 2011 06:29:43 +0000</pubDate>
         <content:encoded><![CDATA[<p>The LarKC development team is proud to announce the new release V2.5 of the LarKC platform. The new release is a considerable improvement over the previous V2.0 edition, with the following distinctive features:</p>
<ul>
<li>V2.5 is fully compliant with the LarKC final architecture. You can now develop your workflows and plugins, and be assured that future updates won&#8217;t change the main APIs.</li>
<li>The Management Interface, which makes it possible to run LarKC from your browser, has an updated RESTful implementation. Besides RDF/XML, workflows can now be described in very readable N3 notation.</li>
<li>The endpoint for submitting queries to LarKC is now user-definable, and multiple endpoints are supported.</li>
<li>The Plug-in Registry has been improved, and is now coupled with the browser-based Management Interface</li>
<li>LarKC now uses a Maven-based build system, giving improved version and dependency management, and a simplified procedure for new plug-in creation</li>
<li>A number of extra tools have been introduced to make life for LarKC users a lot easier. Besides the Mangement Interface to run LarKC from your browser, V2.5 also contains:
<ul>
<li>A WYSIWIG Worfklow Designer tool that allows you to construct workflows by drag-and-drop, right from your browser: click on some plugins, drag them to the workspace, click to connect them, and press run! (see screenshot below).</li>
<li>An updated plug-in wizard for Eclipse.</li>
</ul>
</li>
<li>We have thouroughly updated the distributed execution framework. Besides  deploying LarKC plugins through Apache (simply by dropping them in your  Apache folder), it is now also possible to deploy plugins through JEE  (for webservers) or GAT (for clusters).</li>
<li>The WYSIWYG Workflow Designer allows you to specify remote execution of a plugin simply by connecting a plugin to a remote host. Templates are provided for such remote host declaration.</li>
<li>LarKC now takes care of advanced data caching for plug-ins</li>
<li>V2.5 comes with extended and improved JUnit tests</li>
<li>Last but not least, we have considerably improved documentation and user manuals, including a quick-start guide, tutorial materials and example workflows.</li>
</ul>
<p>The release can be downloaded from <a rel="nofollow" target="_blank" href="http://sourceforge.net/projects/larkc/files/Release-2.5/larkc-release-2.5.zip/download">http://sourceforge.net/projects/larkc/files/Release-2.5/larkc-release-2.5.zip/download</a><br />
The platform&#8217;s manual is available at <a rel="nofollow" target="_blank" href="http://sourceforge.net/projects/larkc/files/Release-2.5/LarKC_Platform_Manual_2.5.pdf/download">http://sourceforge.net/projects/larkc/files/Release-2.5/LarKC_Platform_Manual_2.5.pdf/download</a></p>
<p>Bugs can be submitted using the bug tracker at <a rel="nofollow" target="_blank" href="http://www.larkc.eu/bug-tracker/">http://www.larkc.eu/bug-tracker</a></p>
<p>As usual, you are encouraged to use the discussion forums and mailing lists served by the <a rel="nofollow" target="_blank" href="mailto:LarKC@SourceForge">LarKC@SourceForge</a> development environment.<br />
please see at <a rel="nofollow" target="_blank" href="http://larkc.sourceforge.net/">http://larkc.sourceforge.net/</a></p>
<p><img src="http://www.cs.vu.nl/~frankh/spool/LarKC/workflow-editor.png" alt="LarKC Workflow Editor" width="100%"/></p>]]></content:encoded>
         <category>Uncategorized</category>
      </item>
      <item>
         <title>Explosion under inference (or not)</title>
         <link>http://blog.larkc.eu/?p=2141</link>
         <description>Should the semantic web be just about querying RDF? Or is it usefual (or even: feasible) to use the semantics of RDF, RDF Schema and OWL to derive additional information from the published RDF graphs? Both the feasibility and the usefulness of this depends on the amount of additional triples that are derived by inference: [...]</description>
         <guid isPermaLink="false">http://blog.larkc.eu/?p=2141</guid>
         <pubDate>Sun, 15 May 2011 11:52:56 +0000</pubDate>
         <content:encoded><![CDATA[<p>Should the semantic web be just about querying RDF? Or is it usefual (or even: feasible) to use the semantics of RDF, RDF Schema and OWL to derive additional information from the published RDF graphs? Both the feasibility and the usefulness of this depends on the amount of additional triples that are derived by inference: when almost zero, there is little point to inference, when explosively large, it might become infeasible.</p>
<p>LarKC researchers at <a rel="nofollow" target="_blank" href="http://www.ontotext.com/">OntoText </a>produced an informative table showing the amount of additional triples that can be inferred from some of the most popular datasets on the Web. It&#8217;s interesting to see how the datasets differ in their semantic richness, with their ratio of explicit triples vs. inferred triples ranging from close to zero (<a rel="nofollow" target="_blank" href="http://en.wikipedia.org/wiki/The_World_Factbook" class="zem_slink" title="The World Factbook">CIA Factbook</a>) to a 16-fold increase (for <a rel="nofollow" target="_blank" href="http://dbpedia.org" class="zem_slink" title="DBpedia">DBPedia</a>). Please let us know if you have similar statistics for other datasets.</p>
<p>All of the data below taken from <a rel="nofollow" target="_blank" href="http://factforge.net/">FactForge </a>which by itself now contains 1.5billion triples, nearly four times larger than in the beginning of the LarKC project in 2008. All of the figures below obtained with BigOWLIM 3.4, under the OWL-Horst semantics. Size is reported in millions of triples.</p>
<table bgcolor="lightgrey" border="1">
<tr bgcolor="lightblue">
<th>Dataset</th>
<th>Explicit Indexed Triples</th>
<th>Inferred Indexed Triples</th>
<th>Total of Indexed Triples</th>
<th>Entities (nodes in the graph)</th>
<th>Inferred closure ratio</th>
</tr>
<tr>
<td>Schemata (Proton,<br />
SKOS, FOAF, RSS,<br />
DC) and ontologies<br />
(DBpedia, Geonames)</td>
<td>15</td>
<td>9</td>
<td>23</td>
<td>8</td>
<td>0.6</td>
</tr>
<tr>
<td>DBpedia (SKOS<br />
categories)</td>
<td>2,915</td>
<td>47,837</td>
<td>50,751</td>
<td>1,135</td>
<td>16.4</td>
</tr>
<tr>
<td>NY Times</td>
<td>574</td>
<td>328</td>
<td>902</td>
<td>185</td>
<td>0.6</td>
</tr>
<tr>
<td>UMBEL</td>
<td>4,638</td>
<td>6,936</td>
<td>11,575</td>
<td>1,190</td>
<td>1.5</td>
</tr>
<tr>
<td>Lingvoj</td>
<td>20</td>
<td>182</td>
<td>201</td>
<td>18</td>
<td>9.2</td>
</tr>
<tr>
<td>CIA Factbook</td>
<td>76</td>
<td>4</td>
<td>80</td>
<td>24</td>
<td>0.1</td>
</tr>
<tr>
<td>WordNet</td>
<td>1,943</td>
<td>6,067</td>
<td>8,010</td>
<td>842</td>
<td>3.1</td>
</tr>
<tr>
<td>Geonames</td>
<td>142,011</td>
<td>194,191</td>
<td>336,202</td>
<td>42,738</td>
<td>1.4</td>
</tr>
<tr>
<td>DBpedia core</td>
<td>825,162</td>
<td>166,740</td>
<td>991,902</td>
<td>125,803</td>
<td>0.2</td>
</tr>
<tr>
<td>Freebase</td>
<td>494,344</td>
<td>52,411</td>
<td>546,754</td>
<td>123,511</td>
<td>0.1</td>
</tr>
<tr>
<td>MusicBrainz</td>
<td>45,492</td>
<td>36,572</td>
<td>82,064</td>
<td>15,585</td>
<td>0.8</td>
</tr>
</table>
<h6 class="zemanta-related-title" style="font-size:1em;">Related articles</h6>
<ul class="zemanta-article-ul">
<li class="zemanta-article-ul-li"><a rel="nofollow" target="_blank" href="http://www.ontotext.com/owlim/big/">BigOWLIM - OWL Semantic Repository</a> (ontotext.com)</li>
</ul>
<p style="margin-top:10px;height:15px;" class="zemanta-pixie"><a rel="nofollow" target="_blank" href="http://www.zemanta.com/" class="zemanta-pixie-a" title="Enhanced by Zemanta"><img src="http://img.zemanta.com/zemified_e.png?x-id=7b9c6928-8d5b-447b-803d-54101a31dfa8" style="border:medium none;float:right;" class="zemanta-pixie-img" alt="Enhanced by Zemanta"/></a></p>]]></content:encoded>
      </item>
      <item>
         <title>The first LarKC Pharma Workshop in Stuttgart</title>
         <link>http://blog.larkc.eu/?p=2131</link>
         <description>By Bosse Andersson
The first LarKC Pharma workshop was held in Stuttgart April 19 and 20. An interesting mix of participants from pharmaceutical companies, semantic web companies and research/academia formed an open atmosphere with many intense discussions and hopefully future interactions. 
The workshop had an outline similar to previous LarKC tutorials with a twist from the [...]</description>
         <guid isPermaLink="false">http://blog.larkc.eu/?p=2131</guid>
         <pubDate>Mon, 02 May 2011 15:21:40 +0000</pubDate>
         <content:encoded><![CDATA[<p><font face="Calibri">By Bosse Andersson<br />
</font><font face="Calibri">The first <a rel="nofollow" target="_blank" href="http://wiki.larkc.eu/LarKC%20Pharma%20Workshop%20in%20Stuttgart">LarKC Pharma workshop </a>was held in Stuttgart April 19 and 20. An interesting mix of participants from pharmaceutical companies, semantic web companies and research/academia formed an open atmosphere with many intense discussions and hopefully future interactions. </font></p>
<p><font face="Calibri">The workshop had an outline similar to <a rel="nofollow" target="_blank" href="http://www.larkc.eu/early-adopters/">previous LarKC tutorials </a>with a twist from the pharma domain in presentations and examples. </font></p>
<p><font face="Calibri">Participants did find the LarKC platform and the <a rel="nofollow" target="_blank" href="http://linkedlifedata.com/sparql">Linked Life Data repository </a>useful;</font></p>
<ul>
<li><font face="Calibri">From pharma perspective questions circulated around what the requirements will be for us to host/use LarKC as an internal experimental platform. </font></li>
<li><font face="Calibri">The semantic web companies where more interested in how to use components of LarKC or provide services that can leverage from the LarKC platform. </font></li>
<li><font face="Calibri">The research/academia community had a specific need to learn how to quickly get LarKC up and running for the first iteration in the <a rel="nofollow" target="_blank" href="http://www.imi.europa.eu/">Innovative Medicine Initiative</a>, <a rel="nofollow" target="_blank" href="http://www.openphacts.org/">OpenPhacts</a>.</font></li>
</ul>
<p><font face="Calibri">Many questions did come up during lively discussions, some were answered others will be brought back to the consortium to address, e. g. how to lower the entrance to start using LarKC. </font></p>]]></content:encoded>
         <category>Dissemination</category>
      </item>
      <item>
         <title>LarKC in the World</title>
         <link>http://blog.larkc.eu/?p=2111</link>
         <description>Although LarKC is based in Europe, the project of building, and applying, web-scale reasoning is world wide. One of the most exciting things about living in a connected world, and a world of abundant, location independent computational resources, is that people anywhere in the world can do world class AI research, and develop applications based [...]</description>
         <guid isPermaLink="false">http://blog.larkc.eu/?p=2111</guid>
         <pubDate>Thu, 31 Mar 2011 12:30:37 +0000</pubDate>
         <content:encoded><![CDATA[<p>Although LarKC is based in Europe, the project of building, and applying, web-scale reasoning is world wide. One of the most exciting things about living in a connected world, and a world of abundant, location independent computational resources, is that people anywhere in the world can do world class AI research, and develop applications based on that research. The recent, and very rapid, increase in <a rel="nofollow" target="_blank" href="http://www.moreintelligentlife.co.uk/content/ideas/jm-ledgard/digital-africa">internet bandwidth going into Africa</a> means that one can now use <a rel="nofollow" target="_blank" href="http://www.shazam.com/">Shazam</a> to get impromptu karaoke lyrics for the Texas country-and-western playing in a hotel bar in Accra. It also means that previously isolated African researchers can make a full contribution to the advance of semantic technology.  In February, partially supported by the <a rel="nofollow" target="_blank" href="http://www.active-project.eu/">FP7 Active project</a>, we had the opportunity to present LarKC, and the potential benefits of AI and human-computer collaboration, to students and researchers at the<font> <strong><a rel="nofollow" target="_blank" href="http://en.wikipedia.org/wiki/Ghana-India_Kofi_Annan_Centre_of_Excellence_in_ICT">Ghana-India Kofi Annan Centre of Excellence in ICT</a></strong> in Ghana.</font> Discussion following the talks was lively, with great local ideas for the application of AI in knowledge capture from small farmers, and resource allocation for rural health care. Video from some talks is being made available on <a rel="nofollow" target="_blank" href="http://videolectures.net/">VideoLectures.net</a>, there was good coverage from the local media, and we look forward to building a collaboration with our new colleagues.<br />
<h6>Related articles</h6>
<ul>
<li><a rel="nofollow" target="_blank" href="http://macjordangh.wordpress.com/2011/03/10/ghanas-influential-women-celebrated-on-intl-womens-day/">Ghana&#8217;s Influential Women Celebrated on Int&#8217;l Women&#8217;s Day</a> (macjordangh.wordpress.com)</li>
</ul>
<p><a rel="nofollow" target="_blank" href="http://www.zemanta.com/" title="Enhanced by Zemanta"><img src="http://img.zemanta.com/zemified_e.png?x-id=be929a24-7571-46ed-93fe-30c159fad415" alt="Enhanced by Zemanta"/></a></p>]]></content:encoded>
      </item>
      <item>
         <title>Probase: a peek in Microsoft’s Web-of-Data kitchen</title>
         <link>http://blog.larkc.eu/?p=2101</link>
         <description>An interesting peek in Microsoft&amp;#8217;s kitchen (the Beijing labs, by the looks of it): Probase and ReadWriteWeb writeup on it. It&amp;#8217;s a very large web-fed knowledge-base, including concept hierarchies (2.7 million concepts, 4.5 million subclass relations, 16 million instances). Including all major knowledge sources (Freebase, WordNet, Cyc, DBPedia, Yago, a.o.), with pretty well researched quality measures. Unfortunately, none of the data [...]</description>
         <guid isPermaLink="false">http://blog.larkc.eu/?p=2101</guid>
         <pubDate>Tue, 22 Mar 2011 23:46:55 +0000</pubDate>
         <content:encoded><![CDATA[<p>An interesting peek in Microsoft&#8217;s kitchen (the Beijing labs, by the looks of it): <a rel="nofollow" target="_blank" href="http://research.microsoft.com/en-us/projects/probase/">Probase</a> and <a rel="nofollow" target="_blank" href="http://www.readwriteweb.com/cloud/2011/03/microsoft-research-watch-ai-nosql-big-data.php">ReadWriteWeb writeup</a> on it. It&#8217;s a very large web-fed knowledge-base, including concept hierarchies (2.7 million concepts, 4.5 million subclass relations, 16 million instances). Including all major knowledge sources (Freebase, WordNet, Cyc, DBPedia, Yago, a.o.), with pretty well researched <a rel="nofollow" target="_blank" href="http://haixun.olidu.com/probase/experiments.htm">quality measures</a>. Unfortunately, none of the data is Linked in any way, none of this available, let alone in some standard format.This is interestingly different from IBM&#8217;s Watson knowledge base. That is mostly filled with knowledge extracted from linguistic sources (although structured data does play a limited role). Probase seems to rely much more on structured knowledge sources.</p>]]></content:encoded>
      </item>
      <item>
         <title>LarKC platform v3.0 release</title>
         <link>http://www.larkc.eu/2011/larkc-platform-v3-0-release/</link>
         <description>The LarKC project&amp;#8217;s development team would like to announce a new release (v.3.0) of the LarKC platform, which is available for downloading here. The new release is a considerable improvement of the previous release (v.2.5), with the following distinctive features: PLATFORM New (plain) plug-in registry light-weight plug-in loading and thus very low platform&amp;#8217;s start-up time [...]</description>
         <guid isPermaLink="false">http://www.larkc.eu/?p=1135</guid>
         <pubDate>Thu, 06 Oct 2011 10:26:06 +0000</pubDate>
      </item>
      <item>
         <title>LarKC Workflow Challenge 2011</title>
         <link>http://www.larkc.eu/2011/larkc-workflow-challenge-2011/</link>
         <description>The LarKC consortium invites you to take part in the 2011 LarKC Workflow Challenge. LarKC (the large knowledge collider) is a free and open platform that makes it easy to produce scalable, semantic mashup, and to run them on both serial and parallel machines. Learning to use the platform is a great skill for getting [...]</description>
         <guid isPermaLink="false">http://www.larkc.eu/?p=1056</guid>
         <pubDate>Tue, 31 May 2011 17:05:03 +0000</pubDate>
      </item>
      <item>
         <title>Web of Data Interpreter – A LarKC Spin-Off</title>
         <link>http://www.larkc.eu/2011/web-of-data-interpreter-a-larkc-spin-off/</link>
         <description>Web of Data Interpreter (WoDI) is a recently launched spin-off company from the LarKC project, currently located in Innsbruck, Austria. The targeted development segment of WoDI is the implementation of intelligent tools and methods for accessing, reasoning and consuming linked data. The main areas of WoDI innovation are scalable reasoning with rules and streams of [...]</description>
         <guid isPermaLink="false">http://www.larkc.eu/?p=1038</guid>
         <pubDate>Mon, 21 Mar 2011 14:52:10 +0000</pubDate>
      </item>
      <item>
         <title>Scalable Integration and Processing of Linked Data @ WWW’11</title>
         <link>http://www.larkc.eu/2011/scalable-integration-and-processing-of-linked-data-www11/</link>
         <description>The LarKC team is proud to announce that its tutorial &amp;#8220;Scalable Integration and Processing of Linked Data&amp;#8221; was accepted at this year&amp;#8217;s International World Wide Web Conference 2011 (WWW&amp;#8217;11) that will take place from March 28th to April 1st, 2011 in Hyderabad, India. Abstract of the Tutorial The goal of this tutorial is to introduce, [...]</description>
         <guid isPermaLink="false">http://www.larkc.eu/?p=961</guid>
         <pubDate>Mon, 21 Feb 2011 11:27:57 +0000</pubDate>
      </item>
      <item>
         <title>LarKC Pharma Workshop</title>
         <link>http://www.larkc.eu/2011/larkc-pharma-workshop/</link>
         <description>Based on the great success of LarKC&amp;#8217;s Early Adopters Tutorials, the next workshop is targeted to drug development and discovery. The LarKC Pharma Workshop will take place on April 19th and 20th 2011 in Stuttgart. The workshop builds on previous tutorials and is customized for drug development/discovery participants. Having completed this workshop, participants will have [...]</description>
         <guid isPermaLink="false">http://www.larkc.eu/?p=959</guid>
         <pubDate>Wed, 16 Feb 2011 12:08:49 +0000</pubDate>
      </item>
      <item>
         <title>LarKC Platform v2.0 released</title>
         <link>http://www.larkc.eu/2011/larkc-platform-v2-0-released/</link>
         <description>We are glad to announce that the LarKC Platform Release v2.0 is now available in our repository on SourceForge. The redistributable package can be downloaded via the following URL: http://sourceforge.net/projects/larkc/files/Release-2.0/larkc-release-2.0.zip/download (OS independent) The source code belonging to this release can be checked out from SVN: http://larkc.svn.sourceforge.net/viewvc/larkc/branches/Release_2.0_prototype/platform/ A complete manual for both users and developers can [...]</description>
         <guid isPermaLink="false">http://www.larkc.eu/?p=912</guid>
         <pubDate>Mon, 03 Jan 2011 10:38:52 +0000</pubDate>
      </item>
      <item>
         <title>New version of mpiJava released</title>
         <link>http://www.larkc.eu/2010/new-version-of-mpijava-released/</link>
         <description>LarKC announces a new release of mpiJava (1.2.6) &amp;#8211; a Message-Passing Interface (MPI) library, allowing a Java application to efficiently run on a distributed, parallel, and high-performance computer architecture. First introduced in the HPJava project and developed by Pervasive Technology Labs, Indiana University, Syracuse University, and CSM, University of Portsmouth, mpiJava@SourceForge (http://sourceforge.net/projects/mpijava/) is now managed [...]</description>
         <guid isPermaLink="false">http://www.larkc.eu/?p=890</guid>
         <pubDate>Wed, 08 Dec 2010 08:28:25 +0000</pubDate>
      </item>
      <item>
         <title>4th Early Adopters Tutorial</title>
         <link>http://www.larkc.eu/2010/4th-early-adopters-tutorial/</link>
         <description>The fourth early adopters tutorial will be held in conjunction with next LarKC project meeting on the 13th November, 2010 in the Gongda Jianguo Hotel, Beijing University of Technology, Beijing, China. This tutorial will enable participants to the get access to early research results and technologies from the LarKC project, and will mainly focus on [...]</description>
         <guid isPermaLink="false">http://www.larkc.eu/?p=884</guid>
         <pubDate>Fri, 22 Oct 2010 09:25:47 +0000</pubDate>
      </item>
      <item>
         <title>The LarKC project movie</title>
         <link>http://www.larkc.eu/2010/the-larkc-project-movie/</link>
         <description>Watch the LarKC project movie and find out what it is all about!</description>
         <guid isPermaLink="false">http://www.larkc.eu/?p=869</guid>
         <pubDate>Thu, 30 Sep 2010 14:49:58 +0000</pubDate>
      </item>
      <item>
         <title>Talk at ESCoP Summer School in Computational and Mathematical Modeling of Cognition</title>
         <link>http://www.larkc.eu/2010/talk-at-escop-summer-school-in-computational-and-mathematical-modeling-of-cognition/</link>
         <description>Lael Schooler gave a talk on LarKC at &amp;#8220;European Society for Cognitive Psychology Summer School in Computational and Mathematical Modeling of Cognition&amp;#8221; in Mallnitz, Austria, 9-19 July 2010.</description>
         <guid isPermaLink="false">http://www.larkc.eu/?p=857</guid>
         <pubDate>Fri, 27 Aug 2010 07:44:41 +0000</pubDate>
      </item>
   </channel>
</rss>
<!-- fe4.yql.bf1.yahoo.com compressed/chunked Mon May 20 20:42:51 UTC 2013 -->
