• Journal of Computational Design and Engineering
• /
• 제3권1호
• /
• pp.24-36
• /
• 2016

During the past decade, solving complex optimization problems with metaheuristic algorithms has received considerable attention among practitioners and researchers. Hence, many metaheuristic algorithms have been developed over the last years. Many of these algorithms are inspired by various phenomena of nature. In this paper, a new population based algorithm, the Lion Optimization Algorithm (LOA), is introduced. Special lifestyle of lions and their cooperation characteristics has been the basic motivation for development of this optimization algorithm. Some benchmark problems are selected from the literature, and the solution of the proposed algorithm has been compared with those of some well-known and newest meta-heuristics for these problems. The obtained results confirm the high performance of the proposed algorithm in comparison to the other algorithms used in this paper.

• 전산구조공학
• /
• 제8권4호
• /
• pp.181-187
• /
• 1995

동적해석에 대한 최근의 연구는 구조물의 자유도보다 적은 모우드 형상들을 사용하여 구조물을 해석하는 효과적인 방법을 찾는데 있다. Ritz알고리즘과 모우드가속도법은 모우드중첩법을 개선하고자 개발되었는데, Ritz알고리즘은 하중의 공간적 특성을 포함하지만, 계산과정에서 유용한 직교성을 잃는 경향이 있으며, 모우드가속도법은 만족할 만한 해를 얻기 위해 많은 수의 모우드 형상들을 고려해야 하는 단점이 있다. 또한 앞의 두 방법을 조합한 방법이 개발되었으나 너무 많은 계산과정과 시간을 필요로 한다. 이 연구의 목적은 Lanczos알고리즘을 이용하여 Ritz알고리즘의 효율성과 정확성을 보완하고 이를 프로그램화하여 검증하는데 있다. 본 연구의 결과로부터 Modified Ritz알고리즘을 이용한 동적해석방법이 합리적임이 증명되었다.

• 한국통신학회논문지
• /
• 제35권11A호
• /
• pp.1027-1037
• /
• 2010

본 논문에서는 블록 대각화 프리코딩 기법을 사용하는 다중 사용자 MIMO-OFDM 하향링크 시스템에서 전체시스템의 복잡도와 계산양을 감소시키기 위한 선형 보간법 기반 블록 대각화 프리코딩 근사화 기법을 제안한다. 일반적인 블록 대각화 프리코팅 기법을 다중 사용자 MIMO-OFDM 시스템에 그대로 적용할 경우 계산양이 부반송파의 수에 비례하여 증가하는 단점이 존재한다. 제안하는 선형 보간법 기반 블록 대각화 프리코딩 근사화 기법은 시스템의 복잡도와 계산양을 감소시키기 위하여 선형 보간법을 프리코딩 행렬의 근사화에 사용하여 성능을 최대한 유지하면서 계산양을 매우 크게 감소시킬 수 있다. 본 논문에서 제안된 선형 보간법 기반 블록 다각화 프리코딩 근사화 기법을 이용하여 시스템의 계산양을 매우 감소시킬 수 있음을 모의실험을 통해 증명했다.

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

To improve the recognition accuracy of a developed artificial odor discrimination system for three mixture fragrance recognition, Fuzzy Similarity based Self-Organized Network inspired by Immune Algorithm (F-SONIA) is proposed. Minimum, average, and maximum values of fragrance data acquisitions are used to form triangular fuzzy numbers. Then the fuzzy similarity treasure is used to define the relationship between fragrance inputs and connection strengths of hidden units. The fuzzy similarity is defined as the maximum value of the intersection region between triangular fuzzy set of input vectors and the connection strengths of hidden units. In experiments, performances of the proposed method is compared with the conventional Self-Organized Network inspired by Immune Algorithm (SONIA), and the Fuzzy Learning Vector Quantization (FLVQ). Experiments show that F-SONIA improves recognition accuracy of SONIA by 3-9％. Comparing to the previously developed artificial odor discrimination system that used FLVQ as pattern classifier, the recognition accuracy is increased by 14-25％.

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

The general conceptual constitution of structural optimization is formulated. The algorithm using the gradient projection method and design sensitivity analysis is discussed. Examples of minimum-weight design for six-story steel plane frame are taken to illustrate the application of this algorithm. The advantages of this algorithm such as marginal cost and design sensitivity analysis as well as system analysis are explained.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1998년도 The Third Asian Fuzzy Systems Symposium
• /
• pp.36-41
• /
• 1998

This paper presents a stabilization algorithm for a class of fuzzy systems with singleton consequect. To this aim, we introduce two canonical forms of an unforced fuzzy system and a stability theorem. A design example is shown to verify the stabilization algorithm.

• The Journal of the Acoustical Society of Korea
• /
• 제16권2E호
• /
• pp.38-46
• /
• 1997

The objective of the paper is to compare the computational complexity of five algorithms for computing time-domain second-order Volterra filter outputs in terms of number of real multiplication and addition operations required for implementation. This study shows that if the filter memory length is greater that or equal to 16, the fast algorithm using the overlap-save method and the frequency-domain symmetry properties of the quadratic coefficients is the most efficient among the algorithms investigated in this paper, When the filter memory length is less than 16, the algorithm using the time-domain symmetry properties is better than any other algorithm.

• 충청수학회지
• /
• 제6권1호
• /
• pp.139-155
• /
• 1993

A new sequential algorithm and computational results for large-scale linear programs with a special structure were presented in the previous paper [9]. In this paper, a parallel version of the algorithm was developed for a hypercube multiprocessor architecture NCUBE2. Computational results using 128 processors are presented for a randomly generated large-scale sparse or dense problems with the number of variables up to 256 and constraints up to 5 million.

• 대한전자공학회논문지
• /
• 제21권6호
• /
• pp.70-77
• /
• 1984

This paper represents a fast computational algorithm for the discrete sine transform defined by Kekre and Solanki. Techniques are developed to factor the discrete sine trans form matrix into M=log2 2N matrices, where the number(N) of sampled data points is a power of two. Each factorial matrix contains not more than two non-zero real elem tints in any row or column. As a result of this method, the exact a배orithm for the fast discrete sine transform is accomplished. The algorithm is illustiated by a signal flow graph, which may be readily translated to hardware or software implementation.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 추계종합학술대회 논문집
• /
• pp.597-600
• /
• 1999

In this paper, we propose a fast object-tracking algorithm in a moving picture. The proposed object-tracking algorithm is based on a projection scheme. More specifically, to alleviate the computational complexities of the previous motion estimation methods, we propose to use the projected row and column 1-D image data to extract the motion information. Experimental results show that the proposed method can detect the motion of an object fairly well with reduced computational time.