有向樹矩陣 的英文怎麼說

中文拼音 [yǒuxiàngshùzhèn]
有向樹矩陣 英文
directed tree matrix
  • : 有副詞[書面語] (表示整數之外再加零數): 30 有 5 thirty-five; 10 有 5年 fifteen years
  • : Ⅰ名詞1 (木本植物的通稱) tree 2 (姓氏) a surname Ⅱ動詞1 (種植; 栽培) plant; cultivate 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. Thirdly, similarity matrix, dissimilarity matrix or similarity table are established based on the n - strong peaks, the overlap rate of common peaks and the cosine / sine of vectors " angle which are derived from the fingerprint chromatograms of samples. and based on these data model, clustering research has been done by k - means algorithm, biggest tree in fuzzy clustering and improved cobweb algorithm, where different results have been gained. by comparing, cobweb algorithm is the best

    本次研究利用n強峰、共峰的重疊率和量夾角正餘弦值對樣品色譜指紋圖譜分別建立了相似度、相異性或相似度表,以這些數據模型為基礎,分別用了k -平均、模糊聚類的最大法和改進的cobweb法進行了聚類研究,得到了不同的效果。
  3. The appliance range of traditional tree - gauge arithmetic is narrow. this paper provide a new method of the choice of the tree. this method is based on the matrix and the finite element equation, so it can be called matrix method. this mathod adopts 1 range number of the matrix as the condition to choose branches of the tree, it is theoretically optimal, the analyses of calculation also shows that this arithmetic is excelled traditional method

    本文提出了一種新的規范選擇演算法。這種演算法是建立在對系數限元方程進行分析的基礎上的,所以被稱為法。由於採用了量的1范數作為選擇支的條件,所以這種演算法在理論上是最優的,實際的算例的分析也表明這種演算法優于傳統演算法。
分享友人