Web Service Matching Research Articles

Dynamicity of Web Services and Web Scrapping

This research focuses on dynamic Web service link searching using web scraping (WS). WS is method of extracting required contents from search engine results. The proposed system inputs the functional word to search engine and retrieves required Web services from search engine results. WS method retrieves the links of the Web Service Definition Language from which service and operation elements are extracted and processed to check suitability of Web services. Matched Web services will be clustered and invoked. This research is implemented using J2EE and remote Web services are executed according to user requirement. Analysis of results justified that this will be a suitable search method to search for remote Web services and to execute using open source software.

A Semantic Matching Method of E-Government Information Resources Knowledge Fusion Service Driven by User Decisions

This study focuses on the knowledge fusion model of e-government information resources that supports user decision-making information needs, it discusses the user decision-making information needs model, the knowledge fusion service model, and the relationship between them. The inter-layer mapping matching mechanism realizes the ultimate value of knowledge fusion. Therefore, this paper analyses and studies the mapping mechanism between the user information demand model and the knowledge fusion service model. A semantic, similarity-based knowledge fusion service matching method for e-government information resources is proposed to address the problem of lack of semantics in traditional web service matching methods. This method uses the ontology description language OWL-S to map information requirement documents of user decisions and knowledge fusion service function documents into an ontology tree structure. The authors then use this as the basis to calculate the concept similarity and relationship similarity measures, and the service matching based on semantic similarity can be realized.

Контекстне співставлення ВЕБ-сервісів у вирішенні задачі виявлення. Онтологічні підходи

Matching is integral part of all web services tasks. The effective implementation of the process of matching services with a search query, or with each other, ensures successful resolving of the problems of service discovery, building the best coverage of the search query and a complex composite service that implements the business task. All web services have own characteristics, solve different problems, use different methods, but they all also have a certain set of characteristics: functional and process models, formal description language, communication protocol, a common set of element types, such as identifiers, service messages, parameters and etc. This allows to classify services in a certain way, the analysis of these characteristics permits to define the elements and aspects of the comparison process. Today there is a huge number of services, and their number is constantly growing, and the process of services discovery is very complex and multifaceted. It should take into account the structural, syntactic, but, first of all, the semantic suitability of services, to ensure their comparative analysis according to the maximum possible number of characteristics that are significant for matching. It should be step-by-step process and it has be designed in such a way that each step reduces the set of candidates, leaving services with a greater degree of compliance. This requires algorithms that return quantitative estimates for each step, each type of matching, and algorithms that effectively generalize these estimates to define the final values of the proximity of services and the request. These researches are devoted to problems of using the descriptive logics formalisms for web services matching by their contexts, which, as a rule, contain information about the services purposes, the area of use, business functions, etc. That is, it is information representing the semantics of the service, but in text form, that is not convenient for automated processing. There are many studies that try to solve this problem by applying standard text analysis methods to contextual service descriptions. This study proposes an ontological approach to matching web services by context. It is determined the extension of the previously proposed the top-level service DL ontology. It also involves the use of a special ontology of the general textual service description, a fragment of the taxonomy of which is presented in the paper. This ontology should cover all important semantic aspects of contextual descriptions. It have not only promote to determining the matching a service and a request, but it also have to allow semantically categorizing the available services: by subject area, implemented functions, etc.

Probabilistic analysis of QoS‐aware service composition with explicit environment models

In service composition, quality-of-service (QoS) represents a crucial indicator for the policy adoption. Existing composition strategies rarely address the influence of the environment, which may influence QoS and thus lead to sub-optimal composition policies in a dynamic environment. In this study, a model-based service composition approach is proposed. Given the user request, it is possible to first find a set of matching abstract web services (AWSs), and then pull relevant concrete web services (CWSs) based on the AWSs. The set of CWSs can be modelled as a Markov decision process (MDP). In addition, the authors model the environment as a fully probabilistic system, capturing changes of environment probabilistically. The environment model can be further composed of the MDP from the service models, obtaining a monolithic MDP. They demonstrate how the probabilistic verification techniques can be used to find the optimal service selection strategy against their QoS and the environment change. A distinguishing feature of their approach is that the QoS, as well as the dynamic of environment change, is made parametric so that the formal analysis is adaptive to the environment which is of paramount importance for autonomous and self-adaptive systems. Examples and experiments confirm the feasibility of their approach.

