Mutation analysis in software testing is observed as the most effective way to validate the software under inspection. In last decade, number of researchers developed various methods and tools to apply mutation testing on Aspect Oriented Programs. In this paper, authors analyzed numerous mutation testing based tools available to test the Java and AspectJ programs. All effective and popular Aspect-J testing tools have been considered and analyzed in this paper, based on essential requirements in this context, considered to be fulfilled by testing tools decided by testing professional and researchers for such tools. This paper analyzed the work progress in the field of mutation testing techniques and tools specific to Java and AspectJ. This work considered essential parameters on which the analysis of analyzed tools is carried out. In case of addition parameters considered for evaluation, some of the resultant metrics may vary slightly under modification in basic requirements. Based on the numeric value estimated, it is finally suggested the merits of a mutation tool under different circumstances. This is the extension of the work carried by us in previous review for aspect based mutation testing techniques.

In this paper, a hybrid classifier using fuzzy clustering and several neural networks has been proposed. With using the fuzzy C-means algorithm, training samples will be clustered and the inappropriate data will be detected and moved to another dataset (Removed-Dataset) and used differently in the classification phase. Also, in the proposed method using the membership degree of samples to the clusters, the class of samples will be changed to the fuzzy class. Thus, for example in KDD cup99 dataset, any sample will have 5 membership degrees to classes DoS, Probe, Normal, U2R, and R2L. Afterwards, the neural networks will be trained by new labels then using a combination of regression and classification methods, the hybrid classifier will be created. Also to classify the outlier data, a fuzzy ARTMAP neural network is employed which is a part of the hybrid classifier.
Evaluation of the proposed method is performed by KDDCup99 dataset for intrusion detection and Cambridge datasets for traffic classification problems. Our experimental results indicate that the proposed system has performed better than the previous works in the case of precision, recall and f-value also detection and false alarm rate. Also, ROC curve analysis shows that the proposed hybrid classifier has been better than the famous non-hybrid classifiers.

Global Software Development (GSD) is the most recent and major trend in software engineering domain. It provides many benefits but also faces various challenges in control, communication and coordination due to socio-cultural, geographical and temporal distance. Scrum is increasingly being applied in GSD as it supports teamwork between developers and customers. Scrum method offers a distinctive feature to mitigate the effects of socio-cultural and geographical but not temporal distance on coordination in GSD projects. This paper explains how Scrum helps to mitigate the effects of temporal distance that includes increased coordination costs in GSD projects.

There were a lot of methods that introduced in the information search field; one of those methods is the wireless sensor networks; and one of the most famous protocols in WSNs is LEACH protocol. And because of that protocol suffering from some defects like sometimes the node attaching to C.H. near from it, but that C.H. far from the B.S. even the node itself near to the B.S. than its C.H.; to solve that problem a new method will introduce in this research which basing on:

.Allocation of 5 meters (0-5) and prevent the election of any C.H. on it.
.Division of the Network area into four parts (near, mid, far, and very far) according to the node`s distance from B.S.
.Restriction of the attachment between the nodes and the C.Hs. in the same part.
.If a particular part is empty from the C.H. so the nodes will attach to C.H. from the upper parts, But with a condition (the distance between the C.H. and the node <= the distance between node and B.S. /2)

Through these improvements, good results were gotten in the simulation, which showed that the improved LEACH was more efficient than the original LEACH.

In this paper, the system comprises of a commensal (S1), two hosts S2 and S3 ie., S2 and S3 both benefit S1, without getting themselves effected either positively or adversely. Further S2 is a commensal of S3, S3 is a host of both S1, S2 and all the three species have limited resources. The basic equations for this model constitute as three first order non-linear ordinary difference equations. All possible equilibrium points are identified based on the model equations and criteria for their stability are discussed. Further the numerical solutions are computed for specific values of the various parameters and the initial conditions.

Today, multipliers are included as substantial keys of many systems with high efficiency such as FIR filters, microprocessors and processors of digital signals. The efficiency of the systems are mainly evaluated by their multipliers capability since multipliers are generally the slowest components of a system while occupying the most space.
Multiple Valued Logic reduces the number of the required operations to implement a function and decreases the chip surface. Carbon Nanotube Field Effect Transistors (CNTFET) are considered as good substitutes for Silicon Transistors (MOSFET). Combining the abilities of Carbon Nanotubes Transistors with the advantages of Multiple Valued can provide a unique design which has a higher speed and less complexity.
In this paper, a new multiplier is presented by nanotechnology using a ternary logic that improves the consuming power, raises the speed and decreased the chip surface as well.
The presented design is simulated using CNTFET of Stanford University and HSPICE software, and the results are compared with other instances.

In software testing, fault detection and removal process is one of the key elements for quality assurance of the software. In the last three decades, several software reliability growth models were developed for detection and correction of faults. These models were developed under strictly static assumptions. The main goal of this article is to investigate an optimal resource allocation plan for fault detection and removal process of software to minimize cost during testing and operational phase under dynamic condition. For this we develop a mathematical model for fault detection and removal process and Pontryagain’s Maximum principle is applied for solving the model. Genetic algorithm is used to find the optimal allocation of fault detection and removal process. Numerical example is also solved for resource allocation for fault detection and remoal process.

Advancements in the domains of low-data-rate wireless networking and micro-electro-mechanical systems enabled the inception of a new networking domain, called wireless sensor network. These ad-hoc kind of networks have diversified applications in battlefield surveillance, disaster monitoring, intrusion detection etc. These networks consist plethora of sensor nodes which are severely resource constrained. As the application of the wireless sensor network is increasing, there is an emerging need for the security and privacy scheme which makes the network secure from various attacks and hide the ongoing activities in the network from a non-network entity. Privacy in wireless sensor network is yet a challenging domain to work on. Lot of work has been done to ensure privacy in the network. These relate to provide privacy in terms of the network entity and the privacy of the sensed information. Most of the solutions till date is based upon routing in the network layer, random walk based flooding, dummy data injection and cross layer solutions. Each of the schemes induce some overhead in the network. A light weight scheme is always desired for resource constraint wireless sensor networks. In this work we will propose a scheme which assures the privacy of the nodes in the network along with the privacy of the event generated in the network through a self organizing scheme. Through various simulation results the validity of our scheme among different network scenarios will be shown. We will also prove through graphical results that our proposed scheme enhances network lifetime quite satisfactorily.