scholarly journals A novel approach for clustering proteomics data using Bayesian fast Fourier transform

2005 ◽  
Vol 21 (10) ◽  
pp. 2210-2224 ◽  
Author(s):  
H. Bensmail ◽  
J. Golek ◽  
M. M. Moody ◽  
J. O. Semmes ◽  
A. Haoudi
Author(s):  
Daniel Liu

Previous algorithms for solving the approximate string matching with Hamming distance problem with wildcard ("don't care") characters have been shown to take \(O(|\Sigma| N \log M)\) time, where \(N\) is the length of the text, \(M\) is the length of the pattern, and \(|\Sigma|\) is the size of the alphabet. They make use of the Fast Fourier Transform for efficiently calculating convolutions. We describe a novel approach of the problem, which makes use of special encoding schemes that depend on \((|\Sigma| - 1)\)-simplexes in \((|\Sigma| - 1)\)-dimensional space.


2020 ◽  
pp. 147592172094956
Author(s):  
Nhi K Ngo ◽  
Thanh Q Nguyen ◽  
Thu V Vu ◽  
H Nguyen-Xuan

We present a novel approach to evaluating mechanical features of structures using correlation coefficients and fast Fourier transform analysis. Although correlation coefficient is always a sensitive parameter to changes of mechanical properties of real structures, it is rarely used due to high complication in data collection. To overcome this drawback, we propose fast Fourier transform analysis to increase the sensitivity of correlation coefficient, simplify calculation, and retain information from the original signal. Numerical results show that the present method not only detects relation between changes in structure with progression of defects but also locates their position. An fast Fourier transform–based correlation coefficient approach provides evaluations in both real bridge structures and experimental models. This study can serve as reference for analyzing, evaluating, and identifying working status of real structures.


Author(s):  
Daniel Liu

Previous algorithms for solving the approximate string matching with Hamming distance problem with wildcard ("don't care") characters have been shown to take \(O(|\Sigma| N \log M)\) time, where \(N\) is the length of the text, \(M\) is the length of the pattern, and \(|\Sigma|\) is the size of the alphabet. They make use of the Fast Fourier Transform for efficiently calculating convolutions. We describe a novel approach of the problem, which makes use of special encoding schemes that depend on \((|\Sigma| - 1)\)-simplexes in \((|\Sigma| - 1)\)-dimensional space.


This paper presents a novel approach on motor current signature analysis (MCSA) forbroken Rotor Bar fault and High Contact Resistance fault using stator current signals as an input from the three phases of Induction motors. Discrete Wavelet Transform is preferred over the Fast Fourier Transform (FFT). Fast Fourier Transform (FFT) converts signals from time domain to frequency domain on the other hand Discrete Wavelet Transform (DWT) gives complete three-dimensional information of the signal, frequency, amplitude, and the time where the frequency components exist. In wavelet analysis, thesignal is converted into scaled and translated version of mother wavelet, which is very irregular so cannot be predicted. Hence, mother wavelets are more appropriate for predicting the local behavior of the signal including irregularities and spikes. In this research features are extracted using DWT and then features are trained in Deep NN sequential model for the purpose of classification of the faults. In this research, MATLAB software has been used for building the motor model in Simulink environment and PyCharm software is used to implement Deep NN for getting accuracy and classification results. This research helps in early detection of the faults that assists in prevention from unscheduled downtimes in industry, economy loss and production loss as well.


Sign in / Sign up

Export Citation Format

Share Document