點連通度 的英文怎麼說

中文拼音 [diǎnliántōngdù]
點連通度 英文
node connectivity
  • 點 : Ⅰ名詞1 （液體的小滴） drop （of liquid） 2 （細小的痕跡） spot; dot; speck 3 （漢字的筆畫「、」）...
  • 連 : Ⅰ動詞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. In this thesis, used thermocouple to sense the temperature in the space of the hearth, attributed the thermocouple based on calorifics and scientific arithmetic, acquired data by data acquiring card, processed data according to the demand of setting up temperature model and drawing graphics and then caculated the coordinates of isothermal points and normals of isothermal facets, ascertained the order of connecting points and the model of construct, drawed the isothermal facet of temperature field with opengl at last

    通過數據採集板卡進行數據採集並與計算機介面進行數據處理。然後，將處理后特殊點的溫度數據依據marchingcubes演算法建立數學模型求取等溫面上的點的坐標及各點的法向量等。最後，確定計算的三維坐標點的連接順序和拓撲模型，利用opengl進行等溫面的繪制、消隱和模式變換等工作。
  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. By describing the in - out quantities and connecting character of the workflow ' s basic nodes, the nodes are presented by the polychromatic sets according to these characters

    摘要描述了工作流基本節點的出入度及連通性質，並根據這些性質提出了工作流基本節點的多色集合表示方法。
  6. Facilitating the configuration of protocol parameters, optimization of protocol operations, and more exact estimation of protocol performance, etc. basing on combinatorial theory and asymptotic method, we analyzed the properties of manets with nodes uniformly distributed in rectangular region. mathematical formulas of some basic properties of manets are obtained, such as the expected number of wireless links, mean node degree, the relation between network connectivity and radio range

    因此本文第二章基於組合學方法和極限思想研究了矩形區域內節點均勻分佈的無線自組網的幾項基本屬性，網路中鏈路總數的期望值，網路中節點度數分佈情況，以及網路連通性與無線信號傳輸半徑的關系等，得出了其解析描述。
  7. On restricted edge - connectivity of vertex - transitive graphs

    點可遷圖的限制邊連通度
  8. With analyzing of the case study and based on simulating and analyzing quantitatively, this article, considering the goal of the performance - based fire - protection design is protecting occupants from being injured and keeping buildings from being damaged, thought that fire compartmentation of a large building of saling books can be divided according to their saling malls and fire compartmentation in the saling mall can be separated by the fire - proof screen. on the evacuation design, the quantity of safety exits around these buildings and the evacuation width should be increased if possible and the safety exit number, exit width and evacuation distance can be determined according to the simulating results on smoke layer temperature and height, concentration of co2 and co, occupants evacuation time and visibility. on the means of preventing and discharging smoke, the most proper measure should be determined according to their geometrical characteristics and the natural means of discharging smoke is feasible to the large building of saling books. based on analyzing of smoke

    通過對案例分析研究，本文認為大型書城建築性能化防火設計研究的最終目的是保證人員生命安全和保證建築結構安全，在模擬計算和量化分析的基礎上，大型書城的防火分區可以將中庭連通的書城區域劃分為一個區，在書城場地內可以採用防火卷簾進行防火分區劃分;在人員疏散設計中，應盡可能利用書城賣場的空間設計較多的安全出口和增大疏散寬度，其安全出口數量、寬度和疏散距離可以根據人員安全疏散時間和煙氣溫度、沉降高度、 co2濃度、 co濃度、能見度模擬計算結果驗證確定;在防排煙方式的選擇上，應當根據建築物的幾何特點選取最適宜的措施，就大型書城建築而言，採用自然排煙的方式是可行的。
  9. All the connected units in the page are detected by search algorithm of connected region. the row - column mergence of the character is defined by fuzzy connectedness of the connected units at four orientations. the combination of punctuation we adopt the method of combination behind recognition due to great effect of mergence

    版面圖文分割主要採用自底向上的辦法，利用連通域搜索演算法檢測出文本頁面上的所有連通基元，通過對連通基元的四個方向上的連接度進行模糊化處理來決定文字行、列的合併，並對在文字行合併時影響較大的標點符號採用先識別后合併的方法。
  10. A configuration is a connected cluster of vertices of a plane graph together with the degrees of the vertices.

    一個構形是面圖的一連串連通的頂點與這些頂點的度。
  11. 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

    在人眼待選點的產生和篩選過程中，我們首先通過形態學變換提取包含人眼區域的二值圖像；對二值圖像進行基於連通性的標注；標注區域會聚形成候選人眼點；再對候選點進行基於灰度投影積分的小鄰域微調；然後結合灰度信息和邊緣信息進行人眼點的篩選。
  12. 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

    對于兩個具有相同點（邊）數，具有相同點連通度（邊連通度）的圖，從圖中分別去掉使圖不連通的點（邊）集后，所得圖的結構可能完全不同，這是因為點連通度、邊連通度和局部點、邊連通度等連通性參數僅反映了系統被破壞的難易程度，而對系統遭受破壞的程度並沒有明確的反映。
  13. 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

    而這些研究工作主要是圍繞點連通度，邊連通度，局部點、邊連通度來做的，但隨著圖的連通性研究的不斷深入，人們越來越覺得僅用點連通度，邊連通度，局部點、邊連通度來描述圖的連通性存在很大的局限性。
  14. 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 ）圖的一種充分條件。
  15. Distribution of the limits of algebraic connectivity of tree

    樹的代數連通度的極限點的分佈
  16. 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 -圖的充要條件。
  17. Connectivity is discussed particularly, and some new conceptions are proposed, such as atom matching, atom - contracted digraph and atom stabilizer subgroup, based on which the structure characteristic of vertex - transitive digraphs is analyzed further, and current connectivity theory on vertex - transitive digraphs is consummated

    重點討論了點可遷圖的連通性及連通度，提出了原子匹配、原子收縮圖、原子穩定子群等一些新的概念，在此基礎上進一步分析了點可遷圖的結構特徵，完善了現有的點可遷圖的連通性理論。
  18. 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

    交叉立方體的上述這些性質都與超立方體的相同。為了進一步提高連通度，我們改進了交叉立方體的網路拓撲結構，對頂點地址相反的頂點對之間增加一條邊，構成加強交叉立方體。
  19. All these systems increase their reliability by studying ( among other ) the existence of two ( or more ) disjoint paths connecting any two nodes. to satisfy all these demands, we generalize diameter of graphs to generalized diameter of graphs

    這些系統不僅要求我們研究網路的連通度和直徑，而且要研究連接兩個節點或兩個點集間的內部點不交的多條路徑。
  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

分享到臉書