加密算法 Test Driver for Crypto++, a C++ Class Library of Cryptographic Primitives: - To generate an RSA key cryptest g - To encrypt and decrypt a string using RSA cryptest r - To calculate MD5, SHS, and RIPEMD-160 message digests: cryptest m file - To encrypt and decrypt a string using DES-EDE in CBC mode: cryptest t - To encrypt or decrypt a file cryptest e|d input output - To share a file into shadows: cryptest s <pieces> <pieces-needed> file (make sure file has no extension, if you re running this under DOS) - To reconstruct a file from shadows: cryptest j output file1 file2 [....] - To gzip a file: cryptest z <compression-level> input output - To gunzip a file: cryptest u input output - To run validation tests: cryptest v - To run benchmarks: cryptest b [time for each benchmark in seconds]
标签： Cryptographic Primitives generate Library
上传时间： 2015-07-16
上传用户：wqxstar
THIS is really two books in one: a tutorial and a reference manual for JDBC, the application programming interface that makes it possible for programmers to access databases from Java. The goal is to be useful to a wide range of readers, from database novices to database experts. Therefore, we have arranged the book so that information needed only by experts is separated out from the basic material. We hope that driver developers as well as application programmers and MIS administrators will find what they need. Because different sections are aimed at different audiences, we expect that few people will read every page. We have sometimes duplicated explanations in an effort to make reading easier for those who do not read all sections. This book will be most helpful to those who have some knowledge of the Java programming language and SQL (Structured Query Language), but one doesn t need to be an expert in either to understand the basic concepts presented here.
标签： application reference tutorial program
上传时间： 2015-08-04
上传用户：zhengzg
The book "The Finite Difference Time Domain for Electromagnetics" by Karl Kunz and Raymond Luebbers, CRC Press, 1993, contains an FDTD code and output files in Appendix B. The same code and output files are contained in this directory.
标签： Electromagnetics Difference The Luebbers
上传时间： 2013-12-29
上传用户：chongcongying
Basic Test Concepts DC Parameters AC Parameters Functional Parameters Device Characterization Test Program Development Analog Test Concepts Test Using DSP Techniques in Testing Noise Reduction Techniques in Testing
标签： Parameters Characterization Functional Concepts
上传时间： 2013-12-20
上传用户：libinxny
/* * EULER S ALGORITHM 5.1 * * TO APPROXIMATE THE SOLUTION OF THE INITIAL VALUE PROBLEM: * Y = F(T,Y), A<=T<=B, Y(A) = ALPHA, * AT N+1 EQUALLY SPACED POINTS IN THE INTERVAL [A,B]. * * INPUT: ENDPOINTS A,B INITIAL CONDITION ALPHA INTEGER N. * * OUTPUT: APPROXIMATION W TO Y AT THE (N+1) VALUES OF T. */
标签： APPROXIMATE ALGORITHM THE SOLUTION
上传时间： 2015-08-20
上传用户：zhangliming420
This section contains a brief introduction to the C language. It is intended as a tutorial on the language, and aims at getting a reader new to C started as quickly as possible. It is certainly not intended as a substitute for any of the numerous textbooks on C. 2. write a recursive function FIB (n) to find out the nth element in theFibanocci sequence number which is 1,1,2,3,5,8,13,21,34,55,…3. write the prefix and postfix form of the following infix expressiona + b – c / d + e * f – g * h / i ^ j4. write a function to count the number of nodes in a binary tr
标签： introduction the contains intended
上传时间： 2013-12-23
上传用户：liansi
Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search main.cpp Then you can run it: ./search The input is loaded from a input file in.txt Here is the format of the input file: The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm. The second line of input file shoud be an integer m indicate the number of connections for the map. Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist. The following input are for A* The following line contains two chars indicate the source and destination city for A* algorithm. Then there is an integer h indicate the number of heuristic. The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist.
标签： Implemented following compile command
上传时间： 2014-01-01
上传用户：lhc9102
palm编成,这种书很少,有兴趣看看 Title: Palm Programming: The Developer s Guide URL: http://safari.oreilly.com/JVXSL.asp?x=1&mode=section&sortKey=rank&sortOrder=desc&view=book&xmlid=1-56592-525-4&open=false&srchText=palm+programming&code=&h=&m=&l=1&catid=&s=1&b=1&f=1&t=1&c=1&u=1&page=0 ISBN: 1-56592-525-4 Author: Julie McKeehan/ Neil Rhodes Publisher: O Reilly Page: 478 Edition: 1st edition (December 1998) Catalog: PDA programming / Palm Format: pdf Size: 2.06M Supplier: Summary: Emerging as the bestselling hand-held computers of all time, PalmPilots have spawned intense developer activity and a fanatical following. Used by Palm in their developer training, this tutorial-style book shows intermediate to experienced C programmers how to build a Palm application from the ground up. Includes a CD-ROM with source code and third-party developer tools
标签： Programming Developer oreilly safari
上传时间： 2013-12-10
上传用户：litianchu
Basic Compression Library by Marcus Geelnard Release 1.2.0 2006-07-22 Introduction The Basic Compression Library is a library of well known compression algorithms implemented in portable ANSI C code. For more information about the Basic Compression Library, please read the manual (doc/manual.pdf) and, of course, the source code.
标签： Introduction Compression Geelnard Library
上传时间： 2015-10-06
上传用户：
Java Regex Primer Since version 1.4, Java has had support for Regular Expressions in the core API. Java Regex follows the same basic principles used in other languages, just withdi erent access methods, and some subtledi erences with the patterns. This primer is aimed towards developers already familiar with regex in other languages wanting a brief outline of its support in Java. It may also be beneficial to developers learning regex if used in conjunction with detailed documentation explaining the construction of regex patterns. Reading the javadoc forjava.util.regex. Pattern is a must to see how the Java regex patterns aredi erent from other languages such as Perl. Most of the functions discussed herin are from thejava.util.regex. Matcher class with a few fromjava.util.regex. Pattern. Reading this text in conjunction with the javadoc of those classes is advised.
标签： Java Expressions Regular version
上传时间： 2013-12-18
上传用户：lanhuaying
