• Proceedings of the Korean Information Science Society Conference
• /
• 2000.04b
• /
• pp.244-246
• /
• 2000

유전자 프로그래밍은 고정적인 구조가 아닌 가변 길이의 트리 구조를 가지고 있어서 여러 세대를 통하여 다양한 개체들을 만들어 낸다. 이러한 특징은 위원회 머신(committee machines)을 구축하는데 있어서 자연스럽고 또한 효과적인 알고리즘일 수 있다.하지만 해결해야 할 요소 중 하나는 다수의 개체들에서 결합할 개체의 선택과 개체의 수를 결정하기 위한 방법이다. 본 논문에서는 효과적인 개체들의 결합이 되기 위한 새로운 탐색방법을 소개한다. 이 방법은 확률적인 진화 탐색을 바탕으로 하고 있다. 제안된 방법을 여러 가지 분류 문제에 적용하였으며 실험을 통하여 탐색의 특성과 일반화 성능을 분석하였다.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.21 no.1
• /
• pp.73-82
• /
• 2008

In this paper, a new regularization method by parameter subset selection method is proposed based on the residual force vector for damage localization. Although subset selection using the fundamental modal characteristics as a residual function has been successful in detecting a single damage location, this method seems to have limited capabilities in the detection of multiple damage locations and typically requires cumbersome weighting values. The method is presented herein and considers cases in which damage detection must be achieved using incomplete measurements of the structural responses. Model expansion is incorporated to deal with this challenge. The unique advantage of employing the new regularization method is that it can reliably identify multiple damage locations. Through an illustrative example, the proposed damage detection method is demonstrated to be a reliable tool for identifying multiple damage locations for a planar truss structure.

• Journal of KIISE:Databases
• /
• v.27 no.4
• /
• pp.682-694
• /
• 2000

이 논문에서는 고차원 색인 구조를 위한 동시성 제어 기법을 설계하고 이를 구현한다. 일반적으로 고차원 색인구조에서는 삽입보다 탐색연산이 빈번하고 탐색연산의 수행은 질의의 특성상 매우 많은 노드를 접근하다. 제안하는 동시성 제어 알고리즘에서는 이런 특성을 고려하여 탐색 연산의 지연이 최소가 되도록 한다. 또한 인덱스의 성능향상을 위해 재삽입 연산을 이용하는 고차원색인 구조를 고려하여 재삽입 연산 수행중에도 정확한 탐색을 보장할 수 있는 방법을 지원한다. 제안하는 동시성 제어 알고리즘을 CIR-Tree에 적용하여 실제 상용 DBMS의 하부 저장 시스템인 MiDAS-III에서 구현한다. 실험을 통하여 제안된 동시성 제어기법이 기종 동시성 제어 기법보다 성능이 우수함을 보인다.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2013.10a
• /
• pp.401-402
• /
• 2013

GNSS Chipse equipped second generation LEO and GEO COSPAS SARSAT enabled EIPRIRB for fast search and rescue service in distress sirtuation was developed, certified, commercialized, exported successfully.

• 한국ITS학회:학술대회논문집
• /
• 2003.11a
• /
• pp.132-135
• /
• 2003

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.10
• /
• pp.1248-1253
• /
• 2019

Using current evacuation methods, a crew describes the physical location of an accident and guides evacuation using alarms and emergency guide lights. However, in case of an accident on a large and complex building, an intelligent and effective emergency evacuation system is required to ensure the safety of evacuees. Therefore, several studies have been performed on intelligent path finding and emergency evacuation algorithms which are centralized guidance methods using gathered data from distributed sensor nodes. However, another important aspect is effective rescue guidance in an emergency situation. So far, there has been no consideration on the efficient rescue guidance scheme. Therefore, this paper proposes the genetic algorithm based emergency rescue guidance method using distributed wireless sensor networks. Performance evaluation using a computer simulation shows that the proposed scheme guarantees efficient path finding. The fitness converges to the minimum value in reasonable time. The density of each exit node is remarkably decreased as well.

