結點集 的英文怎麼說

中文拼音 [jiēdiǎnjí]
結點集 英文
nodal set
  • 結 : 結動詞（長出果實或種子） bear （fruit）; form （seed）
  • 點 : Ⅰ名詞1 （液體的小滴） drop （of liquid） 2 （細小的痕跡） spot; dot; speck 3 （漢字的筆畫「、」）...
  • 集 : gatherassemblecollect
  1. When reinforced concrete upper structure - piled raft - subsoil system is studied, every part of this system is looked upon homogeneous discrete space. accofding to static equivalent principle, equivalent node loads are calculated, and load embattle is integrated with element equivalent node force and directly bearing load

    在分析時，本文將鋼筋混凝土上部結構和地基、基礎的研究問題視為各向同性空間問題，且按靜力等效原則計算等效節點荷載，荷載列陣由單元等效結點力和直接作用於單元結點上結點荷載集成而得。
  2. The main idea of this method is to choose a set according to the order of polynomials, to eliminate by making use of bezout eliminant, get zero set from the improved formula about set of zero points, so that a polynomial system of equation ~ set of zero points can be got only by one time arrangement

    該方法的主要思想是：根據多項式秩的大小選取基組，採用貝左結式消元，用改進型零點集結構式確定零點集，從而只需一次整序就可求得一個多項式方程組的零點集。
  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. Some answers to a question on discrete point set extremum

    一種離散點集極值問題的幾個結果
  5. Is that if a set of points in n - space is cut by a hyperplane, then the application of the perceptron training algorithm will eventually result in a weight distribution that defines a tlu whose hyperplane makes the wanted cut

    ）下的結論是，如果n維空間的點集被超平面切割，那麼感知器的培訓演算法的應用將會最終導致權系數的分配，從而定義了一個tlu ，它的超平面會進行需要的分割。
  6. Through entity and nonentity value action analysis, we emphasis on study on system operation of logistics in integrated supply chain

    結合集成供應鏈的實體和非實體價值活動，重點對集成供應鏈中物流整體化運作從物流范圍和物流主體層面進行了詳細的分析。
  7. Sometimes, soldiers from barracks do not move to the rally point, they just stand at the gate of the barracks

    兵營設置集結點后出來的兵有時候不往集結點走.傻傻地站在兵營門口
  8. This paper presents a manufacture and calculating method for castellated beams. according to the method, three beams are designed and tested, the detailed and trustworthy experimental data are obtained. in comparison of the castellated beam with the circular hole castellated beams during the process, that the yield of load and the strength limit for the latter are higher than the former is verified

    本文通過設計製造兩種不同截面形式的3根蜂窩梁（ 2根圓孔、 1根六邊形孔） ，進行了兩點集中荷載下的試驗，取得了較為翔實可靠的試驗數據，通過整理與分析，對兩種蜂窩梁的整體受力性能和承載力作出評價，得出圓孔蜂窩梁的屈服荷載和極限承載力都高於六邊形孔蜂窩梁的結論。
  9. 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 ） ：擴充了系統級故障診斷模擬系統的功能，快速、直觀和隨機地模擬實驗運行環境，進行清晰和正確的診斷，同時提供大量的實驗數據用於理論研究，優化演算法和設計。
  10. The finite element analysis of 3d seepage field for surrounding rock mass of cavern groups of underground powerhouses was performed based on the nodal virtual flux method for solving the non - pressure seepage field and the improved drainage substructure technique for accurately simulating the complex seepage behaviors of densely distributed drainage holes, with emphasis placed on the seepage properties of the anti - seepage concrete curtain and drainage curtain in the anti - seepage and drainage system

    摘要在求解無壓滲流場結點虛流量法的基礎上，結合可精細模擬密集排水孔復雜滲流水力行為的改進排水子結構技術，付某地下廠房廠區洞室群圍巖區三維滲流場進行了有限元求解分析，著重研究了防滲排水系統中的帷幕和排水幕的滲流特性。
  11. The other classfies the calculation of mbps into the solution of inequation based on heuristic knowledge of mbps of optimal directional coordination setting in complex multiloop network and comes into equivalence of 0 - 1 integral second layout problem. on the basis of the principle of gene optimal evolution, a new approach to determine mbps is first presented and decreases the computational complexity of mbps problem

    其二，利用復雜環網方向保護最優整定配合中最小斷點集（ mbps ）的啟發知識，將mbps的計算歸結為解不等式，進而等價為0 ? 1整數二次規劃問題，基於基因遺傳優化計算原理，首次提出了mbps問題的基因遺傳演算法，降低了問題的計算復雜性。
  12. The construction of the of limit points on indeterminate formula

    不定式極限點集的結構
  13. According to the crane management characteristics in both domestic and foreign terminals and with the thinking of how to find the key to calculate and reduce operation cost through analysis of maintenance composition, i put on the aim of maintenance analysis

    根據設備管理的目的和任務，結合集裝箱碼頭設備管理的特點和目前國內外大型碼頭設備的管理模式，提出了進行維修性分析的目的，產通過對維修成本要素的構成分析，確定運行成本的重點和解決運行成本的關鍵。
  14. The trailer adopts whole steel structure and have a kit like, the structure be firm, the shape be beautiful and make to move credibility, use safety, drive steady, load potential big, maintain a maintenance convenience, through long enduring etc. advantage, gather farmland homework and highway to transport at the whole body, the good tool for the plain, mountain area

    我公司生產的拖車採用全鋼結構，具有配套性好、結構牢固、造型美觀、制動可靠、使用安全、行駛平穩、裝載潛力大，保養維護方便、經久耐用等優點，集農田作業和公路運輸於一身，是平原、山區致富的好工具。
  15. Fundamentally, semantic grid database is about bringing globally distributed databases together in order to coordinate resource sharing and problem solving in which information is given well - defined meaning, and dartgrid ii is the implemented database gird system whose goal is to provide a semantic solution for integrating database resources on the web

    而語義數據庫網格則是採用語義技術將分佈的數據庫結點集成起來以支持資源共享和高層的問題協同求解，其中的服務與信息有明確良好的語義定義以便於機器理解和自動處理。
  16. 10 hassan m, alhajj r et al. simplified access to structured databases by adapting keyword search and database selection. in proc

    1動態收集訓練查詢和歷史查詢產生的候選網路，按照葉子結點集分類存儲到數據庫中。
  17. A series of recent papers has aimed at giving good bounds of feedback vertex set for families of graphs broadly known as : butterflies, hypercubes, meshes, star graphs, and so on

    摘要最近諸多文章旨在討論關于反饋結點集的上下界問題，比如：蝴蝶網、超立方體、網格、星圖等等。
  18. Compare to existing results for general graph, new lower bound on the size of the minimum feedback vertex set of ( n, k ) - star graph is given based on its special structure

    本文主要討論了關于組合星圖反饋結點集的下界問題，在基於組合星圖的性質和已有相關結果的基礎上，給出了組合星圖反饋結點集的新的下界。
  19. 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分解壓縮子網內點；將子網等效成與網路其它部分連接的結點集的等效網路，最後通過計算壓縮后的網路，獲得線性方程組求解答案。
  20. Different from the previous work, kf - diff + is tailored to both ordered trees and unordered trees. while dealing with the key path, the notion of the key constraint for semi - structure data and the notion of the multi - instance based keys are identified, which will greatly simplify the complexity of the algorithm

    在特徵路徑相關的計算中，本文引入面向半結構數據的key約束思想，並且針對先前判定演算法過于復雜的問題，提出了基於多實例結點集合的key約束的概念以及相關的處理方法，在一定程度上簡化了計算。
分享友人
分享到 Line

分享到臉書