pwc-archive/papers-with-abstracts huggingface dataset:
Electromagnetic Wave Property Inspired Radio Environment Knowledge Construction and AI-based Verification for 6G Digital Twin Channel
Authors: Jialin Wang, Jianhua Zhang, Yutong Sun, Yuxiang Zhang, Tao Jiang, Liang Xia
Date: 2024-06-02 00:00:00

As the underlying foundation of a digital twin network (DTN), a digital twin channel (DTC) can accurately depict the process of radio propagation in the air interface to support the DTN-based 6G wireless network. Since radio propagation is affected by the environment, constructing the relationship between the environment and radio wave propagation is the key to improving the accuracy of DTC, and the construction method based on artificial intelligence (AI) is the most concentrated. However, in the existing methods, the environment information input into the neural network (NN) has many dimensions, and the correlation between the environment and the channel relationship is unclear, resulting in a highly complex relationship construction process. To solve this issue, in this paper, we propose a construction method of radio environment knowledge (REK) inspired by the electromagnetic wave property to quantify the contribution of radio propagation. Specifically, a range selection scheme for effective environment information based on random geometry is proposed to reduce the redundancy of environment information. We quantify the contribution of radio propagation reflection, diffraction and scatterer blockage using environment information and propose a flow chart of REK construction to replace the feature extraction process partially based on NN. To validate REK's effectiveness, we conduct a path loss prediction task based on a lightweight convolutional neural network (CNN) employing a simple two-layer convolutional structure. The results show that the accuracy of the range selection method reaches 90\%; the constructed REK maintains the prediction error of 0.3 and only needs 0.04 seconds of testing time, effectively reducing the network complexity.
Multipath Exploitation for Fluctuating Target Detection in RIS-Assisted ISAC Systems
Authors: Shoushuo Zhang, Zichao Xiao, Rang Liu, Ming Li, Wei Wang, Qian Liu
Date: 2024-06-02 00:00:00
Tasks: Diversity, Integrated sensing and communication, ISAC

Integrated sensing and communication (ISAC) systems are typically deployed in multipath environments, which is usually deemed as a challenging issue for wireless communications. However, the multipath propagation can also provide extra illumination and observation perspectives for radar sensing, which offers spatial diversity gain for detecting targets with spatial radar cross-section (RCS) fluctuations. In this letter, we propose to utilize reconfigurable intelligent surfaces (RIS) in ISAC systems to provide high-quality and controllable multipath propagation for improving the performance of fluctuating target detection and simultaneously enhancing the quality of communication services. To effectively exploit the spatial diversity offered by RIS-empowered multipath, the dual-functional transmit beamforming and the RIS reflection beamforming are jointly designed to maximize the expectation of radar signal-to-noise ratio (SNR). To solve the resulting complex non-convex optimization problem, we develop an efficient alternating optimization algorithm that utilizes majorization-minimization (MM) and alternating direction method of multipliers (ADMM) algorithms. Simulation results illustrate the advantages of multipath exploitation and the proposed beamforming design algorithm for fluctuating target detection in RIS-assisted ISAC systems.
Joint Detection and Classification of Communication and Radar Signals in Congested RF Environments Using YOLOv8
Authors: Xiwen Kang, Hua-mei Chen, Genshe Chen, Kuo-Chu Chang, Thomas M. Clemons
Date: 2024-06-02 00:00:00

