Value numbering is an optimization that assigns numbers to values in such a way that two values are assigned the same number if and only if the compiler can prove they are equal. When this optimization discovers two computations that produce the same value, it can (under certain circumstances) eliminate one of them. There are two competing techniques for proving equivalences: hashing and partit...

This is an eprint approximation to [Thu86], which is the definitive form of this paper. This eprint is provided for convenience only; the theorem numbering of this version is different, and not all corrections are present, so any reference or quotation should refer to the published form. Parts II and III ( [Thua] and [Thub]) of this series, although accepted for publication, for many years have...

In order to facilitate query processing for XML data, several path indexing, labelling and numbering scheme have been proposed. However, if XML data need to be updated frequently, most of these approaches will need to re-compute existing labels which is rather time consuming. In this paper, we propose a new Labelling Scheme for Dynamic XML data (LSDX) that supports the representation of the anc...

An adaptive subdivision method is proposed in this work for automatic post-processing of a 3D graphic model of coarse resolution. The method is an improved version of the Modified Butterfly Scheme (MBS) developed by Zorin et al. The main contribution of this work is to exploit the local smoothness information of a surface for adaptive refinement of a coarse 3D graphic model. With this approach,...

This paper presents a complex-valued version of the Lyapunov theory-based adaptive filtering algorithm [1]. The resulting algorithm simultaneously updates the real and imaginary parts of the complex coefficients so that the complex error can converge to zero asymptotically. The proposed scheme can be applied to random and deterministic processes because only the desired signal and input signal ...

Compressed sensing (CS) using sparse measurement matrices and iterative messagepassing reconstruction algorithms have been recently investigated as a low-complexity alternative to traditional CS methods. In this paper, we investigate the adaptive version of well-known Sudocodes scheme, where the sparse measurement matrix is progressively created based on the outcomes of previous measurements. I...

This paper deals with a new, efficient power flow method for unbalanced radial distribution systems based on improved backward/forward sweep (BFS) algorithm. This proposed method utilizes simple and flexible numbering scheme and takes full advantage of the radial structure of distribution systems. This method is tested on an 8-bus Three-phase unbalanced distribution system. The numerical test p...

Generalized numberings are an extension of Ershov's notion numbering, based on partial combinatory algebra (pca) instead the natural numbers. We study various algebraic properties generalized numberings, relating numbering to pca. As in lambda calculus, extensionality is a key here.