• ETRI Journal
• /
• 제29권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.

• 대한산업공학회지
• /
• 제23권1호
• /
• pp.197-213
• /
• 1997

It is not easy to find a good production schedule which can be used in practice. Therefore, production scheduling simulation with a simple dispatching rule or a set of dispatching rules is used. However, a simple dispatching rule may not create a robust schedule, for the same rule is blindly applied to all internal production processes. The presumption is that there might be a specific combination of appropriate rules that can improve the efficiency of a total production system for a certain type of orders. In order to acquire a better set of dispatching rules, simulation is used to examine the performance of various combinations of dispatching rule sets. There are innumerable combination of rule sets. Hence it takes too much computer simulation time to find a robust set of dispatching rule for a specific production system. Therefore, we propose a concept of the knowledge based simulation to circumvent the problem. The knowledge based simulation consists of knowledge bases, an inference engine and a simulator. The knowledge base is made of rule sets that is extracted from both simulation and human intuition obtained by the simulation studies. For a certain type of orders, the proposed system provides several sets of dispatching rules that are expected to generate better results. Then the scheduler tries to find the best by simulating all proposed set of rules with the simulator. The knowledge-based simulator armed with the acquired knowledge has produced improved solutions in terms of time and scheduling performance.

• 한국CDE학회논문집
• /
• 제19권3호
• /
• pp.236-244
• /
• 2014

Presented in the paper is a reservation based dispatching rule to achieve the on-time delivery in system LSI (large scale integrated circuit) semiconductor fabrication (FAB) with urgent orders. Using the proposed reservation based dispatching rule, urgent lots can be processed without waiting in a queue. It is possible to achieve the on-time delivery of urgent orders by reserving a proper tool for the next step in advance while urgent lots are being processed at the previous step. It can cause, however, tardiness of normal lots, because the proposed rule assign urgent lots first. To solve this problem, the proposed rule tries to find the best tool for the reservation in the tool group, which can minimize idle time, and the reservation rule is applied at all tools except for photolithography tools (bottleneck). $MOZART^{(R)}$ which is developed by VMS solutions are used for simulation experiments. The experimentation results show that the reservation based dispatching rule can achieve the on-time delivery of normal lots as well as urgent lots.

• 지능정보연구
• /
• 제12권3호
• /
• pp.95-110
• /
• 2006

지능형 에이전트와 규칙기반 시스템을 이용해 보다 지능적인 웹 환경을 구축하고자 하는 노력이 시맨틱 웹의 발전과 함께 증가하고 있다. 이러한 에이전트와 규칙기반 시스템에 필요한 규칙들을 이미 많은 지식들이 산재해 있는 웹으로부터 습득할 수 있다면 보다 효율적으로 시스템을 구축하는 것이 가능하며, 이러한 응용시스템의 확장은 시맨틱 웹의 발전을 더욱 가속화하는 계기가 될 수 있을 것이다. XRML 방법론은 웹으로부터 규칙을 습득하기 위한 단계적 방법을 제시하고 있으며, 온톨로지를 이용함으로써 규칙의 구성요소들을 자동으로 추출할 수 있도록 지원한다. 그러나 추출된 규칙구성요소들을 조합하여 완전한 규칙을 만드는 과정이 규칙관리자의 수작업에 의존하고 있다. 본 연구는 온톨로지와 그래프 탐색을 사용함으로써 이 과정을 자동화하고자 하는 연구이다. 온톨로지에 있는 규칙의 일반적 패턴을 기반으로 하여 그래프 탐색을 이용해 규칙구성요소들을 조합함으로써 웹 페이지로부터 자동으로 규칙을 추출할 수 있다.

• 한국언어정보학회:학술대회논문집
• /
• 한국언어정보학회 2007년도 정기학술대회
• /
• 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.

• 전자공학회논문지A
• /
• 제30A권9호
• /
• pp.46-58
• /
• 1993

