The Set Partitioning in Hierarchical Trees (SPIHT) approach for still image compression proposed by Said and Pearlman [8], is one of the most efficient embedded gray image compression schemes till date. The algorithm relies on a very efficient scanning cum bit-allocation scheme for quantizing the coefficients obtained by a wavelet decomposition of an image. In this paper, we adopt this scheme t...

The factor c−1 √ n log n is nothing but the asymptotic value of the mean number of summands in a random partition of n, each partition of n being equally likely; cf. [17]. Note that the number of partitions of n with m 1’s is given by p(n −m) − p(n −m − 1) for 0 ≤ m ≤ n; and, consequently, p(n−m) is nothing but the number of partitions of n which have ≥ m 1’s. Thus the factor one plays an impor...

The congruence coefficient was first introduced by Burt (1948) under the name of unadjusted correlation as a measure of the similarity of two factorial configurations. The name congruence coefficient was later tailored by Tucker (1951, see also Harman, 1976). The congruence coefficient is also sometimes called a monotonicity coefficient (Borg & Groenen, 1997, p. 203). The congruence coefficient...

We present a parallel algorithm for solving triangular systems of linear equations on distributed-memory multiprocessor machines. The parallelism is achieved by partitioning the rows of the coefficient matrix in segments of a fixed size and distributing these sets in a wrap-around fashion among the processors, connected in a ring. The granularity of the algorithm is controlled by varying the se...

A wavelet-based multiresolution image representation method is developed matching human visual system (HVS) spatial acuity within multiple regions of interest (ROIs). ROIs are maintained at high (original) resolution while peripheral areas are gracefully degraded. Variable resolution images are generated by selectively scaling wavelet (detail) coefficients prior to reconstruction. The technique...

BLOCK TRIANGULAR PRECONDITIONERS FOR -MATRICES AND MARKOV CHAINS MICHELE BENZI AND BORA UÇAR Abstract. We consider preconditioned Krylov subspace methods for solving large sparse linear systems under the assumption that the coefficient matrix is a (possibly singular) -matrix. The matrices are partitioned into block form using graph partitioning. Approximations to the Schur complement are used t...

Soil column studies are used frequently in seeking to understand the behavior of a particular contaminant in a saturated homogeneous soil of a given type. The concentration of the contaminant is modeled by a parabolic partial differential equation. We seek to identify the sorption partitioning coefficient as a function of time from limited boundary data. We discuss an output least squares formu...

the objective of the present field experiment was to examine how plant density and enhanced source, i.e. thinning treatments, may affect grain yield and its components for a non-prolific maize hybrid, sc704. the environment of the hybrid maize crop was changed at intervals over its life cycle by removing every other plant in rows equispaced at 75 cm apart with a population of 13.34 plants m...

Partitioning objects into closely related groups that have different states allows to understand the underlying structure in the data set treated. Different kinds of similarity measure with clustering algorithms are commonly used to find an optimal clustering or closely akin to original clustering. Using shrinkage-based and rank-based correlation coefficients, which are known to be robust, the ...

The geometric entropy arising from partitioning space in a fluid " field theory " is shown to be linearly proportional to the area of an excluded region. The coefficient of proportionality is related to surface tension by a thermodynamic argument. Good agreement with experimental data is obtained for a number of fluids. The calculation employs a density matrix formalism developed previously for...