The study of pattern containment and avoidance for linear permutations is a well-established area enumerative combinatorics. A cyclic permutation the set all rotations permutation. Vella Callan independently initiated in characterized classes single length 4. We continue this work. In particular, we derive results about multiple patterns 4, determine generating functions descent statistic on th...

This paper reports the findings of a qualitative study undertaken at Smurfit Kappa Kraftliner. Based on Giddens (1990) and Beck (1999) we examined strategies for risk handling in connection to industrial IT. We found two pervasive problems where, paradoxically, the approaches to risk containment resulted in risk diffusion, rather than containment of risk, throughout the plant.

The Point Containment predicate which specifies if a point is part of a mathematically defined shape or not is one of the most basic notions in raster graphics. This paper presents a technique to counteract the main disadvantage of Point Containment algorithms: their quadratic time complexity with increasing resolution. The implemented algorithm handles complex geometries such as self-intersect...

In 1977, R. B. Angell presented a logic for analytic containment, a notion of “relevant” implication stronger than Anderson and Belnap’s entailment. In this paper I provide for the first time the logic of first degree analytic containment, as presented in [2] and [3], with a semantical characterization—leaving higher degree systems for future investigations. The semantical framework I introduce...

In this paper we present a natural and simple procedure to compute all feasible allocation points of a (non-convex) polygon within a (non-convex) polygonal bounded region. This procedure can be seen as a basis of more sophisticated and efficient algorithms for the same task, or for related problems such as finding a single placement point.

We consider the problems of conjunctive query containment and minimization, which are known to be NP-complete, and show that these problems can be solved in polynomial time for the class of acyclic queries. We then generalize the notion of acyclicity and deene a parameter called query width that captures the \degree of cyclicity" of a query: in particular, a query is acyclic if and only if its ...