數據路徑選擇 的英文怎麼說

中文拼音 [shǔjùlùjìngxuǎnzhái]
數據路徑選擇 英文
data routing
  • 數 : 數副詞（屢次） frequently; repeatedly
  • 據 : 據Ⅰ動詞1 （占據） occupy; seize 2 （憑借; 依靠） rely on; depend on Ⅱ介詞（按照; 依據） according...
  • 路 : 1 （道路） road; way; path 2 （路程） journey; distance 3 （途徑; 門路） way; means 4 （條理） se...
  • 徑 : Ⅰ名詞1 （狹窄的道路; 小路） footpath; path; track 2 （達到目的的方法） way; means 3 （直徑的簡稱...
  • 選 : Ⅰ動詞1. （挑選） select; choose; pick 2. （選舉） elect Ⅱ名詞（挑選出來編在一起的作品） selections; anthology
  • 擇 : 擇動詞（挑選） select; pick; choose
  • 數據 : data; record; information
  • 路徑 : 1. （道路） way; route; trajectory; path; tail; travel2. （門路） method; ways and means
  • 選擇 : select; choose; opt; election; choice; culling; alternative
  1. 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 ）時，交叉立方體中任兩個無故障頂點都至少有一條可靠路徑。
  2. Abstract : biological invasions are a continuous feature of a non - equilibrium world, ever more so as a result of accidental and deliberate introductions by mankind. while many of these introductions are apparently harmless, others have significant consequences for organisms native to the invaded range, and entire communities may be affected. here we provide a survey of common models of range expansion, and outline the consequences these models have for patterns in genetic diversity and population structure. we describe how patterns of genetic diversity at a range of markers can be used to infer invasion routes, and to reveal the roles of selection and drift in shaping population genetic patterns that accompany range expansion. we summarise a growing range of population genetic techniques that allow large changes in population size ( bottlenecks and population expansions ) to be inferred over a range of timescales. finally, we illustrate some of the approaches described using data for a suite of invasions by oak gallwasps ( hymenoptera, cynipidae, cynipini ) in europe. we show that over timescales ranging from 500 10000 years, allele frequency data for polymorphic allozymes reveal ( a ) a consistent loss of genetic diversity along invasion routes, confirming the role of glacial refugia as centres of genetic diversity over these timescales, and ( b ) that populations in the invaded range are more subdivided genetically than those in the native range of each species. this spatial variation in population structure may be the result of variation in the patchiness of resources exploited by gallwasps, particularly host oak plants

    文摘:生物入侵是不均衡世界的一個永恆話題，尤其是當人類有意或無意地引入物種后.很多引入顯然是無害的，但另外一些則有著嚴重的後果，會給入侵地的生物以至於整個生物群落造成影響.本文總結了分佈區擴張的常見模式，概述了它們對遺傳多樣性和種群結構式樣所造成的影響.描述了如何根據以一批遺傳標記所得到的遺傳多樣性式樣來推斷入侵途徑，來揭示伴隨擴張選擇和漂變在形成種群遺傳樣式中的作用.本文對日益增多的群體遺傳學方法進行了總結，這些技術可以用來在不同的時間尺度上推斷種群規模所發生的巨大變化（瓶頸效應及種群擴張） .最後，我們以歐洲櫟癭蜂（膜翅目，癭蜂科，癭蜂族）一系列入侵的數據為例對一些方法進行了說明.從500 10000年的時間尺度上，多態的等位酶位點上等位基因頻率的數據表明: 1 ）遺傳多樣性沿入侵路線呈不斷下降的趨勢，支持了冰河期避難所作為遺傳多樣性中心的作用; 2 ）入侵地區的種群與該物種原產地的種群相比，遺傳上的分化更為強烈.這種種群結構在空間上的變異可能是被櫟癭蜂開發的資源尤其是櫟樹寄主在斑塊上出現變異的反映
  3. By analyzing all sorts of data involved in the drawing of plane arrangement of the contact net, the paper then presents and realizes the sub - systems of drawing data management, which includes setting up the data structure, programming and managing of the data and provides the drawing data for the whole system used for the later drawing, finally by introducing the concerned theories of the parameterized design explains the similarities and differences and their applied scope of all kinds of parameterized technologies, and by associating with the features of the plane arrangement maps of the railway contact net analyzing size restraint of contact net

    它是針對鐵路接觸網平面布置圖的特點來完成選擇區間或站場繪制、圖紙設定、圖型設定、字元高度、圖型坐標點、繪圖基點和圖型數據文件保存路徑的設置以及布置圖的標注欄和明細表尺寸設置；緊接著通過對接觸網平面布置圖的繪圖中所涉及的各種類型數據進行分析，提出並實現繪圖數據管理子系統，它包括建立繪圖系統的數據結構，對數據進行編輯管理，向整個系統提供繪圖數據，供其後的圖形繪制使用；最後通過對參數化設計的相關理論進行介紹，闡述了各種參數化技術的異同點和適用范圍，並結合鐵路接觸網平面布置圖的特點具體分析了接觸網線路的尺寸約束。
  4. The engendering source of traffic volumes and their general influential factors have been presented, and the situation of nowadays highway transportation has been discussed. according to the introduction of traffic distribution theory and classical assignment method, analysis of traffic flow path selection among cities and that of special influential factors for traffic flow on toll highways, initial analysis to the forming mechanism of traffic volume on road sections has been made, and a probability model for path selection has been set up with the maximum - utility theory and disaggregating model. detailed analysis to impedances on road sections and their functions ( especially to three main composing factors of the impedances as cost of time, transport and toll and to the functional relations with traffic loads ) was made, at the same time, the relative cost calculating model was set up on the basis of the state - of - art achievements in both international and national researches

    主要研究內容包括：交通量的產生根源及一般影響因素分析和當前公路運輸地位討論；從交通分配理論及經典配流方法著手，通過分析城市間交通流路徑選擇行為和收費公路路段交通量特殊影響因素，初步提出路段交通量的形成機理，並採用效用極大原理和非集結模型理論（ disaggregationmodel ） ，建立用戶出行路徑選擇概率模型；對路段阻抗及路阻函數（尤其對行程時間費用、車輛營運費用和道路收費這三個構成路段阻抗的主要因素及其與交通負荷間的函數關系）進行較為詳盡的分析，並以現階段國內外較為先進的研究成果為依據建立相應的成本測算模型，其中，特別提出了兩種確定客貨車輛時間價值的分析方法；離散分析法和時間-費率轉換法，後者是在目前基礎調查、統計數據資料不夠齊全的現實下提出的一種確定道路系統內務車型時間價值的較為實用的新方法；對我國公路收費政策的背景和理論、實踐依據及費率的各種影響因素進行重點分析；從數學的角度證明合理費率的存在性，並以最優化理論為基礎，建立在普通收費公路和擁擠路段交通調控型收費公路兩種模式下合理費率的計算模型等。
  5. It is an effective way to solve this problem by combining piezoelectric quartz crystal sensor array with chemometrics. however, there were few reports in designing electric circuit, which would influence the response due to mutually interfering between oscillators. so, it is necessary to design a vibration circuit and develop it into small and convenient instrumentation to overcome this limitation

    另一方面，單一的具有選擇性的傳感器在實際多組分氣體的檢測中受到限制，而採用壓電石英傳感器陣列再結合化學計量學手段進行數據處理卻是解決這個問題的一個有效途徑，然而在它的電路設計方面，由於共振電路間的相互影響，使檢測受到很大幹擾，因此設計一個相互無干擾的起振裝置來解決這個問題是十分有必要的。
  6. In the research of xml query language, we consider the requirement of two categories ( for data - centric and for document - centric ) of xml applications and point oat that the basic operations in xml - quey are pattem matching, selection and filtering, and result reconstfuction. the path expression and the flwr expression in xquery are typical structurs tha are comprised of these operations

    在對xml查詢語言的研究中，從以文檔為中心和以數據為中心這兩類xml應用需求的分析出發，指出xml查詢的基本操作是模式匹配、選擇過濾和結果構造， xquery中路徑（包括簡單路徑和正規路徑）表達式和flwr表達式是進行這些操作的典型結構。
  7. While you might choose to ignore failures to ensure your package runs successfully, it is often better to redirect the failed row to another processing path where the data and the error can be persisted, examined and reprocessed at a later time. in this lesson, you will create a copy of the package that you developed in

    雖然可能選擇忽略失敗以確保包成功運行，但通常更好的做法是將失敗的行重定向到另一個處理路徑，在這里可以使數據和錯誤持久化、接受檢查並在隨后的某個時間對其進行重新處理。
  8. Around the globe. these features include dynamic load leveling across all available bandwidth, automatic alternate path selection, network - based error detection and recovery, traffic prioritization, data compression, and pipelining

    帶寬的動態測量、網路路徑自動選擇、網路級的錯誤檢測及恢復、數據傳輸的優化、數據壓縮、流水線技術等。
  9. Conclusion ( 1 ) depending on location ， size and invading extension of the tumor ， above different approaches are adapted selectively which can provide excellent exposure and allow for an aggressive resection of the tumor. ( 2 ) the tumor tissue of the cavenous sinus and foramen lacerum is resected carefully by microsurgery. ( 3 ) the dural deficiecy must be repaired and sutured tightly to avoid craniocerebral fluid leak

    結論（ 1 ）前或和中顱凹底內外溝通性腫瘤應根據腫瘤大小、位置及侵犯范圍選擇顱面聯合入路、額顳-顳下窩入路或額顳-顳下窩入路結合面前徑路即可給于充分暴露並能在直視下廣泛切除腫瘤； （ 2 ）中顱凹底侵及海綿竇和破裂孔部的腫瘤應在較高放大倍數手術顯微鏡下仔細分離切除； （ 3 ）硬膜的嚴密修復是避免腦脊液漏及顱內感染的重要關鍵。
  10. The causation of main defects is analyzed from the view of design and improvements are suggested from the structural design, such as the test and determination of basic data of pavement design, rational selection of raw materials, adopting appropriate aggregate sizes, improving blend design method, rational selecting the thickness of asphalt layer and reinforcing the binding between the asphalt pavement layer and the base layer to further improve the operational function of the asphalt pavement and reduce the occurrence of traffic accidents

    通過對高速公路瀝青路面的主要病害成因從設計角度進行分析，提出應從完善路面設計基礎數據的測試與確定方法、合理選擇原材料、採用合適的礦料級配、完善配合比設計方法、合理選擇瀝青面層厚度、加強瀝青面層層間及與基層的粘結等途徑完善瀝青路面結構設計，以進一步提高瀝青路面的使用功能，減少道路交通安全事故的發生。
  11. The latter primarily improves the transmission distance and reliability by selecting the repeater automatically. the frequency domain auto - adaptatation filter algorithm is deduced and reliabity by selecting the repeater automatically. the frequency domain auto - adaptaion filter algorithm is deduced and a method of frequency domain algorithm to restrain the marrow band interference is given on the foundation of the time domain minimum mean square error auto - adaptation filter. then the meter reading system to can learn the power network structure and automatically create linked path by using neural networks auto - study ability and analyzing the reading data

    後者主要是對中繼節點的自動選擇，以提高信息的傳輸距離與可靠性。針對電力線擴頻通信通道的特點，在時域最小均方誤差自適應濾波演算法的基礎上，推導了頻域自適應濾波演算法，並提出了頻域演算法抑制窄帶干擾的具體方法。運用神經網路的自學習方法，通過對抄讀數據進行分析，使抄表系統感知電網拓撲結構，自動建立中繼路徑。
  12. Transmission line design is a complex system project with large investment. based on data provided by digital transmission network, and combined with the genetic algorithm, the thesis puts forward a general optimization method to deal with the difficulties in transmission line design, which are path and pole selection of the transmission line. synthetically contemplating all kinds of environmental and anthropogenic factors, the method has great pragmatic meaning in saving cost of design

    輸電線路設計是一項投資巨大且相關因素復雜的系統工程，本文基於「數字輸電網路」提供的信息數據，結合遺傳演算法，對線路設計中的難點? ?路徑選擇和桿塔定位提出了全新的全局優化方法，該方法綜合地考慮了各種環境及人為因素，對節約設計成本、提高設計工作的科學性具有很大的現實意義。
  13. Other nodes, such as compute, are chosen to determine the path that a message follows based on the content of the messages, to provide checks or examination of the message, or to update and query databases

    而選擇其他節點（例如compute ）是為了根據消息的內容確定消息的流經路徑、提供對消息的檢驗或檢查，或者更新及查詢數據庫。
  14. Meanwhile, the projects to realize the function of each module are discussed. the shortest route choice algorithm is an important research in drgs, in order to satisfy the real - time request of the drgs and achieve the quick and right guidance, the advantage and disadvantage of shortest route choice algorithm are discussed. the ordered genetic algorithm for shortest route choice is given in this paper, the corresponding selection, crossover and mutation operator are given

    同時，為了適應動態路徑誘導系統的實時性和全局尋優要求，實現快速而準確的路徑誘導功能，本文首先詳細討論各種最優路徑選擇演算法的優缺點及應用發展現狀，提出採用有序實數編碼的遺傳演算法進行最優路徑計算，並根據交通路網的特性設計了有序實數編碼遺傳演算法的選擇、交叉和變異運算元，並用c語言實現了該演算法。
  15. 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

分享到臉書