15442120
Digital City Shanghai: Concepts, Foundations, and Current State
The fastest developing city in China is Shanghai; its annual growth rate (GDP) exceeded 11.9% average in every year from 1992 and GDP per person in 2003 reached 4909 USD. Economists, industries and the government have been considering how to keep Shanghai developing in a sustainable manner. In 1994, the Shanghai Municipal Government put forward the concept of information harbor and set the goal of establishing a series of information infrastructures in the following five years. The Shanghai city informatization project started in 1999, and by the end of 2001 it had spread across Shanghai. At the same time, some applications based on Internet technologies were designed and developed. In the beginning of 2002, based on the current information infrastructures and systems, Shanghai Municipal Government announced the Digital City Shanghai strategy. This chapter will introduce the background of the Digital City Shanghai project, the current state of the information infrastructure in Shanghai, and the concept of system design & user interface. The Digital City Shanghai project will be described in four parts: Spatial Data Infrastructure, City Informatization, Shanghai City Grid, and Shanghai Logistics Information Platform. We will also introduce some research projects. In addition to the strategy, we describe and discuss social perspective and problems.
18207470
Supporting intercultural collaboration: an agent coordination workflow model
Workflow management has already been worldwide accepted due to its capability to make organizations model and control work processes effectively and efficiently in a distributed environment. Currently, most of the workflow management systems (WfMSs) are lack of a coordination mechanism across different organizations. We first propose an intercultural collaboration workflow process definition and then propose an agent coordination workflow model based on the consideration of cultural factors in intercultural collaboration work process modeling.
8110502
Data Management in RFID Applications
Nowadays, RFID applications have attracted a great deal of interest due to their increasing adoptions in supply chain management, logistics and security. They have posed many new challenges to existing underlying database technologies, such as the requirements of supporting big volume data, preserving data transition path and handling new types of queries. In this paper, we propose an efficient method to manage RFID data.We explore and take advantage of the containment relationships in the relational tables in order to support special queries in the RFID applications. The experimental evaluation conducted on an existing RDBMS demonstrates the efficiency of our method.
5467372
Organizing and Searching the World Wide Web of Facts - Step One: The One-Million Fact Extraction Challenge
Due to the inherent difficulty of processing noisy text, the potential of the Web as a decentralized repository of human knowledge remains largely untapped during Web search. The access to billions of binary relations among named entities would enable new search paradigms and alternative methods for presenting the search results. A first concrete step towards building large searchable repositories of factual knowledge is to derive such knowledge automatically at large scale from textual documents. Generalized contextual extraction patterns allow for fast iterative progression towards extracting one million facts of a given type (e.g., Person-BornIn-Year) from 100 million Web documents of arbitrary quality. The extraction starts from as few as 10 seed facts, requires no additional input knowledge or annotated text, and emphasizes scale and coverage by avoiding the use of syntactic parsers, named entity recognizers, gazetteers, and similar text processing tools and resources.
9541345
Principle-Based Parsing without Overgeneration
Overgeneration is the main source of computational complexity in previous principle-based parsers. This paper presents a message passing algorithm for principle-based parsing that avoids the overgeneration problem. This algorithm has been implemented in C++ and successfully tested with example sentences from (van Riemsdijk and Williams, 1986).
16280855
Indexing Fast Moving Objects for kNN Queries Based on Nearest Landmarks
With the rapid advancements in positioning technologies such as the Global Positioning System (GPS) and wireless communications, the tracking of continuously moving objects has become more convenient. However, this development poses new challenges to database technology since maintaining up-to-date information regarding the location of moving objects incurs an enormous amount of updates. Existing indexes can no longer keep up with the high update rate while providing speedy retrieval at the same time. This study aims to improve k nearest neighbor (kNN) query performance while reducing update costs. Our approach is based on an important observation that queries usually occur around certain places or spatial landmarks of interest, called reference points. We propose the Reference-Point-based tree (RP-tree), which is a two-layer index structure that indexes moving objects according to reference points. Experimental results show that the RP-tree achieves significant improvement over the TPR-tree.
6230479
Efficient indexing of the historical, present, and future positions of moving objects
Although significant effort has been put into the development of efficient spatio-temporal indexing techniques for moving objects, little attention has been given to the development of techniques that efficiently support queries about the past, present, and future positions of objects. The provisioning of such techniques is challenging, both because of the nature of the data, which reflects continuous movement, and because of the types of queries to be supported. This paper proposes the BBx -index structure, which indexes the positions of moving objects, given as linear functions of time, at any time. The index stores linearized moving-object locations in a forest of B+ -trees. The index supports queries that select objects based on temporal and spatial constraints, such as queries that retrieve all objects whose positions fall within a spatial range during a set of time intervals. Empirical experiments are reported that offer insight into the query and update performance of the proposed technique.