-
lms
lms的仿真,是我的毕业设计里的很好用,且对信号进行了动态分析(lms of the simulation, is my graduation project in a very good use, and the dynamic analysis of the signal)
- 2010-05-06 10:37:06下载
- 积分:1
-
hangjiguihua1
航迹规划算法,能够有效规划出最优路径,达到最优效果(Route planning algorithm can effectively plan out the best route to achieve optimal results)
- 2021-04-25 21:08:46下载
- 积分:1
-
entropy1d
file dll very important to run spike undefr matlab code.
- 2010-12-14 14:57:18下载
- 积分:1
-
vertical_ho_GSM_WLAN
matlab task for sensor network in urban area with bit error rate functions
- 2012-03-22 01:36:21下载
- 积分:1
-
seg2
segmentation tools for segmention lazy snaping
- 2009-06-19 18:02:22下载
- 积分:1
-
uipickfiles
Many-featured, platform independent file and directory picker
- 2011-05-13 02:18:51下载
- 积分:1
-
k-means
K-means算法是最为经典的基于划分的聚类方法,是十大经典数据挖掘算法之一。K-means算法的基本思想是:以空间中k个点为中心进行聚类,对最靠近他们的对象归类。通过迭代的方法,逐次更新各聚类中心的值,直至得到最好的聚类结果。(K-means algorithm is based on the division of the classic clustering method, is ten classic one of data mining algorithm. K-means the basic idea of the algorithm is: to the space K point as the center of the cluster analysis, near their object classification. Through the iterative method, each successive update clustering center value, until get the best clustering results.
)
- 2011-06-26 19:53:19下载
- 积分:1
-
30-Bus-New-England-Dynamic-Test-Case
电力系统30母线的动态数据,适用于电力系统动态仿真(30 bus power system dynamic data for dynamic simulation of power system.)
- 2012-07-29 18:51:35下载
- 积分:1
-
vehicle-Tracking-System-Comeplte-Web-Application
Appache Web Application complete for online vehicle tracking system ............ hyderabad india
- 2015-01-14 19:08:33下载
- 积分:1
-
huffman
霍夫曼编码的具体方法:先按出现的概率大小排队,把两个最小的概率相加,作为新的概率 和剩余的概率重新排队,再把最小的两个概率相加,再重新排队,直到最后变成1。每次相 加时都将“0”和“1”赋与相加的两个概率,读出时由该符号开始一直走到最后的“1”, 将路线上所遇到的“0”和“1”按最低位到最高位的顺序排好,就是该符号的霍夫曼编码。(Specific methods Huffman coding: the probability of emergence of the size press line, the two smallest sum probability, as a new probability and the probability of re-queue the remaining, then the minimum of two probabilities are added, and then re-queue, until finally become one. Each time the sum will be 0 and 1 Fu added two probabilities, when read by the symbol has come to begin the final 1 , the route will encounter a 0 and 1 at the lowest to the highest bit of the right order, that is the symbol of the Huffman coding.)
- 2015-04-04 20:34:08下载
- 积分:1