A collection of math routines including 8-bit, 16-bit, 32-bit signed and unsigned addition, subtraction, multiplication, and division. Very nice code library with heavy in-line documentation! Been looking for multi-byte divide? Here it is.
標(biāo)簽： bit collection including addition
上傳時間： 2015-05-17
上傳用戶：cursor
簡單混合衰落信道 This mfile inputs an unmodulated sinewave through a simple Rayleigh two path fading channel and shows the output with phase, gain, and attenuation characteristics via animation.
標(biāo)簽： unmodulated Rayleigh sinewave through
上傳時間： 2015-05-17
上傳用戶：CSUSheep
Unzip this file into a writeable directory. You should end up with a "Geocode" project, as well as Bitmaps and TestData directories. This sample geocodes single-match zip codes, entered by the user, or a batch-match of a table of zips (and other info) against a point shapefile. The point data shapefile consists of 41859 point features from 1996 GDT data, in decimal degrees. The table of zips that can be used in the batch match consists of 38 records, entitled "few_zips.dbf". More specifcs are found at the top of each form and are provided throughout the code.
標(biāo)簽： directory writeable Geocode project
上傳時間： 2013-12-19
上傳用戶：wangchong
學(xué)生信息查詢系統(tǒng)C語言實現(xiàn) 包含的功能有: 1、 系統(tǒng)功能選擇菜單：提供了5個功能 A、 按“班級＋平均成績”顯示原始數(shù)據(jù) B、 輸入學(xué)號，顯示學(xué)生檔案，并可選擇用順序查找或者折半查找去實現(xiàn) C、 輸入不完全的學(xué)生姓名即可模糊查找學(xué)生檔案。 D、 輸入班級及課程即可統(tǒng)計平均分，優(yōu)秀率及及格率。 2、 數(shù)據(jù)顯示函數(shù) 3、 學(xué)號查找函數(shù) 4、 模糊查找函數(shù) 5、 成績統(tǒng)計函數(shù)
標(biāo)簽： 信息查詢系統(tǒng) C語言 數(shù)據(jù)
上傳時間： 2014-08-20
上傳用戶：fanboynet
hao a hao a hao a hao a hao a hao a
標(biāo)簽： hao
上傳時間： 2015-05-18
上傳用戶：firstbyte
一個投影聚類算法及其數(shù)據(jù)集生成源碼。 參考文獻(xiàn)： Eric K.K. Ng, A. Fu : Efficient algorithm for Projected Clustering,
標(biāo)簽： A. K.K. Clustering Efficient
上傳時間： 2013-12-11
上傳用戶：亞亞娟娟123
這是一個關(guān)于A*算法的實現(xiàn)8數(shù)碼的程序源代碼，所有的算法核心全部使用STL標(biāo)準(zhǔn)模板庫編程，對想熟悉STL編程和A*算法的朋友有很好的借鑒意義。
上傳時間： 2015-05-18
上傳用戶：zhuoying119
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
上傳時間： 2014-01-22
上傳用戶：zhoujunzhen
C51 DOS/WINDOWS下的MCS51系列24位高精度A/D（AD7791）的C驅(qū)動程序
標(biāo)簽： WINDOWS 7791 C51 DOS
上傳時間： 2013-12-19
上傳用戶：冇尾飛鉈
a new public static cla
標(biāo)簽： public static new cla
上傳時間： 2013-12-26
上傳用戶：杜瑩12345
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
