Search

The key to realize advanced document summarization is semantic representation of documents. This paper investigates the role of Semantic Link Network in representing and understanding documents for multi-document summarization. It proposes a novel abstractive multi-document summarization framework by first transforming documents into a Semantic Link Network of concepts and events and then transforming the Semantic Link Network into the summary of the documents based on the selection of important concepts and events while keeping semantics coherence. Experiments on benchmark datasets show that the proposed summarization approach significantly outperforms relevant state-of-the-art baselines and the Semantic Link Network plays an important role in representing and understanding documents. [ABSTRACT FROM AUTHOR]

Graphs are becoming increasingly dominant in modeling real-life networked data including social and biological networks, the WWW and the Semantic Web, etc. Graph pattern queries are useful for gathering information with expressive semantics from these graph-structured data. Current methods for graph pattern query processing have performance deficiency caused by inefficiencies of the underlying reachability index and costly merge-join operations on huge amounts of tuple-formatted intermediate results. To overcome the above problems, this paper contributes in the following aspects to boost graph pattern query evaluation. First, we propose an improved hop-based reachability indexing scheme 3-Hop* which gains faster reachability query evaluation, less indexing costs and better scalabilities than state-of-the-art hop-based methods. Second, we propose a two-stage node filtering algorithm based on 3-Hop* to answer tree pattern queries more efficiently. Tree pattern queries serve as the underlying facility for graph pattern query evaluation. Furthermore, we use a graph representation of the intermediate results during node filtering and final results enumeration. Experiments on real-life and synthetic datasets demonstrate the effectiveness of the proposed methods. [ABSTRACT FROM AUTHOR]

In recent years, we witness the increasing trend that more applications are developed by composing Web services. Services interact with each other in ways not necessarily foreseen during their development phase. In this setting, mismatches usually exist between services, and adapters are typically synthesized to reconcile mismatches occurring in certain interactions. The technique that identifies the most suitable provider service from a set of functionally equivalent candidates with respect to certain requirements specified by the requester is essential. To address this challenge, we propose a technique called adaptability assessment , which 1) provides a set of conditions that determines when service interactions can be conducted and 2) computes an adaptation degree that specifies to what extent a service protocol is adaptable to another service protocol. Adaptability assessment complements the techniques that synthesize adapters. Specifically, when adaptability assessment suggests that two service protocols can conduct some interactions according to the adaptation mechanisms of a certain adapter and these interactions can fulfill the requester's requirements, then the effort of synthesizing an adapter is beneficial to potential service interactions. As such, the requester can acknowledge whether his/her expected interactions can be conducted or not and under which conditions. This is important before conducting an interaction, particularly when this interaction is critical, long running, and nonrepeatable. [ABSTRACT FROM PUBLISHER]