-
Proyecto
Programas en C funciones, palindrome, etc.
- 2010-03-03 23:34:05下载
- 积分:1
-
(02) ISPSoft User Manual
ISPSoft User Manual
- 2018-06-28 22:31:53下载
- 积分:1
-
Self_Correct_control_based_RBF_Identification
基于径向基函数神经网络的自校正控制程序,其通过模拟神经网络的非线性函数映射能力,使向未知系统函数逼近(The self-tuning control program based on RBF neural network can approximate the unknown system function by simulating the mapping ability of the non-linear function of the neural network.)
- 2018-11-12 09:30:34下载
- 积分:1
-
MIMO通信系统的解码范围
sphere decoding for MIMO communication system -sphere decoding for MIMO communication sy stem
- 2022-05-23 08:57:04下载
- 积分:1
-
PSCADEMTDC
说明: pscad的实验教程,很详细,有很多注意的小细节(the experiment examples for pscademtdc)
- 2010-03-18 14:02:19下载
- 积分:1
-
彩虹代刷网4.0(可用,但部分文件被加密))
说明: 彩虹代刷网4.5全解密个人发卡源码,亲测可以使用。可以作为个人软件发卡使用。(Rainbow generation brush net 4.5 fully decrypted personal card source code, can be used for personal testing.)
- 2020-06-21 02:20:01下载
- 积分:1
-
LoRaMac-node-develop
说明: 在STM32上移植lorawan。基于lora无线通信,用LORAWAN协议(When lorawan is transplanted on STM32, the code can be run and measured.)
- 2020-02-11 16:37:56下载
- 积分:1
-
雷曼,经典动作小游戏的源码
雷曼,经典动作小游戏的源码-Lehman, a small classic games FOSS
- 2023-02-27 22:00:03下载
- 积分:1
-
在线答题考试系统下载
jQuery在线答题考试系统下载是一款以答题卡为主,左边是题目,右边是答题卡。(JQuery Online Answer Examination System downloads an Answer Card, left is the topic, right is the Answer Card.)
- 2019-04-09 11:45:46下载
- 积分:1
-
聚类-k均值算法
说明: K-means算法是基于划分的思想,因此算法易于理解且实现方法简单易行,但需要人工选择初始的聚类数目即算法是带参数的。类的数目确定往往非常复杂和具有不确定性,因此需要专业的知识和行业经验才能较好的确定。而且因为初始聚类中心的选择是随机的,因此会造成部分初始聚类中心相似或者处于数据边缘,造成算法的迭代次数明显增加,甚至会因为个别数据而造成聚类失败的现象。(K-means algorithm is based on the idea of partitioning, so the algorithm is easy to understand and the implementation method is simple and feasible, but it requires manual selection of the initial number of clusters, that is, the algorithm is with parameters. The number of classes is often very complex and uncertain, so professional knowledge and industry experience are needed to better determine. Moreover, because the selection of initial clustering centers is random, some initial clustering centers will be similar or at the edge of data, resulting in a significant increase in the number of iterations of the algorithm, and even the phenomenon of clustering failure due to individual data.)
- 2020-06-21 17:40:01下载
- 积分:1