We present an algorithm for the two-dimensional translational containment problem: nd translations for k polygons (with up to m vertices each) which place them inside a polygonal container (with n vertices) without overlapping. The polygons and container may be nonconvex. The containment algorithm consists of new algorithms for restriction, evaluation, and subdivision of two-dimensional conngur...

Aggregation and containment are important concepts in object-oriented modeling. In componentbased approaches to software development, aggregation and containment are touted as one of the primary mechanisms for component reuse. Containment relationships are typically implemented with object references in most object-oriented programming languages. This encourages sharing of component objects bet...

We study the problem of determining whether a query is contained in another when queries can carry along annotations from source data. We say that a query is annotation-contained in another if the annotated output of the former is contained in the latter on every possible annotated input databases. We study the relationship between query containment and annotation-containment and show that anno...

In the thesis, we study ergodicity of adaptive Markov Chain Monte Carlo methods (MCMC) based on two conditions (Diminishing Adaptation and Containment which together imply ergodicity), explain the advantages of adaptive MCMC, and apply the theoretical result for some applications. First we show several facts: 1. Diminishing Adaptation alone may not guarantee ergodicity; 2. Containment is not ne...

Recent infant cognition research suggests that core knowledge involves event-type representations: During perception, the mind automatically categorizes physical events into broad types (e.g., occlusion and containment), which then guide attention to different properties (e.g., with width processed at a younger age than height in containment events but not occlusion events). We tested whether t...

Tree patterns (TP) is a simple and widely used fragment of XPath. The problem of containment in TP has been extensively studied previously. It was shown that the containment problem ranges from PTime to PSpace depending on the available constructs. In this paper we study the complexity of the containment problem for tree patterns with attribute value comparisons. We show that the complexity ran...

Our goal is to study type containment, some variations on the type-containment relation, and how it can be extended to other programming language features such as products, side effects, existential types. We will study some language meta-theoretical properties. Notre but est d’étudier le type containment, quelques variantes sur la relation de type containment, et comment elle peut être étendue...

This paper applies Reckless’ theory of containment to the problem of unethical business decision making. Containment theory asserts that deviance will occur when controls are weakened to the point of being insufficient to contain motivated behavior in the presence of an unethical opportunity. The theory accounts for the presence of inner controls and outer controls, as well as factors that push...