• 한국신재생에너지학회:학술대회논문집
• /
• 2007.06a
• /
• pp.404-408
• /
• 2007

현재 국내에서 운용중인 풍력발전시스템은 국내 풍력자원에 대한 정확한 정보의 부재와 국내 풍황에 맞지 않는 국외 모델을 그대로 운용하는 등의 몇 가지 문제를 드러내었다. 본 연구의 목적은 국내 연안의 해상에서 한국형 해상풍력터빈을 설치하기 위한 잠재적 최적위치와 풍황자료 산출 최적화 알고리즘을 구현하는 것이다. 최적화 알고리즘은 얕은 수심 분포와 연안에서의 거리를 제약조건으로 하고 최대 에너지밀도를 가진 지점을 구하는 것으로 정식화하였다. 풍황자료 산출을 위해서 국내 연안의 해상 풍황자료를 포함하는 기상풍황자료를 통계적 모델로 분석하여 바람지도를 작성하였다. 이 바람지도를 이용하여 지질 통계학 분야의 관측기법인 크리깅 모델을 구성하고, 전역최적화기법인 유전자알고리즘을 이용하여 제약조건을 만족하는 최대에너지밀도값과 그 위치를 도출하였다. 수치최적화 결과 우리나라 풍력 자원의 대략적인 잠재량과 현황파악이 가능하였고, 해상풍력발전단지가 조성 가능한 개략적인 위치를 예측할 수 있었다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.22 no.3
• /
• pp.495-504
• /
• 2012

This paper presents various speed optimization techniques for software implementation of the HIGHT block cipher on CPUs and GPUs. We considered 32-bit and 64-bit operating systems for CPU implementations. After we applied the bit-slicing and byte-slicing techniques to HIGHT, the encryption speed recorded 1.48Gbps over the intel core i7 920 CPU with a 64-bit operating system, which is up to 2.4 times faster than the previous implementation. We also implemented HIGHT on an NVIDIA GPU equipped with CUDA, and applied various optimization techniques, such as storing most frequently used data like subkeys and the F lookup table in the shared memory; and using coalesced access when reading data from the global memory. To our knowledge, this is the first result that implements and optimizes HIGHT on a GPU. We verified that the byte-slicing technique guarantees a speed-up of more than 20%, resulting a speed which is 31 times faster than that on a CPU.

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

최근 CPU의 코어 클럭을 높이는 대신 동일한 클럭의 코어 수를 늘림으로써 성능을 향상시키고 전력 소모도 줄이는 멀티코어가 등장하고 있다. 이러한 멀티코어 플랫폼의 등장으로 인해 해당 코어들의 자원을 효율적으로 사용하여 동시에 처리하는 병렬처리 기법에 관한 연구가 활발히 진행되고 있다. 본 논문에서는 병렬처리 기법의 종류 중 하나인 Advanced SIMD기반의 NEON을 적용한 고속화 ME 방법론을 연구 및 제안하였다. 최소화 SAD를 구하고 정확한 모션벡터를 선정하기 위해 다양한 ME 방법 중 전역탐색기법을 NEON에 적용하여 동시에 128비트씩 연산을 수행하였다. 그 결과 영상의 크기에 따라 계산 성능이 최대 60% 이상 향상되는 효과를 검증하였다.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.40 no.6
• /
• pp.87-94
• /
• 2003

One of the important fields for heuristic algorithm is how to balance between Intensification and Diversification. Ant Colony Optimization(ACO) is a new meta heuristic algorithm to solve hard combinatorial optimization problem. It is a population based approach that uses exploitation of positive feedback as well as Breedy search It was first Proposed for tackling the well known Traveling Salesman Problem(TSP). In this paper, we deal with the performance improvement techniques through balance the Intensification and Diversification in Ant Colony System(ACS). First State Transition considering the number of times that agents visit about each edge makes agents search more variously and widen search area. After setting up criteria which divide elite tour that receive Positive Intensification about each tour, we propose a method to do addition Intensification by the criteria. Implemetation of the algorithm to solve TSP and the performance results under various conditions are conducted, and the comparision between the original An and the proposed method is shown. It turns out that our proposed method can compete with the original ACS in terms of solution quality and computation speed to these problem.

