We present the Surveillance Forgery Image Test Range (SurFITR), a dataset for surveillance-style image forgery detection and localisation, in response to recent advances in open-access image generation models that raise concerns about falsifying visual evidence. Existing forgery models, trained on datasets with full-image synthesis or large manipulated regions in object-centric images, struggle to generalise to surveillance scenarios. This is because tampering in surveillance imagery is typically localised and subtle, occurring in scenes with varied viewpoints, small or occluded subjects, and lower visual quality. To address this gap, SurFITR provides a large collection of forensically valuable imagery generated via a multimodal LLM-powered pipeline, enabling semantically aware, fine-grained editing across diverse surveillance scenes. It contains over 137k tampered images with varying resolutions and edit types, generated using multiple image editing models. Extensive experiments show that existing detectors degrade significantly on SurFITR, while training on SurFITR yields substantial improvements in both in-domain and cross-domain performance. SurFITR is publicly available on GitHub.

The Holevo limit bounds the channel capacity of a communication channel in which information is encoded in quantum states in a Hilbert space at the transmitter and decoded using quantum measurements at the receiver. Saturating the Holevo limit requires quantum-limited transceivers that either generate quantum states of light or employ quantum-limited measurements. Here, we demonstrate an integrated photonic-electronic quantum-limited coherent receiver (QRX) achieving 14.0 dB shot noise clearance (SNC), 520 $μ$W knee power, 2.57 GHz 3-dB bandwidth, 3.50 GHz shot-noise-limited bandwidth, and 90.2 dB common-mode rejection ratio ($\mathrm{CMRR}$). We scale this design to a 32-channel QRX array with median 26.6 dB $\mathrm{SNC}$, and automatic $\mathrm{CMRR}$ correction yielding a median 76.8 dB $\mathrm{CMRR}$ at minimum. Using the integrated QRX and fiber-optic transmitter, we measure $0.15\pm0.01$ dB of squeezing below the shot noise limit, limited by off-chip losses. We propose a squeezed light communication scheme that can surpass the Shannon limit, with a path toward the Holevo limit.

Neural rendering paradigms have recently emerged as powerful tools for radio frequency (RF). However, by entangling RF sources with scene geometry and material properties, existing approaches limit downstream manipulation of scene geometry, wireless system configuration, and RF reasoning. To address this, we propose a physically grounded RF inverse rendering (RFIR) framework that explicitly decouples RF emission, geometry, and material electromagnetic properties. Our key insight is an RF-aware bidirectional scattering distribution function, embedded into the Gaussian splatting paradigm as an RF rendering equation. Each Gaussian primitive is endowed with intrinsic physical attributes, including surface normals, material electromagnetic parameters, and roughness, and leveraged by a customized ray-tracing scheme to represent RF signal synthesis. The proposed RFIR generalizes three typical RF tasks: radar cross-section synthesis, received signal strength indicator prediction, and wireless scene editability. Experiments demonstrate significant performance advantages, underscoring the potential for wireless world modeling.

We provide a detectability analysis for nonlinear large-scale distributed systems in the sense of exponential incremental input/output-to-state stability (i-IOSS). In particular, we prove that the overall system is exponentially i-IOSS if each subsystem is i-IOSS, with interconnections treated as external inputs, and a suitable small-gain condition holds. The analysis is extended to a Lyapunov characterization, resulting in a different quantitative outcome regarding the small-gain condition, which is further analyzed within this work. Moreover, we derive linear matrix inequality conditions posed solely on the local subsystems and their interconnections, which guarantee exponential i-IOSS of the overall distributed system. The results are illustrated on a numerical example.

This paper presents an indirect data-driven output feedback controller synthesis for nonlinear systems, leveraging Structured State-space Models (SSMs) as surrogate models. SSMs have emerged as a compelling alternative in modelling time-series data and dynamical systems. They can capture long-term dependencies while maintaining linear computational complexity with respect to the sequence length, in comparison to the quadratic complexity of Transformer-based architectures. The contributions of this work are threefold. We provide the first analysis of controllability and observability of SSMs, which leads to scalable control design via Linear Matrix Inequalities (LMIs) that leverage contraction theory. Moreover, a separation principle for SSMs is established, enabling the independent design of observers and state-feedback controllers while preserving the exponential stability of the closed-loop system. The effectiveness of the proposed framework is demonstrated through a numerical example, showcasing nonlinear system identification and the synthesis of an output feedback controller.

