Refine your search
Co-Authors
- P. Krishnakumari
- G. Shanmugarathinam
- Rajkumar J. Bhojan
- Subramanian Ganesan
- Pankaj Moses Monickaraj
- J. B. Rajkumar
- R. Ganesan
- J. I. Sheeba
- K. Prabha
- S. Sukumaran
- M. Thenmozhi
- K. Balachandar
- T. Sathyabama
- M. Prabhavathi
- Balika J. Chelliah
- P. Jeni
- R. Lakshmi
- B. Senthilnathan
- E. Bhavya
- Masilamani
- B. Swarna Priya
Journals
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Vivekanandan, K.
- Discrete Wavelet Transformation of an Image Based on Genetic-algorithm Clustering
Abstract Views :373 |
PDF Views:88
Authors
Affiliations
1 School of management, Bharathiar University, Coimbatore, Tamilnadu, IN
2 Department of Computer Science, Sri Ramakrishna College of Arts and Science for Women , Coimbatore -641044, IN
1 School of management, Bharathiar University, Coimbatore, Tamilnadu, IN
2 Department of Computer Science, Sri Ramakrishna College of Arts and Science for Women , Coimbatore -641044, IN
Source
Indian Journal of Science and Technology, Vol 1, No 3 (2008), Pagination: 1-5Abstract
In this paper the image compression problem is analyzed using genetic clustering algorithms based on the pixels of the image. The main problem to solve is to find an algorithm that performs the clustering efficiently. The possibility of solving clustering problems with genetic algorithms provides optimal solution. The present work makes use of genetic clustering algorithms to obtain an ordered representation of the image and then applies the DWT (Discrete Wavelet Transformation) to compress the image. The image quality is measured using PSNR measure. The genetic algorithm (GA)-based compression image has more PSNR value compared to the image without GA. It shows that the quality of the image is good for GA based compression. Also it reduces the problem of memory utilization efficiently due to compression and at the same time quality of the image is maintained due to GA.Keywords
Genetic Algorithms, Clustering, Image Compression, Discrete Wavelet TransformationFull Text
References
- Arrival R, Faloutsos C, and Swami A (1993) Efficient Similarity Search in Sequence Databases. In: Proceedings of the 4th Int'l Conference on Foundations of Data Organization and Algorithms, Chicago, pp: 69- 84.
- Aldenferder M and Blashfield R (1984) Cluster Analysis, Sage Publications, Beverly Hills.
- Bhuyan J (1991) Genetic algorithm for clustering with an ordered representation.In: Proceedings of Fourth International Conference on Genetic Algorithms, pp: 408-415.
- Brown D, Huntley R and Spillane C (1989) A parallel genetic heuristic for the quadratic assignment problem. In: Proceedings of third international Conference on Genetic Algorithms, pp: 406-415.
- Chen Y, Nako Z and Arakaki K (1999) Restoration of grey images based on a genetic algorithm with laplacian constraint. In: Fuzzy sets and systems, 103.
- . Chiu C and Liu P (1996) Image reconstruction of a perfectly conducting cylinder by the genetic algorithm. IEEE Proc.-Microw. Antennas Propag. 143 (3 ), 40-46.
- Conforto S. et al. (1995) High-quality compression of echo graphic images by neural networks and vector quantization. Med. Biol. Eng. Computations. 33 (5), 695- 698.
- Faloutsos C, Ranganathan M, and Manolopoulos Y, (1994) Fast subsequence matching in time-series databases. In: Proceedings of the 1994 ACM SIGMOD International Conference on Management of Data, Minneapolis, pp: 419-429.
- Goldberg DE (1989)Genetic algorithms in search, optimization and machine Learning, Addison –Wesley.
- Gordon A and Henderson J (1977) An algorithm for Euclidean sum of squared Classifications. Biometric. 33, 355- 362.
- Holland JH (1975) Adaptation in Natural and artificial systems, Univ. of Michigan Press, Ann Arbor, Mich.
- Hsieh CH and Tsai JC (1996) Lossless compression of VQ index with search-order coding. IEEE Trans. Image Process. 5 (11), 1579-1582.
- Hwang W and Hong S (1999) Genetic entropyconstrained vector quantiser design Algorithm. Opt. Eng.38, 12-19
- Ismail M and Kamel M (1989) Multidimensional data clustering utilizing hybrid search strategies. Pattern Recognition. 22 (1) 75-89.
- Karayiannis NG and Pai PI (1996) Fuzzy algorithms for learning vector Quantization. IEEE Trans. Neural Networks. 7 (5), 1196-1211.
- Karayiannis NG and Pai PI (1995) Fuzzy vector quantization algorithms and their application in image compression. IEEE Trans. Image Process. 4 (9), 1193-1201.
- Klein R and Dubes D (1989) Experiments in projection and clustering by simulated annealing. Pattern Recognition. 22, 213-220.
- Kin Pong Chan and Ada Wai-Chee Fu (1999) Efficient time series matching by Wavelets. In: Proceedings of the 15th International Conference on Data Engineering 23-26 March 1999, IEEE Computer Society, Sydney, Australia, pp: 126-133.
- Lo SB et al. (1996) On optimization of orthonormal wavelet decomposition: implication of data accuracy, feature preservation, and compression. SPIE Proc. 27, 201-214.
- Mohsenian.N, Rizvi SA and Nasrabadi NM (1993) Predictive vector quantization using a neural network approach. Opt. Eng. 32 (7), 1503-1513.
- Sexton RS and Gupta JND (2000) Comparative evaluation of genetic algorithm and back propagation for training neural networks. Information Sciences. 129, 45-49.
- Sheikh HR, Bovik AC, Cormack L, and Wang Z (2003) LIVE image quality assessment database. http://live.ece.utexas.edu/research/ quality.
- Burrus SC, Gopinath RA, and Haitao Guo (1998) Introduction to Wavelets and Wavelet Transforms, A Primer, Prentice-Hall, Inc.
- Moore F (2005) Genetic algorithm for optimized reconstruction of quantized signals, IEEE congress on evolutionary computation ,1,105- 111
- Michael Peterson ( 2007) A satellite image set for the evolution of image transforms for defense applications , Proceedings of the 2007 GECCO conference companion on Genetic and evolutionary computation, United Kingdom, 2137 - 2144
- Performance Analysis of Cache Consistency Maintenance in Mobile Environment using Agent Technique
Abstract Views :397 |
PDF Views:0
Authors
Affiliations
1 Bharathiar University, Coimbatore, Tamil Nadu, IN
2 Bharathiar Uuniversity, Coimbatore, Tamil Nadu, IN
1 Bharathiar University, Coimbatore, Tamil Nadu, IN
2 Bharathiar Uuniversity, Coimbatore, Tamil Nadu, IN
Source
Indian Journal of Science and Technology, Vol 6, No 11 (2013), Pagination: 5474–5479Abstract
This paper illustrates three Agents Based Techniques namely, Thread Based Cache Consistency Model, Multiple Server Cache Consistency Model, and Cluster Based Cache Consistency Models used to solve the problems of cache consistency maintenance and also compared with existing method. The drawbacks of existing method are latency, excessive bandwidth wastage, query delay, server overloads as well as network traffic. In the Thread Based Cache Consistency Model, the log is maintained in both server and client, it is easy for server as well as client to make their data object reliable. Agents at server and client make an internal request response operation(s) to access or update data object. It is easy to update the cached data and as well to maintain consistency between client and server. The Multiple Server Cache Consistency Models where the node is designed as a middle server (master client cache) between server and clients, some of the client data cache is placed in a middle server. The middle server is near the client, as result the communication cost and energy consumption is comparatively less. It reduces server’s workload. The Cluster Based Cache Consistency Model designed as a Cluster head node between the server and the client using agent technique, effectively reduces the query latency. These three Agent Based Models are implemented in Ns2 and their performance was analysed and compared with existing method. Agent Based Technique resulted in better performance in relation to update delay, through various numbers of nodes and update rate.Full Text
References
- Duvvuri V, Shenoy P et al. (2003). Adaptive leases: a strong consistency mechanism for the world wide web, IEEE Transaction of Knowledge Data Engineering, vol 15(4), 1266–1276.
- Madhukar A, and Alhajj R (2006). An adaptive energy efficient cache invalidation scheme for mobile databases, Proceedings of the 2006 ACM Symposium on Applied Computing (SAC), Dijon, France.
- Mershad K, and Artail H (2010). Smart server update mechanism for maintaining cache consistency in mobile environments, IEEE Transaction on Mobile Computing, vol 9(6), 778–795.
- Fawaz K, and Artail H (2013). Distributed cache invalidation method for maintaining cache consistency in wireless mobile networks, IEEE Transaction on Mobile Computing, vol 12(4), 680–693.
- Shen H, Kumar M et al. (2004). Energy efficient caching and prefetching with data consistency in mobile distributed systems, Proceedings of the 18th International Parallel and Distributed Processing Symposium.
- Huang Y, Cao J et al. (2010). Flexible cache consistency Maintence over Wireless Adhoc Networks, IEEE Transaction on Parallel and Distributed System, vol 21(8), 1150–1161.
- Chang C-Y, and Chen M-S (2002). Exploring aggregate effect with weighted transcoding graphs for efficient cache replacement in transcoding proxies, Proceedings of the 18th International Conference on Data Engineering. 383–392.
- Hartung E F, Horn U et al. (2001). Streaming technology in 3G mobile communication systems, Computer, vol 34(9), 46–52.
- Wang Z, Kumar M et al. (2006). Dynamic cache consistency schemes for wireless cellular networks, IEEE Transactions on Wireless Communications, vol 5, No. 1, 366–376.
- Imielinski T, and Badrinath B R (2002). Wireless graffiti–data, data everywhere matters, Proceedings of 28th International Conference on Very Large Data Bases.
- Kahol A, Khurana S et al. (2001). A strategy to manage cache consistency in a distributed disconnected wireless environment, IEEE Transactions on Parallel and Distributed Systems, vol 12(7), 686–700.
- Yeung M K H, and Kwok Y-K (2009). Wireless cache invalidation schemes with link adaptation and downlink traffic, IEEE Transactions on Mobile Computing, vol 4(1), 68–83.
- Tolia N, and Wolbach A (2003). Improving mobile database access over wide-area networks without degrading consistency, Proceedings of MobiSys ‘07 Proceedings of the 5th International Conference on Mobile Systems, Applications and Services, 71–84.
- Service based Mobile Test Automation Framework for Automotive HMI
Abstract Views :172 |
PDF Views:0
Authors
Affiliations
1 Wipro Technologies, Bangalore - 560100, IN
2 BSMED, Bharathiar University, Coimbatore – 641046, IN
3 Electrical & Computer Engineering, Oakland University, Rochester, MI, US
4 Christ University, Bangalore - 560029, IN
1 Wipro Technologies, Bangalore - 560100, IN
2 BSMED, Bharathiar University, Coimbatore – 641046, IN
3 Electrical & Computer Engineering, Oakland University, Rochester, MI, US
4 Christ University, Bangalore - 560029, IN
Source
Indian Journal of Science and Technology, Vol 8, No 15 (2015), Pagination:Abstract
Objectives: To implement a Service based Test Automation framework for testing web services in automotive Human Machine Interface (HMI) application. In this paper, we propose a service based test automation framework for web service testing in automotive HMI (Human Machine Interface). Methods: There are number of testing frameworks available for testing mobile application; In this proposal, an automated testing framework has been designed to test services which communicate between mobile application and real vehicles (cars) using differenttechnologies web services and mobility testing tools. Findings: In our findings, a customized mobile test automation framework has been developed which can eliminate most of the errors that may exist in manual testing by human and reduce a lot of time. Moreover, the framework can easily be extended to find a broader range of testing in automotive mobile applications. The techniques and mechanisms used in creating a test automation framework leads to analyze how they can do regression testing on mobile services in an efficient manner.Keywords
Automotive Testing, Human Machine Interface, Mobile Test Automation, Regression Testing, Web ServicesFull Text
- Implementing Automated End-To-End Testing in an Agile Environment
Abstract Views :184 |
PDF Views:4
Authors
Affiliations
1 Wipro Technology, Dallas, Plano, Texas, 75024, US
2 Department of Management, Bharathiar University, Coimbatore, 641 046, IN
1 Wipro Technology, Dallas, Plano, Texas, 75024, US
2 Department of Management, Bharathiar University, Coimbatore, 641 046, IN
Source
Software Engineering, Vol 4, No 6 (2012), Pagination: 203-205Abstract
In recent years, Enterprise applications are becoming more complex, heterogeneous and distributed. The real application business logic is no longer found only in the User Interface and the database as in the Client/Server, but now extend across multiple middle tiers and with different technologies. As the businesses are trying to become agile in order to respond quickly to changing business needs, the need of automated "End to End" testing becomes stronger. The End-to-End testing refers to the concept of testing at all point of access in an end-to-end solution. It combines functionality and performance testing at the component, service and system levels. In this paper we present a customized QTP (Quick Test Professional) framework for testing and validation of both functional and non-functional behavior of our web-based applications. This framework provides end-to-end testing of different layers (Presentation layer, Database layer and web service layer with other Business process). The main concept of this automation framework is to reduce the cost of manual testing and improve the effectiveness of end-to-end testing in Agile environment. In this paper, we described how we implemented Agile Automation in our complex project environment which has more than a hundred interfaces.
Keywords
End-To-End Testing, Automated Test, Framework, Agile, Scrum, Web Services.
- A Secured Hybrid Architecture Model for Internet Banking (E-Banking)
Abstract Views :165 |
PDF Views:3
Authors
Affiliations
1 Department of Computer Science, Coimbatore, IN
2 Govt. College of Technology, IN
1 Department of Computer Science, Coimbatore, IN
2 Govt. College of Technology, IN
Source
Networking and Communication Engineering, Vol 1, No 1 (2009), Pagination: 1-6Abstract
Internet banking has made it easy to carry out the personal or business financial transaction without going to bank and at any suitable time. This facility enables to transfer money to other accounts and checking current balance alongside the status of any financial transaction made in the account. However, in order to maintain privacy and to avoid any misuse of transactions, it is necessary to follow a secured architecture model which ensures the privacy and integrity of the transactions and provides confidence on internet banking is stable. In this research paper, a secured hybrid architecture model for the internet banking using Hyper elliptic curve cryptosystem and MD5 is described. This hybrid model is implemented with the hyper elliptic curve cryptosystem and it performs the encryption and decryption processes in an efficient way merely with an 80-bit key size. The various screen shots given in this contribution shows that the hybrid model which encompasses HECC and MD5 can be considered in the internet banking environment to enrich the privacy and integrity of the sensitive data transmitted between the clients and the application server.Keywords
E-Banking, Hyperelliptic Curve Cryptosystem, MD5, Authentication, Confidentiality, Integrity, Nonrepudiation, Privacy.- Analysis of Different Similarity Functions with Fuzzy C-Means Clustering Approach Using Meeting Transcripts
Abstract Views :178 |
PDF Views:5
Authors
Affiliations
1 Department of Computer Science and Engineering, Pondicherry Engineering College, Puducherry-605014, IN
1 Department of Computer Science and Engineering, Pondicherry Engineering College, Puducherry-605014, IN
Source
Data Mining and Knowledge Engineering, Vol 6, No 7 (2014), Pagination: 311-315Abstract
Clustering is a technique of automatically grouping similar data into clusters. A large diversity of similarity measures distance functions such as Euclidean distance, Jaccard distance, Pearson Correlation distance, Cosine similarity and Kullback-Leibler Divergence have been implemented for clustering. Fuzzy C means algorithm is implemented for assigning membership to each word point in the cluster. In the same way it is calculated to each cluster center from the origin of remote region between the cluster center and the word point in this process. This proposed framework is used to validate the five similarity measure functions with Fuzzy C means clustering algorithm for finding the effectiveness. To estimate the optimal number of clusters, by implementing the validity measures like purity and entropy. Finally the results are compared five similarity measure functions with Fuzzy C Means clustering algorithm. Euclidean similarity measure function provides better and accurate results as compared to the other distance functions.Keywords
Clustering, Euclidean Distance, Fuzzy C Means Algorithm, Similarity Measure.- Efficient Keyword Based Document Clustering Using Fuzzy C-Means Algorithm
Abstract Views :180 |
PDF Views:3
Authors
Affiliations
1 Erode Arts and Science College, Erode-638009, Tamil Nadu, IN
1 Erode Arts and Science College, Erode-638009, Tamil Nadu, IN
Source
Data Mining and Knowledge Engineering, Vol 5, No 12 (2013), Pagination: 460-463Abstract
Clustering is an useful technique in the field of textual data mining. Cluster analysis divides objects into meaningful groups based on similarity between objects. The existing clustering approaches face the issues like practical applicability, very less accuracy, more classification time etc. In recent times, inclusion of fuzzy logic in clustering results in better clustering results. In order to further improve the performance of clustering, the Fuzzy C-Means (FCMA) Algorithm is used. The keywords are extracted from the documents using LSA based document extraction. The Fuzzy partition matrix is created for the clustering process and the performance of the document clustering is greater based on the keyword when compared to the Existing K-Means Clustering and EM Algorithm. The proposed technique will be highly useful in the text mining process to increase the accuracy and performance of the text extraction process.Keywords
Document Clustering, Fuzzy Cluster, Fuzzy C-Means, K-Means Clustering.- An Ontology Mapping Maintenance Approach Using Change History Log in Ontology Based Data Integration
Abstract Views :197 |
PDF Views:4
Authors
Affiliations
1 Department of Computer Science and Engineering, Pondicherry Engineering College, Puducherry, IN
2 Department of Computer Science and Engineering, Sri Manakula Vinayagar Engineering College, Puducherry, IN
1 Department of Computer Science and Engineering, Pondicherry Engineering College, Puducherry, IN
2 Department of Computer Science and Engineering, Sri Manakula Vinayagar Engineering College, Puducherry, IN
Source
Data Mining and Knowledge Engineering, Vol 5, No 7 (2013), Pagination: 292-300Abstract
Data integration systems aim at integrating data from multiple heterogeneous, distributed and autonomous systems to provide a uniform access interface to end users. Today, ontologies are finding their way into a wide variety of applications including data integration. When using various ontologies to integrate data, mappings have to be produced. Mapping between two ontologies is used to achieve interoperability and to share information in an efficient manner. The requirement of updating the recent advances in a particular ontology leads to ontology evolution. Due to ontology evolution, the existing mapping between the ontologies become unreliable, invalid and outdated. In this paper we propose an ontology mapping maintenance approach using Change History Log (CHL). Our approach computes matching between the changed entities and adapts the existing mappings accordingly. It also ensures that the application of ontology changes should result in a mapping document conforming to the set of ontology mapping consistency constraints. The proposed approach can reduce the time needed for regenerating mappings for each time changes occurring in the ontology.Keywords
Change History Log, Knowledge Sharing, Mapping Technique, Ontology Evolution, Ontology Mapping.- Automatic Selection of Decision Tree Algorithm Based on Training Set Size
Abstract Views :209 |
PDF Views:1
Authors
Affiliations
1 Bharathiar University, School of BSMED, Coimbatore, IN
2 SNS Rajalakshmi College of Science, Coimbatore, IN
3 Dr. G.R. Damodaran College of Science, Coimbatore, IN
1 Bharathiar University, School of BSMED, Coimbatore, IN
2 SNS Rajalakshmi College of Science, Coimbatore, IN
3 Dr. G.R. Damodaran College of Science, Coimbatore, IN
Source
Data Mining and Knowledge Engineering, Vol 2, No 2 (2010), Pagination: 1-9Abstract
In Data mining applications, very large training data sets with several million records are common. Decision trees are powerful and popular technique for both classification and prediction. Many decision tree construction algorithms have been proposed to handle large or small training data sets. Some algorithms are best suited for large data sets and some for small data set. The decision tree algorithm C4.5 classifies categorical and continuous attributes very well but it handles efficiently only a smaller data set. SLIQ (Supervised Learning In Quest) and SPRINT (Scalable Parallelizable Induction of Decision Tree)handles very large datasets. This paper deals with the automatic selection of decision tree algorithm based on training set size. The proposed system first prepares the training dataset size using the mathematical measure. The resultant training set size will be checked with the available memory. If memory is sufficient then the tree construction will continue with any one of the algorithms C4.5, SLIQ, SPRINT. After classifying the dataset, the accuracy of the classifier is estimated. The major advantages of the proposed approach are that the system takes less time and avoids memory problem.
Keywords
Data Mining, Decision Trees, Classification, Machine Learning, Training Data.- Custom Security in Web Services
Abstract Views :190 |
PDF Views:0
Authors
Affiliations
1 Department of Computer Science and Engineering, SRM University, Chennai - 603203, Tamil Nadu, IN
2 Department of Computer Science and Engineering, Pondicherry Engineering College, Pondicherry - 605014, Tamil Nadu, IN
3 Department of Computer Science, SRM University, Chennai - 603203, Tamil Nadu, IN
1 Department of Computer Science and Engineering, SRM University, Chennai - 603203, Tamil Nadu, IN
2 Department of Computer Science and Engineering, Pondicherry Engineering College, Pondicherry - 605014, Tamil Nadu, IN
3 Department of Computer Science, SRM University, Chennai - 603203, Tamil Nadu, IN
Source
Indian Journal of Science and Technology, Vol 9, No 29 (2016), Pagination:Abstract
Background/Objectives: Service oriented Architecture (SOA) infrastructures using web services are deployed by many firms worldwide. Web Services provide a standard means of inter-operation between heterogeneous software applications that run on a variety of platforms. Most of the web services are offered with HTTP over Simple Object Access Protocol (SOAP) as the underlying infrastructure. The greatest web security threat is accepting the request from the client without proper validation. The objective is to separate the application logic and the security or validation procedures which offers more advantage for software reuse since it is not necessary to recompile, when the validation or security requirements change. Methods: An Interceptor is created for validation which has the token based authentication procedures along with the steps for validating the data. The system is devised in such a way that the business logic will be triggered if and only if the data is validated and passed by the interceptor procedures. Findings: The proposed system provides a way to keep the validation and security mechanism out of application logic and hence this does not modify the existing functionality. Thus, combining all custom security as one unit of validation before hitting the business logic is the basic idea of the proposed system.Keywords
Custom Security, SOA, Validation Model, Web Service.Full Text
- Comparative Analysis of Higher Genus Hyperelliptic Curve Cryptosystems over Finite Field Fp
Abstract Views :200 |
PDF Views:0
Authors
Affiliations
1 Department of Computer Science and Applications, PSG College of Arts & Science, Tamil Nadu, IN
2 Bharathiar School of Management and Entrepreneur Development, Bharathiar University, Tamil Nadu, IN
1 Department of Computer Science and Applications, PSG College of Arts & Science, Tamil Nadu, IN
2 Bharathiar School of Management and Entrepreneur Development, Bharathiar University, Tamil Nadu, IN
Source
ICTACT Journal on Communication Technology, Vol 2, No 1 (2011), Pagination: 238-240Abstract
The performance analysis of Hyperelliptic Curve Cryptosystems (HECC) over prime fields (Fp) of genus 5 and 6 are discussed in this paper. We have implemented a HECC system of genus 5&6 in a Intel Pentium III Celeron Processor @ 933 MHz speed with 256 MB RAM in Java 1.5. We have also compared their efficiency on the parameters of time taken for divisor generation, key generation, encryption and decryption. Our results demonstrate that the performance of higher genus HECC system gets degraded in terms of divisor generation, key generation, encryption and decryption process.Keywords
HECC, Finite Field, Genus, Divisor Generation, Key Generation, Encryption, Decryption.- A Novel Methodology for Genetic Algorithms in Crossover Operation: Segment Replacement Opeartor
Abstract Views :117 |
PDF Views:4
Authors
Source
International Journal of Innovative Research and Development, Vol 3, No 1 (2014), Pagination:Abstract
Genetic Algorithms (GA) are robust and efficient search and optimization techniques inspired by Darwin's theory of natural evolution. GA is composed of genetic operators and genetic parameters. Most of the approaches are random in nature which reduces the performance of the simple genetic algorithm. In this paper, a novel approach for crossover operator called segment replacement Operator (SRO) is attempted. In order to evaluate the efficiency and feasibility of the proposed technique, TSP problem is chosen and a comparison between the results of this study used in GAs is made through a number of test experiments with various parameter settings. Results of this study clearly show the significant differences between the proposed operator and the other existing operator techniques
Keywords
Genetic Algorithm, Segment Replacement Algorithm, Crossover, Mutation, Performance Analysis, Partially Mapped CrossoverFull Text
- Impact of Nanoparticulate Drug Delivery System of Herbal Drug in Control of Diabetes Mellitus
Abstract Views :162 |
PDF Views:0
Authors
Affiliations
1 Department of Pharmacy Practice, Jaya College of Paramedical Sciences, College of Pharmacy, IN
2 Department of Pharmacy Practice, Dr. M.G.R. Educational and Research Institute, Deemed to be University, Maduravoyal, Chennai-6000095, IN
3 Department of Pharmacy Practice, School of Pharmaceutical Sciences, VISTAS, IN
1 Department of Pharmacy Practice, Jaya College of Paramedical Sciences, College of Pharmacy, IN
2 Department of Pharmacy Practice, Dr. M.G.R. Educational and Research Institute, Deemed to be University, Maduravoyal, Chennai-6000095, IN
3 Department of Pharmacy Practice, School of Pharmaceutical Sciences, VISTAS, IN
Source
Research Journal of Pharmacy and Technology, Vol 12, No 4 (2019), Pagination: 1688-1694Abstract
Aim: The main objective of the current study is to organize and evaluate polymeric nanoparticles for the selected drug Gymnemic acid, improve the bioavailability of poorly bioavailable gymnemic acid, enhance the anti-diabetic activity of Gymnemic acid, reduce the dose size of Gymnemic acid by reducing the particle size. Method and procedure: Gymnemic acid nanoparticles was prepared through emulsion-droplet coalescence method, by using chitosan polymer (GNP1-GNP5). Based on the invitro drug release profile of Gymnemic acid nanoparticles formulations (GNP1-GNP5) formulation GNP3 is selected as the best preparation in which the particle size was 195 nm[1]. Since from ancient times the naturopathic treatment for diseases has been explored widely and in advance momentum in the present situation, and has several pharmacological significance. Nano particulate drug delivery systems symbolize a promising drug delivery system[2] in recent years for its prescribed and targeted drug release. They exists as with a size choice of 10-1000nm, in which the drug or dissolved active ingredient, encapsulated, entrapped, absorbed or attached to the matrix system. The present research is a development of nanoparticulate[3,4] drug delivery system for Gymnema sylvestre by ionic gelation method. The formulation is characterized by particle size, zeta potential, particle morphology and best formulation was selected for the further studies. Result: The Gymnemic acid nanoparticles [1] were formulated and evaluated for its invitro drug release profile. The results showed that the in vitro drug release for GNP1, GNP2, GNP3, GNP4 and GNP5 were found 99.55± 0.89, 99.51± 0.34, 99.57± 0.31,78.82± 0.82 and 65.73± 0.62 respectively at the end of 24hrs. Conclusion: It can be concluded that the newly formulated controlled release nanoparticulate drug delivery[32] systems of Gymnemic acid may be ideal and effective in the treatment of diabetes mellitus by allowing the drug to release continuously for 24 hrs.Keywords
Zeta Potential, Diabetes Mellitus, Gymnema Sylvestre, Phytochemicals.References
- Charles Lovelyn and Anthony A. Attama, 2011, Current State of Nanoemulsions in Drug Delivery, Journal of Biomaterials and Nanobiotechnology, 2, 626-639
- V Devarajan and V Ravichandran, Nanoemulsions: As Modified Drug Delivery Tool, Pharmacie Globale 2011, 4 (01), 1-6.
- Ravi Theaj Prakash and Padma Thiagarajan, 2011, Nanoemulsions for drug delivery through different routes, Research in Biotechnology, 2(3): 01-13.
- S. Sathesh Kumar, V. Felixjoe, K. Masilamani, D. Rajini and V. Ravichandiran, Delivery of Anti-Alzheimeric Drugs Using Polymeric Nanoparticles -A Review, Journal of Pharmacy Research 2012,5(12),5412-5415.
- Praveen Kumar Gupta, J. K. Pandit, Ajay Kumar, Pallavi Swaroop, Sanjiv gupta, 2010, pharmaceutical nanotechnology novel nanoemulsion –high energy emulsification preparation, evaluation and application, The Pharma Research, 3; 117-138.
- Sanyogitta puri: Novel Functionalised Polymers For Nanoparticles Formulations With Anticancer Drug:, May 2007.
- Mosamih. Kanani and Vadaliya KR: Nanoparticles as The Precursors of The Next Technological Revolution of The 21st Century: Nanotechnology, Biosciences International ;1(2); 16-24.
- Khushboo, Atul Kumar Sahu, Raj K. Prasad, Formulation Development and Evaluation of Clarithromycin Nanoparticles Using Acrylic Polymer, Research J. Pharm. and Tech 2017; 10(11): 3907-3918
- Adlin Jino Nesalin, A Anton Smith(2012).Preparation and evaluation of Chitosan nanoparticles containing Zidovudine loaded nanoparticles. AJPS.7(1):80-84
- Aenugu Saritha Reddy, Abbaraju Krishna Sailaja (2014).Preparation characterisation of Aspirin loaded Ethylcellulose nanoparticles.WJPPS.3(6):1781-1793
- Sagar S Jadhav, Aparna V Bhalerao (2013).Formulation characterisation of Chitosan nano particles loaded with Rizatriptan benzoate. Scholars research library.5(4):218-223
- Hyma. P, Laharika Reddy, D.S.S.N. Neelima, Formulation and Evaluation of a Self Microemulsifying Drug Delivery System of Atorvastatin Calcium Trihydrate, Research J. Pharm. and Tech. 9(7): July 2016, 9(7):789-793.
- Sokkalingam Arumugam Dhanaraj, Selvadurai Muralidharan, Kumaraswamy Santhi, Amanda Lim Sze Hui, Cheong Jia Wen, Hoh Chew Teng ‘Targeted drug delivery system- Formulation and evaluation of chitosan nanospheres containing Doxorubicin hydrochloride’ International Journal of Drug Delivery 2014; 6:186-193
- Cock PR man, Munper RJ, Akhar M and Allen DD: Nanoparticle Technology For Drug Delivery Across The Blood brain barrier: Drug Development and Industrial Pharmacy; 28(1);1-12(2002).
- Mohan Raj VJ and Chen Y: Nanoparticles-A Review: Tropical Journal of Pharmaceutical Research; June 2006; 5(1); 561-573.
- Anil Mahaptro And Dinesh K. Singh, Bioderadable Nanopartcles Are Excellent Vehicle For Site Directed In-vivo Delivery Of Drugs And Vaccines: Journal of Nanotechnology; 2011.
- Surbhi Sharma, M.S. Ashawat and N.S. Solanki, Isotretinoin-Loaded Solid-Lipid Nanoparticles: A Sound Strategy for Skin Targeting, Research J. Pharm. and Tech. 5(11): November, 2012; Page 1375-1384.
- Manishk Gupta, Rahmeshwar Mishra B, Deepak prakash And Santosh Krai: Nanoparticulate Drug Delivery System Of Cyclosporine: International Journal Of Pharmaceutical Sciences; Vol 1;2,2009.
- Priya Pathak And Katiyar VK: Multi Functional Nanoparticles And Their Role In Cancer Drug Delivery-A Review: May 11;2007.
- Svetlana Gelperina, Kelvin Kisich, Michael, Iseman D, Leonid Heifets, The Potential Advantages Of Nanoparticles Drug Delivery Systems In Chemotherapy of Tuberculosis: AJRCCM; 2005.
- Saikat Ghosh And Ajeet Kumar: Orally Administered Nanoparticulate Drug Delivery Systems For Lymphatic Targeting: Int J Pharma Sci Tech; Vol-6; Issue-2; July-December;2011.
- Sachin J., N. Vishal Gupta, Solid Lipid Nanoparticles – Preparation, Applications, Characterization, Uses in Various Cancer Therapies: A Review, Research J. Pharm. and Tech. 6(8): August 2013; Page 825-837.
- Bose JC. Chraavi, Krishna Kumar Duraisami, Surendiren NS: Review of Nanoparticle Based Therapeutics And Drug Delivery System: Asian Journal Of Biochemical And Pharmaceutical Research; Issue 2;(Vol-1) 2011.
- Sutar PS, Joshi VG (2013). Gemcitabine loaded PLGA nanoparticle. UJP. 02(05):135-14 D. Karthikeyan, M. Srinivas, C.Santhosh kumar (2013). Formulation and evaluation of Stavudine nanoparticles. IJNTPS. 25-32
- Priyanka B. Khodke, Ritesh R. Popat, Silver Nanoparticles-A Review, Research J. Pharm. and Tech. 2017; 10(6): 1820-1833.
- Shanmugasundaram Sangeetha, Dhandapani Nagasamy Venkatesh, Rajendran Adhiyaman, Kumaraswamy Santhi, Bhojraj Suresh (2007). Formulation of Sodium alginate nanospheres. TJPR. 06(01):653-659
- L. Dheivanai, G. Jeevaprakash, R. Nallathambi, S. Selvakumar, S. Senthilvelan (2012). Formulation and development and evaluation of Abacavir loaded polymethacrylic nanoparticles. IRJP.3(3):265-267
- A. Dinda, I.Biswal, P. Chowdhury, R. Mohapatra (2013). Formulation and evaluation of Paclitaxal loaded SLN’s . JAPS. 3(08): 130-138
- A. A. Khariya, A. K. Singhai, R. Verma (2012). Formulation and evaluation of polymeric nanoparticle of antiviral drug for gastroretention. IJPSN. 4(4)
- Vikram S Shenoy, Rajiv P Gude, Rayasa S Ramachandramoorthy (2013). In-vitro anticancer evaluation of 5-FU LPN’s. International nanoletters. 3(36)
- Rohan R. Vakhariya, Swati S. Talokar, Dr. V. R. Salunkhe, Dr. C. S. Magdum, Formulation Development and Optimization of Simvastatin Loaded Solid Lipid Nanoparticles, Asian J. Res. Pharm. Sci. 2017; 7(1): 49-52
- Amol kumar Lokhande, Sathyendra mishra, Ravindra kulkarni, Jitendra naik. (2013). Formulation and evaluation of Glipizide loaded nanoparticles. IJPPS. 05(04):147-151
- Naik JB, Mokale VJ.(2012). Formulation and evaluation of Repaglinide nanoparticles as sustained release carriers. IJPS. 1(5):259-266
- Afifa Bathool, Gowda D Vishakante, Mohammed S Khan, HG Shivakumar (2012). Development and characterisation of Atorvastatin calcium loaded chitosan nanoparticles for sustained drug delivery. Advanced materials letters. 3(6):466-470
- B.S. Naveen Prasad and TVN. Padmesh, Common Duckweed (Lemna minor) Assisted Green Synthesis of Silver Nanoparticles as Potent Anti-Fungal Nanomaterial, Research J. Pharm. and Tech. 7(9): Sept. 2014 Page 955-958.
- P. Srinivas, S. Pragna (2012).Formulation and evaluation of Moxifloxacin HCL ocular nanoparticles.IJND.3(2):105-113
- Partha Saha1, Amit K Goyal and Goutam Rath ‘Formulation and Evaluation of Chitosan-Based Ampicillin Trihydrate Nanoparticles’, Tropical Journal of Pharmaceutical Research October 2010; 9 (5): 483-488
- Ehsan Mohajeri, Mehdi Ansari, Abbas Pardakhty.’ Controlled Release imatinib Tablet Formulation: Using Hydrophilic Matrix System’ Pharmaceutical Sciences, 2015; 21(1): 157-166.
- Rajni Bala, Reecha Madaan, Vibhu, Sandeep Arora, Green Synthesis and Characterization of silver nanoparticles using Kinnow, mandarian peels extract and its application in Shampoo Formulation, Research J. Pharm. and Tech. 2017; 10(8): 2461-2466.
- Boushra Mohamed El-Houssieny1, Esmat Zein El-Dein and Hussien Mohamed El-Messiry ‘Formulation and Evaluation of Dexibuprofen Transdermal Films in Rabbits’, British Journal of Pharmaceutical Research 2016; 9(6): 1-13
- Sathesh Kumar. S, Felix Joe.V, Pharmacokinetics of Tacrine Loaded MPEG-PCL Polymeric Nanoparticles, Research J.Pharm. and Tech. 2017; 10(1): 135-140.
- Hemalatha. C. N, Yeswanth Prasanna Kumar. B, Vijey Anandhi. M, Formulation and Characterization of Nanoparticles Loaded with Cefadroxil, Research J. Pharm. and Tech. 2017; 10(1): 183-187.