{"id":48,"date":"2016-02-09T09:44:38","date_gmt":"2016-02-09T08:44:38","guid":{"rendered":"https:\/\/www.kde.cs.uni-kassel.de\/?page_id=48"},"modified":"2024-06-11T08:33:45","modified_gmt":"2024-06-11T06:33:45","slug":"code","status":"publish","type":"page","link":"https:\/\/www.kde.cs.uni-kassel.de\/en\/code","title":{"rendered":"Source Code"},"content":{"rendered":"<p>On this page we provide the source code for some of our projects and algorithms. Please have a look at the corresponding paper for further details. We can not provide support for the source code.<\/p>\n<dl>\n<dt>BibSonomy<\/dt>\n<dd>Some of the modules which <a href=\"http:\/\/www.bibsonomy.org\/\"><u><span style=\"color: #0066cc\">BibSonomy<\/span><\/u><\/a> is based on are available in a <a href=\"http:\/\/dev.bibsonomy.org\/\"><u><span style=\"color: #0066cc\">Maven repository<\/span><\/u><\/a>. There is also a <a href=\"https:\/\/gforge.cs.uni-kassel.de\/projects\/bibsonomy2\"><u><span style=\"color: #0066cc\">project page<\/span><\/u><\/a> which contains an <a href=\"https:\/\/gforge.cs.uni-kassel.de\/tracker\/?atid=480&amp;group_id=52&amp;func=browse\"><u><span style=\"color: #0066cc\">issue tracker<\/span><\/u><\/a>.<\/dd>\n<p><!-- gel\u00f6scht 11.6.2024\n\n\n<dt>FolkRank<\/dt>\n\n\n\n\n<dd>FolkRank is an algorithm for <a href=\"http:\/\/www.bibsonomy.org\/bibtex\/23c301945817681d637ee43901c016939\/jaeschke\"><u><span style=\"color: #0066cc\">search and ranking<\/span><\/u><\/a> in collaborative tagging systems. It has been integrated into the community support architecture of the social semantic desktop developed by the <a href=\"http:\/\/nepomuk.semanticdesktop.org\/xwiki\/bin\/view\/Main1\/\"><u><span style=\"color: #0066cc\">NEPOMUK project<\/span><\/u><\/a>. The source code is available from the project's <a href=\"http:\/\/dev.nepomuk.semanticdesktop.org\/repos\/trunk\/java\/org.semanticdesktop.nepomuk.comp.folkpeer\/src\/org\/semanticdesktop\/nepomuk\/comp\/folkpeer\/folkrank\/\"><u><span style=\"color: #0066cc\">SVN repository<\/span><\/u><\/a>.<\/dd>\n\n--><\/p>\n<dt>Trias<\/dt>\n<dd><a href=\"http:\/\/www.bibsonomy.org\/bibtex\/218e8babe208fae2c0342438617b0ec31\/jaeschke\"><u><span style=\"color: #0066cc\">Trias<\/span><\/u><\/a> is an algorithm for computing triadic concepts which fulfill minimal support constraints. The source code is available on the <a href=\"https:\/\/github.com\/rjoberon\/trias-algorithm\"><u><span style=\"color: #0066cc\">project page<\/span><\/u><\/a>.<\/dd>\n<p><!-- gel\u00f6scht 11.6.2024\n\n\n<dt>Ubicon<\/dt>\n\n\n\n\n<dd>Ubicon is a platform for ubiquitous and social networking. The system provides several applications organized in different event categories. The source code is available on the <a href=\"https:\/\/bitbucket.org\/ubicon\/ubicon\">project page<\/a>.<\/dd>\n\n\n\n\n<dt>WideNoise Plus for Android<\/dt>\n\n\n\n\n<dd>WideNoise Plus samples decibel noise levels, and displays them on a worldwide interactive map.\nThe source code is available on the <a href=\"https:\/\/bitbucket.org\/ubicon\/widenoise-plus-for-android\">project page<\/a>.<\/dd>\n\n--><\/p>\n<\/dl>\n","protected":false},"excerpt":{"rendered":"<p>On this page we provide the source code for some of our projects and algorithms. Please have a look at the corresponding paper for further details. We can not provide support for the source code.<a class=\"moretag\" href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/code\"> Read more&hellip;<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":41,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-48","page","type-page","status-publish","hentry"],"translation":{"provider":"WPGlobus","version":"3.0.2","language":"en","enabled_languages":["de","en"],"languages":{"de":{"title":true,"content":true,"excerpt":false},"en":{"title":false,"content":false,"excerpt":false}}},"_links":{"self":[{"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/pages\/48","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/comments?post=48"}],"version-history":[{"count":12,"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/pages\/48\/revisions"}],"predecessor-version":[{"id":9749,"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/pages\/48\/revisions\/9749"}],"wp:attachment":[{"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/media?parent=48"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}