最小代價 的英文怎麼說

中文拼音 [zuìxiǎodàijià]
最小代價 英文
minimum cost
  • 最 : 副詞（表示某種屬性超過所有同類的人或事物） most; best; worst; first; very; least; above all; -est
  • 小 : Ⅰ形容詞1 （體積、面積、數量、強度等不大） small; little; petty; minor 2 （年紀小的; 年幼的） youn...
  • 代 : Ⅰ動詞1 （代替） take the place of; be in place of 2 （代理） act on behalf of; acting Ⅱ名詞1 （歷...
  • 價 : 名詞1. （價格） price 2. （價值） value 3. [化學] （化合價） valence
  1. Abstract : based on the principle of mininmum potential and using rayleigh - ritz method, the geometric non - linear analysis of higher bridge piers was solved in this paper. the new concept of equivalent horizontal force proposed by the author may be casily to calculate the second effect, which was produced due to the vertical forces and resisted by the piers and rubber pad bearings incorporately. the simple formula in this paper are applicable to calculate by hand, understood clearly without computation of successive iteration, higher precision and graspable easily for the disigmer therefore it has the practical significance

    文摘:根據最小勢能原理，用瑞雷-里茲法解決了高橋墩的幾何非線性分析問題；其次，提出了等效水平力的新概念，可以方便地解決橋墩和板式橡膠支座聯合抵抗垂直力所產生的二次效應問題.筆者提出適合於手算的簡便計算公式，概念明確，勿須迭代運算，精度較高，易為設計人員掌握，因此具有實用價值
  2. During vertical migration, the copepod is assumed to instantaneously check the variations of the environmental parameters and can thereby make the optimal behavioral strategy to maximize the value of venturous revenue, i. e., taking up as much food as possible at as less cost of mortality as possible

    在垂直遷移的過程中，我們假設橈足類個體能夠即時識別環境參數的變化從而採取最優的行為策略以獲取風險收益的最大值，即以盡可能小的死亡代價獲取盡可能多的食物。
  3. In the leach - new protocol, the mainly improvement of the leach protocol exhibits as follow : for the sake of balancing the network load, the network choose the clusters based on the residual energy ; we take multi - hop communication between sensors instead of single - hop communication, which results in the reduction of energy consumption of clusters ; the new protocol finds the path to the cluster head with the minimum cost, using an algorithm similar to flooding to propagate the cost information and greedy algorithm to find the lowest cost link ; the algorithm for assigning tdma time slot reduces overall delays of network

    在leach - new協議中，對leach協議的改進主要體現在以下幾個方面:根據節點剩餘能量選擇簇頭，以平衡網路負載;節點間採用多跳路由，降低簇頭能量消耗;節點根據能量消耗的代價來選擇至簇頭的路由，通過擴散演算法來廣播代價消息，採用貪婪演算法來選擇能量消耗最小的路徑;採用tdma時隙分配演算法減少網路時延。最後，利用ns2模擬軟體進行驗證。
  4. And then, according to minimum principle, each uav smoothes its own path which the coordination agent selects such that the dynamic constraints are sati sfied and the length is preserved

    通過在協同規劃層調整eta ，尋找到既能滿足時間約束，又能使團隊代價最小，且盡量使單架無人機的個體代價次最小的路徑。
  5. Combining the international newest research result of multicast tree, this paper get a series of high efficiency arithmetic of multicast tree problem with the method of increasing storage space, and this paper also takes into account the dynamic capability of arithmetic. in many research fields of multicast tree, many high - efficiency solutions were obtained in this paper. this paper has broadly discussed about multicast tree problem and obtained dmdt ( dynamic minimum distance tree ), fmph ( fast minimum path cost heuristic ), dmph ( dynamic minimum path cost heuristic ) and fgmra ( fast group multicast routing arithmetic )

    本篇論文對多播生成樹問題進行了比較全面的討論，涉及內容包括單約束的單樹多播、單約束的成組多播等多個方面，所提出的動態最短路徑樹演算法dmdt （ dynamicminimumdistancetree ） ，最小代價多播生成樹演算法fmph （ fastminimumpathcostheuristic ）動態最小代價多播生成樹演算法dmph （ dynamicminimumpathcostheuristic ） ，成組多播快速路由演算法fgmra （ fastgroupmulticastroutingarithmetic ） ，都取得了顯著的效果，是目前同類問題中比較好的解決方案，達到了預期的目的。
  6. Simulated results showed that the proposed algorithm is available to construct effectively and quickly, the multicast tree satisfying delay constraint and lowest link cost, with network load balance taken into account to pick out the cheaper idle route

    模擬結果表明，該演算法在考慮網路的負載均衡情況下，選擇鏈路代價較低的空閑路徑，快速、有效地構建滿足時延要求，鏈路代價最小的組播樹。
  7. We can use optimal search theory to solve this problem. optimal search theory is a subject developed during the world wide war ii. the optimal search problem involves computing how resources can be allocated so as to maximize the probability of detection, or to minimize the comsumption of resources used

    最優搜索理論是二戰期間發展起來的一門學科，最優搜索理論要解決的核心問題就是在總搜索資源有限的情況下，如何分配搜索資源使得成功搜索到目標的可能性最大或花費的搜索代價最小。
  8. The discussion of cultural construction mode in baibuting community is developed as following : the first part presents author ' s motivation in carrying out the research, defining some concepts and introducing a few common modes of cultural construction in urban communities. the second part is a detailed description of fundamental ideas and content, advocating the notion of " human oriented, moral centered, law abiding, trying to creating a modern community with the capacity of sustainable development ", introducing its unique homestead culture. the third part sets forth the innovation of community culture construction modes in baibuting community : in order to create a, human - oriented community culture, establish a peaceful and content environment for the socialism ideology, the baibuting community made innovation on community management system ; by the analysis of the occupational statistics and object groups, the author found out that most of residents come from the middle class ; then, the author gives the definition of middle class and its general features in a sociological perspective ; finally, the thesis analyses the characteristics of the community residents " pursuit of culture and the harmonious development of community culture in aspects like value system, consumption habits, cultural needs

    本文通過理論學習，對百步亭花園社區文化建設的模式進行了探索研究，在現狀調查過程中，筆者發現百步亭的社區文化建設之所以成功，除了開發商和物業管理中心的組織建設外，還有小區居民的積極參與合作，三者密不可分，而這又與居民所屬的階層文化訴求密切相關，於是，本文就百步亭社區文化建設模式作了論述，思路如下：文章的第一部分：提出本文研究的緣起，並對一些與本文有關的概念作了界定，還介紹了幾種城市社區文化建設的一般模式；文章的第二部分：介紹百步亭花園社區文化建設模式的基本思想和內容，提出了「以人為本、以德為魂、以法為行，努力創造可持續發展的現代文明社區」的口號，並介紹了其獨具特色的家園文化；文章的第三部分：對百步亭社區文化建設模式的創新作了論述：百步亭社區為了營造以人為本的社區文化，構建社區安居樂業工程，為社會主義思想道德體系提供良好的社會文化環境，在社區管理體制上作了創新；還通過對百步亭社區居民的職業統計，來源群體，分析出其從屬的社會階層主要是社會的中間階層；再次，從社會學角度，定義了中間階層及一般特徵；最後從價值觀、認同感，消費觀念、文化需求等方面，分析了其文化訴求的特徵和與社區文化的協調發展；文章的第四部分：從整合功能和導向功能兩方面總結了百步亭社區文化建設的社會效應；並對百步亭社區文化建設模式的不足提出了意見和建議。
  9. E3d r - tree takes into account the features of moving object data and takes advantage of new cost parameters. in particular, least - cost - first search algorithm is used in the insertion algorithm to find the overall best way to insert a new record in e3d r - tree. the proof of the vidility of the algorithm is given

    在e3dr - tree中，結合移動對象數據特徵引入空白區域作為新的插入代價參數，同時，在插入演算法中利用最小代價優先搜索演算法確定全局最優插入路徑，並給出演算法正確性證明。
  10. The motives of earnings management including debt contracts, profit sharing plan, handling supervision, anti - trust, minimized income tax, ipo, and enhancing share price not only are realized in the western capital market but also have some impact in chinese capital market

    這些盈餘管理的債務契約動機、分紅計劃動機、代理人競爭動機、應付行業監管動機、反托拉斯動機、最小化所得稅動機、首次發行動機以及提升股票價格等動機不僅在西方資本市場得到了證實，也在中國資本市場有所反應。
  11. Our goal is to construct a general dw engine in which the existing mis system and distributed database system can embed, and to improve it as a dw system which can be used to develop high level data application at the lowest cost

    我們的目標是致力於構建一個通用的可嵌入現有mis系統和分散式數據庫系統的數據倉庫引擎，以最小代價將它們提升為數據倉庫系統，進而進行高層的數據應用開發。
  12. By computing the cost of the cheapest subtree with size constraints of the partial tree ( this is an upper bound on the cost of the final optimal tree ) and lower bounds on the cost of subtrees of varying sizes that are rooted at nodes of the partial tree, the algorithms can identify and prune nodes that cannot possibly belong to the optimal constrainted subtree

    建樹階段設置大小限制的修剪演算法是通過計算出不完整樹的最小代價得到優化樹的代價上限，根據此上限以及計算出的節點的實際代價來修剪節點的。在預測模型中應用了在建樹階段加入大小限制條件的修剪演算法。
  13. Classification and regression trees processing part introduces growing algorithm of cart, pruning algorithm of cart and selecting best tree algorithm etc. on the basis of the concerned new model, the thesis presents in details the designing of multi - rules neural network based cart system for abnormal customers recognition

    在分類回歸樹部分，介紹了分類回歸樹的生長演算法、最小代價?復雜性剪枝演算法以及最優樹選擇等演算法。提出了系統設計之後，論文詳細介紹了該系統的開發，用以解決異動客戶的識別問題。
  14. Minimum spanning tree

    最小代價生成樹
  15. Ec actions are usually discrete, contingency specific and free from influencing the normal operation. with relatively low cost, pc actions have to pay the cost for the whole action period whether the objective disturbances occur or not

    故障是小概率事件，在長期付出較小代價和僅在故障發生后才付出較大代價之間，存在著決策的優化問題，需要從全局考慮解決系統穩定控制問題的最優方案。
  16. The source tree built by the least cost

    基於最小代價建立有源樹
  17. An optimization model and a criterion with minimum cost which fulfilling the system ? availability constraint are presented for redundant multi - sensor system

    本文提出了一種多傳感器冗餘系統的優化模型和滿足有效度約束的最小代價準則。
  18. A multicast routing algorithm based on multiple qos constraints via multiple paths

    一種多受限最小代價的動態組播路由演算法
  19. In this thesis, firstly, the existing heuristic algorithms for steiner tree problem are summarized ; secondly, a research and analysis is made on the multicast trees that satisfy qos requirement and a fast routing algorithm for delay - constrained low - cost multicast is presented. through simulation, we find that the proposed algorithm is simple and can get the low - cost tee in polynomial time. at last, the multicast routing and wavelength assignment in wdm optical networks is studied ; a routing and wavelength assignment in wdm all - optical networks is presented

    本論文首先綜述了多播路由問題的理論基礎，接著對滿足qos約束的多播路由問題進行了研究，提出了一種快速的時延受限最小代價多播路由演算法，該演算法簡單、快捷，能在多項式時間內找到滿足時延約束的代價較小的多播樹，具有良好的性能；最後，研究了wdm光傳送網中的多播路由和波長分配問題，並提出了wdm全光網路中的多播路由與波長分配演算法，該演算法將路由和波長分配統一進行，構造了時延受限低代價多播樹，克服了將尋徑和波長分配分步進行的弊端，避免了同類演算法的較高復雜性。
  20. Two interactive segmentation methods, snake ( active contour ) and live wire, which are very popular, have been introduced for the medical image segmentation. a snake is a spline curve, which is controlled by an energy equation. to minimize the snake ' s total energy, the finite difference and greedy algorithm have been implemented

    論文引入了snake和livewire兩種十分流行的醫學圖像交互分割方法，詳細推導snake的能量方程，實現了最小化能量方程的有限差分和greedy兩種演算法，並利用鄰近圖像的相似性，將其成功應用於圖像序列的分割； livewire是一種象素級的輪廓搜索演算法，它在方向圖中找到開始點和目標點之間的最小代價路徑。
分享友人
分享到 Line

分享到臉書