數據訪問陣列 的英文怎麼說

中文拼音 [shǔjùfǎngwènzhènliè]
數據訪問陣列 英文
daa: data access arrangement
  • 數 : 數副詞（屢次） frequently; repeatedly
  • 據 : 據Ⅰ動詞1 （占據） occupy; seize 2 （憑借; 依靠） rely on; depend on Ⅱ介詞（按照; 依據） according...
  • 訪 : 動詞1. （訪問） call on; interview; visit 2. （調查; 尋求） inquiry into; seek by inquiry [search]; try to get
  • 問 : Ⅰ動詞1 （請人解答） ask; inquire 2 （詢問; 慰問） question; ask about [after]; inquire about [aft...
  • 陣 : Ⅰ名詞1 （作戰隊伍的行列或組合方式） battle array [formation]: 布陣 deploy the troops in battle fo...
  • 列 : Ⅰ動1 （排列） arrange; form a line; line up 2 （安排到某類事物之中） list; enter in a list Ⅱ名詞1...
  • 數據 : data; record; information
  • 訪問 : visit; call on; interview; access; addressing; reference to
  • 陣列 : [統計學] array陣列處理機 array processor; 陣列印表機 array printer; 陣列雷達 [電學] array radar
  1. In the preprocessing stage the method of user and session identification often adopt heuristic algorithm for the being of cache and agent. this induce the uncertainty of data resource. the cppc algorithm avoid the limitation and has no use for complicated hash data structure. in this algorithm, by constructing a userld - url revelant matrix similar customer groups are discovered by measuring similarity between column vectors and relevant web pages are obtained by measuring similarity between row vectors ; frequent access paths can also be discovered by further processing of the latter. experiments show the effectiveness of the algorithm. in the fourth part, this thesis bring some key techniques of data mining into web usage mining, combine the characteristic of relation database design and implement a web usage mining system wlgms with function of visible. lt can provide the user with decision support, and has good practicability

    本文演算法避免了這個缺陷，且不需要復雜的hash數據結構，通過構造一個userid - uel關聯矩陣，對列向量進行相似性分析得到相似客戶群體，對行向量進行相似性度量獲得相關web頁面，對後者再進一步處理得到頻繁訪問路徑。實驗結果表明了演算法的有效性。第四是本文將傳統數據挖掘過程中的各種關鍵技術，引入到對web使用信息的挖掘活動中，結合關系數據庫的特點設計並實現了一個具有可廣西人學頎士學位論義視化功能的web使用挖掘系統wlgms 。
  2. Better performance are gained when the properties of balance and activity are combined in an attack of reduced variants of rijndael. 7. the optimisations of rijndael sbox, of columnmix and its inverse, and of the round trans formation are thoroughly studied for purpose of better performance

    7 、研究了rijndael演算法s盒、列變換及其逆運算、整個輪變換的優化方法，從運算單位、數據訪問時間和簡化矩陣運算等方面提高演算法的實現效率。
  3. This paper presents an architecture based - on shift register array, which can be used for the search for the two search pattern simultaneously. this architecture was inspired by the vlsi architecture for diamond - search - pattern - based algorithms. it exploits the overlap of reference data among the search points to reduce data memory accesses which are the most power consuming operations

    其基本思想是利用搜索點之間的參考數據重疊的特徵，把需要用於多個搜索點計算的參考數據存儲在移位寄存器陣列中，通過移位操作來滿足不同搜索點的計算需要，大大降低了數據存儲器訪問次數，從而減少了運動估計中功率消耗最大部分的操作。
分享友人
分享到 Line

分享到臉書