BPEL中的Web服务动态合成机制

Web服务业务流程执行语言(BPEL)是一种Web服务合成语言.本文研究了Web服务合成的概念及其特点,详细分析了Web服务寻址及BPEL中的Web服务动态合成机制,并举例说明.     

BPEL for People的研究与应用

Web服务的业务流程执行语言（Business Process Execution Language for Web Services．简称BPEL4WS或BPEL）是对Web服务整合的一种规范化语言。本文介绍了BPEL4WS的基本概念以及在用户交互方面的扩展（BPEL for People）,最后给出BPEL4WS文档,描述具体的流程实例。     

基于BPEL和QoS的动态Web服务组合框架研究

利用BPEL语言可以将单独的Web服务组合成复杂的业务流程,但是BPEL语言不支持在业务流程执行阶段进行修改操作。虽然BPEL语言有错误处理和补偿机制,但是如果业务流程不能继续执行就会影响到业务执行效率。针对这一问题,提出了基于BPEL和QoS的动态Web服务组合框架,利用QoS组件的动态绑定功能和UDDI的动态发现Web服务功能,实现在业务流程运行时动态选择Web服务的功能,从而提高业务流程的执行效率。     

BPEL中同步与异步机制

Web服务业务流程执行语言（BPEL）是一种Web服务组合语言。本文详细分析了BPEL中的并发和同步控制、同步与异步通讯机制．并举例说明。     

基于翻译模式的BPEL到LOTOS映射方法研究

为了实现由BPEL描述的Web服务组合到LOTOS的自动化转换, 提出一种基于翻译模式的转换算法。从BPEL语言的XML schema定义出发, 分析BPEL本身的语言结构, 得到BPEL语言的产生式。再根据BPEL到LOTOS的语义映射规则, 设计BPEL到LOTOS的翻译模式。同时, 在基本映射规则之上, 给出BPEL到LOTOS的数据类型和故障处理机制的转换规则。最后结合Web服务实例, 验证该工具的可行性。     

基于BPEL4WS的Web服务整合研究

业务流程执行语言（BPEL4WS）是整合Web 服务的标准，其作用是将一组现有的服务整合起来，从而定义一个新的 Web 服务。首先介绍了业务流、工作流、以及BPEL4WS在Web服务建模方面的基本概念，建立了BPEL4WS整合Web服务模型，提出了组合服务的方法和过程。最后通过实例证明了BPEL4WS服务整合的实用性。     

Web服务组合语言的出错与补偿处理的pi演算编码

本文研究了Web服务组合语言BPEL4WS的出错与补偿处理的pi演算编码,目的是实现Web服务组合语言BPEL4WS自动验证过程。本文对pi演算进行扩充以编码BPEL4WS程序,给出了pi演算对BPEL活动的编码规则。在一个作用域的条件下,用pi演算的通信并发结构表示BPEL4WS规范的出错与补偿处理结构,采用传名机制分别处理程序化显式抛出故障与非程序序化抛出故障的捕获,给出BPEL4WS的出错与补偿处理的pi演算编码,为系统地完成从Web服务组合语言BPEL4WS规范到扩展pi演算的编码奠定了基础。     

基于BPEL的Web服务快速组合框架

针对当前Web服务组合语言以及Web服务组合过程的复杂性,提出基于业务流程执行语言(BPEL)的Web服务快速组合框架。该框架用有向无环图(DAG)表示服务组合逻辑,通过对DAG解析自动生成发布工作流所需要的各种文档。对原型系统的验证结果表明,该框架能将BPEL的复杂性隐藏起来,达到Web服务快速组合的目的。     

网格服务的合成模型研究

开放网格体系结构OGSA规范通过整合网格和Web服务技术确定了网格服务分布式系统框架，但其中关于网格服务合成的方面并没有定义相应的规范，业务流程执行语言BPEL4WS是应用于Web服务上的服务合成规范。通过分析网格服务和Web服务的异同，设计出一种可行的模型，解决了BPEL4WS不支持网格服务中部分特性的问题，从而可以将BPEL4WS应用于网格服务合成上。     

