最大頂點 的英文怎麼說

中文拼音 [zuìdàdǐngdiǎn]
最大頂點 英文
maximum vertex
  • 最 : 副詞（表示某種屬性超過所有同類的人或事物） most; best; worst; first; very; least; above all; -est
  • 頂 : i 名詞（人體或物體的最上部） crown; peak; top Ⅱ動詞1 （用頭支承） carry on the head 2 （從下面拱...
  • 點 : Ⅰ名詞1 （液體的小滴） drop （of liquid） 2 （細小的痕跡） spot; dot; speck 3 （漢字的筆畫「、」）...
  • 頂點 : apex; zenith; acme; vertex; corner; tip top; pinnacle; acnode; perfoot; top; grand climax; full; ...
  1. Crack side of apical towards the left from buttock or on the right side of equalize is horizontal, make one perpendicular bisector from qia ji apogee next, will coxal cent is 4 quadrant, quadrant goes up outside its and escape an internal angle ( connect a line to big rotor from the thorn on qia hind ) it is inject area namely

    從臀裂頂點向左側或右側劃一水平線，然後從髂嵴最高點作一垂直平分線，將臀部分為四個象限，其外上象限並避開內角（從髂後上棘至大轉子連線）即為注射區。
  2. Answer : " law of 10 " word : crack side of apical towards the left from buttock or on the right side of equalize is horizontal, make one perpendicular bisector from qia ji apogee next, will coxal cent is 4 quadrant, quadrant goes up outside its and escape an internal angle ( connect a line to big rotor from the thorn on qia hind ) it is inject area namely

    答： "十"字法：從臀裂頂點向左側或右側劃一水平線，然後從髂嵴最高點作一垂直平分線，將臀部分為四個象限，其外上象限並避開內角（從髂後上棘至大轉子連線）即為注射區。
  3. 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 ）時，交叉立方體中任兩個無故障頂點都至少有一條可靠路徑。
  4. A color a e x is legal for an uncolored vertex v e v if by coloring v with a, the subgraph induced by all vertices of color a has maximum degree at most d

    對頂點v是合法的，是指由所有染顏色。的頂點導出的子圖的最大度至多是d ，其中alice和bob每走一步都是用合法顏色染未染色點。
  5. The special species s. platensis in inner mongolia has the highest value of the content of pigments, the biggest net photosynthetic rate, the highest lightcom - pensation and lightsaturation. has the lowest value of the respiration ( 24 )

    內蒙古特有的鈍頂螺旋藻s1的光合色素含量、最大凈光合速率、光補償點、光飽和點都最高，呼吸速率最低（ 24 ） 。
  6. Also with the help of graph rewriting, a new decision selection algorithm is proposed. this algorithm takes advantage of the weighted vertex cover algorithm, finds the vertexes with different color, and puts the minimum one into the group of chosen by sequence

    同時，利用圖重寫規則實現了一個決策選擇演算法:採用圖的最小頂點覆蓋集合的演算法，首先通過圖著色找出著色相異的頂點，依次將可以使系統效益最大化的決策點加入到決策集合中。
  7. We define the weighted degree of v by the weight of a subgraph h of g is defined by the one with maximum weight among a certain kind of subgraphs is also called heaviest. so a heaviest cycle is a cycle with maximum sum of all edge ' s weights among all cycles of a graph

    頂點v的賦權度定義為圖g的子圖h的權定義為某類子圖中權最大的又叫最重的，所以最重回也就賦權用的所有回中權之和最大的回
  8. ( 三 ) under the dynamic load of the explosion, the numeric analysis has been done and achieve the rule as follow : ( 1 ) when the frequency of vibration is 0. 3hz, the acceleration of the slopes top gets the maximum ; so 0. 3hz is believed the natural frequency of the slope as a whole ; ( 2 ) the vibration of explosion can been magnified because of the condition of the landform, when the relative altitude is up to 45m, the acceleration of horizon gets the maximum ; when the relative altitude is up to 100m, the absolute value of acceleration and the deformation of horizon is larger than that in the bottom of the slope ; ( 3 ) in the period of forced vibration, at the top of the slope, the acceleration of horizon become larger and larger ; at the middle part of the slope, it becomes smaller ; ( 4 ) when the explosion velocity of is much little, the shallow part destruction is the primary deformation of the slope

    （三）採用模態疊加法針對爆破動力作用，進行邊坡的動力響應分析，得出了以下結論： （ 1 ）振動頻率為0 . 3hz時，坡面頂部水平向加速度峰值最大；綜合考慮，可認為該邊坡的自振頻率為0 . 3hz左右； （ 2 ）地形對爆破地振動存在放大作用，研究剖面的坡面，水平向加速度及位移在地形相對高差45米左右最大，而後隨相對高差的增高而減小，相對高差為100米時，水平向位移及加速度絕對值均大於坡腳； （ 3 ）強迫振動段，水平向加速度值隨時間變化的規律為：坡頂節點總的變化趨勢是越來越大，而坡體中部節點的變化趨勢是越來越小； （ 4 ）當爆破振速較小時，變形破壞的形式表現為坡頂表面滑塌型。
  9. The time or period during which the highest point or degree is attained

    頂峰時期達到最高點或最大程度的時間或時期
  10. Top displacements get largest in structure under the concentrated load, and get smallest in structure under the uniform load

    結構頂點位移在頂點集中荷載下達最大，在均布荷載時最小。
  11. 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 ）基於光線跟蹤的演算法，該演算法中所有通過輪廓頂點的光線和對應其它圖像輪廓的光錐進行求交計算，最後得到每次求交計算得到線段的交集，該線段的頂點就認為是物體表面點，從而得到物體表面的點雲。
  12. By the algorithm ccn, we investigate the crossing numbers of regular graphs with small order. we get the crossing numbers of 3 - regular graphs for n < 16 and 4 - regular graphs for n < 12, and the lower bounds of the maximum crossing numbers of 3 - regular graphs for n < 30 and 4 - regular graphs for n < 19, where n is the order of graphs. according to the result, we put forward the conjecture about the maximum crossing numbers of regular graphs

    本文還利用演算法ccn （ calculatecrossingnumber ）對頂點數較小的正則圖的交叉數進行研究，計算出n 16的三正則圖和n 12的四正則圖的交叉數，以及n 30的三正則圖和n 19的四正則圖的最大交叉數的下限（ n為圖的頂點個數） ，根據計算結果提出關于正則圖最大交叉數的猜想。
  13. It invests all 3 - regular graphs with order at most 18, all 3 - regular generalized petersen graphs with order at most 30, all 3 - regular graphs with maximum girth and order from 20 to 30, some random 3 - regular graphs with order from 20 to 30, and all circulant graphs cn ( l, k ) with order at most 18. in this article, it is shown that the average crossing number of 3 - regular graphs with biggest girth and order n ( 18 ) is greater than that of all 3 - regular graphs

    通過研究n 15的所有三正則的廣義petersen圖p （ n ， k ） ， n 18的所有三正則圖， 20 n 30的隨機三正則圖與具有最大圍長的三正則圖， n 18的所有循環圖c _ n （ 1 ， k ） ，本文得到如下規律：對于給定的頂點數n （ n 18 ） ，具有最大圍長的三正則圖的平均交叉數大於所有三正則圖的平均交叉數。
  14. Joel siegel : it started at eleven, so it ' s really ocean ' s 3. the buzz in ocean ' s 14, brad pitt adopts george clooney

    這部片子從11開始，所以它實際上是「十一羅漢3 」 。 「十四羅漢」中最大的看點是皮特頂替了克魯尼。
  15. Certain ritualistic movements take place, in which the grouped masters and their disciples of all ranks take up symbolic positions, and form on the floor of the valley such significant symbols as the five - pointed star, with the christ standing at the highest point ; of a triangle, with the christ at the apex ; or a cross, and other well known formations, all of which have a deep and potent meaning

    某些儀式活動發生了，裏面是大師團和他們所有級別的門徒，從事著象徵性的場面，山谷底下，這樣意義重大的象徵符號是五角星，救世主站立在最高點上；一個三角形，救世主在頂點；或者一個十字架；還有其他相當熟悉的構成形狀，所有一切都擁有深遠和有力的意義。
  16. 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條邊的簡單連通圖，哪些圖具有最小或最大的拓撲指標值也做了深入的研究。
  17. 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

    對于給定頂點數或邊數的簡單連通圖以及在一些特殊圖類中，確定了哪些分子圖具有最小或最大的拓撲指標值。
  18. In these examples, the results indicate that moments of every floor are very close, and each story obviously has an inflection point except ground floor in ordinary frame under the concentrated load. the moments get larger from top floor to ground floor, and the columns of ground floor and side columns of the stories close to the top floor do not have inflection point in ordinary frame under the trigonometry load or uniform load

    結果表明，無轉換層時，頂點集中荷載下，各樓層的彎矩非常接近，除底層外，每層都有明顯的反彎點;而在倒三角荷載或均布荷載下，各樓層彎矩由上至下逐漸變大，接近頂端幾層的外柱和最底層柱均沒有出現反彎點。
  19. Also the new ideas and the results of theoretic calculation are proved by in - situ measurement and experimentation in some two top coal caving mining faces, and the initial safe supporting strength in coal mining face be concluded

    在此基礎上提出最小支撐強度和最大支撐強度的觀點，指出了決定它們取值大小的因素，最後通過兩個放頂煤工作面部分實驗和現場的測試，對提出的觀點及理論計算值進行了驗證，從而得出了採煤工作面的安全初撐強度。
  20. Top tight design requirements of the node, not less than 70 % of close contact, and the gap should not exceed 0. 8 mm greatest risk

    設計要求頂緊的節點，接觸面不應少於70 %緊貼，且邊緣最大間隙不應大於0 . 8 ?
分享友人
分享到 Line

分享到臉書