基于Petri网的服务组合故障诊断与处理

通过分析服务组合的故障需求,给出服务组合故障处理的框架.该框架采用Petri网来解决服务组合的错误发现及其处理问题.重点讨论了可用服务失败、组件失败及网络故障的情况,并相应地给出了服务组合故障模型.在此基础上对故障处理模型进行分析,给出服务组合故障处理正确性准则,并证明了其正确性.最后,采用CTL (computational tree logic)描述相关性质并提出验证服务组合故障分析的实施算法.仿真结果表明,该方法在处理服务组合故障时具有一定的优越性.     

Web服务组合时间限制一致性研究

随着Web服务技术的发展,使得利用Web服务组合来满足应用的需求成为可能。通过扩展Web服务的OWLS描述模型——加入Web服务可用时间段描述信息,使检测组合服务时间限制冲突成为可能,并给出了Web服务组合时间限制一致性检查算法,能有效地去除了存在时间限制冲突的服务组合方案,减少了因执行不合理的服务组合方案所造成的Web服务资源的浪费。     

基于多元Pi演算的Web服务形式化描述模型及其验证*

Web服务组合在运行时多发生由于类型不匹配而产生的错误,为了有效地避免这种错误,在多元Pi-演算的基础上提出了Web服务形式化描述模型。通过基本类型定义、语法定义和判定规则说明单个Web服务的类型良好性,通过操作语义说明Web服务发生组合时的类型良好性;给出Web服务可替换性定义,并在此定义基础上说明如何进行Web服务组合的功能验证。提出的类型化Web服务形式化描述模型,准确说明了Web服务组合运行时的类型良好性,以及Web服务组合的功能验证方法。最后通过例子说明,提出的定义和判断方法的有效性。     

普适计算服务组合技术综述*

普适计算环境因其所具有的动态性、资源约束性和上下文感知性使其服务的组合面临特有的问题和挑战。服务匹配和选择、服务协调和管理、错误检测和修复是解决普适计算服务组合的三个关键技术。比较了普适计算服务匹配和选择的方法,重点分析了服务协调和管理的手段,给出了错误检测和修复的方法,最后提出解决普适计算服务组合的建议。     

基于服务组合模型结构特征的性能瓶颈定位方案

在满足功能需求的前提下,组合服务的性能是赢得用户的关键,如何发现和消除性能瓶颈则是服务组合面临的重大挑战。面对这个挑战,提出一种基于服务组合模型结构特征的性能瓶颈分析方案。为了确保方案的可行性和有效性,除了对方案技术路线的可行性进行论证,还指出了实现方案需要解决的关键基本问题,即找出服务组合模型的最小结构完备集。提出一种基于随机Petri网的Web服务组合性能分析模型,并给出此模型最小结构完备集的求解和证明过程。最后,通过 一个应用实例说明了方案的有效性。     

基于CPi-calculus的网格服务行为研究

当前基于网格服务组合的编排方案（choreography proposals）只给出服务描述层面上的定义,没有提供任何推导方法来保证基于此编排方案的服务的一致性。如何验证组合服务行为的正确性和有效性是当前亟需解决的一个研究课题。形式化方法提供了行之有效的建模、推导和验证机制。本文给出网格服务组合基调,基于此基调分析了网格组合服务的动态交互行为特性,提出基于CPi-calculus（Conditional Pi-calculus）的网格组合服务的行为交互模型（IABM）,并给出组合服务交互行为的形式化描述,最后进行交互行为的模拟验证。该网格服务行为交互模型为今后网格服务的组合优化工作提供了代数推导依据。     

移动电子商务中的服务组合研究

随着移动电子商务的不断普及,用户对服务的功能和质量要求越来越高.通过服务组合,可以将单个Web服务集成为功能更强大、质量更高的服务,以更好地满足移动电子商务的应用需求.文中结合服务组合和移动电子商务,描述了面向服务的移动电子商务系统体系结构,并在此基础上构建了移动电子商务中服务组合的实现框架,将目前流行的服务组合方法分为过程驱动和语义驱动的两大类,并分析了各类方法的特点,给出了移动电子商务中服务组合方案质量的评价模型.     

