An integrated heterogeneous web service retrieval via combination of instance- and metadata-based schema matching method

Schema matching is a critical step in the integration of heterogeneous web service, which contains various types of web services and multi-version services of the same type. Mapping loss or mismatch usually occurs due to schema differences in structure and content and the variety in concept definition and organization. Current instance schema matching methods are not mature enough for heterogeneous web service because they cannot deal with the instance data in web service domain and capture all the semantics, especially metadata semantics. The metadata-based and the instance-based matching methods, in the case of being employed individually, are not efficient to determine the concept relationships, which are crucial for finding high-quality matches between schema attributes. In this paper, we propose an improved schema matching method, based on the combination of instance and metadata (CIM) matcher. The main method of our approach is to utilize schema structure, element labels, and the corresponding instance data information. The matching process is divided into two phases. In the first phase, the metadata-based matchers are used to compute the element label similarity of multi-version open geospatial consortium web service schema, and the generated matching results are raw mappings, which will be reused in the next instance matching phase. In the second phase, the designed instance matching algorithms are employed to the instance data of the raw mappings and fine mappings are generated. Finally, the raw mappings and the fine mappings are combined, and the final mappings are obtained. Our experiments are executed on different versions of web coverage service and web feature service instance data deployed in Geoserver. The results indicate that, the CIM method can obtain more accurate matching results and is flexible enough to handle the web service instance data.     

Matching authority and VGI road networks using an extended node-based matching algorithm

The amount of volunteered geographic information (VGI) has increased over the past decade, and several studies have been conducted to evaluate the quality of VGI data. In this study, we evaluate the completeness of the road network in the VGI data set OpenStreetMap (OSM). The evaluation is based on an accurate and efficient network-matching algorithm. The study begins with a comparison of the two main strategies for network matching: segment-based and node-based matching. The comparison shows that the result quality is comparable for the two strategies, but the node-based result is considerably more computationally efficient. Therefore, we improve the accuracy of node-based algorithm by handling topological relationships and detecting patterns of complicated network components. Finally, we conduct a case study on the extended node-based algorithm in which we match OSM to the Swedish National Road Database (NVDB) in Scania, Sweden. The case study reveals that OSM has a completeness of 87% in the urban areas and 69% in the rural areas of Scania. The accuracy of the matching process is approximately 95%. The conclusion is that the extended node-based algorithm is sufficiently accurate and efficient for conducting surveys of the quality of OSM and other VGI road data sets in large geographic regions.     

MapGIS地质图到SuperMap格式转换的关键方法的实现

在国土GIS软件产品的开发中,各种专题图的制作是系统构建的重点,也是实现国土资源"矿政一张图"式管理的核心。目前,各级国土资源管理部门现有的图件资料多已MapGIS数据格式为主,其中以地质图的情况尤为突出。由于当前MapGIS数据格式与SuperMap格式无法直接实现转换,这就给产品的开发造成不便,导致人力成本和时间成本的增加。为此,本文提出了一种基于空间数据转换处理系统(FME)进行数据格式批量转换的方法,并通过设置实现对原图件颜色信息的获取。在此基础上,通过程序编写进一步将图件的颜色信息转换为XML格式的专题图文件。经过以上步骤,不仅实现了地质图从MapGIS格式到SuperMap格式的转换,而且还保留了原图件的配色方案。在减少工作量、缩短工作时间的同时,提高了专题图的实用性,为国土GIS软件产品在行业中的广泛应用奠定了扎实的基础。     

基于GIS与X3D的井眼轨迹三维模拟应用

分析了GIS和X3D相结合应用的技术特征,利用GIS与X3D开发了三维井斜图。以江苏油田某井为例,设计并实现了井眼轨迹的空间展示,提供井的设计与实钻轨迹、水平与垂直投影、靶区、邻井防碰等,实时掌握井轨迹信息,对于钻井作业具有重要的意义。     

气流输送对乌鲁木齐市PM10、PM2.5和PM1.0质量浓度的影响

应用聚类分析法,对乌鲁木齐市2009-2010年逐日气流72 h后向轨迹按季节进行分类,结合对应时段的PM10、PM2.5和PM1.0观测数据,分析了不同气流输送轨迹对研究区3粒径段气溶胶浓度的影响.结果表明:冬季,气流对研究区气溶胶的搬运、稀释作用明显,气溶胶浓度平均值与对应气流移动速度成反比;春季,流经沙漠区的气流分组对应气溶胶浓度平均值偏高,且气溶胶谱分布向粗模态移动;夏季,大气清洁,携带城市气溶胶的西北气流对研究区气溶胶浓度平均值影响较大,未携带外源物质的几组气流流速与气溶胶浓度基本呈负相关;秋季,研究区受外源气溶胶影响不大,且气流对污染物的输送、稀释作用也不强烈,各分组气溶胶浓度差别不大.     

