• 한국지능시스템학회논문지
• /
• 제19권2호
• /
• pp.180-184
• /
• 2009

저전력 환경에서의 메모리 집적도가 증가함에 따라 메모리는 soft error에 매우 민감해졌다. 오류 정정 코드는 일반적으로 양산 이후 메모리의 soft error를 수정하기 위해서 사용된다. 본 논문에서는 새로운 저전력 오류 정정 코드의 설계방법을 제안한다. 오류 정정 코드의 전력소비는 parity check 행렬의 선택을 통해 최소화 될 수 있다. 따라서 오류 정정 코드의 설계는 비선형 최적화 문제로 포함되는데 우리는 다양한 유전 연산자를 포함하는 유전자 알고리즘을 이용하여 이 문제를 해결한다. 제안하는 방법을 Hamming code와 Hsiao code에 적용하여 그 효율성을 입증하였다.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 1995년도 봄 학술발표회 논문집
• /
• pp.187-194
• /
• 1995

Traditional genetic algorithms(GA) have mostly used binary code for representing design variable. The binary code GA has many difficulties to solve optimization problems with continuous design variables because of its targe computer core memory size, inefficiency of its computing time, and its bad performance on local search. In this paper, a real code GA is proposed for dealing with the above problems. So, new crossover and mutation processes of read code GA are developed to use continuous design variables directly. The results of real code GA are compared with those of binary code GA for several single and multiple objective optimization problems. As results of comparisons, it is found that the performance of the real code GA is better than that of the binary code GA, and concluded that the rent code GA developed here can be used for the general optimization problem.

• 전산구조공학
• /
• 제8권2호
• /
• pp.123-132
• /
• 1995

Genetic Algorithms(GA)는 생명체의 자연진화 법칙에 기초한 최적화 방법으로 그 범용성이 높이 평가되어지고 있다. 기존의 GA는 대부분 설계변수로 2진수형 코드를 사용하는데, 이는 실수형 설계변수로 구성된 최적화 문제를 해결하기 위해 컴퓨터 주 기억용량을 많이 사용하여야 하며, 계산 시간 면에서도 비효율적이고 또한 국부탐색 능력도 떨어지는 단점이 있다. 따라서 본 연구에서는 GA에 의한 최적화과정에서 실수형 설계변수를 직접 사용할 수 있도록 교배와 돌연변이 과정을 새로이 정식화하였다. 그리고 여러 형태의 단일 및 다목적함수 최적화 문제에 대해 실수형 GA와 2진수형 GA의 결과를 비교 검토하였다. 비교 검토 결과, 실수형 GA의 성능이 2진수형 GA보다 우수함을 알 수 있었고, 일반 최적화 방법으로 실수형 GA를 사용하여도 무방하리라 본다.

• 한국자동차공학회논문집
• /
• 제12권3호
• /
• pp.51-58
• /
• 2004

Optimization of engine desist and operation parameters using a genetic algorithm was demonstrated for direct injection diesel engine combustion. A micro genetic algorithm and a modified KIVA-3V code were used for the analysis and optimization of the engine combustion. At each generation of the optimization step the micro genetic algorithm generated five groups of parameter sets, and the five cases of KIVA-3V analysis were to be performed either in series or in parallel. The micro genetic algorithm code was also parallelized by using MPI programming, and a multi-CPU parallel supercomputer was used to speed up the optimization process by four times. An example case for a fixed engine speed was performed with six parameters of intake swirl ratio, compression ratio, fuel injection included angle, injector hole number, SOI, and injection duration. A simultaneous optimization technique for the whole range of engine speeds would be suggested for further studies.

• 한국지능시스템학회논문지
• /
• 제18권5호
• /
• pp.611-616
• /
• 2008

Error correcting codes는 일반적으로 soft error를 막기 위해서 사용된다. single error의 수정과 double error의 검출(SEC-DED) 코드들은 이런 목적으로 사용된다. 본 논문에서는 이러한 회로의 크기, 지연시간, 전력 소비를 선택적으로 최소로 하는 SEC-DED의 설계방법을 제안한다. 이러한 SEC-DED의 설계는 비선형 최적화 문제로 포함되는데 우리는 다목적 유전자 알고리즘을 이용하여 이 문제를 해결한다. 제안하는 방법은 여러 가지 SEC-DED code들을 제공하여 사용자의 환경에 따라 알맞은 회로를 선택할 수 있도록 한다. 제안하는 방법을 효율적인 ECC코드로 알려져 있는 odd-column weight Hsiao code에 적용하여 그 효율성을 입증하였다.

• 한국인터넷방송통신학회논문지
• /
• 제16권6호
• /
• pp.135-140
• /
• 2016

