選擇路徑 的英文怎麼說

中文拼音 [xuǎnzháilùjìng]
選擇路徑 英文
select path
  • 選 : Ⅰ動詞1. （挑選） select; choose; pick 2. （選舉） elect Ⅱ名詞（挑選出來編在一起的作品） selections; anthology
  • 擇 : 擇動詞（挑選） select; pick; choose
  • 路 : 1 （道路） road; way; path 2 （路程） journey; distance 3 （途徑; 門路） way; means 4 （條理） se...
  • 徑 : Ⅰ名詞1 （狹窄的道路; 小路） footpath; path; track 2 （達到目的的方法） way; means 3 （直徑的簡稱...
  • 選擇 : select; choose; opt; election; choice; culling; alternative
  • 路徑 : 1. （道路） way; route; trajectory; path; tail; travel2. （門路） method; ways and means
  1. Optimal path selection for virtual concatenation in sdh networks

    虛級聯中的最優化路徑選擇
  2. This dissertation can be divided into three parts as following : focusing on institutional risk control, this dissertation demonstrated the effect of institutional risk on dis " objects by analyzing the relationship between deposit insurance and financial development, financial stability and market discipline, in light of foreign or native primary theory and empirical results of dis. in virtue of statistical method and with the theory of game, this dissertation explored the cause the institutional risk such as moral risk and adverse selection, on the basis of which discussed the approach of controlling institutional risk and proper deposit insurance pattern. because deposit insurance assessment is the core of institutional risk control, this dissertation introduced and discussed deeply the passive casualty - insurance model, the option - pricing model, the game - theory - based pricing model, and reasonable pricing interval, and put forward the hierarchical pricing strategy of dis on the balance of information confiscatory and risk - based - assessment necessity

    本文以存款保險制度風險控制為中心，在借鑒國內外關于存款保險制度的基本理論和實證的基礎上，通過分析存款保險與金融發展、金融穩定和市場懲戒等方面的關系，論證了存款保險制度風險對存款保險制度目標的影響；並藉助統計學的方法，運用信息博弈論的觀點，從主要制度參與者? ?投保機構和存款保險機構? ?的效用函數出發，對存款保險所引發的道德風險和逆向選擇等制度風險的成因進行深入的剖析，探討有效控制制度風險的途徑和制度參數的安排模式；由於存款保險定價是制度風險管理的核心問題，本文還專門對意外存款保險消極模型、存款保險的期權定價模型、基於信息經濟學的存款保險定價模型以及合理定價區間等定價模式進行深入分析和詳細評述，闡述各種定價思路的局限性和可能運用的空間，通過權衡信息的充分性和風險定價的必要性，提出存款保險制度的層次性定價策略。
  3. But there are much incredulity and reprobation, whose focus is suspicious of villagers " ability to democratize. but douglas north ' s path dependence theory gives those thoughts an expositive pattern. based on that theory, as an original system choice, the villager autonomy determines

    對此，諾斯的制度變遷路徑依賴理論提供了一個解釋的框架:村民自治這一初始制度形式的選擇決定了制度變遷以後可能選擇的路徑，而制度的報酬遞增機制則是該制度進行自我強化的基礎。
  4. 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最小生成樹演算法自動生成屏內安裝接線圖和端子接線圖。
  5. 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 ）時，交叉立方體中任兩個無故障頂點都至少有一條可靠路徑。
  6. Choice of paths in civic moral building, which further looks into the choice of paths taken in the practice of civic moral building on the basis of self - discipline and heteronomy, duality of civic morals in their practice

    第三部分，即「公民道德建設的路徑選擇」 。本文依據公民道德「自律與他律」的二重實踐品性的理性確認，進一步考察了公民道德建設的實踐路徑。
  7. Abstract : the paper probed the analysis on the adding mode of perpendicular load in multistorey building structures, the bending moment of frame side beams and the top, the bending moment of secondary beams, the difference between the tie - beam, plane - frame analysis and the space analysis on the path of conduct force, ect. it can be used as a reference when probing these problems

    文摘:討論了在多項高層建築結構分析中垂直荷載加載模式的選擇，框架邊梁和次梁端部的彎矩計算，連梁問題和平面框架分析與空間分析在傳力路徑上的差別以及單片剪力墻平面外彎矩等問題，可供同類結構內力分析時參考
  8. An applied anatomical study of choosing transfer course of phrenic nerve harvested from thoracic cavity

    選擇進胸取膈神經移位路徑的應用解剖學研究
  9. The algorithm is realized by c. it is indicated by simulation that the algorithm is resultful. finally, the parallel genetic algorithm is discussed and the parallel genetic algorithm for shortest route choice is given

    最後，本文還探討了遺傳演算法并行計算的實現方式及其特點和適用范圍，並選擇了適用於最優路徑計算的并行遺傳演算法。
  10. These include repeating subsequences, alternative execution paths, concurrent and order - independent execution, and so on

    這包括序列的重復，執行路徑的選擇，並發和順序獨立執行等。
  11. The article will have a deep discussion about the comprehensive module of traffic control system and traffic guidance system as well as user equilibrium and system equilibrium principle. in the intelligent traffic system, traffic governor hope to allot traffic flow by system equilibrium principle while passengers could only choose appropriate paths by use equilibrium principle based on traffic information. the two principles are different with conflicting game relationship

    在城市交通控制與誘導一體化智能交通管理系統中，交通管理者希望按系統最優原則分配交通流，出行者在根據誘導信息選擇路徑時卻只可能遵循用戶最優原則，目標不同，二者是有沖突的博弈關系。
  12. The module is a game relationship between passenger and guidance system which is used for user to determine the best path by user equilibrium principle. the goal of the module is to realize system optimization. the variable is route guidance information and traffic signal timing while the method is to take use of guidance information for passenger to choose appropriate path

    模型基於出行者之間及出行者與誘導系統之間的博弈關系，確定出行者依據用戶最優原則選擇路徑，模型的目標是實現系統最優，決策變量是誘導信息和交通信號配時，方法則是利用誘導信息影響出行者的路徑選擇。
  13. Choosing route for passengers is the key technology in the bus information system. there are many classic algorithms such as dijkstra algorithm and floyd algorithm to solve the problem. but they do n ' t fit for this problem

    選擇路徑是公交信息系統中的關鍵技術，有很多經典的演算法解決最短路徑問題，如dijkstra演算法和floyd演算法，但大都不適合於公交查詢最短路徑。
  14. Review and rethink : technological path and comparative superiority of township and village enterprises

    鄉鎮企業的技術選擇路徑和比較優勢
  15. Firstly, we introduce the aodv - qos routing algorithm, the aodv routing protocol only try to find the shortest path without concerning about the qos constrains. in aodv - qos, the network has the privilege to generate paths according to its quality, and then an application selects a path with sufficient resources to satisfy a certain delay and bandwidth requirements

    本文首先分析研究了aodv - qos約束路由演算法，它將原始aodv路由選擇的最短路徑原則改為按照業務qos需求選擇路由，即在尋路過程中加入時延和帶寬約束條件，選擇滿足業務性能要求的路由。
  16. We chose the path

    我們選擇路徑
  17. Choose the path

    選擇路徑。
  18. Enter the path of the build output in this box, or click the browse button to select a path

    在此框中輸入生成輸出的路徑，或單擊「瀏覽」按鈕來選擇路徑。
  19. Emphasis is put on the path - plan level and trajectory - plan level according to the conditions we have. the planning method based on knowledge is proposed

    並根據現有條件，選擇路徑規劃和軌跡規劃這兩個規劃層次著重研究，提出基於規則的路徑規劃方法和按時間間隔對關節進行采樣的軌跡規劃方法。
  20. After analyzing a common used ant colony routing algorithm, this thesis proposed a new fast adaptive routing algorithm to overcome the drawbacks of the ant - based algorithm. the new algorithm uses network delay information directly to choose path by probability. its application will minimize the delay for an end - to - end data transmission and optimize the distribution of network resources to avoid network congestion

    演算法能夠憑借路徑時延信息並結合網路中各路徑的利用率情況自適應的調整發送路徑，並以概率的形式選擇路徑，一方面盡可能地使端到端數據傳送過程時延最小化，另一方面使網路流量分佈均勻，以減少網路擁塞發生的概率。
分享友人
分享到 Line

分享到臉書