In this paper, we present a comprehensive study on the application of YOLOv8, a state-of-the-art computer vision (CV) model, to the challenging problem of joint detection and classification of signals in a highly dynamic and congested RF environment. Using our synthetic RF datasets, we explored three different scenarios with congested communication and radar signals. In the first study, we applied YOLOv8 to detect and classify multiple digital modulation signals coexisting within a highly congested and dynamic spectral environment with significant overlap in both frequency and time domains. The trained model was able to achieve an impressive mean average precision (mAP) of 0.888 at an IoU threshold of 50%, signifying its robustness against spectral congestion. The second part of our research focuses on the detection and classification of multiple polyphase pulse radar signals, including Frank code and P1 through P4 codes. We were able to successfully train YOLOv8 to deliver a nearly perfect mAP50 score of 0.995 in a densely populated signal environment, further showcasing its capability in radar signal processing. In the last scenario, we demonstrated that the model can also be applied to the multi-target detection problem for continuous-wave radar. The synthetic datasets used in these experiments reflect a realistic mix of communication and radar signals with varying degrees of interference and congestion - a setup that has been overlooked by many past research efforts, which have primarily focused on ML-based classification of digital communication signal modulation schemes. Our study demonstrated the potential of advanced CV models in addressing spectrum sensing challenges in congested and dynamic RF environments involving both communication and radar signals. We hope our findings will spur further collaborative efforts to tackle the complexities of congested RF spectrum environments.
An Unsupervised Approach for Periodic Source Detection in Time Series
Authors: Berken Utku Demirel, Christian Holz
Date: 2024-06-01 00:00:00
Tasks: Self-Supervised Learning, Time Series

Detection of periodic patterns of interest within noisy time series data plays a critical role in various tasks, spanning from health monitoring to behavior analysis. Existing learning techniques often rely on labels or clean versions of signals for detecting the periodicity, and those employing self-supervised learning methods are required to apply proper augmentations, which is already challenging for time series and can result in collapse -- all representations collapse to a single point due to strong augmentations. In this work, we propose a novel method to detect the periodicity in time series without the need for any labels or requiring tailored positive or negative data generation mechanisms with specific augmentations. We mitigate the collapse issue by ensuring the learned representations retain information from the original samples without imposing any random variance constraints on the batch. Our experiments in three time series tasks against state-of-the-art learning methods show that the proposed approach consistently outperforms prior works, achieving performance improvements of more than 45--50\%, showing its effectiveness. Code: https://github.com/eth-siplab/Unsupervised_Periodicity_Detection
Exploring Channel Estimation and Signal Detection for ODDM-based ISAC Systems
Authors: Dezhi Wang, Chongwen Huang, Lei Liu, Xiaoming Chen, Wei Wang, Zhaoyang Zhang, Chau Yuen, Mérouane Debbah
Date: 2024-06-01 00:00:00
Tasks: Integrated sensing and communication, ISAC

Inspired by providing reliable communications for high-mobility scenarios, in this letter, we investigate the channel estimation and signal detection in integrated sensing and communication~(ISAC) systems based on the orthogonal delay-Doppler multiplexing~(ODDM) modulation, which consists of a pulse-train that can achieve the orthogonality with respect to the resolution of the delay-Doppler~(DD) plane. To enhance the communication performance in the ODDM-based ISAC systems, we first propose a low-complexity approximation algorithm for channel estimation, which addresses the challenge of the high complexity from high resolution in the ODDM modulation, and achieves performance close to that of the maximum likelihood estimator scheme. Then, we employ the orthogonal approximate message-passing scheme to detect the symbols in the communication process based on the estimated channel information. Finally, simulation results show that the detection performance of ODDM is better than other multi-carrier modulation schemes. Specifically, the ODDM outperforms the orthogonal time frequency space scheme by 2.3 dB when the bit error ratio is $10^{-6}$.
Optimizing 6G Integrated Sensing and Communications (ISAC) via Expert Networks
Authors: Jiacheng Wang, Hongyang Du, Geng Sun, Jiawen Kang, Haibo Zhou, Dusit Niyato, Jiming Chen
Date: 2024-06-01 00:00:00
Tasks: ISAC, Mixture-of-Experts

Integrated Sensing and Communications (ISAC) is one of the core technologies of 6G, which combines sensing and communication functions into a single system. However, limited computing and storage resources make it impractical to combine multiple sensing models into a single device, constraining the system's function and performance. Therefore, this article proposes enhancing ISAC with the mixture of experts (MoE) architecture. Rigorously, we first investigate ISAC and MoE, including their concepts, advantages, and applications. Then, we explore how MoE can enhance ISAC from the perspectives of signal processing and network optimization. Building on this, we propose an MoE based ISAC framework, which uses a gating network to selectively activate multiple experts in handling sensing tasks under given communication conditions, thereby improving the overall performance. The case study demonstrates that the proposed framework can effectively increase the accuracy and robustness in detecting targets by using wireless communication signal, providing strong support for the practical deployment and applications of the ISAC system.
Patterned Beam Training: A Novel Low-Complexity and Low-Overhead Scheme for ELAA
Authors: Hongkang Yu, Yuan Si, Shujuan Zhang, Yijian Chen
Date: 2024-06-01 00:00:00

