ECA Rules Research Articles

Design and Implementation of Active Stream Data Warehouses

In the era of Big Data, more and more stream data is available. In the same way, Decision Support Systems (DSS) tools, such as data warehouses and alert systems, become more and more sophisticated, and conceptual modeling tools are consequently mandatory for successfully DSS projects. Formalisms such as UML and ER have been widely used in the context of classical information and data warehouse systems, but they have not been investigated yet for stream data warehouses to deal with alert systems. Therefore, in this article, the authors introduce the notion of Active Stream Data Warehouse (ASDW) and this article proposes a UML profile for designing Active Stream Data Warehouses. Indeed, this article extends the ICSOLAP profile to take into account continuous and window OLAP queries. Moreover, this article studies the duality of the stream and OLAP decision-making process and the authors propose a set of ECA rules to automatically trigger OLAP operators. The UML profile is implemented in a new OLAP architecture, and it is validated using an environmental case study concerning the wind monitoring.

Analysis and verification of ECA rules in intelligent environments

Intelligent Environments (IEs) are physical spaces where Information Technology (IT) and other pervasive computing technologies are combined in order to achieve specific goals for the users and the environment. IEs have the goal of enriching user experience, increasing awareness of the environment. A number of applications are currently being deployed in domains ranging from smart homes to e-health and autonomous vehicles. Quite often IE support human activities, thus essential requirements to be ensured are correctness, reliability, safety and security. In this paper we present how a set of techniques and tools that have been developed for the verification of software can be employed in the verification of IE described by means of event-condition-action rules. More precisely, we reduce the problem of verifying key properties of these rules to satisfiability and termination problems that can be addressed using state-of-the-art Satisfiability Modulo Theory (SMT) solvers and program analysers. Our approach has been implemented in a tool called vIRONy. Our approach has been validated on a number of case studies from the literature.

Introduction to the special issue on the International Web Rule Symposia 2012–2014

