基于电子地图的GPS车辆导航系统研究

从电子地图具有的优点出发,结合GPS技术,简单地介绍了车辆导航系统应用于交通管理中的几种模式;在车辆导航和信息系统结合的原理上系统地论述了GPS和GIS结合,通过地图匹配技术实现GPS车辆导航系统的方法。     

城市基础地理信息系统中大比例尺地形图分幅与编号

结合城市基础地理信息系统的特点和要求,在原有的地图分幅与编号方法的基础上,提出了一种新的城市基础地理信息系统的地图分幅与编号方法即数字编码法。详细介绍了该方法的规则、特点及其在计算机上的实现。     

Using GIS to Model and Forecast HIV/AIDS Rates in Africa, 1986–2010

In this article we draw on the power of geographic information systems (GIS) to examine the progression of HIV/AIDS in Africa for the period from 1986 to 2003. We use GIS for two purposes: (1) to transform and interpolate a set of annual point-based HIV/AIDS rates into area data; and (2) to extract or “mine” annual HIV/AIDS prevalence rates from the interpolated area (country) level maps. Once the rates are extracted from the GIS analysis we then model and forecast them into the near future (i.e., 2004–2010) by using the UNAIDS Estimation and Projection Package (EPP) software. The article offers an alternative grounded in geospatial analysis for yielding estimates of HIV/AIDS rates in Africa. Using incomplete sets of data for the period from 1986 to 2003, mean HIV/AIDS rates are generated from spatially interpolated data and future trends are estimated. The results indicate that the HIV/AIDS epidemic for many countries in Africa has reached the saturation or maturity level as evidenced by the typical S-shaped curves in the trends over time. As a matter of fact, some countries have begun to experience a sustained decline in the rates (e.g., Uganda, Burundi, Rwanda, and Zimbabwe).     

State Transformation,Policy Learning,and Exclusive Displacement in the Process of Urban Redevelopment in Taiwan

Abstract

This paper explores the dynamics behind the changing regimes of urban renewal and its social impacts in Taiwan. Before the 1980s, the state was willing to solely shoulder the job of urban renewal with a wholly supportive financial budget and land appropriation law, while in the 1990s it became financially overburdened due to its renewal policy. Around the year 2000, the state turned towards promoting urban regeneration as a key business model. Through this historical exposition, the Taiwanese story of state transformation in urban renewal policy brings two issues to the fore. The first issue is the learning process concerning the policy of public-private partnership (PPP) initiatives. Trans-border policy mobility connects and constitutes cities, such as Taipei, with other places, such as London, through visits and seminars attended by policy makers and experts. However, policy transferred from abroad is “localized” in the learning process and used to prioritize the regeneration of public lands in the urban area. The PPP model is transformed in the face of domestic political struggles. The second issue is the social exclusion as a result of property-led regeneration. Rather than playing the role of an impartial institutional moderator, the state privileged landowners and developers and sacrificed the rights of tenants to stay put. By doing so, the state secures political support from landowner-cum-citizens and initiates a political culture of property in which local citizenship is predicated on ownership.     

广州漱珠涌历史文化景观与旅游开发

位于广州海珠区西北部的漱珠涌在上世纪六七十年代已被覆盖改造成为地下排污渠,从此它作为一条河涌连同名字在广州地图上消失了。百年前,这条涌曾经十分繁华,时人称其不让秦淮。这一带是清代广州"河南"地区商业开发最早的区域,又是清代中国最早对外开放的旅游区之一,曾经蜚声海外。当年许多中外画家、摄影师、诗人和志书编撰者为后人留下了许多有关漱珠涌的文字与形象资料,使我们今天仍能窥得漱珠涌昔日的辉煌。为了让人们留住广州城市发展的这一份历史记忆,文中提出建设一个集休闲、娱乐、美食、购物、旅游于一体的漱珠涌历史文化旅游区,重现漱珠涌的历史文化风貌。这将是一个很大的系统工程。其中,如何治理漱珠涌污染,发挥漱珠涌在水利、生态、美学、休闲游憩等方面的综合功能,是一个困难而又必须解决的关键问题。     

A modified binary space partitioning tree for geographic information systems

