• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• pp.143-146
• /
• 1996

In this paper, we propose a hopfield model for solving the part-matching which is the number of parts and positions are changed. The goal of this paper is to minimize part-connection in pairs and net total path of part-connection. Therefore, this kind of problem is referred to as a combinatorial optimization problem. First of all, we review the theoretical basis for hopfield model to optimization and present two method of part-matching; Traveling Salesman Problem (TSP) and Weighted Matching Problem (WMP). Finally, we show demonstration through computer simulation and analyzes the stability and feasibility of the generated solutions for the proposed connection methods.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 2009년도 IWAIT
• /
• pp.460-465
• /
• 2009

This paper presents a new algorithm that includes a mechanism to avoid local solutions in a motion vector detection method that uses the steepest descent method. Two different implementations of the algorithm are demonstrated using two major search methods for tree structures, depth first search and breadth first search. Furthermore, it is shown that by avoiding local solutions, both of these implementations are able to obtain smaller prediction errors compared to conventional motion vector detection methods using the steepest descent method, and are able to perform motion vector detection within an arbitrary upper limit on the number of computations. The effects that differences in the search order have on the effectiveness of avoiding local solutions are also presented.

• 한국정밀공학회지
• /
• 제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.

• 대한수학회보
• /
• 제48권5호
• /
• pp.939-949
• /
• 2011

In this paper we give two matching theorems of Ky Fan type concerning open or closed coverings of nonempty convex sets in a topological vector space. One of them will permit us to put in evidence, when X and Y are convex sets in topological vector spaces, a new subclass of KKM(X, Y) different by any admissible class $\mathfrak{u}_c$(X, Y). For this class of set-valued mappings we establish a KKM-type theorem which will be then used for obtaining existence theorems for the solutions of two types of simultaneous relation problems.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 하계종합학술대회논문집
• /
• pp.693-696
• /
• 1998

For camera calibration, this paper describes two steps to camera constants and camera parameters. The former is the radial distortion of lens, image center and focal length etc.. The latter is translation, rotation etc.. Camera calibration use tsai's algorithm. In this paper, the solutions are introduced into overdetermined system as matching points that are acquired from two CCD and measured object depth information.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제17권3호
• /
• pp.181-195
• /
• 2013

This study considers an air and liquid-filled geomembrane tube section resting on a horizontal foundation. All quantities are normalized to obtain geometrically similar solutions in the static equilibrium condition. Analytic solutions are expressed in closed form. The solution for the air or liquid-filled tube section is derived systematically as an extreme case of the air and liquid-filled tube section. The validity of these solutions is confirmed by comparing to previous study, and some results are shown for the characteristic parameters and shapes of air and/or liquid-filled cases. Using the result of present study, one can estimate the shape and characteristic parameters of a tube section without numerical integrations or iterations.

• 한국인터넷방송통신학회논문지
• /
• 제16권2호
• /
• pp.87-92
• /
• 2016

본 논문에서는 2개 유전체층 위의 완전도체띠 격자구조에 의한 TE(transverse electric)산란 문제를 전자파 수치해석 방법으로 알려진 PMM(point matching method)를 이용하여 해석하였다. 경계조건들은 미지의 계수를 구하기 위하여 이용하였고, 산란 전자계는 Floquet 모드 함수의 급수로 전개하였으며, 도체띠의 해석을 위해 완전도체 경계조건을 적용하였다. 급변하는 대부분의 반사 및 투과전력은 입사각 이외의 다른 방향으로 산란된다. 완전도체띠의 폭과 주기, 입사각, 2개 유전층의 비유전율과 두께에 대한 정규화된 반사 및 투과전력을 계산하였다. 본 논문의 타당성을 검증하기 위하여 제안한 구조의 수치결과들은 기존의 수치해석 결과들과 비교하여 매우 잘 일치하였다.

• 한국인터넷방송통신학회논문지
• /
• 제15권2호
• /
• pp.65-70
• /
• 2015

본 논문에서는 접지된 2개의 유전체층 위의 완전도체띠 격자구조에 의한 TE (transverse electric)산란 문제를 전자파 수치해석 방법으로 알려진 PMM (point matching method)를 이용하여 해석하였다. 경계조건들은 미지의 계수를 구하기 위하여 이용하였고, 산란 전자계는 Floquet 모드 함수의 급수로 전개하였고, 도체띠의 해석을 위해 완전도체 경계조건을 적용하였다. 최소값을 가지는 변곡점들의 대부분의 반사전력은 입사각 이외의 다른 방향으로 산란된다. 완전도체띠의 폭과 주기, 2개 유전층의 비유전율과 두께 및 입사각에 대해 정규화된 반사전력을 계산하였다. 제안한 방법의 수치결과들은 기존의 FGMM (fourier galerkin moment method)를 이용한 수치해석 결과들과 비교하여 매우 잘 일치하였다.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제5권4호
• /
• pp.310-315
• /
• 2005

This paper proposes a fast optimization method by combining queen-bee evolution and derivative evaluation in genetic algorithms. These two operations make it possible for genetic algorithms to focus on highly fitted individuals and rapidly evolved individuals, respectively. Even though the two operations can also increase the probability that genetic algorithms fall into premature convergence phenomenon, that can be controlled by strong mutation rates. That is, the two operations and the strong mutation strengthen exploitation and exploration of the genetic algorithms, respectively. As a result, the genetic algorithm employing queen-bee evolution and derivative evaluation finds optimum solutions more quickly than those employing one of them. This was proved by experiments with one pattern matching problem and two function optimization problems.

• 한국항행학회논문지
• /
• 제18권4호
• /
• pp.371-375
• /
• 2014

본 논문에서는 접지된 유전체층 위의 저항띠 격자구조에 의한 TE (transverse electric)산란 문제를 전자파 수치해석 방법으로 알려진 PMM (point matching method)를 이용하여 해석하였다. 경계조건들은 미지의 계수를 구하기 위하여 이용하였고, 저항 경계조건은 저항띠 위의 접선성분의 자계와 표면전류밀도와의 관계를 위해 적용하였고, 저항띠에 유도되는 전류밀도는 저항띠 영역의 두 경계면에서 자계의 차이에 의해 계산하였다. 저항띠의 표면에 유도 전류 밀도는 자계의 두 경계면의 위와 아래 차이에 의해 계산하였다. 저항띠의 균일저항율, 폭과 주기, 유전층의 비유전율과 두께 및 입사각에 대해 정규화된 기하광학적 반사전력을 계산하였다. 수치결과들은 기존의 FGMM (fourier galerkin moment method)를 이용한 수치해석 결과들과 비교하여 매우 잘 일치하였다.