查询词典 Boolean value

Boolean - return a constant boolean, true or false.

布尔--返回一个常量布尔，真或假

The decomposition theorem becomes a bridge connecting fuzzy matrix theory with Boolean matrix theory, so we start this problem from Boolean matrix.

由于分解定理建立了模糊矩阵和布尔矩阵之间的桥梁，所以我们首先从布尔矩阵开始对这个问题展开研究。

On the other hand, it is expressible as a Boolean expression if you accept including function calls in the Boolean expression.

但换个角度，如果你允许在布尔表达式中植入包含函数调用，则它就是一个布尔表达式可表述的属性。

The Boolean has_key and the in and not in operators are Boolean, returning True if a dictionary has that key and False otherwise.

布尔类型的has_key 和 in 或 not in 操作符都是布尔类型的。如果字典中有该键就返回真，否则返回假。

False.译者:原文: The Boolean has_key and the in and not in operators are Boolean, returning True if a dictionary has that key and False otherwise.

修改为：对布尔类型的方法has_key和in 或 not in 操作符而言，如果字典中有该键，执行has_key方法、in或not in操作符会返回真，否则返回假。

Finally, the author proves the sharp bound for the indices of convergence of n*n reducible Boolean matrices with f〓≥2 the writer lets f〓 be the greatest common divisor of the distinct lengths of the elementary cycles of the associated digraph D (A for a reducible Boolean matrix A , and characterizes the matrices with the largest index.

最后，设f〓为可约布尔矩阵A的伴随有向图D的所有圈长的最大公约数，当f〓≥2时，我们得到了可约布尔矩阵幂敛指数的一个上界和达到最大幂敛指数的矩阵的完全刻划。

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图确定层叠滤波器最简正布尔函数的算法。

Actually function-tree is an application of Boolean theory. Function-tree can be optimized by using absorptive law and idempotent law in Boolean algebra to remove redundant information.

功能树本质上可视为是布尔代数理论的一种应用，从而利用布尔代数的吸收律、幂等律来消除功能树中的冗余信息，对功能树进行优化处理。

The synopsis of Boolean operation's research status quo is offered, and a Boolean operation algorithm based on inner point recognition on the basis of Wu Yunxing's edge recognition is put forward.

摘要论文对二维布尔运算的研究现状进行了概述，在武运兴边界识别算法的基础上提出了一种基于"内点"识别的布尔运算算法。

Pachomius manual labour was organized as an essential part of the monastic life; and since it is a principle of the monks as distinguished from the mendicants, that the body shall be self-supporting, external work of one sort or another has been an inevitable part of the life ever since.

根据圣pachomius体力劳动组织作为一个重要组成部分寺院生活；以来，这是一个原则的和尚，作为有别于乞丐，该机构应自支撑，对外工作的这种或那种已一个必然的一部分，生活至今。

In order to study the effects of parametrical rolling on the ship movement and tilts, in allusion to ship's navigating in regular following waves, the equation of ship rolling motion is transformed into normal Mathieu equation by proper variable replacement when strong parametrical excitation in restoring moment varied according to sine or cosine wave.

为研究参数横摇对船舶运动和倾覆的影响，通过对船在规则波上随浪航行时，恢复力矩中出现的1个以正余弦规律变化的强参数激励项进行适当的变量置换，将船舶的横摇运动方程转换成标准形式的Mathieu方程。