7 research outputs found
A Matching Algorithm for Selecting Web Services Based on Non-Functional Features
Searching for a Web service that meets the user requirements can be a complex task especially when the system starts to scale up by increasing the number of Web services, w, in the UDDI registry and by enlarging the number of QoS features (f) by which each Web service is described. This can be perceived as the commonly known nearest neighbor search problem, which typically imposes a time or storage complexity that is exponential in f. In this work, we present a new algorithm (wsSVD) that is founded on the algebraic matrix operation called Singular Value Decomposition (SVD). The basic idea is to encode the features of each Web service by a single value using the SVD. When a user seeks a Web service based on some specific requirements, these requirements get encoded by a single value using the same algorithm, and the matching process takes place in order to find the closest Web service that fulfills the user requirements. Our experiments show that the wsSVD algorithm performs and scales up well in comparison with other matching algorithms
An empirical approach for semantic Web services discovery
Component retrieval/discovery is a well-established research direction in Software Engineering. With the surge of Service-Oriented Architecture (SOA), service discovery has become increasingly crucial. However, the public UDDI Business Registry the primary service discovery mechanism over the Internet has been shut down permanently since 2006. Moreover, keyword-based service discovery is insufficient in coping with complex discovery requirements posed by modern software developers. In this paper, we propose an empirical semantic based Web service discovery approach. It provides an automatic Web service discovery mechanism that can locate relevant Web services based on concepts rather than keywords. The major contribution of this paper is three fold. First we articulate three requirements that software developers often raise during the component/service development and discovery process. Next, we propose the application of Latent Semantic Analysis into the area of Web services discovery. To our best knowledge, little work has been done in this area which leverages concept-based Information Retrieval models in service discovery. Last, we provide a proof-of-concept system prototype that can suffice three specific requirements of semantic service discovery
Methods and algorithms for service selection and recommendation (preference and aggregation based)
In order for service users to get the best service that meets their requirements, they prefer to personalize their non-functional attributes, such as reliability and price. However, the personalization makes it challenging because service providers have to deal with conflicting non-functional attributes when selecting services for users. In addition, users may sometimes want to explicitly specify their trade-offs among non-functional attributes to make their preferences known to service providers. Typically, users\u27 service search requests with conflicting non-functional attributes may result in a ranked list of services that partially meet their needs. When this happens, it is natural for users to submit other similar requests, with varying preferences on non-functional attributes, in an attempt to find services that fully meet their needs. This situation produces a challenge for the users to choose an optimal service based on their preferences, from the multiple ranked lists that partially satisfy their request.
Existing memory-based collaborative filtering (CF) service recommendation methods that employ this recommendation technique usually depend on non-functional attribute values obtained at service invocation to compute the similarity between users or items, and also to predict missing non-functional attributes. However, this approach is not sufficient because the non-functional attribute values of invoked services may not necessarily satisfy their personalized preferences.
The main contributions of this work are threefold. First, a novel service selection method, which is based on fuzzy logic, that considers users\u27 personalized preferences and their trade-offs on non-functional attributes during service selection is presented. Second, a method that aggregates multiple ranked lists of services into a single aggregated ranked list, where top ranked services are selected for the user is also presented. Two algorithms were proposed: 1) Rank Aggregation for Complete Lists (RACoL), that aggregates complete ranked lists and 2) Rank Aggregation for Incomplete Lists (RAIL) to aggregate incomplete ranked lists. Finally, a CF-based service recommendation method that considers users\u27 personalized preference on non-functional attributes if proposed. Examples using real-world services are presented to evaluate the proposed methods and experiments are carried out to validate their performance --Abstract, page iii
Correctness-aware high-level functional matching approaches for semantic web services
Existing service matching approaches trade precision for recall, creating the need for humans to choose the correct services, which is a major obstacle for automating the service matching and the service aggregation processes. To overcome this problem, the matchmaker must automatically determine the correctness of the matching results according to the defined users' goals. That is, only service(s)-achieving users' goals are considered correct. This requires the high-level functional semantics of services, users, and application domains to be captured in a machine-understandable format. Also this requires the matchmaker to determine the achievement of users' goals without invoking the services. We propose the G+ model to capture the high-level functional specifications of services and users (namely goals, achievement contexts and external behaviors) providing the basis for automated goal achievement determination; also we propose the concepts substitutability graph to capture the application domains' semantics. To avoid the false negatives resulting from adopting existing constraint and behavior matching approaches during service matching, we also propose new constraint and behavior matching approaches to match constraints with different scopes, and behavior models with different number of state transitions. Finally, we propose two correctness-aware matching approaches (direct and aggregate) that semantically match and aggregate semantic web services according to their G+ models, providing the required theoretical proofs and the corresponding verifying simulation experiments
A semantic framework for event-driven service composition
Title from PDF of title page, viewed on September 14, 2011VitaDissertation advisor: Yugyung LeeIncludes bibliographical references (p. 289-329)Thesis (Ph.D)--School of Computing and Engineering. University of Missouri--Kansas City, 2011Service Oriented Architecture (SOA) has become a popular paradigm for designing
distributed systems where loosely coupled services (i.e. computational entities) can be
integrated seamlessly to provide complex composite services. Key challenges are discovery
of the required services using their formal descriptions and their coherent composition in a
timely manner. Most service descriptions are written in XML-based languages that are
syntactic, creating linguistic ambiguity during service matchmaking. Furthermore, existing
models that implement SOA have mostly middleware-controlled synchronous request/replybased
runtime binding of services that incur undesirable service latency. In addition, they
impose expensive state monitoring overhead on the middleware. Some newer event-driven
models introduce asynchronous publish/subscribe-based event notifications to consumer
applications and services. However, they require an event-library that stores definitions of
all possible system events, which is impractical in an open and dynamic system. The objective of this study is to efficiently address on-demand consumer requests
with minimum service latency and maximum consumer utility. It focuses on semantic eventdriven
service composition. For efficient semantic service discovery, the dissertation
proposes a novel service learning algorithm called Semantic Taxonomic Clustering (STC). The algorithm utilizes semantic service descriptions to cluster services into functional
categories for pruning search space during service discovery and composition. STC utilizes
a dynamic bit-encoding algorithm called DL-Encoding that enables linear time bit operationbased
semantic matchmaking as compared to expensive reasoner-based semantic
matchmaking. The algorithm shows significant improvement in performance and accuracy
over some of the important service category algorithms reported in the literature. A novel
user-friendly and computationally efficient query model called Desire-based Query
Model (DQM) is proposed for formally specifying service queries. STC and DQM serve as
the building block for the dual framework that is the core contribution of this dissertation: (i)
centralized ALNet (Activity Logic Network) platform and (ii) distributed agentbased
SMARTSPACE platform. The former incorporates a middleware controlled service
composition algorithm called ALNetComposer while the latter includes the SmartDeal
purely distributed composition algorithm. The query response accuracy and performance
were evaluated for both the algorithms under simulated event-driven SOA environments.
The experimental results show that various environmental parameters, such as domain
diversity and scope, size and complexity of the SOA system, and dynamicity of the SOA system, significantly affect accuracy and performance of the proposed model. This
dissertation demonstrates that the functionality and scalability of the proposed framework
are acceptable for relatively static and domain specific environments as well as large,
diverse, and highly dynamic environments. In summary, this dissertation addresses the key
design issues and problems in the area of asynchronous and pro-active event-driven service
composition.Introduction -- Research background -- Semantic service matchmaking & query modeling -- Service organization by learning service category -- ALNet: event-driven platform for service composition -- SMARTSPACE: distributed multi-agent based event-handeling -- Conclusion & future wor