edge connectivity 中文意思是什麼

edge connectivity 解釋
邊連通度
  • edge : n 1 刀口，（刀）刃；鋒；端；銳利。2 邊，棱，邊緣，邊界，界線，界限。3 優勢，優越條件。4 （聲調、...
  • connectivity : 對外連系
  1. The sedimentation is the foundation, affecting the basic pattern of the reservoir, and the sedimentary facies zones beneficial to the formation and evolution of the reservoir includes platform edge bank facies, introplatform point beach facies and acclivity sedimentary facies, etc. ; the diagenesis is the key factor, determining the pattern and scope of the final distribution of the reservoir and being of great influence on reservoir structure, and the diagenesis of promoting the formation of storage rooms is mainly the dissolution occurred during hypergene stage and burial stage ; and the tectonism is the condition of influencing the connectivity among various reservoir bodies and among the storage rooms within a single reservoir body

    該套儲層是在4億年左右的地質歷史中，由沉積、成巖和構造作用相互影響而形成的最終成果：其中沉積作用是基礎，影響著儲層的基本形態，有利於儲層形成與演化的沉積相為臺地邊緣灘、臺內點灘和上斜坡等沉積相帶；成巖作用是關鍵，決定了儲層的最終分佈形態和范圍，對儲層結構的影響至關重要，促進儲集空間形成的成巖作用主要有表生期和埋藏期的溶解作用；構造作用是條件，影響著各儲集體之間以及單一儲集體內部儲集空間的連通情況。
  2. On restricted edge - connectivity of vertex - transitive graphs

    點可遷圖的限制邊連通度
  3. Restricted edge connectivity of binary undirected kautz graphs

    圖的限制性邊連通度
  4. The super restricted edge connectivity of kautz undirected graphs

    圖的超級限制邊連通性
  5. The classical measure of the reliability is the connectivity and the edge connectivity

    衡量網路可靠性的經典參數為圖的連通度和邊連通度。
  6. In the last chapter, we use the results of higher order edge connectivity to study the tree decomposition of transitive graphs, deriving a sufficient condition for a graph to have tree number equivalent to the arboricity

    在最後一章中，我們使用高階邊連通度的結果研究對稱圖中樹分解的一個問題，給出了森林數等於樹數的一個充分條件。
  7. But the difficulty with these two parameters is that they do not take into account what remains after the graph is disconnected. in fact, on one hand, it is often found that two graphs with the same number of vertices ( edges ) and the same connectivity ( edge - connectivity ) ) may result in entirely different forms after a minimum disconnecting set of vertices ( edges ) is removed, one may be totally disconnected while the other may consist of a few very stable components, and thus be much easier to reconstruct

    對于兩個具有相同點（邊）數，具有相同點連通度（邊連通度）的圖，從圖中分別去掉使圖不連通的點（邊）集后，所得圖的結構可能完全不同，這是因為點連通度、邊連通度和局部點、邊連通度等連通性參數僅反映了系統被破壞的難易程度，而對系統遭受破壞的程度並沒有明確的反映。
  8. For further study, many variations have been introduced, which are known as higher order connectedness, such as super - connectedness, hyper - connectedness, super - a, r - restricted edge connectivity, etc. this dissertation studies graphs, especially symmetric graphs, with higher order connectedness

    為了進一步的研究，人們提出了各種各樣的高階連通性概念，如super -性， hyper -性，超邊連通性， r -限制性邊連通度等。本論文主要利用圖的高階連通性研究網路（特別是對稱網路）的可靠性。
  9. Most notably, the parameters called connectivity and line - connectivity have been frequently used. the connectivity of a graph g is the least number of vertices of g whose removal disconnects g similarly, the line - connectivity of g is the least number of g whose removal disconnects g the higher the connectivity ( edge - connectivity ) of g, the more stable it is considered to be

    而這些研究工作主要是圍繞點連通度，邊連通度，局部點、邊連通度來做的，但隨著圖的連通性研究的不斷深入，人們越來越覺得僅用點連通度，邊連通度，局部點、邊連通度來描述圖的連通性存在很大的局限性。
  10. In the first chapter, the background and some basic results are introduced. in the second chapter, we study higher order edge connectivity, and obtained ( a ) except for three graphs, all infinite circulants with finite jump sequence are super - ; ( b ) except for three classes of graphs, all edge transitive graphs are optimally - ( 3 ) ; ( c ) the optimally - ( 3 ) property is characterized for vertex transitive graphs, in particular, necessary and sufficient conditions are give for cayley graphs to be optimally - ( 3 ) ( d ) a sufficient condition for a graph to be optimally - ( 3 ) is given

    第二章中，我們研究高階邊連通度，得到了如下結果： （ a ）除了三個特殊圖外，所有具有有限躍階的無限循環圖都是超邊連通的； （ b ）除了三種特殊圖類外，所有邊傳遞圖都是最優- ~ （ 3 ）圖； （ c ）刻劃了點傳遞圖的最優- ~ （ 3 ）性，特別是給出了cayley圖和極小cayley圖為最優- ~ （ 3 ）圖的充分必要條件； （ d ）給出了一個圖（不一定是對稱圖）是最優- ~ （ 3 ）圖的一種充分條件。
  11. Edge and vertex connectivity

    割邊割點
  12. Simulation result shows our approach can highly improve the connectivity and the accuracy of the image boundaries quickly and easily. ideally, the methods discussed in the previous section should yield pixels lying only on edges. edge connection is an important post - process technique of image edge extraction and image segmentation

    完成邊緣點的檢測后，為了得到能夠表現物體基元的邊緣鏈，我們需要進行邊緣連接的工作? ?將邊緣點連接成有意義的直線或曲線段，得到物體外部的閉合輪廓，進行圖像分割。
  13. Based on fuzzy logic, an effective algorithm of edge connection is proposed. simulation result shows our approach can highly improve the connectivity of the extracted image boundaries without distortion. this work lays foundations of target detection, tracking, and recognition for photoelectric tracker and imaging radar

    通過理論分析及模擬結果證明，本文提出的梯度參數自學習統計的方法和基於模糊判決的邊緣連接方法能夠有效地提取邊緣點進行邊緣連接，能夠在保持原有圖像不失真的情況下，較大地提高圖像邊界的連通性，為光電跟蹤器和成像雷達的目標檢測、跟蹤和識別等提供良好的基礎。
  14. They are binding number, scattering number, integrity and edge - integrity, tenacity and edge - tenacity, toughness etc. these parameters show the most serious damage and the situation of a network after the damage simultaneously, so they measure the connectivity of graphs more accurate

    這些參數同時反映了一個網路可能遭到的最大程度的破壞和被最大程度破壞后剩餘部分的工作狀態，因此更好地刻畫了圖的連通性。
  15. For the two sides above, it is urgent for us to find new parameters to measure the stability of graphs. consequently, a number of other parameters have recently been introduced in an attempt to cope with the difficulty which the connectivity and line - connectivity have, including toughness, edge - toughness, tenacity, edge - tenacity, scattering number and integrity

    正因如此，在圖的連通性研究中，迫切需要一個既能反映系統被破壞的難易程度又能反映系統遭受破壞程度的參數，而圖的完整度正是符合這樣要求的一個參數。
  16. Therefore the research of connectivity and stability of graphs has been a hot point in graph theory for long time. centering on this topic, except connectivity and edge - connectivity in early period, some new connected parameters of graph were introduced in succession

    圍繞這個問題，除了早期的點（邊）連通度外，人們后來又相繼引入了一些新的連通性參數，主要有聯結數，離散數，完整度和邊完整度，粘連度和邊粘連度，堅韌度等。
分享友人
分享到 Line

分享到臉書