加密算法 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
上傳用戶(hù)：wqxstar
//=== === === === === === === === === === === ===== //函數(shù)說(shuō)明 //函數(shù)名稱(chēng)：Correlation //函數(shù)功能：計(jì)算最小二乘法擬合的多項(xiàng)式的相關(guān)系數(shù) //使用方法：int M------ 擬合多項(xiàng)式的階數(shù)（已知條件） // double *b--- 擬合曲線(xiàn)的系數(shù),排列順序?yàn)橛筛唠A到低階（已知條件） // double *x--- 結(jié)點(diǎn)x軸數(shù)據(jù)（已知條件） // double *y--- 結(jié)點(diǎn)y軸數(shù)據(jù)（已知條件） // double *Yg-- 結(jié)點(diǎn)估計(jì)值，個(gè)數(shù)為m（過(guò)程變量） // int m------ 結(jié)點(diǎn)個(gè)數(shù)（已知條件） //注意事項(xiàng)：多項(xiàng)式階數(shù)最高為10,多項(xiàng)式的形式為 y = a0 + a1x +a2x2
標(biāo)簽： Correlation 函數(shù) 計(jì)算 最小二乘法擬合
上傳時(shí)間： 2013-11-26
上傳用戶(hù)：change0329
//=== === === === === === === === === === === ===== //函數(shù)說(shuō)明 //函數(shù)名稱(chēng)：Correlation //函數(shù)功能：計(jì)算最小二乘法擬合的多項(xiàng)式的相關(guān)系數(shù) //使用方法：int M------擬合多項(xiàng)式的項(xiàng)數(shù)（已知條件） // double *b---擬合曲線(xiàn)的系數(shù),按升次排列（已知條件） // double *x---結(jié)點(diǎn)x軸數(shù)據(jù)（已知條件） // double *y---結(jié)點(diǎn)y軸數(shù)據(jù)（已知條件） // double *Yg--結(jié)點(diǎn)估計(jì)值，與*y相對(duì)應(yīng)，個(gè)數(shù)為m（過(guò)程變量） // int m------結(jié)點(diǎn)個(gè)數(shù)（已知條件） //注意事項(xiàng)：多項(xiàng)式階數(shù)最高為10,多項(xiàng)式的形式為 y = b0 + b1*(x-Xavr)...
標(biāo)簽： Correlation 函數(shù) 計(jì)算 最小二乘法擬合
上傳時(shí)間： 2014-11-23
上傳用戶(hù)：yxgi5
光學(xué)設(shè)計(jì)軟件zemax源碼： This DLL models an nular aspheric surface as described in: "Annular surfaces in annular field systems" By Jose M. Sasian Opt. eng. 36 (12) P 3401-3401 December 1997 This surface is essentially an odd aspheric surface with an offset in the aspheric terms. The sag is given by: Z = (c*r*r) / (1+(1-((1+k)*c*c*r*r))^ 1/2 ) + a*(r-q)^2 + b*(r-q)^3 + c*(r-q)^4 + ... Note the terms a, b, c, ... have units of length to the -1, -2, -3, ... power.
標(biāo)簽： described aspheric surfaces Annular
上傳時(shí)間： 2014-01-08
上傳用戶(hù)：yyyyyyyyyy
MATLAB 6_5 輔助優(yōu)化計(jì)算與設(shè)計(jì) 1、文件命名說(shuō)明 a)文件夾“第1章”中的文件對(duì)應(yīng)書(shū)中第1章的例程，其他以此類(lèi)推； b) 文件名exampleX1_X2.m：對(duì)應(yīng)例程X1_X2 例如：example2_1表示例程2_1. 2、注意 為了方便起見(jiàn)，書(shū)中的每一個(gè)例程存為一個(gè)文件；而有些例程中將其調(diào)用的函數(shù)文件也放在這個(gè)例程文件中，所以讀者在運(yùn)行光盤(pán)中的例程文件時(shí)注意這一點(diǎn)，如果是這樣的例程文件應(yīng)該將其調(diào)用的函數(shù)文件分離出來(lái)另存為一個(gè)文件。
標(biāo)簽： MATLAB 輔助 優(yōu)化計(jì)算
上傳時(shí)間： 2015-08-05
上傳用戶(hù)：王小奇
crc任意位生成多項(xiàng)式 任意位運(yùn)算 自適應(yīng)算法 循環(huán)冗余校驗(yàn)碼(CRC，Cyclic Redundancy Code)是采用多項(xiàng)式的 編碼方式，這種方法把要發(fā)送的數(shù)據(jù)看成是一個(gè)多項(xiàng)式的系數(shù) ，數(shù)據(jù)為bn-1bn-2…b1b0 (其中為0或1)，則其對(duì)應(yīng)的多項(xiàng)式為： bn-1Xn-1+bn-2Xn-2+…+b１X+b０ 例如：數(shù)據(jù)“10010101”可以寫(xiě)為多項(xiàng)式 X７+X４+X２+1。 循環(huán)冗余校驗(yàn)CRC 循環(huán)冗余校驗(yàn)方法的原理如下： (1) 設(shè)要發(fā)送的數(shù)據(jù)對(duì)應(yīng)的多項(xiàng)式為P(x)。 (2) 發(fā)送方和接收方約定一個(gè)生成多項(xiàng)式G(x)，設(shè)該生成多項(xiàng)式 的最高次冪為r。 (3) 在數(shù)據(jù)塊的末尾添加r個(gè)0，則其相對(duì)應(yīng)的多項(xiàng)式為M(x)=XrP(x) 。(左移r位) (4) 用M(x)除以G(x)，獲得商Q(x)和余式R(x)，則 M(x)=Q(x) ×G(x)+R(x)。 (5) 令T(x)=M(x)+R(x)，采用模2運(yùn)算，T(x)所對(duì)應(yīng)的數(shù)據(jù)是在原數(shù) 據(jù)塊的末尾加上余式所對(duì)應(yīng)的數(shù)據(jù)得到的。 (6) 發(fā)送T(x)所對(duì)應(yīng)的數(shù)據(jù)。 (7) 設(shè)接收端接收到的數(shù)據(jù)對(duì)應(yīng)的多項(xiàng)式為T(mén)’(x)，將T’(x)除以G(x) ，若余式為0，則認(rèn)為沒(méi)有錯(cuò)誤，否則認(rèn)為有錯(cuò)。
標(biāo)簽： crc CRC 多項(xiàng)式 位運(yùn)算
上傳時(shí)間： 2014-11-28
上傳用戶(hù)：宋桃子
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.
標(biāo)簽： Implemented following compile command
上傳時(shí)間： 2014-01-01
上傳用戶(hù)：lhc9102
該源碼是一個(gè)問(wèn)題的解決方法。問(wèn)題是給你個(gè)長(zhǎng)為L(zhǎng)的串，串中可以出現(xiàn)n種字符，還給出m個(gè)子串，求有多少個(gè)長(zhǎng)為n的只由這些字串組成的串。輸入例子：4 5 6 ABB BCA BCD CAB CDD DDA 結(jié)果為2.而5 4 5 E D C B A的結(jié)果為625
標(biāo)簽： 源碼
上傳時(shí)間： 2014-01-12
上傳用戶(hù)：水中浮云
palm編成,這種書(shū)很少,有興趣看看 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
標(biāo)簽： Programming Developer oreilly safari
上傳時(shí)間： 2013-12-10
上傳用戶(hù)：litianchu
假定已經(jīng)有許多應(yīng)用采用了程序1 - 1 5中所定義的C u r r e n c y類(lèi)，現(xiàn)在我們想要對(duì)C u r r e n c y類(lèi) 的描述進(jìn)行修改，使其應(yīng)用頻率最高的兩個(gè)函數(shù)A d d和I n c r e m e n t可以運(yùn)行得更快，從而提高應(yīng) 用程序的執(zhí)行速度。由于用戶(hù)僅能通過(guò)p u b l i c部分所提供的接口與C u r r e n c y類(lèi)進(jìn)行交互，
上傳時(shí)間： 2015-10-11
上傳用戶(hù)：BIBI
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1
