Time filter

Source Type

Maheswaran D.,TNPLTamilnadu | Rajasekar N.,VIT UniversityTamilnadu | Priya K.,VIT UniversityTamilnadu | Ashok Kumar L.,PSG College of Technology
Journal of Electrical Engineering and Technology | Year: 2015

Pulse Width Modulation (PWM) techniques are increasingly employed for PWM inverter fed induction motor drive. Among various popular PWM methods used, Selective Harmonic Elimination PWM (SHEPWM) has been widely accepted for its better harmonic elimination capability. In addition, using SHEPWM, it is also possible to maintain better voltage regulation. Hence, in this paper, an attempt has been made to apply Bacterial Foraging Algorithm (BFA) for solving selective harmonic elimination problem. The problem of voltage harmonic elimination together with output voltage regulation is drafted as an optimization task and the solution is sought through proposed method. For performance comparison of BFA, the results obtained are compared with other techniques such as derivative based Newton-Raphson method, and Genetic Algorithm. From the comparison, it can be observed that BFA based approach yields better results. Further, it provides superior convergence, reduced computational burden, and guaranteed global optima. The simulation results are validated through experimental findings. © The Korean Institute of Electrical Engineers


Govinda K.,VIT UniversityTamilnadu | Sarin V.,BITS Pilani K.K Birla Goa Campus | Monalika,BITS Pilani K.K Birla Goa Campus
International Journal of Pharmacy and Technology | Year: 2016

Telemedicine has become an essential tool for health professionals and for patients. It offers major possibilities for diagnosis,surgery,medical follow-up and for second opinion. Health data concerning patients are circulated via web applications like cloud. In the world of telemedicine,there are various security issues that relate to data that are really critical. This data set ranges from personal patients information,physicians and examinations. Aspects like confidentiality,integrity and availability of the data should be preserved. An important part of solving the problem of integrity would require accountability for every data modification; this is where audit trails come into play. This paper presents an architecture and process for auditing data stored in cloud. © 2016,International Journal of Pharmacy and Technology. All rights reserved.


Ezhilmaran D.,VIT UniversityTamilnadu | Muthukumaran V.,VIT UniversityTamilnadu
International Journal of Pharmacy and Technology | Year: 2016

The conjugacy search problem in a group G is the problem of recovering an x ϵ G from given g ϵ G and h=x-1gx. Ko et al. proposed a new public key cryptosystem on braid groups based on the hardness of the conjugacy problem. The foundation of this system is quite different from widely used cryptosystems on number theory, even if there are some similarities in design. Most of the authentication and signature schemes, such as digital signature scheme, blind signature scheme, proxy blind signature, Zero-knowledge Undeniable Signature Scheme which are based on conjugacy problem are computationally hard. In this article, we review the different types of conjugacy problems used in the various schemes of cryptography. © 2016, International Journal of Pharmacy and Technology. All Rights Reserved.


Deepa M.,VIT UniversityTamilnadu | Santhi K.,VIT UniversityTamilnadu | Benjula Anbu Malar M.B.,VIT UniversityTamilnadu | Lawanya Shri M.,VIT UniversityTamilnadu
International Journal of Pharmacy and Technology | Year: 2016

In wireless sensor network the mobility of the sensor nodes are the basis of information gathering and passing of information and this wireless architecture has its own advantage and disadvantage. Wireless nodes can be easily laid architecture but at the same time its vulnerable to various attacks. the mobile nodes of the wireless networks are easily attacked by attaker and its vulnerable to changes and thus cause wrong information passing and it makes final decision made by the fusion center very much wronger and that shud be avoided completely. so we use adaption fusion technique which uses q out of m rule. © 2016, International Journal of Pharmacy and Technology. All rights reserved.


Roy K.,VIT UniversityTamilnadu | Brindha K.,VIT UniversityTamilnadu | Kumar S.S.,VIT UniversityTamilnadu
International Journal of Pharmacy and Technology | Year: 2016

Optimization compiler means that the compiler tries to minimize the execution time, memory usages, and code length and power requirement. But within that parameter the execution time is the most important parameter whereas the memory usage is almost negligible nowadays. After the popularity of portable computer systems like laptops, palmtops, Tablets etc. another major optimization parameter has become the power consumption. That means using minimum numbers of resources how the program can be successfully executed without alteration of the final outcome. Peephole optimization is widely used optimization technique still yet in the field of compiler optimization. It is the technique based on string pattern matching using regular expression and replacing a piece of code with the equivalent piece of code which is shorter and faster than the original one. However the efficiency of a compiler depends on the machine architecture, target application and compilation environment. So optimization technique is to get a way which could balance all those parameters. Nowadays excluding the peephole optimization technique there are lot of other which is dedicated to get a balanced strategy among those parameters. So in this paper we have discussed about those methods with their pros and cons. As far in this field no technique is perfect for all situations, different strategies are healthy for different situations. We have also discussed those situations where a strategy, depending on parameter can give us a better result compare to others and also cannot be a good for any other parameters. In this paper we have also proposed a new technique of parallel execution in multicore system. Basically the technique depends on the dependencies of instruction on each other and according to those dependencies we have segmented the code, so that they can be executed parallel without affecting the final outcome. The details is in our proposed algorithm section. © 2016, International Journal of Pharmacy and Technology. All rights reserved.


Samal S.,VIT UniversityTamilnadu | Pradeep Reddy C.H.,VIT UniversityTamilnadu | Bharath Bhushan S.,VIT UniversityTamilnadu
International Journal of Pharmacy and Technology | Year: 2016

