This paper analyzes the processing characteristics and execution mechanisms of the classical rete algorithm and points out its limitations when performing multi-entity match and multi-rule match. By employing several ...
详细信息
ISBN:
(纸本)9781457703218
This paper analyzes the processing characteristics and execution mechanisms of the classical rete algorithm and points out its limitations when performing multi-entity match and multi-rule match. By employing several technologies such as nodes sharing, types preprocessing, and index-based searching optimization, we propose an improved version of the rete algorithm, Irete, which is tested under multi-entity and multi-rule circumstances to be a much more efficient match algorithm, at the cost of a bit of loss in network construction efficiency.
The use of semantics technologies for system development is increasing nowadays. The knowledge representation in ontologies can be used in a lot of applications, ranging from knowledge-based recommendation systems unt...
详细信息
The use of semantics technologies for system development is increasing nowadays. The knowledge representation in ontologies can be used in a lot of applications, ranging from knowledge-based recommendation systems until the Semantic Web applications. The core component of the semantic applications is the logical inference engine, which process and generates new facts into the knowledge base from production rules. The inference engine's performance is directly related to the length of the knowledge base and the necessities of the nowadays knowledge bases are becoming a challenge. This paper presents a knowledge base's search algorithm for the rete algorithm which uses the intrinsic parallel structures from the modern computers, augmenting the performance of the inference engine. We implemented a Threads based and a GPU based search engine and compared their performance. We point as main contributions of this paper the parallel system that implements the search engine and the algorithm for vectorization of the knowledge base.
Runtime verification (RV) consists in part of checking execution traces against user-provided formalized specifications. Throughout the last decade many new systems have emerged, most of which support specification no...
详细信息
Runtime verification (RV) consists in part of checking execution traces against user-provided formalized specifications. Throughout the last decade many new systems have emerged, most of which support specification notations based on state machines, regular expressions, temporal logic, or grammars. The field of artificial intelligence (AI) has for an even longer period of time studied rule-based production systems, which at a closer look appear to be relevant for RV, although seemingly focused on slightly different application domains, such as, for example, business processes and expert systems. The core algorithm in many of these systems is the rete algorithm. We have implemented a rule-based system, named LOGFIRE, for runtime verification, founded on the rete algorithm, as an internal DSL in the Scala programming language (in essence a library). Using Scala's support for defining DSLs allows to write rules elegantly as part of Scala programs. This combination appears attractive from a practical point of view. Our contribution is part conceptual in arguing that such rule-based frameworks originating from AI are suited for RV. Our contribution is technical by implementing an internal rule DSL in Scala;by illustrating how specification patterns can easily be encoded that generate rules, and by adapting and optimizing the rete algorithm for RV purposes. An experimental evaluation is performed comparing to six other trace analysis systems. LogFire is currently being used to process telemetry from the Mars Curiosity rover at NASA's Jet Propulsion Laboratory.
Additive manufacturing (AM) has the capability of producing parts with more complicated shapes and functions compared with subtractive manufacturing. Design for additive manufacturing (DfAM) aims at producing design s...
详细信息
Additive manufacturing (AM) has the capability of producing parts with more complicated shapes and functions compared with subtractive manufacturing. Design for additive manufacturing (DfAM) aims at producing design solutions that can be additively manufactured. During DfAM, analysing the printability and integratbility of a target assembly are important tasks. However, the tasks require systematic analysis of the structural/functional/material characteristics, working conditions, and interaction relations among the parts in the target assembly, fully understanding of the capability and limitation of the applied AM equipment, and comprehensive design decision-making considering the characteristics of AM processing, etc. This makes it challenging to conduct printability and integratbility analysis tasks. In this regard, an expert system is established which is realised with Function-Behaviour-Structure oriented assembly structure characteristic analysing, ontology instance-based assembly structure characteristic modelling, and modified rete algorithm-based design decision-making. The system is capable of providing decision guidance on which parts in a target assembly can be printed and which among these printable parts can be printed integratedly. In this way, it can support DfAM implementation in a computer-aided manner. A WebApp that encapsulates the system is developed, and a robot arm DfAM redesign project is used as a case study.
In recent years, cloud computing has drawn more and more attention. Increasingly amount of systems and applications have been constructed in cloud environments, yet few researches of rule engine has been done. Rule en...
详细信息
In recent years, cloud computing has drawn more and more attention. Increasingly amount of systems and applications have been constructed in cloud environments, yet few researches of rule engine has been done. Rule engine technologies have been widely used in the development of enterprise information systems. These rule-based systems may encounter the problem of low performance, when a large amount of fact data are matched with these rules. Deploying rule engines in cloud environments can increase the capability and efficiency of these systems. In this paper, we propose an approach to implement rule engine based on a message-passing concurrency model in cloud computing. The approach can be extended conveniently and it can deal with extensive rules and facts efficiently. To improve the performance of the rule engine, an algorithm of allocation is proposed. A resource cost model is explored to make high efficient use of resources in cloud. In addition, we implement the rule engine system RUNES II in cloud platform and conduct experiments to show its performance.
Under traditional rule-based reasoning in a smart environment, the inference engine deployed in gateway collects context data from various sensors to match the rules, which undertakes whole reasoning work. The current...
详细信息
ISBN:
(纸本)9781728140346
Under traditional rule-based reasoning in a smart environment, the inference engine deployed in gateway collects context data from various sensors to match the rules, which undertakes whole reasoning work. The current research uses the rete algorithm to construct an inference network by rules and then allocate the rete inference nodes to Smart Nodes for collaborative reasoning based on fog computing, afterwards, the allocation mechanism becomes crucial. This paper utilizes the regularity of rules triggered under the influence of activities to design an algorithm CoA(Clustering of Activity), which clusters activities and respectively constructs the inference networks. Subsequently, calculate the shortest path between Smart Nodes and substitute the results into AAoRN(Allocation algorithm of rete inference nodes), which is proposed to overcome hierarchical delay for optimally allocating each inference node. Theoretical analysis and experimental results show that the proposed mechanism efficiently utilizes the resources and has achieved outstanding real-time performance.
Although recent developments have shown that it is possible to reason over large RDF datasets with billions of triples in a scalable way, the reasoning process can still be a challenging task with respect to the growi...
详细信息
ISBN:
(纸本)9783319188188;9783319188171
Although recent developments have shown that it is possible to reason over large RDF datasets with billions of triples in a scalable way, the reasoning process can still be a challenging task with respect to the growing amount of available semantic data. By now, reasoner implementations that are able to process large scale datasets usually use a MapReduce based implementation that runs on a cluster of computing nodes. In this paper we address this circumstance by identifying the resource consuming parts of a reasoner process and providing a solution for a more efficient implementation in terms of memory consumption. As a basis we use a rule-based reasoner concept from our previous work. In detail, we are going to introduce an approach for a memory efficient rete algorithm implementation. Furthermore, we introduce a compressed triple-index structure that can be used to identify duplicate triples and only needs a few bytes to represent a triple. Based on these concepts we show that it is possible to apply all RDFS rules to more than 1 billion triples on a single laptop reaching a throughput, that is comparable or even higher than state of the art MapReduce based reasoner. Thus, we show that the resources needed for large scale lightweight reasoning can massively be reduced.
Production system, which is also named as rule engine, has been widely used in artificial intelligence. rete algorithm is the most popular rule-match algorithm, which speeds up the whole procedure by sharing the condi...
详细信息
ISBN:
(纸本)9781509055210
Production system, which is also named as rule engine, has been widely used in artificial intelligence. rete algorithm is the most popular rule-match algorithm, which speeds up the whole procedure by sharing the conditions among the productions and storing the temporary results. However, when the size of rules and facts continues to grow, rete algorithm becomes computationally expensive and slow. In this paper, we propose an efficient approach for rule matching in production system based on Multi-Agent, which treats each node in rete algorithm as an agent, and every agent individually performs its own computational tasks and shares the state by passing messages. We also introduce indexes on tokens to accelerate the match and design a mechanism to balance the computational tasks among agents. Filially we conduct experiment to show its efficiency.
Security Information and Event Management (SIEM) is a combination of Security Information Management and Security Event Management. SIEM helps in the collection of events from heterogeneous devices and ordering into C...
详细信息
Security Information and Event Management (SIEM) is a combination of Security Information Management and Security Event Management. SIEM helps in the collection of events from heterogeneous devices and ordering into Common Event Format. The events collected are correlated and observed for changes in the system behaviour. Homogeneous Events such as DoS/Probe attacks can be detected by monitoring single event source. In this paper, TCP SYN flood attack is considered. rete algorithm is applied on the network event attributes to formulate the rules and stored in database. An alert is triggered, when the rule for TCP SYN attack is matched. (c) 2017 The Authors. Published by Elsevier B.V.
The smart home based on the Internet-of-Things (IoT) and other technologies provides people a living environment with security, convenience, comfort, environmental protection and intelligence. One of the key issues fo...
详细信息
ISBN:
(纸本)9781467352536
The smart home based on the Internet-of-Things (IoT) and other technologies provides people a living environment with security, convenience, comfort, environmental protection and intelligence. One of the key issues for the smart home service system is how to process real-time data from IoT layer rapidly and supply an initiative service with precision, individuation and intelligence. This paper proposes a smart home service framework based on event matching, and designs a hierarchical model for smart home services supporting real-time data awareness, data processing, event processing and service mapping. At the same time we improve the rete algorithm to implement event engine and analyze the performance of the improved rete algorithm. At last, an application is used to verify the feasibility and effectiveness of the smart home service based on event matching.
暂无评论