An SP-Tree-Based Web Service Matching Algorithm Considering Data Provenance

AbstractCurrently the semantic-based Web service matching has improved the precision ratio of service discovery. But it can't distinguish between different data on the different needs of the service, due to rarely considering the input data provenance of Web services. That is an important contribution of high precision ratio. Therefore, in this paper, for further improving the accuracy of Web service matching, the data provenance is considered as a constraint attribute of Web service matching. Firstly, an SP-tree-based Web service matching algorithm considering data provenance (SMDP) is proposed, consisting of three aspects: The general algorithm thoughts, the data How provenance matching calculation method, (which is mainly introduced for it is the hardest calculation part), and the experiments verifying precision ratio of SMDP is 10% higher than the traditional semantic-based matching. Secondly, a Web service matching model based on SMDP is designed and a prototype system for water resources application...

Improving Matching Web Service Security Policy Based on Semantics

Improving Matching Web Service Security Policy Based on Semantics

Cloud based Mobile Web Service Discovery using Semantic Matching and Key-Word based Approach

of web-services in devices with low processing capability has increased with the advancement in wireless technologies. Web-services are mainly used to reduce overhead of heavy processing in resource limited environment. Many public web-services are available that can be used to retrieve information or perform a task .Web-Service discovery is the process of discovering relevant web-services for the user based on users specification. Discovery of relevant web- services are mainly based on two methods text based matching and semantic matching. Searching for web-service is resource consuming and low-end devices or mobile devices cannot efficiently perform the task. A cloud-server can be an excellent candidate for this job as its resources are not limited and can be scaled easily they are cost effective. In this paper a frame-work for discovering relevant mobile web-services using a cloud based web-service matching algorithm is proposed. The frame-work is expected to provide efficient results and quick response time. Keywordsserver, service discovery, semantic matching.

The SemSPM approach: fine integration of WS-SecurityPolicy semantics to enhance matching security policies in SOA

The lack of semantics in WS-SecurityPolicy standard hampers the effectiveness of matching security policies. To resolve this problem, we present a semantic approach for matching Web service security policies. The approach consists in the transformation of WS-SP into an OWL-DL ontology and the definition of a set of rules which automatically generate semantic relations that can exist between the provider and requestor security requirements. We show how these relations lead to more correct and refined matching of security policies. We also describe the implementation details of our approach and its validation through a real-world use case.

A Similarity Measure across Ontologies for Web Services Discovery

Given the critical and difficult nature of discovering Web services in the development process of service oriented architectures, several studies have been proposed to solve this problem. There is a real need to work for matching semantic Web services which use different ontologies. In responding to this need, measuring semantic similarity between SWS may be reduced to the calculation of similarity between ontological concepts. This work is a contribution to achieve semantic interoperability for Web services in a multi-ontology environment, for which the authors present a generic framework for Web services discovery. Here their focus is on the semantic similarity measure-based core of their framework and the authors present a novel algorithm for concepts matching between different ontologies. Results of the experiments confirm the viability of the semantic similarity measure.

Web service discovery among large service pools utilising semantic similarity and clustering

ABSTRACTWith the rapid development of electronic business, Web services have attracted much attention in recent years. Enterprises can combine individual Web services to provide new value-added services. An emerging challenge is the timely discovery of close matches to service requests among large service pools. In this study, we first define a new semantic similarity measure combining functional similarity and process similarity. We then present a service discovery mechanism that utilises the new semantic similarity measure for service matching. All the published Web services are pre-grouped into functional clusters prior to the matching process. For a user’s service request, the discovery mechanism first identifies matching services clusters and then identifies the best matching Web services within these matching clusters. Experimental results show that the proposed semantic discovery mechanism performs better than a conventional lexical similarity-based mechanism.

Semantic web service discovery in a mobile environment

