• Journal of information and communication convergence engineering
• /
• v.8 no.1
• /
• pp.89-94
• /
• 2010

The most important of rule-base system is the knowledge base that determines the power of rule-base system. The important form of this knowledge is how to descript kinds of rules. The Rule-Base System (RBS) has been using in many field that need reflect quickly change of business rules in management system. As far, when develop the Rule-Based System, we must make a rule engine with a general language. There are three disadvantage of in this developed method. First, while there are many data that must be processed in the system, the speed of processing data will become very slow so that we cannot accept it. Second, we cannot change the current system to make it adaptive to changes of business rules as quickly as possible. Third, large data make the rule engine become very complex. Therefore, in this paper, we propose the two important methods of raising efficiency of Rule-Base System. The first method refers to using the Relational database technology to process the rules of the Rule-Base System, the second method refers to a algorithm of according to Quine McCluskey formula compress the rows of rule table. Because the expressive languages of rule are still remaining many problems, we will introduce a new expressive language, which is Rule-Base Data Model short as RBDM in this paper.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.04a
• /
• pp.852-855
• /
• 2010

Tree type of Rule Case will be processed by the method that provide practical Rule Case to Rule Engine that is made with procedural language beforehand, then the Rule Engine according to the condition of the special Rule Case to return result in current Rule-Based System. There are two disadvantages in the method; the first is according to specific business rule after construct the Rule Engine when the business rule changing the Rule Engine also must be changed. The second is when Rule have many conditions the Rule Engine will become very complex and the speed of processing Rule Case will become very slow. In this paper, we will propose a simplified algorithm that according to the theory of ID Tree to produce Rules which be used in Rule-Based System. The algorithm can not only produce Rules but also make sure of satisfying change of business rule by execute the algorithm. Because it is not necessary to make a Rule Engine, we will anticipate effect of increasing speed and reducing cost from Rule-Based System of applying the algorithm.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.6 no.6
• /
• pp.849-854
• /
• 2011

To minimize the spreading effect from the events of the system, a rule-based expert system is very effective. However, because the events of the large-scale system are diverse and the load condition is very variable, it is very difficult to construct the rule-based expert system. To solve this problem, this paper studies a methodology which constructs a rule-based expert system by applying a CART(Classification and Regression Trees) algorithm based decision tree determination method to event case examples.

• The KIPS Transactions:PartD
• /
• v.17D no.6
• /
• pp.405-414
• /
• 2010

A rule is defined as a case to determine the target values according to combination of various Business factors. The information system is used to represent enterprise's business, which includes and implements the amount of these rules to Rule-Based System. A Rule-Based System can be constructed by using the rules engine method or Relational Database technology. Because the rules engine method has some disadvantages, the Rule-Based System is mostly developed with Relational Database technology. When business scales become larger and more complex, a large number of various rule cases must be operated in system, and processing these rule cases requires additional time, overhead and storage space, and the speed of execution slows down. To solve these problems, we propose a simplification algorithm that converts a large amount of rule cases to simplification rule cases with same effects. The proposed algorithm is applied to hypothetical business rule data and a large number of simplification experiments and tests are conducted. The final results proved that the number of rows can be reduced to some extent. The proposed algorithm can be used to simplify business rule data for improving performance of the Rule-Based System implemented with the Relational Database.

• Korean Journal of Computational Design and Engineering
• /
• v.5 no.4
• /
• pp.319-326
• /
• 2000

Expert systems using uncertain and ambiguous knowledge are not of the recent interests about uncertainty problem for performing inference similar to the decision making of a human expert. Human factors on rule-based systems often involve uncertain information. Expert systems had been used the methods of conflict resolution in a rule conflict situation, but this methods not properly solved the rule conflict. If a human expert appends a new rule to an original rule base, the rule base rightly causes a rule conflict. In this paper, the problem of rule conflict is regarded as one in which uncertainty of information is fundamentally involved. In the reduction of problem with uncertainty, we propose an enhanced rule ordering method, which improve the rule ordering method using Dempster-Shafer theory. We also propose a combinative index, which involve human factors of experts decision making.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 2007.11a
• /
• pp.241-248
• /
• 2007

In this paper, we propose a Transformation-Based Learning (TBL) method on generating the Korean standard pronunciation. Previous studies on the phonological processing have been focused on the phonological rule applications and the finite state automata (Johnson 1984; Kaplan and Kay 1994; Koskenniemi 1983; Bird 1995). In case of Korean computational phonology, some former researches have approached the phonological rule based pronunciation generation system (Lee et al. 2005; Lee 1998). This study suggests a corpus-based and data-oriented rule learning method on generating Korean standard pronunciation. In order to substituting rule-based generation with corpus-based one, an aligned corpus between an input and its pronunciation counterpart has been devised. We conducted an experiment on generating the standard pronunciation with the TBL algorithm, based on this aligned corpus.

• Journal of Mechanical Science and Technology
• /
• v.14 no.10
• /
• pp.1122-1130
• /
• 2000

Based on the value of the Lagrange multiplier and the degree of constraint activeness, a new update rule is proposed for penalty parameters of the ALM method. The theoretical exposition of this suggested update rule is presented by using the algorithmic interpretation and the geometric interpretation of the augmented Lagrangian. This interpretation shows that the penalty parameters can effect the performance of the ALM method. Also, it offers a lower limit on the penalty parameters that makes the augmented Lagrangian to be bounded. This lower limit forms the backbone of the proposed update rule. To investigate the numerical performance of the update rule, it is embedded in our ALM based dynamic response optimizer, and the optimizer is applied to solve six typical dynamic response optimization problems. Our optimization results are compared with those obtained by employing three conventional update rules used in the literature, which shows that the suggested update rule is more efficient and more stable than the conventional ones.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2009.06a
• /
• pp.1057-1058
• /
• 2009

• The KIPS Transactions:PartD
• /
• v.10D no.1
• /
• pp.33-44
• /
• 2003

XML is the standard for storing and exchanging information in the Web. As the applications of XML become more widespread, the worts on rule-based technology are rapidly going on to support reactive functionality on the XML documents and the XML repositories. Active rules consist of event-condition-action, which automatically perform actions in response to status change of database. Therefore the feature of active rule satisfies the new needs in XML setting. In this paper, we propose not only a XML based active rule language to manage XML document automatically, but also an active rule analysis method to guarantee rule termination. Finally, we demonstrate some examples of active rule defined by the proposed rule language, and also verify the efficiency of our analysis method by comparing with another method.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.40 no.8
• /
• pp.774-781
• /
• 1991

This paper proposes an auto-tuning method of a discrete -PIC controllers which is based on the Ziegler and Nichols's PID Tuning Rule. This tunign rule is derived using the Pade's first order approximation and it prevents the performance degradation caused by the time-delay effect of zero order holder when the Ziegler-Nichols tuning rule is applied to a discrete PID controller. A simple and practical auto-tuning method is proposed through combining this discrete tuning rule with the relay control. The auto-tuning scheme is implemented on a microprocessor based system and is applied to a position control system to show the effectiveness of the discrete tuning rule.