As future tasks in networked systems are increasingly relying on collaborative execution among distributed devices, trust has become an essential tool for securing both reliable collaborators and task-specific resources. However, the diverse requirements of different tasks, the limited information of task owners on others, and the complex relationships among networked devices pose significant challenges to achieving timely and accurate trust evaluation of potential collaborators for meeting task-specific needs. To address these challenges, this paper proposes Trust-as-a-Service (TaaS), a novel paradigm that encapsulates complex trust mechanisms into a unified, system-wide service. This paradigm enables efficient utilization of distributed trust-related data, need-driven trust evaluation service provision, and task-specific collaborator organization. To realize TaaS, we develop an agentic AI-based framework as the enabling platform by leveraging the Model Context Protocol (MCP). The central server-side agent autonomously performs trust-related operations in accordance with specific task requirements, delivering the trust assessment service to all task owners through a unified interface. Meanwhile, all device-side agents expose their capabilities and resources via MCP servers, allowing devices to be dynamically discovered, evaluated, engaged, and released, thereby forming task-specific collaborative units. Experimental results demonstrate that the proposed TaaS achieves 100\% collaborator selection accuracy, along with high reliability and resource-efficient task completion.

This paper presents TSO-DSO coordinated reactive power dispatch, with a focus on real-time implementation. A sensitivity-aware, mixed-integer linear programming (MILP) formulation is developed to model the IEEE 1547-compliant droop-based control modes Volt VAR (VV), Volt Watt (VW), and Watt VAR (WV) of smart inverters. The algorithm employs a hierarchical optimization strategy using Special Ordered Sets (SOS1) to enhance computational efficiency and supports limited measurement scenarios through Recursive Least Squares (RLS) estimation. The proposed method is tested on the IEEE 13-bus and 123-bus distribution networks, which are connected to a 9-bus transmission system. Results demonstrate the feasibility and effectiveness of the real-time dispatch framework in improving voltage regulation and minimizing power curtailment.

Existing short term voltage stability (STVS) methods typically address either voltage oscillations or delayed voltage recovery; however, the coexistence of both phenomena has not been adequately covered in the literature. Moreover, existing real-time STVS assessment methods often provide only binary stability classifications. This paper proposes novel indices that enable early detection and quantify the degree of stability. The proposed method decomposes post-fault voltage trajectories using Empirical Mode Decomposition (EMD) into residual and oscillatory components. It then employs Lyapunov Exponents (LEs) to characterize the dynamic behavior of each component and evaluates the stability degree using Kullback Leibler (KL) divergence by comparing the LEs of each component with those of a predefined critical signal. The proposed indices assess oscillatory stability significantly faster than the traditional LE method applied directly to the original signal. Specifically, they detect stability within 0.6 seconds after a fault, compared to approximately 10 seconds for the conventional LE approach. In addition, the delayed-recovery index can identify generator trips caused by over-excitation limits within 3 seconds, well before the actual trip occurs at approximately 20 seconds, thereby providing operators and controllers sufficient time to take preventive actions. Furthermore, thresholds are derived to distinguish between stable and unstable cases, offering a graded measure of the stability margin. Simulation studies on the Nordic test system under varying load conditions demonstrate the effectiveness of the proposed indices.

The reconfigurable intelligent surface (RIS) has attracted considerable attention of both academia and industry in recent years, given its capacity to dynamically manipulate the reflection of incident electromagnetic waves. Although the research developed for the RIS may have reached its maturity, there are still contentious aspects and limitations regarding its potential benefits for the next generation of wireless communications. In order to improve upon the the RIS technology, the beyond diagonal reconfigurable intelligent surface (BD-RIS) was recently proposed as an promising alternative. The BD-RIS boasts a more sophisticated circuit topology that is capable of providing more combinations of different adjustments or configurations for signal reflection. However, to aptly reap the benefits of the BD-RIS, the added degrees-of-freedom of its configuration must be leveraged accordingly. Therefore, in this work we propose a depth-first tree search algorithm for configuring the BD-RIS in multi-user multiple-input single-output (MU-MISO) communication systems. Taking advantage of the tree search exploration, the proposed algorithm achieves a remarkable trade-off between channel strength maximization performance and computational complexity scalability.

