• The Transactions of the Korea Information Processing Society
• /
• v.6 no.1
• /
• pp.21-31
• /
• 1999

In this paper we study on an interface connection between spatial operators and temporal operators to support the unified operations for spationtemporal data. The integration development of the spatiotemporal operations will be defined as a common use of spatiotemporal relationship operators by spatiotemporal referencing macros. additionally we propose an integration algorithm of a history operator and temporal relationship operators. Then the proposed system will be implemented on the commercial GIS software and evaluated by examples of spatiotemporal query expressions. Here, our integration of spatial and temporal operators will provide spatiotemporal query expressions with a useful framework.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.5
• /
• pp.1219-1224
• /
• 1999

This paper derived Montgomery's parallel algorithms for modular multiplication based on Walter's and Iwamura's method, and compared data dependence graph of each parallel algorithm. Comparing the result, Walter's parallel algorithm has small computational index in data dependence graph, so it is selected and used to computed spatial and temporal pipelining diagrams with each projection direction for designing expansible bit-level systolic array. We also evaluated internal operation of proposed expansible systolic array C++ language.

• The KIPS Transactions:PartD
• /
• v.11D no.1
• /
• pp.11-22
• /
• 2004

As random access memory chip gets cheaper, it becomes affordable to realize main memory-based database systems. Consequently, reducing cache misses emerges as the most important issue in current main memory databases, in which CPU speeds have been increasing at 60% per year, compared to the memory speeds at 10% per you. In this paper, we design and implement a main-memory database system for real-time mobile GIS. Our system is composed of 5 modules： the interface manager provides the interface for PDA users； the memory data manager controls spatial and non-spatial data in main-memory using virtual memory techniques； the query manager processes spatial and non-spatial query : the index manager manages the MR-tree index for spatial data and the T-tree index for non-spatial index : the GIS server interface provides the interface with disk-based GIS. The MR-tree proposed propagates node splits upward only if one of the internal nodes on the insertion path has empty space. Thus, the internal nodes of the MR-tree are almost 100% full. Our experimental study shows that the two-dimensional MR-tree performs search up to 2.4 times faster than the ordinary R-tree. To use virtual memory techniques, the memory data manager uses page tables for spatial data, non- spatial data, T-tree and MR-tree. And, it uses indirect addressing techniques for fast reloading from disk.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.3 no.2
• /
• pp.61-72
• /
• 2000

The maturation of the Web technology has reshaped the ways in which data are accessed, disseminated, and shared. Thanks to its popularity along with the advance of spatial information technology, four major changes have been further made in traditional geographic information systems (GIS) in relation to access to data, distribution of data, access to GIS functionality, and visualization of multimedia data. Although access to and dissemination of spatial data over the Web has in recent years been addressed in the literature, little research effort has addressed the issue of access to and processing of GIS analysis functions over the Web. This research explores the potential use of Web-based GIS in improving accessibility to distributed spatial data and spatial modeling tools. A prototype Web-based GIS developed in this study focuses on Web-based location-allocation modeling for spatial decision support, and employs a hybrid approach that uses the Arc/Info software as a GIS server and CGM viewer as a client-side plug-in. This research shows that Web-based GIS is a useful vehicle in conducting spatial modeling in the particular user community. In addition, this study represents the possibility of Web-based GIS in developing open spatial decision supporting systems.

• Journal of KIISE:Databases
• /
• v.30 no.3
• /
• pp.286-295
• /
• 2003

The shape of query windows for spatial selection queries is a rectangle in many cases. However, it can be issued for spatial selection queries with not only rectangular query widow, but also polygonal query window. Moreover, as the applications like GIS can manage much more spatial data, they can support the more various applications. Therefore it is valuable for considering about the query processing method suitable for not only rectangle query window, but also general polygonal one. It is the general state-of-the-art approach to use the plane- sweep technique as the computation algorithm in the refinement step as the spatial join queries do. However, from the observation on the characteristics of spatial data and query windows, we can find in many cases that the shape of query window is much simpler than that of spatial data. From these observations, we suggest a new refinement process approach which is suitable for this situation. Our experiments show that, if the number of vertices composing the query window is less than about 20, the new approach we suggest is superior to the state-of-the-art approach by about 20% in general cases.

