-
ns2-analysis-code
ns2网络仿真的实例以及对应测试分析代码，含有时延，抖动，丢包率等(ns2 network simulation examples and counterparts test analysis code, containing latency, jitter, packet loss rate etc.)
- 2009-02-27 21:08:56下载
- 积分：1
-
jisuan
进行电力网络的潮流计算
可以此进行无功优化等问题(electrical calculation)
- 2020-12-01 22:29:27下载
- 积分：1
-
NIDS
网络入侵检测系统，各模块完整，可以实现简单的网络入侵检测(Network intrusion detection system, each module is complete, you can achieve a simple network intrusion detection)
- 2021-03-29 20:39:10下载
- 积分：1
-
Network-Engineer-English-Vocabulary
网络工程师英语词汇表网络工程师英语词汇表网络工程师英语词汇表网络工程师英语词汇表(Network Engineer English Vocabulary
Network Engineer English Vocabulary
Network Engineer English Vocabulary
Network Engineer English Vocabulary
)
- 2013-11-04 20:01:04下载
- 积分：1
-
shortest-path
通信网络的架设问题 若要在n（≥10）个城市之间建设通信网络，只需要架设n-1条线路即可(With the Dijksra algorithm to network G from source points to the rest of the vertices of the shortest path)
- 2014-01-11 23:32:27下载
- 积分：1
-
lbmsim-0.8
LBM格子波尔兹曼C程序，特别全，下载即可。(LBM Lattice Boltzmann C procedures, particularly full, download.)
- 2014-03-04 09:20:45下载
- 积分：1
-
aunction-can
说明： C__功能 可以很好的 来下载 C__功能 可以很好的 来下载(C _ function can be good to download C _ function can be very good to download)
- 2019-04-03 09:58:57下载
- 积分：1
-
socket_Programming
Programming socket
网络编程(Programming socket
)
- 2010-11-28 14:56:14下载
- 积分：1
-
ipdatatcpudp
用MFC实现的一个网络抓包程序，可以分析TCP、UDP、ICMP协议数据，同时有流量统计的功能，可供大家参考(Implemented by a network packet capture MFC program that can analyze TCP, UDP, ICMP protocol data, traffic statistics function simultaneously, for your reference)
- 2011-01-14 17:55:09下载
- 积分：1
-
K－均值聚类算法C++编程
K-均值聚类算法的编程实现。包括逐点聚类和批处理聚类。K－均值聚类的的时间复杂度是n*k*m，其中n为样本数，k为类别数，m为样本维数。这个时间复杂度是相当客观的。因为如果用每秒10亿次的计算机对50个样本采用穷举法分两类，寻找最优，列举一遍约66.7天，分成3类，则要约3500万年。针对算法局部最优的缺点，本人正在编制模拟退火程序进行改进。希望及早奉给大家，倾听高手教诲。(K-means clustering algorithm programming. Point by point, including clustering and clustering batch. K-means clustering of the time complexity of n* k* m, n samples, several types of k, m sample dimension. The time complexity is a very objective. Because if we use one billion times per second the computer using 50 samples of two exhaustive method to find the optimal set out again about 66.7 days, divided into three categories, offering 3,500 years. Local optimal algorithm against the shortcomings, I was prepared simulated annealing process improvements. Early Feng hope for everyone, listen to the master teachings.)
- 2020-06-26 09:20:02下载
- 积分：1
|
联系客服（QQ：3324461878）
