連通點集 的英文怎麼說

中文拼音 [liántōngdiǎn]
連通點集 英文
connected set of points
  • : Ⅰ動詞1 (連接) link; join; connect 2 (連累) involve (in trouble); implicate 3 [方言] (縫) ...
  • : 通量詞(用於動作)
  • : Ⅰ名詞1 (液體的小滴) drop (of liquid) 2 (細小的痕跡) spot; dot; speck 3 (漢字的筆畫「、」)...
  • : gatherassemblecollect
  • 連通 : feed through; connection; connected; intercommunication
  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. 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最小生成樹演算法自動生成屏內安裝接線圖和端子接線圖。
  3. 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

    摘要描述了工作流基本節的出入度及性質,並根據這些性質提出了工作流基本節的多色合表示方法。
  4. 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 ) :擴充了系統級故障診斷模擬系統的功能,快速、直觀和隨機地模擬實驗運行環境,進行清晰和正確的診斷,同時提供大量的實驗數據用於理論研究,優化演算法和設計。
  5. Based on the " size " of the set of perturbed minimal points in the variational principle, the differentiability of lower semicontinuous functions is examined by means of approximation of the infconvolution sequence

    摘要過函數的下卷積函數列的逼近方法,在變分原理中從擾動最小值的「大小」入手,研究了下半續函數的可微性。
  6. A further application of the puzzle theory, due to faught and hubbard, is the study of the julia sets and the connectedness locus of a cubic family with one critical fixed point

    利用這個理論, faught和hubbard研究了有臨界不動的單參數三次多項式族的julia及其跡的局部性。
  7. In the case ( 3 ). we also have that each critical component and its inverse images under iterations are homeomorphic to the filled julia set of a quadratic polynomial with connected julia set. each of the other components of a ' ( / ) is a single point

    對于( 3 ) ,我們進一步有:填充juia包含臨界的周期分支及其迭代逆象同胚於一個有julia的二次多項式的填充julia,而其他分支都是單
  8. Essential components of the equilibrium point set of generalized games

    廣義對策平衡的本質
  9. On the essential components of the set of nash equilibrium points for infinite games

    平衡的本質
  10. The existence of essential components of the sets of nash equilibrium points for infinite games

    平衡本質區的存在性
  11. 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為平面的坐標向量。
  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. This problem has vide applications in real areas, such as the design of water and electricity supply networks, and communication networks, etc. at the same time, the problem is also closely related with some classical combinatorial optimization problems, including the steiner problem and the travelling salesman problem, which are well - known. so, it is of great importance to study it

    所謂歐幾里德2 -steiner網路問題,就是對于給定的平面p ,確定它的長度最小的2 -steiner網路,該問題與組合最優化中著名的steiner問題和旅行售貨員問題有關,同時在水、電供應網路和訊網路等設計中也有非常廣泛的應用,所以對該問題的研究具有重要的意義。
  14. Connected set of points

    連通點集
  15. It firstly utilizes the characteristic of layout geometric information to partition the global network into some sub networks. after these sub networks are compressed by cholesky factorization, the sub networks edge nodes are combined with other nodes. calculating the final linear equations group, the algorithm can be very effective

    演算法首先利用版圖幾何特徵,按最小割原理將電源地網劃分成子網,利用對稱正定矩陣cholesky分解壓縮子網內;將子網等效成與網路其它部分接的結的等效網路,最後過計算壓縮后的網路,獲得線性方程組求解答案。
  16. In this paper, we first give some sufficient conditions for t in a tree t : theorem4. 1 : let d be a set of t, if the vertices of d are all hooks and each middle vertex of t relative to d has only one neighbor in d, then ji = y, ? theorem4. 2 : let d be a yrset of t, if the vertices of d are all hooks and the connected components of [ d ] : d1, d2, . . . ,

    首先這篇文章給出了在樹中_ l與_ t相等的一些充分條件:定理4 . 1 :設d是樹t的_ t合,若d中每都是鉤子,且t關于d的每個中介都只與[ d ]的一個分支相關聯,則_ l = _ t 。
  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. It becomes more difficult to manage, integrate and share the control system real - time data when we set up the industrial real - time database because of complicated affair between every department and isomeric character of the system. a three - level - structure model and the method to establish database is provided based on corba criterion with its character of being regardless of programming languages, hardware platform and network protocol. a universal real - time database faces multi - system is also set up by learning the distributed criterion, it can realize the request broker, and the application software can visit the database pellucidly ; thus the power station simulation model can be linked with the control system such as infi90, ovation and be made use of the control object, a closed simulation and control experiment system is set up

    在創建工控領域實時數據庫時,企業各部門間的復雜事務及內部異構性給實時數據的管理、成和共享帶來了一定的困難,根據corba規范具有語言無關性、平臺無關性和網路協議無關性的特提出基於分散式計算規范corba的三層體系結構模型及建立與維護實時數據庫的方法和途徑;過corba規范建立面向多個分散控制系統的用實時數據庫,實現數據訪問代理,使應用軟體可以透明地對實時數據庫進行訪問、存取、管理;將infi90 、 ovation分散控制系統與火電廠模擬機模型進行有效的互,以全物理過程模擬數學模型為對象,構建了閉環控制模擬實驗研究系統,實現數據的高效及管理;進而過基於corba的實時數據庫構建一個從火電廠模擬機對象到過程式控制制設備再到sis系統的綜合自動化試驗平臺。
  19. 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

    其有序的頂合組成頂模型,有序的邊線合組成邊線模型,兩者過形變模型的二階續性緊密地結合在一起。
  20. If fc has no parabolic periodic points and is not renormalizable, then j ( fc ] is locally connected. here fc is renormalizable if there are simply connected domains u and u " and a positive integer n such that contains the critical point c or - c1 and is a quadratic - like mapping with connected julia set

    這里, it稱為可重整化的定義為:存在單區域l 』 、 u 』及正整數n ;使得i 』 u ,仁』包含臨界c或一c , 」 : r一u是一個二層分支覆蓋,且擬共形共軛於一個有julia的二次多項式。
分享友人