17485840
A framework for application server based Web services management
Web services are considered as solution for solving the interoperability problem and the challenge of integration. How to manage Web services more efficiently is a key problem to the applications based on Web services at present. This paper presents a framework for application server based Web services management named FASWSM. The main contribution of FASWSM is Web service adaptation, so that a Web service can be plugged into the application server (AS) as a Web service adapter which enables a Web service to be managed by the application server. Therefore, the Web services management efforts are greatly reduced by leveraging various services provided by the AS. The FASWSM also provides mechanisms for dynamical reconfiguration which improve the extensibility and flexibility of Web services management. The FASWSM has been applied to OnceAS 2.0 application server, and the experiments data show that FASWSM outperforms JAX-RPC in terms of Web service invocation.
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.
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.
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.
7297586
Diversifying and improving business process management systems by service cooperation middleware
Emerging service oriented business process management (BPM) systems require efficient middleware infrastructure. However, current techniques for middleware are not optimal for that because they all do not have service-oriented natures themselves. This paper introduces a novel service cooperation middleware (SCM), which is designed to meet such requirements. It improves the development and integration of loosely coupled service oriented BPM system by applying several concepts such as control flow semantic and projection operation, etc. Furthermore, based on the SCM architecture, the related process integration suit viz. ISProcessIntegration (PI) can be widely applied into all kinds of scenes, for example EAI, B2B, B2C, P2P, cluster, with different topologies.
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.
2663170
A Framework for Building Privacy-Conscious Composite Web Services
The rapid growth of Web applications has prompted increasing interest in the area of composite Web services that involve several service providers. The potential for such composite Web services can be realized only if consumer privacy concerns are satisfactorily addressed. In this paper, we propose a framework that addresses consumer privacy concerns in the context of highly customizable composite Web services. Our approach involves service producers exchanging their terms-of-use with consumers in the form of "models". Our framework provides automated techniques for checking these models at the consumer site for compliance of consumer privacy policies. In the event of a policy violation, our framework supports automatic generation of "obligations" that the consumer generates for the composite service. These obligations are automatically enforced through a dynamic program analysis approach on the Web service composition code. We illustrate our approach with the implementation of two example services
4405529
BUPT at TREC 2006: Spam Track
This report summarizes our participation in the TREC 2006 spam track, in which we consider the use of Bayesian models for the spam filtering task. Firstly, our anti-spam filter, Kidult, is briefly introduced. And then we try to use weighted adjustment of separating hyper- plane and selective classifiers ensemble to improve the filtering performance. Finally, we sum- marize the relevant results from the official evaluation.
15478948
Efficient Video Object Segmentation by Graph-Cut
Segmentation of video objects from background is a popular computer vision topic and has many important applications. Most existing methods are either computationally expensive or requiring manual initialization, static cameras, and/or rigid scenes. In a previous work, we proposed a joint spatio-temporal linear regression algorithm to automatically cluster the sparse edge/corner pixels in each video frame and obtain two motion models for the object and background respectively. To label the rest pixels for object segmentation, in this paper, we propose to model the Optical-Flow residual error, color intensity residual error and temporal label consistency features, as well as color/edge orientation consistency constrains, in a graph, and apply the Graph-Cut algorithm to minimize the energy of the graph to obtain an optimal segmentation of the two motion layers boundaries. Finally the object layer is identified from the two using simple heuristics. Experimental segmentation result with videos taken by webcams is promising.
2237682
Document clustering based on non-negative matrix factorization
In this paper, we propose a novel document clustering method based on the non-negative factorization of the term-document matrix of the given document corpus. In the latent semantic space derived by the non-negative matrix factorization (NMF), each axis captures the base topic of a particular document cluster, and each document is represented as an additive combination of the base topics. The cluster membership of each document can be easily determined by finding the base topic (the axis) with which the document has the largest projection value. Our experimental evaluations show that the proposed document clustering method surpasses the latent semantic indexing and the spectral clustering methods not only in the easy and reliable derivation of document clustering results, but also in document clustering accuracies.
28994560
A Transaction-Aware Coordination Protocol for Web Services Composition
With the rapid development of WWW, Web Service is becoming a new application model for decentralized computing based on Internet. However, the tradeoff problem between consistency and resource utilization is the primary obstructer for building a transactional environment for Web Services Compositions. Since a resource may not be acceptable to lock exclusively by an unknown Internet user, we propose a Transaction-Aware Tentative Hold Protocol (taTHP) to perceive the transaction context information and play a more active role in transaction coordination. With the capability of forecasting the will-succeed transactions in a fairly small scope of candidates, taTHP is able to achieve more resource utilization with smaller complaints about the transaction coordination. Finally, a comprehensive comparison is carried out to demonstrate the improvement of the proposed protocol. And it can be concluded from the result that taTHP is provided with better efficiency and satisfactory quality of service.