-
wavedemo
Wavelet Demo in Matlab
- 2009-12-22 00:46:19下载
- 积分：1
-
Pd_Pfa
在检测与估计中 仿真给出检查概率与虚警概率的关系 Pfa=1-Q(z),Pd=1-Q(z-d),画不同d情况下Pfa与Pd的关系图(In the detection and estimation of simulation shows that the relationship between the check probability and false alarm probability Pfa = 1-Q (z), Pd = 1-Q (zd), PFA and Pd diagram Videos d case)
- 2021-03-31 23:09:08下载
- 积分：1
-
zuiyouzhenliedaima
(eWiley) Optimum Array Processing
包含最有阵列处理（英文版）一书的所有MATLAB仿真源代码。((EWiley) Optimum Array Processing all MATLAB simulation source code contains the most array processing (English).)
- 2013-05-11 22:13:25下载
- 积分：1
-
SBM-DEA
说明： 本代码求解有非期望产出的非导向SBM模型，仅供同学们科研学术使用(A tool to calculate the DEA model)
- 2021-01-05 22:13:40下载
- 积分：1
-
亲测可用的实现智能预测控制算法matlab开发代码
电力系统暂态稳定程序，可以进行暂态稳定计算,中介真值程度度量，基于中介真值程度度量的图像分割是小学期课程设计的题目，GSM中GMSK调制信号的产生，计算晶粒的生长，入门级别程序,这是一个好用的频偏估计算法的matlab仿真程序。
- 2022-10-12 16:55:03下载
- 积分：1
-
有限元求解圆柱绕流问题
应用背景圆柱绕流问题是流体力学里面的基本问题。本程序用于求解圆柱绕流问题，因为是对称的问题，因此取了一半圆柱进行研究，然后将求解区域分区，用户可以随意指定各个区需要划分的网格排数和列数。关键技术本程序比较适合初学有限元的人了解有限元的编程过程。采用的是matalb编写，里面有一些根据网格划分生成节点坐标，组装刚度矩阵的方法，可以借鉴一下。
- 2023-01-20 10:55:04下载
- 积分：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
-
Th_p_e_hne
networ performance evaluation for handover network estimation
- 2013-02-20 14:58:15下载
- 积分：1
-
count
counts command line arguments
- 2012-08-05 16:01:39下载
- 积分：1
-
06.zuixinfeijicaozongxingfangzhen
最新编的飞行仿真,大家学习交流，相互学习(zui xin fei ji fang zhen)
- 2012-11-04 10:56:13下载
- 积分：1
