oalib

Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99

Submit

Any time

2019 ( 186 )

2018 ( 288 )

2017 ( 313 )

2016 ( 389 )

Custom range...

Search Results: 1 - 10 of 138753 matches for " K. Chakrapani "
All listed articles are free for downloading (OA Articles)
Page 1 /138753
Display every page Item
A Comparative Approach to Fractal image Compression Using Genetic Algorithm and Simulated Annealing Technique
Y. Chakrapani,K. Soundera Rajan
Asian Journal of Information Technology , 2012,
Abstract: In this study, the technique of Genetic Algorithm (GA) and Simulated Annealing (SA) is applied for Fractal Image Compression (FIC). With the help of these evolutionary algorithms effort is made to reduce the search complexity of matching between range block and domain block. One of the image compression techniques in the spatial domain is fractal image compression but the main drawback of FIC is that it involves more computational time due to global search. In order to improve the computational time and also the quality of the decoded image, genetic and simulated annealing algorithms are proposed. Experimental results show that the genetic algorithm is a better method than Simulated Annealing Technique for fractal image compression.
Genetic algorithm applied to fractal image compression
Y. Chakrapani,K. Soundera Rajan
Journal of Engineering and Applied Sciences , 2009,
Abstract: In this paper the technique of Genetic Algorithm (GA) is applied for Fractal Image Compression (FIC). With the help of this evolutionary algorithm effort is made to reduce the search complexity of matching between range block and domain block. One of the image compression techniques in the spatial domain is Fractal Image Compression but the main drawback of FIC is that it involves more computational time due to global search. In order to improve the computational time and also the acceptable quality of the decoded image, Genetic algorithm is proposed. Experimental results show that the Genetic Algorithm is a better method than the traditional exhaustive search method.
Acute cholestatic hepatitis along with agranulocytosis: A rare side effect of carbimazole
K Jain, M Chakrapani, K Smitha
Annals of African Medicine , 2010,
Abstract:
Role of Trunk Rehabilitation on Trunk Control, Balance and Gait in Patients with Chronic Stroke: A Pre-Post Design  [PDF]
S. Karthikbabu, John M. Solomon, N. Manikandan, Bhamini K. Rao, M. Chakrapani, Akshatha Nayak
Neuroscience & Medicine (NM) , 2011, DOI: 10.4236/nm.2011.22009
Abstract: Purpose: Although proximal stability of the trunk is a prerequisite for balance and gait, to determine the role of trunk rehabilitation on trunk control, balance and gait in patients with chronic stroke is yet unknown. Method: Fifteen sub-jects (post-stroke duration (3.53 ± 2.98) years) who had the ability to walk 10 meters independently with or without a walking aid; scoring ≤ 21 on Trunk Impairment Scale (TIS), participated in a selective trunk muscle exercise regime, consisting of 45 minutes training per day, four days a week, and for four weeks duration in an outpatient stroke reha-bilitation centre. Results: The overall effect size index for trunk rehabilitation was 1.07. This study showed large effect size index for Trunk Impairment Scale (1.75), Berg Balance Scale (1.65) than for gait variables (0.65). After trunk rehabilitation, there was a significant improvement for gait speed (p= 0.015), cadence (p= 0.001) and gait symmetry (p=0.019) in patients with chronic stroke. In addition, all the spatial gait parameters had a significant change post-intervention. There was no significant change in temporal gait parameters with the exception of affected single limb support time. The level of significance was set at p < 0.05. Conclusion: The exercises consisted of selective trunk movement of the upper and the lower part of trunk had shown larger effect size index for trunk control and balance than for gait in patients with chronic stroke. Future randomized controlled studies incorporating large sample size would provide insight into the effectiveness and clinical relevance of this intervention.
Acute cholestatic hepatitis along with agranulocytosis: A rare side effect of carbimazole
Jain Karun,Chakrapani M,Smitha K
Annals of African Medicine , 2010,
Abstract: Antithyroid drugs have been used for more than 50 years for the management of hyperthyroidism. Most patients tolerate treatment well but some may develop life-threatening side effects such as agranulocytosis, aplastic anemia and cholestatic hepatitis. A 45-year-old female was diagnosed with severe hyperthyroidism. Treatment with Carbimazole 30 mg/day was initiated. Within six weeks following the start of therapy, patient developed potentially life-threatening acute cholestatic hepatitis and agranulocytosis as adverse effects to carbimazole. The patient′s symptoms and laboratory abnormalities resolved following withdrawal of offending drug. Agranulocytosis and cholestatic hepatitis together is an extremely rare idiosyncratic side effect of Carbimazole treatment and considered to be dose and age-related. Antithyroid drugs are deceptively easy to use, but because of the variability in the response of patients and the potentially serious side effects, all practitioners who prescribe the drugs need to have a working knowledge of their complex pharmacology.
Design and Implementation of Hardware Based Entropy Analysis
S. Saravanan,K. Chakrapani,R. Silambamuthan
Research Journal of Applied Sciences, Engineering and Technology , 2012,
Abstract: The aim of this study is hardware implementation of the Entropy analysis. Designing and verifying entropy analysis is the major finding of this study aper. Entropy tells how much amount of data can be compressed. Entropy analysis plays a major role in scan based SoC testing. Size and complexity have been the major issues for current scenario of System-on-a-Chip (SoC) testing. Test data compression is a must for such cases. Entropy analysis is taken for both specified and unspecified bits (don’t care bits). Unspecified bits are specified using Zero and One fill algorithms. The X-filling technique is applied for fixed to fixed codes. The proposed method is successfully tested on ISCAS89 benchmark circuits.
Cluster Based LFSR Reseeding for Test Data Compression
S. Saravanan,K. Chakrapani,P. Selvakumar
Research Journal of Applied Sciences, Engineering and Technology , 2012,
Abstract: Today’s System-on-Chip (SoC) represent high-complexity and it is moving towards the challenge of huge test patterns, more accessing time and larger power consumption. Test data compression is done to improve the test quality. This study presents a test pattern compression by the usage of suitable clustering technique and its corresponding decompression scheme. This scheme includes compression and decompression achieved by LFSR reseeding. Test data compression is widely used in the industry nowadays to reduce the amount of test data stored on the ATE and to decrease testing time. The proposed method requires no special ATPG. The proposed method is validated by the simulation and synthesis output.
Automated Agricultural Process Using PLC and ZigBee
A. Dhivya,J. Infanta,K. Chakrapani
Journal of Artificial Intelligence , 2012,
Abstract: Agriculture is the backbone of Indian Economy. Because without agriculture living is impossible since agriculture produces the main source of food for us. But in today’s situation the availability of labour for carrying out agricultural activities is rare. The automation in all kind of industries leads to industrial growth. Here agricultural process is automated. In this proposed system all the machines to work on its own with the help of inputs received from the sensors which are monitoring the agricultural land round the clock and a single person is enough to monitor whether everything going normal. The entire process is controlled and monitored by programmable logic controller. Above process is transmitted to the user using ZigBee network. Agricultural process involves seeding, ploughing, irrigation, planting, fertilizing, weeding, harvesting. Here three processes can be implemented. The main objective is even a professionals can work in the agricultural field. This idea is implemented in future there is remarkable change in the agricultural field. In general the manual cultivation for one acre of land requires money of around Rs. 15,000-17,000 but due to this technique we reduce the cost and is nearly Rs. 9,000-10,000 only and also the yield is high when compared to normal one.
Throughput Improvement In Wireless Mesh Networks By Integrating With Optical Network
Chakrapani gadde,K.Chandrasekhar,I.Hemalatha
International Journal of Distributed and Parallel Systems , 2012,
Abstract: In the last decade wireless mesh networks (WMNs) have emerged as a key technology for next generation wireless networking. Because of their advantages over other wireless networks, WMNs are undergoing rapid progress and inspiring numerous applications. One such application is to provide peer-to-peer communication for all the users who are distributed over some area. Since the users are connected in awireless multi-hop passion complete ubiquity is provided. But as the number of users accessing the network is increasing there could be a chance of experiencing more interference by each user due to the communication link of every other user. So in a wireless mesh network as the load increases the throughput of network is going to be decreased due to wireless interference by other users. To sustain this problem we are going to integrate the WMN with passive optical network (PON). The resulting hybrid network (Optical-wireless network) could reduce the wireless hops of each user, so that we can reduce the total wireless interference experienced by each user resulting in improved network throughput. This paper aims to study the network throughput gain in Optical-wireless network subject to peer-to-peer communications.
IMPLEMENTATION OF ARRAY BASED TECHNIQUE TO IMPROVISE REPRESENTATION OF FP-TREE USING IAFP-MAX ALGORITHM
Kuparala Chakrapani
Journal of Global Research in Computer Science , 2011,
Abstract: The essential aspect of mining association rules is to mine the frequent patterns. Due to intrinsic difficulty it is impossible to mine complete frequent patterns from a dense database. The quantity of mined patterns is generally large and it is firm to understand and utilize them. all frequent patterns are enclosed and compressed to maximal frequent patterns where the memory needed for storing them is smaller than that is required for storing complete patterns. Consequently, mining maximal frequent patterns provides a great value. This paper inorder to improve the structure of traditional FP-Tree presents an effective algorithm called IAFP-max for mining maximal frequent patterns based on improved FP-tree and array technique. The implementation of concept postfix sub- tree in the respective algorithm avoids generating the candidate of maximal frequent patterns in the mining process. Thus it reduces the memory consumed and also uses an array –based technique to the improved FP-Tree to reduce the traverse time. By the practical facts ,it represents that this algorithm overtakes many existing algorithms like MAFIA, Genax and FP max. Keywords: FP-Tree, IAFP, Frequent Patterns, itemsets, Array Technique.
Page 1 /138753
Display every page Item


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