• Journal of the Semiconductor & Display Technology
• /
• v.5 no.4 s.17
• /
• pp.17-22
• /
• 2006

In the manufacturing processes of semiconductor, test process is important for quality of products. In the manufacturing process of dynamic memory, memory test is more important. So, automatic test equipment(ATE) is used necessarily. But, according to increase of speed of dynamic memory operation, the rapid test equipment is needed. Impedance matching between ATE and dynamic memory is expected to be an important problem for making a rapid test equipment over 1Gbps. According to increase of speed, inner impedance of ATE also works on important parameter for test. This paper is about the method that is for impedance matching of inner impedance and coaxial cable occurring in manufacturing of ATE. We proved effects of inner impedance by electric theory and verified the method of impedance matching using computer simulation.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.5
• /
• pp.888-894
• /
• 2016

In this paper, we describe a method for precisely measuring the abrasion of the railway using an image processing technique. To calculate the wear of the rails, we provided a method for accurately matching the standard rail profile data and the profile data acquired by the rail inspection vehicle. After the lens distortion correction and the perspective transformation of the measured profile data, we used ICP Algorithm for accurate profile data matching with the reference profile extracted from the standard rail drawing. We constructed the prototype of the Rail Profile Measurement System for High-speed Railway and the experimental result on the three type of the standard rail used in Korea showed the excellent profile matching accuracy within 0.1mm.

• Proceedings of the Korea Database Society Conference
• /
• 1999.06a
• /
• pp.187-194
• /
• 1999

Case-Based Reasoning(CBR) systems support ill structured decision-making. The measure of the success of a CBR system depends on its ability to retrieve the most relevant previous cases in support of the solution of a new case. One of the methodologies widely used in existing CBR systems to retrieve previous cases is that of the Nearest Neighbor(NN) matching function. The NN matching function is based on assumptions of the independence of attributes in previous case and the availability of rules and procedures for matching.(omitted)

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.737-738
• /
• 2008

An implementation of robust stereo matching algorithm under variable illumination conditions is presented in this paper. By applying window-based matchingmethod to global stereo matching algorthm using belief propagation, our implemented system shows low error rate and could efficiently cope with general radiometric disimilarities between images acquired from two different point of views.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.11
• /
• pp.1027-1033
• /
• 2012

Semantic-based information retrieval techniques understand the meanings of the concepts that users specify in their queries, but the traditional semantic matching methods based on the ontology tree have three weaknesses which may lead to many false matches, causing the falling precision. In order to improve the matching precision and the recall of the information retrieval, this paper proposes a multi-agent improved semantic similarity matching algorithm based on the ontology tree, which can avoid the considerable computation redundancies and mismatching during the entire matching process. The results of the experiments performed on our algorithm show improvements in precision and recall compared with the information retrieval techniques based on the traditional semantic similarity matching methods.

• 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 '//' ).

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.2
• /
• pp.233-239
• /
• 1999

With the increase of Internet protocol (IP) packets the performance of routers became an important issue in internetworking. In this paper we examined the matching algorithm in gigabit router which has input queue with virtual output queueing. Port partitioning concept is employed to reduce the computational burden of the scheduler within a switch. The input and output ports are divided into two groups such that the matching algorithm is implemented within each input-output pair group in parallel. The matching is performed by exchanging input and output port groups at every time slot to handle all incoming traffics. Two algorithms, maximal weight matching by port partitioning (MPP) and modified maximal weight matching by port partitioning (MMPP) are presented. MMPP has the lowest delay for every packet arrival rate. The buffer size on a port is approximately 20-60 packets depending on the packet arrival rates. The throughput is illustrated to be linear to the packet arrival rate, which can be achieved under highly efficient matching algorithm.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.5
• /
• pp.683-688
• /
• 2009

The purposes of this paper is to propose new techniques to reconstruct measured optical images by using the template matching and B-Spline interpolation method based on image processing technology. To do this, we detect the matching template and non-matching template from each optical image. And then, we match the overlaped images from base level by correcting roll, pitch, and yaw error of images. At last, the matching image is interpolated by B-Spline interpolation. Finally, we show the effectiveness and feasibility of the proposed method through some experiments.

• ETRI Journal
• /
• v.43 no.3
• /
• pp.483-510
• /
• 2021

In computational biology, desired patterns are searched in large text databases, and an exact match is preferable. Classical benchmark algorithms obtain competent solutions for pattern matching in O (N) time, whereas quantum algorithm design is based on Grover's method, which completes the search in $O(\sqrt{N})$ time. This paper briefly explains existing quantum algorithms and defines their processing limitations. Our initial work overcomes existing algorithmic constraints by proposing the quantum-based combined exact (QBCE) algorithm for the pattern-matching problem to process exact patterns. Next, quantum random access memory (QRAM) processing is discussed, and based on it, we propose the QRAM processing-based exact (QPBE) pattern-matching algorithm. We show that to find all t occurrences of a pattern, the best case time complexities of the QBCE and QPBE algorithms are $O(\sqrt{t})$ and $O(\sqrt{N})$, and the exceptional worst case is bounded by O (t) and O (N). Thus, the proposed quantum algorithms achieve computational speedup. Our work is proved mathematically and validated with simulation, and complexity analysis demonstrates that our quantum algorithms are better than existing pattern-matching methods.

• 한국정보디스플레이학회:학술대회논문집
• /
• 2009.10a
• /
• pp.1596-1599
• /
• 2009

Mobile ODF (one drop filling) portable display such as mobile phone and application product is needed high reliability than notebook, monitor and TV. Therefore, material development in order to optimize mobile & application ODF panel is needed. Through considering mobile ODF process and design, we have developed method of material matching test by several tests which is heat stress, UV stress and ODF process condition. So we have developed a material with characteristics of high reliability for mobile ODF panel.