CBBCM: Clustering Based Automatic Service Composition

The automatic composition of Web Services has been explored in the literature from different standpoints. It aims to create an execution plan for the flow of Web Services based on requests made and sent by the client, by following the stages necessary for the generation of composite services and then carrying out the execution of the workflow that has been designed. However, no research studies have been found that undertake the whole process of an automatic composition and execution, from the user's request to the execution of the services chosen as a solution. Therefore, the goal of this paper is to evaluate the performance of an automatic Web Service composition, since the request made by the client, to the delivery of the results of the executed composition. This article examines the integration between two tools, the automatic web service composition system and the extensible platform to evaluate semantic web services with the aim of conducting a performance evaluation of an entire process of automatic composition of Web services.

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.

Web services play an important role in the development of distributed systems. Particularly, the possibility of composing already implemented web services in order to provide new functionalities is an interesting approach for building distributed applications and business processes. In this paper we focus on mismatches occurring during dynamic composition of web services. We propose an algorithm for dynamic and automatic composition and adaptation of web services. Our approach only uses the information that is already available in service interface descriptions. The algorithm allows programmers to define dynamic web service compositions without changing the source code.

The automatic composition of Web services requires the existing services to be encoded in a semantic form, such as ontology. If Web services are represented with ontology, we can automatic compose Web services by means of their semantics. Ontology modeling is divided into two steps: input/output parameters modeling and Web services modeling. First, we collect Web services' input/output parameters, represent them with classes in ontology, and transform Web services to properties in ontology, define relations between classes and properties. Then we judge Web services' relations based on relations between properties transformed from these Web services and estimate whether these Web services can be composed.

Through providing an execution environment for semantic web services, SWSF (Semantic Web Service Framework) can facilitate automatic web service delivery, discovery, selection, invoking, composition and interoperation. However, each of those ongoing approaches does not satisfy all basic requirements of SWSF, e.g. OWL-S (Ontology Language of Web Service) does not offer the mechanism for automatic web service tasks' execution and WSMO can not describe the composition of web services in a structural way yet. So, in order to provide a fully- fledged SWSF, we present the ISCF (Integrated Service Composition Framework) which is based on the OAA (Open Agent Architecture ). We describe the technical characters and design objectives of ISCF from global and detailed view. Comparing with other SWSFs, ISCF has more extensible and autonomous distributed architecture, and has more complete and effective web service automatization. In addition, ISCF provide some useful tools to help users design semantic web services and manage ISCF system.

A difficulty of sharing messages transferred among Web services is absence of common vocabulary, and the semantic organization and description of Web services is an important requirement for enabling the automatic discovery, selection, composition, execution and monitoring of Web services. This paper proposes a model for semantic-based interaction between Web services. The method defined some ontology-based vocabularies to describe different Web services and some mapping rules among those vocabularies. Compared with existing methods, the method considers the Web services together with the semantic interpretation, satisfiability and reasoning of distributed ontologies. So the method can ensure the share and reusage of term be used for describing parameters of Web services.

Web services are becoming de facto a standard for data exchanging, since they provide a clear way to express and access information throughout the Internet. Sometimes, one service alone is not able to perform a certain task, and it might be necessary to compose two or more services in order to accomplish that task. In this context, semantic web services play an essential role, since they provide a framework to formally describe services in a way that it is possible to machines to automatically discovery, compose, invoke, and monitor them. On the other hand, only functionality is not enough to fulfill users' satisfaction, in the sense that service providers should guarantee the quality delivered by their services. In this paper, we present a heuristic-based approach for automatic semantic web services composition. Besides considering the functional correctness, the proposed heuristics also takes into account the overall quality of the composite service during the composition process.

The potential benefits of Web services composition heavily rely on semantic interoperability, i.e., the ability to exchange data meaningfully amongst Web services. Context heterogeneity, which refers to different implicit assumptions about interpreting the exchanged data, hampers the automatic composition of Web services. However, existing initiatives of Semantic Web Services (SWSs) often ignore context heterogeneity. In this paper, we introduce an approach to address this issue. The contexts of the involved Web services are defined in a lightweight ontology and their WSDL descriptions are annotated by an extension of a W3C standard, i.e., Semantic Annotation for WSDL and XML Schema (SAWSDL). The composition of Web services is described using BPEL specification. Given a BPEL file that ignores context heterogeneity, the approach automatically detects all context differences among the involved services, and reconciles them by producing a mediated BPEL file that incorporates necessary conversions using XPath functions and/or Web services.

With the proliferation of Web services and the evolution towards the Semantic Web comes the opportunity to automate various Web services tasks. A number of approaches have been proposed to tackle the problem of automatic web service composition. Most of them are inspired by the researches in AI planning. As heuristics plays a key role in the promotion of planning efficiency, the selection of heuristic mechanism is very important. In this paper, we propose the conception of composition distance, and propose a heuristic bidirectional search algorithm based on composition distance. The most contribution of this paper is : (1)propose the conception of composition distance; (2)a heuristic bidirectional search algorithm. The algorithm we proposed is effective and efficiency when applied in web service composition engine.