Time-varying distortions in communication systems can significantly degrade the performance of soft-decision forward error correction. This paper presents a burst-aware (BA) low-density parity-check (LDPC) decoding scheme for channels affected by bursty phase noise. By applying differential coding to a Wiener process with time-varying innovation variance, bursty differential phase noise is obtained. Simulation results demonstrate that, compared to conventional decoding, the BA scheme achieves gains in the signal-to-noise ratio of up to $0.7$~dB at a bit error rate (BER) of $4\cdot10^{-3}$ and more than $1$~dB at a packet error rate (PER) of $1\cdot10^{-2}$. Furthermore, by iterating between channel estimation and \ac{ldpc} decoding, forming the proposed iterative burst-aware (IBA) decoding scheme, the gains increase to $1.4$~dB and more than $3$~dB, respectively. More importantly, the IBA scheme significantly improves robustness to bursty phase noise. Compared with the conventional scheme, the IBA scheme can reduce both \ac{ber} and \ac{per} by up to two orders of magnitude under severe bursty phase noise.

This paper concerns the adaptive control problem for a class of nonlinear stochastic systems in which the state update is given by a nonlinear function of linear dynamics plus additive stochastic noise. Such systems arise in a wide range of applications, including recurrent neural networks, social dynamics, and signal processing. Despite their importance, adaptive control for these systems remains relatively unexplored in the literature. This gap is primarily due to the inherently nonconvex dependence of the system dynamics on unknown parameters, which significantly complicates both controller design and analysis. To address these challenges, we propose an online nonlinear weighted least-squares (WLS)-based parameter estimation algorithm and establish the global strong consistency of the resulting parameter estimates. In contrast to most existing results, our consistency analysis does not rely on restrictive assumptions such as persistent excitation conditions of the trajectory data, making it applicable to stochastic adaptive control settings. Building on the proposed estimator, we further develop an adaptive control algorithm with an attenuating excitation signal that can effectively combine adaptive estimation and feedback control. Finally, we are able to show that the resulting closed-loop system is globally stable and that the system trajectory can track, in a long-run average sense, the reference trajectory generated with the true system parameters. The proposed methods and theoretical results are finally validated through simulations in two nonlinear interaction network applications.

This lecture note addresses the common misconception that the Gaussian distribution always yields the largest Cramér-Rao Bound (CRB). We show that this property only holds under restrictive conditions: specifically, when the mean and covariance parameters are decoupled in the Fisher Information Matrix (FIM), when the parameter of interest lies in the mean vector and when there are no additive nuisance parameters. Beyond this framework, we provide counterexamples demonstrating that non-Gaussian distributions can produce larger CRB.

With 6G evolving towards intelligent network autonomy, artificial intelligence (AI)-native operations are becoming pivotal. Wireless networks continuously generate rich and heterogeneous data, which inherently exhibits spatio-temporal graph structure. However, limited radio resources result in incomplete and noisy network measurements. This challenge is further intensified when a target variable and its strongest correlates are missing over contiguous intervals, forming systemic blind spots. To tackle this issue, we propose RieIF (Knowledge-driven Riemannian Information Flow), a geometry-consistent framework that incorporates knowledge graphs (KGs) for robust spatio-temporal graph signal prediction. For analytical tractability within the Fisher-Rao geometry, we project the input from a Riemannian manifold onto a positive unit hypersphere, where angular similarity is computationally efficient. This projection is implemented via a graph transformer, using the KG as a structural prior to constrain attention and generate a micro stream. Simultaneously, a Long Short-Term Memory (LSTM) model captures temporal dynamics to produce a macro stream. Finally, the micro stream (highlighting geometric shape) and the macro stream (emphasizing signal strength) are adaptively fused through a geometric gating mechanism for signal recovery. Experiments on three wireless datasets show consistent improvements under systemic blind spots, including up to 31% reduction in root mean squared error and up to 3.2 dB gain in recovery signal-to-noise ratio, while maintaining robustness to graph sparsity and measurement noise.

