We present an example to show that the decomposition of a bipartition matrix is not un.

Application of Extended Cut Sets Matrix in Fault Tree Rapid Analysis Strategy;

A new computation method has been brought forth by using the cut sets matrix in former non intersect FTA according to the former non intersect methods.

In order to overcomee the drawbacks of Apriori algorithm for mining maximum frequent itemsets,TIMV algo- rithm was proposed,which use three-dimensional itemsets matrix and vectors.

A uniform framework is built for a class of simplified strategies, in which the original optimized variables are connected with the aggregated ones through the aggregation matrix, so the on line optimization of MPC is turned into a low dimensional programming of aggregated variables or the aggregated matrix.