The annual International Web Rule Symposium (RuleML) is an international conference on research, applications, languages, and standards for rule technologies. It has evolved from an annual series of international workshops since 2002, international conferences in 2005 and 2006, and international symposia since 2007. It is the flagship event of the Rule Markup and Modeling Initiative (RuleML, http://ruleml.org), a nonprofit umbrella organization of several technical groups from academia, industry, and government working on rule technology and its applications. RuleML is the leading conference to build bridges between academia and industry in the field of rules and its applications, especially as part of the semantic technology stack. It is devoted to rule-based programming and rule-based systems including production rules systems, logic programming rule engines, and business rules engines/business rules management systems; Semantic Web rule languages and rule standards (e.g., RuleML, SWRL, RIF, PRR, SBVR, DMN, CL, Prolog); rule-based event processing languages and technologies; and research on inference rules, transformation rules, decision rules, production rules, and ECA rules.

A Report on the Ninth International Web Rule Symposium

The annual International Web Rule Symposium (RuleML) is an international conference on research, applications, languages, and standards for rule technologies. RuleML is a leading conference to build bridges between academe and industry in the field of rules and its applications, especially as part of the semantic technology stack. It is devoted to rule‐based programming and rule‐based systems including production rules systems, logic programming rule engines, and business rule engines/business rule management systems; semantic web rule languages and rule standards; rule‐based event‐processing languages (EPLs) and technologies; and research on inference rules, transformation rules, decision rules, production rules, and ECA rules. The Ninth International Web Rule Symposium (RuleML 2015) was held in Berlin, Germany, August 2–5. This report summarizes the events of that conference.

Integrated GIS-based Logistics Process Monitoring Framework with Convenient Work Processing Environment for Smart Logistics

In today's highly competitive business environment, most companies try to manage their logistics function strategically to satisfy their orders as cost-effectively as possible and maximize their present and future profits. In this environment, logistics process visibility is essential to companies wishing to competently track components, parts, or products in transit from the original suppliers to the final destinations. Thus, it is important to provide instantly and easily recognizable information about such visibility to all stakeholders, especially customers. To ensure a high-level geographical visibility of the logistics processes, in this paper, we propose a way of implementing a GIS-based logistics process monitoring environment and of integrating a performer's work processing environment on the monitoring system. Additionally, to provide more abundant monitoring information, we describe a procedure for creating and processing various monitoring information, which are represented as ECA rules in this work processing environment. Therefore, it is possible to provide intuitive and visible monitoring information regarding the logistics process and resource elements.

Vehicle-Mounted Task Control System in Container Yard based on Workflow Engine

Zhao, N.; Shen, Y.; Mi, C.; Wang, J., and Xia, M., 2015. Vehicle-mounted task control system in container yard based on workflow engine.Owing that the container terminals increasingly occupy a crucial position in today's container transportation, the advanced and cost-effective operational management gradually attracts the attention of terminal operators. The relevant research survey in this paper is carried out on various operational task flows in a container yard. In terms of operational features of vehicle-mounted tasks in storage yard, such as complexity, instantaneity, derivatization and flexibility, a two-layer workflow engine framework is proposed to support dynamic scheduling. ECA rules and the features of a directed graph are combined to formulate a bottom-layer workflow model, which enables the model to implement dynamic assignment. And the upper-layer workflow drive is composed of three parts, the task generation, processing and mutation. It regulates the generation, mutation and elimination of operational tasks in a container yard. On the basis of long-term practical experience and application in multiple yards of Tianjin Port in China, the effectiveness and feasibility of the proposed workflow engine is verified. The application of the technical framework provides a practical reference for operational control and management in logistics enterprises.

군 함정 문자 교신 지원을 위한 규칙 기반 엔진 설계

IT 기술의 발달은 컴퓨터를 이용하여 상호간에 정보를 주고 받으며 작전을 지휘하는 등 군 작전에 있어서 많은 변화를 가져왔다. 특히 해군의 경우 암호화된 유 무선망을 통해 실시간으로 이루어지는 문자 교신을 작전 훈련에 활용하고 있다. 하지만 이는 단순한 정보 교환에만 이용되고 있으며 실제 작전 훈련에 필요한 정보(교범, 지침서 등)의 내용은 필요할 때마다 찾아보고 있는 실정이다. 이에 따라 본 논문에서는 ECA 규칙을 문자 교신과 연동시켜 실시간으로 필요한 정보를 제공할 수 있는 규칙 기반 엔진을 설계하였으며 가상 시나리오 적용을 통해 이를 검증한 결과 83%의 정확율을 보였다. The development of IT technology has brought many changes in military operations. For example, the way of transmitting and receiving information from one another has changed. Partiicularly, in the case of the ROK Navy, they utilize encrypted real-time chattig over wire wireless network in operations and tranings. However, text communication is being utilized more in exanging of simple informations, and not for the partical informations required in the operations and exercises, doctrines and guidebooks are still being used in these cases. Therefore, I have designed a rule-based engine which can provide real-time informations by linking ECA rules to text communication, and it has been verified by running virtual scenarios. As a rusult, this engine showed an accuracy of 83%.

Inferring ECA-based rules for ambient intelligence using evolutionary feature extraction

One of the goals in Ambient Intelligence is to enable Intelligent Environments to take decisions based on the perceived context. In our previous work, we successfully explored how the inhabitants can communicate their own preferences with the environment using Event-Condition-Action ECA rules. The easiness of the communication language combined with an appropriate explanation mechanism gives trust to the Intelligent Environment actions. However, defining every preference, and maintaining them up-to-date can be cumbersome. Therefore, a complementary mechanism is required to learn from user behavior and adapt to small changes without being explicitly requested for. Inferring behaviors effectively from data collected from sensors in an Intelligent Environment is a challenging problem. The main issues include primitive representation of data, the necessity of a high number of sensors, and dealing with few training data collected in a short time. We present MFE3/GADR, an evolutionary constructive induction method to ease inferring inhabitants' preferences from data collected from simple sensors. We show that this method detects successfully relevant sensors and constructs highly informative features that abstract relations among them. The constructed features, in addition to improving significantly the learning accuracy, break down and encapsulate the performance of inhabitants into decision trees that can easily be converted to ECA rules for further use in the Intelligent Environment. Comparing the empirical results show that our method can reduce a large set of complex ECA rules that represent the preferences to a smaller set of simple ECA rules.

An atlas of limit set dynamics for asynchronous elementary cellular automata

In this paper we provide an overview of the possible ω-limit set structures for 104 of the 256 asynchronous elementary cellular automata over the circle graph on n vertices. We consider only fixed, sequential updates where the update sequence is given by a permutation of the vertices, that is, the class of sequential dynamical systems. The ECA rules covered are precisely the π-invariant rules, that is, the rules for which the set of periodic points does not depend on the permutation update sequence. This paper reviews existing work on π-invariance and cycle-equivalence, and provides and atlas of the possible limit set structures up to topological conjugation.

ECA 기반 센서 네트워크 실시간 모니터링 서비스

무선 센서 네트워크는 실시간으로 객체에 대한 정보를 수집하기 위한 기술로 짧은 시간에 많은 양의 데이터가 지속적으로 발생되는 특성을 갖고 있다. 센서로부터 획득되는 많은 양의 데이터 스트림을 효과적으로 처리하기 위해서는 데이터 간의 관계를 정의하여 분석, 사용자가 주목할 만한 상황, 즉 센서 데이터들 중 이상 데이터가 포함되어 있는 것을 발견하는 것이 필수적이라 할 수 있다. 본 논문에서는 센서 데이터 스트림을 효과적으로 처리하기 위해 ECA 규칙을 사용하여 의미있는 데이터를 구성하고, 이를 통해 보다 실용적인 실시간 모니터링 시스템을 제안한다. Wireless sensor network is a technology that collects the information about object in real-time. Sensor data has a characteristic that is generated an unprecedented volume data in short time. Analysis is essential to define the relationship between the data, including more of the data from a large volume data stream which is acquired from the sensor. In order to effectively handle the sensor data stream, in this paper, using ECA rules to organize data in a meaningful and more practical real-time monitoring systems is proposed.

ECA Rule Learning for Resource Management in Grid Computing: Fuzzy Approach

 Abstract—Grid computing is important environment for resource sharing and distributed system integration. One discussed field in Grid computing is the resource management. In this paper, Grid-JQA architecture is used that includes active database. We focus resource management with regarding to active rule learning. Rule learning is very significant for efficient rules in active database system. Fuzzy Decision tree can use into rule update. Results shows this approach can be effectively applied for rule learning in such environments because there is attribute with continuous values and splitting at node must be dynamic.

Realizing Secure Cloud Computing Environment by ECA Rules

Cloud Computing is attracting more and more attention and is becoming the most important paradigm in the new century. However, the security problem has not been solved, which prevents the quick development of cloud computing. This paper proposes how to establish a manageable secure cloud computing environment. The management service for a secure cloud is mainly introduced, among which the security service is specially explained in details. An ECA-rule model is proposed to ensure an automatic activation when security-related events happen. The whole architecture is implemented above Hoodoop which gives the first experience of a secure cloud.

Verifying Service Composition Based on Modular Reachability Graph and Generating BPEL Codes

PDF HTML阅读 XML下载 导出引用 引用提醒 基于模块化可达图的服务组合验证及BPEL代码生成 DOI: 作者: 作者单位: 作者简介: 通讯作者: 中图分类号: 基金项目: Supported by the National Natural Science Foundation of China under Grant No.60674080 (国家自然科学基金); the National High-Tech Research and Development Plan of China under Grant Nos.2006AA04Z151, 2006AA04Z166 (国家高技术研究发展计划(863)) Verifying Service Composition Based on Modular Reachability Graph and Generating BPEL Codes Author: Affiliation: Fund Project: 摘要 | 图/表 | 访问统计 | 参考文献 | 相似文献 | 引证文献 | 资源附件 | 文章评论 摘要:为了解决基于中介器服务组合方法的状态爆炸和不能自动生成BPEL(business process execution language)的问题,提出了一种基于Petri网模块化可达图的服务组合验证方法.服务组合的Petri网模型通过中介变迁进行模型分割,分别对各个部分构建可达图,再对模块化可达图进行服务组合可行性分析.采用模块化可达图可以大量节省空间开销,有效避免空间爆炸问题.在验证服务组合可行的情况下提出了基于ECA规则形式的BPEL过程代码自动生成方法,也就是将服务组合Petri网模型的中介变迁以及每个服务对外接口的调用或操作都映射生成为ECA规则形式的BPEL代码段.通过对一个电子商务实例进行分析,说明了所提出方法的有效性. Abstract:To address state space explosion and the inability to automatically generate the BPEL (business process execution language) codes of the existing methods of composing services based on mediators, this paper presents an approach to verify the Petri net models of service composition by modular reachability graphs. In this approach, the Petri net models of service composition are divided into sub-models in a modular way, and verify the feasibility of composition by analyzing the state spaces of individual sub-models, without unfolding to the ordinary state space. Using this modular technique can avoid the state space explosion. After verification of the feasibility, the paper proposes a method of automatically generating the BPEL codes of the whole composite service from the Petri net models of composition. The main idea is to generate the BEPL codes from the fused transitions between the sub-models based on ECA rules. Finally, an application of the methods is illustrated though a case study in an e-business enterprise. 参考文献 相似文献 引证文献

A Java-Based Agent Platform for Programming Wireless Sensor Networks

Wireless sensor networks (WSNs) are emerging as powerful platforms for distributed embedded computing supporting a variety of high-impact applications. However, programming WSN applications is a complex task that requires suitable paradigms and technologies capable of supporting the specific characteristics of such networks which uniquely integrate distributed sensing, computation and communication. Mobile agents are a distributed computing paradigm based on code mobility that has already demonstrated high effectiveness and efficiency in IP-based highly dynamic distributed environments. Due to their intrinsic characteristics, mobile agents may provide more benefits in the context of WSNs than in conventional distributed environments. In this paper we present the design, implementation and experimentation of MAPS (Mobile Agent Platform for Sun SPOT), an innovative Java-based framework for wireless sensor networks based on Sun SPOT technology which enables agent-oriented programming of WSN applications. The MAPS architecture is based on components that interact through events. Each component offers a minimal set of services to mobile agents that are modeled as multi-plane state machines driven by ECA rules. In particular, the offered services include message transmission, agent creation, agent cloning, agent migration, timer handling and easy access to the sensor node resources (sensors, actuators, input switches, flash memory and battery). Agent programming with MAPS is presented through both a simple example related to mobile agent-based monitoring of a sensor node and a more complex case study for real-time human activity monitoring based on wireless body sensor networks. Moreover, a performance evaluation of MAPS carried out by computing micro-benchmarks, related to agent communication, creation and migration, is illustrated.

Rule-Based Ad-Hoc Workflow Modeling for Service Coordination: A Case Study of a Telecom Operational Support System

Workflow technology has spread over the wide areas which require process control (e.g. logistics and e-business) or resource coordination (e.g. cooperative work and grid computing). Among various types of workflow, we introduce a case of ad-hoc workflow process in a Korean telecom company. Since such a service process is generally accompanied with customer's participation, the procedure and state are flexibly changed and sometimes capricious to cope with customer's request and operator's unexpected situation. In case of network service provisioning or problem shooting processes, customers often request the changes of their service types or visit appointments, which result in flexible and adaptive management of the process instances. In this paper, we present a novel approach to workflow modeling based on modified ECA rules (named P-ECA) for the purpose of ad-hoc workflow process modeling. The rule-based workflow modeling is comprehensible to engineers and can be implemented in programs at ease; therefore it is expected that it can be widely adopted for the ad-hoc and adaptive workflow modeling which requires dynamic changes of its states by internal or external events.

Analysis and evaluation of ADBMS rules activity

Article presents analysis and evaluationof ECA rules activity.Most of active rules are implemented by triggers and functions. Sophisticated rules based systems have several problems including difficulty to control and analyse the system. We propose to use Functional Size Measurement Method to evaluate activity of rules in ADBMS. A function point is a unit of measurement to express the amount of businessfunctionality an information system provides to a user. Paper provides major reasons and benefits for using this method.

Middleware for heterogeneous subsystems interoperability in intelligent buildings

Managing heterogeneous subsystems in an intelligent building has always been elusive due to lack of interoperability factor. This is due to the nature of heterogeneous systems in an intelligent building as a distributed entity that needs a certain degree of interoperability and joint execution of tasks for managing heterogeneous systems that consist of different platforms and protocols. There is a need for interoperability in an intelligent building with a bespoke solution that could make the heterogeneous subsystems ‘talk’ with each other and interoperate regardless of the operating platform. To solve the interoperability problem, Web Services technology is seen as a potential solution that could deal with the dynamic environment of an intelligent building. In this paper, we describe a SOAP-based middleware implementation for managing heterogeneous subsystems in an intelligent building. The proposed middleware solution utilizes the SOAP technology together with ECA rule mechanism in managing subsystems interoperation in a federated manner. Experiments and performance evaluation of the middleware had been carried out to justify the performance requirement of heterogeneous systems in an intelligent building.

Interorganizational Workflow Execution Based on Process Agents and ECA Rules

Flexibility, adaptation and distribution have been regarded as major challenges of modern interorganizational workflow. To address these issues, this paper proposes an interorganizational workflow execution framework based on process agents and ECA rules. In our framework, an interorganizational workflow is modeled as a multiagent system with a process agent for each organization. The whole execution is divided into two parts: the intra-execution, which means execution within a same organization, and the inter-execution, which represents interaction between organizations. For intra-execution, we use the method of transforming the graph-based local workflow into block-based workflow to design general ECA rules. ECA rules are used to control internal state transitions and process agents are used to control external state transitions of tasks in the local workflows. Inter-execution is realized by process agent interaction protocols. The proposed approach can provide flexible execution of interorganizational workflow with distributed organizational autonomy and adaptation. A case study of offshore software development is illustrated for the proposed approach.

2DCMA: An Effective Maintenance Algorithm of Materialized Views in Peer Data Management Systems

Update management is very important for data integration systems. So update management in peer data management systems (PDMSs) is a hot research area. This paper researches on view maintenance in PDMSs. First, the definition of view is extended and the peer view, local view and global view are proposed according to the requirements of applications. There are two main factors to influence materialized views in PDMSs. One is that schema mappings between peers are changed, and the other is that peers update their data. Based on the requirements, this paper proposes an algorithm called 2DCMA, which includes two sub-algorithms: data and definition consistency maintenance algorithms, to effectively maintain views. For data consistency maintenance, Mork’s rules are extended for governing the use of updategrams and boosters. The new rule system can be used to optimize the execution plan. And are extended for the data consistency maintenance algorithm is based on the new rule system. Furthermore, an ECA rule is adopted for definition consistency maintenance. Finally, extensive simulation experiments are conducted in SPDMS. The simulation results show that the 2DCMA algorithm has better performance than that of Mork’s when maintaining data consistency. And the 2DCMA algorithm has better performance than that of centralized view maintenance algorithm when maintaining definition consistency.

ECA Rule-Based Workflow Modeling and Implementation for Service Composition

Changes in recent business and scientific environment have created a necessity for more efficient and effective workflow infrastructure. With increasing emphasis on Service-oriented architecture, service composition becomes a hot topic in workflow research. This paper proposes a novel approach of using ECA rules to realize the workflow modeling and implementation for service composition. First of all, the concept and formalization of ECA rule-based workflow is presented. Special activities and data structures are customized for the purpose of service composition. Second, an automatic event composition and decomposition algorithm is developed to ensure the correctness and validness of service composition at design time. Finally, the proposed ECA rule-based approach for service composition is illustrated through the implementation of a workflow prototype system.