Integrating reinforcement learning and skyline computing for adaptive service composition

Test cases are one of the most important assets in the testing process This paper presents the testing ontology based SWEBOK and software quality model The management and retrieval of test cases will play a vital role in test cases reuse The keyword-based, as well as facet-based retrieval cannot meet user’s flexible query requirement because of lack of semantic information SWEBOK provides a broad agreement on the content of the software engineering discipline At last this paper discusses the management and retrieval of test cases based on the semantic similarity of two test concepts in two ontologies according to difference sets of super concept, sub concept, extension, and intension

Test Case Reuse Based on Ontology

In software development, it is often desirable to re-use existing software components. Currently, a number of repositories of components are available - generally including program source code, but finding the ones that can be re-used for an application is a challenging task. Program source code may be viewed as a form of data, containing both structure and function; it is therefore important to make use of this information in representing programs in the repository. We propose to combine the functional and structural information to facilitate software component search and retrieval. The proposed model reveals how functional and structural descriptors are identified and combined into a single representation. The functional descriptors are identified by extracting selected terms from program source code and a weighting scheme is adopted to differentiate the importance of terms. Structural descriptors that comprise of information generated based on structural relationships, such as design patterns and software metrics, are extracted from a program to be added as program descriptors. In order to retrieve components that are relevant to a given query, the use of similarity measurement based on the vector model and data distribution are investigated. The experiments undertaken on program retrieval indicate that the use of a combination of functional and structural descriptors is better than using functional descriptors on their own. Furthermore, programs retrieved using the proposed approach are less complex and easy to maintain.

Combining structure and function-based descriptors for component retrieval in software digital libraries

Service-Oriented Requirements Engineering (SORE ) plays a significant role in eliciting, specifying, and validating service requirements that will be developed by Web service technology . With the increasing complexity of users’ requirements, Web services need to be combined together to fulfill them. The process of building new value-added services by integrating sets of existing Web services to satisfy users’ requirements is called Web Service Composition (WSC). The main objective of WSC is to develop composite services to satisfy users’ requirements, which does not only include Functional Requirements (FR), but also Non-Functional Requirements (NFR). One of the main challenges of WSC is how it deals with dynamic environments. Since the Web service properties and composition requirements are frequently changeable, this demands that SORE activities must be equipped with a self-adaptation mechanism to provide the most appropriate composite services and satisfy users’ requirements emerged. Self-adaptation occurs in either a proactive or reactive manner. In this chapter, we appraise and analyze existing reactive adaptation research that deals with the problem of WSC in a dynamic environment in order to identify the research gaps in this field. These approaches are classified into three categories: used of variability models, context-awareness, and multi-agent approaches. Most of these approaches are not able to deal with continuous and unanticipated changes in complex uncertain contexts because they need to define the contexts in design time. It is usually difficult to predict all of the possible situations that might arise in an uncertain environment.

Appraisal and Analysis of Various Self-Adaptive Web Service Composition Approaches

In this thesis, we explore the appropriateness of the language abstractions provided by Bigraphs to construct a model at runtime to tackle the problem of volatility in a service composition running on a mobile device.

Our contributions to knowledge are as follows:

1) We have shown that Bigraphs (Milner, 2009) are suitable for expressing models at runtime.

2) We have offered Bigraph language abstractions as an appropriate solution to some of the research problems posed by the models at runtime community (Asmann et al., 2012).

3) We have discussed the general lessons learnt from using Bigraphs for a practical application such as a model at runtime.

4) We have discussed the general lessons learnt from our experiences of designing models at runtime.

5) We have implemented the model at runtime using the BPL Tool (ITU, 2011) and have experimentally studied the response times of our Bigraphical model. We have suggested appropriate enhancements for the tool based on our experiences.

We present techniques to parameterize the reaction rules so that the matching algorithm of the BPL Tool returns a single match giving us the ability to dynamically program the model at runtime. We also show how to query the Bigraph structure.

Constructing runtime models with bigraphs to address ubiquitous computing service composition volatility

Underwater image enhancement method with light scattering characteristics

It is a challenge for Web service composition to perceive dynamic changes of external environment and adapt to the changes of business process rapidly. In this paper, a context-aware adaptive Web service composition framework is presented and the functions of main modules are also described in detail. In this framework, BPEL is used to describe Web service composition process and a kind of special Web service called context service is defined to support context-awareness. Agent technology is introduced to enable context service to actively perceive and process contexts of Web service and Web service composition.

A Context-Aware Adaptive Web Service Composition Framework

Facet-based component retrieval techniques have been proved to be an effective way for retrieving. These Techniques are widely adopted by component library systems, but they usually simply list out all the retrieval results without any kind of ranking. In our work, we focus on the problem that how to determine the ranks of the components retrieved by user. Factors which can influence the ranking are extracted and identified through the analysis of ER-Diagram of facet-based component library system. In this paper, a mathematical model of weighted ranking algorithm is proposed and the timing of ranks calculation is discussed. Experiment results show that this algorithm greatly improves the efficiency of component retrieval system.

A weighted ranking algorithm for facet-based component retrieval system

KPN (Kahn Process Network) is a model of computation based on dataflow and commonly used for describing a set of cooperative processes that communicate with each other by means of dataflow. In this paper, we propose a KPN based cooperative composition model of services called CCM. The corresponding mapping mechanism of KPN to CCM is presented. CCM model aims at reducing unanticipated circumstances and uncooperative cases of services in service composition and improving chances of composition success. The data description and service description techniques adopted in CCM model is introduced in detail. Based on CCM model, a cooperative composition framework of services is designed. Finally a case study is presented to show how to describe cooperative service processes in CCM model.

A KPN based cooperative composition model of services

The behavior adaptation of Software component is a crucial problem in component-based software engineering. Software component adaptation aims at generating, as automatically as possible, adaptors to compensate behavior mismatch during components interaction, and ensure the deadlock-freedom of components interaction at the architectural level. A general and safe approach is proposed to solve the behavior mismatch. Firstly, the model of component behavior adaptation and the definition of adaptor are given. Then, the formal specification of component behavior protocol is given and the safety of component behavior adaptation is verified formally. The adaptor can make the correctness of the component interaction with data exchange, and realize the reordering of message. Finally, an example is presented to illustrate the validity of the approach proposed in this paper.

Jinyu Shi

Papers

Underwater image enhancement method with light scattering characteristics

A Context-Aware Adaptive Web Service Composition Framework

A weighted ranking algorithm for facet-based component retrieval system

A KPN based cooperative composition model of services

Safety Verification of Software Component Behavior Adaptation