-
scale-space
sift算子中高斯金字塔和DOG的生成，只是该算子的最初步骤(sift operator：the generation of Gaussian pyramid and DOG。it is only the first steps)
- 2009-04-25 10:29:31下载
- 积分：1
-
SI-and-matlab-simulation
《系统辨识与MATLAB仿真-侯媛彬》源程序(" System Identification and MATLAB simulation- Houyuan Bin" source)
- 2011-10-22 18:16:28下载
- 积分：1
-
kalman(CPP_C_MATLAB)
卡尔曼滤波原理及程序手册，非常好用，非常方便(Kalman filtering principles and procedures manual, very easy to use, very convenient)
- 2013-03-24 10:43:52下载
- 积分：1
-
fullcar2
the Simulink model2 of full car
- 2019-01-02 21:52:09下载
- 积分：1
-
pinyu
频域波束形成仿真图，可以自行修改包括采样频率，阵元数等数据(Frequency domain beamforming simulation map, can make its own decisions including the sampling frequency, the number of data element)
- 2009-06-11 19:35:36下载
- 积分：1
-
leach-matlab
说明： 整理收集的用matlab编写的关于无线传感器LEACH协议的源代码(Organize the collection prepared by the use of matlab wireless sensor LEACH agreement on the source code)
- 2009-07-28 20:19:13下载
- 积分：1
-
lvq_apple
根据苹果参数的不同，进行苹果等级的分类，并且对照实际期望值进行对网络的检验(The different parameters according to Apple, the Apple level of classification)
- 2011-11-30 20:35:12下载
- 积分：1
-
MATLAB
this r program for QUADRATURE AMPLITUDE MODULATION AND QPSK
- 2010-08-08 12:39:12下载
- 积分：1
-
inverse
用matlab写的五种矩阵求逆程序，里面含有说明文件(Using matlab to write five matrix inversion procedure, which contains documentation)
- 2008-01-04 18:45:12下载
- 积分：1
-
danchunxingfa
单纯形法，求解线性规划问题的通用方法。单纯形是美国数学家G.B.丹齐克于1947年首先提出来的。它的理论根据是：线性规划问题的可行域是 n维向量空间Rn中的多面凸集，其最优值如果存在必在该凸集的某顶点处达到。顶点所对应的可行解称为基本可行解。单纯形法的基本思想是：先找出一个基本可行解，对它进行鉴别，看是否是最优解；若不是，则按照一定法则转换到另一改进的基本可行解,再鉴别；若仍不是，则再转换,按此重复进行。因基本可行解的个数有限，故经有限次转换必能得出问题的最优解。如果问题无最优解也可用此法判别。
(Simplex method, for solving linear programming problems common method. Simplex is the American mathematician GB Danzig in 1947 first put forward. Its theory is based on: linear programming problem feasible region is n-dimensional vector space Rn convex set in the multi-faceted, and its optimal value must be if the vertices of a convex set to achieve. Feasible solution corresponding to the vertex is called a basic feasible solution. The basic idea of the simplex method is: first find a basic feasible solution, to identify it and see whether it is the optimal solution If not, switch to another according to certain rules to improve the basic feasible solution, and then identify if still No, the re-conversion, click here to repeat. Due to the limited number of basic feasible solution, it will be converted by the finite optimal solution can be reached. If the problem can also be the optimal solution method has been applied without discrimination.
)
- 2011-01-17 21:01:44下载
- 积分：1
