• Title/Summary/Keyword: rule-based

Search Result 3,852, Processing Time 0.028 seconds

A Rule Protecting Scheme with Symmetric Cryptosystem for Intrusion Detection System (암호화 기법을 적용한 침입 탐지 시스템의 룰 보호 기법)

  • Son Hyung-Seo;Kim Hyun-Sung;Bu Ki-Dong
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.14 no.6
    • /
    • pp.3-13
    • /
    • 2004
  • Kvarnstrom et al. ${in}^{[10]}$ proposed a rule protection scheme by using one-way hash function to protect rules in security systems over ubiquitous environment. Son et at. ${in}^{[5-6]}$ also prooposed a rule protection scheme for Snort, which is one of the most common IDS. These schemes provide security only for the header information but not for its contents. To solve this problem, this paper presents a scheme based on the symmetric cryptosystem over Snort not only for the header information but also contents. This paper uses the key management based on PCMCIA security module proposed ${by}^{[12]}$ for the symmetric cryptosystem. Our scheme could be adjusted to other security systems, which use the rule based detection.

Algorithm for Candidate Clue Decision based on Magic Rule in Kakuro Puzzle (가꾸로 퍼즐에 관한 마법 규칙 기반 실마리 후보 결정 알고리즘)

  • Sang-Un Lee
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.24 no.3
    • /
    • pp.103-108
    • /
    • 2024
  • Kakuro puzzles are NP-complete problems where no way to solve puzzles in polynomial time is known. Until now, a brute-force search method or a linear programming method has been applied to substitute all possible cases. This paper finds a magic rule, a rule for box sizes and unfilled numbers according to sum clues. Based on the magic rule, numbers that cannot enter empty cells were deleted from the box for row and column sum clues. Next, numbers that cannot enter the box were deleted based on the sum clue value. Finally, cells with only a single number were confirmed as clues. As a result of applying the proposed algorithm to seven benchmarking experimental data, it was shown that solutions could be obtained for all problems.

A Multibit Tree Bitmap based Packet Classification (멀티 비트 트리 비트맵 기반 패킷 분류)

  • 최병철;이정태
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.3B
    • /
    • pp.339-348
    • /
    • 2004
  • Packet classification is an important factor to support various services such as QoS guarantee and VPN for users in Internet. Packet classification is a searching process for best matching rule on rule tables by employing multi-field such as source address, protocol, and port number as well as destination address in If header. In this paper, we propose hardware based packet classification algorithm by employing tree bitmap of multi-bit trio. We divided prefixes of searching fields and rule into multi-bit stride, and perform a rule searching with multi-bit of fixed size. The proposed scheme can reduce the access times taking for rule search by employing indexing key in a fixed size of upper bits of rule prefixes. We also employ a marker prefixes in order to remove backtracking during searching a rule. In this paper, we generate two dimensional random rule set of source address and destination address using routing tables provided by IPMA Project, and compare its memory usages and performance.

An N-version Learning Approach to Enhance the Prediction Accuracy of Classification Systems in Genetics-based Learning Environments (유전학 기반 학습 환경하에서 분류 시스템의 성능 향상을 위한 엔-버전 학습법)

  • Kim, Yeong-Jun;Hong, Cheol-Ui
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.7
    • /
    • pp.1841-1848
    • /
    • 1999
  • DELVAUX is a genetics-based inductive learning system that learns a rule-set, which consists of Bayesian classification rules, from sets of examples for classification tasks. One problem that DELVAUX faces in the rule-set learning process is that, occasionally, the learning process ends with a local optimum without finding the best rule-set. Another problem is that, occasionally, the learning process ends with a rule-set that performs well for the training examples but not for the unknown testing examples. This paper describes efforts to alleviate these two problems centering on the N-version learning approach, in which multiple rule-sets are learning and a classification system is constructed with those learned rule-sets to improve the overall performance of a classification system. For the implementation of the N-version learning approach, we propose a decision-making scheme that can draw a decision using multiple rule-sets and a genetic algorithm approach to find a good combination of rule-sets from a set of learned rule-sets. We also present empirical results that evaluate the effect of the N-version learning approach in the DELVAUX learning environment.

  • PDF

