亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频

蟲蟲首頁| 資源下載| 資源專輯| 精品軟件
登錄| 注冊

to<b>STRING</b>

  • See Appendix B for a description of the programs included on this companion disk. RESOURCE.WRI iden

    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ù) [配套程序] [涉及平臺] VC [作者] void [文件大小] 1032K

    標(biāo)簽: description companion Appendix RESOURCE

    上傳時間: 2013-12-04

    上傳用戶:asasasas

  • 加密算法 Test Driver for Crypto++, a C++ Class Library of Cryptographic Primitives: - To generate an

    加密算法 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

    上傳時間: 2015-07-16

    上傳用戶:wqxstar

  • * "Copyright (c) 2006 Robert B. Reese ("AUTHOR")" * All rights reserved. * (R. Reese, reese@ece.

    * "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.

    標(biāo)簽: Reese B. R. Copyright

    上傳時間: 2015-09-24

    上傳用戶:mpquest

  • This I develops based on the B/S structure student managementsystem management system, hoped brings

    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

    上傳時間: 2014-01-07

    上傳用戶:釣鰲牧馬

  • Verilog HDL: Magnitude For a vector (a,b), the magnitude representation is the following: A c

    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

    上傳時間: 2013-12-24

    上傳用戶:金宜

  • design LP,HP,B S digital Butterworth and Chebyshev filter. All array has been specified internally

    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

    上傳時間: 2015-11-08

    上傳用戶:253189838

  • About: hamsterdb is a database engine written in ANSI C. It supports a B+Tree index structure, uses

    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

    上傳時間: 2013-12-11

    上傳用戶:LouieWu

  • Floyd-Warshall算法描述 1)適用范圍: a)APSP(All Pairs Shortest Paths) b)稠密圖效果最佳 c)邊權(quán)可正可負(fù) 2)算法描述: a)初始化:d

    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即為所有點對的最短路徑矩陣 3)算法小結(jié):此算法簡單有效,由于三重循環(huán)結(jié)構(gòu)緊湊,對于稠密圖,效率要高于執(zhí)行|V|次Dijkstra算法。時間復(fù)雜度O(n^3)。 考慮下列變形:如(I,j)∈E則dis[I,j]初始為1,else初始為0,這樣的Floyd算法最后的最短路徑矩陣即成為一個判斷I,j是否有通路的矩陣。更簡單的,我們可以把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

    上傳時間: 2013-12-01

    上傳用戶:dyctj

  • basic.c */ /**//* Project:NeuroBasic, basic package*//**/ /* Survey:This is a simple Basic b-code

    basic.c */ /**//* Project:NeuroBasic, basic package*//**/ /* Survey:This is a simple Basic b-code compiler which*/ /*can be used as a comfortable command shell for */ /* any program. The actual compiler is found in */ /*compiler.c.*/ /*The functions m_fctptr() and user_server()*/ /*build an interface to an

    標(biāo)簽: basic NeuroBasic Project package

    上傳時間: 2017-02-15

    上傳用戶:xymbian

  • 該程序用以查找任意兩個整數(shù)之間的所有素數(shù)。 Prime number finder can find all primes between a and b and will write the res

    該程序用以查找任意兩個整數(shù)之間的所有素數(shù)。 Prime number finder can find all primes between a and b and will write the results to the file PRIMES.TXT

    標(biāo)簽: and between number finder

    上傳時間: 2014-01-14

    上傳用戶:cccole0605

主站蜘蛛池模板: 临湘市| 顺平县| 祁阳县| 黄冈市| 仁化县| 克拉玛依市| 嘉定区| 罗江县| 赤水市| 旅游| 浦江县| 西丰县| 时尚| 克东县| 芷江| 鹤山市| 城口县| 边坝县| 清原| 乐清市| 仙游县| 红河县| 周至县| 益阳市| 乌兰察布市| 琼海市| 科技| 牙克石市| 南木林县| 防城港市| 敖汉旗| 永丰县| 连城县| 邛崃市| 永定县| 宜昌市| 荣成市| 天长市| 北流市| 咸阳市| 区。|