• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.1
• /
• pp.16-21
• /
• 2002

Repetitive strings have been studied in such diverse fields as molecular biology data compression etc. Some important regularities that have been studied are perods, covers seeds and squares. A natural extension of the repetition problems is to allow errors. Among the four notions above aproximate squares and approximate periodes have been studied. In this paper, we introduce the notion of approximate covers which is an approximate version of covers. Given two strings P(｜P｜=m) and T(｜T｜=n) we propose and algorithm with finds the minimum distance t such that P is a t-approximate cover of T. The algorithm take O(m,n) time for the edit distance and $O(mn^2)$ time of finding a string which is an approximate cover of T is minimum distance is NP-complete.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.628-630
• /
• 2004

Distributed Denial of Service(D-DoS) 공격을 차단하기 위해서는 AS(Autonomous System) 경계 라우터에 필터를 설치하는 것이 필요하다. 필터가 설치되는 라우터의 개수를 최소로 하는 Vertex Cover(VC)--모든 edge를 커버하는 Vertex의 모임--을 찾아내는 방법은 NP-complete 문제가 된다. 따라서 Vertex Cover(VC) 근사기법 중에서 Greedy 알고리즘과 Approximated VC 알고리즘에 대해 Vertex Cover(VC)을 찾아내는 방법을 적용하여 실험하였다. Vertex Cover(VC)를 찾을 경우 Worst case에서 이론상 VC수의 최대 2배의 Vertex Cover(VC)를 찾아낼 수 있는 Approximated VC 알고리즘의 장점과 적은 수의 Vertex Cover(VC)로 모든 edge를 커버할 수 있는 Greedy 알고리즘［7］의 장점을 모두 갖춘 Vertex Cover(VC) 근사 기법을 구현하였다. NS-2를 이용한 실험 결과, 제안된 알고리즘은 Greedy 알고리즘보다 Vertex Cover를 찾아가는 단계 수에 따른 커버되는 층 노드 수를 비교하였을 때. 전체 노드의 75%를 커버하는데 24번의 단계가 필요하여 Greedy 알고리즘의 40개 보다 40%의 단계의 수적인 감소가 일어났으며 전체노드의 90%를 커버하는데 38%의 단계 개수의 감소가 일어났다. 실험으로 제안된 알고리즘이 Vertex Cover(VC) 톨 찾아가는 단계 측면에서 좀더 빠르게 AS 경계 라우터에 필터를 설치하여 D-DoS에 효율적으로 대처해 나갈 수 있음을 확인할 수 있다.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2001.05a
• /
• pp.565-570
• /
• 2001

대상 기계구조물의 유한요소 모델로부터 구한 해석결과가 실험결과와 오차를 나타낼 때, 이러한 오차를 줄일 수 있도록 유한요소 모델의 변경이 요구된다. 유한요소 모델개선은 이러한 역문제(Inverse Problem)를 다루는 체계적인 접근법이다. 일반적으로 유한요소 모델에서 변경할 수 있는 매개변수의 개수는 실험결과의 개수보다 많으므로 실험결과와 일치되는 개선된 유한요소 모델은 무한하다고 할 수 있다. 그러나, 개선된 유한요소 모델이 물리적 타당성을 갖도록 매개변수의 변경량에 제한을 주면 일반적으로 초기 유한요소 모델에 비해 실험결과와의 오차가 개선된 근사해만 존재하게 된다. 따라서, 모델개선 과정을 통해 구한 개선된 모델은 오차의 평가기준 또는 목적함수에 따라 정해진 다양한 근사해 중 하나이다. 기존의 모델개선 방법에서는 단 하나의 오차 평가기준 또는 목적함수를 사용하고 이를 최소화 하는 모델을 구한다. 개선된 모델을 구하기 이전에는 사용된 평가기준이 타당한지 검토할 수 없으므로 대부분의 경우, 시행착오법으로 목적함수를 설정하게 된다. 본 논문에서는 다목적 최적화 기법을 이용한 오차 평가기준을 소개하고 이를 하드디스크커버 유한요소 모델개선에 응용한다.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.17 no.6
• /
• pp.211-223
• /
• 2018

