Eckel’s book is the only one to so clearly explain how to rethink program construction for object orientation. That the book is also an excellent tutorial on the ins and outs of C++ is an added bonus
標(biāo)簽： construction clearly explain rethink
上傳時(shí)間： 2013-12-13
上傳用戶：caixiaoxu26
Please unzip the file and make it under linux. It s function is just like tcpdump in linux.
標(biāo)簽： linux function tcpdump Please
上傳時(shí)間： 2013-12-20
上傳用戶：
Atmel’s AT91SAM7FP105 is a low pincount FingerChip processor based on the 32-bit ARM RISC processor. It features a on-chip biometric engine performing enrollment verification and identification, an internal record cache of up to 25 records and a secure command protocol over USB, SPI, UART. This protocol enables an external host system or processor to control the onchip bioengine functions, manipulate the record cache, and securely export record cache records for external storage. Together with the FingerChip sensor device AT77C104B, it forms an embedded, secured biometric turnkey solution.
標(biāo)簽： processor FingerChip pincount Atmel
上傳時(shí)間： 2013-12-26
上傳用戶：shawvi
Nemesis a complete Linux video security system. It s idea is a cheap replacement for your commercial video system that can retail from a total of $15,000 up.
標(biāo)簽： replacement commercia complete security
上傳時(shí)間： 2014-01-21
上傳用戶：gaojiao1999
S-ISOMAP is a manifold learning algorithm, which is a supervised variant of ISOMAP.
標(biāo)簽： supervised algorithm S-ISOMAP manifold
上傳時(shí)間： 2014-01-11
上傳用戶：lacsx
樣板 B 樹 ( B - tree ) 規(guī)則 : (1) 每個(gè)節(jié)點(diǎn)內(nèi)元素個(gè)數(shù)在 [MIN,2*MIN] 之間, 但根節(jié)點(diǎn)元素個(gè)數(shù)為 [1,2*MIN] (2) 節(jié)點(diǎn)內(nèi)元素由小排到大, 元素不重複 (3) 每個(gè)節(jié)點(diǎn)內(nèi)的指標(biāo)個(gè)數(shù)為元素個(gè)數(shù)加一 (4) 第 i 個(gè)指標(biāo)所指向的子節(jié)點(diǎn)內(nèi)的所有元素值皆小於父節(jié)點(diǎn)的第 i 個(gè)元素 (5) B 樹內(nèi)的所有末端節(jié)點(diǎn)深度一樣
上傳時(shí)間： 2017-05-14
上傳用戶：日光微瀾
This User’s Manual is intended for experienced users and integrators with hardware knowledge of personal computers. If you are not sure about any description in this User’s Manual, please consult your vendor before further handling.
標(biāo)簽： experienced integrators knowledge intended
上傳時(shí)間： 2013-12-19
上傳用戶：獨(dú)孤求源
歐幾里德算法：輾轉(zhuǎn)求余 原理: gcd(a,b)=gcd(b,a mod b) 當(dāng)b為0時(shí),兩數(shù)的最大公約數(shù)即為a getchar()會接受前一個(gè)scanf的回車符
標(biāo)簽： gcd getchar scanf mod
上傳時(shí)間： 2014-01-10
上傳用戶：2467478207
In number theory, the Euclidean algorithm (also called Euclid s algorithm) is an algorithm to determine the greatest common divisor (GCD) of two elements of any Euclidean domain (for example, the integers). Its major significance is that it does not require factoring the two integers, and it is also significant in that it is one of the oldest algorithms known, dating back to the ancient Greeks.
標(biāo)簽： algorithm Euclidean Euclid number
上傳時(shí)間： 2017-07-17
上傳用戶：戀天使569
Anthony s book is easily the most complete treatment of eCos system development. I believe it is destined to become part of every eCos developer s library." —Michael Tiemann, CTO, Red Hat Software and Co-founder of Cygnus Solutions
標(biāo)簽： development treatment complete Anthony
上傳時(shí)間： 2014-01-10
上傳用戶：frank1234
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
