Search

Atrial fibrillation (AF), the most common cardiac arrhythmia, is associated with heart failure and stroke. Accurate segmentation of the left atrium (LA) in 3D late gadolinium-enhanced (LGE) MRI is helpful for evaluating AF, as fibrotic remodeling in the LA myocardium contributes to arrhythmia and serves as a key determinant of therapeutic strategies. However, manual LA segmentation is labor-intensive and challenging. Recent foundational deep learning models, such as the Segment Anything Model (SAM), pre-trained on diverse datasets, have demonstrated promise in generic segmentation tasks. MedSAM, a fine-tuned version of SAM for medical applications, enables efficient, zero-shot segmentation without domain-specific training. Despite the potential of MedSAM model, it has not yet been evaluated for the complex task of LA segmentation in 3D LGE-MRI. This study aims to (1) evaluate the performance of MedSAM in automating LA segmentation, (2) compare the performance of the MedSAM2 model, which uses a single prompt with automated tracking, with the MedSAM1 model, which requires separate prompt for each slice, and (3) analyze the performance of MedSAM1 in terms of Dice score(i.e., segmentation accuracy) by varying the size and location of the box prompt.

Non-orthogonal multiple access (NOMA) is a promising technique for ultra-reliable low-latency communication as it provides higher spectral efficiency and lower latency. In this work, we propose novel many-to-many (M2M) NOMA-based schemes to exchange broadcast, multicast, and unicast messages between cluster heads (CHs) of vehicular platoons. Specifically, we design uplink-M2M-NOMA (UM-NOMA), downlink-M2M-NOMA (DM-NOMA) and joint uplink-downlink-M2M-NOMA (UDM-NOMA) schemes for peer-to-peer vehicular ad hoc networks (VANETs). We propose a unique clustering design for full-duplex communication that utilizes the high throughput millimeter-wave (mmWave) channels. Furthermore, we investigate jointly optimal CH selection (CHS) and power allocation (PA) to maximize the network sum rate and devise a computationally efficient tailored-greedy algorithm that yields near-optimal performance. We also propose a super-cluster formation protocol to further limit the overhead of successive interference cancellation (SIC). The results reveal that in most of the considered scenarios, the proposed UDM-NOMA scheme outperforms orthogonal multiple access (OMA) in terms of sum rate by up to 50% even when the SIC receiver errors reach 10%.

The classification of IoT traffic is important to improve the efficiency and security of IoT-based networks. As the state-of-the-art classification methods are based on Deep Learning, most of the current results require a large amount of data to be trained. Thereby, in real-life situations, where there is a scarce amount of IoT traffic data, the models would not perform so well. Consequently, these models underperform outside their initial training conditions and fail to capture the complex characteristics of network traffic, rendering them inefficient and unreliable in real-world applications. In this paper, we propose IoT Traffic Classification Transformer (ITCT), a novel approach that utilizes the state-of-the-art transformer-based model named TabTransformer. ITCT, which is pre-trained on a large labeled MQTT-based IoT traffic dataset and may be fine-tuned with a small set of labeled data, showed promising results in various traffic classification tasks. Our experiments demonstrated that the ITCT model significantly outperforms existing models, achieving an overall accuracy of 82%. To support reproducibility and collaborative development, all associated code has been made publicly available., Comment: Updated version of: B. Bazaluk, M. Hamdan, M. Ghaleb, M. S. M. Gismalla, F. S. Correa da Silva and D. M. Batista, "Towards a Transformer-Based Pre-trained Model for IoT Traffic Classification," NOMS 2024-2024 IEEE Network Operations and Management Symposium, Seoul, Korea, Republic of, 2024, pp. 1-7, doi: 10.1109/NOMS59830.2024.10575448

To effectively express and satisfy network application requirements, intent-based network management has emerged as a promising solution. In intent-based methods, users and applications express their intent in a high-level abstract language to the network. Although this abstraction simplifies network operation, it induces many challenges to efficiently express applications' intents and map them to different network capabilities. Therefore, in this work, we propose an AI-based framework for intent profiling and translation. We consider a scenario where applications interacting with the network express their needs for network services in their domain language. The machine-to-machine communication (i.e., between applications and the network) is complex since it requires networks to learn how to understand the domain languages of each application, which is neither practical nor scalable. Instead, a framework based on emergent communication is proposed for intent profiling, in which applications express their abstract quality-of-experience (QoE) intents to the network through emergent communication messages. Subsequently, the network learns how to interpret these communication messages and map them to network capabilities (i.e., slices) to guarantee the requested Quality-of-Service (QoS). Simulation results show that the proposed method outperforms self-learning slicing and other baselines, and achieves a performance close to the perfect knowledge baseline.

In traditional Fog-Radio Access Networks (F-RANs), enhanced remote radio heads (eRRHs) are connected to a macro base station (MBS) through fronthaul links. Deploying a massive number of eRRHs is not always feasible due to site constraints and the cost of fronthaul links. This paper introduces an innovative concept of using smart helpers (SHs) in F-RANs. These SHs do not require fronthaul links and listen to the nearby eRRHs' communications. Then, they smartly select and cache popular content. This capability enables SHs to serve users with frequent on-demand service requests potentially. As such, network operators have the flexibility to easily deploy SHs in various scenarios, such as dense urban areas and temporary public events, to expand their F-RANs and improve the quality of service (QoS). To study the performance of the proposed SH-aided F-RAN, we formulate an optimization problem of minimizing the average transmission delay that jointly optimizes cache resources and user scheduling. To tackle the formulated problem, we develop an innovative multi-stage algorithm that uses a reinforcement learning (RL) framework. Various performance measures, e.g., the average transmission delay, fronthaul load, and cache hit rate of the proposed SH-aided F-RAN are evaluated numerically and compared with those of traditional F-RANs., Comment: 13 pages

