12118210
Reconciling Agent Ontologies for Web Service Applications
Because there is still no agreed-upon global ontology, Web services supplied by different providers typically have individual and unique semantics, described by independently developed ontologies. The seamless connection of these distributed Web services for business-to-business applications depends heavily on reconciling the disparate semantics, possibly by integrating the ontologies. In this paper, we describe an approach to reconcile ontologies from distributed Web services. Our approach is totally automated, and features the following: i) alignment of the ontologies is performed without previous agreement on the semantics of the terminology in each ontology; ii) both linguistic and contextual features are considered; iii) the use of WordNet for linguistic analysis; iv) integration of heuristic knowledge for contextual analysis; and v) inference of new relationships by applying several rules based on domain-independent relationships and property lists. Experiments have been carried out to show the promising results of our system.
14986573
Sharing ontology schema information for Web service integration
In spite of many standards efforts, Web services with similar or compatible functionalities often have heterogeneous semantics. One reason is the disparate ontologies used for service descriptions. In order to compare and compose Web services, the ability to merge different ontologies is essential. This paper describes an approach to align numerous, independently designed ontologies. Our approach is a completely automated one, without the need for prior agreement on semantics. It incorporates WordNet and heuristic reasoning and infers new knowledge by self-learning. Our system provides a solid base for the seamless integration of Web services.
16266978
Ontology Reconciliation for Service-Oriented Computing
Service-oriented computing (SOC) is viewed as the computing paradigm of the near future, allowing for the dynamic interaction of services provided by distributed business partners. Being a declarative knowledge representation model, ontologies serve as a foundation for SOC. Due to the heterogeneous nature of independently designed ontologies, it is problematic for partners to understand the concepts adopted in ontologies from other sources. In order for partners to achieve seamless collaboration of services, they need to reconcile their ontologies with each other. During the alignment process and the following service interactions, compatibility is an important measurement that has been neglected in most research work. We extend a vector system to encode ontology compatibility. In addition, we present a new model - probabilistic center ontology - for better recording and maintenance of ontology alignment results. Our precise and efficient approach is verified by both theoretic proofs and experimental results
4789976
In-Tournament Digraphs
Abstract In this paper we introduce a generalization of digraphs that are locally tournaments (and hence of tournaments). This is the class of in-tournament digraphs-the set of predecessors of every vertex induces a tournament. We show that many properties of local tournament digraphs can be extended even to in-tournament digraphs. For instance, any strongly connected in-tournament digraph has a directed hamiltonian cycle. We prove that the underlying graph of any in-tournament digraph is l-homotopic. We investigate the problem of which graphs are orientable as in-tournament digraphs and prove that any graph representable as an intersection subgraph of a unicyclic graph can be so oriented. It is shown that there is a polynomial algorithm for recognizing those graphs that can be oriented as in-tournament digraphs.
1720329
Toward Inductive Logic Programming for Collaborative Problem Solving
In this paper, we tackle learning in distributed systems and the fact that learning does not necessarily involve the participation of agents directly in the inductive process itself. Instead, many systems frequently employ multiple instances of induction separately. The paper's main contribution is a new approach that tightly integrates processes of induction between distributed agents, based on inductive logic programming techniques, for a wider class of problem solving tasks. The approach combines inverse entailment with an epistemic approach to reasoning about knowledge, facilitating a systematic approach to the sharing of knowledge and invention of predicates only when required. We illustrate the approach for learning declarative program fragments and for a well-known path planning problem and compare results empirically to (multiple instances of) single agent-based induction over varying distributions of data. Given a chosen path planning algorithm, our algorithm enables agents to combine their local knowledge in an effective way to avoid central control while significantly reducing communication costs.
17903854
The Superthreaded Processor Architecture
The common single-threaded execution model limits processors to exploiting only the relatively small amount of instruction-level parallelism that is available in application programs. The superthreaded processor, on the other hand, is a concurrent multithreaded architecture (CMA) that can exploit the multiple granularities of parallelism that are available in general-purpose application programs. Unlike other CMAs that rely primarily on hardware for run-time dependence detection and speculation, the superthreaded processor combines compiler-directed thread-level speculation of control and data dependences with run-time data dependence verification hardware. This hybrid of a superscalar processor and a multiprocessor-on-a-chip can utilize many of the existing compiler techniques used in traditional parallelizing compilers developed for multiprocessors. Additional unique compiler techniques, such as the conversion of data speculation into control speculation, are also introduced to generate the superthreaded code and to enhance the parallelism between threads. A detailed execution-driven simulator is used to evaluate the performance potential of this new architecture. It is found that a superthreaded processor can achieve good performance on complex application programs through this close coupling of compile-time and run-time information.
14327978
On Exploring the Power-Law Relationship in the Itemset Support Distribution
We identify and explore in this paper an important phenomenon which points out that the power-law relationship appears in the distribution of itemset supports. Characterizing such a relationship will benefit many applications such as providing the direction of tuning the performance of the frequent-itemset mining. Nevertheless, due to the explosive number of itemsets, it will be prohibitively expensive to retrieve characteristics of the power-law relationship in the distribution of itemset supports. As such, we also propose in this paper a valid and cost-effective algorithm, called algorithm PPL, to extract characteristics of the distribution without the need of discovering all itemsets in advance. Experimental results demonstrate that algorithm PPL is able to efficiently extract the characteristics of the power-law relationship with high accuracy.
7488499
Chinese-Korean Word Alignment Based on Linguistic Comparison
Word alignment problem between parallel corpora is based on the similar characteristics of two aligned words in two languages. We investigate linguistic-knowledge-based word similarity measures while other previous works heavily rely on statistical information, and their limits will be discussed. Linguistic knowledge is acquired from linguistic comparison of all layers between two languages, for Chinese and Korean in this paper.