753914
Integration of Semantic Tools into Document Editors
Integration of the tools used to prepare and verify software documents is vital to the eeectiveness of the software development process. This paper identiies the key requirements of such integration, outlines three possible paradigms for integration of semantic veriication tools with document editors, and reports on their prototype implementation and evaluation with respect to these requirements.
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.
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.
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.
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
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
16851151
UMR: a multi-round algorithm for scheduling divisible workloads
In this paper we present an algorithm for scheduling parallel divisible workload applications. Our algorithm uses multiple rounds to overlap communication and computation between a master and several workers. We use "uniform" rounds, i.e. a fixed amount of work is sent out to all workers at each round. This restriction makes it possible to compute an approximately optimal number of rounds, which was not possible for previously proposed algorithms. In addition, we use more realistic platform models than those used in previous works. We provide an analysis of our algorithm both for homogeneous and heterogeneous platforms and present simulation results.
1344510
COPE: traffic engineering in dynamic networks
Traffic engineering plays a critical role in determining the performance and reliability of a network. A major challenge in traffic engineering is how to cope with dynamic and unpredictable changes in traffic demand. In this paper, we propose COPE, a class of traffic engineering algorithms that optimize for the expected scenarios while providing a worst-case guarantee for unexpected scenarios. Using extensive evaluations based on real topologies and traffic traces, we show that COPE can achieve efficient resource utilization and avoid network congestion in a wide variety of scenarios.
2153539
Prediction of Protein Subcellular Multi-locations with a Min-Max Modular Support Vector Machine
How to predict subcellular multi-locations of proteins with machine learning techniques is a challenging problem in computational biology community. Regarding the protein multi-location problem as a multi-label pattern classification problem, we propose a new predicting method for dealing with the protein subcellular localization problem in this paper. Two key points of the proposed method are to divide a seriously unbalanced multi-location problem into a number of more balanced two-class subproblems by using the part-versus-part task decomposition approach, and learn all of the subproblems by using the min-max modular support vector machine (M3-SVM). To evaluate the effectiveness of the proposed method, we perform experiments on yeast protein data set by using two kinds of task decomposition strategies and three kinds of feature extraction methods. The experimental results demonstrate that our method achieves the highest prediction accuracy, which is much better than that obtained by the existing approach based on the traditional support vector machine.
1759932
Main business service dimensions in an e-commerce environment
Improving service quality has long been recognized as a key business strategy in consumer market. However, little is written in the literature about service among business organizations. The shortage of knowledge on business service (BS) poses a significant challenge in tracking and improving BS quality in today's e-commerce environment. To address this, this paper takes a first step to identify main BS dimensions in an e-commerce environment. It first provides a review on BS. Then the BS gap model and main BS dimension are identified. The paper concludes with a summary and future research suggestions.
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