China Digital Ocean Prototype System

Abstract

Digital Ocean is a new research domain of Digital Earth. Because of the spatio-temporal, three-dimensional (3D) and intrinsically dynamic nature of ocean data, it is more difficult to make a breakthrough in this domain. The construction of the China Digital Ocean Prototype System (CDOPS) pushes Digital Ocean a step forward from its operation as a mere concept to its achievement as a realistic system. In this paper, the technical framework of the CDOPS is discussed, including its data, function, and application layers. Then, two key technologies are studied in detail that will enable the construction of the 3D ocean environment and the visualization of the ocean model output data. Practical demonstrations show that the CDOPS provides a technical reference for the development of Digital Ocean. This paper is based on an ongoing research project of the development of CDOPS that aims at the facilitation, integration, sharing, accessing, visualization, and use of the ocean data and model computing data from the Digital Earth perspective.     

Enrichment of topographic road database for the purpose of routing and navigation

With growing demand on multi-purpose or multi-modal navigation, the route calculation needs to traverse semantically enriched road networks for different transportation modes. Currently, operational route planning algorithms reveal rather limited performances or their potential for comprehensive applications are constrained by the unavailable or insufficient interoperation among the underlying geo-data that are separately maintained in different spatial databases. To overcome this limitation, a novel approach has been proposed to integrate the routing-relevant information from different data sources, which involves three processes: (1) automatic matching to identify the corresponding road objects between different datasets; (2) interaction to refine the automatic matching result; and (3) transferring the routing-relevant information from one data-set to another. In process (1), the Delimited Stroke Oriented algorithm is employed to achieve the automatic data matching between different datasets, which has revealed a high matching rate and certainty. However uncertain matching problems occur in areas where topological conditions are too complicated or inconsistent. The remaining unmatched or wrongly matched objects are treated in process (2), with the help of a series of interaction tools. On the basis of refined matching results after the interaction, process (3) is dedicated to automatic integration of the routing-relevant information from different data sources.     

Performance optimization of grid aggregation in spatial data warehouses

The problem of storage and querying of large volumes of spatial grids is an issue to solve. In this paper, we propose a method to optimize queries to aggregate raster grids stored in databases. In our approach, we propose to estimate the exact result rather than calculate the exact result. This approach reduces query execution time. One advantage of our method is that it does not require implementing or modifying functionalities of database management systems. Our approach is based on a new data structure and a specific model of SQL queries. Our work is applied here to relational data warehouses.     

Blending Aggregation and Selection: Adapting Parallel Coordinates for the Visualization of Large Datasets

Abstract

Many of the traditional data visualization techniques, which proved to be supportive for exploratory analysis of datasets of moderate sizes, fail to fulfil their function when applied to large datasets. There are two approaches to coping with large amounts of data: data selection, when only a portion of data is displayed, and data aggregation, i.e. grouping data items and considering the groups instead of the original data. None of these approaches alone suits the needs of exploratory data analysis, which requires consideration of data on all levels: overall (considering a dataset as a whole), intermediate (viewing and comparing collective characteristics of arbitrary data subsets, or classes), and elementary (accessing individual data items). Therefore, it is necessary to combine these approaches, i.e. build a tool showing the whole set and arbitrarily defined subsets (object classes) in an aggregated way and superimposing this with a representation of arbitrarily selected individual data items.

We have achieved such a combination of approaches by modifying the technique of parallel coordinate plot. These modifications are described and analysed in the paper.     

Exhibiting the Exhibitors: Spatial Visualization for Heterogeneous Cinema Venue Data

Abstract

Cinema data is characteristically complex, heterogeneous and interlinked. Rather than relying on simple information retrieval techniques, researchers are increasingly turning to the creative exploration and reapplication of data in order to more fully explore the meaning of newly available and diverse data sets. In this context, the cinema historian becomes the creator of visual texts which can be assessed for both their interpretive insight and their aesthetic qualities. This paper presents four research projects that use different spatio-temporal visualization techniques to understand the industrial dynamics of post-war film exhibition and distribution in Australia. The research integrates work by a group of inter-disciplinary investigators into the effectiveness of techniques such as dendritic mapping, Circos circular visualizations, animation, cartogram mapping, and multivariate visualization for the study of cinema circuits and operations at a number of scales.     

