• Proceedings of the KSME Conference
• /
• 2001.06b
• /
• pp.706-711
• /
• 2001

This paper represents a relaxation matching algorithm based on global structure constraint satisfaction. Relaxation matching algorithm is a conventional approach to the matching problem. However, we confronted some problems such as null-matching and multi-matching problems by just using the relaxation matching technique. In order to solve the problems, in this paper, the matching problem is regarded as constraint satisfaction problem, and a relaxation matching algorithm is proposed based on global structure constraint satisfaction. The proposed algorithm is applied a landslide picture to show the effectiveness. When the algorithm is processed at landslide inspecting and monitoring system, motion parameters such as displacement area and its direction are computed. Once movement is recognized, displacements are estimated graphically with statistical amount in the image plane. Simulation has been done to prove the proposed algorithm by using time-sequence image of landslide inspection and monitoring system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.5
• /
• pp.956-967
• /
• 2010

Rapid growth of internet applications has increased the importance of intrusion detection system (IDS) performance. String matching is the most computation-consuming task in IDS. In this paper, a new algorithm for multiple string matching is proposed. This proposed algorithm is based on the canonical Aho-Corasick algorithm and it utilizes a bidirectional and parallel processing structure to accelerate the matching speed. The proposed string matching algorithm was implemented and patched into Snort for experimental evaluation. Comparing with the canonical Aho-Corasick algorithm, the proposed algorithm has gained much improvement on the matching speed, especially in detecting multiple keywords within a long input text string.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.5
• /
• pp.492-506
• /
• 2009

Index structures that are based on sequence matching for XPath processing such as ViST, PRIX and LCS-TRIM have recently been proposed to reduce the search time of XML documents. However, ViST can cause a lot of unnecessary computation and I/O when processing structural joint queries because its numbering scheme is not optimized. PRIX and LCS-TRIM require much processing time for matching XML data trees and queries. In this paper, we propose a novel index structure that solves the problems of ViST and improves the performance of PRIX and LCS-TRIM. Our index structure provides the minimum sequence matching scheme to efficiently process structural queries. Finally, to verify the superiority of the proposed index structure with the minimum sequence matching scheme, we compare our index structure with ViST, PRIX and LCS-TRIM in terms of query processing of a single path or of a branching path including wild-cards ('*' and '//' ).

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2001.11a
• /
• 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.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.18 no.7
• /
• pp.828-833
• /
• 2007

A small monopole antenna with a novel impedance matching structure is proposed in this paper. The proposed antenna is designed for W-LAN(IEEE 802.11b). The antenna design concept is based on a ${\lambda}/8$ folded monopole antenna with a self-impedance matching structure. The size of the proposed antenna is smaller than the resonant length, thus the impedance at the terminal of the antenna becomes very capacitive. To compensate fur this impedance mismatching, the proposed antenna employs a novel self-impedance matching structure. The self-impedance matching structure is located on the top of the antenna; it improves the impedance matching and ultimately the efficiency of the antenna. The measured results of the proposed antenna show reasonable agreement with prediction.

• Journal of the Korean Society of Safety
• /
• v.37 no.1
• /
• pp.41-48
• /
• 2022

Bridge engineering documents have essential contents that must be referenced continuously throughout a structure's entire life cycle, but research related to the quality of the contents is still lacking. XML schema matching is an excellent technique to improve the quality of stored data; however, it takes excessive computing time when applied to documents with many contents and a deep hierarchical structure, such as bridge engineering documents. Moreover, it requires a manual parametric study for matching elements' weight factors, maintaining a high matching accuracy. This study proposes an efficient weight-factor determination method based on an artificial neural network (ANN) model using the simplified XML schema-matching method proposed in a previous research to reduce the computing time. The ANN model was generated and verified using 580 data of document properties, weight factors, and matching accuracy. The proposed ANN-based schema-matching method showed superiority in terms of accuracy and efficiency compared with the previous study on XML schema matching for bridge engineering documents.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2002.05a
• /
• 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.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.16 no.5
• /
• pp.179-186
• /
• 2021

For stereo matching based on deep learning, the design of network structure is crucial to the calculation of matching cost, and the time-consuming problem of convolutional neural network in image processing also needs to be solved urgently. In this paper, a method of stereo matching using sparse loss volume in parallax dimension is proposed. A sparse 3D loss volume is constructed by using a wide step length translation of the right view feature map, which reduces the video memory and computing resources required by the 3D convolution module by several times. In order to improve the accuracy of the algorithm, the nonlinear up-sampling of the matching loss in the parallax dimension is carried out by using the method of multi-category output, and the training model is combined with two kinds of loss functions. Compared with the benchmark algorithm, the proposed algorithm not only improves the accuracy but also shortens the running time by about 30%.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.3
• /
• pp.279-284
• /
• 2004

Fingerprints have been widely used in the biometric authentication because of its performance, uniqueness and universality. Recently, the speed of identification becomes a very important point in the fingerprint-based security applications. Also, the reliability still remains the main issue in the fingerprint identification. In this paper, we propose the fast and reliable fingerprint matching algorithm based on the process of the 'self-nonself' discrimination in the biological immune system. The proposed algorithm is organized by two-matching stage. The 1st matching stage does the matching process by the use of the 'self-space' and MHC detector string set that are generated from the minutiae and the values of the directional field. Then the 2nd matching stage is made based on the local-structure of the minutiae. The proposed two matching stage reduces matching time while the reliability of the matching algorithm is maintained.

• International Journal of CAD/CAM
• /
• v.6 no.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).