• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.2
• /
• pp.222-227
• /
• 2006

Recently the research for Traveling Salesman Problem (TSP) using DNA computing with massive parallelism has been. However, there were difficulties in real biological experiments because the conventional method didn't reflect the precise characteristics of DNA when it express graph. Therefore, we need DNA sequence generation algorithm which can reflect DNA features and reduce biological experiment error. In this paper we proposed a DNA sequence generation algorithm that applied DNA coding method of evolution model to DNA computing. The algorithm was applied to TSP, and compared with a simple genetic algorithm. As a result, the algorithm could generate good sequences which minimize error and reduce the biologic experiment error rate.

• Electronics and Telecommunications Trends
• /
• v.2 no.4
• /
• pp.3-9
• /
• 1987

본 고는 기존 소프트웨어 산업에서의 기술적인 문제점을 검토하고, 생산성 향상을 통하여 소프트웨어 수급격차를 해소하고, 현재의 소프트웨어 위기를 극복할 수 있는 방안으로서 전통적인 개발모델을 기반으로 하는 진화론적인 접근방식과 automation-based 개발모델을 기반으로 하는 혁신적인 접근방식에 대하여 기술한다.

• The Journal of the Korea Contents Association
• /
• v.14 no.11
• /
• pp.549-557
• /
• 2014

Recently, analysis of bargaining game using evolutionary computation is essential issues in field of game theory. In this paper, we observe a bargaining game using co-evolution between two heterogenous artificial agents. In oder to model two artificial agents, we use a particle swarm optimization and a differential evolution. We investigate algorithm parameters for the best performance and observe that which strategy is better in the bargaining game under the co-evolution between two heterogenous artificial agents. Experimental simulation results show that particle swarm optimization outperforms differential evolution in the bargaining game.

• Korean Journal of Cognitive Science
• /
• v.30 no.4
• /
• pp.199-217
• /
• 2019

Evolutionary research on mental disorders is relatively difficult compared to other medical studies. It is because the cause of mental disorder is unclear relative to other medical diseases, various proximate causations are involved. And it is difficult to distinguish cause and effect and to carry out experimental research. Despite these methodological difficulties, it is possible to establish an evolutionary hypothesis on mental disorders based on constructive reductionism, and to demonstrate actual data on the model based on this hypothesis. In this paper, I will discuss some conceptual definitions needed for applying ecological approaches to evolutionary psychiatric research. We will first discuss the appropriate level of explanations and the scope of the study subjects, then discuss the conceptual definition of behaviour and function, dysfunction and the appropriate level of selection.

• Proceedings of the KIEE Conference
• /
• 2003.07d
• /
• pp.2295-2297
• /
• 2003

본 논문에서는 발생모델인 DNA 코딩 기법과 진화 모델인 유전자 알고리즘을 이용한 비선형 시스템의 퍼지 모델 링에 대한 새로운 방법을 제안한다. DNA 코딩 기법은 실제 생체 분자 (bio-molecule)를 계산의 도구로 사용하는 새로운 계산 방법으로, 진화 연산과 결합하여 인공지능의 새로운 분야로 부각되고 있다. 그러나, 실제 생체 분자를 계산의 도구로 사용하기 때문에 기존의 컴퓨터에 적용하기 어렵고, 단순히 합성과 분리라는 간단한 방법으로 해를 구하기 때문에 보다 효과적인 알고리즘을 개발하여야 할 필요성이 있다. 따라서 본 논문에서는 DNA 코드 유전자 알고리즘을 제안하며, 제안된 방법은 비선형 시스템의 퍼지 모델링에 적용하였으며, 기존의 유전자 알고리즘과 비교를 통하여 그 우수성을 입증하였다.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.1
• /
• pp.79-87
• /
• 2005

This paper presents an active contour model for extracting accurate facial regions in complex environments. In the model, a contour is represented by a zero level set of level function φ, and evolved via level set partial differential equations. Then, unlike general active contours, skin color information that is represented by 2D Gaussian model is used for evolving and slopping a curve, which allows the proposed method to be robust to noise and varying pose. To assess the effectiveness of the proposed method it was tested with several natural scenes, and the results were compared with those of geodesic active contours. Experimental results demonstrate the superior performance of the proposed method.

• Korea Information Processing Society Review
• /
• v.14 no.2
• /
• pp.28-35
• /
• 2007

• Bulletin of the Korean Space Science Society
• /
• 2002.10a
• /
• pp.61.2-61
• /
• 2002

• The Bulletin of The Korean Astronomical Society
• /
• v.30 no.2
• /
• pp.23.2-23.2
• /
• 2005

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1996.10a
• /
• pp.1043-1047
• /
• 1996