生成矩陣演算法 的英文怎麼說

中文拼音 [shēngchéngjǔzhènyǎnsuànfǎ]
生成矩陣演算法 英文
generation matrix algorithm
  • 生 : Ⅰ動詞1 （生育; 生殖） give birth to; bear 2 （出生） be born 3 （生長） grow 4 （生存; 活） live;...
  • 成 : Ⅰ動詞1 （完成; 成功） accomplish; succeed 2 （成為; 變為） become; turn into 3 （成全） help comp...
  • 矩 : 名詞1. （畫直角或正方形、矩形用的曲尺） carpenter's square; square2. （法度; 規則） rules; regulations 3. [物理學] moment
  • 陣 : Ⅰ名詞1 （作戰隊伍的行列或組合方式） battle array [formation]: 布陣 deploy the troops in battle fo...
  • 演 : 動詞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 （標...
  • 生成 : create; generate; produce生成演算法 generating algorithm; 生成文法 generating grammar; 生成物 pro...
  • 矩陣 : [數學] matrix; array
  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. Crossover is implemented using arithmetic crossover operator. then unsymmetrical mutation is conducted using the new mutation operator which can expand the scope of chromosome gene value, at the same time, the chromosome with the highest fitness values are retained for each iteration. a lot of experiments are implemented to obtain the optimized initial weighs and bias

    生成了三維矩陣表示的染色體，進行了聯賽選擇，利用算術交叉運算元進行了交叉運算，利用構造的新的變異運算元，進行了非均勻變異，同時保留了每次進化運算后最優的適應值，通過大量實驗，實現了遺傳演算法優化bp網路的初始權值和閾值的目的。
  3. It introduces the architecture of the switch, hol, delay control, vlan and spanning - tree algorithm, and crossbar backplane and store - and - forward technology

    介紹了線頭阻塞、時延控制、虛擬局域網和生成樹演算法等概念以及交換機的交換矩陣和共享存儲器等關鍵技術。
  4. In this paper, we brought out the concept of “ ergodic matrix ”, and gave out the recursion formula ( ii ) which can construct the ergodic matrix q with n n dimensions using a vector with n dimension. that is, we can delegate n2 bits ergodic matrix q using n bits integer vector, at the same time save the complexity of space and time

    在此基礎上，本文對利用遍歷矩陣生成信息摘要以及利用它們實現一般數字簽名和具有仲裁方式的數字簽名的演算法及應用進行了相關的一些研究，對演算法的強度進行了分析，並用程序對演算法進行了驗證。
  5. Most current algorithms only work well in special conditions, because of the abnormity of signals in the real world. now, the research in the ica arises much passion and the ica has brought about many applications. the primary results the writer has got are as the following : after a whiting process, it is a key to find an orthogonal matrix to throw away the high - order redundant information between components

    由於現實生活中信號十分不規則，目前提出的演算法大多隻能針對某類信號分離，鑒于目前在ica方面極大的研究熱情和強大的背景支持，作者對ica離線演算法做了一定研究，主要內容和工作包括如下: ica問題經過白化處理后，尋找去除高階相關的正交矩陣成為問題關鍵，而正交矩陣具有特殊的空間結構，組成它的每個列向量可視作rn中單位超球表面上一點，當這些點彼此垂直時，整體就組成一個正交矩陣。
  6. For a given muting plane, first of all, this algorithm generates the corresponding grid group by barriers and nets ' ports, establishes initialization pheromone matrix, then the algorithm will use the character of ant colony algorithm to find out the shortest muting path only if it exits

    對于給定的布線平面，該演算法首先由障礙圖形和各個線網的端點生成一個包含最短路徑的訪問點陣，建立初始信息素矩陣，然後利用蟻群演算法所特有的路徑尋優功能來找到當前布線路徑上的最短路徑。
  7. The core algorithms in the candidate set creating function module are code pretreatment algorithm and candidate set creating algorithm. candidate list creating function module is the most important module, its core algorithms include candidate list adjusting algorithm, candidate matrix creating algorithm, original word lattice creating algorithm, language element node creating algorithm, optimal candidate words searching algorithm and candidate list creating without code algorithm which

    候選列表生成模塊是整個系統最主要的模塊，主要核心演算法包括候選字詞調整演算法、候選矩陣生成演算法、初步詞網格生成演算法、語言元素結點的生成演算法、尋找最佳語句候選演算法以及無編碼候選列生成演算法，無編碼候選列生成演算法利用對用戶已輸入的漢字進行切分標注，通過系統中的知識庫信息在沒有輸入編碼的情況下預測后續的輸入。
  8. Practical analysis and experimental results show that the naac detection optimal algorithm is characterized by almost full error coverage

    實踐表明， naac演算法生成的測試矩陣具有較高的故障覆蓋率。
  9. Paper [ 76 ] provides a integer algorithm for rasterizing free curves, we need change the curve form to implicit function form, then use curve ' s positive - negative property to draw, but we ca n ' t use this algorithm when curve ' s degree is higher than 3 and this algorithm ca n ' t avoid using multiplication ; paper [ 77 ] provides a new generating algorithm, this algorithm can draw bezier very well, but for b - spline curve, we need use convert them into bernstein base form. because this process spends a lot of time, this algorithm has not a good speed and effect for rendering rational b - spline curve

    現在經常採用的演算法也是基於幾何的演算法（即線式生成演算法）和基於像素的演算法（點式生成演算法） ;文獻78 ]提供了一種有理參數曲線的快速逐點生成演算法，該演算法對有理b吮ier曲線的繪制，能起到很好的作用，但是對于有理b樣條曲線，必須先通過多項式的代數基與bemstein基間的變換矩陣，把原式用bemstein基表示，這一過程由於計算量大，降低了曲線生成的速度和效率
  10. The naac detection optimal algorithm can assure to generate test matrix with no symptom aliasing and no symptom confounding, at the same time, it can compress a large of scale test matrix to very small of scale test matrix

    採用naac演算法生成的測試矩陣能夠確保無徵兆誤判和無徵兆混淆，同時該演算法還能將大的測試矩陣壓縮成小規模的測試矩陣。
分享友人
分享到 Line

分享到臉書