Writing an application that offers eye tracking support for a common social media platform was the goal of the research lab “Eye-tracking” (WS 15/16). The platform of choice was Twitter and this talk will introduce the application “GazeTheWeb – Tweet” with its functionalities as well as the evaluation to evaluate the usability of proposed system
Participants: Svenja Neuneier, Dennis Hahn, Caterine Ospina Ocampo, Sergei Diez, Saskia Handabura, Kim Ballmes, Wojciech Kwasnik, Benjamin Stephan, Eike Idczak, Matthias Barde, Annika Wießgügel, Philipp Weber
In this talk, I present recent results on the measurement of conflict in signed social network. A signed social network is a network in which both positive and negative ties are present, for instance representing friendship and enmity, or trust and distrust.
Recent research attributes an increasing importance to firm-sponsored developers active in open source software (OSS) projects. Although the research field around OSS developers is not entirely new we have little knowledge about how firm-sponsored developers may be different in some aspects from their peers contributing to an OSS project in their leisure time.
A problem in the Linker Open Data domain is that of incomplete schema specifications. Data sources do not all publish or refer to schemas capturing the whole of their data completely. Many approaches have been proposed for alleviating this issue.
In geographic information systems (GIS), heterogenous data can be seen as amajor obstacle for a project-oriented integration. Usually data has to be inte-grated into a single system and conversion mechanisms have to be implemented.
Linked Open Data (LOD) is public data, which is published and interconnected with the Resource Description Framework (RDF) on the web. The size and interconnection of the data within the LOD cloud makes it hard to grasp all the information that is explicitly and implicitly available.
We survey a selection of inconsistency measures from the literature and investigate their computational complexity wrt. decision problems related to bounds on the inconsistency value and the functional problem of determining the actual value.
Linked Open Data can be a treasure chest for data scientists with plenty of data sources from different domains. Most of the time however, it feels more like a dusty desert, where you have to investigate multiple treasure chambers in search of something valuable. In this scenario, wouldn't it be useful to have a guide that can point you where to look?
Despite a number of frameworks, programming with Description Logics is still challenging in unique ways. Part of the problem are static type systems, that are supposed to prevent runtime errors.
In distributed RDF stores, the stored graph is partitioned and each partition is stored on a computer. While querying this distributed graph, the information stored in one partition might not be enough to produce the requested answer.