The Judgment of Inverse M-Matrix Completion Based on Digraph and Its Algorithm Design & Realization;
基于有向图的逆M矩阵完备的判定及其算法的设计与实现
In the paper, the completion problems of the partial matrices are discussed.
对此类型矩阵的完备问题进行研究,给出它的完备定理以及具体的算法,根据此算法可以很容易的得到三对角线部分逆M矩阵的完备式。
A known result on the Deskins completion is extended by using“θ-pairs”and a key error in the proof of the known result is corrected in passing.
以θ－子群偶为工具推广了关于Ｄｅｓｋｉｎｓ完备的一个已知结果，顺便指出该已知结果论证中的一个关键性错误。
Compactness and Completeness of Fuzzy Normed Linear Space;
模糊赋范线性空间的紧性与完备性
In order to probe into the properties of frequency spectrum for a group of parametric curves, a class of orthogonal complete piecewise k-degree polynomials in L 2[0,1],called U-system, is introduced.
为了探索参数曲线图组的频谱性质,引进一类属于L2[0,1]的正交完备分片k次多项式系统(简称U系统)。
We also proved the space made of mapping of Caristi fixed point theorem is complete.
另外还证明了Caristi不动点定理中对应映射组成的空间是完备的。
),we get a necessary condition on which L is perfect by expanding the derivatives of R on L.
目的是给出特征零域上的有限维不可解L ie代数L完备的等价条件。
In this paper, we shall determine the structure of perfect π regular type A ω semigroups.
我们将决定完备 π-正则型 Aω-半群的结
Since China s concerning legislation have many defects at present, a comparative perfect legislation system of service trade should be established in China, so as to meet the requirements of WTO and GATS as well as the development of China s service trade.
我国现行服务贸易法制还存在许多缺陷,必须建立一套相对完备的服务贸易法律体系才能适应WTO与GATS的要求和我国服务贸易发展的需要。
The paper proposed a completeness evaluation method for natural disaster emergency plan by the fault tree analysis(FTA).
通过建立自然灾害类应急预案的标准故障树,确定各基本事件的权重,并将待评价应急预案的基本事件与标准故障树进行对比,进而得到其需要加强和完善的薄弱环节,并从量化的角度出发得到待评价应急预案的不完备度。
The enumeration problem of round-robin tournaments and perfect matchings are discussed.
为K2n的2n个完备匹配的划分,提出了顶点序号的排序法。
The concept of determining round-robin tournaments of order 4n by using existed round-robin tournament with Δ(G) indicated perfect matchings is described.
给出了边矩阵及循环赛图的定义,阐明了利用已存在的标明Δ(G)个完备匹配的2n阶循环赛图K2n(i)求解4n阶循环赛图K4n(i)的思路,提出了利用边矩阵求解Kv的完备匹配Mi的一种算法,介绍了16阶和32阶循环赛图K16(i),K32(i)的求解全过程。
By defining a special transformation, we obtain an interesting property about the set of perfect matchings of hexagonal systems, that is, any two perfect matchings can be transfered by a series of the defined transformations.
通过定义一种变换，得到了六角系统完备匹配集的一个有趣的性质，即一个六角系统的任何两个完备匹配都可通过一系列所定义的变换而互相转