• The Transactions of the Korea Information Processing Society
• /
• v.13 no.2
• /
• pp.13-17
• /
• 2024

In this paper, union-based rule antecedent neuro-fuzzy controller, which can guarantee a parsimonious knowledge base with reduced number of rules, is proposed. The proposed neuro-fuzzy controller allows union operation of input fuzzy sets in the antecedents to cover bigger input domain compared with the complete structure rule which consists of AND combination of all input variables in its premise. To construct the proposed neuro-fuzzy controller, we consider the multiple-term unified logic processor (MULP) which consists of OR and AND fuzzy neurons. The fuzzy neurons exhibit learning abilities as they come with a collection of adjustable connection weights. In the development stage, the genetic algorithm (GA) constructs a Boolean skeleton of the proposed neuro-fuzzy controller, while the stochastic reinforcement learning refines the binary connections of the GA-optimized controller for further improvement of the performance index. An inverted pendulum system is considered to verify the effectiveness of the proposed method by simulation and experiment.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.05a
• /
• pp.174-177
• /
• 2016

Wireless network-on-chip (WNoC) can alleviate critical path problem of existing typical NoCs by integrating radio-frequency module on router. In this paper, core-connection-aware genetic algorithm-based core and WIR mapping methodology at small world WNoC is presented. The methodology could optimize the critical path between cores with heavy communication. The 33% of average latency improvement is achieved compared to random mapping methodology.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2002.12a
• /
• pp.375-378
• /
• 2002

In this paper we propose parallel GA to optimize mutation rate and crossover rate using server-client model. The performance of GA depend on the good choice of crossover and mutation rates. Although many researcher has been study about the good choice, it is still unsolved problem. proposed GA optimize crossover and mutation rates trough evolving subpopulation. In virtue of the server-client model, these parameters can be evolved rapidly with relatively low-grade

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.5
• /
• pp.294-302
• /
• 2020

In a genetic algorithm, computer simulations are performed based on the natural evolution process of life, such as selection, crossover, and mutation. The genetic algorithm searches the approximate optimal solution by the parallel arrangement of Schema, which has a short definition length, low order, and high adaptability. This study examined the possibility of improving the efficiency of the optimal solution by considering the characteristics of the building block hypothesis, which are one of the key operating principles of a genetic algorithm. This study evaluated the efficiency of the optimization results according to the gene sequence for the implementation in solving problems. The optimal design problem of the water pipe was selected, and the genetic arrangement order reflected the engineering specificity by dividing into the existing, the network topology-based, and the flowrate-based arrangement. The optimization results with a flowrate-based arrangement were, on average, approximately 2-3% better than the other batches. This means that to increase the efficiency of the actual engineering optimization problem, a methodology that utilizes clear prior knowledge (such as hydraulic properties) to prevent such excellent solution characteristics from disappearing is essential. The proposed method will be considered as a tool to improve the efficiency of large-scale water supply network optimization in the future.

• Proceedings of the KIEE Conference
• /
• 2015.07a
• /
• pp.1353-1354
• /
• 2015

본 연구에서는 관측자료 기반의 안개 예보를 수행하기 위해 특징선택을 이용한 SVR 회귀분석 기반 시정 예측 가이던스를 개발하였다. 예측에 필요인자를 사전에 선택하는 유전알고리즘 기반의 최적화 방법을 적용하여, 관측된 여러 기상인자의 입력인자 중 실제 시정을 예측하기 위한 입력인자를 선택하여 준다. 지점별 안개발생에 필요한 입력인자 및 예측 모델을 구성하여 통합적인 예측 모델이 아닌 각 지점에 최적화된 정보를 제공할 수 있도록 예측을 수행한다. 자료의 수집 특성상 3시간 간격으로 3시간 예보를 위한 시정을 예측하고, 예측 모델의 검증을 위해 현업의 수치모델 기반의 시정예측 정보와의 비교를 통해 실제 안개 시점에 대해 비교 분석하였고 그 결과를 통해 긍정적인 효과를 보였다. 예측모델을 적용하여 지도에 예측시정 정보를 제공하는 표출 시스템을 통해 실시간 가이던스를 제공하고자 연구를 수행하였다.

