-
matlab2660
matlab实例,给出了诸多matlab编程应用的例子,值得一看。(matlab example, matlab programming gives many examples of applications, worth a visit.)
- 2007-11-24 10:35:59下载
- 积分:1
-
signalgenration
signal generation using matlab
- 2013-07-30 21:55:53下载
- 积分:1
-
SMI
基于麦克风阵列的自适应波束形成算法.它是基于SMI自适应算法(Microphone array based adaptive beamforming algorithm which is based on the SMI adaptive algorithm)
- 2013-07-09 15:49:37下载
- 积分:1
-
Edge
code for edge detection
- 2012-08-02 10:07:34下载
- 积分:1
-
MATLABshuoming-
上海电气MATLAB仿真模型用户手册word文档说明的十分详细()
- 2013-05-05 21:21:44下载
- 积分:1
-
ESPRIT
说明: 自己编写的使用ESPRIT算法进行信号频率估计的Matlab代码。(Matlab code of the ESPRIT algorithm for frequency estimation.)
- 2010-04-23 10:07:09下载
- 积分:1
-
inverter_control
光伏并网系统单相逆变器电压前馈电流控制,基于matlab 7.3 。(photovotaic grid-connected system single-phase inverter voltage feed forward current control,based on matlab 7.3)
- 2021-03-04 23:09:31下载
- 积分: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
-
CMA_blind_equalization
16QAM的盲均衡算法-cma,它是研究盲均衡算法最基础的一种算法 (16QAM for blind equalization algorithm-cma, which is to study the most basic algorithm for blind equalization algorithm)
- 2020-11-04 21:29:51下载
- 积分:1
-
abc
说明: 一个从甲苯中萃取笨酸的化工过程的模拟,并且可以改变萃取级数,供用户学习(A acid extracted from the toluene chemical process simulation, and extraction stages can be changed for the user to learn)
- 2011-03-24 19:27:35下载
- 积分:1