Extremely large antenna arrays (ELAAs) can provide higher spectral efficiency. However, the use of narrower beams for data transmission significantly increases the overhead associated with beam training. In this letter, we propose a novel patterned beam training (PBT) scheme characterized by its low overhead and complexity. This scheme requires only a single linear operation by both the base station and the user equipment to determine the optimal beam, reducing the training overhead to half or even less compared to traditional exhaustive search methods. Furthermore, We discuss the pattern design principles in detail and provide specific forms. Simulation results demonstrate that the proposed scheme outperforms the compared methods in terms of beam alignment accuracy and achieves a balance between signal-to-noise ratio (SNR) conditions and training overhead, making it a promising alternative.
Plug-in UL-CSI-Assisted Precoder Upsampling Approach in Cellular FDD Systems
Authors: Yu-Chien Lin, Yan Xin, Ta-Sung Lee, Charlie, Zhang, Yibo Ma, Zhi Ding
Date: 2024-05-31 00:00:00

Acquiring downlink channel state information (CSI) is crucial for optimizing performance in massive Multiple Input Multiple Output (MIMO) systems operating under Frequency-Division Duplexing (FDD). Most cellular wireless communication systems employ codebook-based precoder designs, which offer advantages such as simpler, more efficient feedback mechanisms and reduced feedback overhead. Common codebook-based approaches include Type II and eType II precoding methods defined in the 3GPP standards. Feedback in these systems is typically standardized per subband (SB), allowing user equipment (UE) to select the optimal precoder from the codebook for each SB, thereby reducing feedback overhead. However, this subband-level feedback resolution may not suffice for frequency-selective channels. This paper addresses this issue by introducing an uplink CSI-assisted precoder upsampling module deployed at the gNodeB. This module upsamples SB-level precoders to resource block (RB)-level precoders, acting as a plug-in compatible with existing gNodeB or base stations.
Spatial Impulse Response Analysis and Ensemble Learning for Efficient Precision Level Sensing
Authors: Berkay Cetkin, Lejla Begic Fazlic, Kristof Ueding, Rüdiger Machhamer, Achim Guldner, Lars Creutz, Stefan Naumann, Guido Dartmann
Date: 2024-05-13 00:00:00
Tasks: Ensemble Learning, Management

In this paper, we propose an innovative method for determining the fill level of containers, such as trash cans, addressing a critical aspect of waste management. The method combines spatial impulse response analysis with machine learning (ML) techniques, offering a unique and effective approach for sound-based classification that can be extended to various domains beyond waste management. By employing a buzzer-generated sine sweep signal, we create a distinctive signature specific to the fill level of the waste container. This signature, once accurately decoded, is then interpreted by a specially developed ensemble learning algorithm. Our approach achieves a classification accuracy of over 90% when implemented locally on a development board, optimizing operational efficiencies and eliminating the need to delegate complex classification tasks to external entities. Using low-cost and energy-efficient hardware components, our method offers a cost-effective approach that contributes to sustainable and efficient waste management practices, providing a reliable and locally deployable solution.
Achieving Distributed MIMO Performance with Repeater-Assisted Cellular Massive MIMO
Authors: Sara Willhammar, Hiroki Iimori, Joao Vieira, Lars Sundström, Fredrik Tufvesson, Erik G. Larsson
Date: 2024-05-31 00:00:00
Tasks: Diversity