• The KIPS Transactions:PartB
• /
• v.17B no.1
• /
• pp.63-68
• /
• 2010

In this paper, we propose a multiresolution stereo matching method based on genetic algorithm using edge information. The proposed approach considers the matching environment as an optimization problem and finds the solution by using a genetic algorithm. A cost function composes of certain constraints which are commonly used in stereo matching. We defines the structure of chromosomes using edge pixel information of reference image of stereo pair. To increase the efficiency of process, we apply image pyramid method to stereo matching and calculate the initial disparity map at the coarsest resolution. Then initial disparity map is propagated to the next finer resolution, interpolated and performed disparity refinement. We valid our approach not only reduce the search time for correspondence but alse ensure the validity of matching.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.13 no.2
• /
• pp.299-304
• /
• 2018

An improved genetic algorithm was proposed for pattern synthesis of an adaptive beam forming system using phased array antennas. The proposed genetic algorithm is an algorithm that adds acquired characteristics procedure to solve local optimization using the diversity. The performance of the proposed genetic algorithm is verified through the problem of finding a suitable chromosome for a picture composed of binary. And it is confirmed that it is suitable for the adaptive beam forming system based on the performance problem of combining main beam and two pattern nulls.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2002.05a
• /
• pp.127-130
• /
• 2002

본 논문은 수학적으로 모델링하기 어려운 비선형 시스템을 위한 새로운 계층적 규칙 기반 퍼지 시스템 모델링 기법을 제안한다. 제안된 기법은 퍼지 규칙 기반 구조를 상위 규칙 기반과 하위 규칙 기반으로 나누어 계층화 시키는 것이다 계층적 퍼지 규칙을 적용함으로써 퍼지 규칙을 효율적이고 논리적으로 이용할 수 있다. 퍼지 규칙의 효율적, 논리적 사용은 퍼지 시스템의 정확성을 높일 수 있고 구조를 명료화 시킬 수 있다. 유전 알고리즘은 제안된 퍼지 규칙의 파라미터 최적화 과정에 이용된다. 가스로 데이터에 대한 퍼지 모델링 결과를 통해서 제안된 기법의 타당성 및 효용성을 검증하고 타 기법의 결과와 비교한다.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.26 no.4
• /
• pp.275-281
• /
• 2013

In this paper, determination of the scalability of the cluster composed common personal computer was performed when optimization of reinforced concrete structure using genetic algorithm. The goal of this research is watching the potential of multi-core-PC cluster for optimization of seismic design of reinforced-concrete structures. By increasing the number of core-processer of cluster, decreasing of computation time per each generation of genetic algorithm was observed. After classifying the components in singular personal computer, the estimation of the expected bottle-neck phenomenon and comparison with wall-clock time and Amdahl's law equation was performed. So we could obseved the scalability of the cluster appear complex tendency. For separating the bottle-neck phenomenon of physical and algorithm, the different size of population was selected for genetic algorithm cases. When using 64 core-processor, the efficiency of cluster is low as 31.2% compared with Amdahl's law efficiency.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.11a
• /
• pp.335-338
• /
• 2012

유전 알고리즘 (Genetic Algorithm)은 기존의 알고리즘 개발방법을 통하여 해결하기 어려운 최적화 등의 문제를 해결하기 위한 자연계의 진화과정을 모방한 방법이다. 본 연구에서는 유전 알고리즘을 이용하여 KOSPI 200에서 거래되고 있는 증권의 매수/매도 종목을 추천하는 방법을 제시한다. 이를 위하여 기술적 분석 (Technical Analysis) 방법 중에서 Slow Stochastic 지표와 MACD 지표를 이용하여, 매일매일 두 지표가 나타내는 매매 신호를 기반으로 해당하는 각각의 종목에 대해 최근 가장 좋은 수익률을 나타내는 매수/매도 종목을 추천하는 방법을 구현한다.