機撲演算法 的英文怎麼說

中文拼音 [jīpūyǎnsuànfǎ]
機撲演算法 英文
robot algorithm
  • 機 : machineengine
  • 演 : 動詞1 （演變; 演化） develop; evolve 2 （發揮） deduce; elaborate 3 （依照程式練習或計算） drill;...
  • 算 : Ⅰ動詞1 （計算數目） calculate; reckon; compute; figure 2 （計算進去） include; count 3 （謀劃;計...
  • 法 : Ⅰ名詞1 （由國家制定或認可的行為規則的總稱） law 2 （方法; 方式） way; method; mode; means 3 （標...
  1. And it is nothing other than the new philosophy of the nature whose characteristics are the quantification of substance and the mechanization of the movement that defends the existence and the property of this quantum second, the quantification of substance and the mechanization of the movement which are emphasized by the new philosophy of the nature offers a intuitionistic continuun which takes the extension of the space - time for the birth of calculous

    正是以物質的數量化和運動的機械化為特徵的新的自然哲學為這種量的存在及性質（特別是拓撲性質）和程序化的演算法提供辯護。其次，新的自然哲學所強調的物質的數量化和運動的機械化為微積分的產生提供了以時空廣延為模型的直觀連續統。
  2. In this thesis, used thermocouple to sense the temperature in the space of the hearth, attributed the thermocouple based on calorifics and scientific arithmetic, acquired data by data acquiring card, processed data according to the demand of setting up temperature model and drawing graphics and then caculated the coordinates of isothermal points and normals of isothermal facets, ascertained the order of connecting points and the model of construct, drawed the isothermal facet of temperature field with opengl at last

    通過數據採集板卡進行數據採集並與計算機介面進行數據處理。然後，將處理后特殊點的溫度數據依據marchingcubes演算法建立數學模型求取等溫面上的點的坐標及各點的法向量等。最後，確定計算的三維坐標點的連接順序和拓撲模型，利用opengl進行等溫面的繪制、消隱和模式變換等工作。
  3. The thesis consists of six chapters. content is dispatched as follows : chapter 1 introduces simply the network management. chapter 2 interprets the traditional network management, such as osi management, tmn management and internet management. chapter 3 describes the topology discovery. including the algorithm and the implementing mechanism. chapter 4 is the main chapter and will present the design of the integrated object model ( iom ). chapter 5 integrates snmp to iom as an application ; chapter 6, namely the last chapter, summarizes the whole thesis and prospects the future study

    內容安排：第一章對網路管理作了簡單的介紹；第二章介紹了傳統網路管理， osi管理， tmn管理和internet管理；第三章描述了拓撲發現的演算法及具體實現機制；第四章是本文的重點，對網管模型- iom -作了具體的設計；第五章針對snmp作了集成的應用；最後一章對全文所做的工作做一個總結，並提出了進一步的展望。
  4. We investigate finer time scale statistical properties of this traffic, including burstiness, periodicity, and synchronization. utilizing the data gathered by our simulator, we compared the results with our prediction, after that, we investigated the root cause of a specific networking traffic pattern, under various network configuration and policies. the importance of our work is not only analyzing the cause of each traffic pattern, but also providing a beneficial formal method for future research

    在實驗結果的分析過程中，我們根據當前流行的網路拓撲建立了模擬路由試驗環境，特別針對lsa的突發性、周期性和同步流量的時域特徵進行了觀察，不僅探究了三種重要lsa流量的發生機理以及這些流量的變化對整體路由效率的影響，比對了我們的預測與最終的實驗結果，深入研究了統計圖表裡各種異常情況的成因和路由協議採用不同演算法和策略以後對整體路由環境的影響。
  5. 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系統軟體具有完善的在線幫助和用戶交流論壇，人機界面友好。
  6. Based on collected and read literatures, this paper gives the analysis of its characteristics, architecture, security problem, qos problem, and comparison among present popular wireless ad hoc routing algorithm as well. 4. according to the characteristics of wireless network situation of wearable computer, this paper comes up with a wireless network frame for wearable computer based on lsr ( link state routing protocol )

    （ 4 ）結合可穿戴計算機無線網路環境的特點，在對自組網路由選擇演算法比較分析的基礎上，提出了一種適用於可穿戴計算機無線網路的基於混合路由策略的lsr （ linkstateroutingprotocol ）路由協議的框架，它能夠根據網路拓撲結構變化的不同程度在先應式和后應式路由策略之間進行自然平滑的切換。
  7. It has small diameter, strong expansibility, symmetrical structure and simple path searching algorithms, etc., what more, many interconnection networks with different topologies can be easily embedded in it. so it becomes one of the most important and attractive network models. in this thesis, based on the above two aspects, the fault - tolerance and routing algorithms of the hypercube are studied

    超立方體網路是多處理機系統中常見的一種互連網路，這種網路拓撲結構由於具有直徑小、可擴展性強、結構對稱、網路尋路演算法簡單等優點，且多種拓撲結構的互連網路都可以很容易的嵌入其中，因而成為最重要和最具吸引力的網路模型之一。
  8. This paper will study under layered real - time scheduling problem, which is based on the theory of mas ( multi - agent system ). first, we research the structure model of mars, then an uniform model based on han ( hierarchical agent networks ) is proposed, which can unify all sorts of model ; second, the communication model of mars has been studied, then we propose high level communication model and under layered network topology model, and they are the same with mars ; three, ground on above, a real - time cimunication protocol for mars - - - - - rtcmr has been presented. in this paper, we study the under layered real - time scheduling protocol of rtcmr, which include real - time process scheduling and real - time message scheduling

    本文首先研究了多智能體機器人系統結構模型，提出了多層次智能體網路一體化模型，該模型對各種結構模型分類進行了統一；然後對多智能體機器人系統的通信模型進行了研究，提出了適用於mars的高層通信模型和底層網路拓撲；在此基礎上，提出了基於多智能體機器人系統的實時通訊協議? ? rtcmr ，本文對rtcmr的底層調度協議進行了研究，包括實時任務調度和實時報文調度，提出了sp ts協議系統，建立了sp ts演算法的數學理論模型， sp ts協議系統在實現了實時任務的絕對時限保證的同時也實現了底層實時報文傳輸的絕對時限保證，實現了實時任務調度和實時報文調度的統一，最後，提出了基於sp ts協議的spp tsp統一控制結構，並給出了該結構的統一調度petri網模型。
  9. In this paper, we provide a summary of all the possible topologies of data grid replica location mechanisms based on the research status of related activities, and design a new kind named distributed replica information index location mechanism ( dilm ), which is based on the topology of improved ring and integrates four techniques : overlay network, bloom filter, soft - state protocol and md5

    本文介紹了數據格網復制定位研究的現狀，總結了數據格網復制定位可能的拓撲結構種類，提出了一種新的數據格網復制定位機制? ?分散式復制索引定位機制dilm 。 dilm基於改進環型拓撲結構，包含以下4種技術：重疊網路技術、 bloomfilter壓縮技術、軟狀態協議和md5散列演算法。
  10. The corresponding optimal topology configuration transition problem is studied based on the generation algorithm, and the process is also simulated

    基於遺傳演算法，研究了該自重構機器手的最優構形拓撲轉換問題，並對構形拓撲變換的整個過程進行了模擬。
  11. To completely avoid producing elements jointed at their corner nodes and checkerboard patterns, which frequently occur when the topology optimization of plane continuum is studied, the theory of topology analysis of plane continuum in topology optimization process and the simple algorithm for programming are studied. according to algebraic topology theory, the boundary of elements and plane continuum are operated as a one - dimensional complex. by use of the adjacency vector in graph theory, the structural topology is described and the topological operation is achieved on a computer. by above, the structural topological feature in the evolutionary process is gained. these methods are effcient and reliable. under topology constraints, according to the results of stress analysis, by deleting elements and moving nodes at the boundary, more satisfactory results can be gained by using a few numbers of elements and iterations. to demonstrate the efficiency of these methods, solutions including some well - known classical problems are presented

    避免目前平面連續體結構拓撲優化過程中經常出現的單元鉸接以及「棋盤格」等現象，研究了連續體結構拓撲優化過程的拓撲分析方法，以及在計算機上實現的簡便演算法.根據代數拓撲理論，單元及連續體的邊界作為1 -復形進行運算.利用圖論中的鄰接向量概念，在計算機上實現了結構的拓撲描述及拓撲運算，得到了結構在拓撲演化過程中的拓撲特性，方法簡單、可靠.在一定的拓撲約束下，根據應力分析結果，採用刪除單元、單元退化、移動節點等方法，可以用較少單元得到更為滿意的結果，提高計算效率.為演示方法的有效性，給出幾個包括常見經典問題的解答
  12. The security of the algorithm is analyzed from the randomness, linear complexity of the chaotic sequence and the intensity of initial key. the results show the randomness of the key sequence pass the frequency test, sequential test, poker test, autocorrelation test, runs test, etc. and the total level is better than the binary sequence generated by the prng of delphi 7. 0, logistic chaotic system and rc4, the linear complexity comes up to the expectation, the initial key has very strong intensity

    本文最後從混沌序列的隨機性、線性復雜度和初始密鑰的強度三個方面對演算法進行了安全性分析，結果表明演算法產生的密鑰序列的隨機性完全通過了頻數檢驗、序列檢驗、撲克檢驗、自相關檢驗和遊程檢驗等5種統計檢驗方法的檢驗，而且整體水平要好於delphi7 . 0中的偽隨機數發生器、 logistic混沌系統和rc4三種方法產生的二進制序列，線性復雜度達到了數學期望值。
  13. This new method has the capability of calculating complicated 3d grain burning surface. dealing with evolving interface of complicated material and topology change ( splitting. breaking. merging ), based on level set method and burning surface process law. this technique can get accurate area of burning surface each moment and data of geometrical structure that provide access to examination of grain change in the srm working process. 2

    結合固體火箭發動機燃面推移規律，在等值面函數法基礎上開發的裝藥燃面演算法能夠成功計算任意復雜三維裝藥燃面，並且具有處理復雜物質邊界及其拓撲結構發生變化（如分裂、破碎、合併）的能力，能夠準確計算出發動機工作過程中各個時刻裝藥的燃燒面積，同時輸出裝藥幾何構形數據直觀地觀察裝藥的變化情況； 2
  14. A discrete model for a simplified multi - router transfer control protocol network with random early detection congestion control system is proposed by modifying the previously developed one, where the nonlinear behaviors occurring in the system are researched by analytical and numerical methods, and the stability of the fixed points in different parameters is obtained simultaneously

    摘要基於傳輸控制協議和隨機早期檢測擁塞控制演算法，提出多路由器網路拓撲下系統的改進型離散時間映射，採用解析及數值方法研究該映射中出現的分岔現象及混沌，給出系統的穩定性條件。
  15. A new heuristic search method is devised for maximum likelihood method, which first constructs a starting tree, and then through branch swapping searches for trees best resembling the present optimal tree and locates a better tree. repeat this process, till no more better trees are generated or the upper iteration limit is arrived and the program ends

    對最大似然法，改進了一種新的啟發式搜索:隨機建立一棵初始樹，然後通過查看與當前最優樹拓撲最近的樹，從中尋找更優樹，不斷地更新當前最優樹，直到無法找到更優樹或者達到了搜索次數的上限，演算法停止。
  16. The network nodes will be reconfigured when the algorithm converges to a new pattern. simulation results show that our algorithm has a good effect

    計算機模擬結果表明，利用該演算法進行邏輯拓撲重配置后，鏈路負載分佈的平衡性得到了大大提高。
  17. It improves traditional positive inference. based on topology structure of power network in power system database, a inference network graph is established with the method form top to bottom. a positive inference is used in inferring and the positive inference algorithms is proposed

    對傳統的正向推理演算法進行了改進，以網路數據庫中電網拓撲結構作為前提，採用自下而上的方法建立推理網路圖，採用正向推理機制進行推理，並給出了正向推理演算法。
  18. Generally speaking, there are two approaches to environment modeling : geometrical modeling method and topological modeling method. having valued the advantages and disadvantages, this paper adopts the topological modeling method, and then plans a static collision - free path for every robot by using the heuristic a star algorithm

    在分析和總結以往機器人環境建模方法的基礎上，本文基於拓撲法對環境進行建模，並給出用a *演算法搜索出的機器人靜態無碰路徑。
  19. In order to solve optimization calculation efficiency problem of large structures with more than ten thousand degrees of freedom, based on the evolutionary structural optimization method, combining with the iteration method of structural displacement calculations, a strategy and its algorithm of large three - dimension structural topology optimization designs were proposed

    摘要為了提高擁有數萬個單元以上的三維機械結構拓撲優化的計算效率，基於漸進結構優化方法，並結合結構位移計算的迭代方法，建立一套三維機械結構拓撲優化的求解策略和演算法。
  20. Y. bejerano, y. breitbart, m. garofalakis, and r. rastogi, “ physical topology discovery for large multi - subnet networks ”, july 2002, bell labs tech. memorandum

    鄭海，張國清， 「物理網路拓撲發現演算法的研究」 ，計算機研究與發展， 2002年3月，第39卷3期。
分享友人
分享到 Line

分享到臉書