-
zuoye
说明: 采用追赶法进行解方程,同时举一个例子来说明这个方法的用法,显示结果符合要求范围(Solution of equation by catch-up method, and an example to illustrate the use of this method to show the scope of the results meet the requirements)
- 2010-04-27 18:54:36下载
- 积分:1
-
615498222-d~music1
用于阵列的MUSIC,可以估计信号的方位角,是阵列信号处理主面(For array of MUSIC, the signal can be estimated azimuth, is the main surface of the array signal processing)
- 2011-06-12 11:21:00下载
- 积分: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
-
Tijana_Jevtic_2zadatak
object recognition using convolution
- 2011-01-11 07:38:10下载
- 积分:1
-
cp3
matlab图形图像处理教程,第三章内容。供有关人员参考啊(matlab image processing tutorial, graphics, and the third chapter. Ah for the relevant Reference)
- 2011-06-13 18:10:53下载
- 积分:1
-
EtherCAT-Slave-Stack-Code-Tool
slave stack code tool
- 2015-03-18 10:49:02下载
- 积分:1
-
mengtekaluofaqiupi
说明: 蒙特卡洛求pi,非常简单的求pi值的代码源(Monte Carlo for pi, a very simple code for the source of the value of pi)
- 2009-08-09 17:07:17下载
- 积分:1
-
Entropy
熵(近似熵,样本熵),适合初学者。值得一看。。。。。(Entropy (entropy of approximate entropy, sample), suitable for beginners. Worth a look...
)
- 2013-09-04 23:30:45下载
- 积分:1
-
FINGERPRINT_FULL_CODE
Finger print authentication system
- 2013-03-16 14:12:42下载
- 积分:1
-
matlab-roc
roc 曲线的画法源代码 方便广大初学者应用(PLOTROC Plot receiver operating characteristic)
- 2012-05-04 12:42:16下载
- 积分:1