• Economic and Environmental Geology
• /
• v.44 no.4
• /
• pp.289-302
• /
• 2011

Since the frequency of the earthquake occurrence in Korean peninsular is continuously increasing, the possibility that massive landslides are triggered by earthquake is also growing in Korea. Previously, the landslide is known to be induced by large magnitude earthquake, whose magnitude is larger than 6.0. However, the landslide can be induced by only small magnitude earthquake, especially in the fully saturated soil. Therefore, the susceptibility of landslide caused by small magnitude earthquake in fully saturated soil is analyzed in this study. For that, the topographical and geological characteristics of the site were obtained and managed by GIS software. In the procedure of the study, slope angle, cohesion, friction angle, unit weight of soil were obtained and constructed as a spatial database layer. Combining these data sets in a dynamic model based on Newmark's displacement analysis, the landslide displacements were estimated in each grid cell. In order to check out the possibility of the earthquake induced landslides, the level of the groundwater table is varied from dry to 80% saturated soil. In addition, in order to analyze the effect of the magnitude of earthquake and distance to epicenter, four different earthquakes epicenters were considered in the study area.

• Journal of Korean Society for Geospatial Information Science
• /
• v.12 no.4 s.31
• /
• pp.27-33
• /
• 2004

Recently, as a part of NGIS project, cultural-assets digital map is produced by cultural properties administration and local autonomous entities. Cultural-assets unified GIS(Geographic Information System) is essential to cultural properties managers md other organizations which are executing land related business for appling it at planning stage. With explosive national land developments, it has been obligated to implement surface survey by the cultural properties protection Art. In this paper, the authors used the district of Sachon city and made 3D terrain model using digital map which is made of 1/5000 stale. Moreover, the authors improved to RDBMS(Relational Database Management System) structure and remodeled the existing DB design in detail, and also tried recovery of past sea level, based on researches about the water level of southern area. By recover past sea level. the shell mound, apart from lever is actually near lever at past, and it make sure its nature. The authors suggested to realize shape and kind of remains which have 3D information of accuracy and actualization from surface-surveying to excavation.

• Journal of Korean Society for Geospatial Information Science
• /
• v.17 no.4
• /
• pp.13-22
• /
• 2009

Urban expansion has caused environmental problems, traffic jam and real estate. Trend analysis of Urban expansion is needed for analysis and prediction of the existing problem-solving, urban planning and land use. In this study, We constructed database based on MOE(Minister of environment)'s landcover(1980's, 2000's), 1: 25,000 digital topographical map using of DEM and data of the National Statistical Office for urban and build up expand analysis of South Korea. As a result, The rate of increase in population of Gyeonggi-do, Incheon and Ulsan are high but Jeollanam-do is low. Area of development zone was 2.15 fold increase in comparison with before it. Slope aspect is south or east and urban expansion was increase in district such as Chungcheongnam-do, Gyeonggi-do, Jeollanam-do. Existing road of accessibility was high than development zone. Metropolitan city developre it. In conclusion, we found that South Korea urban expansion was developed from metropolitan city. In natural topographical conditions, the development was progress advantageous zone to disadvantageous zone. Also, we found that population was rapidly increase with new development as the center zone in urban expansion zone.

• Journal of Korean Society for Geospatial Information Science
• /
• v.21 no.3
• /
• pp.19-25
• /
• 2013

Recently, more accurate database information of facilities is being required, with the increase in importance of urban road facility management. Therefore, this study proposed how to automatically detect particular traffic signs necessary for efficient construction of road facility DB. For this study, central locations of facilities were searched, after recognition and automatic detection of particular traffic signs through an image. Then, coordinate values of traffic signs calculated in the study were compared with real coordinate values, in order to evaluate the accuracy of traffic sign locations which were finally detected. Computer vision technology was used in recognizing and detecting traffic signs through OPEN CV-based coding, and photogrammetry was used in calculating accurate locations of detected traffic signs. For the experiment, circular road signal(No Parking) and triangular road signal(Crosswalk) were chosen out of various kinds of road signals. The research result showed that the circular road signal had a nearly 50cm error value, and the triangular road signal had a nearly 60cm error value, when comparing the calculated coordinates with the real coordinates. Though this result is not satisfactory, it is considered that there would be no problem to find locations of traffic signs.

• Journal of KIISE:Computing Practices and Letters
• /
• v.11 no.3
• /
• pp.209-215
• /
• 2005

