邊連通度 的英文怎麼說

中文拼音 [biānliántōngdù]
邊連通度 英文
edge connectivity
  • 邊 : 邊Ⅰ名詞1 （幾何圖形上夾成角的直線或圍成多邊形的線段） side; section 2 （邊緣） edge; margin; oute...
  • 連 : Ⅰ動詞1 （連接） link; join; connect 2 （連累） involve （in trouble）; implicate 3 [方言] （縫） ...
  • 通 : 通量詞（用於動作）
  • 度 : 度動詞[書面語] （推測; 估計） surmise; estimate
  • 連通 : feed through; connection; connected; intercommunication
  1. By two ways, this paper debates the theory of fracture detection : on one hand by the way of edge detection in image processing ; on the other hand by time series analysis. the detection by time series analysis is more antinoise than edge detection in image processing. edge detection theory in image processing mainly includes correlation data, fuzzy edge detection, entropy operator edge detection and gradient edge detection

    圖像處理中的邊緣檢測的方法主要包括相干數據體法、模糊邊緣檢測法、基於熵運算元的邊緣檢測法、梯度邊緣檢測法；其中模糊邊緣檢測法比較依賴于參數的選擇，其渡越點兩邊的像素區別明顯；熵運算元的檢測方法則是檢測的圖像邊緣比較光滑，連通性好；梯度檢測法可以使用不同的運算元核，演算法比較簡單；相干數據體對于總體的大的裂縫的分佈具有比較奸的反應。
  2. On restricted edge - connectivity of vertex - transitive graphs

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

    圖的限制性邊連通度
  4. The marginal ocean basin ' s formation and evolution model may be as follows : early triassic, rift was formed by extension and splitting in india ( gondwana ) continental margin during it was drifting southward ; late triassic, the rift had been joined in the neo - tethys ocean in the east and converted into initial ocean basin, and ayila - zhongba micro - continental was formed in north of the rift

    洋盆的演化模式是：早三疊世，隨著印度（岡瓦納）大陸向南漂移，其北部邊緣因引張裂解產生裂谷，于晚三疊世向東開口與新特提斯洋主體連通，洋盆初具洋殼性質，北側形成阿依拉仲巴微陸塊。
  5. In the process of production and selection of eye - dots, firstly, the binary image contained human eye region is abstracted by morphological translation, labeled based on connection and the labeled region are assembled into candidates of human eye dots. after the dots are fine tuning based on gray projection calculation, they are chosen ground on gray and edge information

    在人眼待選點的產生和篩選過程中，我們首先通過形態學變換提取包含人眼區域的二值圖像；對二值圖像進行基於連通性的標注；標注區域會聚形成候選人眼點；再對候選點進行基於灰度投影積分的小鄰域微調；然後結合灰度信息和邊緣信息進行人眼點的篩選。
  6. The classical measure of the reliability is the connectivity and the edge connectivity

    衡量網路可靠性的經典參數為圖的連通度和邊連通度。
  7. 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

    在最後一章中，我們使用高階邊連通度的結果研究對稱圖中樹分解的一個問題，給出了森林數等於樹數的一個充分條件。
  8. Then, because the connectivity, super connectedness, restricted connectivity and restricted - connectivity of a graph are important parameters to measure fault - tolerance of an interconnection network, they are of very important significance in design and analysis of fault - tolerant interconnection network in reality

    圖的連通度，超連通度，限制連通度以及限制邊連通度是用來測量互連網容錯性的重要參數。在實際容錯網路設計和分析中有重要意義。
  9. 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

    對于兩個具有相同點（邊）數，具有相同點連通度（邊連通度）的圖，從圖中分別去掉使圖不連通的點（邊）集后，所得圖的結構可能完全不同，這是因為點連通度、邊連通度和局部點、邊連通度等連通性參數僅反映了系統被破壞的難易程度，而對系統遭受破壞的程度並沒有明確的反映。
  10. 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 -限制性邊連通度等。本論文主要利用圖的高階連通性研究網路（特別是對稱網路）的可靠性。
  11. 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

    而這些研究工作主要是圍繞點連通度，邊連通度，局部點、邊連通度來做的，但隨著圖的連通性研究的不斷深入，人們越來越覺得僅用點連通度，邊連通度，局部點、邊連通度來描述圖的連通性存在很大的局限性。
  12. 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 ）圖的一種充分條件。
  13. In chapter three, we study graphs with higher order vertex connectedness and ( a ) a characterization of edge transitive graphs which are super - connected or hyper - connected is given ; ( b ) a new measure of network reliability, semi - hyper - connectedness, is proposed, and edge transitive graphs which are semi - hyper - connected are characterized

    在第三章中，我們研究高階點連通性，得到如下結果： （ a ）刻劃了邊傳遞圖的super -性和hyper -性； （ b ）定義了一種新的網路可靠性度量標準： semi - hyper -性，並給出了邊傳遞圖為semi - hyper -圖的充要條件。
  14. In order to obtain a precise description to the joint persistence ration, the author define two types of persistence ration according to different methods of measuring and statistics

    因此，邊坡中sn向中緩傾角節理的發育程度及連通狀況的確定是正確評價邊坡巖體穩定性的前提。
  15. 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

    通過理論分析及模擬結果證明，本文提出的梯度參數自學習統計的方法和基於模糊判決的邊緣連接方法能夠有效地提取邊緣點進行邊緣連接，能夠在保持原有圖像不失真的情況下，較大地提高圖像邊界的連通性，為光電跟蹤器和成像雷達的目標檢測、跟蹤和識別等提供良好的基礎。
  16. The separation of gas and oil and water only limits to small system of gas pool and there are not separation of gas and water in the large bound. the border water is not active, the system of gas and water is small and driving power of water is poor. the degree of mineralization of strata water is lower, the type of water is sodium carbonate and respects the character of closing transition in the continent circumstance

    油氣水分異僅限於一個小氣藏系統，不存在大范圍的氣水分異現象；氣藏邊底水不活躍，氣水系統連通范圍較小，水體驅動能量有限；地層水礦化度較低，水型以碳酸鈉型為主，代表大陸環境下的封閉過渡帶特徵。
  17. 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 ）基於光線跟蹤的演算法，該演算法中所有通過輪廓頂點的光線和對應其它圖像輪廓的光錐進行求交計算，最後得到每次求交計算得到線段的交集，該線段的頂點就認為是物體表面點，從而得到物體表面的點雲。
  18. According to thorough research on mechanical mechanism of 3 - d tensional micro - fracture producing, this point is put forward the first time that : there is more stress concentration in the circumference of micro - cracks. and the cracks are easier to expand and to link with each other when the fissures contained saturated pore fluid than dry state. therefore, it is necessary to modify the griffith criteria

    4深入研究了三維張性微裂縫形成的力學機理，首次指出：在裂隙內飽含孔隙水的情況下，微裂縫周邊的應力集中程度更高，裂縫更容易擴展乃至連通，因此，在張裂縫發育的研究中應該對格里菲斯準則進行修正。
  19. 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

    交叉立方體的上述這些性質都與超立方體的相同。為了進一步提高連通度，我們改進了交叉立方體的網路拓撲結構，對頂點地址相反的頂點對之間增加一條邊，構成加強交叉立方體。
  20. 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

分享到臉書