• Journal of KIISE:Databases
• /
• v.33 no.5
• /
• pp.495-512
• /
• 2006

Recently, researches on a future position prediction of moving objects have been progressed as the importance of the future position retrieval increases. New index structures are required to efficiently retrieve the consecutive positions of moving objects. Existing index structures significantly degrade the search performance of the moving objects because the search operation makes the unnecessary extension of the node in the index structure. To solve this problem, we propose a space partition based index structure considering the mobility of moving objects. To deal with the overflow of a node, our index structure first merges it and the sibling node. If it is impossible to merge them, our method splits the overflow node in which moving properties of objects are considered. Our index structure is always partitioned into overlap free subregions when a node is split. Our split strategy chooses the split position by considering the parameters such as velocities, the escape time of the objects, and the update time of a node. In the internal node, the split position Is determined from preventing the cascading split of the child node. We perform various experiments to show that our index structure outperforms the existing index structures in terms of retrieval performance. Our experimental results show that our proposed index structure achieves about $17%{\sim}264%$ performance gains on current position retrieval and about $107%{\sim}19l%$ on future position retrieval over the existing methods.

• Journal of Korea Water Resources Association
• /
• v.51 no.10
• /
• pp.853-862
• /
• 2018

An adaptive cut-cell grid based 2D inundation analysis model, K-Flood, is developed in this study. Cut cell grid method divides a grid into a flow area and a non-flow area depending the characteristics of the flows. With adaptive mesh refinement technique cut cell method can represent complex flow area using relatively small number of cells. In recent years, the urban inundation modeling using high resolution and fine quality data is increasing to achieve more accurate flood analysis or flood forecasting. K-Flood has potential to simulate such complex urban inundation using efficient grid generation technique. A finite volume numerical scheme of second order accuracy for space and time was applied. For verification of K-Flood, 1) shockwave reflex simulation by circular cylinder, 2) urban flood experiment simulation, 3) Malpasset dam collapse simulation are performed and the results are compared with observed data and previous simulation results.

• The KIPS Transactions:PartA
• /
• v.14A no.7
• /
• pp.443-450
• /
• 2007

Performance scalability and storage scalability become important in a large scale cluster of wireless internet proxy cache servers. Performance scalability means that the whole performance of the cluster increases linearly according as servers are added. Storage scalability means that the total size of cache storage in the cluster is constant, regardless of the number of cache servers used, if the whole cache data are partitioned and each partition is stored in each server, respectively. The Round-Robin based load balancing method generally used in a large scale server cluster shows the performance scalability but no storage scalability because all the requested URL data need to be stored in each server. The hashing based load balancing method shows storage scalability because all the requested URL data are partitioned and each partition is stored in each server, respectively. but, it shows no performance scalability in case of uneven pattern of client requests or Hot-Spot. In this paper, we propose a novel dynamic hashing method with performance and storage scalability. In a time interval, the proposed scheme keeps to find some of requested URLs allocated to overloaded servers and dynamically reallocate them to other less-loaded servers. We performed experiments using 16 PCs and experimental results show that the proposed method has the performance and storage scalability as different from the existing hashing method.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.24 no.4
• /
• pp.355-359
• /
• 2014

In this paper, we proposed the new fuzzy pattern classifier which combines several fuzzy models with simple consequent parts hierarchically. The basic component of the proposed fuzzy pattern classifier with hierarchical structure is a fuzzy model with simple consequent part so that the complexity of the proposed fuzzy pattern classifier is not high. In order to analyze and divide the input space, we use Fuzzy C-Means clustering algorithm. In addition, we exploit Conditional Fuzzy C-Means clustering algorithm to analyze the sub space which is divided by Fuzzy C-Means clustering algorithm. At each clustered region, we apply a fuzzy model with simple consequent part and build the fuzzy pattern classifier with hierarchical structure. Because of the hierarchical structure of the proposed pattern classifier, the data distribution of the input space can be analyzed in the macroscopic point of view and the microscopic point of view. Finally, in order to evaluate the classification ability of the proposed pattern classifier, the machine learning data sets are used.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.10 s.340
• /
• pp.25-30
• /
• 2005

This paper generalizes the concept of the signal space detection to construct a fixed delay tree search (FDTS) detector which estimates a block of n channel symbols at a time. This technique is applicable to high speed implementation. Two approaches are discussed both of which are based on efficient signal space partitioning. In the first approach, symbol detection is performed based on a multi-class partitioning of the signal space. This approach is a generalization of binary symbol detection based on a two-class pattern classification. In the second approach, binary signal detection is combined with a look-ahead technique, resulting in a highly parallel detector architecture.

• Journal of Korean Society for Geospatial Information Science
• /
• v.20 no.1
• /
• pp.83-91
• /
• 2012

