-
drosta2
根据的给出降水量,返回干旱历时、烈度、时间.以均值、0.8的均值、0.6的均值为阈值。(according to the given precipitation ,calculate the last time,intensity and the start time of arid.)
- 2011-05-23 10:41:55下载
- 积分:1
-
Attenuation_freespace_propagation
Ku波段卫星通信中自由空间衰减计算的simulink mdl文件(Ku-band satellite communications in free space attenuation of simulink mdl file)
- 2011-08-23 20:32:50下载
- 积分:1
-
arrow
画箭头用的一个matlab程序,最新更新版(A matlab program for drawing arrowheads, the latest update)
- 2017-12-12 22:15:03下载
- 积分:1
-
mcbpsk
用蒙特卡罗仿真研究一个通信系统的误比特率BER。假设通信系统满足条件:信源输出的数据符号是相互独立和等概的;在发射机中没有进行脉冲形成;信道是AWGN信道(Using Monte Carlo simulation of a communication system bit error rate BER. Suppose communications systems to meet the conditions: the data source output symbols are independent, and so almost the no pulse in the transmitter in the form channel is AWGN channel)
- 2010-06-07 14:42:44下载
- 积分:1
-
dirdetect
通过图像像素点之间的相关性来判断该像素点为噪声点还是信号点,进而对其进行滤波。(first, we judge the image pixel that it is noise pixel or signal pixel by compute the correlations between them.then we remove the noise of the image.)
- 2009-05-26 16:06:27下载
- 积分:1
-
ChanAlgorithmDemo
基于chan算法的TDOA定位方法
用于学习(TDOA location method based on Chan algorithm
Used for learning)
- 2019-03-09 17:53:19下载
- 积分:1
-
ppm_over_3c
60GHz无线通信在IEEE802.15.3c信道下误码率matlab仿真(60GHz wireless communication under IEEE802.15.3c channel matlab code)
- 2012-07-03 11:19:06下载
- 积分:1
-
ldpc_CSBP
本程序是ldpc的C语言源代码,如果有需要可以下载学习,可以学习整个通信框架(This program is ldpc the C language source code can be downloaded if there is a need to learn, you can learn the entire communication framework)
- 2015-01-23 21:45:51下载
- 积分:1
-
mic_virtio
Intel MIC Platform Software Stack (MPSS).
- 2015-03-13 10:15:49下载
- 积分: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