Reliable radar pulse classification is essential in Electromagnetic Warfare for situational awareness and decision support. Deep Neural Networks have shown strong performance in radar pulse and RF emitter recognition; however, on their own they struggle to efficiently learn new pulses and lack mechanisms for expressing predictive confidence. This paper integrates Uncertainty Quantification with Lifelong Learning to address both challenges. The proposed approach is an Evidential Lifelong Classifier (ELC), which models epistemic uncertainty using evidence theory. ELC is evaluated against a Bayesian Lifelong Classifier (BLC), which quantifies uncertainty through Shannon entropy. Both integrate Learn-Prune-Share to enable continual learning of new pulses and uncertainty-based selective prediction to reject unreliable predictions. ELC and BLC are evaluated on 2 synthetic radar and 3 RF fingerprinting datasets. Selective prediction based on evidential uncertainty improves recall by up to 46% at -20 dB SNR on synthetic radar pulse datasets, highlighting its effectiveness at identifying unreliable predictions in low-SNR conditions compared to BLC. These findings demonstrate that evidential uncertainty offers a strong correlation between confidence and correctness, improving the trustworthiness of ELC by allowing it to express ignorance.

Ensuring ciphertext indistinguishability is fundamental to cryptographic security, but empirically validating this property in real implementations and hybrid settings presents practical challenges. The transition to post-quantum cryptography (PQC), with its hybrid constructions combining classical and quantum-resistant primitives, makes empirical validation approaches increasingly valuable. By modeling IND-CPA games as binary classification tasks and training on labeled ciphertext data with BCE loss, we study deep neural network (DNN) distinguishers for ciphertext indistinguishability. We apply this methodology to PQC KEMs. We specifically test the public-key encryption (PKE) schemes used to construct examples such as ML-KEM, BIKE, and HQC. Moreover, a novel extension of this DNN modeling for empirical distinguishability testing of hybrid KEMs is presented. We implement and test this on combinations of PQC KEMs with plain RSA, RSA-OAEP, and plaintext. Finally, methodological generality is illustrated by applying the DNN IND-CPA classification framework to cascade symmetric encryption, where we test combinations of AES-CTR, AES-CBC, AES-ECB, ChaCha20, and DES-ECB. In our experiments on PQC algorithms, KEM combiners, and cascade encryption, no algorithm or combination of algorithms demonstrates a significant advantage (two-sided binomial test, significance level $α= 0.01$), consistent with theoretical guarantees that hybrids including at least one IND-CPA-secure component preserve indistinguishability, and with the absence of exploitable patterns under the considered DNN adversary model. These illustrate the potential of using deep learning as an adaptive, practical, and versatile empirical estimator for indistinguishability in more general IND-CPA settings, allowing data-driven validation of implementations and compositions and complementing the analytical security analysis.

Data centers (DCs) are emerging as large, geographically distributed, controllable loads whose participation in electricity markets can significantly affect grid operation, especially when cloud platforms shift workloads across sites to exploit energy-arbitrage opportunities. This paper analyzes and seeks to mitigate the grid impacts of geographically distributed multi-site DCs under exogenous electricity prices. It develops a detailed job-level scheduling framework for market-driven DCs, formulated as a mixed-integer model that preserves execution logic and captures a unified set of implementable control actions. It also incorporates service-side quality-of-service (QoS) constraints and penalty terms to improve fidelity. Case studies on a modified IEEE 14-bus system, complemented by a more realistic network based on Travis County, Texas, show that purely price-driven scheduling improves economic performance, but also increases voltage-security risk and congestion exposure by inducing localized demand concentration and sharp site-level load variation. To mitigate these effects, this work introduces load-redistribution policies that curb extreme load shifting and support grid operators in managing such conditions.

Many complex systems exhibit interactions that depend not only on pairwise connections, but also group structures and memory effects. To capture such effects, we develop a unified tensor framework for modeling higher-order Markov chains with memory. Our formulation introduces an even-order paired tensor that links folded and unfolded dynamics and characterizes their steady states and convergence. We further show that a Markov chain with memory can be approximated by a low-dimensional nonlinear tensor-based system and then provide a full system analysis. As an application, we define random walks on hypergraphs where memory naturally arises from the hyperedge structure, providing new tools for analyzing higher-order networks with time-dependent effects.

