BDpre

说明：  双馈电机的数学仿真模型，很有用，希望给大家一些提示(Double-fed motor mathematical simulation model, was very useful, want to give you some tips)

本程序利用Matlab软件仿真了QPSK+瑞利信道及高斯信道，对比分析结果。(This procedure used Matlab software simulation QPSK+ the Rayleigh channel and the Gauss channel, the contrastive analysis result.)

计算赫斯特指数Calculates the generalized Hurst exponent H(q) of a stochastic variable x(t) (a time series) the scaling of the renormalized q-moments of the distribution <|x(t+r)-x(t)|^q>/<x(t)^q> ~ r^[qH(q)] The value of H(q) give indication about the fractal nature of the signal. H(q) = 0.5 corresponds to a Brownian motion, deviations form 0.5 and dependency on q are indications of multi-fractality and time-correlations.(Calculates the generalized Hurst exponent H(q) of a stochastic variable x(t) (a time series) the scaling of the renormalized q-moments of the distribution <|x(t+r)-x(t)|^q>/<x(t)^q> ~ r^[qH(q)] The value of H(q) give indication about the fractal nature of the signal. H(q) = 0.5 corresponds to a Brownian motion, deviations form 0.5 and dependency on q are indications of multi-fractality and time-correlations.)

利用matlab软件实现对图像HSV参数轮廓提取，边缘检测提取(Using matlab software for image HSV parameters contour extraction, edge detection to extract)

ant colony algorithm jsp using matlab

自己编写的实现时间序列中的关建点搜索，在相似搜索和分类特征提取中常用,程序中有详细说明(achieve to find out the key point of time series ,it often to be used in similarity search and classification)

bi-linear Filter. Circular Convolution of two sequences using DFT and IDFT. Discrete Fourier Transform (DFT) of the sequence

lcmv- 阵列信号处理,可以自己输入信噪比(lcmv simulation on array )

经典MUSIC算法，带有空间前向平滑功能(Classical MUSIC algorithm with spatial smoothing function )

Traveling Salesman Problem (TSP) has been an interesting problem for a long time in classical optimization techniques which are based on linear and nonlinear programming. TSP can be described as follows: Given a number of cities to visit and their distances from all other cities know, an optimal travel route has to be found so that each city is visited one and only once with the least possible distance traveled. This is a simple problem with handful of cities but becomes complicated as the number increases.