• Design & Manufacturing
• /
• 제16권3호
• /
• pp.34-38
• /
• 2022

Regular expression pattern matching is widely used in applications such as computer virus vaccine, NIDS and DNA sequencing analysis. Hardware-based pattern matching is used when high-performance processing is required due to time constraints. ReCPU, SMPU, and REMP, which are processor-based regular expression matching processors, have been proposed to solve the problem of the hardware-based method that requires resynthesis whenever a pattern is updated. However, these processor-based regular expression matching processors inefficiently handle repetitive operations of regular expressions. In this paper, we propose a new instruction set to improve the inefficient repetitive operations of ReCPU and SMPU. We propose REMPi, a regular expression matching processor that enables efficient iterative operations based on the REMP instruction set. REMPi improves the inefficient method of processing a particularly short sub-pattern as a repeat operation OR, and enables processing with a single instruction. In addition, by using a down counter and a counter stack, nested iterative operations are also efficiently processed. REMPi was described with Verilog and synthesized on Intel Stratix IV FPGA.

• Communications for Statistical Applications and Methods
• /
• 제10권2호
• /
• pp.333-339
• /
• 2003

In this paper, we develop the probability matching priors for the parameters of non-regular Pareto distribution. We prove the propriety of joint posterior distribution induced by probability matching priors. Through the simulation study, we show that the proposed probability matching Prior matches the coverage probabilities in a frequentist sense. A real data example is given.

• Journal of the Korean Data and Information Science Society
• /
• 제17권2호
• /
• pp.559-568
• /
• 2006

In this paper, we develop the noninformative priors for the linear mixed models when the parameter of interest is the ratio of variance components. We developed the first and second order matching priors. We reveal that the one-at-a-time reference prior satisfies the second order matching criterion. It turns out that the two group reference prior satisfies a first order matching criterion, but Jeffreys' prior is not first order matching prior. Some simulation study is performed.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 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.

• Journal of information and communication convergence engineering
• /
• 제7권2호
• /
• pp.113-118
• /
• 2009

This paper is about design broadband impedance matching circuit for Coupler to improve power transfer efficiency in the power line communication (PLC) system. The Tchebycheff gain function algorithm is represented to design broadband matching circuit. A practical PLC Coupler impedance matching circuit is designed, and the characteristics for S11 and S21 of PLC coupler are enhanced comparing with unmatched one. This is done by maximizing the power transfer gain from modem to the load.

• Journal of information and communication convergence engineering
• /
• 제8권3호
• /
• pp.258-262
• /
• 2010

This paper represents design broadband impedance matching circuit for Coupler to improve power transfer efficiency in the broadband power line communication(BPLC) systems. The Butterworth gain function equalizer is used to design broadband matching circuit. A practical PLC Coupler impedance matching circuit is designed, and the characteristics for S11 and S21 of PLC Coupler are enhanced comparing with unmatched one. This is done by maximizing the power transfer gain from modem to the load.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1991년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 22-24 Oct. 1991
• /
• pp.1175-1180
• /
• 1991

The purpose of this paper is to improve the matching accuracy in identifying corresponding points in the area-based matching for the processing of stereo vision. For the selection of window size, a new method is proposed based on frequency domain analysis. The effectiveness of the proposed method is confirmed through a series of experiments. To overcome disproportionate distortion in stereo image pair, a new matching method using the warped window is also proposed. In the algorithm, the window is warped according to imaging geometry. Experiments on a synthetic image show that the matching accuracy is improved by 14.1% and 4.2% over the rectangular window method and image warping method each.

• Journal of the Korean Data and Information Science Society
• /
• 제24권6호
• /
• pp.1521-1529
• /
• 2013

In this paper, we develop noninformative priors for the generalized Pareto distribution when the scale parameter is of interest. We developed the rst order and the second order matching priors. We revealed that the second order matching prior does not exist. It turns out that the reference prior and Jeffrey's prior do not satisfy a first order matching criterion, and Jeffreys' prior, the reference prior and the matching prior are different. Some simulation study is performed and a real example is given.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅳ
• /
• pp.1996-1999
• /
• 2003

Stereo matching is an important technique in the are of computer vision. There are already many theorems to find disparity map using stereo images. Usually, disparity is searched by using block matching. However block matching result in blocking effects caused by using fixed size window for computing pixel correlations. This paper suggests an efficient method to remove the blocking effect in stereo matching procedures.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2001년도 하계종합학술대회 논문집(4)
• /
• pp.9-12
• /
• 2001

Point pattern matching schemes for finger print recognition do not guarantee robust matching performance for finger print images of poor quality. We present a finger print recognition scheme, where transformation parameter of matched ridge pairs are estimated by Hough transform and the matching hypothesis is verified by a new measure of the matching degree using selective directional information. Proposed method may exhibit extremely low FAR(False Accept Ratio) while maintaining low reject ratio even for the images of poor quality because of the robustness to the variation of minutia points.