-
chengxu
包含了多个雷达信号产生的程序,其中有线性调频信号,编码信号,等等(Contains multiple radar signals generated by the program, which chirp signal encoded signals, etc.)
- 2013-01-24 13:51:05下载
- 积分:1
-
T_ENGINE_MODEL
Matlab/simulink环境下开发的,基于平均值理论的发动机动力学模型,适用于发动机或整车控制策略开发使用。(Developed under the Matlab/Simulink environment, based on the average of the theory of engine dynamic model, suitable for the engine or vehicle control strategy developed using.)
- 2013-05-09 16:05:45下载
- 积分:1
-
roughandfuzzy
模糊聚类和粗糙集关于web聚类很好的文章(Fuzzy Clustering and Rough Set Clustering good article on the web)
- 2010-05-15 17:28:25下载
- 积分:1
-
tftb-0.1
MATLAB tftb工具箱,上面有安装文件和安装说明(tftb MATLAB toolbox, where the installation file and install)
- 2007-02-17 10:01:47下载
- 积分:1
-
colorspacet
一个颜色空间转换的程序,可以实现任何空间的转换,如rgb到L*a*b颜色空间转换等。(A color space conversion process, conversion of any space can be achieved, such as rgb to the L* a* b color space conversion.)
- 2010-09-12 14:51:59下载
- 积分:1
-
jie
说明: 用runge-kutta 法解常微分其中有实例,可以用于验证(Using runge-kutta method for solving ordinary differential examples of which can be used to verify)
- 2011-03-14 10:18:29下载
- 积分:1
-
icaMF
Independent Component Analysis源代码,最大似然方法(Independent Component Analysis source code, the maximum likelihood method)
- 2007-07-30 10:21:48下载
- 积分:1
-
runica
提出了一种利用S函数实验结果表明:ICA可以将 脑电信号中包含的心电(ECG)、眼电(EOG)等多种干扰信号成功地分离出来(use of a S-function experimental results show : ICA EEG can be included in the heart (ECG), eyes (EOG) and other interference signal successfully separated)
- 2005-05-04 20:00:44下载
- 积分: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
-
Qchipr2
the file contains detection and estimation theroy codes
- 2011-04-26 13:43:46下载
- 积分:1