最短路網 的英文怎麼說

中文拼音 [zuìduǎnlùwǎng]
最短路網 英文
minimum path network
  • 最 : 副詞（表示某種屬性超過所有同類的人或事物） most; best; worst; first; very; least; above all; -est
  • 短 : Ⅰ形容詞（空間、時間兩端之間的距離小） short; brief Ⅱ動詞（缺少; 欠） lack; owe Ⅲ名詞1 （缺點） we...
  • 路 : 1 （道路） road; way; path 2 （路程） journey; distance 3 （途徑; 門路） way; means 4 （條理） se...
  • 網 : Ⅰ名詞1 （捕魚捉鳥的器具） net 2 （像網的東西） thing which looks like a net 3 （像網一樣的組織或...
  • 路網 : road net, road network
  1. Domain ontology can be modeled a simple directed acyclic network, subsumption relation between two concepts can be computed by the ( immediate ) ancestor or descendent algorithm in a ~ ( h ), association degree between two concepts can be computed by the shortest path algorithm in a ~ ( h )

    領域本體可以模型化為一個簡單有向無環網路，概念之間的包含關系可以通過a ~ h中的（直接）前驅后繼演算法來求解，而概念之間的關聯度可以通過a ~ h中的最短路徑演算法來求解。
  2. Secondly, according to the characteristics of few hubs in the practical hub and spoke airline network, the shortest path algorithm is improved, and an exact algorithm is proposed to solve the airline network robust optimization model, with which robust solutions suitable for various possible scenarios are obtained

    然後結合中樞輻射航線網路實際應用中樞紐個數少的特點，對最短路演算法加以改進，提出了一種求解航線網路魯棒優化設計的精確演算法，得到了適用於多種可能情景的魯棒解。
  3. Main technic of giss webgiso thus function modules architecture and network topological structure are confirmed webgis system implements the basic function of electronical map, such as map zoonu pan, and the abundant query of geograph and database by using maplnfo mapxtreme for java as map server and jsp., java technico this system also can implement the routing of linesx analysing of buffer and so on0 this paper advances storage model of roads and pipelines topology data, efficiently solves the maintenace problem of network topology data of webgis and implements the shortest path algorathm based on webgis by improving it0 the system has better opening by suppling database interface of map ? the system has perfect on - line help and user forum and favorable interfaces and implementation of this system makes fundament for the further research of webgiso

    本系統利用mapinfomapxtremeforjava作為地圖服務器，採用jsp和java技術，實現了基於webgis的電子地圖的縮放、漫遊等基本功能，並具有豐富的圖文定位查詢功能；實現線路路由、緩沖區分析等輔助決策功能；構建了道路管線網路拓撲數據的存儲模型，有效地解決了基於webgis的網路拓撲數據的維護問題；對dijkstra演算法進行了一些改進，實現了基於webgis的最短路徑演算法；本系統提供了電子地圖數據庫介面，使本系統具有很好的開放性和通用性； webgis系統軟體具有完善的在線幫助和用戶交流論壇，人機界面友好。
  4. After knowing fully the present situation of business operation of the golden cereal company and development characteristics in logistic - system field, the mathematics model of logistics system has been established in the article with the application of linear program method in operational research, as well as the strategy of minimum route in graph theory and the thought of transiting all over ; meanwhile, on the foundation of internet network technology and structure of b / s, the online optimization design and production of web page have been carried out for the logistic - system of the golden grain farming capital company with adoption of jsp ( java server page ) technology and sql server database technology

    本文在充分了解金色谷農資公司的業務運行現狀和物流配送行業發展特點的基礎上，應用運籌學的線形規劃方法，以及圖論中最短路徑的策略和圖的遍歷的思想，建立了配送系統數學模型；並基於internet網路技術b s結構基礎上，採用jsp （ javaserverpage ）技術和sqlserver數據庫技術，對金色谷農資公司物流配送系統進行了網上優化設計及網頁製作，研製開發了金色谷農資智能配送網。
  5. Topics covered include : sorting ; search trees, heaps, and hashing ; divide - and - conquer ; dynamic programming ; amortized analysis ; graph algorithms ; shortest paths ; network flow ; computational geometry ; number - theoretic algorithms ; polynomial and matrix calculations ; caching ; and parallel computing

    課程主題包含了：排序、搜尋樹、堆積及雜湊；各個擊破法、動態規劃、攤提分析、圖論演演算法、最短路徑、網路流量、計算幾何、數論演演算法；多項式及矩陣的運算；快取及平行計算。
  6. This subject will survey some of the applications of network flows and focus on key special cases of network flow problems including the following : the shortest path problem, the maximum flow problem, the minimum cost flow problem, and the multi - commodity flow problem

    這個主題將審視一些網流的應用並集中焦點在以下網流問題的關鍵特殊情況:最短路徑問題，最大流量問題，最少成本流量問題，和多元物品流量問題。
  7. The main functions of the system are implemented, including browsing digital map, navigation and positioning, communicating, and connecting internet. the results are very well

    本系統可以實現的主要功能有:電子地圖瀏覽、 gps定位導航、短消息通信、語音通信、 gprs上網、最短路徑搜索、中文輸入等。
  8. For a given muting plane, first of all, this algorithm generates the corresponding grid group by barriers and nets ' ports, establishes initialization pheromone matrix, then the algorithm will use the character of ant colony algorithm to find out the shortest muting path only if it exits

    對于給定的布線平面，該演算法首先由障礙圖形和各個線網的端點生成一個包含最短路徑的訪問點陣，建立初始信息素矩陣，然後利用蟻群演算法所特有的路徑尋優功能來找到當前布線路徑上的最短路徑。
  9. The dijkstra algorithm of the least of hops is used for path calculated in olsr. but the protocol only tries its best to transmit data, not considering the state of wireless link

    它採用dijkstra演算法計算跳數最短路徑，並盡力而為地傳送數據包，沒有考慮無線鏈路時延、帶寬等狀態和節點擁塞程度，這樣的路徑計算方式已經不能滿足用戶對網路提供服務質量的要求。
  10. Study on vital nodes of the shortest paths in transportation networks

    運輸網路最短路徑關鍵點問題研究
  11. Standard shortest path algorithms ( such as the dijkstra algorithm ) are not valid, since travel times are random, time - dependent variables. especially, the recognition version of the stochastic shortest path problems is np - complete. k expected shortest paths problem shown in this paper is one of these problems

    傳統的最短路徑方法不能解決這種非線性路徑耗費的路徑問題，尤其是同時具有隨機性和時間依賴性的網路使得最優路徑問題成為np完全問題，本文研究的k期望最短路徑就是這樣的問題之一。
  12. To analyze the factors of impacting load balancing of links, which is including the number of routes between source node and destination node, the number of routes through every link, the maximum flow between source node and destination node, the maximum flow through every link, the free bandwidth of every link and so on, we present the fast dynamic routing algorithm ( fdra ) and the critical link routing algorithm ( clra ). simulation results show presented algorithms in the paper are better than other algorithms in reject ratio of the traffic requests and performance of rerouting the traffic requests when a link is failure, especially in computing time cost

    通過分析影響網路的鏈路負載均衡的因素，比如源-目的節點間的最大流，通過每條鏈路的最大流，源-目的節點間的路徑數目，通過每條鏈路的路徑數目，以及鏈路的剩餘容量等，提出了快捷動態路由演算法fdra和關鍵性鏈路路由演算法clra ，通過模擬，與最小跳演算法（ mha ） 、最寬最短路徑（ wsp ）演算法、最小干擾路由演算法（ mira ）相比較，提出的兩種演算法在業務阻塞率、資源利用率以及重路由性能方面都有很好的效果。
  13. It first shows the building of stochastic, time - dependent network model, the description of k expected shortest paths problem, the demonstration of travel time probability distributions for the arcs in transportation area, and the calculation of expected travel time on path

    本文首先給出了隨機時間依賴網路模型（ stdn模型） 、 k期望最短路徑問題的形式化描述，並針對交通應用領域推導出弧耗費服從的概率密度函數，路徑期望值的計算方法。
  14. A source routing framework is proposed to route traffic flows proactively over multiple paths, which tries to optimize routes for long - lived flows based on dispersity routing ; based on mathematical analysis, our approach disperses incoming traffic flows onto multiple paths according to path qualities. long - lived flows are detected and migrated to the shortest path if their qos could be guaranteed there. suggesting non - disjoint path set, four types of dispersion policies are analyzed, and flow classification policy which relates flow trigger with link state update period is investigated

    提出一種以業務量內在特性為基礎的前攝式多路路由演算法：以對業務量的內在特性分析為基礎，該方法在多路發送數據流的同時檢測非最短路徑上的長流，而後在保證服務質量的前提下將長流遷移到最短路徑上傳輸；前攝式多路路由使用以路徑質量評價為基礎的業務流分佈方法有效提高網路吞吐量，通過周期性的路徑質量評價適應時變網路狀況；模擬實驗表明，該方法可以有效提高「盡力而為」方式下的網路服務質量和資源利用率；浙江大學博士學位論文3
  15. Abstract : in this article an optimization method is applied to de sign open - type distribution networks. graph theory technology is used. its mathem at ical model considers both the investment of constructing lines and the cost of o peration. the main idea is getting the structure of tree network that meets with the technical constraint conditions and at the same time make the annual cost mi nimum. the examples of simulation show that this method is fast and effective

    文摘:將圖論優化技術應用於配電網路的優化設計，提出了一種適合於開式配電網路規劃的優化方法.所建的數學模型綜合考慮了待建線路的投資和運行費用.求解方法是以圖論中的最短路徑問題為基礎，配合以開式網路潮流演算法，並通過可行路徑的合理變換，得出滿足技術約束條件且使年計算費用取極小值的樹狀網路結構
  16. Lianyungang port, the world renowned eastern headbridge of the new eurasian continental bridge, offers the shortest path for the foreign trade and export of the middle and north - west china. the railway from lianyungang, going west across our middle areas alongside longhai line, lanxin line, beijiang line, and connecting eurasia through the railway network of former soviet russia and west - europe, provides the shortest railway transportation between pacific and atlantic seacoast

    連雲港港是我國中原和西北地區最短路徑的出海口岸和對外貿易口岸，也是世界著名的亞歐大陸橋的東方橋頭堡，從連雲港沿我國的隴海、蘭新、北疆鐵路向西，橫穿我國中部，通過原蘇聯與西歐鐵路網連接亞歐大陸，提供了太平洋和大西洋沿岸最短的鐵路運輸。
  17. Concept and implement of graph, basic operations of graph, minimum cost spanning tree, shortest path problem, aov and aoe network

    圖的概念和實現；圖的基本操作；最小價值生成樹；最短路徑；活動網路。
  18. We set focus on solutions which include the vector map representation of city road network, the abstraction and construction of the topological structure of network, and the efficient implementation of shortest path algorithm

    其中，重點解決了城市道路網的矢量地圖表達、網路拓撲結構的提取和構建、最短路徑演算法的高效實現等關鍵技術。
  19. One is the " belt persistence ", which is defined as the total length of joints teace length in a 1m wide belt projected to a basic line ( eliminating the overlay section ) over the length of the basic line. another is the one called as " search persistence ", which is defined a as the total length of joints trace length on the searched potential slipe surface over the length of the slip surface. thus, the author establishes a measuring and calculation system to these definitions and finishes a great deal of field investigation aiming at the joints trace length and the " rock bridge " survey

    在此基礎上，針對a區邊坡的穩定性，結合邊坡的破壞失穩模式，以邊坡節理巖體的連通特性的研究為突破點，從節理巖體的幾何參數的統計分析出發，採用monte - carlo隨機模擬原理形成節理網路模擬圖，以巖橋和節理組合破壞的內在機制為依據，以搜索節理巖橋組合的最短路徑為手段，通過帶寬投影法與路徑搜索法兩種方法的計算，獲得了sn向中緩節理的連通率分別為48 . 7和56 . 78 ，最終推薦60的連通率進行了邊坡的穩定性分析與計算，並結合工程實際，計算了邊坡的推力與錨固力，最終為邊坡的支護設計提供優化建議。
  20. Simulation results show that the developed scheme performs well in terms of qos performance metrics such as the lightpath hop length and the network maximal link load. for ip over wdm networks consist of oxcs and routers, which are inter - connected by optical fibers, chapter 3 presents a novel routing and wavelength assignment algorithm based on k - shortest path

    對于由大量路由器和oxc通過光纖互連而組成的ipoverwdm網路，第三章創新性地提出了將ip層矛咣層綜合考慮進行：路由選擇，並利用k ? ?最短路由對有長度限制的請求進行資源分配的演算法。
分享友人
分享到 Line

分享到臉書