Whereas the OR function is equivalent to Boolean addition, the AND function to Boolean multiplication, and the NOT function to Boolean complementation, there is no direct Boolean equivalent for Exclusive-OR.
此外鉴于或功能相当于布尔，与功能，以布尔繁殖，并无法正常运作，以布尔互补，没有直接的布尔相当于为异或。
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建立任何布尔函数）。
According to the operation regulations of Boolean SUBTRACTION, DIVISION and NOT, the standard DOS and SOD expansions of an arbitrary logic function in these complete sets were deduced from the minterm expansion and maxterm excpansion in AND-OR-NOT algebraic system.
从与－或－非代数系统中的最小项、最大项展开式出发，推导了任意逻辑函数在减－除－非代数系统中的标准DOS和标准SOD展开式。
BOSC method is independent of Boolean function's common structural representation, and has the worst time complexity propotional to cube of the number of input variables, so it is suitable for combinational macro-cell matching.
BOSC方法不依赖于布尔函数通常的结构表示，最坏时间复杂性与输入变量数的立方成正比，适用于结构匹配方法失败的组合逻辑宏单元匹配。
Boolean addition is equivalent to the OR logic function, as well as parallel switch contacts.
布尔加法与或逻辑函数以及平行开关触点是等效的。
Through making use of the function of PLC such as automatic control, Boolean calculation, and using human-machine interface, we can change procedure and parameter and operate directly on the human-machine interface, so that it can be controlled flexibly and make the operation of the equipment more convenient and more humanity.
介绍了弯管机弯管半径及长度为可调参数的新方法，利用可编程控制器的自动控制和逻辑运算的优点，直接在人机界面上操作PLC的程序及参数，达到灵活控制设备运行的目的，并使设备操作更方便，更富有人性化。
The canonic OC expansion of the first-order Boolean partial derivative of the OC type logic function was discussed.
讨论了OC型逻辑函数一阶布尔偏导数的规范OC展开式。
By means of Boolean matrix operation method, a study is made of defining the prime implicant of multi output function and the operation routine of the method is illustrated with some examples.
运用布尔矩阵运算的方法对确定多输出函数的质蕴涵进行了研究，并通过示例说明了这种方法的运算程序。
The two-button dialog function returns a Boolean and the three-button dialog function returns an enumerated value indicating which button was pressed.
双按钮对话框函数返回一个布尔量，三按钮对话框函数返回一个枚举量并指示哪一个按钮被点中按下。
Using the concept of Boolean functions and combinatorics theory comprehensively, we investigate the construction on annihilators of Boolean functions and the algebraic immunity of symmetric Boolean functions in cryptography:Firstly, we introduce two methods of constructing the annihilators of Boolean functions, Construction I makes annihilators based on the minor term expression of Boolean function, meanwhile we get a way to judge whether a Boolean function has low degree annihilators by feature matrix. In Construction II, we use the subfunctions to construct annihilators, we also apply Construction II to LILI-128 and Toyocrypt, and the attacking complexity is reduced greatly. We study the algebraic immunitiy of (5, 1, 3, 12) rotation symmetric staturated best functions and a type of constructed functions, then we prove that a new class of functions are invariants of algebraic attacks, and this property is generalized in the end. Secondly, we present a construction on symmetric annihilators of symmetric Boolean functions.
本文主要利用布尔函数的相关概念并结合组合论的相关知识，对密码学中布尔函数的零化子构造问题以及对称布尔函数代数免疫性进行了研究，主要包括以下两方面的内容：首先，给出两种布尔函数零化子的构造方法，构造Ⅰ利用布尔函数的小项表示构造零化子，得到求布尔函数f代数次数≤d的零化子的算法，同时得到通过布尔函数的特征矩阵判断零化子的存在性：构造Ⅱ利用布尔函数退化后的子函数构造零化子，将此构造方法应用于LILI-128，Toyocrypt等流密码体制中，使得攻击的复杂度大大降低；通过研究(5，1，3，12)旋转对称饱和最优函数的代数免疫和一类构造函数的代数免疫，证明了一类函数为代数攻击不变量，并对此性质作了进一步推广。
The concepts of reduct of descriptor and its discernibility function are introduced, and an approach to compute the reducts of descriptor by using of Boolean reasoning techniques is given. From the reducts of descriptors, all the optimal decision rules contained in information systems can be derived.
引入描述子简化和约简的概念，给出描述子的区分函数，利用布尔推理理论求取描述子的约简，并由此获取信息系统的优化决策规则。
Finding the the essential prime implicants, This part determine the essential prime implicant that will form the boolean function we need.
寻找蕴涵的基本素，这部分确定的基本素蕴涵，这将成为我们需要的布尔函数。
Bent function is a class of the highest nonlinearity Boolean function, and Boolean function is the key in the cipher system.
Bent函数是一类具有最高非线性度的布尔函数，布尔函数是对称加密密码体制设计和分析的关键。
The Boolean logic function analysis is presented for binary morphological image processing, and a two-level cellular logic network architecture is proposed to implement the binary image processing.
在双值形态学像处理中，引入了布尔逻辑函数分析，并提出了用两级细胞逻辑网络结构来实现双值形态学像处理。
The paperdicusses expression forms and characteristics of product item tabular, and introducesexiting tabular methods systematically. Based upon these, the tabular methods ofdetecting symmetry (including partial negated variables) and calculating Booleandifference and Boolean partial derivative of RM type function are proposed.
本文讨论了模代数系统中的积项表的表示方法及其相应的性质，并系统地介绍了现有的表格方法，在此基础上提出了检测对称函数的表格方法和计算RM型逻辑函数布尔差分及偏导数的表格方法。
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.
功能树本质上可视为是布尔代数理论的一种应用，从而利用布尔代数的吸收律、幂等律来消除功能树中的冗余信息，对功能树进行优化处理。
As to the Boolean Function in binary field, We studied its Non-linearity, Linearity Structure, Output Bit Independence Criterion, Balance, Completeness, Strict Avalanche Criterion, Propagation Criterion, Correlation Immunity, Linear Approximation Table and XOR Distribution Table.
对于二元域上的布尔函数主要讨论了其非线性性、线性结构、比特独立准则、平衡性、完整性、雪崩准则、传播准则、相关免疫性、线性分布表及异或分布表等特性。
Finally, their applications in the logic synthesis based on the partial linear function and calculating Boolean difference of logical functions are discussed.
最后讨论了它们在逻辑综合以及计算逻辑函数的布尔差分中的应用。
Definition and research of disjoint product sum minimization from the point of view of Boolean function coverage, and proof of three theorems as well as putting forward a recurrent formula.
从布尔函数覆盖的角度定义和研究了最小不交化问题，给出并证明了几个有关的定理，并提出一个求布尔函数最小不交积之和的递推计算原理及公式； 3。
Firstly, it divides the input point models by octree. Then it transforms the models to implicit function represented signed distance field. Finally through the implicit surface Boolean operation method to exclude the extra point, a wanted new point model is obtained.
该方法首先将输入点模型进行空间八叉树划分，然后采用RBF将点模型隐式化生成隐函数表示的符号距离场，最后通过隐式曲面的布尔运算方法剔除多余的点，得到需要的新点模型。