In order to implement the cellular manufacturing system in practice, some essential factors should be taken into account. In this paper, a new mathematical model for cellular manufacturing system considering different production factors including alternative process routings and machine reliability with stochastic arrival and service times in a dynamic environment is proposed. Also because of t...

Shape decomposition and reconstruction are vital factors in image processing and analysis applications. A generalized skeleton transform allows a shape to be represented as a collection of modestly overlapped octagonal shape parts. One of the main problems with the existing algorithms is that they generate noise after decomposition. For ordinary images the rate of noise may not be effective but...

In this paper a novel algorithm based on Discrete Wavelet Transform (DWT) approach has been applied to synthesize the sounds produced by a few traditional Indian musical instruments, viz. flute, shehnai and sitar. In this algorithm, the level of decomposition of wavelets is varied till the error norm between the original signal and that generated through DWT is below a desired level. It is obse...

We have introduced the Janet's algorithm for the Stanley decomposition of a monomial ideal I ⊂ S = K[x 1 , ..., x n ] and prove that Janet's algorithm gives the squarefree Stanley decomposition of S/I for a squarefree monomial ideal I. We have also shown that the Janet's algorithm gives a partition of a simplicial complex.

This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann Hypothesis) also leads to an efficient algorithm for computing class numbers (known to be at least as difficult as factoring).

Domain decomposition methods for the solution of semi-linear selfadjoint and non-selfadjoint singularly perturbed di erential equations are considered. An iterative domain decomposition algorithm suitable for parallelization is described and convergence of the algorithm is established. The implementation on a shared memory multiprocessor is described and numerical examples are presented to demo...

In this paper we describe the Levenvberg-Marquardt (LM) algorithm for identification and equalization of CDMA signals received by an antenna array in communication channels. The synthesis explains the digital separation and equalization of signals after propagation through multipath generating intersymbol interference (ISI). Exploiting discrete data transmitted and three diversities induced at ...

A fast algorithm(fade) for the 2D drawing, geometric clustering and multilevel viewing of large undirected graphs is presented. The algorithm is an extension of the Barnes-Hut hierarchical space decomposition method, which includes edges and multilevel visual abstraction. Compared to the original force directed algorithm, the time overhead is O(e + n logn) where n and e are the numbers of nodes...