7238513
An extended event matching approach in content-based pub/sub systems for EAI
Content-based publish/subscribe offers a convenient abstraction for information producers and consumers, supporting a large-scale system design and evolution by integrating several distributed independent application systems. Unlike in the traditional address-based unicast or multicast, its core problem is how to match events by predicates on the content of events. In existing matching approaches, matching predicates are composed by the conjunction and disjunction of non-semantic constraints. But, in context of enterprise application integration, although they can match events by their contents, this traditional matching predicates are not expressive enough in manipulating the complex event matching, such as the "one-to-many" and "many-to-one" matching. Therefore, traditional matching approaches should be extended to solve the complex matching problems. After analyzing information matching patterns in enterprise application integration, we propose three matching models, extend this simple matching approach to the multi-semantic matching approach and further introduce the temporal constraint variable. The multi-semantic matching approach allows using different operations in accordance with different semantics; the temporal constraint variable supports processing several discrete events in temporal sequences. Then, we extend OBDD graphs into hierarchy coloured OBDD graphs and prove the equivalence of the transformation. Based on the extended OBDD graphs, the composite matching algorithm is presented and analysed. By experiments, we show the proposed algorithm is efficient.
2507502
An Analytical Performance Model of IP-SAN
In this paper we propose a component-based analytical performance model for IP-SAN. We model four key components within IP-SAN individually and they are IP network, cache, RAID and disks. We validate these component models and compose them to give an entire IP-SAN performance model. The entire IP-SAN model analyzes the performance of an IP-SAN configuration under multiple synchronous workloads by using closed queueing network model and under asynchronous workload by using open queueing network model. We also validate the entire IP-SAN performance model against a real IP-SAN system. The theoretical results are compared with the results from a real IP-SAN using a variety of synthetic workloads. These experiments prove that the component-based method is an appropriate way to build performance model for a complex storage system. To our knowledge, this is the first exploration into building analytical performance model for entire IP-SAN system and validating against a real system. We also identify areas for future research in the performance analysis of real IP-SAN.
46077798
A Component-Based Analytical Performance Model of IP-Based SAN
In this paper we propose a component-based analytical performance model for IP-based SAN. This model evaluates and analyzes the behavior of IP network, cache, RAID and disks under multiple synchronous I/O workloads by using closed queueing networks. The theoretical results are compared with the results from a real IP-based SAN using a variety of synthetic workloads. These experiments prove that the component-based method is an appropriate way to build performance model for a complex storage system. Using the model, we can find out that the bottleneck of SAN performance is network or storage node under different workloads or applications. We also identify areas for future research in the performance analysis of real IP-based SAN.
17469824
Extending OBDD graphs for composite event matching in content-based pub/sub systems
Content-based publish/subscribe offers a convenient abstraction for the information producers and consumers, supporting a large-scale system design and evolution by integrating several distributed independent application systems. Its core problem is how to match events by predicates on the content of events. In this paper, we propose three matching models, extend the simple matching to the multi-semantic matching and introduce the temporal constraint variable. The multi-semantic matching allows using different operations in accordance with different semantics; the temporal constraint variable supports processing the discrete events in the temporal sequence. Then, we extend OBDD graphs into hierarchy coloured OBDD graphs and prove the equivalence of the transformation. At last, based on OBDD graphs the composite matching algorithm is presented and analysed. By experiments, we show the proposed algorithm is efficient.
38303932
Fuzzy inference based on fuzzy concept lattice
In this paper, a fuzzy inference method based on the notion of fuzzy concept lattice is studied. We first propose a new form of fuzzy concept lattice, and then based on three kinds of known fuzzy concept lattices and our new fuzzy concept lattice, two coherent fuzzy inference methods, the lower approximate fuzzy inference and the upper approximate fuzzy inference, are proposed, and the combined use of the two methods will make the fuzzy inference more precise.
6342666
SOWAC: a service-oriented workflow access control model
Workflow access control is the fundamental issue in workflow security. With the development of enterprise globalization and the constant re-engineering and optimizing of enterprise business, the organization becomes more dynamic and its business process is frequently changing. As a result, workflow access control turns more complicated and entails a comparatively operational mechanism. To solve the problem, in view of decoupling workflow access control model from workflow model, we propose a service-oriented workflow access control (SOWAC) model in this paper. In the SOWAC model, service is the abstraction of a task and the unit for applying access control. We present the elements of the SOWAC model and illustrate the enforcement of SOWAC with an example workflow. Then the dynamic separation of duty for the SOWAC model is proposed based on the authorization history of services. By applying SOWAC in a real workflow management system, we show that the SOWAC model is practical and effective.
121557078
Pad-analysis of fuzzy control stability
Abstract By means of an index-represented rule mapping, the response g of a fuzzy controller is decomposed into two parts: f , the classical component and g − f , the nonlinear component, called pad. We intend to analyse the pad in order to know what the relation is between fuzzy and classical PID controllers. Fuzzy controllers mentioned here are defuzzified by the typical center of gravity method. In the 1-input case, we get that f − g = 0, which means that the fuzzy controller is exactly the same as the classical P-controller, whenever the rule mapping is simple (Definition 1.2) and the linguistic values are a binary family (Definition 4.1). In the 2-input case of error and error change for simple rule mapping and for simple linguistic values family (4.7), and perfectly for the WXYZ linguistic values family (Definition 6.1), the fuzzy controller can be viewed as a series connection of a classical PD controller and a 1 + pad-element. The describing function of a 1 + pad-element is very simple and fine, and ensures that such fuzzy controller will be stable if the PD controller is. The similar consequences are also obtained for the case of three inputs.
850350
Online System Problem Detection by Mining Patterns of Console Logs
We describe a novel application of using data mining and statistical learning methods to automatically monitor and detect abnormal execution traces from console logs in an online setting. Different from existing solutions, we use a two stage detection system. The first stage uses frequent pattern mining and distribution estimation techniques to capture the dominant patterns (both frequent sequences and time duration). The second stage use principal component analysis based anomaly detection technique to identify actual problems. Using real system data from a 203-node Hadoop [1] cluster, we show that we can not only achieve highly accurate and fast problem detection, but also help operators better understand execution patterns in their system.
517875
Detecting Unsafe Driving Patterns using Discriminative Learning
We propose a discriminative learning approach for fusing multichannel sequential data with application to detect unsafe driving patterns from multi-channel driving recording data. The fusion is performed using a discriminatively trained graphical model -conditional random field (CRF). The proposed approach offers several advantage over existing information fusing approaches. First, it derives its classification power by directly modelling and maximizing the conditional probability. Second, it represents the variable dependency in an undirected graph, which is very efficient in inference. Third, it does not require to label all the training data and utilizes both labelled and unlabelled data efficiently by semi-supervised learning algorithms. The proposed approach is evaluated on driving recording data collected from driving simulator -STISIM. Experiments show it outperforms the simple discriminative classifier (SVM) and generative model (HMM).
18109532
Building Document Graphs for Multiple News Articles Summarization: An Event-Based Approach
Since most of news articles report several events and these events are referred in many related documents, we propose an event-based approach to visualize documents as graph on different conceptual granularities. With graph-based ranking algorithm, we illustrate the application of document graph to multi-document summarization. Experiments on DUC data indicate that our approach is competitive with state-of-the-art summarization techniques. This graphical representation which does not require training corpora can be potentially adapted to other languages.
35303230
The termination criterion for subdivision of the rational Bézier curves
By using some elementary inequalities, authors in this paper makes further improvement for estimating the heights of Bézier curve and rational Bézier curve. And the termination criterion for subdivision of the rational Bézier curve is also improved. The conclusion of the extreme value problem is thus further confirmed.