-
traffic_sim
Simulation of call traffic in a trunked communication network ( Simulation of call traffic in a trunked communication network)
- 2009-02-18 22:01:06下载
- 积分:1
-
xiangguan
MATLAB循环相关,循环卷积函数的编写,使用几个函数实现。(MATLAB cycle related to the preparation of cyclic convolution function, the use of several function.)
- 2009-06-25 16:46:58下载
- 积分:1
-
morphimage
morphological operations
- 2014-10-20 02:12:16下载
- 积分:1
-
OFDM
4篇ofdm经典论文,涉及OFDM系统中定时、频率偏移估计算法、符号同步(foud ofdm famous paper)
- 2014-04-15 15:29:32下载
- 积分:1
-
CS-reconstruction
通过各种方法对图像进行稀疏化分解,最后用压缩感知算法进行重建(The image is sparse decomposed by various methods, and finally reconstructed by compressed sensing algorithm)
- 2017-09-09 10:04:50下载
- 积分:1
-
example_clock
说明: Matlab擦除重绘动画——时钟演示,包含时针、分针和秒针,日期。(Matlab Erasemode redraw animation- Clock )
- 2011-04-13 17:03:42下载
- 积分:1
-
matlabyiqunsuanfa
蚁群算法是一种用来在图中寻找优化路径的机率型算法。是一种求解组合最优化问题的新型通用启发式方法,该方法具有正反馈、分布式计算和富于建设性的贪婪启发式搜索的特点。通过建立适当的数学模型,基于故障过电流的配电网故障定位变为一种非线性全局寻优问题。(Ant colony algorithm is a method used to find optimal path in the graph the probability-based algorithm. Is a combination of optimization problems to solve new general heuristic method, which has a positive feedback, distributed computing and constructive and the greedy heuristic search features. Through the establishment of an appropriate mathematical model, over-current fault-based distribution network fault location into a nonlinear global optimization problem.)
- 2010-05-14 07:58:21下载
- 积分:1
-
zishiying
基于最小二乘辨识的模型参考自适应,含有详细word说明文件(Based on the model reference adaptive least squares identification, documentation contains detailed word)
- 2013-12-22 16:37:55下载
- 积分:1
-
knn1
K最邻近密度估计技术是一种分类方法,不是聚类方法。
不是最优方法,实践中比较流行。
通俗但不一定易懂的规则是:
1.计算待分类数据和不同类中每一个数据的距离(欧氏或马氏)。
2.选出最小的前K数据个距离,这里用到选择排序法。
3.对比这前K个距离,找出K个数据中包含最多的是那个类的数据,即为待分类数据所在的类。(K nearest neighbor density estimation is a classification method, not a clustering method.
It is not the best method, but it is popular in practice.
Popular but not necessarily understandable rule is:
1. calculate the distance between the data to be classified and the data in each other (Euclidean or Markov).
2. select the minimum distance from the previous K data, where the choice sorting method is used.
3. compare the previous K distances to find out which K data contains the most data of that class, that is, the class to which the data to be classified is located.)
- 2017-08-09 21:06:38下载
- 积分:1
-
shangchuan
对信号进行小波包包变换并重构,并按自然顺序排列小波包变换后各层。(To signal wavelet package transform and reconstruction, and according to the natural order of each layer after wavelet packet transform.)
- 2014-11-07 14:51:36下载
- 积分:1