See Appendix B for a description of the programs included on this companion disk. RESOURCE.WRI identifies other books and resources for Internet programming. WEBHELP.HLP contains an introduction to the World Wide Web. TCPMAN.HLP provides detailed instructions to help you use the Trumpet Winsock included on this disk. Use the Program Manager s File menu Run option to execute the SETUP.EXE program found on this disk. SETUP.EXE will install the programs on your hard drive and create an Internet Programming group window. Internet编程技术 [配套程序] [涉及平台] VC [作者] void [文件大小] 1032K
标签： description companion Appendix RESOURCE
上传时间： 2013-12-04
上传用户：asasasas
加密算法 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
/* * 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
* "Copyright (c) 2006 Robert B. Reese ("AUTHOR")" * All rights reserved. * (R. Reese, reese@ece.msstate.edu, Mississippi State University) * IN NO EVENT SHALL THE "AUTHOR" BE LIABLE TO ANY PARTY FOR * DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES ARISING OUT * OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN IF THE "AUTHOR" * HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
上传时间： 2015-09-24
上传用户：mpquest
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
the calculator s usage! after you have inputed 2 operators,choose + - * / function! But the only situation I did t deal with is that when you choos + fuction ,and the operaters signs is like this -A+B,just turn it to B-A!
标签： calculator the operators function
上传时间： 2016-02-12
上传用户：lili123
Floyd-Warshall算法描述 1)适用范围： a)APSP(All Pairs Shortest Paths) b)稠密图效果最佳 c)边权可正可负 2)算法描述： a)初始化：dis[u,v]=w[u,v] b)For k:=1 to n For i:=1 to n For j:=1 to n If dis[i,j]>dis[i,k]+dis[k,j] Then Dis[I,j]:=dis[I,k]+dis[k,j] c)算法结束：dis即为所有点对的最短路径矩阵 3)算法小结：此算法简单有效，由于三重循环结构紧凑，对于稠密图，效率要高于执行|V|次Dijkstra算法。时间复杂度O(n^3)。 考虑下列变形：如(I,j)∈E则dis[I,j]初始为1,else初始为0，这样的Floyd算法最后的最短路径矩阵即成为一个判断I,j是否有通路的矩阵。更简单的，我们可以把dis设成boolean类型，则每次可以用“dis[I,j]:=dis[I,j]or(dis[I,k]and dis[k,j])”来代替算法描述中的蓝色部分，可以更直观地得到I,j的连通情况。
标签： Floyd-Warshall Shortest Pairs Paths
上传时间： 2013-12-01
上传用户：dyctj
This a linux device driver for Ralink RT2500USB b/g WLAN Card. This driver implements basic 802.11 function. Infrastructure and Ad-hoc mode with open or shared or wpapsk or wpa2psk authentication method. WEP-40 and WEP-104 or tkip or aes encryption.
标签： driver This implements Ralink
上传时间： 2016-03-10
上传用户：cc1015285075
简易数字频率计题解.（ 1997年 B 题 ） 编写与讲解人:田良(东南大学无线电系,2003年3月12日) 一）任务 设计并制作一台数字显示的简易频率计。 （二）要求 1.基本要求 (1)频率测量 a.测量范围 信号：方波、正弦波 幅度：0.5V～5V[注] 频率：1Hz～1MHz b.测试误差≤0.1％ (2)周期测量 a.测量范围 信号：方波、正弦波 幅度：0.5V～5V[注] 频率：1Hz～1MHz b.测试误差≤0.1％ 3） 脉冲宽度测量 a.测量范围 信号：脉冲波 幅度：0.5V～5V[注] 脉冲宽度≥100μs b.测试误差≤0.1％ （4）显示器 十进制数字显示，显示刷新时间1～10秒 连续可调，对上述三种测量功能分别采用不同颜色的 发光二极管指示。 （5）具有自校功能，时标信号频率为1MHz。 （6）自行设计并制作满足本设计任务要求的稳压电源
上传时间： 2013-12-26
上传用户：xg262122
％调用格式 =trapez_g( f_name ,a,b,n) ％f_name: 被积函数的文件名f(x) ％ a:x的上限 ％ b:x的下限 ％ 部分区间数 ％实例：trapez_g( sin ,0,pi,20)
上传时间： 2013-12-19
上传用户：cjl42111