The integration of machine learning tools into telecom networks, has led to two prevailing paradigms, namely, language-based systems, such as Large Language Models (LLMs), and physics-based systems, such as Digital Twins (DTs). While LLM-based approaches enable flexible interaction and automation, they lack explicit representations of network dynamics. DTs, in contrast, offer a high-fidelity network simulation, but remain scenario-specific and are not designed for learning or decision-making under uncertainty. This gap becomes critical for 6G systems, where decisions must take into account the evolving network states, uncertainty, and the cascading effects of control actions across multiple layers. In this article, we introduce the {Telecom World Model}~(TWM) concept, an architecture for learned, action-conditioned, uncertainty-aware modeling of telecom system dynamics. We decompose the problem into two interacting worlds, a controllable system world consisting of operator-configurable settings and an external world that captures propagation, mobility, traffic, and failures. We propose a three-layer architecture, comprising a field world model for spatial environment prediction, a control/dynamics world model for action-conditioned Key Performance Indicator (KPI) trajectory prediction, and a telecom foundation model layer for intent translation and orchestration. We showcase a comparative analysis between existing paradigms, which demonstrates that TWM jointly provides telecom state grounding, fast action-conditioned roll-outs, calibrated uncertainty, multi-timescale dynamics, model-based planning, and LLM-integrated guardrails. Furthermore, we present a proof-of-concept on network slicing to validate the proposed architecture, showing that the full three-layer pipeline outperforms single-world baselines and accurately predicts KPI trajectories.

Correct-by-design synthesis provides a principled framework for establishing formal safety guarantees for stochastic multi-agent systems (MAS). However, conventional approaches based on finite abstractions often incur prohibitive computational costs as the number of agents and the complexity of temporal logic specifications increase. In this work, we study homogeneous stochastic MAS under counting linear temporal logic (cLTL) specifications, and show that the corresponding satisfaction probability admits a structured tensor decomposition via leveraging deterministic finite automata (DFA). Building on this structure, we develop a dual-tree-based value iteration framework that reduces redundant computation in the process of dynamic programming. Numerical results demonstrate the proposed approach's effectiveness and scalability for complex specifications and large-scale MAS.

Dynamic Metasurface Antennas (DMAs) have been recently proposed as a cost- and energy-efficient front-end solution for eXtremely Large (XL) antenna array systems, supporting scalable Analog and Digital (A/D) beamforming while using a reduced number of Radio-Frequency (RF) chains. This array architecture is commonly realized as partially connected hybrid A/D beamformers, in which non-overlapping subarrays are linked to separate RF chains, each attached to a waveguide hosting multiple metamaterials. In this work, we study uplink multi-user communications where each RF chain of an XL DMA receiver is equipped with a $b$-bit resolution Analog-to-Digital Converter (ADC). We cast a Mean Squared Error (MSE) minimization problem for the design of the hybrid A/D combiner aimed at multi-user symbol detection, which is intrinsically non-convex due to the structural constraints imposed by the DMA hardware. By exploiting the Bussgang decomposition and a tractable modeling framework, we propose an efficient joint design of the hybrid A/D combining parameters. Our numerical evaluations showcase that XL DMA receivers can perform highly accurate multi-user symbol detection, revealing attractive trade-offs between hardware complexity and MSE performance.

This paper considers a Fluid Antenna (FA) system comprising a single-antenna transmitter that communicates with a receiver equipped with an FA array with $N$ ports. The transmitter is assumed to deploy any of the modulation schemes: \textit{i}) two-sided $M$-ary amplitude-shift keying, \textit{ii}) $M$-ary phase-shift keying, iii) $M$-ary quadrature-amplitude modulation, and \textit{iv}) binary frequency-shift keying, the channels between its antenna and the receiver ports are subjected to Rayleigh fading, and the receiver chooses the best $K$ out of its $N$ ports for symbol detection. Considering that the receiver combines the signals from the best $K$ ports using maximal-ratio combining, the optimal reception structures for all the considered signaling schemes are obtained. We also present novel exact closed-form expressions for the respective symbol error probabilities (SEPs) of the FA system, as well as asymptotic approximations valid at high signal-to-noise ratios. The presented analysis is corroborated through comparisons with simulation results, showcasing the critical role of various system parameters on the SEP performance.

