Mining Underlying Interface Semantics Based Web Services Discovery Approach

Efficiently finding Web Services on the Web is a challenge research question in Service Oriented Architecture-SOA. Web services are becoming necessary part of the Semantic Web, and research on Semantic Web Services aims to automate their use. However, finding the adequate service for each individual user becomes a more and more demanding problem. In this paper we suggest a new approach for Web Service Discovery which we believe that is the first attempts that combines clustring techiques with Latent Semantic Indexing. Empirically the proposed method will improve the quality of automated service discovery.

Web services are meaningful only if potential users may find and execute them. Universal description discovery and integration (UDDI) help businesses, organizations, and other web services providers to discover and reach to the service(s) by providing the URI of the WSDL file. However, it does not offer a mechanism to choose a web service based on its quality. The standard also lacks sufficient semantic description in the content of web services. This lack makes it difficult to find and compose suitable web services during analysis, search, and matching processes. In addition, a central UDDI suffers from one centralized point problem and the high cost of maintenance. To get around these problems, the authors propose in this chapter a novel framework based on mobile agent and metadata catalogue for web services discovery. Their approach is based on user profile in order to discover appropriate web services, meeting customer requirements in less time and taking into account the QoS properties.

Users of Web and grid services often must temporarily delegate some or all of their rights to a software entity to perform actions on their behalf. The problem with the typical grid services approach (X. 509 proxy certificates) is that commercial Web services tooling fails to recognize these certificates or process them properly. The security assertion markup language (SAML) is a standardized XML-based framework for exchanging authentication, authorization and attribute information. SAML has broadening commercial support but lacks delegation capabilities. To address this shortcoming, we exploit SAML's inherent extensibility to create a delegation framework for Web and grid services that supports both direct and indirect delegation. We develop a set of verification rules for delegation tokens that rely on WS-Security X.509 signatures, but do not force any trust relationship between the delegatee and the target service. We have implemented the framework on two common Web service hosting environments: Java/Tomcat and .NET. By leveraging existing Web services standards, we make it easier for Grid practitioners to build and consume Web and grid services without resorting to grid-specific protocols.

Web services are becoming an important enabler of the semantic Web. Besides the need for a rich description mechanism, Web service information should be made available in an accessible way for machine processing. In this paper, we propose a new P2P based approach for Web services discovery. Peers that store Web services information, such as data item descriptions, are efficiently located using a scalable and robust data indexing structure for peer-to-peer data networks, NIPPERS. We present a theoretical analysis which shows that the communication cost of the query and update operations scale double-logarithmically with the number of NIPPERS nodes. Furthermore, we show that the network is robust with respect to failures fulfilling quality of Web services requirements.

The main objective of today's companies is to cope with rapid changes in the environment. For this, they must ensure the integration and interoperability of their applications. To manage and automate the life cycle of these applications, companies are adopting web services technology. The current problem is that the content of these web services cannot be processed automatically. Only humans can interpret its contents. The semantic web is a new vision of the web that promises to overcome this difficulty. The goal of this technology is to automate the retrieval, assembly, and selection of web services. In this post, we are interested in semantic detection of web services. The main problem is automatically discovering web services on request from clients. Against this background, we first describe the principle of the proposed detection mechanism and then present the designed matchmaking algorithm. Finally, we implement our proposed method. To verify our work, we run tests against various user requests and web service panels. As part of a case study, we consider an online hospital problem. This problem is a typical web service discovery scenario to which the concepts of our method are applied.

With the proliferation of available Web services, new approaches are needed to search for the most appropriate services matching user requirements. Existing UDDI based discovery techniques fail to recognize similarities and differences between Web service capabilities and thus greatly limit the scope of service discovery. Hence, in this paper we present a framework for discovering the vast amount of Web services present in Internet based on a novel semantic approach to automatically discover the most appropriate services to user requirements. Our framework is based on a natural language query to facilitate usage of our implemented discovery framework. For this purpose, we first apply some computational linguistics techniques such as part-of-speech tagging and word sense disambiguation to format and extract useful semantic information from user query. Then, we propose an innovative semantic matchmaking technique based on significant concepts properties in the referenced domain ontology and we show that it improves discovery efficiency compared to a similar related work.

Service-orientation for the development of complex distributed systems with reusable components (services) has proved to be highly beneficial approach in software engineering. In order to realize its advantages automated techniques and tools for finding services, selecting the ones that match requestor needs, composing them for achieving enhanced functionality and resolving heterogeneity issues are required. Adding semantics to web services has become the key approach for the automation of service-orientation environments. Current paper proposes semantic approach for service selection and integration. It considers the semantic description of web services and involves reasoning on a knowledge base. The proposed approach for web service discovery and integration is based on designing logic based techniques for matching goal description with the semantic annotation of web services. It provides for the automation of web service search which facilitates the design of practical applications in service-oriented environment.

Web services (WS) is called composite or compound when its execution involves interactions with other WS to utilize their features. The service providers published the web services through the internet as independent software components that are fulfilling the requirements of customer request. Clustering is more necessary for efficient web service discovery and web service composition processes. Clustering process groups the similar type of web services. In this paper, efficient clustering methods such as k-means clustering, Hierarchical agglomerative clustering and Balanced Iterative Reducing and Clustering using Hierarchies (BIRCH) clustering are introduced for web service clustering. The k-means clustering is a kind of partitional clustering where the web pages are divided into subsets with no hierarchy defined over them and the hierarchical agglomerative clustering is a type of hierarchical clustering where the web pages are arranged in tree structure in which leaves represents the data points and nodes denotes the clusters. BIRCH is an integrated hierarchical clustering algorithm uses the clustering features and cluster feature tree for general cluster description. Based on these clustering methods, web pages are clustered which are used for web service discovery and web service composition. The experiments are conducted on number of web services and the efficiency is evaluated in terms of accuracy, precision, recall and run time.

