• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2007.11a
• /
• pp.313-315
• /
• 2007

본 논문에서는 서로 다른 주문들의 일부를 일괄적으로 처리할 수 있을 때, 최소 개수의 작업 단위로 모든 주문을 처리하는 문제를 다룬다. 무향그래프와 배치 크기 $\lambda$로 표현되는 이 문제의 일반적인 경우는 NP-hard이며, 그래프가 나무와 interval 그래프 일 때 다항 시간 안에 최적해를 찾을 수 있음이 증명되어 있다. 본 논문에서는 LP 완화 기법을 이용한 근사알고리즘과 LP 완화를 통한 최적해의 분석을 제시한다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1998.05a
• /
• pp.291-294
• /
• 1998

본 논문에서는 퍼지라는 개념을 도입하여 기존의 전문가시스템에서 문제점으로 지적되어 온 불확실성, 모호성의 처리 기능을 부가하여 표현의 영역을 확장, 개선하여, 전문가시스템의 추론 엔진을 적용하는 근사적 유사 추론기법을 분석한다. 그리고 규칙의 조건부와 이에 대응하는 사실간의 유사도를 구하여 이들 규칙의 결론부에 반영하여 결론을 유도하는 근사적 유사 추론기법을 제안한다. 또한 이와 같은 이론적인 연구를 바탕으로 자연언어의 많은 부분을 차지하고 있는 퍼지 개념을 지원하는 당뇨병(의료)진단용 전문가시스템을 설계, 구현하여 기존의 불확실성 관리방안의 단점을 개선하고자 한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04b
• /
• pp.97-99
• /
• 2004

본 논문에서는 다차원 데이터의 유사도 검색을 효과적으로 수행하기 위한 색인 구조를 제안한다. 제안하는 색인 구조는 차원의 저주 현상을 극복하기 위한 벡터 근사 기반의 색인 구조이다. 제안하는 색인 구조는 부모 노드를 기준으로 KDB-트리와 유사한 영역 분할 방식으로 분할하고 분할된 각 영역은 데이터의 분포 특성에 따라 동적 비트를 할당하여 벡터 근사화된 영역을 표현한다. 따라서, 하나의 노드 안에 않은 영역 정보를 저장하여 트리의 깊이를 줄일 수 있다. 또한 다차원의 특징 벡터 공간에 상대적인 비트를 할당하기 때문에 군집화되어 있는 데이터에 대해서 효과적이다 제안하는 색인 구조의 우수성을 보이기 위해 다양한 실험을 통하여 성능의 우수성을 입증한다.

• Journal of KIISE
• /
• v.44 no.8
• /
• pp.760-766
• /
• 2017

Repetitive strings have been studied in diverse fields such as data compression, bioinformatics and so on. Recently, two problems of approximate periods of strings over integer alphabets were introduced, finding minimum ${\delta}-approximate$ periods and finding minimum ${\gamma}-approximate$ periods. Both problems can be solved in $O(n^2)$ time when n is the length of the string. In this paper, we present two parallel algorithms for solving the above two problems in O(n) time using $O(n^2)$ threads, respectively. The experimental results show that our parallel algorithms for finding minimum ${\delta}-approximate$ (resp. ${\gamma}-approximate$) periods run approximately 19.7 (resp. 40.08) times faster than the sequential algorithms when n = 10,000.

• The Korean Journal of Applied Statistics
• /
• v.31 no.6
• /
• pp.707-719
• /
• 2018

Various time series representation methods have been proposed for efficient time series clustering and classification. Lin et al. (DMKD, 15, 107-144, 2007) proposed a symbolic aggregate approximation (SAX) method based on symbolic representations after approximating the original time series using piecewise local mean. The performance of SAX therefore depends heavily on how well the piecewise local averages approximate original time series features. SAX equally divides the entire series into an arbitrary number of segments; however, it is not sufficient to capture key features from complex, large-scale time series data. Therefore, this paper considers data-adaptive local constant approximation of the time series using the unbalanced Haar wavelet transformation. The proposed method is shown to outperforms SAX in many real-world data applications.

• The Korean Journal of Applied Statistics
• /
• v.24 no.2
• /
• pp.347-357
• /
• 2011

In this paper, we propose an approximation to the overshoot in M/$E_n$/1 queues. Overshoot means the size of excess over the threshold when the workload process of an M/$E_n$/1 queue exceeds a prespecified threshold. The distribution, $1^{st}$ and $2^{nd}$ moments of overshoot have an important role in solving some kind of optimization problems. For the approximation to the overshoot, we propose a formula that is a convex sum of the service time distribution and an exponential distribution. We also do a numerical study to check how exactly the proposed formula approximates the overshoot.

• Journal of KIISE:Databases
• /
• v.27 no.2
• /
• pp.199-208
• /
• 2000

The k-nearest neighbor search query based on similarity is very important for content-based multimedia information retrieval(MIR). The conventional exact k-nearest neighbor search algorithm is not efficient for the MIR application because multimedia data should be represented as high dimensional feature vectors. Thus, an approximate k-nearest neighbor search algorithm is required for the MIR applications because the performance increase may outweigh the drawback of receiving approximate results. For this, we propose a new approximate k-nearest neighbor search algorithm for high dimensional data. In addition, the comparison of the conventional algorithm with our approximate k-nearest neighbor search algorithm is performed in terms of retrieval performance. Results show that our algorithm is more efficient than the conventional ones.

• Journal of KIISE:Information Networking
• /
• v.30 no.3
• /
• pp.416-423
• /
• 2003

This paper proposes a continuous-time queuing model of a shared-buffer packet switch and an approximate algorithm. N arrival processes have heterogeneous busty traffic characteristics. The arrival processes are modeled by Coxian distribution with order 2 that is equivalent to Interruped Poisson Process. The service time is modeled by Erlang distribution with r stages. First the approximate algorithm performs the aggregation of N arrival processes as a single state variable. Next the algorithm discompose the queuing system into N subsystems which are represented by aggregated state variables. And the balance equations based on these aggregated state variables are solved for by iterative method. Finally the algorithm is validated by comparing the results with those of simulation.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.34 no.1
• /
• pp.42-48
• /
• 2006

In this study, a repetitive response surface enhancement technique (RRSET) is proposed as a new system approximation method for the efficient multidisciplinary design and optimization (MDO). In order to represent the highly nonlinear behavior of the response with second order polynomials, RRSET introduces a design space transformation using stretching functions and repetitive response surface improvement. The tentative optimal point is repetitively included to the set of experimental points to better approximate the response surface of the system especially near the optimal point, hence a response surface with significantly improved accuracy can be generated with very small experimental points and system iterations. As a system optimizer, the simulated annealing, which generates a global design solution is utilized. The proposed technique is applied to several numerical examples, and demonstrates the validity and efficiency of the method. With its improved approximation accuracy, the RRSET can contribute to resolve large and complex system design problems under MDO environment.

• Journal of the Korean Data and Information Science Society
• /
• v.27 no.5
• /
• pp.1119-1131
• /
• 2016

The Neyman-Scott Rectangular Pulses Model (NSRPM) is mainly used to construct hourly rainfall series. This model uses a modest number of parameters to represent the rainfall processes and underlying physical phenomena, such as the arrival of storms or rain cells. In NSRPM, the method of moments has often been used because it is difficult to know the distribution of rainfall intensity. Recently, approximated likelihood function for NSRPM has been introduced. In this paper, we propose a hierarchical model for applying a spatial structure to the NSRPM parameters using the approximated likelihood function. The proposed method is applied to summer hourly precipitation data observed at 59 weather stations (Korea Meteorological Administration) from 1973 to 2011.