基于接口自动机的BPEL4WS Web服务组合形式化模型

介绍了接口自动机的基本语法,针对目前最主要的一种描述和执行基于工作流模式的Web服务组合的规范——Web服务商业流程执行语言 (business process execution language for Web services,BPEL4WS),定义了接口自动机和BPEL4WS之间的概念映射,并给出了BPEL4WS的基于接口自动机的形式化模型,最后通过一个案例给出了BPEL4WS到接口自动机的映射及验证的方法。     

Vague集向Fuzzy集转化的一种新方法

提出Vague值向Fuzzy值转化的实用方法的定义。针对文献[6]中的一个Vague值向Fuzzy值转化的均值修正法,提出了加权均值修正法,并证明了这种方法同样是Vague值向Fuzzy转化的一种非常实用的方法。     

A disruption recovery plan in a three-stage production-inventory system

This paper proposes a recovery plan for managing disruptions in a three-stage production-inventory system under a mixed production environment. First, a mathematical model is developed to deal with a disruption at any stage while maximizing total profit during the recovery-time window. The model is solved after the occurrence of a disruption event, with changed data used to generate a revised plan. We also propose a new and efficient heuristic for solving the developed mathematical model. Second, multiple disruptions are considered, where a new disruption may or may not affect the recovery plans of earlier disruptions. The heuristic, developed for a single disruption, is extended to deal with a series of disruptions so that it can be implemented for disruption recovery on a real-time basis. We compare the heuristic solutions with those obtained by a standard search algorithm for a set of randomly generated disruption test problems, and that show the consistent performance of our developed heuristic with lower computational times. Finally, some numerical examples and a real-world case study are presented to demonstrate the benefits and usefulness of our proposed approach.     

Monocular Vision for Mobile Robot Localization and Autonomous Navigation

This paper presents a new real-time localization system for a mobile robot. We show that autonomous navigation is possible in outdoor situation with the use of a single camera and natural landmarks. To do that, we use a three step approach. In a learning step, the robot is manually guided on a path and a video sequence is recorded with a front looking camera. Then a structure from motion algorithm is used to build a 3D map from this learning sequence. Finally in the navigation step, the robot uses this map to compute its localization in real-time and it follows the learning path or a slightly different path if desired. The vision algorithms used for map building and localization are first detailed. Then a large part of the paper is dedicated to the experimental evaluation of the accuracy and robustness of our algorithms based on experimental data collected during two years in various environments.     

An energy efficient re-access scheme for data caching in data broadcast of a mobile computing environment

Data caching is used to improve the response time and the power consumption of a mobile client in a mobile computing environment. To enhance the performance of data caching, one needs to improve the hit ratio and to reduce the cost in processing a cache miss. In a mobile computing environment, a cached data item of a mobile client needs to remain up-to-date with respect to its corresponding data item in the server. A cached data item which is out of date is called a cached invalidated data item. Accessing a cached invalidated data item can be regarded as processing a cache miss. To access a cached invalidated data item, a mobile client needs to download the new content of the data item from the broadcast channel. This operation is called a re-access operation in this paper. Re-accessing a cached invalidated data item incurs large tuning time overhead. In this paper, we propose a re-access scheme that reduces this overhead by allowing a mobile client to access a cached invalidated data item from the broadcast channel without accessing indices. We analyze the performance of the proposed scheme and validate the analysis through experiments. The experiments showed that the proposed scheme significantly reduces the tuning time of a mobile client. Furthermore, the proposed scheme is robust in the sense that it allows changes on the broadcast structure in data broadcasting.     

Reliability analysis of a repairable duplex system

