查询词典 Boolean operation

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.

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

On the basic theory, some concepts are proposed, such as partial derivative of waveform polynomial, waveform polynomial vector, delay matrix, multiple valued Boolean process, conditional sensitization, waveform distance with crosstalk and three-dimentional Boolean process. And based on these concepts, a sensitization theorem for sequential circuits and the transition numbers theorems for waveform polynomial are proposed; the model and data structure for the representation and manipulation of waveform polynomial are proposed.

基础理论方面，提出波形多项式偏导、波形多项式向量、延时矩阵、多值Boolean过程、条件可敏化、考虑串绕的波形距离及三维Boolean过程等概念，并在此基础上提出时序电路的敏化定理、波形多项式描述跳变数的定理以及波形多项式的多项式符号表示与运算的模型和数据结构。

"The operators will suffer a temporary decrease in the number of consumers and short message services as people may not like having to provide their ID cards for a phone number," Xu Junqi, vice-dean with the Policy-Making Institute of the Telecommunications Research Centre under MII, said yesterday.

信息产业部下属的通信决策研究院副主任徐俊其昨天说：&实行手机实名制后，人们可能不太情愿用身份证注册手机号，所以通信运营商会暂时面临用户减少和短信用户减少的问题。&

I don't believe in make-believe!

我不相信这些虚构的故事。