网站首页

bp

于 2010-04-04 发布文件大小:1KB

 0  216

下载积分: 1 下载次数: 0

我要下载

代码说明：

说明： back poropagation algorithm

文件列表：

bp.m

下载说明：请别用迅雷下载，失败请重下，重下不扣分！

发表评论

0 个回复

Scan
简单的网络端口扫描器，包括ICMP扫描和connect扫描(Simple network port scanner, including ICMP scan and connect scan)

2020-11-01 20:59:55下载

积分：1
PortScan
这是一个扫描程序，主要扫描网络计算机的端口，通过这个端口可以入侵，也可以检查是否有漏洞。(This is a scanning program, the main port scans network computers, can invade through this port, you can also check whether there are loopholes.)

2013-10-17 21:28:45下载

积分：1
data
Admin path finder that allow you search in a website

2013-01-17 06:32:48下载

积分：1
Mpthread_scanu
多线程扫描，支持同时扫描5个IIP，练手之作，希望对大家有所帮助 (Multi-threaded scanning, support for scanning at the same time five of the IIP, practicing hand for you to help)

2012-06-09 23:19:13下载

积分：1
FindUdpPort
UDp端口扫描，可以扫描任意安装TCP/IP协议的主机，并且可以扫描该主机中的一个端口。点击UDP Scan按钮，实现对UDP端口的扫描过程。在Windows操作系统环境中，建议使用Visual C++编程工具实现。(UDp port scan, can scan any install TCP/IP protocol, host, and can scan a port in the host. Click on the UDP Scan button on the UDP port scanning process. In the Windows operating system environment, it is recommended to use Visual C++ programming tools.)

2012-07-29 09:58:36下载

积分：1
KauNet-1.0.0.tar
Kau Net is used for Traffic Shaping, It can be used in any scenario

2009-03-12 01:50:39下载

积分：1
GrblController361_chs
激光雕刻机历程，用于易语言激光雕刻机的制作(LED isshow)

2016-08-27 13:02:04下载

积分：1
iisscanner
iisscancode ,delphi guxiaobo

2010-06-15 15:24:43下载

积分：1
lab
对于初始给定的数组,通常存在多个长度大于1的已自然排好序的子数组段.例如,若数组a中元素为{4,8,3,7,1,5,6,2},则自然排好序的子数组段有{4,8},{3,7},{1,5,6},{2}.用一次对数组a的线性扫描就足以找出所有这些排好序的子数组段.然后将相邻的排好序的子数组段两两合并,构成更大的排好序的子数组段({3,4,7,8},{1,2,5,6}).继续合并相邻排好序的子数组段,直至整个数组已排好序。(For the initial given array, usually present multiple sub-array section has a length greater than a natural sorted. For example, if the array of elements for a {4,8,3,7,1,5,6,2} then naturally sorted subarray segment has {4,8}, {3,7}, {1,5,6}, {2}. used once on a linear array scanning is sufficient to identify all these rows subarray segments good sequence is then sub-arrays adjacent segments sorted pairwise merge to form larger sub-segments sorted array ({3,4,7,8}, {1, 2, 5,6}). Continue merge adjacent sorted subarray section until the entire array is sorted.)

2014-12-21 20:08:05下载

积分：1
PortScan_sjtu
大学时用visual c++写的端口扫描程序，使用tcp/fin/syn进行端口扫描。(University with visual c write port scanning procedures, use tcp/fin/syn port scan conducted.)

2020-11-01 21:29:55下载

积分：1

696518资源总数
105949会员总数
22今日下载

bp

0 个回复

热门标签

热门下载