• Title/Summary/Keyword: Rule Set

Search Result 731, Processing Time 0.022 seconds

A Study on Termination Analysis for Rule Compiler (규칙 컴파일러를 위한 종료 분석 연구)

  • Gang, Byeong-Geuk;Hwang, Jeong-Hui;Sin, Ye-Ho;Ryu, Geun-Ho
    • The KIPS Transactions:PartD
    • /
    • v.8D no.6
    • /
    • pp.823-834
    • /
    • 2001
  • In the active databases, whenever an event occurs, active rules with the matching event specifications are triggered automatically, its action will be executed. Because these rules may in turn trigger other rules including themselves, the set of rules may be executing each other indefinitely. These problem can be solved by rule termination analysis, and it is efficient for the rule termination to execute in compile time of rule. In this paper we not only design rule compiler with rule termination analyzer, but also propose its execution model and algorithm. The completeness of proposed model is verified by algorithm formalization of rule termination analysis.

  • PDF

Vital Area Identification Rule Development and Its Application for the Physical Protection of Nuclear Power Plants (원자력발전소의 물리적방호를 위한 핵심구역파악 규칙 개발 및 적용)

  • Jung, Woo Sik;Hwang, Mee-Jeong;Kang, Minho
    • Journal of the Korean Society of Safety
    • /
    • v.32 no.3
    • /
    • pp.160-171
    • /
    • 2017
  • US national research laboratories developed the first Vital Area Identification (VAI) method for the physical protection of nuclear power plants that is based on Event Tree Analysis (ETA) and Fault Tree Analysis (FTA) techniques in 1970s. Then, Korea Atomic Energy Research Institute proposed advanced VAI method that takes advantage of fire and flooding Probabilistic Safety Assessment (PSA) results. In this study, in order to minimize the burden and difficulty of VAI, (1) a set of streamlined VAI rules were developed, and (2) this set of rules was applied to PSA fault tree and event tree at the initial stage of VAI process. This new rule-based VAI method is explained, and its efficiency and correctness are demonstrated throughout this paper. This new rule-based VAI method drastically reduces problem size by (1) performing PSA event tree simplification by applying VAI rules to the PSA event tree, (2) calculating preliminary prevention sets with event tree headings, (3) converting the shortest preliminary prevention set into a sabotage fault tree, and (4) performing usual VAI procedure. Since this new rule-based VAI method drastically reduces VAI problem size, it provides very quick and economical VAI procedure. In spite of an extremely reduced sabotage fault tree, this method generates identical vital areas to those by traditional VAI method. It is strongly recommended that this new rule-based VAI method be applied to the physical protection of nuclear power plants and other complex safety-critical systems such as chemical and military systems.

Static Analysis In Computer Go By Using String Graph (컴퓨터 바둑에서 String Graph를 사용한 정적분석)

  • 박현수;김항준
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.41 no.4
    • /
    • pp.59-66
    • /
    • 2004
  • We define a SG(String Graph) and an ASG(Alive String Graph) to the purpose to do static analysis. For a life and death judgment, we apply the rule to the situation which the stone is included and not included. We define the rules that are SR(String Reduction), ER(Empty Reduction), ET(Edge Transform), and CG(Circular Graph), when the stone is not included. We define the rules that are DESR(Dead Enemy Strings Reduction) and SCSR(Same Color String Reduction), when the stone is included. We evaluate a SG that it is an ASG or not by using rules. And we use APC(Articulation Point Check) nile according to number of articulation points lot a life and death judgment. The performance of our method has been tested on the problem set IGS_31_counted form the Computer Go Test Collection. The test set contains 11,191 Points and 1,123 Strings. We obtain 92.5% accuracy of Points and 95.7% accuracy of Strings.

Development of Automatic Rule Extraction Method in Data Mining : An Approach based on Hierarchical Clustering Algorithm and Rough Set Theory (데이터마이닝의 자동 데이터 규칙 추출 방법론 개발 : 계층적 클러스터링 알고리듬과 러프 셋 이론을 중심으로)

  • Oh, Seung-Joon;Park, Chan-Woong
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.6
    • /
    • pp.135-142
    • /
    • 2009
  • Data mining is an emerging area of computational intelligence that offers new theories, techniques, and tools for analysis of large data sets. The major techniques used in data mining are mining association rules, classification and clustering. Since these techniques are used individually, it is necessary to develop the methodology for rule extraction using a process of integrating these techniques. Rule extraction techniques assist humans in analyzing of large data sets and to turn the meaningful information contained in the data sets into successful decision making. This paper proposes an autonomous method of rule extraction using clustering and rough set theory. The experiments are carried out on data sets of UCI KDD archive and present decision rules from the proposed method. These rules can be successfully used for making decisions.

Design of Rule-Based Controller for DC Motor using Fuzzy Reasoning (퍼지추론을 이용한 DC모터의 규칙기반 제어기 설계)

  • Kim, S.J.;Choi, H.S.;Choi, J.S.;Kim, Y.C.;Cho, H.
    • Proceedings of the KIEE Conference
    • /
    • 1991.07a
    • /
    • pp.703-707
    • /
    • 1991
  • During the past several years, fuzzy control has emerged as one of the most active and fruitful areas for reaserch in the applications of fuzzy set theory. A key component of the fuzzy controller is a rule-based system which provides a linguistic description of control strategy. This strategy has the form of a collection of fuzzy conditional statements which are implemented and manipulated using fuzzy set theory. In this paper, we propose the rule-based controller for DC motor speed control. The result of performance compare with PID controller to verify the validity of proposed algorithm.

  • PDF

