連通頂點 的英文怎麼說

中文拼音 [liántōngdǐngdiǎn]
連通頂點 英文
connected vertex
  • 連 : Ⅰ動詞1 （連接） link; join; connect 2 （連累） involve （in trouble）; implicate 3 [方言] （縫） ...
  • 通 : 通量詞（用於動作）
  • 頂 : i 名詞（人體或物體的最上部） crown; peak; top Ⅱ動詞1 （用頭支承） carry on the head 2 （從下面拱...
  • 點 : Ⅰ名詞1 （液體的小滴） drop （of liquid） 2 （細小的痕跡） spot; dot; speck 3 （漢字的筆畫「、」）...
  • 連通 : feed through; connection; connected; intercommunication
  • 頂點 : apex; zenith; acme; vertex; corner; tip top; pinnacle; acnode; perfoot; top; grand climax; full; ...
  1. An articulation point is a vertex of a connected graph which can be split to yield an unconnected graph.

    如果一個連通圖的一個頂點能被分割，從而使這圖成為一個不連通圖，則這個頂點稱為斷點。
  2. Smooth - smooths out a mesh by moving each vertex towards the barycenter of the linked vertices

    光滑-通過向連接頂點的重心移動每個頂點來光滑一個網格物體。
  3. Firstly, the connected end sets of the relay lines are got using the breadth first search algorithm and the connected relationship of wiring terms is got in the electrical circuit diagram according to different cad block structure of different element type. secondly, the appropriate specification of the relay element is chosen by using the equinoctial graph algorithm, and the panel layout diagram is generated automatically by the combining automatic layout and manual intervention. finally, the optimized path algorithm which passes each vertex in the completed non - directional graph once and only once is put forward, this algorithm and the prim minimum spanning tree algrotithm can generate the inner panel wiring diagram and terminal wiring diagram automatically

    首先，採用廣度優先搜索演算法查找電氣原理圖中的連通導線端點集，並根據不同類型的繼電元件對應的cad圖塊結構的不同，得到電氣原理圖中元件接線端子之間的連接關系;其次，根據二分圖匹配演算法為電氣原理圖中繼電元件選擇合適的型號和規格，並採用人工干預和自動布置相結合的方法完成屏面布置圖的自動生成;最後，提出了完全無向圖中經過每個頂點一次且僅一次的優化路徑演算法，利用該演算法和經過預處理的prim最小生成樹演算法自動生成屏內安裝接線圖和端子接線圖。
  4. The paper will study the upper questions based on the two interconnection networks. first, we give a fault - tolerant routing algorithm under the connectivity of the crossed cube in o ( n ) time and the length of the longest routing path ; second, with the rapid progress in vlsi, the failing probability of processors and links is very low, the traditional connectivity underestimates the resilience of large networks / here by applying the concept " conditional connectivity " introduce by harary, we show that the n - crossed cube can tolerate up to 2n - 3 ( n > 2 ) processors failure and remain connected provide that all the neighbors of each processor do not ' fail at the same time, the result is the same as the hypercube. we also give a related algorithm in o ( n ) time, and the length of the longest path ; third, we apply cluster faun tolerance introduced by q. - p

    根據menger定理， n -維交叉立方體可以容納n - 1個故障頂點，我們給出了它的時間復雜度為o （ n ）的容錯路由選擇演算法及其最長路徑長度分析；在此基礎上本文證明， n -維交叉立方體的條件連通度為2n - 2 （ n 2 ） ，並給出了相應時間復雜度為o （ n ）的演算法及其最長路徑長度；除此之外，本文還證明當n -維交叉立方體中的故障簇個數不大於n - 1 ，其直徑不大於1 ，故障頂點總數不超過2n - 3 （ n 2 ）時，交叉立方體中任兩個無故障頂點都至少有一條可靠路徑。
  5. In the paper, the connectivity and diameters of sell - complementary 2 - multigraphs and sell - complementary digraphs are discussed, and if these graphs get disrupted the relations for the number ob edges and vertices between the two connected components are also studied in self - complementary permutation

    摘要本文討論了2 -重自補圖和有向自補圖的連通性以及2 -重自補圖的直徑，同時以自補置換作為工具研究了當2 -重自補圖或有向自補圖被分成兩個連通分支后，這兩個連通分支之間的邊數與頂點數之間的關系。
  6. A configuration is a connected cluster of vertices of a plane graph together with the degrees of the vertices.

    一個構形是面圖的一連串連通的頂點與這些頂點的度。
  7. The adjacent matrix graph presentation in matricon and vertex - overlapping connectivity determination are the essential tools in the next work on un - unique labeled graph mining

    Matricon演算法中利用關聯矩陣形式代表圖的方法和sfp演算法中利用頂點重疊判連通性的思想在下一步非唯一標號圖的分析中也是一個重要工具。
  8. Then we discuss eight properties of basis graph of quasi - fuzzy graph matroid. they demonstrate connection properties, vertex distance, determining the label numbers of the vertices and path existing properties

    這八條性質定理分別討論的是準模糊圖擬陣的基圖的連通性，頂點距離計算的充要條件，頂點標號的確定，路的存在性。
  9. This paper studies the band percolation of the models of the triangle lattice and the hexagonal lattice. before we study the models of the triangle lattice and the hexagonal lattice, we will introduce period. let g = ( vc, ec ) be a connected graph, we write vg for the set of vertices of g and egfor the set of its edges, u e vc is a vertex, and v is the coordinate vector

    在介紹平面正三角形和正六邊形點格的邊滲流模型之前我們先引入周期的概念：設g = （ v _ g ， e _ g ）為連通圖其中v _ g ， e _ g分別為圖g的頂點集和邊集， u v _ g為的頂點， v為平面的坐標向量。
  10. By simulating body node with fea software ansys and comparing its results with the experiment ones, natural capacity of semi - rigid connection node itself was discussed, and the experimental results were analyzed additionally, and the bearing conditions of sections which could n ' t be tested in experiment were obtained, as well as two kinds of bearing conditions under different conditions that the connections with and without stiffener were compared in detail

    在討論半剛性連接節點本身的性能時，通過有限元軟體ansys對節點進行三維非線性有限元精細模擬，將計算結果與試驗所得數據對比，對試驗結果進行補充分析，了解沒有測到試驗數據的節點組件在加載過程中的受力情況，並對帶雙腹板角鋼頂、底角鋼連接在有無加勁肋兩種情況下的受力狀態進行詳細對比。
  11. First, all topological features in the original mesh model are stored, then sort all the edges according to the importance of vertex, finally delete the edges which lead to sliver triangle and which lead to the discontinuity of triangle normal vectors

    該演算法首先保存原始網格模型中所有頂點的拓撲特徵，然後根據頂點的重要度對所有的邊進行排序，通過檢查是否產生狹長三角形和三角片的法矢是否連續來判斷邊是否被刪除。
  12. A 3 - restricted edge cut is such an edge cut that separates a connected graph into a disconnected one with each component having order at least 3

    摘要3限制性邊割將連通圖分離成不連通圖，使其各連通分支含有至少3個頂點。
  13. In this paper, three correlative results are given : 1 ) the average crossing number of graph with n vertices and q edges can be signified approximately by quadratic equation of q. 2 ) the average crossing number of graphs with bigger girth is greater than that with smaller girth within given vertices and edges. 3 ) the average crossing number of r - regular graphs greater than that of non - regular graphs within given vertices and edges where n is odd or r < n / 2

    並得出相關的規律： 1 ） n個頂點q條邊的單二連通分支圖的平均交叉數aac （ n ， q ）可近似地表示為q的二次多項式， 2 ）在給定頂點數n與邊數q的單二連通分支圖中圍長較大的圖的平均交叉數大於圍長較小的圖的平均交叉數， 3 ）在給定頂點數n與邊數q的單二連通分支圖中當n為奇數或r n / 2時， r正則圖的平均交叉數大於非r正則圖的平均交叉數。
  14. In this paper, i will present some algorithms of polyhedral visual hull reconstruction : ( 1 ) polyhedral v isual h ull generation a igorithm b ased one dge - pool - searching, which constrains the 3 - d intersections into the 2 - d planes intersection via the epipolar theory to reduce the complexity a nd c an r educe t he t imes f or c ones t o b e p rejected o nto t he i mage p lanes, i n which we induced the index list to every points on the surface of object, and connected the related points to get sub polygons on surface and in turn get the mesh model, we replace triangulation process of disordered points cloud by edge - pool searching. ; ( 2 ) reconstruction based on degenerated - polygon - intersection, which have the following improvements on traditional bull intersection : using degenerated polygon to orga nize intersected area on cone face, which may be discontinuous ; a fast intersection algorithm of polygons on the cone face based on degenerated polygons, which is consistent between the continuous polygons and the discontinuous ones. the intersection of degenerated polygons is similar to the convergence of two ordered lists, which is comparably simple to the bull operation ; ( 3 ) reconstruction algorithm based on ray - tracing, in which all the rays that run through the vertex on silhouette of object will intersect with all the cones correspondent to other silhouette, and we have to calculate the intersection of all such line segments, the endpoints of which are considered to lie on the surface of object and we will get the point cloud on the surface of object

    同時利用共極線原理把三維計算投影到二維平面以降低求交計算的復雜度，該演算法可以減少光錐向圖像平面投影計算的次數，以邊池搜索取代散亂點集上進行的三角剖分； （ 2 ）基於退化多邊形求交的多面體可見殼模型重構，系統引入退化多邊形的概念，把錐體平面的交集中不連通的部分用一個退化多邊形來表示，並引入了新的基於退化多邊形的求交演算法，與傳統多面體可見殼重構相比，該演算法有以下幾點創新：在圖像平面以退化多邊形組織投影錐體和物體輪廓的交集，把任意錐面與物體輪廓的交集歸一到一個退化多邊形；基於退化多邊形的二維平面上多邊形快速相交演算法，該演算法在一定程度上就是兩個有序鏈表的合併，大大簡化了先前的布爾求交計算； （ 3 ）基於光線跟蹤的演算法，該演算法中所有通過輪廓頂點的光線和對應其它圖像輪廓的光錐進行求交計算，最後得到每次求交計算得到線段的交集，該線段的頂點就認為是物體表面點，從而得到物體表面的點雲。
  15. In this thesis, we investigate the energy of connected unicyclic graph with a perfect matching, where possess vertices and edges

    本文我們研究具有完美匹配的連通單圈圖的能量，圖有個頂點和條邊。
  16. The ordered vertices form its vertex model, and its ordered edges form the edge model, both are integrated together by the continuities of the deformable model

    其有序的頂點集合組成頂點模型，有序的邊線集合組成邊線模型，兩者通過形變模型的二階連續性緊密地結合在一起。
  17. Gu to the crossed cube, and proved that for node - to - node routing, the crossed cube can tolerate as many as n - 1 faulty clusters of diameter ai most 1 with at most 2n - 3 ( n > 2 ) faully nodes in total which is as good as the hypercube

    交叉立方體的上述這些性質都與超立方體的相同。為了進一步提高連通度，我們改進了交叉立方體的網路拓撲結構，對頂點地址相反的頂點對之間增加一條邊，構成加強交叉立方體。
  18. Several authors observed that the assumptions of theorem a imply stronger cycle properties. hendry [ 3 ] ( and, later on independently ambartsumian et al [ 11 ] ) proved the following theorem : theorem b [ 3 ], [ 11 ] every connected, locally connected claw - free graph on at least three vertices is fully cycle extendable

    后來，許多圖論專家發現該定理的條件暗含著更強的圈性質，其中hendry [ 3 ] （后來ambartsumianetal獨立地）證明了下面的定理：定理b頂點數不小於3的連通、局部連通的無爪圖是完全圈可擴的
  19. We propose some new ideas for finding the graphs, which has minimal or maximal value of the topological index among all the graphs with n vertices and m edges

    對n個頂點m條邊的簡單連通圖，哪些圖具有最小或最大的拓撲指標值也做了深入的研究。
  20. Among all the graphs with n vertices or m edges and some special graphs, the graphs that have minimal or maximal value of the topological index are found

    對于給定頂點數或邊數的簡單連通圖以及在一些特殊圖類中，確定了哪些分子圖具有最小或最大的拓撲指標值。
分享友人
分享到 Line

分享到臉書