查询词典 Boolean matrix

Finally, the equivalence properties between Boolean matrix representation and algebra representation of attribute reduction are proved.

建立了布尔矩阵与逻辑方程组的解和决策表中的属性集之间的关系；然后在此基础上给出了决策表中的粗糙集理论的布尔矩阵表示；最后证明了属性约简在布尔矩阵和代数两种不同表示下是等价的。

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.

运用布尔矩阵运算的方法对确定多输出函数的质蕴涵进行了研究，并通过示例说明了这种方法的运算程序。

On the AFS theory, we define a homomorphism mapping between the EI algebra and the ring of Boolean matrix.

在EI代数的子代数的基础上，对概念的EI代数表示和布尔矩阵表示进行了讨论。

The decomposition theorem becomes a bridge connecting fuzzy matrix theory with Boolean matrix theory, so we start this problem from Boolean matrix.

由于分解定理建立了模糊矩阵和布尔矩阵之间的桥梁，所以我们首先从布尔矩阵开始对这个问题展开研究。

The index of convergence for Boolean matrix A is the same as the index of convergence for the associated digraph D of A.

本论文对布尔矩阵和可约布尔矩阵的幂敛指数的上确界和指数集两个方面中的一系列问题进行了研究。

Finally, the author proves the sharp bound for the indices of convergence of n*n reducible Boolean matrices with f〓≥2 the writer lets f〓 be the greatest common divisor of the distinct lengths of the elementary cycles of the associated digraph D (A for a reducible Boolean matrix A , and characterizes the matrices with the largest index.

最后，设f〓为可约布尔矩阵A的伴随有向图D的所有圈长的最大公约数，当f〓≥2时，我们得到了可约布尔矩阵幂敛指数的一个上界和达到最大幂敛指数的矩阵的完全刻划。

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

The results imply that the El algebra representation is more accurate than Boolean matrix representation and we can apply these results to study more complex structure of fuzzy concept.

这进一步说明概念的EI代数描述比布尔矩阵表示更细致更精确，从而可以进一步研究模糊概念的结构。

On the basic theory, some concepts are proposed, such as partial derivative of waveform polynomial, waveform polynomial vector, delay matrix, multiple valued Boolean process, conditional sensitization, waveform distance with crosstalk and three-dimentional Boolean process. And based on these concepts, a sensitization theorem for sequential circuits and the transition numbers theorems for waveform polynomial are proposed; the model and data structure for the representation and manipulation of waveform polynomial are proposed.

基础理论方面，提出波形多项式偏导、波形多项式向量、延时矩阵、多值Boolean过程、条件可敏化、考虑串绕的波形距离及三维Boolean过程等概念，并在此基础上提出时序电路的敏化定理、波形多项式描述跳变数的定理以及波形多项式的多项式符号表示与运算的模型和数据结构。

It used the inner product and discriminant rule to concentrate the row vectors of boolean matrix step by step, so the frequent item sets of transaction databases can be inducted quickly and intuitively.

即通过向量的内积运算和判别准则逐步浓缩布尔矩阵的行向量，从而快速、直观地归纳出事务数据库的频繁项集。

But in the course of internationalization, they meet with misunderstanding and puzzlement.

许多企业已经意识到了这一点，但在国际化的进程中，仍存在一些误区与困惑。

Inorder toaccomplish this goal as quickly as possible, we'll beteamingup with anexperienced group of modelers, skinners, and animatorswhosenames willbe announced in the coming weeks.

为了尽快实现这个目标，我们在未来数周内将公布与一些有经验的模型、皮肤、动画制作小组合作。