time complexity function 中文意思是什麼

time complexity function 解釋
時間復雜度性函數
  • time : n 1 時，時間，時日，歲月。2 時候，時刻；期間；時節，季節；〈常pl 〉時期，年代，時代； 〈the time ...
  • complexity : n. 1. 復雜性，復合狀態。2. 復合物；復雜的事物[情況]。
  • function : n 1 功能，官能，機能，作用。2 〈常 pl 〉職務，職責。3 慶祝儀式；（盛大的）集會，宴會。4 【數學】...
  1. With the development of the network and the multi - processor system, the research, simulation and the impemeni of the system - level fault diagnosis which is the very important means to increase the reliability of the system, are becoming more and more important. on the system - leve1 fault diagnosis, based on the group theory of system - level fault diagnosis that has been put forward by pro f zhang, the paper constructs newly the theory bases, improves on the matrix method, reinforces and consummates group arithmetic of all kinds of test mode, for the first time, analyses and discusses the equation solution of all kinds of models, so al1 the consistent fault patterns ( cfp ) could be found, straightly and high efficiently, even if the sufficient and necessary condition of t - diagnosable is dissatisfied and the complexity of system - level fault diagnosis is greatly decreased, especialy in strong t - diagnosabl6 system. last the simulation system ' s function has been extended and the application hotspot and the development trend have been disscussed

    本人在張大方教授等人提出的基於集團的系統級故障診斷的理論基礎上，重新構建了系統級故障診斷的理論基礎，定義了系統級故障診斷測試模型的三值表示；改進了系統級故障診斷的矩陣方法，重新定義了測試矩陣、鄰接矩陣、結點對、結點對的相連運算、極大準集團和斜加矩陣，由此能直觀、簡便地生成集團和極大獨立點集；補充和完善了各類測試模型的系統級故障診斷的集團演算法，通過定義集團測試邊和絕對故障集，簡化了集團診斷圖，由此能較易地找到所有的相容故障模式，即使不滿足t -可診斷性，大大減少了系統級故障診斷的復雜度，尤其是對強t -可診斷系統；首次分析探討了各類測試模型的方程解決，由此從另一角度能系統地、高效率地求出所有的相容故障模式（ cfp ） ：擴充了系統級故障診斷模擬系統的功能，快速、直觀和隨機地模擬實驗運行環境，進行清晰和正確的診斷，同時提供大量的實驗數據用於理論研究，優化演算法和設計。
  2. 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函數值。
  3. At the same time, complexity science has made a success in describing, simulating complex systems and applying these achievements in discussing evolution of complex systems and their essence of function, but it is incapable of controlling these complex systems

    與此同時，復雜性科學在對復雜系統的描述與模擬，並將其應用於探討復雜系統的進化與功能的本質方面取得了顯著的成功，但在控制這些系統方面還無能為力。
  4. This thesis mainly describes a tesing and consoling kit based on ni " s special virtual instrument software development kit - labwindows / cvi, aming at traditional testing device " s limitation such as high cost of hardware, complexity of construct, singleness of function etc. the tesing and consoling kit can condition the signal intermixed with interfere noise and deal with the collected datum through common signal conditioning ( amplification, isolation multiplex filtering ) -, software calibration digital filtering etc to analyse signal in time and frequency domain

    本文針對傳統測量設備硬體成本高、構造復雜、重用性差、功能單一等方面的問題，著重探討了利用ni的labwindows cvi這一虛擬儀器開發軟體構建的測控平臺，通過通用信號調理（如放大、隔離、多路轉換、模擬濾波等） 、軟體校正、數字濾波等方法對混雜有干擾的信號進行調理及採集后的數據進行處理，然後進行時域或頻域的分析。
  5. The data spatial cell partitioning and data object allocating methods based on the problem of boundary outlier misjudgment in cell outlier mining algorithms are discussed. then a dynamic adjustment function on dataset boundary threshold is defined and an improved algorithm on the cell - based outlier is brought forward. it can greatly reduce the amount of misjudgment on boundary outlier by the algorithm discussed in this paper without increasing the complexity and the calculating time of the original algorithm

    針對演算法中邊界處孤立點的誤判問題，給出了數據空間的單元格劃分及數據對象分配方法，定義了數據集邊界閾值動態調整函數，提出了基於單元的孤立點挖掘演算法的改進演算法，在不增加原有演算法時間復雜度的前提下，極大地減少了邊界處孤立點的誤判。
  6. The improved parameterized matching algorithm has linear time and space complexity, fragment combining algorithm has 0 ( n2 ) time and space complexities ( n is the number of statements of the function which the fragment belongs to )

    分析表明：改進的參數化匹配演算法的復雜性同程序文件的行數成線性關系；碎片合併演算法的復雜性是o （ n ~ 2 ）的，其中n是碎片所在依賴單位的語句個數。
  7. This structure is kind of outer - coalescent. it adopts neural network ' s clustering function to classify the system output, then link a fuzzy controller in form of series which rules are made through the classified result. the design process and the experiment shows the well control effort to the full - bridge series type resonant dc - dc converter, at the same time the whole process avoids not only the modulating parameter process of the traditional method, but also the complexity of the traditional fnn design

    然後本文又對全橋式串聯共振型dc - dc變換器的主電路的狀態方程進行了理論上的推導，從而確定了這種全橋式dc - dc變換器的各種工作模式；然後通過分別對模糊控制和神經網路進行介紹，提出了一種新型的模糊神經網路控制器模型，該控制器模型是一種外接式結合? ?串聯式結合方式，它利用了神經網路的聚類功能，採用了一種再生式神經網路，即elman網路來對系統輸出進行分類，然後根據分類結果設計模糊控制器，這樣就簡化了整個模糊神經網路控制器的設計過程。
  8. At the same time, this paper puts forward a validity function for judging clustering in order to lead us to use it in k - nearest neighbor classification ; then introduces " generalization capability of a case " to k - nearest neighbour. according to the proposed approach, the cases with better generalization capability are maintained as the representative cases while those redundant cases found in their coverage are removed. we can find a new less but almost complete training data set, consequently reduce complexity of seeking near neighbour

    針對k值的學習，本文初步使用了遺傳演算法選擇較優的k值，同時總結了一種聚類有效性函數，數值實驗證實了其有效性，旨在指導應用於k -近鄰分類中；然後還將「擴張能力」的概念引入k -近鄰演算法，根據訓練集例子不同的覆蓋能力，刪除冗餘樣本，得到數量較小同時代表類別情況又比較完全的新的訓練集，從而降低查找近鄰復雜性。
分享友人
分享到 Line

分享到臉書