Mobile relay systems have been adopted by $4^{th}$ generation mobile systems as an alternative method to extend cell coverage as well as to enhance the system throughput at cell-edges. In order to achieve such performance gains, the mobile relay systems require path selection and resource allocation schemes that are specifically designed for these systems which make use of additional radio resources not needed in single-hop systems. This paper proposes an integrated path selection and resource allocation scheme for LTE-Advanced relay systems using collaborative communication. We first define the problem of maximizing the downlink throughput of LTE-Advanced relay systems using collaborative communication and transform it into a multi-dimensional multi-choice backpacking problem. The proposed Lagrange multiplier-based heuristic algorithm is then applied to derive the approximate solution to the maximization problem. It is shown through simulations that the approximate solution obtained by the proposed scheme can achieve a near-optimal performance.

• KIPS Transactions on Software and Data Engineering
• /
• v.9 no.4
• /
• pp.137-144
• /
• 2020

Delirium is among the most common mental disorders encountered in patients with a temporary cognitive impairment such as consciousness disorder, attention disorder, and poor speech, particularly among those who are older. Delirium is distressing for patients and families, can interfere with the management of symptoms such as pain, and is associated with increased elderly mortality. The purpose of this paper is to generate useful clinical knowledge that can be used to distinguish the outcomes of patients with delirium in long-term care facilities. For this purpose, we extracted the clinical classification knowledge associated with delirium using a local covering rule acquisition approach with the rough lower approximation region. The clinical applicability of the proposed method was verified using data collected from a prospective cohort study. From the results of this study, we found six useful clinical pieces of evidence that the duration of delirium could more than 12 days. Also, we confirmed eight factors such as BMI, Charlson Comorbidity Index, hospitalization path, nutrition deficiency, infection, sleep disturbance, bed scores, and diaper use are important in distinguishing the outcomes of delirium patients. The classification performance of the proposed method was verified by comparison with three benchmarking models, ANN, SVM with RBF kernel, and Random Forest, using a statistical five-fold cross-validation method. The proposed method showed an improved average performance of 0.6% and 2.7% in both accuracy and AUC criteria when compared with the SVM model with the highest classification performance of the three models respectively.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.6
• /
• pp.683-690
• /
• 2006

Reducing power consumption to extend network lifetime is one of the most important challenges in designing wireless sensor networks. One promising approach to conserving system energy is to keep only a minimal number of sensors active and put others into low-powered sleep mode, while the active sensors can maintain a connected covet set for the target area. The problem of computing such minimum working sensor set is NP-hard. In this paper, a centralized Voronoi tessellation (CVT) based approximate algorithm is proposed to construct the near optimal cover set. When sensor's communication radius is at least twice of its sensing radius, the covet set is connected at the same time; In case of sensor's communication radius is smaller than twice of its sensing radius, a connection scheme is proposed to calculate the assistant nodes needed for constructing the connectivity of the cover set. Finally, the performance of the proposed algorithm is evaluated through theoretical analysis and extensive numerical experiments. Experimental results show that the proposed algorithm outperforms the greedy algorithm in terms of the runtime and the size of the constructed connected cover set.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2019.10a
• /
• pp.864-867
• /
• 2019

본 연구에서는 러프 근사화 개념을 활용하여 섬망 환자를 사전에 구별할 수 있는 임상적 지식을 유도할 수 있는 방법을 제안하였다. 실험 결과에서는 평균 섬망기간이 13일 이상 유지되는 6가지 임상적 분류기준을 유도하였고, 통계적 5겹 교차검정 실험을 통해 73%의 분류 성능을 제공함을 확인하였다.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.34 no.8
• /
• pp.1097-1103
• /
• 2010

Injection pressure, an important factor in the filling procedure, should be minimized to enhance injection molding quality. In addition, warping deformation and weld lines, which are representative failures, should be avoided to enhance injection molding quality. To improve injection molding quality, the design procedure for an automotive fog blank cover is divided into two stages. In the first stage, we optimally obtain injection molding process variables that minimize injection pressure and warping deformation by using design of experiments, approximation and optimization techniques equipped in PIAnO (Process Integration, Automation and Optimization), a commercial PIDO (Process Integration and Design Optimization) tool. Then, we determine the thickness of the automotive fog blank cover that enables us to avoid generating weld lines. The design results we obtain in this study are found far better than those of the initial design, which demonstrates the effectiveness of our design method.