Implementation of Object-oriented Active Rule System in Distributed Environment (분산환경에서 객체지향 능동 규칙 시스템 구현)

  • Go, Goeng-Uk;Yu, Sang-Bong;Kim, Gi-Chang;Cha, Sang-Gyun
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.11
    • /
    • pp.2875-2888
    • /
    • 1999
  • In this paper we present compiler-based active rule system to efficiently maintain spatial integrity constraints in a heterogeneous, distributed environment. Specially, the prototype active rule system presented has been developed as a component of a whole middleware system called SDBC(Spatile DataBase Connectivity). Due to this reason, our active rule system is provided for heterogeneous ODBMSs in a distributed environment and used to define spatial integrity constraints using the active rules in E-C-A(Event-Condition-Action) type. Using this active rule system, an application programmer can free himself from a heavier burden on the integrity maintenance of application objects. In the compiler-based approach, active rules applicable to events raised by a database program are directly inserted into the program in a function type by the preprocessor, and then they are compiled with the application program source codes. One advantage of this approach is that there is no run-time overhead accompanied by monitoring all the database transitions when preprocessed program is executed. This active rule system also provides facilities to manage changed rules and dynamically interpret those rules at run-tuime.

  • PDF

확장형 규칙 표식 언어(eXtensible Rule Markup Language): 설계 원리 및 응용

  • 이재규;손미애;강주영
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2002.05a
    • /
    • pp.284-293
    • /
    • 2002
  • XML(eXtensible Markup Language, XML)은 인터넷에서의 자료 교환을 위해 고안된 언어이다. 본 논문에서는 XML의 개념을 발전시킨 확장형 규칙 표식 언어(extensible Rule Markup Language, XRML)를 제안하고 있다. XRML은 웹 페이지에 내재된 암묵적 규칙의 식별, 구조적인 규칙으로의 변환, 사람과 소프트웨어 에이전트간의 지식 공유를 가능하게 하며, 이를 통해 지식기반시스템(Knowledge Based System)과 지식관리시스템(Knowledge Management System)의 통합을 실현할 수 있는 새로운 언어가 될 것이다. 본 고에서는 XRML이 이상과 같은 능력을 갖기 위해 반드시 갖춰야 할 6가지 설계 기준과, 이들 기준을 반영한 XRML 구성 요소로서 RIML(Rule Identification Markup Language), RSML(Rule Structure Markup Language)과 RTML(Rule Triggering Markup Language)을 설계하였으며, 개별 요소들의 기능 및 특성과 함께 태그와 DTD(Document Type Definition)도 식별하였다. 나아가 전술한 구조를 기반으로 하여 XRML을 워크플로우 시스템상의 폼처리에 적용한 Form/XRML이라는 프로토타입 시스템을 설계하고 구현하였다. 본 프로토타입의 개발을 통해, 지식기반시스템의 지식을 활용하는 RTML이 폼을 비롯한 다양한 응용시스템에 내재될 수 있으며, 웹 페이지의 암묵적 규칙과 지식기반시스템의 규칙이 일관성 있게 유지될 수 있음을 보여 주었다. 요컨대 본 연구는 XRML이 지능형 웹으로 발전하기 위한 새로운 도구이며, KBS와 US의 통합을 위한 중요한 도구임을 입증하였다는 점에서 큰 의의를 갖는다고 하겠다.

  • PDF

