查询词典 transitive

In this paper, we deal with the complete extension of a fuzzy relation and obtain the following main conclusion. Every reflexive,*-antisymmetric and *-transitive fuzzy relation can be extended to a complete reflexive,*-antisymmetric and *-transitive fuzzy relation, namely, every partial order can be extended to a linear order.

文章研究了一个模糊关系的完全扩张问题，主要结果为：一个自反的、*-反对称的*、-传递的模糊关系可以扩张成为一个完全的、自反的、*-反对称的、*-传递的模糊关系，即任何一个偏序都可以扩张成一个线性序。

G is called point-transitive if it has a point-transitive automorphism group. Let PM denote the perfect matching polytope of the graph G.

称G是顶点可传递的，如果其自同构群是顶点传递的。G的完美匹配多面体记作PM。

So for block transitive 2-(υ, 5, 1) designs, we need to study the case in which the given block transitive group of automorphisms is unsolvable.

在[49]中，极小反例的方法起到重要的作用，但对于非可解的区传递2-（υ，5，1）设计，极小反例的方法是无效的。

While the transitive closure of fuzzy matrix is closely linked with the transitive closure in common sets.

而模糊矩阵传递闭包与普通集合论中传递闭包是有密切联系的。

For a limited relationship between a given set of transitive closure, by entering the relationship between a given matrix, and its transitive closure.

详细说明：求有限集上给定关系的传递闭包，通过输入给定关系的关系矩阵，求其传递闭包。可用二值矩阵描述关系。

This observation strenghen to some extent the corresponding result obtained by Watkins, which said that k-regular vertex transitive graph G has a factor with components isomorphic to a vertex transitive graphs if G is not k connected.

此结果在某种程度上加强了Watkins的相应命题：如果κ正则点可迁图G不是κ连通的，那么G有一个因子，它的每一个分支都同构于同一个点可迁图。

In chapter 4, we studythe cyclic edge connectedness of regular half vertex transitive graphs, we showthat a connected k(≥4)-regular half vertex transitive graph X with girthg≥6 isλ_c-optimal, and we also obtain a su?cient and necessary conditionfor a connected k(≥4)-regular half vertex transitive graph X with girth 4 tobeλ_c-optimal.

第四章，我们研究了正则半点传递图的圈边连通性问题，主要结果是证明了一个围长为g≥6的k(≥4)-正则连通半点传递图X是λ_c-最优的，并且得到了一个围长为g = 4的k(≥4)-正则连通半点传递图X是λ_c-最优的充分必要条件。

Content: Transitive inference characterized by two or more than two judgment with transitive relation, it is an indirect relation reasoning.

传递性推理是由两个或两个以上的具有传递性关系的判断构成的推理，是一种间接关系的推理。

A solution for signing any directed transitive binary relation is presented by combining the proposed scheme with the undirected transitive signature schemes available.

1引言传递签名是由Micali和Rivest[1]在2002年首先提出的，主要用于对具有传递性的二元关系进行高效签名，这在军事、政治和经济等领域都有重要应用。

As applications, we prove the following results: If / has pointwise pseudo-orbit tracing property, for any k ∈ Z+, and fk is chain transitive, then for any k ∈ Z+, fk has open set transitive ; If f has pointwise pseudo-orbit tracing property, and for any n ∈ Z+,fn is chain transitive, then f has sensitive dependence on initial conditions; If f is open set mixing and has pointwise pseudo-orbit tracing property, then f has property P; Let f :→ be a homeomophism, then f is pointwise pseudo-orbit tracing property if and only if the shift map σf is pointwise pseudo-orbit tracing property.

作为应用，证明如下结论：若f具有逐点伪轨跟踪性质，且对任意k∈Z+，fk为链转换的，那么对任意k∈Z+，fk为开集转换；若f具有逐点伪轨跟踪性质，且对任意n∈Z+，fn为链转换的，则f具有初始敏感依赖性质；若f为开集混合的，且具有逐点伪轨跟踪性质，那么f具有性质P；设f：→是同胚映射，那么f具有逐点伪轨跟踪性质当且仅当移位映射σf具有逐点伪轨跟踪性质。

Finally, according to market conditions and market products this article paper analyzes the trends in the development of camera technology, and designs a color night vision camera.

最后根据市场情况和市面上产品的情况分析了摄像机技术的发展趋势，并设计了一款彩色夜视摄像机。

Only person height weeds and the fierce looks stone idles were there.

只有半人深的荒草和龇牙咧嘴的神像。