移动电子商务中的服务组合研究

随着移动电子商务的不断普及,用户对服务的功能和质量要求越来越高。通过服务组合,可以将单个Web服务集成为功能更强大、质量更高的服务,以更好地满足移动电子商务的应用需求。文中结合服务组合和移动电子商务,描述了面向服务的移动电子商务系统体系结构,并在此基础上构建了移动电子商务中服务组合的实现框架,将目前流行的服务组合方法分为过程驱动和语义驱动的两大类,并分析了各类方法的特点,给出了移动电子商务中服务组合方案质量的评价模型。     

电子商务领域本体下的Web服务自动组合实现

随着Web服务应用的不断发展,如何根据服务需求进行Web服务的动态组合,已经是一个急需解决的问题。本文利用电子商务领域本体建立了Web服务本体模型,提出了基于语义的Web服务动态组合体系结构和解决方法。架构包括服务描述模块、需求解析模块和服务组合模块。最后,给出了该模型在一个购物系统中的实现。     

语义Web服务发现模型研究

语义Web服务的目标是使Web服务成为计算机可理解的实体,以便完成服务的自动发现、选择、调用、组合等。利用本体方法和服务本体描述语言是达到该目标的有效途径。本文重点是构建一个语义Web服务模型,并在此基础上给出一个服务请求实例来验证该模型的可行性。     

一种工作流环境下能耗感知的多路径服务组合方法

当前,服务组合方法只考虑组合服务QoS的优化而不考虑组合服务的能耗优化.针对这一问题,文中首先根据不同情况提出了两种服务能耗模型;其次在基于工作流的服务组合环境下,提出了一种能耗感知的多路径服务组合方法 EAMSC.该方法对服务组合的能耗优化问题进行了数学建模,并提出了一种基于启发式的多路径服务组合算法,该算法包括两个部分:一是组合服务的可行路径查找,即在满足端到端QoS约束的前提下找出若干条可行的服务组合路径;二是请求速率的分配,即在可行的服务组合路径上依据服务能耗模型分配请求流量以降低组合服务的总体能耗.最后,仿真实验结果表明:能耗感知的多路径服务组合方法与传统的服务组合方法相比,能够在保证端到端QoS约束的基础上有效地减少组合服务的总能耗.     

Novel methods for virtual network composition

Network virtualization has been proposed as a technology that aims to solve the Internet ossification. Central to the network virtualization is a virtual network composition mechanism providing an efficient mapping of virtual nodes and links onto appropriate physical resources in the network infrastructure.This paper proposes a novel backtracking heuristic algorithm for virtual network composition. Based on this algorithm, two approaches with two different objectives are presented. The first approach (Backtracking-CR) aims to compose a virtual network using the least amount of network resources, while the second (Backtracking-LB) applies load balancing for virtual network composition. Furthermore, a linear programming approach that optimizes the virtual network composition with an objective of using the least amount of network resources is presented and used to bench mark the heuristic algorithm. Simulation results show that using less network resources by applying linear programming or Backtracking-CR does not produce higher number of successfully mapped virtual networks when is compared to load balancing approach. Results also show that the proposed heuristic algorithm is scalable to large physical and virtual networks with respect to the computation time.     

可复用构件组装技术研究

构件组装是基于构件的软件开发过程中的关键环节，组装机制又是构件组装中的核心问题。本文根据不同粒度构件组装行为的特点，对小粒度构件的低层次组装和大粒度构件的高层次组装机制进行了研究。探讨了用XML描述构件组装机制的方式，以及在J2EE平台中生成可编译的JAVA源代码的方法。     

A multi-objective evolutionary approach to automatic melody generation

