texture-review

UKF code for Unscented Kalman Filter sigma calculation(UKF code)

A fast Fourier transform (FFT) is an algorithm to compute the discrete Fourier transform (DFT) and its inverse. Fourier analysis converts time (or space) to frequency and vice versa an FFT rapidly computes such transformations by factorizing the DFT matrix into a product of sparse (mostly zero) factors.

Least Mean Square Algorithm for Beam Forming

Inverse dynamic analysis of 2 bar serial robot using new method De-NOC.

The CCA-fMRI Toolbox implements the use of canonical correlation analysis (CCA) for detecting brain activity patterns recorded by functional magnetic resonance imaging (fMRI).

利用FFT实现基于MP的信号稀疏分解程序(Using FFT-based signal sparse decomposition process MP)

拉格朗日插值函数实例，并画出原函数和插值函数的图像。(Lagrange interpolation function instance, and draw the image of the original function and interpolation function.)

2016年国赛建模A题中第1题风速为24m/s时的一种求解方法，画出了锚链的形状。(a solution to the first question in the wind speed of 24m/s in 2016 National Modeling Competition)

说明：  首先确定被评价对象的因素（指标）集和评价（等级）集；再分别确定各个因素的权重及它们的隶属度向量，获得模糊评判矩阵；最后把模糊评判矩阵与因素的权向量进行模糊运算并进行归一化，得到模糊综合评价结果(Firstly, the factor (index) set and the evaluation (grade) set of the evaluated object are determined; then the weight of each factor and their membership degree vectors are determined separately, and the fuzzy evaluation matrix is obtained; finally, the fuzzy evaluation matrix and the weight vector of the factor are fuzzily calculated and normalized, and the result of the fuzzy comprehensive evaluation is obtained.)

基于单周期控制的整流器，采用MATLAB进行建模仿真。(The rectifier based on one cycle control, using MATLAB modeling and simulation.)