3417463
Handling Instance Correspondence in Inter-organisational Workflows
As business collaboration involves multiple business processes from different participating organisations, it becomes a challenging issue to manage the complex correspondence between instances of these business processes. Yet very limited support has been provided by inter-organisational workflow research. In this paper, we develop a formal method to specify instance correspondence based on a novel correspondence Petri net model. In this method, cardinality parameters are defined to represent cardinality relationships between collaborating business processes at build time, while correlation structures are designed to characterise correspondence between collaborating business process instances at run time. Corresponding algorithms are also developed to generate the correspondence Petri nets for collaborative business processes, and to trace instance correlation on the fly using the generated Petri nets.
4928164
A service workflow management framework based on peer-to-peer and agent technologies
Service workflow management which consolidates multiple services to achieve business goals has become a critical issue in service-oriented computing. Due to the unique feature of service workflows such as full distribution and high dynamicity, the contemporary workflow technology has exhibited inefficiency, vulnerability, inflexibility and lack of adaptability. Based upon the authors' previous work on peer-to-peer based workflow management and seamless integration of agents and Web services, this paper innovatively presents SwinDeW-A which is a decentralised service workflow management framework based on peer-to-peer and agent technologies. Based on this framework, this paper also discusses how autonomous service level agreement negotiation, decentralised process enactment, and autonomous process adaptation can be achieved. The proposed approach takes advantages of the peer-to-peer computing technology and the agent technology to provide more efficient, reliable, flexible and adaptive service workflow management.
1701823
Dynamic checking of temporal constraints for concurrent workflows
At present, workflow management systems have not sufficiently dealt with the issues of time, involving time modelling at build-time and time management at run-time. They are lack of the ability to support the checking of temporal constraints at run-time. Although some approaches have been devised to tackle this problem, they are limited to a single workflow and use only static techniques to verify temporal constraints. In reality, there are multiple workflows executing concurrently in a workflow management system. There may well exist resource constraints between these concurrent workflows, which affect significantly the verification of temporal constraints at run-time. This paper proposes a novel approach for dynamic verification of temporal constraints for concurrent workflows. We first investigate resource constraints in workflow management systems, and then define concurrent workflow executions. Based on these definitions, we propose a verification method by analysing the temporal relationship and resource constraints between activities among concurrent workflows.
4924842
Assigning Local Fixed-time Constraints in Grid Workflow Systems
Many complex grid workflow processes often have only one global fixed-time constraint at the last activity. Since grid workflow execution normally lasts a long time, local control is very important to ensure the overall temporal correctness. With only one global fixed-time constraint, we cannot control grid workflow execution locally in terms of time. As a result, for any temporal violations, we must handle them globally with the consideration of all activities. This would impact the overall cost-effectiveness of grid workflow execution. Therefore, in this paper, we investigate how to assign local fixed-time constraints within the global one so that we can control grid workflow execution locally. Corresponding assigning and verification methods are developed. With local fixed-time constraints, we can achieve better cost-effectiveness
14447070
Achieving convergence, causality preservation, and intention preservation in real-time cooperative editing systems
Real-time cooperative editing systems allow multiple users to view and edit the same text/graphic/image/multimedia document at the same time for multiple sites connected by communication networks. Consistency maintenance is one of the most significant challenges in designing and implementing real-time cooperative editing systems. In this article, a consistency model, with properties of convergence, causality preservation, and intention preservation, is proposed as a framework for consistency maintenance in real-time cooperative editing systems. Moreover, an integrated set of schemes and algorithms, which support the proposed consistency model, are devised and discussed in detail. In particular, we have contributed (1) a novel generic operation transformation control algorithm for achieving intention preservation in combination with schemes for achieving convergence and causality preservation and (2) a pair of reversible inclusion and exclusion transformation algorithms for stringwise operations for text editing. An Internet-based prototype system has been built to test the feasibility of the proposed schemes and algorithms
3428244
An Organisational Perspective on Collaborative Business Processes
Business collaboration is about coordinating the flow of information among organisations and linking their business processes. It brings great challenge to keep participating organisations as autonomous entities in integrating business processes of these organisations seamlessly. To address this issue, we develop a new perspective on business collaborations with a novel concept called relative workflow, which defines what a participating organisation can perceive in collaboration. By incorporating a visibility control mechanism, relative workflows allow each organisation to define its own collaboration structure and behaviours. In this paper, we present a formal definition of relative workflows and related algorithms for generating relative workflows, along with a discussion on how to perform tracking over relative workflows.
15157984
Image morphing based on mutual information and optimal mass transport
Time domain image interpolation, or image morphing, refers to a class of techniques for generating a series of smoothly changing intermediate images between two given related images. In this note, we present a novel approach based on the theoiy of optimal mass transport, using mutual information (MI) as the similarity measurement. The potential applications also include image registmtion, compression and coding.
156436
Learning Multiple Related Tasks using Latent Independent Component Analysis
We propose a probabilistic model based on Independent Component Analysis for learning multiple related tasks. In our model the task parameters are assumed to be generated from independent sources which account for the relatedness of the tasks. We use Laplace distributions to model hidden sources which makes it possible to identify the hidden, independent components instead of just modeling correlations. Furthermore, our model enjoys a sparsity property which makes it both parsimonious and robust. We also propose efficient algorithms for both empirical Bayes method and point estimation. Our experimental results on two multi-label text classification data sets show that the proposed approach is promising.
271644
RUMR: robust scheduling for divisible workloads
Divisible workload applications arise in many fields of science and engineering. They can be parallelized in master-worker fashion and relevant scheduling strategies have been proposed to reduce application markspan. Our goal is to developed a practical divisible workload scheduling strategy. This requires that previous work be revisited as several usual assumptions about the computing platform do not hold in practice. We have partially addressed this concern in a previous paper via an algorithm that achieves high performance with realistic resource latency models. In this paper we extend our approach to account for performance prediction errors, which are expected for most real-world performance and applications. In essence, we combine ideas from multiround divisible workload scheduling, for performance, and from factoring-based scheduling, for robustness. We present simulation results to quantify the benefits of our approach compared to our original algorithm and to other previously proposed algorithms.
891317
Translingual Information Retrieval: A Comparative Evaluation
Translingual information retrieval TIR con sists of providing a query in one language and searching document collections in one or more di erent languages This paper introduces new TIR methods and reports on comparative TIR experiments with these new methods and with previously reported ones in a realistic setting Methods fall into two categories query trans lation based and statistical IR approaches es tablishing translingual associations The re sults show that using bilingual corpora for au tomated extraction of term equivalences in con text outperforms other methods Translin gual versions of the Generalized Vector Space Model GVSM and Latent Semantic Indexing LSI perform relatively well as does translin gual pseudo relevance feedback PRF All showed relatively small performance loss be tween monolingual and translingual versions Query translation based on a general machine readable bilingual dictionary heretofore the most popular method did not match the per formance of other more sophisticated methods Also the previous very high LSI results in the literature were discon rmed by more realistic relevance based evaluations
5091874
Integrating Web Services into Ontology-Based Web Portal
With the explosive emerged Web services, the Web becomes a world of information and applications. So portals whose goal is presenting a structured view onto the Web should provide users with a single point access to multiple types of not only information but also services. Recently, many systems have been developed using ontology-driven approaches to automatically generate and manage Web portals. However, all of them lack the integration of Web services. In this paper, we describe SPortS, an OWL-DL(Web Ontology Language-Description Logics) based portal generation system that integrates semantic Web services into generated portals at the presentation level, the data level and the function level. We present the portal generation process, the query decomposition and the service recommendation algorithms through which semantic Web services are integrated tightly into the generated portal.