Asian Science Citation Index is committed to provide an authoritative, trusted and significant information by the coverage of the most important and influential journals to meet the needs of the global scientific community.  
ASCI Database
308-Lasani Town,
Sargodha Road,
Faisalabad, Pakistan
Fax: +92-41-8815544
Contact Via Web
Suggest a Journal
Articles by P. Thangaraj
Total Records ( 6 ) for P. Thangaraj
  M. Gomathi and P. Thangaraj
  Problem statement: Computer Tomography (CT) has been considered as the most sensitive imaging technique for early detection of lung cancer. Approach: On the other hand, there is a requirement for automated methodology to make use of large amount of data obtained CT images. Computer Aided Diagnosis (CAD) can be used efficiently for early detection of Lung Cancer. Results: The usage of existing CAD system for early detection of lung cancer with the help of CT images has been unsatisfactory because of its low sensitivity and False Positive Rates (FPR). This study presents a CAD system which can automatically detect the lung cancer nodules with reduction in false positive rates. In this study, different image processing techniques are applied initially in order to obtain the lung region from the CT scan chest images. Then the segmentation is carried with the help of Fuzzy Possibility C Mean (FPCM) clustering algorithm. Conclusion/Recommendations: Finally for automatic detection of cancer nodules, Support Vector Machine (SVM) is used which helps in better classification of cancer nodules. The experimentation is conducted for the proposed technique by 1000 CT images collected from the reputed hospital.
  A. Kamaleswari and P. Thangaraj
  Virtualization is a key technology to enable cloud computing. A vast mass of popular content is transferred frequently across network links in the cloud. In network-level Redundancy Elimination (RE) techniques, it minimizes traffic flow on bandwidth-constrained network paths by eliminating the transmission of repetitive byte sequences. In previous research, the protocol is independent of redundancy elimination which cannot eliminate duplicate packets from within arbitrary network flows. In emerged cloud we require a potent technique to improve the performance of network links in the face of frequent data. Our proposed research present the packet reduction technique is used for finding and removes the duplicate packets in a network environment. In addition, the data itself can be moreover large to store on a single machine. In order to reduce the time it takes to process the data and to have the storage space to store the data, we introduce a new approach called map reduce method. In this approach, it has to separate the workload among computers in a network. As an outcome, the performance of map reduce robustly determined on how equal it distributes this workload among the computer. In map reduce, workload allocation depends on the algorithm that separating the data. To avoid the issues of uneven distribution of data we use data sampling. By using the partitioning mechanism, the partitioning is done on the data which depends on how huge and representative the sample is and on how well the samples are examined. In addition to that we use partitioning methods to divide the workload into small tasks that are dynamically scheduled at runtime based on deadline. To improve the accuracy in scheduling, we propose a novel method called deadline constraints based task scheduling algorithm in map reduce. This method allows the user to specify a job’s deadline and attempts to formulate the job to be completed before the deadline. This method is simple and efficient systems with high-throughput, low-latency task schedulers and proficient data materialization.
  C.N. Marimuthu and P. Thangaraj
  The performance analysis of various multiplier architectures are compared in terms of power, delay and area occupation in the view of low-power low-voltage signal processing for low-frequency applications. A novel practical approach has been set up to investigate and graphically represent the mechanisms of glitch generation and propagation. It is found that spurious activity is a major source of power dissipation in multipliers. Measurements point out that the shorter full-adder chains in the Wallace multiplier dissipates less energy than as compare to other longer full-adder chains traditional array multipliers. The benefits of transistor sizing are also evaluated. In this study transmission gates combined with static CMOS circuits to reduce glitches in Wallace multiplier architecture is proposed to improve the energy-efficiency as compare to traditional array architecture. The reduced number of Vdd-to-ground paths, reduced glitches due to level restoring gates, the equalized internal signal delay and shortening of full adder chains are the unique techniques used to reduce power dissipation in proposed transmission gate based Wallace multipliers as compare to prior designs.
  P. Priakanth and P. Thangaraj
  Problem statement: A major drawback in the existing protocols in dealing with energy management issues is that the time varying nature of the wireless channels among the ad hoc nodes is ignored. Approach: This study proposed a channel adaptive energy efficient Medium Access Control (MAC) protocol, for efficient packets scheduling and queuing in an ad hoc network, with time varying characteristic of wireless channel taken into consideration. Every node in the proposed scheme estimates the channel and link quality for each contending flow based on which a weight value is calculated and propagated using the routing protocol. Since a wireless link with worse channel quality can result in more energy expenditure, the transmission was allowed only for those flows whose weight is greater than Channel Quality Threshold (CQT). For flows with weight less than CQT, the packets were buffered until the channel and link quality recovers or the weight becomes greater than CQT. To avoid buffer overflow and achieve fairness for the poor quality nodes, a fair scheduling and queuing algorithm is designed where in the CQT is adaptively adjusted on basis of the current incoming traffic load. Results: Simulation results showed that the proposed MAC protocol achieves substantial energy savings with better fairness and increased throughput. Conclusion: The designed protocol provided an efficient packets scheduling and queuing in an ad hoc network, with time varying characteristic of wireless channel taken into consideration.
  C.N. Marimuthu and P. Thangaraj
  Problem statement: Power dissipation is designated as critical parameter in modern VLSI design field. In VLSI implementation low power concept is necessary to meet Moore’s law and to produce consumer electronics with more back up and less weight. To save significant power consumption of a VLSI design, it is a good direction to reduce its dynamic power which is the major part of power dissipation. Multiplication occurs frequently finite impulse response filters, fast Fourier transforms, discrete cosine transform and other important DSP and multimedia kernels. Being one among the functional components of many digital systems the reduction of power dissipation in multipliers should be as much as possible. Approach: In this study a low power structure called Bypass Zero Feed A Directly (BZFAD) for shift and add multipliers was proposed for reducing the switching activity. Results: The simulation results showed conventional and proposed BZFAD 8 bit multipliers. Conclusion: From these results, BZFAD can attain considerable power reduction and area saving when compared to the conventional shift and add multipliers.

  M. Thangamani and P. Thangaraj
  Problem statement: Text documents are the unstructured databases that contain raw data collection. The clustering techniques are used group up the text documents with reference to its similarity. Approach: The feature selection techniques were used to improve the efficiency and accuracy of clustering process. The feature selection was done by eliminate the redundant and irrelevant items from the text document contents. Statistical methods were used in the text clustering and feature selection algorithm. The cube size is very high and accuracy is low in the term based text clustering and feature selection method. The semantic clustering and feature selection method was proposed to improve the clustering and feature selection mechanism with semantic relations of the text documents. The proposed system was designed to identify the semantic relations using the ontology. The ontology was used to represent the term and concept relationship. Results: The synonym, meronym and hypernym relationships were represented in the ontology. The concept weights were estimated with reference to the ontology. The concept weight was used for the clustering process. The system was implemented in two methods. They were term clustering with feature selection and semantic clustering with feature selection. Conclusion: The performance analysis was carried out with the term clustering and semantic clustering methods. The accuracy and efficiency factors were analyzed in the performance analysis.
Copyright   |   Desclaimer   |    Privacy Policy   |   Browsers   |   Accessibility