Log-based transactional workflow mining

A continuous evolution of business process parameters, constraints and needs, hardly foreseeable initially, requires a continuous design from the business process management systems. In this article we are interested in developing a reactive design through process log analysis ensuring process re-engineering and execution reliability. We propose to analyse workflow logs to discover workflow transactional behaviour and to subsequently improve and correct related recovery mechanisms. Our approach starts by collecting workflow logs. Then, we build, by statistical analysis techniques, an intermediate representation specifying elementary dependencies between activities. These dependencies are refined to mine the transactional workflow model. The analysis of the discrepancies between the discovered model and the initially designed model enables us to detect design gaps, concerning particularly the recovery mechanisms. Thus, based on this mining step, we apply a set of rules on the initially designed workflow to improve workflow reliability. The work presented in this paper was partially supported by the EU under the SUPER project (FP6-026850) and by the Lion project supported by Science Foundation Ireland under Grant No. SFI/02/CE1/I131.     

QoS-aware service composition in cloud computing using data mining techniques and genetic algorithm

One of the requirements of QoS-aware service composition in cloud computing environment is that it should be executed on-the-fly. It requires a trade-off between optimality and the execution speed of service composition. In line with this purpose, many researchers used combinatorial methods in previous works to achieve optimality within the shortest possible time. However, due to the ever-increasing number of services which leads to the enlargement of the search space of the problem, previous methods do not have adequate efficiency in composing the required services within reasonable time. In this paper, genetic algorithm was used to achieve global optimization with regard to service level agreement. Moreover, service clustering was used for reducing the search space of the problem, and association rules were used for a composite service based on their histories to enhance service composition efficiency. The conducted experiments acknowledged the higher efficiency of the proposed method in comparison with similar related works.     

基于EJBCA的Web Service应用研究

CA作为可信的第三方机构,可以实现对用户数字证书的管理.为了解决在应用系统开发过程中,不能很方便地获得用户数字证书的问题,提出了使用免费的开源软件EJBCA来实现CA的基本功能.在应用系统开发中,通过EJBCAWeb Service,用户可以很方便地获得用户数字证书信息.对EJBCA特点和基本结构进行了介绍,并在此基础上讨论了EJBCA搭建的基本过程,然后对EJBCA Web Service的配置过程进行了深入的研究.应用实例说明了通过EJBCA WebService可以让获得用户数字证书信息的过程变得十分的简单.     

基于WSFL的Web服务组合

运用Web服务组合技术可以将越来越多的Web服务组合成一个更新更强大的服务.随着Web服务组合技术的发展,出现了各种用于描述和规范Web服务组合过程的语言.其中,WSFL是一种相对成熟的Web服务组合语言.介绍了Web服务组合的概念、方式、过程以及WSFL的相关概念,提出了使用WSFL在多个服务提供者之间进行商业过程的模型.     

搜索引擎中的网络数据挖掘技术

万维网包含大量的信息,而且随着其快速的增长而变得越来越复杂,这就导致了现在用户定位相关和高质量信息的搜索变得越来越难。将网络数据挖掘技术应用于搜索引擎将大大改善搜索引擎的搜索效率以及搜索质量。提出了具体的算法,并阐述了此算法在搜索引擎中的应用。     

Context-based matching for Web service composition

In this paper, we propose a novel matching framework for Web service composition. The framework combines the concepts of Web service, context, and ontology. We adopt a broad definition of context for Web services, encompassing all information needed for enabling interactions between clients and providers. Context-based matching for Web services requires dealing with three major research thrusts: context categorization, modeling, and matching. We first propose an ontology-based categorization of contextual information in Web service environments. We then define a two-level mechanism for modeling Web service contexts. In the first level, service providers create context specifications using category-specific Web service languages and standards. In the second level, context specifications are enveloped by policies (called context policies) using WS-Policy standard. Finally, we present a peer-to-peer architecture for matching context policies. The architecture relies on a context matching engine, context policy assistants, and context community services. Community services implement rule-based techniques for comparing context policies. Recommended by: Zakaria Maamar     

Web服务组合上下文模型

基于上下文感知计算,提出一种新颖的Web服务组合上下文模型.一方面,服务组合中的信息被定义为服务和用户上下文,前者又被区分为概要、会话和填充上下文;另一方面,采用多策略机制管理上下文.为此,定义了一种基于ECA规则的语言-服务扩展策略描述语言(PDL-S).采用以上语言描述上下文管理策略和组合服务.该模型不但充分利用了上下文感知计算,而且具有良好的协作性、扩展性和灵活性.     

一种基于容错Web Services的日志恢复算法

一般基于日志的容错恢复算法会丢失请求.文章基于被动复制模式描述了一个基于日志的算法,其主要思想是将消息类型分类记载和恢复.该算法能有效克服请求丢失的情况.实验表明了该算法的正确性.     

基于业务规则的Web服务整合

Web服务实现了Internet环境下企业应用的松散耦合与集成,使企业可以方便地集成现有的应用和部署新的应用。当前,已有不少Web服务整合模型提出,但大多忽视了业务规则在模型中的重要作用。为此提出了一个基于结构化的业务规则的Web服务整合模型来实现业务过程的动态整合,并将详细阐述整合模型所需的基本元素和结构化业务规则思想,以及Web服务整合的过程。     

Efficient planning for top-K Web service composition

This paper proposes a novel approach based on the planning-graph to solve the top-k QoS-aware automatic composition problem of semantic Web services. The approach includes three sequential stages: a forward search stage to generate a planning-graph to reduce the search space of the following two stages greatly, an optimal local QoS calculating stage to compute all the optimal local QoS values of services in the planning, and a backward search stage to find the top-K composed services with optimal QoS values according to the planning-graph and the optimal QoS value. In order to validate the approach, experiments are carried out based on the test sets offered by the WS-Challenge competition 2009. The results show that the approach can find the same optimal solution as the champion system from the competition but also can provide more alternative solutions with the optimal QoS for users.     

Web数据挖掘在个性化推荐服务的应用

随着Internet的迅速发展和普及,人们在网络上开展的活动也越来越多,尤其是电子商务的兴起,使得网上购物逐渐成为一种时尚.然而由于互联网上的信息量日益增长,人们面对这些庞大的信息感到无所适从,花费大量时间在搜寻信息上,因此如何为用户提供更好的服务变得非常迫切.本文以数据挖掘理论为基础,分析和探讨了关联规则挖掘算法并应用该方法实现web个性化推荐服务.     

Semantic based aspect-oriented programming for context-aware Web service composition

An aspect-oriented programming (AOP) based approach is proposed to perform context-aware service composition on the fly. It realises context-aware composition by semantically weaving context into Web service composition. The context weaver algorithm is implemented and illustrated. The proposed semantic weaving allows Web services to be composed as the context changes.     

The effects of alliance information on Web service composition

Web service composition (WSC) has emerged as a promising approach to integrating business applications within and across organizational boundaries. One of the major objectives of WSC research is to improve the performance of composite Web services. To this end, alliance information between different services partners has great potential, but has been overlooked by extant approaches to composing Web services. To address the above limitation, we propose an alliance-aware method for WSC in this paper, which incorporates the alliance information in constructing Web services. In addition, we adopt a multi-agent architecture to model and evaluate methods for WSC. Our experiment results reveal a significant impact of alliance information on the performance of WSC. We believe our findings on WSC are important to both WSC researchers and practitioners.