We analyse the survival time of a repairable duplex system characterised by cold standby and by a pre-emptive priority rule. We allow general probability distributions for failure and repair. Moreover, an important realistic feature of the system is the general assumption that the non-priority unit has a memory. This combination of features has not been analysed in the previous literature. Our (new) methodology is based on a concatenation of a Cauchy-type integral representation of the modified Heaviside unit-step function and a two-sided stochastic inequality. Finally, we introduce a security interval related to a security level and a suitable risk-criterion based on the survival function of the system. As a practical application, we analyse some particular cases of the survival function jointly with the security interval corresponding to a security level of 90.     

Catadioptric Projective Geometry

Catadioptric sensors are devices which utilize mirrors and lenses to form a projection onto the image plane of a camera. Central catadioptric sensors are the class of these devices having a single effective viewpoint. In this paper, we propose a unifying model for the projective geometry induced by these devices and we study its properties as well as its practical implications. We show that a central catadioptric projection is equivalent to a two-step mapping via the sphere. The second step is equivalent to a stereographic projection in the case of parabolic mirrors. Conventional lens-based perspective cameras are also central catadioptric devices with a virtual planar mirror and are, thus, covered by the unifying model. We prove that for each catadioptric projection there exists a dual catadioptric projection based on the duality between points and line images (conics). It turns out that planar and parabolic mirrors build a dual catadioptric projection pair. As a practical example we describe a procedure to estimate focal length and image center from a single view of lines in arbitrary position for a parabolic catadioptric system.     

The conversion of a dynamic B-spline curve into piecewise polynomials in power form

The evaluation of points and the computations of inflection points or cusps on a curve are often necessary in CAGD applications. When a curve is represented in a B-spline form, such computations can be made easier once it is transformed into a set of piecewise polynomial curves in power form. The usual practice of the transformation of a B-spline curve into a set of piecewise polynomial curves in power form is done either by a knot refinement followed by basis conversions, or by applying a Taylor expansion on each knot span of a B-spline curve.Presented in this paper is a new algorithm to convert a B-spline curve into a set of piecewise polynomial curves in power form. Experiment shows that the proposed algorithm significantly outperforms the conventional approach when one or more control points of a B-spline curve are continuously moving.     

Formatting texts accessed randomly

Full-text systems that access text randomly cannot normally determine the format operations in effect for a given target location. The problem can be solved by viewing the format marks as the non-terminals in a format grammar. A formatted text can then be parsed using the grammar to build a data structure that serves both as a parse tree and as a search tree. While processing a retrieved segment, a full-text system can follow the search tree from root to leaf, collecting the format marks encountered at each node to derive the sequence of commands active for that segment. The approach also supports the notion of a ‘well formatted’ document and provides a means for verifying the well-formedness of a given text. To illustrate the approach, a sample set of format marks and a sample grammar are given suitable for formatting and parsing the article as a sample text.     

COS:度量分布式大数据处理系统的效率

【目的】在大数据处理领域,分布式计算系统得到广泛应用,它们的可扩展性得到重点关注,但其绝对性能往往没有得到重视。我们希望提出科学合理、与时俱进的度量标准,对分布式系统的性能进行评估。【方法】本文通过对比特定任务的单机实现和分布式实现来讨论分布式系统的性能,提出COS(Configuration that Outperforms a Single machine)这一指标,来衡量分布式系统在达到单台机器的性能时,需要的硬件资源数量。我们选取k-means聚类和逻辑回归两个经典机器学习算法,对其进行单机多线程实现,并通过向量化计算、优化内存分配与访问等方式对性能进行了优化,为分布式多机系统的性能提供参考。【结果】以Apache Spark作为对标系统,实验发现无论是使用其原生编程接口,还是经过悉心优化的机器学习库,都要使用数倍甚至数百倍的机器,才能达到单机多线程实现的性能。【局限】分布式系统与单机实现进行性能对比并不是完全公平的,分布式系统的额外开销客观存在。【结论】但COS指标仍能反映分布式系统存在的绝对性能较差、没有充分利用硬件优势等问题。