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

Seog-Chan Oh

dblp:90/1393 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2009
—ORCID · none

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

Software engineering, systems software and programming languages · 2 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 1

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%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

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

TopicWeightPapersLastEvidence papers
Services computing and microservices › service composition › web service composition
automated composition
0.112008
Effective Web Service Composition in Diverse and Large-Scale Service Networks · IEEE Trans. Serv. Comput. 2008
Services computing and microservices › service composition
web service composition
0.112008
Effective Web Service Composition in Diverse and Large-Scale Service Networks · IEEE Trans. Serv. Comput. 2008
Algorithms and data structures › search algorithms
heuristic search
0.012008
Effective Web Service Composition in Diverse and Large-Scale Service Networks · IEEE Trans. Serv. Comput. 2008

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

network analysis · 0.2heuristic search · 0.2AI planning · 0.2
YearPublicationVenuePosition
2009 Graph Theoretic Topological Analysis of Web Service Networks
Hyunyoung Kil, Seog-Chan Oh, Ergin Elmacioglu, Wonhong Nam, Dongwon Lee 0001
World Wide Web2
2008 Effective Web Service Composition in Diverse and Large-Scale Service Networks
abstract
The main research focus of Web services is to achieve the interoperability between distributed and heterogeneous applications. Therefore, flexible composition of Web services to fulfill the given challenging requirements is one of the most important objectives in this research field. However, until now, service composition has been largely an error-prone and tedious process. Furthermore, as the number of available web services increases, finding the right Web services to satisfy the given goal becomes intractable. In this paper, toward these issues, we propose an AI planning-based framework that enables the automatic composition of Web services, and explore the following issues. First, we formulate the Web-service composition problem in terms of AI planning and network optimization problems to investigate its complexity in detail. Second, we analyze publicly available Web service sets using network analysis techniques. Third, we develop a novel Web-service benchmark tool called WSBen. Fourth, we develop a novel AI planning-based heuristic Web-service composition algorithm named WSPR. Finally, we conduct extensive experiments to verify WSPR against state-of-the-art AI planners. It is our hope that both WSPR and WSBen will provide useful insights for researchers to develop Web-service discovery and composition algorithms, and software.
Seog-Chan Oh, Dongwon Lee 0001, Soundar R. T. Kumara
IEEE Trans. Serv. Comput.1
2006 WSBen: A Web Services Discovery and Composition Benchmark
abstract
A novel benchmark, WSBen, for testing web services discovery and composition is presented. WSBen includes: (1) A collection of synthetic web services (WSDL) files with diverse characteristics and sizes; (2) Test discovery and composition queries and solutions; and (3) External files for statistical analysis and AI planners. Users can fine-tune the generated WSDL files using various parameters such as skewness or matching type. It is our hope that WSBen will provide useful insights for researchers evaluating the performance of web services discovery and composition algorithms and softwares.
Seog-Chan Oh, Hyunyoung Kil, Dongwon Lee 0001, Soundar R. T. Kumara
ICWS1