-
analyze1
this util for voice analize
- 2010-09-30 02:56:29下载
- 积分:1
-
Digital-watermarking-algorithm-FFT
数字水印的傅里叶算法,大学本科论文,图像处理,信息安全等。(Fourier transform algorithm of the digital watermark, undergraduate thesis, image processing, information security.)
- 2012-06-22 15:29:00下载
- 积分:1
-
TMD-ATMD-structure-control
对单自由度结构在无控与采用TMD和ATMD控制策略下的加速度和位移反应进行了对比,对比结果以图形方式显示。(The single degree of freedom structure s acceleration and displacement reaction are compared between with on control and using TMD and ATMD control strategy,the contrast results are displayed by using graph.)
- 2020-11-27 11:09:31下载
- 积分:1
-
EquationsTCSMMMNc
Equations which describe the TCS/MM method
- 2014-09-25 03:39:17下载
- 积分:1
-
baudrate
AUTOMATIC BAUD RATE DETECTION FOR STANDARD BAUD RATES
- 2014-02-24 14:04:58下载
- 积分: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
-
lorenzhundun
使用matlab产生混沌时间序列的源代码(use Matlab chaotic time series generated source code)
- 2007-06-04 10:38:45下载
- 积分:1
-
63750984PID
matlab控制算法 模糊PID,有PIDmodel(matlab controll )
- 2014-01-18 20:07:26下载
- 积分:1
-
hhh
这是一个关于公交调度的源程序代码,原题是2001年的b题公交调度问题。(Bus Dispatch)
- 2012-07-18 20:28:23下载
- 积分:1
-
1030_WirelessBidirectional-_Thorpe_BO2_Final-ppt
important PDF book used in free space optics
- 2014-11-27 03:49:13下载
- 积分:1