• Title/Summary/Keyword: Rule Execution Engine

Search Result 4, Processing Time 0.015 seconds

A Design of SERDL(Security Evaluation Rule Description Language) and Rule Execution Engine for Evaluating Security of IPv6 Network (IPv6 네트워크 계층의 보안성 평가를 위한 평가규칙 표기 언어 및 평가 수행기의 설계)

  • Kwon, Hyeok-Chan;Kim, Sang-Choon
    • The KIPS Transactions:PartC
    • /
    • v.11C no.4
    • /
    • pp.471-484
    • /
    • 2004
  • Recently. many projects have been actively implementing IPsec on the various Operating Systems for security of IPv6 network. But there is no existing tool that checks the IPsec-based systems, which provide IPsec services, work Properly and provide their network security services well In the IPv6 network. In this paper, we design SERDL(Security Evaluation Rule Description Language) and rule execution tool for evaluating security of the IPv6 network, and we provide implementation details. The system Is divided into following parts : User Interface part, Rule Execution Module part, DBMS part and agent that gathering information needed for security test.

A Light-Weight Rule Engine for Context-Aware Services (상황 인지 서비스를 위한 경량 규칙 엔진)

  • Yoo, Seung-Kyu;Cho, Sang-Young
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.5 no.2
    • /
    • pp.59-68
    • /
    • 2016
  • Context-aware services recognize the context of situation environments of users and provide useful services according to the context for users. Usual rule-based systems can be used for context-aware services with the specified rules that express context information and operations. This paper proposes a light-weight rule engine that minimizes memory consumption for resource-constrained smart things. The rule engine manages rules at the minimum condition level, removes memories for intermediate rule matching results, and uses hash tables to store rules and context information efficiently. The implemented engine is verified using a rule set of a mouse training system and experiment results shows the engines consumes very little memory compared to the existing Rete algorithm with some sacrifice of execution time.

Knowledge-Based AOP Framework for Business Rule Aspects in Business Process

  • Park, Chan-Kyu;Choi, Ho-Jin;Lee, Dan-Hyung;Kang, Sung-Won;Cho, Hyun-Kyu;Sohn, Joo-Chan
    • ETRI Journal
    • /
    • v.29 no.4
    • /
    • pp.477-488
    • /
    • 2007
  • In recent years, numerous studies have identified and explored issues related to web-service-oriented business process specifications, such as business process execution language (BPEL). In particular, business rules are an important cross-cutting concern that should be distinguished from business process instances. In this paper, we present a rule-based aspect oriented programming (AOP) framework where business rule aspects contained in business processes can be effectively separated and executed. This is achieved by using a mechanism of the business rule itself at the business rule engine instead of using existing programming language-based AOP technologies. Through some illustrative examples, this work also introduces a method by which business rule aspects, separated through an external rule engine, can be represented and evaluated. We also demonstrate how they can be dynamically woven and executed by providing an implementation example which uses two open-source-based products, the Mandarax rules engine and Bexee BPEL engine.

  • PDF

The Rule Case Simplification Algorithm to be used in a Rule-Based System (규칙기반 시스템에 사용되는 규칙 간소화 알고리즘)

  • Zheng, Baowei;Yeo, Jeong-Mo
    • 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.