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.     

一种面向用户的Web服务组装方法

为了将分布在Internet上异构的Web服务组装成新的服务提供给用户,提出一种面向用户的Web服务组装方法,将组装过程分为需求拆分、服务选择、执行服务组装和服务结果合并四个阶段,并提出了基于组装模式的用户需求输入及拆分方法、基于QoS的服务选择模型和基于中间模式的异构消息转换模型。最后通过物流领域服务组装平台的设计与实现,验证了上述方法的可行性与有效性。     

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在多个服务提供者之间进行商业过程的模型.     

多约束的Web服务组合研究

随着Web服务的种类越来越多,具体的请求者对服务组合的要求越来越高。针对目前的组合方式、组合的服务质量以及用户的方便度,提出了多约束的服务组合方案。结合目前请求者和服务提供者之间对WSDL的依赖性及其交流上的不便,把Web语义加入到了Web服务组合的过程中。最后综合考虑用户对服务的满意度,采用动态规划方法,设计了多约束的水平组合解决方案。     

分布式Web服务合成的恢复机制

Web服务合成已成为一种重要的分布式网络应用开发模式。网络应用要求Web服务具有较高的可用性,进而要求Web服务必须具有快速恢复的特点。基于分布式Web服务合成的模式开发合成服务的恢复机制适合网络环境下的服务交互方式。分布式Web服务合成模式中包含有一个中心合成引擎和若干本地合成引擎,恢复机制由中心合成引擎与本地合成引擎合作实现,确保了唯一执行语义,同时又可保持Web服务的特性,并降低I/O代价。     

Web服务组合上下文模型

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

Web服务组合的安全性研究*

对Web服务组合中的安全问题进行研究,描述了如何表达安全性能和约束,改进了一个Web服务安全组合的框架,最后用一个实例来详细说明了模型的工作过程。     

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服务组合的时间效率提高问题,提出了一种基于服务社团和服务链的Web服务组合方法。在构造的服务网络上应用基于信息中心度的服务社团发现方法,将Web服务网络划分为不同的服务社团,然后构造了社团服务链发现算法和基于服务链的Web服务组合算法,这些算法将服务社团内Web服务之间的所有可组合关联转变成服务链,实现了基于社团服务链和服务质量(QoS)剪枝的Web服务组合过程。实验结果表明,与传统的图深度遍历Web服务组合方法相比,基于社团服务链的Web服务组合方法在5个测试集上的响应时间平均提高了46%,最好情况为67%。社团服务链可以有效地减少针对当前服务请求的服务搜索空间,提高服务组合的时间效率。     

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

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

基于参考网的Web服务组合模型

为了确保组合Web服务执行的可靠性,提出了基于Reference nets的Web服务组合方法。精确描述了Web服务的形式化语义,使用该方法对组合Web服务控制流的八种基本结构建立模型,并给出了建模步骤。结合应用实例使用Renew2.0.1建立组合服务模型并进行仿真,进一步验证了该方法的有效性。     

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服务组合机制

单个资源的服务往往不能满足任务需求,而多个服务的组合却可以派生出新的服务。为此,模拟迷宫求解的思路,设计了一套通用服务组合算法,将分布式资源提供的可用服务看作为迷宫中的条条道路,而将服务组合方案看作为连接迷宫入口和出口的一条通路,通过服务与服务、服务与需求之间的功能性关联,自动生成满足任务需求的服务组合方案。模拟实验验证了方法的有效性。