mp3設(shè)計(jì)程序資料，采用c語(yǔ)言編寫(xiě)。 README file for yampp-3 source code 2001-05-27 This is the current state of the yampp-3 source code, 2001-05-27. This code is intended to run on Rev. B of the yampp-3 PCB, but can ofcourse be used on compatible systems as well. It still uses the "old" song selection system as the yampp-2. However, the disk handling routines has improved a lot and the obviosly, the new VS1001 handling has been put in. The codesize is almost at it s maximum at 1F40 bytes. A .ROM file is included if you don t have the compiler set up. For now, the documentation is in the code
標(biāo)簽： mp3 設(shè)計(jì)程序
上傳時(shí)間： 2015-04-13
上傳用戶：小碼農(nóng)lz
UNIX環(huán)境下資源監(jiān)控程序（包含對(duì)CPU\MEM\DISK\IO\PS等資源的監(jiān)控）
標(biāo)簽： CPUMEMDISKIOPS UNIX 資源 環(huán)境
上傳時(shí)間： 2015-04-18
上傳用戶：330402686
嵌入式操作系統(tǒng)Nucleus Plus中使用的文件系統(tǒng)，可支持IDE、Floppy Disk、 RAM Disk，由于驅(qū)動(dòng)的原因源碼中只能直接支持RAM Disk，與硬件相關(guān)的需要按照模板自行提供驅(qū)動(dòng)。本源碼已經(jīng)經(jīng)過(guò)嚴(yán)格測(cè)試，并已移植到VxWorks平臺(tái)上。
標(biāo)簽： Nucleus Plus 嵌入式操作系統(tǒng) 文件系統(tǒng)
上傳時(shí)間： 2015-05-01
上傳用戶：cmc_68289287
This companion disc contains the source code for the sample programs presented in INSIDE VISUAL C++ 5.0, as well as pre- compiled copies of the programs. To copy all of the sample code onto your hard disk, run the SETUP.EXE program and follow the instructions that appear on the screen. The sample code requires about 10 MB of hard disk space.
標(biāo)簽： companion the presented contains
上傳時(shí)間： 2015-05-09
上傳用戶：mhp0114
說(shuō)明： 1、里面有什么： 1.1、org.bouncycastle.*下的所有軟件是bouncycastle組織開(kāi)發(fā)的軟件包 1.2、org.infosecurity.*下的軟件包括： DES_CBC算法的實(shí)現(xiàn) RSA算法的實(shí)現(xiàn)（包括：密鑰生成、公鑰加密和私鑰解密、數(shù)字簽名及簽名驗(yàn)證） 數(shù)字信封的實(shí)現(xiàn) 利用數(shù)字信封實(shí)現(xiàn)大文件的加密、解密。 2、有什么用： 2.1 研究、學(xué)習(xí)信息安全中的密碼學(xué)設(shè)計(jì)與實(shí)現(xiàn)技術(shù)。 2.2 當(dāng)然如果大家覺(jué)得在其它地方用的上，我會(huì)覺(jué)得很高興的。 3、還有什么改進(jìn)： 3.1 對(duì)文件加密、解密的時(shí)候要頻繁的IO，如果加一個(gè)緩沖區(qū)，比如10K、50K等， 只有緩沖區(qū)滿了才寫(xiě)入DISK這樣將提高效率。 3.2 RSA私鑰積存的時(shí)候可以按PKCS8形式，再經(jīng)BASE64編碼保存比較好。
標(biāo)簽： bouncycastle infosecurity org 1.1
上傳時(shí)間： 2015-05-14
上傳用戶：13188549192
Although there has been a lot of AVL tree libraries available now, nearly all of them are meant to work in the random access memory(RAM). Some of them do provide some mechanism for dumping the whole tree into a file and loading it back to the memory in order to make data in that tree persistent. It serves well when there s just small amount of data. When the tree is somewhat bigger, the dumping/loading process could take a lengthy time and makes your mission-critical program less efficient. How about an AVL tree that can directly use the disk for data storage ? If there s something like that, we won t need to read through the whole tree in order to pick up just a little bit imformation(a node), but read only the sectors that are neccssary for locating a certain node and the sectors in which that node lies. This is my initial motivation for writing a storage-media independent AVL Tree. However, as you step forth, you would find that it not only works fine with disks but also fine with memorys, too.
標(biāo)簽： available libraries Although nearly
上傳時(shí)間： 2014-01-22
上傳用戶：zhoujunzhen
Displays CPU time usage, the list of processes (can be terminated) and the task which are running (can be close or switch to). Plus a little net traffic monitor and a disk status report.
標(biāo)簽： terminated the processes Displays
上傳時(shí)間： 2013-12-25
上傳用戶：zgu489
The C# program will solve the Tower of Hanoi for a given number of rings/disks/plates and display the ring/disk/plate movement. The movement will be shown graphically
標(biāo)簽： program display number plates
上傳時(shí)間： 2013-12-20
上傳用戶：1966640071
HANNOI-塔 3.4.1. 運(yùn)行效果與程序發(fā)布 3.4.2. 主類 Tower 3.4.3. Hannoi-塔 HannoiTower 3.4.4. 塔點(diǎn) TowerPoint 3.4.5. 盤(pán)子 Disk
標(biāo)簽： HannoiTower TowerPoint HANNOI Hannoi
上傳時(shí)間： 2014-01-11
上傳用戶：cuibaigao
漢諾塔問(wèn)題：第1個(gè)接到任務(wù)的人叫第2個(gè)人把n-1只diskes從開(kāi)始地送到中間地，自己只需要把最下面一只disk放到目的地，再叫第2個(gè)人把他 原來(lái)搬到中間的n-1只diskes都搬到目的地。而第2個(gè)人則叫第3個(gè)人去把n-2只diskes從第2個(gè)人的開(kāi)始地送到從第2個(gè)人的中間地，從第2個(gè)人 只需要把最下面一只disk放到自己的目的地，再叫第3個(gè)人把他原來(lái)搬到第2個(gè)人中間地的n-2只diskes都搬到第2個(gè)人目的地。如此類推
上傳時(shí)間： 2013-12-31
上傳用戶：dongbaobao
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1