Recent advancements in mobile devices and wireless technologies have produced a successful relation between mobile devices and web services, where a mobile device can be a service provider or a consumer. However, finding relevant web services in a mobile environment that match requests remain a major hindrance to its booming. As the numbers of web services are increasing constantly, web service matching becomes more important to match usable web services in an effective and efficient manner. It is more difficult to select a high quality web service that meets user requirements because traditional service reputation evaluation approaches cannot ensure the authenticity and reliability of user ratings. Thus, this research aims to propose a semantic approach for web service discovery in a mobile environment based on their functional and non-functional properties.

Dynamic Composition of Web Services based on Event Driven Approach in SOA

Dynamic Composition of Web services is a Key research in the arena of E-commerce. Enterprise applications are developed as a service provider in the web, some of the challenges we are faced by web services are most likely related to composition of services, security and Quality of Services (QoS). Within these challenges, composition of web service turns out to be a big arena of research, because it supports the integration and Interoperability of B2B applications or enterprise application or E-commerce application. Pragmatically dynamic composition of semantic web services specifies better results compared to the traditional method of discovering candidate services for composition. In this study we present the degree of matching and selection of web services are considered as a salient feature to the dynamic composition of web services.

The Research of Semantic Web Service Matching Algorithm Based on the Formal Concept Analysis

At present, as the number of web services resources on the network drastically increased, how to quickly and efficiently find the needed services from publishing services has become a problem to resolve. Aiming at the problems of low efficiency in service discovery of traditional web service, the formal concept analysis ( FCA) is introduced into the semantic Web service matching, and a Matching Algorithm based semantic web service is proposed. With considering the concept of limited inheritance,this method introduces the concept of limited inheritance to the semantic similarity calculation based on the concept lattice. It is significant in enhancing the service function matching in practical applications through adjust the calculation.

A Fast Semantic Web Services Matchmaker for OWL-S Services

Bringing semantics to Web Services description and matching remarkably improves the recall and precision ratios of Service discovery. Though there are many effective semantic based Web Services matchmakers, they have poor time efficiency for consuming time in the semantic reasoning step. To shorten service matching time, this paper presents a fast matchmaker for OWL-S services, called XServices Semantic Service Discovery (XSSD). It executes the Semantics Pretreatment Algorithm (SPA) in service publishing phase and implements a multi-feature based Semantic Web services matching method when queries coming. SPA extracts part of semantic description in the OWL-S files and creates matrixes which we call service feature matrixes to express service semantics. By shifting part of the reasoning process from service matching stage to service publishing stage, XSSD reduces the waiting time for the matchmaker clients. The results of the evaluation on a well-annotated Semantic Web Services set OWLS-TC4 show that while XSSD offers the comparable recall and precision ratios, the time efficiency of XSSD outperforms existing similar matchmakers.

A web service matching algorithm based on semantic similarity

PurposeThe purpose of this paper is to obtain more accurate matching between the request and the release of web service.Design/methodology/approachThis paper adopts Levenshtein distance algorithm to calculate the name similarity between publishing service and request service, employs cosine theorem to compute the text similarity, and uses semantic distance to count the input‐output similarity, then filters out the low similarity and bad reputation services to structure the candidate service set.FindingsThe qualitative and quantitative analysis of the scheme is given in this paper. The experimental results show that the multi‐level matching filtering algorithm can obviously improve the recall ratio and precision ratio of web service discovery.Originality/valueThis paper proposes a similarity‐based filtering algorithm for multi‐level matching.

Dynamic provisioning in multi-tenant service clouds

