等價演算法 的英文怎麼說

中文拼音 [děngjiàyǎnsuànfǎ]
等價演算法 英文
equivalence algorithm
  • 等 : Ⅰ量詞1 （等級） class; grade; rank 2 （種; 類） kind; sort; type Ⅱ形容詞（程度或數量上相同） equa...
  • 價 : 名詞1. （價格） price 2. （價值） value 3. [化學] （化合價） valence
  • 演 : 動詞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 （標...
  • 等價 : of equal value; equal in value; equivalence
  1. In this thesis, we study some open problems and conjectures about the linear complementarity problem. it consists of the next three aspects : firstly, we study murthys " open problem whether the augmented matrix is a q0 - matrix for an arbitary square matrix a, provide an affirmable answer to this problem, obtain the augmented matrix of a sufficient matrix is a sufficient matrix and prove the graves algorithm can be used to solve linear complementarity problem with bisymmetry po - matrices ; secondly, we study murthys " conjecture about positive semidefinite matrices and provide some sufficient conditions such that a matrix is a positive semidefinite matrix, we also study pang ' s conjecture, obtain two conditions when r0 - matrices and q - matrices are equivelent and some properties about e0 q - matrices ; lastly, we give a counterexample to prove danao ' s conjecture that if a is a po - matrix, a e " a p1 * is false, point out some mistakes of murthys in [ 20 ], obtain when n = 2 or 3, a e " a p1 *, i. e. the condition of theorem 3. 2 of [ 25 ] that a p0 can be deleted and obtain a e " a is an almost e - matrix if a is a co - matrix or column sufficient matrix

    本文分為三個部分，主要研究了線性互補問題的幾個相關的公開問題以及猜想： （ 1 ）研究了murthy等在[ 2 ]中提出的公開問題，即對任意的矩陣a ，其擴充矩陣是否為q _ 0 -矩陣，給出了肯定的回答，得到充分矩陣的擴充矩陣是充分矩陣，並討論了graves演算法，證明了若a是雙對稱的p _ 0 -矩陣時， lcp （ q ， a ）可由graves演算法給出； （ 2 ）研究了murthy等在[ 6 ]中提出關於半正定矩陣的猜想，給出了半正定矩陣的一些充分條件，並研究了pang ~ -猜想，得到了只r _ 0 -矩陣與q -矩陣的二個等價條件，以及e _ 0 q -矩陣的一些性質； （ 3 ）研究了danao在[ 25 ]中提出的danao猜想，即，若a為p _ 0 -矩陣，則，我們給出了反例證明了此猜想當n 4時不成立，指出了murthy等在[ 20 ]中的一些錯誤，得到n = 2 ， 3時，即[ 25 ]中定理3 . 2中a p _ 0的條件可以去掉。
  2. Considering the electrovalence, the curve of water consumption and the reliability of water supply, this paper respectively sets up the model based on the maximal flux and the model based on the expectation flux. it takes yearly expenditure converting value and yearly cistern converting value as target function and takes continuity equation, velocity of flow and compression resistance of cast iron pipeline as restrictions and sets up the pga model on optimal design of water supply networks

    考慮到峰谷電價、用水量變化曲線及用水可靠性因素的影響，分別建立了以最高時流量設計管網的模型和以期望時流量設計管網的模型，以年費用折算值加上清水池年造價折算值為目標函數，以連續性方程、管中流速和鑄鐵管耐壓值等為約束條件，進行并行遺傳演算法對給水管網優化設計的實現。
  3. At the end, basing on comparative model, using depth - first search strategy and special arithmetic in the principle of mathematical equipollence, ides can auto distinguish the subject after comparing key steps and answering steps of student

    基於比較模型，採用深度優先的控制策略，採用特定演算法，按照數學意義上等價的原則，對關鍵步驟和學生解答進行比較識別，從而實現自動批改功能。
  4. In order to maintain the rules conveniently, we make use of the technology of rdbms in managing data, consider the trait of production rules, and then design and realize the arithmetic to check the rules " equipollence and circulation on the basis of our former work - knowledge ordering. all these solve the knowledge base ' s consistency effectively

    為了方便對規則的維護，我們充分利用數據庫管理系統對數據管理的巨大威力，結合產生式知識規則的特點，在原有知識序化的基礎上，對規則的等價、循環做了演算法設計與實現，較好地解決了知識庫的一致性問題。
  5. First, we reformulate the kkt systems of the constrained optimization problem and the symmetric variational inequality prpoblem into equivalent nonsrnooth equations by using the so called ncp functions

    本文研究求解約束最優化問題和對稱變分不等式kkt系統的bfgs演算法。首先利用ncp函數將問題的kkt系統轉化為等價的非光滑方程組。
  6. From the equivalence relations, a minimal form is defined and a minimization algorithm of the mealy type of fuzzy finite automata is obtained. in chapter 3, a fuzzy finite automata with a fuzzy initial state that was first considered by m. mizumoto, j. toyota and k. tanaka in 1969 is introduced. based on the mizumoto type of fuzzy finite automata, a statewise equivalence relation is considered

    在第三章中，我們首先介紹了一類有模糊初始狀態的模糊有限自動機- mizumoto型模糊有限自動機，然後定義了兩種狀態等價和兩種模糊有限自動機等價的概念，接著證明了對于每一個mizumoto型模糊有限自動機，都存在一個與之等價的狀態最小化模糊有限自動機，並且給出了一個狀態最小化約簡演算法及其演算法終止條件。
  7. In this paper, the main research works are as follows : 1 ) survey and analysis previous work in auv navigation and summarize : as the cumulate error, the dead - reckoning and inertial navigation systems ca n ' t be used without other modified system ; the acoustic navigation system is used only in small range, and is very expensive. 2 ) two important approaches in geophysical navigation techniques are summarized, one is terrain contour based navigation, this approach is investigated keystone today ; the other is image based navigation, due to no perfect image sensors and image seabed map, this approach has seldom been practised. 3 ) two important terrain contour based navigation algorithms has been applied to auv, one is match algorithm - based terrain contour match ( tercom ) ; the other is kalman filter - based sandia inertia terrain - aided navigation ( sitan )

    主要研究內容包括：一、總結分析了當前水下導航的常用方法和不足之處，指出基於航位推算的導航方法，存在著最大的問題就是導航誤差的積累問題，如果沒有修正系統，這種方法很難滿足使用要求；其次指出基於聲學的導航方法，造價昂貴，導航范圍有限，難以滿足自主水下航行器大范圍導航的需求；二、總結了當前水下地形輔助導航的主要技術路線，一是基於地形高程的匹配方法，這是當前研究的重點；二是基於地形圖像的匹配方法，由於缺乏良好的圖像傳感器，和可用的海底圖像地圖，目前這種方法還有待研究發展；三、將兩種地形高程匹配的常用方法應用到自主水下航行器上：以相關演算法為前提的地形輪廓匹配（ tercom ）方法和以卡爾曼濾波為基礎的桑迪亞慣性地形輔助導航（ sitan ）方法，前者演算法簡單可靠，但是導航精度不高，後者雖然精度比較高，但存在著演算法較為復雜、有可能發散和出現奇異值等問題。
  8. This paper develops a deterministic inventory model for perishable items with a mixture of back orders and lost sales under inflation and time discounting, where the backlogged demand rate is dependent on the negative inventory level during the stock out period. the main differences from the existing related models are that the present model takes the maximum present value of profit in a repeatable order cycle as the objective function and proposes a more practical constraint of maximum customer - waiting time to ensure a proper customer service level. then the existence and the uniqueness of the solution to relevant systems are examined and a solution algorithm is shown to find the optimal replenishment policy. at last, some numerical examples are presented to illustrate the applicatioh of the model

    本文建立了一種考慮通貨膨脹與時間價值的變質性物品的庫存模型，在模型中允許短缺發生且拖后的需求速率與在缺貨期間已經發生的缺貨量有關.和已有相關模型的主要區別在於本模型把一個可重復的訂貨周期內的最大平均利潤的凈現值作為目標函數，且增加了在缺貨期間最長顧客等待時間的限制，以確保庫存系統擁有較高的服務水平.然後討論了模型最優解的存在性與唯一性，並提供了尋求模型整體最優解的演算法.最後用實例說明了此模型在實際中的應用
  9. Analyze and compare pid and vague, single neuron etc. control strategy, and combine with single neuron self adaptive gain, self adaptive right value and preventive integral saturation etc. control strategy. have improved single neuron control algorithm, may restrain efficiently to disturb, reduce broken arc and short circuit etc. phenomenon, make systematic control effect and robustness get to strengthen, also have certain application reference value for the design of the dc arc furnace

    通過對pid 、模糊、單神經元等控制策略的分析比較，將單神經元增益與權值的自適應調節、抗積分飽和等控制策略相結合，改進了單神經元控制器演算法，可以有效抑制擾動，減少斷弧、短路等現象的發生，使系統的控制效果和魯棒性都得到增強，對電弧爐控制系統的設計也具有一定的應用參考價值。
  10. However, the computation of the g. 723. 1 algorithm is very complex and the single chip cannot provide us with many resources due to the limited buget for every chip, so we have many difficulties to put the g. 723. i algorithm into pratical use

    但該演算法存在計算量和數據存儲量大等固有缺陷，而且實際系統一般都必須重點考慮性能價格比因素，這樣的系統不可能像pc機捉供那麼豐富的資源，所以必須尋找一種運算功能強大而且價格又較合理的晶元才能把g
  11. The key technology of mpidss includes the distributed supported technology, the process control of cooperative working and the real - time control of the decision process, etc. based on the technologies of decision support system ( dss ), group decision support system ( gdss ) and distributed decision support system ( ddss ), with the theory of system engineering and artificial intelligence such as knowledge engineering, agent, etc, having the background of the items supported by the national 10th five - year plan foundation - the research on the technology of military programming intelligent decision support system, this paper focus its work on researching on the algorithm of mission decomposing and mission distributing, distributed support technology, real - time process control method and project evaluating technology, etc. further more, the architectural model of process control based on multi - agent alliance is put forward and the prototype system of mpidss is implemented

    這類決策問題與傳統的企業決策的不同點在於決策群體龐大、決策任務多且任務屬性各異、決策任務的求解具有實時性要求等。決策過程中的關鍵技術包括分散式支持技術、決策任務求解的過程式控制制技術以及實時任務的求解控制策略等。論文在繼承傳統的個體決策支持系統（ dss ） 、群體決策支持系統（ gdss ）和分散式決策支持系統（ ddss ）技術的基礎上，結合系統工程思想以及人工智慧中的知識工程、 agent等前沿技術，以總裝備部十五預研課題? ? 「群體決策支持平臺」為課題背景，深入研究了分散式多任務群體決策過程中的任務分解與分配演算法、任務協作策略、分散式支持技術、實時控制技術，決策方案評價技術等，提出了用於過程式控制制的多agent聯盟體系結構模型，設計和實現了面向軍事作戰規劃的智能決策支持原型系統。
  12. The detection of interest points is the basis of kinds of computer vision applications, such as : camera calibration, 3d reconstruction, image matching, video retrieval, motion estimation, etc. in this paper, three impersonal criteria : delocalization, false - detection rate, and repeatability are presented to evaluate the performance of an interest points detection algorithm

    興趣點檢測是許多計算機視覺應用的基礎，如：攝像機定標、三維重建、圖像匹配、視頻檢索、運動估計等。本文首先給出了一個評價興趣點檢測演算法性能的客觀標準，這個標準包括以下三個準則：點位置偏差、誤檢率及重復度。
  13. With this method, developable surfaces and non - developable surfaces can be developed in a unique way. the developable surfaces can be developed submitted to certain error, and the non - developable surfaces developed homo - topologically

    對于可展曲面，利用該演算法可以得到在一定誤差范圍內的展開結果；對于不可展曲面，則可得到與原曲面拓撲等價的展開網格。
  14. With those above, an essential explanation to the simplicity of the representation of rijndael s - box is given, and a direct proof to the equivalence between any two coordinate functions of rijndael s - box is provided, with the equivalence described by only one matrix of order eight over gf ( 28 ). 5

    利用這三種方法計算出的域元素分量表達式，解釋了rijndael演算法s盒代數表達式復雜度低的本質原因；給出rijndael演算法s盒分量函數間等價關系的一種直接的證明方法，並用一個八階gf （ 2 ~ 8 ）矩陣完全刻劃這種等價關系。
  15. ( 3 ) the paper firstly brings forward the concepts of concealed fragment, apparent fragment. it also advances two fragment generation methods : facet equivalence method and facet set enclosing method, and realizes three practical algorithms : the first one is to make a virtual entity particulate, the second is facet equivalence algorithm, the last is seed facet set enclosing algorithm. the paper analyzes and compares the last two methods and related algorithms, researches on applying the two methods to the break process of a virtual entity

    （ 3 ）在深入探討爆炸模型的構造和實時顯示的基礎上，提出了隱式破片、顯式破片的最新概念和兩種生成破片的方法：小面片等價法和面片集封閉法，並給出了三個實用的演算法：虛擬實體的微粒化演算法、小面片等價演算法和面片集封閉演算法，並對小面片等價法和面片集封閉法及其演算法進行了比較。
  16. In order to solve this contradiction, reservoir engineering methods are used to estimate the exploitation process about the block, which including water drive curve method, the correlation experience method, the method of the flow pipe budgetary estimate and the method of well net density. on the basis of these method, the author studied the macrocospical distributing of remaining oil in each layer

    針對單元開發過程中存在的突出矛盾，運用水驅曲線法、相關經驗公式法、流管概演算法、合理井網密度法等油藏工程方法對斷塊的開發歷程進行評價，在此基礎上進行各小層剩餘油的宏觀研究。
  17. 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 ） ，都取得了顯著的效果，是目前同類問題中比較好的解決方案，達到了預期的目的。
  18. An approach of event - oriented feature abstracting is presented. we devise and improve some media processing algorithms including : text detection in video frames, audio shot detection, scene detection, evaluation of scene significance

    設計和改進了部分媒體處理演算法，包括：視頻幀中的文字探測演算法、音頻鏡頭探測演算法、融合聲像特徵的場景檢測演算法、場景重要程度的評價演算法等。
  19. The proposed learning automata model and bidding algorithm need not to know the uncertain information in the marketplace, such as the competitors " biding behaviors, etc., and need not to conduct complicated optimization tasks, therefore it is very easy to implement, and applicable to the dotermination of individual market participant ' s bidding strategy in large scale electricity markets

    所提出的學習自動機模型和競價演算法不需知道其餘市場競爭者的競價行為等不確定信息，且不需要進行復雜的優化計算，因而非常容易實現，可適用於實際大規模電力市場中獨立市場成員的競價問題。
  20. Optimization results of ieee 30 system validate that this method not only has the same superiority with ip off on calculating and decomposing spot prices, but also greatly quickens the calculation speed

    通過對ieee30節點系統的計算並和內點法進行比較，表明快速實時電價演算法的計算結果和內點法近似相等，但計算速度卻大大提高。
分享友人
分享到 Line

分享到臉書