Reuse in software development is a practice that improves the software development process. Reusing existing software artifacts requires an efficient retrieval mechanism. Leaning out software repository for effective and efficient retrieval and reuse of relevant artifacts requires identifying and eliminating the wasteful artifacts it may involve. Model matching is a preliminary step to identify what is common and what is variant among the software artifacts. However, the time for matching two models to find the optimal correspondence between their elements is exponential. Artificial Bee Colony algorithm is a heuristic that is getting popularity as reasonable solution for problems under different optimization scenarios. This paper presents a solution algorithm based on Artificial Bee Colony for matching UML class diagrams. On a dataset of ten pairs of class diagrams, the performance of the suggested approach is empirically evaluated and compared with Ant Colony approach. The performance of the two algorithms are reported in terms of accuracy of matching and execution time. The results indicate the superiority of the Artificial Bee Colony algorithm in terms of accuracy rate and execution time.

One of the main sources of the routing overhead is the routing protocols that are based on flooding mechanisms. Such routing protocols result in low performance and high resource consumption, especially for constrained devices such as sensors, and actuators. Besides, there are many sensor-based indoor or outdoor applications that rely on deterministic nodes' controllable deployment. Mainly, these applications are used for monitoring and control, for example, home, building, and factory automation and monitoring applications; or outdoor monitoring applications, like forest, disaster, and agriculture areas. The shortcoming in the flooding routing protocols has been addressed by using location-based routing that uses GPS devices. This would decrease the routing overhead but will increase the cost of the network nodes since it need hardware support. In this paper, a solution that reduces the overhead of the flooding mechanisms without needing any hardware support is proposed. The proposed protocol is a routing protocol for Wireless Sensor Networks (WSN) called ID-Based Routing; It uses predefined node identifications to build the routes and is designed especially for grid topology-based applications. It consumes nearly zero memory footprint because it doesn't use routing tables at all. Moreover, its communication is very low since no need to send packets to establish the routes, which consumes much energy due to radio communication to send/receive routing packets.

ABSTRACT Software systems are subject to series of changes during their evolution as they move from one release to the next. The change histories of software systems hold useful information that describes how artifacts evolved. Evolution‐based metrics, which are the means to quantify the change history, are potentially good indicators of the changes in a software system. The objective of this paper is to derive and validate (theoretically and empirically) a set of evolution‐based metrics as potential indicators of the change‐prone classes of an object‐oriented system when moving from one release to the next. Release‐by‐release statistical prediction models were built in different ways. The results indicate that the proposed evolution‐based metrics measure different dimensions from those of typical product metrics. Additionally, several evolution‐based metrics were found to be correlated with the change‐proneness of classes. Moreover, the results indicate that more accurate prediction of class change‐proneness is achieved when the evolution‐based metrics are combined with product metrics. Copyright © 2012 John Wiley & Sons, Ltd.