Understanding surface material properties is crucial for enhancing indoor robot perception and indoor digital twinning. However, not all sensor modalities typically employed for this task are capable of reliably capturing detailed surface material characteristics. By analyzing the reflected RF signal from a mmWave radar sensor, it is possible to extract information about the reflective material and its composition from a certain surface. We introduce a mmWave MIMO FMCW radar-based surface material classifier SMCNet, employing a complex-valued Convolutional Neural Network (CNN) and complex radar IQ signal input for classifying indoor surface materials. While current radar-based material estimation approaches rely on a fixed sensing distance and constrained setups, our approach incorporates a setup with multiple sensing distances. We trained SMCNet using data from three distinct distances and subsequently tested it on these distances, as well as on two more unseen distances. We reached an overall accuracy of 99.12-99.53 % on our test set. Notably, range FFT pre-processing improved accuracy on unknown distances from 25.25 % to 58.81 % without re-training.

Radar sensors operating in the mmWave frequency range face challenges when used as indoor perception and imaging devices, primarily due to noise and multipath signal distortions. These distortions often impair the sensors' ability to accurately perceive and image the indoor environment. Nevertheless, this sensor offers distinct advantages over camera and LiDAR sensors. This encompasses the estimation of object reflectivity, known as radar cross-section (RCS), and the ability to penetrate through objects that are thin or have low reflectivity. This results in a 'through-the-wall' sensing capability. Due to the aforementioned disadvantages, most research in the field of imaging radar tends to exclude indoor areas. We introduce a machine learning-based mmWave MIMO FMCW imaging radar object classifier designed to identify small, hand-sized objects in indoor settings, utilizing only radar IQ samples as input. This system achieves 97-99 % accuracy on our test set and maintains approximately 50 % accuracy even under challenging conditions, such as increased background noise and occlusion of sample objects, without the need for adjusting training or pre-processing. This demonstrates the robustness of our approach and offers insights into what needs to be improved in the future to achieve generalization and very high accuracy even in the presence of significant indoor perturbations.

This paper proposes an original method for estimating the velocity of a target by leveraging the multiband capabilities of modern Integrated Sensing And Communication (ISAC) systems. Traditional Doppler estimation relies on regular sampling rates, but ISAC systems often face irregular packet arrival times because they reuse opportunistic communication traffic. This non-deterministic timing increases the risk of Doppler ambiguity and aliasing, degrading velocity estimation accuracy. To resolve this, we advocate exploiting frequency diversity across multiple carrier frequencies to observe Doppler shifts without imposing restrictions on packet timing or requiring dedicated sensing overhead. A multiband velocity estimation problem is here formulated as a mixed-integer quadratic program by utilizing phase differences from all possible pairwise packet combinations. By integrating at least one unambiguous phase measurement, the system can reconstruct the true target velocity even under sporadic traffic conditions. Simulation results using realistic traffic traces demonstrate that this approach significantly outperforms multiband likelihood-based and single-band algorithms, with accuracy improving as frequency separation between bands and inter-packet time intervals increase. This framework provides a zero-overhead solution for robust velocity estimation in dynamic ISAC environments.

In this paper, we address the problem of computing maximal state-control invariant sets using failing trajectories. We introduce the concept of state-control invariance, which extends control invariance from the state space to the joint state-control space. The maximal state-control invariant (MSCI) set simultaneously encodes the maximal control invariant set (MCI) and, for each state in the MCI, the set of control inputs that preserve invariance. We prove that the state projection of the MSCI is the MCI and the state-dependent sections of the MSCI are the admissible invariance-preserving inputs. Building on this framework, we develop a Failure-Aware Iterative Learning (FAIL) algorithm for deterministic linear time invariant systems with polytopic constraints. The algorithm iteratively updates a constraint set in the state-control space by learning predecessor halfspaces from one-step failing state-input pairs, without knowing the dynamics. For each failure, FAIL learns the violated halfspaces of the predecessor of the constraint set by a regression on failing trajectories. We prove that the learned constraint set converges monotonically to the MSCI. Numerical experiments on a double integrator system validate the proposed approach.

