Named Graphs as a Mechanism for Reasoning About Provenance

Named Graphs is a simple, compatible extension to the RDF abstract syntax that enables statements to be made about RDF graphs. This approach is in contrast to earlier attempts such as RDF reification, or knowledge-base specific extensions including quads and contexts. In this paper we demonstrate the use of Named Graphs and our experiences developing new kinds of semantic web application that build on Named Graphs for digital signatures, provenance, and semantic reasoning. We present a working example based on the Named Graphs for Jena (NG4J) API, from which we developed a semantic version control system for Software Engineering capable of reasoning about Named Graph-based provenance. We go on to discuss the implications of Named Graphs for Description Logics and semantic inference strategies

Bubbles from Nothing

Within the framework of flux compactifications, we construct an instanton describing the quantum creation of an open universe from nothing. The solution has many features in common with the smooth 6d bubble of nothing solutions discussed recently, where the spacetime is described by a 4d compactification of a 6d Einstein-Maxwell theory on S^2 stabilized by flux. The four-dimensional description of this instanton reduces to that of Hawking and Turok. The choice of parameters uniquely determines all future evolution, which we additionally find to be stable against bubble of nothing instabilities.Comment: 19 pages, 6 figure

Decay of flux vacua to nothing

We construct instanton solutions describing the decay of flux compactifications of a $6d$ gauge theory by generalizing the Kaluza-Klein bubble of nothing. The surface of the bubble is described by a smooth magnetically charged solitonic brane whose asymptotic flux is precisely that responsible for stabilizing the 4d compactification. We describe several instances of bubble geometries for the various vacua occurring in a $6d$ Einstein-Maxwell theory namely, AdS_4 x S^2, R^{1,3} x S^2, and dS_4 x S^2. Unlike conventional solutions, the bubbles of nothing introduced here occur where a {\em two}-sphere compactification manifold homogeneously degenerates.Comment: 31 pages, 15 figure

Trusty URIs: Verifiable, Immutable, and Permanent Digital Artifacts for Linked Data

To make digital resources on the web verifiable, immutable, and permanent, we propose a technique to include cryptographic hash values in URIs. We call them trusty URIs and we show how they can be used for approaches like nanopublications to make not only specific resources but their entire reference trees verifiable. Digital artifacts can be identified not only on the byte level but on more abstract levels such as RDF graphs, which means that resources keep their hash values even when presented in a different format. Our approach sticks to the core principles of the web, namely openness and decentralized architecture, is fully compatible with existing standards and protocols, and can therefore be used right away. Evaluation of our reference implementations shows that these desired properties are indeed accomplished by our approach, and that it remains practical even for very large files.Comment: Small error corrected in the text (table data was correct) on page 13: "All average values are below 0.8s (0.03s for batch mode). Using Java in batch mode even requires only 1ms per file.

Agent inferencing meets the semantic web

We provide all agent; the capability to infer the relations (assertions) entailed by the rules that, describe the formal semantics of art RDFS knowledge-base. The proposed inferencing process formulates each semantic restriction as a rule implemented within a, SPARQL query statement. The process expands the original RDF graph into a fuller graph that. explicitly captures the rule's described semantics. The approach is currently being explored in order to support descriptions that follow the generic Semantic Web Rule Language. An experiment, using the Fire-Brigade domain, a small-scale knowledge-base, is adopted to illustrate the agent modeling method and the inferencing process

Dynamic Provenance for SPARQL Update

While the Semantic Web currently can exhibit provenance information by using the W3C PROV standards, there is a "missing link" in connecting PROV to storing and querying for dynamic changes to RDF graphs using SPARQL. Solving this problem would be required for such clear use-cases as the creation of version control systems for RDF. While some provenance models and annotation techniques for storing and querying provenance data originally developed with databases or workflows in mind transfer readily to RDF and SPARQL, these techniques do not readily adapt to describing changes in dynamic RDF datasets over time. In this paper we explore how to adapt the dynamic copy-paste provenance model of Buneman et al. [2] to RDF datasets that change over time in response to SPARQL updates, how to represent the resulting provenance records themselves as RDF in a manner compatible with W3C PROV, and how the provenance information can be defined by reinterpreting SPARQL updates. The primary contribution of this paper is a semantic framework that enables the semantics of SPARQL Update to be used as the basis for a 'cut-and-paste' provenance model in a principled manner.Comment: Pre-publication version of ISWC 2014 pape

Quintessence and tachyon dark energy models with a constant equation of state parameter

In this work we determine the correspondence between quintessence and tachyon dark energy models with a constant dark energy equation of state parameter, $w_e$. Although the evolution of both the Hubble parameter and the scalar field potential with redshift is the same, we show that the evolution of quintessence/tachyon scalar fields with redshift is, in general, very different. We explicity demonstrate that if $w_e \neq -1$ the potentials need to be very fine-tuned for the relative perturbation on the equation of state parameter, $\Delta w_e/(1+w_e) \ll 1$, to be very small around the present time. We also discuss possible implications of our results for the reconstruction of the evolution of $w_e$ with redshift using varying couplings.Comment: 9 pages, 2 figures, published version with two extra references include

Provenance explorer: Customized provenance views using semantic inferencing

This paper presents Provenance Explorer, a secure provenance visualization tool, designed to dynamically generate customized views of scientific data provenance that depend on the viewer's requirements and/or access privileges. Using RDF and graph visualizations, it enables scientists to view the data, states and events associated with a scientific workflow in order to understand the scientific methodology and validate the results. Initially the Provenance Explorer presents a simple, coarse-grained view of the scientific process or experiment. However the GUI allows permitted users to expand links between nodes (input states, events and output states) to reveal more fine-grained information about particular sub-events and their inputs and outputs. Access control is implemented using Shibboleth to identify and authenticate users and XACML to define access control policies. The system also provides a platform for publishing scientific results. It enables users to select particular nodes within the visualized workflow and drag-and-drop them into an RDF package for publication or e-learning. The direct relationships between the individual components selected for such packages are inferred by the rule-inference engine