-
人机猜数软件，可以实现人猜机器和机器才人两种功能，界面友好，程序健壮...
人机猜数软件，可以实现人猜机器和机器才人两种功能，界面友好，程序健壮-guess a few man-machine software, can achieve guess machines and machines were only two functions, friendly interface and robust procedures
- 2022-01-31 08:57:41下载
- 积分：1
-
This captcha application written using JQuery AJAX PHP. Simple and easy to under...
This captcha application written using JQuery AJAX PHP. Simple and easy to understand.
- 2023-08-16 11:10:02下载
- 积分：1
-
可以实现过去，现在，乃至不同时区的切换。可以实现倒计时，时间长短计时和提醒。很适合用在一般事务安排和约会时间等待上。...
可以实现过去，现在，乃至不同时区的切换。可以实现倒计时，时间长短计时和提醒。很适合用在一般事务安排和约会时间等待上。-Can be achieved in the past, present, and even to switch time zones. Countdown can be achieved, time, length of time and reminders. Very suitable for use in the General Service arrangements and the appointment time to wait on.
- 2022-01-26 02:35:16下载
- 积分：1
-
这是一个用asp.net编写的实用登陆验证源码，利用它可以很好的检测web登陆用户名等。...
这是一个用asp.net编写的实用登陆验证源码，利用它可以很好的检测web登陆用户名等。-Asp. Net with the practical preparation of the landing certification source, it can be a very good landing detection web users, etc..
- 2023-04-20 00:40:03下载
- 积分：1
-
同样的多播测试软件，既可以测试发送也可以测试接受，可以查看多播流量...
同样的多播测试软件，既可以测试发送也可以测试接受，可以查看多播流量-same multicast testing software, we can test this test can also accept and multicast traffic View
- 2022-05-26 16:57:58下载
- 积分：1
-
LabVIEW Application Instruction Set SCPI (Standard Commands for Programmable Dev...
LabVIEW应用指令集SCPI（Standard Commands for Programmable Device）-LabVIEW Application Instruction Set SCPI (Standard Commands for Programmable Device)
- 2023-01-14 22:15:03下载
- 积分：1
-
在MATLAB中显示了WCDMA的仿真，并在SIMULINK中仿真通过
在MATLAB中显示了WCDMA的仿真，并在SIMULINK中仿真通过-WCDMA is shown in the MATLAB simulation and the simulation by SIMULINK
- 2022-03-26 15:08:06下载
- 积分：1
-
企业内部沟通系统，企业内部管理及通讯使用，方便适用
企业内部沟通系统，企业内部管理及通讯使用，方便适用-Internal communication systems, internal management and communications use, easy to apply
- 2022-03-22 14:04:53下载
- 积分：1
-
Labwindows/CVI方面的例子程序实在太少了，放上一点给大家共享
Labwindows/CVI方面的例子程序实在太少了，放上一点给大家共享-Labwindows/CVI example of the procedure is too small, place in 1:00 to share! !
- 2022-09-30 00:25:03下载
- 积分：1
-
本算法使用分治法求解最近点对问题。事先用O(nlogn)时间对x坐标进行排序，使得所有的点是按x坐标从小到大排好序的（x坐标相同时y坐标小的排前），然后取下标小...
本算法使用分治法求解最近点对问题。事先用O(nlogn)时间对x坐标进行排序，使得所有的点是按x坐标从小到大排好序的（x坐标相同时y坐标小的排前），然后取下标小于n/2属于左边的点集PL，取下标大于n/2属于右边的点集PR，即用O(1)时间就可以将规模为n的问题分解为两个规模为n/2的、同类型的子问题。分割完毕之后就可以采用分治法，分别求出PL和PR中的最近点对，最终通过递归实现。-This algorithm uses divide and conquer to solve the problem closest point. Prior to use O (nlogn) time to sort the x coordinate so that all points are based on x coordinates from small to large sorted (x coordinates with the same y coordinates of the small, the top), and then remove the standard is less than n/2 the set of points belonging to the left PL, remove the standard is greater than n/2 set of points belonging to the right of PR, that is to use O (1) time can be the problem size n divided into two size n/2, the same type The sub-problems. Segmentation can be used after completion of sub-rule method, respectively, find the PL and PR in the last points and eventually through the recursion.
- 2022-01-25 16:01:13下载
- 积分：1
