鄰接表表示法 的英文怎麼說

中文拼音 [līnjiēbiǎobiǎoshìfǎ]
鄰接表表示法 英文
adjacency list method
  • 接 : Ⅰ動詞1 （靠近;接觸） come into contact with; come close to 2 （連接; 使連接） connect; join; put ...
  • 表 : Ⅰ名詞1 （外面;外表） outside; surface; external 2 （中表親戚） the relationship between the child...
  • 示 : Ⅰ動詞（擺出或指出使人知道; 表明） show; indicate; signify; instruct; notify Ⅱ名詞1 [書面語] （給...
  • 法 : Ⅰ名詞1 （由國家制定或認可的行為規則的總稱） law 2 （方法; 方式） way; method; mode; means 3 （標...
  • 鄰接 : adjoin; border on; be next to; be contiguous to
  • 表示 : show; express; mean; indicate; expression; presentation; signifying; remark; representation
  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. Then we propose the problems that will be discussed in the following papers. also, we introduce the theory in the field of feasible region for semi - infinite programming, and concluded that in some area around the feasible points, feasible region can be expressed by finite inequality constraints, this results gives a base to the following algorithms

    接著介紹了半無限規劃可行域的結構和穩定點的穩定性，指出了關于可行域結構理論研究的現狀，並指出在一定的條件下，在可行點的局部鄰域內，可行域可以有有限個不等式約束來表示，這為第二、三章半無限規劃問題的演算法提供了理論基礎。
  3. The soft tissues are discreted to a mass - spring - damper system, and the topologies of the system are described using adjacent tables, the dynamical equations can be constructed based on the data stored in the adjacent tables. the 4th order runge - kutta method is used to integrate the equations of deformation. using computer graphical techniques to display the visual feedback of the deformation

    將連續的軟組織離散為由彈簧-阻尼器及與其連接的質點構成的離散系統，用鄰接矩陣表示離散系統的拓撲結構，即質點-彈簧間的鄰接關系，依據該信息，可自動計算與每個質點連接的彈簧、阻尼器對接點的粘彈性力的貢獻，然後採用4階runge - kutta方法對得到的微分方程組進行數值積分，用opengl技術對得到的模擬結果進行圖形繪制。
  4. Abstract : a new data structure that one link - list was composed of polygon - surface table, edge table and vertex table was proposed to describe the geometry information and topology information of control polyhedron m in the rese arch of modeling with closed surface. compared with other structures which were a pplicable to the work, the structure was understandable, economize and conveniently to modify. after describing the detail of the geometry information, topology inf ormation included in the tables of polygon - surface, edge and vertex, and the poin t - link form of the adjacency multilist between the tables, a concise instance was given in clanguage array

    文摘:介紹了在閉曲面造型研究中，為描述控制多面體m的幾何信息和拓撲信息而設計使用的一種單鏈三表的數據結構.與其他適用與描述控制多面體的數據結構相比，該結構在結合了鄰接多重表方法后的特點是:關系描述清楚，節省存儲空間，方便查找和交互修改形體.在介紹單鏈中三表（面表、邊表、頂點表）所含的幾何信息細節、以及單鏈的三表之間的表示面、邊、頂點拓撲關系的指針的鄰接多重連接方式之後，本文給出了以c語言數組方式簡明描述的數據結構實例
  5. This paper ' s method gives a new approach that groups the pixels by larger - scale neighborhood and gets the parameters of the neighborhood by k - l transform. these parameters marked as x, y, a, 0, specifying the center coordinate, length and direction of the neighborhood separately, are the basic data for following process. then some traditional algorithms of edge track and object classification are used to accomplish the task of gaining last objects

    該方法的新穎之處在於不直接用象素點作為處理單元，而是引入了一個鄰域替代的概念，就是說將鄰域內所有的數據點作為一個整體的處理單元看待，利用鄰域內的所有數據點，計算一些可以表示鄰域的參數x ， y ， ， （鄰域的位置、方向、長度） ，這些參數完全根據鄰域內數據點的位置信息獲得。
分享友人
分享到 Line

分享到臉書