Three-dimensional structural design based on cellular automata simulation

  • Kita, E.;Saito, H.;Tamaki, T.;Shimizu, H.;Xie, Y.M.
    • Structural Engineering and Mechanics
    • /
    • v.23 no.1
    • /
    • pp.29-42
    • /
    • 2006
  • This paper describes the design scheme of the three-dimensional structures based on the concept of the cellular automata simulation. The cellular automata simulation is performed according to the local rule. In this paper, the local rule is derived in the mathematical formulation from the optimization problem. The cell density is taken as the design variable. Two objective functions are defined for reducing the total weight of the structure and obtaining the fully stressed structure. The constraint condition is defined for defining the local rule. The penalty function is defined from the objective functions and the constraint condition. Minimization of the penalty function with respect to the design parameter leads to the local rule. The derived rule is applied to the design of the three-dimensional structure first. The final structure can be obtained successfully. However, the computational cost is expensive. So, in order to reduce the computational cost, the material parameters $c_1$ and $c_2$ and the value of the cell rejection criterion (CRC) are changed. The results show that the computational cost depends on the parameters and the CRC value.

CCQC modal combination rule using load-dependent Ritz vectors

  • Xiangxiu Li;Huating Chen
    • Structural Engineering and Mechanics
    • /
    • v.87 no.1
    • /
    • pp.57-68
    • /
    • 2023
  • Response spectrum method is still an effective approach for the design of buildings with supplemental dampers. In practice, complex complete quadratic combination (CCQC) rule is always used in the response spectrum method to consider the effect of non-classical damping. The conventional CCQC rule is based on exact complex mode vectors. Sometimes the calculated complex mode vectors may be not excited by the external loading and errors in the structural responses always arise due to the mode truncation. Load-dependent Ritz (LDR) vectors are associated with the external loading and LDR vectors not excited can be automatically excluded. Also, contributions of higher modes are implicitly contained in the LDR vectors in terms of static responses. To improve the calculation efficiency and accuracy, LDR vectors are introduced in the CCQC rule in the present study. Firstly, the generation procedure of LDR vectors suitable for non-classical damping system is presented. Compared to the conventional LDR vectors, the LDR vectors herein are complex-valued and named as complex LDR (CLDR) vectors. Based on the CLDR vectors, the CCQC rule is then rederived and an improved response spectrum method is developed. Finally, the effectiveness of the proposed method in this paper is verified through three typical non-classical damping buildings. Numerical results show that the CLDR vector is superior to the complex mode with the same number in the calculation. Since the generation of CLDR vectors requires less computational cost and storage space, the method proposed in this paper offers an attractive alternative, especially for structures with a large number of degrees of freedom.

The Korean Text-to-speech Using Syllable Units (음절 단위를 이용한 한국어 음성 합성)

  • 김병수;윤기선;박성한
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.27 no.1
    • /
    • pp.143-150
    • /
    • 1990
  • In this paper, a rule-based method for improving the intelligibility of synthetic speech is proposed. A 12-pole linear prediction coding method is used to model syllable speech signals. A syllable concatenation rule for pause and frame rejection between syllables is developed to improve the naturalness of the synthetic speech. In addition, phonoligical structure transform rule and prosody rule are applied to the synthetic speech by LPC. The illustrative results demonstrate that the synthetic speech obtained by applying these rules has better naturalness than the synthetic speech by LPC.

  • PDF

Design and Implementation of Rule-based BPEL System for BPEL Rule Modeling (BPEL 규칙 모델링을 위한 규칙 기반 BPEL 시스템 설계와 구현)

  • Kwak, Donggyu;Choi, Jaeyoung
    • Journal of IKEEE
    • /
    • v.17 no.3
    • /
    • pp.332-338
    • /
    • 2013
  • BPEL is a standard executable language for specifying actions within business processes with Web services. BPEL workflow requires rule engine to describe application process in BPEL, as the requirements increase. It is needed to develop new BPEL's engine or modify BPEL's engine in order to add the functionality of rules to BPEL engines, but this method is not easy to implement and it requires very high cost. In this paper, we present an R4BPEL document, which uses the original BPEL grammar and includes a rule document. With this method, it is possible to build rule-based BPEL environment easily by adding web services with rules and R4BPEL document analyzer to the general-purpose Web services. In this paper, we campared a BPEL's document in proposed system with a BPEL's document in the existing system. And we demonstrated the simplicity of the rule-based system.