最短通路問題 的英文怎麼說

中文拼音 [zuìduǎntōnglùwèntí]
最短通路問題 英文
shortest path problem
  • 最 : 副詞（表示某種屬性超過所有同類的人或事物） 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 （請人解答） ask; inquire 2 （詢問; 慰問） question; ask about [after]; inquire about [aft...
  • 題 : Ⅰ名詞1. （題目） subject; title; topic; problem 2. （姓氏） a surname Ⅱ動詞（寫上） inscribe; write
  • 通路 : thoroughfare; highway; highroad; route; viae; lead; outlet; approach; passage; gangway; access; c...
  • 問題 : 1 （需回答的題目） question; problem 2 （需研究解決的矛盾等） problem; matter 3 （事故或意外） tr...
  1. 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系統軟體具有完善的在線幫助和用戶交流論壇，人機界面友好。
  2. The delay and delay variation constrained minimum steiner tree problem is also researched. lcdvma ( low - cost delay variation - constrained multicast algorithm ) is proposed for this problem. low time complexity, low cost and constrained delay and low delay variation are achieved by only comparing minimum delay paths and minimum cost paths

    對于時延和時延差約束的最小steiner樹問題，提出了一種基於最小時延路徑和最小費用路徑的演算法?一lcdvma演算法，由於該演算法比較了通過中轉節點后的最低費用路徑和最短時延路徑，降低了運算復雜度，通過模擬得到了較小的網路費用和時延差，因此lcdvma演算法是一種具有低復雜度的時延和時延差約束的最小steiner樹的啟發式演算法。
  3. We have great confidence in the power of our team. we give service to our clients by the power of our team. brand design is like a pro - ject on mental labour. we made overall layout since pre - project work. shahtoosh is not traditional advertising company, we have no pag - es of newspapers and magazine or billboards. we are not good at those. so, you should konw the nature of our business. we are good at brand design to the solution of practical problems for enterprise on ci. design is more than deal, you may take 10, 000 rmb to get a lo - go from one ' s advertising company, but you never get plans and thoughts of the solution on ci. shahtoosh can give theses to your com - pany

    在沙圖什的品牌設計團隊中，最重要的就是品牌設計部和品牌執行部，沙圖什沒有業務員，在企業形象的建立中，不是業務員的短期工作能解決問題的，所以沙圖什的業務來源全部依靠實際的口碑和網路口碑，然後由品牌視覺設計師直接和客戶溝通，這樣就減少了在溝通的傳達過程中的客戶信息流失，使設計師得到的信息更真實，減少客戶不必要的時間浪費。
  4. The number of the hidden layers of mul - tilayer perceptrons ( mlps ) is analyzed, and three - layer perceptrons neural network is adopted ; by analyzing the mechanism of the neural cells in hidden layer, a method for combining genetic algorithm and bp algorithm to optimize the design of the neural networks is presented, and it solves the defects of getting into infinitesimal locally and low convergence efficiently, it can also solve the problem that it can usually obtain nearly global optimization solution within shorter time through using genetic algorithm method lonely ; several examples validate that this algorithm can simplify the neural networks effectively, and it makes the neural networks solve the practical problem of fault diagnosis more effectively

    對多層感知器隱層數進行了分析，確定採用三層感知器神經網路;通過對隱層神經元作用機理的分析，引入了遺傳演算法與bp演算法相結合以優化設計神經網路的方法，有效地解決了bp演算法收斂速度慢和易陷入局部極小的弱點，還可以解決單獨利用遺傳演算法往往只能在短時間內尋找到接近全局最優的近優解的問題;通過實例驗證了這種演算法能夠有效地簡化神經網路，使神經網路更加有效地解決實際的故障診斷問題。
  5. E. w. dijkstra. 1959. a note on two problems on conneion with graphs. numer. math. 1, 395 - 412

    陳慧琪，時間相依最短路徑問題演算方法之研究，國立交通大學運輸工程與管理學系碩士論文， 2000年。
  6. L. fu. 2001. an adaptive routing for in - vehicle route guidance system with real - time information, transportation research part b, 35, 749 - 765

    陳慧琪，時間相依最短路徑問題演算方法之研究，國立交通大學運輸工程與管理學系碩士論文， 2000年。
  7. On - line monitoring of hvcb is the precondition of predicting maintenance, is the key element of reliable run, and is the important supplement to the traditional off - line preventive maintenance in fact, the faults are made by hvcb, no matter in number or in times, is over 60 % of total faults so it has determinative importance for improving the reliability of power supply and this can greatly decrease the capital waste used by - dating overhaul in this paper, the inspecting way of hvcb mechanism characteristic is discussed the concept of sub - circuit protector is presented, the scheme that we offered has been combined with sub - circuit integrality monitoring theory, to ensure that it has the two functions as a whole according the shut - off times at rated short circuit given by hvcb manufacturer, the electricity longevity loss can be calculated in each operation, and the remained longevity can be forecast too an indirect way for calculating main touch ' s temperature by using breaker shell temperature, air circumference temperature and breaker ' s heat resistance is improved in this paper, and main touch resistance can be calculated if providing the load current msp430, a new single chip microcomputer made by ti company, is engaged to develop the hardware system of the on - line monitoring device, and special problem brought by the lower supply voltage range of this chip is considered fully

    高壓斷路器所造成的事故無論是在次數，還是在事故所造成的停電時間上都占據總量60以上。因此，及時了解斷路器的工作狀態對提高供電可靠性有決定性意義；並可以大大減少盲目定期檢修帶來的資金浪費。本文論述了斷路器機械特性參數監測方法；提出了二次迴路保護器的概念，並將跳、合閘線圈完整性監視和二次迴路保護結合起來，給出具有完整性監視功能的二次迴路保護器實現方案；根據斷路器生產廠家提供的斷路器額定短路電流分斷次數，計算每次分閘對應的觸頭電壽命損耗，預測觸頭電壽命；提出根據斷路器殼體溫度和斷路器周圍空氣溫度結合斷路器熱阻來計算斷路器主觸頭穩態溫升的方法，並根據此時的負荷電流間接計算主觸頭迴路的電阻；在硬體電路設計上，採用美國ti公司最新推出的一種功能強大的單片機msp430 ，並充分考慮該晶元的適用電壓范圍給設計帶來的特殊問題；在通信模塊的設計中，解決了不同工作電壓晶元之間的介面問題，並給出了直接聯接的接線方案。
  8. 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期望最短路徑問題的形式化描述，並針對交通應用領域推導出弧耗費服從的概率密度函數，路徑期望值的計算方法。
  9. 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

    文摘:將圖論優化技術應用於配電網路的優化設計，提出了一種適合於開式配電網路規劃的優化方法.所建的數學模型綜合考慮了待建線路的投資和運行費用.求解方法是以圖論中的最短路徑問題為基礎，配合以開式網路潮流演算法，並通過可行路徑的合理變換，得出滿足技術約束條件且使年計算費用取極小值的樹狀網路結構
  10. Secondly, the following two subjects are discussed according to the calculation of short - circuit current : ( l ) to verify the dynamic stability condition of wires by using simulated annealing algorithm ( sa ), the paper calculates the maximum value of rectangle wires " short - circuit electrodynamic stress and gets the conditions of their having the maximum value. furthermore, some concerned data about the verifying of copper wires are given by analysing vibration spectrum of the electrodynamic stress ; ( 2 ) in order to get the heat withstand conditions of wires, the paper discusses some common calculation methods, and then tries to study the problem applying artificial neural network ( ann ) based on heat principle of metals. the model is shown to be feasible

    其次，在電路中短路電流計算的基礎上， （ 1 ）進行母線的短路動穩定校驗計算：採用模擬退火演算法（ sa演算法）計算了矩形母線短路電動力的最大值及其取極值的條件，獲得了更為一般的結果，進而通過短路電動力的頻譜分析，給出了銅質母線的有關短路校驗計算數據； （ 2 ）進行母線的短路熱穩定校驗計算：討論了熱穩定校校的幾種常用計算方法，從導體或電器的發熱機理出發，運用人工神經網路理論對母線的熱穩定問題進行計算，通過算例比較，證明該方法用於熱穩定計算是可行的。
  11. Passing through the construction of a special coupled neural network, which can mimic the autowaves in the pulse - coupled neural networks ( pcnns ), we present a new approach ( auto waves approach ) for solving tsp. the autowaves spread in the network, and the path which the first arrived at the end point from the start point has passed is the optimal answer to the shortest path problem

    通過構造耦合神經網路，使得由神經元點火所產生的自動波在其中傳播，最先到達目的地的波前所走過的路徑即為最短路問題的最優解，從而有效地獲得了tsp問題的最優解。
  12. This paper focuses on the following research work : 1. proposes a genetic algorithm based on matrix encoding for next hop route with load and time delay ; 2. proposes a genetic algorithm for shortest route via designated node, solves the problem which dijkastra algorithm need two times or more to compute ; 3. proposes a scheme of dividing populations and dividing time in order to improve the success ratio ; 4. proposes a network model for directional motion, performs evaluation for mobile ip based on wlan, and concludes some useful results

    提出了解決移動ip中過指定點的路由的遺傳演算法，解決了dijkstra演算法需要分次計算的問題，通過記錄遺傳演算法的疊代結果還可以給出次優解路由； 3引入了分群和分周期的操作策略，對過指點最短路由的遺傳演算法進行了改進，模擬分析表明使用該遺傳演算法求解過指定點的路由獲得了比inagaki演算法更高的成功率； 4
  13. Shortest path problem is one of the primary problems of network analyses. as the base of optimal selection problem in many fields, computing shortest paths over a network has become an important task in many transportation and network analyses systems

    最短路徑問題是網路分析中基本的問題，它作為許多領域中選擇最優問題的基礎，在交通網路分析系統中佔有重要地位。
  14. So this article put forward a theory that the optimal problems can be summed up to the mathematic and computing models of state space search of optimal problems. this conclusion unifies the dijstra algorithm used in finding shortest path of traditional explicit graphs and the optimal search of implicit graphs, the search of graph and the search of graphs " tree into a common model and algorithm

    本文提出了將優化問題歸結為狀態空間最優化搜索問題的數學模型和通用演算法，將傳統的在顯式圖中求最短路的dijstra演算法與隱式圖的優化搜索，隱式圖搜索與隱式樹搜索全部統一到同一個模型和演算法中去。
  15. Computing result shows that : coevolutionary mdo algorithms are effective on this problem ; distributed coevolutionary mdo algorithm is better than cooperate coevolutionary mdo algorithm ; asynchronous parallel version of distributed coevolutionary mdo algorithm speeds up the optimization procedure greatly while maintains good convergence performance ; multiobjective distributed coevolutionary mdo algorithm approximates the whole pareto optimal front well in only one single run, saves much computing cost than constraint method to obtain pareto optimal set, and greatly shortens search time by distributed asyn

    計算結果表明：協同進化mdo演算法求解該問題是有效的，其中分散式協同進化mdo演算法優于合作協同進化mdo演算法；異步并行的分散式協同進化mdo演算法在保證收斂性能的同時大大加快了優化進程；多目標的分散式協同進化mdo演算法僅一次運行就很好的逼近了問題的整個pareto最優前沿，比用約束法求解pareto最優集節省了大量計算開銷，而且通過網路多臺微機的分散式并行執行大大縮短了搜索時間。
  16. The main content of studying in this paper includes : according to the operation principle of gis, developed dss of city traffic planning of practicability. structure the topological structure chart of city traffic network, deal with the traffic network, can solve shortest path and strongly connected problem, and can plan result express by way of figure, can reduce work load and time greatly, and can make traffic planning visual in more image

    本文根據gis的工作原理，開以出了實用性的城市交通規則計算機輔助決策支持系統： masterpath構建城市交通網拓撲圖，處理交通網路，可解決最短路和強連通定向問題，規劃結果可視表達，為交通規劃工作者提供直觀、清晰、全面的信息表達方式，有利於提高城市交通規劃決策的科學性和合理性。
  17. Interval routing scheme was introduced to reduce the size of routing tables, multi - dimensional routing scheme is the extension of interval routing scheme and it can represent all shortest paths between each pair of nodes, which turns out to be convenient when problems related to flow control aspects such as fault tolerance and traffic load balancing are considered

    區間路由方法是使用簡明路由表的一種路由方案，多維區間路由方法是區間路由方法的擴充，它能夠表示網路中每兩個結點之間所有的最短路徑。當我們需要考慮容錯、通信與計算量的負載平衡問題時，這將是很有用的。
分享友人
分享到 Line

分享到臉書