GML is becoming the de facto standard for electronic data exchange among the applications of Web and distributed geographic information systems. However, the conventional query languages （e. g. SQL and its extended v...GML is becoming the de facto standard for electronic data exchange among the applications of Web and distributed geographic information systems. However, the conventional query languages （e. g. SQL and its extended versions） are not suitable for direct querying and updating of GML documents. Even the effective approaches working well with XML could not guarantee good results when applied to GML documents. Although XQuery is a powerful standard query language for XML, it is not proposed for querying spatial features, which constitute the most important components in GML documents. We propose GQL, a query language specification to support spatial queries over GML documents by extending XQuery. The data model, algebra, and formal semantics as well as various spatial Junctions and operations of GQL are presented in detail.展开更多
The solution of large sparse linear systems is one of the most important problems in large scale scientific computing. Among the many methods developed, the preconditioned Krylov subspace methods [1] are considered th...The solution of large sparse linear systems is one of the most important problems in large scale scientific computing. Among the many methods developed, the preconditioned Krylov subspace methods [1] are considered the preferred methods. Selecting an effective preconditioner with appropriate parameters for a specific sparse linear system presents a challenging task for many application scientists and engineers who have little knowledge of preconditioned iterative methods. The purpose of this paper is to predict the parameter solvability space of the preconditioners with two or more parameters. The parameter solvability space is usually irregular, however, in many situations it shows spatial locality, i.e. the parameter locations that are closer in parameter space are more likely to have similar solvability. We propose three spatial data mining methods to predict the solvability of ILUT which make usage of spatial locality in different ways. The three methods are MSC （multi-points SVM classifier）, OSC （overall SVM classifier）, and OSAC （overall spatial autoregressive classifier）. The experimental results show that both MSC and OSAC can obtain 90% accuracy in prediction, but OSAC is much simpler to implement. We focus our work on ILUT preconditioner [2], but the proposed strategies should be applicable to other preconditioners with two or more parameters.展开更多
基金Funded by the Youth Chengguang Project of Science and Technology of Wuhan City of China(No.20045006071-16)
文摘GML is becoming the de facto standard for electronic data exchange among the applications of Web and distributed geographic information systems. However, the conventional query languages （e. g. SQL and its extended versions） are not suitable for direct querying and updating of GML documents. Even the effective approaches working well with XML could not guarantee good results when applied to GML documents. Although XQuery is a powerful standard query language for XML, it is not proposed for querying spatial features, which constitute the most important components in GML documents. We propose GQL, a query language specification to support spatial queries over GML documents by extending XQuery. The data model, algebra, and formal semantics as well as various spatial Junctions and operations of GQL are presented in detail.
文摘The solution of large sparse linear systems is one of the most important problems in large scale scientific computing. Among the many methods developed, the preconditioned Krylov subspace methods [1] are considered the preferred methods. Selecting an effective preconditioner with appropriate parameters for a specific sparse linear system presents a challenging task for many application scientists and engineers who have little knowledge of preconditioned iterative methods. The purpose of this paper is to predict the parameter solvability space of the preconditioners with two or more parameters. The parameter solvability space is usually irregular, however, in many situations it shows spatial locality, i.e. the parameter locations that are closer in parameter space are more likely to have similar solvability. We propose three spatial data mining methods to predict the solvability of ILUT which make usage of spatial locality in different ways. The three methods are MSC （multi-points SVM classifier）, OSC （overall SVM classifier）, and OSAC （overall spatial autoregressive classifier）. The experimental results show that both MSC and OSAC can obtain 90% accuracy in prediction, but OSAC is much simpler to implement. We focus our work on ILUT preconditioner [2], but the proposed strategies should be applicable to other preconditioners with two or more parameters.
