矩陣的表示法 的英文怎麼說

中文拼音 [zhèndebiǎoshì]
矩陣的表示法 英文
representation of a matrix
  • : 名詞1. (畫直角或正方形、矩形用的曲尺) carpenter's square; square2. (法度; 規則) rules; regulations 3. [物理學] moment
  • : Ⅰ名詞1 (作戰隊伍的行列或組合方式) battle array [formation]: 布陣 deploy the troops in battle fo...
  • : 4次方是 The fourth power of 2 is direction
  • : Ⅰ名詞1 (外面;外表) outside; surface; external 2 (中表親戚) the relationship between the child...
  • : Ⅰ動詞(擺出或指出使人知道; 表明) show; indicate; signify; instruct; notify Ⅱ名詞1 [書面語] (給...
  • : Ⅰ名詞1 (由國家制定或認可的行為規則的總稱) law 2 (方法; 方式) way; method; mode; means 3 (標...
  • 矩陣 : [數學] matrix; array
  • 表示 : show; express; mean; indicate; expression; presentation; signifying; remark; representation
  1. The inverse kinematics of a space - based manipulator composed of three rigid bodies with prismatic joint are studied in the second chapter, and the jacobean matrix for space manipulator is derived by fully cartesian coordinates. a control method for space manipulator based on the resolved motion rate control concept is proposed

    為此結合系統動量及動量守恆關系導出了以完全笛卡爾坐標系統運動jacobi,並在此基礎上研究了帶滑移鉸空間機械臂分解運動速度控制方,給出了計算機數值模擬算例,以此證明了該方有效性。
  2. With the development of the network and the multi - processor system, the research, simulation and the impemeni of the system - level fault diagnosis which is the very important means to increase the reliability of the system, are becoming more and more important. on the system - leve1 fault diagnosis, based on the group theory of system - level fault diagnosis that has been put forward by pro f zhang, the paper constructs newly the theory bases, improves on the matrix method, reinforces and consummates group arithmetic of all kinds of test mode, for the first time, analyses and discusses the equation solution of all kinds of models, so al1 the consistent fault patterns ( cfp ) could be found, straightly and high efficiently, even if the sufficient and necessary condition of t - diagnosable is dissatisfied and the complexity of system - level fault diagnosis is greatly decreased, especialy in strong t - diagnosabl6 system. last the simulation system ' s function has been extended and the application hotspot and the development trend have been disscussed

    本人在張大方教授等人提出基於集團系統級故障診斷理論基礎上,重新構建了系統級故障診斷理論基礎,定義了系統級故障診斷測試模型三值;改進了系統級故障診斷,重新定義了測試、鄰接、結點對、結點對相連運算、極大準集團和斜加,由此能直觀、簡便地生成集團和極大獨立點集;補充和完善了各類測試模型系統級故障診斷集團演算,通過定義集團測試邊和絕對故障集,簡化了集團診斷圖,由此能較易地找到所有相容故障模式,即使不滿足t -可診斷性,大大減少了系統級故障診斷復雜度,尤其是對強t -可診斷系統;首次分析探討了各類測試模型方程解決,由此從另一角度能系統地、高效率地求出所有相容故障模式( cfp ) :擴充了系統級故障診斷模擬系統功能,快速、直觀和隨機地模擬實驗運行環境,進行清晰和正確診斷,同時提供大量實驗數據用於理論研究,優化演算和設計。
  3. This paper present the classic backtracking as an example, through comparing, explains backtracking efficiency difference under various data structure ; when database can be expressed in sparseness matrix, then it can be expressed in 4 - way linked list, which improves greatly the efficiency than before

    以一個典型回溯問題為例,通過對比,說明回溯在不同數據結構下,其時間效率差異,驗證對于可成稀疏數據集,在使用四向鏈結構時,可以大大提高時間效率。
  4. 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奇異和病態情形。
  5. Crossover is implemented using arithmetic crossover operator. then unsymmetrical mutation is conducted using the new mutation operator which can expand the scope of chromosome gene value, at the same time, the chromosome with the highest fitness values are retained for each iteration. a lot of experiments are implemented to obtain the optimized initial weighs and bias

    生成了三維染色體,進行了聯賽選擇,利用算術交叉運算元進行了交叉運算,利用構造變異運算元,進行了非均勻變異,同時保留了每次進化運算后最優適應值,通過大量實驗,實現了遺傳演算優化bp網路初始權值和閾值
  6. The framework of topology is based on apriori with the idea of " isomeromorphism ", using the techniques of graph sequential expression and label - connectivity determination. topology can analyze the complex relations among the objects in th

    這是一個以apriori思想為主體,以先同分后異構為框架,以圖序列化及和標號連通判定等技術為手段一個綜合演算
  7. A concise representation method of between - class scatter matrix and population scatter matrix is proposed, which suits for all the applications of pattern recognition using fisher criteria

    提出了散布一種簡潔,這一簡潔適合於一切使用fisher鑒別準則模式識別問題。
  8. 3 the concept of equivalence matrix, which expresses equivalence relation in rough set information system, is introduced ; the relations between equivalence matrix and equivalence classes are discussed. the algorithms for data cleaning and rules extraction in knowledge system based on matrix computation are proposed and their complexity of computation is analyzed

    3 、在等價概念基礎上,分析了粗糙集知識系統中等價劃分與等價摘要關系,採用等價粗糙集等價關系,提出了一種對數據庫知識系統進行數據清洗以及從中提取決策規則演算,分析了該演算計算復雜性。
  9. And for geometrically split link, sharp integrality of the ohtsuki invariant is given. a new multiplicative group, braid array, is constructed through a series of basic changes in the second part, and we conclude that any tame knot or link can be represented by finite braid array

    第二部分,由於辮子群與紐結理論密切聯系,本文構造了一個類似於群? ?辮子群,並給出了它一系列基本變換,且得到所有溫良紐結或環鏈都可由有限階辮子惟一
  10. To the complete character use the image which representation by matrix, making the subtraction between the matrix of capture image and the matrix of template, the result matrix which absolute sum of its all elements is the smallest is the recognition result. to the incomplete character, using two lines of 0 ~ 9 as template, then carry on the recognition using the template matching. to the scale division recognition, using the central position of it, distinguishes the long scale division expression is merely 0 perhaps 5

    對完整字元,採用將圖像用,利用獲取圖像與識別模板做減,結果所有元素絕對值和最小即為識別結果;對不完整字元,針對電度讀數具體特點,採用將兩行0 ~ 9字元圖像排列起來作為模板,利用模板匹配進行識別;對于刻度識別,利用刻度中心坐標位置,僅僅識別長刻度是0或是5即可。
  11. The concept of otn node transmission model is introduced. the requirement of otn node transmission model is discussed. this model uses the frequency domain transmission matrix to express the otn node transport characteristics. the simplified model based on wdm and im - dd systems, the relationship between node characteristics and model parameters and measurement of model parameters are also discussed. at last a briefly discussion on how to develop the otn simulation and cad software based on our model is demonstrated

    在線性時不變假設下,提出利用頻域傳輸節點傳輸特性給出了oxc和oadm兩類光傳送網節點統一根據目前通用波分復用強度調制直接檢波系統特點對復雜頻域傳輸進行了簡化並對通常所關心節點主要性能指標與模型參數關系模型參數測量和計算模型設計與計算機模擬輔助設計軟體開發銜接問題進行了討論。
  12. Firstly, the paper introduces the development and application of computer graphics & image technique, discusses the principle and method of cg and digital image processing, such as matrix of the graphic transformation, homogeneous reference frame, sampling and quantization of the image, file format of the image, template operation, etc. secondly the paper introduces the purpose and method of image enhancement processing, explains the each occasion of those methods such as threshold transformation, smoothing processing, sharpening processing, analyzes and contrasts the processing results of object image. thirdly, the paper introduces the method of mathematics morphologic, edge detection and thinning processing, attains character description of image and character dots of the contour. fourthly, the paper processes the coordinate transformation to character dots and basic splines fitting, imports correlative condition to devise meshing line and meshing track

    本文首先介紹了計算機圖形圖像技術發展與應用情況,對計算機圖形學和數字圖像處理一些基本理論和方如圖形變換、齊次坐標系、圖像采樣和量化、圖像文件格式、模板操作等內容進行了討論:然後對圖像增強處理和方進行了介紹,對諸如閥值變換、平滑處理、銳化處理等方應用場合進行了說明,並對實物圖像處理結果進行了分析與比較;接下來介紹了數學形態學方、對增強后圖像進行邊緣檢測和圖像特徵描述方,並獲取輪廓特徵點:隨后對獲取特徵點進行坐標變換,並進行b樣條曲線擬合,引入相關條件生成齒輪副嚙合線及嚙合軌跡:最後引入等值線和區域填充,並以等值線和區域填充形式對弧齒錐齒輪嚙合模擬載荷分佈情況進行了直觀
  13. In term of the orthogonal property of alamouti scheme and the character of the ofdm system equivalent model expression of receiver signal for stbc - ofdm system was obtained by flexible transform method so that the inverse of matrix was avoided using direct - decision mode and the complexity of computation and receiver was decreased. the simulation results show the validity and efficiency of the proposed receiver. ( 6 ) an adaptive equalization algorithm used in space - time block coded ofdm ( stbc - ofdm ) system with alamou

    該演算充分利用了alamouti編碼正交特性和多發射天線ofdm系統特點,通過靈活變換對接收信號進行等價;通過對11求逆研究,將塊最小二乘遞推演算( brl )中zkxzk求逆分解為k個2x2求逆,從而降低了自適應演算運算量和接收機復雜度。
  14. It is introduced that the concept of otn node route model. it is also discussed that on the requirements of the otn node route model and why we define this concept. the matrix and graph forms of the model are demonstrated. the two forms are compared with each other. at last, it is given that several examples and explain how to find the matrix and graph forms through these examples

    提出了光傳送網節點路由模型概念,討論了節點路由模型應達到要求和建立模型意義給出了普適和針對節點具體結構並討論了兩種方各自優缺點。最後針對實際光傳送網節點給出了幾個例子,並通過這些例子說明了路由模型和圖
  15. The group network scheme was inducted to research on the relations among the missions and the activity, and the fuzzy relation matrix was applyed to solve the problem on complex relation

    接著引入群體網路計劃思想來研究動態聯盟研發項目任務之間關系,並給出了任務之間邏輯關系、約束關系模糊以及任務層模糊關系確定
  16. Orthogonal matrixes have special structures, and every row vector of them can be taken as a plot, which may be parametrized in n - sphere space. through the research of structures of orthogonal matrixes, the writer finds a parametrized matrix, which can express all the orthogonal matrixes. through analysing uprightness between related high - order planes and the number of required parameters, we get the maturity of this method

    自然,這些點可以用其球坐標,即與各坐標軸夾角來參數化,作者通過觀察正交幾何結構,最終找到了任意維數隨機正交參數,通過分析相關超平面之間垂直關系和參數化正交需要參數個數,論證了這種完備性。
  17. We firstly introduce several presentations of fundamental matrix, which are theoretical foundations of the algorithms for fundamental matrix. as to two images, we give the algorithins which preliminarily process data to inhibit noises. then we give robust algorithms

    首先介紹基本幾種,它們是基本演算理論依據;對于兩幅圖像,給出了對圖像數據進行預處理以抑制噪聲演算,進而給出魯棒性演算;最後根據三幅圖像射影約束,我們提出了基於三幅圖像6點ransac演算,這是一種非常魯棒演算
  18. This ph. d. thesis - firstly considers the real asymmetric, real symmetric, bisym - metric, and symmetric and skew antisymmetric matrix extension problems constrained by the matrix inverse problem ax = b. and also considers, in the solution set, of the corresponding matrix extension problems, the optimal approximation solution to a given matrix a *. the necessary and sufficient conditions for the existence of and the expressions for the above problems are derived, and the numerical algorithm and examples to solve the problems are also given

    首次提出並討論了反問題ax = b約束下實、實對稱、雙對稱和對稱次反對稱擴充問題,討論了在其解集合中與給定a ~ *最佳逼近問題,得到了問題解存在條件及通式,給出求解問題數值演算和數值例子。
  19. 3. present corresponding database representation method for diagnostic knowledge : aimed at knowledge based on decision trees, use the parent node representation adding node state column and fault column to implement the database storage for diagnostic knowledge ; while for knowledge based on cases, the fault symptom matrix is available. 4

    診斷知識方面,提出了相應數據庫:對于基於決策樹知識,用增加狀態數據域和結點狀態列以及故障列雙親結點,實現診斷知識數據庫存儲:對于基於案例診斷知識,以故障徵兆形式存入數據庫。
  20. The representation takes full advantages of traditional and cutting edge computer graphics techniques to achieve an efficient and packed representation for virtual environment ; this thesis proposes a sampling rate comparison algorithm based on jacobi matrix to eliminate redundant pixels among the reference images ; this thesis proposes a texture reconstruction algorithm to reconstruct the corresponding textures of surfaces suitable for polygon - based representation

    充分利用傳統圖形學和現代圖形學新技術,以獲取高效虛擬場景達方式;本文提出了一個基於jacobi采樣密度比較演算,以刪除參考圖象間存在大量冗餘象素;本文提出了一個平面紋理提取方
分享友人