17165852
Web Services and BPEL4WS for Dynamic eBusiness Negotiation Processes
The automated negotiation systems are important in building flexible inter-organizational supply chain systems. In this paper, we argue that web service is perhaps the most appropriate technologies for implementing negotiation systems due to many unique characteristics of the application domain. We present an architecture of web service based negotiation system incorporating the BPEL4WS, a standard for building and managing web service based business processes, and show how significant business benefits are obtained by using web services in an intelligent fashion. We further identify several research issues in web services and BPEL4WS in the context of automated negotiation systems.
10913816
A Web Services-enabled marketplace architecture for negotiation process management
As the eBusiness environment becomes more pervasive and dynamic, negotiations between companies are required more frequently than ever. Despite its potential value and the progress in research, the adoption of negotiation systems has been slow in practice. We believe one reason for this is insufficient consideration of process management aspects such as process design, description, and deployment. Business negotiations must be approached from the process management perspective since they take place in the context of corporate processes such as procurement or sales.In this paper, we study system support and automation of business-to-business (B2B) negotiations from the process management perspective. We propose a Web Services-enabled marketplace architecture for negotiation process management and refine it by adding pattern-based process composition. We validate the concept by implementing the proposed architecture using BPEL4WS and evaluating it from various perspectives.
31990528
Diagnosing Multiple Bridge Faults in Baseline Multistage Interconnection Networks
38004947
On-Line Detection of Errors in Homogeneous Multiprocessor Systems
1994375
Effective Temporal Aggregation Using Point-Based Trees
Temporal databases introduce the concept of time into underlying data, and provide built-in facilities that allow users to store and retrieve time-varying data. The aggregation in temporal databases, that is, temporal aggregation is an extension of conventional aggregation on the domain and range of aggregates to include time concept. Temporal aggregation is important for various applications, but is very expensive. In this paper, we propose a new tree structure for temporal aggregation, called PA-tree, and aggregate processing method based on the PA-tree. We show that the time complexity of the proposed method is better than those of the existing methods. The time complexity of the proposed method is shown to be indeed the lower bound of the problem. We perform comparative experiments and show the performance advantage of our proposed method in practice.
41170703
Development of the Efficient OWL Document Management System for the Embedded Applications
To provide ontology-based context understanding services in the embedded application areas, efficient ontology document management schemes are required. Even though some related systems have been developed, they are not appropriate for the embedded system environment with some limitations on memory, disk space and computing power, such as home networking, telematics and intelligent robotics. In this regard, we have developed the embedded system-oriented OWL semantic document management system using the relational databases. We first design a relational data schema appropriate for the OWL documents and then develop a transformation mechanism to store OWL documents. Additionally, the RDQL semantic query processor is additionally implemented for the experiments.
5155977
A Hybrid Keyword Search across Peer-to-Peer Federated Databases
The need for Keyword search in databases is suggested both by Web integration with legacy database management system and by dynamic Web publication. However, it sacrifices the inherent meaning of database schema. Web search engines provide clues for resource location on the Web, but have similar semantic problems. The Semantic Web suggests an ideal solution for the semantic problem on the Web. But due to the need for sophisticated domain definition and lack of unified definitions, many Web pages are not part of the Semantic Web. We define a hybrid search to be a search combining semantic metadata and keywords. A hybrid search on P2P based federated databases provides meaningful and scalable search on an overlay network across the Internet. This paper describes the design of the combined search for unstructured data with associated metadata, information retrieval from the repository, peer-to-peer based communication layer, and data integration hub.