• 한국정보처리학회논문지
• /
• 제5권1호
• /
• pp.103-110
• /
• 1998

기존의 규칙베이스 추론(Rule-Based REasoning : RBR)과 사례베이스 추론 (Case-Base : CB)가 통합되어 추론되고 있지만, 많은 수의 규칙(Rule)과 사례(Case)에 의해 추론 시간이 많이 걸리는 단점이 있다. 본 논문에서는 이런 단점을 해결하기 위하여, 다중 의미 또는 불확실한 지식을 쉽게 표현할 수 있는 라프집합 (Rough Set)을 이용하여 RB와 CB를 간략화한 새로운 추론 방법을 제안한다. 라프집합의 식별(classification)과 근사(aprroximation)개념을 이용하여, RB와 CB를 통치 클래스(equivalence class)로 분류하여 각각을 각략화하고, 간략화된 RB와 CB를 이용하여 통합 추론하여, 상호 보완적인 역할에 의해 결정 해를 얻고자 하는 것이다.

• 전기전자학회논문지
• /
• 제17권3호
• /
• pp.339-345
• /
• 2013

본 논문에서는 희소한 신호의 압축센싱를 위해 확률적 배제에 기반한 직교정합추구 (PEOMP) 신호 복원 알고리듬을 제안하였다. CoSaMP, gOMP, BAOMP 등의 알고리듬들은 매 반복 단계에서 새로운 atom들을 support set에 추가할 뿐만 아니라 부적절하다고 판단되어지는 atom들은 삭제하기 때문에 우수한 신호 복원 성능을 보인다. 그러나 반복 과정 중에 support set의 구성이 국소 최저점에서 벗어나지 못하여 신호 복원에 실패하는 경우가 발생하는 단점을 가지고 있다. 제안된 알고리듬은 매 반복 단계에서 확률적으로 임의의 atom을 배제하여 support set이 국소 최저점에 빠져 있는 경우 그곳에서 탈출하는데 도움을 준다. 모의실험을 통해 PEOMP가 기존의 OMP 기반의 알고리듬들과 $l_1$ 최적화 방법보다 신호 복원 능력 관점에서 우수한 성능을 보임을 확인하였다.

• 대한조선학회논문집
• /
• 제41권2호
• /
• pp.79-89
• /
• 2004

The viscous free surface flow around KRISO container ship (KCS) is computed using the finite volume based multi block RANS code, WAVIS developed at KRISO. The free surface is captured with the Level-Set method and the realizable k-$\varepsilon$ model is employed for turbulence closure. The computations are carried out at model scale. For accurate free surface solution and its stable convergence the computations are performed with a suitable grid refinement around the free surface by applying an implicit discretization method based on a finite volume method to the Level-Set formulation. In all computational cases the numerical results agree well with experimental measurements.

• 대한수학회지
• /
• 제39권2호
• /
• pp.237-252
• /
• 2002

We study the compatibility conditions and the existence of solutions or overdetermined PDE systems that admit complete prolongation. For a complete system of order k there exists a submanifold of the ($\kappa$-1)st jet space of unknown functions that is the largest possible set on which the initial conditions of ($\kappa$-1)st order may take values. There exists a unique solution for any initial condition that belongs to this set if and only if the complete system satisfies the compatibility conditions on the initial data set. We prove by applying the Frobenius theorem to a Pfaffian differential system associated with the complete prolongation.

• 한국정보처리학회논문지
• /
• 제7권7호
• /
• pp.2188-2195
• /
• 2000

This paper deals with the problem of determining small-bands enclosing a given set of points on the sphere. The small-band is a spherical region, whose boundary is composed of two circles, and which does not contain any great circle. It is a kind of domains that is derived from formalizing the local accessibility problems for 3-axis NC machining into sperical containment problems so as to avoid the grouping. It also can be generated in 4- and 5-axis machine. When a set of points U and the size of a great-band are given, the methods for computing a feasible band and all feasible bands enclosing U in O(n) and O(n log n) time have been suggested, respectively. The methods can be applied into the cases of small bands since the solution region may contain holes. In this paper, we concentrate on the method for determining the smallest small-band enclosing U and suggest an O(n long n) time algorithm, where n is the number of points on the sphere.

