查询词典 Boolean

With proving the isomorph between the function matrix algebra systems and the Boolean algebra s disjunction-conjunction systems,a method of extending the function matrix is proposed,and the expanding theorem of the extended function matrix is proven.

提出了功能矩阵的概念，在证明功能矩阵的代数系统与布尔代数析取合取代数系统同构的基础上，对功能矩阵进行扩展，并证明了扩展功能矩阵的展开定理；利用扩展功能矩阵逐步展开与约简，实现了功能的求解算法。

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 。

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个相邻强连通分支有路径连接，给出了计算最大极限环长度的方法，通过激发模式的变化，逐渐减少强连通分支的个数，直到只有两个分支。

Lugalbanda was a god and shepherd king of Uruk where he was worshipped for over a thousand years.

Lugalbanda 是神和被崇拜了一千年多 Uruk古埃及喜克索王朝国王。

I am coming just now,' and went on perfuming himself with Hunut, then he came and sat.

我来只是现在，'歼灭战perfuming自己与胡努特，那麼，他来到和SAT 。