Description: 测试插入排序平均运行时间
1) 每次while循环中，生成0，1，…，n-1的随机排列
2) 每次while循环，至少生成20个随机排列，并进行排序，至少要耗费10个时钟滴答
3) 用耗费时间除以排序的随机排列数目，得到平均运行时间
-Insertion Sort test average run time 1) for each while loop to generate 0,1, ..., n-1 random order 2) of each cycle while, at least 20 randomly generated order, and sort, at least spend 10 the clock ticking 3) Sort by time divided by the number of random order, the average run time Platform: |
Size: 481280 |
Author:yuanxu |
Hits:
Description: 测试插入排序平均运行时间
1) 每次while循环中，生成0，1，…，n-1的随机排列
2) 每次while循环，至少生成20个随机排列，并进行排序，至少要耗费10个时钟滴答
3) 用耗费时间除以排序的随机排列数目，得到平均运行时间
-Insertion Sort test average run time 1) for each while loop to generate 0,1, ..., n-1 random order 2) of each cycle while, at least 20 randomly generated order, and sort, at least spend 10 the clock ticking 3) Sort by time divided by the number of random order, the average run time Platform: |
Size: 479232 |
Author:yuanxu |
Hits:
Description: Ophcrack是一款密码破解软件，功能非常强大，它能在几秒钟内恢复99.9 ％的数字密码。13位密码都可以在5分钟内破解出来。它有一个图形用户界面，可运行在多个平台之上。
特点：
可运行在Windows，Linux/Unix，Mac OS X
LM和NTLM哈希
可用于Windows XP和Vista的自由表格
蛮力模块，简单的密码
使用LiveCD，以简化过程
从Windows分区载荷加密哈希，包括Vista在内
自由和开放源码软件（GPL）-Ophcrack is a Windows password cracker based on a time-memory trade-off using rainbow tables. This is a new variant of Hellman s original trade-off, with better performance. It recovers 99.9 of alphanumeric passwords in seconds. Platform: |
Size: 353280 |
Author:geddy |
Hits:
Description: 1.本软件百分百无毒。
2.现在是测试版本。通过POST提交表单申请QQ。功能可能并不稳定。界面尚未美化。
3.软件提供无保QQ和邮箱QQ（@qq.com 和 @Foxmail）的申请通道。
4.开通随机昵称,密码,邮箱地址，智能申请等功能。
5.关于快捷键:F1 ADSL用户重新拨号 F8 申请无保QQ F9 申请邮箱QQ号 F11 清空IE缓存。
6.如果软件不能打开。请把文件夹内的MSINET.OCX复制到C:\WINDOWS\system32目录下。然后点电脑的开始按钮--》运行。
输入regsvr32 MSINET.OCX 。本软件需要MSINET.OCX控件的支持。-This software is hundred percent non-toxic.
2 is a test version. Via POST to submit the form to apply for QQ. Function may not be stable. The interface has not been beautified.
Software without bail, QQ and E-mail QQ (@ qq.com and @ of Foxmail) application channel.
4 opened Random nickname, password, email address, smart applications.
Shortcuts: F1 ADSL users to re-dial the F8 to apply without bail, QQ F9 to apply mailbox QQ number F11 to empty the IE cache.
If the software can not be opened. Please copy the folder MSINET.OCX to the C: \ WINDOWS \ system32 directory. And then point your computer s Start button- "Run.
Enter the regsvr32 MSINET.OCX. This software requires control support MSINET.OCX. Platform: |
Size: 171008 |
Author:xwy666 |
Hits:
Description: 数据结构大型试验-银行模拟系统
（1）通过程序动态模拟银行顾客在一家有n>=2个窗口的银行的到达和离开情况。
（2）通过计算每位顾客的平均等待时间及每一窗口处于“繁忙”状态的百分比，来测试银行的服务效率。
（3）实现中，可以用时间代表银行活动的对象，用事件驱动来模拟这些活动，并以概率（随机数发生器）来描述预期的客户到达率和银行职员为一个顾客服务所需的时间。
（4）在实验中，可改变参数（如银行窗口数、客户到达率、服务时间等），测试银行的服务效率。要求在各种情况下，模拟测试都能得到合理的运行结果。
（5）银行模拟的关键部分为客户时间，以及到达和离开事件。刚达到的顾客通过随机数产生下一个顾客的到达，已到达的顾客通过随机数产生服务时间，选择最早空闲的窗口后，生成离开事件。
（6）所有事件都被加上时间戳放到优先队列中，队列中优先级最高的事件就是时间戳最早的事件。
-Large-scale test of the data structure- the bank simulation system(1) procedures for dynamic simulation of bank customers in a n> = 2 window of the bank s arrival and departure.(2) by calculating the average waiting time of each customer and each window is a percentage of the "busy" state, to test the efficiency of banking services.(3) implementation, you can use the time on behalf of the object of the banking activities, to simulate these event-driven activities, and the probability (random number generator) to describe the expected customer arrival rate and bank staff time required for a customer service .(4) In the experiment, we can change the parameters (such as the number of the bank window, the customer arrival rate, service time, etc.), testing the bank s service efficiency. Requirements in all cases, the simulation tests can get a reasonable run results.(5) a key part of the banking simulation for the customer time, and arrival and departure events. Just to reach customers Platform: |
Size: 1054720 |
Author:fsn |
Hits:
Description: 程序按照当前时间和随机数组合生成png图片路径，确保图片文件不会重复，生成的图片存在于根目录，每个图片大小在1K~4K之间，图片长宽大小随文字多少而变化。测试200个汉字可以正常运行！
上传到PHP网站空间即可使用，子目录也可以运行
首页 index.php-Procedures in accordance with the current time and random number combinations to generate a PNG image path, ensure the picture file will not repeat, image formation exist in the root directory, each image size between the 1K~4K and image length and width size with text much and change. Test 200 Chinese characters can be normal operation!
Uploaded to the PHP web site space can be used, the sub directory can also run
Home index.php Platform: |
Size: 21504 |
Author:MByase |
Hits:
Description: 测试可以跑，根据自己情况修改下函数即可. NSGA-III 首先定义一组参考点。然后随机生成含有 N 个（原文献说最好与参考点个数相同）个体的初始种群，其中 N 是种群大小。接下来，算法进行迭代直至终止条件满足。在第 t 代，算法在当前种群 Pt的基础上，通过随机选择，模拟两点交叉（Simulated Binary Crossover，SBX）和多项式变异 产生子代种群 Qt。Pt和 Qt的大小均为 N。因此，两个种群 Pt和 Qt合并会形成种群大小为 2N 的新的种群 Rt=Pt∪Qt。 为了从种群 Rt中选择最好的 N 个解进入下一代，首先利用基于Pareto支配的非支配排序将 Rt分为若干不同的非支配层（F1，F2等等）。然后，算法构建一个新的种群St，构建方法是从 F1开始，逐次将各非支配层的解加入到 St，直至 St的大小等于 N，或首次大于 N。假设最后可以接受的非支配层是 L层，那么在 L+ 1 层以及之后的那些解就被丢弃掉了，且 St\ FL中的解已经确定被选择作为 Pt+1中的解。Pt+1中余下的个体需要从 FL中选取，选择的依据是要使种群在目标空间中具有理想的多样性。(The test can run and modify the function according to its own situation. NSGA-III first defines a set of reference points. Then the initial population containing N individuals (preferably the same number of reference points as the original literature) was randomly generated, where N was the size of the population. Next, the algorithm is iterated until the termination condition is satisfied. On the basis of current population Pt, the algorithm simulates two-point crossover (SBX) and polynomial mutation to produce offspring population Qt by random selection.) Platform: |
Size: 14336 |
Author:朱朱521 |
Hits:
Search - run test random number