• The Journal of the Korea Contents Association
• /
• v.20 no.11
• /
• pp.636-643
• /
• 2020

The differential evolution algorithm is one of the meta-heuristic techniques developed to solve the real optimization problem, which is a continuous problem space. In this study, in order to use the differential evolution algorithm to solve the traveling salesman problem, which is a discontinuous problem space, a random key representation method is applied to the differential evolution algorithm. The differential evolution algorithm searches for a real space and uses the order of the indexes of the solutions sorted in ascending order as the order of city visits to find the fitness. As a result of experimentation by applying it to the benchmark traveling salesman problems which are provided in TSPLIB, it was confirmed that the proposed differential evolution algorithm based on the random key representation method has the potential to solve the traveling salesman problems.

• Journal of Korea Multimedia Society
• /
• v.13 no.6
• /
• pp.875-883
• /
• 2010

In this paper, we present a secure biometric hashing scheme for face recognition by random fusion of global and local features. The Fourier-Mellin transform and Radon transform are adopted respectively to form specialized representation of global and local features, due to their invariance to geometric operations. The final biometric hash is securely generated by random weighting sum of both feature sets. A fourfold key is involved in our algorithm to ensure the security and privacy of biometric templates. The proposed biometric hash can be revocable and replaced by using a new key. Moreover, the attacker cannot obtain any information about the original biometric template without knowing the secret key. The experimental results confirm that our scheme has a satisfactory accuracy performance in terms of EER.

• Proceedings of the Korea Contents Association Conference
• /
• 2012.05a
• /
• pp.63-64
• /
• 2012

차분진화 알고리즘은 Storn 과 Price에 의해 제안된 메타휴리스틱 알고리즘이다. 본 논문에서는 외판원 문제를 해결하기 위한 차분진화 알고리즘을 소개한다. 차분진화 알고리즘은 실수 문제를 위한 알고리즘이므로 외판원 문제를 해결하기 위해 난수 키 표현법을 적용한다. OR Library의 표준 외판원 문제에 적용한 결과 제안한 알고리즘은 외판원 문제 해결에 가능성이 있음을 보여주었다.

• Journal of Korean Institute of Industrial Engineers
• /
• v.31 no.1
• /
• pp.79-86
• /
• 2005

The transportation problem (TP) is one of the traditional optimization problems. Unlike the TP, the fixed charge transportation problem (FCTP) cannot be solved using polynomial time algorithms. So, finding solutions for the FCTP is a well-known NP-complete problem involving an importance in a transportation network design. So, it seems to be natural to use evolutionary algorithms for solving FCTP. And many evolutionary algorithms have tackled this problem and shown good performance. This paper introduces an efficient evolutionary algorithm for the FCTP. The proposed algorithm can always generate feasible solutions without any repair process using the random key representation. Especially, it can guide the search toward the basic solution. Finally, we performed comparisons with the previous results known on the benchmark instances and could confirm the superiority of the proposed algorithm.

• Wind and Structures
• /
• v.16 no.5
• /
• pp.433-455
• /
• 2013

A phase delay spectrum model towards the representation of spatial coherence of stochastic wind fields is proposed. Different from the classical coherence functions used in the spectral representation methods, the model is derived from the comprehensive description of coherence of fluctuating wind speeds and from the thorough analysis of physical accounts of random factors affecting phase delay, building up a consistent mapping between the simulated fluctuating wind speeds and the basic random variables. It thus includes complete probabilistic information of spatial stochastic wind fields. This treatment prompts a ready and succinct scheme for the simulation of fluctuating wind speeds, and provides a new perspective to the accurate assessment of dynamic reliability of wind-induced structures. Numerical investigations and comparative studies indicate that the developed model is of rationality and of applicability which matches well with the measured data at spatial points of wind fields, whereby the phase spectra at defined datum mark and objective point are feasibly obtained using the numerical scheme associated with the starting-time of phase evolution. In conjunction with the stochastic Fourier amplitude spectrum that we developed previously, the time history of fluctuating wind speeds at any spatial points of wind fields can be readily simulated.

• Proceedings of the Korea Contents Association Conference
• /
• 2010.05a
• /
• pp.331-332
• /
• 2010

PSO는 사회 심리학과 진화 계산에 영감을 얻어 Kenney와 Eberhart에 의해 처음 소개되었다. PSO는 다양한 분야의 연속문제들에 성공적으로 적용되어 왔으나, 시퀀셜 문제를 위한 PSO 연구는 거의 없었다. 본 논문에서는 일정 및 순서 문제에 PSO를 적옹하기 위해 난수 표현법을 사용한 PSO를 제안한다. 실험결과 제안한 알고리즘은 일정 및 순저 문제를 해결하기위한 좋은 가능성을 지녔음을 보여주었다.

• Proceedings of the Korea Contents Association Conference
• /
• 2016.05a
• /
• pp.63-64
• /
• 2016

자원 제약이 있는 프로젝트 스케줄링 문제는 NP-hard인 순서기반 문제이다. 본 논문에서는 연속적인 문제 해결에 적합한 차분진화알고리즘에 난수 키 표현법을 적용하여 순서기반 표현을 가능하게 하여 자원 제약이 있는 프로젝트 스케줄링 문제를 해결하고자 한다. 실험 결과 작은 규모의 자원 제약이 있는 프로젝트 문제에 적용하여 난수 키 표현법 기반 차분진화알고리즘의 가능성을 보았다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2018.10a
• /
• pp.613-616
• /
• 2018

Sequence tagging is an important task in Natural Language Processing (NLP), in which the Named Entity Recognition (NER) is the key issue. So far the most widely adopted model for NER in NLP is that of combining the neural network of bidirectional long short-term memory (BiLSTM) and the statistical sequence prediction method of Conditional Random Field (CRF). In this work, we improve the prediction accuracy of the BiLSTM by supporting an aligned word representation mechanism. We have performed experiments on multilingual (English, Spanish and Dutch) datasets and confirmed that our proposed model outperformed the existing state-of-the-art models.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.1
• /
• pp.1-14
• /
• 2010

With the rapid growth of 3D content industry fields, 3D content-based hashing (or hash function) has been required to apply to authentication, trust and retrieval of 3D content. A content hash can be a random variable for compact representation of content. But 3D content-based hashing has been not researched yet, compared with 2D content-based hashing such as image and video. This paper develops a robust 3D content-based hashing based on key-dependent 3D surface feature. The proposed hashing uses the block surface coefficient using shape coordinate of 3D SSD and curvedness for 3D surface feature and generates a binary hash by a permutation key and a random key. Experimental results verified that the proposed hashing has the robustness against geometry and topology attacks and has the uniqueness of hash in each model and key.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.05a
• /
• pp.773-774
• /
• 2005

The knapsack problem (KP) is one of the traditional optimization problems. Specially, multiconstrained knapsack problem (MKP) is well-known NP-hard problem. Many heuristic algorithms and evolutionary algorithms have tackled this problem and shown good performance. This paper presents a novel genetic algorithm for the multiconstrained knapsack problem. The proposed algorithm is called 'Adaptive Link Adjustment'. It is based on integer random key representation and uses additional ${\alpha}$ and ${\beta}$-process as well as selection, crossover and mutation. The experiment results show that it can be archive good performance.