sequence complexity 中文意思是什麼

sequence complexity 解釋
序列復雜性
  • sequence : n 1 繼續；接續；連續。2 順序；程序；次第；關系；關聯。3 後果；結果；接著發生的事；後事；後文。4 ...
  • complexity : n. 1. 復雜性，復合狀態。2. 復合物；復雜的事物[情況]。
  1. The rate of reannealing is inversely proportion to sequence complexity.

    再退火速度是和順序復雜性成反比例。
  2. The sy - stem had different requirements on time sequence in high - speed clock and low - speed clock situations, which resulted in the complexity of the sequential circuit

    在高速時鐘和低速時鐘的情況下，系統有不同的時序要求，這就決定了時序電路的復雜性。
  3. 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函數值。
  4. Based on knowledge reasoning, fuzzy theory, extraction of sub - assembly and cluster, and hierarchical connection relation graph, an assembly sequence generation algorithm is studied in this paper, which breaks down the original complex assembly sequence generation problem into several small scale assembly sequence planning problems to reduce the computing complexity caused by cut - set theory. a hierarchical and / or graph to store all the generated sequences is also employed for this purpose

    本文提出基於知識推理及模糊理論，結合子裝配與聚族提取以及裝配樹，利用層次聯接關系圖，將一個復雜的裝配序列求解問題轉化為若干個相關的小規模裝配序列求解問題，並用一種層次與或圖結構存儲裝配序列，使割集法求解裝配序列的計算復雜度大大降低。
  5. Ldpc code belongs to the linear block code which is encoded by the information sequence multiplies generator matrix. although the parity - check matrix of ldpc code is sparse, the generator matrix is not. the encoding complexity of it is linearly proportional to the square of code length

    Ldpc碼屬于線性分組碼，線性分組碼的通用編碼方法是由信息序列根據碼的生成矩陣來求相應的碼字序列，盡管ldpc碼的校驗矩陣是非常稀疏的，但它的生成矩陣卻並不稀疏，這使得其編碼復雜度往往與其碼長的平方成正比。
  6. In the design and analysis of sequence cipher, we obtain the following results. first, we give the trace representation of primitive sequences and their corresponding highest lever sequences on galois ring by using the trace function theory and the characteristic of lever factorization, and determine the correlation function linear complexity and element distribution of the highest lever sequences of primitive sequences on galois ring gr ( 4, m )

    在序列密碼的設計和分析方面：首先，利用galois環上跡函數理論和本原序列的權位分解特徵，給出了本原序列及其最高權位序列的跡表達式，然後利用galois域上二次型理論與指數和理論決定了特徵為4的galois環上本原序列的最高權位的相關函數、線性復雜度和元素分佈。
  7. According to the complexity of pattern, the mined characteristic patterns could be sorted as frequent item, frequent sequence and frequent sub tree, etc. the paper builds tree - model of rna molecules and utilizes frequent sub tree mining algorithm to mine common topological patterns among rna secondary structures

    根據特徵模式復雜性，可分為頻繁項模式、頻繁序列模式以及頻繁子樹模式等。本文對rna分子建立樹形模型，利用頻繁子樹挖掘演算法挖掘rna二級結構中的公共拓撲模式。
  8. The security of the algorithm is analyzed from the randomness, linear complexity of the chaotic sequence and the intensity of initial key. the results show the randomness of the key sequence pass the frequency test, sequential test, poker test, autocorrelation test, runs test, etc. and the total level is better than the binary sequence generated by the prng of delphi 7. 0, logistic chaotic system and rc4, the linear complexity comes up to the expectation, the initial key has very strong intensity

    本文最後從混沌序列的隨機性、線性復雜度和初始密鑰的強度三個方面對演算法進行了安全性分析，結果表明演算法產生的密鑰序列的隨機性完全通過了頻數檢驗、序列檢驗、撲克檢驗、自相關檢驗和遊程檢驗等5種統計檢驗方法的檢驗，而且整體水平要好於delphi7 . 0中的偽隨機數發生器、 logistic混沌系統和rc4三種方法產生的二進制序列，線性復雜度達到了數學期望值。
  9. 3. a fast algorithm is proposed for computing the linear complexity of a binary sequence with period p ? and generalized one for determining the linear complexity of a sequence with period pfl over gf ( q )

    提出了一個計算周期為p ~ n的二元序列的線性復雜度的快速演算法，並推廣為確定gf （ q ）上周期為p ~ n的序列線性復雜度的快速演算法。
  10. On the other hand, on condition that the clock - controlled sequence is generalized self - shrinking sequences, the sequences generated have good a ; - error linear complexity

    在被控序列為廣義自縮序列情況下，序列有好的k -錯線性復雜度性質。
  11. 2. in chapter three, the results show that, on condition that the clock - controlled sequence is m sequences, the generalized shrinking sequences have large period and linear complexity, good correlation property, and the generalized shrinking sequences family has rich algebra structure

    在第三章提出並研究了廣義互縮序列，研究表明生成的序列具有大的周期和線性復雜度，其中在被控序列為n級m序列的情況下證明了如下的結果：族內序列具有良好的互相關性質以及豐富的代數結構。
  12. Analysis of sleep staging by time - window complexity sequence of eeg

    基於時窗復雜度序列的睡眠腦電分析
  13. At present, most of the estimation algorithms are implemented by the training sequence by which the characteristics of the sequence was known by the receiver. maximum likelihood estimation or the projection of training sequence is frequently used to estimate the snr. but these techniques will increase the complexity of the reciever

    現在所提出的估計演算法大多數是基於發送訓練序列的方法，即傳送完全已知的信號序列，然後通過對此序列的接收和分析來估計通道參數，如利用訓練序列的最大似然估計，或利用其投影來估計通道參數的方法，但是這些利用訓練序列的估計方法都存在增加設備復雜度的缺點。
  14. The shortcoming of spectral detection is its complexity and in need of long time to compute. a simple and powerful approach is cepstrum detection method, which can estimate pn sequence ’ s time period. using this parameter and the pn chip rate estimated by spectral correlation method, we can get another parameter, length of the pn sequence

    另外，本文還嘗試利用cdma信號的相位重復特性，解決各用戶pn序列的分離問題;但這種方法只能在有一定先驗知識的條件下，對包含較少用戶的ds / cdma信號有較好效果，能夠簡單快速的實現用戶pn序列的分離與估計。
  15. To analyse the complexity of geochemical zoning, the concepts of superposed zoning sequence and mineralization stage zoning sequence are defined, and a new method to decompose the superposed zoning sequence and recognize the superposed mineralization natures is suggested

    為適應地球化學分帶的復雜性，定義了疊加分帶序列和礦化階段分帶序列的概念，提出了疊加分帶序列分解及疊加礦化性質識別方法。
  16. 3. an attack called fbdd is applied to generalized self - shrinking sequence, the realization step and time complexity and space complexity are showed

    3 、利用bdds中的fbdd對廣義自縮序列進行攻擊，指出了其實現方法和復雜度。
  17. 4. a fast algorithm for computing the linear complexity and the minimal polynomial of a binary sequence with period t ? m is proposed, and generalized one for determining the linear complexity of a sequence with period pmqfl over gf ( q )

    提出確定周期為2 ~ np ~ m的二元序列的線性復雜度和極小多項式的一個快速演算法，並推廣為計算gf （ q ）上周期為p ~ mq ~ n序列的線性復雜度和極小多項式的快速演算法。
  18. 5. in biology field, clustal is one of the most popular multiple sequence alignment software. when large numbers of sequences are aligned at one time, the time complexity of clustal algorithm is very big and it is not suit for vast sequences

    Clustal程序是生物學界通用的多序列比對軟體之一，隨著同時進行比對的序列數據量的增加，其時間復雜度急劇增加，該程序無法滿足大規模的序列數據比對。
  19. Considering the characteristics of complexity and frequent flow of business process system in the power supply of county enterprise, a sufficient business process system is established and developed by using unified modeling language and object - oriented analyse and design methods in this paper. a series of use case diagrams, sequence diagrams, interaction diagrams and class diagrams is designed. then, class diagrams are created tables of data - base

    針對目前縣級供電企業業擴報裝業務復雜、工作流程變動頻繁的特點，在縣級電力局管理信息系統的建設中，採用面向對象分析與設計的思想，運用可視化標準建模語言uml對業擴系統建模，設計了業擴系統的用例圖、順序圖、合作圖和類圖，並將類圖直接生成數據表，構建了業擴報裝系統框架模型，在經過迭代和增量開發的過程后，開發了較為通用的業擴報裝系統軟體。
  20. Because of the reason above, a novel pn acquisition method using auxiliary sequence and binary search is proposed. because the cross correlation between auxiliary sequence and spread sequence is linear, some search algorism can be used to estimate the phase of incoming signal quickly without increasing the complexity of system

    因為輔助序列與擴頻序列的相關函數近似滿足線性單調性，可以利用快速搜索演算法，如：二分法，對接收信號中擴頻序列的相位進行快速搜索，在保證系統復雜度不變的前提下，降低序列捕獲的時間。
分享友人
分享到 Line

分享到臉書