• Journal of KIISE
• /
• v.43 no.4
• /
• pp.480-488
• /
• 2016

Search-Based Software Testing (SBST) is an effective technique for test data generation on large domain size. Although the performance of SBST seems to be affected by the structural characteristics of Software Under Test (SUT), studies for the comparison of SBST techniques considering structural characteristics are rare. In addition to the comparison study for SBST, we analyzed the best algorithm with different structural characteristics of SUT. For the generalization of experimental results, we automatically generated 19,800 SUTs by combining four metrics, which are expected to affect the performance of SBST. According to the experiment results, Genetic algorithm showed the best performance for SUTs with high complexity and test data evaluation with count ${\leq}20,000$. On the other hand, the genetic simulated annealing and the simulated annealing showed relatively better performance for SUTs with high complexity and test data evaluation with count ${\geq}50,000$. Genetic simulated annealing, simulated annealing and hill climbing showed better performance for SUTs with low complexity.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10b
• /
• pp.823-825
• /
• 2003

시간이 흐름에 따라 생화학 시스템이 변화하는 것을 기록한 데이터로부터 이 시스템의 상태 전이 및 시스템을 구성하는 각 생화학 물질간의 관계를 모델링하기 위한 방법으로 S-tree 구조를 제안한다. 이것은 주로 생화학 시스템의 동적 특성을 모델링 하기 위하여 연구되어 온 S-system을 나무 구조로 표현한 것이다. 본 논문에서는 진화 연산을 통해 주어진 시계열 데이터를 잘 설명하는 S-tree의 구조 및 그 변수들을 동시에 효과적으로 탐색하는 방법을 개발하였다. 이 방법에서는 구조 탐색을 위해 유전 프로그래밍(genetic programming)에서 사용되어 온 나무 구조의 교차 및 돌연변이 연산과 더불어 다양한 형태의 구조 탐색 연산자들을 도입하였고, 또한 동시에 알맞은 변수 값들을 찾기 위하여 확률적 돌연변이 연산을 통한 언덕 오르기(hill-climbing)를 수행한다. 제안된 방법을 효모의 혐기성 발효 데이터에 적용한 결과 주어진 시스템을 성공적으로 모델링할 수 있었다.

• Journal of Korea Multimedia Society
• /
• v.15 no.9
• /
• pp.1133-1148
• /
• 2012

This paper presents a hierarchical structuring method for the multidimensional type inheritance indices (MD-TIXs) that support the processing of XML queries in XML databases. MD-TIX uses a multidimensional index structure for efficiently supporting ancestor-descendant explorations that involve both nested element and type inheritance hierarchies. However, In the case of a long Xpath, the building and maintenance of MD-TIX are very difficult because of index entry construction problem. So, we propose a type inheritance index hierarchy method for solving this difficulty. We first construct base indices that support direct relationship explorations between adjacent two types on a given Xpath, and then, based on these base indices, we construct hierarchically the derived indices that support indirect relationship explorations between any two types of Xpath until constructing one target index for supporting the full Xpath. And we also present an algorithm that efficiently constructs a partial index hierarchy for supporting given a set of sub-pathes explorations.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.31 no.6
• /
• pp.301-308
• /
• 2018

This paper presents an optimal design method of a hybrid structural control system considering multi-hazard. Unlike a typical structural control system in which one system is designed for one specific type of hazard, a simultaneous optimal design method for both active and passive control systems is proposed for the mitigation of seismic and wind induced vibration responses of structures. As a numerical example, an optimal design problem is illustrated for a hybrid mass damper(HMD) and 30 viscous dampers which are installed on a 30 story building structure. In order to solve the optimization problem, a self-adaptive Harmony Search(HS) algorithm is adopted. Harmony Search algorithm is one of the meta-heuristic evolutionary methods for the global optimization, which mimics the human player's tuning process of musical instruments. A self-adaptive, dynamic parameter adjustment algorithm is also utilized for the purpose of broad search and fast convergence. The optimization results shows that the performance and effectiveness of the proposed system is superior with respect to a reference hybrid system in which the active and passive systems are independently optimized.