boolean function发音

意思翻译

[数][计]布尔函数

相似词语短语

boolean logic───n.<数>布尔逻辑；布林逻辑

function───n.功能；[数]函数；职责；盛大的集会；vi.运行；活动；行使职责

leveling function───调平功能

basic function───基本功能；[数]基本函数

clasper function───扣合器功能

function generator───信号（函数）发生器；信号[函数]发生器

nucleolus function───核仁函数

trigonometrical function───三角函数

urethra function───尿道功能

双语使用场景

Resilient function is a natural generalization of correlation immunity Boolean function.───弹性函数是相关免疫布尔函数的自然推广。

This fragment is evaluated as a string, even if its value was a Boolean function.───这个片段被判断为字符串，即使它的值是Boolean函数。

In an XPath expression, comparing a string and a Boolean function can yield unexpected results.───在XPath表达式中，比较字符串和Boolean函数会得到非预期的结果。

A sufficient and necessary condition is given that the algebraic immunity of a Boolean function is not more than a fixed value.───借助覆盖向量刻画了代数免疫布尔函数的特征，给出布尔函数代数免疫不大于某确定值的充要条件。

After that the construction of resilient Boolean functions becomes an important direction of the research of Boolean function.───此后，弹性函数的构造一直是布尔函数研究中的一个重要工作。

Consider the unexpected result when a Boolean function is converted to a string and back again.───考虑Boolean函数转换成字符串以及再转换回来时会出现的非预期结果。

This paper presented a construction of Boolean function in odd variables with optimum algebraic immunity.───提出了递归构造奇数变元代数免疫最优布尔函数的一个方法。

It depicts the attack notion by using the low annihilators of a Boolean function to establish an equation group.───对利用布尔函数低次零化子建立低错方程组实施攻击的思想进行了阐述。

英语使用场景

A boolean function minimization system based on learning from examples called SWT is introduced in this paper.

The XMLEXISTS is a Boolean function that takes an XPath expression as input and returns FALSE if the XPath expression returns an empty sequence and TRUE otherwise.

Sentencedict.com is a sentence dictionary, on which you can find excellent sentences for a large number of words.

And more, the improved algorithm can be applied to constructing the low - degree Annihilators of Boolean function.

Boolean function reduction complete source code can be used directly.

BDD is a diagrammatic representation of Boolean function.

Based on the concept of correlation of annihilator, a new algorithm is proposed that allows to deciding whether a Boolean function has low degree annihilators successfully.

In minimizing a boolean function using the extraction method, the traditional steps are: getting the prime cover Z first; and then extracting the essential prime implicant from Z.

In some applications, we need to obtain the set of all satisfiable assignments of a Boolean function, in which assignments can not imply each other.