In this paper a heuristic algorithm for finding an optical path in elastic optical path networks is proposed. The proposed algorithm for connection requests finds a spectrum required from an aggregated spectrum of the path belonging to a set of shortest paths measured by the number of links. It has been shown that the proposed algorithm rejects definitely fewer connection requests than the well...

An image classification method based on the lifting wavelet and PCA is proposed. First, several training images chosen from given classes are decomposed into low-pass and high-pass images by using wavelet transform. Applying PCA to all the low-pass images, principal component vectors are computed. The feature vectors of low-pass images are constructed by expanding the low-pass images with respe...

It is well-known that each nonnegative integral flow of a directed graph can be decomposed into a sum of nonnegative graph circuit flows, which cannot be further decomposed into nonnegative integral sub-flows. This is equivalent to saying that indecomposable flows of graphs are those graph circuit flows. Turning from graphs to signed graphs, the indecomposable flows are much richer than that of...

We develop a technique for probing the harmonic measure of a diffusion-limited-aggregation (DLA) cluster surface with variable-size particles and generate 1000 clusters with 50 x 10(6) particles using an original off-lattice killing-free algorithm. Taking, in sequence, the limit of the vanishing size of the probing particles and then sending the growing cluster size to infinity, we achieve unpr...

Every video coding standard includes and requires motion estimation compensation. The full search algorithm, which provides the best estimation, has a very high computation cost. Researchers have developed several algorithms to reduce cost of computation. However, most these become trapped in local minima during search. Population-based evolutionary are widely used develop computationally effic...

In this paper the use of classical and lifting based wavelets for image compression was presented. Both classical and lifting based wavelets are considered. Classical wavelets considered in this work are Haar wavelet, Daubechie wavelet, Coiflet wavelet, Biorthognal wavelet, Demeyer wavelet, and Symlet wavelet. Lifting based wavelet transforms considered are (5,3) and (9,7). Large number of imag...

Description Uses a modified lifting algorithm on which it builds the nondecimated lifting transform. It has applications in wavelet shrinkage.

Real-time systems, especially software control systems, are developed to meet the requirements of real-time automation systems. One such crucial requirement is reducing the delay and jitter of periodic tasks in such systems. In this paper, we present a new method for reducing delays and jitters of periodic tasks, which are enforced by the operating system, control tasks, kernel mechanisms, etc....

We propose an approximate lifting procedure for general integer programs. This lifting procedure uses information from multiple constraints of the problem formulation and can be used to strengthen formulations and cuts for mixed integer programs. In particular we demonstrate how it can be applied to improve Gomory’s fractional cut which is central to Glover’s primal cutting plane algorithm. We ...

We investigate the properties of local HI-selected galaxies detected in blind radio surveys by using semi-analytic galaxy formation models in the hierarchical structure formation scenario. By drawing a detailed comparison between the properties of the HI-selected galaxies and the quasar absorption systems, we investigate a link between the local galaxy population and the quasar absorption syste...