• 한국정밀공학회지
• /
• 제14권8호
• /
• pp.122-129
• /
• 1997

In this paper, we propose a Hopfield model for solving the part-matching in case that is the number of parts and positions are changed. The goal of this paper is to minimize part-connection in pairs and total path of part-connections. Therefore, this kind of problem is referred to as a combinatiorial optimization problem. First of all, we review the theoretical basis for Hopfield model and present two optimal algorithms of part-matching. The first algorithm is Traveling Salesman Problem(TSP) which improved the original and the second algorithm is Wdighted Matching Problem (WMP). Finally, we show demonstration through com- puter simulation and analyze the stability and feasibility of the generated solutions for the proposed con- nection methods. Therefore, we prove that the second algorithm is better than the first algorithm.

• 한국정밀공학회지
• /
• 제12권10호
• /
• pp.157-165
• /
• 1995

The new formulation of designing the two degree of freedom(TDF) robust controller is proposed using $H_{\infty}$optimization and model matching method. In this formulation the feedback controller and feedforward controller are designed in a single step using $H_{\infty}$optimization procedure. Roughly speaking, the feedback controller is designed to meet robust stability and disturbance rejection specifications, while the feedforward controller is used to improve the robust model matching properties of the closed loop system. The proposed formulation will be illustrated and evaluated on a seeker scan-loop. And the performances of TDF robust controller are compared with those of the $H_{\infty}$ controller designed using Loop Shaping Design Procedure proposed by McFarlane and Glover.lover.

• 한국정보처리학회논문지
• /
• 제6권8호
• /
• pp.2253-2261
• /
• 1999

ACK에서는 패턴 테이블 생성기와 핍홀 최적화기에서 스트링 패턴 매칭 기법을 이용하여 EM 중간 코드에 대한 최적화 코드를 생성한다. 하지만 이 스트링 패턴 매칭 방법은 패턴 결정 시에 반복적으로 많은 비교 동작이 이루어지므로 비효율적이다. 본 논문은 ACK의 중간 코드 최적화기를 개선하기 위해 EM 트리 생성기, 최적화 패턴 테이블 생성기, 트리 패턴 매칭기로 구성된 트리 패턴 매칭 알고리즘을 이용한 EM 중간 코드 최적화 시스템을 설계하고 구현하였다. 이러한 트리 패턴 매칭 알고리즘은 EM 트리를 하향식으로 순회하면서 트리 구조를 가진 패턴 테이블을 참조하여 루트 노드를 중심으로 패턴 매칭을 수행한다. 트리 패턴 매칭 동작은 궁극적으로 ACK의 스트링 패턴 매칭에 비해 최적화 패턴을 찾는데 걸리는 시간을 평균 10.8% 감소시킬 수 있는 효과를 보였다.

• Journal of Information Processing Systems
• /
• 제14권4호
• /
• pp.961-979
• /
• 2018

For many years, matching in a bipartite graph has been widely used in various assignment problems, such as stable marriage problem (SMP). As an application of bipartite matching, the problem of stable marriage is defined over equally sized sets of men and women to identify a stable matching in which each person is assigned a partner of opposite gender according to their preferences. The classical SMP proposed by Gale and Shapley uses preference lists for each individual (men and women) which are infeasible in real world applications for a large populace of men and women such as matrimonial websites. In this paper, we have proposed an enhancement to the SMP by computing a weighted score for the users registered at matrimonial websites. The proposed enhancement has been formulated into profit maximization of matrimonial websites in terms of their ability to provide a suitable match for the users. The proposed formulation to maximize the profits of matrimonial websites leads to a combinatorial optimization problem. We have proposed greedy and genetic algorithm based approaches to solve the proposed optimization problem. We have shown that the proposed genetic algorithm based approaches outperform the existing Gale-Shapley algorithm on the dataset crawled from matrimonial websites.

• 전기학회논문지
• /
• 제66권1호
• /
• pp.100-106
• /
• 2017

In this paper, we propose a parallel optimization method of Aho-Corasick (AC) algorithm and Parallel Failureless Aho-Corasick (PFAC) algorithm using Open Computing Language (OpenCL) on Field Programmable Gate Array (FPGA). The low throughput of string matching engine causes the performance degradation of network process. Recently, many researchers have studied the string matching engine using parallel computing. FPGA's vendors offer a parallel computing platform using OpenCL. In this paper, we apply the AC and PFAC algorithm on DE1-SoC board with Cyclone V FPGA, where the optimization that considers FPGA architecture is performed. Experiments are performed considering global id, local id, local memory, and loop unrolling optimizations using PFAC algorithm. The performance improvement using loop unrolling is 129 times greater than AC algorithm that not adopt loop unrolling. The performance improvements using loop unrolling are 1.1, 0.2, and 1.5 times greater than those using global id, local id, and local memory optimizations mentioned above.