Reconfigurable intelligent surfaces (RISs) are expected to make future 6G networks more connected and resilient against node failures, due to their ability to introduce controllable phase-shifts onto impinging electromagnetic waves and impose link redundancy. Meanwhile, unmanned aerial vehicles (UAVs) are prone to failure due to limited energy, random failures, or targeted failures, which causes network disintegration that results in information delivery loss. In this paper, we show that the integration between UAVs and RISs for improving network connectivity is crucial. We utilize RISs to provide path diversity and alternative connectivity options for information flow from user equipments (UEs) to less critical UAVs by adding more links to the network, thereby making the network more resilient and connected. To that end, we first define the criticality of UAV nodes, which reflects the importance of some nodes over other nodes. We then employ the algebraic connectivity metric, which is adjusted by the reflected links of the RISs and their criticality weights, to formulate the problem of maximizing the network connectivity. Such problem is a computationally expensive combinatorial optimization. To tackle this problem, we propose a relaxation method such that the discrete scheduling constraint of the problem is relaxed and becomes continuous. Leveraging this, we propose two efficient solutions, namely semi-definite programming (SDP) optimization and perturbation heuristic, which both solve the problem in polynomial time. For the perturbation heuristic, we derive the lower and upper bounds of the algebraic connectivity obtained by adding new links to the network. Finally, we corroborate the effectiveness of the proposed solutions through extensive simulation experiments., Comment: 14 pages, 8 figures, journal paper. arXiv admin note: text overlap with arXiv:2308.04675

CMOS-compatible Kerr microcombs have drawn substantial interest as mass-manufacturable, compact alternatives to bulk frequency combs. This could enable deployment of many comb-reliant applications previously confined to laboratories. Particularly enticing is the prospect of microcombs performing optical frequency division in compact optical atomic clocks. Unfortunately, it is difficult to meet the self-referencing requirement of microcombs in these systems due to the $\sim$THz repetition rates typically required for octave-spanning comb generation. Additionally, it is challenging to spectrally engineer a microcomb system to align a comb mode with an atomic clock transition with sufficient signal-to-noise ratio. Here, we adopt a Vernier dual-microcomb scheme for optical frequency division of a stabilized ultranarrow-linewidth continuous-wave laser at 871 nm to a $\sim$235 MHz output frequency. In addition to enabling measurement of the comb repetition rates, this scheme brings the freedom to pick comb lines from either or both of the combs. We exploit this flexibility to shift an ultra-high-frequency ($\sim$100 GHz) carrier-envelope offset beat down to frequencies where detection is possible and to place a comb line close to the 871 nm laser - tuned so that if frequency-doubled it would fall close to the clock transition in $^{171}$Yb$^+$. Moreover, we introduce a novel scheme which suppresses frequency noise arising from interferometric phase fluctuations in our dual-comb system and reduces the frequency instability down to our measurement limit. Our dual-comb system can potentially combine with an integrated ion trap toward future chip-scale optical atomic clocks.

This paper proposes a solution for energy-efficient communication in reconfigurable intelligent surface (RIS)-assisted unmanned aerial vehicle (UAV) networks. The limited battery life of UAVs is a major concern for their sustainable operation, and RIS has emerged as a promising solution to reducing the energy consumption of communication systems. The paper formulates the problem of maximizing the energy efficiency of the network as a mixed integer non-linear program, in which UAV placement, UAV beamforming, On-Off strategy of RIS elements, and phase shift of RIS elements are optimized. The proposed solution utilizes the block coordinate descent approach and a combination of continuous and binary genetic algorithms. Moreover, for optimizing the UAV placement, Adam optimizer is used. The simulation results show that the proposed solution outperforms the existing literature. Specifically, we compared the proposed method with the successive convex approximation (SCA) approach for optimizing the phase shift of RIS elements.

It is anticipated that integrating unmanned aerial vehicles (UAVs) with reconfigurable intelligent surfaces (RISs), resulting in RIS-assisted UAV networks, will offer improved network connectivity against node failures for the beyond 5G networks. In this context, we utilize a RIS to provide path diversity and alternative connectivity options for information flow from user equipment (UE) to UAVs by adding more links to the network, thereby maximizing its connectivity. This paper employs the algebraic connectivity metric, which is adjusted by the reflected links of the RIS, to formulate the problem of maximizing the network connectivity in two cases. First, we consider formulating the problem for one UE, which is solved optimally using a linear search. Then, we consider the problem of a more general case of multiple UEs, which has high computational complexity. To tackle this problem, we formulate the problem of maximizing the network connectivity as a semi-definite programming (SDP) optimization problem that can be solved efficiently in polynomial time. In both cases, our proposed solutions find the best combination between UE(s) and UAVs through the RIS. As a result, it tunes the phase shifts of the RIS to direct the signals of the UEs to the appropriate UAVs, thus maximizing the network connectivity. Simulation results are conducted to assess the performance of the proposed solutions compared to the existing solutions., Comment: 7 pages, 5 figures, conference