Hydroponics systems require tremendous attention both in nutrition, plant growth, the risk of pest and disease attacks. Thus, this hydroponic farming system requires high experience and expertise that is the main obstacle for business actors who want to start a vegetable cultivation business with a hydroponic system, especially for business actors who do not have a background in agriculture. The hydroponic cultivation expert system in this study aims to detect plant diseases and pests and provide solutions to these diseases. In addition, this expert system application also aims to monitor plant needs, so this application can help farmers grow up hydroponic vegetable cultivation businesses. The combination of the forward and backward chaining methods is applied to detect plant diseases and pests. Whereas the forward chaining method use to monitor plant needs. The combination of the forward and backward chaining methods in identifying plant diseases and pests can make it easier for users to determine the suffered by plants and provide information about these diseases. The application of the forward chaining method in monitoring plant needs can identify the level of fulfilment of entails of each component of plant needs according to the type of plant and the day after planting. The application of this hydroponic expert system can overcome the limited number of hydroponic experts in helping farmers identify plant diseases and pests and monitor plant needs.

Scholarships are generally a provision of fees for education for students who are still actively attending lectures at a tertiary institution. With the scholarship so that it can help students to finance their needs during college. With the backward chaining method can facilitate the campus bureaucrats in determining students who are entitled to receive scholarships. Backward Chainning is a model in reverse of hypotheses, a potential or conclusion that must be proven by facts that support the hypothesis. The backward chaining model in receiving scholarships takes some data from existing variable criteria such as active lecture certificates, student cumulative achievement indexes, attaching TOEFL certificate, identity card, and curriculum vitae. Next make a decision tree from the data variables that exist and finally is implemented. The results of this study have an accuracy of 95%, which can be recommended to get the scholarship and this method can facilitate the determination of scholarship acceptance. The backward chaining method is very effective and accurate in determining DIPA scholarship recipients with an accuracy rate of 95%, making it easier for the North Sumatra state Islamic university community to select students who are eligible to receive.

In a domain SOA environment, multiple services exist to help in executing the users requests but manually handling each request is time wasting and very tiring thus the idea of automatic composition of web services emerged. This paper describes the ACUAI framework which is an AI automatic composer for web services with learning capabilities, since games have the most developed dynamic system adaptation to user action this framework uses two AI techniques which are used in games development they are decision trees and the finite state machines, the user request will be handled in the same way games react to user input then a decision is taken based on current state of the orchestration and then the algorithm changes the state of the orchestration according to the last decision taken to be able to guide the orchestration towards the goal and get a successful composition then each successful composition and its template request are saved to be used later on in enhancing the execution time.

Automatic web service composition is defined as the const ruction of virtual enterprises as complex services on demand. In the current research scenario choosing business service partners for composition on the fly is usually determined with user-centric metrics and deficient of provider’s business specific metrics. Automatic web service composition in today’s real world business circumstances is more of a toy model due to the lack of service provider collaboration metrics [1]. SLAKY System is a new model for selection of business service partners by adding servic e provider metrics to user centric metrics enabling strategic and realistic selection of services for composition. SLAKY System selects services automatically considering the vision, time planning, environmental context, user adoption, usage policies, trus t management, risk management, market scenario, native intelligence, and competitive profit management as service provider collaboration metrics in addition to functionality satisfaction metrics for client’s requirements. The time planning metric was designed using opus deviser algorithm [2] and profit management using SLAKY BWG algorithm [3]. In this paper we focus on strategic selection of semantic services based on the metric of native intelligence. Howard Gardner, psychology professor, Harvard Universit y, defines intelligence as an ability to solve problems, or to create products, that are valued within one or more cultural settings. Richard Heck, Professor of Natural Theology, Brown University, in his work states that native intelligence is primarily influenced by racial and cultural differences. User preferences in any sector intend to have native influence. For example the affinity towards entertainment services for Indian Premier League or low cost car booking service for TATA Nano is more in India th an America. Moreover decision made by a decision maker is motivated by native intelligence in addition to Intelligence Quotient and is valued highly in native grounds. For example the selection of a matrimonial service totally relies on native aspects. Native Intelligence is also a significant metric to improve time -to-market and quality in the launch of any product. Considering the significance of native intelligence in strategic selection we layer native intelligence descriptions for realistic selection o f semantic web services on the fly. OWL -S upper ontology that describes semantics of services for automation of service discovery, selection, composition, orchestration and invocation lacks entities for semantic modeling of native intelligence. In this pap er we propose an extended OWL -S ontology which augments where, why and who native status descriptions of a service apart from the existing what (ServiceProfile sub -ontology) and how (ServiceModel, ServiceGrounding sub-ontology) semantics. The why, whereand who semantics are newly augmented as ServiceParameters of Profile sub -ontology using sParameter property. We also propose Naavi algorithm that reasons with common sense knowledge for selection of the web service that is highly valuable in a native context using native description in extended OWL -S.

With the growth of web service in quantity, it has become an urgent issue how to compose web service with effective method so as to capacitate web service providers to work cooperatively and exert greater function. The paper introduces web service composition method based on rules and meta-services. Meta services are the abstraction of web services with similar functions, while rules are used to describe logic relation and data dependence relation among meta-services. An algorithm that generates the abstract service composition process based on the rules and meta-services is designed. The abstract service composition process is converted into executable process by employing web service discovery. The method proposed in this paper is proved to be feasible by the application in travel platform.

Web services are widely used because of their features of interoperability, loose-coupled and platform independent. Web services composition is one of the hottest topics in service computing area. In this paper a method based on Petri net coverability problem is proposed to handle automatic service composition. First each service is translated into component of Petri net and the input/output places with same semantics are merged. According to user’s input and desired output, the initial marking and target marking can be obtained. Then the coverability tree and coverability graph can be constructed. At last the node on the coverability graph which can cover the target marking should be find out, and shortest coverability path translated into smallest service executing sequence to reach the goal of automatic service composition.