Crown density, which is defined as the proportion of the forest floor concealed by tree crown, is important and useful information in various fields. Previous methods of measuring crown density have estimated crown density by interpreting aerial photographs or through a ground survey. These are time-consuming, labor-intensive, expensive and inconsistent approaches, as they involve a great deal of subjectivity and rely on the experience of the interpreter. In this study, the crown density of a forest in Korea was estimated using KOMPSAT-2 high-resolution satellite images. Using the image segmentation technique and stand information of the digital forest map, the forest area was divided into zones. The crown density for each segment was determined using the discriminant analysis method and the forest ratio method. The results showed that the accuracy of the discriminant analysis method was about 60%, while the accuracy of the forest ratio method was about 85%. The probability of extraction of candidate to update was verified by comparing the result with the digital forest map.

• Journal of KIISE:Databases
• /
• v.31 no.2
• /
• pp.122-131
• /
• 2004

Traditional works on indexing have been suggested for low dimensional data under dynamic environments. But recent database applications require efficient processing of huge sire of high dimensional data under static environments. Thus many indexing strategies suggested especially in partitioning ones do not adapt to these new environments. In our study, we point out these facts and propose a new partitioning strategy, which complies with new applications' requirements and is derived from analysis. As a preliminary step to propose our method, we apply a packing technique on the one hand and exploit observations on the Minkowski-sum cost model on the other, under uniform data distribution. Observations predict that unbalanced partitioning strategy may be more query-efficient than balanced partitioning strategy for high dimensional data. Thus we propose our method, called CSP (Cyclic Spliced Partitioning method). Analysis on this method explicitly suggests metrics on how to partition high dimensional data. By the cost model, simulations, and experiments, we show excellent performance of our method over balanced strategy. By experimental studies on other indices and packing methods, we also show the superiority of our method.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.3 no.1
• /
• pp.1-11
• /
• 2000

The hybrid coding algorithm for multi-spectral image obtained from satellite is discussed. As the spatial and spectral resolution of satellite image are rapidly increasing, there are enormous amounts of data to be processed for computer processing and data transmission. Therefore an efficient coding algorithm is essential for multi-spectral image processing. In this paper, VQ(vector quantization), quadtree decomposition, and DCT(discrete cosine transform) are combined to compress the multi-spectral image. VQ is employed for predictive coding by using the fact that each band of multi-spectral image has the same spatial feature, and DCT is for the compression of residual image. Moreover, the image is decomposed into quadtree structure in order to allocate the data bit according to the information content within the image block to improve the coding efficiency. Computer simulation on Landsat TM image shows the validity of the proposed coding algorithm.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1997.04a
• /
• pp.115-119
• /
• 1997

본 논문은 해상에서 발생될 수 있는 기름 유출 사고시 효과적 방제의 지원을 위한 오염원 확산 예측 시스템의 개발을 주목적으로 한다. 이를 위하여, 격자형 공간 DEVS 모델 링 방법론을 이용한 SOS(Save Our Sea) 시스템을 개발하였다. 기존의 해양오염 예측 시스 템들이 대부분 해석적 기법에 의존하는데 비해 제안된 시스템은 격자형 공간 모델링을 이용 한 시뮬레이션 기법으로서 전체 해양을 Cell 단위의 공간으로 분할하고, Cellrks의 결합관계 는 Name-Directed Coupling을 적용함으로서 시스템 설계상의 효율성과 유연성을 제공한 다. 제안된 시스템은 기름유출사고의 발생시 오염원 확산에 영향을 주는 각종 벡터 변수값 들에 따른 해양 오염 물질의 확산 분포를 예측함과 동시에 확산에 영향을 주는 많은 벡터 값들이 모니터링 정보를 함께 제공함으로서 해양 오염 방제 및 환경 보존에 효과적으로 적 용될 수 있을 것으로 기대된다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.3B
• /
• pp.315-322
• /
• 2001

최근 정보통신기술의 발전과 함께 영상매체의 급속한 증자로 영상의 효율적인 관리와 검색을 수행하기 위한 내용기반 영상검색은 핵심기술로 대두되고 있다. 내용기반 영상검색에서 영상의 특징을 표현하기 위해 색상 히스토그램을 많이 사용하고 있으나, 색상만을 고려하는 것은 많은 단점을 지니고 있으므로 본 논문에서는 영상의 특징으로 색상과 공간 정보를 함께 고려하기 위한 순차영역분할(sequential clustering) 기법을 도입하며, 분할된 영역의 색상평균값, 분산값과 영역의 크기를 특성벡터로 제안한다. 제안된 방법의 특성의수가 18개로 타 방법보다 매우 작은 저장공간을 가지면서도 검색효율이 8.8%이상 개선되었다. Precision 대 Recall에서도 각 질의 영상에서 대부분의 Recall 값에서 제안한 방법이 우수함이 확인되었으며, 시각적으로도 양호한 검색결과를 얻을 수 있었다.