A Survey on IT-Techniques for a Dynamic Emergency Management in Large Infrastructures

This deliverable is a survey on the IT techniques that are relevant to the three use cases of the project EMILI. It describes the state-of-the-art in four complementary IT areas: Data cleansing, supervisory control and data acquisition, wireless sensor networks and complex event processing. Even though the deliverable’s authors have tried to avoid a too technical language and have tried to explain every concept referred to, the deliverable might seem rather technical to readers so far little familiar with the techniques it describes

Dynamic Validation Logic Generation using Business Rules Management Systems

Input validation in web applications represents an important part of their functionality. With proper validation we ensure that provided input data is in accordance with technical constraints, defined by the developer and with business-related constraints. In web development frameworks, validation logic is coupled with program code. If one validation rule is changed, application needs to be recompiled and redeployed. In this thesis we developed a system for input validation based on business rules management system. Validation rules are stored in central repository, separated from implementation of web applications. Thus, we have achieved a simple and transparent way of declaring validation logic in the form of declarative business rules as well as simplifed applications maintenance in case of changes in validation logic

A Pattern Calculus for Rule Languages: Expressiveness, Compilation, and Mechanization (Artifact)

This artifact contains the accompanying code for the ECOOP 2015 paper: "A Pattern Calculus for Rule Languages: Expressiveness, Compilation, and Mechanization". It contains source files for a full mechanization of the three languages presented in the paper: CAMP (Calculus for Aggregating Matching Patterns), NRA (Nested Relational Algebra) and NNRC (Named Nested Relational Calculus). Translations between all three languages and their attendant proofs of correctness are included. Additionally, a mechanization of a type system for the main languages is provided, along with bidirectional proofs of type preservation and proofs of the time complexity of the various compilers

A Pattern Calculus for Rule Languages: Expressiveness, Compilation, and Mechanization

This paper introduces a core calculus for pattern-matching in production rule languages: the Calculus for Aggregating Matching Patterns (CAMP). CAMP is expressive enough to capture modern rule languages such as JRules, including extensions for aggregation. We show how CAMP can be compiled into a nested-relational algebra (NRA), with only minimal extension. This paves the way for applying relational techniques to running rules over large stores. Furthermore, we show that NRA can also be compiled back to CAMP, using named nested-relational calculus (NNRC) as an intermediate step. We mechanize proofs of correctness, program size preservation, and type preservation of the translations using modern theorem-proving techniques. A corollary of the type preservation is that polymorphic type inference for both CAMP and NRA is NP-complete. CAMP and its correspondence to NRA provide the foundations for efficient implementations of rules languages using databases technologies

Adaptive business rules framework for workflow management

Changing scattered and dynamic business rules in Business Workflow Systems has become a growing problem that hinders the use and configuration of workflow-based applications. There is a gap in the existing research studies which currently focus on solutions that are application specific, without accounting for the universal logical dependencies between the business rules and, as a result, do not support adaptation of the business rules in real time. Design/methodology/approach – To tackle the above problems, this paper adopts a bottom-up approach, which puts forward a component model of the business process workflows and business rules based on purely logical specification which allows incremental development of the workflows and indexing of the rules which govern them during the initial acquisition and real-time execution. Results – The paper introduces a component-based event-driven model for development of business workflows which is purely logic based and can be easily implemented using an object-oriented technology together with a formal model for accounting the business rules dependencies together with a new method for incremental indexing of the business rules controlling the workflows. It proposes a two-level inference mechanism as a vehicle for controlling the business process execution and adaptation of the business rules at real time based on propagating the dependencies between the rules. Originality/value –The major achievement of this research is the universal, strictly logic-based event-driven framework for business process modelling and control which allows automatic adaptation of the business rules governing the business workflows based on accounting for their structural dependencies. An additional advantage of the framework is its support for object-oriented technology which can be implemented with enterprise-level quality and efficiency. Although developed primarily for application in construction industry the framework is entirely domain-independent and can be used in other industries, too

Messaging Rules as a Programming Model for Enterprise Application Integration

Rule-based systems and languages are successful in many application areas such as business rules or active database systems. The goal of the Demaq project is to investigate the feasibility and benefits of using a declarative, rule-based programming language to simplify the development of complex, distributed applications. For this purpose, we propose a novel programming paradigm based on messaging, queues and declarative rules. We focus on evaluating whether the proposed, rule-based approach can be used to implement complex application patterns. We use Enterprise Application Integration (EAI) as an example application domain, as EAI applications involve multiple, heterogeneous systems with complex interaction patterns. We discuss whether and how these application patterns can be implemented using our rule language

Autonimic energy-aware task scheduling

International audienceThe increasing processing capability of data-centers increases considerably their energy consumption which leads to important losses for companies. Energy-aware task scheduling is a new challenge to optimize the use of the computation power provided by multiple resources. In the context of Cloud resources usage depends on users requests which are generally unpredictable. Autonomic computing paradigm provides systems with self-managing capabilities helping to react to unstable situation. This article proposes an autonomic approach to provide energy-aware scheduling tasks. The generic autonomic computing framework FrameSelf coupled with the CloudSim energy-aware simulator is presented. The proposed solution enables to detect critical schedule situations and simulate new placements for tasks on DVFS enabled hosts in order to improve the global energy efficiency