50,391 research outputs found
Generalized Lineage-Aware Temporal Windows: Supporting Outer and Anti Joins in Temporal-Probabilistic Databases
The result of a temporal-probabilistic (TP) join with negation includes, at
each time point, the probability with which a tuple of a positive relation
matches none of the tuples in a negative relation , for a
given join condition . TP outer and anti joins thus resemble the
characteristics of relational outer and anti joins also in the case when there
exist time points at which input tuples from have non-zero
probabilities to be and input tuples from have non-zero
probabilities to be , respectively. For the computation of TP joins with
negation, we introduce generalized lineage-aware temporal windows, a mechanism
that binds an output interval to the lineages of all the matching valid tuples
of each input relation. We group the windows of two TP relations into three
disjoint sets based on the way attributes, lineage expressions and intervals
are produced. We compute all windows in an incremental manner, and we show that
pipelined computations allow for the direct integration of our approach into
PostgreSQL. We thereby alleviate the prevalent redundancies in the interval
computations of existing approaches, which is proven by an extensive
experimental evaluation with real-world datasets
Distributed Processing of Generalized Graph-Pattern Queries in SPARQL 1.1
We propose an efficient and scalable architecture for processing generalized
graph-pattern queries as they are specified by the current W3C recommendation
of the SPARQL 1.1 "Query Language" component. Specifically, the class of
queries we consider consists of sets of SPARQL triple patterns with labeled
property paths. From a relational perspective, this class resolves to
conjunctive queries of relational joins with additional graph-reachability
predicates. For the scalable, i.e., distributed, processing of this kind of
queries over very large RDF collections, we develop a suitable partitioning and
indexing scheme, which allows us to shard the RDF triples over an entire
cluster of compute nodes and to process an incoming SPARQL query over all of
the relevant graph partitions (and thus compute nodes) in parallel. Unlike most
prior works in this field, we specifically aim at the unified optimization and
distributed processing of queries consisting of both relational joins and
graph-reachability predicates. All communication among the compute nodes is
established via a proprietary, asynchronous communication protocol based on the
Message Passing Interface
On the theory of composition in physics
We develop a theory for describing composite objects in physics. These can be
static objects, such as tables, or things that happen in spacetime (such as a
region of spacetime with fields on it regarded as being composed of smaller
such regions joined together). We propose certain fundamental axioms which, it
seems, should be satisfied in any theory of composition. A key axiom is the
order independence axiom which says we can describe the composition of a
composite object in any order. Then we provide a notation for describing
composite objects that naturally leads to these axioms being satisfied. In any
given physical context we are interested in the value of certain properties for
the objects (such as whether the object is possible, what probability it has,
how wide it is, and so on). We associate a generalized state with an object.
This can be used to calculate the value of those properties we are interested
in for for this object. We then propose a certain principle, the composition
principle, which says that we can determine the generalized state of a
composite object from the generalized states for the components by means of a
calculation having the same structure as the description of the generalized
state. The composition principle provides a link between description and
prediction.Comment: 23 pages. To appear in a festschrift for Samson Abramsky edited by
Bob Coecke, Luke Ong, and Prakash Panangade
Cluster virial expansion for nuclear matter within a quasiparticle statistical approach
Correlations in interacting many-particle systems can lead to the formation
of clusters, in particular bound states and resonances. Systematic quantum
statistical approaches allow to combine the nuclear statistical equilibrium
description (law of mass action) with mean-field concepts. A chemical picture,
which treats the clusters as distinct entities, serves as an intuitive concept
to treat the low-density limit. Within a generalized Beth-Uhlenbeck approach,
the quasiparticle virial expansion is extended to include arbitrary clusters,
where special attention must be paid to avoid inconsistencies such as double
counting. Correlations are suppressed with increasing density due to Pauli
blocking. The contribution of the continuum to the virial coefficients can be
reduced by considering clusters explicitly and introducing quasiparticle
energies. The cluster-virial expansion for nuclear matter joins known
benchmarks at low densities with those near saturation density.Comment: 18 pages, 6 figures, 2 table
The connected Vietoris powerlocale
The connected Vietoris powerlocale is defined as a strong monad Vc on the category of locales. VcX is a sublocale of Johnstone's Vietoris powerlocale VX, a localic analogue of the Vietoris hyperspace, and its points correspond to the weakly semifitted sublocales of X that are “strongly connected”. A product map ×:VcX×VcY→Vc(X×Y) shows that the product of two strongly connected sublocales is strongly connected. If X is locally connected then VcX is overt. For the localic completion of a generalized metric space Y, the points of are certain Cauchy filters of formal balls for the finite power set with respect to a Vietoris metric. \ud
Application to the point-free real line gives a choice-free constructive version of the Intermediate Value Theorem and Rolle's Theorem. \ud
\ud
The work is topos-valid (assuming natural numbers object). Vc is a geometric constructio
- …