Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ulrich Küster

dblp:86/6032 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
0since 2021 · last 2010
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 3 · 3 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Services computing and microservices · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Services computing and microservices › service composition › web service composition
automated composition
0.112007
DIANE: an integrated approach to automated service discovery, matchmaking and composition · WWW 2007
Services computing and microservices › service discovery
semantic service matching
0.112007
DIANE: an integrated approach to automated service discovery, matchmaking and composition · WWW 2007
Services computing and microservices
service composition
0.112007
DIANE: an integrated approach to automated service discovery, matchmaking and composition · WWW 2007
Services computing and microservices
service discovery
0.112007
DIANE: an integrated approach to automated service discovery, matchmaking and composition · WWW 2007

Methods — techniques the papers use, named apart from their topics

planning · 0.1
YearPublicationVenuePosition
2010 Measures for Benchmarking Semantic Web Service Matchmaking Correctness
Ulrich Küster, Birgitta König-Ries
ESWC (2)1
2008 On the Evaluation of Semantic Web Service Frameworks
abstract
In recent years, a huge amount of research effort and funding has been devoted to the area of Semantic Web services (SWS). This has resulted in the proposal of numerous competing approaches to facilitate the automation of mediation, choreography, and discovery for Web services using semantic annotations. However, despite a wealth of theoretical work, too little effort has been spent toward the comparative experimental evaluation of the competing approaches so far. Progress in scientific development and industrial adoption is thereby hindered. An established evaluation methodology and standard benchmarks that allow the comparative evaluation of different frameworks are thus needed for the further advancement of the field. To this end, a criteria model for SWS evaluation is presented, and the existing approaches toward SWS evaluation are comprehensively analyzed. Their shortcomings are discussed in order to identify the fundamental issues of SWS evaluation. Based on this discussion, a research agenda toward agreed upon evaluation methodologies is proposed.
Ulrich Küster, Birgitta König-Ries, Charles J. Petrie, Matthias Klusch
Int. J. Semantic Web Inf. Syst.1
2007 Supporting Dynamics in Service Descriptions - The Key to Automatic Service Usage
Ulrich Küster, Birgitta König-Ries
ICSOC1
2007 DIANE: an integrated approach to automated service discovery, matchmaking and composition
abstract
Automated matching of semantic service descriptions is the key to automatic service discovery and binding. But when trying to find a match for a certain request it may often happen, that the request cannot be serviced by a single offer but could be handled by combining existing offers. In this case automatic service composition is needed. Although automatic composition is an active field of research it is mainly viewed as a planning problem and treated separatedly from service discovery. In this paper we argue that an integrated approach to the problem is better than seperating these issues as is usually done. We propose an approach that integrates service composition into service discovery and matchmaking to match service requests that ask for multiple connected effects, discuss general issues involved in describing and matching such services and present an efficient algorithm implementing our ideas.
Ulrich Küster, Birgitta König-Ries, Mirco Stern, Michael Klein
WWW1