Tokyo Cabinet的Tokyo Cabinet 是一個DBM的實現(xiàn)。這里的數(shù)據(jù)庫由一系列key-value對的記錄構(gòu)成。key和value都可以是任意長度的字節(jié)序列,既可以是二進(jìn)制也可以是字符串。這里沒有數(shù)據(jù)類型和數(shù)據(jù)表的概念。 作者叫Mikio Hirabayashi.Tokyo Cabinet是用C寫的，同時提供c,perl,ruby,java的API。Tokyo Cabinet在提供了POSIX和C99的平臺上都可用，它以GNU Lesser Public License協(xié)議發(fā)布。
標(biāo)簽： Cabinet Tokyo key-value value
上傳時間： 2017-07-11
上傳用戶：思琦琦
I. C. Wong, Z. Shen, J. G. Andrews, and B. L. Evans, ``A Low Complexity Algorithm for Proportional Resource Allocation in OFDMA Systems , Proc. IEEE Int. Work. Signal Processing Systems, 針對這篇文章給出的源代碼
上傳時間： 2014-01-24
上傳用戶：zhichenglu
java 線程 靜態(tài)鎖，對象鎖， synchronized 是鎖方法還是鎖對象？還是鎖類？如何實現(xiàn)？？ 部分代碼如下， public static Object lock=new Object() //靜態(tài)鎖，鎖類，不是鎖對象了！！所以兩個線程同時 運行兩個 TestThread 的execute（ ），也可以同步！！！ public void execute(){ // synchronized(lock){ for(int i=0 i<20 i++){ try { Thread.sleep(30) } catch (InterruptedException e) { // TODO Auto-generated catch block e.printStackTrace() } System.out.println(Thread.currentThread().getName()+Thread.currentThread ().getName()+" "+i) } } }
上傳時間： 2017-07-15
上傳用戶：lijianyu172
用snmp4j開發(fā)包讀取服務(wù)器oid信息，這里的oid指的是public的
標(biāo)簽： snmp4j oid 開發(fā)包 讀取
上傳時間： 2017-07-20
上傳用戶：邶刖
2. 編寫設(shè)計一個People類。該類的數(shù)據(jù)成員有年齡（age）、身高（height）、體重（weight）、函數(shù)成員有進(jìn)食（eat）、運動（sport）、睡眠（sleep）。其中進(jìn)食函數(shù)使體重加1，運動函數(shù)使身高加1，睡眠函數(shù)使年齡、身高、體重各加1。要求所有數(shù)據(jù)成員為private，成員函數(shù)為public訪問權(quán)限。
標(biāo)簽： People height weight sport
上傳時間： 2013-12-17
上傳用戶：tedo811
A certification path is an ordered list of certificates starting with a certificate issued by the relying party s trust root, and ending with the target certificate that needs to be validated. Certification path validation procedures are based on the algorithm supplied in ITU-T Recommendation X.509 and further defined in Internet Engineering Task Force (IETF) Request for Comments (RFC) 3280. Certification path processing verifies the binding between the subject distinguished name and/or subject alternative name and the subject public key defined in the target certificate. The binding is limited by constraints, which are specified in the certificates that comprise the path, and inputs that are specified by the relying party. To ensure secure interoperation of PKI-enabled applications, the path validation must be done in accordance with the X.509 and RFC 3280 specifications. This document provides the test assertions and the test cases for testing path validation software against these specifications.
標(biāo)簽： certification certificates certificate starting
上傳時間： 2017-07-31
上傳用戶：清風(fēng)冷雨
The OReilly Struts book (title not set yet) will be available sometime in the 3rd quarter of 2002. Published by OReilly, this book covers both Struts 1.0 and 1.1. The beta or draft chapters are being made available for download to facilitate an early public review process for the material.
標(biāo)簽： available sometime OReilly quarter
上傳時間： 2014-01-22
上傳用戶：familiarsmile
SQLite is a software library that implements a self-contained, serverless, zero-configuration, transactional SQL database engine. SQLite is the most widely deployed SQL database engine in the world. It is used in countless desktop computer applications as well as consumer electronic devices including cellphones, PDAs, and MP3 players. The source code for SQLite is in the public domain.
標(biāo)簽： zero-configuration self-contained implements serverless
上傳時間： 2013-12-09
上傳用戶：manlian
a true random number generator (TRNG) in hardware which is targeted for FPGA-based crypto embedded systems. All crypto protocols require the generation and use of secret values that must be unknown to attackers.Random number generators (RNG) are required to generate public/private key pairs for asymmetric algorithm such as RSA and symmetric algorithm such as AES.
標(biāo)簽： FPGA-based generator embedded hardware
上傳時間： 2014-01-09
上傳用戶：一諾88
RSA ( Rivest Shamir Adleman )is crypthograph system that used to give a secret information and digital signature . Its security based on Integer Factorization Problem (IFP). RSA uses an asymetric key. RSA was created by Rivest, Shamir, and Adleman in 1977. Every user have a pair of key, public key and private key. Public key (e) . You may choose any number for e with these requirements, 1< e <Æ (n), where Æ (n)= (p-1) (q-1) ( p and q are first-rate), gcd (e,Æ (n))=1 (gcd= greatest common divisor). Private key (d). d=(1/e) mod(Æ (n)) Encyption (C) . C=Mª mod(n), a = e (public key), n=pq Descryption (D) . D=C° mod(n), o = d (private key
標(biāo)簽： crypthograph information Adleman Rivest
上傳時間： 2017-09-01
上傳用戶：chfanjiang
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
