SCSrimathi Chandrasekaran

Srimathi Chandrasekaran

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Srimathi Chandrasekaran has a total of 9 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Isogency Hosmer–Lemeshow Logistic Regression-Based Secured Information Sharing for Pharma Supply Chain

    by Anitha P, Srimathi Chandrasekaran

    Counterfeit drugs are forgery-tagged medicines that are considered to be drugs without vigorous active pharmaceutical ingredients (API). India, being the world’s largest producer of drugs, faces a crucial issue of counterfeits. Moreover, counterfeits identify their path into the pharmaceutical supply chain (PSC) effortlessly owing to the dearth of security and traceability in the prevailing system. This is because the software applications currently in use stockpile the information about drugs on centralized servers and are accessed by manufacturers, distributors and retailers via the internet. The security of such systems is found to be weak. To address these issues, in this work, a novel method called Supersingular Isogeny and Hosmer–Lemeshow Logistic Regression-based (SI-HLLR) secured information sharing for the pharmaceutical supply chain is proposed. The SI-HLLR method is split into two sections, block validation and authentication. First, with the pharmaceutical sales data provided as input, the supersingular isogeny Diffie–Hellman key exchange model is applied for block validation and then is implemented using a blockchain. Next, with the validated blocks, the authentication mechanism is performed using Hosmer–Lemeshow logistic regression-based authentication that in turn eliminates the counterfeit drugs from the pharmaceutical supply chain. The hyperledger fabric blockchain solution using SI-HLLR leads to improved security ensuring data integrity and better authentication accuracy in the proposed method.


  • Open Access

    Cost and Time Economical Planning Algorithm for Scientific Workflows in Cloud Computing

    by Jabanjalin Hilda, Srimathi Chandrasekaran

    A heterogeneous system can be portrayed as a variety of unlike resources that can be locally or geologically spread, which is exploited to implement data-intensive and computationally intensive applications. The competence of implementing the scientific workflow applications on heterogeneous systems is determined by the approaches utilized to allocate the tasks to the proper resources. Cost and time necessity are evolving as different vital concerns of cloud computing environments such as data centers. In the area of scientific workflows, the difficulties of increased cost and time are highly challenging, as they elicit rigorous computational tasks over the communication network. For example, it was discovered that the time to execute a task in an unsuited resource consumes more cost and time in the cloud data centers. In this paper, a new cost- and time-efficient planning algorithm for scientific workflow scheduling has been proposed for heterogeneous systems in the cloud based upon the Predict Optimistic Time and Cost (POTC). The proposed algorithm computes the rank based not only on the completion time of the current task but also on the successor node in the critical path. Under a tight deadline, the running time of the workflow and the transfer cost are reduced by using this technique. The proposed approach is evaluated using true cases of data-exhaustive workflows compared with other algorithms from written works. The test result shows that our proposed method can remarkably decrease the cost and time of the experimented workflows while ensuring a better mapping of the task to the resource. In terms of makespan, speedup, and efficiency, the proposed algorithm surpasses the current existing algorithms—such as Endpoint communication contention-aware List Scheduling Heuristic (ELSH)), Predict Earliest Finish Time (PEFT), Budget-and Deadline-constrained heuristic-based upon HEFT (BDHEFT), Minimal Optimistic Processing Time (MOPT) and Predict Earlier Finish Time (PEFT)—while holding the same time complexity.


  • A Prediction based Cloud Resource Provisioning using SVM

    by Vijayasherly Velayutham, Srimathi Chandrasekaran

    Aim: To develop a prediction model grounded on Machine Learning using Support Vector Machine (SVM). Background: Prediction of workload in a Cloud Environment is one of the primary task in provisioning resources. Forecasting the requirements of future workload lies in the competency of predicting technique which could maximize the usage of resources in a cloud computing environment. Objective: To reduce the training time of SVM model. Methods: K-Means clustering is applied on the training dataset to form ‘n’ clusters firstly. Then, for every tuple in the cluster, the tuple’s class label is compared with the tuple’s cluster label. If the two labels are identical then the tuple is rightly classified and such a tuple would not contribute much during the SVM training process that formulates the separating hyperplane with lowest generalization error. Otherwise the tuple is added to the reduced training dataset. This selective addition of tuples to train SVM is carried for all clusters. The support vectors are a few among the samples in reduced training dataset that determines the optimal separating hyperplane. Results: On Google Cluster Trace dataset, the proposed model incurred a reduction in the training time, Root Mean Square Error and a marginal increase in the R2 Score than the traditional SVM. The model has also been tested on Los Alamos National Laboratory’s Mustang and Trinity cluster traces. Conclusion: The Cloudsim’s CPU utilization (VM and Cloudlet utilization) was measured and it was found to increase upon running the same set of tasks through our proposed model.


  • Open Access

    Hybrid Continuous Density Hmm-Based Ensemble Neural Networks for Sensor Fault Detection and Classification in Wireless Sensor Network

    by Malathy Emperuman, Srimathi Chandrasekaran

    Sensor devices in wireless sensor networks are vulnerable to faults during their operation in unmonitored and hazardous environments. Though various methods have been proposed by researchers to detect sensor faults, only very few research studies have reported on capturing the dynamics of the inherent states in sensor data during fault occurrence. The continuous density hidden Markov model (CDHMM) is proposed in this research to determine the dynamics of the state transitions due to fault occurrence, while neural networks are utilized to classify the faults based on the state transition probability density generated by the CDHMM. Therefore, this paper focuses on the fault detection and classification using the hybridization of CDHMM and various neural networks (NNs), namely the learning vector quantization, probabilistic neural network, adaptive probabilistic neural network, and radial basis function. The hybrid models of each NN are used for the classification of sensor faults, namely bias, drift, random, and spike. The proposed methods are evaluated using four performance metrics which includes detection accuracy, false positive rate, F1-score, and the Matthews correlation coefficient. The simulation results show that the learning vector quantization NN classifier outperforms the detection accuracy rate when compared to the other classifiers. In addition, an ensemble NN framework based on the hybrid CDHMM classifier is built with majority voting scheme for decision making and classification. The results of the hybrid CDHMM ensemble classifiers clearly indicates the efficacy of the proposed scheme in capturing the dynamics of change of statesm which is the vital aspect in determining rapidly-evolving instant faults that occur in wireless sensor networks.


  • Open Access

    Particle Swarm Intelligence Based Univariate Parameter Tuning of Recursive Least Square Algorithm for Optimal Heart Sound Signal Filtering

    by Mary Mekala Antony Dhas, Srimathi Chandrasekaran

    Heart Sound Signal (HSS) is considered as one of the important bio-signals. It carries vital information about the heart functions. For bio-acoustic observations, the HSS is diagnosed and recorded with auscultatory procedures. During auscultation, the noisy components gets added along with the reading. The physician’s individual diagnostic experience, ecological noise and the intersection of heart and lung sound signal (LSS) are considered as the major noisy components in HSS diagnosis. Suppression of LSS from the HSS is a challenging task. Due to its quasi stationary nature, adaptive filtering techniques are used for the noise removal. In this paper, Recursive Least Square (RLS) adaptive algorithm is proposed to obtain the HSS from the noisy mixture. Faster convergence is a benefit in selecting RLS algorithm over other adaptive algorithms. The forgetting factor is one of the important parameters of RLS which defines the convergence. The RLS performance is improved by choosing an optimal forgetting factor. A Particle Swarm Optimization (PSO) based search algorithms are deployed for optimization. To enhance the implementation time, a Dynamic Neighbourhood Learning Particle Swarm Optimizer (DNL-PSO) is analysed. In DNL-PSO, each particle studies from its knowledge in dynamically varying neighbourhood that prevents early convergence. The normal HSS with different LSS interference is taken to assess the RLS filter performance. In this paper, the RLS algorithm performance is compared with Least Mean Square (LMS) adaptive algorithms. Various metrics are used to compare the performance of both RLS and optimization algorithms.


  • Survey on HealthCloud characteristics

    by Srimathi Chandrasekaran, Subaji Mohan, Rajesh Natarajan


  • Open Access

    Sensor Grid Middleware Metamodeling and Analysis

    by Srimathi Chandrasekaran, Eunmi Choi, Jemal H. Abawajy, Rajesh Natarajan

    Sensor grid is a platform that combines wireless sensor networks and grid computing with the aim of exploiting the complementary advantages of the two systems. Proper integration of these distinct systems into effective, logically single platform is challenging. This paper presents an approach for practical sensor grid implementation and management. The proposed approach uses a metamodeling technique and performance analysis and tuning as well as a middleware infrastructure that enable practical sensor grid implementation and management. The paper presents our implementation and analysis of the sensor grid.