• Journal of the Korean Data and Information Science Society
• /
• v.24 no.3
• /
• pp.495-504
• /
• 2013

Evolutionary algorithms have been applied to multi-objective optimization problems by approximation methods using computational intelligence. Those methods have been improved gradually in order to generate more exactly many approximate Pareto optimal solutions. The paper introduces a new method using support vector machine to find an approximate Pareto frontier in multi-objective optimization problems. Moreover, this paper applies an evolutionary algorithm to the proposed method in order to generate more exactly approximate Pareto frontiers. Then a decision making with two or three objective functions can be easily performed on the basis of visualized Pareto frontiers by the proposed method. Finally, a few examples will be demonstrated for the effectiveness of the proposed method.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2010.11a
• /
• pp.1057-1058
• /
• 2010

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.43 no.3 s.345
• /
• pp.15-20
• /
• 2006

A Newton-Raphson Method for table driven algorithm is presented in this paper. We concentrate the approximation of square root by using Newton-Raphson method. We confirm that this method has advantages of accurate and fast processing with optimized initial point. Hence the selection of the fitted initial points used in approximation of Newton-Raphson algorithm is important issue. This paper proposes that log scale based on geometric wean is most profitable initial point. It shows that the proposed method givemore accurate results with faster processing speed.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.29 no.9 s.240
• /
• pp.1199-1208
• /
• 2005

Nowadays, it is performed actively to optimize by using an approximate model. This is called the approximate optimization. In addition, the sequential approximate optimization (SAO) is the repetitive method to find an optimum by considering the convergence of an approximate optimum. In some recent studies, it is proposed to increase the fidelity of approximate models by applying the sequential sampling. However, because the accuracy and efficiency of an approximate model is directly connected with the design area and the termination criteria are not clear, sequential sampling method has the disadvantages that could support an unreasonable approximate optimum. In this study, the SAO is executed by using trust region, Kriging model and Optimal Latin Hypercube design (OLHD). Trust region is used to guarantee the convergence and Kriging model and OLHD are suitable for computer experiment. finally, this SAO method is applied to various optimization problems of highly nonlinear mathematical functions. As a result, each approximate optimum is acquired and the accuracy and efficiency of this method is verified by comparing with the result by established method.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.11a
• /
• pp.62-65
• /
• 2014

근사문자열매칭 알고리즘은 검색엔진, 컴퓨터보안, 생물정보학 등 많은 분야에서 연구되고 있다. 근사문자열매칭에서는 거리함수를 이용하여 오차를 측정한다. 거리함수로는 해밍거리, 편집거리, 확장편집거리 등이 있다. 이때 확장편집거리는 mn) 시간과 공간에 계산할 수 있으며, 최근 m개의 쓰레드를 이용하여 O(m+n) 시간과 O(mn) 공간을 이용한 병렬알고리즘이 제시되었다. 본 논문에서는 기존의 확장편집거리를 계산하는 병렬알고리즘을 개선한 효율적인 병렬알고리즘을 제시한다. 기존의 병렬알고리즘을 최적화하고, 기존의 병렬알고리즘, 전역메모리만 사용한 최적화된 병렬알고리즘, 공유메모리를 활용한 최적화된 병렬알고리즘의 수행시간을 비교한다. 실험 결과, 개선된 병렬알고리즘이 기존의 병렬알고리즘보다 전처리단계에서 16 ~ 63배 이상, 모든 단계에 대해 19 ~ 24배 이상 빠른 수행시간을 보였다.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.8
• /
• pp.3-9
• /
• 2015

Under the maximum transmit power constraint and the minimum rate constraint, we propose the optimal number of transmit antennas and transmit power which maximize energy-efficiency (EE) in multi-user multiple-input multiple-output (MIMO) downlink system with the maximal ratio transmission (MRT) precoding. Because the optimization problem for the instantaneous channel is difficult to solve, we use independence of individual channel, average channel gain and path loss to approximate the objective function. Since the approximated EE optimization problem is two-dimensional search problem, we find the optimal number of transmit antennas and transmit power using Lagrange multipliers and our proposed algorithm. Simulation results show that the number of transmit antennas and power obtained by proposed algorithm are almost identical to the value by the exhaustive search.

