The problem of SPARQL query containment is defined as determining if the result of one query is included in the result of another for any RDF graph. Query containment is important in many areas, including information integration, query optimization, and reasoning about Entity-Relationship diagrams. We encode this problem into an expressive logic called μ-calculus: where RDF graphs become transi...

Acute mental disorder necessitating admission to hospital is often accompanied by disturbed behaviour that threatens the health of the person concerned or that of those around them. A range of containment methods are used by psychiatric professionals to keep patients and staff safe. These strategies are strongly emotive and attract strong moral valuations, yet differ sharply between countries. ...

Access limitations may occur when querying data sources over the web or heterogeneous data sources presented as relational tables: this happens, for instance, in Data Exchange and Integration, Data Warehousing, and Web Information Systems. Access limitations force certain attributes to be selected in order to access the tables. It is known that evaluating a conjunctive query under such access r...

A significant amount of spatial information in textual documents is hidden within the relationship between events. While humans have an intuitive understanding of these relationships that allow us to recover an object’s or event’s location, currently no annotated data exists to allow automatic discovery of spatial containment relations between events. We present our process for building such a ...

Researchers sought to estimate the costs of different types of conflict and containment in the United Kingdom using events from 136 adult acute inpatient psychiatric wards in the United Kingdom and unit costs from a sample of 15 wards. Researchers study sought to obtain and observe actual staff time managing conflict and containment by means of a new method of estimating costs arising from the ...

We present three diierent methods for nding solutions to the 2D translation-only containment problem: nd translations for k polygons that place them inside a given polygonal container without overlap. Both the container and the polygons to be placed in it may be nonconvex. First, we provide several exact algorithms that improve results for k = 2 or k = 3. In particular, we give an algorithm for...

Let K and L be compact convex sets in Rn. The following two statements are shown to be equivalent: (i) For every polytope Q ⊆ K having at most n+ 1 vertices, L contains a translate of Q. (ii) L contains a translate of K. Let 1 ≤ d ≤ n − 1. It is also shown that the following two statements are equivalent: (i) For every polytope Q ⊆ K having at most d+ 1 vertices, L contains a translate of Q. (i...