引潮位的Doodson规格化展开及其精度评定

基于引潮位Doodson规格化展开的基本原理以及ELP/MPP02月球历表、Newcomb太阳历表的结构,设计了一个用以代表三角函数的数据结构;并由此自定义了三角函数的乘法与加法算法,将月球、太阳引潮位分别展开至5阶、3阶,振幅绝对值截断阈值为10-7,在展开过程中对"伪波"进行"滤波"处理后,最终得到包含4 686项展开式的引潮位展开表(其中振幅绝对值超过10-6的展开式有2 441项)。以德国BFO(Black Forest Observatory)测站为例,基于DE431历表,通过天球参考系变换计算得到1950—2050年间时间间隔为1 h的法向引潮力基准序列BFDE431;并根据各个引潮位展开表计算得到相应的法向引潮力序列;通过与BFDE431基准序列求差,得到各个差值序列的统计值。计算结果表明,文中给出的展开表对应的差值序列数值在±58×10~(-11)m·s~(-2)(nGal)以内,均方差为12.5×10~(-11)m·s~(-2),与XI89展开表的精度相当。但由于没有考虑行星及地球扁率的影响,仍未达到HW95和RATGP95展开表的精度水平。     

面向不同主题的交通大数据可视分析

大数据时代,交通数据如何更快更准确地实时反映交通状况成为研究热点。使用不同交通数据对不同的研究主题进行可视分析,进而揭示蕴含的交通信息知识,为交通部门提供决策支持。首先,分析了大数据的基本特征,总结了大数据可视分析的研究现状;其次,对交通大数据的基本构成、获取方式及数据类型特点进行详细描述;最后,按照不同的研究主题选择不同的数据源与不同的可视化表达方式,揭示不同研究主题蕴含的交通规律,为交通大数据的自动模型分析提供可靠的可视化知识。     

三维地图式可视化大数据

数据可视化技术利用计算机图形图像学以及数据挖掘技术,以交互方式将数据中的隐藏信息展示给用户,为用户决策提供参考。近年来,随着PC计算能力与互联网技术的快速发展,传统的数据可视化技术已无法满足人们日益增长的信息处理需求。目前,数据可视化在可视化过程中存在显示结果精确度低、表达方式单一、不能突出数字信息内含的规律性等问题。本文针对上述问题提出了基于三维地图的可视化大数据解决方案,该方案通过制作专题地图可视化数据,对数据的规律性进行了研究,从而方便用户理解数据的深层次信息,发现隐藏的特征、模式、趋势等信息。     

嵌入式Web服务器的Android空间数据离线解决方法

针对移动GIS应用商业开发组件难以进行自由定制与分发的问题,该文提出一种基于嵌入式Web服务器的Android移动端空间数据离线解决方法,该方法通过在Android设备中移植开源的NanoHTTPD服务器实现了地图瓦片服务和矢量要素服务,并通过编码读取bundle切片数据包和扩展Spatialite空间数据库的方式,解决了切片数据和矢量要素数据的存储,然后利用Webview控件内嵌HTML5页面加Leaflet地图库完成了前端功能实现,并进行了实际应用展示。该方案的实现可节省Android端移动GIS应用开发成本,具有推广意义。     

一种基于三角函数的矢栅地理数据可逆几何脱密模型

矢栅地理数据是基础地理信息数据的重要组成部分,其安全保护研究十分重要。我国有关法律法规对公开版地图的脱密几何精度有明确规定,基础地理数据需要脱密后才能公开共享使用。本文在分析三角函数脱密特性和矢栅地理数据特征的基础上,顾及矢栅地理数据叠加使用的特点,设计了一种基于三角函数的矢栅地理数据一体化的可逆脱密模型。试验证明,该模型较好地保持了地理实体的拓扑关系,脱密处理速度快,安全性高,误差可控,数据接边好。