最優網距 的英文怎麼說

中文拼音 [zuìyōuwǎngjù]
最優網距 英文
optimum grid spacing
  • 最 : 副詞（表示某種屬性超過所有同類的人或事物） most; best; worst; first; very; least; above all; -est
  • 網 : Ⅰ名詞1 （捕魚捉鳥的器具） net 2 （像網的東西） thing which looks like a net 3 （像網一樣的組織或...
  • 距 : Ⅰ名詞1 （距離） distance 2 （雄雞、雉等的腿的後面突出像腳趾的部分） spur （of a cock etc ）Ⅱ動詞...
  • 最優 : optimal; optimum最優策略 optimal policy; optimal strategy; 最優設計 optimum design; 最優值 optima...
  1. A new planning method - analysis of factors of point line and area and control points optimization, which is based on the analysis of urban spatial structure, is tried to put forward. analyzing the important functional clusters in the spatial layout of the urban, the intracity medium - long distance vehicle traffic major directional desire line how the urban to link up with the highway network and the whole structure of expressway system, the skeleton of the expressway network can be obtained. using the degree of importance method analytic hierarchy process ( ahp ), one or several intersections can be selected

    該法對城市空間結構布局中的重要節點、主要的中長距離機動車交通流徑期望線的分佈、大城市與區域干線公路網的銜接以及快速路系統線網的整體結構等進行分層次的分析研究，得出快速路系統線網構架，運用重要度法、層次分析法找出大城市重要功能組團中重要程度最高的一個或數個關鍵交叉口作為快速路系統線網規劃的控制點，考慮快速路線路走向的控制點對線路走向進行優化。
  2. Based on the study of the fore going ' s, this thesis regards time - cell, time - center and time - distance as the basic elements of urban time structure. secondly, carry out three constructing principles - - " spatial scale " maps " time distance ", maintain basic spatial structures, extrude main time structures. thirdly, summarize four expressing forms of urban time structure of which isotime curve, isotime circle, time contour and time network

    理論探討部分基於前人的研究成果初步確定時間單元/時間細胞、時間中心/時間基點和時間距離為城市時間結構的基本組成要素；提出時間結構構築的三原則： 「空間尺度」映射「時間距離」 、維持空間關系之基本格局、突出表達主幹時間關系；時間結構的表達則從時間結構的形態方面總結出等時線、等時圈、時間廓線圖和網路圖等表達形式；最後提出城市時間譜概念來評價城市時間結構的優劣。
  3. The emulational calculating theories of traction power supply system ' s operating charts combine with actual things of engineering design at present in chapter three, to set up traction web current distributing mathematical model, integral distributing mathematical model, locomotive distribution and obtaining current model at every moment, and on which making use of mathematical planning methods to set up mathematical models is based at every moment in every instance interval of the railroads. for instance, instantaneous current, instantaneous voltage descent and effective current, main changing capacity and so on, in addition, there are the minimum power shortage model, the optimal transformer substation location, the least engineering expenditure, the optimal mathematical model of traction power supply system. optimize design ' s algorithm of traction power supply system is introduced in detail in chapter four, where programming idea and realizing method of the computer software are given an explanation

    本研究主要進行了以下工作：結合牽引供電系統運行圖的模擬原理和現行工程設計的實際情況，建立了牽引網電流分佈、積分分佈、任一時刻機車分佈和取流的數學模型；應用數學規劃方法建立了任一距離區間、任一時刻的瞬時電流、瞬時電壓降數學模型和有效電流、主變容量和主變壓降、最小功率損失、最佳變電所容量、最佳變電所位置、最少工程費用、最少運營維護費用和牽引供電系統方案最優等方面的數學模型；闡明了牽引供電系統優化設計的演算法和計算機軟體編程思想及實現方法；進行了工程實例計算；最後，對牽引供電系統優化設計技術應用進行了總結。
  4. Secondly, their aims are made the investment of substations, feeders or running cost of electric power system minimum. but they do n ' t take into account of land utilization, street accessibility of right of way, etc., but demands of electric power system. generally, a straight line distance, namely, euclid distance, was used for calculating the distance between a load point and a substation, which is a straight forward but non - practical way for most planning techniques

    其次受研究工具的限制，這些模型以工程投資、運行費用等最小為目標，僅能考慮導線載流量、電壓降等電力系統技術約束條件，簡化略去了用地限制、街道可達性等重要的自然約束條件，且求解這些模型的前奏是計算負荷點到變電所的歐幾里得距離（直線距離） ，簡便但不切合實際（這一點在城市電網規劃中尤其重要） ，因此較難給出技術上可行的最優解。
  5. For a given power network model, once establishing initialization pheromone matrix, searching the path depending on the special ability of ant colony, combining with an improved method of refreshing pheromone, manhattan distance and the thought of flexibility, the best power distribution network planning path is found at a higher rate only if it exits

    對于給定的配電網模型，該演算法根據各配電網站點建立初始信息素矩陣，然後利用蟻群演算法所特有的路徑尋優功能來搜索配電網布局路徑，並結合改進信息素刷新的方式和在蟻群搜索過程中引入曼哈頓距離以及彈性伸縮調節因子，使蟻群以較快的速度找到當前布局上的最優路徑。
  6. In an ideal situation, the largest aperture in the thinnest stencil with the maximum space between apertures provides the optimum process

    實際情況，最薄的鋼網，最大的孔，最大的空間距，提供最優的工藝。
  7. The paper puts forward the clustering algorithm includes : clustering based on grid and iterative, enhanced clustering algorithm base on density and k - medoids, enhanced k - means algorithm ( optimize chooseing consult _ points in iterative process ), enhanced clustering algorithm base on distance. they can overcome many limitations ( some traditional algorithms terminate in local optimization. many results of cluster are roundness, too many times in partition iterative process ), which are related to the static architecture of traditional model

    在傳統聚類演算法的基礎上，結合我們科學數據挖掘的應用對象?分子動力學數據，提出了迭代網格聚類演算法， k -平均和基於密度結合的聚類演算法，迭代過程中優化選擇中心點的k -平均方法，以及改進型的基於距離的聚類演算法等模式識別方法，能夠解決傳統演算法帶來的諸多問題（比如一些傳統的聚類演算法常常收斂于局部最優，發現都模式都趨近於球形，劃分方法中迭代次數過多帶來的效率問題） 。
  8. As a result of the plastic optical fiber itself characteristic, the pof is used as the transmission material in short distance communication, has demonstrated the huge superiority in the recent years, thereupon the plastic optical fibre access network is an important developing direction of optical access network of future. the second chapter first to make the comparison among the copper wire, the silica fiber and the plastic optical fiber, pointed out the plastic optical fiber is better in the short distance communication, then introduced the development course of pof in the communication filed, finally proposed the plan scheme of the plastic optic fibre access network of a kind of building

    塑料光纖本身的特點使得其作為短距離通信用傳輸媒質在近些年內已展示出巨大的優勢，於是塑料光纖接入網是未來光接入網一個重要的發展方向。本論文第二章首先對主要的接入網媒質銅線、石英光纖和塑料光纖進行比較，指出塑料光纖在短距離通信方面的優勢，接著介紹了塑料光纖在通信方面的發展歷程，最後提出了一種樓宇塑料光纖接入網的計劃方案。
  9. The solution of route planning in ecdis is dynamic motion planning base on grid model ; while in the solution of the advanced navigation, safety is the most important premise of sailing, than it takes more consideration about the least distance in voyage

    在航線設計中採用了基於網格模型的動態規劃方法進行路徑的優選；在最優航法中主要考慮船舶如何航行可以在保障安全的前提下使航行距離最短。
  10. To improve the performance of the traditional icp method for the large data models of mesh watermarking, this thesis develops a new icp variant based on the framework of mesh multiresolution analysis. the author presents a novel method for acquiring the initial approximate transformation in terms of the distribution feature of points around the centroid

    為避免迭代落入局部而非全局最優解，本方法利用網格的多解析度表示特性和網格上點到質心距離分佈的特徵信息，快速有效地確定初始矩陣。
  11. The main factors of probabilistic neural network including the hidden neuron size, hidden central vector and the smoothing parameter, to influence the pnn classification, are analyzed ; the xor problem is implemented by using pnn. a new supervised learning algorithm for the pnn is developed : the learning vector quantization is employed to group training samples and the genetic algorithms ( ga ’ s ) is used for training the network ’ s smoothing parameters and hidden central vector for determining hidden neurons. simulations results show that, the advantage of our method in the classification accuracy is over other unsupervised learning algorithms for pnn

    本文主要分析了pnn隱層神經元個數，隱中心矢量，平滑參數等要素對網路分類效果的影響，並用pnn實現了異或邏輯問題;提出了一種新的pnn有監督學習演算法:用學習矢量量化對各類訓練樣本進行聚類，對平滑參數和距離各類模式中心最近的聚類點構造區域，並採用遺傳演算法在構造的區域內訓練網路，實驗表明:該演算法在分類效果上優于其它pnn學習演算法
  12. And then based on this modal, some classic algorithms such as a * algorithm, are analyzed. in the process of the realization of the a * algorithm, an appropriate function, which can find the best route in according to the flow time and the length is always playing the great role. lastly, the essay concludes what have done mainly during this development process and the effectiveness of the study

    文中從城市道路網路的特點出發，分析了道路路段間的連通關系，建立了一個合理的網路拓撲模型，然後分析這個網路拓撲模型以及一些經典的演算法，依據a *演算法的思想，構造了合理的啟發函數，從而根據流量、時間、距離等參數求出源點到目的節點的最優行車路線。
  13. Secondly, on the premise of the principle of minimum cost and serving object and planning aim of logistics distribution network in a city, the paper analyses systemicly all the factors on total cost, establishes arithemetic model, calculates with ristricted function method, then gets the initial distribution network. thirdly, the aticle evaluates and revises the results calculated from the foregoing madel with delphi method and secondary comparative model, thus gets ulteriorly optimized distribution network. at last, the importance of constructing logistics information platform is put forward, at the same time the flatform ' s requirment, function formation and running mechanism are analysed synthetically

    本文首先分析了我國與國外物流發展的差距與異同，並根據我國物流業發展的客觀環境，提出了市域物流配送網路規劃的概念以及開展此項工作的重要性和迫切性；其次在最小成本原則和明確市域物流配送網路服務對象與規劃目標的前提下，對影響總成本的各項因素進行系統分析，從而建立基於最小成本的數學模型，並採用制約函數法對所建模型進行求解，得到最初的配送網路；再次由德爾菲法和二次比選模型對模型求解結果分別進行初次和二次評估修正，從而得到進一步優化的配送網路；最後提出建設市域物流信息平臺的重要性，並對其需求、功能組成及運行機制進行了綜合分析。
  14. In the recent years, many scholars of the inside and outside country advance a series of arithmetics based on graph theory with reseach for the optimal setting coordination for current protection and distance protection in a complex multiloop network. the calculation for minimum break points set as stat for coordination of setting is the core of these arithmetics and large

    近年來國內外許多學者基於圖論方法，對復雜環網方向電流保護和距離保護最優整定配合問題進行了研究，提出了一系列演算法，其中作為整定配合起始點，且具有最少基數的保護集合? ?最小斷點集（ mbps ，即minimumbreakpointset ）的計算是整個演算法的核心，也是計算量最大的部分。
  15. With the linear program method of operational research and the goal of minimum transportation cost, the golden cereal intelligence logistics system may solve the problem of how to choose the address for many logistics centers during the logistics operation of the golden cereal company ; at the same time, using the mathematics theories including graph theory and having the goal of minimum distance, it can settle the problem of logistics project optimization for the golden cereal company in the process of logistics farming capital

    金色谷農資智能配送網，運用運籌學的線性規劃，以運輸總成本最小化為目標，解決金色谷農資公司農資配送過程中的多配送中心地址選定的問題；運用圖論等數學理論，以總配送距離最短為目標，解決金色谷農資公司農資配送過程中配送方案優化的問題。
  16. The main factors have been determined to be the depth and width of hole, the strength of surrounding rock, the types of detonator, the decoupling coefficient, burden and unit consumption form what has been discussed, the author make use of those major factors as standard of affection and studied bp neural networks " work principle, structure and defectiveness. a model of modified bp neural networks has been used to built model in order to identify selection and optimize of blasting in rock anchor beam. triumphant parameter design of blasting were selected as a example, in order to perform network of parameter design

    確定以炸藥類型、最小抵抗線、孔深、炮眼間距、不耦合系數、線裝藥量、巖石強度和巖體完整度為主要影響因素；把改進的bp演算法應用在爆破參數優化設計中，建立以炸藥類型、最小抵抗線、炮孔深度、炮眼間距、線裝藥量、不耦合系數、巖石強度和巖體完整度為主要影響指標，選擇45例國內外成功的爆破參數設計實例為樣本，利用bp神經網路進行爆破參數優化設計，並通過現場保護層和巖臺修面爆破試驗以及對其松動圈范圍進行聲波測試，其測試結果最優的爆破方案其松動圈最小，這與神經網路進行參數優化設計的爆破方案相吻合。
  17. Based on the above elementary problems, the relation between system and user equilibrium patterns is discussed and the realization of so pattern is presented. the gap between the user equlirium and system optium is a key factor of the evoluation of the network. and the capcity of a given network is the extension of the max - flow problem

    在網路需求相對固定后，系統最優目標值和用戶平衡目標值之間的距離是一個重要參考指標，為宏觀調控留下了空間，通過注入管理信息或改變網路使用者的網路費用矩陣，可以達到用戶平衡下的行為實現系統最優的目標。
  18. This paper introduces the development of data mining and the concepts and techniques about clustering will be discussed, and also mainly discusses the algorithm of cluster based on grid - density, then the algorithm will be applied to the system of insurance ? among the various algorithms of cluster put forward, they are usually based on the concepts of distance cluster o whether it is in the sense of traditional eculid distance such as " k - means " or others o these algorithms are usually inefficient when dealing with large data sets and data sets of high dimension and different kinds of attribute o further more, the number of clusters they can find usually depends on users " input 0 but this task is often a very tough one for the user0 at the same time, different inputs will have great effect on the veracity of the cluster ' s result 0 in this paper the algorithm of cluster based on grid - density will be discussed o it gives up the concepts of distance <, it can automatically find out all clusters in that subspaceo at the same time, it performs well when dealing with high dimensional data and has good scalability when the size of the data sets increases o

    在以往提出的聚類演算法中，一般都是基於「距離（ distance ） 」聚類的概念。無論是傳統的歐氏幾何距離（ k - means ）演算法，還是其它意義上的距離演算法，這類演算法的缺點在於處理大數據集、高維數據集和不同類型屬性時往往不能奏效，而且，發現的聚類個數常常依賴于用戶指定的參數，但是，這往往對用戶來說是很難的，同時，不同參數往往會影響聚類結果的準確性。在本文里要討論的基於網格密度的聚類演算法，它拋棄了距離的概念，它的優點在於能夠自動發現存在聚類的最高維子空間；同時具有很好的處理高維數據和大數據集的數據表格的能力。
分享友人
分享到 Line

分享到臉書