We consider H(curl, Ω)-elliptic variational problems on bounded Lipschitz polyhedra and their finite element Galerkin discretization by means of lowest order edge elements. We assume that the underlying tetrahedral mesh has been created by successive local mesh refinement, either by local uniform refinement with hanging nodes or bisection refinement. In this setting we develop a convergence the...

The paper presents a new algorithmic approach for multistage stochastic programs which are seen as discrete optimal control problems with a characteristic dynamic structure induced by the scenario tree. To exploit that structure, we propose a highly eecient dynamic programming recursion for the computationally intensive task of KKT systems solution within a primal-dual interior point method. Co...

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 ...

Event tracing is a well-accepted technique for post-mortem performance analysis of parallel applications. The expert tool supports the analysis of large traces by automatically searching them for execution patterns that indicate inefficient behavior. However, the current search algorithm works with independent pattern specifications and ignores the specialization hierarchy existing between them...

We present a technique that provides progressive transmission and near-lossless compression in one single framework. The proposed technique produces a bitstream that results in progressive reconstruction of the image just like what one can obtain with a reversible wavelet codec. In addition, the proposed scheme provides nearlossless reconstruction with respect to a given bound after each layer ...

Software development using formal methods is believed to be a process of successive refinements from abstract specifications into concrete specifications. Refinement rules rnag be used to demonstrate that the concrete specifzcations satisfy the corresponding abstract ones. However, there are serious Iimitations of the refinement rules in both theory and in practical applications. This paper fir...

We investigate several methods of inductive reasoning in the domain of difference equations, including the method of generalization with beliefs, the method of successive refinement, and temporal methods based on comparisons with previously solved problems.

This paper concerns the transmission of two independent Gaussian sources over a two-user decentralized interference channel, assuming that the transmitters are unaware of the instantaneous CSIs. The availability of the channel state information at receivers (CSIR) is considered in two scenarios of perfect and imperfect CSIR. In the imperfect CSIR case, we consider a more practical assumption of...

ion and Refinement for Design Verification at Logic Level Abstraction refinement has recently emerged as an enabling technology for applying model checking techniques to large real-life designs. Previous techniques for abstraction refinement work on static abstractions, in that the abstract model produced by the abstraction algorithm is not modified by the downstream model checking. We propose ...

Hierarchical source coding, also known as successive refinement of information, was introduced by Koshelev [1,2] and Equitz and Cover [3]. This problem is concerned with the construction of a source code for a discrete memoryless source X with respect to a given distortion measure d1 that can be further refined to represent the same source within another distortion measure d2 so that both repre...