Time filter

Source Type

Maria Rayappan S.,Anna University | Easwaramurthy D.,Bsa Crescent Engineering College | Palanichamy M.,Anna University | Murugesan V.,Anna University
Inorganic Chemistry Communications | Year: 2010

Silver(I) catalyzed oxidation of amino acids such as glycine and α-alanine by peroxomonosulphate (PMS) in aqueous perchloric acid medium was found to be first order in [peroxomonosulphate] and fractional order in [amino acid] and [Ag(I)]. The rate equation was derived by assuming equilibrium formation of adduct between amino acids and Ag(I). This adduct was presumed to react with PMS in a slow step to yield (adduct)2+, which was self-oxidized in a fast step to give the products. The kinetic results revealed that silver catalyzed reaction occurred approximately 104 times faster than the uncatalyzed reaction and this is attributed to the formation of (adduct)2+. The bimolecular rate constant (k) for the slow step and the activation parameters were calculated and the results are discussed. © 2009 Elsevier B.V. All rights reserved.


Shuaib M.,Bsa Crescent Engineering College | Mumtaj I.,Bharath University
International Journal of Applied Engineering Research | Year: 2014

The state of a power system and the methods of calculating this state are extremely important in evaluating the operation of the power system, the control of this system, and the determination of future expansion for the power system. The state of the power system is determined through load flow analysis that calculates the power flowing in the lines. There are several different methods to determine the load flow for a given system. For the purpose of this paper, modified load flow procedure for radial distribution system is presented in this paper. © Research India Publications.


Prakash N.,Bsa Crescent Engineering College | Rangaswamy T.R.,Bsa Crescent Engineering College
2012 IEEE International Conference on Computational Intelligence and Computing Research, ICCIC 2012 | Year: 2012

Cost and time effective reliable test case prioritization technique is the need for present software industries. The test case prioritization for the entire program consumes more time and the selection of test case for entire software is also affecting the test performance. In order to alleviate the above problem a new methodology using modular based test case prioritization is proposed for regression testing. In this method the program is divided into multiple modules. The test cases corresponding to each module is prioritized first. In the second stage, the individual modular based prioritized test suites are combined together and further prioritized for the whole program. This method is verified for fault coverage and compared with overall program test case prioritization method. The proposed method is assessed using three standard applications namely University Students Monitoring System, Hospital Management System, and Industrial Process Operation System. The empirical studies show that the proposed algorithm is significantly performed well. The superiority of the proposed method is also highlighted. © 2012 IEEE.


Sandhya M.,Bsa Crescent Engineering College | Rangaswamy T.R.,Bsa Crescent Engineering College
Information Technology Journal | Year: 2011

This study describes the characteristics of data tampering in RFID-based information systems and a method addressing it is proposed using hashing techniques in mobile RFID environment. The proposed method requires only hash, XOR and simple calculations but can provide good security and privacy protection features. Mobile RFID-enhanced applications ("Mobile RFID") offer a unique way of interacting with the physical world by using the touch paradigm. They offer an intuitive way to interact with physical objects to which RFID transponders are attached. However, the development of mobile RFID applications is not well supported yet, in contrast to stationary RFID applications because of security and privacy related issues. A critical threat for Mobile RFID based information systems is represented by data tampering which corresponds to the malicious alteration of data recorded in the tag memory. © 2011 Asain Network for Scientific Information.


Kavitha G.,Bsa Crescent Engineering College | Sankaranarayanan V.,Bsa Crescent Engineering College
Journal of Computer Science | Year: 2011

Problem statement: Grid computing provides a virtual framework for controlled sharing of resources across institutional boundaries. In computational grids, a client application is executed on the available set of resources that satisfy the user QoS requirements. Some applications require exhaustive computation power for execution of its tasks. In general, these tasks are assigned to a single available resource on the grid that has the required computation power. Therefore, the client application waits indefinitely until a suitable resource is found. Approach: In this study a novel multiple resource selection strategy is presented, which selects multiple resources based on trust and QoS parameters and the tasks are mapped to the appropriate resources for parallel execution. Selection of resources is based on the trust value of the resource, the available computation power at the time of job submission, the speed of the connectivity link, the time deadline and the budget constraints. The proposed method performs task grouping and selects the optimum number of resources for task execution. The tasks are executed in parallel among the multiple resources and the results are aggregated and transferred to the client within the specified time deadline. Security for the user tasks is strengthened by creating a Virtual Private Network (VPN) to the selected resources and tasks are further mapped to the resources through the secured VPN channel. Results: Simulations results show that there is a significant improvement in the overall resource utilization of the grid with a high success rate of jobs and reduction in the total execution time of submitted jobs. Conclusion: The tasks are scheduled to available multiple resources with VPN security. As optimum number of resources is selected for parallel execution, the resources are utilized to a maximum and there is a reduction in the percentage of pending jobs on the grid. © 2011 Science Publications.


Kavitha G.,Bsa Crescent Engineering College | Sankaranarayanan V.,Bsa Crescent Engineering College
World Academy of Science, Engineering and Technology | Year: 2010

