查询词典 boolean algebra

The redundant controller produces odd and even check code in setup time. After odd and even check code is calculated with Boolean function calculation, it is transformed into of Galois field. If the output of controller can satisfy odd and even check condition is checked with the function calculation to decide it exist fault or not.

该控制器在设定时间产生奇偶校验码，通过布尔函数逻辑运算转换成Galois域函数运算，检验其输出是否满足奇偶校验条件以判断是否存在故障。

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 。

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.

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

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个线性无关的元素。

When two expressions are combined by using comparison or logical operators, the resulting data type is Boolean and the value is one of the following: TRUE, FALSE, or UNKNOWN.

生成的表达式的数据类型、排序规则、精度和值由进行组合的两个表达式决定，并按每次两个表达式的顺序递延，直到得出最后结果。

A logical operation combining the values of two bits (0, 1) or two Boolean values that returns anchored or remains stationary.

与 联系两数据位的值(0，1)或两个 Boolean 值的逻辑操作符。

The statistical analysis of this large set of mutations has led us to propose a diagnostic strategy that should help with the molecular work-up of optic neuropathies.

这一大系列基因突变的统计学分析引导我们提出一个诊断策略，可以帮助我们对视神经病变进行分子学的诊断检查。

The results show that the pipe grouting changes the mechanical parameters of surrounding rocks to achieve the security of engineering objectives by reinforcing surrounding rocks and bolcking the water.

研究表明：小导管注浆一方面改变了围岩的力学参数，另一方面利用浆液的固结特性可以实现堵水和加固围岩的工程目标，使隧道在开挖过程中的安全得到保障。