-
newACA_FCM
Ant colony optimisation based segmentation algorithm
- 2014-01-19 21:29:53下载
- 积分：1
-
beibaowenti
有N件物品和一个容量为V的背包。第i件物品的费用是c，价值是w。求解将哪些物品装入背包可使这些物品的费用总和不超过背包容量，且价值总和最大。(There are N items and a knapsack capacity of V' s. No. i is the cost of items c, the value of w. Solving items into the backpack which will enable the cost of these items does not exceed the sum of the capacity of backpack, and the sum of the maximum value.)
- 2009-05-07 22:10:10下载
- 积分：1
-
CalcRef
VF control of induction motor
- 2014-09-24 12:01:15下载
- 积分：1
-
arrow
画箭头用的一个matlab程序，最新更新版(A matlab program for drawing arrowheads, the latest update)
- 2017-12-12 22:15:03下载
- 积分：1
-
ofdm_simu
OFDM系统仿真，信号采用卷积编码和交织技术、采用16-QAM和QPSK两种调制方式，干扰分别采用多径衰落和瑞利衰落两种。(OFDM system simulation, signal the use of convolutional coding and intertwined technology, using 16-QAM and QPSK modulation in two ways, interference were used to multipath fading and Rayleigh fading two.)
- 2009-01-16 11:49:28下载
- 积分：1
-
K-meanCluster
How the K-mean Cluster work
Step 1. Begin with a decision the value of k = number of clusters
Step 2. Put any initial partition that classifies the data into k clusters. You may assign the training samples randomly, or systematically as the following:
Take the first k training sample as single-element clusters
Assign each of the remaining (N-k) training sample to the cluster with the nearest centroid. After each assignment, recomputed the centroid of the gaining cluster.
Step 3 . Take each sample in sequence and compute its distance from the centroid of each of the clusters. If a sample is not currently in the cluster with the closest centroid, switch this sample to that cluster and update the centroid of the cluster gaining the new sample and the cluster losing the sample.
Step 4 . Repeat step 3 until convergence is achieved, that is until a pass through the training sample causes no new assignments. (How the K-mean Cluster workStep 1. Begin with a decision the value of k = number of clusters Step 2. Put any initial partition that classifies the data into k clusters. You may assign the training samples randomly, or systematically as the following: Take the first k training sample as single-element clusters Assign each of the remaining (Nk) training sample to the cluster with the nearest centroid. After each assignment, recomputed the centroid of the gaining cluster. Step 3. Take each sample in sequence and compute its distance from the centroid of each of the clusters. If a sample is not currently in the cluster with the closest centroid, switch this sample to that cluster and update the centroid of the cluster gaining the new sample and the cluster losing the sample. Step 4. Repeat step 3 until convergence is achieved, that is until a pass through the training sample causes no new assignments.)
- 2007-11-15 01:49:03下载
- 积分：1
-
threerayRayleigh
％threerayRayleigh.m
％ Last Homework pp. 253 5.31 (Second Edition English)
％ Default parameters
％ (threerayRayleigh.m%% Last Homework pp. 2 53 5.31 (English Second Edition) para% Default meters%)
- 2006-10-25 09:39:33下载
- 积分：1
-
mid_filt
对一个mat文件中的数据进行滤波后再进行奇异值分解降噪。奇异值降噪方法参考附件中的文献(filtering the data with medfilter and SVD(singular value decomposition))
- 2011-05-30 16:54:17下载
- 积分：1
-
erziyoudumoxing
eps的东西，做得挺好的 eps的东西，做得挺好的(eps thing, doing something very good eps, doing very good)
- 2011-10-08 08:31:13下载
- 积分：1
-
timing
在SIMLINK中用gandner 算法实现定时环路中的时间检测(Gandner algorithm used in SIMLINK timed loop in the time of detection)
- 2010-06-03 16:54:16下载
- 积分：1
