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編程技術(shù) [配套程序] [涉及平臺(tái)] VC [作者] void [文件大小] 1032K
標(biāo)簽： description companion Appendix RESOURCE
上傳時(shí)間： 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]
標(biāo)簽： Cryptographic Primitives generate Library
上傳時(shí)間： 2015-07-16
上傳用戶：wqxstar
This I develops based on the B/S structure student managementsystem management system, hoped brings a help to the novice
標(biāo)簽： managementsystem management structure develops
上傳時(shí)間： 2014-01-07
上傳用戶：釣鰲牧馬
Verilog HDL: Magnitude For a vector (a,b), the magnitude representation is the following: A common approach to implementing these arithmetic functions is to use the Coordinate Rotation Digital Computer (CORDIC) algorithm. The CORDIC algorithm calculates the trigonometric functions of sine, cosine, magnitude, and phase using an iterative process. It is made up of a series of micro-rotations of the vector by a set of predetermined constants, which are powers of two. Using binary arithmetic, this algorithm essentially replaces multipliers with shift and add operations. In a Stratix™ device, it is possible to calculate some of these arithmetic functions directly, without having to implement the CORDIC algorithm.
標(biāo)簽： representation Magnitude the magnitude
上傳時(shí)間： 2013-12-24
上傳用戶：金宜
該系統(tǒng)是基于J2EE框架的一個(gè)B/S的網(wǎng)上書店電子商務(wù)系統(tǒng)。采用B/S模式為企業(yè)提供強(qiáng)大的電子商務(wù)平臺(tái)。實(shí)現(xiàn)對(duì)企業(yè)供產(chǎn)銷系統(tǒng)的全面信息監(jiān)控，同時(shí)提高整個(gè)網(wǎng)上書店的信息系統(tǒng)的安全性。通過WEB服務(wù)器使客戶通過瀏覽器與服務(wù)器進(jìn)行信息溝通。通過JDBC技術(shù)實(shí)現(xiàn)與數(shù)據(jù)庫的動(dòng)態(tài)掛接，提供的信息的鮮度，采用MVC模式提供系統(tǒng)的靈活性和可移植性，實(shí)現(xiàn)對(duì)網(wǎng)上書店的信息系統(tǒng)的全局信息監(jiān)控和分析。運(yùn)用O/R Mapping理論，使用Mysql數(shù)據(jù)庫。本系統(tǒng)主要采用四個(gè)層次：視圖層、業(yè)務(wù)邏輯層、ORM層，數(shù)據(jù)庫層。含商品發(fā)布及管理子系統(tǒng)、訂單子系統(tǒng)合物流子系統(tǒng)、以及綜合管理系統(tǒng)。
標(biāo)簽： J2EE 電子商務(wù)系統(tǒng) 模式
上傳時(shí)間： 2015-11-01
上傳用戶：ryb
design LP,HP,B S digital Butterworth and Chebyshev filter. All array has been specified internally,so user only need to input f1,f2,f3,f4,fs(in hz), alpha1,alpha2(in db) and iband (to specify the type of to design). This program output hk(z)=bk(z)/ak(z),k=1,2,..., ksection and the freq.
標(biāo)簽： Butterworth internally Chebyshev specified
上傳時(shí)間： 2015-11-08
上傳用戶：253189838
About: hamsterdb is a database engine written in ANSI C. It supports a B+Tree index structure, uses memory mapped I/O (if available), supports cursors, and can create in-memory databases. Release focus: Major feature enhancements Changes: This release comes with many changes and new features. It can manage multiple databases in one file. A new flag (HAM_LOCK_EXCLUSIVE) places an exclusive lock on the file. hamsterdb was ported to Windows CE, and the Solution file for Visual Studio 2005 now supports builds for x64. Several minor bugs were fixed, performance was improved, and small API changes occurred. Pre-built libraries for Windows (32-bit and 64-bit) are available for download. Author: cruppstahl
標(biāo)簽： C. hamsterdb structure database
上傳時(shí)間： 2013-12-11
上傳用戶：LouieWu
結(jié)合單片機(jī)和M a t l a b 兩者的優(yōu)點(diǎn)，基于事件驅(qū)動(dòng)的中斷通信機(jī)制，提出一種Matlab 環(huán)境下PC 機(jī)與 單片機(jī)實(shí)時(shí)串行通信及數(shù)據(jù)處理的方法；完成單片機(jī)數(shù)據(jù)采集系統(tǒng)與PC 機(jī)的RS-232/RS-485 串行通 信及其通信數(shù)據(jù)的分析處理、文件存儲(chǔ)、F I R 濾波及圖形顯示；簡(jiǎn)化系統(tǒng)開發(fā)流程，提高開發(fā)效率。 該方法已成功應(yīng)用于一個(gè)P I C 1 6 F 8 7 6 單片機(jī)應(yīng)用系統(tǒng)實(shí)例之中
標(biāo)簽： 單片機(jī)
上傳時(shí)間： 2014-01-19
上傳用戶：yzy6007
Floyd-Warshall算法描述 1)適用范圍： a)APSP(All Pairs Shortest Paths) b)稠密圖效果最佳 c)邊權(quán)可正可負(fù) 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)算法結(jié)束：dis即為所有點(diǎn)對(duì)的最短路徑矩陣 3)算法小結(jié)：此算法簡(jiǎn)單有效，由于三重循環(huán)結(jié)構(gòu)緊湊，對(duì)于稠密圖，效率要高于執(zhí)行|V|次Dijkstra算法。時(shí)間復(fù)雜度O(n^3)。 考慮下列變形：如(I,j)∈E則dis[I,j]初始為1,else初始為0，這樣的Floyd算法最后的最短路徑矩陣即成為一個(gè)判斷I,j是否有通路的矩陣。更簡(jiǎn)單的，我們可以把dis設(shè)成boolean類型，則每次可以用“dis[I,j]:=dis[I,j]or(dis[I,k]and dis[k,j])”來代替算法描述中的藍(lán)色部分，可以更直觀地得到I,j的連通情況。
標(biāo)簽： Floyd-Warshall Shortest Pairs Paths
上傳時(shí)間： 2013-12-01
上傳用戶：dyctj
實(shí)現(xiàn)最優(yōu)二叉樹的構(gòu)造；在此基礎(chǔ)上完成哈夫曼編碼器與譯碼器。 假設(shè)報(bào)文中只會(huì)出現(xiàn)如下表所示的字符： 字符 A B C D E F G H I J K L M N 頻度 186 64 13 22 32 103 21 15 47 57 1 5 32 20 57 字符 O P Q R S T U V W X Y Z ， ． 頻度 63 15 1 48 51 80 23 8 18 1 16 1 6 2 要求完成的系統(tǒng)應(yīng)具備如下的功能： 1．初始化。從終端（文件）讀入字符集的數(shù)據(jù)信息，。建立哈夫曼樹。 2．編碼：利用已建好的哈夫曼樹對(duì)明文文件進(jìn)行編碼，并存入目標(biāo)文件（哈夫曼碼文件）。 3．譯碼：利用已建好的哈夫曼樹對(duì)目標(biāo)文件（哈夫曼碼文件）進(jìn)行編碼，并存入指定的明文文件。 4．輸出哈夫曼編碼文件：輸出每一個(gè)字符的哈夫曼編碼。
上傳時(shí)間： 2014-11-23
上傳用戶：shanml
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