Automated matching of service descriptions is the key to service discovery and composition. In this paper, we propose an approach for web services discovery and composition. The approach relies on (1) SAWSDL, a simple and generic annotation language, (2) an XML representation of a web service that carries both syntactic (e.g., WSDL) and semantic (e.g., SAWSDL) information, and (3) the reuse of available schema matchers. The approach departs from exiting ones because it does not advocate a specific matchmaking algorithm, and it promotes the combination of different schema matchers, allowing multiple discovery and composition strategies.

Several researchers argue that age related cognitive impairments have detrimental affect on use of web services by older adults. However little and systematic applied research has been conducted on how age related cognitive impairments might affect the usage of web services by older adults. Undoubtedly, understanding the relationship between the cognitive changes that accompany aging and their impact on older adults' usage of web services will be beneficial for designing web services for this group. The paper demonstrates how such understanding has been employed to develop an assistive technology in order to improve older adults' interaction with online forms (e.g. state benefit application form). However the paper acknowledges that this new assistive technology does not guarantee that people with age related cognitive impairments accept it, as diffusion of innovation research shows that getting a new technology adopted even when it has noticeable advantage is often very difficult. Consequently the paper identifies critical factors that need to be considered when adopting this new assistive technology, drawing on Rogers (2003) theory of Diffusion of Innovations.

With the rapid growth and adoption of web-based technologies, more and more service providers offer various services on the web. This can facilitate the organizations to develop business applications using web services composition over the Internet according to their business requirements. The primary requirement for developing composite web service is to discover the most relevant web service for realizing each function of the required composite web service. Finding the most relevant web service is still a challenging task. In this paper, we propose web service discovery approach that incorporates web services clustering. Clustering technique combines latent Dirichlet allocation(LDA) and k-Medoids and reduces search space for web service discovery. Web service discovery uses a match-making algorithm that utilizes WordNet database and Hungarian method to compute the semantic similarity score for a web service based on the requested query. Experimental results show that the proposed approach performs better than LDA-based approach.

Web services are interoperable and reusable software components that can be dynamically discovered and integrated over the Internet. Developed on open standards, Web services have become a promising solution to inter- and intra-organization application integration. The supply chain of Web services exhibits two distinct features that are not considered in previous literature on information and physical-good supply chain: the integration of multiple Web services and the cross-network externality effect between Web service vendors and users. In a quest to fill in the research gap, this paper studies the optimal pricing strategies of a monopolistic intermediary in the supply chain of complementary Web services. The Web service intermediary (WSI) provides both technical and aggregation services, and seeks to charge optimal subscription and listing fees. Analytical results show that in a supply chain of complementary Web services exhibiting cross-network effects, the optimal strategy for the WSI is to set the listing fee such that all service providers list on it. On the other hand, the optimal subscription fee depends on the intensity of the cross-network effect, consumers' valuation of value-added services, and the characteristics of the Web services under consideration.

The number of web services available on the Internet has grown rapidly. Service consumers face a hard decision over which service to choose among the available ones. Security holds a key after various vulnerabilities have been exploited by attackers on number of notable web services. This paper carries out a survey on how security has been expressed and promised for web services, through both the Web Service Description Language and Service Level Agreements. It reviews existing technologies used for comparing individual web services, as well as for service compositions. Taking security into account further complicates the already difficult process of choosing the right service. The paper reveals that despite existing efforts, a quantitative solution needs to be established urgently in order to help service consumers to choose the most secure service for them to use.

The exponential growth of Web service makes building high-quality service-oriented applications an urgent and crucial research problem. User-side QoS evaluations of Web services are critical for selecting the optimal Web service from a set of functionally equivalent service candidates. Since QoS performance of Web services is highly related to the service status and network environments which are variable against time, service invocations are required at different instances during a long time interval for making accurate Web service QoS evaluation. However, invoking a huge number of Web services from user-side for quality evaluation purpose is time-consuming, resource-consuming, and sometimes even impractical (e.g., service invocations are charged by service providers). To address this critical challenge, this paper proposes a Web service QoS prediction framework, called WSPred, to provide time-aware personalized QoS value prediction service for different service users. WSPred requires no additional invocation of Web services. Based on the past Web service usage experience from different service users, WSPred builds feature models and employs these models to make personalized QoS prediction for different users. The extensive experimental results show the effectiveness and efficiency of WSPred. Moreover, we publicly release our real-world time-aware Web service QoS dataset for future research, which makes our experiments verifiable and reproducible.

Web services facilitate reusability that allows cost-effective development of business applications using web services composition. Due to the proliferation of web services, different service providers are providing similar functionality web services. But these web services can have different values for QoS attributes and transactional properties. Thus, it is difficult to build a transactional and QoS optimal composite web service. Most of the existing works used the scalarization-based method for selecting optimal composite web service. In the scalarization-based method, the service user should have a priori knowledge of its preferences about the nonfunctional requirements of desired solutions. This paper proposes a Multiobjective Discrete Grey Wolf Optimization (MDGWO)-based approach for Transactional and QoS-driven Web Services Composition. The Pareto dominance concept is used to select optimal composite web service. Generational Distance (GD), Inverse Generational Distance (IGD), and Spread measures are used to evaluate the performance of the proposed approach. Experimental results indicate that the proposed approach performs well.