In this paper, a modied version of LLL algorithm, which is a an algorithm with output-sensitivecomplexity, is presented to convert a given Grobner basis with respect to a specic order of a polynomialideal I in arbitrary dimensions to a Grobner basis of I with respect to another term order.Also a comparison with the FGLM conversion and Buchberger method is considered.

The basis functions of the continuous fractional Fourier transform (FRFT) are linear chirp signals that are suitable for time-frequency analysis of signals with chirping timefrequency content. Efforts to develop a discrete computable version of the fractional Fourier transform (DFRFT) have focussed on furnishing a orthogonal set of eigenvectors for the DFT that serve as discrete versions of the...

  Introduction: The process of discriminating among benign and malignant hyperplasia begun with subjective methods using light microscopy and is now being continued with computerized morphometrical analysis requiring some features. One of the main features called Volume Percentage of Stroma (VPS) is obtained by calculating the percentage of stroma texture. Currently, this feature is calculated ...

Spectral analysis is an important signal processing tool for seismic data. The transformation of a seismogram into the frequency domain is the basis for a significant number of processing algorithms and interpretive methods. However, for seismograms whose frequency content vary with time, a simple 1-D (Fourier) frequency transformation is not sufficient. Improved spectral decomposition in frequ...

This paper explores how to use the concept of mutants in the computation of a Gröbner basis for polynomial equations. We compare our approach to the algorithm F4 of Faugère, and we perform experiments on polynomials system coming from multivariate public key cryptosystems in comparison with the experimental results from Magma implementation of F4. The experimental results demonstrate that the m...

Sub-band methods are often used to address the problem of convolutive blind speech separation, as they offer the computational advantage of approximating convolutions by multiplications. The computational load, however, often remains quite high, because separation is performed on several sub-bands. In this paper, we exploit the well known fact that the high frequency content of speech signals t...

Approval signatures are on file with the MISR Project. To determine the latest released version of this document, consult the MISR web site