An Approximating Algorithm on Reconstruction of Complicated Curved Surface

An approximating algorithm on handling 3-D points cloud data was discussed for reconstruction of complicated curved surface. In this algorithm, the coordinate information of nodes both in internal and external regions of partition interpolation was used to realize minimized least squares approximation error of surface fitting. The changes between internal and external interpolation regions are continuous and smooth. Meanwhile, surface shape has properties of local controllability, variation reduction, and convex hull. The practical example shows that this algorithm possesses a higher accuracy of curved surface reconstruction and also improves the distortion of curved surface reconstruction when typical approximating algorithms and unstable operation are used.     

一种基于位矩阵的负关联规则挖掘新算法

典型的关联规则仅考虑事务中所列举的项目,这样的规则主要是正关联规则.负关联规则不但要考虑事务中所包含的项目集,还要考虑事务中所不包含的项目,它有利于进行购物篮分析以发现那些相关的商品或互斥的商品.而已有的负关联规则挖掘的算法具有很大的局限性.为此,文中提出了一种基于位矩阵的负关联规则挖掘新算法.通过算例表明,该算法是有效可行的.