• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06c
• /
• pp.46-48
• /
• 2006

This paper addresses the problem of monitoring continuous k-nearest neighbor (k-NN) queries. Given a set of moving (or static) objects and a set of moving (or static) query points, monitoring continuous k-NN query retrieves and updates the closest k objects to a query point continually. In order to support location based services (LBSs) in highly dynamic environments, where objects and/or queries are frequently moving, monitoring continuous queries require real-time updated results when objects and/or queries change their locations. Thus, it is important to minimize time delay for maintaining up to date the results. In this paper, we present monitoring method to shorten time delay for updating continuous k-NN queries based on the notion of result region and the minimum bounding rectangle enclosing all objects in each cell, referred to as c-MBR, in the grid index structure. Simulations are conducted to show the efficiency of the proposed method.

• Journal of Korea Society of Industrial Information Systems
• /
• v.8 no.3
• /
• pp.19-31
• /
• 2003

For the implementation of large scale GRID systems, the performance scalability in resource scheduling is clearly to be addressed. In this research, we analyzed existing scheduling frameworks from the viewpoint of the performance and propose a novel resource scheduling framework called resource parameter based scheduling. Proposed scheduling framework consists of three components. The first is the resource parameter graph that expresses resource information via inter-resource relation and the composition base on the hierarchical structure. The second component is the resource parameter tree to be used for the implementation of the memory-based index of resource information. The third component is the resource information repository which mostly consists of static data to be used for the general resource information services. This paper presents the details of the framework.

• Journal of Korean Society of Coastal and Ocean Engineers
• /
• v.22 no.4
• /
• pp.258-271
• /
• 2010

In order to figure out hydrodynamic and water quality changes after completion of dike construction of the Saemangeum, which behaves as a semi-enclosed estuarine lake, numerical simulations based on fine grid structure by using EFDC were intensively carried out. In this study some limitations of precedent study has been improved and gate operation were considered. Also 3 phases such as air-water-sediment interaction modeling was considered. It is clear that inner mixing of the Saemangeum is dominated by Mankyeong and Dongjin riverine discharges rather than the gate opening influence through the Lagrangian particle tracking simulations. Vertical DO structure after the dike completion shows steep gradient especially at Dongjin river estuary due to lessen of outer sea water exchange. Increasing SOD at stagnantly changed man-made reservoir might cause oxygen deficiency and accelerating degradation of water quality. According to TSI evaluation test representing eutrophication status, it shows high possibility of eutrophication along Mankyeong waterway in spite of dike completion, while the index is getting high after final closing along Dongjin waterway. Numerical tests with gate operations show significant differences in water quality. Thus it should be noted that proper gate operation plays a major role in preserving target water quality and management for inner development plan.

• The KIPS Transactions:PartD
• /
• v.11D no.6
• /
• pp.1221-1230
• /
• 2004

In mobile environments, the locations of moving objects such as vehicles, airplanes and users of wireless devices continuously change over time. For efficiently processing moving object information, the database system should be able to deal with large volume of data, and manage indexing efficiently. However, previous research on indexing method mainly focused on query performance, and did not pay attention to update operation for moving objects. In this paper, we propose a novel moving object indexing method, named ACAR-Tree. For processing efficiently frequently updating of moving object location information as well as query performance, the proposed method is based on fixed grid structure with auxiliary R-Tree. This hybrid structure is able to overcome the poor update performance of R-Tree which is caused by reorganizing of R-Tree. Also, the proposed method is able to efficiently deal with skewed-. or gaussian distribution of data using auxiliary R-Tree. The experimental results using various data size and distribution of data show that the proposed method has reduced the size of index and improve the update and query performance compared with R-Tree indexing method.

• Journal of Korea Spatial Information System Society
• /
• v.10 no.4
• /
• pp.1-10
• /
• 2008

In wireless internet, the location information of the user is one of the important resources for many applications. One of these applications is Location-Based Services (LBSs) which are being popular. Because, in the LBS system, users request a location-based query to LBS servers by sending their exact location, the location information of the users can be misused by adversaries. In this regard, there must be a mechanism which can deal with privacy protection of the users. In this paper, we propose a cloaking method considering both features of K-anonymity and L-diversity. Our cloaking method creates a minimum cloaking region by finding L number of buildings (L-diversity) and then finding number of users (K-anonymity). To support this, we use a R*-tree based index structure and use filtering methods especially for the m inimum cloaking region. Finally, we show from a performance analysis that our method outperforms the existing grid based cloaking method.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.2
• /
• pp.151-161
• /
• 2009

