-
mpc
to calculate a tuning parameter of dmc and mpc controller
- 2009-05-20 00:16:34下载
- 积分:1
-
four_bar_mechanism
四杆机构运动求解,可运算关节角度,角加速度等(four-bar mechanism)
- 2009-05-23 19:54:54下载
- 积分:1
-
DiaLDA
说明: 是关于对角LDA算法的matlab代码,包含对角化代码和对角化LDA代码(Is a diagonal LDA algorithm on matlab code, including code and diagonalization Diagonalization LDA code)
- 2011-02-22 10:39:35下载
- 积分:1
-
OFDM
正交频分复用系统仿真级性能分析的matlab源程序(Orthogonal frequency division multiplexing system level performance analysis simulation matlab source code)
- 2010-05-06 14:36:04下载
- 积分:1
-
turbo
这个是纯TURBO码性能研究的仿真程序可以在此基础上加入交织迭代以及MIMO(Turbo code performance simulation study of the accession on the basis of this iterative intertwined and MI MO)
- 2007-07-05 20:44:51下载
- 积分:1
-
Digital_Image_Processing_Using_Matlab_-_Gonzalez_
Digital Image Processing With MATLAB
- 2010-06-09 23:05:49下载
- 积分:1
-
sea-clutter
高频地波雷达单基地一阶和二阶海杂波程序,毕业设计做的东西(High-frequency surface wave radar monostatic first-order and second-order sea clutter program)
- 2012-11-08 19:06:53下载
- 积分:1
-
kalman
说明: 卡尔曼滤波,从Andrew D. Straw s Python 移植过来的(Kalman filter algorithm,This M code is modified from Andrew D. Straw s Python )
- 2011-02-27 13:16:17下载
- 积分:1
-
lms
adaptive noise cancellation using lms algorithm
- 2013-03-09 18:38:02下载
- 积分:1
-
MyKmeans
实现聚类K均值算法: K均值算法:给定类的个数K,将n个对象分到K个类中去,使得类内对象之间的相似性最大,而类之间的相似性最小。 缺点:产生类的大小相差不会很大,对于脏数据很敏感。 改进的算法:k—medoids 方法。这儿选取一个对象叫做mediod来代替上面的中心 的作用,这样的一个medoid就标识了这个类。步骤: 1,任意选取K个对象作为medoids(O1,O2,…Oi…Ok)。 以下是循环的: 2,将余下的对象分到各个类中去(根据与medoid最相近的原则); 3,对于每个类(Oi)中,顺序选取一个Or,计算用Or代替Oi后的消耗—E(Or)。选择E最小的那个Or来代替Oi。这样K个medoids就改变了,下面就再转到2。 4,这样循环直到K个medoids固定下来。 这种算法对于脏数据和异常数据不敏感,但计算量显然要比K均值要大,一般只适合小数据量。(achieving K-mean clustering algorithms : K-means algorithm : given the number of Class K, n will be assigned to target K to 000 category, making target category of the similarity between the largest category of the similarity between the smallest. Disadvantages : class size have no great difference for dirty data is very sensitive. Improved algorithms : k-medoids methods. Here a selection of objects called mediod to replace the center of the above, the logo on a medoid this category. Steps : 1, arbitrary selection of objects as K medoids (O1, O2, Ok ... ... Oi). Following is a cycle : 2, the remaining targets assigned to each category (in accordance with the closest medoid principle); 3, for each category (Oi), the order of selection of a Or, calculated Oi Or replace the consumption-E (Or))
- 2005-07-26 01:32:58下载
- 积分:1