A novel method based on shape morphing is proposed for 2D shape recognition. In this framework, the shape of objects is described by using their contour. Shape recognition involves a morph between the contours of the objects being compared. The morph is quanti"ed by using a physics-based formulation. This quanti"cation is used as a dissimilarity measure to "nd the reference shape most similar t...

We a¢ rm a conjecture of Sacks [1972] by showing that every countable distributive lattice is isomorphic to an initial segment of the hyperdegrees, Dh. In fact, we prove that every sublattice of any hyperarithmetic lattice (and so, in particular, every countable locally …nite lattice) is isomorphic to an initial segment of Dh. Corollaries include the decidability of the two quanti…er theory of ...

In this thesis, a new methodology for flutter boundary prediction using experimental data is developed. Due to the complexity of the aircraft's structure and aerodynamics, it appeared necessary to rely on a simplified wing model to create a low order state space representation that would capture all the essential dynamics of a flutter problem. The methodology is the following: first, a low orde...

When there is interest to study n chemicals using x dose levels each, factorial designs that require x(n) treatment groups have been put forward as one of the valuable statistical approaches for hazard assessment of chemical mixtures. Exemplary applications and cost-efficiency comparisons of full factorial designs and regular fractional factorial designs in toxicity studies can be found in Nesn...

Structural matching originally introduced by Steven Vere in the mid seventies was a popular sub eld of inductive concept learning in the late seventies and early eighties Despite various attempts to formalize and implement the notion of most speci c generalisation of two productions several problems remained These include using background knowledge the non uniqueness of most speci c generalisat...

Many type inference and program analysis systems include notions of subtyping and parametric polymorphism. When used together, these two features induce equivalences that allow types to be simpli ed by eliminating quanti ed variables. Eliminating variables both improves the readability of types and the performance of algorithms whose complexity depends on the number of type variables. We presen...

We formulate a dynamic framework for an individual decisionmaker within which discovery of previously unconsidered propositions is possible. Using a game-theoretic representation of the state space as a tree structure generated by the actions of agents (including acts of nature), we show how the existence of unconsidered propositions can be represented by a coarsening of the state space. Furthe...

It is clearly desirable that logical speci cations and the programs that implement them should be as close as possible. Such a claim is often made in support of the logic programming paradigm. However, SLD-resolution, the basic procedural semantics for logic programming, is only de ned for programs whose statements are Horn clauses. Most research for extending the Horn clause framework has been...