查询词典 generalized Boolean algebra

Zadeh put forward, make MTL-algebra"s filter conception fuzzified, provide the conceptions and properties of fuzzy filter, obtain the structure of all fuzzy, filters, prove that the set of all fuzzy filters forms a complete distribution lattice; Provide several fuzzy Boolean filter"s equivalent forms, introduce fuzzy positive implicative filter, fuzzy obstinate filter and fuzzy ultra filter, discuss some property characteristics and terms that transform each other under certain terms to obtain them.

Zadeh提出的模糊集思想使MTL-代数的滤子概念模糊化，给出了Fuzzy滤子的概念和性质，得到了全体Fuzzy滤子的结构，证明了全体Fuzzy滤子之集构成完备的分配格；给出了Fuzzy布尔滤子的若干等价形式，并且引入了Fuzzy正蕴涵滤子，Fuzzy固执滤子和Fuzzy超滤的概念，得出了它们的一些性质特征以及在一定条件下之间相互转化的条件。

10 Chapter 3 Number Systems and Boolean Algebra 3.1.2 Positional Notation In the decimal system, positions to the right of the decimal point have negative powers.

在十进制系统中，对于十进制小数点右边的位，在十进制系统中，对于十进制小数点右边的位，它的幂为负十进制小数点右边第一位数的值为10-1，或0.1。

Presents an algorithm for generating the sum of disjoint products by using binary decision diagram as well as certain ordering role of paths and Boolean algebra formulas.

利用二分决策图，同时采用道路排序技巧及布尔代数运算给出了求不交和的方法，它比单纯采用二分决策图的算法更简单，不交和的项数更少，从而得到一个求网络可靠度的有效算法。

The second motivation is the replacement of a Boolean algebra of sets by the distributive lattice of filters of a finite partially ordered set.

一个自然的问题是：能否给出射影空间中放置不同维数的线性族类似的公理体系？

Analysis for testability is widely used in DFT and test pattern generation, but most testability analysis algorithms have the shortcoming of either inaccuracy or being too complicated. A new method to calculate the signal probabilities of the nodes in IC is pre-sented in Chapter 7 of this dissertation. The signal probabilities by our method is more exact than by the previous ones. A symbol of the signal probability at the fan-out node is created and is propagated to the RFON (Reconvergent Fan-out Nodes). At the RFON, the expression containing the symbol is simplified using the rule which corresponds to the law of identity in Boolean algebra. After the expression is simplified, the symbol is substituted with its numeric value. Theoretical analysis shows that this method is concise and has a low computing complexity.

可测试性分析在可测试性设计和测试生成中都有着广泛的应用，然而大部分的可测性分析方法都存在不精确或者过于复杂的毛病，在第七章中作者提出了一种新的计算IC电路节点的信号概率值的符号算法，该算法得出的信号概率值比用以往的算法法得出的要更准确，也更简洁，针对电路中的扇出节点重汇聚现象，我们在每一个扇出节点定义了一个信号概率的符号，在以后的计算中一直使用该符号参与计算，直到该符号传播至重汇聚处，利用一定的规则把含符号的表达式化简，再将符号的真实值代入，在计算符号概率的过程中定义了一个和布尔代数中的同一律相对应的运算规则，通过该运算规则，使得信号概率的结果更加准确，符号算法具有简洁方便，计算复杂度小的特点 4。

The course provides the fundamental concepts used in the design of digital systems, including the methodology to design the combinational and sequential circuits with Boolean Algebra, Karnaugh map, and the logic elements, such as basic logic gates, latches, and flip-flops,etc.

本课程在提供数位系统设计所须具备的基础能力，包括学习以布林代数、卡诺图来设计组合逻辑与序向逻辑电路的方法，以及培养基础逻辑元件的应用能力，包括基本逻辑闸、栓锁器、与正反器等等元件。

As a logic optimization method,the Boolean algebra was introduced for the analysis and simplification of complicated logic diagram and on-off control system.

本文通过火电厂开关量控制系统优化设计的分析，对逻辑优化的基本方法进行初步探讨。1容错逻辑设计方法仅根据被控设备的工艺要求设计逻辑，往往经不起实际运行的考验。

The results imply that the El algebra representation is more accurate than Boolean matrix representation and we can apply these results to study more complex structure of fuzzy concept.

这进一步说明概念的EI代数描述比布尔矩阵表示更细致更精确，从而可以进一步研究模糊概念的结构。

The results obtained in the thesis are as follows: Firstly, the thesis proves that the inner measure and outer measure which defined by Fagin and Halpern are a kind of random sets, generalizes the concept of random sets to Boolean algebra's, and hence establishes the theory of the generalization of random sets.

本文的主要结果如下：①本文证明了Fagin和Halpern提出的内、外测度可表示为一种随机集合，并把随机集合的概念从幂集合推广到了布尔代数上，从而提出了广义随机集合理论。

In Chapter 3,we classify a binary-coded individual space equivalently withthe help of the ideals of Boolean algebra and analyze the search capabilitiesof a new kind of algebraic crossover operator in these equivalence classes,thenprovide the algebraic representation of a type of genetic algorithms by usingthe permutation group,therefore we can derive a lot of new forms of geneticalgorithms.

第三章运用Boole代数的理想将二进制编码的个体空间进行等价分类，分析了一类代数杂交算子在这些等价类上的搜索能力；然后利用置换群给出一类遗传算法的代数表示，由此导出多种新形式的遗传算法，并给出其中两类算法形式的收敛性结果。

That's what makes this mod unique.

这也正是这个MOD独特。

I now feel furious and want to do something.

现在我觉得非常气愤，想做点什么。