• 한국경영과학회지
• /
• 제33권2호
• /
• pp.17-26
• /
• 2008

The traveling salesman problem is to find tours through all cities at minimum cost ; simply visiting the cities only once that a salesman wants to visit. As such, the traveling salesman problem is a NP-complete problem ; an heuristic algorithm is preferred to an exact algorithm. In this paper, we suggest an effective cost relaxation using a candidate arc set which is obtained from a regression function for the traveling salesman problem. The proposed method sufficiently consider the characteristics of cost of arcs compared to existing methods that randomly choose the arcs for relaxation. For test beds, we used 31 instances over 100 cities existing from TSPLIB and randomly generated 100 instances from well-known instance generators. For almost every instances, the proposed method has found efficiently better solutions than the existing method.

• 산업공학
• /
• 제10권1호
• /
• pp.47-55
• /
• 1997

This paper deals with an assembly process of the TFT glasses and the color filters in LCD manufacturing. Two specific problems are presented and solved. One is a matching problem to find the best matches between a set of TFT glasses and a set of color filters, which result in the maximum number of good LCD assemblies. A simple mathematical model is constructed for this problem and an optimal solution can be obtained using an existing algorithm. The other is a main problem that requires a determination of an economic lot size of the color filters which are going to be assembled with a given set of TFT glasses. A Bayesian dynamic forecasting model is developed to predict the defective patterns of color filters. Based on the predicted defective rate of color filters, the minimum lot size of the color filters can be determined to minimize the probability of losing good TFT glasses and color filters.

• 대한수학회보
• /
• 제48권6호
• /
• pp.1245-1252
• /
• 2011

Consider the $L^2$-adjoint $s_g^{'*}$ of the linearization of the scalar curvature $s_g$. If ker $s_g^{'*}{\neq}0$ on an n-dimensional compact manifold, it is well known that the scalar curvature $s_g$ is a non-negative constant. In this paper, we study the structure of the level set ${\varphi}^{-1}$(0) and find the behavior of Ricci tensor when ker $s_g^{'*}{\neq}0$ with $s_g$ > 0. Also for a nontrivial solution (g, f) of $z=s_g^{'*}(f)$ on an n-dimensional compact manifold, we analyze the structure of the regular level set $f^{-1}$(-1). These results give a good understanding of the given manifolds.

• Journal of information and communication convergence engineering
• /
• 제9권2호
• /
• pp.155-160
• /
• 2011

In distributed source localization where sensors transmit measurements to a fusion node, we address the sensor selection problem where the goal is to find the best set of sensors that maximizes localization accuracy when quantization of sensor measurements is taken into account. Since sensor selection depends heavily upon rate assigned to each sensor, joint optimization of rate allocation and sensor selection is required to achieve the best solution. We show that this task could be accomplished by solving the problem of allocating rates to each sensor so as to minimize the error in estimating the position of a source. Then we solve this rate allocation problem by using the generalized BFOS algorithm. Our experiments demonstrate that the best set of sensors obtained from the proposed sensor selection algorithm leads to significant improvements in localization performance with respect to the set of sensors determined from a sensor selection process based on unquantized measurements.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1999년도 하계학술대회 논문집 C
• /
• pp.1195-1198
• /
• 1999

This paper presents optimal placement of minimal set of phasor measurement units(PMU's) and observability of measurement system with PMU. By using the incidence matrix symbolic method which directly assigns measurement and pseudo-measurement to incidence matrix, it is much simpler and easier to analyze observability. The optimal PMU set is found through the simulated-annealing(SA) and the direct combinational method. The cooling schedule parameter which is suitable to the property of problem to solve is specified and optimal placement is proven by presented direct combinational method. Search spaces are limited within reasonable feasible solution region to reduce a unnecessary one in the SA implementation based on global search. The proposed method presents to save CPU time and estimate state vectors based on optimal PMU set.