查询词典 Boolean calculation

Var my_array:Array =; var deleteWasSuccessful:Boolean deleteWasSuccessful = delete my_array[0]; if delete my_array[1]; deleteWasSuccessful = delete my_array[0]; if delete my_array[2]; trace // outputs: undefined,undefined,ghi

下例说明如何将从 delete 返回的布尔值用作以后代码执行的条件。请注意，如果某项已被删除，则对该项再次调用 delete 将返回 false 。

Iseki , this theory contact to be suffused with universal algebra, group theory, ring theory, lattice theory,Boolean algebra,set point topology, toplogical algebra etc. we have already obtained the large quantity result to the research of the BCK algebra.

Iseki引入的代数系统，这一理论联系到泛代数、群论、环论、格论、布尔代数、点集拓扑和拓扑代数等，对BCK代数的研究已经取得了一大批的研究成果。

This method can find CS according to the relationship among inputs and outputs implied in the incidence matrix, finally using Boolean absorption law, idempotent law, or prime law to get MCS.

具体方法是在关联矩阵中按行、列查找所表达的输入、输出关系，直到找到基本事件，并将对应事件按"与"、"或"关系展开，这样可以直接从关联矩阵中得出割集，再按照布尔吸收律、等幂率或素数法求出最小割集。

This paper proposed a novel Boolean operations algorithm for point-sampled models based on implicit function transformation.

提出一种基于点取样模型的布尔运算算法。

Explaining the causes of infeasibility of Boolean formulae has theoretical importance and practical applications in various fields, such as formal verification and electronic design automation.

解释布尔公式不可满足的原因在诸如形式化验证与电子设计自动化等众多领域中都具有非常重要的理论与应用价值。

Explaining the causes of infeasibility of Boolean formula e has theoretical importance and practical applications in various fields,such as formal verification and electronic design automation.

解释布尔公式不可满足的原因在诸如形式化验证与电子设计自动化等众多领域中都具有非常重要的理论与应用价值。

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.

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

Firstly, the connection matrices are strongly connected Boolean matrix, it is shown that the maximum length of limit cycles for FBAM is the period index of the product of the connection matrices. Thus, the maximum limit cycle is reachable. Secondly, two strongly connected components are connected by walks, it is proved that the maximum length of limit cycles for FBAM is the max. of the period index of the two strongly connected components if they are prime, otherwise, it is the least common multiple of the two period index. Finally, n strongly connected component are connected in succession, the method for computing the maximum length is described. By different patterns are presented to the networks, diminishing the number of the strongly connected components until only two components.

第一，连接权矩阵为强连通布尔矩阵，此时模糊双向联想记忆网络的最大极限环长度为连接权矩阵乘积的周期指数，从而极限环具有可达性；第二，两个强连通分支有路径连接，此时如果两个强连通分支的周期指数互素，那么网络的最大极限环长度为其最大者，否则，网络的最大极限环长度就等于二者的最小公倍数；第三，n个相邻强连通分支有路径连接，给出了计算最大极限环长度的方法，通过激发模式的变化，逐渐减少强连通分支的个数，直到只有两个分支。

If deg f = n, then Rfc is an empty set. For all the functions of degree 2, Rf have at least 2n-1 vectors, when Rf is a linear subspace, the relationships between Rf and Lf are discussed . Boolean functions have no nonezero linear structure if and only if there are n linear independence vectors in f, the correlation of the vectors in ?

证明了，若degf=n，则R_f~c为空集，对于所有的二次布尔函数而言，均有R_f~c中的元素个数大于等于2~(n-1)，给出了R_f构成线性子空间时，R_f和L_f之间的关系，还给出布尔函数不含有非零线性结构的充分必要条件是ζ_f中含有n个线性无关的元素。

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容错逻辑设计方法仅根据被控设备的工艺要求设计逻辑，往往经不起实际运行的考验。

Chimborazo and Cotopaxi, took me by the hand.

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

This car is in a good condition.

这辆车的状况很好。