基于非二次幂Curvelet变换的最小二乘匹配算法及其应用

本文提出了基于非二次幂Curvelet变换的最小二乘匹配算法.首先,根据输入地震信号的频谱和方向等特征进行非二次幂Curvelet变换,根据其特征不同,最大程度地将有效信号和噪声分开;然后,在噪声能量集中的非二次幂Curvelet子记录上对输入数据和预测的噪声模型进行最小二乘匹配滤波处理.本方法提高了常规最小二乘匹配算法在时间空间域内进行信噪分离的稳定性和准确性.对含有面波的实际地震数据进行测试,其结果表明本方法可以有效地压制面波干扰,特别是当面波和有效信号有交叉或重叠等现象出现时,能较好地保护反射同相轴信息.本方法还可用于对含自由表面多次波和层间多次波等地震数据进行自适应信噪分离.     

Movement similarity assessment using symbolic representation of trajectories

This article describes a novel approach for finding similar trajectories, using trajectory segmentation based on movement parameters (MPs) such as speed, acceleration, or direction. First, a segmentation technique is applied to decompose trajectories into a set of segments with homogeneous characteristics with respect to a particular MP. Each segment is assigned to a movement parameter class (MPC), representing the behavior of the MP. Accordingly, the segmentation procedure transforms a trajectory to a sequence of class labels, that is, a symbolic representation. A modified version of edit distance called normalized weighted edit distance (NWED) is introduced as a similarity measure between different sequences. As an application, we demonstrate how the method can be employed to cluster trajectories. The performance of the approach is assessed in two case studies using real movement datasets from two different application domains, namely, North Atlantic Hurricane trajectories and GPS tracks of couriers in London. Three different experiments have been conducted that respond to different facets of the proposed techniques and that compare our NWED measure to a related method.     

Ad hoc matching of vectorial road networks

In integration of road maps modeled as road vector data, the main task is matching pairs of objects that represent, in different maps, the same segment of a real-world road. In an ad hoc integration, the matching is done for a specific need and, thus, is performed in real time, where only a limited preprocessing is possible. Usually, ad hoc integration is performed as part of some interaction with a user and, hence, the matching algorithm is required to complete its task in time that is short enough for human users to provide feedback to the application, that is, in no more than a few seconds. Such interaction is typical of services on the World Wide Web and to applications in car-navigation systems or in handheld devices.

Several algorithms were proposed in the past for matching road vector data; however, these algorithms are not efficient enough for ad hoc integration. This article presents algorithms for ad hoc integration of maps in which roads are represented as polylines. The main novelty of these algorithms is in using only the locations of the endpoints of the polylines rather than trying to match whole lines. The efficiency of the algorithms is shown both analytically and experimentally. In particular, these algorithms do not require the existence of a spatial index, and they are more efficient than an alternative approach based on using a grid index. Extensive experiments using various maps of three different cities show that our approach to matching road networks is efficient and accurate (i.e., it provides high recall and precision).

General Terms:Algorithms, Experimentation     

An evaluation of ontology matching techniques on geospatial ontologies

Standardization is one of the pillars of interoperability. In this context, efforts promoted by the Open Geospatial Consortium, such as CityGML (Technical University, Berlin), a standard for exchanging three-dimensional models or urban city objects, are welcomed. However, information from other domains of interest (e.g. energy efficiency or building information modeling) is needed for tasks such as land planning, large-scale flooding analysis, or demand/supply energy simulations. CityGML allows extension in order to integrate information from other domains, but the development process is expensive because there is no way to perform it automatically. The discovery of correspondences between CityGML concepts and other domains concepts poses a significant challenge.

Ontology matching is the research field emerged from the Semantic Web to address automatic ontology integration. Using the ontology underlying CityGML and the ontologies which model other domains of interest, ontology matching would be able to find the correspondences that would permit the integration in a more automatic manner than it is done now.

In this paper, we evaluate if ontology matching techniques allow performing an automatic integration of geospatial information modeled from different viewpoints. In order to achieve this, an evaluation methodology was designed, and it was applied to the discovery of relationships between CityGML and ontologies coming from the building information modeling and Geospatial Semantic Web domains. The methodology and the results of the evaluation are presented. The best results have been achieved using string-based techniques, while matching systems give the worst precision and recall. Only in a few cases the values are over 50%, which shows the limitations when these techniques are applied to ontologies with a partial overlap.