• 제어로봇시스템학회논문지
• /
• 제8권7호
• /
• pp.584-588
• /
• 2002

The real-time characteristic of the adaptive leaning control algorithms is validated based on the applied results of the hydraulic servo system that has very strong a non-linearity. The evolutionary strategy automatically adjusts the search regions with natural competition among many individuals. The error that is generated from the dynamic system is applied to the mutation equation. Competitive individuals are reduced with automatic adjustments of the search region in accordance with the error. In this paper, the individual parents and offspring can be reduced in order to apply evolutionary algorithms in real-time. The feasibility of the newly proposed algorithm was demonstrated through the real-time test.

• 산업공학
• /
• 제11권3호
• /
• pp.115-128
• /
• 1998

This paper presents a development of operation scheduling and reactive operation scheduling system for hull fabrication. The methodology for implementing operation scheduling system is HHGA(Hierarchical Hybrid Genetic Algorithm) which exploits both the global perspective of the genetic algorithm and the rapid convergence of the heuristic search for operation scheduling. The methodology for the reactive operation scheduling is the revised HHGA which consists of manual schedule editor for occurrence of exceptional events and the revised scheduling method used in operation scheduling. As the results of experiment, it has been confirmed that HHGA is able to search good operation scheduling within reasonable time, and the revised HHGA is able to search load-balanced reactive operation scheduling with minimum changes of initial operation schedule within short period of time.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2008년도 추계학술대회 및 정기총회
• /
• pp.131-135
• /
• 2008

In this paper, we deal with a hierarchical location-allocation problem in designing the broadband convergence networks (BcN). The objective is to minimize the total cost of switch and cable while satisfying the quality of service (QoS). We formulate the problem as an integer programming model and develop the Tabu Search (TS) heuristic algorithm to find a good feasible solution within a reasonable time limit. Initial solution is obtained by using the tree structure. Three neighborhood generation mechanisms are used by local search heuristic: insertion, switch up, and switch down. In order to demonstrate the effectiveness of the proposed algorithm, we generate lower bounds from nonlinear QoS relaxation problem. We present promising computational results of the proposed solution procedures.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2006년 학술대회 논문집 정보 및 제어부문
• /
• pp.521-523
• /
• 2006

This paper proposes an algorithm and its data structure to support real-time full-text search for the streamed or broadcasted multimedia data containing real-time stenograph text. Since the traditional indexing method used at information retrieval area uses the linguistic information, there is a heavy cost. Therefore, we propose the algorithm and its data structure based on suffix array, which is a simple data structure and has low space complexity. Suffix array is useful frequently to search for huge text. However, subtitle text of multimedia data is to get longer by time. Therefore, suffix array must be reconstructed because subtitle text is continually changed. We propose the data structure called prefix array and search algorithm using it.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.1034-1038
• /
• 2005

This paper presents a novel method to speed up neural network (NN) based face detection systems. NN-based face detection can be viewed as a classification and search problem. The proposed method formulates the search problem as an integer nonlinear optimization problem (INLP) and develops an improved genetic algorithm (IGA) to solve it. Each individual in the IGA represents a subwindow in an input image. The subwindows are evaluated by how well they match a NN-based face filter. A face is indicated when the filter response of the best particle is above a given threshold. Experimental results show that the proposed method leads to a speedup of 83 on $320{\times}240$ images compared to the traditional exhaustive search method.

• 한국통신학회논문지
• /
• 제18권3호
• /
• pp.360-371
• /
• 1993

Flooding 탐색 알고리즘은 고도의 생존성과 신뢰성이 있으므로 전술응용을 위한 효과적 라우팅 메커니즘이라고 알려져 있다. 그러나 망 효율성 측면에서는 큰 결점을 갖고 있다. 본 논문에서는 음성 트래픽에 대하여 최대 4개의 링크와 2개의 우선순위클래스를 갖는 전술 회선교환 격자망을 MFDL 경로기법을 사용하여 호설정시간 증가 및 알고리즘의 프로세서로딩없이 회선교환망의 블로킹 확률에 대한 성능개선 방법을 제안하였다.

• Journal of applied mathematics & informatics
• /
• 제33권1_2호
• /
• pp.157-172
• /
• 2015

We introduce a non-Euclidean metric for transportation systems with a defined minimum transportation cost (initial fare) and investigate the continuous single-facility Weber location problem based on this metric. The proposed algorithm uses the results for solving the Weber problem with Euclidean metric by Weiszfeld procedure as the initial point for a special local search procedure. The results of local search are then checked for optimality by calculating directional derivative of modified objective functions in finite number of directions. If the local search result is not optimal then algorithm solves constrained Weber problems with Euclidean metric to obtain the final result. An illustrative example is presented.

• 한국멀티미디어학회논문지
• /
• 제21권1호
• /
• pp.18-25
• /
• 2018

In High Efficiency Video Coding (HEVC), integer motion estimation (IME) requires a large amount of computational complexity because HEVC adopts the high flexible and hierarchical coding structures. In order to reduce the computational complexity of IME, this paper proposes the search range reduction algorithm, which takes advantage of motion vectors similarity between different layers. It needs only a few modification for HEVC reference software. Based on the experimental results, the proposed algorithm reduces the processing time of IME by 28.1% on average, whereas its the $Bj{\emptyset}ntegaard$ delta bitrate (BD-BR) increase is 0.15% which is negligible.

• 한국국방경영분석학회지
• /
• 제10권1호
• /
• pp.57-63
• /
• 1984

The 0-1 multi-period Knapsack problem (MPKP) has a horizon of m periods, each having a number of types of projects with values and weights. Subject to the requirement, the cummulative capacity of the problem in each period i cannot be exceeded by the total weight of the projects selected in period 1, 2, ..., i. It is a problem of selecting the projects in such a way that the total value in the knapsack through the horizon of m periods is maximized. A search algorithm is developed and tested in this paper. Search rules that avoid the search of redundant partial solutions are used in the algorithm. Using the property of MPKP, a surrogate constraint concerned with the most available requirement is used in the bounding technique.

• 한국통신학회논문지
• /
• 제16권5호
• /
• pp.468-574
• /
• 1991

분산 너버우전탐색 트리구성에서 통신복잡성은 몇가지 임계값에 기초한 효과적인 통신동기방식에 의해서 개선될 수 있다. 본 논문에서는 분산 그래프의 밀도함수로서 임계값을 설정하고 그 임계값을 이용하여 통신 동기방식에 의거한 분산 너비우선탐색 트리 구성 알고리즘을 제안하였다. 제안된 알고리즘은 밀도가 낮은 그래프에서 기존의 알고리즘보다 통신 복잡성면성 면에서 수학적 분석을 통해개선됨을 입증하였으며, 밀도가 높은 그래프에서는 현재와 동일함을 입증함으로써 본 논문에서 제안한 알고리즘이 종래의 알고리즘들보다 통신 복잡성에서 가장 효율적임을 보았다.