In Location-Based Services (LBSs), users requesting a location-based query send their exact location to a database server and thus the location information of the users can be misused by adversaries. Therefore, a privacy protection method is required for using LBS in a safe way. In this paper, we propose a new cloaking region generation algorithm using grids for privacy protection in LBSs. The proposed algorithm creates a m inimum cloaking region by finding L buildings and then performs K-anonymity to search K users. For this, we make use of not only a grid-based index structure, but also an efficient pruning techniques. Finally, we show from a performance analysis that our cloaking region generation algorithm outperforms the existing algorithm in term of the size of cloaking region.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.3
• /
• pp.1458-1464
• /
• 2011

This study is on the application of TOPMODEL-topographic based hydrologic model-to the runoff analysis, The test area was the ssang-chi watershed which is mountainous catchment located in the upstream of the sumjin-gang basin and the watershed area is $126.7km^2$. The six's hourly runoff and precipitation data was selected in the 2006 ~ 2009 year. And the model parameters are calibrated using observed runoff data by Pattern Search method. The topographic index of the ssang-chi catchment was produced by digital elevation model(DEM) of 100m grid. As a results of the analysis, the parameters of model, a decay facter(m), transmissivity(T0), and the unsaturated zone delay(TD) are sensible to hydrologic response, and the simulated runoff data are in good agreement with observed runoff data.

• Journal of Korean Society of Rural Planning
• /
• v.11 no.4 s.29
• /
• pp.47-57
• /
• 2005

The goal of this research is to evaluate landscape-ecological characteristics of watersheds in the Nakdong River Basin by using Geogaphic Information System (GIS) and landscape indices for integation of spatio-temporal informations and multivariate statistical techniques for quantitative analysis of forest landscape. Fragmentation index and change matrix techniques using factor analysis and grid overlay method were used to efficiently analyze and manage huge amount of information for ecological-environmental assessment (land-cover and forest landscape patterns). According to the results based on the pattern analysis of land-cover changes using the change detection matrix between 1980s and 1990s, addition on 750km$^2$ became urbanized areas. The altered 442.04km$^2$ was agricultural areas which is relatively easy for shifting of land-use, and 205.1km$^2$ of forests became urbanized areas, and average elevation and slope of the whole altered areas were 75m and 4$^{\circ}$. On the other hand, 120km$^2$ of urban areas were changed into other areas (i.e., agricultural areas and green space), and fortunately, certain amount of naturalness had been recovered. But still those agricultural areas and fallow areas, which were previously urban areas, had high potential of re-development for urbanization due to their local conditions. According to the structural analysis of forest landscape using the landscape indices, the forest fragmentation of watersheds along the main stream of the Nakdong River was more severe than my other watersheds. Furthermore, the Nakdong-sangju and Nakdong-miryang watersheds had unstable forest structures as well as least amount of forest quantity. Thus, these areas need significant amount of forest through a new forest management policy considering local environmental conditions.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.42 no.1
• /
• pp.35-40
• /
• 2005

Recently, the location based service for moving customers is becoming one of the most important service in mobile communication area and for moving object applications, there are lots of update operations and such update loads are concentrated on some particular area unevenly. The primary processing of LBS application is spatio-temporal range queries and to improve the throughput of spatio-temporal range queries, the time of disk I/O in query processing should be reduced. In this paper, we adopt non-uniform two-level grid index structure, which are designed to minimize update operations. We propose query scheduling technique using spatial relationship and time relationship and a combined spatio-temporal query processing method using time zone concepts to improve the throughput of query processing. Some experimental results are shown for range queries with different query range to show the performance tradeoffs of the proposed methods.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.3
• /
• pp.669-678
• /
• 2018

This study developed information technology infrastructures for building a driving environment analysis platform using various big data, such as vehicle sensing data, public data, etc. First, a small platform server with a parallel structure for big data distribution processing was developed with H/W technology. Next, programs for big data collection/storage, processing/analysis, and information visualization were developed with S/W technology. The collection S/W was developed as a collection interface using Kafka, Flume, and Sqoop. The storage S/W was developed to be divided into a Hadoop distributed file system and Cassandra DB according to the utilization of data. Processing S/W was developed for spatial unit matching and time interval interpolation/aggregation of the collected data by applying the grid index method. An analysis S/W was developed as an analytical tool based on the Zeppelin notebook for the application and evaluation of a development algorithm. Finally, Information Visualization S/W was developed as a Web GIS engine program for providing various driving environment information and visualization. As a result of the performance evaluation, the number of executors, the optimal memory capacity, and number of cores for the development server were derived, and the computation performance was superior to that of the other cloud computing.