The human auditory system has the ability to selectively focus on key speech elements in an audio stream while giving secondary attention to less relevant areas such as noise or distortion within the background, dynamically adjusting its attention over time. Inspired by the recent success of attention models, this study introduces a dual-path attention module in the bottleneck layer of a concurrent speech enhancement network. Our study proposes an attention-based dual-path RNN (DAT-RNN), which, when combined with the modified complex-valued frequency transformation network (CFTNet), forms the DAT-CFTNet. This attention mechanism allows for precise differentiation between speech and noise in time-frequency (T-F) regions of spectrograms, optimizing both local and global context information processing in the CFTNet. Our experiments suggest that the DAT-CFTNet leads to consistently improved performance over the existing models, including CFTNet and DCCRN, in terms of speech intelligibility and quality. Moreover, the proposed model exhibits superior performance in enhancing speech intelligibility for cochlear implant (CI) recipients, who are known to have severely limited T-F hearing restoration (e.g., >10%) in CI listener studies in noisy settings show the proposed solution is capable of suppressing non-stationary noise, avoiding the musical artifacts often seen in traditional speech enhancement methods. The implementation of the proposed model will be publicly available.

This paper studies probability density evolution for stochastic hybrid systems with reset maps that change the dimension of the continuous state across modes. Existing Frobenius--Perron formulations typically represent reset-induced probability transfer through boundary conditions, which is insufficient when resets map guard sets into the interior or onto lower-dimensional subsets of another mode. We develop a weak-form formulation in which reset-induced transfer is represented by the pushforward of probability flux across the guard, yielding a unified description for such systems. The proposed framework naturally captures both cases: when the reset decreases dimension, the transferred probability appears as an interior source density, whereas when the reset increases dimension, it generally appears as a singular source supported on a lower-dimensional subset. The approach is illustrated using a stochastic hybrid model in which two particles merge into one and later split back into two, demonstrating how dimension-changing resets lead to source terms beyond classical boundary-condition-based formulations.

Self-supervised learning (SSL) has driven impressive advances in speech processing by adopting time-domain prediction objectives, while audio representation learning frameworks operate on time-frequency spectrograms. Models optimized for one paradigm struggle to transfer to the other, highlighting the need for a joint framework. We propose Unified Learning of Transformer Representations for Audio and Speech (ULTRAS), where the masking and predictive modeling is performed over long patches of the data. The model, based on the transformer architecture, encodes spectral-patches of log-mel spectrogram features. The predictive modeling of masked segments is performed on spectral and temporal targets using a combined loss-function, forcing the representations to encode time and frequency traits. Experiments are performed on a variety of speech and audio tasks, where we illustrate that the ULTRAS framework achieves improved performance over other established baselines.

The integration of multimodal sensing and millimeter-wave (mmWave) communications is a key enabler for highly mobile vehicle-to-infrastructure (V2I) networks. However, continuous high-resolution visual sensing incurs prohibitive computational energy, while delayed sensing information worsens beam misalignment. In this paper, we establish a physics-aware multimodel integrated sensing and communication (M-ISAC) framework that quantifies the mathematical trade-off between sensing energy and communication reliability using the semantic age of information (AoI). To address the coupled challenges of temporal AoI evolution and instantaneous non-convex constant modulus constraints, we propose a novel reinforcement learning approach empowered by a heterogeneous mixture-of-experts (RL-H-MoE) architecture. By strictly decoupling the temporal scheduling and spatial phase mapping, the RL-H-MoE avoids prevalent gradient conflicts in multi-task learning. Extensive simulations demonstrate that the proposed architecture achieves an optimal event-triggered sensing policy, significantly minimizing the long-term system cost while guaranteeing ultra-low sensing errors and reliable physical-layer link connectivity.

Wildfires pose an increasing threat to the safety and reliability of power systems, particularly in distribution networks located in fire-prone regions. To mitigate ignition risk from electrical infrastructure, utilities often employ safety power shutoffs, which proactively de-energize high-risk lines during hazardous weather and restore them once conditions improve. While this strategy can result in temporary load loss, it helps prevent equipment damage and wildfire ignition development in the system. In this paper, we develop a state-based decision-making framework to optimize such switching actions over time, with the goal of minimizing total operational costs throughout a wildfire event. The model represents network topologies as Markov states, with transitions influenced by both exogenous weather conditions and endogenous power flow dynamics. To address the computational challenges posed by the large state and action spaces, we propose an approximate dynamic programming algorithm based on post-decision states. The effectiveness and scalability of the proposed approach are demonstrated through case studies on 54-bus and 138-bus distribution systems, showcasing its potential for enhancing wildfire resilience across different grid configurations.