查询词典 Boolean matrix

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

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

The article will mine Data-Item set compression to a Boolean Vector Matrix.The algorithm only needs to scan the database one time and rational use of data storage structure so that it would not generate a large number of candidate sets.

将挖掘的数据事务集压缩到一个布尔型向量矩阵中，只需扫描数据库一次，合理利用数据存储结构，且不会产生大量的候选集。

The concepts of weighted α-lower product and weighted α-upper product between a relation matrix and a Boolean column vector are presented in weighted approximation space.

在加权近似空间中提出了关系矩阵和布尔列向量加权α下乘法和加权α上乘法的概念。

Graph theory and topology was researched to establish graphic interpreter, boolean multiplication ⊙ of a matrix is inferred and defined, and simple sub-graphs are disconnected from complex graph by the multiplication ⊙; parameterization of graph is realized through a sequence of sub-graph entities linked by constraints.

研究了图形翻译器的图论和拓扑学理论基础，推出并定义了矩阵布尔乘运算〓，使用矩阵运算〓将复杂的图形拆分成一系列简单子图；以约束关联的子图实体序列实现图形的参数化。

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

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

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.

具体方法是在关联矩阵中按行、列查找所表达的输入、输出关系，直到找到基本事件，并将对应事件按"与"、"或"关系展开，这样可以直接从关联矩阵中得出割集，再按照布尔吸收律、等幂率或素数法求出最小割集。

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代数描述比布尔矩阵表示更细致更精确，从而可以进一步研究模糊概念的结构。

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.

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

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 he inducted quickly and intuitively.

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

Now he worked in ajoint venture.

现在他在一家合资企业工作。

More troops in Afghanistan won't change any of the foregoing.

更多的在阿富汗的军队也不会改变之前的状况。