• 한국통신학회논문지
• /
• 제21권2호
• /
• pp.313-325
• /
• 1996

This paper presents a new architecture for full-search block-matching motion estimation. The architecture is based on linear systolic arrays. High speed operation is obtained by feeding reference data, search data, and control signals into the linear systolic array in a pipelined fashion. Input data are fed into the linear systolic array at a half of the processor speed, reducing the required data bandwidth to half. The proposed architecture has a good scalability with respect to the number of processors and input bandwidth when the size of reference block and search range change.

• 한국통신학회논문지
• /
• 제29권12C호
• /
• pp.1623-1632
• /
• 2004

본 논문에서는 전형적인 실내 무선 채널 환경에서 초광대역 (Ultra Wide Band; UWB) 신호의 고속 동기 획득을 위한 Single-Dwell 연속 통기 탐색 기반의 Linear 탐색 알고리즘 및 Bit Reversal 탐색 알고리즘에 대한 성능분석을 수행하였다. IEEE 802.15 Task Group 3a UWB 실내 무선 채널 환경에서 프레임 구간 및 탐색 단위 구간 등의 변화에 따른 모의실험 결과. Linear 탐색 알고리즘보다 Bit Reversal 탐색 알고리즘이 정규화된 평균 동기 획득 소요 시간에 대해 단연 우수함을 확인하였으며, 탐색 종료 구간의 범위 변화에 따른 정규화된 평균 동기 획득 소요 시간이 이상적인 경우와 거의 일치함을 확인하였다. 특히, Bit Reversal 탐색 알고리즘의 경우 탐색 단위 구간이 세밀할수록 동일한 소요 시간에 대해 더욱 정확한 동기 획득 성능을 얻음을 확인할 수 있었다.

• 한국통신학회논문지
• /
• 제30권12C호
• /
• pp.1133-1143
• /
• 2005

본 논문에서는 다중경로 채널 환경의 초광대역 (Ultra Wide Band; UWB) 시스템에서 고속 고신뢰의 동기획득을 위한 향상된 두 단계 신호 탐색 기법인 TSS-LS(Two-Step Search scheme with the Linear search based Second step) 를 제안한다. 제안된 TSS-LS는 기존에 본 저자들이 제안하였던 TSS-BS (Two-Step Search scheme with the Bit reversal search based Second step)와 견줄만한 매우 빠른 동기획득 성능을 달성할 수 있도록 Single-Dwell 연속 동기탐색 기법에 기초하고 있으며 두 개의 다른 임계값과 탐색창을 적용한다. 반면, 제안된 TSS-LS는 UWB 시스템에서 통기획득의 고신뢰성을 보장하기 위해 두번째 단계에서 Bit Reversal 탐색 알고리즘을 사용하는 TSS-BS와는 달리 Linear 탐색 알고리즘을 적용하게 된다. IEEE 802.15.3a의 UWB 다중경로 채별 환경에서의 모의실험 결과, 일반적인 탐색 기법보다 본 논문에서 제안된 두 단계 탐색 기법의 정규화된 평균 동기획득 소요 시간이 큰 폭으로 향상됨을 확인할 수 있었다. 특히, 신호 동기획득 과정과 연동된 비트오율 성능 평가에서 제안된 TSS-LS 기법의 경우 높은 신호대 잡음비에 대해 이상적인 성능에 필적하는 매우 우수한 성능을 보임을 확인할 수 있었다.

• East Asian mathematical journal
• /
• 제35권5호
• /
• pp.597-612
• /
• 2019

In this study, we propose a new logarithmic barrier approach to solve linear programming problem using the projective method of Karmarkar. We are interested in computation of the direction by Newton's method and of the step-size using minorant functions instead of line search methods in order to reduce the computation cost. Our new approach is even more beneficial than classical line search methods. We reinforce our purpose by many interesting numerical simulations proved the effectiveness of the algorithm developed in this work.

• Steel and Composite Structures
• /
• 제7권3호
• /
• pp.201-217
• /
• 2007

Two combinatorial optimization algorithms, tabu search and simulated annealing, are presented for the minimum-weight design of geometrically non-linear steel plane frames. The design algorithms obtain minimum weight frames by selecting suitable sections from a standard set of steel sections such as American Institute of Steel Construction (AISC) wide-flange (W) shapes. Stress constraints of AISC Load and Resistance Factor Design (LRFD) specification, maximum and interstorey drift constraints and size constraints for columns were imposed on frames. The stress constraints of AISC Allowable Stress Design (ASD) were also mounted in the two algorithms. The comparisons between AISC-LRFD and AISC-ASD specifications were also made while tabu search and simulated annealing were used separately. The algorithms were applied to the optimum design of three frame structures. The designs obtained using tabu search were compared to those where simulated annealing was considered. The comparisons showed that the tabu search algorithm yielded better designs with AISC-LRFD code specification.

