F.2.7. Optimization
Seyed Morteza Babamir; Narges Zahiri
Abstract
Web service composition represents a graph of interacting services designed to fulfill user requirements, where each node denotes a service, and each edge represents an interaction between two services. A few candidates with different quality attributes exist on the web for conducting each web service. ...
Read More
Web service composition represents a graph of interacting services designed to fulfill user requirements, where each node denotes a service, and each edge represents an interaction between two services. A few candidates with different quality attributes exist on the web for conducting each web service. Consequently, numerous compositions with identical functionality but differing quality attributes can be formed, making the near-optimal composition selection an NP-hard problem. This paper proposes a tool-supported Evolutionary Optimization Algorithm (EOA) for near-optimal composition selection. The proposed EOA is a Discretized and Extended Gray Wolf Optimization (DEGWO) algorithm. This approach first discretizes the continuous solution space and then extends the functionality of GWO to identify global near-optimal solutions while accelerating solution convergence. DEGWO was evaluated in comparison with other related methods in terms of metrics. Experimental results showed DEGWO achieved average improvements of 8%, 39%, and 5% in terms of availability, 36%, 43%, and 30% in terms of response time, and 65%, 53%, and 51% in terms of cost compared to the three leading algorithms, RDGWO+GA, HGWO, and SFLAGA, respectively.
C.3. Software Engineering
M. A. Saadtjoo; S. M. Babamir
Abstract
Search-based optimization methods have been used for software engineering activities such as software testing. In the field of software testing, search-based test data generation refers to application of meta-heuristic optimization methods to generate test data that cover the code space of a program. ...
Read More
Search-based optimization methods have been used for software engineering activities such as software testing. In the field of software testing, search-based test data generation refers to application of meta-heuristic optimization methods to generate test data that cover the code space of a program. Automatic test data generation that can cover all the paths of software is known as a major challenge. The paper establishes a new cost function for automatic test data generation, which can traverse the non-iterative paths of software control flow graphs. This function is later compared with similar cost functions proposed in other articles. The results indicate the superior performance of the proposed function. Still another innovation in this paper is the application of the Imperialist Competitive Algorithm in automatic test data generation along with the proposed cost function. Automatic test data generation is implemented through the Imperialist Competitive Algorithm as well as the Genetic and Particle Swarm Optimization Algorithms for three software programs with different search space sizes. The algorithms are compared with each other in terms of convergence speed, computational time, and local search. Test data generated by the proposed method has achieved better results than other algorithms in finding the number of non-iterative paths, the convergence speed and computational time with growing the searching space of the software's control flow graph.
C.3. Software Engineering
F. Karimian; S. M. Babamir
Abstract
Reliability of software counts on its fault-prone modules. This means that the less software consists of fault-prone units the more we may trust it. Therefore, if we are able to predict the number of fault-prone modules of software, it will be possible to judge the software reliability. In predicting ...
Read More
Reliability of software counts on its fault-prone modules. This means that the less software consists of fault-prone units the more we may trust it. Therefore, if we are able to predict the number of fault-prone modules of software, it will be possible to judge the software reliability. In predicting software fault-prone modules, one of the contributing features is software metric by which one can classify software modules into fault-prone and non-fault-prone ones. To make such a classification, we investigated into 17 classifier methods whose features (attributes) are software metrics (39 metrics) and instances (software modules) of mining are instances of 13 datasets reported by NASA. However, there are two important issues influencing our prediction accuracy when we use data mining methods: (1) selecting the best/most influent features (i.e. software metrics) when there is a wide diversity of them and (2) instance sampling in order to balance the imbalanced instances of mining; we have two imbalanced classes when the classifier biases towards the majority class. Based on the feature selection and instance sampling, we considered 4 scenarios in appraisal of 17 classifier methods to predict software fault-prone modules. To select features, we used Correlation-based Feature Selection (CFS) and to sample instances we did Synthetic Minority Oversampling Technique (SMOTE). Empirical results showed that suitable sampling software modules significantly influences on accuracy of predicting software reliability but metric selection has not considerable effect on the prediction.
