Search

Epilepsy affects millions worldwide, making timely seizure detection crucial for effective treatment and enhanced well-being. Electroencephalogram (EEG) analysis offers a non-intrusive solution, but its visual interpretation is prone to errors and requires a lot of time. Many existing works focus solely on achieving competitive levels of accuracy without considering processing speed or the computational complexity of their models. This study aimed to develop an automated technique for identifying epileptic seizures in EEG data through analysis methods. The efforts have been primarily focused on achieving high accuracy results by operating exclusively within a narrow frequency band of the signal, while also aiming to minimize computational complexity. In this article, a new automated approach is presented for seizure detection by combining signal processing and machine learning techniques. The proposed method comprises four stages: (1) Preprocessing: Savitzky–Golay filter to remove the background noise. (2) Decomposition: discrete wavelet transform (DWT) to extract spontaneous alpha and beta frequency bands. (3) Feature extraction: six features (mean, standard deviation, skewness, kurtosis, energy, and entropy) are computed for each frequency band. (4) Classification: a support vector machine (SVM) method classifies signals as normal or containing a seizure. The method was assessed using two publicly available EEG datasets. For the alpha band, the highest achieved accuracy was 92.82%, and for the beta band it was 90.55%, which demonstrates adequate capability in both bands for accurate seizure detection. Furthermore, the obtained low computational cost suggests a potentially valuable application in real-time assessment scenarios. The obtained results indicate its capacity as a valuable instrument for diagnosing epilepsy and monitoring patients. Further research is necessary for clinical validation and potential real-time deployment. [ABSTRACT FROM AUTHOR]

Let G V , E be a simple undirected complete graph with vertex and edge sets V and E , respectively. In this paper, we consider the degree-constrained k -minimum spanning tree (DC k MST) problem which consists of finding a minimum cost subtree of G formed with at least k vertices of V where the degree of each vertex is less than or equal to an integer value d ≤ k − 2. In particular, in this paper, we consider degree values of d ∈ 2,3 . Notice that DC k MST generalizes both the classical degree-constrained and k -minimum spanning tree problems simultaneously. In particular, when d = 2 , it reduces to a k -Hamiltonian path problem. Application domains where DC k MST can be adapted or directly utilized include backbone network structures in telecommunications, facility location, and transportation networks, to name a few. It is easy to see from the literature that the DC k MST problem has not been studied in depth so far. Thus, our main contributions in this paper can be highlighted as follows. We propose three mixed-integer linear programming (MILP) models for the DC k MST problem and derive for each one an equivalent counterpart by using the handshaking lemma. Then, we further propose ant colony optimization (ACO) and variable neighborhood search (VNS) algorithms. Each proposed ACO and VNS method is also compared with another variant of it which is obtained while embedding a Q-learning strategy. We also propose a pure Q-learning algorithm that is competitive with the ACO ones. Finally, we conduct substantial numerical experiments using benchmark input graph instances from TSPLIB and randomly generated ones with uniform and Euclidean distance costs with up to 400 nodes. Our numerical results indicate that the proposed models and algorithms allow obtaining optimal and near-optimal solutions, respectively. Moreover, we report better solutions than CPLEX for the large-size instances. Ultimately, the empirical evidence shows that the proposed Q-learning strategies can bring considerable improvements. [ABSTRACT FROM AUTHOR]

This paper proposes a new system based on the Industrial Internet of Things (IIoT) for the monitoring of Mobile Health (m-Health) of workers in the underground mining industry. The proposed architecture uses a hybrid model in data transmission. Visible Light Communication (VLC) is used for downlink because of its narrow coverage, which aids in worker positioning. Radio frequency (RF) communication technology is used to send data for primary vital signs in the uplink, which is more efficient in transmission and is a viable solution according to the problem raised. The results obtained in terms of coverage and transmission for the downlink and uplink links show the feasibility of implementing the proposed system.