• The KIPS Transactions:PartD
• /
• v.8D no.6
• /
• pp.657-664
• /
• 2001

The Information Technology has progressed to the open architecture, component, and multimedia services under Internet, ensuring interoperability, reusability, and realtime. The GIS is a system processing geo-spatial information such as natural resources, buildings, roads, and many kinds of facilities in the earth. The spatial information featured by complexity and diversity requires interoperability and reusability of pre-built databases under open architecture. This paper is for the development of component based open GIS Software. The goal of the open GIS component software is a middleware of GIS combining technology of open architecture and component ensuring interoperability of spatial information and reusability of elementary pieces of GIS software. The open GIS component conforms to the distributed open architecture for spatial information proposed by OGC (Open GIS Consortium). The system consists of data provider components, kernel (MapBase) components, clearinghouse components and five kinds of GIS application of local governments. The data provider component places a unique OLE DB interface to connect and access diverse data sources independent of their formats and locations. The MapBase component supports core and common technology of GIS feasible for various applications. The clearinghouse component provides functionality about discovery and access of spatial information under Internet. The system is implemented using ATL/COM and Visual C++ under MicroSoft's Windows environment and consisted of more than 20 components. As we made case study for KSDI (Korea Spatial Data Infrastructure) sharing spatial information between local governments, the advantage of component based open GIS software was proved. Now, we are undertaking another case study for sharing seven kinds of underground facilities using the open GIS component software.

• Proceedings of the KSRS Conference
• /
• 2002.10a
• /
• pp.45-48
• /
• 2002

Satellite image processing software should be able to support interoperability that is to enable consumers, citizens, large and small businesses and governments to make the fullest possible use of the world's spatial data and spatial processing resources. The goal of interoperability is to perform hands-on research, development, testing, fielding, and validation of potential and existing interoperable geoprocessing technologies. In this paper, component based architecture for fast interoperability is designed to maximize interoperability among the OpenGIS components specified in the OpenGIS abstract specifications and implementation specifications and to mix up the OpenGIS components and the fast access mechanism for high performance.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.12
• /
• pp.849-854
• /
• 2013

In this paper, a system technology-based algorithms and visualization is proposed to show a space data. Also the proposed system provides analysis function with combination of usual map and automatic document generation function to give a useful information for making an important decision based on spatial distributed data. In the proposed method, we employ the heat map analysis to present a suitable color distribution for 2 dimensional map data. The buffering analysis method is also used to define the spatial data access. By using the proposed system, spatial information in a variety of distribution will be easy to identify. Also, if we make a use of automatic document generation function in the proposed algorithm, a lot of time and cost savings are expected to make electronic document which representation of spatial information is required.

• Journal of Korea Multimedia Society
• /
• v.8 no.6
• /
• pp.844-855
• /
• 2005

This paper proposes a human action recognition scheme for Intelligent Web Browser. Based on the principle that a human action can be defined as a combination of multiple articulation movements, the inference of stochastic grammars is applied to recognize each action. Human actions in 3 dimensional (3D) world coordinate are measured, quantized and made into two sets of 4-chain-code for xy and zy projection planes, consequently they are appropriate for applying the stochastic grammar inference method. We confirm this method by experiments, that various physical actions can be classified correctly against a set of real world 3D temporal data. The result revealed a comparatively successful achievement of $93.8\%$ recognition rate through the experiments of 8 movements of human head and $84.9\%$ recognition rate of 60 movements of human upper body. We expect that this scheme can be used for human-machine interaction commands in a web browser.

• Spatial Information Research
• /
• v.16 no.2
• /
• pp.219-236
• /
• 2008

Data stream collected from sensors contain a large amount of useful information including causality relationships. The causality join query for data stream is to retrieve a set of pairs (cause, effect) from streams of data. A part of causality pairs may however be lost from the query result, due to the delay from sensors to a data stream management system, and the limited size of sliding windows. In this paper, we first investigate spatial, temporal, and spatio-temporal aspects of the causality join query for data stream. Second, we propose several strategies for sliding window management based on these observations. The accuracy of the proposed strategies is studied by intensive experiments, and the result shows that we improve the accuracy of causality join query in data stream from simple FIFO strategy.