非完备集

Finally, in Chapter 4, we generalize the kq representation to 2N dimension. Based on Blocking theorem, the complete set of projectors on noncommutative Orbifold T〓/G are given.

第四章，我们建立了2N维空间的kq表象，证明了分块定理并由此构造出非对易可积Orbifold T〓/G上的投影算子完备集。

Finally, in Chapter 4, we generalize the kq representation to 2N dimension. Based on Blocking theorem, the complete set of projectors on noncommutative Orb-ifold T2N/G are given.

第四章，我们建立了2N维空间的kq表象，证明了分块定理并由此构造出非对易可积Orbifold T~(2N)／G上的投影算子完备集。

To solve this problem,the equivalence relation of rough set theory is replaced by an asymmetrical similar relation,and from this relation,an asymmetrical similar matrix is defined,then a new heuristic algorithm with less space complexity that require core and knowledge reduction based on asymmetrical similar matrix is proposed,and an example is given to confirm the validity of the algorithm.

用非对称相似关系代替粗糙集理论中的等价关系，定义了非对称相似差别矩阵，提出了基于非对称相似差别矩阵的高效求核和知识约简算法。该算法无需改变初始不完备信息系统的结构，能直接处理缺省数据。实验结果表明，新算法所获得的决策规则简洁、高效，与缺省值无关。

But we don't care about Battlegrounds.

但我们并不在乎沙场中的显露。

Ah! don't mention it, the butcher's shop is a horror.

啊！不用提了。提到肉，真是糟透了。