Fast and parallel decomposition of constraint satisfaction problems.

Constraint Satisfaction Problems (CSP) are notoriously hard. Consequently, powerful decomposition methods have been developed to overcome this complexity. However, this poses the challenge of actually computing such a decomposition for a given CSP instance, and previous algorithms have shown their limitations in doing so.

Limits of Schema Mappings.

Schema mappings have been extensively studied in the context of data exchange and data integration, where they have turned out to be the right level of abstraction for formalizing data inter-operability tasks. Up to now and for the most part, schema mappings have been studied as static objects, in the sense that each time the focus has been on a single schema mapping of interest or, in the case of composition, on a pair of schema mappings of interest. In this paper, we adopt a dynamic viewpoint and embark on a study of sequences of schema mappings and of the limiting behavior of such sequences.

Use of a 3D laser scan technique to compare the surface geometry of the medial coronoid process in dogs affected with medial compartment disease with unaffected controls.

Subchondral bone surface geometry of the medial coronoid process was examined in 20 grossly normal elbow joints of adult German Shepherd dogs (GSDs) and compared with results obtained from 10 joints of adult GSDs and 12 joints of adult Rottweilers affected with bilateral fragmentation of the medial coronoid process (FMCP). Additionally, seven dogs (4 GSDs and 3 Rottweilers) with unilateral FMCP were investigated. The subchondral contour of the ulnar trochlear notch was digitised to obtain the 3D coordinates of its surface points.