• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.4
• /
• pp.116-129
• /
• 1993

This paper proposes an on-line Recognition scheme of cursive Korean characters based on the DP matching and fuzzy concept. The proposed algorithm, invariant to rotation and size, reduces greatly the computational requirement of dynamic programming by matching phonemes rather than character patterns, where the angle difference and the ration of lengths between input and reference patterns are adopted as matching features. The correct matching of poorly written cursive characters becomes possible by introducing the fuzzy concept in representing the features of phonemes and the ralative position between adjacent phonemes. Computer simulation results are observed to show the effectiveness of the proposed algorithm.

• Journal of IKEEE
• /
• v.22 no.4
• /
• pp.1050-1055
• /
• 2018

In this paper, we analyzed the sensitivity of matching elements for the dual-band operation of a power amplifier with composite right/left-handed (CRLH) transmission lines. Metamaterial theory enables CRLH transmission to support arbitrary impedance matching at dual frequencies. In general, at sub-GHz range, the CRLH matching networks are commonly implemented with lumped elements, which are prone to manufacturing distribution. In order to reduce the effect from the distribution of element values in design, we suggest a method to analyze the sensitivity of matching elements from the performance aspect of power amplifiers. Based on the analysis, a 40dBm dual-band power amplifier operating at 0.7GHz and 1.5GHz is designed.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.10
• /
• pp.502-510
• /
• 2007

Private Matching is a problem of computing the intersection of private datasets of two parties. One could envision the usage of private matching for Insurance fraud detection system, Do-not-fly list, medical databases, and many other applications. In 2004, Freedman et at. [1] introduced a probabilistic solution for this problem, and they extended it to malicious adversary model and multi-party computation. In this paper, we propose a new deterministic protocol for private matching with perfect correctness. We apply this technique to adversary models, achieving more reliable and higher speed computation.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.4
• /
• pp.231-238
• /
• 2009

DNA sequences are the fundamental information for each species and a comparison between DNA sequences of different species is an important task. Since DNA sequences are very long and there exist many species, not only fast matching but also efficient storage is an important factor for DNA sequences. Thus, a fast string matching method suitable for encoded DNA sequences is needed. In this paper, we present a fast string matching method for encoded DNA sequences which does not decode DNA sequences while matching. We use four-characters-to-one-byte encoding and combine a suffix approach and a multi-pattern matching approach. Experimental results show that our method is about 5 times faster than AGREP and the fastest among known algorithms.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.2
• /
• pp.60-65
• /
• 2008

The matching preclusion set of a graph is a set of edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings. The matching preclusion number is the minimum cardinality over all matching preclusion sets. We show in this paper that, for any $m{\geq}4$, the matching preclusion numbers of both m-dimensional restricted HL-graph and recursive circulant $G(2^m,4)$ are equal to degree m of the networks, and that every minimum matching preclusion set is the set of edges incident to a single vertex.

• The Transactions of the Korean Institute of Electrical Engineers C
• /
• v.54 no.5
• /
• pp.218-223
• /
• 2005

Impedance matching characteristics of planar type inductively coupled plasma sources are investigated utilizing the previously reported two-dimensional theory[1] of the anomalous skin effect. Two types of matching networks are considered, and the values of the circuit elements are expressed as functions of various reactor parameter. Also, two cases of perfect and imperfect matching conditions are considered and the functional dependence of the values of matching capacitance and reflection coefficient on the various reactor parameters are investigated using the present circuit model.

• 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 Journal of Industrial Distribution & Business
• /
• v.11 no.1
• /
• pp.19-28
• /
• 2020

Purpose: This research aims to empirically investigate the motivation of corporate voluntary disclosure by exploring the impact of historical loss on corporate social responsibility disclosure (CSRD). Research design, data, and methodology: This paper takes Chinese A-share listed firms that issued standalone social responsibility reports during the period of 2009-2017 as a sample. Drawing on extant literature, this paper defines historical loss firms as firms with net profit greater than or equal to 0 and undistributed profit less than 0. The tendency score matching method (PSM) is used to find matching samples for historical loss firms. Then OLS regression is conducted to investigate the relationship between historical loss and corporate social disclosure. Results: The results show that historical loss has a significant positive impact on the quality of corporate social responsibility disclosure. After changing the measurement of independent and dependent variables as well as adopting different matching methods to screen the control group, the results still hold. Further research indicates that the relationship between historical loss and CSRD is influenced by corporate financing constraints and industry competition. Conclusions: This research supports the resource motivation hypothesis of corporate social responsibility disclosure, and provides empirical evidence for regulators to strengthen supervision on corporate disclosure.

• Journal of Advanced Marine Engineering and Technology
• /
• v.20 no.4
• /
• pp.20-26
• /
• 1996

Recently, for the speed control of a diesel engine, some methods using the modern control theory such as LQ control technique, or $\textit{H}_{\infty}$control theory etc., have been reported. However, most of speed controlers of a diesel engine ever developed are still using the PID control algorithm. And, as another approach to the speed control of a diesel engine, the authors proposed already a new method to adjust the parameters of the PID controller by a model matching method. In the previous paper, the authors confirmed that the proposed new method is superior to Ziegler & Nichols's method through the analysis of results of the digital simulations under the assumption that the parameters of a diesel engine are known exactly. But, actually, it is very difficult to find out the value of parameters of a diesel engine accurately. And the parameters of a diesel engine are changigng according to the operating condition of a diesel engine. So, in this paper, a method to estimate the parameters of the PID controller for the speed control of a diesel engine by means of the model matching method are proposed. Also, the digital simulations are carried out in cases either with or without measurement noise. And this paper confirms that the proposed method here is superior to Ziegler & Nichols's method through the analysis of the characteristics of indicial responses.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.11
• /
• pp.5455-5475
• /
• 2016

In this article, we model the distributed relay assignment network as a many-to-one matching market with peer effects. We discuss two scenarios for throughput optimization of relay networks: the scenario of aggregate throughput optimization and the scenario of fairness performance optimization. For the first scenario, we propose a Mutual Benefit-based Deferred Acceptance (MBDA) algorithm to increase the aggregate network throughput. For the second scenario, instead of using the alternative matching scheme, a non-substitution matching algorithm (NSA) is designed to solve the fairness problem. The NSA improves the fairness performance. We prove that both two algorithms converge to a globally stable matching, and discuss the practical implementation. Simulation results show that the performance of MBDA algorithm outperforms existing schemes and is almost the same with the optimal solution in terms of aggregate throughput. Meanwhile, the proposed NSA improves fairness as the scale of the relay network expands.