资源列表
th
- 弹簧隔振器的系数k0=4.5 hc=3.5 d=[3.15 3.23] a1=tan(pi*(d)./(2*hc)) a2=cot(pi*(d)./(2*hc)) ％ plot(d,a1) y=(a1+a2)*2*k0*hc*1e-3./pi y=y./9.8*8 ％ var=1+(tan(pi*(d+0.25)./(2*hc))).^2 k=2*k0*hc/pi*( var*pi./(2*hc)+var*pi./(2*hc)./
Systemidentificationlscode
- 渐消记忆增广最小二乘法的源代码，用于参数辨识。-Augmented fading memory least-squares
rlsb2dpca
- 人脸识别中的2dpca MATLAB程序-Face Recognition 2dpca MATLAB program
FFT_billyi@163.com.tar
- 快速傅力叶FFT变换 高效 可在不同平台上运行-Fast and efficient Fu Li Ye FFT transform can be run on different platforms
abcd
- artificial neural network algo
Huffman
- 数据结构中huffman树，即最优二叉树-Huffman tree data structure, that is the optimal binary tree
progrm8
- 数学计算中的 共轭梯度法 用于最优化计算-Mathematics in the conjugate gradient method for the optimization
horse
- 马格遍历，自写的，好坏随人，高手勿喷，-Mag traversal
circleQueue
- 使用C++语言实现的一个循环队列操作，简单易懂-use the language of C++ to achieve a circle queue, easily understood
1
- 用邻接矩阵表示的图的类型 DFS：深度优先遍历的递归算法BFS：广度优先遍历判断从顶点vi到顶点vj是否可达-Adjacency matrix type DFS: depth-first traversal of the recursive algorithm BFS: breadth-first traversal of the judgment from the vertex vi to vertex vj is reachable
FFTaIFFT
- 计算复序列的快速傅里叶变换FFT和快速傅里叶反变换IFFT-Calculating complex sequence FFT fast Fourier transform and inverse fast Fourier transform IFFT
PSO
- the best pso algorithm