Conventional ORDBMS vendors provide extension mechanisms for adding user-defined types and functions to their own DBMSs. Here, the extension mechanisms are implemented using a high-level interface. We call this technique loose-coupling. The advantage of loose-coupling is that it is easy to implement. However, it is not preferable for implementing new data types and operations in large databases when high Performance is required. In this paper, we propose to use the notion of tight-coupling to satisfy this requirement. In tight-coupling, new data types and operations are integrated into the core of the DBMS engine. Thus, they are supported in a consistent manner with high performance. This tight-coupling architecture is being used to incorporate information retrieval(IR) features and spatial database features into the Odysseus/IR ORDBMS that has been under development at KAIST/AITrc. In this paper, we introduce Odysseus/IR and explain its tightly-coupled IR features (U.S. patented). We then demonstrate a web search engine that is capable of managing 20 million web pages in a non-parallel configuration using Odysseus/IR.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11c
• /
• pp.1529-1532
• /
• 2003

최근 인터넷과 모바일 시스템이 급속히 발달함에 따라 이를 통하여 지리정보와 같은 공간데이터를 제공하는 서비스가 증가하였다. 이는 대용량 데이터에 대한 관리 및 빠른 처리와 급증하는 사용자에 대한 높은 동시처리량 및 높은 안정성을 요구하였고, 이를 해결하기 위하여 비공유 공간 데이터베이스 클러스터가 개발되었다. 비공유 공간 데이터베이스 클러스터는 고가용성을 위한 구조로서 문제가 발생할 경우 다른 백업노드가 대신하여 서비스를 지속시킨다. 그러나 기존의 비공유 공간 데이터베이스 클러스터는 클러스터 구성에 대한 회복을 위하여 로그를 계속 유지하므로 로그를 남기기 위해 보통의 질의처리 성능이 저하되었으며 로그 유지를 위한 비용이 증가하였다. 또한 노드단위의 로그를 갖기 때문에 클러스터 구성에 대한 회복이 직렬적으로 이루어져 고가용성을 위한 빠른 회복이 불가능 하였다. 따라서 본 논문에서는 비공유 공간 데이터베이스 클러스터에서 고가용성을 위한 병렬 회복 기법을 제안한다. 이를 위해 클러스터 구성에 대한 회복을 위한 클러스터 로그를 정의한다. 정의된 클러스터 로그는 마스터 테이블이 존재하는 노드에서 그룹내 다른 노드가 정지된 것을 감지할 때 남기기 시작한다. 정지된 노드는 자체회복을 마친 후 클러스터 구성에 대한 회복을 하는 단계에서 존재하는 복제본 테이블 각각에 대한 클러스터 로그를 병렬적으로 받아 회복을 한다. 따라서 정지된 노드가 발생할 경우에만 클러스터 로그를 남기므로 보통의 질의처리의 성능 저하가 없고 클러스터 로그 유지 비용이 적으며, 클러스터 구성에 대한 회복시 테이블단위의 병렬적인 회복으로 대용량 데이터인 공간데이터에 대해 빠르게 회복할 수 있어 가용성을 향상시킨다.들을 문법으로 작성하였으며, PGS를 통해 생성된 어휘 정보를 가지고 스캐너를 구성하였으며, 파싱테이블을 가지고 파서를 설계하였다. 파서의 출력으로 AST가 생성되면 번역기는 AST를 탐색하면서 의미적으로 동등한 MSIL 코드를 생성하도록 시스템을 컴파일러 기법을 이용하여 모듈별로 구성하였다.적용하였다.n rate compared with conventional face recognition algorithms. 아니라 실내에서도 발생하고 있었다. 정량한 8개 화합물 각각과 총 휘발성 유기화합물의 스피어만 상관계수는 벤젠을 제외하고는 모두 유의하였다. 이중 톨루엔과 크실렌은 총 휘발성 유기화합물과 좋은 상관성 (톨루엔 0.76, 크실렌, 0.87)을 나타내었다. 이 연구는 톨루엔과 크실렌이 총 휘발성 유기화합물의 좋은 지표를 사용될 있고, 톨루엔, 에틸벤젠, 크실렌 등 많은 휘발성 유기화합물의 발생원은 실외뿐 아니라 실내에도 있음을 나타내고 있다.>10)의 $[^{18}F]F_2$를 얻었다. 결론: $^{18}O(p,n)^{18}F$ 핵반응을 이용하여 친전자성 방사성동위원소 $[^{18}F]F_2$를 생산하였다. 표적 챔버는 알루미늄으로 제작하였으며 본 연구에서 연구된 $[^{18}F]F_2$가스는 친핵성 치환반응으로 방사성동위원소를 도입하기 어려운 다양한 방사성의 약품개발에 유용하게 이용될 수 있을 것이다.었으나 움직임 보정 후 영상을 이용하여 비교한 경우, 결합능 변화가 선조체 영역에서 국한되어 나타나며 그 유의성이 움직임 보정 전에 비하여 낮음을 알 수 있었다. 결론: 뇌활성화 과제 수행시에 동반되는

• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.664-674
• /
• 2004

The trajectory preservation property that stores only one trajectory in a leaf node is the most important feature of an index structure, such as the TB-tree for retrieving object's moving paths in the spatio-temporal space. It performs well in trajectory-related queries such as navigational queries and combined queries. But, the MBR of non-leaf nodes in the TB-tree have large amounts of dead space because trajectory preservation is achieved at the sacrifice of the spatial locality of trajectories. As dead space increases, the overlap between nodes also increases, and, thus, the classical range query cost increases. We present a new split policy and entry relocation policies, which have no deterioration of the performance for trajectory-related queries, for improving the performance of range queries. To maximally reduce the dead space of a non-leaf node's MBR, the Maximal Area Reduction (MAR) policy is used as a split policy for non-leaf nodes. The entry relocation policy induces entries in non-leaf nodes to exchange each other for the purpose of reducing dead spaces in these nodes. We propose two algorithms for the entry relocation policy, and evaluate the performance studies of new algorithms comparing to the TB-tree under a varying set of spatio-temporal queries.

• Journal of KIISE:Databases
• /
• v.35 no.1
• /
• pp.54-66
• /
• 2008

A spatio-temporal join is an expensive operation that is commonly used in spatio-temporal database systems. In order to generate an efficient query plan for the queries involving spatio-temporal join operations, it is crucial to estimate accurate selectivity for the join operations. Given two dataset $S_1,\;S_2$ of discrete data and a timestamp $t_q$, a spatio-temporal join retrieves all pairs of objects that are intersected each other at $t_q$. The selectivity of the join operation equals the number of retrieved pairs divided by the cardinality of the Cartesian product $S_1{\times}S_2$. In this paper, we propose aspatio-temporal histogram to estimate selectivity of spatio-temporal join by extending existing geometric histogram. By using a wide spectrum of both uniform dataset and skewed dataset, it is shown that our proposed method, called Spatio-Temporal Histogram, can accurately estimate the selectivity of spatio-temporal join. Our contributions can be summarized as follows: First, the selectivity estimation of spatio-temporal join for discrete data has been first attempted. Second, we propose an efficient maintenance method that reconstructs histograms using compression of spatial statistical information during the lifespan of discrete data.

• Journal of Korea Multimedia Society
• /
• v.14 no.5
• /
• pp.669-680
• /
• 2011

R-trees are widely used in various areas such as geographical information systems, CAD systems and spatial databases in order to efficiently index multi-dimensional data. As data sets used in these areas grow in size and complexity, however, range query operations on R-tree are needed to be further faster to meet the area-specific constraints. To address this problem, there have been various research efforts to develop strategies for acceleration query processing on R-tree by using the buffer mechanism or parallelizing the query processing on R-tree through multiple disks and processors. As a part of the strategies, approaches which parallelize query processing on R-tree through Graphics Processor Units(GPUs) have been explored. The use of GPUs may guarantee improved performances resulting from faster calculations and reduced disk accesses but may cause additional overhead costs caused by high memory access latencies and low data exchange rate between GPUs and the CPU. In this paper, to address the overhead problems and to adapt GPUs efficiently, we propose a novel approach which uses a GPU as a buffer to parallelize query processing on R-tree. The use of buffer algorithm can give improved performance by reducing the number of disk access and maximizing coalesced memory access resulting in minimizing GPU memory access latencies. Through the extensive performance studies, we observed that the proposed approach achieved up to 5 times higher query performance than the original CPU-based R-trees.

• Journal of Korean Society of Forest Science
• /
• v.90 no.6
• /
• pp.781-787
• /
• 2001

The spread rate of forest fire was analyzed on Samcheok forest fire that broke out on April 7, 2000 in Kunduck-Myun, Samcheok-City, Kangwon-Province and lasted for about 9 days. The spatial database including topography, overstory species distribution, micro-climate, daily fire front lines for the area was built using GIS and the daily spread pattern was investigated to determine a multiple regression equation to estimate forest fire spread rate. The results of the investigation showed that, on the first day, the forest fire spreaded out extremely fast up to 12.3m/min at about 10 a.m. until noon. After that, the forest fire spread rate fluctuated and slowed down as low as below 1m/min and quenched on April 15. The daily area-based spread rate along the fire spread line got to the peak of about 5,700ha on April 11, of which spread rates were recorded as 2.84m/min in the first half and 1.10m/min in the second half. Also, it was found that slope aspect, wind velocity and % area distribution of Pinus densiflora are the major factors affecting the spread rate of forest fire in this area.