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
标签： construction clearly explain rethink
上传时间： 2013-12-13
上传用户：caixiaoxu26
Please unzip the file and make it under linux. It s function is just like tcpdump in linux.
标签： linux function tcpdump Please
上传时间： 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.
标签： processor FingerChip pincount Atmel
上传时间： 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.
标签： replacement commercia complete security
上传时间： 2014-01-21
上传用户：gaojiao1999
S-ISOMAP is a manifold learning algorithm, which is a supervised variant of ISOMAP.
标签： supervised algorithm S-ISOMAP manifold
上传时间： 2014-01-11
上传用户：lacsx
a XOR b> a,然后a XOR b< b,and both a and b are dependent data
上传时间： 2014-01-27
上传用户：yxgi5
樣板 B 樹 ( B - tree ) 規則 : (1) 每個節點內元素個數在 [MIN,2*MIN] 之間, 但根節點元素個數為 [1,2*MIN] (2) 節點內元素由小排到大, 元素不重複 (3) 每個節點內的指標個數為元素個數加一 (4) 第 i 個指標所指向的子節點內的所有元素值皆小於父節點的第 i 個元素 (5) B 樹內的所有末端節點深度一樣
上传时间： 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.
标签： experienced integrators knowledge intended
上传时间： 2013-12-19
上传用户：独孤求源
欧几里德算法：辗转求余 原理: gcd(a,b)=gcd(b,a mod b) 当b为0时,两数的最大公约数即为a getchar()会接受前一个scanf的回车符
上传时间： 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.
标签： algorithm Euclidean Euclid number
上传时间： 2017-07-17
上传用户：恋天使569
