This paper describes the design and implementation of an oo-line, non-invasive, automated method for the examination and follow up of the arteriosclerotic changes due to hypertension, with the help of digital image processing of fundus images. This method would help in evaluating the eecacy of various treatments on the regression and reversion of arteriosclerotic lesions. This method, in intera...

It is well known that on classes of graphs of bounded tree-width, every monadic second-order property is decidable in polynomial time. The converse is not true without further assumptions. It follows from the work of Robertson and Seymour, that if a class of graphs K has unbounded tree-width and is closed under minors, then K contains all planar graphs. But on planar graphs, three-colorability ...

We deene process algebras with a generalised operation P for choice. For every innnite cardinal , we prove that the algebra of transition trees with branching degree < is free in the class of process algebras in which P is deened for all subsets with a cardinality <. We explain how the expressions of a fragment of the speciication language CRL may be used to denote elements of our process algeb...

The title compound, C(12)H(11)NO(4)S, is a Schiff base derived from the condensation reaction of equimolar quanti-ties of sulfamide and furfural. The mol-ecule has a trans configuration with respect to the imine C=N double bond. The N atom is involved in an inter-molecular O-H-N hydrogen bond.

We discuss the aximatic basis of quantum mechanics and show that it is neither general nor consistent, since it does not incorporate the magnetic quantization as in the cyclotron motion and the flux quantization. A general and consistent system of axioms is conjectured which incorporates also the magnetic quanti-zation.

This paper studies expressivity bounds for extensions of rst-order logic with counting and unary quanti ers in the presence of relations of large degree. There are several motivations for this work. First, it is known that rst-order logic with counting quanti ers captures uniform TC over ordered structures. Thus, proving expressivity bounds for rst-order with counting can be seen as an attempt ...

The high computational complexity of advanced reasoning tasks such as belief revision and planning calls for eecient and reliable algorithms for reasoning problems harder than NP. In this paper we propose Evaluate , an algorithm for evaluating Quantiied Boolean Formulae, a language that extends propositional logic in a way such that many advanced forms of propo-sitional reasoning, e.g., reasoni...

The ensemble Kalman lter (EnKF) provides an approximate, sequential Monte Carlo solution to the recursive data assimilation algorithm for hidden Markov chains. The challenging conditioning step is approximated by a linear updating, and the updating weights, termed Kalman weights, are inferred from the ensemble members. The EnKF scheme is known to provide unstable predictions and to underestimat...

In this paper we give a new algorithm for performing quantiier elimination from rst order formulae over real closed elds. This algorithm improves the complexity of the asymptotically fastest algorithm for this problem, known to this date. A new feature of our algorithm is that the role of the algebraic part (the dependence on the degrees of the input polynomials) and the combinatorial part (the...

In a companion paper [PT98], we introduced a local type inference method for inferring type arguments to polymorphic functions. We show here how our method can be extended to handle Cardelli and Wegner's Kernel Fun variant of F .