• Proceedings of the KIEE Conference
• /
• 2015.07a
• /
• pp.493-494
• /
• 2015

전원설비 투자계획은 주어진 기간 하에서 최적 발전기 투입용량 및 시기를 결정하는 문제이다. 전원설비의 준공일정은 다양한 사회적 요인의 영향으로 불확실성에 노출되어 있다. 본 논문에서는 전원설비 준공 불확실성을 고려한 전원설비 계획 문제를 제시한다. 발전설비의 준공지연 불확실성은 이산 확률론적 밀도함수를 갖는 확률변수로 표현된다. 최적화 문제에서 확률변수를 고려하기 위해 2단계 확률론적 계획법이 도입된다. 주문제-부문제로 분해된 최적화 문제는 쌍대함수 정보를 교환하는 반복연산을 수행하여 최적 전역해에 도달할 수 있다.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.8 no.5
• /
• pp.98-106
• /
• 1998

This paper proposes an efficient learning algorithm for improving the training performance of the neural network. The proposed method improves the training performance by applying the backpropagation algorithm of a global optimization method which is a hybrid of a stochastic approximation and a conjugate gradient method. The approximate initial point for f a ~gtl obal optimization is estimated first by applying the stochastic approximation, and then the conjugate gradient method, which is the fast gradient descent method, is applied for a high speed optimization. The proposed method has been applied to the parity checking and the pattern classification, and the simulation results show that the performance of the proposed method is superior to those of the conventional backpropagation and the backpropagation algorithm which is a hyhrid of the stochastic approximation and steepest descent method.

• Journal of Korea Multimedia Society
• /
• v.12 no.10
• /
• pp.1418-1426
• /
• 2009

There has been a lot of interest in an effective method for background subtraction in an effort to separate foreground objects from a predefined background image. Promising results on background subtraction using statistical methods have recently been reported are robust enough to operate in dynamic environments, but generally require very large computational resources and still have difficulty in obtaining clear segmentation of objects. We use a simple running-average method to model a gradually changing background, instead of using a complicated statistical technique. We employ a single global threshold vector, optimized by a genetic algorithm, instead of pixel-by-pixel thresholds. A new fitness function is defined and trained to evaluate segmentation result. The system has been implemented on a PC with a webcam, and experimental results on real images show that the new method outperforms an existing method based on a mixture of Gaussian.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.8 no.1
• /
• pp.149-157
• /
• 2013

This paper describes a global path planning method and path optimization algorithm for autonomous mobile robot based on the virtual elastic force in a grid map environment. A goal of a path planning is information for a robot to go its goal point from start point by a effective way. The AStar algorithm is a well-known method for a grid based path planning. This paper suggest a path optimization method by a virtual elastic force and compare the algorithm with a orignal AStar method. The virtual elastic force makes a shorter and smoother path. It is a profitable algorithm to optimize a path in a grid environment.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.4
• /
• pp.1-12
• /
• 2016

The Harmony Search Algorithm (HSA) is one of the recently developed metaheuristic optimization algorithms. Since the development of HSA, it has been applied by many researchers from various fields. The increasing complexity of problems has created enormous challenges for the current technique, and improved techniques of optimization algorithms are required. In this study, to improve the HSA in terms of a structural setting, a new HSA that has structural characteristics, called the Multi-layered Harmony Search Algorithm (MLHSA) was proposed. In this new method, the structural characteristics were added to HSA to improve the exploration and exploitation capability. In addition, the MLHSA was applied to optimization problems, including unconstrained benchmark functions and water distribution system pipe diameter design problems to verify the efficiency and applicability of the proposed algorithm. The results revealed the strength of MLHSA and its competitiveness.

• Journal of Intelligence and Information Systems
• /
• v.15 no.4
• /
• pp.99-121
• /
• 2009

Recently, there have been many studies that predict corporate bankruptcy using data mining techniques. Although various data mining techniques have been investigated, some researchers have tried to combine the results of each data mining technique in order to improve classification performance. In this study, we classify 4 types of data mining techniques via their characteristics and select representative techniques of each type then combine them using a genetic algorithm. The genetic algorithm may find optimal or near-optimal solution because it is a global optimization technique. This study compares the results of single models, typical combination models, and the proposed integration model using the genetic algorithm.