Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99


Any time

2019 ( 164 )

2018 ( 248 )

2017 ( 270 )

2016 ( 353 )

Custom range...

Search Results: 1 - 10 of 189863 matches for " G. Suganya "
All listed articles are free for downloading (OA Articles)
Page 1 /189863
Display every page Item
Multi-Criteria Decision Making Using ELECTRE  [PDF]
S. A. Sahaaya Arul Mary, G. Suganya
Circuits and Systems (CS) , 2016, DOI: 10.4236/cs.2016.76085
Abstract: Requirements prioritization is one of the key factors in deciding the success of the project and hence the software industry. One of the major concerns in software prioritization techniques is that the existing ranking techniques have a very modest support to different criteria used by stakeholders to present their ranking. The current techniques are not suitable for arriving at anoptimized view of multiple stakeholders using multiple criteria. This research analyzes the issues in existing techniques. A web based decision support model using ELECTRE as the method for prioritization is proposed. ELECTRE is a multi-criteria decision making model that is proved to be effective in ranking several decision making problems. The proposed system takes input from multiple stakeholders using 100-point method. An optimized ranking is obtained using ELECTRE method. The developed system is validated using a pilot project and is found to be efficient in terms of saving cost of implementation and man-hours needed for implementation.
Design of Multiple Master ASIC Interconnect
G. Suganya,R. Muthaiah
Journal of Artificial Intelligence , 2013,
Abstract: System on Chip is composed of many Intellectual Property (IP) blocks which communicate with each other using different bus protocols. Each IP may have different native protocol. So establishing communication between these bus protocols which vary from one IP to another is of much significance. The protocols used may be either proprietary or non-proprietary. AXI 1.0 and OCP 2.0 protocols and are used to build our ASIC interconnect system. Here we establish communication between these two protocols using an AXI to OCP converter. This converter acts as a bridge between the two protocols clearing the incompatibilities for communication. We also use a clock bridge to enhance communication between IP blocks that operate at different frequencies. The numbers of masters, slaves, address and data widths are also configurable depending on the requirement. The AXI master, AXI to OCP converter, Clock Bridge, OCP master, OCP slaves, arbiter and address decoder are designed using VHDL and synthesized.
D. Suganya Devi,Dr. G.Padmavathi
International Journal on Applications of Graph Theory in Wireless ad hoc Networks and Sensor Networks , 2010,
Abstract: Secure multicast communication in Mobile Adhoc Networks (MANETs) is challenging due to its inherentcharacteristics of infrastructure-less architecture with lack of central authority, limited resources such asbandwidth, energy and power. Several group oriented applications over MANETs create new challengesto routing protocols in terms of QOS requirements. In many multicast interactions, due to its frequentnode mobility, new member can join and current members can leave at a time. It is necessary to choose arouting protocol which establishes true connectivity between the mobile nodes. The pattern of movementof members is classified into different mobility models and each one has its own distinct features. It is acrucial part in the performance of MANET. Hence key management is the fundamental challenge inachieving secure communication using multicast key distribution for mobile adhoc networks. This paperdescribes the impact of mobility models for the performance of a new cluster-based multicast treealgorithm with destination sequenced distance vector routing protocol in terms of QOS requirementssuch as end to end delay, energy consumption and key delivery ratio. For simulation purposes, threemobility models are considered. Simulation results illustrate the performance of routing protocol withdifferent mobility models and different mobility speed under varying network conditions.
Efficient Cluster Based Multicast Tree for Secure Multicast Communication for Mobile Ad Hoc Networks
D.Suganya Devi,Dr. G.Padmavathi
International Journal of Engineering Science and Technology , 2010,
Abstract: Secure multicast communication in mobile adhoc networks is challenging due to its inherent characteristics of infrastructure-less architecture with lack of central authority, limited resources such as bandwidth, time and power. Hence key management is the fundamental challenge in achieving secure communication using multicast key distribution in mobile adhoc networks. In many multicast interactions, due to its frequent node mobility, new member can join and current members can leave at a time due to node failure which causes delay in multicast transmission. This paper proposes a new efficient cluster based multicast tree (CBMT) algorithm for secure multicast Communication, in which source node uses Multicast version of Destination Sequenced Distance Vector(MDSDV) routing protocol to collects its 1 hop neighbors to form cluster and each node which have child node is elected as the Local controllers of the created clusters. It also tolerates the faults that causes due to failure of nodes. Simulation results shows the demonstration of CBMT using MDSDV have better system performance in terms of end to end delay and fault tolerance rate under varying network conditions.
Email Spam Filtering using Supervised Machine Learning Techniques
International Journal on Computer Science and Engineering , 2010,
Abstract: E-mail spam, known as unsolicited bulk Email (UBE), junk mail, or unsolicited commercial email (UCE), is the practice of sending unwanted e-mail messages, frequently with commercial content, in large quantities to an indiscriminate set of recipients. Spam is prevalent on the Internet because the transaction cost of electronic communications is radically less than any alternate form of communication. There are many spam filters using different approaches to identify the incoming message as spam, ranging from white list / black list, Bayesian analysis, keyword matching, mail header analysis, postage, legislation, and content scanning etc. Even though we are still flooded with spam emails everyday. This is not because the filters are not powerful enough, it is due to the swift adoption of new techniques by the spammers and the inflexibility of spamfilters to adapt the changes. In our work, we employed supervised machine learning techniques to filter the email spam messages. Widely used supervised machine learning techniques namely C 4.5 Decision tree classifier, Multilayer Perceptron, Na ve Bayes Classifier are used for learning the features of spam emails and the model is built by training with known spam emails and legitimate emails. The results of the models are discussed.
Content Based Segregation of Pertinent Documents Using Adaptive Progression  [PDF]
Perumal Pitchandi, Sreekrishna Muthukumaravel, Suganya Boopathy
Circuits and Systems (CS) , 2016, DOI: 10.4236/cs.2016.78160
Abstract: Due to the emerging technology era, today a number of firms share their service/product descriptions. Such a group of information in the textual form has some structured information, which is beneath the unstructured text. A new attainment which facilitates the form of a structured metadata by recognizing documents which are likely to have some type and this information is then used for both segregation and search process. The idea of this advent describes some attributes of a text that will match with the query object which acts as identifier both for segregation as well as for storage and retrieval. An adaptive technique is proposed to deal with relevant attributes to annotate a document by satisfying the users querying needs. The solution for annotation-attribute suggestion problem is not based on the probabilistic model or prediction but it is based on the basic keywords that a user can use to query a database to retrieve a document. Experiment results show that Querying value and Content Value approach is much useful in predicting a tag for a document and thus prediction is also based on Querying value and Content value which greatly improves the utility of shared data which is a drawback in the existing system. This approach is different, as we consider only the basic keywords to be matched with the content of a document. When compared with other approaches in the existing system, Clarity is a primary goal as we expect that the annotator may improve the annotations on process. The discovered tags assist on quest of retrieval as an alternative to bookmarking.
Elimination of Silent Data Corruption by Improved Error Detection using Difference Set Codes for Memories
International Journal of Engineering and Advanced Technology , 2013,
Abstract: Now-a-days, the memory devices are susceptible to Single Event Upsets (SEU) which is one of the soft errors due to radiation effects. Though several error correcting codes (ECC) are available, the simplest and effective ECC for memory application is Difference Set Cyclic Codes (DSCC). These codes are Majority logic decodable codes. This method of error correction will lead to Silent Data Corruption (SDC) in which the additional errors beyond the code’s correction capability are not detected. This SDC will provide faulty word after decoding which actually looks like error free corrected word. This is because the existing method assumes that the input word contains error which is less than the error correction capability and it tends to correct the additional errors, resulting in wrong output. The proposed algorithm will eliminate the SDC and detect the any number of additional errors. The proposed algorithm is coded in VHDL and simulated using Modelsim and Xilinx ISE simulator
Simulated Annealing based Optimization Model for the Gossamer Protocol
Rama N.,Suganya R.
International Journal of Engineering Science and Technology , 2010,
Abstract: The use of low cost passive RFID tags has become very prevalent. Lightweight cryptography has evolved to address the security issues in these tags. The Gossamer protocol is a lightweight mutualauthentication protocol which has guaranteed considerable security in these passive tags. As power is a major constraint in these tags, a detailed analysis of the power consumed by the Gossamer protocol was undertaken and results presented. It was determined that optimizing the power consumed by the protocol can result in substantial power savings and hence significantly enhance the performance of the RFID system. This paper proposes a new optimization model based on the simulated annealing method, that ensures the bounding of the number of power-crunching operations carried out in each run of the Gossamer protocol. The validity of the model is also established by the presentation and discussion of an experimental instance.
SSL-MAP: A More Secure Gossamer-based Mutual Authentication Protocol for Passive RFID Tags
Rama N,Suganya R.
International Journal on Computer Science and Engineering , 2010,
Abstract: RFID systems that employ passive RFID tags, are run using lightweight protocols. The Gossamer protocol is a case in point. However, it is found that the Gossamer protocol uses rather simple operations, in order to ensure that the protocol is lightweight. This raises security concerns. A protocol based on the Sign/Logarithm number system to make it power-efficient, and the efficient use of one-dimensional convolution to secure the transmission of the tag’s ID value, is proposed. Thus, a protocol that is power-efficient and more secure than the Gossamer protocol is proposed. Further, this protocol may be used even in the basic passive tag, which has minimal processing capability and no power source of its own.
Kumari Arati,Suganya. S
International Journal of Advances in Engineering and Technology , 2012,
Abstract: This paper presents a high- speed and wide-range parallel counter that achieves high operating frequencies through a pipeline partitioning methodology (a counting path and state look-ahead path), using only three simple repeated module types: an initial module generates anticipated counting states for higher significant bit modules through the state look-ahead path , simple D-type flip-flops, and 2-bit counters. The state look-ahead path prepares the counting path’s next counter state prior to the clock edge such that clock edge triggers all modules simultaneously, thus concurrently updating the count state with a uniform delay at all counting path modules/stages with respect to the clock edge. The structure is scalable to arbitrary N-bit counter widths using only the three modules types and no fan-in or fan-out increase. The proposed architecture is verified by verilog HDL in ModelSim.
Page 1 /189863
Display every page Item

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