• 소성∙가공
• /
• 제6권5호
• /
• pp.416-424
• /
• 1997

In the present study, a contact search and check algorithm for general tool surface described by triangular FE patch is proposed. To improve numerical stability, SEAM element using the linear Coons interpolation has been used. To check the proposed algorithm, both clover cup and L-shape cup deep drawing processes are calculated. The computed results shows that the proposed contact algorithm can be successfully applied for sheet metal forming processes with general shaped tools.

• 한국경영과학회지
• /
• 제19권1호
• /
• pp.201-206
• /
• 1994

The linear search problem is concerned with finding a hiden target on the real line R. The position of the target governed by some probability distribution. It is desired to find the target in the least expected search time. This problem has been formulated as an optimization problem by a number of authors without making use of Markov Decision Process (MDP) theory. It is the aim of the paper to give a (MDP) formulation to the search problem which we feel is both natural and easy to follow.

• Journal of Advanced Marine Engineering and Technology
• /
• 제40권2호
• /
• pp.138-145
• /
• 2016

This paper proposes an improved tabu search method for subset selection in multiple linear regression models. Variable selection is a vital combinatorial optimization problem in multivariate statistics. The selection of the optimal subset of variables is necessary in order to reliably construct a multiple linear regression model. Its applications widely range from machine learning, timeseries prediction, and multi-class classification to noise detection. Since this problem has NP-complete nature, it becomes more difficult to find the optimal solution as the number of variables increases. Two typical metaheuristic methods have been developed to tackle the problem: the tabu search algorithm and hybrid genetic and simulated annealing algorithm. However, these two methods have shortcomings. The tabu search method requires a large amount of computing time, and the hybrid algorithm produces a less accurate solution. To overcome the shortcomings of these methods, we propose an improved tabu search algorithm to reduce moves of the neighborhood and to adopt an effective move search strategy. To evaluate the performance of the proposed method, comparative studies are performed on small literature data sets and on large simulation data sets. Computational results show that the proposed method outperforms two metaheuristic methods in terms of the computing time and solution quality.

• Steel and Composite Structures
• /
• 제9권6호
• /
• pp.535-555
• /
• 2009

The harmony search method based optimum design algorithm is presented for geometrically non-linear semi-rigid steel frames. Harmony search method is recently developed metaheuristic algorithm which simulates the process of producing a musical performance. The optimum design algorithm aims at obtaining minimum weight steel frames by selecting from standard set of steel sections such as European wide flange beams (HE sections). Strength constraints of Turkish Building Code for Steel Structures (TS648) specification and displacement constraints were used in the optimum design formulation. The optimum design algorithm takes into account both the geometric non-linearity of the frame members and the semi-rigid behaviour of the beam-to-column connections. The Frye-Morris polynomial model is used to calculate the moment-rotation relation of beam-to-column connections. The robustness of harmony search algorithm, in comparison with genetic algorithms, is verified with two benchmark examples. The comparisons revealed that the harmony search algorithm yielded not only minimum weight steel frames but also required less computational effort for the presented examples.

• 한국항행학회논문지
• /
• 제12권2호
• /
• pp.146-153
• /
• 2008

UWB(Ultra Wide-Band)통신 기술은 매우 짧은 펄스를 사용하기에 정밀한 동기 획득 제어가 필요하다. 고속 W-PAN 응용이나 저속 무선측위 응용 모두를 위해 정확한 UWB 신호의 동기 획득(Signal Acquisition)은 매우 중요하다. 본 논문에서는 UWB 다중경로 채널 환경에서 동기 획득을 위해 두 단계 신호 탐색기법을 이용하여 동기 획득 알고리즘을 제안한다. 첫 번째 단계는 수신된 신호전체 시간을 두고 탐색 구간을 절반으로 나눠 각각 나눠진 창의 전력 값의 합을 비교하여 더 큰 전력 값을 가지는 구간을 다음 탐색 창으로 잡는다. 이러한 과정을 반복하여 다음 탐색 창을 구한다. 비교된 값이 임계값을 넘을 때까지 탐색을 반복한다. 두 번째 단계에서는 첫 번째 단계에서의 구해진 탐색 창을 Fine Search 하기 위하여 Linear 탐색 알고리즘을 적용하여 검색한다. 이 제안 알고리즘을 UWB 다중경로 채널 환경에서 모의실험 결과 병렬 탐색 알고리즘에 비해 고속 동기 획득이 가능하고 SNR의 변화가 심한 환경에 적합한 특성을 확인하였다.