资源列表
DD_GS
- 高斯投影计算，C＋＋/CLI,采用VS2005环境.-Gauss projection, the C + + / CLI, using VS2005 environment.
KalmanDemoMatlab
- 介绍卡尔曼程序原理的演示软件。可以为初学者提供参考。-Kalman procedures introduced the principle of the demonstration software. Can provide a reference for beginners.
guo_
- 双线性插值算法的实现-bilinear interpolation algorithm implementation
choasprogrammelogstic
- 采用logistic构造的混沌模型，可以产生混沌序列，简单修改参数后可以产生任意区间的混沌序列程序-using logistic structure of chaotic model can produce chaotic sequence, After the simple parameter changes can have arbitrary interval of chaotic sequence procedures
waveletcaculspeed
- 使用小波分析进行转速计算的程序，程序调用的文件只要放在和程序同一目录就可以了-using wavelet analysis speed calculation procedures, Invoking the documents and procedures as long as on the same directory on the
TransPortprogram
- 模拟交通中，车流量统计的程序，可以统计多个量，统计标准符合交通部门规定-simulated traffic, the traffic volume statistics procedure, a number of statistical capacity, statistical standards meet the traffic department
MALLAT_PROGRAM
- 基于Mallat的二维Haar小波分解与重构算法的C语言实现最大分解级数:5级*/ -Mallat Haar wavelet decomposition and reconstruction algorithm in C language to achieve maximum decomposition Series : 5 * /
LeastSquarFit
- 用最小二乘法拟合曲线y=a0+a1*x+a2*x^2+a3*x^3+...+an*x^n 的vc源码-using the method of least squares fitting curve y = a0 a1 a2 * x * x * a3 ^ 2 x ^ 3 ... an * x ^ n vc FO
matrix_operation
- 本程序能完成矩阵的输入、输出。具有相同行数和列数的矩阵间的加法、减法。符合矩阵乘法规则要求的矩阵间的乘法。方阵间的除法，方阵的求逆。矩阵的求转置矩阵等功能。-this procedure can be completed matrix of input and output. Have the same number of rows and columns in the matrix between the additive and subtractive. Matrix multiplicat
memory_fft
- 次代码在传统fft的基础上，为了节约存储控间，对选装因子进行了压缩，是在同样完成fft的基础上，由于旋转因子的数量的改变而减少了62.5％计算点数的空间，结果以验证，可以直接使用-times in the traditional fft code on the basis that in order to save storage control, the right option for the compression factor. is the same fft completed on
blasdfew
- 以先序,中序,后序遍历二叉链表的非递归算法-to be the first sequence, sequence, after the preorder the binary tree of non - recursive algorithm
yjsdrtwe
- 以二叉链表为存储结构,分别写出求二叉树结点和叶子总数的算法-to the binary tree structure for storage, write for binary tree leaf node and the total number of algorithms