版本更新了一下，到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
