The imbalanced data classification problem widely exists in many real-world applications. Data resampling is a promising technique to deal with imbalanced data through either oversampling or undersampling. However, the traditional data resampling approaches simply take into account the local neighbor information to generate new instances in linear ways, leading to the generation of incorrect and unnecessary instances. In this study, we propose a new data resampling technique, namely, Gaussian Distribution based Oversampling (GDO). In GDO, anchor instances are selected from the minority class instances in a probabilistic way by taking into account the density and distance information carried by the minority instances. Then new minority instances are generated following a Gaussian distribution model. The proposed method is validated by comparing with seven imbalanced learning approaches on 40 data sets from the KEEL repository and 10 large data sets from the UCI repository. Experimental results show that our method outperforms the other compared methods in terms of AUC, G-mean and memory usage with an increase in running time. We also apply GDO to two real imbalanced data classification problems: Internet video traffic identification and metastasis detection of esophageal cancer. The experimental results once again validate the effectiveness of our approach.

This paper presents a novel solution to address the challenges in achieving energy efficiency and cooperation for collision avoidance in UAV swarms. The proposed method combines Artificial Potential Field (APF) and Particle Swarm Optimization (PSO) techniques. APF provides environmental awareness and implicit coordination to UAVs, while PSO searches for collision-free and energy-efficient trajectories for each UAV in a decentralized manner under the implicit coordination. This decentralized approach is achieved by minimizing a novel cost function that leverages the advantages of the active contour model from image processing. Additionally, future trajectories are predicted by approximating the minima of the novel cost function using calculus of variation, which enables proactive actions and defines the initial conditions for PSO. We propose a two-branch trajectory planning framework that ensures UAVs only change altitudes when necessary for energy considerations. Extensive experiments are conducted to evaluate the effectiveness and efficiency of our method in various situations.

Sleep stage and Apnea-Hypopnea Index (AHI) are the most important metrics in the diagnosis of sleep syndrome disease. In previous studies, these two tasks are usually implemented separately, which is both time and resource consuming. In this work, we propose a novel single EEG based collaborative learning network (EEG-CLNet) for simultaneous sleep staging and obstructive sleep apnea (OSA) event detection through multi-task collaborative learning. The EEG-CLNet regards different tasks as a common unit to extract features from intra-groups via both local parameter sharing and cross task knowledge distillation, rather than just sharing parameters or shortening the distance between different tasks. Our approach has been validated on two datasets with the same or better performance than other methods. The experimental results show that our method achieves a performance gain of 1% - 5% compared with the baseline. Compared to previous works where two or even more models were required to perform sleep staging and OSA event detection, The EEG-CLNet could reduce the total number of model parameters and facilitate the model to mine the hidden relationships between different task semantic information. More importantly, it effectively alleviates the task bias problem in hard parameter sharing. As a consequence, this approach has notable potential to be a solution for lightweight wearable sleep monitoring system in the future.

The continuing increase in the incidence and recognition of children's sleep disorders has heightened the demand for automatic pediatric sleep staging. Supervised sleep stage recognition algorithms, however, are often faced with challenges such as limited availability of pediatric sleep physicians and data heterogeneity. Drawing upon two quickly advancing fields, i.e., semi-supervised learning and self-supervised contrastive learning, we propose a multi-task contrastive learning strategy for semi-supervised pediatric sleep stage recognition, abbreviated as MtCLSS. Specifically, signal-adapted transformations are applied to electroencephalogram (EEG) recordings of the full night polysomnogram, which facilitates the network to improve its representation ability through identifying the transformations. We also introduce an extension of contrastive loss function, thus adapting contrastive learning to the semi-supervised setting. In this way, the proposed framework learns not only task-specific features from a small amount of supervised data, but also extracts general features from signal transformations, improving the model robustness. MtCLSS is evaluated on a real-world pediatric sleep dataset with promising performance (0.80 accuracy, 0.78 F1-score and 0.74 kappa). We also examine its generality on a well-known public dataset. The experimental results demonstrate the effectiveness of the MtCLSS framework for EEG based automatic pediatric sleep staging in very limited labeled data scenarios.

This paper studies the problem of optimal forwarding for reliable and energy-efficient real-time communication over multi-hop wireless lossy networks. We impose a strict per-packet latency bound and develop forwarding policies that maximize the probability that the packet is delivered within the specified deadline minus a transmission energy cost. A solution to this problem allows to characterize the set of achievable latency-reliability pairs and to trace out the Pareto frontier between achievable deadline-constrained reliability and transmission energy cost. We develop dynamic programming-based solutions under a finite-state Markov channel model. Particular instances with Bernoulli and Gilbert-Elliot loss models that admit numerically efficient solutions are discussed and our results are demonstrated on several examples.