• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2005년도 학술대회 논문집 정보 및 제어부문
• /
• pp.61-63
• /
• 2005

Retreiving indoor scene reference image from database using visual information is important issue in Robot Navigation. Scene matching problem in navigation robot is not easy because input image that is taken in navigation process is affinly distorted. We represent probabilistic framework for the feature matching between features in input image and features in database reference images to guarantee robust scene matching efficiency. By reconstructing probabilistic scene matching framework we get a higher precision than the existing feaure-feature matching scheme. To construct probabilistic framework we represent each image as Gaussian Mixture Model using Expectation Maximization algorithm using SIFT(Scale Invariant Feature Transform).

• 전기학회논문지
• /
• 제57권6호
• /
• pp.1048-1057
• /
• 2008

This paper represents a design method for PID or low-order controllers cascaded with a linear plant in the unit feedback system where it is required to meet the given time response specifications such as overshoot and settling time. This problem is difficult to solve because the zeros of the controller appear in the numerator of the overall system and thus those zeros may make the time response design difficult. In this paper, we propose a new approach based on the partial model matching and the so called K-polynomial. The partial matching problem is formulated to an optimization problem in which a quadratic function of coefficient errors between a target model and the resulting closed loop system is minimized. For the sake of satisfying the closed loop stability, a set of quadratic constraints associated with the cost function is introduced. As a result, the controller designed meets both time response requirements and the closed loop stability, if any. It is shown through several examples that the present method can be easily applied to these problems.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2001년도 추계학술대회논문집 I
• /
• pp.155-160
• /
• 2001

Actual engineering structure is frequently very complex, and parts of structure are designed independently by different engineers. Also each structure contains so many degree of freedom. For these reason, methods have been developed which permits the structure to be divided into components or substructures, with analysis being done on a small substructure in order to obtain a full structural system. In such case, because of different mesh size among finite element model (FEM) or different matching points among FEM models and experimentally obtained models, their interfacing points may be non-matching. Solving this non-matching problem is useful to other application such as structural dynamic modification or model updating. In this work, virtual node concept is introduced. Lagrange multipliers are used to enforce the interface compatibility constraint, and interface displacement is approximated by polynomial presentation. The governing equation of whole structure is derived using hybrid variational principle. The eigenvalue of whole structure are calculated using the determinant search method. The number of degree of freedom in the eigenvalue problem can be drastically reduced to just the number of interface degree of freedom. Some numerical simulation is performed to show usefulness of synthesis method.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2002년도 춘계학술대회논문집
• /
• pp.666-671
• /
• 2002

For a large structure, substructure based SDM(structural dynamics modification) method is very effective to raise its dynamic characteristics. Dividing into smaller substructures has a major advantage in the aspect of computation especially for getting sensitivities, which are in the core of SDM process. But quite often, non-matching nodes problem occurs in the process of synthesizing substructures. The reason is that, in general, each substructure is modelled separately, then later combined together to form a entire structure model under interface constraint conditions. Without solving the non-matching nodes problem, the substructure based SDM can not be processed. In this work, virtual node concept is introduced. Lagrange multipliers are used to enforce the interface compatibility constraint. The governing equation of whole structure is derived using hybrid variational principle. The eigenvalues of whole structure are calculated using determinant search method. The number of degrees of freedom of the eigenvalue problem can be drastically reduced to just the number of interface degree of freedom. Thus, the eigenvalue sensitivities can be easily calculated, and further SDM can be efficiently performed. Some numerical problems are tested to show the effectiveness of handling non-matching nodes.

• 한국CDE학회논문집
• /
• 제11권1호
• /
• pp.27-40
• /
• 2006

