State of the art multiresolution modeling allows to selectively refine a coarse mesh of an object on the visually important parts. In this way it is possible to render the geometry of a given object accurately with a minimum number of triangles. There are also approaches that use cones of normal vectors to perform illumination dependent selective refinement. This includes the correct rendering ...

We present our ongoing work on an approach to create Model-Driven Software Product Lines by means of successive model refinement, guided by configuration of features. Each refinement uses model-to-model transformation until arriving at the executable code with technological platform details included. During this process, users select features at each stage taking into account their preferences ...

A multiresolution-based adaptation concept is proposed that aims at accelerating Discontinuous Galerkin schemes applied to nonlinear hyperbolic conservation laws. Opposite to standard adaptation concepts no error estimates are needed to tag mesh elements for refinement. Instead of this, a multiresolution analysis is performed on a hierarchy of nested grids for the data given on a uniformly refi...

ReFOLD is a novel hybrid refinement server with integrated high performance global and local Accuracy Self Estimates (ASEs). The server attempts to identify and to fix likely errors in user supplied 3D models of proteins via successive rounds of refinement. The server is unique in providing output for multiple alternative refined models in a way that allows users to quickly visualize the key re...

Relative correctness is the property of a program to be more-correct than another with respect to a specification; this property enables us to rank candidate programs in a partial ordering structure whose maximal elements are the correct programs. Whereas traditionally we think of program derivation as a process of successive correctnesspreserving transformations (using refinement) starting fro...

The old technique of "abstraction and refinement" makes it possible to understand complex systems by describing them in successive levels of detail. On the other hand the more modern technique of "generalization and specialization" (or Inheritance) facilitates the construction of systems by enabling reuse of specifications. Both techniques enable developers to specify a taxonomic relationship b...

This paper studies the question of how well a signal can be reprsented by a sparse linear combination of reference signals from an overcomplete dictionary. When the dictionary size is exponential in the dimension of signal, then the exact characterization of the optimal distortion is given as a function of the dictionary size exponent and the number of reference signals for the linear represent...

The analysis of longitudinal data with multiple assessment periods provides many challenges with respect to completeness and usability of data. Patterns of data completeness over time can vary greatly, and the number of possible longitudinal patterns increases exponentially with the number of assessment periods. With a great number of possible completeness patterns, questions arise as to which ...

Given a discrete memoryless source (DMS) with probability mass function P, we seek first an asymptotically optimal description of the source with distortion not exceeding AI, followed by an asymptotically optimal refined description with distortion not exceeding A2 < Al. The rate-distortion function for successive refinement by partitioning, denoted R(P, Al. Az), is the overall optimal rate of ...

Set Partitioning in Hierarchical Trees (SPIHT), proposed by Said and Pearlman [1], is generally regarded as a very efficient wavelet-based still image compression scheme. The algorithm uses an efficient, joint scanning and bit-allocation mechanism for quantizing the scalar wavelet coefficients, and produces a perfectly embedded bitstream. This work extends set partitioning to scan vectors of wa...