In what ways could cellular massive MIMO be improved? This technology has already been shown to bring huge performance gains. However, coverage holes and difficulties to transmit multiple streams to multi-antenna users because of insufficient channel rank remain issues. Distributed MIMO, also known as cell-free massive MIMO, might be the ultimate solution. However, while being a powerful technology, it is expensive to install backhaul, and it is a difficult problem to achieve accurate phase alignment for coherent multi-user beamforming on downlink. Another option is reflective intelligent surfaces - but they have large form factors and require a lot of training and control overhead, and probably, in practice, some form of active filtering to make them sufficiently band-selective. We propose a new approach to densification of cellular systems, envisioning repeater-assisted cellular massive MIMO, where a large numbers of physically small and cheap wireless repeaters are deployed. They receive and retransmit signals instantaneously, appearing as active scatterers. Meaning that they appear as ordinary channel scatterers but with amplification. We elaborate on the requirements of such repeaters, show that the performance of these systems could potentially approach that of distributed MIMO, and outline future research directions.
An application of node and edge nonlinear hypergraph centrality to a protein complex hypernetwork
Authors: Sarah Lawson, Diane Donovan, James Lefevre
Date: 2024-06-04 00:00:00

The use of graph centrality measures applied to biological networks, such as protein interaction networks, underpins much research into identifying key players within biological processes. This approach however is restricted to dyadic interactions and it is well-known that in many instances interactions are polyadic. In this study we illustrate the merit of using hypergraph centrality applied to a hypernetwork as an alternative. Specifically, we review and propose an extension to a recently introduced node and edge nonlinear hypergraph centrality model which provides mutually dependent node and edge centralities. A Saccharomyces Cerevisiae protein complex hypernetwork is used as an example application with nodes representing proteins and hyperedges representing protein complexes. The resulting rankings of the nodes and edges are considered to see if they provide insight into the essentiality of the proteins and complexes. We find that certain variations of the model predict essentiality more accurately and that the degree-based variation illustrates that the centrality-lethality rule extends to a hypergraph setting. In particular, through exploitation of the models flexibility, we identify small sets of proteins densely populated with essential proteins. One of the key advantages of applying this model to a protein complex hypernetwork is that it also provides a classification method for protein complexes, unlike previous approaches which are only concerned with classifying proteins.
Mapping dynamical systems into chemical reactions
Authors: Tomislav Plesa
Date: 2024-06-05 00:00:00

Polynomial dynamical systems (DSs) can model a wide range of physical processes. A special subset of these DSs that can model chemical reactions under mass-action kinetics is called chemical dynamical systems (CDSs). A central problem in synthetic biology is to map polynomial DSs into dynamically similar CDSs. In this paper, we introduce the quasi-chemical map (QCM) that can systematically solve this problem. The QCM introduces suitable state-dependent perturbations into any given polynomial DS which then becomes a CDS under sufficiently large translations of variables. This map preserves robust features, such as generic equilibria and limit cycles, as well as temporal properties, such as periods of oscillations. Furthermore, the resulting CDSs are at most one degree higher than the original DSs. We demonstrate the QCM by designing relatively simple CDSs with exotic dynamics and bifurcations, and addressing Hilbert's 16th problem in chemistry.
Recurrent neural chemical reaction networks that approximate arbitrary dynamics
Authors: Alexander Dack, Benjamin Qureshi, Thomas E. Ouldridge, Tomislav Plesa
Date: 2024-06-05 00:00:00

Many important phenomena in biochemistry and biology exploit dynamical features such as multi-stability, oscillations, and chaos. Construction of novel chemical systems with such rich dynamics is a challenging problem central to the fields of synthetic biology and molecular nanotechnology. In this paper, we address this problem by putting forward a molecular version of a recurrent artificial neural network, which we call recurrent neural chemical reaction network (RNCRN). The RNCRN uses a modular architecture - a network of chemical neurons - to approximate arbitrary dynamics. We first prove that with sufficiently many chemical neurons and suitably fast reactions, the RNCRN can be systematically trained to achieve any dynamics. RNCRNs with relatively small number of chemical neurons and a moderate range of reaction rates are then trained to display a variety of biologically-important dynamical features. We also demonstrate that such RNCRNs are experimentally implementable with DNA-strand-displacement technologies.
Non-geodesically-convex optimization in the Wasserstein space
Authors: Hoang Phuc Hau Luu, Hanlin Yu, Bernardo Williams, Petrus Mikkola, Marcelo Hartmann, Kai Puolamäki, Arto Klami
Date: 2024-06-01 00:00:00