Design of Gas Identification System with Hierarchically Identifiable Rule base using GAS and Rough Sets (유전알고리즘과 러프집합을 이용한 계층적 식별 규칙을 갖는 가스 식별 시스템의 설계)

  • Haibo, Zhao;Bang, Young-Keun;Lee, Chul-Heui
    • Journal of Industrial Technology
    • /
    • v.31 no.B
    • /
    • pp.37-43
    • /
    • 2011
  • In pattern analysis, dimensionality reduction and reasonable identification rule generation are very important parts. This paper performed effectively the dimensionality reduction by grouping the sensors of which the measured patterns are similar each other, where genetic algorithms were used for combination optimization. To identify the gas type, this paper constructed the hierarchically identifiable rule base with two frames by using rough set theory. The first frame is to accept measurement characteristics of each sensor and the other one is to reflect the identification patterns of each group. Thus, the proposed methods was able to accomplish effectively dimensionality reduction as well as accurate gas identification. In simulation, this paper demonstrated the effectiveness of the proposed methods by identifying five types of gases.

  • PDF

Design of Fault Diagnosis Expert System Using Improved Fuzzy Cognitive Maps and Rough Set Based Rule Minimization

  • 이종필;변증남
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1997.10a
    • /
    • pp.315-320
    • /
    • 1997
  • Rule minimization technique adapted from rough set theory was applied to remove redundant knowledge which is not necessary to make a knowledge base. New algorithm to diagnose fault using Improved Fuzzy Cognitive Maps(I-FCMs), and Fuzzy Associative Memory(FAM) is proposed. I-FCM[22] is superior to gathering knowledge from many experts and descries dynamic behaviors of systems very well. I-FCM is not only a knowledge base, but also a inference engine. FAM has learning capability like neural network[12]. Rule minimization and composition of I-FCM and FAM make it possible to construct compact knowledge base and breaks the border between inference engine and knowledge base.

  • PDF

Modeling and Validation of Semantic Constraints for ebXML Business Process Specifications (ebXML 비즈니스 프로세스 명세를 위한 의미 제약의 모델링과 검증)

  • Kim, Jong-Woo;Kim, Hyoung-Do
    • Asia pacific journal of information systems
    • /
    • v.14 no.1
    • /
    • pp.79-100
    • /
    • 2004
  • As a part of ebXML(Electronic Business using eXtensible Markup Language) framework, BPSS(Business Process Specification Schema) has been provided to support the direct specification of the set of elements required to configure a runtime system in order to execute a set of ebXML business transactions. The BPS,' is available in two stand-alone representations, a UML version and an XML version. Due to the limitations of UML notations and XML syntax, however, current ebXML BPSS specification fails to specify formal semantic constraints completely. In this study, we propose a constraint classification scheme for the BPSS specification and describe how to formally represent those semantic constraints using OCL(Object Constraint Language). As a way to validate p Business Process Specification(BPS) with the formal semantic constraints, we suggest a rule-based approach to represent the formal constraints and demonstrate its detailed mechanism for applying the rule-based constraints to the BPS with a prototype implementation.

Expert System for Intelligent Control-Based Job Scheduling in FMS (FMS 에서의 지능제어형 생산계획을 위한 전문가 시스템)

  • 정현호;이창훈;서기성;우광방
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.39 no.5
    • /
    • pp.527-537
    • /
    • 1990
  • This paper describes an intelligent control-based job scheduler, named ESIJOBS, for flexible manufacturing system. In order to construct rulebase of this system, traditional rules of job scheduling in FMS are examined and evaluated. This result and the repetitional simulations with graphic monitoring system are used to form the rulebase of ESIJOBS, which is composed of three parts:six part selection rules, four machine center selection rules, and twenty-one metarules. Appropriate scheduling rule sets are selected by this rulebase and manufacturing system status. The performances of all simulations are affected by random breakdowns of major FMS components during each simulation. Six criteria are used to evaluate the performance of each scheduling. The two modes of ESIJOBS are simulated and compared with combinational 24 rule-set simulations. In this comparison ESIJOBS dominated the other rule-set simulations and showed the most excellent performance particularly in three criteria.

A Meta-learning Approach that Learns the Bias of a Classifier

  • 김영준;홍철의;김윤호
    • Journal of Intelligence and Information Systems
    • /
    • v.3 no.2
    • /
    • pp.83-91
    • /
    • 1997
  • DELVAUX is an inductive learning environment that learns Bayesian classification rules from a set o examples. In DELVAUX, a genetic a, pp.oach is employed to learn the best rule-set, in which a population consists of rule-sets and rule-sets generate offspring by exchanging some of their rules. We have explored a meta-learning a, pp.oach in the DELVAUX learning environment to improve the classification performance of the DELVAUX system. The meta-learning a, pp.oach learns the bias of a classifier so that it can evaluate the prediction made by the classifier for a given example and thereby improve the overall performance of a classifier system. The paper discusses the meta-learning a, pp.oach in details and presents some empirical results that show the improvement we can achieve with the meta-learning a, pp.oach.

  • PDF