Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99


Any time

2019 ( 107 )

2018 ( 175 )

2017 ( 167 )

2016 ( 285 )

Custom range...

Search Results: 1 - 10 of 130592 matches for " V. Anitha "
All listed articles are free for downloading (OA Articles)
Page 1 /130592
Display every page Item
Comparative study of Braun’s Multiplier Using FPGA Devices
Anitha R,,Bagyaveereswaran V
International Journal of Engineering Science and Technology , 2011,
Abstract: The development cost for ASIC are high, algorithms should be verified and optimized before implementation. To decrease computational delay and improve resource utilization, bypassing techniques are beapplied and braun-arhitectured multiplier is compared with its architectural modification i.e. Column-bypassing and Row-bypassing architectures and the full adder structure has been replaced by the fast adder. The architectures have been implemented on Spartan 3E, Virtex 5 and Virtex 6 LowerPower. Virtex 5 showed the best performance whereas column-bypassed multiplier has the best performance among the three architectures using Xilinx ISE and Verilog HDL.
V.Anitha Moses
International Journal of Engineering Trends and Technology , 2011,
Abstract: The software solution for banking e-gateway to success is used for banking online examination. It is an XML (Extended Markup Language) based application. Since it is developed as a generic application, it can be used for any online examination. Objective type questions are uploaded in xml format. XML schema is used to validate the XML. The person undergoing examination can select any question paper from the available set of questions. It also displays the unattended question for the employee to attend if time exists. As soon as the time expires the system takes the responsibility of submitting the answer paper and generates the result. Results will be displayed on same window and it is send to candidate mail id and manager mail id. Person working under the organization can also use the system to undergo practice exams which helps to increase the performance and to manage the time for similar competitive examinations.
Braun’s Multiplier Implementation using FPGA with Bypassing Techniques.
Anitha R,Bagyaveereswaran V
International Journal of VLSI Design & Communication Systems , 2011,
Abstract: The developing an Application Specific Integrated Circuits (ASICs) will cost very high, the circuits shouldbe proved and then it would be optimized before implementation. Multiplication which is the basic buildingblock for several DSP processors, Image processing and many other. The Braun multipliers can easily beimplemented using Field Programmable Gate Array (FPGA) devices. This research presented thecomparative study of Spartan-3E, Virtex-4, Virtex-5 and Virtex-6 Low Power FPGA devices. Theimplementation of Braun multipliers and its bypassing techniques is done using Verilog HDL. We areproposing that adder block which we implemented our design (fast addition) and we compared the resultsof that so that our proposed method is effective when compare to the conventional design. There is thereduction in the resources like delay LUTs, number of slices used. Results are showed and it is verifiedusing the Spartan-3E, Virtex-4 and Virtex-5 devices. The Virtex-5 FPGA has shown the good performanceas compared to Spartan-3E and Virtex-4 FPGA devices.
An Overview: Security in Virtualization Technology
V. Anitha,N. Keerthana
Journal of Artificial Intelligence , 2013,
Abstract: In IT industries, securing the data plays a vital role. The aim of the study is to improve the security in virtualization technologies. Now-a-days IT industries prefer virtualization methods because it provides high security with low cost. The organizations enhance their security by providing different method through virtualization technology. This study explains the security in major virtualization technologies such as KVM, Xen, VMware and Microsoft.
Humanising Language Learning: Blending Learning in SLA
D. Ravikumar,V. Anitha Devi
Humanising Language Teaching , 2012, DOI: 17559715
A Mobile Target Tracking and Data-Centric Sensor Using Wireless Network
V.Vijayadeepa,P. Anitha
International Journal of Soft Computing & Engineering , 2012,
Abstract: In data-centric sensor networks, sensor data is not necessarily forwarded to a central sink for storage; instead, the nodes themselves serve as a distributed in-network storage, collectively storing sensor data and waiting to answer user queries. A key problem in designing such a network is how to map data and queries to their corresponding rendezvous nodes so that a query can nd its matching data quickly and ef ciently. Existing techniques are mostly aimed to address a certain type of queries. Both resource allocation and reactive resource allocation problems in multi- server data-centric sensor(DCS) to attack Poisson process. A queuing network, where multi servers at each service station are allocated, and also each activity of a project is operated at a devoted service station with only one server located at a node of the network. The problem is formulated as a multi-objective optimal control problem that involves four conflicting objective functions. The objective functions are the project direct cost (to be minimized), the mean of project completion time (min), the variance of project completion time (min), and the probability that the project completion time does not exceed a certain threshold (max). It is impossible to solve this problem, optimally. Therefore, we apply a genetic algorithm for numerical optimizations of constrained problems to solve this multi-objective problem.
Secured Message Transmission in Mobile AD HOC Networks through Identification and Removal of Byzantine Failures
V. Anitha,Dr. J. Akilandeswari
Computer Science , 2011,
Abstract: The emerging need for mobile ad hoc networks and secured data transmission phase is of crucial importance depending upon the environments like military. In this paper, a new way to improve the reliability of message transmission is presented. In the open collaborative MANET environment, any node can maliciously or selfishly disrupt and deny communication of other nodes. Dynamic changing topology makes it hard to determine the adversary nodes that affect the communication in MANET. An SMT protocol provides a way to secure message transmission by dispersing the message among several paths with minimal redundancy. The multiple routes selected are known as APS -Active Path Set. This paper describes a technique for fault discovery process to identify Byzantine failures which include nodes that drop, modify, or mis-route packets in an attempt to disrupt the routing service. An adaptive probing technique detects a malicious link through binary search and according to the nodes behavior, these links are avoided in the active path by multiplicatively increasing their weights. The proposed scheme provides secure communication even with increased number of adversaries.
Trust Management in Grid-Trust Assessment and Trust Degree Calculation of a Resource—A Novel Approach  [PDF]
Avula Anitha
Journal of Computer and Communications (JCC) , 2015, DOI: 10.4236/jcc.2015.36005
Abstract: Grid Computing is concerned with the sharing and coordinated use of diverse resources in distributed Virtual Organizations. This introduces various challenging security issues. Among these trusting, the resources to be shared and coordinated with the dynamic and multi-institutional virtual organization environment becomes a challenging security issue. In this paper, an approach for trust assessment and trust degree calculation using subjective logic is suggested to allocate the Data Grid or Computational Grid user a reliable, trusted resource for maintaining the integrity of the data with fast response and accurate results. The suggested approach is explained using an example scenario and also from the simulation results. It is observed that there is an increase in the resource utilization of a trusted resource in contrast to the resource which is not trusted.
Job Scheduling Using Coupling in Grid  [PDF]
Avula Anitha
Journal of Computer and Communications (JCC) , 2015, DOI: 10.4236/jcc.2015.310001
Abstract: The grid computing main concern is to use the resources efficiently. For achieving this many grid resource scheduling algorithms are used for the efficient use of unused resources, especially CPU. The scheduling algorithms assign single complete job to a single resource. Instead, if these algorithms consider the degree of dependency among the modules of a job, they can be allocated parallel to the different resources. This reduces the completion time of the job and the resources can be utilized to its maximum extent. Towards this, the job scheduling using coupling algorithm is proposed. This algorithm puts forward the idea of considering the coupling degree while allocating the modules of a job parallel to different resources. In this algorithm, resource selection is done by using both its functional and non-functional properties. The algorithm works in 3 phases. It groups the interdependent modules of a job into different sets using coupling in the first phase. It checks the non-functional property i.e. availability of a resource using echo procedure in the second phase and in the third phase, the sets created in first phase, are allocated parallel to different available and matching resources. From the simulation results it is observed that job scheduling using coupling algorithm gives better performance in terms of reduced turnaround time as compared to First Come First Served, Largest Task First and Minimum Execution Time scheduling algorithms.
An Efficient Agglomerative Clustering Algorithm for Web Navigation Pattern Identification  [PDF]
A. Anitha
Circuits and Systems (CS) , 2016, DOI: 10.4236/cs.2016.79205
Abstract: Web log mining is analysis of web log files with web page sequences. Discovering user access patterns from web access are necessary for building adaptive web servers, to improve e-commerce, to carry out cross-marketing, for web personalization, to predict web access sequence etc. In this paper, a new agglomerative clustering technique is proposed to identify users with similar interest, and to determine the motivation for visiting a website. Using this approach, web usage mining is done through different stages namely data cleaning, preprocessing, pattern discovery and pattern analysis. Results are given to explain how this approach produces tight usage clusters than the existing web usage mining techniques. Rather than traditional distance based clustering, the similarity measure is considered during clustering process in order to reduce computational complexity. This paper also deals with the problem of assessing the quality of user session clusters and cluster validity is measured by using statistical test, which measures the distances of clusters distributions to infer their dissimilarity and distinguish level. Using such statistical measures, it is proved that cluster accuracy is improved to the extent of 0.83, over existing k-means clustering with validity measure 0.26, FCM (Fuzzy C Means) clustering with validity measure 0.56. Rough set based clustering with validity measure 0.54 Generation of dense clusters is essential for finding interesting patterns needed for further mining and analysis.
Page 1 /130592
Display every page Item

Copyright © 2008-2017 Open Access Library. All rights reserved.