By normalizing the associated matrix of the graph, the computational cost on verifying the isomorphism of the subgraphs was effectively reduced. 该算法通过对关联矩阵的标准化，有效地降低了子图同构判断的代价。
Another new MV benchmarking lower bound is established, it can be acquired from the process data and diagonal interactor matrix. 建立了另一最小方差基准下界，此新下界可通过过程数据和对角关联矩阵得到。
