Matches in ScholarlyData for { ?s ?p ?o. }
- item-5 next item-6.
- item-5 previous item-4.
- item-6 type ListItem.
- item-6 hasContent brian-elves%C3%A6ter.
- item-6 next item-7.
- item-6 previous item-5.
- item-7 type ListItem.
- item-7 hasContent arnej-berre.
- item-7 next item-8.
- item-7 previous item-6.
- item-8 type ListItem.
- item-8 hasContent xianglin-ye.
- item-8 next item-9.
- item-8 previous item-7.
- item-9 type ListItem.
- item-9 hasContent alex-simov.
- item-9 previous item-8.
- 54 creator andreas-both.
- 54 creator christoph-lange.
- 54 creator dennis-diefenbach.
- 54 creator didier-cherix.
- 54 creator kuldeep-singh.
- 54 creator saedeeh-shekarpour.
- 54 type InProceedings.
- 54 label "Qanary-the Fast Track to Create a Question Answering System with Linked Data Technology".
- 54 sameAs 54.
- 54 abstract "Question answering (QA) systems focus at making sense out of data via a easy-to-use interface.However, these systems are very complex and integrate a lot of technology tightly.Previously presented QA systems are mostly singular and monolithic implementations.Hence, the reusability is limited. In contraction we follow the research agenda of establishing an ecosystem for components of QA systems which will enable the QA community to elevate reusability of such components and to intensify the research activities. In this paper, we present a reference implementation of the Qanary methodology for creating QA systems. Qanary is a vocabulary-driven approach built on top of linked data technology. Here, we present a fast-track approach following a light-weight, message-driven, component-oriented architecture. Hence, researchers will be enabled to establish new research ideas which will increase the efficiency and boost the research activities in the field of question answering.".
- 54 hasAuthorList authorList.
- 54 isPartOf proceedings.
- 54 title "Qanary-the Fast Track to Create a Question Answering System with Linked Data Technology".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasItem item-5.
- authorList hasItem item-6.
- authorList hasLastItem item-6.
- item-1 type ListItem.
- item-1 hasContent kuldeep-singh.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent andreas-both.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent dennis-diefenbach.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent saedeeh-shekarpour.
- item-4 next item-5.
- item-4 previous item-3.
- item-5 type ListItem.
- item-5 hasContent didier-cherix.
- item-5 next item-6.
- item-5 previous item-4.
- item-6 type ListItem.
- item-6 hasContent christoph-lange.
- item-6 previous item-5.
- 56 creator blake-regalia.
- 56 creator krzysztof-janowicz.
- 56 type InProceedings.
- 56 label "Computing Linked Data On-demand Using the VOLT Proxy".
- 56 sameAs 56.
- 56 abstract "The Linked Data paradigm has changed how data on the Web is published, retrieved, and interlinked, thereby enabling modern question answering systems and contributing to the spread of open data. With the increasing size, interlinkage, and complexity of the Linked Data cloud, the focus is now shifting towards strategies and technologies to en- sure that Linked Data can also succeed as an infrastructure. This raises questions about the sustainability of query endpoints, the reproducibility of scientific experiments conducted using Linked Data, the lack of established quality metrics, as well as the need for improved ontology alignment and query federation techniques. One core issue that needs to be addressed is the trade-off between storing data and computing them on-demand. Data that is derived from already stored data, changes frequently in space and time, or is the output of some workflow, should be computed. However, such functionality is not readily available on the Linked Data cloud today. To address this issue, we have developed a transparent SPARQL proxy that enables the on-demand computation of Linked Data together with the provenance information required to understand how the data were derived. Here, we demonstrate how the proxy works under the hood by applying it to the computation of cardinal directions between geographic features in DBpedia.".
- 56 hasAuthorList authorList.
- 56 isPartOf proceedings.
- 56 title "Computing Linked Data On-demand Using the VOLT Proxy".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasLastItem item-2.
- item-1 type ListItem.
- item-1 hasContent blake-regalia.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent krzysztof-janowicz.
- item-2 previous item-1.
- 57 creator albert-merono-penuela.
- 57 creator rinke-hoekstra.
- 57 type InProceedings.
- 57 label "The Song Remains The Same: Lossless Conversion and Streaming of MIDI to RDF and Back".
- 57 sameAs 57.
- 57 abstract "In this demo, we stretch the capabilities of RDF as a metadata representation format, and we use it to encode digital music. Digital music is broadly used today in many professional music production environments. For decades, MIDI (Musical Instrument Digital Interface) has been the standard for digital music exchange between musicians and devices, albeit not in a Web friendly way. Here, we show the potential of expressing digital music as Linked Data, using our midi2rdf suite of tools to convert and stream digital music in MIDI format to RDF. The conversion allows for lossless round tripping: we can reconstruct a MIDI file identical to the original using its RDF representation. The streaming uses a novel generative audio matching algorithm that enables us to broadcast, with very low latency, RDF triples describing MIDI events coming from arbitrary analog instruments.".
- 57 hasAuthorList authorList.
- 57 isPartOf proceedings.
- 57 title "The Song Remains The Same: Lossless Conversion and Streaming of MIDI to RDF and Back".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasLastItem item-2.
- item-1 type ListItem.
- item-1 hasContent albert-merono-penuela.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent rinke-hoekstra.