研究了一类特殊的偏序半环。
在第4节研究了偏序集拟阵的零度函数。
In Section 4, we study the nullity functions of poset matroids.
广义度量空间和偏序集都具有函数空间。
The relation between generalized metric spaces and posets is treated.
主体规划使用HTN方法，形成偏序规划树。
The agent's planning forms a partial ordered plan tree using HTN method.
加权减序和加权星序都是态射集中的新的偏序。
The weighted minus ordering and the weighted star ordering are both new partial ordering in morphism set.
给出了一致连续偏序集的概念及其性质和等价刻划。
The notions of uniform complete partial order sets and uniform continuous partial order sets are defined.
本文中我们定义了一种新型矩阵偏序并研究了其基本性质。
In this thesis, we define a new matrix partial ordering and study its basic properties.
在计算属性约简集的基础上，建立了雷达干扰空间的偏序关系矩阵。
Based on the reduction of attribute sets, the partial order relation matrix of radar jamming space is obtained.
将时间表理论中关于拟全序的相邻交换原则改进为关于偏序的情形。
The adjacent pairwise interchange principle plays an important role for some problems in scheduling theory.
另外，该偏序与超可加序、NBUE序，增凹序的关系也作了探讨。
We also survey the relationships between this new ordering and super-additive ordering, NBUE ordering and increasing concave ordering.
讨论了偏序线性空间的代数对偶空间上的端单调线性泛函的延拓性。
In this paper, our aim is to discuss the extension of an extremal monotonic linear functional in the algebraic dual space of a partially ordered linear space.
对Nerd们的注解：可能是个格，顶尖；形状不重要，这里至少有个偏序关系。
Note to nerds: or possibly a lattice, narrowing toward the top; it's not the shape that matters here but the idea that there is at least a partial order.
软件过程是管理、开发、维护软件系统所需要的一系列活动的偏序集合。
Software process is a partially ordered set of activities undertaken to manage, develop and maintain software systems.
引进了自然序半格、偏序半群的自然序半格同态象和二次主根基等概念。
Concepts of natural ordering semilattices, natural ordering semilattice homomorphic images and principal square radicals on ordered semigroups are introduced.
此外，该算法同样适用于概念间存在的其它偏序关系如整体部分关系等。
An interesting feature of the presented algorithms is that it can also be used in other kinds of partial relation among concepts.
本文主要研究有关矩阵的加权广义逆，加权极分解和矩阵偏序等方面的问题。
In this thesis, we mainly study problems on weighted generalized inverses, weighted polar decomposition, and partial orderings of matrices.
对于这两种算法来说，都是利用一般到特殊序的偏序结构来完成整个搜索过程。
The two algorithms for concept learning efficiently complete the whole search through the hypothesis space based on a very useful structure: the general-to-specific partial order.
本文主要研究了偏序半环的偏序扩张和有限全序扩张，并得到了一些新的结果。
In this paper, we mainly study extensions of partial order and finitely totally order for partially ordered semirings, and obtain some new results.
通过对角色偏序关系和角色管辖域的讨论，说明了该设计方案的可用性和安全性。
Through the discussion of role partial ordered relation and administer field the usability and security of this design scheme are proved.
在第5节，我们用偏序集拟阵的余秩函数来研究偏序集拟阵与其对偶之间的关系。
In Section 5, we use the corank function of poset matroids to investigate the relationship between a poset matroid and its dual.
如果一个偏序集可以分解成不相交的对称链之并，则称此偏序集具有对称链分解。
A poset is called a symmetric chain decomposition if the poset can be expressed as a disjoint union of symmetric chains.
本文中，我们证明了作为泛代数的半格的定义与作为偏序集的半格的定义是等价的。
In this paper, we proved that the definition of a semilattice as a universal algebra and the definition of a semilattice as a partial ordered set are equivalent.
通过定义离散化方案之间的偏序关系以及交、并运算，将各种离散化方案组织成离散格。
All discretization schemes are organized into a lattice named discretization lattice after partial order relation, then the meet and join operations between discretization schemes are defined.
该算法采用浮点编码方式，定义了二元实向量类型的适应值及适应值间的严格偏序关系。
The system uses real-number encoding, and defines the fitness value by a two-dimensional vector, inducing a strict partial ordering on the population individuals.
通过对选择试验的研究，在视野规律和选项分布之间导出了一对变换，称其为偏序变换。
It was named as preferential transformation, which offered a mean to study the rule of monotone distributions.
特别地，我们还讨论了序零半群，给出了这类半群与偏序半群上的左整除关系链的关系。
In the paper we introduce the concepts of L-trivial, nil ordered semigroups and give every ordered semigroup is L-trivial if and only if the left divisibility relation is an order.
最后通过定义一组拆分关系与子部件偏序关系之间的对应规则来得到子部件的全序关系。
The totally-ordered relations between subcomponents are retrieved by defining the corresponding rules between decomposed relations and a poset of subcomponents.
最后通过定义一组拆分关系与子部件偏序关系之间的对应规则来得到子部件的全序关系。
The totally-ordered relations between subcomponents are retrieved by defining the corresponding rules between decomposed relations and a poset of subcomponents.
应用推荐