散列演算法 的英文怎麼說

中文拼音 [sǎnlièyǎnsuànfǎ]
散列演算法 英文
hash algorithm
  • 散 : 散動詞1. （由聚集而分離） break up; disperse 2. （散布） distribute; disseminate; give out 3. （排除） dispel; let out
  • 列 : Ⅰ動1 （排列） arrange; form a line; line up 2 （安排到某類事物之中） list; enter in a list Ⅱ名詞1...
  • 演 : 動詞1 （演變; 演化） develop; evolve 2 （發揮） deduce; elaborate 3 （依照程式練習或計算） drill;...
  • 算 : Ⅰ動詞1 （計算數目） calculate; reckon; compute; figure 2 （計算進去） include; count 3 （謀劃;計...
  • 法 : Ⅰ名詞1 （由國家制定或認可的行為規則的總稱） law 2 （方法; 方式） way; method; mode; means 3 （標...
  1. The general purpose hash function algorithm library contains implementations for a series of commonly used additive and rotative string hashing algorithms in the c + + programming language

    通用哈希函數運演算法則庫包括一系列通常使用的附加的或者循環的字元竄散列法運演算法則，在c + +程序語言中。
  2. Ptwma is an effective successful algorithm and model to the knowledge discovery of the multiple streams time series

    Ptwma為分散式，并行控掘多流時間序列提供了一種有效的演算法和模型。
  3. Hashing algorithms produce unique binary message digests based on the code they sign

    根據要簽名的代碼，散列演算法產生唯一的二進制消息摘要。
  4. The discussion of main parallel technologies on construction of parallel sliq algorithm is presented in this paper. the computing result of algorithm complexity of sequential and parallel algorithm indicates : when the data set is large enough, as to continuous attributes, the parallel algorithm almost get speedup value equal to the number of processors ， while as to categorical attribute the improvement of parallel algorithm is limited

    通過對串列和并行演算法時間復雜度的計算表明，當數據集充分大時，由於連續屬性的排序計算操作分散到各個處理機單元上進行，顯著降低了計算時間，從而可以得到近似於處理機個數的加速比，對于離散屬性，本并行演算法對串列演算法的性能提高有限
  5. The agent of kdc according to the picture and individual character information which users input, the base key of producing automatically, make the conversation every side produce the self - same main key, has solved the problem of key distribute ingeniously. and it utilize irreversible hash function produce session key realize one - time key. the thesis has also analysed the application of different situations that the agent of kdc among the conversation modes in many ways

    本文提出的個性化kdc代理根據用戶輸入的圖片和個性信息，自動產生基密鑰，分別運用公開密鑰系統進行交換，使通話各方各自產生完全相同的主密鑰，巧妙地解決了密鑰分配和加密解密同步的問題，並利用單向散列函數的性質，基於相同的演算法產生用於加密解密的一次一密會話密鑰。
  6. Md5 message - digest algorithm 5 ; rfc 1321 is a widely used cryptographic hash function with a 128 - bit hash value

    Md5 （消息摘要演算法5 ； rfc 1321 ）是一種廣泛應用的加密散列函數，使用了128位的散列值。
  7. Select a hashing algorithm from the following list

    請從下表中選擇散列演算法。
  8. In this paper, we provide a summary of all the possible topologies of data grid replica location mechanisms based on the research status of related activities, and design a new kind named distributed replica information index location mechanism ( dilm ), which is based on the topology of improved ring and integrates four techniques : overlay network, bloom filter, soft - state protocol and md5

    本文介紹了數據格網復制定位研究的現狀，總結了數據格網復制定位可能的拓撲結構種類，提出了一種新的數據格網復制定位機制? ?分散式復制索引定位機制dilm 。 dilm基於改進環型拓撲結構，包含以下4種技術：重疊網路技術、 bloomfilter壓縮技術、軟狀態協議和md5散列演算法。
  9. Serial imitation of distributed parallel algorithm with row action method for band system

    帶狀方程組行處理法分散式演算法的串列模擬
  10. The algorithm of upgrading of general face recognition system is based on all serial algorithm in a single computer, it is very slow to deal with a large amount of data, and the efficiency is low. so, this article introduces the application of grid computing in face recognition system, upgrades the original serial algorithm of face data into parallel algorithm in the grid platform by using mpi parallel program, realizes the already existing updated algorithm of the recognition of face to be processed in the distributed computers, which has strengthened the systematic ability to deal with a large amount of data, in order to improve systematic performance

    常規人臉識別系統中的更新演算法都是基於單機的串列演算法，在處理大量數據的時候速度慢，效率低，介紹了網格計算在人臉識別系統中的應用，把原來的人臉數據更新串列演算法改為并行演算法並通過編寫mpi并行程序移植到該網格計算平臺中運行，實現了原有人臉識別系統中更新演算法的分散式處理，增強了系統處理大量數據的能力，以達到提高系統性能的目的。
  11. In this system, there are strong key is used for triple - des algorithm that up to 168 bits, it is used for rsa algorithm that up to 1024 bits, it is used for digital signature that 160 bits number that produces by sha - 1 algorithm. these algorithms have strong security against attack. so the email security can be ensured by them

    該系統採用的三重des演算法的有效密鑰為168bit ， sha - 1散列演算法產生的散列值為160bit ， rsa演算法密鑰可以達到1024bit以上，這些都對強行攻擊具有足夠的強度，從而保證了電子郵件信息的安全。
  12. Hash algorithms are techniques that computes a condensed representation of a message or data file.

    散列演算法是一種技術，用來計算信息或數據文件的壓縮表示方法。
  13. First, the hashing algorithm is applied to the code they wish to distribute

    首先，對所要分發的代碼應用散列演算法。
  14. If successful, the same hashing algorithm will be applied to the code

    如果驗證成功，則對該代碼使用同樣的散列演算法。
  15. The cost of applying the partitioning hash algorithm is proportional to the size of the partitioning key

    應用分區散列演算法的代價與分區鍵的規模成比例。
  16. The hashing algorithm is applied to the value of the partitioning key, and generates a partition number between zero and 4095

    散列演算法應用於分區鍵的值，產生0到4095之間的一個分區號。
  17. Trailing blanks in character strings char, varchar, graphic, or vargraphic are ignored by the hashing algorithm

    字元串中（ char 、 varchar graphic或vargraphic ）的尾部空格會被散列演算法忽略。
  18. Using the industry - accepted hash algorithm to protect the data integrity. and provided evidence of malice juggle occurred during the data transfer

    3 ）利用業界公認的散列演算法取保數據完整性，並提供數據傳送期間發生的惡意篡改的證據。
  19. The paper analyzes the one - way hash function ( sha - 1 ) and study the process of gaining keks from ak using sha - 1. this paper discusses the state models of key management protocol in bpi + system and key usage

    分析討論了單向散列函數的安全散列演算法（ sha - 1 ） ，研究了ak進行必要的填充后使用sha - 1得到密鑰加密密鑰（ kek ）的過程。
  20. First, we give a ga measure of discretization which is proposed first here. it can supply a gap of row - column measure which gets a result affected by the position of the attributes and breakpoints. furthermore, we have compared several kinds of discretization algorithms and applied them to the weather data

    首先，對基於粗集理論的數據離散化技術進行了比較分析，首次提出了基於遺傳演算法的離散化方法，有效克服了行列計演算法中結果受欄位位置和斷點位置影響的不足，並將幾種離散化演算法及其組合進行了比較分析和組合運用。
分享友人
分享到 Line

分享到臉書