DOCSLIB.ORG

Using Cloud Computing with RETE Algorithms in a Platform As a Service (Paas) for Business Systems Development

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Using Cloud Computing with RETE Algorithms in a Platform As a Service (Paas) for Business Systems Development Using Cloud Computing with RETE Algorithms in a Platform as a Service (PaaS) for Business Systems Development Richard Poblete 1, David de la Fuente 2, and Margarita Alonso 3 1Department of Business Administration, Cantabria University, Santander, Spain [email protected] 2Department of Business Administration, Oviedo University, Gijón, Asturias, Spain [email protected] 1Department of Business Administration, Cantabria University, Santander, Spain [email protected] this technology is the Virtualization and its model of operative Abstract - Given that companies operate in an environment of business is varied and can include: Pay per Use Models; Free continuous evolution it requires information systems to have Models; Fee for Service Models and Free Use Models, greater adaptation, flexibility, scalability and reliability of sharing utilities. incorporation of these changes. Cloud Computing can be regarded as a paradigm and key element of recent computing in business management solutions. A business solution arises 1.1 Cloud Computing in the cloud; this solution includes both the environmental Cloud Computing is defined by the way in which the dynamics and the changes needed in the business logic service provider and the consumer of that service are related. assuring speed of response, efficiency in the solution and In this context it is very common that the consumers are not maintenance of the application. This article shows a design the owners of the infrastructure, they do not incur CAPEX 1, model of Saas applications based on a platform (PaaS) which since they are under a modality of rent and use from a has the business logic as central element and is subdivided in provider. The customers consume resources and only pay for "Business Objects", "Business Processes" and "Business resources used. This model is very similar to what happens Rules." According to the business rules, and in order to with the payment and consumption of energy in our homes. resolve the problem based on facts and inferences from the This business model is possible because of the following knowledge as an essential part of the construction of the features: system, expert systems are applied through the use of the RETE algorithms (Forward Chaining). 1) Virtualization: Cloud Computing allows the user to access the service in any place through any kind of terminal or device. The required resources come from the Cloud instead Keywords: Cloud Computing, SaaS, PaaS, RETE of a visible entity. 2) Reliability: The Cloud uses various methods for the fault 1 Introduction tolerance. Computing based on interchangeable isomorphic The competitive business environment demands nodes guarantees the service reliability. The Use of the companies to concentrate in business management and not in Computing Cloud is more reliable than in a local station [2]. the technological aspects of their company which may be 3) Versatility: The Cloud can stand different applications, complex because of a changing environment. It is therefore execute them at the same time and reuse their own resources. necessary to constantly redefine the Business Logic Systems. 4) Elasticity: The Cloud scale can expand dynamically in Having a platform which can adapt quickly to these conditions order to satisfy the growing demand for requirements. is extremely important. 5) “On-Demand” Service: The Cloud is a wide group of Cloud Computing is changing the traditional way of how resources that can be rented according to the customer hardware and software providers sell their products to their necessity. customers. This is another kind of business in which the product is not sold as such, but a service is sold [2]. Mainly, this platform allows sharing resources as a service. These 1 resources include infrastructure (IaaS), software (SaaS), CAPital EXpenditures (CAPEX or capex) are capital inversions or applications (PaaS), and data storage (dSaaS). At the heart of expenditures which create benefits. 6) Economic: cost reduction is given by the fault tolerance system consists of one or more conditions and different feature which has the Cloud “per se”, (very cheap isomorphic actions which may be undertaken for each complete set of nodes). The versatility, elasticity and "On Demand” Service facts that match the condition. The RETE algorithm RETE make the resources’ availability easy [2] compared to the exhibits the following major characteristics: traditional system, so the user can enjoy this low-cost advantage. • It reduces or eliminates certain types of redundancy through the use of node sharing. The article starts explaining the relevant concepts, a proposed method, and analyzing the implications of using RETE as an • essential part of such a model. It stores partial matches when performing joins between different fact types. At the same time, it allows production rule systems to avoid complete revaluation of all facts each time changes are made 2 Expert Systems (ES) in the nodes which are stored in the working Expert systems as techniques within the area of Artificial memory. Instead, the production system has to Intelligence are presented as computer programs that can evaluate the changes (deltas) in the working memory. perform various tasks: • It allows for efficient removal of memory elements • Efficiently carrying out search and recovery when facts are retracted or moved from working processes for interrelated information stored on a memory. large scale. The RETE algorithm is widely used to implement matching • functionality within pattern-matching engines to support the Formal representation of symbolic knowledge on 2 the field in which the system acts. Chain Forward and useful to interface in the formulation and use of the business rules. • Allowing inferences and heuristics to complete knowledge. 4 PaaS Model focused on the business logic • Explanation of the conclusions reached, interacting with the user explaining the line of reasoning We propose a Cloud Computing model [8] that attempts pursued. to conceptualize the development of a platform as a service (PaaS) to support software solutions as a service (SaaS). The Expert Systems constitute efficient help when requiring a model is essentially based on the business layer, taking into good interpretation of complex information, advice on the account that it is in this good level where the development of field in which the expert system works, demanding the main processes and algorithms of the SaaS solution are comparable output from the system to that from human required, leaving a secondary and subordinated rule to the experts. other two layers (Data and interface) in the business layer. Expert Systems are based on the declarative knowledge (facts In the model, the interface will depend on how we access the about objects, situations) and control knowledge (information SaaS solution (as Internet navigators, mobile devices, about the monitoring of an action). [3] [4]. Expert Systems business logic web services). Data layer is only the object incorporate capacities of explaining the reasoning followed in persistence, the metadata storage of the process structures and the resolution of problems and the acquisition of new the business rules. Figure 1 presents the general scheme of the knowledge, and also they present simple interaction model: procedures with the users [9]. 3 RETE Algorithm The RETE algorithm is a pattern matching algorithm for implementing production rule systems. It was designed by Dr. Charles L. Forgy of Carnegie Mellon University. RETE has become the basis for many popular expert systems, including CLIPS, Jess, Drools, and Soar. 2 The RETE algorithm provides a logical description Forward chaining is one of the main methods of reasoning when rules of responsible for matching data tuples (“facts”) against rules in inference (in artificial intelligence) are used and can be logically described as a pattern-matching production system. A production rule repeated applications of "modus ponens". Its implementation in expert systems and business and productive rule systems is popular. 4.1.3 Business Processes: The Workflow Reference Model defines a business process as a group of one or more connected activities, which collectively make a business goal, normally within the functional structure of an organisation [11]. Business Processes are responsible for organizing the resources of the system by means of the integration of the business rules and business objects and workflow, understanding workflows not only as automata tasks through forms of task assignation to users or roles. The model proposes the management of these BPM 5 processes which are implemented and modelled through BMPN 6. 4.1.4 Interface and Data Layer Interface Layer consists of interfaces or screens showed in the browsers, mobile devices or interfaces to other systems that consume these services. This presentation layer makes Figure 1: Model based on the business logic reference to the web service interface and sends encapsulated 4.1 Business Logic Layer: data in XML messages that only the interface knows. This layer must know the different kind of data and messages that It contains the heart of the system. It is a group of layers can be received by the service interface. with subroutines developing the last goal of the application. It Data Layer is the responsible for passive storage of the object uses interfaces among layers and management interfaces persistence, process structures and businesses rules. The Data oriented to the user in order to produce the parametrical
Load more