Owing to the nature of locality in mask layouts, it appears that most mask layout problems can be solved by transforming a part of the given mask layout into a better layout segment continuously toward a global suboptimal solution. This notion of local transformation addresses major weak points of existing mask layout processing systems, which lack both extensibility and unifiability. This paper attempts to elaborate upon developing a new rule-based mask layout transformation system wherein most of the mask layout problems can be solved under the unified framework of local mask layout transformation. The rule-based mask layout transformation system is applicable to various mask layout problems such as net extraction, mask layout compaction, mask layout editing, and design rule checking. The experimental results show that the rule-based expert system approach is an efficient means of solving those mask layout problems, and thus confronting major drawbacks of existing layout processing systems.

• 한국국방경영분석학회지
• /
• 제26권2호
• /
• pp.55-74
• /
• 2000

A knowledge-based with production rules is a representation of static knowledge of an expert. On the other hand, a real system such as the stock market is dynamic in nature. Therefore we need a method to reflect the dynamic nature of a system when we make inferences with a knowledge-based system. This paper suggests a strategy of dynamic inference that can be used to take into account the dynamic behavior of decision-making with the knowledge-based system consisted of fuzzy production rules. A degree of match(DM) between actual input information and a condition of a rule is represented by a value [0,1]. Weights of relative importance of attributes in a rule are obtained by the AHP(Analytic Hierarchy Process) method. Then these weights are applied as exponents for the DM, and the DMs in a rule are combined, with the Min operator, into a single DM for the rule. In this way, the importance of attributes of a rule, which can be changed from time to time, can be reflected in an inference with fuzzy production systems.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제16권4호
• /
• pp.308-317
• /
• 2016

Multiple evidences based decision making is an important functionality for computers and robots. To combine multiple evidences, mathematical theory of evidence has been developed, and it involves the most vital part called Dempster's rule of combination. The rule is used for combining multiple evidences. However, the combined result gives a counterintuitive conclusion when highly conflicting evidences exist. In particular, when we obtain two different sources of evidence for a single hypothesis, only one of the sources may contain evidence. In this paper, we introduce a modified combination rule based on the partial conflict measurement by using an absolute difference between two evidences' basic probability numbers. The basic probability number is described in details in Section 2 "Mathematical Theory of Evidence". As a result, the proposed combination rule outperforms Dempster's rule of combination. More precisely, the modified combination rule provides a reasonable conclusion when combining highly conflicting evidences and shows similar results with Dempster's rule of combination in the case of the both sources of evidence are not conflicting. In addition, when obtained evidences contain multiple hypotheses, our proposed combination rule shows more logically acceptable results in compared with the results of Dempster's rule.

• 정보처리학회논문지D
• /
• 제10D권1호
• /
• pp.33-44
• /
• 2003

XML은 웹 데이터의 표현과 정보교환을 위한 표준이다. XML의 급격한 사용증가로 인하여 XML 저장 관리 시스템 및 XML 문서의 변화에 자동으로 대응할 수 있는 규칙기반의 기술개발에 대한 연구가 활발히 진행되고 있다. 능동 규칙은 사건, 조건, 조치로 구성되며 데이터베이스의 상태 변화에 자동으로 대응할 수 있는 특성이 있으므로 이러한 요구를 충족시킨다. 따라서 이 논문에서는 XML 문서를 자동으로 관리하기 위한 XML 기반의 능동 규칙 언어를 제안하고 이 규칙언어로 정의되는 능동 규칙에 대한 종료 분석 방법을 제시한다. 아울러 XML 문서의 능동적 관리를 위한 규칙의 적용 사례를 제시하고 분석 방법의 효율성에 대해 검증한다.

• Bulletin of the Korean Chemical Society
• /
• 제32권12호
• /
• pp.4233-4238
• /
• 2011

Based on the exact quantization rule for the nonrelativistic Schrodinger equation, the exact quantization rule for the relativistic one-dimensional Klein-Gordon equation is suggested. Using the new quantization rule, the exact relativistic energies for exactly solvable potentials, e.g. harmonic oscillator, Morse, and Rosen-Morse II type potentials, are obtained. Consequently the new quantization rule is found to be exact for one-dimensional spinless relativistic quantum systems. Though the physical meanings of the new quantization rule have not been fully understood yet, the present formal derivation scheme may shed light on understanding relativistic quantum systems more deeply.