The exchange of parameterized feature-based CAD models is important for product data sharing among different organizations and automation systems. The role of feature-based modeling is to gonerate the shape of product and capture design intends In a CAD system. A feature is generated by referring to topological entities in a solid. Identifying referenced topological entities of a feature is essential for exchanging feature-based CAD models through a neutral format. If the CAD data contains the modification history in addition to the construction history, a matching mechanism is also required to find the same entity in the new model (post-edit model) corresponding to the entity in the old model (preedit model). This problem is known as the persistent naming problem. There are additional problems arising from the exchange of parameterized feature-based CAD models. Authors have analyzed previous studies with regard to persistent naming and characteristics for the exchange of parameterized feature-based CAD models, and propose a solution to the persistent naming problem. This solution is comprised of two parts: (a) naming of topological entities based on the object spore information (OSI) and secondary name (SN); and (b) name matching under the proposed naming.

• Journal of the Korean Statistical Society
• /
• 제35권3호
• /
• pp.225-238
• /
• 2006

This paper considers noninformative priors for the scale parameter of exponential distribution when the data are collected in step stress accelerated life tests. We find the Jeffreys' and reference priors for this model and show that the reference prior satisfies first order matching criterion. Also, we show that there exists no second order matching prior in this problem. Some simulation results are given and we perform Bayesian analysis for proposed priors using some data.

• 전기학회논문지
• /
• 제56권9호
• /
• pp.1665-1675
• /
• 2007

This paper presents the problem of controlling asynchronous sequential machines in the presence of input disturbances, which may be also regarded as an adversary in a game theoretic setting. The main objective is to provide necessary and sufficient condition for the existence of a corrective controller that solves model matching problem of an asynchronous machine suffering from input disturbance. The existence condition can be stated in terms of a simple comparison of two skeleton matrices. The proposed controller eliminates the adversarial effect of input disturbance and makes the controlled machine mimic the behavior of a model in stable-state way. Whenever controller exists, algorithms for their design are outlined and demonstrated in a case study.

• 한국전자통신학회논문지
• /
• 제17권5호
• /
• pp.801-808
• /
• 2022

대규모 링크드 데이터에 어떻게 지식을 임베딩하고, 엔티티 매칭을 위해 어떻게 신경망 모델을 적용할 것인가에 대한 연구는 상대적으로 많이 부족한 상황이다. 이에 대한 가장 근본적인 문제는 서로 다른 레이블이 어휘 이질성을 초래한다는 것이다. 본 논문에서는 이러한 어휘 이질성 문제를 해결하기 위해 재정렬 구조를 결합한 확장된 GCN(Graph Convolutional Network) 모델을 제안한다. 제안된 모델은 기존 임베디드 기반 MTransE 및 BootEA 모델과 비교하여 각각 53% 및 40% 성능이 향상되었으며, GCN 기반 RDGCN 모델과 비교하여 성능이 5.1% 향상되었다.

• International Journal of CAD/CAM
• /
• 제6권1호
• /
• pp.125-137
• /
• 2006

Nowadays, many commercial CAD systems support history-based, constraint-based and feature-based modeling. Unfortunately, most systems fail during the re-evaluation phase when various kind of topological changes occur. This issue is known as "persistent naming" which refers to the problem of identifying entities in an initial parametric model and matching them in the re-evaluated model. Most works in this domain focus on the persistent naming of atomic entities such as vertices, edges or faces. But very few of them consider the persistent naming of aggregates like shells (any set of faces). We propose in this paper a complete framework for identifying and matching any kind of entities based on their underlying topology, and particularly shells. The identifying method is based on the invariant structure of each class of form features (a hierarchical structure of shells) and on its topological evolution (an historical structure of faces). The matching method compares the initial and the re-evaluated topological histories, and computes two measures of topological similarity between any couple of entities occurring in both models. The naming and matching method has been implemented and integrated in a prototype of commercial CAD Software (Topsolid).

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.87.3-87
• /
• 2001

The principle of matching is a new framework for control systems design that requires the matching between the control system and the environment (the source of exogenous inputs). The principle is especially useful for the design of the critical control systems where the responses of the control systems should be kept below the prescribed values. The design problem is reduced to find controller satisfying inequality constraints. However, conventional optimization techniques do not possess structural model selection ability and designers are required to select appropriate controller model. We propose to use a genetic algorithm to find an appropriate controller satisfying the matching conditions. The proposed genetic algorithm ...