• The Journal of the Acoustical Society of Korea
• /
• v.20 no.5
• /
• pp.61-68
• /
• 2001

In this paper, an analytical method and a difference approximation method to calculate the gradient of an objective function have been applied to the directivity optimization in an adaptive ultrasonic transducer which is combined with a point source array and an optimization algorithm (DFP method). To compare these two methods, quasi-ideal .beam with a beam width and direction specified are chosen as the desired directivity. As the numerical results, the difference approximation method shows better suppressive capacity of side lobe level, good stability in the convergence processing, faster convergence speed and excellent adaptability compared with the analytical method.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2002.05a
• /
• pp.660-665
• /
• 2002

일반적으로 유한요소 모델로부터 구한 해석결과는 대상 구조물의 모드 실험결과와 오차를 보인다. 이러한 오차로 인해서 유한요소 모델의 효용성에 한계가 발생하게 되면, 모델의 신뢰성을 높일 수 있도록 모델을 보정하는 절차가 필요하다. 유한요소 모델 개선은 이러한 오차를 줄이기 위해서 유한요소 모델을 변경하는 체계적인 접근법이다. 유한요소 모델에서 변경할 수 있는 매개변수의 개수는 실험결과의 개수보다 훨씬 많으므로 실험결과와 일치되는 개선된 모델의 수는 무한하다고 할 수 있다. 그러나, 개선된 유한요소 모델이 물리적 타당성을 갖도록 매개변수의 선택과 변경에 제한을 주면 초기 유한요소 모델에 비해서 실험결과와의 오차가 개선된 근사해만 존재하게 된다. 따라서, 모델 개선 과정을 통해서 구한 개선된 모델은 오차의 평가기준 또는 목적함수에 따라서 정해진 다양한 근사해 중 하나이다. 기존의 모델 개선 방법에서는 실험결과와의 오차를 나타내는 단 하나의 평가기준 또는 목적함수를 사용하고 이를 최소화하는 모델을 구한다. 최적화 결과를 얻기 전에는 사용된 평가기준이 타당한지 검토할 수 없으므로 대부분의 경우, 시행착오 방법으로 목적함수를 설정하게 된다. 본 논문에서는 이러한 문제점을 해결하기 위해서 다목적 최적화 개념을 이용한 평가기준을 소개하고 특히, 대화식 다목적 최적화 기법을 이용하여 유한요소 모델을 개선한다.

• The KIPS Transactions:PartB
• /
• v.14B no.5
• /
• pp.377-382
• /
• 2007

This paper proposes a training algorithm for global optimization of the parameters of radial basis function networks. Since conventional training algorithms usually perform only local optimization, the performance of the network is limited and the final network significantly depends on the initial network parameters. The proposed hybrid simulated annealing algorithm performs global optimization of the network parameters by combining global search capability of simulated annealing and local optimization capability of gradient-based algorithms. Via experiments for function approximation problems, we demonstrate that the proposed algorithm can find networks showing better training and test performance and reduce effects of the initial network parameters on the final results.

• Proceedings of the Korean Society of Propulsion Engineers Conference
• /
• 2011.04a
• /
• pp.61-65
• /
• 2011

In this paper, the nozzle design with asymmetric configuration using the optimal method is used in order to improve the under- and over-expansion problem of the flow at the supersonic turbine nozzle. For the design of nozzle contour, 8 design variables are selected and the total-to-static efficiency from the nozzle inlet to the wake outlet is considered as the objective function to be maximized. The Fluent6.3 and the iSIGHT-FD program are used for calculation of nozzle flow and design optimization respectively. RBF(Radial Basis Function) method is chosen for approximate optimization algorithm. It is shown that the static efficiency of improved nozzle design increases 1.35% and loss coefficient decreases 19.85% as compared to baseline design.