1)Dynamic Test Reconfiguration for Composite Web ServicesABSTARCT : this paper introduces a testing strategy that is suitable for testing service-based applications. We describe an architecture that responds to changes of service operation, operation arguments and service composition changes. Our proof-of-concept test system performs runtime testing on our model atomic and composite web services using a random testing technique. A novel change identification method was developed to capture changes at the service interface. The test system is able to identify changes that occur in service operations and operational arguments in a service description of a test candidate. Our approach uses a new method to detect changes in a service inventory. Automated reconfiguration is used to support the continuous operation of the testing systems during a test candidate change.

2)Commitments to Regulate Social Web Services OperationABTRACT : This paper discusses how social Web services are held responsible for the actions they take at run time. Compared to (regular) Web services, social Web services perform different actions, for instance establishing and maintaining networks of contacts and forming with some privileged contacts strong and long lasting collaborative groups. Assessing these actions' outcomes, to avoid any violation, occurs through commitments that the social Web services are required to bind to. Two types of commitments are identified: social commitments that guarantee the proper use of the social networks in which the social Web services sign up, and business commitments that guarantee the proper development of composite Web services in response to users' requests. Detecting commitment violation and action prohibition using monitoring results in imposing sanctions on the guilty social Web services and taking corrective actions. A system for commitment management in terms of definition, binding, monitoring, and violation detection is also discussed in this paper.

3)LASA-HEU: Heuristic Approach for Service Selection in Composite Web ServicesABSTARCT : Numerous functionally similar services are evolving day by day. Selecting the service which matches exactly with the requirements of the consumer is a tedious task. The QoS-based Service Selection Problem (SSP) is a process of allocating a QoS based exterior web service component to each task of the workflow that describes a composite web service. Hence, the aggregate QoS of the composite web service is the best. It is a planning problem by its nature. This paper provides the brief overview of the heuristic based Service Selection Algorithm (LASA-HEU) for the MMKP form of reliability enforced SSP. This paper also compares the proposed LASA-HEU with the existing heuristic based SSA and proved that the proposed LASA-HEU performs better than the existing heuristic based SSA based on the reliability.

4)Service Selection for Web Services with Probabilistic QoS ABSTARCT : Web services can be specified from two perspectives, namely functional and non-functional properties. Multiple services may possess the same function while vary in their non-functional properties, or called quality-of-service (QoS). QoS values are important criteria for service selection or recommendation. Most of the former works in Web service selection and recommendation treat the QoS values as constants. However, QoS values of a service as perceived by a given user are intrinsically random variables because QoS value prediction can never be precise and there are always some unobserved random effects. In this work, we address the service selection problem by representing services QoS values as discrete random variables with probability mass functions. The goal is to select a set of atomic services for composing a composite service such that the probability of satisfying constraints imposed on the composite service is high and the execution time is reasonable. Our proposed method starts with an initial Web service assignment and incrementally adjusts it using simulated annealing. We conduct several experiments and the results show that our approach generally performs better than previous works, such as the integer programming method and the cost-driven method

5) A Framework for Composing SOAP, Non-SOAP and Non-Web ServicesABSRACT : Recently, there is a trend on developing mobile applications based on service-oriented architecture in numerous application domains, such as telematics and smart home. Although efforts have been made on developing composite SOAP services, little emphasis has been put on invoking and composing a combination of SOAP, non-SOAP, and non-web services into a composite process to execute complex tasks on various mobile devices. Main challenges are two-fold: one is how to invoke and compose heterogeneous web services with various protocols and content types, including SOAP, RESTful, and OSGi services; and the other is how to integrate non-web services, like Web contents and mobile applications, into a composite service process. In this work, we propose an approach to invoking and composing SOAP, non-SOAP, and non-web services with two key features: an extended BPEL engine bundled with adapters to enable direct invocation and composition of SOAP, RESTful and OSGi services based on Adapter pattern; and two transformation mechanisms devised to enable conversion of Web contents and Android activities into OSGi services. In the experimental evaluations, we demonstrate network traffic and turnaround time of our approach are better than those of the traditional ones.

6)Web service selection algorithm for dynamic service composition using LSLO approachABSTRACT : Web service selection among a collection of functionally identical Web services for runtime service composition is a challenging issue. In this paper, a local selection and local optimization approach for Web service selection based on linear programming is proposed. This approach formulates the problem of selecting best candidate Web service from each service class as an assignment problem of linear programming. The approach uses a heap data structure to place the services in an appropriate order for composition based on the highest quality score. The proposed approach can help in improving the composition time, quality of the generated composite Web service and the transmission delay by forwarding only a few numbers of selected services to the composer.

7)Data-Driven Composition for Service-Oriented Situational Applications ABSTRACT : The convergence of Services Computing and Web 2.0 gains a large space of opportunities to compose $situational$ web applications from Web-delivered services. However, the large number of services and the complexity of composition constraints make manual composition difficult to application developers, who might be non-professional programmers or even end-users. This paper presents a systematic data-driven approach to assisting situational application development. We first propose a technique to extract useful information from multiple sources to abstract service capabilities with a set tags. This supports intuitive expression of users desired composition goals by simple queries, without having to know underlying technical details. A planning technique then exploits composition solutions which can constitute the desired goals, even with some potential new interesting composition opportunities. A browser-based tool facilitates visual and iterative refinement of composition solutions, to finally come up with the satisfying outputs. A series of experiments demonstrate the efficiency and effectiveness of our approach.

8)Access Control Mechanisms for Inter-Organizational WorkflowABSTRACT : As more businesses engage in globalization, inter-organizational collaborative computing grows in importance. Since we cannot expect homogeneous computing environments in participating organizations, heterogeneity and Internet-based technology are prevalent in inter-organizational collaborative computing environments. One technology that provides solutions for data sharing and work coordination at the global level is inter- organizational workflow. In this paper, we investigate the access control requirements for inter-organizational workflow. We then present access control solutions for inter-organizational workflow based on our implementation. Many of the requirements and solutions in this paper address the scalability of existing security solutions, the separation of inter-organizational workflow security from concrete organization level security enforcement, and the enforcement of fine-grained access control for inter-organizational workflow.

9)A Novel Method for Web Service Composition Based on Extended BDIABSTRACT : Web Service Composition (WSC) has been a hot research topic in the past decade because it can carry out complex tasks. The main methods to study WSC include workflow, process algebra and semantics. It's very possible that user's goal is not consistent with WSC's goal. For this, a new method of WSC based on BDI (Belief-Desire-Intention) has been provided. In this method, Belief and Desire are mapped into the environment and the goal of web service (and user) respectively. Intention and WSC are determined by them. An improved BDI model has been applied to WSC and dynamic evolution of established processes. At last, a classic example in web service, travel service process, is utilized to illustrate the consistency between WSC's goal and user's goal.

10)An Online Performance Prediction Framework for Service-Oriented SystemsABSTRACT : The exponential growth of Web service makes building high-quality service-oriented systems an urgent and crucial research problem. Performance of the service-oriented systems highly depends on the remote Web services as well as the unpredictability of the Internet. Performance prediction of service-oriented systems is critical for automatically selecting the optimal Web service composition. Since the performance of Web services is highly related to the service status and network environments which are variable over time, it is an important task to predict the performance of service-oriented systems at run-time. To address this critical challenge, this paper proposes an online performance prediction framework, called Opred, to provide personalized service-oriented system performance prediction efficiently. Based on the past usage experience from different users, OPred builds feature models and employs time series analysis techniques on feature trends to make performance prediction. The results of large-scale real-world experiments show the effectiveness and efficiency of OPred.