Hierarchical radiosity is a very demanding process in terms of computation time and memory ressources even for scenes of moderate complexity. To handle complex environments, not tting in memory, new solutions have to be devised. One solution is to partition the scene into subsets of polygons (3D cells or clusters) and to maintain in memory only some of them. The radiosity computation is perform...

The solution of a two dimensional di usion problem with discontinuous coefcients is analyzed on a particular two-regions domain. The solution is shown to contain a singular part, and the particular behavior is quantitatively evaluated. It is well kown that the degree of regularity of the solution for such problem determines the accuracy of the numerical techniques used to approximate the soluti...

Hierarchical radiosity is a very demanding process in terms of computation time and memory ressources even for scenes of moderate complexity. To handle complex environments, not tting in memory, new solutions have to be devised. One solution is to partition the scene into subsets of polygons (3D cells or clusters) and to maintain in memory only some of them. The radiosity computation is perform...

Let X, X i , i∈N, be independent identically distributed random variables and let h(x,y)= h(y,x) be a measurable function of two variables. It is shown that the bounded law of the iterated logarithm, lim sup n (n log log n) −1 1≤i<j≤n h(X i ,X j) <∞ a.s., holds if and only if the following three conditions are satisfied: h is canonical for the law of X (that is, Eh(X,y)=0 for almost all y) and ...

We construct Markov chain algorithms for sampling from discrete exponential families conditional on a sufticient statistic. Examples include contingency tables, logistic regression, and spectral analysis of permutation data. The algorithms involve computations in polynomial rings using Grobner bases. 1. Introduction. This paper describes new algorithms for sampling from the conditional distribu...

This paper is a follow-up on previous work by the author on subtyping with (set-theoretic) union, intersection and recursive types. Previously, it was shown how types may be encoded as regular tree expressions/set constraints. This gave rise to a sound and complete decision procedure for type inclusion. The result was, however, limited to a rather speciic type language. In the work reported on ...

Chronic venous disease (CVD) is the most prevalent form of vascular disease, affecting about a third of adult Americans. Most patients present with varicose veins but swelling and skin damage are common as well. The signs and symptoms of CVD are result of venous hypertension that develops from reflux, obstruction or a combination of both. In patients with CVD, around 70-80% will have superficia...

This paper proposes a design methodology for the semi-automatic derivation of hardware dedicated to a generic class of image analysis reconstruction problems. The study will focus on the implications on the harware of the associated estimation algorithm and of the built-in underlying minimization. A speciic minimization strategy has been designed with a view to improving the eeciency of special...

The eecient vlsi implementation of arithmetics operators requires that design be optimized, both by looking for eecient algorithms, and by producing compact regular layouts. We present AlpHard, a subset of Alpha { a language for the synthesis of regular algorithms. AlpHard is intended for specifying the Register Transfer Level (RTL) representation of an architecture, in such a way that any regu...

Aim: To evaluate the histological changes and immune response of conjuctiva in patients (pts) with lo S.S. Materials and Methods: We studied conjunctiial biopsies from 15 pts with I0 S.S. and 2 normal controls using 1) paraflfn section screening for the quality of conjunctival epithelium (CE), the number of goblet cells (GC) and the degree of inflammation, 2) Mo-abs and Pabs to: Tlymphocytes, T...