Abstract

Abstract
Obstructive sleep apnea is a heterogeneous sleep disorder with varying phenotypes. Several studies have already performed cluster analyses to discover various obstructive sleep apnea phenotypic clusters. However, the selection of the clustering method might affect the outputs. Consequently, it is unclear whether similar obstructive sleep apnea clusters can be reproduced using different clustering methods. In this study, we applied four well-known clustering methods: Agglomerative Hierarchical Clustering; K-means; Fuzzy C-means; and Gaussian Mixture Model to a population of 865 suspected obstructive sleep apnea patients. By creating five clusters with each method, we examined the effect of clustering methods on forming obstructive sleep apnea clusters and the differences in their physiological characteristics. We utilized a visualization technique to indicate the cluster formations, Cohen's kappa statistics to find the similarity and agreement between clustering methods, and performance evaluation to compare the clustering performance. As a result, two out of five clusters were distinctly different with all four methods, while three other clusters exhibited overlapping features across all methods. In terms of agreement, Fuzzy C-means and K-means had the strongest (kappa = 0.87), and Agglomerative hierarchical clustering and Gaussian Mixture Model had the weakest agreement (kappa = 0.51) between each other. The K-means showed the best clustering performance, followed by the Fuzzy C-means in most evaluation criteria. Moreover, Fuzzy C-means showed the greatest potential in handling overlapping clusters compared with other methods. In conclusion, we revealed a direct impact of clustering method selection on the formation and physiological characteristics of obstructive sleep apnea clusters. In addition, we highlighted the capability of soft clustering methods, particularly Fuzzy C-means, in the application of obstructive sleep apnea phenotyping.

Abstract

Abstract
The rapid proliferation of Internet of Things (IoT) systems, encompassing a wide range of devices and sensors with limited battery life, has highlighted the critical need for energy-efficient solutions to extend the operational lifespan of these battery-powered devices. One effective strategy for reducing energy consumption is minimizing the number and size of retransmitted packets in case of communication errors. Among the potential solutions, Incremental Redundancy Hybrid Automatic Repeat reQuest (IR-HARQ) communication schemes have emerged as particularly compelling options by adopting the best aspects of error control, namely, automatic repetition and variable redundancy. This work addresses the challenge by developing a simulator capable of executing and analysing several (H)ARQ schemes using different channel models, such as the Additive White Gaussian Noise (AWGN) and Gilbert-Elliott (GE) models. The primary objective is to compare their performance across multiple metrics, enabling a thorough evaluation of their capabilities. The results indicate that IR-HARQ outperforms alternative methods, especially in the presence of burst errors. Furthermore, its potential for further adaptation and enhancement opens up new ways for optimizing energy consumption and extending the lifespan of battery-powered IoT devices.

Abstract
The Sub-THz and millimeter-wave bands have gained popularity, with the expectation that they will host the next generation of wireless communication systems. Furthermore, research on beam-steering characteristics provided by Programmable Electromagnetic Surfaces, such as Reflective Intelligent Surfaces (RISs), has garnered considerable attention as an enabling technology for 6G communications. Due to size limitations, RISs face challenges related to power consumption in the reconfigurable elements and their integration with unit cells operating at high frequencies. This paper discusses the design of a 1-bit reconfigurable unit cell at the D-band using non-volatile technology to minimize static power consumption. Simulation results show that the proposed unit cell performs well with a reflection loss of less than 1.3 dB in both reconfigurable states across a frequency band from 120 to 170 GHz. Moreover, the phase difference between the two states is maintained at 180? ± 20?, with an operational bandwidth of approximately 16 GHz. The beamforming capabilities, with steering angles from -60? to 60?, of the 12×12 RIS, utilizing the proposed unit cell, have been demonstrated in terms of controlling the main beam radiation precisely to various angles with consistent performance at frequencies of 147 GHz, 152 GHz, and 152.5 GHz. © 2024 IEEE.

Abstract
It is well known that the performance of Machine Learning techniques, notably when applied to Computer Vision (CV), depends heavily on the amount and quality of the training data set. However, large data sets lead to time-consuming training loops and, in many situations, are difficult or even impossible to create. Therefore, there is a need for solutions to reduce their size while ensuring good levels of performance, i.e., solutions that obtain the best tradeoff between the amount/quality of training data and the model's performance. This paper proposes a dataset reduction approach for training data used in Deep Learning methods in Facial Recognition (FR) problems. We focus on maximizing the variability of representations for each subject (person) in the training data, thus favoring quality instead of size. The main research questions are: 1) Which facial features better discriminate different identities? 2) Will it be possible to significantly reduce the training time without compromising performance? 3) Should we favor quality over quantity for very large datasets in FR? This analysis uses a pipeline to discriminate a set of features suitable for capturing the diversity and a cluster-based sampling to select the best images for each training subject, i.e., person. Results were obtained using VGGFace2 and Labeled Faces in the Wild (for benchmarking) and show that, with the proposed approach, a data reduction is possible while ensuring similar levels of accuracy.