-
informax
盲分离程序，是信息最大化算法，是主程序。可以在上面修改(Blind source separation procedures, the information maximization algorithm, is the main program. Can be modified in the above)
- 2021-05-09 16:18:34下载
- 积分：1
-
Nakagami-m
实现Nakagami信道仿真,用在无线传输信道中(Achieve Nakagami channel simulation, using the wireless transmission channel)
- 2020-11-23 10:09:34下载
- 积分：1
-
untitled001
直流恒负载转速调节，转速环突然断路matlab(DC Constant load speed regulation, speed loop circuit suddenly matlab)
- 2010-07-11 22:33:44下载
- 积分：1
-
diod
simulation file in matlab simulink
- 2013-08-06 22:18:36下载
- 积分：1
-
pipeilvboqifangzhenshixian
说明： 实现匹配滤波仿真的两个程序，每个程序生成四个图，可以通过比较验证信号的时延不影响匹配滤波的输出信噪比，及不同信号信噪比与信号波形无关，只与信号能量有关(Matched filter to achieve the two simulation procedures, each of the programs to generate the four plans, you can verify by comparing the signal delay does not affect the matched filter output signal to noise ratio, and different signal-noise ratio and signal wave has nothing to do only with the signal energy relevant)
- 2021-02-10 21:59:52下载
- 积分：1
-
xuliehao
说明： 本程序介绍如何产生序列号,编译运行后,zhuceji程序为客户使用,上面一个编辑框的好吗是顾客号,供应商使用jiemishou升序(the procedures on how to have a serial number, translation operation, zhuceji procedures for customer use, an edit box above the okay customers, suppliers use jiemishou ascending)
- 2006-04-08 11:31:27下载
- 积分：1
-
enhancement
图像增强最基础的相关函数的介绍，包括给图像加噪声的处理方法等等(Image enhancement of the introduction of the most basic function, comprising administering to the processing method of the image plus noise
)
- 2013-01-03 14:23:07下载
- 积分：1
-
IEEE33
33节点的源代码程序，用于配电网重构的潮流计算。(33 node source code for distribution network power flow calculation.)
- 2020-12-31 16:28: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
-
HHT1
这个是一个HHT的镜像延拓的emd程序。可以适当地解决emd变换的端点效应问题。你可以下下来参考下。(This is a mirror image of HHT emd Extension program. Emd can transform an appropriate solution to end effects. You can refer to the next down.)
- 2010-10-09 15:01:48下载
- 积分：1