• 한국군사과학기술학회지
• /
• 제12권3호
• /
• pp.282-289
• /
• 2009

This paper presents an estimation technique of the equivalent circuit parameters for an underwater acoustic piezoelectric transducer from the measured impedance. Estimated equivalent circuit can be used for the design of the impedance matching network of the sonar transmitter. A fitness function is proposed to minimize the error between the calculated impedance of the equivalent circuit and the measured impedance of the transducer. The equivalent circuit parameters are estimated by using the fitness function and the PSO(Particle Swarm Optimization) algorithm. The effectiveness of the proposed method is verified by the applications to a sandwich-type transducer and a dummy load. In addition, the impedance matching network is also designed by using the estimated equivalent circuit model.

• 한국멀티미디어학회논문지
• /
• 제8권11호
• /
• pp.1556-1564
• /
• 2005

원시 프로그램에 대한 컴파일 과정 중 최적화 단계에서는 프로그램의 실행 속도를 개선시키고 코드 크기를 줄일 수 있는 다양한 최적화 기법을 수행한다[17]. 최적화 패턴 매칭 방법 중 스트링 패턴 매칭 방법은 중간 코드에 대응하는 최적의 패턴을 찾기 위한 방법으로 과다한 최적화 패턴 검색 시간으로 비효율적이다. 트리 패턴 매칭은 패턴 결정시 중복 비교가 발생할 수 있으며, 코드의 트리 구성에 많은 비용이 드는 단점을 가지고 있는 방법들이다[16,18]. 본 논문에서는 기존의 최적화 방법들의 단점을 극복하기 위한 방법으로 DFA (Deterministic Finite Automate) 최적화 테이블을 이용한 코드 최적화기를 제안하려고 한다. 이 방법은 다른 패턴 매칭 기법보다 결정적인 오토마타(Automata)로 구성하기 때문에 비용은 적어지고, 오토마타를 통해 결정적으로 패턴이 확정됨에 따른 패턴 선택 비용이 줄어들며, 최적화 패턴 검객 시간도 빨라지는 효율적인 방법의 최적화기이다.

• 대한원격탐사학회지
• /
• 제13권2호
• /
• pp.121-132
• /
• 1997

본 논문에서는 위성영상으로부터 수치표고모형 추출을 목적으로 하는 영상정합 알고리즘 의 개발에 관하여 기술한다. 개발된 알고리즘은 주어진 목적에 맞추어 비선형 최소자승법에 기초 한 영역정합방식에 기초하였으나 새롭게 정의된 정합구역을 이용함으로써 기존의 정합방식보다 향상된 정합 수행속도를 가진다. 이 정합 알고리즘은 정합수행 모듈, 정합조절 모듈, 정합최적화 모듈로 구성되어 있으며 각각의 기능에 대하여 기술한다. 또한 제안된 알고리즘의 성능을 정합 가능도, 수행 속도, 정합 수렴 반경 등을 이용하여 정량적으로 분석한다.

• 대한기계학회논문집A
• /
• 제27권7호
• /
• pp.1110-1119
• /
• 2003

This paper deals with the synthesis of the 3-dimensional grasp planning for unknown objects. Previous studies have many problems, which the estimation time for finding the grasping points is much long and the analysis used the not-perfect 3-dimensional modeling. To overcome these limitations in this paper new algorithm is proposed, which algorithm is achieved by two steps. First step is to find the whole 3-dimensional geometrical modeling for unknown objects by using stereo matching. Second step is to find the optimal grasping points for unknown objects by using the neural network trained by the result of optimization using genetic algorithm. The algorithm is verified by computer simulation, comparing the result between neural network and optimization.

• 제어로봇시스템학회논문지
• /
• 제5권3호
• /
• pp.363-369
• /
• 1999

In this paper, we design the robust $H_{\infty}$ controller for water level control of steam generator using a mixed $H_{\infty}$ optimization with model-matching method. Firstly we choose the desired model which has good disturbance rejection performance. Secondly we design a stabilizing controller to keep the model-matching error small and also provide sufficiently large stability margin against additive perturbations of the nominal plant. Simulation results show that proposed robust $H_{\infty}$ controller at specific power operation has satisfactory performances against the variations of load power, steam flow rate, primary circuit coolant temperature, and feedwater temperature. It can be also observed that the proposed robust $H_{\infty}$ controller exhibits better robust stability than conventional PI controller.