Recommended publications
  • Drools Expert User Guide
    Drools Expert User Guide Version 5.5.0.CR1 by The JBoss Drools team [http://www.jboss.org/drools/team.html] ....................................................................................................................................... vii 1. Introduction ................................................................................................................. 1 1.1. Artificial Intelligence ............................................................................................ 1 1.1.1. A Little History ......................................................................................... 1 1.1.2. Knowledge Representation and Reasoning ................................................ 2 1.1.3. Rule Engines and Production Rule Systems (PRS) .................................... 3 1.1.4. Hybrid Reasoning Systems (HRS) ............................................................ 5 1.1.5. Expert Systems ........................................................................................ 8 1.1.6. Recommended Reading ........................................................................... 9 1.2. Why use a Rule Engine? .................................................................................. 12 1.2.1. Advantages of a Rule Engine ................................................................. 13 1.2.2. When should you use a Rule Engine? ..................................................... 14 1.2.3. When not to use a Rule Engine .............................................................. 15 1.2.4. Scripting
    [Show full text]
  • Reactive Rules on the Web
    Reactive Rules on the Web Bruno Berstel1, Philippe Bonnard1,Fran¸cois Bry2,MichaelEckert2, and Paula-Lavinia P˘atrˆanjan2 1 ILOG 9, rue de Verdun, 94250 Gentilly, France {berstel,bonnard}@ilog.fr — http://www.ilog.com 2 University of Munich, Institute for Informatics Oettingenstr. 67, 80538 M¨unchen, Germany {bry,eckert,patranjan}@pms.ifi.lmu.de — http://www.pms.ifi.lmu.de Abstract. Reactive rules are used for programming rule-based, reactive systems, which have the ability to detect events and respond to them au- tomatically in a timely manner. Such systems are needed on the Web for bridging the gap between the existing, passive Web, where data sources can only be accessed to obtain information, and the dynamic Web, where data sources are enriched with reactive behavior. This paper presents two possible approaches to programming rule-based, reactive systems. They are based on different kinds of reactive rules, namely Event-Condition- Action rules and production rules. Concrete reactive languages of both kinds are used to exemplify these programming paradigms. Finally the similarities and differences between these two paradigms are studied. 1 Introduction Reactivity on the Web, the ability to detect events and respond to them automat- ically in a timely manner, is needed for bridging the gap between the existing, passive Web, where data sources can only be accessed to obtain information, and the dynamic Web, where data sources are enriched with reactive behavior. Reactivity is a broad notion that spans Web applications such as e-commerce platforms that react to user input (e.g., putting an item into the shopping bas- ket), Web Services that react to notifications or service requests (e.g., SOAP messages), and distributed Web information systems that react to updates in other systems elsewhere on the Web (e.g., update propagation among biological Web databases).
    [Show full text]
  • Production Systems and Rete Algorithm Formalisation Horatiu Cirstea, Claude Kirchner, Michael Moossen, Pierre-Etienne Moreau
    Production Systems and Rete Algorithm Formalisation Horatiu Cirstea, Claude Kirchner, Michael Moossen, Pierre-Etienne Moreau To cite this version: Horatiu Cirstea, Claude Kirchner, Michael Moossen, Pierre-Etienne Moreau. Production Systems and Rete Algorithm Formalisation. [Research Report] 2004, pp.21. inria-00280938 HAL Id: inria-00280938 https://hal.inria.fr/inria-00280938 Submitted on 20 May 2008 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Meta-compilation´ non intrusive du filtrage par contraintes Non intrusive meta-compilation of matching by constraints Sous Projet 1 RETE et re´ecriture´ Production Systems and Rete Algorithm Formalisation Description : The rete algorithm is a well-known algorithm for efficiently addressing the many patterns/many objects match problem, and it has been widely used and imple- mented in several applications, mainly production systems. But despite of the wide usage of production systems and the rete algorithm, to the best of our knowledge there has been just one proposition for a formal definition of the rete algorithm given by Fages and Lissajoux [FL92], but no attempt to give a formal description of production systems as a whole, giving rise to lots of ambiguities and incompatibilities between the different implementations.
    [Show full text]
  • Fuzzy Dynamic Discrimination Algorithms for Distributed Knowledge Management Systems
    Annals of “Dunarea de Jos” University of Galati Fascicle I – 2010. Economics and Applied Informatics. Years XVI – no 2 - ISSN 1584-0409 Fuzzy Dynamic Discrimination Algorithms for Distributed Knowledge Management Systems Vasile MAZILESCU Dunarea de Jos University of Galati [email protected] Abstract A reduction of the algorithmic complexity of the fuzzy inference engine has the following property: the inputs (the fuzzy rules and the fuzzy facts) can be divided in two parts, one being relatively constant for a long a time (the fuzzy rule or the knowledge model) when it is compared to the second part (the fuzzy facts) for every inference cycle. The occurrence of certain transformations over the constant part makes sense, in order to decrease the solution procurement time, in the case that the second part varies, but it is known at certain moments in time. The transformations attained in advance are called pre-processing or knowledge compilation. The use of variables in a Business Rule Management System knowledge representation allows factorising knowledge, like in classical knowledge based systems. The language of the first-degree predicates facilitates the formulation of complex knowledge in a rigorous way, imposing appropriate reasoning techniques. It is, thus, necessary to define the description method of fuzzy knowledge, to justify the knowledge exploiting efficiency when the compiling technique is used, to present the inference engine and highlight the functional features of the pattern matching and the state space processes. This paper presents the main results of our project PR356 for designing a compiler for fuzzy knowledge, like Rete compiler, that comprises two main components: a static fuzzy discrimination structure (Fuzzy Unification Tree) and the Fuzzy Variables Linking Network.
    [Show full text]
  • Evaluation and Implementation of Match Algorithms for Rule-Based Multi-Agent Systems Using the Example of Jadex
    Universität Hamburg Fakultät für Mathematik, Informatik und Naturwissenschaften Evaluation and Implementation of Match Algorithms for Rule-based Multi-Agent Systems using the Example of Jadex Master's Thesis Diplomarbeit Eryk Lagun [email protected] Studiengang Informatik Matrikelnummer: 5318142 Fachsemester: 16 Erstgutachter: Dr. Lars Braubach Zweitgutachter: Dr. Guido Gryczan Contents 1 Introduction.....................................................................................................1 1.1 Motivation and Goals....................................................................................................1 1.2 Context and Scope.........................................................................................................2 1.3 Intended Readers........................................................................................................... 4 1.4 Outline ........................................................................................................................... 4 2 Background......................................................................................................6 2.1 Rule-based Systems....................................................................................................... 6 2.1.1 Definition............................................................................................................ 7 2.1.2 Rule Execution................................................................................................... 8 2.1.3 Recognize-Act Cycle..........................................................................................8
    [Show full text]
  • Eclipse: a C-Based Inference Engine Em6edded in a Lisp Interpreter Brian Beach; Randolph Splitter Software and Systems Laboratory HPL-90-213 December, 1990
    HEWLETT PACKARD Eclipse: A C-based Inference Engine Em6edded in a Lisp Interpreter Brian Beach; Randolph Splitter Software and Systems Laboratory HPL-90-213 December, 1990 expert systems; software Artificial intelligence began on the far-out fringe engineering environment of computer science and has been progressing more and more into the mainstream of software engineering through the use of AI components, such as inference engines, that can be embedded in programs written in more traditional languages. Eclipse takes this progression one step further by allowing the use of Lisp in combination with rules and traditional C programming. Weare currently making use of Eclipse in our work on a team software development environment. Internal Accession Date Only (c)Copyright Hewlett-Packard Company 1990 1 Introduction Eclipse, the subject of this paper, is one component of an object-based software develop­ ment environment (SDE), that is being developed at Hewlett-Packard Labs in Palo Alto. This SDE is designed to support teams of developers building large software systems. In addition to providing a shared object base of project-wide information, the environment provides rule-based support for managing the software development process. These rules create an active database that responds to user actions, checks constraints and automates repetitive tasks. A typical constraint rule might require that a software module pass certain tests before being included in a release. For reasons of efficiency, the rules are attached not to the persistent, project-wide object base but rather to a local cache of objects in the virtual memory of each developer's work­ station.
    [Show full text]
  • Memory Efficient Stream Reasoning on Resource-Limited Devices
    UNIVERSITY OF DUBLIN, TRINITY COLLEGE Memory Efficient Stream Reasoning on Resource-Limited Devices by Dylan Armstrong Supervisor: Declan O'Sullivan Assistant Supervisor: Wei Tai A dissertation submitted in partial fulfillment for the degree of Master in Computer Science Submitted to the University of Dublin, Trinity College, May 2014 Declaration of Authorship I, Dylan Armstrong, declare that the following dissertation, except where otherwise stated, is entirely my own work; that it has not previously been submitted as an exercise for a degree, either in Trinity College Dublin, or in any other University; and that the library may lend or copy it or any part thereof on request. Signed: Date: i Summary The first goal of this research was to determine which of two reasoning algorithms could be adapted for use in a streaming reasoning system with memory constraints. The two algorithms investigated were TREAT and LEAPS. Once achieved, the primary goal was then to determine whether an implementation of the chosen algorithm provided a more efficient option in terms of memory consumption in a resource constrained device in comparison to an existing implementation of the RETE algorithm. This paper first illustrates the motivation for this research by providing context for why and when memory constrained devices are used in reasoning. Standard approaches usually attempt to perform reasoning on a centralised machine, sending data from sensor devices through the web or by other wired or wireless technologies. However, in some conditions this may not be feasible, or may be restrictive. In these cases reasoning can be performed on the sensor device nodes themselves.
    [Show full text]
  • 292 Chapter 9 Inference in First-Order Logic
    292 Chapter 9 Inference in First-Order Logic Rete algorithm The Rete algorithm3 was the first to address this problem. The algorithm preprocesses the set of rules in the knowledge base to construct a dataflow network in which each node is a literal from a rule premise. Variable bindings flow through the network and are filtered out when they fail to match a literal. If two literals in a rule share a variable—for example, Sells(x,y,z)∧Hostile(z) in the crime example—then the bindings from each literal are filtered through an equality node. A variable binding reaching a node for an n-ary literal such as Sells(x,y,z) might have to wait for bindings for the other variables to be established before the process can continue. At any given point, the state of a Rete network captures all the partial matches of the rules, avoiding a great deal of recomputation. Rete networks, and various improvements thereon, have been akeycomponentofso- Production system called production systems,whichwereamongtheearliestforward-chainingsystemsin widespread use.4 The XCON system (originally called R1; McDermott, 1982) was built with a production-system architecture. XCON contained several thousand rules for designing configurations of computer components for customers of the Digital Equipment Corporation. It was one of the first clear commercial successes in the emerging field of expert systems. Many other similar systems have been built with the same underlying technology, which has been implemented in the general-purpose language OPS-5. Cognitive architectures Production systems are also popular in cognitive architectures—that is, models of hu- man reasoning—such as ACT (Anderson, 1983) and SOAR (Laird et al.,1987).Insuchsys- tems, the “working memory” of the system models human short-term memory, and the pro- ductions are part of long-term memory.
    [Show full text]
  • Research of the Rule Engine Based On
    3rd International Conference on Materials Engineering, Manufacturing Technology and Control (ICMEMTC 2016) Research of the Rule Engine based on XML Zhao Ni1, a, Lifang Bai2, b 1 Zhengzhou Institute of Information Science and Technology, Henan, China, 450000, China 2 Zhengzhou Institute of Information Science and Technology, Henan, China, 450000, China aemail: [email protected], bemail:[email protected] Keywords: Pattern matching algorithm; XML; Rule engine; Rete network Abstract. As Studying of the current rule engine implementation mechanism, An XML format rules is put forward for the poor ability in the predicate expansion and the rule reuse of the traditional rule description, which can describe of the detail interface information called by entity class in rules, and the improved rete network corresponding to the rule description is proposed, forming a new pattern matching algorithm based on XML format rules. Introduction Rules engine originated from production system. It can be regarded as a component of the application, which realizes the separation of the business rules or logic in application from the program code, and writes business rules with predefined semantic module [1]. The application field of rule engine is very extensive, including banking, telecommunications billing, game software, business management, etc. At present, an open source business rules engine Drools (JBoss) is the most representative of the rule engine [2]. Pattern matching algorithm is the core algorithm in the rule engine. This paper focuses on Rete pattern matching algorithm, which is the basis for the shell of many production systems, including the CLIPS (C language integrated production system), JESS, Drools and Soar [3].
    [Show full text]
  • Rete Algorithm
    Rete algorithm The Rete algorithm (/’ri:ti:/ REE -tee or /’reɪti:/ RAY -tee , rarely /’ri:t/ REET or /rɛ’teɪ/ re- TAY ) is a pattern matching algorithm for implementing production rule systems . It is used to determine which of the system's rules should fire based on its data store. Contents • 1 Overview • 2 Description o 2.1 Alpha network o 2.2 Beta network o 2.3 Conflict resolution o 2.4 Production execution o 2.5 Existential and universal quantifications o 2.6 Memory indexing o 2.7 Removal of WMEs and WME lists o 2.8 Handling ORed conditions o 2.9 Diagram • 3 Miscellaneous considerations • 4 Optimization and performance • 5 Rete II • 6 Rete-III • 7 Rete-NT • 8 See also • 9 References • 10 External links Overview A naive implementation of an expert system might check each rule against known facts in a knowledge base , firing that rule if necessary, then moving on to the next rule (and looping back to the first rule when finished). For even moderate sized rules and facts knowledge- bases, this naive approach performs far too slowly. The Rete algorithm provides the basis for a more efficient implementation. A Rete-based expert system builds a network of nodes , where each node (except the root) corresponds to a pattern occurring in the left-hand-side (the condition part) of a rule. The path from the root node to a leaf node defines a complete rule left-hand-side. Each node has a memory of facts which satisfy that pattern. This structure is essentially a generalized trie .
    [Show full text]
  • Chapter 12 –Business Rules and DROOLS
    SOFTWARE ARCHITECTURES Chapter 12 –Business Rules and DROOLS Katanosh Morovat Introduction In the recent decade, the information systems community declares a new concept which is called business rules. This new concept is a formal approach for identifying the rules that encapsulate the structure, constraint, and control the operation as a one package. Before advent of this definition, system analysts have been able to describe the structure of the data and functions that manipulate these data, and almost always the constraints would be neglected. Business rules are statements that precisely describe, constrain, and control the structure, operations and strategies of a business in an organization. Other terms which come with business rules, are business rules engine, and business rules management system. Business rules engine which is a component of business rules management system is a software system that executes a set of business rules. Business rules management system monitors and maintains the variety and complexity of decision logic that is used by operational systems within an organization or enterprise. This logic is referred to as business rules. One of more widely used business rules management system is Drools, more correctly known as a production rules system. Drools use an enhanced implementation of the Rete algorithm. Drools support the JSR-94 standard for its business rules engine and enterprise framework for the construction, maintenance, and enforcement of business policies in an organization, application, or service. This paper describes the nature of business rules, business rules engine, and business rules management system. It also prepares some information about the Drools, included several projects, which is a software system prepared by JBoss Community, and different productions made by Logitech which have used the business rules method.
    [Show full text]
  • Diet System Using Modified RETE Algorithm
    Pathak Aniket et.al; International Journal of Advance Research, Ideas and Innovations in Technology ISSN: 2454-132X Impact factor: 4.295 (Volume 4, Issue 2) Available online at: www.ijariit.com Diet system using modified RETE algorithm Aniket Pathak Ratan Boddu [email protected] [email protected] Shah and Anchor Kutchhi Engineering College, Shah and Anchor Kutchhi Engineering College, Mumbai, Maharashtra Mumbai, Maharashtra Harsh Bhanushali Amol Kadam [email protected] [email protected] Shah and Anchor Kutchhi Engineering College, Shah and Anchor Kutchhi Engineering College, Mumbai, Maharashtra Mumbai, Maharashtra Nilakshi Jain [email protected] Shah and Anchor Kutchhi Engineering College, Mumbai, Maharashtra ABSTRACT People across the globe are becoming more conscious regarding their weight, eating more healthy food and avoiding junk food. A system that can measure calories and nutrition in everyday meals can be very useful for maintaining our health. Calories and nutrition measurement system is very beneficial for the people to measure and manage their daily food intake. Dieticians are educated with nutrient value of foods; hence they can provide a diet based on a person’s eating timing, height and weight. The system is an expert system so it asks all this data from the user and processes it. The system stores and processes this data and then calculates the Body Mass Index and Body Fat and provides the user with a personalized diet to fulfill their goals. Keywords: Modified RETE Algorithm, BMI, BMR, Expert System, Diet. 1. INTRODUCTION Nowadays, people are suffering from many issues regarding their fitness and also following a proper nutritional diet.
    [Show full text]