High dimensional data clustering,with the inherent sparsity of data and the existence of noise,is a serious challenge for clustering algorithms.A new linear manifold clustering method was proposed to address this prob...High dimensional data clustering,with the inherent sparsity of data and the existence of noise,is a serious challenge for clustering algorithms.A new linear manifold clustering method was proposed to address this problem.The basic idea was to search the line manifold clusters hidden in datasets,and then fuse some of the line manifold clusters to construct higher dimensional manifold clusters.The orthogonal distance and the tangent distance were considered together as the linear manifold distance metrics. Spatial neighbor information was fully utilized to construct the original line manifold and optimize line manifolds during the line manifold cluster searching procedure.The results obtained from experiments over real and synthetic data sets demonstrate the superiority of the proposed method over some competing clustering methods in terms of accuracy and computation time.The proposed method is able to obtain high clustering accuracy for various data sets with different sizes,manifold dimensions and noise ratios,which confirms the anti-noise capability and high clustering accuracy of the proposed method for high dimensional data.展开更多
By analyzing some existing test data generation methods, a new automated test data generation approach was presented. The linear predicate functions on a given path was directly used to construct a linear constrain sy...By analyzing some existing test data generation methods, a new automated test data generation approach was presented. The linear predicate functions on a given path was directly used to construct a linear constrain system for input variables. Only when the predicate function is nonlinear, does the linear arithmetic representation need to be computed. If the entire predicate functions on the given path are linear, either the desired test data or the guarantee that the path is infeasible can be gotten from the solution of the constrain system. Otherwise, the iterative refining for the input is required to obtain the desired test data. Theoretical analysis and test results show that the approach is simple and effective, and takes less computation. The scheme can also be used to generate path-based test data for the programs with arrays and loops.展开更多
Road horizontal alignment contains three elements: straight line,circular arc,and clothoid.In AutoCAD,clothoid can only be fitted by polyline or spline,and the graphics which are separated from the road data are indep...Road horizontal alignment contains three elements: straight line,circular arc,and clothoid.In AutoCAD,clothoid can only be fitted by polyline or spline,and the graphics which are separated from the road data are independent of each other.Therefore,it is necessary to develop a new curve for road horizontal alignment.Firstly,the differential approximation and series integration methods for clothoid were discussed.Secondly,the geometric formulae for road line which contain the three elements were derived as a whole.Then,the advantages and feasibility of customizing a road line class,which was derived from the curve base class,were analyzed based on ObjectARX(AutoCAD Runtime eXtension) techniques.Finally,the data structure and operations for the road line class were stressed.The experimental results show that the road line can integrate the road elements,graphics and data to implement the graphics-oriented design,which can be widely used in road alignment design.展开更多
The processing of nonlinear data was one of hot topics in surveying and mapping field in recent years. As a result, many linear methods and nonlinear methods have been developed. But the methods for processing general...The processing of nonlinear data was one of hot topics in surveying and mapping field in recent years. As a result, many linear methods and nonlinear methods have been developed. But the methods for processing generalized nonlinear surveying and mapping data, especially for different data types and including unknown parameters with random or nonrandom, are seldom noticed. A new algorithm model is presented in this paper for processing nonlinear dynamic multiple-period and multiple-accuracy data derived from deformation monitoring network.展开更多
Since the spherical Gaussian radial function is strictly positive definite, the authors use the linear combinations of translations of the Gaussian kernel to interpolate the scattered data on spheres in this article. ...Since the spherical Gaussian radial function is strictly positive definite, the authors use the linear combinations of translations of the Gaussian kernel to interpolate the scattered data on spheres in this article. Seeing that target functions axe usually outside the native spaces, and that one has to solve a large scaled system of linear equations to obtain combinatorial coefficients of interpolant functions, the authors first probe into some problems about interpolation with Gaussian radial functions. Then they construct quasi- interpolation operators by Gaussian radial function, and get the degrees of approximation. Moreover, they show the error relations between quasi-interpolation and interpolation when they have the same basis functions. Finally, the authors discuss the construction and approximation of the quasi-interpolant with a local support function.展开更多
基金Project(60835005) supported by the National Nature Science Foundation of China
文摘High dimensional data clustering,with the inherent sparsity of data and the existence of noise,is a serious challenge for clustering algorithms.A new linear manifold clustering method was proposed to address this problem.The basic idea was to search the line manifold clusters hidden in datasets,and then fuse some of the line manifold clusters to construct higher dimensional manifold clusters.The orthogonal distance and the tangent distance were considered together as the linear manifold distance metrics. Spatial neighbor information was fully utilized to construct the original line manifold and optimize line manifolds during the line manifold cluster searching procedure.The results obtained from experiments over real and synthetic data sets demonstrate the superiority of the proposed method over some competing clustering methods in terms of accuracy and computation time.The proposed method is able to obtain high clustering accuracy for various data sets with different sizes,manifold dimensions and noise ratios,which confirms the anti-noise capability and high clustering accuracy of the proposed method for high dimensional data.
文摘By analyzing some existing test data generation methods, a new automated test data generation approach was presented. The linear predicate functions on a given path was directly used to construct a linear constrain system for input variables. Only when the predicate function is nonlinear, does the linear arithmetic representation need to be computed. If the entire predicate functions on the given path are linear, either the desired test data or the guarantee that the path is infeasible can be gotten from the solution of the constrain system. Otherwise, the iterative refining for the input is required to obtain the desired test data. Theoretical analysis and test results show that the approach is simple and effective, and takes less computation. The scheme can also be used to generate path-based test data for the programs with arrays and loops.
基金Project(51108049)supported by the National Natural Science Foundation of ChinaProject(kfj090207)supported by Open Fund of Key Laboratory of Road Structure and Material of Ministry of Transport(Changsha University of Science and Technology),China
文摘Road horizontal alignment contains three elements: straight line,circular arc,and clothoid.In AutoCAD,clothoid can only be fitted by polyline or spline,and the graphics which are separated from the road data are independent of each other.Therefore,it is necessary to develop a new curve for road horizontal alignment.Firstly,the differential approximation and series integration methods for clothoid were discussed.Secondly,the geometric formulae for road line which contain the three elements were derived as a whole.Then,the advantages and feasibility of customizing a road line class,which was derived from the curve base class,were analyzed based on ObjectARX(AutoCAD Runtime eXtension) techniques.Finally,the data structure and operations for the road line class were stressed.The experimental results show that the road line can integrate the road elements,graphics and data to implement the graphics-oriented design,which can be widely used in road alignment design.
文摘The processing of nonlinear data was one of hot topics in surveying and mapping field in recent years. As a result, many linear methods and nonlinear methods have been developed. But the methods for processing generalized nonlinear surveying and mapping data, especially for different data types and including unknown parameters with random or nonrandom, are seldom noticed. A new algorithm model is presented in this paper for processing nonlinear dynamic multiple-period and multiple-accuracy data derived from deformation monitoring network.
基金supported by the National Natural Science Foundation of China(Nos.61272023,61179041)
文摘Since the spherical Gaussian radial function is strictly positive definite, the authors use the linear combinations of translations of the Gaussian kernel to interpolate the scattered data on spheres in this article. Seeing that target functions axe usually outside the native spaces, and that one has to solve a large scaled system of linear equations to obtain combinatorial coefficients of interpolant functions, the authors first probe into some problems about interpolation with Gaussian radial functions. Then they construct quasi- interpolation operators by Gaussian radial function, and get the degrees of approximation. Moreover, they show the error relations between quasi-interpolation and interpolation when they have the same basis functions. Finally, the authors discuss the construction and approximation of the quasi-interpolant with a local support function.
