約簡矩陣 的英文怎麼說

中文拼音 [yāojiǎnjǔzhèn]
約簡矩陣 英文
reduced matrix
  • 約 : 約動詞[口語] （用秤稱） weigh
  • 簡 : Ⅰ形容詞（簡單） simple; simplified; brief Ⅱ動詞1 （使簡單; 簡化） simplify 2 [書面語] （選擇人才...
  • 矩 : 名詞1. （畫直角或正方形、矩形用的曲尺） carpenter's square; square2. （法度; 規則） rules; regulations 3. [物理學] moment
  • 陣 : Ⅰ名詞1 （作戰隊伍的行列或組合方式） battle array [formation]: 布陣 deploy the troops in battle fo...
  • 矩陣 : [數學] matrix; array
  1. We analyze the assembly model and propose a mathematics model and tree - representing model of the assembly who not only has a small data size, but also can be manipulated easily. this thesis not only gives the virtual representing concept the instance representing one, but also defines the concept of assembly constraint such as coupling, being alignment, being coaxial and being equidirectional. based on such concepts, a revised newton - raphson iterative algorithm is proposed, which can deal with the singularity and ill - condition of jacobi matrix

    首先分析了裝配體的模型問題，提出了裝配體的數學模型及樹形式表示的裝配體表示模型，模型具有數據量小、操作簡單的優點：文章對所涉及的約束諸如耦合、對齊、同軸、同向的裝配體位置描述概念進行了定義，引入了裝配約柬概念，從而提高了裝配設計效率；在此基礎上，文章討論了裝配約束的求解方法，提出了newton rapson迭代法的改進演算法，使得系統能更好地處理jacobi矩陣的奇異和病態的情形。
  2. The attribute reduction and rules are gained

    對矩陣進行化簡得到屬性約簡並生成規則。
  3. Improved decision matrix and attribute reduction

    改進的決策矩陣及其屬性約簡方法
  4. This paper applies generalized multipler method to translate convex quadratic programs with equal constraints and non - negative constraints into simple convex quadratic programs with non - negative constraints. the new algorithm is gotten by solving the simple quadratic program. it avoids the computation of inverse matrix and exploits sparsity structure in the matrix of the quadratic form. the results of numerical experiments show the effectiveness of the algorithm on large scale problems

    根據廣義乘子法的思想，將具有等式約束和非負約束的凸二次規劃問題轉化為只有非負約束的簡單凸二次規劃，通過解簡單凸二次規劃來得到解等式約束和非負約束的凸二次規劃新演算法，新演算法不用求逆矩陣，這樣可充分保持矩陣的稀疏性，用來解大規模稀疏問題.數值結果表明：在微機486 / 33上就能解較大規模的凸二次規劃
  5. In order to determine the solution set of the equation, by the means of meet - irreducible element and irredundant finite meet - decomposition, we first obtain the maximal solutions to the simple equation in the case that b has an irredundant finite meet - decomposition, and then consider the relation between the equation and the equation, based on this, we obtain the maximal solutions to the equation in the case that each element of the matrix b has an irredundant finite meet - decomposition and so determine its solution set completely

    為了確定方程的解集，本文利用交既約元與不可縮短的有限交分解等工具，同樣地先求出簡單形式的型矩陣方程的所有極大解，然後討論方程與方程之間的關系，在此基礎上，在b的每個元素均有不可縮短的有限交分解的情況下，求出了方程的所有極大解，從而完全確定了方程的解集
  6. An attribute reduction algorithm based on the relation matrix of rough set

    基於粗糙集相關矩陣的屬性約簡演算法
  7. An algorithm of attribute frequency reduction based on discernibility matrix

    基於可辨識矩陣的屬性頻率約簡演算法
  8. Within the framework of sparse bayesian learning, the algorithm extends the relevance vector machine by combining global and local kernels adaptively in the form of multiple kernels, and the improved locality preserving projection ( llp ) is then applied to reduce the column dimension of the multiple kernel input matrix to achieve less training time

    在稀疏貝葉斯學習的框架下，該演算法首先以多核形式自適應結合全局核函數和局部核函數擴展相關向量機，然後應用改進的保局投影來約簡多核輸入矩陣的列維數以減少訓練時間。
  9. Under the condition that the lower - layer elements and their dominating upper - layer elements are considered as the condition attributes and the decision attributes separately, the following problems are studied : refining of assessment index system, acquirement of index weight and the constructing of judgment matrix based on the reduction and the attribute importance theory in rough sets, which achieve the sufficiency use of field knowledge for analytical hierarchy process and decision support of the hierarchy problems for rough sets

    摘要將層次分析模型中下層因素與支配它的上層因素分別視為條件屬性和決策屬性，藉助粗糙集的約簡和屬性重要性理論，研究了融合粗糙集的層次分析法的指標體系的完善、指標權重的確定、判斷矩陣的構造等問題，實現了層次分析法時領域知識的利用及粗糙集對層次結構問題的決策支持。
  10. One is based on the discriminated matrics, the other is based on ga. we use many new ways to make the algorithms more effective, such as reducing dimension and sparsiting elements of the discriminated matrics, effectively selecting elements of the positive examples set and the counter examples set for the jointing - spreading matrics, using a new selecting operator, and so on

    其次，實現了基於粗集理論的屬性約簡方法? ?基於可分辨矩陣的屬性約簡法和基於遺傳演算法的屬性約簡法，並通過降維、稀疏化、正例集和反例集的有效選取、新的選擇運算元等方法對原演算法進行了改進。
  11. 3 ) give the reduct algorithm and improved algorithm based on discernibility matrices. 4 ) give the algorithm of rules. 5 ) in this thesis, by using rs theory in the synthesis of combinational logic function, we can get minimal expression of logic function ; if by using rs theory in the rough control of boiler, we can get rough control rules

    對於前人提出的差別矩陣和差別函數的概念和定義，將其應用於信息系統中，用差別函數得到了最小約簡，然後，通過研究差別矩陣和差別函數的構造過程，提出了對差別矩陣降階和消元的策略，實例證明是有效的，起到了化簡差別矩陣和差別函數的目的； 4
  12. Distilling effective data from dbselect database and building data mining database ; according to the idea of prognostication, computing data in order to satisfy the need of prognostication and using minconf to judge, finally getting the result. because of the objective factor, the result must be adjust by adjustment matrix

    根據建立預測模型的基本思路，從數據庫中依次求出預測需要的各類數據，並以最小置信度作為約束條件對數據進行精簡，最終得到轉移概率矩陣。
  13. Algorithm for attribute reduction based on attribute significance of binary discernible matrix

    基於二進制可辨矩陣屬性重要度的屬性約簡演算法
  14. On one hand, we improve on one of the existed algorithms which named attribute reduction algorithm based on discernility matrix and logic operation. we propose a new transformation method from conjunction matrix to disjunction matrix that avoids the manual work or global search and can save the time and space. on the other hand, most traditional methods didn ’ t integrate with database operations

    主要做了兩方面的工作，一方面，對已有的基於可辨識矩陣和邏輯運算的屬性約簡演算法進行了改進，提出了一種從合取項矩陣到析取項矩陣直接轉化的方法，避免了傳統的人工轉化或全局搜索的方法，節省了空間和時間。
  15. Based on the results, chapter 3 obtains the necessary and sufficient conditions of the positive line a - doubly diagonally dominant matrices being non - singular m - matrices, by means of the nature of the associated digraph of matrices irreducible and weakly irreducible matrices. the results obtained simplify the process of judgment, only making us to check the related quantity involved in the circuit of the associate digraph of matrices

    第三章在已有結果的基礎上，藉助于矩陣的伴隨有向圖、不可約以及弱不可約矩陣的性質，得到了正線-雙對角占優矩陣為非奇異m -矩陣的充分必要條件，所獲結果簡化了判定過程，只需要對矩陣伴隨有向圖圈中所涉及到的相關量進行驗證即可。
  16. This paper offers a heuristic search algorithm which is relative reduce by differential matrix calculating. this algorithm can quickly reduce fault knowledge base to deduce the east decision rule

    摘要本文給出用差別矩陣計算相對約簡的一種啟發式搜索演算法，能快速約簡故障知識庫，導出最小決策規則。
  17. The attribute reduction of matrix algorithm based on rough set theory

    基於粗糙集的屬性約簡的矩陣方法
  18. A test arranged to check lately and the result indicates that the new method can work efficiently, that the results were closer to the objective nature. 3. to produce a new reduced kf scheme with svd, and construct the state transition matrix directly

    浙江人學博十學位論文全文摘要3應用svd分解，推導了簡約形式的卡爾曼濾波方法，並直接建立了顯式的狀態轉移矩陣卡爾曼濾波法無法直接應用於海洋，其主要原因是增益矩陣的計算量太大。
  19. A complete algorithm for attribute reduction based on discernibility matrix

    一種基於差別矩陣的屬性約簡完備演算法
  20. A new method of attribute reduction of decision table based on discernibility matrix

    一種新的基於區別矩陣的決策表屬性約簡方法
分享友人
分享到 Line

分享到臉書