The MANETs are infrastructure-less systems having no central server. MANETs can be used in different areas such as sensor networks,military battlefield,PANs and disaster area network etc. The mobile nodes used in the MANETs are small and weight is light. These nodes (hosts) are supplied by limited power resources such as batteries. There are many traditional routing protocols such as DSR,AOD,TORA etc,but they do not deal with the energy consumption in the mobile nodes. They only consider about the routing that is how to establish a path between source to destination by avoiding the energy constraints. So here in this paper we propose a new method by modifying the traditional AODV protocol called EPRAODV routing protocol which will introduce a power efficient plan in the MANETs. In this method we are going to add one additional parameters like energy in the header of the route request packet. We implement our proposed protocol EPRAODV by studying through simulation using NS-2. The simulation results show that the EPRAODV is able to provide more power efficiency and as well as throughput than AODV over the lifetime of the system and also drag out the lifetime of the each connection. © 2016,International Journal of Pharmacy and Technology. All rights reserved.


Gaikwad A.,VIT UniversityTamilnadu | Pradeep Ready C.H.,VIT UniversityTamilnadu | Bharath Bhushan S.,VIT UniversityTamilnadu
International Journal of Pharmacy and Technology | Year: 2016

Vehicular Ad Hoc Networks (VANETs) are made by applying the standards of Mobile Ad hoc Networks (MANETs) the unconstrained production of a remote system for information trade to the space of vehicles. They are a key part of intelligent transportation frameworks. Public Key Infrastructure (PKI) with hashing mechanism can be used to secure VANETs where the tamper proof device stores a number of encryption keys which are renewed upon visiting a Trusted Authority (TA).The proposed system is an endeavour to upgrade the current authentication,privacy preservation and non-repudiation with keyed hashing mechanism. Proficient Message Authentication Protocol can on a very basic level decrease the message loss ratio on account of the message check delay compared and the existing authentication systems using Certification Revocation List (CRL).In this process we are using Hash Message Authentication Protocol (HMAP) where a key is utilized to calculating encryption and decryption with hash message using Elliptical Curve Cryptographic (ECC) function which is shared just between non revoked On-Board Units (OBUs).In this paper,the analysis of performance evaluation and security of the proposed hashing mechanism is investigated analytically and through network simulation. Hence,extensive analysis is performed to demonstrate how the proposed mechanism can dynamically support efficient and cost-reduced keyed hash message authentication. The final results will be shown by graphs generated on the NS2 simulator. © 2016,International Journal of Pharmacy and Technology. All rights reserved.


Santhi K.,VIT UniversityTamilNadu | Deepa M.,VIT UniversityTamilNadu | Lawanya Shri M.,VIT UniversityTamilNadu | Benjula Anbu Malar M.B.,VIT UniversityTamilNadu
International Journal of Pharmacy and Technology | Year: 2016

In Cloud Computing,a basic application is to source the knowledge to outside cloud servers for climbable knowledge storage. The outsourced knowledge,however,have to be compelled to be encrypted because of the privacy and secrecy issues of their owner. This leads to the well-known difficulties on the accurate search over the encrypted cloud knowledge. To tackle this issue,during this paper,we have a tendency to develop the searchable coding for multikeyword hierarchal search above the storage knowledge. The main aim of this paper is to preserve the outsourced data in cloud through gateway encryption and blind storage,and to implement multi keyword ranked search over the encrypts data in a safe way by NLP method without has download and decrypts the entire group of member file contents. © 2016,International Journal of Pharmacy and Technology. All rights reserved.


Ezhilmaran D.,VIT UniversityTamilnadu | Muthukumaran V.,VIT UniversityTamilnadu
Gazi University Journal of Science | Year: 2016

There are several public key cryptosystem around that use computational hardness of either conjugacy search problem or the word problem for non-abelian groups. In this paper we use decomposition problem in near-ring to construct a public key cryptosystem and improved the security of key establishment protocol based on the decomposition problem. © 2016 Gazi University Eti Mahallesi. All rights reserved.


Deepa M.,VIT UniversityTamilnadu | Santh K.,VIT UniversityTamilnadu | Malar M.B.B.,VIT UniversityTamilnadu | Lawanya Shri M.,VIT UniversityTamilnadu
International Journal of Applied Engineering Research | Year: 2015

The paper mainly describes Photo OCR [1], automated system software for text- extraction from images or simple character recognition feature. The focus is mainly on reliable text-extraction from cellular phone imagery, for text recognition as input from user similar to speech recognition. Generally the commercial application of OCR does not perform well on this task. The Recent progresses on machine learning has shown improved character isolation classification therefore the paper deals on this progress by displaying complete OCR system software by different techniques by identifying text from uncontrolled conditions like blurred images or from non-readable text documents. We also incorporate various font identification schemes for reading and extracting text from each and every fonts by fixing the boundaries before training the dataset. The approach described is capable of identifying text from images in a variety of challenging imaging conditions where commercial available OCR systems fail, notably in the presence of lighter resolution, high image noise, low contrast and other distortions that take place in an image. The software works with latency that is low and has mean time for processing nearly 650 Ms per image. The software for the Photo-OCR is evaluated public benchmark data-sets for text extraction and performs for all results, taken place through survey. The Photo-OCR system can be used with many applications like Android from Google. © Research India Publications.

Loading VIT UniversityTamilnadu collaborators
Loading VIT UniversityTamilnadu collaborators