43250103
An Agent-Based Ontological Approach for Information Reorganisation
This paper presents a novel approach for information reorganisation which is particularly suitable for distributed computing, such as Web services. An agent-based architecture is developed to cope with service agents' on and off and provide semantic support for implementation of complex e-business applications that may span diverse enterprises. A frame-based ontology representation is discussed. The representation is well suited for representing complex relationships that are unavailable in current ontology related work. Our approach aims to support dynamic information reorganisation in the Internet based e-business applications. The obtained information can serve for the knowledge acquisition purpose.
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
14000419
Using an experimental study to develop group awareness support for real-time distributed collaborative writing
Supporting group awareness is vital for the success of real-time, distributed, collaborative writing systems. Many awareness mechanisms have been introduced, but highly effective solutions are few. The research presented in this paper focuses on the development of awareness mechanisms using an experimental study of synchronous distributed collaborative writing. Our study has made two major contributions to research on group awareness. First, the study compares the importance of different awareness elements in supporting group awareness for collaborative writing. The results of our Wilcoxon test on awareness elements identify the five most important elements, including ‘‘Being able to comment on what other users have done,’’ ‘‘Knowing what actions other users are currently taking,’’ ‘‘Providing a communication tool when audio is not available,’’ ‘‘Knowing other user’s working areas in the document,’’ and ‘‘Knowing other user’s tasks.’’ Second, the research proposes mechanisms corresponding to the above-mentioned five awareness elements. The mechanisms include Dynamic Task List (DTL), Modification Director (MD), Advanced Chat (AC) and Split Window View (SWV). These mechanisms provide support for various aspects of group awareness, and add many enhanced features to existing awareness mechanisms. For example, DTL presents high-level information about authors’ responsibilities and the correlation between their work allocations. MD notifies users instantaneously whenever their work is modified by other authors. AC enhances communication between users by allowing them to attach document objects such as text and diagrams to a conversation message. And, SWV provides the views of other authors’ working areas and viewing areas simultaneously. � 2005 Elsevier B.V. All rights reserved.
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.
16079123
Agent-Based Ontology Mapping Towards Ontology Interoperability
Globalisation of business environments on the Web has given rise to the advent of similar ontologies in which dynamic ontology mapping is called in. Ontology mapping is necessary for ontology interoperability. In this paper, a novel agent-based ontology mapping is presented for agents to operate ontology mapping flexibly in a dynamic environment regardless heterogeneous platforms and different ontology representations. The mapping mechanism is discussed by having a close look at both inherent inter-processes of mapping tasks of an agent and relevant interaction processes. The interrelated processes of agents also enable agent-based ontology mapping to take ontology changes into account whenever needed. A mapping prototype is built for verification.
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
13451873
The Enron Corpus: A New Dataset for Email Classification Research
Automated classification of email messages into user-specific folders and information extraction from chronologically ordered email streams have become interesting areas in text learning research. However, the lack of large benchmark collections has been an obstacle for studying the problems and evaluating the solutions. In this paper, we introduce the Enron corpus as a new test bed. We analyze its suitability with respect to email folder prediction, and provide the baseline results of a state-of-the-art classifier (Support Vector Machines) under various conditions, including the cases of using individual sections (From, To, Subject and body) alone as the input to the classifier, and using all the sections in combination with regression weights.
26798727
BANDS: An Inter-domain Internet Security Policy Management System for IPSec/VPN
IPSec/VPN is widely deployed for users to remotely access their corporate data. IPSec policies must be correctly set up for VPN to provide anticipated protection. Manual policy setup is unscalable, inefficient and error-prone. Automated policy generation to comply with and enforce high-level security policies is desired but difficult, especially in an inter-domain environment when a VPN traverses multiple domains. This paper presents a distributed framework and protocol, BANDS, for inter-domain policy negotiation and generation. The BANDS architecture consists of two phases: AS (autonomous system) route path discovery and an inter-domain collaborative protocol for policy negotiation among the autonomous systems discovered in the first phase. Each AS conceptually has one security requirement server responsible for the task of inter-domain policy negotiation. Following this two-step process in BANDS, a set of distributed security policies (for the implementation of policy enforcement) is automatically negotiated/generated based on decentralized and predefined security requirements.
17079123
Applying CLIR Techniques to Event Tracking
Cross-lingual event tracking from a very large number of information sources (thousands of Web sites, for example) is an open challenge. In this paper we investigate effective and scalable solutions for this problem, focusing on the use of cross-lingual information retrieval techniques to translate a small subset of the training documents, as an alternative to the conventional approach of translating all the multilingual test documents. In addition, we present a new variant of weighted pseudo-relevance feedback for adaptive event tracking. This new method simplifies the assumption and the computation in the best-known approach of this kind, yielding a better result than the latter on benchmark datasets in our evaluations.
14988023
Modeling the Effect of Transmit Power and Physical Carrier Sense in Multi-Hop Wireless Networks
In this paper, we extend both Bianchi's and Kumar's models and characterize the channel activities governed by IEEE 802.11 DCF in multi-hop wireless networks from the perspective of an individual sender. In particular, we incorporate the effect of PHY/MAC attributes (such as transmit power and physical carrier sense) that need not be considered in WLANs but become extraordinarily important in multi-hop wireless networks, and derive the throughput attained by each sender. With the use of the analytical model derived, we investigate the impact of transmit power and carrier sense threshold on network capacity, and identify a simple operating condition under which the network may attain throughput that is close to its optimal value.
6183487
Practical routing and torus assignment for RDT
The connection topology of interconnection networks and the routing algorithm often dominate system performance in MPCs. RDT has already been proved to be one of the best interconnection networks used in such systems. It supports a smaller diameter and degree than most at the size of one thousand to tens of thousands nodes. The floating vector routing algorithm is very effective for transferring messages, which also shows good performance. In this paper, a descending vector routing algorithm is proposed. We also proposed a practical torus assignment named RDT(2,2,1)/a and the deadlock-free routing algorithm. RDT(2,2,1)/a mainly focuses on the MPC that has about one thousand nodes. With a simplified simulation and comparison, the results show that RDT(2,2,1)/a has a better performance at the size of one thousand nodes.