Electroencephalogram (EEG) is one of the most powerful tools that offer valuable information related to different abnormalities in the human brain. One of these abnormalities is the epileptic seizure. A framework is proposed for detecting epileptic seizures from EEG signals recorded from normal and epileptic patients. The suggested approach is designed to classify the abnormal signal from the normal one automatically. This work aims to improve the accuracy of epileptic seizure detection and reduce computational costs. To address this, the proposed framework uses the 54-DWT mother wavelets analysis of EEG signals using the Genetic algorithm (GA) in combination with other four machine learning (ML) classifiers: Support Vector Machine (SVM), K-Nearest Neighbors (KNN), Artificial Neural Network (ANN), and Naive Bayes (NB). The performance of 14 different combinations of two-class epilepsy detection is investigated using these four ML classifiers. The experimental results show that the four classifiers produce comparable results for the derived statistical features from the 54-DWT mother wavelets; however, the ANN classifier achieved the best accuracy in most datasets combinations, and it outperformed the other examined classifiers. INDEX TERMS Electroencephalogram (EEG), discrete wavelet transform (DWT), epilepsy, artificial neural network, k-nearest neighbor (k-NN), support vector machine (SVM), naïve bayes (NB).

A highly efficient lightweight forward static slicing approach is presented and evaluated. The approach does not compute the program/system dependence graph but instead dependence and control information is computed as needed while computing the slice on a variable. The result is a list of line numbers, dependent variables, aliases, and function calls that are part of the slice for all variables (both local and global) for the entire system. The method is implemented as a tool, called srcSlice, on top of srcML, an XML representation of source code. The approach is highly scalable and can generate the slices for all variables of the Linux kernel in approximately 20 min on a typical desktop. Benchmark results are compared with the CodeSurfer slicing tool from GrammaTech Inc., and the approach compares well with regard to accuracy of slices.

Abstract-A case study of three open source systems undergoing large adaptive maintenance tasks is presented. The adaptive maintenance task involves migrating each system to a new version of a third party API. The changes to support the migration were spread out over multiple years for each system. The first two systems are both part of KDE, namely KOffice and Extragear/graphics. The adaptive maintenance task, for both systems, involves migrating to a new version of Qt. The third system is OpenSceneGraph that underwent a migration to a new version of OpenGL. The case study involves sifting through tens of thousands of commits to identify only those commits involved in the specific adaptive maintenance task. The object is to develop a data set that will be used for developing automated methods to identify/characterize adaptive maintenance commits.

No abstract

Example-based transformational approaches to automate adaptive maintenance changes plays an important role in software research. One primary concern of those approaches is that a set of good qualified real examples of adaptive changes previously made in the history must be identified, or otherwise the adoption of such approaches will be put in question. Unfortunately, there is rarely enough detail to clearly direct transformation rule developers to overcome the barrier of finding qualified examples for adaptive changes. This work explores the histories of several open source systems to study the repetitiveness of adaptive changes in software evolution, and hence recognizing the source code change patterns that are strongly related with the adaptive maintenance. We collected the adaptive commits from the history of numerous open source systems, then we obtained the repetitiveness frequencies of source code changes based on the analysis of Abstract Syntax Tree (AST) edit actions within an adaptive commit. Using the prevalence of the most common adaptive changes, we suggested a set of change patterns that seem correlated with adaptive maintenance. It is observed that 76.93% of the undertaken adaptive changes were represented by 12 AST code differences. Moreover, only 9 change patterns covered 64.69% to 76.58% of the total adaptive change hunks in the examined projects. The most common individual patterns are related to initializing objects and method calls changes. A correlation analysis on examined projects shows that they have very similar frequencies of the patterns correlated with adaptive changes. The observed repeated adaptive changes could be useful examples for the construction of transformation approaches

Abstract-An information retrieval technique, latent semantic indexing (LSI), is used to automatically identify traceability links from system documentation to program source code. The experiment is performed in the TraceLab framework. The solution provides templates and components for building and querying LSI space and datasets (corpora) that can be used as inputs for these components. The proposed solution is evaluated on traceability links already discovered by mining adaptive commits of the open source system KDE/Koffice. The results show that the approach can identify of traceability links with high precision using TraceLab components.

An examination of the ability of machine learning methodologies in classifying women Waterpipe (WP) smoker's level of nicotine dependence is proposed in this work. In this study, we developed a classifier that predicts the level of nicotine dependence for WP tobacco female smokers using a set of novel features relevant to smokers including age, residency, and educational level. The evaluation results show that our approach achieves a recall of 82% when applied on a dataset of female WP smokers in Jordan.

Based on the reduction and redundancy methods, the reliability performance of the improved general series-parallel system is considered, assuming the connected components are identically independent and follow the general exponential lifetime model. To extend previous studies, the shape parameter is modified to obtain the reliability equivalence factors of the hot and cold duplications. A hybrid of the hot and cold duplication methods is also considered. Numerical results from a practical example are investigated to illustrate the derived theoretical results of the overall study.