Data Portal @ linkeddatafragments.org

Matches in ScholarlyData for { ?s ?p ?o. }

• 15 sameAs 15.
• 15 abstract "The availability of contents and information as linked data or Web services, i.e. over standardized interfaces, fosters the integration and reuse of data. One common form of information integration is the creation of composed documents, e.g. in form of dynamic Web pages. Service and data providers restrict allowed usage of their resources and and link it to obligations, e.g. only non-commercial usage is allowed and requires an attribution of the provider. These terms and conditions are currently typically available in natural language which makes checking, if a document composition is compliant with the policies of the used services, a tedious task. In order to make it easier for users to adhere to these usage policies, we propose to formalize them, which enables policy-aware tools that support the creation of compliant compositions. In this paper we propose an OWL model of document compositions and show how it can be used together with the policy language AIR to build a policy-aware document composition platform. We furthermore present a use case and illustrate how it can be realized with our approach.".
• 15 hasAuthorList authorList.
• 15 isPartOf proceedings.
• 15 keyword "Policy".
• 15 keyword "Usage Policies".
• 15 keyword "Web Service".
• 15 title "Usage Policies for Document Compositions".
• authorList type List.
• authorList hasFirstItem item-1.
• authorList hasItem item-1.
• authorList hasItem item-2.
• authorList hasLastItem item-2.
• item-1 type ListItem.
• item-1 hasContent sebastian-speiser.
• item-1 next item-2.
• item-2 type ListItem.
• item-2 hasContent rudi-studer.
• item-2 previous item-1.
• 2 creator birgitta-koenig-ries.
• 2 creator ulrich-kuester.
• 2 type InProceedings.
• 2 label "Measures for Benchmarking Semantic Web Service Matchmaking Correctness".
• 2 sameAs 2.
• 2 abstract "Semantic web services (SWS) promise to take service oriented computing to a new level by allowing to semi-automate time-consuming programming tasks. At the core of SWS are solutions to the problem of SWS matchmaking, i.e., the problem of filtering and ranking a set of services with respect to a service query. Comparative evaluations of different approaches to this problem form the base for future progress in this area. Reliable evaluations require informed choices of evaluation measures and parameters. This paper establishes a solid foundation for such choices by providing a systematic discussion of the characteristics and behavior of various retrieval correctness measures in theory and through experimentation.".
• 2 hasAuthorList authorList.
• 2 isPartOf proceedings.
• 2 keyword "benchmarking".
• 2 keyword "evaluation".
• 2 keyword "matchmaking".
• 2 keyword "semantic web services".
• 2 title "Measures for Benchmarking Semantic Web Service Matchmaking Correctness".
• authorList type List.
• authorList hasFirstItem item-1.
• authorList hasItem item-1.
• authorList hasItem item-2.
• authorList hasLastItem item-2.
• item-1 type ListItem.
• item-1 hasContent ulrich-kuester.
• item-1 next item-2.
• item-2 type ListItem.
• item-2 hasContent birgitta-koenig-ries.
• item-2 previous item-1.
• 24 creator antonio-ruiz-cortes.
• 24 creator david-ruiz.
• 24 creator jose-maria-garcia.
• 24 type InProceedings.
• 24 label "A Model of User Preferences for Semantic Services Discovery and Ranking".
• 24 sameAs 24.
• 24 abstract "Current proposals on Semantic Web Services discovery and ranking are based on user preferences descriptions that often come with insufficient expressiveness, consequently making more difficult or even preventing the description of complex user desires. There is a lack of a general and comprehensive preference model, so discovery and ranking proposals have to provide ad hoc preference descriptions whose expressiveness depends on the facilities provided by the corresponding technique, resulting in user preferences that are tightly coupled with the underlying formalism being used by each concrete solution. In order to overcome these problems, in this paper an abstract and sufficiently expressive model for defining preferences is presented, so that they may be described in an intuitively and user-friendly manner. The proposed model is based on a well-known query preference model from database systems, which provides highly expressive constructors to describe and compose user preferences semantically. Furthermore, the presented proposal is independent from the concrete discovery and ranking engines selected, and may be used to extend current Semantic Web Service frameworks, such as WSMO, SAWSDL, or OWL-S. In this paper, the presented model is also validated against a complex discovery and ranking scenario, and a concrete implementation of the model in WSMO is outlined.".
• 24 hasAuthorList authorList.
• 24 isPartOf proceedings.
• 24 keyword "Ontology Modeling".
• 24 keyword "Semantic Web Services".
• 24 keyword "Service Discovery".
• 24 keyword "Service Ranking".
• 24 keyword "User Preferences".
• 24 title "A Model of User Preferences for Semantic Services Discovery and Ranking".
• authorList type List.
• authorList hasFirstItem item-1.
• authorList hasItem item-1.
• authorList hasItem item-2.
• authorList hasItem item-3.
• authorList hasLastItem item-3.
• item-1 type ListItem.
• item-1 hasContent jose-maria-garcia.
• item-1 next item-2.
• item-2 type ListItem.
• item-2 hasContent david-ruiz.
• item-2 next item-3.
• item-2 previous item-1.
• item-3 type ListItem.
• item-3 hasContent antonio-ruiz-cortes.
• item-3 previous item-2.
• 3 creator heiko-paulheim.
• 3 type InProceedings.
• 3 label "Efficient Semantic Event Processing: Lessons Learned in User Interface Integration".
• 3 sameAs 3.
• 3 abstract "Most approaches to application integration require an unambiguous exchange of events. Ontologies can be used to annotate the events exchanged and thus ensure a common understanding of those events. The domain knowledge formalized in ontologies can also be employed to facilitate more intelligent, semantic event processing, but at the cost of higher processing efforts. When application integration and event processing are implemented on the user interface layer, performance is an important issue to ensure acceptable reactivity of the integrated system. In this paper, we analyze different architecture variants of implementing such an event exchange, and present an evaluation with regard to performance. An example of an integrated application from the emergency management domain is used to demonstrate those variants.".
• 3 hasAuthorList authorList.
• 3 isPartOf proceedings.
• 3 keyword "Application Integration".
• 3 keyword "Performance".
• 3 keyword "Reasoning".
• 3 keyword "Semantic Event Processing".
• 3 keyword "User Interface".
• 3 title "Efficient Semantic Event Processing: Lessons Learned in User Interface Integration".
• authorList type List.
• authorList hasFirstItem item-1.
• authorList hasItem item-1.
• authorList hasLastItem item-1.
• item-1 type ListItem.
• item-1 hasContent heiko-paulheim.
• 1 creator dimitrios-skoutas.
• 1 creator ekaterini-ioannou.
• 1 creator odysseas-papapetrou.
• 1 creator wolfgang-nejdl.
• 1 type InProceedings.
• 1 label "Efficient Semantic-Aware Detection of Near Duplicate Resources".
• 1 sameAs 1.

• first
• previous
• next