-
KNN01
说明： 用来作分类识别的KNN算法,非常好用非常好用(A very useful nearest neighbor algorithm)
- 2020-08-03 19:28:41下载
- 积分：1
-
beibao
背包问题，可以解决最短路径问题，或优化问题(Knapsack problem, the shortest path problem can be solved, or optimization problems)
- 2011-11-25 12:16:03下载
- 积分：1
-
chks光滑支持向量机-程序
CHKS光滑孪生支持向量机程序, 采用CHKS光滑函数逼近无约束孪生支持向量机的不可微部分，得到一类光滑的孪生支持向量机。(CHKS smooth twin support vector machine program)
- 2020-12-25 09:09:04下载
- 积分：1
-
LD
说明： 此Matlab代码实现了Drude-Lorentz和Debye-Lorentz算法(LD模型)，用于计算金属的介电常数。当然Drude-Lorentz方法也可以用来计算纯水的。(This Matlab code implements the Drude-Lorentz and Debye-Lorentz algorithm (LD model), used to calculate the dielectric constant of metal. Of course, Drude-Lorentz method can also be used to calculate the pure water.)
- 2010-01-03 20:26:51下载
- 积分：1
-
wzreedimensional-FDTD
FDTD three-dimensional CPML
- 2018-11-12 20:33:26下载
- 积分：1
-
new-DV-Hop-code
改进DV-Hop定位算法
首先设置初始量，布置了一个范围为100×100m2的区域，其上随机分布100个传感器节点，其中有10个信标节点，节点的通信半径为30m。
第二步在正方形区域内产生均匀分布的随机拓扑，随机产生节点坐标并将其中十个选定为信标节点，其余九十个设为未知节点，然后画出节点分布图。
第三步通过最短路径法计算未知节点与每个信标节点的最小跳数。
第四步根据前面记录的其他信标节点的位置信息和相距跳数估算平均每跳的实际距离，用跳数估计距离的方法得出未知节点到信标节点的距离。
第五步用极大似然估计法求未知节点坐标
(Improved DV-Hop localization algorithm first set the initial amount, layout 100100m2 the area of a range of 100 sensor nodes randomly distributed on the 10 beacon node, the node communication radius of 30m. The second step in the square area to generate uniformly distributed random topology, random coordinates of the nodes and ten of the selected beacon node, the remaining 90 is set to unknown node, and then draw the node distribution diagram. The third step is to calculate the minimum number of hops of the unknown node and each beacon node through the shortest path method. The fourth step according to the location information of the other beacon nodes in the previous record and away from hops to estimate the average hop distance and hop count to estimate the distance to come to the distance of the unknown node to beacon nodes. The fifth step maximum likelihood estimation method and the unknown coordinates of the nodes)
- 2020-10-12 22:27:31下载
- 积分：1
-
rop_matlab1
利用宽度有限方法（BFS）寻找最短路径和最小树的算法和算例。(Use of finite width method (BFS) to find the shortest path and minimum tree algorithms and numerical examples.)
- 2015-01-18 21:08:11下载
- 积分：1
-
classification_toolbox
说明： 多种基本分类训练，包括支持向量机，偏最小二乘，主成分分析和线性分析(A variety of basic classification training, including support vector machine, partial least squares, principal component analysis and linear analysis)
- 2020-03-10 11:52:41下载
- 积分：1
-
损伤单位算法
可以根据一定模式的压电片排列所激励并接受的的信号，来定位损伤的方法(A method of locating damage based on piezoelectric signal)
- 2020-09-07 17:58:04下载
- 积分：1
-
Huffman
哈弗曼编码，构造哈夫曼树，构造哈夫曼树非常简单，将所有的节点放到一个队列中，用一个节点替换两个频率最低的节点，新节点的频率就是这两个节点的频率之和。这样，新节点就是两个被替换节点的父节点了。如此循环，直到队列中只剩一个节点（树根）。(Hoffman coding, Huffman tree structure, Huffman tree structure is very simple, all the nodes in a queue, replace the two lowest frequency node with a node, the new node and the frequency of frequency is the two nodes. So, the new node is two replaced node parent node. So the cycle, until the queue is only one node (Shu Gen).
)
- 2013-11-13 14:20:00下载
- 积分：1