Cloud-based systems promise an on-demand service provisioning system along with a “pay-as-you-use” policy. In the case of multi-tenant systems this would mean dynamic creation of a tenant by integrating existing cloud-based services on the fly. Presently, dynamic creation of a tenant is handled by building the required components from scratch. Although multi-tenant systems help providers save cost by allocating multiple tenants to the same instance of an application, they incur huge reconfiguration costs. Cost and time spent on these reconfiguration activities can be reduced by re-constructing tenants from existing tenant configurations supported by service providers. Multi-tenant cloud-based systems also lack the facility of allowing clients to specify their requirements. Giving clients the flexibility to specify requirements helps them avoid spending an excessive amount of time and effort looking through a list of services, many of which might not be relevant to them. Moreover, dynamic provisioning in the cloud requires an integrated solution across the technology stack (software, platform and infrastructure) combining functional, non-functional and resource allocation requirements. Existing research works in the area of web service matching, although numerous, still fall short, since they usually consider each requirement type in isolation and cannot provide an integrated solution. To that end, in this paper we investigate the features needed for dynamic service provisioning on the cloud. We propose a novel User Interface-Tenant Selector-Customizer (UTC) model and approach, which enables cloud-based services to be systematically modeled and provisioned as variants of existing service tenants in the cloud. Our approach considers functional, non-functional and resource allocation requirements, which are explicitly specified by the client via the user interface component of the model. To the best of our knowledge, ours is the first such integrated approach. We illustrate our ideas using a realistic running example, and also present a proof-of-concept prototype built using IBM’s Rational Software Architect modeling tool. We also present experimental results demonstrating the applicability of our matching algorithm. Our results show significant reduction in matching time with the help of an elimination process that reduces the search space needed for performing matching.

Self-adaptive semantic web service matching method

Web service has become a major software paradigm and computing resource, while how to implement web service matching also has become a key issue. In this paper, we present a self-adaptive semantic web service matching method, which improves the precision and recall of service discovery. In this method, requirement document and service profile ontology of OWL-S are transformed into ontology trees respectively. Conception similarity, attribute similarity and structure similarity of corresponding nodes in trees are calculated through taxonomic and hierarchical methodology. Then a serial of constraints are defined according to the relationship between conception similarity and structure similarity, to get the corresponding restructure rules. By restructuring requirement ontology tree in self-adaptive way, we achieve more accurate destination service collections. In the end, we propose matching algorithm of semantic web service and implement prototype system of OWLS-CPS. We prove the feasibility and effectiveness through evaluating and comparing to the OWLS-M4.

A fuzzy matchmaking approach for Semantic Web Services with application to collaborative material selection

A critical step in the process of reusing existing WSDL-specified services for building web-based applications is the discovery of potentially relevant services. However, the category-based service discovery, such as UDDI, is clearly insufficient. Semantic Web Services, augmenting Web service descriptions using Semantic Web technology, were introduced to facilitate the publication, discovery, and execution of Web services at the semantic level. Semantic matchmaker enhances the capability of UDDI service registries in the Semantic Web Services architecture and it is able to recognize various degrees of matching for Web services. Based on the Semantic Web Service framework, semantic matchmaker, specification matching and probabilistic matching, this paper proposes a fuzzy matchmaking approach for Semantic Web Services to support a more automated and veracious service discovery process in collaborative manufacturing environments. In the proposed approach, the membership function is set up on the semantic information annotated on WSDL specification of a web service, and the similarity of service objects is evaluated by the similarity degree of service attributes. A collaborative material selection case study in the die casting process for thermoelectric fan housing is used to illustrate the proposed approach.

Web Service Composition Algorithm

Web service composition is very important in web service technology. Domain Ontology is used for semantic web service match and automatic web service composition. When a web service is registered, it will be related to the concepts in the domain ontology with its output concepts. To start a semantic match or composition starts, only the related web service with the annotated concept will be used. The approach can deal with not only the sequential but also the parallel service composition problems The proposed approach was verified by experiments and case studies.

A Multi-Level Matching Filtering Algorithm Based on Similarity

A similarity-based filtering algorithm is proposed for multi-level matching. The algorithm consider all elements like service name, description information, input and output, reputation and effects respectively, cosine theorem and semantic distance are given in this paper to calculate their similarity. The aspects of the algorithm are as follows. It achieves a more comprehensive metrical scheme on the similarity between publishing service and request service from multiple stages and multiple perspectives in web service matching process. It judges whether the service preconditions match the effects based on description logic. Finally, it introduces reputation metrical scheme .In addition, the qualitative and quantitative analysis of the algorithm are given in this paper. The analysis results show that the Multi-level Matching Filtering Algorithm can obviously improve the recall ratio and precision ratio of Web service discovery.