Prediction of epileptic seizures from spectral features of intracranial eeg recordings using deep learning approach

Epilepsy is a prevalent neurological disorder, which disturbs the lives of millions of people worldwide owing to the onset of abrupt seizures. The forecasting of seizures could help in protecting their lives by alerts or in clinical operations during epilepsy surgeries. The present paper addresses this problem by proposing a deep learning framework for prediction of epileptic seizures using intracranial EEG (iEEG) recordings. This framework performs filtering and segmentation of iEEG signals into 10s, 20s, 30s, 40s, 50s and 60s duration segments. These segments are further resolved into eight distinct spectral bands corresponding to delta, theta, alpha, beta and gamma sub-bands with frequency-domain transformation. Then, mean amplitude and band power features are extracted from each band, which are provided to convolutional neural network (CNN) and long short-term memory network (LSTM) algorithms for classification. The simulation results of the proposed CNN model exhibit higher performance with average accuracy, sensitivity, specificity, AUC and F1 score of 94.74%, 95.8%, 94.46%, 95.13% and 94.75% respectively for iEEG segments of 40s duration. Thus, the performance analysis and comparison with existing literature unveil that the proposed CNN model is an optimal approach for accurate and real-time prediction of epileptic seizures.

     

Deep transfer modeling for classification of Maize Plant Leaf Disease

Multimedia Tools and Applications - Currently, Deep Learning is playing an influential role for Image analysis and object classification. Maize’s diseases reduce production that subsequently...     

Adaptive Linear Quadratic Regulator for Continuous-Time Systems With Uncertain Dynamics

In this paper, adaptive linear quadratic regulator (LQR) is proposed for continuous-time systems with uncertain dynamics. The dynamic state-feedback controller uses input-output data along the system trajectory to continuously adapt and converge to the optimal controller. The result differs from previous results in that the adaptive optimal controller is designed without the knowledge of the system dynamics and an initial stabilizing policy. Further, the controller is updated continuously using input-output data, as opposed to the commonly used switched/intermittent updates which can potentially lead to stability issues. An online state derivative estimator facilitates the design of a model-free controller. Gradient-based update laws are developed for online estimation of the optimal gain. Uniform exponential stability of the closed-loop system is established using the Lyapunov-based analysis, and a simulation example is provided to validate the theoretical contribution.      

Optimizing Grid-Based Workflow Execution

Large-scale applications can be expressed as a set of tasks with data dependencies between them, also known as application workflows. Due to the scale and data processing requirements of these applications, they require Grid computing and storage resources. So far, the focus has been on developing easy to use interfaces for composing these workflows and finding an optimal mapping of tasks in the workflow to the Grid resources in order to minimize the completion time of the application. After this mapping is done, a workflow execution engine is required to run the workflow over the mapped resources. In this paper, we show that the performance of the workflow execution engine in executing the workflow can also be a critical factor in determining the workflow completion time. Using Condor as the workflow execution engine, we examine the various factors that affect the completion time of a fine granularity astronomy workflow. We show that changing the system parameters that influence these factors and restructuring the workflow can drastically reduce the completion time of this class of workflows. We also examine the effect on the optimizations developed for the astronomy application on a coarser granularity biology application. We were able to reduce the completion time of the Montage and the Tomography application workflows by 90% and 50%, respectively.     

Prediction of Alzheimer’s Using Random Forest with Radiomic Features

Alzheimer’s disease is a non-reversible, non-curable, and progressive neurological disorder that induces the shrinkage and death of a specific neuronal population associated with memory formation and retention. It is a frequently occurring mental illness that occurs in about 60%–80% of cases of dementia. It is usually observed between people in the age group of 60 years and above. Depending upon the severity of symptoms the patients can be categorized in Cognitive Normal (CN), Mild Cognitive Impairment (MCI) and Alzheimer’s Disease (AD). Alzheimer’s disease is the last phase of the disease where the brain is severely damaged, and the patients are not able to live on their own. Radiomics is an approach to extracting a huge number of features from medical images with the help of data characterization algorithms. Here, 105 number of radiomic features are extracted and used to predict the alzhimer’s. This paper uses Support Vector Machine, K-Nearest Neighbour, Gaussian Naïve Bayes, eXtreme Gradient Boosting (XGBoost) and Random Forest to predict Alzheimer’s disease. The proposed random forest-based approach with the Radiomic features achieved an accuracy of 85%. This proposed approach also achieved 88% accuracy, 88% recall, 88% precision and 87% F1-score for AD vs. CN, it achieved 72% accuracy, 73% recall, 72% precisionand 71% F1-score for AD vs. MCI and it achieved 69% accuracy, 69% recall, 68% precision and 69% F1-score for MCI vs. CN. The comparative analysis shows that the proposed approach performs better than others approaches.     

COVIDScreen: explainable deep learning framework for differential diagnosis of COVID-19 using chest X-rays

Neural Computing and Applications - COVID-19 has emerged as a global crisis with unprecedented socio-economic challenges, jeopardizing our lives and livelihoods for years to come. The...     

Security-Performance Tradeoffs in a Class of Wireless Network Scenarios

There has been an extensive and widespread deployment of wireless local area networks (WLANs) for information access. The transmission, being of a broadcast nature, is vulnerable to security threats and hence, the aspect of security provisioning in these networks has assumed an important dimension. The security of the transmitted data over a wireless channel aims at protecting the data from unauthorized access. The objective is achieved by providing advanced security mechanisms. Implementing strong security mechanisms however, affects the throughput performance and increases the complexity of the communication system. In this paper, we investigate the security performance of a WLAN based on IEEE 802.11b/g/n standards on an experimental testbed in congested and uncongested networks in a single and multi-client environment. Experimental results are obtained for a layered security model encompassing nine security protocols in terms of throughput, response time, and encryption overhead. The performance impact of transmission control protocol and user datagram protocol traffic streams on secure wireless networks has also been studied. Through numerical results obtained from the testbed, we have presented quantitative and realistic findings for both security mechanisms as well as network performance. The tradeoff between the strength of the security protocol and the associated performance is analyzed through computer simulation results. The present real time analysis enables the network designers to make intelligent choices about the implementation of security features and the perceived network performance for a given application scenario.     

Dynamic Grover search: applications in recommendation systems and optimization problems

In the recent years, we have seen that Grover search algorithm (Proceedings, 28th annual ACM symposium on the theory of computing, pp. 212–219, 1996) by using quantum parallelism has revolutionized the field of solving huge class of NP problems in comparisons to classical systems. In this work, we explore the idea of extending Grover search algorithm to approximate algorithms. Here we try to analyze the applicability of Grover search to process an unstructured database with a dynamic selection function in contrast to the static selection function used in the original work (Grover in Proceedings, 28th annual ACM symposium on the theory of computing, pp. 212–219, 1996). We show that this alteration facilitates us to extend the application of Grover search to the field of randomized search algorithms. Further, we use the dynamic Grover search algorithm to define the goals for a recommendation system based on which we propose a recommendation algorithm which uses binomial similarity distribution space giving us a quadratic speedup over traditional classical unstructured recommendation systems. Finally, we see how dynamic Grover search can be used to tackle a wide range of optimization problems where we improve complexity over existing optimization algorithms.     

Localizing failures in distributed synchronization

The fault-tolerance of distributed algorithms is investigated in asynchronous message passing systems with undetectable process failures. Two specific synchronization problems are considered, the dining philosophers problem and the binary committee coordination problem. The abstraction of a bounded doorway is introduced as a general mechanism for achieving individual progress and good failure locality. Using it as a building block, optimal fault-tolerant algorithms are constructed for the two problems