hashing 中文意思是什麼

音標 ['hæʃiŋ]
hashing 解釋
犬兔追逐游戲〈為世界各地英國僑民所喜愛，游戲時跑在前面的人沿途撒下紙片、粉劑等，大批人尾隨其後跟蹤追趕〉。

  1. Event class can be used to monitor when a hash recursion or cessation of hashing hash bailout has occurred during a hashing operation

    事件類可用於監視在哈希操作過程中何時發生哈希遞歸或哈希終止（哈希釋放） 。
  2. Hash bailout occurs when a hashing operation reaches its maximum recursion level and shifts to an alternate plan to process the remaining partitioned data

    當哈希操作達到其最大遞歸級數並轉換到替換計劃以處理剩餘的分區數據時發生哈希釋放。
  3. In sequential pattern, we describe mfr and the algorithm on how to find frequent access paths. in mining association rules, we introduce famous apriori algorithm and propose the optimized dhp algorithm with hashing

    在關聯規則的挖掘中，深入的分析了經典的apriori演算法，並運用哈希技術改進它得到dhp演算法，其中詳細闡述了該演算法改進的思路。
  4. According to horodeckis, the coherent information of entangled state is supposed to be the lower bound of one - way distillable entanglement. this postulation is called hashing inequality, which is crucial in proving noisy channel coding theorem. it is shown that there are no direc

    根據horodecki等人的研究，糾纏態的相干信息推測是單向蒸餾糾纏的下限，該假設稱為hashing不等n式，對證明有噪通道編碼定理至關重要
  5. 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 + +程序語言中。
  6. They may use hashing techniques or arithmetically offset the character set to unreadable or unprintable characters

    它們可能使用哈希技術，或者對字符集進行算術偏移，將字元變為不可讀字元或不可輸出字元。
  7. Hashing algorithms produce unique binary message digests based on the code they sign

    根據要簽名的代碼，散列演算法產生唯一的二進制消息摘要。
  8. Chapter 3 implements the simulation of traditional dispatching algorithms ( wrr, url hashing and lard ), and analyses their performance character based on the result of simulation

    第三章對典型的三種分發演算法（ wrr 、 urlhashing 、 lard ）作了性能上的模擬。
  9. Topics covered include : sorting ; search trees, heaps, and hashing ; divide - and - conquer ; dynamic programming ; amortized analysis ; graph algorithms ; shortest paths ; network flow ; computational geometry ; number - theoretic algorithms ; polynomial and matrix calculations ; caching ; and parallel computing

    課程主題包含了：排序、搜尋樹、堆積及雜湊；各個擊破法、動態規劃、攤提分析、圖論演演算法、最短路徑、網路流量、計算幾何、數論演演算法；多項式及矩陣的運算；快取及平行計算。
  10. The detail is clarified as follows : l ) based on the chaotic technology and contemporary encryption approach the paper put forward a new chaotic sequence, which introduced the m - sequence and the method of shrink key - the stream generator. the complexity of the sequence was promoted as the random alteration of the parameters of chaotic mapping, and at the same time, the shrinking key was used to enhance the security further more ; 2 ) the performance of one - way hash function was improved and new hash function construction methods are proposed through a novel hash method based on chaotic mapping and the aes - the rijndael algorithm. the algorithm of hashing messages of arbitrary length into 256 bits hash values was designed

    按照這種方法，輸出序列的周期性得以大大提高，理論分析和計算機模擬結果表明，該方法可以產生具有良好統計特性的密鑰流，而且易於軟硬體實現： 2 ）實現了一種基於混沌映射和分組密碼rijndael演算法的單向hash函數的構造方法，即使用logistic混沌映射產生混沌二值序列，序列的分組與明文序列分組進行按位異或后，進入rijndael加密模塊，所得的結果再加入到反饋端，參與下一分組輸入的異或運算，迭代結束時的rijndael加密結果即為所求的hash函數值。
  11. Specifies all the hash algorithms used for hashing files and for generating the strong name

    指定用於哈希文件和用於生成強名稱的所有哈希演算法。
  12. Dbpropval it btree - the index is a b - tree. dbpropval it hash - the index is a hash file using, for example, linear or extensible hashing

    Dbpropval _ it _ hash -該索引是使用例如線性或可擴展哈希演算法的哈希文件。
  13. Select a hashing algorithm from the following list

    請從下表中選擇散列演算法。
  14. Image hashing based on human visual system

    一種基於視覺特性的圖像摘要演算法
  15. What s a good hashing algorithm to use

    什麼是適用的好雜湊演演算法呢？
  16. Hashing algorithms are one - way functions

    雜湊演演算法是單向函數。
  17. 5 manku g s, bawa m, raghavan p. symphony : distributed hashing in a small world. in proc. the 4th usenix symposium on internet technologies and systems, seattle, washington, 2003, pp. 127 - 140

    對于每個節點而言，新增的兩條邊以平均隨機分佈的方式連接到離該節點lg n 2 d曼哈頓距離范圍內的其它兩個節點。
  18. Using hashing algorithms for data integrity and authentication

    將雜湊演演算法用於資料完整性和認證
  19. Round robin would distribute connection attempts evenly among the channels, while hashing would use the client s ip address to determine the destination channel

    輪流調度方式會將連接嘗試均勻地分佈到各個通道上，而散列方法則使用客戶機的ip地址來確定目標通道。
  20. Many constructions for macs do not depend on cryptographic hashing

    Mac的許多構造不是取決於密碼雜湊法的。
分享友人
分享到 Line

分享到臉書