We present a reactive data structure, that is, a spatial data structure with detail levels. The two properties, spatial organization and detail levels, are the basis for a geographic information system (GIS) with a multi-scale database. A reactive data structure is a novel type of data structure catering to multiple detail levels with rapid responses to spatial queries. It is presented here as a modification of the binary space partitioning tree that includes the levels of detail. This tree is one of the few spatial data structures that does not organize space in a rectangular manner. A prototype system has been implemented. An important result of this implementation is that it shows that binary space partitioning trees of real maps have O(n) storage space complexity in contrast to the theoretical worst case O(n² ), with n the number of line segments in the map.     

Designing sound in cybercartography: from structured cinematic narratives to unpredictable sound/image interactions

In this paper we draw on the analysis of sound in film theory in order to explore the potential that sound offers cybercartography. We first argue that the theoretical body developed in film studies is highly relevant to the study of sound/image relationships in mapmaking. We then build on this argument to develop experimental animated and interactive sound maps for the Cybercartographic Atlas of Antarctica that further explore the potential of sound for integrating emotional, cultural and political dimensions in cartography. These maps have been designed to recreate cinematic soundscapes, to provide contrapuntal perspectives on the cartographic image and to generate an aural identity of the atlas. As part of this experimental mapping, an innovative sound infrastructure is being developed to allow complex sound designs to be transmitted over the Internet as part of atlas content. Through this infrastructure the user can select as well as contribute his own sounds. The overall cartographic message is becoming less predictable, thus opening new perspectives on the way we design, interact with, and modify sounded maps over the Internet.     

Modeling the scale dependences of topological relations between lines and regions induced by reduction of attributes

The scale dependences of topological relations are caused by the changes of spatial objects at different scales, which are induced by the reduction of attributes. Generally, the detailed partitions and multi-scale attributes are stored in spatial databases, while the coarse partitions are not. Consequently, the detailed topological relations can be computed and regarded as known information, while the coarse relations stay unknown. However, many applications (e.g., multi-scale spatial data query) need to deal with the topological relations at multiple scales. In this study new methods are proposed to model and derive the scale dependences of topological relations between lines and multi-scale region partitions. The scale dependences of topological relations are modeled and used to derive the relations between lines and coarse partitions from the relations about the detailed partitions. The derivation can be performed in two steps. At the first step, the topological dependences between a line and two meeting, covered and contained regions are computed and stored into composition tables, respectively. At the second step, a graph is used to represent the neighboring relations among the regions in a detailed partition. The scale dependences and detailed relations are then used to derive topological relations at the coarse level. Our methods can also be extended to handle the scale dependences of relations about disconnected regions, or the combinations of connected and disconnected regions. Because our methods use the scale dependences to derive relations at the coarse level, rather than generating coarse partition and computing the relations with geometric information, they are more efficient to support scale-dependent applications.     

Beyond the epsilon band: polygonal modeling of gradation/uncertainty in area-class maps

A spatial modeling technique is proposed to represent boundary uncertainty or gradation on area-class maps using a simple polygon tessellation with designated zones of indeterminacy or transition zones. The transition zone can be conceptualized as a dual of the epsilon band, but is more flexible and allows for a wide range of polygonal configurations, including polygons with sinuous boundaries, spurs, three-way transition zones, and null polygons. The model is specified using the medial axis to capture the general shape characteristics of a transition zone. Graph theoretic representation of an extended version of the medial axis captures key junctions in both shape and classification and is used to identify well-formed transition zones that can be logically and unambiguously handled by the model. A multivariate classification surface is specified by first defining degrees or probabilities of membership at every point on the medial axis and transition zone boundary. Degrees or probabilities of membership at all other points are defined by linear interpolation. The technique is illustrated with an example of a complex transition zone, and a simple isoline representation that can be derived from the model is presented. The proposed modeling technique promises to facilitate expert characterization of soil formations, ecological systems, and other types of areal units where gradation and/or boundary uncertainty are prevalent.     

A new algorithm for distance cartogram construction

A distance cartogram is a diagram that visualizes the proximity indices between points in a network, such as time–distances between cities. The Euclidean distances between the points on the distance cartogram represent the given proximity indices. This is a useful visualization tool for the level of service of transport, e.g. difference in the level of service between regions or points in a network and its improvement in the course of time. The two previously proposed methods—multidimensional scaling (MDS) and network time–space mapping—have certain advantages and disadvantages. However, we observe that these methods are essentially the same, and the merits of both these methods can be combined to formulate a generalized solution. In this study, we first formulate the time–space mapping problem, which includes the key features of both of the above stated methods, and propose a generalized solution. We then apply this solution to the time–distances of Japan's railway networks to confirm its applicability.