T-CMD 是一款用 C++ 編寫的后門程序,網(wǎng)上已有 C++ 源碼發(fā)布。 在本人學(xué)習(xí) C++ 的時候,順便把他翻譯成了 Pascal 源碼,突然感覺以前感到高深莫測的 C++ 也不那么可怕了。
上傳時間: 2015-10-06
上傳用戶:zxc23456789
Sliding Mode Control In engineering A.J FOSSARD and T.FLOQUET FRANCE.
標簽: A.J engineering Sliding Control
上傳時間: 2015-10-06
上傳用戶:diets
Active Shape Models 的創(chuàng)始人 T.F.Cootes的幾篇重要論文
標簽: Active Models Cootes Shape
上傳時間: 2015-10-06
上傳用戶:colinal
OFDM仿真 參數(shù): % 子載波數(shù) 128 % 位數(shù)/ 符號 2 % 符號數(shù)/ 載波 1000 % 訓(xùn)練符號數(shù) 0 % 循環(huán)前綴長度 8 (1/16)*T % 調(diào)制方式 4-QAM % 多徑信道數(shù) 3 % IFFT Size 128 % 信道最大時延 2
上傳時間: 2015-10-07
上傳用戶:1051290259
madCollection 2.5.2.6 full source This is not your every day VCL component collection. You won t see many new colored icons in the component palette. My packages don t offer many visual components to play with. Sorry, if you expected that! My packages are about low-level stuff for the most part, with as easy handling as possible. To find the hidden treasures, you will have to look at the documentation (which you re reading just in the moment). Later I plan on writing some nice demos, but for now the documentation must be enough to get you started.
標簽: madCollection collection component source
上傳時間: 2014-01-18
上傳用戶:yoleeson
本課題的任務(wù)是開發(fā)遵循ITU-T的H.323協(xié)議的IP電話終端系統(tǒng):IPT 2000。課題組選用了PalinMicro公司的單芯片低成本VoIP開發(fā)平臺來進行開發(fā).
標簽: PalinMicro ITU-T 2000 VoIP
上傳時間: 2015-10-10
上傳用戶:chfanjiang
國標dmb-t芯片lgs-8813資料及開發(fā)包,內(nèi)含lgs-8813的datasheet
上傳時間: 2014-11-29
上傳用戶:ztj182002
Bayesian Surprise Toolkit for Matlab T. Nathan Mundhenk, Laurent Itti
標簽: T. Bayesian Surprise Mundhenk
上傳時間: 2013-12-21
上傳用戶:yimoney
系科綜合管理信息系統(tǒng)是為了適應(yīng)現(xiàn)代化學(xué)校管理的需要,加快推進我校數(shù)字化校園建設(shè)、充分利用校園網(wǎng),利用網(wǎng)絡(luò)、多媒體等計算機應(yīng)用技術(shù)和手段,提高辦公效率、改善質(zhì)量的高效管理信息系統(tǒng)。 學(xué)生管理系統(tǒng)是系科綜合管理信息系統(tǒng)中很重要的組成部分
上傳時間: 2014-12-06
上傳用戶:dsgkjgkjg
HDOJ ACM input:The input consists of T test cases. The number of test cases ) (T is given in the first line of the input. Each test case begins with a line containing an integer N , 1<=N<=200 , that represents the number of tables to move. Each of the following N lines contains two positive integers s and t, representing that a table is to move from room number s to room number t (each room number appears at most once in the N lines). From the N+3-rd line, the remaining test cases are listed in the same manner as above.
上傳時間: 2015-10-18
上傳用戶:三人用菜
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1