版本更新了一下，到5.84了，需要用VS.net平台进行编译运行，介绍与原来的一样！ 磁盘文件的安全删除，我们通常所执行的删除操作并不是真正的删除只是清除了文件的fat表内容，文件数据还在磁盘上，可以恢复，所以不安全。-disk deletion of the security document, WE usually enforced by the delete operation does not really delete the file will simply remove the fat table of contents, document data on the disk is, can be restored, therefore unsafe.
上传时间： 2016-11-05
上传用户：大三三
Range imaging offers an inexpensive and accurate means for digitizing the shape of three-dimensional objects. Because most objects self occlude, no single range image suffices to describe the entire object. WE present a method for combining a collection of range images into a single polygonal mesh that completely describes an object to the extent that it is visible from the outside.
标签： three-dimensiona inexpensive digitizing accurate
上传时间： 2016-11-29
上传用户：yxgi5
This document contains official rules of the 3D soccer simulation competition at RoboCup 2006. While WE will try to cover all cases, if unexpected events do occur, the rule committee will seek input from the participants and then make a decision. HoWEver, once the committee has made a decision, that decision is final and will not be open to further discussion
标签： competition simulation document contains
上传时间： 2016-11-30
上传用户：zhengzg
Hid Led Tester is a simple USB（interrupt mode）device tester package. There are firmware and software in it. Hid Led tester follows USB HID protocol, WE don’t need to install driver for the device, and Windows (Win 2000 and later) will install the device automatic.
标签： interrupt firmware software package
上传时间： 2014-01-03
上传用户：llandlu
The VGA example generates a 320x240 diffusion-limited-aggregation (DLA) on Altera DE2 board. A DLA is a clump formed by sticky particles adhering to an existing structure. In this design, WE start with one pixel at the center of the screen and allow a random walker to bounce around the screen until it hits the pixel at the center. It then sticks and a new walker is started randomly at one of the 4 corners of the screen. The random number generators for x and y steps are XOR feedback shift registers (see also Hamblen, Appendix A). The VGA driver, PLL, and reset controller from the DE2 CDROM are necessary to compile this example. Note that you must push KEY0 to start the state machine.
标签： diffusion-limited-aggregation DLA generates 320x240
上传时间： 2014-01-16
上传用户：225588
The MD5 Message-Digest Algorithm Status of this Memo This memo provides information for the Internet community. It does not specify an Internet standard. Distribution of this memo is unlimited. Acknowlegements WE would like to thank Don Coppersmith, Burt Kaliski, Ralph Merkle, David Chaum, and Noam Nisan for numerous helpful comments and suggestions.
标签： Message-Digest information Algorithm provides
上传时间： 2013-12-03
上传用户：maizezhen
查错问题 文件名：check.* 输入文件：check.in（文本文件，选手按规定格式自行创建） 输出文件：check.out（文本文件） 问题描述： 很多英文文本编辑软件都具有辅助查错功能。现在有一个标准的词库，请根据该标准词库编制程序实现查错功能。 输入格式： 从文本文件check.in中读入数据。 第一行一个整数N（N≤10000），表示标准词库中单词的个数。 第2--N+1行，每行一个标准单词，单词的长度不超过10。 第N+2行开始为待查文本，其单词间用空格（或连续空格）分隔，单词的个数不会超过1000。 输出格式： 输出到文本文件check.out中。 （1）第一行开始输出拼错的单词； （2）最后一行输出一个整数表示拼错的单词总数。（拼错相同的单词重复计数） 注意：如果一个单词在字典中无法找到，那么我们就认为这个单词拼错了。 输入样例： 3 like this WE WE like the sport 输出样例： the sport
上传时间： 2013-11-28
上传用户：2404
Monte Carlo method in the courseware, very carefully! Monte-Carlo simulation method is pretty good in, WE quickly under.
标签： method Monte-Carlo courseware simulation
上传时间： 2017-01-25
上传用户：lz4v4
The combinatorial core of the OVSF code assignment problem that arises in UMTS is to assign some nodes of a complete binary tree of height h (the code tree) to n simultaneous connections, such that no two assigned nodes (codes) are on the same root-to-leaf path. Each connection requires a code on a specified level. The code can change over time as long as it is still on the same level. WE consider the one-step code assignment problem: Given an assignment, move the minimum number of codes to serve a new request. Minn and Siu proposed the so-called DCAalgorithm to solve the problem optimally. WE show that DCA does not always return an optimal solution, and that the problem is NP-hard. WE give an exact nO(h)-time algorithm, and a polynomial time greedy algorithm that achieves approximation ratio Θ(h). Finally, WE consider the online code assignment problem for which WE derive several results
标签： combinatorial assignment problem arises
上传时间： 2014-01-19
上传用户：BIBI
银行家算法，弄课程设计的时候搞的，作课设时可以用来参考下，希望有帮助-bankers algorithm to find curriculum design of the moment when, for the class can be used to set up at the reference, WE hope that the help
上传时间： 2014-01-07
上传用户：rishian