We study a class of optimization problems in the Wasserstein space (the space of probability measures) where the objective function is nonconvex along generalized geodesics. Specifically, the objective exhibits some difference-of-convex structure along these geodesics. The setting also encompasses sampling problems where the logarithm of the target distribution is difference-of-convex. We derive multiple convergence insights for a novel semi Forward-Backward Euler scheme under several nonconvex (and possibly nonsmooth) regimes. Notably, the semi Forward-Backward Euler is just a slight modification of the Forward-Backward Euler whose convergence is -- to our knowledge -- still unknown in our very general non-geodesically-convex setting.
Efficient Sign-Based Optimization: Accelerating Convergence via Variance Reduction
Authors: Wei Jiang, Sifan Yang, Wenhao Yang, Lijun Zhang
Date: 2024-06-01 00:00:00

Sign stochastic gradient descent (signSGD) is a communication-efficient method that transmits only the sign of stochastic gradients for parameter updating. Existing literature has demonstrated that signSGD can achieve a convergence rate of $\mathcal{O}(d^{1/2}T^{-1/4})$, where $d$ represents the dimension and $T$ is the iteration number. In this paper, we improve this convergence rate to $\mathcal{O}(d^{1/2}T^{-1/3})$ by introducing the Sign-based Stochastic Variance Reduction (SSVR) method, which employs variance reduction estimators to track gradients and leverages their signs to update. For finite-sum problems, our method can be further enhanced to achieve a convergence rate of $\mathcal{O}(m^{1/4}d^{1/2}T^{-1/2})$, where $m$ denotes the number of component functions. Furthermore, we investigate the heterogeneous majority vote in distributed settings and introduce two novel algorithms that attain improved convergence rates of $\mathcal{O}(d^{1/2}T^{-1/2} + dn^{-1/2})$ and $\mathcal{O}(d^{1/4}T^{-1/4})$ respectively, outperforming the previous results of $\mathcal{O}(dT^{-1/4} + dn^{-1/2})$ and $\mathcal{O}(d^{3/8}T^{-1/8})$, where $n$ represents the number of nodes. Numerical experiments across different tasks validate the effectiveness of our proposed methods.
Long-term behavior of stochastic SIQRS epidemic models
Authors: Alexandru Hening, Dang H. Nguyen, Tran Ta, Sergiu C. Ungureanu
Date: 2024-06-03 00:00:00

In this paper we analyze and classify the dynamics of SIQRS epidemiological models with susceptible, infected, quarantined, and recovered classes, where the recovered individuals can become reinfected. We are able to treat general incidence functional responses. Our models are more realistic than what has been studied in the literature since they include two important types of random fluctuations. The first type is due to small fluctuations of the various model parameters and leads to white noise terms. The second type of noise is due to significant environment regime shifts in the that can happen at random. The environment switches randomly between a finite number of environmental states, each with a possibly different disease dynamic. We prove that the long-term fate of the disease is fully determined by a real-valued threshold $\lambda$. When $\lambda < 0$ the disease goes extinct asymptotically at an exponential rate. On the other hand, if $\lambda > 0$ the disease will persist indefinitely. We end our analysis by looking at some important examples where $\lambda$ can be computed explicitly, and by showcasing some simulation results that shed light on real-world situations.
Sifting through the Noise: A Survey of Diffusion Probabilistic Models and Their Applications to Biomolecules
Authors: Trevor Norton, Debswapna Bhattacharya
Date: 2024-05-31 00:00:00

Diffusion probabilistic models have made their way into a number of high-profile applications since their inception. In particular, there has been a wave of research into using diffusion models in the prediction and design of biomolecular structures and sequences. Their growing ubiquity makes it imperative for researchers in these fields to understand them. This paper serves as a general overview for the theory behind these models and the current state of research. We first introduce diffusion models and discuss common motifs used when applying them to biomolecules. We then present the significant outcomes achieved through the application of these models in generative and predictive tasks. This survey aims to provide readers with a comprehensive understanding of the increasingly critical role of diffusion models.