• 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.

• The KIPS Transactions:PartD
• /
• v.9D no.1
• /
• pp.21-30
• /
• 2002

The active database system introduces the active rules detecting specified state. As the condition evaluation of the active rules is performed every time an event occurs, the performance of the system has a great influence, depending on the conditions processing method. In this paper, we propose the conditions processing system with the preprocessor which determines the delta tree structure, constructs the classification tree, and generates the aggregate function table. Due to the characteristics of the active database through which the active rules can be comprehended beforehand, the preprocessor can be introduced. In this paper, the delta tree which can effectively process the join, selection operations, and the aggregate function is suggested, and it can enhance the condition evaluation performance. And we propose the classification tree which effectively processes the join operation and the aggregate function table processing the aggregate function which demands high cost. In this paper, the conditions processing system can be expected to enhance the performance of conditions processing in the active rules as the number of conditions comparison decreases because of the structure which is made in the preprocessor.

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.1
• /
• pp.1-6
• /
• 2003

As the condition evaluation of the active rules is performed whenever an event occurs, the performance of the system is influenced greatly depending on the conditions Processing method. Therefore, a study on evaluating the conditions of active rules becomes a very important element for enhancing the performance of active database. and the processing time of the calculation generated from the conditions must be minimized in order to improve the Performance. In this paper, the tree processing system which can effectively Process the join and selection operations is proposed. The experimental results show that tree processing system has the lower evaluation cost for the conditions processing of the active rules than the existing methods.

• The KIPS Transactions:PartD
• /
• v.8D no.5
• /
• pp.513-522
• /
• 2001

Active database execute an action of active rule defined in advance which is triggered automatically, whenever an event with the matching event specifications occurs, its condition is evaluated. Because these rules may in turn trigger other rules, the set of rules may be triggered each other indefinitely, Therefore, we propose a termination analysis method to guarantee termination. This proposed method considers composite event as well as rule execution time. Above all, the method not only uses deactivation graph combined to trigger graph for exact analysis, but also improves the complexity of analysis. Also the proposed method enhances accuracy of analysis result.

• 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.

• The Journal of Society for e-Business Studies
• /
• v.14 no.1
• /
• pp.35-56
• /
• 2009

Many process modeling techniques, such as Petri-net, UML Activity Diagram, and EPC, are used to design process models. In this paper, we analyze ubiquitous process design based on workflow patterns. In particular, we focus on process design using active rules that have the form of Event-Condition-Action, and deal with the WS-ECA language, which was devised for ubiquitous web services coordination. We first check whether workflow patterns can be designed with ECA rules, and we then provide WS-ECA representations for ECA rules of the patterns. The contribution of this paper is that ECA rule-based process models were presented based on workflow patterns and they can be a guideline for ubiquitous process modeling.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.3
• /
• pp.119-124
• /
• 2014

In this paper, we propose the active rule system applying with emotional margin for power saving control. The proposed system in this paper is a part of the system which derives smart power saving by adjusting the illuminance using active rules within compromising the user's emotion. For this, we set the specific range of standard illuminance and the lower bound of user's emotional margin of illuminance based on measurements and analysis, and use these data in design of active rules. And then, we design and implement the active rule system using mobile agent. The mobile agent in the proposed system migrates to the destination sensor nodes, acquires and transmits sensor data according to the purpose and needs through the active rules, and directly executes the actions corresponding to the optional events(changed sensor data and/or time etc.). And then, we show the potential applicability of the proposed active rule system in various active sensor network applications through the interaction with the rule base and mobile sensor network middleware system.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.10a
• /
• pp.303-306
• /
• 1996

This paper proposes a heuristic method for job shop scheduling with alternative machines. Our heuristic suggests four machine-selecting rules and two priority dispatching rules for modifying existent ones considering alternative machines, and then it extends existing nondelay/active job shop schedule generation. This heuristic provides good criteria(rules) in the selection of a proper machine among those performing a specific operation and for the dispatch of an operation to a selected machine and thus these rules permit the efficient job shop scheduling with alternative machines. The performances of our four machine-selecting rules in addition to the two priority dispatching rules, applied together with the existing 17 rules, are experimented and evaluated, respectively.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.20 no.43
• /
• pp.127-137
• /
• 1997

This paper proposes a heuristic method for job shop scheduling with alternative machines. Our heuristic suggests two machine-selecting rules and two priority dispatching rules for modifying existent ones considering alternative machines, and then it extends existing nondelay/active job shop schedule generation. This heuristic provides good criteria(rules) in the selection of a proper machine among those performing a specific operation and for the dispatch of an operation to a selected machine and thus these rules permit the efficient job shop scheduling with alternative machines. The performances of our two machine-selecting rules in addition to the two priority dispatching rules, applied together with the existing 17 rules, are experimented and evaluated, respectively.

• Resources Recycling
• /
• v.22 no.3
• /
• pp.81-90
• /
• 2013

Remanufacturing is one alternative to conserve the good environment of our earth and to save the production resources and manufacturing energy. To make active remanufacturing in Korea we have to prepare basic rules to support the collaboration among the original manufacturing, remanufacturing, and repairing companies. Basic rules for active remanufacturing can be established by the analysis of recently environments of remanufacturing procedures and the relationship among the main constituents.