Data exchange

Related publications (9)

ms3: A parser for MuseScore files, serving as data factory for annotated music corpora

Martin Alois Rohrmeier, Johannes Hentschel

The Python library ms3 makes scores (symbolic representations of music) operational for computational approaches by representing their contents as sets of tabular files. Music scores represent relations between sounding events by graphical means. The Free ...

2023

MARKDOWN

Nicolas Borboën

Français: Markdown est un langage de balisage léger qui permet d’écrire simplement du texte et de le convertir en code HTML pour sa publication sur un site web. Facile à lire, facile à écrire. English: Markdown is a small markup language that allows you to ...

2013

Completeness and Ambiguity of Schema Cover

Karl Aberer, Quoc Viet Hung Nguyen, Zoltán Miklós

Given a schema and a set of concepts, representative of entities in the domain of discourse, schema cover deﬁnes correspondences between concepts and parts of the schema. Schema cover aims at interpreting the schema in terms of concepts and thus, vastly si ...

2013

On Leveraging Crowdsourcing Techniques for Schema Matching Networks

Karl Aberer, Quoc Viet Hung Nguyen, Thành Tâm Nguyên, Zoltán Miklós

As the volumes of shared datasets are likely to soar, there is high demand of establishing the interlinking between these public datasets. To achieve this, we need to match their schemas altogether. Moreover, to extract useful pieces of information, ones m ...

2013

ChemCalc: a building block for tomorrow’s chemical infrastructure

Alain Borel, Luc Patiny

Web services, as an aspect of cloud computing, are becoming an important part of the general IT infrastructure, and scientific computing is no exception to this trend. We propose a simple approach to develop chemical web services, through which servers cou ...

2013

Query-driven indexing in large-scale distributed systems

Gleb Skobeltsyn

Efficient and effective search in large-scale data repositories requires complex indexing solutions deployed on a large number of servers. Web search engines such as Google and Yahoo! already rely upon complex systems to be able to return relevant query re ...

EPFL2009

Efficient static analysis of XML paths and types

We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically type-check XPath queries. To this end, we prove the decidability of a logic with converse for finite ordered trees whose time comple ...

2007

Efficient processing of XPath queries with structured overlay networks

Karl Aberer, Manfred Hauswirth, Gleb Skobeltsyn

Non-trivial search predicates beyond mere equality are at the current focus of P2P research. Structured queries, as an important type of non-trivial search, have been studied extensively mainly for unstructured P2P systems so far. As unstructured P2P syste ...

Springer Verlag2005

Schema matching for structured document transformations

Aïda Boukottaya

This dissertation studies structured document content reuse problem. In structured document content reuse, a document (or a part of document) structured under one schema must be restructured and translated into an instance of a different schema. Thus, a no ...

EPFL2004