HYBRID DATA APPROACH FOR SELECTING EFFECTIVE TEST CASES DURING THE REGRESSION TESTING

In the software industry, software testing becomes more important in the entire software development life cycle. Software testing is one of the fundamental components of software quality assurances. Software Testing Life Cycle (STLC)is a process involved in testing the complete software, which includes Regression Testing, Unit Testing, Smoke Testing, Integration Testing, Interface Testing, System Testing & etc. In the STLC of Regression testing, test case selection is one of the most important concerns for effective testing as well as cost of the testing process. During the Regression testing, executing all the test cases from existing test suite is not possible because that takes more time to test the modified software. This paper proposes new Hybrid approach that consists of modified Greedy approach for handling the test case selection and Genetic Algorithm uses effective parameter like Initial Population, Fitness Value, Test Case Combination, Test Case Crossover and Test Case Mutation for optimizing the tied test suite. By doing this, effective test cases are selected and minimized the tied test suite to reduce the cost of the testing process. Finally the result of proposed approach compared with conventional greedy approach and proved that our approach is more effective than other existing approach

AN INNOVATIVE FRAMEWORK FOR AUTO DYNAMIC SELECTION AND COMPOSITION OF WEB SERVICES

With the availability of ample amount of Web Services similar in functionality and varying in Quality of Service (QoS) over the web, it is essentially required to get the best-suited candidate services for the resultant composite service. QoS plays a decisive role in selecting web Services individually and Composite Web Service as a whole. Certainly, composition is one of the key properties of service-orientation to create new as well as advanced level services, by re-using the existing ones. In distributed environments, services having no quality guarantees, adversely affects the composition outcome. To find the best candidate services for the composition, researchers have opted either Users’ feedback or Providers’ published information but none of them have considered both of them together. In our approach, we have taken into consideration both the things (Users’ feedback and Providers’ published information) together in order to find the best candidate web services by cross verifying both of the information to ascertain the quality of the candidate web services. An innovative framework for the composition of web services along with the detailed methodology and algorithm has been discussed in the second half of the paper

Diversity-Oriented Synthesis of Novel Benzimidazoles as Antimalarial agents via post Ugi MCR

An efficient strategy for the syntheses of highly diverse benzimidazoles in exceptional yields via post Ugi reactions has been described. In our methodology we have utilized isocyanide based Ugi-reaction followed by acid catalyzed condensation cyclization reaction under microwave irradiations. All benzimidazole derivatives showed moderate to good antimalarial activity when compared with chloroquine as reference compound. Among these compounds, three of them (8b), (8c), (8d) were found to be most potent towards antimalarial activity. The synthesized hybrids were examined for their purity with the help of thin layer chromatography. Different analytical techniques were employed for further characterization like Mass studies, NMRs (1H and 13C) and FT-IR

A NOVEL ROUTING PROTOCOL FOR TARGET TRACKING IN WIRELESS SENSOR NETWORKS

Wireless sensor networks (WSNs) are large scale integration consists of hundreds or thousands or more\ud number of sensor nodes. They are tiny, low cost, low weight, and limited battery, primary storage, processing power. They have wireless capabilities to monitor physical or environmental conditions. This paper compared the performance analysis of some existing routing protocols for target tracking\ud application with proposed hierarchical binary tree structure to store the routing information. The sensed information is stored in controlled way at multiple sensor nodes (e.g. node, parent node and grandparent node) which deployed using complete binary tree data structure. This reduces traffic implosion and\ud geographical overlapping. Simulation result showed improved network lifetime by 20%, target detection probability by 25%, and reduces error rate by 20%, energy efficiency, fault tolerance, and routing efficiency. We have evaluated our proposed algorithm using NS2. \u

Load Balancing Performance of Clustering Algorithms for Mobile Ad-hoc Networks

I. Introduction Routing is a very challenging task in mobile ad-hoc networks due to their peculiar characteristics like dynamic mobility, frequent disconnections, low bandwidth, low battery power, etc

COMPARATIVE PERFORMANCE ANALYSIS OF LINK RECOVERY BETWEEN EIGRP AND OSPF PROTOCOLS BASED ON SIMULATION

ABSTARCT: EIGRP and OSPF are dynamic routing protocols used in practical networks to disseminate network topology to the adjacent routers. This research is a performance comparison of link recovery between EIGRP and OSPF protocols. The performance of each routing protocol is different from each other. Among all routing Protocols, we choose EIGRP and OSPF routing protocols for doing performance evaluation for real-time traffics. The experiment is setup to find out the retransmission time and rerouting time from both protocols when there is a failure link in a data transmission path. Before there is a failure link, the average transmission times are 17.5ms with OSPF and 17.1 with EIGRP. Then the average transmission times increase to 29ms and 28.4ms for OSPF and EIGRP respectively after a link fails. Finally, the research experiment results show that EIGRP is a better than OSPF in retransmission time after a link fails