MD5 加 密的V i s u a l C + + S o u r c e C o d e .
標(biāo)簽: MD5
上傳時間: 2014-01-04
上傳用戶:lunshaomo
假定已經(jīng)有許多應(yīng)用采用了程序1 - 1 5中所定義的C u r r e n c y類,現(xiàn)在我們想要對C u r r e n c y類 的描述進行修改,使其應(yīng)用頻率最高的兩個函數(shù)A d d和I n c r e m e n t可以運行得更快,從而提高應(yīng) 用程序的執(zhí)行速度。由于用戶僅能通過p u b l i c部分所提供的接口與C u r r e n c y類進行交互,
上傳時間: 2015-10-11
上傳用戶:BIBI
鄰接矩陣類的根是A d j a c e n c y W D i g r a p h,因此從這個類開始。程序1 2 - 1給出了類的描述。程 序中,先用程序1 - 1 3中函數(shù)Make2DArray 為二組數(shù)組a 分配空間,然后對數(shù)組a 初始化,以描述 一個n 頂點、沒有邊的圖的鄰接矩陣,其復(fù)雜性為( n2 )。該代碼沒有捕獲可能由M a k e 2 D A r r a y 引發(fā)的異常。在析構(gòu)函數(shù)中調(diào)用了程序1 - 1 4中的二維數(shù)組釋放函數(shù)D e l e t e 2 D
標(biāo)簽: 矩陣
上傳時間: 2013-12-21
上傳用戶:lanjisu111
第二個搜索函數(shù)為私有成員函數(shù)S a v e S e a r c h,由插入和刪除操作來調(diào)用。S a v e S e a r c h不僅 包含了S e a r c h的功能,而且可把每一級中遇到的最后一個節(jié)點存放在數(shù)組l a s t之中
上傳時間: 2015-10-11
上傳用戶:zm7516678
In 1960, R.E. Kalman published his famous paper describing a recursive solution to the discrete-data linear filtering problem. Since that time, due in large part to advances in digital computing, the Kalman filter has been the subject of extensive research and application, particularly in the area of autonomous or assisted navigation.
標(biāo)簽: R.E. discrete-dat describing published
上傳時間: 2015-10-22
上傳用戶:2404
In 1960, R.E. Kalman published his famous paper describing a recursive solution to the discretedata linear filtering problem [Kalman60]. Since that time, due in large part to advances in digital computing, the Kalman filter has been the subject of extensive research and application, particularly in the area of autonomous or assisted navigation. A very “friendly” introduction to the general idea of the Kalman filter can be found in Chapter 1 of [Maybeck79], while a more complete introductory discussion can be found in [Sorenson70], which also contains some interesting historical narrative.
標(biāo)簽: R.E. discretedata describing published
上傳時間: 2015-10-22
上傳用戶:a673761058
代入法的啟發(fā)示搜索 我的代碼實現(xiàn)是:按照自然語言各字母出現(xiàn)頻率的大小從高到低(已經(jīng)有人作國統(tǒng)計分析了)先生成一張字母出現(xiàn)頻率統(tǒng)計表(A)--------(e),(t,a,o,i,n,s,h,r),(d,l),(c,u,m,w,f,g,y,p,b),(v,k,j,x,q,z) ,再對密文字母計算頻率,并按頻率從高到低生成一張輸入密文字母的統(tǒng)計表(B),通過兩張表的對應(yīng)關(guān)系,不斷用A中的字母去替換B中的字母,搜索不成功時就回退,在這里回朔是一個關(guān)鍵。
上傳時間: 2015-10-24
上傳用戶:wanqunsheng
Let the following relational tables be given: R = (A, B, C) and S = (D, E, F) where A, B, C, D, E, and F are the attributes (columns). Write the SQL statements that will express each of the queries given below:
標(biāo)簽: relational following tables given
上傳時間: 2014-01-14
上傳用戶:cx111111
替代加密: A B C D E F G H I J K L M N O P Q R S T U V W 密文 Y Z D M R N H X J L I O Q U W A C B E G F K P 明文 X Y Z T S V I HAVE A DREAM!# 密文?? 用ARM編程實現(xiàn)替代加密。
標(biāo)簽: 加密
上傳時間: 2016-07-17
上傳用戶:qq521
進程間通信14 說明了進程控制原語并且觀察了如何調(diào)用多個進程。但是這些進程之間交換信息的 唯一方法是經(jīng)由f o r k或e x e c傳送打開文件,或通過文件系統(tǒng)。本章將說明進程之間相互通信的 其他技術(shù)—I P C(InterProcess Communication)。
上傳時間: 2013-12-03
上傳用戶:zhenyushaw
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1