Existing evolutionary approaches to automatic composition generate only a few melodies in a certain style that is specified by the setting of parameters or the design of fitness functions. Thus, their composition results cannot cover the various tastes of music. In addition, they are not able to deal with the multidimensional nature of music. This paper presents a novel multi-objective evolutionary approach to automatic melody composition in order to produce a variety of melodies at once. To this end, two conflicting fitness measures are investigated to evaluate the fitness of melody; (1) stability and (2) tension. Resorting to music theory, genetic operators (i.e., crossover and mutation) are newly designed to improve search capability in the multi-objective fitness space of music composition. The experimental results demonstrate the validity and effectiveness of the proposed approach. Moreover, the analysis of composition results proves that the proposed approach generates a set of pleasant and diverse melodies.     

QoS-Aware Composite Services Retrieval

For current service-oriented applications, individual web service usually cannot meet the requirements arising from real world applications, so it is necessary to combine the functionalities of different web services to obtain a composite service in response to users＇ service requests. In order to address the problem of web service composition, this paper proposes an efficient approach to composing basic services in case no any individual service can fully satisfy users＇ requests. Compared with the general strategies adopted in most previously proposed approaches where only the best composition solution is produced, the QoS-aware service composition approach is given and top k solutions in the framework are provided, rather than focusing on obtaining the best composition solution, since the presented approach allows more candidates that are likely to meet the requirements of the users. The approach is based on a succinct binary tree data structure, and a system,named ATC （Approach to Top-k Composite services retrieval） system is implemented. In ATC, Qos is taken into account for composite service, and a heuristic-based search method is proposed to retrieve top k composite service. Some extensive experiments are designed and two web service benchmarks are used for performance study. The experimental results snow that the proposed approach can assure high precision and efficiency for composite service search.     

A hybrid approach for selecting service‐based real‐time composition algorithms in heterogeneous environments

Service‐based approach has been successfully applied to distributed environments, modelling them as pieces of functionality that exchange information by means of messages in order to achieve a common goal. The advantages of this approach can be also be applied to distributed real‐time systems, increasing their flexibility and allowing the creation of new brand applications from existing services in the system. If this is an online process, then time‐bounded composition algorithms are needed to not jeopardize the performance of the whole system. Different composition algorithms are studied and proposed, two of them optimal and another two based on heuristics. This paper presents an analytical solution that selects, depending on the structure of the application and on the load of the whole system, the most suitable composition algorithm to be executed in order to obtain a composed application in bounded time. Copyright © 2011 John Wiley & Sons, Ltd.     

Composing cardinal direction relations

We study the recent proposal of Goyal and Egenhofer who presented a model for qualitative spatial reasoning about cardinal directions. Our approach is formal and complements the presentation of Goyal and Egenhofer. We focus our efforts on the composition operator for two cardinal direction relations. We consider two interpretations of the composition operator: consistency-based and existential composition. We point out that the only published method to compute the consistency-based composition does not always work correctly. Then, we consider progressively more expressive classes of cardinal direction relations and give consistency-based composition algorithms for these classes. Our theoretical framework allows us to prove formally that our algorithms are correct. When we consider existential composition, we demonstrate that the binary relation resulting from the composition of two cardinal direction relations cannot be expressed using the relations defined by Goyal and Egenhofer. Finally, we discuss some extensions to the basic model and consider the composition problem for these extensions.     

Web服务组合行为一致性的形式化描述和分析

Web服务编排和Web服务编制从全局和局部分别定义了Web服务组合的全局交互行为和每个参与者的局部行为,为了保证Web服务组合实现的正确性,Web服务组合的全局交互行为和每个参与者的局部行为必须是一致的。首先利用进程代数给出了对Web服务组合的全局交互行为、局部行为以及二者之间的映射关系的形式化描述,在此基础上分别通过分析全局会话变迁和局部进程变迁的关系和进程互相似理论给出了Web服务组合全局交互行为和局部行为的一致性的两个形式化判定准则。同时通过案例说明了如何形式化地检测Web服务组合的全局交互行为和局部行为之间的一致性。结果显示提出的Web服务组合一致性形式化定义和检测方法能检测组合行为的一致性,从而能有效地保证Web服务组合的正确性。