• Journal of Computing Science and Engineering
• /
• v.8 no.2
• /
• pp.78-86
• /
• 2014

Aiming to solve the problems of high memory access and big storage space and long matching time in the regular expression matching of extended finite automaton (XFA), a new regular expression matching algorithm based on high-efficient finite automaton is presented in this paper. The basic idea of the new algorithm is that some extra judging instruments are added at the starting state in order to reduce any unnecessary transition paths as well as to eliminate any unnecessary state transitions. Consequently, the problems of high memory access consumption and big storage space and long matching time during the regular expression matching process of XFA can be efficiently improved. The simulation results convey that our proposed scheme can lower approximately 40% memory access, save about 45% storage space consumption, and reduce about 12% matching time during the same regular expression matching process compared with XFA, but without degrading the matching quality.

• Journal of applied mathematics & informatics
• /
• v.9 no.2
• /
• pp.645-655
• /
• 2002

In this Paper we consider non-deterministic finite Rabin-Scott's automata. We define special abstract objects, being pairs of values of states-marking functions. On the basis of these objects as the states of automaton, we define its edges; the obtained structure is considered also as a non-deterministic automaton. We prove, that any edge of any non-deterministic automaton defining the given regular language can be obtained by such techniques. Such structure can be used for solving various problems in the frames of finite automata theory.

• Korean Journal of Heritage: History & Science
• /
• v.51 no.4
• /
• pp.146-169
• /
• 2018

Artificial or natural artifacts, which have historical, artistic, academic or scenic value as national, ethnic or global assets, are designated as "cultural heritages" under the Act on the Protection of Cultural Heritage. Cultural heritages can be divided into tangible cultural heritages, intangible cultural heritages, and monument and folklore heritages. In addition, depending on the object of designation, a cultural heritage can be designated either as a city or a provincial cultural heritage or a cultural heritage material, by a city mayor or provincial governor, and as a state-designated heritage by the administrator of the Cultural heritage Administration. The regular survey is a part of the policy for the preservation and management of state-designated heritages, which requires that surveys be undertaken every three to five years for the preservation, repair and maintenance of cultural heritages. It was stipulated in the Act on the Protection of Cultural Heritage in 2006, and since then has substantially contributed to the preservation and management of state-designated heritages based on the identification of damage to cultural heritages and the application of appropriate treatment measures. However, some parts of the guidelines on the regular survey, legislated in 2006, occasionally give rise to confusion in managing the regular survey system of state-designated movable cultural heritages, and need to be modified to facilitate the systematic management and improvement of the regular survey system. This study attempts to analyze the structure and operation of the regular survey system of state-designated movable cultural heritages, and proposes plans for improving the way of specifying each department which leads, manages and executes the regular survey, the process of entrusting the survey, and its guidelines and forms. I hope that these plans concerning the regular survey of state-designated movable cultural heritages will contribute to improving the quality and management of the system.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.371-374
• /
• 1998

본 논문에서는 muller법과 regular falsi법에 의한 CMOS 반전 증폭 회로를 해석하는 방법을 제안한다. Muller법과 regular falsi법을 이용하여 회로의 절점전압과 branch 전류를 예측하였고 회로의 출력 절점에서 KCL을 만족하도록 하였다. CMOS 반전 증폭 회로의 모의실험을 수행한 결과 MEDICI에 사용된 결합법에 비해 전압특성과 전류특성은 각각 5%와 5.4%의 최대상대오차를 보였다.

• Journal of Korean Academy of Nursing
• /
• v.34 no.1
• /
• pp.141-149
• /
• 2004

Purpose: To identify the status of regular cervical cancer screening practices among middle-aged women, the associations between regular practice and research factors, and the predictive model and factors effecting such behavior was studied. Method: Two hundred women, aged 40 to 60, were selected by convenience in one urban area of Seoul. They were asked about their regular attendance for screening, knowledge of cancer and screening, health belief, health self-determination index and certain personal factors. Result: Approximately 54.5% of the women had periodic screening tests every 6 months to 2 years. Their knowledge of cervical cancer and health belief were at the medium level of each scale, but their health self-determination scores (HSDI) were low. Some influencing factors, and their cancer odds ratio were identified through univariate regression analysis. These variables were included in a predictive model, and this model proved to have enough fit and classification power (83.5%). In this model, the financial state, self-belief and self-determination scores were found to be significant. Conclusion: Middle-age women's intrinsic motivation for healthy behavior was found to be low in those who felt to be in a poor financial state, had higher perceived barriers, lower perceived benefits and a lower prevalence of undergoing regular screening test.

• Water Engineering Research
• /
• v.4 no.3
• /
• pp.155-173
• /
• 2003

Parameters and quantiles of the 2-parameter generalized Pareto distribution were estimated using the methods of regular moments, modified moments, probability weighted moments, linear moments, maximum likelihood, and entropy for Monte Carlo-generated samples. The performance of these seven estimators was statistically compared, with the objective of identifying the most robust estimator. It was found that in general the methods of probability-weighted moments and L-moments performed better than the methods of maximum likelihood estimation, moments and entropy, especially for smaller values of the coefficient of variation and probability of exceedance.

• Kyungpook Mathematical Journal
• /
• v.45 no.1
• /
• pp.137-152
• /
• 2005

We introduce the concept of what we call "regular difference covers" and prove many nonexistence results and provide some new constructions. Although the techniques employed mirror those used to investigate difference sets, the end results in this new setting are quite different.

• Journal of applied mathematics & informatics
• /
• v.8 no.3
• /
• pp.693-703
• /
• 2001

In this paper we consider non-deterministic finite Rabin-Scott’s automata. We use a special structure to descibe all the possible edges of non-determinstic finite automaton defining the given regular language. Such structure can be used for solving various problems of finite automata theory. One of these problems is edge-minimization of non-deterministic automata. As we have not touched this problem before, we obtain here two versions of the algorithm for solving this problem to continue previous series of articles.

• Journal of applied mathematics & informatics
• /
• v.7 no.3
• /
• pp.887-894
• /
• 2000

In this paper we consider the corrected version of the algorithm of the state-minimization for the nondeterministic finite automata: we correct here a mistake of the previous paper, where the same problem was considered.

• Journal of applied mathematics & informatics
• /
• v.9 no.1
• /
• pp.135-150
• /
• 2002

The present paper discusses non-deterministic finite Rabin-scott's automate. The majority of works recently dealing with this subject were, in fact, concerned only with properties of a canonical term automata or of some objects equivalent to it. This article continues the series of works in which the authors state a different point of view, describing the finite automata as just another invariant of the given regular language called basis finite automaton. In this article the authors argue on some new properties for the basis finite automaton. One of them is included into basis automaton's table of binary relations. It is stated that this table can not contain either identical strings or identical columns. Another property depicts a possibility to obtain any finite automaton for a given regular language by the process of duplicating or combining some of its states.