查询词典 Boolean

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.

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

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过程等概念，并在此基础上提出时序电路的敏化定理、波形多项式描述跳变数的定理以及波形多项式的多项式符号表示与运算的模型和数据结构。

On the design of algorithms, a novel exact hierarchical delay analysis method for general circuits is proposed; based on the sensitization theorem for sequential circuits, an exact minimizing clocking method is proposed; based on Boolean process, a waveform simulation method considering interconnecting delay for logic circuit and a parallel waveform simulation method are proposed; a new method that transforms bit-level waveform polynomial to word-level polynomial model is proposed; a multiple valued synthesis algorithm based on multiple valued Boolean process and a wire-centered delay synthesis policy are proposed, in which timing planning, floorplanning, wire planning and optimal clock skew in early design are considered; a two-layers channel routing method for minimizing crosstalk under grid mode is proposed; based on the transition numbers theorems for waveform polynomial, a new method for generation of test with noise effects is proposed.

算法设计方面，提出了一种精确的通用电路层次化延时分析方法；基于时序电路的敏化定理提出时序电路最小时钟周期精确确定方法；提出基于Boolean过程论的考虑互连延迟的逻辑电路波形模拟方法，在分析了波形模拟适合并行化基础上，进一步提出一种并行波形模拟算法；提出一种将位级电路波形多项式描述转化成字级多项式描述的新方法；提出一种基于多值Boolean过程的多值电路综合算法以及一种将前期设计定时规划、前期设计的布局规划和线网结构化方法及低偏移的时钟分配等技术相结合的面向互连延时的综合策略；提出一种串绕最小化的网格模式下的双层通道布线方法；从波形多项式描述跳变数的定理出发提出了一种考虑噪声效应的测试生成新方法。

To prove that we can construct any boolean function using only NAND gates, we needonly show how to build an inverter, AND gate, and OR gate from a NAND (sincewe can create any boolean function using only AND, NOT, and OR).

为了证明使用NAND门我们能够构造任何布尔函数，我们只需要展示如何从一个NAND建立一个转换，与门，或门（因为我们可以用AND，OR，NOT建立任何布尔函数）。

Chimborazo and Cotopaxi, took me by the hand.

越过琴博腊索山和科托帕克西山。

This car is in a good condition.

这辆车的状况很好。