-
heed
Heed protocal for ad hoc netork
- 2009-06-13 22:46:13下载
- 积分:1
-
musicldr.DOC
说明: 此文件完成了音乐灯的功能,能在doc环境下顺利运行,此文件是一个设计报告,你可以很方便的看到它的功能(This document is the completion of the function of light music, the environment in the doc is running smoothly, this document is a report of a design, you can see it very convenient function)
- 2009-07-27 15:56:47下载
- 积分:1
-
ukf
针对非线性系统状态估计滤波,有很好的植入性,希望可以帮助到你。(Nonlinear system filtering)
- 2019-07-11 08:59:36下载
- 积分:1
-
Space-Time_Block_Codes_Simulation
mimo空时编码MATLAB仿真程序,实现了mimo空时编码的简单仿真。(MIMO space-time coding MATLAB simulation program, the realization of the MIMO space-time coding a simple simulation.)
- 2007-12-24 15:56:14下载
- 积分:1
-
zernike
像差分析模式,选择泽尔尼克公式模拟,不同坐标系(Aberration analysis mode, select the zell Nick formula simulation, different coordinate system)
- 2014-08-23 10:18:10下载
- 积分:1
-
C-Cmethod-for-delay-time
C-C法求相空间重构的延迟时间,内有详细说明方法,(CC method for phase space reconstruction delay time, with detailed description of methods,)
- 2013-08-26 10:30:35下载
- 积分:1
-
bch
说明: BCH 编解码的MATLAB 实现。BCH码是一类重要而有效的纠正多个随机错误的循环码,由于该码具有严格的代数结构,所以是到目前为止研究得最为详尽、应用最为广泛的一类码,已有多种译码算法。(BCH codec of MATLAB. BCH is a kind of important and effective redress the wrong number of random cyclic code, as the code strictly algebraic structure, it is so far the most detailed study in, the most widely used type of a code has a variety of decoding algorithm.)
- 2005-11-15 14:33:18下载
- 积分:1
-
fangzhendd
吸收光谱预处理,包括6种预处理算法,对吸收光谱预处理技术完成的比较完善。(The absorption spectra preprocessing, including six kinds of preprocessing algorithm, the complete absorption spectra of pretreatment technology is relatively complete.)
- 2020-07-04 13:20:02下载
- 积分:1
-
KNN
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.)
- 2020-10-23 14:37:22下载
- 积分:1
-
3D-Harris-corner-detector
基于时空兴趣点的3d harris角点检测代码,matlab编写方式(3D Harris corner detector)
- 2011-08-30 17:30:45下载
- 积分:1