Grid computing provides a virtual framework for controlled sharing of resources across institutional boundaries. Recently, trust has been recognised as an important factor for selection of optimal resources in a grid. We introduce a new method that provides a quantitative trust value, based on the past interactions and present environment characteristics. This quantitative trust value is used to select a suitable resource for a job and eliminates run time failures arising from incompatible user-resource pairs. The proposed work will act as a tool to calculate the trust values of the various components of the grid and there by improves the success rate of the jobs submitted to the resource on the grid. The access to a resource not only depend on the identity and behaviour of the resource but also upon its context of transaction, time of transaction, connectivity bandwidth, availability of the resource and load on the resource. The quality of the recommender is also evaluated based on the accuracy of the feedback provided about a resource. The jobs are submitted for execution to the selected resource after finding the overall trust value of the resource. The overall trust value is computed with respect to the subjective and objective parameters.


Prakash N.,Bsa Crescent Engineering College | Rangaswamy T.R.,Bsa Crescent Engineering College
Journal of Theoretical and Applied Information Technology | Year: 2013

Software will be modified either to fix errors or to add features. The modified software should be tested with the intent of the modified parts of the software without affecting the other parts of the software. Regression testing is one of the testing techniques to ensure that the modified piece of code without affecting other parts of code. Test case prioritization is a widely used technique to conduct regression testing in effective manner. All existing prioritization techniques aims to prioritize the test cases based on certain coverage criteria. These prioritization techniques take into account any one coverage criteria (single performance goal) such as statement coverage, function coverage, path coverage, branch coverage and fault coverage. There are certain situation single performance goal will not find faults earlier using test case prioritization. So prioritization of test cases, which cover more than one criterion is an open problem. To alleviate this problem, a new weighted method is proposed to prioritize the test cases. In this method the weight is calculated based on the coverage criteria for each test case. The proposed method was empirically studied in three standard applications and the results show that the proposed method is more effective than the existing method. © 2005-2013 JATIT & LLS.All rights reserved.


Fatima N.S.,Bsa Crescent Engineering College | Khader P.S.A.,Bsa Crescent Engineering College
Information Technology Journal | Year: 2013

Now-a-days many challenges are encountered in the deployment of caching in an ad-hoc network. The traditional data caching and path caching techniques do not produce good results because of node mobility. If a new route is found and if its cache is full, then it must look for another route even if it is valid, hence a powerful replacement technique is necessary. Even if a node has utmost memory to cache information about all other nodes, it may become invalid in a short period of time due to its mobility. To eliminate the above problems, effective replacement schemes are provided along with an efficient caching technique. The main objective of this study was to upgrade the caching efficiency in a mobile network environment The cache has been made consistent and efficient. Cache memory must contain reliable data. This study proposed a Complete Cache Management (CCM) scheme which includes enhancing the cache efficiency, data replication and cache replacement. The contribution of the work is twofold. First, it provides efficient path caching by making use of Path Prefetching (PPF) algorithm. Secondly, it provides better cache consistency by Hit Count (HC) based cache replacement scheme. Simulations are conducted using ns-2 to study the performance of the system in terms of average delay and hit ratio and finally it is compared with the performance of other caching schemes for MANETs. © 2013 Asian Network for Scientific Information.


Prakash N.,Bsa Crescent Engineering College | Rangaswamy T.R.,Bsa Crescent Engineering College
European Journal of Scientific Research | Year: 2012

Effective and reliable test case prioritization technique for regression testing is necessary to ensure optimum utility and no side effect in the software after modification. Test case prioritization is rearranging the test case order based on certain constraints so that the most beneficial test cases may be executed first. Most of the existing research works on test case prioritization methods are based on single coverage criterion. A prioritized test suite which covers more than one coverage criteria is considered to be a stronger coverage goal than a test suite which covers single coverage criteria. In the proposed method test cases are prioritized based on more than one coverage criteria by merging all coverage criteria. Therefore, in a single regression testing, more than one objective is attained. In the empirical study, test cases are prioritized based on code coverage, fault coverage and path coverage using the proposed method, so that the single regression process is performed with multiple coverage criterion. The proposed method was empirically studied in three standard application and the results was shown that the proposed method is more effective than the existing method. © EuroJournals Publishing, Inc. 2012.


Revathi S.,Bsa Crescent Engineering College | Rangaswamy T.R.,Bsa Crescent Engineering College
European Journal of Scientific Research | Year: 2012

In a Mobile Ad-Hoc Network(MANET), each node can freely move around, as the network topology changes dynamically. The Ad-hoc On-demand Distance Vector routing protocol (AODV) is a familiar routing protocol in MANET. The AODV protocol works in a dynamic fashion, by establishing a route on demand and continues that route until it breaks. Due to the changing network topology of ad hoc networks, if other routes with a lesser hop count become available, the network topology is not able to adapt until the route break occurs. This paper proposes a route shortening scheme by replacing some redundant nodes in the active route with a node that is not on the active route, in a secure manner. The replaced node is continuously monitored by the neighboring and pilot nodes. The route optimization and security is incorporated to improve the performance of the AODV. The integrated protocol performs better in terms of the packet delivery ratio, average hops and packet loss. © 2012 EuroJournals Publishing, Inc.

Loading Bsa Crescent Engineering College collaborators
Loading Bsa Crescent Engineering College collaborators