본 논문에서는 유전정보 DNA 표준 코드인 [UC;AG]를 64괘로 분석했다. 인간의 유전정보를 담고 있는 DNA는 인산과 당에 A(아데닌) C(시토신) G(구아닌) T(티민) 등 네 종류의 염기가 30억쌍 이어 붙여진 형태이다. DNA 표준 코드를 64괘로 나타내고, 이 코드를 Kronecker product를 이용하여 $16{\times}4$행렬로 나타냈다. 이 $16{\times}4$ 행렬은 이중나선의 중복성을 가지고 있으며, 이 중복성을 제거하면 RNA코드 $4{\times}4$ 행렬을 얻는다. $16{\times}4$행렬은 Kronecker product를 이용하여 소 행렬로 분해되었다. DNA 이중나선을 행렬로 표시하고 유전정보 괘 배열 코드를 분석하였으며 그 예를 예 5, 6에 나타냈다.

• 한국정밀공학회지
• /
• 제20권10호
• /
• pp.169-176
• /
• 2003

Genetic algorithm (GA), which has a powerful searching ability and is comparatively easy to use and also to apply, is in the spotlight in the field of the optimization for mechanical systems these days. However, it also contains some problems of slow convergence and low efficiency caused by a huge amount of repetitive computation. To improve the processing efficiency of repetitive computation, some papers have proposed paralleled GA these days. There are some cases that mention the use of gray code or suggest using gray code partially in GA to raise its slow convergence. Gray code is an encoding of numbers so that adjacent numbers have a single digit differing by 1. A binary gray code with n digits corresponds to a hamiltonian path on an n-dimensional hypercube (including direction reversals). The term gray code is open used to refer to a reflected code, or more specifically still, the binary reflected gray code. However, according to proposed reports, gray code GA has lower convergence about 10-20% comparing with binary code GA without presenting any results. This study proposes new Full gray code GA (FGGA) applying a gray code throughout all basic operation fields of GA, which has a good data processing ability to improve the slow convergence of binary code GA.

• 한국IT서비스학회지
• /
• 제10권3호
• /
• pp.167-177
• /
• 2011

Code obfuscation is a technique that protects the abstract data contained in a program from malicious reverse engineering and various obfuscation methods have been proposed for obfuscating intention. As the abstract data of control flow about programs is important to clearly understand whole program, many control flow obfuscation transformations have been introduced. Generally, inlining is a compiler optimization which improves the performance of programs by reducing the overhead of calling invocation. In code obfuscation, inlining is used to protect the abstract data of control flow. In this paper, we define new control flow complexity metric based on entropy theory and N-Scope metric, and then apply genetic algorithm to obtain optimal inlining results, based on the defined metric.

• 한국생물공학회:학술대회논문집
• /
• 한국생물공학회 2005년도 생물공학의 동향(XVI)
• /
• pp.17-17
• /
• 2005

In this presentation, we will discuss several recent achievements developed in my laboratory for microarray-based diagnosis of human genetic mutations including HNF-1 and BRCA1 mutations. To determine the presence of the genetic mutations in a human sample, we prepared allele-specific oligonucleotide chips from selected mutation sites and generated target probes using a tow-step method for Cy-3 DNA $samples^{1)}$ or in vitro transcription of promoter-tagged PCR products for Cy-3 RNA $samples^{2)}$. Hybridization of the target probes to the chips successfully identified all of the genotypes for the tested sites. For more reliable diagnosis, we also employed single base extension (SBE) reaction and zip-code microarray technique for our strategy. Particularly we developed an efficient PNA zip-code microarray for the detection of $HNF-1{\alpha}$ $mutations^{3)}$. Using multiplex SBE reactions and zip-code strategy, we were able to correctly diagnose several mutation sites in exon 2 of $HNF-1{\alpha}$ with a wild-type and mutant including a MODY3 patient. These works represent successful applications of DNA microarray technology for the diagnosis of human genetic mutations.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2003년도 ISIS 2003
• /
• pp.322-325
• /
• 2003

In this paper, we propose n new fuzzy model identification of time series system using wavelet transform and genetic DNA code. Generally, it is well known that the DNA coding method is more diverse in the knowledge expression and better in the optimization performance than the genetic algorithm (GA) because it can encode more plentiful genetic information based on the biological DNA. The proposed method can construct a fuzzy model using the wavelet transform, in which the coefficients are identified by the DNA coding method. Thus, we can effectively get the fuzzy model of the nonlinear system by using the advantages of both wavelet transform and DNA coding method. In order to demonstrate the superiority of the proposed method, it is compared with modeling method using the conventional GA.