加密算法 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
本文就采用面对对象的方法以UML为建模语言，使用PowerDesigner这个case工具分析设计一个分布式的B/S结构的基于COM+和XML的网络考试系统。并使用Delphi、VBScript、ADO、XML、HTML等编程工具、语言和技术实现了这个系统。
上传时间： 2015-09-25
上传用户：sy_jiadeyi
acm HDOJ 1051WoodenSticks Description: There is a pile of n wooden sticks. The length and weight of each stick are known in advance. The sticks are to be processed by a woodworking machine in one by one fashion. It needs some time, called setup time, for the machine to prepare processing a stick. The setup times are associated with cleaning operations and changing tools and shapes in the machine. The setup times of the woodworking machine are given as follows: (a) The setup time for the first wooden stick is 1 minute. (b) Right after processing a stick of length l and weight w , the machine will need no setup time for a stick of length l and weight w if l<=l and w<=w . Otherwise, it will need 1 minute for setup.
标签： WoodenSticks Description length wooden
上传时间： 2014-03-08
上传用户：netwolf
[输入] 图的顶点个数N，图中顶点之间的关系及起点A和终点B [输出] 若A到B无路径，则输出“There is no path” 否则输出A到B路径上个顶点 [存储结构] 图采用邻接矩阵的方式存储。 [算法的基本思想] 采用广度优先搜索的方法，从顶点A开始，依次访问与A邻接的顶点VA1,VA2,...,VAK, 访问遍之后,若没有访问B，则继续访问与VA1邻接的顶点VA11,VA12,...,VA1M，再访问与VA2邻接顶点...，如此下去，直至找到B，最先到达B点的路径，一定是边数最少的路径。实现时采用队列记录被访问过的顶点。每次访问与队头顶点相邻接的顶点，然后将队头顶点从队列中删去。若队空，则说明到不存在通路。在访问顶点过程中，每次把当前顶点的序号作为与其邻接的未访问的顶点的前驱顶点记录下来，以便输出时回溯。 #include<stdio.h> int number //队列类型 typedef struct{ int q[20]
标签： 输入
上传时间： 2015-11-16
上传用户：ma1301115706
分布式图书管理系统，支持XML-WebService,Remoting,C/S ,b/s
上传时间： 2015-12-23
上传用户：xieguodong1234
本人编写的incremental 随机神经元网络算法，该算法最大的特点是可以保证approximation特性，而且速度快效果不错，可以作为学术上的比较和分析。目前只适合benchmark的regression问题。 具体效果可参考 G.-B. Huang, L. Chen and C.-K. Siew, “Universal Approximation Using Incremental Constructive Feedforward Networks with Random Hidden Nodes”, IEEE Transactions on Neural Networks, vol. 17, no. 4, pp. 879-892, 2006.
标签： incremental 编写 神经元网络 算法
上传时间： 2016-09-18
上传用户：litianchu
Given Perl s natural fit for web applications development, it s no surprise that Perl is also a natural choice for web services development. It s the most popular web programming language, with strong implementations of both SOAP and XML-RPC, the leading ways to distribute applications using web services. But books on web services focus on writing these applications in Java or Visual Basic, leaving Perl programmers with few resources to get them started. "Programming Web Services with Perl" changes that, bringing Perl users all the information they need to create web services using their favorite language.
标签： Perl applications development surprise
上传时间： 2014-11-21
上传用户：xiaoyunyun
jsp和xml。XML and JSP are two important tools available in producing a web application. This chapter examines the potential of mixing these two technologies in order to enhance the capabilities of JSP. While this chapter will cover many things about XML, this chapter will not attempt to teach XML. Instead it focuses on how JSP and XML can be used together as a highly flexible and powerful tool. In general the usage of XML in these examples will be kept simple and should cause no problems for users who are starting XML.
标签： application important available producing
上传时间： 2013-12-10
上传用户：1427796291
The W3C DOM Core interfaces defines a minimal set of: A. interfaces for accessing and manipulating document objects B. Java object implementations for use with XML parsers. C. Conventions and processes for creating live HTML pages. D. Mutable document
标签： interfaces A. manipulating accessing
上传时间： 2017-01-24
上传用户：edisonfather
生成Trick文件工具 1.Open command line 2.input tricktest Usage: TrickTest -f -o -i -f source mpeg2 file to trick -o trick output directory -i output file id -m max coding error, default 0 -b max bitrate for trick generate, default 0 mean no limit -s trick buffer block size, must be n*188 -l log file, default c:\tricktest.log example: tricktest -f 黑鹰行动.mpg -o c:\temp -i A -m 1000 -b 3750000 soure file: 黑鹰行动.mpg output directory: c:\temp filename: 000000A,000000A.ff,000000A.fr,000000A.vvx max coding error: 1000 trick generation speed: 3750000 bps a
标签： TrickTest tricktest command source
上传时间： 2014-01-23
上传用户：水口鸿胜电器
