查询词典 hasse diagram

Hasse diagram is used to visualize the process, and the algorithm's time complexity can be reduced.

同时，该方法运用Hasse图解进行可视化操作，降低了算法的时间复杂度。

To solve this problem,this paper presents a new incremental algorithm for building concept lattice based on an ordered set direct product operation,this algorithm is suitable for the case of the insertion of a set of objects into the context,and it can construct the Hasse diagram of the concept lattice while generating the concept.

为了适应这种情况，基于偏序集的直积运算，提出了一种新的增量式概念格构造算法，这种算法可以一次性地加入一个对象集合，而且在生成概念的同时，能够构造出概念格的Hasse图，从而完全解决了上述问题。

That results in a new class of answer set semantics for ordered logic program including several kinds of already existed semantics. The diverse answer set semantics are compared in detail and a Hasse diagram with respect to set inclusive relations for the semantics is given.

通过证明和举例详细比较了各种回答集语义之间的强弱关系，给出了它们在集合包含关系意义下的哈斯图，证明了各种回答集语义在包含关系下形成格的结构。

It produces corresponding nonredundent rule by direct generalization of lattice's nodes; This paper also improves the incremental concept formation and Hasse diagram update and apply it to incremental rule generation. We give examples to illustrate the idea of the algorithm and corresponding experimental results. 6 Rough set theory and concept lattice are similar in some aspects, the relationship between them is interesting.

在概念格结构上提出了一种在一定条件下更有效的，在已建造好的概念格上提取规则的算法，这种方法主要依据格结点的直接泛化来产生相应无冗余规则；改进了一种的渐进式更新概念格与相应Hasse图的算法，并将之应用于渐进式规则生成。

Based on the definition of Boolean function on set and positive extension, The sufficient and necessary condition of PBF is proven. At last, an algorithm of generating MSP expression of stack filter positive Boolean function is presented taking advantage of Hasse diagram.

通过定义布尔函数开、闭集和最小项正、负扩展，证明了布尔函数具有层叠性的充要条件是布尔函数开集的正扩展或闭集的负扩展具有不变性，在此基础上，提出了一种通过Hasse图确定层叠滤波器最简正布尔函数的算法。

Based on the definition of Boolean function on set and positive extension, The sufficient and necessary condition of PBF is proven. At last,an algorithm of generating MSP expression of stack filter positive Boolean function ispresented taking advantage of Hasse diagram.

通过定义布尔函数开、闭集和最小项正、负扩展，证明了布尔函数具有层叠性的充要条件是布尔函数开集的正扩展或闭集的负扩展具有不变性，在此基础上，提出了一种通过Hasse图确定层叠滤波器最简正布尔函数的算法。

After the concept lattice have been built, the way of building concept with incremental algorithms is more convenient than batch algorithms with various dataset updates.The efficient algorithm among batch construction has been suggested by Bordat which generates both the concept set and the Hasse diagram of the lattice.

批处理算法主要用于在数据量较小或给定的数据集上的概念格的建造；此类算法主要有：Bordat的算法，Chein的算法，Gantcr的算法，Nourine的算法等；增量算法除了能实现批处理算法的功能外，对一已建成概念格，但是概念格的形式背景是动态的数据，当数据变动时需要重新建格，此时增量算法是更有利的算法。

This is not an ordinary box, which is used as a background picture of the dialog box, very pretty.

详细说明：这可不是一个一般的对话框，它是用图片作为背景的对话框，非常好看。

Conceal me what I am,and be my aid for such disguise as haply shall become the form of my intent.

遮掩我的身份，帮助我，我的面具将成为我的目的。